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( LBER_VALID( ber ) );
47 if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) {
53 if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) {
57 for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
58 if ( ber_read( ber, (char *) &xbyte, 1 ) != 1 ) {
63 tag |= 0x00ffUL & (ber_tag_t) xbyte;
65 if ( ! (xbyte & LBER_MORE_TAG_MASK) ) {
71 if ( i == sizeof(ber_tag_t) ) {
79 ber_skip_tag( BerElement *ber, ber_len_t *len )
84 unsigned char netlen[sizeof(ber_len_t)];
86 assert( ber != NULL );
87 assert( len != NULL );
88 assert( LBER_VALID( ber ) );
91 * Any ber element looks like this: tag length contents.
92 * Assuming everything's ok, we return the tag byte (we
93 * can assume a single byte), and return the length in len.
97 * 2) primitive encodings used whenever possible
103 * First, we read the tag.
106 if ( (tag = ber_get_tag( ber )) == LBER_DEFAULT ) {
111 * Next, read the length. The first byte contains the length of
112 * the length. If bit 8 is set, the length is the long form,
113 * otherwise it's the short form. We don't allow a length that's
114 * greater than what we can hold in a ber_len_t.
117 if ( ber_read( ber, (char *) &lc, 1 ) != 1 )
121 noctets = (lc & 0x7fU);
123 if ( noctets > sizeof(ber_len_t) ) {
127 if( (unsigned) ber_read( ber, netlen, noctets ) != noctets ) {
131 for( i = 0; i < noctets; i++ ) {
140 /* BER length should be non-negative */
145 /* BER element should have enough data left */
146 if( *len > (ber_len_t) ber_pvt_ber_remaining( ber ) ) {
159 * This implementation assumes ber_skip_tag() only
160 * modifies ber_ptr field of the BerElement.
167 tag = ber_skip_tag( ber, len );
179 unsigned char buf[sizeof(ber_int_t)];
181 assert( ber != NULL );
182 assert( num != NULL );
183 assert( LBER_VALID( ber ) );
186 * The tag and length have already been stripped off. We should
187 * be sitting right before len bytes of 2's complement integer,
188 * ready to be read straight into an int. We may have to sign
189 * extend after we read it in.
192 if ( len > sizeof(ber_int_t) ) {
196 /* read into the low-order bytes of our buffer */
197 if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) {
202 /* sign extend if necessary */
204 ber_int_t netnum = 0x80 & buf[0] ? -1 : 0;
206 /* shift in the bytes */
207 for( i=0 ; i<len; i++ ) {
208 netnum = (netnum << 8 ) | buf[i];
228 assert( ber != NULL );
229 assert( LBER_VALID( ber ) );
231 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
235 if ( ber_getnint( ber, num, len ) != len ) {
247 return ber_get_int( ber, num );
259 assert( ber != NULL );
260 assert( LBER_VALID( ber ) );
262 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
266 /* must fit within allocated space with termination */
267 if ( datalen >= *len ) {
271 if ( (ber_len_t) ber_read( ber, buf, datalen ) != datalen ) {
282 ber_get_stringbv( BerElement *ber, struct berval *bv )
286 assert( ber != NULL );
287 assert( bv != NULL );
289 assert( LBER_VALID( ber ) );
291 if ( (tag = ber_skip_tag( ber, &bv->bv_len )) == LBER_DEFAULT ) {
296 if ( (bv->bv_val = (char *) LBER_MALLOC( bv->bv_len + 1 )) == NULL ) {
300 if ( bv->bv_len > 0 && (ber_len_t) ber_read( ber, bv->bv_val,
301 bv->bv_len ) != bv->bv_len ) {
302 LBER_FREE( bv->bv_val );
306 bv->bv_val[bv->bv_len] = '\0';
312 ber_get_stringa( BerElement *ber, char **buf )
317 assert( buf != NULL );
319 tag = ber_get_stringbv( ber, &bv );
326 ber_get_stringal( BerElement *ber, struct berval **bv )
330 assert( ber != NULL );
331 assert( bv != NULL );
333 *bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) );
338 tag = ber_get_stringbv( ber, *bv );
339 if ( tag == LBER_DEFAULT ) {
354 unsigned char unusedbits;
356 assert( ber != NULL );
357 assert( buf != NULL );
358 assert( blen != NULL );
360 assert( LBER_VALID( ber ) );
362 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
368 if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) {
372 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
378 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
384 *blen = datalen * 8 - unusedbits;
389 ber_get_null( BerElement *ber )
394 assert( ber != NULL );
395 assert( LBER_VALID( ber ) );
397 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
416 assert( ber != NULL );
417 assert( boolval != NULL );
419 assert( LBER_VALID( ber ) );
421 rc = ber_get_int( ber, &longbool );
433 assert( ber != NULL );
434 assert( len != NULL );
435 assert( last != NULL );
437 /* skip the sequence header, use the len to mark where to stop */
438 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
443 *last = ber->ber_ptr + *len;
445 if ( *last == ber->ber_ptr ) {
449 return ber_peek_tag( ber, len );
456 LDAP_CONST char *last )
458 assert( ber != NULL );
459 assert( len != NULL );
460 assert( last != NULL );
462 assert( LBER_VALID( ber ) );
464 if ( ber->ber_ptr == last ) {
468 return ber_peek_tag( ber, len );
471 /* Hopefully no one sends vectors with more elements than this */
472 #define TMP_SLOTS 1024
476 ber_scanf ( BerElement *ber,
477 LDAP_CONST char *fmt,
481 LDAP_CONST char *fmt_reset;
483 char *s, **ss, ***sss;
484 struct berval ***bv, **bvp, *bval;
494 assert( ber != NULL );
495 assert( fmt != NULL );
497 assert( LBER_VALID( ber ) );
502 LDAP_LOG(( "liblber", LDAP_LEVEL_ENTRY, "ber_scanf fmt (%s) ber:\n", fmt ));
503 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
505 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
506 "ber_scanf fmt (%s) ber:\n", fmt );
507 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
510 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
511 /* When this is modified, remember to update
512 * the error-cleanup code below accordingly. */
514 case '!': { /* Hook */
515 BERDecodeCallback *f;
518 f = va_arg( ap, BERDecodeCallback * );
519 p = va_arg( ap, void * );
521 rc = (*f)( ber, p, 0 );
524 case 'a': /* octet string - allocate storage as needed */
525 ss = va_arg( ap, char ** );
526 rc = ber_get_stringa( ber, ss );
529 case 'b': /* boolean */
530 i = va_arg( ap, ber_int_t * );
531 rc = ber_get_boolean( ber, i );
534 case 'e': /* enumerated */
536 i = va_arg( ap, ber_int_t * );
537 rc = ber_get_int( ber, i );
540 case 'l': /* length of next item */
541 l = va_arg( ap, ber_len_t * );
542 rc = ber_peek_tag( ber, l );
546 rc = ber_get_null( ber );
549 case 's': /* octet string - in a buffer */
550 s = va_arg( ap, char * );
551 l = va_arg( ap, ber_len_t * );
552 rc = ber_get_stringb( ber, s, l );
555 case 'o': /* octet string in a supplied berval */
556 bval = va_arg( ap, struct berval * );
557 rc = ber_get_stringbv( ber, bval );
560 case 'O': /* octet string - allocate & include length */
561 bvp = va_arg( ap, struct berval ** );
562 rc = ber_get_stringal( ber, bvp );
565 case 'B': /* bit string - allocate storage as needed */
566 ss = va_arg( ap, char ** );
567 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
568 rc = ber_get_bitstringa( ber, ss, l );
571 case 't': /* tag of next item */
572 t = va_arg( ap, ber_tag_t * );
573 *t = rc = ber_peek_tag( ber, &len );
576 case 'T': /* skip tag of next item */
577 t = va_arg( ap, ber_tag_t * );
578 *t = rc = ber_skip_tag( ber, &len );
581 case 'v': /* sequence of strings */
583 char *tmp[TMP_SLOTS];
584 sss = va_arg( ap, char *** );
587 for ( tag = ber_first_element( ber, &len, &last );
588 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
589 tag = ber_next_element( ber, &len, last ) )
591 rc = ber_get_stringa( ber, &tmp[j] );
593 assert(j < TMP_SLOTS);
595 if (j > 0 && rc != LBER_DEFAULT ) {
596 *sss = (char **)LBER_MALLOC( (j+1) * sizeof(char *));
605 if ( rc == LBER_DEFAULT ) {
612 case 'V': /* sequence of strings + lengths */
614 struct berval *tmp[TMP_SLOTS];
615 bv = va_arg( ap, struct berval *** );
618 for ( tag = ber_first_element( ber, &len, &last );
619 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
620 tag = ber_next_element( ber, &len, last ) )
622 rc = ber_get_stringal( ber, &tmp[j] );
624 assert( j < TMP_SLOTS);
626 if (j > 0 && rc != LBER_DEFAULT ) {
627 *bv = (struct berval **)LBER_MALLOC( (j+1) * sizeof(struct berval *));
636 if ( rc == LBER_DEFAULT ) {
643 case 'W': /* bvarray */
645 struct berval tmp[TMP_SLOTS];
646 bvp = va_arg( ap, struct berval ** );
649 for ( tag = ber_first_element( ber, &len, &last );
650 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
651 tag = ber_next_element( ber, &len, last ) )
653 rc = ber_get_stringbv( ber, &tmp[j] );
655 assert( j < TMP_SLOTS);
657 if (j > 0 && rc != LBER_DEFAULT ) {
658 *bvp = (struct berval *)LBER_MALLOC( (j+1) * sizeof(struct berval));
662 (*bvp)[j].bv_val = NULL;
663 (*bvp)[j].bv_len = 0;
668 if ( rc == LBER_DEFAULT ) {
670 LBER_FREE(tmp[j].bv_val);
675 case 'x': /* skip the next element - whatever it is */
676 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
681 case '{': /* begin sequence */
682 case '[': /* begin set */
683 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
684 rc = ber_skip_tag( ber, &len );
687 case '}': /* end sequence */
688 case ']': /* end set */
692 if( ber->ber_debug ) {
694 LDAP_LOG(( "liblber", LDAP_LEVEL_ERR,
695 "ber_scanf: unknown fmt %c\n", *fmt ));
697 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
698 "ber_scanf: unknown fmt %c\n", *fmt );
709 if ( rc == LBER_DEFAULT ) {
711 * Error. Reclaim malloced memory that was given to the caller.
712 * Set allocated pointers to NULL, "data length" outvalues to 0.
716 for ( ; fmt_reset < fmt; fmt_reset++ ) {
717 switch ( *fmt_reset ) {
718 case '!': { /* Hook */
719 BERDecodeCallback *f;
722 f = va_arg( ap, BERDecodeCallback * );
723 p = va_arg( ap, void * );
725 (void) (*f)( ber, p, 1 );
728 case 'a': /* octet string - allocate storage as needed */
729 ss = va_arg( ap, char ** );
736 case 'b': /* boolean */
737 case 'e': /* enumerated */
739 (void) va_arg( ap, int * );
742 case 's': /* octet string - in a buffer */
743 (void) va_arg( ap, char * );
744 (void) va_arg( ap, ber_len_t * );
747 case 'l': /* length of next item */
748 (void) va_arg( ap, ber_len_t * );
751 case 't': /* tag of next item */
752 case 'T': /* skip tag of next item */
753 (void) va_arg( ap, ber_tag_t * );
756 case 'o': /* octet string in a supplied berval */
757 bval = va_arg( ap, struct berval * );
758 if ( bval->bv_val != NULL ) {
759 LBER_FREE( bval->bv_val );
765 case 'O': /* octet string - allocate & include length */
766 bvp = va_arg( ap, struct berval ** );
773 case 'B': /* bit string - allocate storage as needed */
774 ss = va_arg( ap, char ** );
779 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
782 case 'v': /* sequence of strings */
783 case 'V': /* sequence of strings + lengths */
784 case 'W': /* BVarray */
786 case 'x': /* skip the next element - whatever it is */
787 case '{': /* begin sequence */
788 case '[': /* begin set */
789 case '}': /* end sequence */
790 case ']': /* end set */
794 /* format should be good */