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>
49 assert( buf != NULL );
51 assert( SOCKBUF_VALID( sb ) );
54 if ( (c = ber_int_sb_read( sb, buf, len )) <= 0 ) {
73 ber_len_t actuallen, nleft;
75 assert( ber != NULL );
76 assert( buf != NULL );
78 assert( BER_VALID( ber ) );
80 nleft = ber->ber_end - ber->ber_ptr;
81 actuallen = nleft < len ? nleft : len;
83 AC_MEMCPY( buf, ber->ber_ptr, actuallen );
85 ber->ber_ptr += actuallen;
87 return( (ber_slen_t) actuallen );
97 assert( ber != NULL );
98 assert( buf != NULL );
100 assert( BER_VALID( ber ) );
102 if ( nosos || ber->ber_sos == NULL ) {
103 if ( ber->ber_ptr + len > ber->ber_end ) {
104 if ( ber_realloc( ber, len ) != 0 )
107 AC_MEMCPY( ber->ber_ptr, buf, (size_t)len );
109 return( (ber_slen_t) len );
112 if ( ber->ber_sos->sos_ptr + len > ber->ber_end ) {
113 if ( ber_realloc( ber, len ) != 0 )
116 AC_MEMCPY( ber->ber_sos->sos_ptr, buf, (size_t)len );
117 ber->ber_sos->sos_ptr += len;
118 ber->ber_sos->sos_clen += len;
119 return( (ber_slen_t) len );
124 ber_realloc( BerElement *ber, ber_len_t len )
126 ber_len_t need, have, total;
131 assert( ber != NULL );
134 assert( BER_VALID( ber ) );
136 have = (ber->ber_end - ber->ber_buf) / EXBUFSIZ;
137 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
138 total = have * EXBUFSIZ + need * EXBUFSIZ;
140 oldbuf = ber->ber_buf;
142 ber->ber_buf = (char *) LBER_REALLOC( ber->ber_buf, total );
144 if ( ber->ber_buf == NULL ) {
145 ber->ber_buf = oldbuf;
149 ber->ber_end = ber->ber_buf + total;
152 * If the stinking thing was moved, we need to go through and
153 * reset all the sos and ber pointers. Offsets would've been
154 * a better idea... oh well.
157 if ( ber->ber_buf != oldbuf ) {
158 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
160 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
161 off = s->sos_first - oldbuf;
162 s->sos_first = ber->ber_buf + off;
164 off = s->sos_ptr - oldbuf;
165 s->sos_ptr = ber->ber_buf + off;
173 ber_free( BerElement *ber, int freebuf )
175 #ifdef LDAP_MEMORY_DEBUG
176 assert( ber != NULL );
183 assert( BER_VALID( ber ) );
187 LBER_FREE( ber->ber_buf );
189 for( s = ber->ber_sos ; s != NULL ; s = next ) {
197 ber->ber_valid = LBER_UNINITIALIZED;
199 LBER_FREE( (char *) ber );
203 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
205 ber_len_t nwritten, towrite;
208 assert( sb != NULL );
209 assert( ber != NULL );
211 assert( SOCKBUF_VALID( sb ) );
212 assert( BER_VALID( ber ) );
214 if ( ber->ber_rwptr == NULL ) {
215 ber->ber_rwptr = ber->ber_buf;
217 towrite = ber->ber_ptr - ber->ber_rwptr;
219 if ( sb->sb_debug ) {
221 LDAP_LOG(( "liblber", LDAP_LEVEL_DETAIL1,
222 "ber_flush: %ld bytes to sd %ld%s\n",
223 towrite, (long)sb->sb_fd,
224 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" ));
225 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
227 ber_log_printf( LDAP_DEBUG_ANY, sb->sb_debug,
228 "ber_flush: %ld bytes to sd %ld%s\n",
229 towrite, (long) sb->sb_fd,
230 ber->ber_rwptr != ber->ber_buf ? " (re-flush)" : "" );
231 ber_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
232 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 ))
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->ber_ptr - ber->ber_buf;
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( BER_VALID( ber ) );
414 ber->ber_end = ber->ber_ptr;
415 ber->ber_ptr = ber->ber_buf;
417 ber->ber_ptr = ber->ber_end;
420 ber->ber_rwptr = NULL;
424 * A rewrite of ber_get_next that can safely be called multiple times
425 * for the same packet. It will simply continue where it stopped until
426 * a full packet is read.
435 assert( sb != NULL );
436 assert( len != NULL );
437 assert( ber != NULL );
439 assert( SOCKBUF_VALID( sb ) );
440 assert( BER_VALID( ber ) );
443 LDAP_LOG(( "liblber", LDAP_LEVEL_ENTRY, "ber_get_next: enter\n" ));
445 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
450 * Any ber element looks like this: tag length contents.
451 * Assuming everything's ok, we return the tag byte (we
452 * can assume a single byte), return the length in len,
453 * and the rest of the undecoded element in buf.
456 * 1) small tags (less than 128)
457 * 2) definite lengths
458 * 3) primitive encodings used whenever possible
461 if (ber->ber_rwptr == NULL) {
463 * dtest does like this assert.
465 /* assert( ber->ber_buf == NULL ); */
466 ber->ber_rwptr = (char *) &ber->ber_tag;
471 #define PTR_IN_VAR( ptr, var ) \
472 (((ptr)>=(char *) &(var)) && ((ptr)< (char *) &(var)+sizeof(var)))
474 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag)) {
475 if (ber->ber_rwptr == (char *) &ber->ber_tag) {
476 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0)
478 if ((ber->ber_rwptr[0] & LBER_BIG_TAG_MASK)
479 != LBER_BIG_TAG_MASK) {
480 ber->ber_tag = ber->ber_rwptr[0];
481 ber->ber_rwptr = (char *) &ber->ber_usertag;
487 /* reading the tag... */
488 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0) {
492 if (! (ber->ber_rwptr[0] & LBER_MORE_TAG_MASK) ) {
493 ber->ber_tag>>=sizeof(ber->ber_tag) -
494 ((char *) &ber->ber_tag - ber->ber_rwptr);
495 ber->ber_rwptr = (char *) &ber->ber_usertag;
498 } while( PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag ));
500 errno = ERANGE; /* this is a serious error. */
505 if (ber->ber_rwptr==(char *) &ber->ber_usertag) {
507 if (ber_int_sb_read( sb, (char *) &c, 1)<=0)
511 if ( (len==0) || ( len>sizeof( ber->ber_len ) ) ) {
515 ber->ber_rwptr = (char *) &ber->ber_len +
516 sizeof(ber->ber_len) - len;
524 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len)) {
525 unsigned char netlen[sizeof(ber_len_t)];
529 to_go = (char *) &ber->ber_len + sizeof( ber->ber_len ) -
532 res = BerRead( sb, netlen, to_go );
536 ber->ber_rwptr += res;
538 /* convert length. */
539 for( to_go = 0; to_go < res ; to_go++ ) {
541 ber->ber_len |= netlen[to_go];
543 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len))
548 /* now fill the buffer. */
549 if (ber->ber_len==0) {
553 if (ber->ber_buf==NULL) {
554 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len );
555 if (ber->ber_buf==NULL) {
558 ber->ber_rwptr = ber->ber_buf;
559 ber->ber_ptr = ber->ber_buf;
560 ber->ber_end = ber->ber_buf + ber->ber_len;
563 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
567 to_go = ber->ber_end - ber->ber_rwptr;
570 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
576 #if defined( EWOULDBLOCK )
578 #elif defined( EAGAIN )
584 ber->ber_rwptr = NULL;
586 if ( ber->ber_debug ) {
588 LDAP_LOG(( "liblber", LDAP_LEVEL_DETAIL1,
589 "ber_get_next: tag 0x%lx len %ld\n",
590 ber->ber_tag, ber->ber_len ));
591 BER_DUMP(( "liblber", LDAP_LEVEL_DETAIL2, ber, 1 ));
593 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
594 "ber_get_next: tag 0x%lx len %ld contents:\n",
595 ber->ber_tag, ber->ber_len );
596 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
599 return (ber->ber_tag);
601 assert( 0 ); /* ber structure is messed up ?*/