1 /* decode.c - ber input decoding routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2009 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
16 /* Portions Copyright (c) 1990 Regents of the University of Michigan.
17 * All rights reserved.
19 * Redistribution and use in source and binary forms are permitted
20 * provided that this notice is preserved and that due credit is given
21 * to the University of Michigan at Ann Arbor. The name of the University
22 * may not be used to endorse or promote products derived from this
23 * software without specific prior written permission. This software
24 * is provided ``as is'' without express or implied warranty.
27 * This work was originally developed by the University of Michigan
28 * (as part of U-MICH LDAP).
35 #include <ac/stdlib.h>
36 #include <ac/stdarg.h>
37 #include <ac/string.h>
38 #include <ac/socket.h>
43 /* out->bv_len should be the buffer size on input */
45 ber_decode_oid( BerValue *in, BerValue *out )
47 const unsigned char *der;
54 assert( out != NULL );
56 /* need 4 chars/inbyte + \0 for input={7f 7f 7f...} */
57 if ( !out->bv_val || (out->bv_len+3)/4 <= in->bv_len )
61 der = (unsigned char *) in->bv_val;
63 for ( i=0; i < in->bv_len; i++ ) {
65 if ( !( der[i] & 0x80 )) {
67 /* Initial "x.y": val=x*40+y, x<=2, y<40 if x<2 */
69 val1 = (val < 80 ? val/40 : 2);
71 ptr += sprintf( ptr, "%u", val1 );
73 ptr += sprintf( ptr, ".%lu", val );
75 } else if ( val - 1UL < LBER_OID_COMPONENT_MAX >> 7 ) {
78 /* val would overflow, or is 0 from invalid initial 0x80 octet */
82 if ( ptr == NULL || val != 0 )
85 out->bv_len = ptr - out->bv_val;
89 /* Return tag, with *bv = rest of element (starting at length octets) */
91 ber_tag_and_rest( const BerElement *ber, struct berval *bv )
97 assert( ber != NULL );
98 assert( LBER_VALID( ber ) );
100 ptr = (unsigned char *) ber->ber_ptr;
101 rest = (unsigned char *) ber->ber_end - ptr;
107 if ( (char *) ptr == ber->ber_buf ) {
112 if ( (tag & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK ) {
121 tag |= *ptr++ & 0xffU;
124 if ( ! (tag & LBER_MORE_TAG_MASK) ) {
127 } while ( tag <= (ber_tag_t)-1 / 256 );
130 /* Error or unsupported tag size */
135 bv->bv_val = (char *) ptr;
139 /* Return the tag - LBER_DEFAULT returned means trouble */
141 ber_get_tag( BerElement *ber )
144 ber_tag_t tag = ber_tag_and_rest( ber, &bv );
146 ber->ber_ptr = bv.bv_val;
150 /* Return next element's tag and point *bv at its contents in-place */
152 ber_peek_element( const BerElement *ber, struct berval *bv )
159 assert( bv != NULL );
162 * Any ber element looks like this: tag length contents.
163 * Assuming everything's ok, we return the tag, and point
164 * bv at the contents.
167 * 1) definite lengths
168 * 2) primitive encodings used whenever possible
174 * First, we read the tag.
176 tag = ber_tag_and_rest( ber, bv );
179 ptr = (unsigned char *) bv->bv_val;
180 if ( tag == LBER_DEFAULT || rest == 0 ) {
185 * Next, read the length. The first octet determines the length
186 * of the length. If bit 8 is 0, the length is the short form,
187 * otherwise if the octet != 0x80 it's the long form, otherwise
188 * the ber element has the unsupported indefinite-length format.
189 * Lengths that do not fit in a ber_len_t are not accepted.
197 if ( len - 1U > sizeof(ber_len_t) - 1U || rest < len ) {
198 /* Indefinite-length/too long length/not enough data */
204 for( len = *ptr++ & 0xffU; --i; len |= *ptr++ & 0xffU ) {
209 /* BER element should have enough data left */
216 bv->bv_val = (char *) ptr;
220 /* Move past next element, point *bv at it in-place, and return its tag.
221 * The caller may \0-terminate *bv, as next octet is saved in ber->ber_tag.
222 * Similar to ber_get_stringbv(ber, bv, LBER_BV_NOTERM) except on error.
225 ber_skip_element( BerElement *ber, struct berval *bv )
227 ber_tag_t tag = ber_peek_element( ber, bv );
229 if ( tag != LBER_DEFAULT ) {
230 ber->ber_ptr = bv->bv_val + bv->bv_len;
231 ber->ber_tag = *(unsigned char *) ber->ber_ptr;
243 ber_tag_t tag = ber_peek_element( ber, &bv );
250 ber_skip_tag( BerElement *ber, ber_len_t *lenp )
253 ber_tag_t tag = ber_peek_element( ber, &bv );
255 ber->ber_ptr = bv.bv_val;
256 ber->ber_tag = *(unsigned char *) ber->ber_ptr;
271 assert( num != NULL );
273 tag = ber_skip_element( ber, &bv );
275 if ( tag == LBER_DEFAULT || len > sizeof(ber_int_t) ) {
279 /* parse two's complement integer */
281 unsigned char *buf = (unsigned char *) bv.bv_val;
283 ber_int_t netnum = buf[0] & 0xff;
286 netnum = (netnum ^ 0x80) - 0x80;
288 /* shift in the bytes */
289 for( i = 1; i < len; i++ ) {
290 netnum = (netnum << 8 ) | buf[i];
307 return ber_get_int( ber, num );
319 if ( (tag = ber_skip_element( ber, &bv )) == LBER_DEFAULT ) {
323 /* must fit within allocated space with termination */
324 if ( bv.bv_len >= *len ) {
328 memcpy( buf, bv.bv_val, bv.bv_len );
329 buf[bv.bv_len] = '\0';
335 /* Definitions for get_string vector
337 * ChArray, BvArray, and BvVec are self-explanatory.
338 * BvOff is a struct berval embedded in an array of larger structures
339 * of siz bytes at off bytes from the beginning of the struct.
341 enum bgbvc { ChArray, BvArray, BvVec, BvOff };
343 /* Use this single cookie for state, to keep actual
344 * stack use to the absolute minimum.
346 typedef struct bgbvr {
347 const enum bgbvc choice;
348 const int option; /* (ALLOC unless BvOff) | (STRING if ChArray) */
349 ber_len_t siz; /* input array element size, output count */
350 ber_len_t off; /* BvOff offset to the struct berval */
355 ber_get_stringbvl( BerElement *ber, bgbvr *b )
359 ber_len_t tot_size = 0, siz = b->siz;
361 struct berval bv, *bvp = NULL;
363 char **ca; /* ChArray */
364 BerVarray ba; /* BvArray */
365 struct berval **bv; /* BvVec */
366 char *bo; /* BvOff */
369 tag = ber_skip_tag( ber, &bv.bv_len );
371 if ( tag != LBER_DEFAULT ) {
374 last = orig + bv.bv_len;
376 for ( ; ber->ber_ptr < last; i++, tot_size += siz ) {
377 if ( ber_skip_element( ber, &bv ) == LBER_DEFAULT )
380 if ( ber->ber_ptr != last ) {
386 ber->ber_tag = *(unsigned char *) orig;
394 /* Allocate and NULL-terminate the result vector */
395 b->result = ber_memalloc_x( tot_size + siz, ber->ber_memctx );
396 if ( b->result == NULL ) {
406 res.ba[i].bv_val = NULL;
413 res.bo = (char *) b->result + b->off;
414 ((struct berval *) (res.bo + tot_size))->bv_val = NULL;
421 tag = ber_get_stringbv( ber, &bv, b->option );
422 if ( tag == LBER_DEFAULT ) {
426 /* store my result */
429 res.ca[n] = bv.bv_val;
435 bvp = ber_memalloc_x( sizeof( struct berval ),
438 ber_memfree_x( bv.bv_val, ber->ber_memctx );
445 *(struct berval *)(res.bo + tot_size) = bv;
453 if (b->choice != BvOff) { /* BvOff does not have LBER_BV_ALLOC set */
457 ber_memfree_x(res.ca[n], ber->ber_memctx);
460 ber_memfree_x(res.ba[n].bv_val, ber->ber_memctx);
463 ber_memfree_x(res.bv[n]->bv_val, ber->ber_memctx);
464 ber_memfree_x(res.bv[n], ber->ber_memctx);
471 ber_memfree_x(b->result, ber->ber_memctx);
477 ber_get_stringbv( BerElement *ber, struct berval *bv, int option )
482 tag = ber_skip_element( ber, bv );
483 if ( tag == LBER_DEFAULT ||
484 (( option & LBER_BV_STRING ) &&
485 bv->bv_len && memchr( bv->bv_val, 0, bv->bv_len - 1 )))
492 if ( option & LBER_BV_ALLOC ) {
493 bv->bv_val = (char *) ber_memalloc_x( bv->bv_len + 1,
495 if ( bv->bv_val == NULL ) {
499 if ( bv->bv_len != 0 ) {
500 memcpy( bv->bv_val, data, bv->bv_len );
504 if ( !( option & LBER_BV_NOTERM ))
505 data[bv->bv_len] = '\0';
511 ber_get_stringbv_null( BerElement *ber, struct berval *bv, int option )
516 tag = ber_skip_element( ber, bv );
517 if ( tag == LBER_DEFAULT || bv->bv_len == 0 ) {
522 if (( option & LBER_BV_STRING ) &&
523 memchr( bv->bv_val, 0, bv->bv_len - 1 ))
530 if ( option & LBER_BV_ALLOC ) {
531 bv->bv_val = (char *) ber_memalloc_x( bv->bv_len + 1,
533 if ( bv->bv_val == NULL ) {
537 memcpy( bv->bv_val, data, bv->bv_len );
540 if ( !( option & LBER_BV_NOTERM ))
541 data[bv->bv_len] = '\0';
547 ber_get_stringa( BerElement *ber, char **buf )
552 assert( buf != NULL );
554 tag = ber_get_stringbv( ber, &bv, LBER_BV_ALLOC | LBER_BV_STRING );
561 ber_get_stringa_null( BerElement *ber, char **buf )
566 assert( buf != NULL );
568 tag = ber_get_stringbv_null( ber, &bv, LBER_BV_ALLOC | LBER_BV_STRING );
575 ber_get_stringal( BerElement *ber, struct berval **bv )
579 assert( ber != NULL );
580 assert( bv != NULL );
582 *bv = (struct berval *) ber_memalloc_x( sizeof(struct berval),
588 tag = ber_get_stringbv( ber, *bv, LBER_BV_ALLOC );
589 if ( tag == LBER_DEFAULT ) {
590 ber_memfree_x( *bv, ber->ber_memctx );
604 unsigned char unusedbits;
606 assert( buf != NULL );
607 assert( blen != NULL );
609 if ( (tag = ber_skip_element( ber, &data )) == LBER_DEFAULT ) {
613 if ( --data.bv_len > (ber_len_t)-1 / 8 ) {
616 unusedbits = *(unsigned char *) data.bv_val++;
617 if ( unusedbits > 7 ) {
621 if ( memchr( data.bv_val, 0, data.bv_len )) {
625 *buf = (char *) ber_memalloc_x( data.bv_len, ber->ber_memctx );
626 if ( *buf == NULL ) {
629 memcpy( *buf, data.bv_val, data.bv_len );
631 *blen = data.bv_len * 8 - unusedbits;
640 ber_get_null( BerElement *ber )
643 ber_tag_t tag = ber_skip_tag( ber, &len );
645 return( len == 0 ? tag : LBER_DEFAULT );
653 return ber_get_int( ber, boolval );
662 assert( last != NULL );
664 /* skip the sequence header, use the len to mark where to stop */
665 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
670 *last = ber->ber_ptr + *len;
676 return ber_peek_tag( ber, len );
683 LDAP_CONST char *last )
685 assert( ber != NULL );
686 assert( last != NULL );
687 assert( LBER_VALID( ber ) );
689 if ( ber->ber_ptr >= last ) {
693 return ber_peek_tag( ber, len );
698 ber_scanf ( BerElement *ber,
699 LDAP_CONST char *fmt,
703 LDAP_CONST char *fmt_reset;
704 char *s, **ss, ***sss;
705 struct berval data, *bval, **bvp, ***bvpp;
714 assert( ber != NULL );
715 assert( fmt != NULL );
716 assert( LBER_VALID( ber ) );
720 if ( ber->ber_debug & (LDAP_DEBUG_TRACE|LDAP_DEBUG_BER)) {
721 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
722 "ber_scanf fmt (%s) ber:\n", fmt );
723 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
726 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
727 /* When this is modified, remember to update
728 * the error-cleanup code below accordingly. */
730 case '!': { /* Hook */
731 BERDecodeCallback *f;
734 f = va_arg( ap, BERDecodeCallback * );
735 p = va_arg( ap, void * );
737 rc = (*f)( ber, p, 0 );
740 case 'a': /* octet string - allocate storage as needed */
741 ss = va_arg( ap, char ** );
742 rc = ber_get_stringa( ber, ss );
745 case 'A': /* octet string - allocate storage as needed,
746 * but return NULL if len == 0 */
747 ss = va_arg( ap, char ** );
748 rc = ber_get_stringa_null( ber, ss );
751 case 'b': /* boolean */
752 i = va_arg( ap, ber_int_t * );
753 rc = ber_get_boolean( ber, i );
756 case 'B': /* bit string - allocate storage as needed */
757 ss = va_arg( ap, char ** );
758 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
759 rc = ber_get_bitstringa( ber, ss, l );
762 case 'e': /* enumerated */
763 case 'i': /* integer */
764 i = va_arg( ap, ber_int_t * );
765 rc = ber_get_int( ber, i );
768 case 'l': /* length of next item */
769 l = va_arg( ap, ber_len_t * );
770 rc = ber_peek_tag( ber, l );
773 case 'm': /* octet string in berval, in-place */
774 bval = va_arg( ap, struct berval * );
775 rc = ber_get_stringbv( ber, bval, 0 );
778 case 'M': /* bvoffarray - must include address of
779 * a record len, and record offset.
780 * number of records will be returned thru
781 * len ptr on finish. parsed in-place.
784 bgbvr cookie = { BvOff, 0 };
785 bvp = va_arg( ap, struct berval ** );
786 l = va_arg( ap, ber_len_t * );
788 cookie.off = va_arg( ap, ber_len_t );
789 rc = ber_get_stringbvl( ber, &cookie );
790 *bvp = cookie.result;
796 rc = ber_get_null( ber );
799 case 'o': /* octet string in a supplied berval */
800 bval = va_arg( ap, struct berval * );
801 rc = ber_get_stringbv( ber, bval, LBER_BV_ALLOC );
804 case 'O': /* octet string - allocate & include length */
805 bvp = va_arg( ap, struct berval ** );
806 rc = ber_get_stringal( ber, bvp );
809 case 's': /* octet string - in a buffer */
810 s = va_arg( ap, char * );
811 l = va_arg( ap, ber_len_t * );
812 rc = ber_get_stringb( ber, s, l );
815 case 't': /* tag of next item */
816 t = va_arg( ap, ber_tag_t * );
817 *t = rc = ber_peek_tag( ber, &len );
820 case 'T': /* skip tag of next item */
821 t = va_arg( ap, ber_tag_t * );
822 *t = rc = ber_skip_tag( ber, &len );
825 case 'v': /* sequence of strings */
828 ChArray, LBER_BV_ALLOC | LBER_BV_STRING, sizeof( char * )
830 rc = ber_get_stringbvl( ber, &cookie );
831 *(va_arg( ap, char *** )) = cookie.result;
835 case 'V': /* sequence of strings + lengths */
838 BvVec, LBER_BV_ALLOC, sizeof( struct berval * )
840 rc = ber_get_stringbvl( ber, &cookie );
841 *(va_arg( ap, struct berval *** )) = cookie.result;
845 case 'W': /* bvarray */
848 BvArray, LBER_BV_ALLOC, sizeof( struct berval )
850 rc = ber_get_stringbvl( ber, &cookie );
851 *(va_arg( ap, struct berval ** )) = cookie.result;
855 case 'x': /* skip the next element - whatever it is */
856 rc = ber_skip_element( ber, &data );
859 case '{': /* begin sequence */
860 case '[': /* begin set */
862 case 'v': case 'V': case 'W': case 'M':
865 rc = ber_skip_tag( ber, &len );
870 case '}': /* end sequence */
871 case ']': /* end set */
875 if( ber->ber_debug ) {
876 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
877 "ber_scanf: unknown fmt %c\n", *fmt );
886 if ( rc == LBER_DEFAULT ) {
888 * Error. Reclaim malloced memory that was given to the caller.
889 * Set allocated pointers to NULL, "data length" outvalues to 0.
893 for ( ; fmt_reset < fmt; fmt_reset++ ) {
894 switch ( *fmt_reset ) {
895 case '!': { /* Hook */
896 BERDecodeCallback *f;
899 f = va_arg( ap, BERDecodeCallback * );
900 p = va_arg( ap, void * );
902 (void) (*f)( ber, p, 1 );
905 case 'a': /* octet string - allocate storage as needed */
907 ss = va_arg( ap, char ** );
908 ber_memfree_x( *ss, ber->ber_memctx );
912 case 'b': /* boolean */
913 case 'e': /* enumerated */
914 case 'i': /* integer */
915 (void) va_arg( ap, ber_int_t * );
918 case 'l': /* length of next item */
919 *(va_arg( ap, ber_len_t * )) = 0;
922 case 'm': /* berval in-place */
923 bval = va_arg( ap, struct berval * );
927 case 'M': /* BVoff array in-place */
928 bvp = va_arg( ap, struct berval ** );
929 ber_memfree_x( *bvp, ber->ber_memctx );
931 *(va_arg( ap, ber_len_t * )) = 0;
932 (void) va_arg( ap, ber_len_t );
935 case 'o': /* octet string in a supplied berval */
936 bval = va_arg( ap, struct berval * );
937 ber_memfree_x( bval->bv_val, ber->ber_memctx );
941 case 'O': /* octet string - allocate & include length */
942 bvp = va_arg( ap, struct berval ** );
943 ber_bvfree_x( *bvp, ber->ber_memctx );
947 case 's': /* octet string - in a buffer */
948 (void) va_arg( ap, char * );
949 *(va_arg( ap, ber_len_t * )) = 0;
952 case 't': /* tag of next item */
953 case 'T': /* skip tag of next item */
954 (void) va_arg( ap, ber_tag_t * );
957 case 'B': /* bit string - allocate storage as needed */
958 ss = va_arg( ap, char ** );
959 ber_memfree_x( *ss, ber->ber_memctx );
961 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
964 case 'v': /* sequence of strings */
965 sss = va_arg( ap, char *** );
966 ber_memvfree_x( (void **) *sss, ber->ber_memctx );
970 case 'V': /* sequence of strings + lengths */
971 bvpp = va_arg( ap, struct berval *** );
972 ber_bvecfree_x( *bvpp, ber->ber_memctx );
976 case 'W': /* BerVarray */
977 bvp = va_arg( ap, struct berval ** );
978 ber_bvarray_free_x( *bvp, ber->ber_memctx );
983 case 'x': /* skip the next element - whatever it is */
984 case '{': /* begin sequence */
985 case '[': /* begin set */
986 case '}': /* end sequence */
987 case ']': /* end set */
991 /* format should be good */