openldap/servers/slapd/charray.c

179 lines
2.5 KiB
C
Raw Normal View History

1998-08-09 08:43:13 +08:00
/* charray.c - routines for dealing with char * arrays */
1999-08-07 07:07:46 +08:00
/*
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
1998-08-09 08:43:13 +08:00
1998-10-25 09:41:42 +08:00
#include "portable.h"
1998-08-09 08:43:13 +08:00
#include <stdio.h>
1998-10-25 09:41:42 +08:00
#include <ac/string.h>
#include <ac/socket.h>
1998-08-09 08:43:13 +08:00
#include "slap.h"
void
charray_add(
char ***a,
1999-08-21 03:00:44 +08:00
const char *s
1998-08-09 08:43:13 +08:00
)
{
int n;
if ( *a == NULL ) {
*a = (char **) ch_malloc( 2 * sizeof(char *) );
n = 0;
} else {
for ( n = 0; *a != NULL && (*a)[n] != NULL; n++ ) {
; /* NULL */
}
*a = (char **) ch_realloc( (char *) *a,
(n + 2) * sizeof(char *) );
}
(*a)[n++] = ch_strdup(s);
1998-08-09 08:43:13 +08:00
(*a)[n] = NULL;
}
void
charray_merge(
char ***a,
1999-08-21 03:50:11 +08:00
char **s
1998-08-09 08:43:13 +08:00
)
{
int i, n, nn;
for ( n = 0; *a != NULL && (*a)[n] != NULL; n++ ) {
; /* NULL */
}
for ( nn = 0; s[nn] != NULL; nn++ ) {
; /* NULL */
}
*a = (char **) ch_realloc( (char *) *a, (n + nn + 1) * sizeof(char *) );
for ( i = 0; i < nn; i++ ) {
(*a)[n + i] = ch_strdup(s[i]);
1998-08-09 08:43:13 +08:00
}
(*a)[n + nn] = NULL;
}
void
charray_free( char **array )
{
char **a;
if ( array == NULL ) {
return;
}
for ( a = array; *a != NULL; a++ ) {
if ( *a != NULL ) {
free( *a );
}
}
free( (char *) array );
}
int
charray_inlist(
1999-08-21 03:50:11 +08:00
char **a,
1999-08-21 03:00:44 +08:00
const char *s
1998-08-09 08:43:13 +08:00
)
{
int i;
for ( i = 0; a[i] != NULL; i++ ) {
if ( strcasecmp( s, a[i] ) == 0 ) {
return( 1 );
}
}
return( 0 );
}
char **
1999-08-21 03:50:11 +08:00
charray_dup( char **a )
1998-08-09 08:43:13 +08:00
{
int i;
char **new;
for ( i = 0; a[i] != NULL; i++ )
; /* NULL */
new = (char **) ch_malloc( (i + 1) * sizeof(char *) );
for ( i = 0; a[i] != NULL; i++ ) {
new[i] = ch_strdup( a[i] );
1998-08-09 08:43:13 +08:00
}
new[i] = NULL;
return( new );
}
char *
1999-08-21 03:50:11 +08:00
charray2str( char **a )
{
char *s;
int i;
size_t cur, len = 0;
if( a == NULL ) return NULL;
for( i=0 ; a[i] != NULL ; i++ ) {
len += strlen( a[i] );
}
if( len == 0 ) return NULL;
s = ch_malloc( len + 1 );
cur = 0;
for( i=0 ; a[i] != NULL ; i++ ) {
len = strlen( a[i] );
strncpy( &s[cur], a[i], len );
cur += len;
}
s[len] = '\0';
return s;
}
1998-08-09 08:43:13 +08:00
char **
1999-08-21 03:00:44 +08:00
str2charray( const char *str_in, const char *brkstr )
1998-08-09 08:43:13 +08:00
{
1999-08-21 03:00:44 +08:00
char *str;
1998-08-09 08:43:13 +08:00
char **res;
char *s;
char *lasts;
1998-08-09 08:43:13 +08:00
int i;
/* protect the input string from strtok */
1999-08-21 03:00:44 +08:00
str = ch_strdup( str_in );
1998-08-09 08:43:13 +08:00
i = 1;
for ( s = str; *s; s++ ) {
if ( strchr( brkstr, *s ) != NULL ) {
i++;
}
}
res = (char **) ch_malloc( (i + 1) * sizeof(char *) );
i = 0;
1999-01-02 04:43:29 +08:00
for ( s = ldap_pvt_strtok( str, brkstr, &lasts );
s != NULL;
s = ldap_pvt_strtok( NULL, brkstr, &lasts ) )
{
res[i++] = ch_strdup( s );
1998-08-09 08:43:13 +08:00
}
1999-01-02 04:43:29 +08:00
1998-08-09 08:43:13 +08:00
res[i] = NULL;
free( str );
1998-08-09 08:43:13 +08:00
return( res );
}