1 /* decode.c - ber input decoding routines */
4 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
8 * Copyright (c) 1990 Regents of the University of Michigan.
11 * Redistribution and use in source and binary forms are permitted
12 * provided that this notice is preserved and that due credit is given
13 * to the University of Michigan at Ann Arbor. The name of the University
14 * may not be used to endorse or promote products derived from this
15 * software without specific prior written permission. This software
16 * is provided ``as is'' without express or implied warranty.
23 #include <ac/stdlib.h>
25 #include <ac/stdarg.h>
26 #include <ac/string.h>
27 #include <ac/socket.h>
31 static ber_len_t ber_getnint LDAP_P((
36 /* return the tag - LBER_DEFAULT returned means trouble */
38 ber_get_tag( BerElement *ber )
44 assert( ber != NULL );
45 assert( BER_VALID( ber ) );
47 if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 )
48 return( LBER_DEFAULT );
52 if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK )
55 for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
56 if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 )
57 return( LBER_DEFAULT );
60 tag |= 0x00ffUL & (ber_tag_t) xbyte;
62 if ( ! (xbyte & LBER_MORE_TAG_MASK) )
67 if ( i == sizeof(ber_tag_t) )
68 return( LBER_DEFAULT );
74 ber_skip_tag( BerElement *ber, ber_len_t *len )
79 unsigned char netlen[sizeof(ber_len_t)];
81 assert( ber != NULL );
82 assert( len != NULL );
83 assert( BER_VALID( ber ) );
86 * Any ber element looks like this: tag length contents.
87 * Assuming everything's ok, we return the tag byte (we
88 * can assume a single byte), and return the length in len.
92 * 2) primitive encodings used whenever possible
98 * First, we read the tag.
101 if ( (tag = ber_get_tag( ber )) == LBER_DEFAULT )
102 return( LBER_DEFAULT );
105 * Next, read the length. The first byte contains the length of
106 * the length. If bit 8 is set, the length is the long form,
107 * otherwise it's the short form. We don't allow a length that's
108 * greater than what we can hold in a ber_len_t.
111 if ( ber_read( ber, (char *) &lc, 1 ) != 1 )
112 return( LBER_DEFAULT );
115 noctets = (lc & 0x7fU);
117 if ( noctets > sizeof(ber_len_t) ) {
118 return( LBER_DEFAULT );
121 if( (unsigned) ber_read( ber, netlen, noctets ) != noctets ) {
122 return( LBER_DEFAULT );
125 for( i = 0; i < noctets; i++ ) {
143 * This implementation assumes ber_skip_tag() only
144 * modifies ber_ptr field of the BerElement.
151 tag = ber_skip_tag( ber, len );
163 unsigned char buf[sizeof(ber_int_t)];
165 assert( ber != NULL );
166 assert( num != NULL );
168 assert( BER_VALID( ber ) );
171 * The tag and length have already been stripped off. We should
172 * be sitting right before len bytes of 2's complement integer,
173 * ready to be read straight into an int. We may have to sign
174 * extend after we read it in.
177 if ( len > sizeof(ber_int_t) )
180 /* read into the low-order bytes of our buffer */
181 if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) {
186 /* sign extend if necessary */
188 ber_int_t netnum = 0x80 & buf[0] ? -1 : 0;
190 /* shift in the bytes */
191 for( i=0 ; i<len; i++ ) {
192 netnum = (netnum << 8 ) | buf[i];
212 assert( ber != NULL );
213 assert( BER_VALID( ber ) );
215 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
216 return( LBER_DEFAULT );
218 if ( ber_getnint( ber, num, len ) != len )
219 return( LBER_DEFAULT );
229 return ber_get_int( ber, num );
241 assert( ber != NULL );
242 assert( BER_VALID( ber ) );
244 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT )
245 return( LBER_DEFAULT );
246 if ( datalen > (*len - 1) )
247 return( LBER_DEFAULT );
249 if ( (ber_len_t) ber_read( ber, buf, datalen ) != datalen )
250 return( LBER_DEFAULT );
259 ber_get_stringa( BerElement *ber, char **buf )
264 assert( ber != NULL );
265 assert( buf != NULL );
267 assert( BER_VALID( ber ) );
269 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
271 return( LBER_DEFAULT );
274 if ( (*buf = (char *) LBER_MALLOC( datalen + 1 )) == NULL )
275 return( LBER_DEFAULT );
277 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
280 return( LBER_DEFAULT );
282 (*buf)[datalen] = '\0';
288 ber_get_stringal( BerElement *ber, struct berval **bv )
293 assert( ber != NULL );
294 assert( bv != NULL );
296 assert( BER_VALID( ber ) );
298 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
300 return( LBER_DEFAULT );
303 if ( (*bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) )) == NULL )
304 return( LBER_DEFAULT );
306 if ( ((*bv)->bv_val = (char *) LBER_MALLOC( len + 1 )) == NULL ) {
309 return( LBER_DEFAULT );
312 if ( (ber_len_t) ber_read( ber, (*bv)->bv_val, len ) != len ) {
315 return( LBER_DEFAULT );
317 ((*bv)->bv_val)[len] = '\0';
331 unsigned char unusedbits;
333 assert( ber != NULL );
334 assert( buf != NULL );
335 assert( blen != NULL );
337 assert( BER_VALID( ber ) );
339 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
341 return( LBER_DEFAULT );
345 if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL )
346 return( LBER_DEFAULT );
348 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
351 return( LBER_DEFAULT );
354 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
357 return( LBER_DEFAULT );
360 *blen = datalen * 8 - unusedbits;
365 ber_get_null( BerElement *ber )
370 assert( ber != NULL );
371 assert( BER_VALID( ber ) );
373 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
374 return( LBER_DEFAULT );
377 return( LBER_DEFAULT );
390 assert( ber != NULL );
391 assert( boolval != NULL );
393 assert( BER_VALID( ber ) );
395 rc = ber_get_int( ber, &longbool );
407 assert( ber != NULL );
408 assert( len != NULL );
409 assert( last != NULL );
411 /* skip the sequence header, use the len to mark where to stop */
412 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
414 return( LBER_DEFAULT );
417 *last = ber->ber_ptr + *len;
419 if ( *last == ber->ber_ptr ) {
420 return( LBER_DEFAULT );
423 return( ber_peek_tag( ber, len ) );
430 LDAP_CONST char *last )
432 assert( ber != NULL );
433 assert( len != NULL );
434 assert( last != NULL );
436 assert( BER_VALID( ber ) );
438 if ( ber->ber_ptr == last ) {
439 return( LBER_DEFAULT );
442 return( ber_peek_tag( ber, len ) );
447 ber_scanf ( BerElement *ber,
448 LDAP_CONST char *fmt,
452 LDAP_CONST char *fmt_reset;
454 char *s, **ss, ***sss;
455 struct berval ***bv, **bvp, *bval;
465 assert( ber != NULL );
466 assert( fmt != NULL );
468 assert( BER_VALID( ber ) );
472 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
473 "ber_scanf fmt (%s) ber:\n", fmt );
474 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
476 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
477 /* When this is modified, remember to update
478 * the error-cleanup code below accordingly. */
480 case '!': { /* Hook */
481 BERDecodeCallback *f;
484 f = va_arg( ap, BERDecodeCallback * );
485 p = va_arg( ap, void * );
487 rc = (*f)( ber, p, 0 );
490 case 'a': /* octet string - allocate storage as needed */
491 ss = va_arg( ap, char ** );
492 rc = ber_get_stringa( ber, ss );
495 case 'b': /* boolean */
496 i = va_arg( ap, ber_int_t * );
497 rc = ber_get_boolean( ber, i );
500 case 'e': /* enumerated */
502 i = va_arg( ap, ber_int_t * );
503 rc = ber_get_int( ber, i );
506 case 'l': /* length of next item */
507 l = va_arg( ap, ber_len_t * );
508 rc = ber_peek_tag( ber, l );
512 rc = ber_get_null( ber );
515 case 's': /* octet string - in a buffer */
516 s = va_arg( ap, char * );
517 l = va_arg( ap, ber_len_t * );
518 rc = ber_get_stringb( ber, s, l );
521 case 'o': /* octet string in a supplied berval */
522 bval = va_arg( ap, struct berval * );
523 ber_peek_tag( ber, &bval->bv_len );
524 rc = ber_get_stringa( ber, &bval->bv_val );
527 case 'O': /* octet string - allocate & include length */
528 bvp = va_arg( ap, struct berval ** );
529 rc = ber_get_stringal( ber, bvp );
532 case 'B': /* bit string - allocate storage as needed */
533 ss = va_arg( ap, char ** );
534 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
535 rc = ber_get_bitstringa( ber, ss, l );
538 case 't': /* tag of next item */
539 t = va_arg( ap, ber_tag_t * );
540 *t = rc = ber_peek_tag( ber, &len );
543 case 'T': /* skip tag of next item */
544 t = va_arg( ap, ber_tag_t * );
545 *t = rc = ber_skip_tag( ber, &len );
548 case 'v': /* sequence of strings */
549 sss = va_arg( ap, char *** );
552 for ( tag = ber_first_element( ber, &len, &last );
553 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
554 tag = ber_next_element( ber, &len, last ) )
556 *sss = (char **) LBER_REALLOC( *sss,
557 (j + 2) * sizeof(char *) );
559 rc = ber_get_stringa( ber, &((*sss)[j]) );
566 case 'V': /* sequence of strings + lengths */
567 bv = va_arg( ap, struct berval *** );
570 for ( tag = ber_first_element( ber, &len, &last );
571 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
572 tag = ber_next_element( ber, &len, last ) )
574 *bv = (struct berval **) LBER_REALLOC( *bv,
575 (j + 2) * sizeof(struct berval *) );
577 rc = ber_get_stringal( ber, &((*bv)[j]) );
584 case 'x': /* skip the next element - whatever it is */
585 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
590 case '{': /* begin sequence */
591 case '[': /* begin set */
592 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
593 rc = ber_skip_tag( ber, &len );
596 case '}': /* end sequence */
597 case ']': /* end set */
601 if( ber->ber_debug ) {
602 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
603 "ber_scanf: unknown fmt %c\n", *fmt );
612 if ( rc == LBER_DEFAULT ) {
614 * Error. Reclaim malloced memory that was given to the caller.
615 * Set allocated pointers to NULL, "data length" outvalues to 0.
619 for ( ; fmt_reset < fmt; fmt_reset++ ) {
620 switch ( *fmt_reset ) {
621 case '!': { /* Hook */
622 BERDecodeCallback *f;
625 f = va_arg( ap, BERDecodeCallback * );
626 p = va_arg( ap, void * );
628 (void) (*f)( ber, p, 1 );
631 case 'a': /* octet string - allocate storage as needed */
632 ss = va_arg( ap, char ** );
639 case 'b': /* boolean */
640 case 'e': /* enumerated */
642 (void) va_arg( ap, int * );
645 case 's': /* octet string - in a buffer */
646 (void) va_arg( ap, char * );
647 (void) va_arg( ap, ber_len_t * );
650 case 'l': /* length of next item */
651 (void) va_arg( ap, ber_len_t * );
654 case 't': /* tag of next item */
655 case 'T': /* skip tag of next item */
656 (void) va_arg( ap, ber_tag_t * );
659 case 'o': /* octet string in a supplied berval */
660 bval = va_arg( ap, struct berval * );
661 if ( bval->bv_val != NULL ) {
662 LBER_FREE( bval->bv_val );
668 case 'O': /* octet string - allocate & include length */
669 bvp = va_arg( ap, struct berval ** );
676 case 'B': /* bit string - allocate storage as needed */
677 ss = va_arg( ap, char ** );
682 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
685 case 'v': /* sequence of strings */
686 sss = va_arg( ap, char *** );
688 for (j = 0; (*sss)[j]; j++) {
689 LBER_FREE( (*sss)[j] );
697 case 'V': /* sequence of strings + lengths */
698 bv = va_arg( ap, struct berval *** );
706 case 'x': /* skip the next element - whatever it is */
707 case '{': /* begin sequence */
708 case '[': /* begin set */
709 case '}': /* end sequence */
710 case ']': /* end set */
714 /* format should be good */