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 ) {
281 /* Definitions for recursive get_string */
283 enum bgbvc { ChArray, BvArray, BvVec };
285 /* Use this single cookie for state, to keep actual
286 * stack use to the absolute minimum.
288 typedef struct bgbvr {
301 /* Recursive get_string, for decoding a vector of strings. The number
302 * of elements in the vector is limited only by available stack space.
303 * Each invocation consumes 24 bytes of stack on a 32-bit machine.
306 ber_get_stringbvr( bgbvr *b, int n )
308 struct berval bv, *bvp = NULL;
311 b->tag = ber_next_element( b->ber, &b->len, b->last );
313 b->tag = ber_first_element( b->ber, &b->len, &b->last );
315 if ( b->tag == LBER_DEFAULT )
321 /* Allocate the result vector */
324 *b->res.c = LBER_MALLOC( (n+1) * sizeof( char * ));
325 if ( *b->res.c == NULL )
327 (*b->res.c)[n] = NULL;
330 *b->res.ba = LBER_MALLOC( (n+1) * sizeof( struct berval ));
331 if ( *b->res.ba == NULL )
333 (*b->res.ba)[n].bv_val = NULL;
336 *b->res.bv = LBER_MALLOC( (n+1) * sizeof( struct berval *));
337 if ( *b->res.bv == NULL )
339 (*b->res.bv)[n] = NULL;
345 /* Do all local allocs before the recursion. Then there
346 * cannot possibly be any failures on the return trip.
348 if ( b->choice == BvVec )
349 bvp = LBER_MALLOC( sizeof( struct berval ));
351 if ( ber_get_stringbv( b->ber, &bv ) == LBER_DEFAULT ) {
352 if ( bvp ) LBER_FREE( bvp );
356 b->tag = ber_get_stringbvr( b, n+1 );
360 /* store my result */
363 (*b->res.c)[n] = bv.bv_val;
366 (*b->res.ba)[n] = bv;
369 (*b->res.bv)[n] = bvp;
374 /* Failure will propagate up and free in reverse
375 * order, which is actually ideal.
377 if ( bvp ) LBER_FREE( bvp );
378 LBER_FREE( bv.bv_val );
384 ber_get_stringbv( BerElement *ber, struct berval *bv )
388 assert( ber != NULL );
389 assert( bv != NULL );
391 assert( LBER_VALID( ber ) );
393 if ( (tag = ber_skip_tag( ber, &bv->bv_len )) == LBER_DEFAULT ) {
398 if ( (bv->bv_val = (char *) LBER_MALLOC( bv->bv_len + 1 )) == NULL ) {
402 if ( bv->bv_len > 0 && (ber_len_t) ber_read( ber, bv->bv_val,
403 bv->bv_len ) != bv->bv_len ) {
404 LBER_FREE( bv->bv_val );
408 bv->bv_val[bv->bv_len] = '\0';
414 ber_get_stringa( BerElement *ber, char **buf )
419 assert( buf != NULL );
421 tag = ber_get_stringbv( ber, &bv );
428 ber_get_stringal( BerElement *ber, struct berval **bv )
432 assert( ber != NULL );
433 assert( bv != NULL );
435 *bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) );
440 tag = ber_get_stringbv( ber, *bv );
441 if ( tag == LBER_DEFAULT ) {
456 unsigned char unusedbits;
458 assert( ber != NULL );
459 assert( buf != NULL );
460 assert( blen != NULL );
462 assert( LBER_VALID( ber ) );
464 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
470 if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) {
474 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
480 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
486 *blen = datalen * 8 - unusedbits;
491 ber_get_null( BerElement *ber )
496 assert( ber != NULL );
497 assert( LBER_VALID( ber ) );
499 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
518 assert( ber != NULL );
519 assert( boolval != NULL );
521 assert( LBER_VALID( ber ) );
523 rc = ber_get_int( ber, &longbool );
535 assert( ber != NULL );
536 assert( len != NULL );
537 assert( last != NULL );
539 /* skip the sequence header, use the len to mark where to stop */
540 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
545 *last = ber->ber_ptr + *len;
547 if ( *last == ber->ber_ptr ) {
551 return ber_peek_tag( ber, len );
558 LDAP_CONST char *last )
560 assert( ber != NULL );
561 assert( len != NULL );
562 assert( last != NULL );
564 assert( LBER_VALID( ber ) );
566 if ( ber->ber_ptr == last ) {
570 return ber_peek_tag( ber, len );
573 /* Hopefully no one sends vectors with more elements than this */
574 /* Don't define this! ber_get_stringbvr works much much better! */
575 /* #define TMP_SLOTS 1024 */
579 ber_scanf ( BerElement *ber,
580 LDAP_CONST char *fmt,
584 LDAP_CONST char *fmt_reset;
586 char *s, **ss, ***sss;
587 struct berval ***bv, **bvp, *bval;
597 assert( ber != NULL );
598 assert( fmt != NULL );
600 assert( LBER_VALID( ber ) );
605 LDAP_LOG(( "liblber", LDAP_LEVEL_ENTRY, "ber_scanf fmt (%s) ber:\n", fmt ));
606 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
608 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
609 "ber_scanf fmt (%s) ber:\n", fmt );
610 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
613 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
614 /* When this is modified, remember to update
615 * the error-cleanup code below accordingly. */
617 case '!': { /* Hook */
618 BERDecodeCallback *f;
621 f = va_arg( ap, BERDecodeCallback * );
622 p = va_arg( ap, void * );
624 rc = (*f)( ber, p, 0 );
627 case 'a': /* octet string - allocate storage as needed */
628 ss = va_arg( ap, char ** );
629 rc = ber_get_stringa( ber, ss );
632 case 'b': /* boolean */
633 i = va_arg( ap, ber_int_t * );
634 rc = ber_get_boolean( ber, i );
637 case 'e': /* enumerated */
639 i = va_arg( ap, ber_int_t * );
640 rc = ber_get_int( ber, i );
643 case 'l': /* length of next item */
644 l = va_arg( ap, ber_len_t * );
645 rc = ber_peek_tag( ber, l );
649 rc = ber_get_null( ber );
652 case 's': /* octet string - in a buffer */
653 s = va_arg( ap, char * );
654 l = va_arg( ap, ber_len_t * );
655 rc = ber_get_stringb( ber, s, l );
658 case 'o': /* octet string in a supplied berval */
659 bval = va_arg( ap, struct berval * );
660 rc = ber_get_stringbv( ber, bval );
663 case 'O': /* octet string - allocate & include length */
664 bvp = va_arg( ap, struct berval ** );
665 rc = ber_get_stringal( ber, bvp );
668 case 'B': /* bit string - allocate storage as needed */
669 ss = va_arg( ap, char ** );
670 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
671 rc = ber_get_bitstringa( ber, ss, l );
674 case 't': /* tag of next item */
675 t = va_arg( ap, ber_tag_t * );
676 *t = rc = ber_peek_tag( ber, &len );
679 case 'T': /* skip tag of next item */
680 t = va_arg( ap, ber_tag_t * );
681 *t = rc = ber_skip_tag( ber, &len );
684 case 'v': /* sequence of strings */
687 char *tmp[TMP_SLOTS];
688 sss = va_arg( ap, char *** );
691 for ( tag = ber_first_element( ber, &len, &last );
692 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
693 tag = ber_next_element( ber, &len, last ) )
695 rc = ber_get_stringa( ber, &tmp[j] );
697 assert(j < TMP_SLOTS);
699 if (j > 0 && rc != LBER_DEFAULT ) {
700 *sss = (char **)LBER_MALLOC( (j+1) * sizeof(char *));
709 if ( rc == LBER_DEFAULT ) {
714 bgbvr cookie = { ber, ChArray };
715 cookie.res.c = va_arg( ap, char *** );
716 rc = ber_get_stringbvr( &cookie, 0 );
721 case 'V': /* sequence of strings + lengths */
724 struct berval *tmp[TMP_SLOTS];
725 bv = va_arg( ap, struct berval *** );
728 for ( tag = ber_first_element( ber, &len, &last );
729 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
730 tag = ber_next_element( ber, &len, last ) )
732 rc = ber_get_stringal( ber, &tmp[j] );
734 assert( j < TMP_SLOTS);
736 if (j > 0 && rc != LBER_DEFAULT ) {
737 *bv = (struct berval **)LBER_MALLOC( (j+1) * sizeof(struct berval *));
746 if ( rc == LBER_DEFAULT ) {
751 bgbvr cookie = { ber, BvVec };
752 cookie.res.bv = va_arg( ap, struct berval *** );
753 rc = ber_get_stringbvr( &cookie, 0 );
758 case 'W': /* bvarray */
761 struct berval tmp[TMP_SLOTS];
762 bvp = va_arg( ap, struct berval ** );
765 for ( tag = ber_first_element( ber, &len, &last );
766 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
767 tag = ber_next_element( ber, &len, last ) )
769 rc = ber_get_stringbv( ber, &tmp[j] );
771 assert( j < TMP_SLOTS);
773 if (j > 0 && rc != LBER_DEFAULT ) {
774 *bvp = (struct berval *)LBER_MALLOC( (j+1) * sizeof(struct berval));
778 (*bvp)[j].bv_val = NULL;
779 (*bvp)[j].bv_len = 0;
784 if ( rc == LBER_DEFAULT ) {
786 LBER_FREE(tmp[j].bv_val);
789 bgbvr cookie = { ber, BvArray };
790 cookie.res.ba = va_arg( ap, struct berval ** );
791 rc = ber_get_stringbvr( &cookie, 0 );
796 case 'x': /* skip the next element - whatever it is */
797 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
802 case '{': /* begin sequence */
803 case '[': /* begin set */
804 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V'
805 && *(fmt + 1) != 'W' )
806 rc = ber_skip_tag( ber, &len );
809 case '}': /* end sequence */
810 case ']': /* end set */
814 if( ber->ber_debug ) {
816 LDAP_LOG(( "liblber", LDAP_LEVEL_ERR,
817 "ber_scanf: unknown fmt %c\n", *fmt ));
819 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
820 "ber_scanf: unknown fmt %c\n", *fmt );
829 if ( rc == LBER_DEFAULT ) {
831 * Error. Reclaim malloced memory that was given to the caller.
832 * Set allocated pointers to NULL, "data length" outvalues to 0.
836 for ( ; fmt_reset < fmt; fmt_reset++ ) {
837 switch ( *fmt_reset ) {
838 case '!': { /* Hook */
839 BERDecodeCallback *f;
842 f = va_arg( ap, BERDecodeCallback * );
843 p = va_arg( ap, void * );
845 (void) (*f)( ber, p, 1 );
848 case 'a': /* octet string - allocate storage as needed */
849 ss = va_arg( ap, char ** );
856 case 'b': /* boolean */
857 case 'e': /* enumerated */
859 (void) va_arg( ap, int * );
862 case 's': /* octet string - in a buffer */
863 (void) va_arg( ap, char * );
864 (void) va_arg( ap, ber_len_t * );
867 case 'l': /* length of next item */
868 (void) va_arg( ap, ber_len_t * );
871 case 't': /* tag of next item */
872 case 'T': /* skip tag of next item */
873 (void) va_arg( ap, ber_tag_t * );
876 case 'o': /* octet string in a supplied berval */
877 bval = va_arg( ap, struct berval * );
878 if ( bval->bv_val != NULL ) {
879 LBER_FREE( bval->bv_val );
885 case 'O': /* octet string - allocate & include length */
886 bvp = va_arg( ap, struct berval ** );
893 case 'B': /* bit string - allocate storage as needed */
894 ss = va_arg( ap, char ** );
899 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
902 case 'v': /* sequence of strings */
903 case 'V': /* sequence of strings + lengths */
904 case 'W': /* BVarray */
906 case 'x': /* skip the next element - whatever it is */
907 case '{': /* begin sequence */
908 case '[': /* begin set */
909 case '}': /* end sequence */
910 case ']': /* end set */
914 /* format should be good */