openldap/libraries/libldap/charray.c

276 lines
4.0 KiB
C
Raw Normal View History

2003-11-26 15:16:36 +08:00
/* charray.c - routines for dealing with char * arrays */
/* $OpenLDAP$ */
2003-11-26 15:16:36 +08:00
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
2006-01-04 07:11:52 +08:00
* Copyright 1998-2006 The OpenLDAP Foundation.
2003-11-26 15:16:36 +08:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in the file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
*/
#include "portable.h"
#include <stdio.h>
#include <ac/string.h>
#include <ac/socket.h>
#include "ldap-int.h"
int
ldap_charray_add(
char ***a,
const char *s
)
{
int n;
if ( *a == NULL ) {
*a = (char **) LDAP_MALLOC( 2 * sizeof(char *) );
n = 0;
if( *a == NULL ) {
return -1;
}
} else {
char **new;
for ( n = 0; *a != NULL && (*a)[n] != NULL; n++ ) {
; /* NULL */
}
new = (char **) LDAP_REALLOC( (char *) *a,
(n + 2) * sizeof(char *) );
if( new == NULL ) {
/* caller is required to call ldap_charray_free(*a) */
return -1;
}
*a = new;
}
(*a)[n] = LDAP_STRDUP(s);
if( (*a)[n] == NULL ) {
return 1;
}
(*a)[++n] = NULL;
return 0;
}
int
ldap_charray_merge(
char ***a,
char **s
)
{
int i, n, nn;
char **aa;
for ( n = 0; *a != NULL && (*a)[n] != NULL; n++ ) {
; /* NULL */
}
for ( nn = 0; s[nn] != NULL; nn++ ) {
; /* NULL */
}
aa = (char **) LDAP_REALLOC( (char *) *a, (n + nn + 1) * sizeof(char *) );
2001-12-09 10:34:45 +08:00
if( aa == NULL ) {
return -1;
2001-12-09 10:34:45 +08:00
}
*a = aa;
for ( i = 0; i < nn; i++ ) {
(*a)[n + i] = LDAP_STRDUP(s[i]);
if( (*a)[n + i] == NULL ) {
for( --i ; i >= 0 ; i-- ) {
LDAP_FREE( (*a)[n + i] );
(*a)[n + i] = NULL;
}
return -1;
}
}
(*a)[n + nn] = NULL;
return 0;
}
void
ldap_charray_free( char **a )
{
char **p;
if ( a == NULL ) {
return;
}
for ( p = a; *p != NULL; p++ ) {
if ( *p != NULL ) {
LDAP_FREE( *p );
}
}
LDAP_FREE( (char *) a );
}
int
ldap_charray_inlist(
char **a,
const char *s
)
{
int i;
if( a == NULL ) return 0;
for ( i=0; a[i] != NULL; i++ ) {
if ( strcasecmp( s, a[i] ) == 0 ) {
return 1;
}
}
return 0;
}
char **
ldap_charray_dup( char **a )
{
int i;
char **new;
for ( i = 0; a[i] != NULL; i++ )
; /* NULL */
new = (char **) LDAP_MALLOC( (i + 1) * sizeof(char *) );
if( new == NULL ) {
return NULL;
}
for ( i = 0; a[i] != NULL; i++ ) {
new[i] = LDAP_STRDUP( a[i] );
if( new[i] == NULL ) {
for( --i ; i >= 0 ; i-- ) {
LDAP_FREE( new[i] );
}
LDAP_FREE( new );
return NULL;
}
}
new[i] = NULL;
return( new );
}
char **
ldap_str2charray( const char *str_in, const char *brkstr )
{
char **res;
char *str, *s;
char *lasts;
int i;
/* protect the input string from strtok */
str = LDAP_STRDUP( str_in );
if( str == NULL ) {
return NULL;
}
i = 1;
for ( s = str; *s; s++ ) {
if ( ldap_utf8_strchr( brkstr, s ) != NULL ) {
i++;
}
}
res = (char **) LDAP_MALLOC( (i + 1) * sizeof(char *) );
if( res == NULL ) {
LDAP_FREE( str );
return NULL;
}
i = 0;
for ( s = ldap_utf8_strtok( str, brkstr, &lasts );
s != NULL;
s = ldap_utf8_strtok( NULL, brkstr, &lasts ) )
{
res[i] = LDAP_STRDUP( s );
if(res[i] == NULL) {
for( --i ; i >= 0 ; i-- ) {
LDAP_FREE( res[i] );
}
LDAP_FREE( res );
LDAP_FREE( str );
return NULL;
}
i++;
}
res[i] = NULL;
LDAP_FREE( str );
return( res );
}
char * ldap_charray2str( char **a, const char *sep )
{
char *s, **v, *p;
2000-09-17 06:46:04 +08:00
int len;
int slen;
if( sep == NULL ) sep = " ";
slen = strlen( sep );
2000-09-17 06:46:04 +08:00
len = 0;
for ( v = a; *v != NULL; v++ ) {
2000-09-17 06:46:04 +08:00
len += strlen( *v ) + slen;
}
if ( len == 0 ) {
return NULL;
}
2000-09-17 06:46:04 +08:00
/* trim extra sep len */
len -= slen;
2000-09-17 06:46:04 +08:00
s = LDAP_MALLOC ( len + 1 );
if ( s == NULL ) {
return NULL;
}
p = s;
for ( v = a; *v != NULL; v++ ) {
if ( v != a ) {
strncpy( p, sep, slen );
p += slen;
}
len = strlen( *v );
strncpy( p, *v, len );
p += len;
}
*p = '\0';
return s;
}