1 /* decode.c - ber input decoding routines */
3 * Copyright (c) 1990 Regents of the University of Michigan.
6 * Redistribution and use in source and binary forms are permitted
7 * provided that this notice is preserved and that due credit is given
8 * to the University of Michigan at Ann Arbor. The name of the University
9 * may not be used to endorse or promote products derived from this
10 * software without specific prior written permission. This software
11 * is provided ``as is'' without express or implied warranty.
19 #include <ac/stdarg.h>
21 #include <ac/string.h>
22 #include <ac/socket.h>
26 static int ber_getnint LDAP_P(( BerElement *ber, long *num, int len ));
28 /* return the tag - LBER_DEFAULT returned means trouble */
30 ber_get_tag( BerElement *ber )
37 if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 )
38 return( LBER_DEFAULT );
40 if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK )
41 return( (unsigned long) xbyte );
45 for ( i = 1; i < sizeof(long); i++ ) {
46 if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 )
47 return( LBER_DEFAULT );
51 if ( ! (xbyte & LBER_MORE_TAG_MASK) )
56 if ( i == sizeof(long) )
57 return( LBER_DEFAULT );
59 /* want leading, not trailing 0's */
60 return( tag >> (sizeof(long) - i - 1) );
64 ber_skip_tag( BerElement *ber, unsigned long *len )
72 * Any ber element looks like this: tag length contents.
73 * Assuming everything's ok, we return the tag byte (we
74 * can assume a single byte), and return the length in len.
78 * 2) primitive encodings used whenever possible
82 * First, we read the tag.
85 if ( (tag = ber_get_tag( ber )) == LBER_DEFAULT )
86 return( LBER_DEFAULT );
89 * Next, read the length. The first byte contains the length of
90 * the length. If bit 8 is set, the length is the long form,
91 * otherwise it's the short form. We don't allow a length that's
92 * greater than what we can hold in an unsigned long.
96 if ( ber_read( ber, (char *) &lc, 1 ) != 1 )
97 return( LBER_DEFAULT );
99 noctets = (lc & 0x7f);
100 if ( noctets > sizeof(unsigned long) )
101 return( LBER_DEFAULT );
102 diff = sizeof(unsigned long) - noctets;
103 if ( ber_read( ber, (char *) &netlen + diff, noctets )
105 return( LBER_DEFAULT );
106 *len = AC_NTOHL( netlen );
115 ber_peek_tag( BerElement *ber, unsigned long *len )
121 tag = ber_skip_tag( ber, len );
128 ber_getnint( BerElement *ber, long *num, int len )
135 * The tag and length have already been stripped off. We should
136 * be sitting right before len bytes of 2's complement integer,
137 * ready to be read straight into an int. We may have to sign
138 * extend after we read it in.
141 if ( len > sizeof(long) )
145 diff = sizeof(long) - len;
146 /* read into the low-order bytes of netnum */
147 if ( ber_read( ber, ((char *) &netnum) + diff, len ) != len )
150 /* sign extend if necessary */
151 p = (char *) &netnum;
152 sign = (0x80 & *(p+diff) );
153 if ( sign && len < sizeof(long) ) {
154 for ( i = 0; i < diff; i++ ) {
155 *(p+i) = (unsigned char) 0xff;
158 *num = AC_NTOHL( netnum );
164 ber_get_int( BerElement *ber, long *num )
166 unsigned long tag, len;
168 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
169 return( LBER_DEFAULT );
171 if ( (unsigned long) ber_getnint( ber, num, (int)len ) != len )
172 return( LBER_DEFAULT );
178 ber_get_stringb( BerElement *ber, char *buf, unsigned long *len )
180 unsigned long datalen, tag;
181 #ifdef STR_TRANSLATION
183 #endif /* STR_TRANSLATION */
185 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT )
186 return( LBER_DEFAULT );
187 if ( datalen > (*len - 1) )
188 return( LBER_DEFAULT );
190 if ( (unsigned long) ber_read( ber, buf, datalen ) != datalen )
191 return( LBER_DEFAULT );
195 #ifdef STR_TRANSLATION
196 if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0
197 && ber->ber_decode_translate_proc != NULL ) {
200 if ( (*(ber->ber_decode_translate_proc))( &transbuf, &datalen,
202 return( LBER_DEFAULT );
204 if ( datalen > *len ) {
206 return( LBER_DEFAULT );
208 SAFEMEMCPY( buf, transbuf, datalen );
212 #endif /* STR_TRANSLATION */
219 ber_get_stringa( BerElement *ber, char **buf )
221 unsigned long datalen, tag;
223 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT )
224 return( LBER_DEFAULT );
226 if ( (*buf = (char *) malloc( (size_t)datalen + 1 )) == NULL )
227 return( LBER_DEFAULT );
229 if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen )
230 return( LBER_DEFAULT );
231 (*buf)[datalen] = '\0';
233 #ifdef STR_TRANSLATION
234 if ( datalen > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0
235 && ber->ber_decode_translate_proc != NULL ) {
237 if ( (*(ber->ber_decode_translate_proc))( buf, &datalen, 1 )
240 return( LBER_DEFAULT );
243 #endif /* STR_TRANSLATION */
249 ber_get_stringal( BerElement *ber, struct berval **bv )
251 unsigned long len, tag;
253 if ( (*bv = (struct berval *) malloc( sizeof(struct berval) )) == NULL )
254 return( LBER_DEFAULT );
256 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
257 return( LBER_DEFAULT );
259 if ( ((*bv)->bv_val = (char *) malloc( (size_t)len + 1 )) == NULL )
260 return( LBER_DEFAULT );
262 if ( (unsigned long) ber_read( ber, (*bv)->bv_val, len ) != len )
263 return( LBER_DEFAULT );
264 ((*bv)->bv_val)[len] = '\0';
267 #ifdef STR_TRANSLATION
268 if ( len > 0 && ( ber->ber_options & LBER_TRANSLATE_STRINGS ) != 0
269 && ber->ber_decode_translate_proc != NULL ) {
271 if ( (*(ber->ber_decode_translate_proc))( &((*bv)->bv_val),
273 free( (*bv)->bv_val );
274 return( LBER_DEFAULT );
276 (*bv)->bv_len = len - 1;
278 #endif /* STR_TRANSLATION */
284 ber_get_bitstringa( BerElement *ber, char **buf, unsigned long *blen )
286 unsigned long datalen, tag;
287 unsigned char unusedbits;
289 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT )
290 return( LBER_DEFAULT );
293 if ( (*buf = (char *) malloc( (size_t)datalen )) == NULL )
294 return( LBER_DEFAULT );
296 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 )
297 return( LBER_DEFAULT );
299 if ( (unsigned long) ber_read( ber, *buf, datalen ) != datalen )
300 return( LBER_DEFAULT );
302 *blen = datalen * 8 - unusedbits;
307 ber_get_null( BerElement *ber )
309 unsigned long len, tag;
311 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
312 return( LBER_DEFAULT );
315 return( LBER_DEFAULT );
321 ber_get_boolean( BerElement *ber, int *boolval )
326 rc = ber_get_int( ber, &longbool );
333 ber_first_element( BerElement *ber, unsigned long *len, char **last )
335 /* skip the sequence header, use the len to mark where to stop */
336 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
337 return( LBER_DEFAULT );
340 *last = ber->ber_ptr + *len;
342 if ( *last == ber->ber_ptr ) {
343 #ifdef LBER_END_SEQORSET
344 return( LBER_END_SEQORSET );
346 return( LBER_DEFAULT );
350 return( ber_peek_tag( ber, len ) );
354 ber_next_element( BerElement *ber, unsigned long *len, char *last )
356 if ( ber->ber_ptr == last ) {
357 #ifdef LBER_END_SEQORSET
358 return( LBER_END_SEQORSET );
360 return( LBER_DEFAULT );
364 return( ber_peek_tag( ber, len ) );
371 ( BerElement *ber, char *fmt, ... )
383 char *s, **ss, ***sss;
384 struct berval ***bv, **bvp, *bval;
387 unsigned long rc, tag, len;
393 ber = va_arg( ap, BerElement * );
394 fmt = va_arg( ap, char * );
397 if ( ber->ber_debug ) {
398 lber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
399 "ber_scanf fmt (%s) ber:\n", fmt );
400 lber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
403 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
405 case 'a': /* octet string - allocate storage as needed */
406 ss = va_arg( ap, char ** );
407 rc = ber_get_stringa( ber, ss );
410 case 'b': /* boolean */
411 i = va_arg( ap, int * );
412 rc = ber_get_boolean( ber, i );
415 case 'e': /* enumerated */
417 l = va_arg( ap, long * );
418 rc = ber_get_int( ber, l );
421 case 'l': /* length of next item */
422 l = va_arg( ap, long * );
423 rc = ber_peek_tag( ber, (unsigned long *)l );
427 rc = ber_get_null( ber );
430 case 's': /* octet string - in a buffer */
431 s = va_arg( ap, char * );
432 l = va_arg( ap, long * );
433 rc = ber_get_stringb( ber, s, (unsigned long *)l );
436 case 'o': /* octet string in a supplied berval */
437 bval = va_arg( ap, struct berval * );
438 ber_peek_tag( ber, &bval->bv_len );
439 rc = ber_get_stringa( ber, &bval->bv_val );
442 case 'O': /* octet string - allocate & include length */
443 bvp = va_arg( ap, struct berval ** );
444 rc = ber_get_stringal( ber, bvp );
447 case 'B': /* bit string - allocate storage as needed */
448 ss = va_arg( ap, char ** );
449 l = va_arg( ap, long * ); /* for length, in bits */
450 rc = ber_get_bitstringa( ber, ss, (unsigned long *)l );
453 case 't': /* tag of next item */
454 i = va_arg( ap, int * );
455 *i = rc = ber_peek_tag( ber, &len );
458 case 'T': /* skip tag of next item */
459 i = va_arg( ap, int * );
460 *i = rc = ber_skip_tag( ber, &len );
463 case 'v': /* sequence of strings */
464 sss = va_arg( ap, char *** );
467 for ( tag = ber_first_element( ber, &len, &last );
468 tag != LBER_DEFAULT &&
469 #ifdef LDAP_END_SEQORSET
470 tag != LBER_END_SEQORSET &&
473 tag = ber_next_element( ber, &len, last ) )
475 if ( *sss == NULL ) {
476 *sss = (char **) malloc(
477 2 * sizeof(char *) );
479 *sss = (char **) realloc( *sss,
480 (j + 2) * sizeof(char *) );
482 rc = ber_get_stringa( ber, &((*sss)[j]) );
485 #ifdef LDAP_END_SEQORSET
486 if (rc != LBER_DEFAULT &&
487 tag != LBER_END_SEQORSET )
496 case 'V': /* sequence of strings + lengths */
497 bv = va_arg( ap, struct berval *** );
500 for ( tag = ber_first_element( ber, &len, &last );
501 tag != LBER_DEFAULT &&
502 #ifdef LDAP_END_SEQORSET
503 tag != LBER_END_SEQORSET &&
506 tag = ber_next_element( ber, &len, last ) )
509 *bv = (struct berval **) malloc(
510 2 * sizeof(struct berval *) );
512 *bv = (struct berval **) realloc( *bv,
513 (j + 2) * sizeof(struct berval *) );
515 rc = ber_get_stringal( ber, &((*bv)[j]) );
518 #ifdef LDAP_END_SEQORSET
519 if (rc != LBER_DEFAULT &&
520 tag != LBER_END_SEQORSET )
529 case 'x': /* skip the next element - whatever it is */
530 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
535 case '{': /* begin sequence */
536 case '[': /* begin set */
537 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
538 rc = ber_skip_tag( ber, &len );
541 case '}': /* end sequence */
542 case ']': /* end set */
546 if( ber->ber_debug ) {
547 lber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
548 "ber_scanf: unknown fmt %c\n", *fmt );
561 ber_bvfree( struct berval *bv )
564 assert(bv != NULL); /* bv damn better point to something */
566 if ( bv->bv_val != NULL )
572 ber_bvecfree( struct berval **bv )
577 assert(bv != NULL); /* bv damn better point to something */
579 for ( i = 0; bv[i] != NULL; i++ )
585 ber_bvdup( struct berval *bv )
589 if ( (new = (struct berval *) malloc( sizeof(struct berval) ))
594 if ( bv->bv_val == NULL ) {
600 if ( (new->bv_val = (char *) malloc( bv->bv_len + 1 )) == NULL ) {
605 SAFEMEMCPY( new->bv_val, bv->bv_val, (size_t) bv->bv_len );
606 new->bv_val[bv->bv_len] = '\0';
607 new->bv_len = bv->bv_len;
613 #ifdef STR_TRANSLATION
615 ber_set_string_translators( BerElement *ber, BERTranslateProc encode_proc,
616 BERTranslateProc decode_proc )
618 ber->ber_encode_translate_proc = encode_proc;
619 ber->ber_decode_translate_proc = decode_proc;
621 #endif /* STR_TRANSLATION */