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_stringa( BerElement *ber, char **buf )
287 assert( ber != NULL );
288 assert( buf != NULL );
290 assert( LBER_VALID( ber ) );
292 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
297 if ( (*buf = (char *) LBER_MALLOC( datalen + 1 )) == NULL ) {
301 if ( datalen > 0 && (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
306 (*buf)[datalen] = '\0';
312 ber_get_stringal( BerElement *ber, struct berval **bv )
317 assert( ber != NULL );
318 assert( bv != NULL );
320 assert( LBER_VALID( ber ) );
322 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
327 *bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) );
333 (*bv)->bv_val = NULL;
338 (*bv)->bv_val = (char *) LBER_MALLOC( len + 1 );
339 if ( (*bv)->bv_val == NULL ) {
345 if ( (ber_len_t) ber_read( ber, (*bv)->bv_val, len ) != len ) {
351 ((*bv)->bv_val)[len] = '\0';
365 unsigned char unusedbits;
367 assert( ber != NULL );
368 assert( buf != NULL );
369 assert( blen != NULL );
371 assert( LBER_VALID( ber ) );
373 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
379 if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) {
383 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
389 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
395 *blen = datalen * 8 - unusedbits;
400 ber_get_null( BerElement *ber )
405 assert( ber != NULL );
406 assert( LBER_VALID( ber ) );
408 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
427 assert( ber != NULL );
428 assert( boolval != NULL );
430 assert( LBER_VALID( ber ) );
432 rc = ber_get_int( ber, &longbool );
444 assert( ber != NULL );
445 assert( len != NULL );
446 assert( last != NULL );
448 /* skip the sequence header, use the len to mark where to stop */
449 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
454 *last = ber->ber_ptr + *len;
456 if ( *last == ber->ber_ptr ) {
460 return ber_peek_tag( ber, len );
467 LDAP_CONST char *last )
469 assert( ber != NULL );
470 assert( len != NULL );
471 assert( last != NULL );
473 assert( LBER_VALID( ber ) );
475 if ( ber->ber_ptr == last ) {
479 return ber_peek_tag( ber, len );
484 ber_scanf ( BerElement *ber,
485 LDAP_CONST char *fmt,
489 LDAP_CONST char *fmt_reset;
491 char *s, **ss, ***sss;
492 struct berval ***bv, **bvp, *bval;
502 assert( ber != NULL );
503 assert( fmt != NULL );
505 assert( LBER_VALID( ber ) );
510 LDAP_LOG(( "liblber", LDAP_LEVEL_ENTRY, "ber_scanf fmt (%s) ber:\n", fmt ));
511 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
513 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
514 "ber_scanf fmt (%s) ber:\n", fmt );
515 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
518 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
519 /* When this is modified, remember to update
520 * the error-cleanup code below accordingly. */
522 case '!': { /* Hook */
523 BERDecodeCallback *f;
526 f = va_arg( ap, BERDecodeCallback * );
527 p = va_arg( ap, void * );
529 rc = (*f)( ber, p, 0 );
532 case 'a': /* octet string - allocate storage as needed */
533 ss = va_arg( ap, char ** );
534 rc = ber_get_stringa( ber, ss );
537 case 'b': /* boolean */
538 i = va_arg( ap, ber_int_t * );
539 rc = ber_get_boolean( ber, i );
542 case 'e': /* enumerated */
544 i = va_arg( ap, ber_int_t * );
545 rc = ber_get_int( ber, i );
548 case 'l': /* length of next item */
549 l = va_arg( ap, ber_len_t * );
550 rc = ber_peek_tag( ber, l );
554 rc = ber_get_null( ber );
557 case 's': /* octet string - in a buffer */
558 s = va_arg( ap, char * );
559 l = va_arg( ap, ber_len_t * );
560 rc = ber_get_stringb( ber, s, l );
563 case 'o': /* octet string in a supplied berval */
564 bval = va_arg( ap, struct berval * );
565 ber_peek_tag( ber, &bval->bv_len );
566 rc = ber_get_stringa( ber, &bval->bv_val );
569 case 'O': /* octet string - allocate & include length */
570 bvp = va_arg( ap, struct berval ** );
571 rc = ber_get_stringal( ber, bvp );
574 case 'B': /* bit string - allocate storage as needed */
575 ss = va_arg( ap, char ** );
576 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
577 rc = ber_get_bitstringa( ber, ss, l );
580 case 't': /* tag of next item */
581 t = va_arg( ap, ber_tag_t * );
582 *t = rc = ber_peek_tag( ber, &len );
585 case 'T': /* skip tag of next item */
586 t = va_arg( ap, ber_tag_t * );
587 *t = rc = ber_skip_tag( ber, &len );
590 case 'v': /* sequence of strings */
591 sss = va_arg( ap, char *** );
594 for ( tag = ber_first_element( ber, &len, &last );
595 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
596 tag = ber_next_element( ber, &len, last ) )
600 *sss = (char **) LBER_REALLOC( *sss,
601 (j + 2) * sizeof(char *) );
605 ber_memvfree( (void **) save );
610 rc = ber_get_stringa( ber, &((*sss)[j]) );
613 if ( j > 0 ) (*sss)[j] = NULL;
616 case 'V': /* sequence of strings + lengths */
617 bv = va_arg( ap, struct berval *** );
620 for ( tag = ber_first_element( ber, &len, &last );
621 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
622 tag = ber_next_element( ber, &len, last ) )
624 struct berval **save = *bv;
626 *bv = (struct berval **) LBER_REALLOC( *bv,
627 (j + 2) * sizeof(struct berval *) );
631 ber_bvecfree( save );
636 rc = ber_get_stringal( ber, &((*bv)[j]) );
639 if ( j > 0 ) (*bv)[j] = NULL;
642 case 'x': /* skip the next element - whatever it is */
643 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
648 case '{': /* begin sequence */
649 case '[': /* begin set */
650 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
651 rc = ber_skip_tag( ber, &len );
654 case '}': /* end sequence */
655 case ']': /* end set */
659 if( ber->ber_debug ) {
661 LDAP_LOG(( "liblber", LDAP_LEVEL_ERR,
662 "ber_scanf: unknown fmt %c\n", *fmt ));
664 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
665 "ber_scanf: unknown fmt %c\n", *fmt );
676 if ( rc == LBER_DEFAULT ) {
678 * Error. Reclaim malloced memory that was given to the caller.
679 * Set allocated pointers to NULL, "data length" outvalues to 0.
683 for ( ; fmt_reset < fmt; fmt_reset++ ) {
684 switch ( *fmt_reset ) {
685 case '!': { /* Hook */
686 BERDecodeCallback *f;
689 f = va_arg( ap, BERDecodeCallback * );
690 p = va_arg( ap, void * );
692 (void) (*f)( ber, p, 1 );
695 case 'a': /* octet string - allocate storage as needed */
696 ss = va_arg( ap, char ** );
703 case 'b': /* boolean */
704 case 'e': /* enumerated */
706 (void) va_arg( ap, int * );
709 case 's': /* octet string - in a buffer */
710 (void) va_arg( ap, char * );
711 (void) va_arg( ap, ber_len_t * );
714 case 'l': /* length of next item */
715 (void) va_arg( ap, ber_len_t * );
718 case 't': /* tag of next item */
719 case 'T': /* skip tag of next item */
720 (void) va_arg( ap, ber_tag_t * );
723 case 'o': /* octet string in a supplied berval */
724 bval = va_arg( ap, struct berval * );
725 if ( bval->bv_val != NULL ) {
726 LBER_FREE( bval->bv_val );
732 case 'O': /* octet string - allocate & include length */
733 bvp = va_arg( ap, struct berval ** );
740 case 'B': /* bit string - allocate storage as needed */
741 ss = va_arg( ap, char ** );
746 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
749 case 'v': /* sequence of strings */
750 sss = va_arg( ap, char *** );
752 ber_memvfree( (void **) *sss );
757 case 'V': /* sequence of strings + lengths */
758 bv = va_arg( ap, struct berval *** );
766 case 'x': /* skip the next element - whatever it is */
767 case '{': /* begin sequence */
768 case '[': /* begin set */
769 case '}': /* end sequence */
770 case ']': /* end set */
774 /* format should be good */