1999-05-29 09:19:14 +08:00
|
|
|
/*
|
|
|
|
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
|
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
1999-05-30 02:57:23 +08:00
|
|
|
#include <ac/string.h>
|
1999-05-29 09:19:14 +08:00
|
|
|
|
|
|
|
#include "lber-int.h"
|
|
|
|
|
1999-05-31 07:00:52 +08:00
|
|
|
BerMemoryFunctions *ber_int_memory_fns = NULL;
|
|
|
|
|
1999-06-02 03:01:05 +08:00
|
|
|
|
1999-05-29 09:19:14 +08:00
|
|
|
void
|
|
|
|
ber_memfree( void *p )
|
|
|
|
{
|
1999-05-29 13:16:31 +08:00
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
1999-05-31 07:00:52 +08:00
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* catch p == NULL when debugging */
|
1999-05-31 07:00:52 +08:00
|
|
|
assert( p != NULL );
|
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* ignore p == NULL when not debugging */
|
|
|
|
if( p == NULL ) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
1999-05-31 07:00:52 +08:00
|
|
|
if( ber_int_memory_fns == NULL ) {
|
|
|
|
free( p );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert( ber_int_memory_fns->bmf_free );
|
|
|
|
|
|
|
|
(*ber_int_memory_fns->bmf_free)( p );
|
1999-05-29 09:19:14 +08:00
|
|
|
}
|
|
|
|
|
1999-06-02 03:01:05 +08:00
|
|
|
|
|
|
|
void
|
|
|
|
ber_memvfree( void **vec )
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
assert(vec != NULL); /* vec damn better point to something */
|
|
|
|
|
|
|
|
for ( i = 0; vec[i] != NULL; i++ ) {
|
|
|
|
LBER_FREE( vec[i] );
|
|
|
|
}
|
|
|
|
|
|
|
|
LBER_FREE( vec );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-05-29 09:19:14 +08:00
|
|
|
void *
|
|
|
|
ber_memalloc( size_t s )
|
|
|
|
{
|
1999-05-29 13:16:31 +08:00
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
1999-05-31 07:00:52 +08:00
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* catch s == 0 when debugging */
|
1999-05-31 07:00:52 +08:00
|
|
|
assert( s );
|
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* ignore s == 0 when not debugging */
|
|
|
|
if( s == 0 ) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
1999-05-31 07:00:52 +08:00
|
|
|
if( ber_int_memory_fns == NULL ) {
|
|
|
|
return malloc( s );
|
|
|
|
}
|
|
|
|
|
|
|
|
assert( ber_int_memory_fns->bmf_malloc );
|
|
|
|
|
|
|
|
return (*ber_int_memory_fns->bmf_malloc)( s );
|
1999-05-29 09:19:14 +08:00
|
|
|
}
|
|
|
|
|
1999-06-02 03:01:05 +08:00
|
|
|
|
1999-05-29 09:19:14 +08:00
|
|
|
void *
|
|
|
|
ber_memcalloc( size_t n, size_t s )
|
|
|
|
{
|
1999-05-29 13:16:31 +08:00
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
1999-05-31 07:00:52 +08:00
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* catch s,n == 0 when debugging */
|
1999-05-31 07:00:52 +08:00
|
|
|
assert( n && s );
|
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* ignore s,n == 0 when not debugging */
|
|
|
|
if( n == 0 || s == 0 ) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
1999-05-31 07:00:52 +08:00
|
|
|
if( ber_int_memory_fns == NULL ) {
|
|
|
|
return calloc( n, s );
|
|
|
|
}
|
|
|
|
|
|
|
|
assert( ber_int_memory_fns->bmf_calloc );
|
|
|
|
|
|
|
|
return (*ber_int_memory_fns->bmf_calloc)( n, s );
|
1999-05-29 09:19:14 +08:00
|
|
|
}
|
|
|
|
|
1999-06-02 03:01:05 +08:00
|
|
|
|
1999-05-29 09:19:14 +08:00
|
|
|
void *
|
|
|
|
ber_memrealloc( void* p, size_t s )
|
|
|
|
{
|
1999-05-29 13:16:31 +08:00
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* realloc(NULL,s) -> malloc(s) */
|
1999-05-31 07:00:52 +08:00
|
|
|
if( p == NULL ) {
|
|
|
|
return ber_memalloc( s );
|
|
|
|
}
|
|
|
|
|
1999-06-01 01:30:22 +08:00
|
|
|
/* realloc(p,0) -> free(p) */
|
1999-05-31 07:00:52 +08:00
|
|
|
if( s == 0 ) {
|
|
|
|
ber_memfree( p );
|
|
|
|
return NULL;
|
|
|
|
}
|
1999-05-29 13:16:31 +08:00
|
|
|
|
1999-05-31 07:00:52 +08:00
|
|
|
if( ber_int_memory_fns == NULL ) {
|
|
|
|
return realloc( p, s );
|
1999-05-29 13:16:31 +08:00
|
|
|
}
|
1999-05-31 07:00:52 +08:00
|
|
|
|
|
|
|
assert( ber_int_memory_fns->bmf_realloc );
|
|
|
|
|
|
|
|
return (*ber_int_memory_fns->bmf_realloc)( p, s );
|
1999-05-29 13:16:31 +08:00
|
|
|
}
|
|
|
|
|
1999-06-02 03:01:05 +08:00
|
|
|
|
|
|
|
void
|
|
|
|
ber_bvfree( struct berval *bv )
|
|
|
|
{
|
|
|
|
assert(bv != NULL); /* bv damn better point to something */
|
|
|
|
|
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
|
|
|
|
|
|
|
if ( bv->bv_val != NULL )
|
|
|
|
LBER_FREE( bv->bv_val );
|
|
|
|
|
|
|
|
LBER_FREE( (char *) bv );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
ber_bvecfree( struct berval **bv )
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
assert(bv != NULL); /* bv damn better point to something */
|
|
|
|
|
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
|
|
|
|
|
|
|
for ( i = 0; bv[i] != NULL; i++ )
|
|
|
|
ber_bvfree( bv[i] );
|
|
|
|
|
|
|
|
LBER_FREE( (char *) bv );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
struct berval *
|
|
|
|
ber_bvdup(
|
|
|
|
LDAP_CONST struct berval *bv )
|
|
|
|
{
|
|
|
|
struct berval *new;
|
|
|
|
|
|
|
|
assert( bv != NULL );
|
|
|
|
|
|
|
|
ber_int_options.lbo_valid = LBER_INITIALIZED;
|
|
|
|
|
|
|
|
if( bv == NULL ) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if(( new = LBER_MALLOC( sizeof(struct berval) )) == NULL ) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( bv->bv_val == NULL ) {
|
|
|
|
new->bv_val = NULL;
|
|
|
|
new->bv_len = 0;
|
|
|
|
return new;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(( new->bv_val = LBER_MALLOC( bv->bv_len + 1 )) == NULL ) {
|
|
|
|
LBER_FREE( new );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
SAFEMEMCPY( new->bv_val, bv->bv_val, (size_t) bv->bv_len );
|
|
|
|
new->bv_val[bv->bv_len] = '\0';
|
|
|
|
new->bv_len = bv->bv_len;
|
|
|
|
|
|
|
|
return( new );
|
|
|
|
}
|