1998-08-09 08:43:13 +08:00
|
|
|
/* entry.c - routines for dealing with entries */
|
1999-09-09 03:06:24 +08:00
|
|
|
/* $OpenLDAP$ */
|
1999-08-07 07:07:46 +08:00
|
|
|
/*
|
2003-01-04 04:20:47 +08:00
|
|
|
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
1999-08-07 07:07:46 +08:00
|
|
|
* 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/ctype.h>
|
1999-02-05 02:00:50 +08:00
|
|
|
#include <ac/errno.h>
|
1998-10-25 09:41:42 +08:00
|
|
|
#include <ac/socket.h>
|
|
|
|
#include <ac/string.h>
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
#include "slap.h"
|
2001-09-25 08:03:24 +08:00
|
|
|
#include "ldif.h"
|
1998-08-09 08:43:13 +08:00
|
|
|
|
2001-01-18 00:35:53 +08:00
|
|
|
static unsigned char *ebuf; /* buf returned by entry2str */
|
1998-08-09 08:43:13 +08:00
|
|
|
static unsigned char *ecur; /* pointer to end of currently used ebuf */
|
2001-01-18 00:35:53 +08:00
|
|
|
static int emaxsize;/* max size of ebuf */
|
1998-08-09 08:43:13 +08:00
|
|
|
|
2001-11-17 01:05:32 +08:00
|
|
|
/*
|
|
|
|
* Empty root entry
|
|
|
|
*/
|
2003-02-26 06:49:41 +08:00
|
|
|
const Entry slap_entry_root = {
|
|
|
|
NOID, { 0, "" }, { 0, "" }, NULL, 0, { 0, "" }, NULL
|
|
|
|
};
|
2001-11-17 01:05:32 +08:00
|
|
|
|
1999-08-20 01:06:28 +08:00
|
|
|
int entry_destroy(void)
|
|
|
|
{
|
2001-12-31 14:44:36 +08:00
|
|
|
if ( ebuf ) free( ebuf );
|
1999-08-20 01:06:28 +08:00
|
|
|
ebuf = NULL;
|
|
|
|
ecur = NULL;
|
|
|
|
emaxsize = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2000-05-19 08:33:39 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
Entry *
|
1999-08-18 03:00:59 +08:00
|
|
|
str2entry( char *s )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
2000-05-19 08:33:39 +08:00
|
|
|
int rc;
|
1998-08-09 08:43:13 +08:00
|
|
|
Entry *e;
|
|
|
|
char *type;
|
2002-01-02 19:00:36 +08:00
|
|
|
struct berval vals[2];
|
2003-02-26 08:48:37 +08:00
|
|
|
struct berval nvals[2], *nvalsp;
|
2000-05-19 08:33:39 +08:00
|
|
|
AttributeDescription *ad;
|
2000-05-22 11:46:57 +08:00
|
|
|
const char *text;
|
2000-05-19 08:33:39 +08:00
|
|
|
char *next;
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
/*
|
1999-08-18 03:00:59 +08:00
|
|
|
* LDIF is used as the string format.
|
|
|
|
* An entry looks like this:
|
1998-08-09 08:43:13 +08:00
|
|
|
*
|
|
|
|
* dn: <dn>\n
|
|
|
|
* [<attr>:[:] <value>\n]
|
|
|
|
* [<tab><continuedvalue>\n]*
|
|
|
|
* ...
|
|
|
|
*
|
|
|
|
* If a double colon is used after a type, it means the
|
|
|
|
* following value is encoded as a base 64 string. This
|
|
|
|
* happens if the value contains a non-printing character
|
|
|
|
* or newline.
|
|
|
|
*/
|
|
|
|
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1, "str2entry: \"%s\"\n", s ? s : "NULL", 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
1998-09-21 04:22:46 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE, "=> str2entry\n",
|
|
|
|
s ? s : "NULL", 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1998-12-27 11:55:57 +08:00
|
|
|
/* initialize reader/writer lock */
|
2002-01-19 12:28:07 +08:00
|
|
|
e = (Entry *) ch_calloc( 1, sizeof(Entry) );
|
1999-01-13 09:17:22 +08:00
|
|
|
|
|
|
|
if( e == NULL ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, ERR, "str2entry: entry allocation failed.\n", 0, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-10-10 14:34:58 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
1999-01-13 09:17:22 +08:00
|
|
|
"<= str2entry NULL (entry allocation failed)\n",
|
|
|
|
0, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
1999-01-13 09:17:22 +08:00
|
|
|
return( NULL );
|
|
|
|
}
|
|
|
|
|
1999-09-24 04:54:41 +08:00
|
|
|
/* initialize entry */
|
1999-08-18 03:00:59 +08:00
|
|
|
e->e_id = NOID;
|
1998-12-27 11:55:57 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
/* dn + attributes */
|
2003-02-26 08:48:37 +08:00
|
|
|
vals[1].bv_len = 0;
|
2002-01-02 19:00:36 +08:00
|
|
|
vals[1].bv_val = NULL;
|
1999-09-24 04:54:41 +08:00
|
|
|
|
2000-05-19 08:33:39 +08:00
|
|
|
next = s;
|
1998-12-21 06:28:33 +08:00
|
|
|
while ( (s = ldif_getline( &next )) != NULL ) {
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( *s == '\n' || *s == '\0' ) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2002-01-02 19:00:36 +08:00
|
|
|
if ( ldif_parse_line( s, &type, &vals[0].bv_val, &vals[0].bv_len ) != 0 ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1, "str2entry: NULL (parse_line)\n",0, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
1998-08-09 08:43:13 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
|
|
"<= str2entry NULL (parse_line)\n", 0, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
1998-08-09 08:43:13 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( strcasecmp( type, "dn" ) == 0 ) {
|
1999-08-20 02:16:04 +08:00
|
|
|
free( type );
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( e->e_dn != NULL ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1, "str2entry: "
|
2001-12-24 12:03:27 +08:00
|
|
|
"entry %ld has multiple DNs \"%s\" and \"%s\"\n",
|
2002-12-03 06:46:07 +08:00
|
|
|
(long) e->e_id, e->e_dn, vals[0].bv_val );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2001-10-06 02:38:25 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY, "str2entry: "
|
2001-12-24 12:03:27 +08:00
|
|
|
"entry %ld has multiple DNs \"%s\" and \"%s\"\n",
|
2002-12-03 06:46:07 +08:00
|
|
|
(long) e->e_id, e->e_dn, vals[0].bv_val );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2002-12-03 06:46:07 +08:00
|
|
|
free( vals[0].bv_val );
|
2001-12-23 08:43:57 +08:00
|
|
|
entry_free( e );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2003-04-11 09:29:28 +08:00
|
|
|
rc = dnPrettyNormal( NULL, &vals[0], &e->e_name, &e->e_nname, NULL );
|
2001-12-23 08:43:57 +08:00
|
|
|
if( rc != LDAP_SUCCESS ) {
|
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1,
|
|
|
|
"str2entry: entry %ld has invalid DN \"%s\"\n",
|
|
|
|
(long) e->e_id, vals[0].bv_val, 0 );
|
2001-12-23 08:43:57 +08:00
|
|
|
#else
|
|
|
|
Debug( LDAP_DEBUG_ANY, "str2entry: "
|
|
|
|
"entry %ld has invalid DN \"%s\"\n",
|
2002-05-16 23:45:24 +08:00
|
|
|
(long) e->e_id, vals[0].bv_val, 0 );
|
2001-12-23 08:43:57 +08:00
|
|
|
#endif
|
|
|
|
entry_free( e );
|
2002-05-16 23:45:24 +08:00
|
|
|
free( vals[0].bv_val );
|
2001-12-23 08:43:57 +08:00
|
|
|
return NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
2002-05-16 23:45:24 +08:00
|
|
|
free( vals[0].bv_val );
|
1998-08-09 08:43:13 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2000-05-19 08:33:39 +08:00
|
|
|
ad = NULL;
|
|
|
|
rc = slap_str2ad( type, &ad, &text );
|
|
|
|
|
|
|
|
if( rc != LDAP_SUCCESS ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1,
|
|
|
|
"str2entry: str2ad(%s): %s\n", type, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-10-10 14:34:58 +08:00
|
|
|
Debug( slapMode & SLAP_TOOL_MODE
|
|
|
|
? LDAP_DEBUG_ANY : LDAP_DEBUG_TRACE,
|
2000-07-03 01:16:18 +08:00
|
|
|
"<= str2entry: str2ad(%s): %s\n", type, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2000-09-17 06:47:29 +08:00
|
|
|
if( slapMode & SLAP_TOOL_MODE ) {
|
|
|
|
entry_free( e );
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
2000-09-17 06:47:29 +08:00
|
|
|
free( type );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2000-07-03 01:16:18 +08:00
|
|
|
rc = slap_str2undef_ad( type, &ad, &text );
|
|
|
|
if( rc != LDAP_SUCCESS ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1,
|
|
|
|
"str2entry: str2undef_ad(%s): %s\n", type, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-10-10 14:34:58 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
2000-07-03 01:16:18 +08:00
|
|
|
"<= str2entry: str2undef_ad(%s): %s\n",
|
|
|
|
type, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2000-07-03 01:16:18 +08:00
|
|
|
entry_free( e );
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
2000-07-03 01:16:18 +08:00
|
|
|
free( type );
|
2000-09-17 06:47:29 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if( slapMode & SLAP_TOOL_MODE ) {
|
2001-12-29 23:01:10 +08:00
|
|
|
struct berval pval;
|
2000-09-17 06:47:29 +08:00
|
|
|
slap_syntax_validate_func *validate =
|
|
|
|
ad->ad_type->sat_syntax->ssyn_validate;
|
2001-12-06 05:36:59 +08:00
|
|
|
slap_syntax_transform_func *pretty =
|
|
|
|
ad->ad_type->sat_syntax->ssyn_pretty;
|
2000-09-17 06:47:29 +08:00
|
|
|
|
2001-12-06 05:36:59 +08:00
|
|
|
if( pretty ) {
|
|
|
|
rc = pretty( ad->ad_type->sat_syntax,
|
2003-04-11 09:29:28 +08:00
|
|
|
&vals[0], &pval, NULL );
|
2001-12-06 05:36:59 +08:00
|
|
|
|
|
|
|
} else if( validate ) {
|
|
|
|
/*
|
|
|
|
* validate value per syntax
|
|
|
|
*/
|
2002-01-02 19:00:36 +08:00
|
|
|
rc = validate( ad->ad_type->sat_syntax, &vals[0] );
|
2001-12-06 05:36:59 +08:00
|
|
|
|
|
|
|
} else {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, INFO,
|
2001-12-25 04:07:19 +08:00
|
|
|
"str2entry: no validator for syntax %s\n",
|
2002-07-12 04:33:24 +08:00
|
|
|
ad->ad_type->sat_syntax->ssyn_oid, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-09-17 06:47:29 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
|
|
|
"str2entry: no validator for syntax %s\n",
|
|
|
|
ad->ad_type->sat_syntax->ssyn_oid, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2000-09-17 06:47:29 +08:00
|
|
|
entry_free( e );
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
2000-09-17 06:47:29 +08:00
|
|
|
free( type );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( rc != 0 ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, ERR,
|
2003-04-24 18:18:05 +08:00
|
|
|
"str2entry: invalid value for attribute %s (syntax %s)\n",
|
|
|
|
ad->ad_cname.bv_val, ad->ad_type->sat_syntax->ssyn_oid, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-10-10 14:34:58 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
2003-04-24 18:18:05 +08:00
|
|
|
"str2entry: invalid value for attribute %s (syntax %s)\n",
|
|
|
|
ad->ad_cname.bv_val, ad->ad_type->sat_syntax->ssyn_oid, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2000-09-17 06:47:29 +08:00
|
|
|
entry_free( e );
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
2000-09-17 06:47:29 +08:00
|
|
|
free( type );
|
|
|
|
return NULL;
|
2000-07-03 01:16:18 +08:00
|
|
|
}
|
2001-12-06 05:36:59 +08:00
|
|
|
|
|
|
|
if( pretty ) {
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
|
|
|
vals[0] = pval;
|
2001-12-06 05:36:59 +08:00
|
|
|
}
|
2000-05-19 08:33:39 +08:00
|
|
|
}
|
|
|
|
|
2003-02-26 08:48:37 +08:00
|
|
|
nvalsp = NULL;
|
|
|
|
nvals[0].bv_val = NULL;
|
|
|
|
|
|
|
|
if( ad->ad_type->sat_equality &&
|
2003-02-27 09:54:43 +08:00
|
|
|
ad->ad_type->sat_equality->smr_normalize )
|
2003-02-26 08:48:37 +08:00
|
|
|
{
|
2003-02-27 09:54:43 +08:00
|
|
|
rc = ad->ad_type->sat_equality->smr_normalize(
|
|
|
|
SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
|
2003-02-26 06:49:41 +08:00
|
|
|
ad->ad_type->sat_syntax,
|
2003-02-27 09:54:43 +08:00
|
|
|
ad->ad_type->sat_equality,
|
2003-04-11 09:29:28 +08:00
|
|
|
&vals[0], &nvals[0], NULL );
|
2003-02-26 06:49:41 +08:00
|
|
|
|
|
|
|
if( rc ) {
|
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG( OPERATION, DETAIL1,
|
2003-02-27 09:54:43 +08:00
|
|
|
"str2entry: NULL (smr_normalize %d)\n" , rc, 0, 0 );
|
2003-02-26 06:49:41 +08:00
|
|
|
#else
|
|
|
|
Debug( LDAP_DEBUG_ANY,
|
2003-02-27 09:54:43 +08:00
|
|
|
"<= str2entry NULL (smr_normalize %d)\n", rc, 0, 0 );
|
2003-02-26 09:09:20 +08:00
|
|
|
#endif
|
2003-02-26 06:49:41 +08:00
|
|
|
|
|
|
|
entry_free( e );
|
|
|
|
free( vals[0].bv_val );
|
|
|
|
free( type );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2003-02-26 08:48:37 +08:00
|
|
|
nvals[1].bv_len = 0;
|
|
|
|
nvals[1].bv_val = NULL;
|
2003-02-26 06:49:41 +08:00
|
|
|
|
2003-02-26 08:48:37 +08:00
|
|
|
nvalsp = &nvals[0];
|
|
|
|
}
|
2003-02-26 05:08:48 +08:00
|
|
|
|
2003-02-26 08:48:37 +08:00
|
|
|
rc = attr_merge( e, ad, vals, nvalsp );
|
2000-05-19 08:33:39 +08:00
|
|
|
if( rc != 0 ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1,
|
|
|
|
"str2entry: NULL (attr_merge)\n" , 0, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-10-10 14:34:58 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
1998-08-09 08:43:13 +08:00
|
|
|
"<= str2entry NULL (attr_merge)\n", 0, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
1998-12-27 11:55:57 +08:00
|
|
|
entry_free( e );
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
1999-08-20 02:16:04 +08:00
|
|
|
free( type );
|
1998-08-09 08:43:13 +08:00
|
|
|
return( NULL );
|
|
|
|
}
|
1999-08-20 02:16:04 +08:00
|
|
|
|
|
|
|
free( type );
|
2002-01-02 19:00:36 +08:00
|
|
|
free( vals[0].bv_val );
|
2003-02-26 05:08:48 +08:00
|
|
|
free( nvals[0].bv_val );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* check to make sure there was a dn: line */
|
|
|
|
if ( e->e_dn == NULL ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, INFO,
|
|
|
|
"str2entry: entry %ld has no dn.\n", (long) e->e_id, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
1999-02-12 02:19:52 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY, "str2entry: entry %ld has no dn\n",
|
2001-10-06 02:38:25 +08:00
|
|
|
(long) e->e_id, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
1998-08-09 08:43:13 +08:00
|
|
|
entry_free( e );
|
2003-02-26 06:49:41 +08:00
|
|
|
return NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL2,
|
|
|
|
"str2entry(%s) -> 0x%lx\n", e->e_dn, (unsigned long)e, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-09-12 12:57:56 +08:00
|
|
|
Debug(LDAP_DEBUG_TRACE, "<= str2entry(%s) -> 0x%lx\n",
|
|
|
|
e->e_dn, (unsigned long) e, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
1998-08-09 08:43:13 +08:00
|
|
|
return( e );
|
|
|
|
}
|
|
|
|
|
2000-05-19 08:33:39 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
#define GRABSIZE BUFSIZ
|
|
|
|
|
|
|
|
#define MAKE_SPACE( n ) { \
|
|
|
|
while ( ecur + (n) > ebuf + emaxsize ) { \
|
1999-09-15 11:26:23 +08:00
|
|
|
ptrdiff_t offset; \
|
1998-08-09 08:43:13 +08:00
|
|
|
offset = (int) (ecur - ebuf); \
|
|
|
|
ebuf = (unsigned char *) ch_realloc( (char *) ebuf, \
|
|
|
|
emaxsize + GRABSIZE ); \
|
|
|
|
emaxsize += GRABSIZE; \
|
|
|
|
ecur = ebuf + offset; \
|
|
|
|
} \
|
2000-02-23 04:25:54 +08:00
|
|
|
}
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
char *
|
|
|
|
entry2str(
|
|
|
|
Entry *e,
|
1999-08-18 03:00:59 +08:00
|
|
|
int *len )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
|
|
|
Attribute *a;
|
|
|
|
struct berval *bv;
|
2001-12-25 01:24:18 +08:00
|
|
|
int i;
|
|
|
|
ber_len_t tmplen;
|
1998-08-09 08:43:13 +08:00
|
|
|
|
2002-06-20 06:04:28 +08:00
|
|
|
assert( e != NULL );
|
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
/*
|
|
|
|
* In string format, an entry looks like this:
|
|
|
|
* dn: <dn>\n
|
|
|
|
* [<attr>: <value>\n]*
|
|
|
|
*/
|
|
|
|
|
|
|
|
ecur = ebuf;
|
|
|
|
|
|
|
|
/* put the dn */
|
|
|
|
if ( e->e_dn != NULL ) {
|
|
|
|
/* put "dn: <dn>" */
|
2001-12-25 01:24:18 +08:00
|
|
|
tmplen = e->e_name.bv_len;
|
1998-08-09 08:43:13 +08:00
|
|
|
MAKE_SPACE( LDIF_SIZE_NEEDED( 2, tmplen ));
|
1999-07-31 07:00:02 +08:00
|
|
|
ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, "dn", e->e_dn, tmplen );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* put the attributes */
|
|
|
|
for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
|
|
|
|
/* put "<type>:[:] <value>" line for each value */
|
2002-01-02 19:00:36 +08:00
|
|
|
for ( i = 0; a->a_vals[i].bv_val != NULL; i++ ) {
|
|
|
|
bv = &a->a_vals[i];
|
2001-10-22 21:23:05 +08:00
|
|
|
tmplen = a->a_desc->ad_cname.bv_len;
|
1998-08-09 08:43:13 +08:00
|
|
|
MAKE_SPACE( LDIF_SIZE_NEEDED( tmplen, bv->bv_len ));
|
2000-02-05 13:01:41 +08:00
|
|
|
ldif_sput( (char **) &ecur, LDIF_PUT_VALUE,
|
2001-10-22 21:23:05 +08:00
|
|
|
a->a_desc->ad_cname.bv_val,
|
1998-08-09 08:43:13 +08:00
|
|
|
bv->bv_val, bv->bv_len );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
MAKE_SPACE( 1 );
|
|
|
|
*ecur = '\0';
|
|
|
|
*len = ecur - ebuf;
|
|
|
|
|
|
|
|
return( (char *) ebuf );
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
entry_free( Entry *e )
|
|
|
|
{
|
2001-05-04 09:02:36 +08:00
|
|
|
/* free an entry structure */
|
|
|
|
assert( e != NULL );
|
1998-08-09 08:43:13 +08:00
|
|
|
|
2001-05-04 09:02:36 +08:00
|
|
|
/* e_private must be freed by the caller */
|
|
|
|
assert( e->e_private == NULL );
|
|
|
|
e->e_private = NULL;
|
|
|
|
|
|
|
|
/* free DNs */
|
1998-08-09 08:43:13 +08:00
|
|
|
if ( e->e_dn != NULL ) {
|
|
|
|
free( e->e_dn );
|
1999-02-11 02:28:25 +08:00
|
|
|
e->e_dn = NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
1999-01-13 09:17:22 +08:00
|
|
|
if ( e->e_ndn != NULL ) {
|
|
|
|
free( e->e_ndn );
|
1999-02-11 02:28:25 +08:00
|
|
|
e->e_ndn = NULL;
|
1999-01-13 09:17:22 +08:00
|
|
|
}
|
2001-05-04 09:02:36 +08:00
|
|
|
|
2002-01-25 15:11:52 +08:00
|
|
|
if ( e->e_bv.bv_val != NULL ) {
|
|
|
|
free( e->e_bv.bv_val );
|
|
|
|
e->e_bv.bv_val = NULL;
|
|
|
|
}
|
|
|
|
|
2001-05-04 09:02:36 +08:00
|
|
|
/* free attributes */
|
|
|
|
attrs_free( e->e_attrs );
|
1999-02-11 02:28:25 +08:00
|
|
|
e->e_attrs = NULL;
|
2001-05-04 09:02:36 +08:00
|
|
|
|
1998-08-09 08:43:13 +08:00
|
|
|
free( e );
|
|
|
|
}
|
1998-09-21 04:22:46 +08:00
|
|
|
|
1999-02-12 01:46:56 +08:00
|
|
|
/*
|
|
|
|
* These routines are used only by Backend.
|
|
|
|
*
|
|
|
|
* the Entry has three entry points (ways to find things):
|
|
|
|
*
|
2001-01-18 00:35:53 +08:00
|
|
|
* by entry e.g., if you already have an entry from the cache
|
1999-02-12 01:46:56 +08:00
|
|
|
* and want to delete it. (really by entry ptr)
|
|
|
|
* by dn e.g., when looking for the base object of a search
|
|
|
|
* by id e.g., for search candidates
|
|
|
|
*
|
|
|
|
* these correspond to three different avl trees that are maintained.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
|
|
|
entry_cmp( Entry *e1, Entry *e2 )
|
|
|
|
{
|
2003-04-19 01:16:48 +08:00
|
|
|
return SLAP_PTRCMP( e1, e2 );
|
1999-02-12 01:46:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2002-12-15 06:25:52 +08:00
|
|
|
entry_dn_cmp( const void *v_e1, const void *v_e2 )
|
1999-02-12 01:46:56 +08:00
|
|
|
{
|
|
|
|
/* compare their normalized UPPERCASED dn's */
|
2002-12-15 06:25:52 +08:00
|
|
|
const Entry *e1 = v_e1, *e2 = v_e2;
|
2003-04-19 01:16:48 +08:00
|
|
|
|
|
|
|
return ber_bvcmp( &e1->e_nname, &e2->e_nname );
|
1999-02-12 01:46:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2002-12-15 06:25:52 +08:00
|
|
|
entry_id_cmp( const void *v_e1, const void *v_e2 )
|
1999-02-12 01:46:56 +08:00
|
|
|
{
|
2002-12-15 06:25:52 +08:00
|
|
|
const Entry *e1 = v_e1, *e2 = v_e2;
|
1999-02-12 01:46:56 +08:00
|
|
|
return( e1->e_id < e2->e_id ? -1 : (e1->e_id > e2->e_id ? 1 : 0) );
|
|
|
|
}
|
|
|
|
|
2003-04-11 09:29:28 +08:00
|
|
|
#define entry_lenlen(l) ((l) < 0x80) ? 1 : ((l) < 0x100) ? 2 : \
|
|
|
|
((l) < 0x10000) ? 3 : ((l) < 0x1000000) ? 4 : 5
|
|
|
|
#if 0
|
2001-12-03 22:00:19 +08:00
|
|
|
/* This is like a ber_len */
|
|
|
|
static ber_len_t
|
|
|
|
entry_lenlen(ber_len_t len)
|
|
|
|
{
|
|
|
|
if (len <= 0x7f)
|
|
|
|
return 1;
|
|
|
|
if (len <= 0xff)
|
|
|
|
return 2;
|
|
|
|
if (len <= 0xffff)
|
|
|
|
return 3;
|
|
|
|
if (len <= 0xffffff)
|
|
|
|
return 4;
|
|
|
|
return 5;
|
|
|
|
}
|
2003-04-11 09:29:28 +08:00
|
|
|
#endif
|
2001-12-03 22:00:19 +08:00
|
|
|
|
|
|
|
static void
|
|
|
|
entry_putlen(unsigned char **buf, ber_len_t len)
|
|
|
|
{
|
|
|
|
ber_len_t lenlen = entry_lenlen(len);
|
|
|
|
|
|
|
|
if (lenlen == 1) {
|
|
|
|
**buf = (unsigned char) len;
|
|
|
|
} else {
|
|
|
|
int i;
|
2001-12-09 10:34:45 +08:00
|
|
|
**buf = 0x80 | ((unsigned char) lenlen - 1);
|
2001-12-03 22:00:19 +08:00
|
|
|
for (i=lenlen-1; i>0; i--) {
|
|
|
|
(*buf)[i] = (unsigned char) len;
|
|
|
|
len >>= 8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*buf += lenlen;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ber_len_t
|
|
|
|
entry_getlen(unsigned char **buf)
|
|
|
|
{
|
|
|
|
ber_len_t len;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
len = *(*buf)++;
|
|
|
|
if (len <= 0x7f)
|
|
|
|
return len;
|
|
|
|
i = len & 0x7f;
|
|
|
|
len = 0;
|
|
|
|
for (;i > 0; i--) {
|
|
|
|
len <<= 8;
|
|
|
|
len |= *(*buf)++;
|
|
|
|
}
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
2003-04-10 14:21:53 +08:00
|
|
|
/* Add up the size of the entry for a flattened buffer */
|
|
|
|
void entry_flatsize(Entry *e, ber_len_t *psiz, ber_len_t *plen, int norm)
|
2000-09-12 12:57:56 +08:00
|
|
|
{
|
2001-12-25 01:24:18 +08:00
|
|
|
ber_len_t siz = sizeof(Entry);
|
|
|
|
ber_len_t len, dnlen, ndnlen;
|
2001-12-03 22:00:19 +08:00
|
|
|
int i;
|
|
|
|
Attribute *a;
|
2001-10-22 22:07:42 +08:00
|
|
|
|
2001-12-25 01:24:18 +08:00
|
|
|
dnlen = e->e_name.bv_len;
|
2003-04-10 14:21:53 +08:00
|
|
|
len = dnlen + 1; /* trailing NUL byte */
|
2001-12-03 22:00:19 +08:00
|
|
|
len += entry_lenlen(dnlen);
|
2003-04-10 14:21:53 +08:00
|
|
|
if (norm) {
|
|
|
|
ndnlen = e->e_nname.bv_len;
|
|
|
|
len += ndnlen + 1;
|
|
|
|
len += entry_lenlen(ndnlen);
|
|
|
|
}
|
2001-10-22 22:07:42 +08:00
|
|
|
for (a=e->e_attrs; a; a=a->a_next) {
|
|
|
|
/* For AttributeDesc, we only store the attr name */
|
|
|
|
siz += sizeof(Attribute);
|
|
|
|
len += a->a_desc->ad_cname.bv_len+1;
|
2001-12-03 22:00:19 +08:00
|
|
|
len += entry_lenlen(a->a_desc->ad_cname.bv_len);
|
2002-01-02 19:00:36 +08:00
|
|
|
for (i=0; a->a_vals[i].bv_val; i++) {
|
2001-10-22 22:07:42 +08:00
|
|
|
siz += sizeof(struct berval);
|
2002-01-02 19:00:36 +08:00
|
|
|
len += a->a_vals[i].bv_len + 1;
|
|
|
|
len += entry_lenlen(a->a_vals[i].bv_len);
|
2001-10-22 22:07:42 +08:00
|
|
|
}
|
2001-12-03 22:00:19 +08:00
|
|
|
len += entry_lenlen(i);
|
2002-01-02 19:00:36 +08:00
|
|
|
siz += sizeof(struct berval); /* empty berval at end */
|
2003-04-10 14:21:53 +08:00
|
|
|
if (norm && a->a_nvals != a->a_vals) {
|
2003-03-23 23:28:41 +08:00
|
|
|
for (i=0; a->a_nvals[i].bv_val; i++) {
|
|
|
|
siz += sizeof(struct berval);
|
|
|
|
len += a->a_nvals[i].bv_len + 1;
|
|
|
|
len += entry_lenlen(a->a_nvals[i].bv_len);
|
|
|
|
}
|
|
|
|
len += entry_lenlen(i); /* i nvals */
|
|
|
|
siz += sizeof(struct berval);
|
|
|
|
} else {
|
|
|
|
len += entry_lenlen(0); /* 0 nvals */
|
|
|
|
}
|
2000-09-12 12:57:56 +08:00
|
|
|
}
|
2001-12-03 22:00:19 +08:00
|
|
|
len += 1; /* NUL byte at end */
|
|
|
|
len += entry_lenlen(siz);
|
2003-04-10 14:21:53 +08:00
|
|
|
*psiz = siz;
|
|
|
|
*plen = len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Flatten an Entry into a buffer. The buffer is filled with just the
|
|
|
|
* strings/bervals of all the entry components. Each field is preceded
|
|
|
|
* by its length, encoded the way ber_put_len works. Every field is NUL
|
|
|
|
* terminated. The entire buffer size is precomputed so that a single
|
|
|
|
* malloc can be performed. The entry size is also recorded,
|
|
|
|
* to aid in entry_decode.
|
|
|
|
*/
|
|
|
|
int entry_encode(Entry *e, struct berval *bv)
|
|
|
|
{
|
|
|
|
ber_len_t siz = sizeof(Entry);
|
|
|
|
ber_len_t len, dnlen, ndnlen;
|
|
|
|
int i;
|
|
|
|
Attribute *a;
|
|
|
|
unsigned char *ptr;
|
|
|
|
|
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG( OPERATION, DETAIL1, "entry_encode: id: 0x%08lx \"%s\"\n",
|
|
|
|
(long) e->e_id, e->e_dn, 0 );
|
|
|
|
#else
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "=> entry_encode(0x%08lx): %s\n",
|
|
|
|
(long) e->e_id, e->e_dn, 0 );
|
|
|
|
#endif
|
|
|
|
dnlen = e->e_name.bv_len;
|
|
|
|
ndnlen = e->e_nname.bv_len;
|
|
|
|
|
|
|
|
entry_flatsize( e, &siz, &len, 1 );
|
|
|
|
|
2001-12-03 22:00:19 +08:00
|
|
|
bv->bv_len = len;
|
|
|
|
bv->bv_val = ch_malloc(len);
|
|
|
|
ptr = (unsigned char *)bv->bv_val;
|
|
|
|
entry_putlen(&ptr, siz);
|
|
|
|
entry_putlen(&ptr, dnlen);
|
2002-01-03 01:06:56 +08:00
|
|
|
AC_MEMCPY(ptr, e->e_dn, dnlen);
|
2001-10-22 22:07:42 +08:00
|
|
|
ptr += dnlen;
|
|
|
|
*ptr++ = '\0';
|
2001-12-03 22:00:19 +08:00
|
|
|
entry_putlen(&ptr, ndnlen);
|
2002-01-03 01:06:56 +08:00
|
|
|
AC_MEMCPY(ptr, e->e_ndn, ndnlen);
|
2001-10-22 23:01:35 +08:00
|
|
|
ptr += ndnlen;
|
2001-10-22 22:07:42 +08:00
|
|
|
*ptr++ = '\0';
|
2001-12-03 22:00:19 +08:00
|
|
|
|
2001-10-22 22:07:42 +08:00
|
|
|
for (a=e->e_attrs; a; a=a->a_next) {
|
2001-12-03 22:00:19 +08:00
|
|
|
entry_putlen(&ptr, a->a_desc->ad_cname.bv_len);
|
2002-01-03 01:06:56 +08:00
|
|
|
AC_MEMCPY(ptr, a->a_desc->ad_cname.bv_val,
|
2001-10-22 22:07:42 +08:00
|
|
|
a->a_desc->ad_cname.bv_len);
|
|
|
|
ptr += a->a_desc->ad_cname.bv_len;
|
|
|
|
*ptr++ = '\0';
|
|
|
|
if (a->a_vals) {
|
2002-01-02 19:00:36 +08:00
|
|
|
for (i=0; a->a_vals[i].bv_val; i++);
|
2001-12-03 22:00:19 +08:00
|
|
|
entry_putlen(&ptr, i);
|
2002-01-02 19:00:36 +08:00
|
|
|
for (i=0; a->a_vals[i].bv_val; i++) {
|
|
|
|
entry_putlen(&ptr, a->a_vals[i].bv_len);
|
2003-03-23 23:28:41 +08:00
|
|
|
AC_MEMCPY(ptr, a->a_vals[i].bv_val,
|
2002-01-02 19:00:36 +08:00
|
|
|
a->a_vals[i].bv_len);
|
|
|
|
ptr += a->a_vals[i].bv_len;
|
2001-12-03 22:00:19 +08:00
|
|
|
*ptr++ = '\0';
|
2001-10-22 22:07:42 +08:00
|
|
|
}
|
2003-03-24 09:56:56 +08:00
|
|
|
if (a->a_nvals != a->a_vals) {
|
2003-03-23 23:28:41 +08:00
|
|
|
entry_putlen(&ptr, i);
|
|
|
|
for (i=0; a->a_nvals[i].bv_val; i++) {
|
|
|
|
entry_putlen(&ptr, a->a_nvals[i].bv_len);
|
|
|
|
AC_MEMCPY(ptr, a->a_nvals[i].bv_val,
|
|
|
|
a->a_nvals[i].bv_len);
|
|
|
|
ptr += a->a_nvals[i].bv_len;
|
|
|
|
*ptr++ = '\0';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
entry_putlen(&ptr, 0);
|
|
|
|
}
|
2001-10-22 22:07:42 +08:00
|
|
|
}
|
2000-09-12 12:57:56 +08:00
|
|
|
}
|
2001-12-03 22:00:19 +08:00
|
|
|
*ptr = '\0';
|
2001-10-22 22:07:42 +08:00
|
|
|
return 0;
|
|
|
|
}
|
2000-09-12 12:57:56 +08:00
|
|
|
|
2001-10-22 22:07:42 +08:00
|
|
|
/* Retrieve an Entry that was stored using entry_encode above.
|
2001-12-03 22:00:19 +08:00
|
|
|
* We malloc a single block with the size stored above for the Entry
|
2003-03-23 23:28:41 +08:00
|
|
|
* and all of its Attributes. We also must lookup the stored
|
2001-12-03 22:00:19 +08:00
|
|
|
* attribute names to get AttributeDescriptions. To detect if the
|
|
|
|
* attributes of an Entry are later modified, we note that e->e_attr
|
|
|
|
* is always a constant offset from (e).
|
2001-10-22 22:07:42 +08:00
|
|
|
*
|
|
|
|
* Note: everything is stored in a single contiguous block, so
|
|
|
|
* you can not free individual attributes or names from this
|
|
|
|
* structure. Attempting to do so will likely corrupt memory.
|
|
|
|
*/
|
|
|
|
int entry_decode(struct berval *bv, Entry **e)
|
|
|
|
{
|
2003-02-26 09:09:20 +08:00
|
|
|
int i, j, count;
|
2001-12-03 22:00:19 +08:00
|
|
|
int rc;
|
2001-10-22 22:07:42 +08:00
|
|
|
Attribute *a;
|
2001-12-03 22:00:19 +08:00
|
|
|
Entry *x;
|
2001-10-22 22:07:42 +08:00
|
|
|
const char *text;
|
|
|
|
AttributeDescription *ad;
|
2001-12-03 22:00:19 +08:00
|
|
|
unsigned char *ptr = (unsigned char *)bv->bv_val;
|
2002-01-14 09:43:17 +08:00
|
|
|
BerVarray bptr;
|
2001-12-03 22:00:19 +08:00
|
|
|
|
|
|
|
i = entry_getlen(&ptr);
|
2002-01-19 12:28:07 +08:00
|
|
|
x = ch_calloc(1, i);
|
2001-12-03 22:00:19 +08:00
|
|
|
i = entry_getlen(&ptr);
|
2003-05-02 21:29:28 +08:00
|
|
|
x->e_name.bv_val = (char *) ptr;
|
2001-12-25 01:37:22 +08:00
|
|
|
x->e_name.bv_len = i;
|
2001-12-03 22:00:19 +08:00
|
|
|
ptr += i+1;
|
|
|
|
i = entry_getlen(&ptr);
|
2003-05-02 21:29:28 +08:00
|
|
|
x->e_nname.bv_val = (char *) ptr;
|
2001-12-25 01:37:22 +08:00
|
|
|
x->e_nname.bv_len = i;
|
2001-12-03 22:00:19 +08:00
|
|
|
ptr += i+1;
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL2, "entry_decode: \"%s\"\n", x->e_dn, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-09-27 01:47:24 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
2000-09-28 07:37:10 +08:00
|
|
|
"entry_decode: \"%s\"\n",
|
2001-10-22 22:07:42 +08:00
|
|
|
x->e_dn, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2002-01-25 15:11:52 +08:00
|
|
|
x->e_bv = *bv;
|
2001-12-03 22:00:19 +08:00
|
|
|
|
|
|
|
/* A valid entry must have at least one attr, so this
|
|
|
|
* pointer can never be NULL
|
|
|
|
*/
|
|
|
|
x->e_attrs = (Attribute *)(x+1);
|
2002-01-14 09:43:17 +08:00
|
|
|
bptr = (BerVarray)x->e_attrs;
|
2001-12-03 22:00:19 +08:00
|
|
|
a = NULL;
|
|
|
|
|
2002-04-08 17:43:22 +08:00
|
|
|
while ((i = entry_getlen(&ptr))) {
|
2002-02-24 07:47:37 +08:00
|
|
|
struct berval bv;
|
|
|
|
bv.bv_len = i;
|
2003-05-02 21:29:28 +08:00
|
|
|
bv.bv_val = (char *) ptr;
|
2001-12-03 22:00:19 +08:00
|
|
|
if (a) {
|
|
|
|
a->a_next = (Attribute *)bptr;
|
|
|
|
}
|
|
|
|
a = (Attribute *)bptr;
|
2000-09-12 12:57:56 +08:00
|
|
|
ad = NULL;
|
2002-01-02 19:00:36 +08:00
|
|
|
rc = slap_bv2ad( &bv, &ad, &text );
|
2000-09-12 12:57:56 +08:00
|
|
|
|
2001-12-03 22:00:19 +08:00
|
|
|
if( rc != LDAP_SUCCESS ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, INFO,
|
|
|
|
"entry_decode: str2ad(%s): %s\n", ptr, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-09-12 12:57:56 +08:00
|
|
|
Debug( LDAP_DEBUG_TRACE,
|
2001-12-03 22:00:19 +08:00
|
|
|
"<= entry_decode: str2ad(%s): %s\n", ptr, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2002-01-02 19:00:36 +08:00
|
|
|
rc = slap_bv2undef_ad( &bv, &ad, &text );
|
2000-09-12 12:57:56 +08:00
|
|
|
|
2001-12-03 22:00:19 +08:00
|
|
|
if( rc != LDAP_SUCCESS ) {
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, INFO,
|
|
|
|
"entry_decode: str2undef_ad(%s): %s\n", ptr, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-10-10 14:34:58 +08:00
|
|
|
Debug( LDAP_DEBUG_ANY,
|
2000-09-28 07:37:10 +08:00
|
|
|
"<= entry_decode: str2undef_ad(%s): %s\n",
|
2001-12-03 22:00:19 +08:00
|
|
|
ptr, text, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2001-12-03 22:00:19 +08:00
|
|
|
return rc;
|
2000-09-12 12:57:56 +08:00
|
|
|
}
|
|
|
|
}
|
2001-12-03 22:00:19 +08:00
|
|
|
ptr += i + 1;
|
2001-10-22 22:07:42 +08:00
|
|
|
a->a_desc = ad;
|
2002-01-14 09:43:17 +08:00
|
|
|
bptr = (BerVarray)(a+1);
|
2001-12-03 22:00:19 +08:00
|
|
|
a->a_vals = bptr;
|
2002-01-14 07:23:23 +08:00
|
|
|
a->a_flags = 0;
|
2003-02-26 09:09:20 +08:00
|
|
|
count = j = entry_getlen(&ptr);
|
2001-12-03 22:00:19 +08:00
|
|
|
|
|
|
|
while (j) {
|
|
|
|
i = entry_getlen(&ptr);
|
2002-01-02 19:00:36 +08:00
|
|
|
bptr->bv_len = i;
|
|
|
|
bptr->bv_val = (char *)ptr;
|
2001-12-03 22:00:19 +08:00
|
|
|
ptr += i+1;
|
|
|
|
bptr++;
|
|
|
|
j--;
|
2000-09-12 12:57:56 +08:00
|
|
|
}
|
2002-01-02 19:52:06 +08:00
|
|
|
bptr->bv_val = NULL;
|
|
|
|
bptr->bv_len = 0;
|
|
|
|
bptr++;
|
2003-02-26 09:09:20 +08:00
|
|
|
|
2003-03-23 23:28:41 +08:00
|
|
|
j = entry_getlen(&ptr);
|
|
|
|
if (j) {
|
|
|
|
a->a_nvals = bptr;
|
|
|
|
while (j) {
|
|
|
|
i = entry_getlen(&ptr);
|
|
|
|
bptr->bv_len = i;
|
|
|
|
bptr->bv_val = (char *)ptr;
|
|
|
|
ptr += i+1;
|
|
|
|
bptr++;
|
|
|
|
j--;
|
|
|
|
}
|
|
|
|
bptr->bv_val = NULL;
|
|
|
|
bptr->bv_len = 0;
|
|
|
|
bptr++;
|
|
|
|
} else {
|
2003-03-24 09:56:56 +08:00
|
|
|
a->a_nvals = a->a_vals;
|
2003-03-23 23:28:41 +08:00
|
|
|
}
|
2000-09-12 12:57:56 +08:00
|
|
|
}
|
2003-02-26 09:09:20 +08:00
|
|
|
|
|
|
|
if (a) a->a_next = NULL;
|
2001-01-16 03:17:29 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( OPERATION, DETAIL1, "entry_decode: %s\n", x->e_dn, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#else
|
2000-09-28 07:37:10 +08:00
|
|
|
Debug(LDAP_DEBUG_TRACE, "<= entry_decode(%s)\n",
|
2001-10-22 22:07:42 +08:00
|
|
|
x->e_dn, 0, 0 );
|
2001-01-16 03:17:29 +08:00
|
|
|
#endif
|
2001-10-22 22:07:42 +08:00
|
|
|
*e = x;
|
|
|
|
return 0;
|
2000-09-12 12:57:56 +08:00
|
|
|
}
|
2003-10-08 08:48:33 +08:00
|
|
|
|
|
|
|
Entry *entry_dup( Entry *e )
|
|
|
|
{
|
|
|
|
Entry *ret;
|
|
|
|
|
|
|
|
ret = (Entry *)ch_calloc( 1, sizeof(*ret) );
|
|
|
|
|
|
|
|
ret->e_id = e->e_id;
|
|
|
|
ber_dupbv( &ret->e_name, &e->e_name );
|
|
|
|
ber_dupbv( &ret->e_nname, &e->e_nname );
|
|
|
|
ret->e_attrs = attrs_dup( e->e_attrs );
|
|
|
|
ret->e_ocflags = e->e_ocflags;
|
2003-10-08 14:40:16 +08:00
|
|
|
ret->e_bv.bv_val = NULL;
|
|
|
|
ret->e_bv.bv_len = 0;
|
2003-10-08 08:48:33 +08:00
|
|
|
ret->e_private = NULL;
|
2003-10-18 23:07:51 +08:00
|
|
|
|
|
|
|
return ret;
|
2003-10-08 08:48:33 +08:00
|
|
|
}
|
|
|
|
|