1 /* io.c - ber general i/o routines */
4 * Copyright 1998-1999 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>
36 #define LDAP_F_PRE LDAP_F_EXPORT
40 static ber_slen_t BerRead LDAP_P((
45 static int ber_realloc LDAP_P((
51 /* probably far too large... */
52 #define MAX_BERBUFSIZE (128*1024)
54 #if defined( DOS ) && !defined( _WIN32 ) && (MAX_BERBUFSIZE > 65535)
55 # undef MAX_BERBUFSIZE
56 # define MAX_BERBUFSIZE 65535
69 assert( buf != NULL );
71 assert( SOCKBUF_VALID( sb ) );
74 if ( (c = ber_pvt_sb_read( sb, buf, len )) <= 0 ) {
93 ber_len_t actuallen, nleft;
95 assert( ber != NULL );
96 assert( buf != NULL );
98 assert( BER_VALID( ber ) );
100 nleft = ber->ber_end - ber->ber_ptr;
101 actuallen = nleft < len ? nleft : len;
103 SAFEMEMCPY( buf, ber->ber_ptr, actuallen );
105 ber->ber_ptr += actuallen;
107 return( (ber_slen_t) actuallen );
113 LDAP_CONST char *buf,
117 assert( ber != NULL );
118 assert( buf != NULL );
120 assert( BER_VALID( ber ) );
122 if ( nosos || ber->ber_sos == NULL ) {
123 if ( ber->ber_ptr + len > ber->ber_end ) {
124 if ( ber_realloc( ber, len ) != 0 )
127 SAFEMEMCPY( ber->ber_ptr, buf, (size_t)len );
129 return( (ber_slen_t) len );
132 if ( ber->ber_sos->sos_ptr + len > ber->ber_end ) {
133 if ( ber_realloc( ber, len ) != 0 )
136 SAFEMEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
137 ber->ber_sos->sos_ptr += len;
138 ber->ber_sos->sos_clen += len;
139 return( (ber_slen_t) len );
144 ber_realloc( BerElement *ber, ber_len_t len )
146 ber_len_t need, have, total;
151 assert( ber != NULL );
154 assert( BER_VALID( ber ) );
156 have = (ber->ber_end - ber->ber_buf) / EXBUFSIZ;
157 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
158 total = have * EXBUFSIZ + need * EXBUFSIZ;
160 oldbuf = ber->ber_buf;
162 ber->ber_buf = (char *) LBER_REALLOC( ber->ber_buf, total );
164 if ( ber->ber_buf == NULL ) {
165 ber->ber_buf = oldbuf;
169 ber->ber_end = ber->ber_buf + total;
172 * If the stinking thing was moved, we need to go through and
173 * reset all the sos and ber pointers. Offsets would've been
174 * a better idea... oh well.
177 if ( ber->ber_buf != oldbuf ) {
178 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
180 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
181 off = s->sos_first - oldbuf;
182 s->sos_first = ber->ber_buf + off;
184 off = s->sos_ptr - oldbuf;
185 s->sos_ptr = ber->ber_buf + off;
193 ber_free( BerElement *ber, int freebuf )
195 #ifdef LDAP_MEMORY_DEBUG
196 assert( ber != NULL );
203 assert( BER_VALID( ber ) );
207 LBER_FREE( ber->ber_buf );
209 for( s = ber->ber_sos ; s != NULL ; s = next ) {
217 ber->ber_valid = LBER_UNINITIALIZED;
219 LBER_FREE( (char *) ber );
223 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
225 ber_len_t nwritten, towrite;
228 assert( sb != NULL );
229 assert( ber != NULL );
231 assert( SOCKBUF_VALID( ber ) );
232 assert( BER_VALID( ber ) );
234 if ( ber->ber_rwptr == NULL ) {
235 ber->ber_rwptr = ber->ber_buf;
237 towrite = ber->ber_ptr - ber->ber_rwptr;
239 if ( sb->sb_debug ) {
240 ber_log_printf( LDAP_DEBUG_ANY, sb->sb_debug,
241 "ber_flush: %ld bytes to sd %ld%s\n", towrite,
242 (long) sb->sb_sd, ber->ber_rwptr != ber->ber_buf ? " (re-flush)"
244 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
245 ber->ber_rwptr, towrite );
249 if ( sb->sb_options & (LBER_TO_FILE | LBER_TO_FILE_ONLY) ) {
250 rc = write( sb->sb_fd, ber->ber_rwptr, towrite );
251 if ( sb->sb_options & LBER_TO_FILE_ONLY ) {
261 rc = ber_pvt_sb_write( sb, ber->ber_rwptr, towrite );
267 ber->ber_rwptr += rc;
268 } while ( towrite > 0 );
277 ber_alloc_t( int options )
281 ber_int_options.lbo_valid = LBER_INITIALIZED;
283 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
288 ber->ber_valid = LBER_VALID_BERELEMENT;
289 ber->ber_tag = LBER_DEFAULT;
290 ber->ber_options = options;
291 ber->ber_debug = ber_int_debug;
293 assert( BER_VALID( ber ) );
298 ber_alloc( void ) /* deprecated */
300 return( ber_alloc_t( 0 ) );
304 der_alloc( void ) /* deprecated */
306 return( ber_alloc_t( LBER_USE_DER ) );
310 ber_dup( BerElement *ber )
314 assert( ber != NULL );
315 assert( BER_VALID( ber ) );
317 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
323 assert( BER_VALID( new ) );
328 /* OLD U-Mich ber_init() */
330 ber_init_w_nullc( BerElement *ber, int options )
332 assert( ber != NULL );
334 ber_int_options.lbo_valid = LBER_INITIALIZED;
336 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
337 ber->ber_valid = LBER_VALID_BERELEMENT;
338 ber->ber_tag = LBER_DEFAULT;
339 ber->ber_options = (char) options;
340 ber->ber_debug = ber_int_debug;
342 assert( BER_VALID( ber ) );
345 /* New C-API ber_init() */
346 /* This function constructs a BerElement containing a copy
347 ** of the data in the bv argument.
350 ber_init( struct berval *bv )
354 assert( bv != NULL );
356 ber_int_options.lbo_valid = LBER_INITIALIZED;
362 ber = ber_alloc_t( 0 );
365 /* allocation failed */
370 if ( ( (ber_len_t) ber_write ( ber, bv->bv_val, bv->bv_len, 0 )) != bv->bv_len ) {
371 /* write failed, so free and return NULL */
376 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
381 /* New C-API ber_flatten routine */
382 /* This routine allocates a struct berval whose contents are a BER
383 ** encoding taken from the ber argument. The bvPtr pointer pointers to
384 ** the returned berval.
388 struct berval **bvPtr)
392 assert( bvPtr != NULL );
394 ber_int_options.lbo_valid = LBER_INITIALIZED;
400 if ( (bv = LBER_MALLOC( sizeof(struct berval))) == NULL ) {
405 /* ber is null, create an empty berval */
410 /* copy the berval */
411 ber_len_t len = ber->ber_ptr - ber->ber_buf;
413 if ( (bv->bv_val = (char *) LBER_MALLOC( len + 1 )) == NULL ) {
418 SAFEMEMCPY( bv->bv_val, ber->ber_buf, len );
419 bv->bv_val[len] = '\0';
428 ber_reset( BerElement *ber, int was_writing )
430 assert( ber != NULL );
431 assert( BER_VALID( ber ) );
434 ber->ber_end = ber->ber_ptr;
435 ber->ber_ptr = ber->ber_buf;
437 ber->ber_ptr = ber->ber_end;
440 ber->ber_rwptr = NULL;
444 /* return the tag - LBER_DEFAULT returned means trouble */
446 get_tag( Sockbuf *sb )
453 assert( sb != NULL );
454 assert( SOCKBUF_VALID( sb ) );
456 if ( ber_pvt_sb_read( sb, (char *) &xbyte, 1 ) != 1 )
457 return( LBER_DEFAULT );
459 if ( (xbyte & LBER_BIG_TAG_MASK) != LBER_BIG_TAG_MASK )
460 return( (ber_tag_t) xbyte );
462 tagp = (char *) &tag;
464 for ( i = 1; i < sizeof(ber_tag_t); i++ ) {
465 if ( ber_pvt_sb_read( sb, (char *) &xbyte, 1 ) != 1 )
466 return( LBER_DEFAULT );
470 if ( ! (xbyte & LBER_MORE_TAG_MASK) )
475 if ( i == sizeof(ber_tag_t) )
476 return( LBER_DEFAULT );
478 /* want leading, not trailing 0's */
479 return( tag >> (sizeof(ber_tag_t) - i - 1) );
484 * A rewrite of ber_get_next that can safely be called multiple times
485 * for the same packet. It will simply continue were it stopped until
486 * a full packet is read.
495 assert( sb != NULL );
496 assert( len != NULL );
497 assert( ber != NULL );
499 assert( SOCKBUF_VALID( sb ) );
500 assert( BER_VALID( ber ) );
502 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
506 * Any ber element looks like this: tag length contents.
507 * Assuming everything's ok, we return the tag byte (we
508 * can assume a single byte), return the length in len,
509 * and the rest of the undecoded element in buf.
512 * 1) small tags (less than 128)
513 * 2) definite lengths
514 * 3) primitive encodings used whenever possible
517 if (ber->ber_rwptr == NULL) {
519 * dtest does like this assert.
521 /* assert( ber->ber_buf == NULL ); */
522 ber->ber_rwptr = (char *) &ber->ber_tag;
527 #define PTR_IN_VAR( ptr, var ) \
528 (((ptr)>=(char *) &(var)) && ((ptr)< (char *) &(var)+sizeof(var)))
530 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag)) {
531 if (ber->ber_rwptr == (char *) &ber->ber_tag) {
532 if (ber_pvt_sb_read( sb, ber->ber_rwptr, 1)<=0)
534 if ((ber->ber_rwptr[0] & LBER_BIG_TAG_MASK)
535 != LBER_BIG_TAG_MASK) {
536 ber->ber_tag = ber->ber_rwptr[0];
537 ber->ber_rwptr = (char *) &ber->ber_usertag;
543 /* reading the tag... */
544 if (ber_pvt_sb_read( sb, ber->ber_rwptr, 1)<=0)
546 if (! (ber->ber_rwptr[0] & LBER_MORE_TAG_MASK) ) {
547 ber->ber_tag>>=sizeof(ber->ber_tag) -
548 ((char *) &ber->ber_tag - ber->ber_rwptr);
549 ber->ber_rwptr = (char *) &ber->ber_usertag;
552 } while( PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag ));
553 errno = ERANGE; /* this is a serious error. */
558 if (ber->ber_rwptr==(char *) &ber->ber_usertag) {
560 if (ber_pvt_sb_read( sb, (char *) &c, 1)<=0)
564 if ( (len==0) || ( len>sizeof( ber->ber_len ) ) ) {
568 ber->ber_rwptr = (char *) &ber->ber_len +
569 sizeof(ber->ber_len) - len;
577 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len)) {
578 unsigned char netlen[sizeof(ber_len_t)];
582 to_go = (char *) &ber->ber_len + sizeof( ber->ber_len ) -
585 res = ber_pvt_sb_read( sb, netlen, to_go );
589 ber->ber_rwptr += res;
592 /* convert length. */
594 for( to_go = 0; to_go < res ; to_go++ ) {
596 ber->ber_len |= netlen[to_go];
600 #if defined( EWOULDBLOCK )
602 #elif defined( EAGAIN )
610 /* now fill the buffer. */
611 if (ber->ber_buf==NULL) {
612 if (ber->ber_len > MAX_BERBUFSIZE) {
616 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len );
617 if (ber->ber_buf==NULL)
619 ber->ber_rwptr = ber->ber_buf;
620 ber->ber_ptr = ber->ber_buf;
621 ber->ber_end = ber->ber_buf + ber->ber_len;
624 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
628 to_go = ber->ber_end - ber->ber_rwptr;
631 res = ber_pvt_sb_read( sb, ber->ber_rwptr, to_go );
637 #if defined( EWOULDBLOCK )
639 #elif defined( EAGAIN )
645 ber->ber_rwptr = NULL;
647 if ( ber->ber_debug ) {
648 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
649 "ber_get_next: tag 0x%lx len %ld contents:\n",
650 ber->ber_tag, ber->ber_len );
651 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
653 return (ber->ber_tag);
655 assert( 0 ); /* ber structure is messed up ?*/