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 )
78 AC_MEMCPY( ber->ber_ptr, buf, (size_t)len );
80 return( (ber_slen_t) len );
83 if ( ber->ber_sos->sos_ptr + len > ber->ber_end ) {
84 if ( ber_realloc( ber, len ) != 0 )
87 AC_MEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
88 ber->ber_sos->sos_ptr += len;
89 ber->ber_sos->sos_clen += len;
90 return( (ber_slen_t) len );
95 ber_realloc( BerElement *ber, ber_len_t len )
102 assert( ber != NULL );
104 assert( LBER_VALID( ber ) );
106 total = ber_pvt_ber_total( ber );
108 #define LBER_EXBUFSIZ 4060 /* a few words less than 2^N for binary buddy */
109 #if defined( LBER_EXBUFSIZ ) && LBER_EXBUFSIZ > 0
111 /* don't realloc by small amounts */
112 total += len < LBER_EXBUFSIZ ? LBER_EXBUFSIZ : len;
114 { /* not sure what value this adds */
115 ber_len_t have = (total + (LBER_EXBUFSIZE - 1)) / LBER_EXBUFSIZ;
116 ber_len_t need = (len + (LBER_EXBUFSIZ - 1)) / LBER_EXBUFSIZ;
117 total = ( have + need ) * LBER_EXBUFSIZ;
121 total += len; /* realloc just what's needed */
124 oldbuf = ber->ber_buf;
126 ber->ber_buf = (char *) LBER_REALLOC( oldbuf, total );
128 if ( ber->ber_buf == NULL ) {
129 ber->ber_buf = oldbuf;
133 ber->ber_end = ber->ber_buf + total;
136 * If the stinking thing was moved, we need to go through and
137 * reset all the sos and ber pointers. Offsets would've been
138 * a better idea... oh well.
141 if ( ber->ber_buf != oldbuf ) {
142 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
144 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
145 off = s->sos_first - oldbuf;
146 s->sos_first = ber->ber_buf + off;
148 off = s->sos_ptr - oldbuf;
149 s->sos_ptr = ber->ber_buf + off;
157 ber_free_buf( BerElement *ber )
161 assert( LBER_VALID( ber ) );
163 if ( ber->ber_buf) LBER_FREE( ber->ber_buf );
165 for( s = ber->ber_sos ; s != NULL ; s = next ) {
172 ber->ber_valid = LBER_UNINITIALIZED;
176 ber_free( BerElement *ber, int freebuf )
178 #ifdef LDAP_MEMORY_DEBUG
179 assert( ber != NULL );
189 LBER_FREE( (char *) ber );
193 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
198 assert( sb != NULL );
199 assert( ber != NULL );
201 assert( SOCKBUF_VALID( sb ) );
202 assert( LBER_VALID( ber ) );
204 if ( ber->ber_rwptr == NULL ) {
205 ber->ber_rwptr = ber->ber_buf;
207 towrite = ber->ber_ptr - ber->ber_rwptr;
209 if ( sb->sb_debug ) {
211 LDAP_LOG( BER, DETAIL1,
212 "ber_flush: %ld bytes to sd %ld%s\n",
213 towrite, (long)sb->sb_fd,
214 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
216 if(LDAP_LOGS_TEST(BER, DETAIL2))
217 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
220 ber_log_printf( LDAP_DEBUG_TRACE, sb->sb_debug,
221 "ber_flush: %ld bytes to sd %ld%s\n",
222 towrite, (long) sb->sb_fd,
223 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
224 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
225 ber->ber_rwptr, towrite );
229 while ( towrite > 0 ) {
232 rc = ber_int_sb_write( sb, ber->ber_rwptr, 1 );
234 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
240 ber->ber_rwptr += rc;
250 ber_alloc_t( int options )
254 ber_int_options.lbo_valid = LBER_INITIALIZED;
256 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
262 ber->ber_valid = LBER_VALID_BERELEMENT;
263 ber->ber_tag = LBER_DEFAULT;
264 ber->ber_options = options;
265 ber->ber_debug = ber_int_debug;
267 assert( LBER_VALID( ber ) );
272 ber_alloc( void ) /* deprecated */
274 return ber_alloc_t( 0 );
278 der_alloc( void ) /* deprecated */
280 return ber_alloc_t( LBER_USE_DER );
284 ber_dup( BerElement *ber )
288 assert( ber != NULL );
289 assert( LBER_VALID( ber ) );
291 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
297 assert( LBER_VALID( new ) );
303 ber_init2( BerElement *ber, struct berval *bv, int options )
305 assert( ber != NULL );
307 ber_int_options.lbo_valid = LBER_INITIALIZED;
309 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
310 ber->ber_valid = LBER_VALID_BERELEMENT;
311 ber->ber_tag = LBER_DEFAULT;
312 ber->ber_options = (char) options;
313 ber->ber_debug = ber_int_debug;
316 ber->ber_buf = bv->bv_val;
317 ber->ber_ptr = ber->ber_buf;
318 ber->ber_end = ber->ber_buf + bv->bv_len;
321 assert( LBER_VALID( ber ) );
324 /* OLD U-Mich ber_init() */
326 ber_init_w_nullc( BerElement *ber, int options )
328 ber_init2( ber, NULL, options );
331 /* New C-API ber_init() */
332 /* This function constructs a BerElement containing a copy
333 ** of the data in the bv argument.
336 ber_init( struct berval *bv )
340 assert( bv != NULL );
342 ber_int_options.lbo_valid = LBER_INITIALIZED;
348 ber = ber_alloc_t( 0 );
351 /* allocation failed */
356 if ( ((ber_len_t) ber_write ( ber, bv->bv_val, bv->bv_len, 0 ))
359 /* write failed, so free and return NULL */
364 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
368 /* New C-API ber_flatten routine */
369 /* This routine allocates a struct berval whose contents are a BER
370 ** encoding taken from the ber argument. The bvPtr pointer points to
371 ** the returned berval.
373 ** ber_flatten2 is the same, but uses a struct berval passed by
374 ** the caller. If alloc is 0 the returned bv uses the ber buf directly.
381 assert( bv != NULL );
383 ber_int_options.lbo_valid = LBER_INITIALIZED;
390 /* ber is null, create an empty berval */
395 /* copy the berval */
396 ber_len_t len = ber_pvt_ber_write( ber );
399 bv->bv_val = (char *) LBER_MALLOC( len + 1 );
400 if ( bv->bv_val == NULL ) {
403 AC_MEMCPY( bv->bv_val, ber->ber_buf, len );
405 bv->bv_val = ber->ber_buf;
407 bv->bv_val[len] = '\0';
415 struct berval **bvPtr)
420 assert( bvPtr != NULL );
422 ber_int_options.lbo_valid = LBER_INITIALIZED;
428 bv = LBER_MALLOC( sizeof(struct berval) );
432 rc = ber_flatten2(ber, bv, 1);
442 ber_reset( BerElement *ber, int was_writing )
444 assert( ber != NULL );
445 assert( LBER_VALID( ber ) );
448 ber->ber_end = ber->ber_ptr;
449 ber->ber_ptr = ber->ber_buf;
452 ber->ber_ptr = ber->ber_end;
455 ber->ber_rwptr = NULL;
459 * A rewrite of ber_get_next that can safely be called multiple times
460 * for the same packet. It will simply continue where it stopped until
461 * a full packet is read.
472 assert( sb != NULL );
473 assert( len != NULL );
474 assert( ber != NULL );
476 assert( SOCKBUF_VALID( sb ) );
477 assert( LBER_VALID( ber ) );
480 LDAP_LOG( BER, ENTRY, "ber_get_next: enter\n", 0, 0, 0 );
482 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
487 * Any ber element looks like this: tag length contents.
488 * Assuming everything's ok, we return the tag byte (we
489 * can assume a single byte), return the length in len,
490 * and the rest of the undecoded element in buf.
493 * 1) small tags (less than 128)
494 * 2) definite lengths
495 * 3) primitive encodings used whenever possible
497 * The code also handles multi-byte tags. The first few bytes
498 * of the message are read to check for multi-byte tags and
499 * lengths. These bytes are temporarily stored in the ber_tag,
500 * ber_len, and ber_usertag fields of the berelement until
501 * tag/len parsing is complete. After this parsing, any leftover
502 * bytes and the rest of the message are copied into the ber_buf.
504 * We expect tag and len to be at most 32 bits wide.
507 if (ber->ber_rwptr == NULL) {
508 assert( ber->ber_buf == NULL );
509 ber->ber_rwptr = (char *) &ber->ber_len-1;
510 ber->ber_ptr = ber->ber_rwptr;
514 while (ber->ber_rwptr > (char *)&ber->ber_tag && ber->ber_rwptr <
515 (char *)&ber->ber_len + LENSIZE*2 -1) {
517 char buf[sizeof(ber->ber_len)-1];
521 sblen=ber_int_sb_read( sb, ber->ber_rwptr,
522 ((char *)&ber->ber_len + LENSIZE*2 - 1)-ber->ber_rwptr);
523 if (sblen<=0) return LBER_DEFAULT;
524 ber->ber_rwptr += sblen;
526 /* We got at least one byte, try to parse the tag. */
527 if (ber->ber_ptr == (char *)&ber->ber_len-1) {
529 unsigned char *p = (unsigned char *)ber->ber_ptr;
531 if ((tag & LBER_BIG_TAG_MASK) == LBER_BIG_TAG_MASK) {
533 for (i=1; (char *)p<ber->ber_rwptr; i++) {
536 if (!(tag & LBER_MORE_TAG_MASK))
538 /* Is the tag too big? */
539 if (i == sizeof(ber_tag_t)-1) {
544 /* Did we run out of bytes? */
545 if ((char *)p == ber->ber_rwptr) {
546 #if defined( EWOULDBLOCK )
548 #elif defined( EAGAIN )
555 ber->ber_ptr = (char *)p;
558 if ( ber->ber_ptr == ber->ber_rwptr ) {
559 #if defined( EWOULDBLOCK )
561 #elif defined( EAGAIN )
567 /* Now look for the length */
568 if (*ber->ber_ptr & 0x80) { /* multi-byte */
570 unsigned char *p = (unsigned char *)ber->ber_ptr;
571 int llen = *p++ & 0x7f;
572 if (llen > (int)sizeof(ber_len_t)) {
576 /* Not enough bytes? */
577 if (ber->ber_rwptr - (char *)p < llen) {
578 #if defined( EWOULDBLOCK )
580 #elif defined( EAGAIN )
585 for (i=0; i<llen; i++)
592 tlen = *(unsigned char *)ber->ber_ptr++;
595 /* Are there leftover data bytes inside ber->ber_len? */
596 if (ber->ber_ptr < (char *)&ber->ber_usertag) {
597 if (ber->ber_rwptr < (char *)&ber->ber_usertag)
598 sblen = ber->ber_rwptr - ber->ber_ptr;
600 sblen = (char *)&ber->ber_usertag - ber->ber_ptr;
601 AC_MEMCPY(buf, ber->ber_ptr, sblen);
602 ber->ber_ptr += sblen;
608 /* now fill the buffer. */
610 /* make sure length is reasonable */
611 if ( ber->ber_len == 0 ) {
616 if ( sb->sb_max_incoming && ber->ber_len > sb->sb_max_incoming ) {
619 "ber_get_next: sockbuf_max_incoming limit hit "
620 "(%d > %d)\n", ber->ber_len, sb->sb_max_incoming, 0 );
622 ber_log_printf( LDAP_DEBUG_CONNS, ber->ber_debug,
623 "ber_get_next: sockbuf_max_incoming limit hit "
624 "(%ld > %ld)\n", ber->ber_len, sb->sb_max_incoming );
630 if (ber->ber_buf==NULL) {
631 ber_len_t l = ber->ber_rwptr - ber->ber_ptr;
632 /* ber->ber_ptr is always <= ber->ber->ber_rwptr.
633 * make sure ber->ber_len agrees with what we've
636 if ( ber->ber_len < sblen + l ) {
640 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len + 1 );
641 if (ber->ber_buf==NULL) {
644 ber->ber_end = ber->ber_buf + ber->ber_len;
646 AC_MEMCPY(ber->ber_buf, buf, sblen);
649 AC_MEMCPY(ber->ber_buf + sblen, ber->ber_ptr, l);
652 ber->ber_ptr = ber->ber_buf;
653 ber->ber_usertag = 0;
654 if ((ber_len_t)sblen == ber->ber_len) {
657 ber->ber_rwptr = ber->ber_buf + sblen;
661 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
665 to_go = ber->ber_end - ber->ber_rwptr;
669 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
670 if (res<=0) return LBER_DEFAULT;
674 #if defined( EWOULDBLOCK )
676 #elif defined( EAGAIN )
682 ber->ber_rwptr = NULL;
684 if ( ber->ber_debug ) {
686 LDAP_LOG( BER, DETAIL1,
687 "ber_get_next: tag 0x%lx len %ld\n",
688 ber->ber_tag, ber->ber_len, 0 );
689 if(LDAP_LOGS_TEST(BER, DETAIL2))
690 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
692 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
693 "ber_get_next: tag 0x%lx len %ld contents:\n",
694 ber->ber_tag, ber->ber_len );
695 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
698 return (ber->ber_tag);
701 assert( 0 ); /* ber structure is messed up ?*/