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 element should have enough data left */
141 if( *len > ber_pvt_ber_remaining( ber ) ) {
154 * This implementation assumes ber_skip_tag() only
155 * modifies ber_ptr field of the BerElement.
162 tag = ber_skip_tag( ber, len );
174 unsigned char buf[sizeof(ber_int_t)];
176 assert( ber != NULL );
177 assert( num != NULL );
178 assert( LBER_VALID( ber ) );
181 * The tag and length have already been stripped off. We should
182 * be sitting right before len bytes of 2's complement integer,
183 * ready to be read straight into an int. We may have to sign
184 * extend after we read it in.
187 if ( len > sizeof(ber_int_t) ) {
191 /* read into the low-order bytes of our buffer */
192 if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) {
197 /* sign extend if necessary */
199 ber_int_t netnum = 0x80 & buf[0] ? -1 : 0;
201 /* shift in the bytes */
202 for( i=0 ; i<len; i++ ) {
203 netnum = (netnum << 8 ) | buf[i];
223 assert( ber != NULL );
224 assert( LBER_VALID( ber ) );
226 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
230 if ( ber_getnint( ber, num, len ) != len ) {
242 return ber_get_int( ber, num );
254 assert( ber != NULL );
255 assert( LBER_VALID( ber ) );
257 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
261 /* must fit within allocated space with termination */
262 if ( datalen >= *len ) {
266 if ( (ber_len_t) ber_read( ber, buf, datalen ) != datalen ) {
277 ber_get_stringa( BerElement *ber, char **buf )
282 assert( ber != NULL );
283 assert( buf != NULL );
285 assert( LBER_VALID( ber ) );
287 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
292 if ( (*buf = (char *) LBER_MALLOC( datalen + 1 )) == NULL ) {
296 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
301 (*buf)[datalen] = '\0';
307 ber_get_stringal( BerElement *ber, struct berval **bv )
312 assert( ber != NULL );
313 assert( bv != NULL );
315 assert( LBER_VALID( ber ) );
317 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
322 *bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) );
328 (*bv)->bv_val = NULL;
333 (*bv)->bv_val = (char *) LBER_MALLOC( len + 1 );
334 if ( (*bv)->bv_val == NULL ) {
340 if ( (ber_len_t) ber_read( ber, (*bv)->bv_val, len ) != len ) {
346 ((*bv)->bv_val)[len] = '\0';
360 unsigned char unusedbits;
362 assert( ber != NULL );
363 assert( buf != NULL );
364 assert( blen != NULL );
366 assert( LBER_VALID( ber ) );
368 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
374 if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) {
378 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
384 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
390 *blen = datalen * 8 - unusedbits;
395 ber_get_null( BerElement *ber )
400 assert( ber != NULL );
401 assert( LBER_VALID( ber ) );
403 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
422 assert( ber != NULL );
423 assert( boolval != NULL );
425 assert( LBER_VALID( ber ) );
427 rc = ber_get_int( ber, &longbool );
439 assert( ber != NULL );
440 assert( len != NULL );
441 assert( last != NULL );
443 /* skip the sequence header, use the len to mark where to stop */
444 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
449 *last = ber->ber_ptr + *len;
451 if ( *last == ber->ber_ptr ) {
455 return ber_peek_tag( ber, len );
462 LDAP_CONST char *last )
464 assert( ber != NULL );
465 assert( len != NULL );
466 assert( last != NULL );
468 assert( LBER_VALID( ber ) );
470 if ( ber->ber_ptr == last ) {
474 return ber_peek_tag( ber, len );
479 ber_scanf ( BerElement *ber,
480 LDAP_CONST char *fmt,
484 LDAP_CONST char *fmt_reset;
486 char *s, **ss, ***sss;
487 struct berval ***bv, **bvp, *bval;
497 assert( ber != NULL );
498 assert( fmt != NULL );
500 assert( LBER_VALID( ber ) );
505 LDAP_LOG(( "liblber", LDAP_LEVEL_ENTRY, "ber_scanf fmt (%s) ber:\n", fmt ));
506 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
508 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
509 "ber_scanf fmt (%s) ber:\n", fmt );
510 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
513 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
514 /* When this is modified, remember to update
515 * the error-cleanup code below accordingly. */
517 case '!': { /* Hook */
518 BERDecodeCallback *f;
521 f = va_arg( ap, BERDecodeCallback * );
522 p = va_arg( ap, void * );
524 rc = (*f)( ber, p, 0 );
527 case 'a': /* octet string - allocate storage as needed */
528 ss = va_arg( ap, char ** );
529 rc = ber_get_stringa( ber, ss );
532 case 'b': /* boolean */
533 i = va_arg( ap, ber_int_t * );
534 rc = ber_get_boolean( ber, i );
537 case 'e': /* enumerated */
539 i = va_arg( ap, ber_int_t * );
540 rc = ber_get_int( ber, i );
543 case 'l': /* length of next item */
544 l = va_arg( ap, ber_len_t * );
545 rc = ber_peek_tag( ber, l );
549 rc = ber_get_null( ber );
552 case 's': /* octet string - in a buffer */
553 s = va_arg( ap, char * );
554 l = va_arg( ap, ber_len_t * );
555 rc = ber_get_stringb( ber, s, l );
558 case 'o': /* octet string in a supplied berval */
559 bval = va_arg( ap, struct berval * );
560 ber_peek_tag( ber, &bval->bv_len );
561 rc = ber_get_stringa( ber, &bval->bv_val );
564 case 'O': /* octet string - allocate & include length */
565 bvp = va_arg( ap, struct berval ** );
566 rc = ber_get_stringal( ber, bvp );
569 case 'B': /* bit string - allocate storage as needed */
570 ss = va_arg( ap, char ** );
571 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
572 rc = ber_get_bitstringa( ber, ss, l );
575 case 't': /* tag of next item */
576 t = va_arg( ap, ber_tag_t * );
577 *t = rc = ber_peek_tag( ber, &len );
580 case 'T': /* skip tag of next item */
581 t = va_arg( ap, ber_tag_t * );
582 *t = rc = ber_skip_tag( ber, &len );
585 case 'v': /* sequence of strings */
586 sss = va_arg( ap, char *** );
589 for ( tag = ber_first_element( ber, &len, &last );
590 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
591 tag = ber_next_element( ber, &len, last ) )
595 *sss = (char **) LBER_REALLOC( *sss,
596 (j + 2) * sizeof(char *) );
599 LBER_MEMFREE( save );
604 rc = ber_get_stringa( ber, &((*sss)[j]) );
611 case 'V': /* sequence of strings + lengths */
612 bv = va_arg( ap, struct berval *** );
615 for ( tag = ber_first_element( ber, &len, &last );
616 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
617 tag = ber_next_element( ber, &len, last ) )
621 *bv = (struct berval **) LBER_REALLOC( *bv,
622 (j + 2) * sizeof(struct berval *) );
625 LBER_MEMFREE( save );
630 rc = ber_get_stringal( ber, &((*bv)[j]) );
637 case 'x': /* skip the next element - whatever it is */
638 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
643 case '{': /* begin sequence */
644 case '[': /* begin set */
645 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
646 rc = ber_skip_tag( ber, &len );
649 case '}': /* end sequence */
650 case ']': /* end set */
654 if( ber->ber_debug ) {
656 LDAP_LOG(( "liblber", LDAP_LEVEL_ERR,
657 "ber_scanf: unknown fmt %c\n", *fmt ));
659 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
660 "ber_scanf: unknown fmt %c\n", *fmt );
671 if ( rc == LBER_DEFAULT ) {
673 * Error. Reclaim malloced memory that was given to the caller.
674 * Set allocated pointers to NULL, "data length" outvalues to 0.
678 for ( ; fmt_reset < fmt; fmt_reset++ ) {
679 switch ( *fmt_reset ) {
680 case '!': { /* Hook */
681 BERDecodeCallback *f;
684 f = va_arg( ap, BERDecodeCallback * );
685 p = va_arg( ap, void * );
687 (void) (*f)( ber, p, 1 );
690 case 'a': /* octet string - allocate storage as needed */
691 ss = va_arg( ap, char ** );
698 case 'b': /* boolean */
699 case 'e': /* enumerated */
701 (void) va_arg( ap, int * );
704 case 's': /* octet string - in a buffer */
705 (void) va_arg( ap, char * );
706 (void) va_arg( ap, ber_len_t * );
709 case 'l': /* length of next item */
710 (void) va_arg( ap, ber_len_t * );
713 case 't': /* tag of next item */
714 case 'T': /* skip tag of next item */
715 (void) va_arg( ap, ber_tag_t * );
718 case 'o': /* octet string in a supplied berval */
719 bval = va_arg( ap, struct berval * );
720 if ( bval->bv_val != NULL ) {
721 LBER_FREE( bval->bv_val );
727 case 'O': /* octet string - allocate & include length */
728 bvp = va_arg( ap, struct berval ** );
735 case 'B': /* bit string - allocate storage as needed */
736 ss = va_arg( ap, char ** );
741 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
744 case 'v': /* sequence of strings */
745 sss = va_arg( ap, char *** );
747 for (j = 0; (*sss)[j]; j++) {
748 LBER_FREE( (*sss)[j] );
756 case 'V': /* sequence of strings + lengths */
757 bv = va_arg( ap, struct berval *** );
765 case 'x': /* skip the next element - whatever it is */
766 case '{': /* begin sequence */
767 case '[': /* begin set */
768 case '}': /* end sequence */
769 case ']': /* end set */
773 /* format should be good */