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>
39 /* probably far too large... */
40 #define MAX_BERBUFSIZE (128*1024)
42 #if defined( DOS ) && !defined( _WIN32 ) && (MAX_BERBUFSIZE > 65535)
43 # undef MAX_BERBUFSIZE
44 # define MAX_BERBUFSIZE 65535
57 assert( buf != NULL );
59 assert( SOCKBUF_VALID( sb ) );
62 if ( (c = ber_int_sb_read( sb, buf, len )) <= 0 ) {
81 ber_len_t actuallen, nleft;
83 assert( ber != NULL );
84 assert( buf != NULL );
86 assert( BER_VALID( ber ) );
88 nleft = ber->ber_end - ber->ber_ptr;
89 actuallen = nleft < len ? nleft : len;
91 AC_MEMCPY( buf, ber->ber_ptr, actuallen );
93 ber->ber_ptr += actuallen;
95 return( (ber_slen_t) actuallen );
101 LDAP_CONST char *buf,
105 assert( ber != NULL );
106 assert( buf != NULL );
108 assert( BER_VALID( ber ) );
110 if ( nosos || ber->ber_sos == NULL ) {
111 if ( ber->ber_ptr + len > ber->ber_end ) {
112 if ( ber_realloc( ber, len ) != 0 )
115 AC_MEMCPY( ber->ber_ptr, buf, (size_t)len );
117 return( (ber_slen_t) len );
120 if ( ber->ber_sos->sos_ptr + len > ber->ber_end ) {
121 if ( ber_realloc( ber, len ) != 0 )
124 AC_MEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
125 ber->ber_sos->sos_ptr += len;
126 ber->ber_sos->sos_clen += len;
127 return( (ber_slen_t) len );
132 ber_realloc( BerElement *ber, ber_len_t len )
134 ber_len_t need, have, total;
139 assert( ber != NULL );
142 assert( BER_VALID( ber ) );
144 have = (ber->ber_end - ber->ber_buf) / EXBUFSIZ;
145 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
146 total = have * EXBUFSIZ + need * EXBUFSIZ;
148 oldbuf = ber->ber_buf;
150 ber->ber_buf = (char *) LBER_REALLOC( ber->ber_buf, total );
152 if ( ber->ber_buf == NULL ) {
153 ber->ber_buf = oldbuf;
157 ber->ber_end = ber->ber_buf + total;
160 * If the stinking thing was moved, we need to go through and
161 * reset all the sos and ber pointers. Offsets would've been
162 * a better idea... oh well.
165 if ( ber->ber_buf != oldbuf ) {
166 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
168 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
169 off = s->sos_first - oldbuf;
170 s->sos_first = ber->ber_buf + off;
172 off = s->sos_ptr - oldbuf;
173 s->sos_ptr = ber->ber_buf + off;
181 ber_free( BerElement *ber, int freebuf )
183 #ifdef LDAP_MEMORY_DEBUG
184 assert( ber != NULL );
191 assert( BER_VALID( ber ) );
195 LBER_FREE( ber->ber_buf );
197 for( s = ber->ber_sos ; s != NULL ; s = next ) {
205 ber->ber_valid = LBER_UNINITIALIZED;
207 LBER_FREE( (char *) ber );
211 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
213 ber_len_t nwritten, towrite;
216 assert( sb != NULL );
217 assert( ber != NULL );
219 assert( SOCKBUF_VALID( sb ) );
220 assert( BER_VALID( ber ) );
222 if ( ber->ber_rwptr == NULL ) {
223 ber->ber_rwptr = ber->ber_buf;
225 towrite = ber->ber_ptr - ber->ber_rwptr;
227 if ( sb->sb_debug ) {
228 ber_log_printf( LDAP_DEBUG_ANY, sb->sb_debug,
229 "ber_flush: %ld bytes to sd %ld%s\n",
230 towrite, (long) sb->sb_fd,
231 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
232 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
233 ber->ber_rwptr, towrite );
238 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
244 ber->ber_rwptr += rc;
245 } while ( towrite > 0 );
254 ber_alloc_t( int options )
258 ber_int_options.lbo_valid = LBER_INITIALIZED;
260 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
265 ber->ber_valid = LBER_VALID_BERELEMENT;
266 ber->ber_tag = LBER_DEFAULT;
267 ber->ber_options = options;
268 ber->ber_debug = ber_int_debug;
270 assert( BER_VALID( ber ) );
275 ber_alloc( void ) /* deprecated */
277 return( ber_alloc_t( 0 ) );
281 der_alloc( void ) /* deprecated */
283 return( ber_alloc_t( LBER_USE_DER ) );
287 ber_dup( BerElement *ber )
291 assert( ber != NULL );
292 assert( BER_VALID( ber ) );
294 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
300 assert( BER_VALID( new ) );
305 /* OLD U-Mich ber_init() */
307 ber_init_w_nullc( BerElement *ber, int options )
309 assert( ber != NULL );
311 ber_int_options.lbo_valid = LBER_INITIALIZED;
313 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
314 ber->ber_valid = LBER_VALID_BERELEMENT;
315 ber->ber_tag = LBER_DEFAULT;
316 ber->ber_options = (char) options;
317 ber->ber_debug = ber_int_debug;
319 assert( BER_VALID( ber ) );
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 )) != bv->bv_len ) {
348 /* write failed, so free and return NULL */
353 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
358 /* New C-API ber_flatten routine */
359 /* This routine allocates a struct berval whose contents are a BER
360 ** encoding taken from the ber argument. The bvPtr pointer pointers to
361 ** the returned berval.
365 struct berval **bvPtr)
369 assert( bvPtr != NULL );
371 ber_int_options.lbo_valid = LBER_INITIALIZED;
377 if ( (bv = LBER_MALLOC( sizeof(struct berval))) == NULL ) {
382 /* ber is null, create an empty berval */
387 /* copy the berval */
388 ber_len_t len = ber->ber_ptr - ber->ber_buf;
390 if ( (bv->bv_val = (char *) LBER_MALLOC( len + 1 )) == NULL ) {
395 AC_MEMCPY( bv->bv_val, ber->ber_buf, len );
396 bv->bv_val[len] = '\0';
405 ber_reset( BerElement *ber, int was_writing )
407 assert( ber != NULL );
408 assert( BER_VALID( ber ) );
411 ber->ber_end = ber->ber_ptr;
412 ber->ber_ptr = ber->ber_buf;
414 ber->ber_ptr = ber->ber_end;
417 ber->ber_rwptr = NULL;
421 /* return the tag - LBER_DEFAULT returned means trouble */
423 get_tag( Sockbuf *sb )
430 assert( sb != NULL );
431 assert( SOCKBUF_VALID( sb ) );
433 if ( ber_int_sb_read( sb, (char *) &xbyte, 1 ) != 1 )
434 return( LBER_DEFAULT );
436 if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK )
437 return( (ber_tag_t) xbyte );
439 tagp = (char *) &tag;
441 for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
442 if ( ber_int_sb_read( sb, (char *) &xbyte, 1 ) != 1 )
443 return( LBER_DEFAULT );
447 if ( ! (xbyte & LBER_MORE_TAG_MASK) )
452 if ( i == sizeof(ber_tag_t) )
453 return( LBER_DEFAULT );
455 /* want leading, not trailing 0's */
456 return( tag >> (sizeof(ber_tag_t) - i - 1) );
461 * A rewrite of ber_get_next that can safely be called multiple times
462 * for the same packet. It will simply continue where it stopped until
463 * a full packet is read.
472 assert( sb != NULL );
473 assert( len != NULL );
474 assert( ber != NULL );
476 assert( SOCKBUF_VALID( sb ) );
477 assert( BER_VALID( ber ) );
479 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
494 if (ber->ber_rwptr == NULL) {
496 * dtest does like this assert.
498 /* assert( ber->ber_buf == NULL ); */
499 ber->ber_rwptr = (char *) &ber->ber_tag;
504 #define PTR_IN_VAR( ptr, var ) \
505 (((ptr)>=(char *) &(var)) && ((ptr)< (char *) &(var)+sizeof(var)))
507 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag)) {
508 if (ber->ber_rwptr == (char *) &ber->ber_tag) {
509 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0)
511 if ((ber->ber_rwptr[0] & LBER_BIG_TAG_MASK)
512 != LBER_BIG_TAG_MASK) {
513 ber->ber_tag = ber->ber_rwptr[0];
514 ber->ber_rwptr = (char *) &ber->ber_usertag;
520 /* reading the tag... */
521 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0) {
525 if (! (ber->ber_rwptr[0] & LBER_MORE_TAG_MASK) ) {
526 ber->ber_tag>>=sizeof(ber->ber_tag) -
527 ((char *) &ber->ber_tag - ber->ber_rwptr);
528 ber->ber_rwptr = (char *) &ber->ber_usertag;
531 } while( PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag ));
533 errno = ERANGE; /* this is a serious error. */
538 if (ber->ber_rwptr==(char *) &ber->ber_usertag) {
540 if (ber_int_sb_read( sb, (char *) &c, 1)<=0)
544 if ( (len==0) || ( len>sizeof( ber->ber_len ) ) ) {
548 ber->ber_rwptr = (char *) &ber->ber_len +
549 sizeof(ber->ber_len) - len;
557 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len)) {
558 unsigned char netlen[sizeof(ber_len_t)];
562 to_go = (char *) &ber->ber_len + sizeof( ber->ber_len ) -
565 res = BerRead( sb, netlen, to_go );
569 ber->ber_rwptr += res;
571 /* convert length. */
573 for( to_go = 0; to_go < res ; to_go++ ) {
575 ber->ber_len |= netlen[to_go];
580 /* now fill the buffer. */
581 if (ber->ber_buf==NULL) {
582 if (ber->ber_len > MAX_BERBUFSIZE) {
586 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len );
587 if (ber->ber_buf==NULL)
589 ber->ber_rwptr = ber->ber_buf;
590 ber->ber_ptr = ber->ber_buf;
591 ber->ber_end = ber->ber_buf + ber->ber_len;
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 ) {
618 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
619 "ber_get_next: tag 0x%lx len %ld contents:\n",
620 ber->ber_tag, ber->ber_len );
621 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
623 return (ber->ber_tag);
625 assert( 0 ); /* ber structure is messed up ?*/