version 1.9, 1998/11/06 00:18:49
|
version 1.36, 1999/08/01 23:50:08
|
Line 1
|
Line 1
|
/* decode.c - ber input decoding routines */ |
/* decode.c - ber input decoding routines */ |
/* |
/* |
|
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved. |
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file |
|
*/ |
|
/* Portions |
* Copyright (c) 1990 Regents of the University of Michigan. |
* Copyright (c) 1990 Regents of the University of Michigan. |
* All rights reserved. |
* All rights reserved. |
* |
* |
Line 15
|
Line 19
|
|
|
#include <stdio.h> |
#include <stdio.h> |
|
|
#ifdef STDC_HEADERS |
#include <ac/stdlib.h> |
#include <stdlib.h> |
|
#endif |
|
|
|
#include <ac/stdarg.h> |
#include <ac/stdarg.h> |
|
|
#include <ac/string.h> |
#include <ac/string.h> |
#include <ac/socket.h> |
#include <ac/socket.h> |
|
|
#include "lber-int.h" |
#undef LDAP_F_PRE |
|
#define LDAP_F_PRE LDAP_F_EXPORT |
|
|
#ifdef LDAP_DEBUG |
#include "lber-int.h" |
int lber_debug; |
|
#endif |
|
|
|
static int ber_getnint LDAP_P(( BerElement *ber, long *num, int len )); |
static ber_len_t ber_getnint LDAP_P(( |
|
BerElement *ber, |
|
ber_int_t *num, |
|
ber_len_t len )); |
|
|
/* return the tag - LBER_DEFAULT returned means trouble */ |
/* return the tag - LBER_DEFAULT returned means trouble */ |
unsigned long |
ber_tag_t |
ber_get_tag( BerElement *ber ) |
ber_get_tag( BerElement *ber ) |
{ |
{ |
unsigned char xbyte; |
unsigned char xbyte; |
unsigned long tag; |
ber_tag_t tag; |
char *tagp; |
char *tagp; |
unsigned int i; |
unsigned int i; |
|
|
|
assert( ber != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) |
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) |
if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) |
return( (unsigned long) xbyte ); |
return( (ber_tag_t) xbyte ); |
|
|
tagp = (char *) &tag; |
tagp = (char *) &tag; |
tagp[0] = xbyte; |
tagp[0] = xbyte; |
for ( i = 1; i < sizeof(long); i++ ) { |
for ( i = 1; i < sizeof(ber_tag_t); i++ ) { |
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) |
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
Line 60 ber_get_tag( BerElement *ber )
|
Line 66 ber_get_tag( BerElement *ber )
|
} |
} |
|
|
/* tag too big! */ |
/* tag too big! */ |
if ( i == sizeof(long) ) |
if ( i == sizeof(ber_tag_t) ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
/* want leading, not trailing 0's */ |
/* want leading, not trailing 0's */ |
return( tag >> (sizeof(long) - i - 1) ); |
return( tag >> (sizeof(ber_tag_t) - i - 1) ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_skip_tag( BerElement *ber, unsigned long *len ) |
ber_skip_tag( BerElement *ber, ber_len_t *len ) |
{ |
{ |
unsigned long tag; |
ber_tag_t tag; |
unsigned char lc; |
unsigned char lc; |
int noctets, diff; |
ber_len_t noctets; |
unsigned long netlen; |
int diff; |
|
ber_len_t netlen; |
|
|
|
assert( ber != NULL ); |
|
assert( len != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
/* |
/* |
* Any ber element looks like this: tag length contents. |
* Any ber element looks like this: tag length contents. |
Line 96 ber_skip_tag( BerElement *ber, unsigned
|
Line 107 ber_skip_tag( BerElement *ber, unsigned
|
* Next, read the length. The first byte contains the length of |
* Next, read the length. The first byte contains the length of |
* the length. If bit 8 is set, the length is the long form, |
* the length. If bit 8 is set, the length is the long form, |
* otherwise it's the short form. We don't allow a length that's |
* otherwise it's the short form. We don't allow a length that's |
* greater than what we can hold in an unsigned long. |
* greater than what we can hold in a ber_len_t. |
*/ |
*/ |
|
|
*len = netlen = 0; |
*len = netlen = 0; |
if ( ber_read( ber, (char *) &lc, 1 ) != 1 ) |
if ( ber_read( ber, (char *) &lc, 1 ) != 1 ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
if ( lc & 0x80 ) { |
if ( lc & 0x80U ) { |
noctets = (lc & 0x7f); |
noctets = (lc & 0x7fU); |
if ( noctets > sizeof(unsigned long) ) |
if ( noctets > sizeof(ber_len_t) ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
diff = sizeof(unsigned long) - noctets; |
diff = sizeof(ber_len_t) - noctets; |
if ( ber_read( ber, (char *) &netlen + diff, noctets ) |
if ( (unsigned) ber_read( ber, (char *) &netlen + diff, noctets ) |
!= noctets ) |
!= noctets ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
*len = AC_NTOHL( netlen ); |
*len = LBER_LEN_NTOH( netlen ); |
} else { |
} else { |
*len = lc; |
*len = lc; |
} |
} |
Line 118 ber_skip_tag( BerElement *ber, unsigned
|
Line 129 ber_skip_tag( BerElement *ber, unsigned
|
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_peek_tag( BerElement *ber, unsigned long *len ) |
ber_peek_tag( |
|
LDAP_CONST BerElement *ber_in, |
|
ber_len_t *len ) |
{ |
{ |
char *save; |
ber_tag_t tag; |
unsigned long tag; |
BerElement *ber; |
|
|
|
assert( ber_in != NULL ); |
|
assert( BER_VALID( ber_in ) ); |
|
|
|
ber = ber_dup( ber_in ); |
|
|
|
if( ber == NULL ) { |
|
return LBER_ERROR; |
|
} |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
save = ber->ber_ptr; |
|
tag = ber_skip_tag( ber, len ); |
tag = ber_skip_tag( ber, len ); |
ber->ber_ptr = save; |
|
|
|
|
ber_free( ber, 0 ); |
return( tag ); |
return( tag ); |
} |
} |
|
|
static int |
static ber_len_t |
ber_getnint( BerElement *ber, long *num, int len ) |
ber_getnint( |
|
BerElement *ber, |
|
ber_int_t *num, |
|
ber_len_t len ) |
{ |
{ |
int diff, sign, i; |
unsigned char buf[sizeof(ber_int_t)]; |
long netnum; |
|
char *p; |
assert( ber != NULL ); |
|
assert( num != NULL ); |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
/* |
/* |
* The tag and length have already been stripped off. We should |
* The tag and length have already been stripped off. We should |
Line 145 ber_getnint( BerElement *ber, long *num,
|
Line 174 ber_getnint( BerElement *ber, long *num,
|
* extend after we read it in. |
* extend after we read it in. |
*/ |
*/ |
|
|
if ( len > sizeof(long) ) |
if ( len > sizeof(ber_int_t) ) |
return( -1 ); |
return( -1 ); |
|
|
netnum = 0; |
/* read into the low-order bytes of our buffer */ |
diff = sizeof(long) - len; |
if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) { |
/* read into the low-order bytes of netnum */ |
|
if ( ber_read( ber, ((char *) &netnum) + diff, len ) != len ) |
|
return( -1 ); |
return( -1 ); |
|
} |
|
|
/* sign extend if necessary */ |
if( len ) { |
p = (char *) &netnum; |
/* sign extend if necessary */ |
sign = (0x80 & *(p+diff) ); |
ber_len_t i; |
if ( sign && len < sizeof(long) ) { |
ber_int_t netnum = 0x80 & buf[0] ? -1 : 0; |
for ( i = 0; i < diff; i++ ) { |
|
*(p+i) = (unsigned char) 0xff; |
/* shift in the bytes */ |
|
for( i=0 ; i<len; i++ ) { |
|
netnum = (netnum << 8 ) | buf[i]; |
} |
} |
|
|
|
*num = netnum; |
|
|
|
} else { |
|
*num = 0; |
} |
} |
*num = AC_NTOHL( netnum ); |
|
|
|
return( len ); |
return( len ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_int( BerElement *ber, long *num ) |
ber_get_int( |
|
BerElement *ber, |
|
ber_int_t *num ) |
{ |
{ |
unsigned long tag, len; |
ber_tag_t tag; |
|
ber_len_t len; |
|
|
|
assert( ber != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
if ( (unsigned long) ber_getnint( ber, num, (int)len ) != len ) |
if ( ber_getnint( ber, num, len ) != len ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
else |
else |
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_stringb( BerElement *ber, char *buf, unsigned long *len ) |
ber_get_stringb( |
|
BerElement *ber, |
|
char *buf, |
|
ber_len_t *len ) |
{ |
{ |
unsigned long datalen, tag; |
ber_len_t datalen; |
|
ber_tag_t tag; |
|
|
#ifdef STR_TRANSLATION |
#ifdef STR_TRANSLATION |
char *transbuf; |
char *transbuf; |
#endif /* STR_TRANSLATION */ |
#endif /* STR_TRANSLATION */ |
|
|
|
assert( ber != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) |
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
if ( datalen > (*len - 1) ) |
if ( datalen > (*len - 1) ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
if ( (unsigned long) ber_read( ber, buf, datalen ) != datalen ) |
if ( (ber_len_t) ber_read( ber, buf, datalen ) != datalen ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
buf[datalen] = '\0'; |
buf[datalen] = '\0'; |
|
|
#ifdef STR_TRANSLATION |
#ifdef STR_TRANSLATION |
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
&& ber->ber_decode_translate_proc != NULL ) { |
&& ber->ber_decode_translate_proc ) { |
transbuf = buf; |
transbuf = buf; |
++datalen; |
++datalen; |
if ( (*(ber->ber_decode_translate_proc))( &transbuf, &datalen, |
if ( (*(ber->ber_decode_translate_proc))( &transbuf, &datalen, |
Line 209 ber_get_stringb( BerElement *ber, char *
|
Line 257 ber_get_stringb( BerElement *ber, char *
|
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
} |
} |
if ( datalen > *len ) { |
if ( datalen > *len ) { |
free( transbuf ); |
LBER_FREE( transbuf ); |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
} |
} |
SAFEMEMCPY( buf, transbuf, datalen ); |
SAFEMEMCPY( buf, transbuf, datalen ); |
free( transbuf ); |
LBER_FREE( transbuf ); |
--datalen; |
--datalen; |
} |
} |
#endif /* STR_TRANSLATION */ |
#endif /* STR_TRANSLATION */ |
Line 222 ber_get_stringb( BerElement *ber, char *
|
Line 270 ber_get_stringb( BerElement *ber, char *
|
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_stringa( BerElement *ber, char **buf ) |
ber_get_stringa( BerElement *ber, char **buf ) |
{ |
{ |
unsigned long datalen, tag; |
ber_len_t datalen; |
|
ber_tag_t tag; |
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) |
assert( ber != NULL ); |
|
assert( buf != NULL ); |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) { |
|
*buf = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
|
|
if ( (*buf = (char *) malloc( (size_t)datalen + 1 )) == NULL ) |
if ( (*buf = (char *) LBER_MALLOC( datalen + 1 )) == NULL ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen ) |
if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) { |
|
LBER_FREE( *buf ); |
|
*buf = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
(*buf)[datalen] = '\0'; |
(*buf)[datalen] = '\0'; |
|
|
#ifdef STR_TRANSLATION |
#ifdef STR_TRANSLATION |
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
&& ber->ber_decode_translate_proc != NULL ) { |
&& ber->ber_decode_translate_proc ) { |
++datalen; |
++datalen; |
if ( (*(ber->ber_decode_translate_proc))( buf, &datalen, 1 ) |
if ( (*(ber->ber_decode_translate_proc))( buf, &datalen, 1 ) |
!= 0 ) { |
!= 0 ) { |
free( *buf ); |
LBER_FREE( *buf ); |
|
*buf = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
} |
} |
} |
} |
Line 252 ber_get_stringa( BerElement *ber, char *
|
Line 312 ber_get_stringa( BerElement *ber, char *
|
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_stringal( BerElement *ber, struct berval **bv ) |
ber_get_stringal( BerElement *ber, struct berval **bv ) |
{ |
{ |
unsigned long len, tag; |
ber_len_t len; |
|
ber_tag_t tag; |
|
|
|
assert( ber != NULL ); |
|
assert( bv != NULL ); |
|
|
if ( (*bv = (struct berval *) malloc( sizeof(struct berval) )) == NULL ) |
assert( BER_VALID( ber ) ); |
|
|
|
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) { |
|
*bv = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
|
|
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
if ( (*bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) )) == NULL ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
if ( ((*bv)->bv_val = (char *) malloc( (size_t)len + 1 )) == NULL ) |
if ( ((*bv)->bv_val = (char *) LBER_MALLOC( len + 1 )) == NULL ) { |
|
LBER_FREE( *bv ); |
|
*bv = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
|
|
if ( (unsigned long) ber_read( ber, (*bv)->bv_val, len ) != len ) |
if ( (ber_len_t) ber_read( ber, (*bv)->bv_val, len ) != len ) { |
|
ber_bvfree( *bv ); |
|
*bv = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
((*bv)->bv_val)[len] = '\0'; |
((*bv)->bv_val)[len] = '\0'; |
(*bv)->bv_len = len; |
(*bv)->bv_len = len; |
|
|
#ifdef STR_TRANSLATION |
#ifdef STR_TRANSLATION |
if ( len > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
if ( len > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
&& ber->ber_decode_translate_proc != NULL ) { |
&& ber->ber_decode_translate_proc ) { |
++len; |
++len; |
if ( (*(ber->ber_decode_translate_proc))( &((*bv)->bv_val), |
if ( (*(ber->ber_decode_translate_proc))( &((*bv)->bv_val), |
&len, 1 ) != 0 ) { |
&len, 1 ) != 0 ) { |
free( (*bv)->bv_val ); |
ber_bvfree( *bv ); |
|
*bv = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
} |
} |
(*bv)->bv_len = len - 1; |
(*bv)->bv_len = len - 1; |
Line 287 ber_get_stringal( BerElement *ber, struc
|
Line 362 ber_get_stringal( BerElement *ber, struc
|
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_bitstringa( BerElement *ber, char **buf, unsigned long *blen ) |
ber_get_bitstringa( |
|
BerElement *ber, |
|
char **buf, |
|
ber_len_t *blen ) |
{ |
{ |
unsigned long datalen, tag; |
ber_len_t datalen; |
|
ber_tag_t tag; |
unsigned char unusedbits; |
unsigned char unusedbits; |
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) |
assert( ber != NULL ); |
|
assert( buf != NULL ); |
|
assert( blen != NULL ); |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) { |
|
*buf = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
--datalen; |
--datalen; |
|
|
if ( (*buf = (char *) malloc( (size_t)datalen )) == NULL ) |
if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) |
if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) { |
|
LBER_FREE( buf ); |
|
*buf = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
|
|
if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen ) |
if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) { |
|
LBER_FREE( buf ); |
|
*buf = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
} |
|
|
*blen = datalen * 8 - unusedbits; |
*blen = datalen * 8 - unusedbits; |
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_null( BerElement *ber ) |
ber_get_null( BerElement *ber ) |
{ |
{ |
unsigned long len, tag; |
ber_len_t len; |
|
ber_tag_t tag; |
|
|
|
assert( ber != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
Line 324 ber_get_null( BerElement *ber )
|
Line 421 ber_get_null( BerElement *ber )
|
return( tag ); |
return( tag ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_boolean( BerElement *ber, int *boolval ) |
ber_get_boolean( |
|
BerElement *ber, |
|
ber_int_t *boolval ) |
{ |
{ |
long longbool; |
ber_int_t longbool; |
int rc; |
ber_tag_t rc; |
|
|
|
assert( ber != NULL ); |
|
assert( boolval != NULL ); |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
rc = ber_get_int( ber, &longbool ); |
rc = ber_get_int( ber, &longbool ); |
*boolval = longbool; |
*boolval = longbool; |
Line 336 ber_get_boolean( BerElement *ber, int *b
|
Line 440 ber_get_boolean( BerElement *ber, int *b
|
return( rc ); |
return( rc ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_first_element( BerElement *ber, unsigned long *len, char **last ) |
ber_first_element( |
{ |
BerElement *ber, |
|
ber_len_t *len, |
|
char **last ) |
|
{ |
|
assert( ber != NULL ); |
|
assert( len != NULL ); |
|
assert( last != NULL ); |
|
|
/* skip the sequence header, use the len to mark where to stop */ |
/* skip the sequence header, use the len to mark where to stop */ |
if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) { |
if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) { |
|
*last = NULL; |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
} |
} |
|
|
Line 353 ber_first_element( BerElement *ber, unsi
|
Line 465 ber_first_element( BerElement *ber, unsi
|
return( ber_peek_tag( ber, len ) ); |
return( ber_peek_tag( ber, len ) ); |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_next_element( BerElement *ber, unsigned long *len, char *last ) |
ber_next_element( |
{ |
BerElement *ber, |
|
ber_len_t *len, |
|
char *last ) |
|
{ |
|
assert( ber != NULL ); |
|
assert( len != NULL ); |
|
assert( last != NULL ); |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
if ( ber->ber_ptr == last ) { |
if ( ber->ber_ptr == last ) { |
return( LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
} |
} |
Line 364 ber_next_element( BerElement *ber, unsig
|
Line 485 ber_next_element( BerElement *ber, unsig
|
} |
} |
|
|
/* VARARGS */ |
/* VARARGS */ |
unsigned long |
ber_tag_t |
ber_scanf |
ber_scanf |
#if HAVE_STDARG |
#if HAVE_STDARG |
( BerElement *ber, char *fmt, ... ) |
( BerElement *ber, |
|
LDAP_CONST char *fmt, |
|
... ) |
#else |
#else |
( va_alist ) |
( va_alist ) |
va_dcl |
va_dcl |
Line 378 va_dcl
|
Line 501 va_dcl
|
BerElement *ber; |
BerElement *ber; |
char *fmt; |
char *fmt; |
#endif |
#endif |
|
LDAP_CONST char *fmt_reset; |
char *last; |
char *last; |
char *s, **ss, ***sss; |
char *s, **ss, ***sss; |
struct berval ***bv, **bvp, *bval; |
struct berval ***bv, **bvp, *bval; |
int *i, j; |
ber_int_t *i; |
long *l; |
int j; |
unsigned long rc, tag, len; |
ber_len_t *l; |
|
ber_tag_t *t; |
|
ber_tag_t rc, tag; |
|
ber_len_t len; |
|
|
#ifdef HAVE_STDARG |
#ifdef HAVE_STDARG |
va_start( ap, fmt ); |
va_start( ap, fmt ); |
Line 393 va_dcl
|
Line 520 va_dcl
|
fmt = va_arg( ap, char * ); |
fmt = va_arg( ap, char * ); |
#endif |
#endif |
|
|
#ifdef LDAP_DEBUG |
assert( ber != NULL ); |
if ( lber_debug & 64 ) { |
assert( fmt != NULL ); |
fprintf( stderr, "ber_scanf fmt (%s) ber:\n", fmt ); |
|
ber_dump( ber, 1 ); |
assert( BER_VALID( ber ) ); |
} |
|
#endif |
fmt_reset = fmt; |
|
|
|
ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug, |
|
"ber_scanf fmt (%s) ber:\n", fmt ); |
|
ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 ); |
|
|
for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) { |
for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) { |
|
/* When this is modified, remember to update |
|
* the error-cleanup code below accordingly. */ |
switch ( *fmt ) { |
switch ( *fmt ) { |
|
case '!': { /* Hook */ |
|
BERDecodeCallback *f; |
|
void *p; |
|
|
|
f = va_arg( ap, BERDecodeCallback * ); |
|
p = va_arg( ap, void * ); |
|
|
|
rc = (*f)( ber, p, 0 ); |
|
} break; |
|
|
case 'a': /* octet string - allocate storage as needed */ |
case 'a': /* octet string - allocate storage as needed */ |
ss = va_arg( ap, char ** ); |
ss = va_arg( ap, char ** ); |
rc = ber_get_stringa( ber, ss ); |
rc = ber_get_stringa( ber, ss ); |
break; |
break; |
|
|
case 'b': /* boolean */ |
case 'b': /* boolean */ |
i = va_arg( ap, int * ); |
i = va_arg( ap, ber_int_t * ); |
rc = ber_get_boolean( ber, i ); |
rc = ber_get_boolean( ber, i ); |
break; |
break; |
|
|
case 'e': /* enumerated */ |
case 'e': /* enumerated */ |
case 'i': /* int */ |
case 'i': /* int */ |
l = va_arg( ap, long * ); |
i = va_arg( ap, ber_int_t * ); |
rc = ber_get_int( ber, l ); |
rc = ber_get_int( ber, i ); |
break; |
break; |
|
|
case 'l': /* length of next item */ |
case 'l': /* length of next item */ |
l = va_arg( ap, long * ); |
l = va_arg( ap, ber_len_t * ); |
rc = ber_peek_tag( ber, (unsigned long *)l ); |
rc = ber_peek_tag( ber, l ); |
break; |
break; |
|
|
case 'n': /* null */ |
case 'n': /* null */ |
Line 429 va_dcl
|
Line 572 va_dcl
|
|
|
case 's': /* octet string - in a buffer */ |
case 's': /* octet string - in a buffer */ |
s = va_arg( ap, char * ); |
s = va_arg( ap, char * ); |
l = va_arg( ap, long * ); |
l = va_arg( ap, ber_len_t * ); |
rc = ber_get_stringb( ber, s, (unsigned long *)l ); |
rc = ber_get_stringb( ber, s, l ); |
break; |
break; |
|
|
case 'o': /* octet string in a supplied berval */ |
case 'o': /* octet string in a supplied berval */ |
Line 446 va_dcl
|
Line 589 va_dcl
|
|
|
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 ** ); |
l = va_arg( ap, long * ); /* for length, in bits */ |
l = va_arg( ap, ber_len_t * ); /* for length, in bits */ |
rc = ber_get_bitstringa( ber, ss, (unsigned long *)l ); |
rc = ber_get_bitstringa( ber, ss, l ); |
break; |
break; |
|
|
case 't': /* tag of next item */ |
case 't': /* tag of next item */ |
i = va_arg( ap, int * ); |
t = va_arg( ap, ber_tag_t * ); |
*i = rc = ber_peek_tag( ber, &len ); |
*t = rc = ber_peek_tag( ber, &len ); |
break; |
break; |
|
|
case 'T': /* skip tag of next item */ |
case 'T': /* skip tag of next item */ |
i = va_arg( ap, int * ); |
t = va_arg( ap, ber_tag_t * ); |
*i = rc = ber_skip_tag( ber, &len ); |
*t = rc = ber_skip_tag( ber, &len ); |
break; |
break; |
|
|
case 'v': /* sequence of strings */ |
case 'v': /* sequence of strings */ |
Line 466 va_dcl
|
Line 609 va_dcl
|
j = 0; |
j = 0; |
for ( tag = ber_first_element( ber, &len, &last ); |
for ( tag = ber_first_element( ber, &len, &last ); |
tag != LBER_DEFAULT && rc != LBER_DEFAULT; |
tag != LBER_DEFAULT && rc != LBER_DEFAULT; |
tag = ber_next_element( ber, &len, last ) ) { |
tag = ber_next_element( ber, &len, last ) ) |
if ( *sss == NULL ) { |
{ |
*sss = (char **) malloc( |
*sss = (char **) LBER_REALLOC( *sss, |
2 * sizeof(char *) ); |
(j + 2) * sizeof(char *) ); |
} else { |
|
*sss = (char **) realloc( *sss, |
|
(j + 2) * sizeof(char *) ); |
|
} |
|
rc = ber_get_stringa( ber, &((*sss)[j]) ); |
rc = ber_get_stringa( ber, &((*sss)[j]) ); |
j++; |
j++; |
} |
} |
Line 487 va_dcl
|
Line 627 va_dcl
|
j = 0; |
j = 0; |
for ( tag = ber_first_element( ber, &len, &last ); |
for ( tag = ber_first_element( ber, &len, &last ); |
tag != LBER_DEFAULT && rc != LBER_DEFAULT; |
tag != LBER_DEFAULT && rc != LBER_DEFAULT; |
tag = ber_next_element( ber, &len, last ) ) { |
tag = ber_next_element( ber, &len, last ) ) |
if ( *bv == NULL ) { |
{ |
*bv = (struct berval **) malloc( |
*bv = (struct berval **) LBER_REALLOC( *bv, |
2 * sizeof(struct berval *) ); |
(j + 2) * sizeof(struct berval *) ); |
} else { |
|
*bv = (struct berval **) realloc( *bv, |
|
(j + 2) * sizeof(struct berval *) ); |
|
} |
|
rc = ber_get_stringal( ber, &((*bv)[j]) ); |
rc = ber_get_stringal( ber, &((*bv)[j]) ); |
j++; |
j++; |
} |
} |
Line 519 va_dcl
|
Line 656 va_dcl
|
break; |
break; |
|
|
default: |
default: |
#ifdef LDAP_LIBUI |
if( ber->ber_debug ) { |
fprintf( stderr, "unknown fmt %c\n", *fmt ); |
ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug, |
#endif /* LDAP_LIBUI */ |
"ber_scanf: unknown fmt %c\n", *fmt ); |
|
} |
rc = LBER_DEFAULT; |
rc = LBER_DEFAULT; |
break; |
break; |
} |
} |
Line 529 va_dcl
|
Line 667 va_dcl
|
|
|
va_end( ap ); |
va_end( ap ); |
|
|
return( rc ); |
if ( rc == LBER_DEFAULT ) { |
} |
/* |
|
* Error. Reclaim malloced memory that was given to the caller. |
|
* Set allocated pointers to NULL, "data length" outvalues to 0. |
|
*/ |
|
#ifdef HAVE_STDARG |
|
va_start( ap, fmt ); |
|
#else |
|
va_start( ap ); |
|
(void) va_arg( ap, BerElement * ); |
|
(void) va_arg( ap, char * ); |
|
#endif |
|
|
void |
for ( ; fmt_reset < fmt; fmt_reset++ ) { |
ber_bvfree( struct berval *bv ) |
switch ( *fmt_reset ) { |
{ |
case '!': { /* Hook */ |
if ( bv->bv_val != NULL ) |
BERDecodeCallback *f; |
free( bv->bv_val ); |
void *p; |
free( (char *) bv ); |
|
} |
|
|
|
void |
f = va_arg( ap, BERDecodeCallback * ); |
ber_bvecfree( struct berval **bv ) |
p = va_arg( ap, void * ); |
{ |
|
int i; |
|
|
|
for ( i = 0; bv[i] != NULL; i++ ) |
(void) (*f)( ber, p, 1 ); |
ber_bvfree( bv[i] ); |
} break; |
free( (char *) bv ); |
|
} |
|
|
|
struct berval * |
case 'a': /* octet string - allocate storage as needed */ |
ber_bvdup( struct berval *bv ) |
ss = va_arg( ap, char ** ); |
{ |
if ( *ss ) { |
struct berval *new; |
LBER_FREE( *ss ); |
|
*ss = NULL; |
|
} |
|
break; |
|
|
if ( (new = (struct berval *) malloc( sizeof(struct berval) )) |
case 'b': /* boolean */ |
== NULL ) { |
case 'e': /* enumerated */ |
return( NULL ); |
case 'i': /* int */ |
} |
(void) va_arg( ap, int * ); |
if ( (new->bv_val = (char *) malloc( bv->bv_len + 1 )) == NULL ) { |
break; |
return( NULL ); |
|
|
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 */ |
|
(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 'o': /* octet string in a supplied berval */ |
|
bval = va_arg( ap, struct berval * ); |
|
if ( bval->bv_val != NULL ) { |
|
LBER_FREE( bval->bv_val ); |
|
bval->bv_val = NULL; |
|
} |
|
bval->bv_len = 0; |
|
break; |
|
|
|
case 'O': /* octet string - allocate & include length */ |
|
bvp = va_arg( ap, struct berval ** ); |
|
if ( *bvp ) { |
|
ber_bvfree( *bvp ); |
|
*bvp = NULL; |
|
} |
|
break; |
|
|
|
case 'B': /* bit string - allocate storage as needed */ |
|
ss = va_arg( ap, char ** ); |
|
if ( *ss ) { |
|
LBER_FREE( *ss ); |
|
*ss = NULL; |
|
} |
|
*(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */ |
|
break; |
|
|
|
case 'v': /* sequence of strings */ |
|
sss = va_arg( ap, char *** ); |
|
if ( *sss ) { |
|
for (j = 0; (*sss)[j]; j++) { |
|
LBER_FREE( (*sss)[j] ); |
|
(*sss)[j] = NULL; |
|
} |
|
LBER_FREE( *sss ); |
|
*sss = NULL; |
|
} |
|
break; |
|
|
|
case 'V': /* sequence of strings + lengths */ |
|
bv = va_arg( ap, struct berval *** ); |
|
if ( *bv ) { |
|
ber_bvecfree( *bv ); |
|
*bv = NULL; |
|
} |
|
break; |
|
|
|
case 'n': /* null */ |
|
case 'x': /* skip the next element - whatever it is */ |
|
case '{': /* begin sequence */ |
|
case '[': /* begin set */ |
|
case '}': /* end sequence */ |
|
case ']': /* end set */ |
|
break; |
|
|
|
default: |
|
/* format should be good */ |
|
assert( 0 ); |
|
} |
|
} |
|
|
|
va_end( ap ); |
} |
} |
SAFEMEMCPY( new->bv_val, bv->bv_val, (size_t) bv->bv_len ); |
|
new->bv_val[bv->bv_len] = '\0'; |
|
new->bv_len = bv->bv_len; |
|
|
|
return( new ); |
return( rc ); |
} |
} |
|
|
|
|
Line 575 void
|
Line 792 void
|
ber_set_string_translators( BerElement *ber, BERTranslateProc encode_proc, |
ber_set_string_translators( BerElement *ber, BERTranslateProc encode_proc, |
BERTranslateProc decode_proc ) |
BERTranslateProc decode_proc ) |
{ |
{ |
|
assert( ber != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
ber->ber_encode_translate_proc = encode_proc; |
ber->ber_encode_translate_proc = encode_proc; |
ber->ber_decode_translate_proc = decode_proc; |
ber->ber_decode_translate_proc = decode_proc; |
} |
} |