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++ ) {
149 * This implementation assumes ber_skip_tag() only
150 * modifies ber_ptr field of the BerElement.
157 tag = ber_skip_tag( ber, len );
169 unsigned char buf[sizeof(ber_int_t)];
171 assert( ber != NULL );
172 assert( num != NULL );
173 assert( BER_VALID( ber ) );
176 * The tag and length have already been stripped off. We should
177 * be sitting right before len bytes of 2's complement integer,
178 * ready to be read straight into an int. We may have to sign
179 * extend after we read it in.
182 if ( len > sizeof(ber_int_t) ) {
186 /* read into the low-order bytes of our buffer */
187 if ( (ber_len_t) ber_read( ber, (char *) buf, len ) != len ) {
192 /* sign extend if necessary */
194 ber_int_t netnum = 0x80 & buf[0] ? -1 : 0;
196 /* shift in the bytes */
197 for( i=0 ; i<len; i++ ) {
198 netnum = (netnum << 8 ) | buf[i];
218 assert( ber != NULL );
219 assert( BER_VALID( ber ) );
221 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
225 if ( ber_getnint( ber, num, len ) != len ) {
237 return ber_get_int( ber, num );
249 assert( ber != NULL );
250 assert( BER_VALID( ber ) );
252 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
255 if ( datalen > (*len - 1) ) {
259 if ( (ber_len_t) ber_read( ber, buf, datalen ) != datalen ) {
270 ber_get_stringa( BerElement *ber, char **buf )
275 assert( ber != NULL );
276 assert( buf != NULL );
278 assert( BER_VALID( ber ) );
280 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
285 if ( (*buf = (char *) LBER_MALLOC( datalen + 1 )) == NULL ) {
289 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
294 (*buf)[datalen] = '\0';
300 ber_get_stringal( BerElement *ber, struct berval **bv )
305 assert( ber != NULL );
306 assert( bv != NULL );
308 assert( BER_VALID( ber ) );
310 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
315 *bv = (struct berval *) LBER_MALLOC( sizeof(struct berval) );
321 (*bv)->bv_val = NULL;
326 (*bv)->bv_val = (char *) LBER_MALLOC( len + 1 );
327 if ( (*bv)->bv_val == NULL ) {
333 if ( (ber_len_t) ber_read( ber, (*bv)->bv_val, len ) != len ) {
339 ((*bv)->bv_val)[len] = '\0';
353 unsigned char unusedbits;
355 assert( ber != NULL );
356 assert( buf != NULL );
357 assert( blen != NULL );
359 assert( BER_VALID( ber ) );
361 if ( (tag = ber_skip_tag( ber, &datalen )) == LBER_DEFAULT ) {
367 if ( (*buf = (char *) LBER_MALLOC( datalen )) == NULL ) {
371 if ( ber_read( ber, (char *)&unusedbits, 1 ) != 1 ) {
377 if ( (ber_len_t) ber_read( ber, *buf, datalen ) != datalen ) {
383 *blen = datalen * 8 - unusedbits;
388 ber_get_null( BerElement *ber )
393 assert( ber != NULL );
394 assert( BER_VALID( ber ) );
396 if ( (tag = ber_skip_tag( ber, &len )) == LBER_DEFAULT ) {
415 assert( ber != NULL );
416 assert( boolval != NULL );
418 assert( BER_VALID( ber ) );
420 rc = ber_get_int( ber, &longbool );
432 assert( ber != NULL );
433 assert( len != NULL );
434 assert( last != NULL );
436 /* skip the sequence header, use the len to mark where to stop */
437 if ( ber_skip_tag( ber, len ) == LBER_DEFAULT ) {
442 *last = ber->ber_ptr + *len;
444 if ( *last == ber->ber_ptr ) {
448 return ber_peek_tag( ber, len );
455 LDAP_CONST char *last )
457 assert( ber != NULL );
458 assert( len != NULL );
459 assert( last != NULL );
461 assert( BER_VALID( ber ) );
463 if ( ber->ber_ptr == last ) {
467 return ber_peek_tag( ber, len );
472 ber_scanf ( BerElement *ber,
473 LDAP_CONST char *fmt,
477 LDAP_CONST char *fmt_reset;
479 char *s, **ss, ***sss;
480 struct berval ***bv, **bvp, *bval;
490 assert( ber != NULL );
491 assert( fmt != NULL );
493 assert( BER_VALID( ber ) );
497 LDAP_LOG( "LIBLBER", LDAP_LEVEL_ENTRY, "ber_scanf fmt (%s) ber:\n", fmt );
499 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
500 "ber_scanf fmt (%s) ber:\n", fmt );
501 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
503 for ( rc = 0; *fmt && rc != LBER_DEFAULT; fmt++ ) {
504 /* When this is modified, remember to update
505 * the error-cleanup code below accordingly. */
507 case '!': { /* Hook */
508 BERDecodeCallback *f;
511 f = va_arg( ap, BERDecodeCallback * );
512 p = va_arg( ap, void * );
514 rc = (*f)( ber, p, 0 );
517 case 'a': /* octet string - allocate storage as needed */
518 ss = va_arg( ap, char ** );
519 rc = ber_get_stringa( ber, ss );
522 case 'b': /* boolean */
523 i = va_arg( ap, ber_int_t * );
524 rc = ber_get_boolean( ber, i );
527 case 'e': /* enumerated */
529 i = va_arg( ap, ber_int_t * );
530 rc = ber_get_int( ber, i );
533 case 'l': /* length of next item */
534 l = va_arg( ap, ber_len_t * );
535 rc = ber_peek_tag( ber, l );
539 rc = ber_get_null( ber );
542 case 's': /* octet string - in a buffer */
543 s = va_arg( ap, char * );
544 l = va_arg( ap, ber_len_t * );
545 rc = ber_get_stringb( ber, s, l );
548 case 'o': /* octet string in a supplied berval */
549 bval = va_arg( ap, struct berval * );
550 ber_peek_tag( ber, &bval->bv_len );
551 rc = ber_get_stringa( ber, &bval->bv_val );
554 case 'O': /* octet string - allocate & include length */
555 bvp = va_arg( ap, struct berval ** );
556 rc = ber_get_stringal( ber, bvp );
559 case 'B': /* bit string - allocate storage as needed */
560 ss = va_arg( ap, char ** );
561 l = va_arg( ap, ber_len_t * ); /* for length, in bits */
562 rc = ber_get_bitstringa( ber, ss, l );
565 case 't': /* tag of next item */
566 t = va_arg( ap, ber_tag_t * );
567 *t = rc = ber_peek_tag( ber, &len );
570 case 'T': /* skip tag of next item */
571 t = va_arg( ap, ber_tag_t * );
572 *t = rc = ber_skip_tag( ber, &len );
575 case 'v': /* sequence of strings */
576 sss = va_arg( ap, char *** );
579 for ( tag = ber_first_element( ber, &len, &last );
580 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
581 tag = ber_next_element( ber, &len, last ) )
583 *sss = (char **) LBER_REALLOC( *sss,
584 (j + 2) * sizeof(char *) );
586 rc = ber_get_stringa( ber, &((*sss)[j]) );
593 case 'V': /* sequence of strings + lengths */
594 bv = va_arg( ap, struct berval *** );
597 for ( tag = ber_first_element( ber, &len, &last );
598 tag != LBER_DEFAULT && rc != LBER_DEFAULT;
599 tag = ber_next_element( ber, &len, last ) )
601 *bv = (struct berval **) LBER_REALLOC( *bv,
602 (j + 2) * sizeof(struct berval *) );
604 rc = ber_get_stringal( ber, &((*bv)[j]) );
611 case 'x': /* skip the next element - whatever it is */
612 if ( (rc = ber_skip_tag( ber, &len )) == LBER_DEFAULT )
617 case '{': /* begin sequence */
618 case '[': /* begin set */
619 if ( *(fmt + 1) != 'v' && *(fmt + 1) != 'V' )
620 rc = ber_skip_tag( ber, &len );
623 case '}': /* end sequence */
624 case ']': /* end set */
628 if( ber->ber_debug ) {
629 ber_log_printf( LDAP_DEBUG_ANY, ber->ber_debug,
630 "ber_scanf: unknown fmt %c\n", *fmt );
639 if ( rc == LBER_DEFAULT ) {
641 * Error. Reclaim malloced memory that was given to the caller.
642 * Set allocated pointers to NULL, "data length" outvalues to 0.
646 for ( ; fmt_reset < fmt; fmt_reset++ ) {
647 switch ( *fmt_reset ) {
648 case '!': { /* Hook */
649 BERDecodeCallback *f;
652 f = va_arg( ap, BERDecodeCallback * );
653 p = va_arg( ap, void * );
655 (void) (*f)( ber, p, 1 );
658 case 'a': /* octet string - allocate storage as needed */
659 ss = va_arg( ap, char ** );
666 case 'b': /* boolean */
667 case 'e': /* enumerated */
669 (void) va_arg( ap, int * );
672 case 's': /* octet string - in a buffer */
673 (void) va_arg( ap, char * );
674 (void) va_arg( ap, ber_len_t * );
677 case 'l': /* length of next item */
678 (void) va_arg( ap, ber_len_t * );
681 case 't': /* tag of next item */
682 case 'T': /* skip tag of next item */
683 (void) va_arg( ap, ber_tag_t * );
686 case 'o': /* octet string in a supplied berval */
687 bval = va_arg( ap, struct berval * );
688 if ( bval->bv_val != NULL ) {
689 LBER_FREE( bval->bv_val );
695 case 'O': /* octet string - allocate & include length */
696 bvp = va_arg( ap, struct berval ** );
703 case 'B': /* bit string - allocate storage as needed */
704 ss = va_arg( ap, char ** );
709 *(va_arg( ap, ber_len_t * )) = 0; /* for length, in bits */
712 case 'v': /* sequence of strings */
713 sss = va_arg( ap, char *** );
715 for (j = 0; (*sss)[j]; j++) {
716 LBER_FREE( (*sss)[j] );
724 case 'V': /* sequence of strings + lengths */
725 bv = va_arg( ap, struct berval *** );
733 case 'x': /* skip the next element - whatever it is */
734 case '{': /* begin sequence */
735 case '[': /* begin set */
736 case '}': /* end sequence */
737 case ']': /* end set */
741 /* format should be good */