1 /* io.c - ber general i/o 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>
27 #include <ac/socket.h>
28 #include <ac/string.h>
29 #include <ac/unistd.h>
37 static ber_slen_t BerRead LDAP_P((
44 /* probably far too large... */
45 #define MAX_BERBUFSIZE (128*1024)
47 #if defined( DOS ) && !defined( _WIN32 ) && (MAX_BERBUFSIZE > 65535)
48 # undef MAX_BERBUFSIZE
49 # define MAX_BERBUFSIZE 65535
62 assert( buf != NULL );
64 assert( SOCKBUF_VALID( sb ) );
67 if ( (c = ber_int_sb_read( sb, buf, len )) <= 0 ) {
86 ber_len_t actuallen, nleft;
88 assert( ber != NULL );
89 assert( buf != NULL );
91 assert( BER_VALID( ber ) );
93 nleft = ber->ber_end - ber->ber_ptr;
94 actuallen = nleft < len ? nleft : len;
96 SAFEMEMCPY( buf, ber->ber_ptr, actuallen );
98 ber->ber_ptr += actuallen;
100 return( (ber_slen_t) actuallen );
106 LDAP_CONST char *buf,
110 assert( ber != NULL );
111 assert( buf != NULL );
113 assert( BER_VALID( ber ) );
115 if ( nosos || ber->ber_sos == NULL ) {
116 if ( ber->ber_ptr + len > ber->ber_end ) {
117 if ( ber_realloc( ber, len ) != 0 )
120 SAFEMEMCPY( ber->ber_ptr, buf, (size_t)len );
122 return( (ber_slen_t) len );
125 if ( ber->ber_sos->sos_ptr + len > ber->ber_end ) {
126 if ( ber_realloc( ber, len ) != 0 )
129 SAFEMEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
130 ber->ber_sos->sos_ptr += len;
131 ber->ber_sos->sos_clen += len;
132 return( (ber_slen_t) len );
137 ber_realloc( BerElement *ber, ber_len_t len )
139 ber_len_t need, have, total;
144 assert( ber != NULL );
147 assert( BER_VALID( ber ) );
149 have = (ber->ber_end - ber->ber_buf) / EXBUFSIZ;
150 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
151 total = have * EXBUFSIZ + need * EXBUFSIZ;
153 oldbuf = ber->ber_buf;
155 ber->ber_buf = (char *) LBER_REALLOC( ber->ber_buf, total );
157 if ( ber->ber_buf == NULL ) {
158 ber->ber_buf = oldbuf;
162 ber->ber_end = ber->ber_buf + total;
165 * If the stinking thing was moved, we need to go through and
166 * reset all the sos and ber pointers. Offsets would've been
167 * a better idea... oh well.
170 if ( ber->ber_buf != oldbuf ) {
171 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
173 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
174 off = s->sos_first - oldbuf;
175 s->sos_first = ber->ber_buf + off;
177 off = s->sos_ptr - oldbuf;
178 s->sos_ptr = ber->ber_buf + off;
186 ber_free( BerElement *ber, int freebuf )
188 #ifdef LDAP_MEMORY_DEBUG
189 assert( ber != NULL );
196 assert( BER_VALID( ber ) );
200 LBER_FREE( ber->ber_buf );
202 for( s = ber->ber_sos ; s != NULL ; s = next ) {
210 ber->ber_valid = LBER_UNINITIALIZED;
212 LBER_FREE( (char *) ber );
216 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
218 ber_len_t nwritten, towrite;
221 assert( sb != NULL );
222 assert( ber != NULL );
224 assert( SOCKBUF_VALID( sb ) );
225 assert( BER_VALID( ber ) );
227 if ( ber->ber_rwptr == NULL ) {
228 ber->ber_rwptr = ber->ber_buf;
230 towrite = ber->ber_ptr - ber->ber_rwptr;
232 if ( sb->sb_debug ) {
233 ber_log_printf( LDAP_DEBUG_ANY, sb->sb_debug,
234 "ber_flush: %ld bytes to sd %ld%s\n",
235 towrite, (long) sb->sb_fd,
236 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
237 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
238 ber->ber_rwptr, towrite );
243 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
249 ber->ber_rwptr += rc;
250 } while ( towrite > 0 );
259 ber_alloc_t( int options )
263 ber_int_options.lbo_valid = LBER_INITIALIZED;
265 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
270 ber->ber_valid = LBER_VALID_BERELEMENT;
271 ber->ber_tag = LBER_DEFAULT;
272 ber->ber_options = options;
273 ber->ber_debug = ber_int_debug;
275 assert( BER_VALID( ber ) );
280 ber_alloc( void ) /* deprecated */
282 return( ber_alloc_t( 0 ) );
286 der_alloc( void ) /* deprecated */
288 return( ber_alloc_t( LBER_USE_DER ) );
292 ber_dup( BerElement *ber )
296 assert( ber != NULL );
297 assert( BER_VALID( ber ) );
299 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
305 assert( BER_VALID( new ) );
310 /* OLD U-Mich ber_init() */
312 ber_init_w_nullc( BerElement *ber, int options )
314 assert( ber != NULL );
316 ber_int_options.lbo_valid = LBER_INITIALIZED;
318 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
319 ber->ber_valid = LBER_VALID_BERELEMENT;
320 ber->ber_tag = LBER_DEFAULT;
321 ber->ber_options = (char) options;
322 ber->ber_debug = ber_int_debug;
324 assert( BER_VALID( ber ) );
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 )) != bv->bv_len ) {
353 /* write failed, so free and return NULL */
358 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
363 /* New C-API ber_flatten routine */
364 /* This routine allocates a struct berval whose contents are a BER
365 ** encoding taken from the ber argument. The bvPtr pointer pointers to
366 ** the returned berval.
370 struct berval **bvPtr)
374 assert( bvPtr != NULL );
376 ber_int_options.lbo_valid = LBER_INITIALIZED;
382 if ( (bv = LBER_MALLOC( sizeof(struct berval))) == NULL ) {
387 /* ber is null, create an empty berval */
392 /* copy the berval */
393 ber_len_t len = ber->ber_ptr - ber->ber_buf;
395 if ( (bv->bv_val = (char *) LBER_MALLOC( len + 1 )) == NULL ) {
400 SAFEMEMCPY( bv->bv_val, ber->ber_buf, len );
401 bv->bv_val[len] = '\0';
410 ber_reset( BerElement *ber, int was_writing )
412 assert( ber != NULL );
413 assert( BER_VALID( ber ) );
416 ber->ber_end = ber->ber_ptr;
417 ber->ber_ptr = ber->ber_buf;
419 ber->ber_ptr = ber->ber_end;
422 ber->ber_rwptr = NULL;
426 /* return the tag - LBER_DEFAULT returned means trouble */
428 get_tag( Sockbuf *sb )
435 assert( sb != NULL );
436 assert( SOCKBUF_VALID( sb ) );
438 if ( ber_int_sb_read( sb, (char *) &xbyte, 1 ) != 1 )
439 return( LBER_DEFAULT );
441 if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK )
442 return( (ber_tag_t) xbyte );
444 tagp = (char *) &tag;
446 for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
447 if ( ber_int_sb_read( sb, (char *) &xbyte, 1 ) != 1 )
448 return( LBER_DEFAULT );
452 if ( ! (xbyte & LBER_MORE_TAG_MASK) )
457 if ( i == sizeof(ber_tag_t) )
458 return( LBER_DEFAULT );
460 /* want leading, not trailing 0's */
461 return( tag >> (sizeof(ber_tag_t) - i - 1) );
466 * A rewrite of ber_get_next that can safely be called multiple times
467 * for the same packet. It will simply continue where it stopped until
468 * a full packet is read.
477 assert( sb != NULL );
478 assert( len != NULL );
479 assert( ber != NULL );
481 assert( SOCKBUF_VALID( sb ) );
482 assert( BER_VALID( ber ) );
484 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
499 if (ber->ber_rwptr == NULL) {
501 * dtest does like this assert.
503 /* assert( ber->ber_buf == NULL ); */
504 ber->ber_rwptr = (char *) &ber->ber_tag;
509 #define PTR_IN_VAR( ptr, var ) \
510 (((ptr)>=(char *) &(var)) && ((ptr)< (char *) &(var)+sizeof(var)))
512 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag)) {
513 if (ber->ber_rwptr == (char *) &ber->ber_tag) {
514 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0)
516 if ((ber->ber_rwptr[0] & LBER_BIG_TAG_MASK)
517 != LBER_BIG_TAG_MASK) {
518 ber->ber_tag = ber->ber_rwptr[0];
519 ber->ber_rwptr = (char *) &ber->ber_usertag;
525 /* reading the tag... */
526 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0) {
530 if (! (ber->ber_rwptr[0] & LBER_MORE_TAG_MASK) ) {
531 ber->ber_tag>>=sizeof(ber->ber_tag) -
532 ((char *) &ber->ber_tag - ber->ber_rwptr);
533 ber->ber_rwptr = (char *) &ber->ber_usertag;
536 } while( PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag ));
538 errno = ERANGE; /* this is a serious error. */
543 if (ber->ber_rwptr==(char *) &ber->ber_usertag) {
545 if (ber_int_sb_read( sb, (char *) &c, 1)<=0)
549 if ( (len==0) || ( len>sizeof( ber->ber_len ) ) ) {
553 ber->ber_rwptr = (char *) &ber->ber_len +
554 sizeof(ber->ber_len) - len;
562 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len)) {
563 unsigned char netlen[sizeof(ber_len_t)];
567 to_go = (char *) &ber->ber_len + sizeof( ber->ber_len ) -
570 res = BerRead( sb, netlen, to_go );
574 ber->ber_rwptr += res;
576 /* convert length. */
578 for( to_go = 0; to_go < res ; to_go++ ) {
580 ber->ber_len |= netlen[to_go];
585 /* now fill the buffer. */
586 if (ber->ber_buf==NULL) {
587 if (ber->ber_len > MAX_BERBUFSIZE) {
591 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len );
592 if (ber->ber_buf==NULL)
594 ber->ber_rwptr = ber->ber_buf;
595 ber->ber_ptr = ber->ber_buf;
596 ber->ber_end = ber->ber_buf + ber->ber_len;
599 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
603 to_go = ber->ber_end - ber->ber_rwptr;
606 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
612 #if defined( EWOULDBLOCK )
614 #elif defined( EAGAIN )
620 ber->ber_rwptr = NULL;
622 if ( ber->ber_debug ) {
623 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
624 "ber_get_next: tag 0x%lx len %ld contents:\n",
625 ber->ber_tag, ber->ber_len );
626 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
628 return (ber->ber_tag);
630 assert( 0 ); /* ber structure is messed up ?*/