libraries/liblber/decode.c - diff

Return to decode.c CVS log

Up to [OpenLDAP] / libraries / liblber

Diff for /libraries/liblber/decode.c between versions 1.15 and 1.52

version 1.15, 1999/03/03 14:25:44	version 1.52, 2000/06/05 17:22:22
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.51 2000/05/14 01:38:27 kurt Exp $ */
/*	/*
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.	* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file	* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/	*/
/* Portions	/* Portions
Line 18	Line 19
#include "portable.h"	#include "portable.h"

#include <stdio.h>	#include <stdio.h>
#include <stdlib.h>

#include <ac/stdarg.h>	#include <ac/stdlib.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"	#include "lber-int.h"

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;
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 );

	tag = xbyte;

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 tag;

tagp = (char *) &tag;	for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
tagp[0] = xbyte;
for ( i = 1; i < sizeof(long); i++ ) {
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 )	if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 )
return( LBER_DEFAULT );	return( LBER_DEFAULT );

tagp[i] = xbyte;	tag <<= 8;
	tag \|= 0x00ffUL & (ber_tag_t) xbyte;

if ( ! (xbyte & LBER_MORE_TAG_MASK) )	if ( ! (xbyte & LBER_MORE_TAG_MASK) )
break;	break;
}	}

/* 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 */	return tag;
return( tag >> (sizeof(long) - 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 i, noctets;
unsigned long netlen;	unsigned char netlen[sizeof(ber_len_t)];

	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 82 ber_skip_tag( BerElement *ber, unsigned	Line 92 ber_skip_tag( BerElement *ber, unsigned
* 2) primitive encodings used whenever possible	* 2) primitive encodings used whenever possible
*/	*/

	*len = 0;

/*	/*
* First, we read the tag.	* First, we read the tag.
*/	*/
Line 93 ber_skip_tag( BerElement *ber, unsigned	Line 105 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;
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 ) {
noctets = (lc & 0x7f);	if ( lc & 0x80U ) {
if ( noctets > sizeof(unsigned long) )	noctets = (lc & 0x7fU);

	if ( noctets > sizeof(ber_len_t) ) {
return( LBER_DEFAULT );	return( LBER_DEFAULT );
diff = sizeof(unsigned long) - noctets;	}
if ( ber_read( ber, (char *) &netlen + diff, noctets )
!= noctets )	if( (unsigned) ber_read( ber, netlen, noctets ) != noctets ) {
return( LBER_DEFAULT );	return( LBER_DEFAULT );
*len = AC_NTOHL( netlen );	}

	for( i = 0; i < noctets; i++ ) {
	*len <<= 8;
	*len \|= netlen[i];
	}

} else {	} else {
*len = lc;	*len = lc;
}	}
Line 115 ber_skip_tag( BerElement *ber, unsigned	Line 134 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(
	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 ) );

	*len = 0;

	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 142 ber_getnint( BerElement ber, long num,	Line 181 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_enum(
	BerElement *ber,
	ber_int_t *num )
{	{
unsigned long datalen, tag;	return ber_get_int( ber, num );
#ifdef STR_TRANSLATION	}
char *transbuf;
#endif /* STR_TRANSLATION */	ber_tag_t
	ber_get_stringb(
	BerElement *ber,
	char *buf,
	ber_len_t *len )
	{
	ber_len_t datalen;
	ber_tag_t tag;

	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
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0
&& ber->ber_decode_translate_proc != 0 ) {
transbuf = buf;
++datalen;
if ( (*(ber->ber_decode_translate_proc))( &transbuf, &datalen,
0 ) != 0 ) {
return( LBER_DEFAULT );
}
if ( datalen > *len ) {
free( transbuf );
return( LBER_DEFAULT );
}
SAFEMEMCPY( buf, transbuf, datalen );
free( transbuf );
--datalen;
}
#endif /* STR_TRANSLATION */

*len = datalen;	*len = datalen;
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;

	assert( ber != NULL );
	assert( buf != NULL );

	assert( BER_VALID( ber ) );

if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {	if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
*buf = NULL;	*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 ) {
free( *buf );	LBER_FREE( *buf );
*buf = NULL;	*buf = NULL;
return( LBER_DEFAULT );	return( LBER_DEFAULT );
}	}
(*buf)[datalen] = '\0';	(*buf)[datalen] = '\0';

#ifdef STR_TRANSLATION
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0
&& ber->ber_decode_translate_proc != 0 ) {
++datalen;
if ( (*(ber->ber_decode_translate_proc))( buf, &datalen, 1 )
!= 0 ) {
free( *buf );
*buf = NULL;
return( LBER_DEFAULT );
}
}
#endif /* STR_TRANSLATION */

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 );

	assert( BER_VALID( ber ) );

if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {	if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
*bv = NULL;	*bv = NULL;
return( LBER_DEFAULT );	return( LBER_DEFAULT );
}	}

if ( (bv = (struct berval ) malloc( sizeof(struct berval) )) == NULL )	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 ) {
free( *bv );	LBER_FREE( *bv );
*bv = NULL;	*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 );	ber_bvfree( *bv );
*bv = NULL;	*bv = NULL;
return( LBER_DEFAULT );	return( LBER_DEFAULT );
Line 282 ber_get_stringal( BerElement *ber, struc	Line 324 ber_get_stringal( BerElement *ber, struc
((*bv)->bv_val)[len] = '\0';	((*bv)->bv_val)[len] = '\0';
(*bv)->bv_len = len;	(*bv)->bv_len = len;

#ifdef STR_TRANSLATION
if ( len > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0
&& ber->ber_decode_translate_proc != 0 ) {
++len;
if ( ((ber->ber_decode_translate_proc))( &((bv)->bv_val),
&len, 1 ) != 0 ) {
ber_bvfree( *bv );
*bv = NULL;
return( LBER_DEFAULT );
}
(*bv)->bv_len = len - 1;
}
#endif /* STR_TRANSLATION */

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;

	assert( ber != NULL );
	assert( buf != NULL );
	assert( blen != NULL );

	assert( BER_VALID( ber ) );

if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {	if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
*buf = NULL;	*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 ) {
free( buf );	LBER_FREE( buf );
*buf = NULL;	*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 ) {
free( buf );	LBER_FREE( buf );
*buf = NULL;	*buf = NULL;
return( LBER_DEFAULT );	return( LBER_DEFAULT );
}	}
Line 330 ber_get_bitstringa( BerElement *ber, cha	Line 368 ber_get_bitstringa( BerElement *ber, cha
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 344 ber_get_null( BerElement *ber )	Line 386 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 356 ber_get_boolean( BerElement ber, int b	Line 405 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;	*last = NULL;
Line 368 ber_first_element( BerElement *ber, unsi	Line 424 ber_first_element( BerElement *ber, unsi
last = ber->ber_ptr + len;	last = ber->ber_ptr + len;

if ( *last == ber->ber_ptr ) {	if ( *last == ber->ber_ptr ) {
#ifdef LBER_END_SEQORSET
return( LBER_END_SEQORSET );
#else
return( LBER_DEFAULT );	return( LBER_DEFAULT );
#endif
}	}

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,
	LDAP_CONST 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 ) {
#ifdef LBER_END_SEQORSET
return( LBER_END_SEQORSET );
#else
return( LBER_DEFAULT );	return( LBER_DEFAULT );
#endif
}	}

return( ber_peek_tag( ber, len ) );	return( ber_peek_tag( ber, len ) );
}	}

/* VARARGS */	/* VARARGS */
unsigned long	ber_tag_t
ber_scanf	ber_scanf ( BerElement *ber,
#if HAVE_STDARG	LDAP_CONST char *fmt,
( BerElement ber, char fmt, ... )	... )
#else
( va_alist )
va_dcl
#endif
{	{
va_list ap;	va_list ap;
#ifndef HAVE_STDARG	LDAP_CONST char *fmt_reset;
BerElement *ber;
char *fmt;
#endif
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
va_start( ap, fmt );	va_start( ap, fmt );
#else
va_start( ap );	assert( ber != NULL );
ber = va_arg( ap, BerElement * );	assert( fmt != NULL );
fmt = va_arg( ap, char * );
#endif	assert( BER_VALID( ber ) );

fmt_reset = fmt;	fmt_reset = fmt;

if ( ber->ber_debug ) {	ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
lber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,	"ber_scanf fmt (%s) ber:\n", fmt );
"ber_scanf fmt (%s) ber:\n", fmt );	ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
lber_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	/* When this is modified, remember to update
* the error-cleanup code below accordingly. */	* 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 461 va_dcl	Line 521 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 478 va_dcl	Line 538 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 497 va_dcl	Line 557 va_dcl
*sss = NULL;	*sss = NULL;
j = 0;	j = 0;
for ( tag = ber_first_element( ber, &len, &last );	for ( tag = ber_first_element( ber, &len, &last );
tag != LBER_DEFAULT &&	tag != LBER_DEFAULT && rc != LBER_DEFAULT;
#ifdef LDAP_END_SEQORSET
tag != LBER_END_SEQORSET &&
#endif
rc != LBER_DEFAULT;
tag = ber_next_element( ber, &len, last ) )	tag = ber_next_element( ber, &len, last ) )
{	{
if ( *sss == NULL ) {	sss = (char ) LBER_REALLOC( sss,
sss = (char *) malloc(	(j + 2) * sizeof(char *) );
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++;
}	}
#ifdef LDAP_END_SEQORSET
if (rc != LBER_DEFAULT &&
tag != LBER_END_SEQORSET )
{
rc = LBER_DEFAULT;
}
#endif
if ( j > 0 )	if ( j > 0 )
(*sss)[j] = NULL;	(*sss)[j] = NULL;
break;	break;
Line 530 va_dcl	Line 575 va_dcl
*bv = NULL;	*bv = NULL;
j = 0;	j = 0;
for ( tag = ber_first_element( ber, &len, &last );	for ( tag = ber_first_element( ber, &len, &last );
tag != LBER_DEFAULT &&	tag != LBER_DEFAULT && rc != LBER_DEFAULT;
#ifdef LDAP_END_SEQORSET
tag != LBER_END_SEQORSET &&
#endif
rc != LBER_DEFAULT;
tag = ber_next_element( ber, &len, last ) )	tag = ber_next_element( ber, &len, last ) )
{	{
if ( *bv == NULL ) {	bv = (struct berval ) LBER_REALLOC( bv,
bv = (struct berval *) malloc(	(j + 2) * sizeof(struct berval *) );
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++;
}	}
#ifdef LDAP_END_SEQORSET
if (rc != LBER_DEFAULT &&
tag != LBER_END_SEQORSET )
{
rc = LBER_DEFAULT;
}
#endif
if ( j > 0 )	if ( j > 0 )
(*bv)[j] = NULL;	(*bv)[j] = NULL;
break;	break;
Line 576 va_dcl	Line 606 va_dcl

default:	default:
if( ber->ber_debug ) {	if( ber->ber_debug ) {
lber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,	ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
"ber_scanf: unknown fmt %c\n", *fmt );	"ber_scanf: unknown fmt %c\n", *fmt );
}	}
rc = LBER_DEFAULT;	rc = LBER_DEFAULT;
Line 591 va_dcl	Line 621 va_dcl
* Error. Reclaim malloced memory that was given to the caller.	* Error. Reclaim malloced memory that was given to the caller.
* Set allocated pointers to NULL, "data length" outvalues to 0.	* Set allocated pointers to NULL, "data length" outvalues to 0.
*/	*/
#ifdef HAVE_STDARG
va_start( ap, fmt );	va_start( ap, fmt );
#else
va_start( ap );
(void) va_arg( ap, BerElement * );
(void) va_arg( ap, char * );
#endif

for ( ; fmt_reset < fmt; fmt_reset++ ) {	for ( ; fmt_reset < fmt; fmt_reset++ ) {
switch ( *fmt_reset ) {	switch ( *fmt_reset ) {
	case '!': { /* Hook */
	BERDecodeCallback *f;
	void *p;

	f = va_arg( ap, BERDecodeCallback * );
	p = va_arg( ap, void * );

	(void) (*f)( ber, p, 1 );
	} 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 ** );
if ( *ss ) {	if ( *ss ) {
free( *ss );	LBER_FREE( *ss );
*ss = NULL;	*ss = NULL;
}	}
break;	break;

case 'b': /* boolean */	case 'b': /* boolean */
case 't': /* tag of next item */	case 'e': /* enumerated */
case 'T': /* skip tag of next item */	case 'i': /* int */
(void) va_arg( ap, int * );	(void) va_arg( ap, int * );
break;	break;

case 's': /* octet string - in a buffer */	case 's': /* octet string - in a buffer */
(void) va_arg( ap, char * );	(void) va_arg( ap, char * );
/* Fall through */	(void) va_arg( ap, ber_len_t * );
case 'e': /* enumerated */	break;
case 'i': /* int */
case 'l': /* length of next item */	case 'l': /* length of next item */
(void) va_arg( ap, long * );	(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;	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 ) {	if ( bval->bv_val != NULL ) {
free( bval->bv_val );	LBER_FREE( bval->bv_val );
bval->bv_val = NULL;	bval->bv_val = NULL;
}	}
bval->bv_len = 0;	bval->bv_len = 0;
Line 644 va_dcl	Line 683 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 ** );
if ( *ss ) {	if ( *ss ) {
free( *ss );	LBER_FREE( *ss );
*ss = NULL;	*ss = NULL;
}	}
(va_arg( ap, long )) = 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 */
sss = va_arg( ap, char *** );	sss = va_arg( ap, char *** );
if ( *sss ) {	if ( *sss ) {
for (j = 0; (*sss)[j]; j++)	for (j = 0; (*sss)[j]; j++) {
free( (*sss)[j] );	LBER_FREE( (*sss)[j] );
free( *sss );	(*sss)[j] = NULL;
	}
	LBER_FREE( *sss );
*sss = NULL;	*sss = NULL;
}	}
break;	break;
Line 668 va_dcl	Line 709 va_dcl
}	}
break;	break;

#if 0 /* No action for these format characters */
case 'n': /* null */	case 'n': /* null */
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 */
case '}': /* end sequence */	case '}': /* end sequence */
case ']': /* end set */	case ']': /* end set */
#endif	break;

	default:
	/* format should be good */
	assert( 0 );
}	}
}	}

Line 685 va_dcl	Line 728 va_dcl

return( rc );	return( rc );
}	}

void
ber_bvfree( struct berval *bv )
{
#ifdef LBER_ASSERT
assert(bv != NULL); /* bv damn better point to something */
#endif
if ( bv->bv_val != NULL )
free( bv->bv_val );
free( (char *) bv );
}

void
ber_bvecfree( struct berval **bv )
{
int i;

#ifdef LBER_ASSERT
assert(bv != NULL); /* bv damn better point to something */
#endif
for ( i = 0; bv[i] != NULL; i++ )
ber_bvfree( bv[i] );
free( (char *) bv );
}

struct berval *
ber_bvdup( struct berval *bv )
{
struct berval *new;

if ( (new = (struct berval *) malloc( sizeof(struct berval) ))
== NULL ) {
return( NULL );
}

if ( bv->bv_val == NULL ) {
new->bv_val = NULL;
new->bv_len = 0;
return ( new );
}

if ( (new->bv_val = (char *) malloc( bv->bv_len + 1 )) == NULL ) {
free( new );
return( NULL );
}

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 );
}


#ifdef STR_TRANSLATION
void
ber_set_string_translators( BerElement *ber, BERTranslateProc encode_proc,
BERTranslateProc decode_proc )
{
ber->ber_encode_translate_proc = encode_proc;
ber->ber_decode_translate_proc = decode_proc;
}
#endif /* STR_TRANSLATION */

Removed from v.1.15
changed lines
	Added in v.1.52