--- libraries/liblber/decode.c	2009/08/13 00:56:58	1.105.2.8
+++ libraries/liblber/decode.c	2009/02/10 11:44:12	1.116
@@ -1,5 +1,5 @@
 /* decode.c - ber input decoding routines */
-/* $OpenLDAP: pkg/ldap/libraries/liblber/decode.c,v 1.105.2.7 2009/08/02 21:06:33 quanah Exp $ */
+/* $OpenLDAP: pkg/ldap/libraries/liblber/decode.c,v 1.115 2009/01/21 23:40:19 kurt Exp $ */
 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
  *
  * Copyright 1998-2009 The OpenLDAP Foundation.
@@ -33,12 +33,17 @@
 #include <stdio.h>
 
 #include <ac/stdlib.h>
+
 #include <ac/stdarg.h>
 #include <ac/string.h>
 #include <ac/socket.h>
 
 #include "lber-int.h"
 
+static ber_len_t ber_getnint LDAP_P((
+	BerElement *ber,
+	ber_int_t *num,
+	ber_len_t len ));
 
 /* out->bv_len should be the buffer size on input */
 int
@@ -86,150 +91,125 @@ ber_decode_oid( BerValue *in, BerValue *
 	return 0;
 }
 
-/* Return tag, with *bv = rest of element (starting at length octets) */
-static ber_tag_t
-ber_tag_and_rest( const BerElement *ber, struct berval *bv )
+/* return the tag - LBER_DEFAULT returned means trouble */
+ber_tag_t
+ber_get_tag( BerElement *ber )
 {
+	unsigned char	xbyte;
 	ber_tag_t	tag;
-	ptrdiff_t	rest;
-	unsigned char	*ptr;
+	unsigned int	i;
 
 	assert( ber != NULL );
 	assert( LBER_VALID( ber ) );
 
-	ptr = (unsigned char *) ber->ber_ptr;
-	rest = (unsigned char *) ber->ber_end - ptr;
-	if ( rest <= 0 ) {
-		goto fail;
+	if ( ber_pvt_ber_remaining( ber ) < 1 ) {
+		return LBER_DEFAULT;
 	}
 
-	tag = ber->ber_tag;
-	if ( (char *) ptr == ber->ber_buf ) {
-		tag = *ptr;
+	if ( ber->ber_ptr == ber->ber_buf ) {
+		tag = *(unsigned char *)ber->ber_ptr;
+	} else {
+		tag = ber->ber_tag;
 	}
-	ptr++;
-	rest--;
+	ber->ber_ptr++;
+
 	if ( (tag & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) {
-		goto done;
+		return tag;
 	}
 
-	do {
-		if ( rest <= 0 ) {
-			break;
+	for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
+		if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) {
+			return LBER_DEFAULT;
 		}
+
 		tag <<= 8;
-		tag |= *ptr++ & 0xffU;
-		rest--;
+		tag |= 0x00ffUL & (ber_tag_t) xbyte;
 
-		if ( ! (tag & LBER_MORE_TAG_MASK) ) {
-			goto done;
+		if ( ! (xbyte & LBER_MORE_TAG_MASK) ) {
+			break;
 		}
-	} while ( tag <= (ber_tag_t)-1 / 256 );
-
- fail:
-	/* Error or unsupported tag size */
-	tag = LBER_DEFAULT;
-
- done:
-	bv->bv_len = rest;
-	bv->bv_val = (char *) ptr;
-	return tag;
-}
+	}
 
-/* Return the tag - LBER_DEFAULT returned means trouble */
-ber_tag_t
-ber_get_tag( BerElement *ber )
-{
-	struct berval bv;
-	ber_tag_t tag = ber_tag_and_rest( ber, &bv );
+	/* tag too big! */
+	if ( i == sizeof(ber_tag_t) ) {
+		return LBER_DEFAULT;
+	}
 
-	ber->ber_ptr = bv.bv_val;
 	return tag;
 }
 
-/* Return next element's tag and point *bv at its contents in-place */
 ber_tag_t
-ber_peek_element( const BerElement *ber, struct berval *bv )
+ber_skip_tag( BerElement *ber, ber_len_t *len )
 {
 	ber_tag_t	tag;
-	ber_len_t	len, rest;
-	unsigned	i;
-	unsigned char *ptr;
+	unsigned char	lc;
+	char		*save;
 
-	assert( bv != NULL );
+	assert( ber != NULL );
+	assert( len != NULL );
+	assert( LBER_VALID( ber ) );
+
+	save = ber->ber_ptr;
 
 	/*
 	 * Any ber element looks like this: tag length contents.
-	 * Assuming everything's ok, we return the tag, and point
-	 * bv at the contents.
+	 * Assuming everything's ok, we return the tag byte (we
+	 * can assume a single byte), and return the length in len.
 	 *
 	 * Assumptions:
 	 *	1) definite lengths
 	 *	2) primitive encodings used whenever possible
 	 */
 
-	len = 0;
+	*len = 0;
 
 	/*
 	 * First, we read the tag.
 	 */
-	tag = ber_tag_and_rest( ber, bv );
 
-	rest = bv->bv_len;
-	ptr = (unsigned char *) bv->bv_val;
-	if ( tag == LBER_DEFAULT || rest == 0 ) {
-		goto fail;
+	if ( (tag = ber_get_tag( ber )) == LBER_DEFAULT ) {
+		return LBER_DEFAULT;
 	}
 
 	/*
-	 * Next, read the length.  The first octet determines the length
-	 * of the length.	If bit 8 is 0, the length is the short form,
-	 * otherwise if the octet != 0x80 it's the long form, otherwise
-	 * the ber element has the unsupported indefinite-length format.
-	 * Lengths that do not fit in a ber_len_t are not accepted.
+	 * Next, read the length.  The first byte contains the length of
+	 * 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
+	 * greater than what we can hold in a ber_len_t.
 	 */
 
-	len = *ptr++;
-	rest--;
+	if ( ber_read( ber, (char *) &lc, 1 ) != 1 ) {
+		return LBER_DEFAULT;
+	}
 
-	if ( len & 0x80U ) {
-		len &= 0x7fU;
-		if ( len - 1U > sizeof(ber_len_t) - 1U || rest < len ) {
-			/* Indefinite-length/too long length/not enough data */
-			goto fail;
-		}
+	if ( lc & 0x80U ) {
+		ber_len_t	i, noctets;
+		unsigned char netlen[sizeof(ber_len_t)];
+
+		noctets = (lc & 0x7fU);
 
-		rest -= len;
-		i = len;
-		for( len = *ptr++ & 0xffU; --i; len |= *ptr++ & 0xffU ) {
-			len <<= 8;
+		if ( noctets > sizeof(ber_len_t) ) {
+			return LBER_DEFAULT;
 		}
-	}
 
-	/* BER element should have enough data left */
-	if( len > rest ) {
-	fail:
-		tag = LBER_DEFAULT;
-	}
+		if( (unsigned) ber_read( ber, (char *) netlen, noctets ) != noctets ) {
+			return LBER_DEFAULT;
+		}
 
-	bv->bv_len = len;
-	bv->bv_val = (char *) ptr;
-	return tag;
-}
+		for( i = 0; i < noctets; i++ ) {
+			*len <<= 8;
+			*len |= netlen[i];
+		}
 
-/* Move past next element, point *bv at it in-place, and return its tag.
- * The caller may \0-terminate *bv, as next octet is saved in ber->ber_tag.
- * Similar to ber_get_stringbv(ber, bv, LBER_BV_NOTERM) except on error.
- */
-ber_tag_t
-ber_skip_element( BerElement *ber, struct berval *bv )
-{
-	ber_tag_t tag = ber_peek_element( ber, bv );
+	} else {
+		*len = lc;
+	}
 
-	if ( tag != LBER_DEFAULT ) {
-		ber->ber_ptr = bv->bv_val + bv->bv_len;
-		ber->ber_tag = *(unsigned char *) ber->ber_ptr;
+	/* BER element should have enough data left */
+	if( *len > (ber_len_t) (ber_pvt_ber_remaining( ber ) + ber->ber_ptr - save) ) {
+		return LBER_DEFAULT;
 	}
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
 
 	return tag;
 }
@@ -239,54 +219,58 @@ ber_peek_tag(
 	BerElement *ber,
 	ber_len_t *len )
 {
-	struct berval bv;
-	ber_tag_t tag = ber_peek_element( ber, &bv );
-
-	*len = bv.bv_len;
-	return tag;
-}
+	/*
+	 * This implementation assumes ber_skip_tag() only
+	 * modifies ber_ptr field of the BerElement.
+	 */
 
-ber_tag_t
-ber_skip_tag( BerElement *ber, ber_len_t *lenp )
-{
-	struct berval bv;
-	ber_tag_t tag = ber_peek_element( ber, &bv );
+	char *save;
+	ber_tag_t	tag, old;
 
-	ber->ber_ptr = bv.bv_val;
-	ber->ber_tag = *(unsigned char *) ber->ber_ptr;
+	old = ber->ber_tag;
+	save = ber->ber_ptr;
+	tag = ber_skip_tag( ber, len );
+	ber->ber_ptr = save;
+	ber->ber_tag = old;
 
-	*lenp = bv.bv_len;
 	return tag;
 }
 
-ber_tag_t
-ber_get_int(
+static ber_len_t
+ber_getnint(
 	BerElement *ber,
-	ber_int_t *num )
+	ber_int_t *num,
+	ber_len_t len )
 {
-	ber_tag_t	tag;
-	ber_len_t	len;
-	struct berval bv;
+	unsigned char buf[sizeof(ber_int_t)];
 
+	assert( ber != NULL );
 	assert( num != NULL );
+	assert( LBER_VALID( ber ) );
 
-	tag = ber_skip_element( ber, &bv );
-	len = bv.bv_len;
-	if ( tag == LBER_DEFAULT || len > sizeof(ber_int_t) ) {
-		return LBER_DEFAULT;
+	/*
+	 * The tag and length have already been stripped off.  We should
+	 * be sitting right before len bytes of 2's complement integer,
+	 * ready to be read straight into an int.  We may have to sign
+	 * extend after we read it in.
+	 */
+
+	if ( len > sizeof(ber_int_t) ) {
+		return -1;
+	}
+
+	/* read into the low-order bytes of our buffer */
+	if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) {
+		return -1;
 	}
 
-	/* parse two's complement integer */
 	if( len ) {
-		unsigned char *buf = (unsigned char *) bv.bv_val;
+		/* sign extend if necessary */
 		ber_len_t i;
-		ber_int_t netnum = buf[0] & 0xff;
-
-		/* sign extend */
-		netnum = (netnum ^ 0x80) - 0x80;
+		ber_int_t netnum = 0x80 & buf[0] ? -1 : 0;
 
 		/* shift in the bytes */
-		for( i = 1; i < len; i++ ) {
+		for( i=0 ; i<len; i++ ) {
 			netnum = (netnum << 8 ) | buf[i];
 		}
 
@@ -295,7 +279,30 @@ ber_get_int(
 	} else {
 		*num = 0;
 	}
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
+
+	return len;
+}
+
+ber_tag_t
+ber_get_int(
+	BerElement *ber,
+	ber_int_t *num )
+{
+	ber_tag_t	tag;
+	ber_len_t	len;
+
+	assert( ber != NULL );
+	assert( LBER_VALID( ber ) );
+
+	if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
+		return LBER_DEFAULT;
+	}
 
+	if ( ber_getnint( ber, num, len ) != len ) {
+		return LBER_DEFAULT;
+	}
+	
 	return tag;
 }
 
@@ -313,22 +320,29 @@ ber_get_stringb(
 	char *buf,
 	ber_len_t *len )
 {
-	struct berval bv;
+	ber_len_t	datalen;
 	ber_tag_t	tag;
 
-	if ( (tag = ber_skip_element( ber, &bv )) == LBER_DEFAULT ) {
+	assert( ber != NULL );
+	assert( LBER_VALID( ber ) );
+
+	if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
 		return LBER_DEFAULT;
 	}
 
 	/* must fit within allocated space with termination */
-	if ( bv.bv_len >= *len ) {
+	if ( datalen >= *len ) {
+		return LBER_DEFAULT;
+	}
+
+	if ( (ber_len_t) ber_read( ber, buf, datalen ) != datalen ) {
 		return LBER_DEFAULT;
 	}
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
 
-	memcpy( buf, bv.bv_val, bv.bv_len );
-	buf[bv.bv_len] = '\0';
+	buf[datalen] = '\0';
 
-	*len = bv.bv_len;
+	*len = datalen;
 	return tag;
 }
 
@@ -344,132 +358,131 @@ enum bgbvc { ChArray, BvArray, BvVec, Bv
  * stack use to the absolute minimum.
  */
 typedef struct bgbvr {
-	const enum bgbvc choice;
-	const int alloc;	/* choice == BvOff ? 0 : LBER_ALLOC */
-	ber_len_t siz;		/* input array element size, output count */
-	ber_len_t off;		/* BvOff offset to the struct berval */
-	void *result;
+	enum bgbvc choice;
+	BerElement *ber;
+	int alloc;
+	ber_len_t siz;
+	ber_len_t off;
+	union {
+		char ***c;
+		BerVarray *ba;
+		struct berval ***bv;
+	} res;
 } bgbvr;
 
 static ber_tag_t
-ber_get_stringbvl( BerElement *ber, bgbvr *b )
+ber_get_stringbvl( bgbvr *b, ber_len_t *rlen )
 {
 	int i = 0, n;
 	ber_tag_t tag;
-	ber_len_t tot_size = 0, siz = b->siz;
+	ber_len_t len;
 	char *last, *orig;
 	struct berval bv, *bvp = NULL;
-	union stringbvl_u {
-		char **ca;				/* ChArray */
-		BerVarray ba;			/* BvArray */
-		struct berval **bv;		/* BvVec */
-		char *bo;				/* BvOff */
-	} res;
 
-	tag = ber_skip_tag( ber, &bv.bv_len );
-
-	if ( tag != LBER_DEFAULT ) {
-		tag = 0;
-		orig = ber->ber_ptr;
-		last = orig + bv.bv_len;
-
-		for ( ; ber->ber_ptr < last; i++, tot_size += siz ) {
-			if ( ber_skip_element( ber, &bv ) == LBER_DEFAULT )
-				break;
+	/* For rewinding, just like ber_peek_tag() */
+	orig = b->ber->ber_ptr;
+	tag = b->ber->ber_tag;
+
+	if ( ber_first_element( b->ber, &len, &last ) != LBER_DEFAULT ) {
+		for ( ; b->ber->ber_ptr < last; i++ ) {
+			if (ber_skip_tag( b->ber, &len ) == LBER_DEFAULT) break;
+			b->ber->ber_ptr += len;
+			b->ber->ber_tag = *(unsigned char *)b->ber->ber_ptr;
 		}
-		if ( ber->ber_ptr != last ) {
-			i = 0;
-			tag = LBER_DEFAULT;
-		}
-
-		ber->ber_ptr = orig;
-		ber->ber_tag = *(unsigned char *) orig;
 	}
 
-	b->siz = i;
+	if ( rlen ) *rlen = i;
+
 	if ( i == 0 ) {
-		return tag;
+		*b->res.c = NULL;
+		return 0;
 	}
 
-	/* Allocate and NULL-terminate the result vector */
-	b->result = ber_memalloc_x( tot_size + siz, ber->ber_memctx );
-	if ( b->result == NULL ) {
-		return LBER_DEFAULT;
-	}
+	n = i;
+
+	/* Allocate the result vector */
 	switch (b->choice) {
 	case ChArray:
-		res.ca = b->result;
-		res.ca[i] = NULL;
+		*b->res.c = ber_memalloc_x( (n+1)*sizeof( char * ),
+			b->ber->ber_memctx);
+		if ( *b->res.c == NULL ) return LBER_DEFAULT;
+		(*b->res.c)[n] = NULL;
 		break;
 	case BvArray:
-		res.ba = b->result;
-		res.ba[i].bv_val = NULL;
+		*b->res.ba = ber_memalloc_x( (n+1)*sizeof( struct berval ),
+			b->ber->ber_memctx);
+		if ( *b->res.ba == NULL ) return LBER_DEFAULT;
+		(*b->res.ba)[n].bv_val = NULL;
 		break;
 	case BvVec:
-		res.bv = b->result;
-		res.bv[i] = NULL;
+		*b->res.bv = ber_memalloc_x( (n+1)*sizeof( struct berval *),
+			b->ber->ber_memctx);
+		if ( *b->res.bv == NULL ) return LBER_DEFAULT;
+		(*b->res.bv)[n] = NULL;
 		break;
 	case BvOff:
-		res.bo = (char *) b->result + b->off;
-		((struct berval *) (res.bo + tot_size))->bv_val = NULL;
-		tot_size = 0;
+		*b->res.ba = ber_memalloc_x( (n+1) * b->siz, b->ber->ber_memctx );
+		if ( *b->res.ba == NULL ) return LBER_DEFAULT;
+		((struct berval *)((char *)(*b->res.ba) + n*b->siz +
+			b->off))->bv_val = NULL;
 		break;
 	}
-
-	n = 0;
-	do {
-		tag = ber_get_stringbv( ber, &bv, b->alloc );
-		if ( tag == LBER_DEFAULT ) {
+	b->ber->ber_ptr = orig;
+	b->ber->ber_tag = tag;
+	ber_skip_tag( b->ber, &len );
+	
+	for (n=0; n<i; n++)
+	{
+		tag = ber_next_element( b->ber, &len, last );
+		if ( ber_get_stringbv( b->ber, &bv, b->alloc ) == LBER_DEFAULT ) {
 			goto nomem;
 		}
 
 		/* store my result */
 		switch (b->choice) {
 		case ChArray:
-			res.ca[n] = bv.bv_val;
+			(*b->res.c)[n] = bv.bv_val;
 			break;
 		case BvArray:
-			res.ba[n] = bv;
+			(*b->res.ba)[n] = bv;
 			break;
 		case BvVec:
-			bvp = ber_memalloc_x( sizeof( struct berval ),
-				ber->ber_memctx );
+			bvp = ber_memalloc_x( sizeof( struct berval ), b->ber->ber_memctx);
 			if ( !bvp ) {
-				ber_memfree_x( bv.bv_val, ber->ber_memctx );
+				LBER_FREE(bv.bv_val);
 				goto nomem;
 			}
-			res.bv[n] = bvp;
+			(*b->res.bv)[n] = bvp;
 			*bvp = bv;
 			break;
 		case BvOff:
-			*(struct berval *)(res.bo + tot_size) = bv;
-			tot_size += siz;
+			*(BerVarray)((char *)(*b->res.ba)+n*b->siz+b->off) = bv;
 			break;
 		}
-	} while (++n < i);
+	}
 	return tag;
 
 nomem:
-	if (b->choice != BvOff) {	/* BvOff does not have b->alloc set */
-		while (--n >= 0) {
+	if (b->alloc || b->choice == BvVec) {
+		for (--n; n>=0; n--) {
 			switch(b->choice) {
 			case ChArray:
-				ber_memfree_x(res.ca[n], ber->ber_memctx);
+				LBER_FREE((*b->res.c)[n]);
 				break;
 			case BvArray:
-				ber_memfree_x(res.ba[n].bv_val, ber->ber_memctx);
+				LBER_FREE((*b->res.ba)[n].bv_val);
 				break;
 			case BvVec:
-				ber_memfree_x(res.bv[n]->bv_val, ber->ber_memctx);
-				ber_memfree_x(res.bv[n], ber->ber_memctx);
+				LBER_FREE((*b->res.bv)[n]->bv_val);
+				LBER_FREE((*b->res.bv)[n]);
 				break;
 			default:
 				break;
 			}
 		}
 	}
-	ber_memfree_x(b->result, ber->ber_memctx);
-	b->result = NULL;
+	LBER_FREE(*b->res.c);
+	*b->res.c = NULL;
 	return LBER_DEFAULT;
 }
 
@@ -477,15 +490,21 @@ ber_tag_t
 ber_get_stringbv( BerElement *ber, struct berval *bv, int option )
 {
 	ber_tag_t	tag;
-	char		*data;
 
-	tag = ber_skip_element( ber, bv );
-	if ( tag == LBER_DEFAULT ) {
+	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 tag;
+		return LBER_DEFAULT;
+	}
+
+	if ( (ber_len_t) ber_pvt_ber_remaining( ber ) < bv->bv_len ) {
+		return LBER_DEFAULT;
 	}
 
-	data = bv->bv_val;
 	if ( option & LBER_BV_ALLOC ) {
 		bv->bv_val = (char *) ber_memalloc_x( bv->bv_len + 1,
 			ber->ber_memctx );
@@ -493,13 +512,20 @@ ber_get_stringbv( BerElement *ber, struc
 			return LBER_DEFAULT;
 		}
 
-		if ( bv->bv_len != 0 ) {
-			memcpy( bv->bv_val, data, bv->bv_len );
+		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;
 		}
-		data = bv->bv_val;
+	} else {
+		bv->bv_val = ber->ber_ptr;
+		ber->ber_ptr += bv->bv_len;
 	}
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
 	if ( !( option & LBER_BV_NOTERM ))
-		data[bv->bv_len] = '\0';
+		bv->bv_val[bv->bv_len] = '\0';
 
 	return tag;
 }
@@ -508,15 +534,27 @@ ber_tag_t
 ber_get_stringbv_null( BerElement *ber, struct berval *bv, int option )
 {
 	ber_tag_t	tag;
-	char		*data;
 
-	tag = ber_skip_element( ber, bv );
-	if ( tag == LBER_DEFAULT || bv->bv_len == 0 ) {
+	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;
 	}
 
-	data = bv->bv_val;
 	if ( option & LBER_BV_ALLOC ) {
 		bv->bv_val = (char *) ber_memalloc_x( bv->bv_len + 1,
 			ber->ber_memctx );
@@ -524,11 +562,20 @@ ber_get_stringbv_null( BerElement *ber,
 			return LBER_DEFAULT;
 		}
 
-		memcpy( bv->bv_val, data, bv->bv_len );
-		data = bv->bv_val;
+		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;
 	if ( !( option & LBER_BV_NOTERM ))
-		data[bv->bv_len] = '\0';
+		bv->bv_val[bv->bv_len] = '\0';
 
 	return tag;
 }
@@ -577,7 +624,7 @@ ber_get_stringal( BerElement *ber, struc
 
 	tag = ber_get_stringbv( ber, *bv, LBER_BV_ALLOC );
 	if ( tag == LBER_DEFAULT ) {
-		ber_memfree_x( *bv, ber->ber_memctx );
+		LBER_FREE( *bv );
 		*bv = NULL;
 	}
 	return tag;
@@ -589,46 +636,63 @@ ber_get_bitstringa(
 	char **buf,
 	ber_len_t *blen )
 {
+	ber_len_t	datalen;
 	ber_tag_t	tag;
-	struct berval	data;
 	unsigned char	unusedbits;
 
+	assert( ber != NULL );
 	assert( buf != NULL );
 	assert( blen != NULL );
 
-	if ( (tag = ber_skip_element( ber, &data )) == LBER_DEFAULT ) {
-		goto fail;
+	assert( LBER_VALID( ber ) );
+
+	if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
+		*buf = NULL;
+		return LBER_DEFAULT;
 	}
+	--datalen;
 
-	if ( --data.bv_len > (ber_len_t)-1 / 8 ) {
-		goto fail;
+	*buf = (char *) ber_memalloc_x( datalen, ber->ber_memctx );
+	if ( *buf == NULL ) {
+		return LBER_DEFAULT;
 	}
-	unusedbits = *(unsigned char *) data.bv_val++;
-	if ( unusedbits > 7 ) {
-		goto fail;
+
+	if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
+		LBER_FREE( buf );
+		*buf = NULL;
+		return LBER_DEFAULT;
 	}
 
-	*buf = (char *) ber_memalloc_x( data.bv_len, ber->ber_memctx );
-	if ( *buf == NULL ) {
+	if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
+		LBER_FREE( buf );
+		*buf = NULL;
 		return LBER_DEFAULT;
 	}
-	memcpy( *buf, data.bv_val, data.bv_len );
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
 
-	*blen = data.bv_len * 8 - unusedbits;
+	*blen = datalen * 8 - unusedbits;
 	return tag;
-
- fail:
-	*buf = NULL;
-	return LBER_DEFAULT;
 }
 
 ber_tag_t
 ber_get_null( BerElement *ber )
 {
 	ber_len_t	len;
-	ber_tag_t	tag = ber_skip_tag( ber, &len );
+	ber_tag_t	tag;
+
+	assert( ber != NULL );
+	assert( LBER_VALID( ber ) );
+
+	if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
+		return LBER_DEFAULT;
+	}
 
-	return( len == 0 ? tag : LBER_DEFAULT );
+	if ( len != 0 ) {
+		return LBER_DEFAULT;
+	}
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
+
+	return( tag );
 }
 
 ber_tag_t
@@ -636,7 +700,18 @@ ber_get_boolean(
 	BerElement *ber,
 	ber_int_t *boolval )
 {
-	return ber_get_int( ber, boolval );
+	ber_int_t	longbool;
+	ber_tag_t	rc;
+
+	assert( ber != NULL );
+	assert( boolval != NULL );
+
+	assert( LBER_VALID( ber ) );
+
+	rc = ber_get_int( ber, &longbool );
+	*boolval = longbool;
+
+	return rc;
 }
 
 ber_tag_t
@@ -645,6 +720,8 @@ ber_first_element(
 	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 */
@@ -652,10 +729,11 @@ ber_first_element(
 		*last = NULL;
 		return LBER_DEFAULT;
 	}
+	ber->ber_tag = *(unsigned char *)ber->ber_ptr;
 
 	*last = ber->ber_ptr + *len;
 
-	if ( *len == 0 ) {
+	if ( *last == ber->ber_ptr ) {
 		return LBER_DEFAULT;
 	}
 
@@ -669,7 +747,9 @@ ber_next_element(
 	LDAP_CONST char *last )
 {
 	assert( ber != NULL );
+	assert( len != NULL );
 	assert( last != NULL );
+
 	assert( LBER_VALID( ber ) );
 
 	if ( ber->ber_ptr >= last ) {
@@ -687,8 +767,8 @@ ber_scanf ( BerElement *ber,
 {
 	va_list		ap;
 	LDAP_CONST char		*fmt_reset;
-	char		*s, **ss, ***sss;
-	struct berval	data, *bval, **bvp, ***bvpp;
+	char		*s, **ss;
+	struct berval	**bvp, *bval;
 	ber_int_t	*i;
 	ber_len_t	*l;
 	ber_tag_t	*t;
@@ -699,6 +779,7 @@ ber_scanf ( BerElement *ber,
 
 	assert( ber != NULL );
 	assert( fmt != NULL );
+
 	assert( LBER_VALID( ber ) );
 
 	fmt_reset = fmt;
@@ -746,7 +827,7 @@ ber_scanf ( BerElement *ber,
 			break;
 
 		case 'e':	/* enumerated */
-		case 'i':	/* integer */
+		case 'i':	/* int */
 			i = va_arg( ap, ber_int_t * );
 			rc = ber_get_int( ber, i );
 			break;
@@ -767,14 +848,14 @@ ber_scanf ( BerElement *ber,
 				 * len ptr on finish. parsed in-place.
 				 */
 		{
-			bgbvr cookie = { BvOff, 0 };
-			bvp = va_arg( ap, struct berval ** );
+			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( ber, &cookie );
-			*bvp = cookie.result;
-			*l = cookie.siz;
+			rc = ber_get_stringbvl( &cookie, l );
 			break;
 		}
 
@@ -810,47 +891,46 @@ ber_scanf ( BerElement *ber,
 
 		case 'v':	/* sequence of strings */
 		{
-			bgbvr cookie = {
-				ChArray, LBER_BV_ALLOC, sizeof( char * )
-			};
-			rc = ber_get_stringbvl( ber, &cookie );
-			*(va_arg( ap, char *** )) = cookie.result;
+			bgbvr cookie = { ChArray };
+			cookie.ber = ber;
+			cookie.res.c = va_arg( ap, char *** );
+			cookie.alloc = LBER_BV_ALLOC;
+			rc = ber_get_stringbvl( &cookie, NULL );
 			break;
 		}
 
 		case 'V':	/* sequence of strings + lengths */
 		{
-			bgbvr cookie = {
-				BvVec, LBER_BV_ALLOC, sizeof( struct berval * )
-			};
-			rc = ber_get_stringbvl( ber, &cookie );
-			*(va_arg( ap, struct berval *** )) = cookie.result;
+			bgbvr cookie = { BvVec };
+			cookie.ber = ber;
+			cookie.res.bv = va_arg( ap, struct berval *** );
+			cookie.alloc = LBER_BV_ALLOC;
+			rc = ber_get_stringbvl( &cookie, NULL );
 			break;
 		}
 
 		case 'W':	/* bvarray */
 		{
-			bgbvr cookie = {
-				BvArray, LBER_BV_ALLOC, sizeof( struct berval )
-			};
-			rc = ber_get_stringbvl( ber, &cookie );
-			*(va_arg( ap, struct berval ** )) = cookie.result;
+			bgbvr cookie = { BvArray };
+			cookie.ber = ber;
+			cookie.res.ba = va_arg( ap, struct berval ** );
+			cookie.alloc = LBER_BV_ALLOC;
+			rc = ber_get_stringbvl( &cookie, NULL );
 			break;
 		}
 
 		case 'x':	/* skip the next element - whatever it is */
-			rc = ber_skip_element( ber, &data );
+			if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
+				break;
+			ber->ber_ptr += len;
+			ber->ber_tag = *(unsigned char *)ber->ber_ptr;
 			break;
 
 		case '{':	/* begin sequence */
 		case '[':	/* begin set */
-			switch ( fmt[1] ) {
-			case 'v': case 'V': case 'W': case 'M':
-				break;
-			default:
+			if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V'
+				&& *(fmt + 1) != 'W' && *(fmt + 1) != 'M' )
 				rc = ber_skip_tag( ber, &len );
-				break;
-			}
 			break;
 
 		case '}':	/* end sequence */
@@ -868,7 +948,6 @@ ber_scanf ( BerElement *ber,
 	}
 
 	va_end( ap );
-
 	if ( rc == LBER_DEFAULT ) {
 		/*
 		 * Error.  Reclaim malloced memory that was given to the caller.
@@ -891,48 +970,42 @@ ber_scanf ( BerElement *ber,
 		case 'a':	/* octet string - allocate storage as needed */
 		case 'A':
 			ss = va_arg( ap, char ** );
-			ber_memfree_x( *ss, ber->ber_memctx );
-			*ss = NULL;
+			if ( *ss ) {
+				LBER_FREE( *ss );
+				*ss = NULL;
+			}
 			break;
 
 		case 'b':	/* boolean */
 		case 'e':	/* enumerated */
-		case 'i':	/* integer */
-			(void) va_arg( ap, ber_int_t * );
+		case 'i':	/* int */
+			(void) va_arg( ap, int * );
 			break;
 
 		case 'l':	/* length of next item */
-			*(va_arg( ap, ber_len_t * )) = 0;
-			break;
-
-		case 'm':	/* berval in-place */
-			bval = va_arg( ap, struct berval * );
-			BER_BVZERO( bval );
-			break;
-
-		case 'M':	/* BVoff array in-place */
-			bvp = va_arg( ap, struct berval ** );
-			ber_memfree_x( *bvp, ber->ber_memctx );
-			*bvp = NULL;
-			*(va_arg( ap, ber_len_t * )) = 0;
-			(void) va_arg( ap, ber_len_t );
+			(void) va_arg( ap, ber_len_t * );
 			break;
 
 		case 'o':	/* octet string in a supplied berval */
 			bval = va_arg( ap, struct berval * );
-			ber_memfree_x( bval->bv_val, ber->ber_memctx );
-			BER_BVZERO( bval );
+			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 ** );
-			ber_bvfree_x( *bvp, ber->ber_memctx );
-			*bvp = NULL;
+			if ( *bvp ) {
+				ber_bvfree( *bvp );
+				*bvp = NULL;
+			}
 			break;
 
 		case 's':	/* octet string - in a buffer */
 			(void) va_arg( ap, char * );
-			*(va_arg( ap, ber_len_t * )) = 0;
+			(void) va_arg( ap, ber_len_t * );
 			break;
 
 		case 't':	/* tag of next item */
@@ -942,30 +1015,19 @@ ber_scanf ( BerElement *ber,
 
 		case 'B':	/* bit string - allocate storage as needed */
 			ss = va_arg( ap, char ** );
-			ber_memfree_x( *ss, ber->ber_memctx );
-			*ss = NULL;
+			if ( *ss ) {
+				LBER_FREE( *ss );
+				*ss = NULL;
+			}
 			*(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
 			break;
 
+		case 'm':	/* berval in-place */
+		case 'M':	/* BVoff array in-place */
+		case 'n':	/* null */
 		case 'v':	/* sequence of strings */
-			sss = va_arg( ap, char *** );
-			ber_memvfree_x( (void **) *sss, ber->ber_memctx );
-			*sss = NULL;
-			break;
-
 		case 'V':	/* sequence of strings + lengths */
-			bvpp = va_arg( ap, struct berval *** );
-			ber_bvecfree_x( *bvpp, ber->ber_memctx );
-			*bvpp = NULL;
-			break;
-
 		case 'W':	/* BerVarray */
-			bvp = va_arg( ap, struct berval ** );
-			ber_bvarray_free_x( *bvp, ber->ber_memctx );
-			*bvp = NULL;
-			break;
-
-		case 'n':	/* null */
 		case 'x':	/* skip the next element - whatever it is */
 		case '{':	/* begin sequence */
 		case '[':	/* begin set */