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( BER_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( BER_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( BER_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( BER_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( BER_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( BER_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( BER_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( BER_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( BER_VALID( ber ) );
403 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
422 assert( ber != NULL );
423 assert( boolval != NULL );
425 assert( BER_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( BER_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( BER_VALID( ber ) );
504 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
505 "ber_scanf fmt (%s) ber:\n", fmt );
506 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
508 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
509 /* When this is modified, remember to update
510 * the error-cleanup code below accordingly. */
512 case '!': { /* Hook */
513 BERDecodeCallback *f;
516 f = va_arg( ap, BERDecodeCallback * );
517 p = va_arg( ap, void * );
519 rc = (*f)( ber, p, 0 );
522 case 'a': /* octet string - allocate storage as needed */
523 ss = va_arg( ap, char ** );
524 rc = ber_get_stringa( ber, ss );
527 case 'b': /* boolean */
528 i = va_arg( ap, ber_int_t * );
529 rc = ber_get_boolean( ber, i );
532 case 'e': /* enumerated */
534 i = va_arg( ap, ber_int_t * );
535 rc = ber_get_int( ber, i );
538 case 'l': /* length of next item */
539 l = va_arg( ap, ber_len_t * );
540 rc = ber_peek_tag( ber, l );
544 rc = ber_get_null( ber );
547 case 's': /* octet string - in a buffer */
548 s = va_arg( ap, char * );
549 l = va_arg( ap, ber_len_t * );
550 rc = ber_get_stringb( ber, s, l );
553 case 'o': /* octet string in a supplied berval */
554 bval = va_arg( ap, struct berval * );
555 ber_peek_tag( ber, &bval->bv_len );
556 rc = ber_get_stringa( ber, &bval->bv_val );
559 case 'O': /* octet string - allocate & include length */
560 bvp = va_arg( ap, struct berval ** );
561 rc = ber_get_stringal( ber, bvp );
564 case 'B': /* bit string - allocate storage as needed */
565 ss = va_arg( ap, char ** );
566 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
567 rc = ber_get_bitstringa( ber, ss, l );
570 case 't': /* tag of next item */
571 t = va_arg( ap, ber_tag_t * );
572 *t = rc = ber_peek_tag( ber, &len );
575 case 'T': /* skip tag of next item */
576 t = va_arg( ap, ber_tag_t * );
577 *t = rc = ber_skip_tag( ber, &len );
580 case 'v': /* sequence of strings */
581 sss = va_arg( ap, char *** );
584 for ( tag = ber_first_element( ber, &len, &last );
585 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
586 tag = ber_next_element( ber, &len, last ) )
588 *sss = (char **) LBER_REALLOC( *sss,
589 (j + 2) * sizeof(char *) );
591 rc = ber_get_stringa( ber, &((*sss)[j]) );
598 case 'V': /* sequence of strings + lengths */
599 bv = va_arg( ap, struct berval *** );
602 for ( tag = ber_first_element( ber, &len, &last );
603 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
604 tag = ber_next_element( ber, &len, last ) )
606 *bv = (struct berval **) LBER_REALLOC( *bv,
607 (j + 2) * sizeof(struct berval *) );
609 rc = ber_get_stringal( ber, &((*bv)[j]) );
616 case 'x': /* skip the next element - whatever it is */
617 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
622 case '{': /* begin sequence */
623 case '[': /* begin set */
624 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
625 rc = ber_skip_tag( ber, &len );
628 case '}': /* end sequence */
629 case ']': /* end set */
633 if( ber->ber_debug ) {
634 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
635 "ber_scanf: unknown fmt %c\n", *fmt );
644 if ( rc == LBER_DEFAULT ) {
646 * Error. Reclaim malloced memory that was given to the caller.
647 * Set allocated pointers to NULL, "data length" outvalues to 0.
651 for ( ; fmt_reset < fmt; fmt_reset++ ) {
652 switch ( *fmt_reset ) {
653 case '!': { /* Hook */
654 BERDecodeCallback *f;
657 f = va_arg( ap, BERDecodeCallback * );
658 p = va_arg( ap, void * );
660 (void) (*f)( ber, p, 1 );
663 case 'a': /* octet string - allocate storage as needed */
664 ss = va_arg( ap, char ** );
671 case 'b': /* boolean */
672 case 'e': /* enumerated */
674 (void) va_arg( ap, int * );
677 case 's': /* octet string - in a buffer */
678 (void) va_arg( ap, char * );
679 (void) va_arg( ap, ber_len_t * );
682 case 'l': /* length of next item */
683 (void) va_arg( ap, ber_len_t * );
686 case 't': /* tag of next item */
687 case 'T': /* skip tag of next item */
688 (void) va_arg( ap, ber_tag_t * );
691 case 'o': /* octet string in a supplied berval */
692 bval = va_arg( ap, struct berval * );
693 if ( bval->bv_val != NULL ) {
694 LBER_FREE( bval->bv_val );
700 case 'O': /* octet string - allocate & include length */
701 bvp = va_arg( ap, struct berval ** );
708 case 'B': /* bit string - allocate storage as needed */
709 ss = va_arg( ap, char ** );
714 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
717 case 'v': /* sequence of strings */
718 sss = va_arg( ap, char *** );
720 for (j = 0; (*sss)[j]; j++) {
721 LBER_FREE( (*sss)[j] );
729 case 'V': /* sequence of strings + lengths */
730 bv = va_arg( ap, struct berval *** );
738 case 'x': /* skip the next element - whatever it is */
739 case '{': /* begin sequence */
740 case '[': /* begin set */
741 case '}': /* end sequence */
742 case ']': /* end set */
746 /* format should be good */