version 1.30, 1999/05/29 03:16:31
|
version 1.129, 2009/11/04 10:17:03
|
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.128 2009/10/28 22:00:27 hallvard Exp $ */ |
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved. |
/* This work is part of OpenLDAP Software <http://www.openldap.org/>. |
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file |
* |
|
* Copyright 1998-2009 The OpenLDAP Foundation. |
|
* All rights reserved. |
|
* |
|
* Redistribution and use in source and binary forms, with or without |
|
* modification, are permitted only as authorized by the OpenLDAP |
|
* Public License. |
|
* |
|
* A copy of this license is available in the file LICENSE in the |
|
* top-level directory of the distribution or, alternatively, at |
|
* <http://www.OpenLDAP.org/license.html>. |
*/ |
*/ |
/* Portions |
/* 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. |
* |
* |
* Redistribution and use in source and binary forms are permitted |
* Redistribution and use in source and binary forms are permitted |
Line 14
|
Line 23
|
* software without specific prior written permission. This software |
* software without specific prior written permission. This software |
* is provided ``as is'' without express or implied warranty. |
* is provided ``as is'' without express or implied warranty. |
*/ |
*/ |
|
/* ACKNOWLEDGEMENTS: |
|
* This work was originally developed by the University of Michigan |
|
* (as part of U-MICH LDAP). |
|
*/ |
|
|
#include "portable.h" |
#include "portable.h" |
|
|
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
|
|
|
|
#include <ac/stdlib.h> |
#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" |
#include "lber-int.h" |
|
|
static int ber_getnint LDAP_P(( BerElement *ber, long *num, int len )); |
|
|
|
/* return the tag - LBER_DEFAULT returned means trouble */ |
/* out->bv_len should be the buffer size on input */ |
unsigned long |
int |
ber_get_tag( BerElement *ber ) |
ber_decode_oid( BerValue *in, BerValue *out ) |
|
{ |
|
const unsigned char *der; |
|
unsigned long val; |
|
unsigned val1; |
|
ber_len_t i; |
|
char *ptr; |
|
|
|
assert( in != NULL ); |
|
assert( out != NULL ); |
|
|
|
/* need 4 chars/inbyte + \0 for input={7f 7f 7f...} */ |
|
if ( !out->bv_val || (out->bv_len+3)/4 <= in->bv_len ) |
|
return -1; |
|
|
|
ptr = NULL; |
|
der = (unsigned char *) in->bv_val; |
|
val = 0; |
|
for ( i=0; i < in->bv_len; i++ ) { |
|
val |= der[i] & 0x7f; |
|
if ( !( der[i] & 0x80 )) { |
|
if ( ptr == NULL ) { |
|
/* Initial "x.y": val=x*40+y, x<=2, y<40 if x<2 */ |
|
ptr = out->bv_val; |
|
val1 = (val < 80 ? val/40 : 2); |
|
val -= val1*40; |
|
ptr += sprintf( ptr, "%u", val1 ); |
|
} |
|
ptr += sprintf( ptr, ".%lu", val ); |
|
val = 0; |
|
} else if ( val - 1UL < LBER_OID_COMPONENT_MAX >> 7 ) { |
|
val <<= 7; |
|
} else { |
|
/* val would overflow, or is 0 from invalid initial 0x80 octet */ |
|
return -1; |
|
} |
|
} |
|
if ( ptr == NULL || val != 0 ) |
|
return -1; |
|
|
|
out->bv_len = ptr - out->bv_val; |
|
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 ) |
{ |
{ |
unsigned char xbyte; |
ber_tag_t tag; |
unsigned long tag; |
ptrdiff_t rest; |
char *tagp; |
unsigned char *ptr; |
unsigned int i; |
|
|
|
assert( ber != NULL ); |
assert( ber != NULL ); |
assert( BER_VALID( ber ) ); |
assert( LBER_VALID( ber ) ); |
|
|
|
ptr = (unsigned char *) ber->ber_ptr; |
|
rest = (unsigned char *) ber->ber_end - ptr; |
|
if ( rest <= 0 ) { |
|
goto fail; |
|
} |
|
|
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) |
tag = ber->ber_tag; |
return( LBER_DEFAULT ); |
if ( (char *) ptr == ber->ber_buf ) { |
|
tag = *ptr; |
|
} |
|
ptr++; |
|
rest--; |
|
if ( (tag & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) { |
|
goto done; |
|
} |
|
|
if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) |
do { |
return( (unsigned long) xbyte ); |
if ( rest <= 0 ) { |
|
break; |
|
} |
|
tag <<= 8; |
|
tag |= *ptr++ & 0xffU; |
|
rest--; |
|
|
tagp = (char *) &tag; |
if ( ! (tag & LBER_MORE_TAG_MASK) ) { |
tagp[0] = xbyte; |
goto done; |
for ( i = 1; i < sizeof(long); i++ ) { |
} |
if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) |
} while ( tag <= (ber_tag_t)-1 / 256 ); |
return( LBER_DEFAULT ); |
|
|
|
tagp[i] = xbyte; |
fail: |
|
/* Error or unsupported tag size */ |
|
tag = LBER_DEFAULT; |
|
|
if ( ! (xbyte & LBER_MORE_TAG_MASK) ) |
done: |
break; |
bv->bv_len = rest; |
} |
bv->bv_val = (char *) ptr; |
|
return tag; |
|
} |
|
|
/* tag too big! */ |
/* Return the tag - LBER_DEFAULT returned means trouble */ |
if ( i == sizeof(long) ) |
ber_tag_t |
return( LBER_DEFAULT ); |
ber_get_tag( BerElement *ber ) |
|
{ |
|
struct berval bv; |
|
ber_tag_t tag = ber_tag_and_rest( ber, &bv ); |
|
|
/* want leading, not trailing 0's */ |
ber->ber_ptr = bv.bv_val; |
return( tag >> (sizeof(long) - i - 1) ); |
return tag; |
} |
} |
|
|
unsigned long |
/* Return next element's tag and point *bv at its contents in-place */ |
ber_skip_tag( BerElement *ber, unsigned long *len ) |
ber_tag_t |
|
ber_peek_element( const BerElement *ber, struct berval *bv ) |
{ |
{ |
unsigned long tag; |
ber_tag_t tag; |
unsigned char lc; |
ber_len_t len, rest; |
unsigned int noctets; |
unsigned i; |
int diff; |
unsigned char *ptr; |
unsigned long netlen; |
|
|
|
assert( ber != NULL ); |
assert( bv != 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. |
* Assuming everything's ok, we return the tag byte (we |
* Assuming everything's ok, we return the tag, and point |
* can assume a single byte), and return the length in len. |
* bv at the contents. |
* |
* |
* Assumptions: |
* Assumptions: |
* 1) definite lengths |
* 1) definite lengths |
* 2) primitive encodings used whenever possible |
* 2) primitive encodings used whenever possible |
*/ |
*/ |
|
|
|
len = 0; |
|
|
/* |
/* |
* First, we read the tag. |
* First, we read the tag. |
*/ |
*/ |
|
tag = ber_tag_and_rest( ber, bv ); |
|
|
if ( (tag = ber_get_tag( ber )) == LBER_DEFAULT ) |
rest = bv->bv_len; |
return( LBER_DEFAULT ); |
ptr = (unsigned char *) bv->bv_val; |
|
if ( tag == LBER_DEFAULT || rest == 0 ) { |
|
goto fail; |
|
} |
|
|
/* |
/* |
* Next, read the length. The first byte contains the length of |
* Next, read the length. The first octet determines the length |
* the length. If bit 8 is set, the length is the long form, |
* of the length. If bit 8 is 0, the length is the short form, |
* otherwise it's the short form. We don't allow a length that's |
* otherwise if the octet != 0x80 it's the long form, otherwise |
* greater than what we can hold in an unsigned long. |
* the ber element has the unsupported indefinite-length format. |
|
* Lengths that do not fit in a ber_len_t are not accepted. |
*/ |
*/ |
|
|
*len = netlen = 0; |
len = *ptr++; |
if ( ber_read( ber, (char *) &lc, 1 ) != 1 ) |
rest--; |
return( LBER_DEFAULT ); |
|
if ( lc & 0x80U ) { |
if ( len & 0x80U ) { |
noctets = (lc & 0x7fU); |
len &= 0x7fU; |
if ( (unsigned) noctets > sizeof(unsigned long) ) |
if ( len - 1U > sizeof(ber_len_t) - 1U || rest < len ) { |
return( LBER_DEFAULT ); |
/* Indefinite-length/too long length/not enough data */ |
diff = sizeof(unsigned long) - noctets; |
goto fail; |
if ( (unsigned) ber_read( ber, (char *) &netlen + diff, noctets ) |
} |
!= noctets ) |
|
return( LBER_DEFAULT ); |
rest -= len; |
*len = AC_NTOHL( netlen ); |
i = len; |
} else { |
for( len = *ptr++ & 0xffU; --i; len |= *ptr++ & 0xffU ) { |
*len = lc; |
len <<= 8; |
|
} |
} |
} |
|
|
return( tag ); |
/* BER element should have enough data left */ |
|
if( len > rest ) { |
|
fail: |
|
tag = LBER_DEFAULT; |
|
} |
|
|
|
bv->bv_len = len; |
|
bv->bv_val = (char *) ptr; |
|
return tag; |
} |
} |
|
|
unsigned long |
/* Move past next element, point *bv at it in-place, and return its tag. |
ber_peek_tag( |
* The caller may \0-terminate *bv, as next octet is saved in ber->ber_tag. |
LDAP_CONST BerElement *ber_in, /* not const per c-api-02 */ |
* Similar to ber_get_stringbv(ber, bv, LBER_BV_NOTERM) except on error. |
unsigned long *len ) |
*/ |
|
ber_tag_t |
|
ber_skip_element( BerElement *ber, struct berval *bv ) |
{ |
{ |
unsigned long tag; |
ber_tag_t tag = ber_peek_element( ber, bv ); |
BerElement *ber; |
|
|
|
assert( ber_in != NULL ); |
if ( tag != LBER_DEFAULT ) { |
assert( BER_VALID( ber_in ) ); |
ber->ber_ptr = bv->bv_val + bv->bv_len; |
|
ber->ber_tag = *(unsigned char *) ber->ber_ptr; |
ber = ber_dup( ber_in ); |
|
|
|
if( ber == NULL ) { |
|
return LBER_ERROR; |
|
} |
} |
|
|
assert( BER_VALID( ber ) ); |
return tag; |
|
} |
|
|
tag = ber_skip_tag( ber, len ); |
ber_tag_t |
|
ber_peek_tag( |
|
BerElement *ber, |
|
ber_len_t *len ) |
|
{ |
|
struct berval bv; |
|
ber_tag_t tag = ber_peek_element( ber, &bv ); |
|
|
ber_free( ber, 0 ); |
*len = bv.bv_len; |
return( tag ); |
return tag; |
} |
} |
|
|
static int |
ber_tag_t |
ber_getnint( BerElement *ber, long *num, int len ) |
ber_skip_tag( BerElement *ber, ber_len_t *lenp ) |
{ |
{ |
int diff, sign, i; |
struct berval bv; |
long netnum; |
ber_tag_t tag = ber_peek_element( ber, &bv ); |
char *p; |
|
|
|
assert( ber != NULL ); |
ber->ber_ptr = bv.bv_val; |
assert( num != NULL ); |
ber->ber_tag = *(unsigned char *) ber->ber_ptr; |
|
|
assert( BER_VALID( ber ) ); |
*lenp = bv.bv_len; |
|
return tag; |
/* |
} |
* 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 ( (unsigned) len > sizeof(long) ) |
ber_tag_t |
return( -1 ); |
ber_get_int( |
|
BerElement *ber, |
|
ber_int_t *num ) |
|
{ |
|
ber_tag_t tag; |
|
ber_len_t len; |
|
struct berval bv; |
|
|
netnum = 0; |
assert( num != NULL ); |
diff = sizeof(long) - len; |
|
/* read into the low-order bytes of netnum */ |
|
if ( ber_read( ber, ((char *) &netnum) + diff, len ) != len ) |
|
return( -1 ); |
|
|
|
/* sign extend if necessary */ |
tag = ber_skip_element( ber, &bv ); |
p = (char *) &netnum; |
len = bv.bv_len; |
sign = (0x80 & *(p+diff) ); |
if ( tag == LBER_DEFAULT || len > sizeof(ber_int_t) ) { |
if ( sign && ((unsigned) len < sizeof(long)) ) { |
return LBER_DEFAULT; |
for ( i = 0; i < diff; i++ ) { |
} |
*(p+i) = (unsigned char) 0xff; |
|
|
/* parse two's complement integer */ |
|
if( len ) { |
|
unsigned char *buf = (unsigned char *) bv.bv_val; |
|
ber_len_t i; |
|
ber_int_t netnum = buf[0] & 0xff; |
|
|
|
/* sign extend */ |
|
netnum = (netnum ^ 0x80) - 0x80; |
|
|
|
/* shift in the bytes */ |
|
for( i = 1; i < len; i++ ) { |
|
netnum = (netnum << 8 ) | buf[i]; |
} |
} |
|
|
|
*num = netnum; |
|
|
|
} else { |
|
*num = 0; |
} |
} |
*num = AC_NTOHL( netnum ); |
|
|
|
return( len ); |
return tag; |
} |
} |
|
|
unsigned long |
ber_tag_t |
ber_get_int( BerElement *ber, long *num ) |
ber_get_enum( |
|
BerElement *ber, |
|
ber_int_t *num ) |
{ |
{ |
unsigned long tag, len; |
return ber_get_int( ber, num ); |
|
} |
|
|
assert( ber != NULL ); |
ber_tag_t |
assert( BER_VALID( ber ) ); |
ber_get_stringb( |
|
BerElement *ber, |
|
char *buf, |
|
ber_len_t *len ) |
|
{ |
|
struct berval bv; |
|
ber_tag_t tag; |
|
|
|
if ( (tag = ber_skip_element( ber, &bv )) == LBER_DEFAULT ) { |
|
return LBER_DEFAULT; |
|
} |
|
|
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
/* must fit within allocated space with termination */ |
return( LBER_DEFAULT ); |
if ( bv.bv_len >= *len ) { |
|
return LBER_DEFAULT; |
|
} |
|
|
|
memcpy( buf, bv.bv_val, bv.bv_len ); |
|
buf[bv.bv_len] = '\0'; |
|
|
if ( (unsigned long) ber_getnint( ber, num, (int)len ) != len ) |
*len = bv.bv_len; |
return( LBER_DEFAULT ); |
return tag; |
else |
|
return( tag ); |
|
} |
} |
|
|
unsigned long |
/* Definitions for get_string vector |
ber_get_stringb( BerElement *ber, char *buf, unsigned long *len ) |
* |
{ |
* ChArray, BvArray, and BvVec are self-explanatory. |
unsigned long datalen, tag; |
* BvOff is a struct berval embedded in an array of larger structures |
#ifdef STR_TRANSLATION |
* of siz bytes at off bytes from the beginning of the struct. |
char *transbuf; |
*/ |
#endif /* STR_TRANSLATION */ |
enum bgbvc { ChArray, BvArray, BvVec, BvOff }; |
|
|
assert( ber != NULL ); |
/* Use this single cookie for state, to keep actual |
assert( BER_VALID( ber ) ); |
* stack use to the absolute minimum. |
|
*/ |
|
typedef struct bgbvr { |
|
const enum bgbvc choice; |
|
const int option; /* (ALLOC unless BvOff) | (STRING if ChArray) */ |
|
ber_len_t siz; /* input array element size, output count */ |
|
ber_len_t off; /* BvOff offset to the struct berval */ |
|
void *result; |
|
} bgbvr; |
|
|
|
static ber_tag_t |
|
ber_get_stringbvl( BerElement *ber, bgbvr *b ) |
|
{ |
|
int i = 0, n; |
|
ber_tag_t tag; |
|
ber_len_t tot_size = 0, siz = b->siz; |
|
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; |
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) |
for ( ; ber->ber_ptr < last; i++, tot_size += siz ) { |
return( LBER_DEFAULT ); |
if ( ber_skip_element( ber, &bv ) == LBER_DEFAULT ) |
if ( datalen > (*len - 1) ) |
break; |
return( LBER_DEFAULT ); |
} |
|
if ( ber->ber_ptr != last ) { |
|
i = 0; |
|
tag = LBER_DEFAULT; |
|
} |
|
|
if ( (unsigned long) ber_read( ber, buf, datalen ) != datalen ) |
ber->ber_ptr = orig; |
return( LBER_DEFAULT ); |
ber->ber_tag = *(unsigned char *) orig; |
|
} |
|
|
buf[datalen] = '\0'; |
b->siz = i; |
|
if ( i == 0 ) { |
|
return tag; |
|
} |
|
|
|
/* 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; |
|
} |
|
switch (b->choice) { |
|
case ChArray: |
|
res.ca = b->result; |
|
res.ca[i] = NULL; |
|
break; |
|
case BvArray: |
|
res.ba = b->result; |
|
res.ba[i].bv_val = NULL; |
|
break; |
|
case BvVec: |
|
res.bv = b->result; |
|
res.bv[i] = NULL; |
|
break; |
|
case BvOff: |
|
res.bo = (char *) b->result + b->off; |
|
((struct berval *) (res.bo + tot_size))->bv_val = NULL; |
|
tot_size = 0; |
|
break; |
|
} |
|
|
|
n = 0; |
|
do { |
|
tag = ber_get_stringbv( ber, &bv, b->option ); |
|
if ( tag == LBER_DEFAULT ) { |
|
goto failed; |
|
} |
|
|
|
/* store my result */ |
|
switch (b->choice) { |
|
case ChArray: |
|
res.ca[n] = bv.bv_val; |
|
break; |
|
case BvArray: |
|
res.ba[n] = bv; |
|
break; |
|
case BvVec: |
|
bvp = ber_memalloc_x( sizeof( struct berval ), |
|
ber->ber_memctx ); |
|
if ( !bvp ) { |
|
ber_memfree_x( bv.bv_val, ber->ber_memctx ); |
|
goto failed; |
|
} |
|
res.bv[n] = bvp; |
|
*bvp = bv; |
|
break; |
|
case BvOff: |
|
*(struct berval *)(res.bo + tot_size) = bv; |
|
tot_size += siz; |
|
break; |
|
} |
|
} while (++n < i); |
|
return tag; |
|
|
#ifdef STR_TRANSLATION |
failed: |
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
if (b->choice != BvOff) { /* BvOff does not have LBER_BV_ALLOC set */ |
&& ber->ber_decode_translate_proc ) { |
while (--n >= 0) { |
transbuf = buf; |
switch(b->choice) { |
++datalen; |
case ChArray: |
if ( (*(ber->ber_decode_translate_proc))( &transbuf, &datalen, |
ber_memfree_x(res.ca[n], ber->ber_memctx); |
0 ) != 0 ) { |
break; |
return( LBER_DEFAULT ); |
case BvArray: |
|
ber_memfree_x(res.ba[n].bv_val, ber->ber_memctx); |
|
break; |
|
case BvVec: |
|
ber_memfree_x(res.bv[n]->bv_val, ber->ber_memctx); |
|
ber_memfree_x(res.bv[n], ber->ber_memctx); |
|
break; |
|
default: |
|
break; |
|
} |
} |
} |
if ( datalen > *len ) { |
} |
LBER_FREE( transbuf ); |
ber_memfree_x(b->result, ber->ber_memctx); |
return( LBER_DEFAULT ); |
b->result = NULL; |
|
return LBER_DEFAULT; |
|
} |
|
|
|
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 || |
|
(( option & LBER_BV_STRING ) && |
|
bv->bv_len && memchr( bv->bv_val, 0, bv->bv_len - 1 ))) |
|
{ |
|
bv->bv_val = NULL; |
|
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 ); |
|
if ( bv->bv_val == NULL ) { |
|
return LBER_DEFAULT; |
} |
} |
SAFEMEMCPY( buf, transbuf, datalen ); |
|
LBER_FREE( transbuf ); |
if ( bv->bv_len != 0 ) { |
--datalen; |
memcpy( bv->bv_val, data, bv->bv_len ); |
|
} |
|
data = bv->bv_val; |
} |
} |
#endif /* STR_TRANSLATION */ |
if ( !( option & LBER_BV_NOTERM )) |
|
data[bv->bv_len] = '\0'; |
|
|
*len = datalen; |
return tag; |
return( tag ); |
|
} |
} |
|
|
unsigned long |
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 ) { |
|
bv->bv_val = NULL; |
|
return tag; |
|
} |
|
|
|
if (( option & LBER_BV_STRING ) && |
|
memchr( bv->bv_val, 0, bv->bv_len - 1 )) |
|
{ |
|
bv->bv_val = NULL; |
|
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 ); |
|
if ( bv->bv_val == NULL ) { |
|
return LBER_DEFAULT; |
|
} |
|
|
|
memcpy( bv->bv_val, data, bv->bv_len ); |
|
data = bv->bv_val; |
|
} |
|
if ( !( option & LBER_BV_NOTERM )) |
|
data[bv->bv_len] = '\0'; |
|
|
|
return tag; |
|
} |
|
|
|
ber_tag_t |
ber_get_stringa( BerElement *ber, char **buf ) |
ber_get_stringa( BerElement *ber, char **buf ) |
{ |
{ |
unsigned long datalen, tag; |
BerValue bv; |
|
ber_tag_t tag; |
|
|
assert( ber != NULL ); |
|
assert( buf != NULL ); |
assert( buf != NULL ); |
|
|
assert( BER_VALID( ber ) ); |
tag = ber_get_stringbv( ber, &bv, LBER_BV_ALLOC | LBER_BV_STRING ); |
|
*buf = bv.bv_val; |
|
|
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) { |
return tag; |
*buf = NULL; |
} |
return( LBER_DEFAULT ); |
|
} |
|
|
|
if ( (*buf = (char *) LBER_MALLOC( (size_t)datalen + 1 )) == NULL ) |
ber_tag_t |
return( LBER_DEFAULT ); |
ber_get_stringa_null( BerElement *ber, char **buf ) |
|
{ |
|
BerValue bv; |
|
ber_tag_t tag; |
|
|
if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen ) { |
assert( buf != NULL ); |
LBER_FREE( *buf ); |
|
*buf = NULL; |
|
return( LBER_DEFAULT ); |
|
} |
|
(*buf)[datalen] = '\0'; |
|
|
|
#ifdef STR_TRANSLATION |
tag = ber_get_stringbv_null( ber, &bv, LBER_BV_ALLOC | LBER_BV_STRING ); |
if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
*buf = bv.bv_val; |
&& ber->ber_decode_translate_proc ) { |
|
++datalen; |
|
if ( (*(ber->ber_decode_translate_proc))( buf, &datalen, 1 ) |
|
!= 0 ) { |
|
LBER_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_tag_t tag; |
|
|
assert( ber != NULL ); |
assert( ber != NULL ); |
assert( bv != NULL ); |
assert( bv != NULL ); |
|
|
assert( BER_VALID( ber ) ); |
*bv = (struct berval *) ber_memalloc_x( sizeof(struct berval), |
|
ber->ber_memctx ); |
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) { |
if ( *bv == NULL ) { |
*bv = NULL; |
return LBER_DEFAULT; |
return( LBER_DEFAULT ); |
|
} |
} |
|
|
if ( (*bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) )) == NULL ) |
tag = ber_get_stringbv( ber, *bv, LBER_BV_ALLOC ); |
return( LBER_DEFAULT ); |
if ( tag == LBER_DEFAULT ) { |
|
ber_memfree_x( *bv, ber->ber_memctx ); |
if ( ((*bv)->bv_val = (char *) LBER_MALLOC( (size_t)len + 1 )) == NULL ) { |
|
LBER_FREE( *bv ); |
|
*bv = NULL; |
*bv = NULL; |
return( LBER_DEFAULT ); |
|
} |
|
|
|
if ( (unsigned long) ber_read( ber, (*bv)->bv_val, len ) != len ) { |
|
ber_bvfree( *bv ); |
|
*bv = NULL; |
|
return( LBER_DEFAULT ); |
|
} |
|
((*bv)->bv_val)[len] = '\0'; |
|
(*bv)->bv_len = len; |
|
|
|
#ifdef STR_TRANSLATION |
|
if ( len > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0 |
|
&& ber->ber_decode_translate_proc ) { |
|
++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_tag_t tag; |
|
struct berval data; |
unsigned char unusedbits; |
unsigned char unusedbits; |
|
|
assert( ber != NULL ); |
|
assert( buf != NULL ); |
assert( buf != NULL ); |
assert( blen != NULL ); |
assert( blen != NULL ); |
|
|
assert( BER_VALID( ber ) ); |
if ( (tag = ber_skip_element( ber, &data )) == LBER_DEFAULT ) { |
|
goto fail; |
if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) { |
|
*buf = NULL; |
|
return( LBER_DEFAULT ); |
|
} |
} |
--datalen; |
|
|
|
if ( (*buf = (char *) LBER_MALLOC( (size_t)datalen )) == NULL ) |
if ( --data.bv_len > (ber_len_t)-1 / 8 ) { |
return( LBER_DEFAULT ); |
goto fail; |
|
} |
|
unusedbits = *(unsigned char *) data.bv_val++; |
|
if ( unusedbits > 7 ) { |
|
goto fail; |
|
} |
|
|
if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) { |
if ( memchr( data.bv_val, 0, data.bv_len )) { |
LBER_FREE( buf ); |
goto fail; |
*buf = NULL; |
|
return( LBER_DEFAULT ); |
|
} |
} |
|
|
if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen ) { |
*buf = (char *) ber_memalloc_x( data.bv_len, ber->ber_memctx ); |
LBER_FREE( buf ); |
if ( *buf == NULL ) { |
*buf = NULL; |
return LBER_DEFAULT; |
return( LBER_DEFAULT ); |
|
} |
} |
|
memcpy( *buf, data.bv_val, data.bv_len ); |
|
|
*blen = datalen * 8 - unusedbits; |
*blen = data.bv_len * 8 - unusedbits; |
return( tag ); |
return tag; |
|
|
|
fail: |
|
*buf = NULL; |
|
return LBER_DEFAULT; |
} |
} |
|
|
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 = ber_skip_tag( ber, &len ); |
assert( ber != NULL ); |
|
assert( BER_VALID( ber ) ); |
|
|
|
if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
|
return( LBER_DEFAULT ); |
|
|
|
if ( len != 0 ) |
return( len == 0 ? tag : LBER_DEFAULT ); |
return( LBER_DEFAULT ); |
|
|
|
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; |
return ber_get_int( ber, boolval ); |
int rc; |
|
|
|
assert( ber != NULL ); |
|
assert( boolval != NULL ); |
|
|
|
assert( BER_VALID( ber ) ); |
|
|
|
rc = ber_get_int( ber, &longbool ); |
|
*boolval = longbool; |
|
|
|
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 ); |
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; |
return( LBER_DEFAULT ); |
return LBER_DEFAULT; |
} |
} |
|
|
*last = ber->ber_ptr + *len; |
*last = ber->ber_ptr + *len; |
|
|
if ( *last == ber->ber_ptr ) { |
if ( *len == 0 ) { |
return( LBER_DEFAULT ); |
return LBER_DEFAULT; |
} |
} |
|
|
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( ber != NULL ); |
assert( len != NULL ); |
|
assert( last != NULL ); |
assert( last != NULL ); |
|
assert( LBER_VALID( ber ) ); |
|
|
assert( BER_VALID( ber ) ); |
if ( ber->ber_ptr >= last ) { |
|
return LBER_DEFAULT; |
if ( ber->ber_ptr == last ) { |
|
return( LBER_DEFAULT ); |
|
} |
} |
|
|
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 |
|
( BerElement *ber, |
|
LDAP_CONST char *fmt, |
LDAP_CONST char *fmt, |
... ) |
... ) |
#else |
|
( va_alist ) |
|
va_dcl |
|
#endif |
|
{ |
{ |
va_list ap; |
va_list ap; |
#ifndef HAVE_STDARG |
|
BerElement *ber; |
|
char *fmt; |
|
#endif |
|
LDAP_CONST char *fmt_reset; |
LDAP_CONST char *fmt_reset; |
char *last; |
|
char *s, **ss, ***sss; |
char *s, **ss, ***sss; |
struct berval ***bv, **bvp, *bval; |
struct berval data, *bval, **bvp, ***bvpp; |
int *i, j; |
ber_int_t *i; |
long *l; |
ber_len_t *l; |
unsigned long rc, tag, len; |
ber_tag_t *t; |
|
ber_tag_t rc; |
|
ber_len_t len; |
|
|
#ifdef HAVE_STDARG |
|
va_start( ap, fmt ); |
va_start( ap, fmt ); |
#else |
|
va_start( ap ); |
|
ber = va_arg( ap, BerElement * ); |
|
fmt = va_arg( ap, char * ); |
|
#endif |
|
|
|
assert( ber != NULL ); |
assert( ber != NULL ); |
assert( fmt != NULL ); |
assert( fmt != NULL ); |
|
assert( LBER_VALID( ber ) ); |
assert( BER_VALID( ber ) ); |
|
|
|
fmt_reset = fmt; |
fmt_reset = fmt; |
|
|
ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug, |
if ( ber->ber_debug & (LDAP_DEBUG_TRACE|LDAP_DEBUG_BER)) { |
"ber_scanf fmt (%s) ber:\n", fmt ); |
ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug, |
ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 ); |
"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 |
/* When this is modified, remember to update |
Line 512 va_dcl
|
Line 742 va_dcl
|
rc = ber_get_stringa( ber, ss ); |
rc = ber_get_stringa( ber, ss ); |
break; |
break; |
|
|
|
case 'A': /* octet string - allocate storage as needed, |
|
* but return NULL if len == 0 */ |
|
ss = va_arg( ap, char ** ); |
|
rc = ber_get_stringa_null( ber, ss ); |
|
break; |
|
|
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 'B': /* bit string - allocate storage as needed */ |
|
ss = va_arg( ap, char ** ); |
|
l = va_arg( ap, ber_len_t * ); /* for length, in bits */ |
|
rc = ber_get_bitstringa( ber, ss, l ); |
|
break; |
|
|
case 'e': /* enumerated */ |
case 'e': /* enumerated */ |
case 'i': /* int */ |
case 'i': /* integer */ |
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, l ); |
rc = ber_peek_tag( ber, l ); |
break; |
break; |
|
|
case 'n': /* null */ |
case 'm': /* octet string in berval, in-place */ |
rc = ber_get_null( ber ); |
bval = va_arg( ap, struct berval * ); |
|
rc = ber_get_stringbv( ber, bval, 0 ); |
break; |
break; |
|
|
case 's': /* octet string - in a buffer */ |
case 'M': /* bvoffarray - must include address of |
s = va_arg( ap, char * ); |
* a record len, and record offset. |
l = va_arg( ap, long * ); |
* number of records will be returned thru |
rc = ber_get_stringb( ber, s, l ); |
* len ptr on finish. parsed in-place. |
|
*/ |
|
{ |
|
bgbvr cookie = { BvOff, 0 }; |
|
bvp = va_arg( ap, struct berval ** ); |
|
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; |
|
break; |
|
} |
|
|
|
case 'n': /* null */ |
|
rc = ber_get_null( ber ); |
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 * ); |
ber_peek_tag( ber, &bval->bv_len ); |
rc = ber_get_stringbv( ber, bval, LBER_BV_ALLOC ); |
rc = ber_get_stringa( ber, &bval->bv_val ); |
|
break; |
break; |
|
|
case 'O': /* octet string - allocate & include length */ |
case 'O': /* octet string - allocate & include length */ |
Line 549 va_dcl
|
Line 806 va_dcl
|
rc = ber_get_stringal( ber, bvp ); |
rc = ber_get_stringal( ber, bvp ); |
break; |
break; |
|
|
case 'B': /* bit string - allocate storage as needed */ |
case 's': /* octet string - in a buffer */ |
ss = va_arg( ap, char ** ); |
s = va_arg( ap, char * ); |
l = va_arg( ap, long * ); /* for length, in bits */ |
l = va_arg( ap, ber_len_t * ); |
rc = ber_get_bitstringa( ber, ss, l ); |
rc = ber_get_stringb( ber, s, l ); |
break; |
break; |
|
|
case 't': /* tag of next item */ |
case 't': /* tag of next item */ |
l = va_arg( ap, long * ); |
t = va_arg( ap, ber_tag_t * ); |
*l = 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 */ |
l = va_arg( ap, long * ); |
t = va_arg( ap, ber_tag_t * ); |
*l = 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 */ |
sss = va_arg( ap, char *** ); |
{ |
*sss = NULL; |
bgbvr cookie = { |
j = 0; |
ChArray, LBER_BV_ALLOC | LBER_BV_STRING, sizeof( char * ) |
for ( tag = ber_first_element( ber, &len, &last ); |
}; |
tag != LBER_DEFAULT && rc != LBER_DEFAULT; |
rc = ber_get_stringbvl( ber, &cookie ); |
tag = ber_next_element( ber, &len, last ) ) |
*(va_arg( ap, char *** )) = cookie.result; |
{ |
|
*sss = (char **) LBER_REALLOC( *sss, |
|
(j + 2) * sizeof(char *) ); |
|
|
|
rc = ber_get_stringa( ber, &((*sss)[j]) ); |
|
j++; |
|
} |
|
if ( j > 0 ) |
|
(*sss)[j] = NULL; |
|
break; |
break; |
|
} |
|
|
case 'V': /* sequence of strings + lengths */ |
case 'V': /* sequence of strings + lengths */ |
bv = va_arg( ap, struct berval *** ); |
{ |
*bv = NULL; |
bgbvr cookie = { |
j = 0; |
BvVec, LBER_BV_ALLOC, sizeof( struct berval * ) |
for ( tag = ber_first_element( ber, &len, &last ); |
}; |
tag != LBER_DEFAULT && rc != LBER_DEFAULT; |
rc = ber_get_stringbvl( ber, &cookie ); |
tag = ber_next_element( ber, &len, last ) ) |
*(va_arg( ap, struct berval *** )) = cookie.result; |
{ |
|
*bv = (struct berval **) LBER_REALLOC( *bv, |
|
(j + 2) * sizeof(struct berval *) ); |
|
|
|
rc = ber_get_stringal( ber, &((*bv)[j]) ); |
|
j++; |
|
} |
|
if ( j > 0 ) |
|
(*bv)[j] = NULL; |
|
break; |
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; |
|
break; |
|
} |
|
|
case 'x': /* skip the next element - whatever it is */ |
case 'x': /* skip the next element - whatever it is */ |
if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) |
rc = ber_skip_element( ber, &data ); |
break; |
|
ber->ber_ptr += len; |
|
break; |
break; |
|
|
case '{': /* begin sequence */ |
case '{': /* begin sequence */ |
case '[': /* begin set */ |
case '[': /* begin set */ |
if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' ) |
switch ( fmt[1] ) { |
|
case 'v': case 'V': case 'W': case 'M': |
|
break; |
|
default: |
rc = ber_skip_tag( ber, &len ); |
rc = ber_skip_tag( ber, &len ); |
|
break; |
|
} |
break; |
break; |
|
|
case '}': /* end sequence */ |
case '}': /* end sequence */ |
Line 630 va_dcl
|
Line 884 va_dcl
|
va_end( ap ); |
va_end( ap ); |
|
|
if ( rc == LBER_DEFAULT ) { |
if ( rc == LBER_DEFAULT ) { |
/* |
/* |
* 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 */ |
case '!': { /* Hook */ |
BERDecodeCallback *f; |
BERDecodeCallback *f; |
Line 655 va_dcl
|
Line 903 va_dcl
|
} break; |
} break; |
|
|
case 'a': /* octet string - allocate storage as needed */ |
case 'a': /* octet string - allocate storage as needed */ |
|
case 'A': |
ss = va_arg( ap, char ** ); |
ss = va_arg( ap, char ** ); |
if ( *ss ) { |
ber_memfree_x( *ss, ber->ber_memctx ); |
LBER_FREE( *ss ); |
*ss = NULL; |
*ss = NULL; |
|
} |
|
break; |
break; |
|
|
case 'b': /* boolean */ |
case 'b': /* boolean */ |
(void) va_arg( ap, int * ); |
case 'e': /* enumerated */ |
|
case 'i': /* integer */ |
|
(void) va_arg( ap, ber_int_t * ); |
break; |
break; |
|
|
case 's': /* octet string - in a buffer */ |
case 'l': /* length of next item */ |
(void) va_arg( ap, char * ); |
*(va_arg( ap, ber_len_t * )) = 0; |
(void) va_arg( ap, long * ); |
|
break; |
break; |
|
|
case 'e': /* enumerated */ |
case 'm': /* berval in-place */ |
case 'i': /* int */ |
bval = va_arg( ap, struct berval * ); |
case 'l': /* length of next item */ |
BER_BVZERO( bval ); |
case 't': /* tag of next item */ |
break; |
case 'T': /* skip tag of next item */ |
|
(void) va_arg( ap, long * ); |
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 ); |
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 != NULL ) { |
ber_memfree_x( bval->bv_val, ber->ber_memctx ); |
LBER_FREE( bval->bv_val ); |
BER_BVZERO( bval ); |
bval->bv_val = NULL; |
|
} |
|
bval->bv_len = 0; |
|
break; |
break; |
|
|
case 'O': /* octet string - allocate & include length */ |
case 'O': /* octet string - allocate & include length */ |
bvp = va_arg( ap, struct berval ** ); |
bvp = va_arg( ap, struct berval ** ); |
if ( *bvp ) { |
ber_bvfree_x( *bvp, ber->ber_memctx ); |
ber_bvfree( *bvp ); |
*bvp = NULL; |
*bvp = NULL; |
break; |
} |
|
|
case 's': /* octet string - in a buffer */ |
|
(void) va_arg( ap, char * ); |
|
*(va_arg( ap, ber_len_t * )) = 0; |
|
break; |
|
|
|
case 't': /* tag of next item */ |
|
case 'T': /* skip tag of next item */ |
|
(void) va_arg( ap, ber_tag_t * ); |
break; |
break; |
|
|
case 'B': /* bit string - allocate storage as needed */ |
case 'B': /* bit string - allocate storage as needed */ |
ss = va_arg( ap, char ** ); |
ss = va_arg( ap, char ** ); |
if ( *ss ) { |
ber_memfree_x( *ss, ber->ber_memctx ); |
LBER_FREE( *ss ); |
*ss = NULL; |
*ss = NULL; |
*(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */ |
} |
|
*(va_arg( ap, long * )) = 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 ) { |
ber_memvfree_x( (void **) *sss, ber->ber_memctx ); |
for (j = 0; (*sss)[j]; j++) { |
*sss = NULL; |
LBER_FREE( (*sss)[j] ); |
|
(*sss)[j] = NULL; |
|
} |
|
LBER_FREE( *sss ); |
|
*sss = NULL; |
|
} |
|
break; |
break; |
|
|
case 'V': /* sequence of strings + lengths */ |
case 'V': /* sequence of strings + lengths */ |
bv = va_arg( ap, struct berval *** ); |
bvpp = va_arg( ap, struct berval *** ); |
if ( *bv ) { |
ber_bvecfree_x( *bvpp, ber->ber_memctx ); |
ber_bvecfree( *bv ); |
*bvpp = NULL; |
*bv = NULL; |
break; |
} |
|
|
case 'W': /* BerVarray */ |
|
bvp = va_arg( ap, struct berval ** ); |
|
ber_bvarray_free_x( *bvp, ber->ber_memctx ); |
|
*bvp = NULL; |
break; |
break; |
|
|
case 'n': /* null */ |
case 'n': /* null */ |
Line 737 va_dcl
|
Line 991 va_dcl
|
/* format should be good */ |
/* format should be good */ |
assert( 0 ); |
assert( 0 ); |
} |
} |
} |
} |
|
|
va_end( ap ); |
|
} |
|
|
|
return( rc ); |
|
} |
|
|
|
void |
|
ber_bvfree( struct berval *bv ) |
|
{ |
|
assert(bv != NULL); /* bv damn better point to something */ |
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED; |
|
|
|
if ( bv->bv_val != NULL ) |
|
LBER_FREE( bv->bv_val ); |
|
LBER_FREE( (char *) bv ); |
|
} |
|
|
|
void |
|
ber_bvecfree( struct berval **bv ) |
|
{ |
|
int i; |
|
|
|
assert(bv != NULL); /* bv damn better point to something */ |
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED; |
|
|
|
for ( i = 0; bv[i] != NULL; i++ ) |
|
ber_bvfree( bv[i] ); |
|
LBER_FREE( (char *) bv ); |
|
} |
|
|
|
struct berval * |
|
ber_bvdup( |
|
LDAP_CONST struct berval *bv ) |
|
{ |
|
struct berval *new; |
|
|
|
assert( bv != NULL ); |
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED; |
|
|
|
if( bv == NULL ) { |
|
return NULL; |
|
} |
|
|
|
if ( (new = (struct berval *) LBER_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 *) LBER_MALLOC( bv->bv_len + 1 )) == NULL ) { |
va_end( ap ); |
LBER_FREE( new ); |
|
return( NULL ); |
|
} |
} |
|
|
SAFEMEMCPY( new->bv_val, bv->bv_val, (size_t) bv->bv_len ); |
return rc; |
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; |
|
} |
} |
#endif /* STR_TRANSLATION */ |
|