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_pvt_ber_remaining( ber );
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 total = ber_pvt_ber_total( ber );
137 have = total / EXBUFSIZ;
138 need = (len < EXBUFSIZ ? 1 : (len + (EXBUFSIZ - 1)) / EXBUFSIZ);
139 total = have * EXBUFSIZ + need * EXBUFSIZ;
141 oldbuf = ber->ber_buf;
143 ber->ber_buf = (char *) LBER_REALLOC( oldbuf, total );
145 if ( ber->ber_buf == NULL ) {
146 ber->ber_buf = oldbuf;
150 ber->ber_end = ber->ber_buf + total;
153 * If the stinking thing was moved, we need to go through and
154 * reset all the sos and ber pointers. Offsets would've been
155 * a better idea... oh well.
158 if ( ber->ber_buf != oldbuf ) {
159 ber->ber_ptr = ber->ber_buf + (ber->ber_ptr - oldbuf);
161 for ( s = ber->ber_sos; s != NULL; s = s->sos_next ) {
162 off = s->sos_first - oldbuf;
163 s->sos_first = ber->ber_buf + off;
165 off = s->sos_ptr - oldbuf;
166 s->sos_ptr = ber->ber_buf + off;
174 ber_free( BerElement *ber, int freebuf )
176 #ifdef LDAP_MEMORY_DEBUG
177 assert( ber != NULL );
184 assert( BER_VALID( ber ) );
188 LBER_FREE( ber->ber_buf );
190 for( s = ber->ber_sos ; s != NULL ; s = next ) {
198 ber->ber_valid = LBER_UNINITIALIZED;
200 LBER_FREE( (char *) ber );
204 ber_flush( Sockbuf *sb, BerElement *ber, int freeit )
206 ber_len_t nwritten, towrite;
209 assert( sb != NULL );
210 assert( ber != NULL );
212 assert( SOCKBUF_VALID( sb ) );
213 assert( BER_VALID( ber ) );
215 if ( ber->ber_rwptr == NULL ) {
216 ber->ber_rwptr = ber->ber_buf;
218 towrite = ber->ber_ptr - ber->ber_rwptr;
220 if ( sb->sb_debug ) {
221 ber_log_printf( LDAP_DEBUG_ANY, sb->sb_debug,
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_log_bprint( LDAP_DEBUG_PACKETS, sb->sb_debug,
226 ber->ber_rwptr, towrite );
231 rc = ber_int_sb_write( sb, ber->ber_rwptr, towrite );
237 ber->ber_rwptr += rc;
238 } while ( towrite > 0 );
247 ber_alloc_t( int options )
251 ber_int_options.lbo_valid = LBER_INITIALIZED;
253 ber = (BerElement *) LBER_CALLOC( 1, sizeof(BerElement) );
259 ber->ber_valid = LBER_VALID_BERELEMENT;
260 ber->ber_tag = LBER_DEFAULT;
261 ber->ber_options = options;
262 ber->ber_debug = ber_int_debug;
264 assert( BER_VALID( ber ) );
269 ber_alloc( void ) /* deprecated */
271 return ber_alloc_t( 0 );
275 der_alloc( void ) /* deprecated */
277 return ber_alloc_t( LBER_USE_DER );
281 ber_dup( BerElement *ber )
285 assert( ber != NULL );
286 assert( BER_VALID( ber ) );
288 if ( (new = ber_alloc_t( ber->ber_options )) == NULL ) {
294 assert( BER_VALID( new ) );
299 /* OLD U-Mich ber_init() */
301 ber_init_w_nullc( BerElement *ber, int options )
303 assert( ber != NULL );
305 ber_int_options.lbo_valid = LBER_INITIALIZED;
307 (void) memset( (char *)ber, '\0', sizeof( BerElement ));
308 ber->ber_valid = LBER_VALID_BERELEMENT;
309 ber->ber_tag = LBER_DEFAULT;
310 ber->ber_options = (char) options;
311 ber->ber_debug = ber_int_debug;
313 assert( BER_VALID( ber ) );
316 /* New C-API ber_init() */
317 /* This function constructs a BerElement containing a copy
318 ** of the data in the bv argument.
321 ber_init( struct berval *bv )
325 assert( bv != NULL );
327 ber_int_options.lbo_valid = LBER_INITIALIZED;
333 ber = ber_alloc_t( 0 );
336 /* allocation failed */
341 if ( ((ber_len_t) ber_write ( ber, bv->bv_val, bv->bv_len, 0 ))
344 /* write failed, so free and return NULL */
349 ber_reset( ber, 1 ); /* reset the pointer to the start of the buffer */
353 /* New C-API ber_flatten routine */
354 /* This routine allocates a struct berval whose contents are a BER
355 ** encoding taken from the ber argument. The bvPtr pointer pointers to
356 ** the returned berval.
360 struct berval **bvPtr)
364 assert( bvPtr != NULL );
366 ber_int_options.lbo_valid = LBER_INITIALIZED;
372 bv = LBER_MALLOC( sizeof(struct berval) );
378 /* ber is null, create an empty berval */
383 /* copy the berval */
384 ber_len_t len = ber_pvt_ber_write( ber );
386 bv->bv_val = (char *) LBER_MALLOC( len + 1 );
387 if ( bv->bv_val == NULL ) {
392 AC_MEMCPY( bv->bv_val, ber->ber_buf, len );
393 bv->bv_val[len] = '\0';
402 ber_reset( BerElement *ber, int was_writing )
404 assert( ber != NULL );
405 assert( BER_VALID( ber ) );
408 ber->ber_end = ber->ber_ptr;
409 ber->ber_ptr = ber->ber_buf;
412 ber->ber_ptr = ber->ber_end;
415 ber->ber_rwptr = NULL;
419 * A rewrite of ber_get_next that can safely be called multiple times
420 * for the same packet. It will simply continue where it stopped until
421 * a full packet is read.
430 assert( sb != NULL );
431 assert( len != NULL );
432 assert( ber != NULL );
434 assert( SOCKBUF_VALID( sb ) );
435 assert( BER_VALID( ber ) );
437 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
441 * Any ber element looks like this: tag length contents.
442 * Assuming everything's ok, we return the tag byte (we
443 * can assume a single byte), return the length in len,
444 * and the rest of the undecoded element in buf.
447 * 1) small tags (less than 128)
448 * 2) definite lengths
449 * 3) primitive encodings used whenever possible
452 if (ber->ber_rwptr == NULL) {
454 * dtest does like this assert.
456 /* assert( ber->ber_buf == NULL ); */
457 ber->ber_rwptr = (char *) &ber->ber_tag;
462 #define PTR_IN_VAR( ptr, var ) \
463 (((ptr)>=(char *) &(var)) && ((ptr)< (char *) &(var)+sizeof(var)))
465 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag)) {
466 if (ber->ber_rwptr == (char *) &ber->ber_tag) {
467 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0)
470 if ((ber->ber_rwptr[0] & LBER_BIG_TAG_MASK)
471 != LBER_BIG_TAG_MASK)
473 ber->ber_tag = ber->ber_rwptr[0];
474 ber->ber_rwptr = (char *) &ber->ber_usertag;
480 /* reading the tag... */
481 if (ber_int_sb_read( sb, ber->ber_rwptr, 1)<=0) {
485 if (! (ber->ber_rwptr[0] & LBER_MORE_TAG_MASK) ) {
486 ber->ber_tag>>=sizeof(ber->ber_tag) -
487 ((char *) &ber->ber_tag - ber->ber_rwptr);
488 ber->ber_rwptr = (char *) &ber->ber_usertag;
491 } while( PTR_IN_VAR(ber->ber_rwptr, ber->ber_tag ));
493 errno = ERANGE; /* this is a serious error. */
498 if (ber->ber_rwptr==(char *) &ber->ber_usertag) {
500 if (ber_int_sb_read( sb, (char *) &c, 1)<=0) {
506 if ( (len==0) || ( len>sizeof( ber->ber_len ) ) ) {
511 ber->ber_rwptr = (char *) &ber->ber_len +
512 sizeof(ber->ber_len) - len;
521 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len)) {
522 unsigned char netlen[sizeof(ber_len_t)];
526 to_go = (char *) &ber->ber_len + sizeof( ber->ber_len ) -
530 res = BerRead( sb, netlen, to_go );
534 ber->ber_rwptr += res;
536 /* convert length. */
537 for( to_go = 0; to_go < res ; to_go++ ) {
539 ber->ber_len |= netlen[to_go];
542 if (PTR_IN_VAR(ber->ber_rwptr, ber->ber_len)) {
548 /* now fill the buffer. */
550 /* make sure length is reasonable */
551 if ( ber->ber_len == 0 ||
552 ( sb->sb_max_incoming && ber->ber_len > sb->sb_max_incoming ))
558 if (ber->ber_buf==NULL) {
559 ber->ber_buf = (char *) LBER_MALLOC( ber->ber_len );
560 if (ber->ber_buf==NULL) {
563 ber->ber_rwptr = ber->ber_buf;
564 ber->ber_ptr = ber->ber_buf;
565 ber->ber_end = ber->ber_buf + ber->ber_len;
568 if ((ber->ber_rwptr>=ber->ber_buf) && (ber->ber_rwptr<ber->ber_end)) {
572 to_go = ber->ber_end - ber->ber_rwptr;
575 res = ber_int_sb_read( sb, ber->ber_rwptr, to_go );
581 #if defined( EWOULDBLOCK )
583 #elif defined( EAGAIN )
589 ber->ber_rwptr = NULL;
591 if ( ber->ber_debug ) {
592 ber_log_printf( LDAP_DEBUG_TRACE, ber->ber_debug,
593 "ber_get_next: tag 0x%lx len %ld contents:\n",
594 ber->ber_tag, ber->ber_len );
595 ber_log_dump( LDAP_DEBUG_BER, ber->ber_debug, ber, 1 );
597 return (ber->ber_tag);
600 assert( 0 ); /* ber structure is messed up ?*/