|
@@ -103,7 +103,6 @@ struct bitstr {
|
|
|
#define INC_BIT(bs) if((++(bs)->bit)>7){(bs)->cur++;(bs)->bit=0;}
|
|
|
#define INC_BITS(bs,b) if(((bs)->bit+=(b))>7){(bs)->cur+=(bs)->bit>>3;(bs)->bit&=7;}
|
|
|
#define BYTE_ALIGN(bs) if((bs)->bit){(bs)->cur++;(bs)->bit=0;}
|
|
|
-#define CHECK_BOUND(bs,n) if((bs)->cur+(n)>(bs)->end)return(H323_ERROR_BOUND)
|
|
|
static unsigned int get_len(struct bitstr *bs);
|
|
|
static unsigned int get_bit(struct bitstr *bs);
|
|
|
static unsigned int get_bits(struct bitstr *bs, unsigned int b);
|
|
@@ -165,6 +164,19 @@ static unsigned int get_len(struct bitstr *bs)
|
|
|
return v;
|
|
|
}
|
|
|
|
|
|
+static int nf_h323_error_boundary(struct bitstr *bs, size_t bytes, size_t bits)
|
|
|
+{
|
|
|
+ bits += bs->bit;
|
|
|
+ bytes += bits / BITS_PER_BYTE;
|
|
|
+ if (bits % BITS_PER_BYTE > 0)
|
|
|
+ bytes++;
|
|
|
+
|
|
|
+ if (*bs->cur + bytes > *bs->end)
|
|
|
+ return 1;
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
/****************************************************************************/
|
|
|
static unsigned int get_bit(struct bitstr *bs)
|
|
|
{
|
|
@@ -279,8 +291,8 @@ static int decode_bool(struct bitstr *bs, const struct field_t *f,
|
|
|
PRINT("%*.s%s\n", level * TAB_SIZE, " ", f->name);
|
|
|
|
|
|
INC_BIT(bs);
|
|
|
-
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -293,11 +305,14 @@ static int decode_oid(struct bitstr *bs, const struct field_t *f,
|
|
|
PRINT("%*.s%s\n", level * TAB_SIZE, " ", f->name);
|
|
|
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 1);
|
|
|
+ if (nf_h323_error_boundary(bs, 1, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
+
|
|
|
len = *bs->cur++;
|
|
|
bs->cur += len;
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -319,6 +334,8 @@ static int decode_int(struct bitstr *bs, const struct field_t *f,
|
|
|
bs->cur += 2;
|
|
|
break;
|
|
|
case CONS: /* 64K < Range < 4G */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 2))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_bits(bs, 2) + 1;
|
|
|
BYTE_ALIGN(bs);
|
|
|
if (base && (f->attr & DECODE)) { /* timeToLive */
|
|
@@ -330,7 +347,8 @@ static int decode_int(struct bitstr *bs, const struct field_t *f,
|
|
|
break;
|
|
|
case UNCO:
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
bs->cur += len;
|
|
|
break;
|
|
@@ -341,7 +359,8 @@ static int decode_int(struct bitstr *bs, const struct field_t *f,
|
|
|
|
|
|
PRINT("\n");
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -357,7 +376,8 @@ static int decode_enum(struct bitstr *bs, const struct field_t *f,
|
|
|
INC_BITS(bs, f->sz);
|
|
|
}
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -375,12 +395,14 @@ static int decode_bitstr(struct bitstr *bs, const struct field_t *f,
|
|
|
len = f->lb;
|
|
|
break;
|
|
|
case WORD: /* 2-byte length */
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = (*bs->cur++) << 8;
|
|
|
len += (*bs->cur++) + f->lb;
|
|
|
break;
|
|
|
case SEMI:
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
break;
|
|
|
default:
|
|
@@ -391,7 +413,8 @@ static int decode_bitstr(struct bitstr *bs, const struct field_t *f,
|
|
|
bs->cur += len >> 3;
|
|
|
bs->bit = len & 7;
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -404,12 +427,15 @@ static int decode_numstr(struct bitstr *bs, const struct field_t *f,
|
|
|
PRINT("%*.s%s\n", level * TAB_SIZE, " ", f->name);
|
|
|
|
|
|
/* 2 <= Range <= 255 */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, f->sz))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_bits(bs, f->sz) + f->lb;
|
|
|
|
|
|
BYTE_ALIGN(bs);
|
|
|
INC_BITS(bs, (len << 2));
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -440,15 +466,19 @@ static int decode_octstr(struct bitstr *bs, const struct field_t *f,
|
|
|
break;
|
|
|
case BYTE: /* Range == 256 */
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 1);
|
|
|
+ if (nf_h323_error_boundary(bs, 1, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = (*bs->cur++) + f->lb;
|
|
|
break;
|
|
|
case SEMI:
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs) + f->lb;
|
|
|
break;
|
|
|
default: /* 2 <= Range <= 255 */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, f->sz))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_bits(bs, f->sz) + f->lb;
|
|
|
BYTE_ALIGN(bs);
|
|
|
break;
|
|
@@ -458,7 +488,8 @@ static int decode_octstr(struct bitstr *bs, const struct field_t *f,
|
|
|
|
|
|
PRINT("\n");
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -473,10 +504,13 @@ static int decode_bmpstr(struct bitstr *bs, const struct field_t *f,
|
|
|
switch (f->sz) {
|
|
|
case BYTE: /* Range == 256 */
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 1);
|
|
|
+ if (nf_h323_error_boundary(bs, 1, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = (*bs->cur++) + f->lb;
|
|
|
break;
|
|
|
default: /* 2 <= Range <= 255 */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, f->sz))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_bits(bs, f->sz) + f->lb;
|
|
|
BYTE_ALIGN(bs);
|
|
|
break;
|
|
@@ -484,7 +518,8 @@ static int decode_bmpstr(struct bitstr *bs, const struct field_t *f,
|
|
|
|
|
|
bs->cur += len << 1;
|
|
|
|
|
|
- CHECK_BOUND(bs, 0);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
|
|
|
@@ -503,9 +538,13 @@ static int decode_seq(struct bitstr *bs, const struct field_t *f,
|
|
|
base = (base && (f->attr & DECODE)) ? base + f->offset : NULL;
|
|
|
|
|
|
/* Extensible? */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 1))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
ext = (f->attr & EXT) ? get_bit(bs) : 0;
|
|
|
|
|
|
/* Get fields bitmap */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, f->sz))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
bmp = get_bitmap(bs, f->sz);
|
|
|
if (base)
|
|
|
*(unsigned int *)base = bmp;
|
|
@@ -525,9 +564,11 @@ static int decode_seq(struct bitstr *bs, const struct field_t *f,
|
|
|
|
|
|
/* Decode */
|
|
|
if (son->attr & OPEN) { /* Open field */
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
- CHECK_BOUND(bs, len);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
if (!base || !(son->attr & DECODE)) {
|
|
|
PRINT("%*.s%s\n", (level + 1) * TAB_SIZE,
|
|
|
" ", son->name);
|
|
@@ -555,8 +596,11 @@ static int decode_seq(struct bitstr *bs, const struct field_t *f,
|
|
|
return H323_ERROR_NONE;
|
|
|
|
|
|
/* Get the extension bitmap */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 7))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
bmp2_len = get_bits(bs, 7) + 1;
|
|
|
- CHECK_BOUND(bs, (bmp2_len + 7) >> 3);
|
|
|
+ if (nf_h323_error_boundary(bs, 0, bmp2_len))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
bmp2 = get_bitmap(bs, bmp2_len);
|
|
|
bmp |= bmp2 >> f->sz;
|
|
|
if (base)
|
|
@@ -567,9 +611,11 @@ static int decode_seq(struct bitstr *bs, const struct field_t *f,
|
|
|
for (opt = 0; opt < bmp2_len; opt++, i++, son++) {
|
|
|
/* Check Range */
|
|
|
if (i >= f->ub) { /* Newer Version? */
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
- CHECK_BOUND(bs, len);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
bs->cur += len;
|
|
|
continue;
|
|
|
}
|
|
@@ -583,9 +629,11 @@ static int decode_seq(struct bitstr *bs, const struct field_t *f,
|
|
|
if (!((0x80000000 >> opt) & bmp2)) /* Not present */
|
|
|
continue;
|
|
|
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
- CHECK_BOUND(bs, len);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
if (!base || !(son->attr & DECODE)) {
|
|
|
PRINT("%*.s%s\n", (level + 1) * TAB_SIZE, " ",
|
|
|
son->name);
|
|
@@ -623,22 +671,27 @@ static int decode_seqof(struct bitstr *bs, const struct field_t *f,
|
|
|
switch (f->sz) {
|
|
|
case BYTE:
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 1);
|
|
|
+ if (nf_h323_error_boundary(bs, 1, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
count = *bs->cur++;
|
|
|
break;
|
|
|
case WORD:
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
count = *bs->cur++;
|
|
|
count <<= 8;
|
|
|
count += *bs->cur++;
|
|
|
break;
|
|
|
case SEMI:
|
|
|
BYTE_ALIGN(bs);
|
|
|
- CHECK_BOUND(bs, 2);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
count = get_len(bs);
|
|
|
break;
|
|
|
default:
|
|
|
+ if (nf_h323_error_boundary(bs, 0, f->sz))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
count = get_bits(bs, f->sz);
|
|
|
break;
|
|
|
}
|
|
@@ -658,8 +711,11 @@ static int decode_seqof(struct bitstr *bs, const struct field_t *f,
|
|
|
for (i = 0; i < count; i++) {
|
|
|
if (son->attr & OPEN) {
|
|
|
BYTE_ALIGN(bs);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
- CHECK_BOUND(bs, len);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
if (!base || !(son->attr & DECODE)) {
|
|
|
PRINT("%*.s%s\n", (level + 1) * TAB_SIZE,
|
|
|
" ", son->name);
|
|
@@ -710,11 +766,17 @@ static int decode_choice(struct bitstr *bs, const struct field_t *f,
|
|
|
base = (base && (f->attr & DECODE)) ? base + f->offset : NULL;
|
|
|
|
|
|
/* Decode the choice index number */
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 1))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
if ((f->attr & EXT) && get_bit(bs)) {
|
|
|
ext = 1;
|
|
|
+ if (nf_h323_error_boundary(bs, 0, 7))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
type = get_bits(bs, 7) + f->lb;
|
|
|
} else {
|
|
|
ext = 0;
|
|
|
+ if (nf_h323_error_boundary(bs, 0, f->sz))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
type = get_bits(bs, f->sz);
|
|
|
if (type >= f->lb)
|
|
|
return H323_ERROR_RANGE;
|
|
@@ -727,8 +789,11 @@ static int decode_choice(struct bitstr *bs, const struct field_t *f,
|
|
|
/* Check Range */
|
|
|
if (type >= f->ub) { /* Newer version? */
|
|
|
BYTE_ALIGN(bs);
|
|
|
+ if (nf_h323_error_boundary(bs, 2, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
- CHECK_BOUND(bs, len);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
bs->cur += len;
|
|
|
return H323_ERROR_NONE;
|
|
|
}
|
|
@@ -742,8 +807,11 @@ static int decode_choice(struct bitstr *bs, const struct field_t *f,
|
|
|
|
|
|
if (ext || (son->attr & OPEN)) {
|
|
|
BYTE_ALIGN(bs);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
len = get_len(bs);
|
|
|
- CHECK_BOUND(bs, len);
|
|
|
+ if (nf_h323_error_boundary(bs, len, 0))
|
|
|
+ return H323_ERROR_BOUND;
|
|
|
if (!base || !(son->attr & DECODE)) {
|
|
|
PRINT("%*.s%s\n", (level + 1) * TAB_SIZE, " ",
|
|
|
son->name);
|