1 /* io.c - ber general i/o routines */
4 * Copyright 1998-2002 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>
43 ber_len_t actuallen, nleft;
45 assert( ber != NULL );
46 assert( buf != NULL );
48 assert( LBER_VALID( ber ) );
50 nleft = ber_pvt_ber_remaining( ber );
51 actuallen = nleft < len ? nleft : len;
53 AC_MEMCPY( buf, ber->ber_ptr, actuallen );
55 ber->ber_ptr += actuallen;
57 return( (ber_slen_t) actuallen );
67 assert( ber != NULL );
68 assert( buf != NULL );
70 assert( LBER_VALID( ber ) );
72 if ( nosos || ber->ber_sos == NULL ) {
73 if ( ber->ber_ptr + len > ber->ber_end ) {
74 if ( ber_realloc( ber, len ) != 0 )
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 )
86 AC_MEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
87 ber->ber_sos->sos_ptr += len;
88 ber->ber_sos->sos_clen += len;
89 return( (ber_slen_t) len );
94 ber_realloc( BerElement *ber, ber_len_t len )
101 assert( ber != NULL );
103 assert( LBER_VALID( ber ) );
105 total = ber_pvt_ber_total( ber );
107 #define LBER_EXBUFSIZ 1000 /* a few words less than 2^N for binary buddy */
108 #if defined( LBER_EXBUFSIZ ) && LBER_EXBUFSIZ > 0
110 /* don't realloc by small amounts */
111 total += len < LBER_EXBUFSIZ ? LBER_EXBUFSIZ : len;
113 { /* not sure what value this adds */
114 ber_len_t have = (total + (LBER_EXBUFSIZE - 1)) / LBER_EXBUFSIZ;
115 ber_len_t need = (len + (LBER_EXBUFSIZ - 1)) / LBER_EXBUFSIZ;
116 total = ( have + need ) * LBER_EXBUFSIZ;
120 total += len; /* realloc just what's needed */
123 oldbuf = ber->ber_buf;
125 ber->ber_buf = (char *) LBER_REALLOC( oldbuf, total );
127 if ( ber->ber_buf == NULL ) {
128 ber->ber_buf = oldbuf;
132 ber->ber_end = ber->ber_buf + total;
135 * If the stinking thing was moved, we need to go through and
136 * reset all the sos and ber pointers. Offsets would've been
137 * a better idea... oh well.
140 if ( ber->ber_buf != oldbuf ) {
141 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
143 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
144 off = s->sos_first - oldbuf;
145 s->sos_first = ber->ber_buf + off;
147 off = s->sos_ptr - oldbuf;
148 s->sos_ptr = ber->ber_buf + off;
156 ber_free_buf( BerElement *ber )
160 assert( LBER_VALID( ber ) );
162 if ( ber->ber_buf) LBER_FREE( ber->ber_buf );
164 for( s = ber->ber_sos ; s != NULL ; s = next ) {
171 ber->ber_valid = LBER_UNINITIALIZED;
175 ber_free( BerElement *ber, int freebuf )
177 #ifdef LDAP_MEMORY_DEBUG
178 assert( ber != NULL );
188 LBER_FREE( (char *) ber );
192 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
197 assert( sb != NULL );
198 assert( ber != NULL );
200 assert( SOCKBUF_VALID( sb ) );
201 assert( LBER_VALID( ber ) );
203 if ( ber->ber_rwptr == NULL ) {
204 ber->ber_rwptr = ber->ber_buf;
206 towrite = ber->ber_ptr - ber->ber_rwptr;
208 if ( sb->sb_debug ) {
210 LDAP_LOG(( "liblber", LDAP_LEVEL_DETAIL1,
211 "ber_flush: %ld bytes to sd %ld%s\n",
212 towrite, (long)sb->sb_fd,
213 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" ));
214 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
216 ber_log_printf( LDAP_DEBUG_ANY, sb->sb_debug,
217 "ber_flush: %ld bytes to sd %ld%s\n",
218 towrite, (long) sb->sb_fd,
219 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
220 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
221 ber->ber_rwptr, towrite );
225 while ( towrite > 0 ) {
226 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
231 ber->ber_rwptr += rc;
241 ber_alloc_t( int options )
245 ber_int_options.lbo_valid = LBER_INITIALIZED;
247 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
253 ber->ber_valid = LBER_VALID_BERELEMENT;
254 ber->ber_tag = LBER_DEFAULT;
255 ber->ber_options = options;
256 ber->ber_debug = ber_int_debug;
258 assert( LBER_VALID( ber ) );
263 ber_alloc( void ) /* deprecated */
265 return ber_alloc_t( 0 );
269 der_alloc( void ) /* deprecated */
271 return ber_alloc_t( LBER_USE_DER );
275 ber_dup( BerElement *ber )
279 assert( ber != NULL );
280 assert( LBER_VALID( ber ) );
282 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
288 assert( LBER_VALID( new ) );
294 ber_init2( BerElement *ber, struct berval *bv, int options )
296 assert( ber != NULL );
298 ber_int_options.lbo_valid = LBER_INITIALIZED;
300 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
301 ber->ber_valid = LBER_VALID_BERELEMENT;
302 ber->ber_tag = LBER_DEFAULT;
303 ber->ber_options = (char) options;
304 ber->ber_debug = ber_int_debug;
307 ber->ber_buf = bv->bv_val;
308 ber->ber_ptr = ber->ber_buf;
309 ber->ber_end = ber->ber_buf + bv->bv_len;
312 assert( LBER_VALID( ber ) );
315 /* OLD U-Mich ber_init() */
317 ber_init_w_nullc( BerElement *ber, int options )
319 ber_init2( ber, NULL, options );
322 /* New C-API ber_init() */
323 /* This function constructs a BerElement containing a copy
324 ** of the data in the bv argument.
327 ber_init( struct berval *bv )
331 assert( bv != NULL );
333 ber_int_options.lbo_valid = LBER_INITIALIZED;
339 ber = ber_alloc_t( 0 );
342 /* allocation failed */
347 if ( ((ber_len_t) ber_write ( ber, bv->bv_val, bv->bv_len, 0 ))
350 /* write failed, so free and return NULL */
355 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
359 /* New C-API ber_flatten routine */
360 /* This routine allocates a struct berval whose contents are a BER
361 ** encoding taken from the ber argument. The bvPtr pointer pointers to
362 ** the returned berval.
366 struct berval **bvPtr)
370 assert( bvPtr != NULL );
372 ber_int_options.lbo_valid = LBER_INITIALIZED;
378 bv = LBER_MALLOC( sizeof(struct berval) );
384 /* ber is null, create an empty berval */
389 /* copy the berval */
390 ber_len_t len = ber_pvt_ber_write( ber );
392 bv->bv_val = (char *) LBER_MALLOC( len + 1 );
393 if ( bv->bv_val == NULL ) {
398 AC_MEMCPY( bv->bv_val, ber->ber_buf, len );
399 bv->bv_val[len] = '\0';
408 ber_reset( BerElement *ber, int was_writing )
410 assert( ber != NULL );
411 assert( LBER_VALID( ber ) );
414 ber->ber_end = ber->ber_ptr;
415 ber->ber_ptr = ber->ber_buf;
418 ber->ber_ptr = ber->ber_end;
421 ber->ber_rwptr = NULL;
425 * A rewrite of ber_get_next that can safely be called multiple times
426 * for the same packet. It will simply continue where it stopped until
427 * a full packet is read.
436 assert( sb != NULL );
437 assert( len != NULL );
438 assert( ber != NULL );
440 assert( SOCKBUF_VALID( sb ) );
441 assert( LBER_VALID( ber ) );
444 LDAP_LOG(( "liblber", LDAP_LEVEL_ENTRY, "ber_get_next: enter\n" ));
446 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
451 * Any ber element looks like this: tag length contents.
452 * Assuming everything's ok, we return the tag byte (we
453 * can assume a single byte), return the length in len,
454 * and the rest of the undecoded element in buf.
457 * 1) small tags (less than 128)
458 * 2) definite lengths
459 * 3) primitive encodings used whenever possible
462 if (ber->ber_rwptr == NULL) {
464 * dtest does like this assert.
466 /* assert( ber->ber_buf == NULL ); */
467 ber->ber_rwptr = (char *) &ber->ber_len-1;
468 ber->ber_ptr = ber->ber_rwptr;
472 while (ber->ber_rwptr > (char *)&ber->ber_tag && ber->ber_rwptr <
473 (char *)(&ber->ber_usertag + 1)) {
475 char buf[sizeof(ber->ber_len)-1];
478 if ((i=ber_int_sb_read( sb, ber->ber_rwptr,
479 (char *)(&ber->ber_usertag+1)-ber->ber_rwptr))<=0) {
485 /* We got at least one byte, try to parse the tag. */
486 if (ber->ber_ptr == (char *)&ber->ber_len-1) {
488 unsigned char *p = (unsigned char *)ber->ber_ptr;
490 if ((tag & LBER_BIG_TAG_MASK) == LBER_BIG_TAG_MASK) {
491 for (i=1; (char *)p<ber->ber_rwptr; i++,p++) {
494 if (!(*p & LBER_MORE_TAG_MASK))
496 /* Is the tag too big? */
497 if (i == sizeof(ber_tag_t)-1) {
502 /* Did we run out of bytes? */
503 if ((char *)p == ber->ber_rwptr) {
509 ber->ber_ptr = (char *)p;
512 /* Now look for the length */
513 if (*ber->ber_ptr & 0x80) { /* multi-byte */
514 int llen = *(unsigned char *)ber->ber_ptr++ & 0x7f;
515 if (llen > (int)sizeof(ber_len_t)) {
519 /* Not enough bytes? */
520 if (ber->ber_rwptr - ber->ber_ptr < llen) {
523 for (i=0; i<llen && ber->ber_ptr<ber->ber_rwptr; i++,ber->ber_ptr++) {
525 tlen |= *(unsigned char *)ber->ber_ptr;
528 tlen = *(unsigned char *)ber->ber_ptr++;
530 /* Are there leftover data bytes inside ber->ber_len? */
531 if (ber->ber_ptr < (char *)&ber->ber_usertag) {
532 if (ber->ber_rwptr < (char *)&ber->ber_usertag)
533 i = ber->ber_rwptr - ber->ber_ptr;
535 i = (char *)&ber->ber_usertag - ber->ber_ptr;
536 AC_MEMCPY(buf, ber->ber_ptr, i);
543 /* now fill the buffer. */
545 /* make sure length is reasonable */
546 if ( ber->ber_len == 0 ) {
549 } else if ( sb->sb_max_incoming && ber->ber_len > sb->sb_max_incoming ) {
551 LDAP_LOG(( "liblber", LDAP_LEVEL_ERR,
552 "ber_get_next: sockbuf_max_incoming limit hit "
553 "(%d > %d)\n", ber->ber_len, sb->sb_max_incoming ));
555 ber_log_printf( LDAP_DEBUG_CONNS, ber->ber_debug,
556 "ber_get_next: sockbuf_max_incoming limit hit "
557 "(%ld > %ld)\n", ber->ber_len, sb->sb_max_incoming );
563 if (ber->ber_buf==NULL) {
564 ber_len_t l = ber->ber_rwptr - ber->ber_ptr;
565 /* ber->ber_ptr is always <= ber->ber->ber_rwptr.
566 * make sure ber->ber_len agrees with what we've
569 if ( ber->ber_len < i + l ) {
573 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len + 1 );
574 if (ber->ber_buf==NULL) {
577 ber->ber_end = ber->ber_buf + ber->ber_len;
579 AC_MEMCPY(ber->ber_buf, buf, i);
582 AC_MEMCPY(ber->ber_buf + i, ber->ber_ptr, l);
585 ber->ber_ptr = ber->ber_buf;
586 ber->ber_usertag = 0;
587 if ((ber_len_t)i == ber->ber_len) {
590 ber->ber_rwptr = ber->ber_buf + i;
594 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
598 to_go = ber->ber_end - ber->ber_rwptr;
601 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
607 #if defined( EWOULDBLOCK )
609 #elif defined( EAGAIN )
615 ber->ber_rwptr = NULL;
617 if ( ber->ber_debug ) {
619 LDAP_LOG(( "liblber", LDAP_LEVEL_DETAIL1,
620 "ber_get_next: tag 0x%lx len %ld\n",
621 ber->ber_tag, ber->ber_len ));
622 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
624 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
625 "ber_get_next: tag 0x%lx len %ld contents:\n",
626 ber->ber_tag, ber->ber_len );
627 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
630 return (ber->ber_tag);
633 assert( 0 ); /* ber structure is messed up ?*/