version 1.101, 2004/09/04 02:54:28
|
version 1.101.2.6, 2008/02/11 23:24:11
|
Line 1
|
Line 1
|
/* decode.c - ber input decoding routines */ |
/* decode.c - ber input decoding routines */ |
/* $OpenLDAP: pkg/ldap/libraries/liblber/decode.c,v 1.100 2004/01/01 18:15:25 kurt Exp $ */ |
/* $OpenLDAP: pkg/ldap/libraries/liblber/decode.c,v 1.101.2.5 2007/08/27 10:11:31 hyc Exp $ */ |
/* This work is part of OpenLDAP Software <http://www.openldap.org/>. |
/* This work is part of OpenLDAP Software <http://www.openldap.org/>. |
* |
* |
* Copyright 1998-2004 The OpenLDAP Foundation. |
* Copyright 1998-2008 The OpenLDAP Foundation. |
* All rights reserved. |
* All rights reserved. |
* |
* |
* Redistribution and use in source and binary forms, with or without |
* Redistribution and use in source and binary forms, with or without |
Line 373 ber_get_stringbvl( bgbvr *b, ber_len_t *
|
Line 373 ber_get_stringbvl( bgbvr *b, ber_len_t *
|
case BvOff: |
case BvOff: |
*b->res.ba = ber_memalloc_x( (n+1) * b->siz, b->ber->ber_memctx ); |
*b->res.ba = ber_memalloc_x( (n+1) * b->siz, b->ber->ber_memctx ); |
if ( *b->res.ba == NULL ) return LBER_DEFAULT; |
if ( *b->res.ba == NULL ) return LBER_DEFAULT; |
((struct berval *)((long)(*b->res.ba) + n*b->siz + |
((struct berval *)((char *)(*b->res.ba) + n*b->siz + |
b->off))->bv_val = NULL; |
b->off))->bv_val = NULL; |
break; |
break; |
} |
} |
Line 406 ber_get_stringbvl( bgbvr *b, ber_len_t *
|
Line 406 ber_get_stringbvl( bgbvr *b, ber_len_t *
|
*bvp = bv; |
*bvp = bv; |
break; |
break; |
case BvOff: |
case BvOff: |
*(BerVarray)((long)(*b->res.ba)+n*b->siz+b->off) = bv; |
*(BerVarray)((char *)(*b->res.ba)+n*b->siz+b->off) = bv; |
break; |
break; |
} |
} |
} |
} |
Line 479 ber_get_stringbv( BerElement *ber, struc
|
Line 479 ber_get_stringbv( BerElement *ber, struc
|
return tag; |
return tag; |
} |
} |
|
|
|
#ifdef LDAP_NULL_IS_NULL |
|
ber_tag_t |
|
ber_get_stringbv_null( BerElement *ber, struct berval *bv, int alloc ) |
|
{ |
|
ber_tag_t tag; |
|
|
|
assert( ber != NULL ); |
|
assert( bv != NULL ); |
|
|
|
assert( LBER_VALID( ber ) ); |
|
|
|
if ( (tag = ber_skip_tag( ber, &bv->bv_len )) == LBER_DEFAULT ) { |
|
bv->bv_val = NULL; |
|
return LBER_DEFAULT; |
|
} |
|
|
|
if ( (ber_len_t) ber_pvt_ber_remaining( ber ) < bv->bv_len ) { |
|
return LBER_DEFAULT; |
|
} |
|
|
|
if ( bv->bv_len == 0 ) { |
|
bv->bv_val = NULL; |
|
ber->ber_tag = *(unsigned char *)ber->ber_ptr; |
|
return tag; |
|
} |
|
|
|
if ( alloc ) { |
|
bv->bv_val = (char *) ber_memalloc_x( bv->bv_len + 1, |
|
ber->ber_memctx ); |
|
if ( bv->bv_val == NULL ) { |
|
return LBER_DEFAULT; |
|
} |
|
|
|
if ( bv->bv_len > 0 && (ber_len_t) ber_read( ber, bv->bv_val, |
|
bv->bv_len ) != bv->bv_len ) |
|
{ |
|
LBER_FREE( bv->bv_val ); |
|
bv->bv_val = NULL; |
|
return LBER_DEFAULT; |
|
} |
|
} else { |
|
bv->bv_val = ber->ber_ptr; |
|
ber->ber_ptr += bv->bv_len; |
|
} |
|
ber->ber_tag = *(unsigned char *)ber->ber_ptr; |
|
bv->bv_val[bv->bv_len] = '\0'; |
|
|
|
return tag; |
|
} |
|
#endif /* LDAP_NULL_IS_NULL */ |
|
|
ber_tag_t |
ber_tag_t |
ber_get_stringa( BerElement *ber, char **buf ) |
ber_get_stringa( BerElement *ber, char **buf ) |
{ |
{ |
Line 493 ber_get_stringa( BerElement *ber, char *
|
Line 544 ber_get_stringa( BerElement *ber, char *
|
return tag; |
return tag; |
} |
} |
|
|
|
#ifdef LDAP_NULL_IS_NULL |
|
ber_tag_t |
|
ber_get_stringa_null( BerElement *ber, char **buf ) |
|
{ |
|
BerValue bv; |
|
ber_tag_t tag; |
|
|
|
assert( buf != NULL ); |
|
|
|
tag = ber_get_stringbv_null( ber, &bv, 1 ); |
|
*buf = bv.bv_val; |
|
|
|
return tag; |
|
} |
|
#endif /* LDAP_NULL_IS_NULL */ |
|
|
ber_tag_t |
ber_tag_t |
ber_get_stringal( BerElement *ber, struct berval **bv ) |
ber_get_stringal( BerElement *ber, struct berval **bv ) |
{ |
{ |
Line 692 ber_scanf ( BerElement *ber,
|
Line 759 ber_scanf ( BerElement *ber,
|
rc = ber_get_stringa( ber, ss ); |
rc = ber_get_stringa( ber, ss ); |
break; |
break; |
|
|
|
#ifdef LDAP_NULL_IS_NULL |
|
case 'A': /* octet string - allocate storage as needed, |
|
* but return NULL if len == 0 */ |
|
ss = va_arg( ap, char ** ); |
|
rc = ber_get_stringa_null( ber, ss ); |
|
break; |
|
#endif /* LDAP_NULL_IS_NULL */ |
|
|
case 'b': /* boolean */ |
case 'b': /* boolean */ |
i = va_arg( ap, ber_int_t * ); |
i = va_arg( ap, ber_int_t * ); |
rc = ber_get_boolean( ber, i ); |
rc = ber_get_boolean( ber, i ); |
break; |
break; |
|
|
|
case 'B': /* bit string - allocate storage as needed */ |
|
ss = va_arg( ap, char ** ); |
|
l = va_arg( ap, ber_len_t * ); /* for length, in bits */ |
|
rc = ber_get_bitstringa( ber, ss, l ); |
|
break; |
|
|
case 'e': /* enumerated */ |
case 'e': /* enumerated */ |
case 'i': /* int */ |
case 'i': /* int */ |
i = va_arg( ap, ber_int_t * ); |
i = va_arg( ap, ber_int_t * ); |
Line 708 ber_scanf ( BerElement *ber,
|
Line 789 ber_scanf ( BerElement *ber,
|
rc = ber_peek_tag( ber, l ); |
rc = ber_peek_tag( ber, l ); |
break; |
break; |
|
|
case 'n': /* null */ |
case 'm': /* octet string in berval, in-place */ |
rc = ber_get_null( ber ); |
bval = va_arg( ap, struct berval * ); |
|
rc = ber_get_stringbv( ber, bval, 0 ); |
break; |
break; |
|
|
case 's': /* octet string - in a buffer */ |
case 'M': /* bvoffarray - must include address of |
s = va_arg( ap, char * ); |
* a record len, and record offset. |
|
* number of records will be returned thru |
|
* len ptr on finish. parsed in-place. |
|
*/ |
|
{ |
|
bgbvr cookie = { BvOff }; |
|
cookie.ber = ber; |
|
cookie.res.ba = va_arg( ap, struct berval ** ); |
|
cookie.alloc = 0; |
l = va_arg( ap, ber_len_t * ); |
l = va_arg( ap, ber_len_t * ); |
rc = ber_get_stringb( ber, s, l ); |
cookie.siz = *l; |
|
cookie.off = va_arg( ap, ber_len_t ); |
|
rc = ber_get_stringbvl( &cookie, l ); |
break; |
break; |
|
} |
|
|
case 'm': /* octet string in berval, in-place */ |
case 'n': /* null */ |
bval = va_arg( ap, struct berval * ); |
rc = ber_get_null( ber ); |
rc = ber_get_stringbv( ber, bval, 0 ); |
|
break; |
break; |
|
|
case 'o': /* octet string in a supplied berval */ |
case 'o': /* octet string in a supplied berval */ |
Line 733 ber_scanf ( BerElement *ber,
|
Line 825 ber_scanf ( BerElement *ber,
|
rc = ber_get_stringal( ber, bvp ); |
rc = ber_get_stringal( ber, bvp ); |
break; |
break; |
|
|
case 'B': /* bit string - allocate storage as needed */ |
case 's': /* octet string - in a buffer */ |
ss = va_arg( ap, char ** ); |
s = va_arg( ap, char * ); |
l = va_arg( ap, ber_len_t * ); /* for length, in bits */ |
l = va_arg( ap, ber_len_t * ); |
rc = ber_get_bitstringa( ber, ss, l ); |
rc = ber_get_stringb( ber, s, l ); |
break; |
break; |
|
|
case 't': /* tag of next item */ |
case 't': /* tag of next item */ |
Line 779 ber_scanf ( BerElement *ber,
|
Line 871 ber_scanf ( BerElement *ber,
|
break; |
break; |
} |
} |
|
|
case 'M': /* bvoffarray - must include address of |
|
* a record len, and record offset. |
|
* number of records will be returned thru |
|
* len ptr on finish. parsed in-place. |
|
*/ |
|
{ |
|
bgbvr cookie = { BvOff }; |
|
cookie.ber = ber; |
|
cookie.res.ba = va_arg( ap, struct berval ** ); |
|
cookie.alloc = 0; |
|
l = va_arg( ap, ber_len_t * ); |
|
cookie.siz = *l; |
|
cookie.off = va_arg( ap, ber_len_t ); |
|
rc = ber_get_stringbvl( &cookie, l ); |
|
break; |
|
} |
|
|
|
case 'x': /* skip the next element - whatever it is */ |
case 'x': /* skip the next element - whatever it is */ |
if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
break; |
break; |
Line 845 ber_scanf ( BerElement *ber,
|
Line 920 ber_scanf ( BerElement *ber,
|
} break; |
} break; |
|
|
case 'a': /* octet string - allocate storage as needed */ |
case 'a': /* octet string - allocate storage as needed */ |
|
#ifdef LDAP_NULL_IS_NULL |
|
case 'A': |
|
#endif /* LDAP_NULL_IS_NULL */ |
ss = va_arg( ap, char ** ); |
ss = va_arg( ap, char ** ); |
if ( *ss ) { |
if ( *ss ) { |
LBER_FREE( *ss ); |
LBER_FREE( *ss ); |
Line 858 ber_scanf ( BerElement *ber,
|
Line 936 ber_scanf ( BerElement *ber,
|
(void) va_arg( ap, int * ); |
(void) va_arg( ap, int * ); |
break; |
break; |
|
|
case 's': /* octet string - in a buffer */ |
|
(void) va_arg( ap, char * ); |
|
(void) va_arg( ap, ber_len_t * ); |
|
break; |
|
|
|
case 'l': /* length of next item */ |
case 'l': /* length of next item */ |
(void) va_arg( ap, ber_len_t * ); |
(void) va_arg( ap, ber_len_t * ); |
break; |
break; |
|
|
case 't': /* tag of next item */ |
|
case 'T': /* skip tag of next item */ |
|
(void) va_arg( ap, ber_tag_t * ); |
|
break; |
|
|
|
case 'o': /* octet string in a supplied berval */ |
case 'o': /* octet string in a supplied berval */ |
bval = va_arg( ap, struct berval * ); |
bval = va_arg( ap, struct berval * ); |
if ( bval->bv_val != NULL ) { |
if ( bval->bv_val != NULL ) { |
Line 889 ber_scanf ( BerElement *ber,
|
Line 957 ber_scanf ( BerElement *ber,
|
} |
} |
break; |
break; |
|
|
|
case 's': /* octet string - in a buffer */ |
|
(void) va_arg( ap, char * ); |
|
(void) va_arg( ap, ber_len_t * ); |
|
break; |
|
|
|
case 't': /* tag of next item */ |
|
case 'T': /* skip tag of next item */ |
|
(void) va_arg( ap, ber_tag_t * ); |
|
break; |
|
|
case 'B': /* bit string - allocate storage as needed */ |
case 'B': /* bit string - allocate storage as needed */ |
ss = va_arg( ap, char ** ); |
ss = va_arg( ap, char ** ); |
if ( *ss ) { |
if ( *ss ) { |
Line 898 ber_scanf ( BerElement *ber,
|
Line 976 ber_scanf ( BerElement *ber,
|
*(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */ |
*(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */ |
break; |
break; |
|
|
case 'v': /* sequence of strings */ |
|
case 'V': /* sequence of strings + lengths */ |
|
case 'W': /* BerVarray */ |
|
case 'm': /* berval in-place */ |
case 'm': /* berval in-place */ |
case 'M': /* BVoff array in-place */ |
case 'M': /* BVoff array in-place */ |
case 'n': /* null */ |
case 'n': /* null */ |
|
case 'v': /* sequence of strings */ |
|
case 'V': /* sequence of strings + lengths */ |
|
case 'W': /* BerVarray */ |
case 'x': /* skip the next element - whatever it is */ |
case 'x': /* skip the next element - whatever it is */ |
case '{': /* begin sequence */ |
case '{': /* begin sequence */ |
case '[': /* begin set */ |
case '[': /* begin set */ |