|
|
|
@ -1,7 +1,7 @@
|
|
|
|
|
/*
|
|
|
|
|
* ber_decoder.c
|
|
|
|
|
*
|
|
|
|
|
* Copyright 2013-2022 Michael Zillgith
|
|
|
|
|
* Copyright 2013-2025 Michael Zillgith
|
|
|
|
|
*
|
|
|
|
|
* This file is part of libIEC61850.
|
|
|
|
|
*
|
|
|
|
@ -37,14 +37,18 @@ getIndefiniteLength(uint8_t* buffer, int bufPos, int maxBufPos, int depth, int m
|
|
|
|
|
|
|
|
|
|
int length = 0;
|
|
|
|
|
|
|
|
|
|
while (bufPos < maxBufPos) {
|
|
|
|
|
if ((buffer[bufPos] == 0) && ((bufPos + 1) < maxBufPos) && (buffer[bufPos+1] == 0)) {
|
|
|
|
|
while (bufPos < maxBufPos)
|
|
|
|
|
{
|
|
|
|
|
if ((buffer[bufPos] == 0) && ((bufPos + 1) < maxBufPos) && (buffer[bufPos + 1] == 0))
|
|
|
|
|
{
|
|
|
|
|
return length + 2;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
length++;
|
|
|
|
|
|
|
|
|
|
if ((buffer[bufPos++] & 0x1f) == 0x1f) {
|
|
|
|
|
if ((buffer[bufPos++] & 0x1f) == 0x1f)
|
|
|
|
|
{
|
|
|
|
|
/* handle extended tags */
|
|
|
|
|
bufPos++;
|
|
|
|
|
length++;
|
|
|
|
@ -74,17 +78,21 @@ BerDecoder_decodeLengthRecursive(uint8_t* buffer, int* length, int bufPos, int m
|
|
|
|
|
|
|
|
|
|
uint8_t len1 = buffer[bufPos++];
|
|
|
|
|
|
|
|
|
|
if (len1 & 0x80) {
|
|
|
|
|
if (len1 & 0x80)
|
|
|
|
|
{
|
|
|
|
|
int lenLength = len1 & 0x7f;
|
|
|
|
|
|
|
|
|
|
if (lenLength == 0) { /* indefinite length form */
|
|
|
|
|
if (lenLength == 0)
|
|
|
|
|
{ /* indefinite length form */
|
|
|
|
|
*length = getIndefiniteLength(buffer, bufPos, maxBufPos, depth, maxDepth);
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
*length = 0;
|
|
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
for (i = 0; i < lenLength; i++) {
|
|
|
|
|
for (i = 0; i < lenLength; i++)
|
|
|
|
|
{
|
|
|
|
|
if (bufPos >= maxBufPos)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
@ -95,18 +103,15 @@ BerDecoder_decodeLengthRecursive(uint8_t* buffer, int* length, int bufPos, int m
|
|
|
|
|
*length += buffer[bufPos++];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
*length = len1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (*length < 0)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
if (*length > maxBufPos)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
if (bufPos + (*length) > maxBufPos)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
@ -126,8 +131,12 @@ BerDecoder_decodeString(uint8_t* buffer, int strlen, int bufPos, int maxBufPos)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
char* string = (char*) GLOBAL_MALLOC(strlen + 1);
|
|
|
|
|
memcpy(string, buffer + bufPos, strlen);
|
|
|
|
|
string[strlen] = 0;
|
|
|
|
|
|
|
|
|
|
if (string)
|
|
|
|
|
{
|
|
|
|
|
memcpy(string, buffer + bufPos, strlen);
|
|
|
|
|
string[strlen] = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return string;
|
|
|
|
|
}
|
|
|
|
@ -138,7 +147,8 @@ BerDecoder_decodeUint32(uint8_t* buffer, int intLen, int bufPos)
|
|
|
|
|
uint32_t value = 0;
|
|
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
for (i = 0; i < intLen; i++) {
|
|
|
|
|
for (i = 0; i < intLen; i++)
|
|
|
|
|
{
|
|
|
|
|
value <<= 8;
|
|
|
|
|
value += buffer[bufPos + i];
|
|
|
|
|
}
|
|
|
|
@ -159,7 +169,8 @@ BerDecoder_decodeInt32(uint8_t* buffer, int intlen, int bufPos)
|
|
|
|
|
else
|
|
|
|
|
value = 0;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < intlen; i++) {
|
|
|
|
|
for (i = 0; i < intlen; i++)
|
|
|
|
|
{
|
|
|
|
|
value <<= 8;
|
|
|
|
|
value += buffer[bufPos + i];
|
|
|
|
|
}
|
|
|
|
@ -171,18 +182,20 @@ float
|
|
|
|
|
BerDecoder_decodeFloat(uint8_t* buffer, int bufPos)
|
|
|
|
|
{
|
|
|
|
|
float value;
|
|
|
|
|
uint8_t* valueBuf = (uint8_t*) &value;
|
|
|
|
|
uint8_t* valueBuf = (uint8_t*)&value;
|
|
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
bufPos += 1; /* skip exponentWidth field */
|
|
|
|
|
|
|
|
|
|
#if (ORDER_LITTLE_ENDIAN == 1)
|
|
|
|
|
for (i = 3; i >= 0; i--) {
|
|
|
|
|
for (i = 3; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
valueBuf[i] = buffer[bufPos++];
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
for (i = 0; i < 4; i++) {
|
|
|
|
|
for (i = 0; i < 4; i++)
|
|
|
|
|
{
|
|
|
|
|
valueBuf[i] = buffer[bufPos++];
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
@ -194,18 +207,20 @@ double
|
|
|
|
|
BerDecoder_decodeDouble(uint8_t* buffer, int bufPos)
|
|
|
|
|
{
|
|
|
|
|
double value;
|
|
|
|
|
uint8_t* valueBuf = (uint8_t*) &value;
|
|
|
|
|
uint8_t* valueBuf = (uint8_t*)&value;
|
|
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
bufPos += 1; /* skip exponentWidth field */
|
|
|
|
|
|
|
|
|
|
#if (ORDER_LITTLE_ENDIAN == 1)
|
|
|
|
|
for (i = 7; i >= 0; i--) {
|
|
|
|
|
for (i = 7; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
valueBuf[i] = buffer[bufPos++];
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
|
for (i = 0; i < 8; i++)
|
|
|
|
|
{
|
|
|
|
|
valueBuf[i] = buffer[bufPos++];
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
@ -214,7 +229,8 @@ BerDecoder_decodeDouble(uint8_t* buffer, int bufPos)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
BerDecoder_decodeBoolean(uint8_t* buffer, int bufPos) {
|
|
|
|
|
BerDecoder_decodeBoolean(uint8_t* buffer, int bufPos)
|
|
|
|
|
{
|
|
|
|
|
if (buffer[bufPos] != 0)
|
|
|
|
|
return true;
|
|
|
|
|
else
|
|
|
|
@ -233,7 +249,8 @@ BerDecoder_decodeOID(uint8_t* buffer, int bufPos, int length, ItuObjectIdentifie
|
|
|
|
|
oid->arc[i] = 0;
|
|
|
|
|
|
|
|
|
|
/* parse first two arcs */
|
|
|
|
|
if (length > 0) {
|
|
|
|
|
if (length > 0)
|
|
|
|
|
{
|
|
|
|
|
oid->arc[0] = buffer[bufPos] / 40;
|
|
|
|
|
oid->arc[1] = buffer[bufPos] % 40;
|
|
|
|
|
|
|
|
|
@ -242,8 +259,9 @@ BerDecoder_decodeOID(uint8_t* buffer, int bufPos, int length, ItuObjectIdentifie
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* parse remaining arcs */
|
|
|
|
|
while ((bufPos - startPos < length) && (currentArc < 10)) {
|
|
|
|
|
oid->arc[currentArc] = oid->arc[currentArc]<<7;
|
|
|
|
|
while ((bufPos - startPos < length) && (currentArc < 10))
|
|
|
|
|
{
|
|
|
|
|
oid->arc[currentArc] = oid->arc[currentArc] << 7;
|
|
|
|
|
|
|
|
|
|
if (buffer[bufPos] < 0x80)
|
|
|
|
|
oid->arc[currentArc++] += buffer[bufPos];
|
|
|
|
|