1 /* io.c - ber general i/o routines */
4 * Copyright 1998-2003 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>
27 #include <ac/socket.h>
28 #include <ac/string.h>
29 #include <ac/unistd.h>
44 ber_len_t actuallen, nleft;
46 assert( ber != NULL );
47 assert( buf != NULL );
49 assert( LBER_VALID( ber ) );
51 nleft = ber_pvt_ber_remaining( ber );
52 actuallen = nleft < len ? nleft : len;
54 AC_MEMCPY( buf, ber->ber_ptr, actuallen );
56 ber->ber_ptr += actuallen;
58 return( (ber_slen_t) actuallen );
68 assert( ber != NULL );
69 assert( buf != NULL );
71 assert( LBER_VALID( ber ) );
73 if ( nosos || ber->ber_sos == NULL ) {
74 if ( ber->ber_ptr + len > ber->ber_end ) {
75 if ( ber_realloc( ber, len ) != 0 ) return( -1 );
77 AC_MEMCPY( ber->ber_ptr, buf, (size_t)len );
79 return( (ber_slen_t) len );
82 if ( ber->ber_sos->sos_ptr + len > ber->ber_end ) {
83 if ( ber_realloc( ber, len ) != 0 ) return( -1 );
85 AC_MEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
86 ber->ber_sos->sos_ptr += len;
87 ber->ber_sos->sos_clen += len;
88 return( (ber_slen_t) len );
93 ber_realloc( BerElement *ber, ber_len_t len )
100 assert( ber != NULL );
102 assert( LBER_VALID( ber ) );
104 total = ber_pvt_ber_total( ber );
106 #define LBER_EXBUFSIZ 4060 /* a few words less than 2^N for binary buddy */
107 #if defined( LBER_EXBUFSIZ ) && LBER_EXBUFSIZ > 0
109 /* don't realloc by small amounts */
110 total += len < LBER_EXBUFSIZ ? LBER_EXBUFSIZ : len;
112 { /* not sure what value this adds */
113 ber_len_t have = (total + (LBER_EXBUFSIZE - 1)) / LBER_EXBUFSIZ;
114 ber_len_t need = (len + (LBER_EXBUFSIZ - 1)) / LBER_EXBUFSIZ;
115 total = ( have + need ) * LBER_EXBUFSIZ;
119 total += len; /* realloc just what's needed */
122 oldbuf = ber->ber_buf;
124 ber->ber_buf = (char *) ber_memrealloc_x( oldbuf, total, ber->ber_memctx );
126 if ( ber->ber_buf == NULL ) {
127 ber->ber_buf = oldbuf;
131 ber->ber_end = ber->ber_buf + total;
134 * If the stinking thing was moved, we need to go through and
135 * reset all the sos and ber pointers. Offsets would've been
136 * a better idea... oh well.
139 if ( ber->ber_buf != oldbuf ) {
140 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
142 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
143 off = s->sos_first - oldbuf;
144 s->sos_first = ber->ber_buf + off;
146 off = s->sos_ptr - oldbuf;
147 s->sos_ptr = ber->ber_buf + off;
155 ber_free_buf( BerElement *ber )
159 assert( LBER_VALID( ber ) );
161 if ( ber->ber_buf) ber_memfree_x( ber->ber_buf, ber->ber_memctx );
163 for( s = ber->ber_sos ; s != NULL ; s = next ) {
165 ber_memfree_x( s, ber->ber_memctx );
170 ber->ber_valid = LBER_UNINITIALIZED;
174 ber_free( BerElement *ber, int freebuf )
176 #ifdef LDAP_MEMORY_DEBUG
177 assert( ber != NULL );
184 if( freebuf ) ber_free_buf( ber );
186 ber_memfree_x( (char *) ber, ber->ber_memctx );
190 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
195 assert( sb != NULL );
196 assert( ber != NULL );
198 assert( SOCKBUF_VALID( sb ) );
199 assert( LBER_VALID( ber ) );
201 if ( ber->ber_rwptr == NULL ) {
202 ber->ber_rwptr = ber->ber_buf;
204 towrite = ber->ber_ptr - ber->ber_rwptr;
206 if ( sb->sb_debug ) {
208 LDAP_LOG( BER, DETAIL1,
209 "ber_flush: %ld bytes to sd %ld%s\n",
210 towrite, (long)sb->sb_fd,
211 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
213 if(LDAP_LOGS_TEST(BER, DETAIL2))
214 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
217 ber_log_printf( LDAP_DEBUG_TRACE, sb->sb_debug,
218 "ber_flush: %ld bytes to sd %ld%s\n",
219 towrite, (long) sb->sb_fd,
220 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
221 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
222 ber->ber_rwptr, towrite );
226 while ( towrite > 0 ) {
229 rc = ber_int_sb_write( sb, ber->ber_rwptr, 1 );
231 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
237 ber->ber_rwptr += rc;
240 if ( freeit ) ber_free( ber, 1 );
246 ber_alloc_t( int options )
250 ber_int_options.lbo_valid = LBER_INITIALIZED;
252 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
258 ber->ber_valid = LBER_VALID_BERELEMENT;
259 ber->ber_tag = LBER_DEFAULT;
260 ber->ber_options = options;
261 ber->ber_debug = ber_int_debug;
263 assert( LBER_VALID( ber ) );
268 ber_alloc( void ) /* deprecated */
270 return ber_alloc_t( 0 );
274 der_alloc( void ) /* deprecated */
276 return ber_alloc_t( LBER_USE_DER );
280 ber_dup( BerElement *ber )
284 assert( ber != NULL );
285 assert( LBER_VALID( ber ) );
287 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
293 assert( LBER_VALID( new ) );
299 ber_init2( BerElement *ber, struct berval *bv, int options )
301 assert( ber != NULL );
303 ber_int_options.lbo_valid = LBER_INITIALIZED;
305 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
306 ber->ber_valid = LBER_VALID_BERELEMENT;
307 ber->ber_tag = LBER_DEFAULT;
308 ber->ber_options = (char) options;
309 ber->ber_debug = ber_int_debug;
312 ber->ber_buf = bv->bv_val;
313 ber->ber_ptr = ber->ber_buf;
314 ber->ber_end = ber->ber_buf + bv->bv_len;
317 assert( LBER_VALID( ber ) );
320 /* OLD U-Mich ber_init() */
322 ber_init_w_nullc( BerElement *ber, int options )
324 ber_init2( ber, NULL, options );
327 /* New C-API ber_init() */
328 /* This function constructs a BerElement containing a copy
329 ** of the data in the bv argument.
332 ber_init( struct berval *bv )
336 assert( bv != NULL );
338 ber_int_options.lbo_valid = LBER_INITIALIZED;
344 ber = ber_alloc_t( 0 );
347 /* allocation failed */
352 if ( ((ber_len_t) ber_write ( ber, bv->bv_val, bv->bv_len, 0 ))
355 /* write failed, so free and return NULL */
360 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
364 /* New C-API ber_flatten routine */
365 /* This routine allocates a struct berval whose contents are a BER
366 ** encoding taken from the ber argument. The bvPtr pointer points to
367 ** the returned berval.
369 ** ber_flatten2 is the same, but uses a struct berval passed by
370 ** the caller. If alloc is 0 the returned bv uses the ber buf directly.
377 assert( bv != NULL );
379 ber_int_options.lbo_valid = LBER_INITIALIZED;
386 /* ber is null, create an empty berval */
391 /* copy the berval */
392 ber_len_t len = ber_pvt_ber_write( ber );
395 bv->bv_val = (char *) ber_memalloc_x( len + 1, ber->ber_memctx );
396 if ( bv->bv_val == NULL ) {
399 AC_MEMCPY( bv->bv_val, ber->ber_buf, len );
401 bv->bv_val = ber->ber_buf;
403 bv->bv_val[len] = '\0';
411 struct berval **bvPtr)
416 assert( bvPtr != NULL );
418 ber_int_options.lbo_valid = LBER_INITIALIZED;
424 bv = ber_memalloc_x( sizeof(struct berval), ber->ber_memctx );
428 rc = ber_flatten2(ber, bv, 1);
430 ber_memfree_x(bv, ber->ber_memctx);
438 ber_reset( BerElement *ber, int was_writing )
440 assert( ber != NULL );
441 assert( LBER_VALID( ber ) );
444 ber->ber_end = ber->ber_ptr;
445 ber->ber_ptr = ber->ber_buf;
448 ber->ber_ptr = ber->ber_end;
451 ber->ber_rwptr = NULL;
455 * A rewrite of ber_get_next that can safely be called multiple times
456 * for the same packet. It will simply continue where it stopped until
457 * a full packet is read.
468 assert( sb != NULL );
469 assert( len != NULL );
470 assert( ber != NULL );
472 assert( SOCKBUF_VALID( sb ) );
473 assert( LBER_VALID( ber ) );
476 LDAP_LOG( BER, ENTRY, "ber_get_next: enter\n", 0, 0, 0 );
478 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
483 * Any ber element looks like this: tag length contents.
484 * Assuming everything's ok, we return the tag byte (we
485 * can assume a single byte), return the length in len,
486 * and the rest of the undecoded element in buf.
489 * 1) small tags (less than 128)
490 * 2) definite lengths
491 * 3) primitive encodings used whenever possible
493 * The code also handles multi-byte tags. The first few bytes
494 * of the message are read to check for multi-byte tags and
495 * lengths. These bytes are temporarily stored in the ber_tag,
496 * ber_len, and ber_usertag fields of the berelement until
497 * tag/len parsing is complete. After this parsing, any leftover
498 * bytes and the rest of the message are copied into the ber_buf.
500 * We expect tag and len to be at most 32 bits wide.
503 if (ber->ber_rwptr == NULL) {
504 assert( ber->ber_buf == NULL );
505 ber->ber_rwptr = (char *) &ber->ber_len-1;
506 ber->ber_ptr = ber->ber_rwptr;
510 while (ber->ber_rwptr > (char *)&ber->ber_tag && ber->ber_rwptr <
511 (char *)&ber->ber_len + LENSIZE*2 -1) {
513 char buf[sizeof(ber->ber_len)-1];
517 sblen=ber_int_sb_read( sb, ber->ber_rwptr,
518 ((char *)&ber->ber_len + LENSIZE*2 - 1)-ber->ber_rwptr);
519 if (sblen<=0) return LBER_DEFAULT;
520 ber->ber_rwptr += sblen;
522 /* We got at least one byte, try to parse the tag. */
523 if (ber->ber_ptr == (char *)&ber->ber_len-1) {
525 unsigned char *p = (unsigned char *)ber->ber_ptr;
527 if ((tag & LBER_BIG_TAG_MASK) == LBER_BIG_TAG_MASK) {
529 for (i=1; (char *)p<ber->ber_rwptr; i++) {
532 if (!(tag & LBER_MORE_TAG_MASK))
534 /* Is the tag too big? */
535 if (i == sizeof(ber_tag_t)-1) {
540 /* Did we run out of bytes? */
541 if ((char *)p == ber->ber_rwptr) {
542 #if defined( EWOULDBLOCK )
544 #elif defined( EAGAIN )
551 ber->ber_ptr = (char *)p;
554 if ( ber->ber_ptr == ber->ber_rwptr ) {
555 #if defined( EWOULDBLOCK )
557 #elif defined( EAGAIN )
563 /* Now look for the length */
564 if (*ber->ber_ptr & 0x80) { /* multi-byte */
566 unsigned char *p = (unsigned char *)ber->ber_ptr;
567 int llen = *p++ & 0x7f;
568 if (llen > (int)sizeof(ber_len_t)) {
572 /* Not enough bytes? */
573 if (ber->ber_rwptr - (char *)p < llen) {
574 #if defined( EWOULDBLOCK )
576 #elif defined( EAGAIN )
581 for (i=0; i<llen; i++) {
585 ber->ber_ptr = (char *)p;
587 tlen = *(unsigned char *)ber->ber_ptr++;
590 /* Are there leftover data bytes inside ber->ber_len? */
591 if (ber->ber_ptr < (char *)&ber->ber_usertag) {
592 if (ber->ber_rwptr < (char *)&ber->ber_usertag) {
593 sblen = ber->ber_rwptr - ber->ber_ptr;
595 sblen = (char *)&ber->ber_usertag - ber->ber_ptr;
597 AC_MEMCPY(buf, ber->ber_ptr, sblen);
598 ber->ber_ptr += sblen;
604 /* now fill the buffer. */
606 /* make sure length is reasonable */
607 if ( ber->ber_len == 0 ) {
612 if ( sb->sb_max_incoming && ber->ber_len > sb->sb_max_incoming ) {
615 "ber_get_next: sockbuf_max_incoming exceeded "
616 "(%d > %d)\n", ber->ber_len, sb->sb_max_incoming, 0 );
618 ber_log_printf( LDAP_DEBUG_CONNS, ber->ber_debug,
619 "ber_get_next: sockbuf_max_incoming exceeded "
620 "(%ld > %ld)\n", ber->ber_len, sb->sb_max_incoming );
626 if (ber->ber_buf==NULL) {
627 ber_len_t l = ber->ber_rwptr - ber->ber_ptr;
628 /* ber->ber_ptr is always <= ber->ber->ber_rwptr.
629 * make sure ber->ber_len agrees with what we've
632 if ( ber->ber_len < sblen + l ) {
636 ber->ber_buf = (char *) ber_memalloc_x( ber->ber_len + 1, ber->ber_memctx );
637 if (ber->ber_buf==NULL) {
640 ber->ber_end = ber->ber_buf + ber->ber_len;
642 AC_MEMCPY(ber->ber_buf, buf, sblen);
645 AC_MEMCPY(ber->ber_buf + sblen, ber->ber_ptr, l);
648 ber->ber_ptr = ber->ber_buf;
649 ber->ber_usertag = 0;
650 if ((ber_len_t)sblen == ber->ber_len) {
653 ber->ber_rwptr = ber->ber_buf + sblen;
657 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
661 to_go = ber->ber_end - ber->ber_rwptr;
665 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
666 if (res<=0) return LBER_DEFAULT;
670 #if defined( EWOULDBLOCK )
672 #elif defined( EAGAIN )
678 ber->ber_rwptr = NULL;
680 if ( ber->ber_debug ) {
682 LDAP_LOG( BER, DETAIL1,
683 "ber_get_next: tag 0x%lx len %ld\n",
684 ber->ber_tag, ber->ber_len, 0 );
685 if(LDAP_LOGS_TEST(BER, DETAIL2))
686 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
688 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
689 "ber_get_next: tag 0x%lx len %ld contents:\n",
690 ber->ber_tag, ber->ber_len );
691 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
694 return (ber->ber_tag);
697 assert( 0 ); /* ber structure is messed up ?*/
702 ber_start( BerElement* ber )
708 ber_len( BerElement* ber )
710 return ( ber->ber_end - ber->ber_buf );
714 ber_ptrlen( BerElement* ber )
716 return ( ber->ber_ptr - ber->ber_buf );
720 ber_rewind ( BerElement * ber )
722 ber->ber_rwptr = NULL;
724 ber->ber_end = ber->ber_ptr;
725 ber->ber_ptr = ber->ber_buf;
729 ber_remaining( BerElement * ber )
731 return ber_pvt_ber_remaining( ber );