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 *) ber_memrealloc_x( oldbuf, total, ber->ber_memctx );
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) ber_memfree_x( ber->ber_buf, ber->ber_memctx );
165 for( s = ber->ber_sos ; s != NULL ; s = next ) {
167 ber_memfree_x( s, ber->ber_memctx );
172 ber->ber_valid = LBER_UNINITIALIZED;
176 ber_free( BerElement *ber, int freebuf )
178 #ifdef LDAP_MEMORY_DEBUG
179 assert( ber != NULL );
189 ber_memfree_x( (char *) ber, ber->ber_memctx );
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 ) {
233 rc = ber_int_sb_write( sb, ber->ber_rwptr, 1 );
235 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
241 ber->ber_rwptr += rc;
251 ber_alloc_t( int options )
255 ber_int_options.lbo_valid = LBER_INITIALIZED;
257 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
263 ber->ber_valid = LBER_VALID_BERELEMENT;
264 ber->ber_tag = LBER_DEFAULT;
265 ber->ber_options = options;
266 ber->ber_debug = ber_int_debug;
268 assert( LBER_VALID( ber ) );
273 ber_alloc( void ) /* deprecated */
275 return ber_alloc_t( 0 );
279 der_alloc( void ) /* deprecated */
281 return ber_alloc_t( LBER_USE_DER );
285 ber_dup( BerElement *ber )
289 assert( ber != NULL );
290 assert( LBER_VALID( ber ) );
292 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
298 assert( LBER_VALID( new ) );
304 ber_init2( BerElement *ber, struct berval *bv, int options )
306 assert( ber != NULL );
308 ber_int_options.lbo_valid = LBER_INITIALIZED;
310 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
311 ber->ber_valid = LBER_VALID_BERELEMENT;
312 ber->ber_tag = LBER_DEFAULT;
313 ber->ber_options = (char) options;
314 ber->ber_debug = ber_int_debug;
317 ber->ber_buf = bv->bv_val;
318 ber->ber_ptr = ber->ber_buf;
319 ber->ber_end = ber->ber_buf + bv->bv_len;
322 assert( LBER_VALID( ber ) );
325 /* OLD U-Mich ber_init() */
327 ber_init_w_nullc( BerElement *ber, int options )
329 ber_init2( ber, NULL, options );
332 /* New C-API ber_init() */
333 /* This function constructs a BerElement containing a copy
334 ** of the data in the bv argument.
337 ber_init( struct berval *bv )
341 assert( bv != NULL );
343 ber_int_options.lbo_valid = LBER_INITIALIZED;
349 ber = ber_alloc_t( 0 );
352 /* allocation failed */
357 if ( ((ber_len_t) ber_write ( ber, bv->bv_val, bv->bv_len, 0 ))
360 /* write failed, so free and return NULL */
365 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
369 /* New C-API ber_flatten routine */
370 /* This routine allocates a struct berval whose contents are a BER
371 ** encoding taken from the ber argument. The bvPtr pointer points to
372 ** the returned berval.
374 ** ber_flatten2 is the same, but uses a struct berval passed by
375 ** the caller. If alloc is 0 the returned bv uses the ber buf directly.
382 assert( bv != NULL );
384 ber_int_options.lbo_valid = LBER_INITIALIZED;
391 /* ber is null, create an empty berval */
396 /* copy the berval */
397 ber_len_t len = ber_pvt_ber_write( ber );
400 bv->bv_val = (char *) ber_memalloc_x( len + 1, ber->ber_memctx );
401 if ( bv->bv_val == NULL ) {
404 AC_MEMCPY( bv->bv_val, ber->ber_buf, len );
406 bv->bv_val = ber->ber_buf;
408 bv->bv_val[len] = '\0';
416 struct berval **bvPtr)
421 assert( bvPtr != NULL );
423 ber_int_options.lbo_valid = LBER_INITIALIZED;
429 bv = ber_memalloc_x( sizeof(struct berval), ber->ber_memctx );
433 rc = ber_flatten2(ber, bv, 1);
435 ber_memfree_x(bv, ber->ber_memctx);
443 ber_reset( BerElement *ber, int was_writing )
445 assert( ber != NULL );
446 assert( LBER_VALID( ber ) );
449 ber->ber_end = ber->ber_ptr;
450 ber->ber_ptr = ber->ber_buf;
453 ber->ber_ptr = ber->ber_end;
456 ber->ber_rwptr = NULL;
460 * A rewrite of ber_get_next that can safely be called multiple times
461 * for the same packet. It will simply continue where it stopped until
462 * a full packet is read.
473 assert( sb != NULL );
474 assert( len != NULL );
475 assert( ber != NULL );
477 assert( SOCKBUF_VALID( sb ) );
478 assert( LBER_VALID( ber ) );
481 LDAP_LOG( BER, ENTRY, "ber_get_next: enter\n", 0, 0, 0 );
483 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
488 * Any ber element looks like this: tag length contents.
489 * Assuming everything's ok, we return the tag byte (we
490 * can assume a single byte), return the length in len,
491 * and the rest of the undecoded element in buf.
494 * 1) small tags (less than 128)
495 * 2) definite lengths
496 * 3) primitive encodings used whenever possible
498 * The code also handles multi-byte tags. The first few bytes
499 * of the message are read to check for multi-byte tags and
500 * lengths. These bytes are temporarily stored in the ber_tag,
501 * ber_len, and ber_usertag fields of the berelement until
502 * tag/len parsing is complete. After this parsing, any leftover
503 * bytes and the rest of the message are copied into the ber_buf.
505 * We expect tag and len to be at most 32 bits wide.
508 if (ber->ber_rwptr == NULL) {
509 assert( ber->ber_buf == NULL );
510 ber->ber_rwptr = (char *) &ber->ber_len-1;
511 ber->ber_ptr = ber->ber_rwptr;
515 while (ber->ber_rwptr > (char *)&ber->ber_tag && ber->ber_rwptr <
516 (char *)&ber->ber_len + LENSIZE*2 -1) {
518 char buf[sizeof(ber->ber_len)-1];
522 sblen=ber_int_sb_read( sb, ber->ber_rwptr,
523 ((char *)&ber->ber_len + LENSIZE*2 - 1)-ber->ber_rwptr);
524 if (sblen<=0) return LBER_DEFAULT;
525 ber->ber_rwptr += sblen;
527 /* We got at least one byte, try to parse the tag. */
528 if (ber->ber_ptr == (char *)&ber->ber_len-1) {
530 unsigned char *p = (unsigned char *)ber->ber_ptr;
532 if ((tag & LBER_BIG_TAG_MASK) == LBER_BIG_TAG_MASK) {
534 for (i=1; (char *)p<ber->ber_rwptr; i++) {
537 if (!(tag & LBER_MORE_TAG_MASK))
539 /* Is the tag too big? */
540 if (i == sizeof(ber_tag_t)-1) {
545 /* Did we run out of bytes? */
546 if ((char *)p == ber->ber_rwptr) {
547 #if defined( EWOULDBLOCK )
549 #elif defined( EAGAIN )
555 if (sblen == 1) continue;
558 ber->ber_ptr = (char *)p;
561 /* Now look for the length */
562 if (*ber->ber_ptr & 0x80) { /* multi-byte */
564 unsigned char *p = (unsigned char *)ber->ber_ptr;
565 int llen = *p++ & 0x7f;
566 if (llen > (int)sizeof(ber_len_t)) {
570 /* Not enough bytes? */
571 if (ber->ber_rwptr - (char *)p < llen) {
572 #if defined( EWOULDBLOCK )
574 #elif defined( EAGAIN )
579 for (i=0; i<llen; i++)
586 tlen = *(unsigned char *)ber->ber_ptr++;
589 /* Are there leftover data bytes inside ber->ber_len? */
590 if (ber->ber_ptr < (char *)&ber->ber_usertag) {
591 if (ber->ber_rwptr < (char *)&ber->ber_usertag)
592 sblen = ber->ber_rwptr - ber->ber_ptr;
594 sblen = (char *)&ber->ber_usertag - ber->ber_ptr;
595 AC_MEMCPY(buf, ber->ber_ptr, sblen);
596 ber->ber_ptr += sblen;
602 /* now fill the buffer. */
604 /* make sure length is reasonable */
605 if ( ber->ber_len == 0 ) {
610 if ( sb->sb_max_incoming && ber->ber_len > sb->sb_max_incoming ) {
613 "ber_get_next: sockbuf_max_incoming exceeded "
614 "(%d > %d)\n", ber->ber_len, sb->sb_max_incoming, 0 );
616 ber_log_printf( LDAP_DEBUG_CONNS, ber->ber_debug,
617 "ber_get_next: sockbuf_max_incoming exceeded "
618 "(%ld > %ld)\n", ber->ber_len, sb->sb_max_incoming );
624 if (ber->ber_buf==NULL) {
625 ber_len_t l = ber->ber_rwptr - ber->ber_ptr;
626 /* ber->ber_ptr is always <= ber->ber->ber_rwptr.
627 * make sure ber->ber_len agrees with what we've
630 if ( ber->ber_len < sblen + l ) {
634 ber->ber_buf = (char *) ber_memalloc_x( ber->ber_len + 1, ber->ber_memctx );
635 if (ber->ber_buf==NULL) {
638 ber->ber_end = ber->ber_buf + ber->ber_len;
640 AC_MEMCPY(ber->ber_buf, buf, sblen);
643 AC_MEMCPY(ber->ber_buf + sblen, ber->ber_ptr, l);
646 ber->ber_ptr = ber->ber_buf;
647 ber->ber_usertag = 0;
648 if ((ber_len_t)sblen == ber->ber_len) {
651 ber->ber_rwptr = ber->ber_buf + sblen;
655 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
659 to_go = ber->ber_end - ber->ber_rwptr;
663 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
664 if (res<=0) return LBER_DEFAULT;
668 #if defined( EWOULDBLOCK )
670 #elif defined( EAGAIN )
676 ber->ber_rwptr = NULL;
678 if ( ber->ber_debug ) {
680 LDAP_LOG( BER, DETAIL1,
681 "ber_get_next: tag 0x%lx len %ld\n",
682 ber->ber_tag, ber->ber_len, 0 );
683 if(LDAP_LOGS_TEST(BER, DETAIL2))
684 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
686 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
687 "ber_get_next: tag 0x%lx len %ld contents:\n",
688 ber->ber_tag, ber->ber_len );
689 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
692 return (ber->ber_tag);
695 assert( 0 ); /* ber structure is messed up ?*/
700 ber_start( BerElement* ber )
706 ber_len( BerElement* ber )
708 return ( ber->ber_end - ber->ber_buf );
712 ber_ptrlen( BerElement* ber )
714 return ( ber->ber_ptr - ber->ber_buf );
718 ber_rewind ( BerElement * ber )
720 ber->ber_rwptr = NULL;
722 ber->ber_end = ber->ber_ptr;
723 ber->ber_ptr = ber->ber_buf;
727 ber_remaining( BerElement * ber )
729 return ber_pvt_ber_remaining( ber );