X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=libraries%2Fliblber%2Fdecode.c;h=ca24e89c3887ce58416fd44c5863d51a674ecd55;hb=8045b54124f0365b3d34d9d3220256f052f2b76b;hp=bef41fa7540ac08061d28b64ef95e0f37b825492;hpb=eaedc9228b091a31b036c5c501a7fef0dd4bd8c4;p=openldap diff --git a/libraries/liblber/decode.c b/libraries/liblber/decode.c index bef41fa754..ca24e89c38 100644 --- a/libraries/liblber/decode.c +++ b/libraries/liblber/decode.c @@ -1,6 +1,7 @@ /* decode.c - ber input decoding routines */ +/* $OpenLDAP$ */ /* - * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved. + * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved. * COPYING RESTRICTIONS APPLY, see COPYRIGHT file */ /* Portions @@ -18,59 +19,68 @@ #include "portable.h" #include -#include -#include +#include +#include #include #include #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 */ -unsigned long +ber_tag_t ber_get_tag( BerElement *ber ) { unsigned char xbyte; - unsigned long tag; - char *tagp; + ber_tag_t tag; unsigned int i; + assert( ber != NULL ); + assert( BER_VALID( ber ) ); + if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) return( LBER_DEFAULT ); + tag = xbyte; + if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) - return( (unsigned long) xbyte ); + return tag; - tagp = (char *) &tag; - 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 ) return( LBER_DEFAULT ); - tagp[i] = xbyte; + tag <<= 8; + tag |= 0x00ffUL & (ber_tag_t) xbyte; if ( ! (xbyte & LBER_MORE_TAG_MASK) ) break; } /* tag too big! */ - if ( i == sizeof(long) ) + if ( i == sizeof(ber_tag_t) ) return( LBER_DEFAULT ); - /* want leading, not trailing 0's */ - return( tag >> (sizeof(long) - i - 1) ); + return tag; } -unsigned long -ber_skip_tag( BerElement *ber, unsigned long *len ) +ber_tag_t +ber_skip_tag( BerElement *ber, ber_len_t *len ) { - unsigned long tag; + ber_tag_t tag; unsigned char lc; - int noctets, diff; - unsigned long netlen; + ber_len_t i, noctets; + 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. @@ -82,6 +92,8 @@ ber_skip_tag( BerElement *ber, unsigned long *len ) * 2) primitive encodings used whenever possible */ + *len = 0; + /* * First, we read the tag. */ @@ -93,21 +105,28 @@ ber_skip_tag( BerElement *ber, unsigned long *len ) * 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 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 ) return( LBER_DEFAULT ); - if ( lc & 0x80 ) { - noctets = (lc & 0x7f); - if ( noctets > sizeof(unsigned long) ) + + if ( lc & 0x80U ) { + noctets = (lc & 0x7fU); + + if ( noctets > sizeof(ber_len_t) ) { 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 ); - *len = AC_NTOHL( netlen ); + } + + for( i = 0; i < noctets; i++ ) { + *len <<= 8; + *len |= netlen[i]; + } + } else { *len = lc; } @@ -115,25 +134,45 @@ ber_skip_tag( BerElement *ber, unsigned long *len ) return( tag ); } -unsigned long -ber_peek_tag( BerElement *ber, unsigned long *len ) +ber_tag_t +ber_peek_tag( + BerElement *ber_in, + ber_len_t *len ) { - char *save; - unsigned long tag; + ber_tag_t 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 ); - ber->ber_ptr = save; + ber_free( ber, 0 ); return( tag ); } -static int -ber_getnint( BerElement *ber, long *num, int len ) +static ber_len_t +ber_getnint( + BerElement *ber, + ber_int_t *num, + ber_len_t len ) { - int diff, sign, i; - long netnum; - char *p; + unsigned char buf[sizeof(ber_int_t)]; + + assert( ber != NULL ); + assert( num != NULL ); + + assert( BER_VALID( ber ) ); /* * The tag and length have already been stripped off. We should @@ -142,56 +181,83 @@ ber_getnint( BerElement *ber, long *num, int len ) * extend after we read it in. */ - if ( len > sizeof(long) ) + if ( len > sizeof(ber_int_t) ) return( -1 ); - netnum = 0; - diff = sizeof(long) - len; - /* read into the low-order bytes of netnum */ - if ( ber_read( ber, ((char *) &netnum) + diff, len ) != len ) + /* read into the low-order bytes of our buffer */ + if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) { return( -1 ); + } + + if( len ) { + /* sign extend if necessary */ + ber_len_t i; + ber_int_t netnum = 0x80 & buf[0] ? -1 : 0; - /* sign extend if necessary */ - p = (char *) &netnum; - sign = (0x80 & *(p+diff) ); - if ( sign && len < sizeof(long) ) { - for ( i = 0; i < diff; i++ ) { - *(p+i) = (unsigned char) 0xff; + /* shift in the bytes */ + for( i=0 ; i (*len - 1) ) 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 ); buf[datalen] = '\0'; @@ -206,11 +272,11 @@ ber_get_stringb( BerElement *ber, char *buf, unsigned long *len ) return( LBER_DEFAULT ); } if ( datalen > *len ) { - free( transbuf ); + LBER_FREE( transbuf ); return( LBER_DEFAULT ); } SAFEMEMCPY( buf, transbuf, datalen ); - free( transbuf ); + LBER_FREE( transbuf ); --datalen; } #endif /* STR_TRANSLATION */ @@ -219,21 +285,27 @@ ber_get_stringb( BerElement *ber, char *buf, unsigned long *len ) return( tag ); } -unsigned long +ber_tag_t 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 ) { *buf = NULL; return( LBER_DEFAULT ); } - if ( (*buf = (char *) malloc( (size_t)datalen + 1 )) == NULL ) + if ( (*buf = (char *) LBER_MALLOC( datalen + 1 )) == NULL ) return( LBER_DEFAULT ); - if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen ) { - free( *buf ); + if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) { + LBER_FREE( *buf ); *buf = NULL; return( LBER_DEFAULT ); } @@ -245,7 +317,7 @@ ber_get_stringa( BerElement *ber, char **buf ) ++datalen; if ( (*(ber->ber_decode_translate_proc))( buf, &datalen, 1 ) != 0 ) { - free( *buf ); + LBER_FREE( *buf ); *buf = NULL; return( LBER_DEFAULT ); } @@ -255,26 +327,32 @@ ber_get_stringa( BerElement *ber, char **buf ) return( tag ); } -unsigned long +ber_tag_t 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 ) { *bv = NULL; 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 ); - if ( ((*bv)->bv_val = (char *) malloc( (size_t)len + 1 )) == NULL ) { - free( *bv ); + if ( ((*bv)->bv_val = (char *) LBER_MALLOC( len + 1 )) == NULL ) { + LBER_FREE( *bv ); *bv = NULL; 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 ); @@ -299,29 +377,39 @@ ber_get_stringal( BerElement *ber, struct berval **bv ) return( tag ); } -unsigned long -ber_get_bitstringa( BerElement *ber, char **buf, unsigned long *blen ) +ber_tag_t +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; + 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 ); } --datalen; - if ( (*buf = (char *) malloc( (size_t)datalen )) == NULL ) + if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) return( LBER_DEFAULT ); if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) { - free( buf ); + LBER_FREE( buf ); *buf = NULL; return( LBER_DEFAULT ); } - if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen ) { - free( buf ); + if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) { + LBER_FREE( buf ); *buf = NULL; return( LBER_DEFAULT ); } @@ -330,10 +418,14 @@ ber_get_bitstringa( BerElement *ber, char **buf, unsigned long *blen ) return( tag ); } -unsigned long +ber_tag_t 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 ) return( LBER_DEFAULT ); @@ -344,11 +436,18 @@ ber_get_null( BerElement *ber ) return( tag ); } -unsigned long -ber_get_boolean( BerElement *ber, int *boolval ) +ber_tag_t +ber_get_boolean( + BerElement *ber, + ber_int_t *boolval ) { - long longbool; - int rc; + ber_int_t longbool; + ber_tag_t rc; + + assert( ber != NULL ); + assert( boolval != NULL ); + + assert( BER_VALID( ber ) ); rc = ber_get_int( ber, &longbool ); *boolval = longbool; @@ -356,9 +455,16 @@ ber_get_boolean( BerElement *ber, int *boolval ) return( rc ); } -unsigned long -ber_first_element( BerElement *ber, unsigned long *len, char **last ) +ber_tag_t +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 */ if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) { *last = NULL; @@ -368,91 +474,95 @@ ber_first_element( BerElement *ber, unsigned long *len, char **last ) *last = ber->ber_ptr + *len; if ( *last == ber->ber_ptr ) { -#ifdef LBER_END_SEQORSET - return( LBER_END_SEQORSET ); -#else return( LBER_DEFAULT ); -#endif } return( ber_peek_tag( ber, len ) ); } -unsigned long -ber_next_element( BerElement *ber, unsigned long *len, char *last ) +ber_tag_t +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 ) { -#ifdef LBER_END_SEQORSET - return( LBER_END_SEQORSET ); -#else return( LBER_DEFAULT ); -#endif } return( ber_peek_tag( ber, len ) ); } /* VARARGS */ -unsigned long -ber_scanf -#if HAVE_STDARG - ( BerElement *ber, char *fmt, ... ) -#else - ( va_alist ) -va_dcl -#endif +ber_tag_t +ber_scanf ( BerElement *ber, + LDAP_CONST char *fmt, + ... ) { va_list ap; -#ifndef HAVE_STDARG - BerElement *ber; - char *fmt; -#endif - char *fmt_reset; + LDAP_CONST char *fmt_reset; char *last; char *s, **ss, ***sss; struct berval ***bv, **bvp, *bval; - int *i, j; - long *l; - unsigned long rc, tag, len; + ber_int_t *i; + int j; + ber_len_t *l; + ber_tag_t *t; + ber_tag_t rc, tag; + ber_len_t len; -#ifdef HAVE_STDARG va_start( ap, fmt ); -#else - va_start( ap ); - ber = va_arg( ap, BerElement * ); - fmt = va_arg( ap, char * ); -#endif + + assert( ber != NULL ); + assert( fmt != NULL ); + + assert( BER_VALID( ber ) ); + fmt_reset = fmt; - if ( ber->ber_debug ) { - lber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug, - "ber_scanf fmt (%s) ber:\n", fmt ); - lber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 ); - } + 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++ ) { /* When this is modified, remember to update * the error-cleanup code below accordingly. */ 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 */ ss = va_arg( ap, char ** ); rc = ber_get_stringa( ber, ss ); break; case 'b': /* boolean */ - i = va_arg( ap, int * ); + i = va_arg( ap, ber_int_t * ); rc = ber_get_boolean( ber, i ); break; case 'e': /* enumerated */ case 'i': /* int */ - l = va_arg( ap, long * ); - rc = ber_get_int( ber, l ); + i = va_arg( ap, ber_int_t * ); + rc = ber_get_int( ber, i ); break; case 'l': /* length of next item */ - l = va_arg( ap, long * ); - rc = ber_peek_tag( ber, (unsigned long *)l ); + l = va_arg( ap, ber_len_t * ); + rc = ber_peek_tag( ber, l ); break; case 'n': /* null */ @@ -461,8 +571,8 @@ va_dcl case 's': /* octet string - in a buffer */ s = va_arg( ap, char * ); - l = va_arg( ap, long * ); - rc = ber_get_stringb( ber, s, (unsigned long *)l ); + l = va_arg( ap, ber_len_t * ); + rc = ber_get_stringb( ber, s, l ); break; case 'o': /* octet string in a supplied berval */ @@ -478,18 +588,18 @@ va_dcl case 'B': /* bit string - allocate storage as needed */ ss = va_arg( ap, char ** ); - l = va_arg( ap, long * ); /* for length, in bits */ - rc = ber_get_bitstringa( ber, ss, (unsigned long *)l ); + l = va_arg( ap, ber_len_t * ); /* for length, in bits */ + rc = ber_get_bitstringa( ber, ss, l ); break; case 't': /* tag of next item */ - i = va_arg( ap, int * ); - *i = rc = ber_peek_tag( ber, &len ); + t = va_arg( ap, ber_tag_t * ); + *t = rc = ber_peek_tag( ber, &len ); break; case 'T': /* skip tag of next item */ - i = va_arg( ap, int * ); - *i = rc = ber_skip_tag( ber, &len ); + t = va_arg( ap, ber_tag_t * ); + *t = rc = ber_skip_tag( ber, &len ); break; case 'v': /* sequence of strings */ @@ -497,30 +607,15 @@ va_dcl *sss = NULL; j = 0; for ( tag = ber_first_element( ber, &len, &last ); - tag != LBER_DEFAULT && -#ifdef LDAP_END_SEQORSET - tag != LBER_END_SEQORSET && -#endif - rc != LBER_DEFAULT; + tag != LBER_DEFAULT && rc != LBER_DEFAULT; tag = ber_next_element( ber, &len, last ) ) { - if ( *sss == NULL ) { - *sss = (char **) malloc( - 2 * sizeof(char *) ); - } else { - *sss = (char **) realloc( *sss, - (j + 2) * sizeof(char *) ); - } + *sss = (char **) LBER_REALLOC( *sss, + (j + 2) * sizeof(char *) ); + rc = ber_get_stringa( ber, &((*sss)[j]) ); j++; } -#ifdef LDAP_END_SEQORSET - if (rc != LBER_DEFAULT && - tag != LBER_END_SEQORSET ) - { - rc = LBER_DEFAULT; - } -#endif if ( j > 0 ) (*sss)[j] = NULL; break; @@ -530,30 +625,15 @@ va_dcl *bv = NULL; j = 0; for ( tag = ber_first_element( ber, &len, &last ); - tag != LBER_DEFAULT && -#ifdef LDAP_END_SEQORSET - tag != LBER_END_SEQORSET && -#endif - rc != LBER_DEFAULT; + tag != LBER_DEFAULT && rc != LBER_DEFAULT; tag = ber_next_element( ber, &len, last ) ) { - if ( *bv == NULL ) { - *bv = (struct berval **) malloc( - 2 * sizeof(struct berval *) ); - } else { - *bv = (struct berval **) realloc( *bv, - (j + 2) * sizeof(struct berval *) ); - } + *bv = (struct berval **) LBER_REALLOC( *bv, + (j + 2) * sizeof(struct berval *) ); + rc = ber_get_stringal( ber, &((*bv)[j]) ); j++; } -#ifdef LDAP_END_SEQORSET - if (rc != LBER_DEFAULT && - tag != LBER_END_SEQORSET ) - { - rc = LBER_DEFAULT; - } -#endif if ( j > 0 ) (*bv)[j] = NULL; break; @@ -576,7 +656,7 @@ va_dcl default: 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 ); } rc = LBER_DEFAULT; @@ -591,43 +671,52 @@ va_dcl * 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 for ( ; fmt_reset < fmt; 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 */ ss = va_arg( ap, char ** ); if ( *ss ) { - free( *ss ); + LBER_FREE( *ss ); *ss = NULL; } break; case 'b': /* boolean */ - case 't': /* tag of next item */ - case 'T': /* skip tag of next item */ + case 'e': /* enumerated */ + case 'i': /* int */ (void) va_arg( ap, int * ); break; case 's': /* octet string - in a buffer */ (void) va_arg( ap, char * ); - /* Fall through */ - case 'e': /* enumerated */ - case 'i': /* int */ + (void) va_arg( ap, ber_len_t * ); + break; + 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; case 'o': /* octet string in a supplied berval */ bval = va_arg( ap, struct berval * ); - if ( bval->bv_val ) { - free( bval->bv_val ); + if ( bval->bv_val != NULL ) { + LBER_FREE( bval->bv_val ); bval->bv_val = NULL; } bval->bv_len = 0; @@ -644,18 +733,20 @@ va_dcl case 'B': /* bit string - allocate storage as needed */ ss = va_arg( ap, char ** ); if ( *ss ) { - free( *ss ); + LBER_FREE( *ss ); *ss = NULL; } - *(va_arg( ap, long * )) = 0; /* for length, in bits */ + *(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++) - free( (*sss)[j] ); - free( *sss ); + for (j = 0; (*sss)[j]; j++) { + LBER_FREE( (*sss)[j] ); + (*sss)[j] = NULL; + } + LBER_FREE( *sss ); *sss = NULL; } break; @@ -668,15 +759,17 @@ va_dcl } break; -#if 0 /* No action for these format characters */ case 'n': /* null */ case 'x': /* skip the next element - whatever it is */ case '{': /* begin sequence */ case '[': /* begin set */ case '}': /* end sequence */ case ']': /* end set */ -#endif + break; + default: + /* format should be good */ + assert( 0 ); } } @@ -686,64 +779,15 @@ va_dcl 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 ) { + assert( ber != NULL ); + assert( BER_VALID( ber ) ); + ber->ber_encode_translate_proc = encode_proc; ber->ber_decode_translate_proc = decode_proc; }