X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=servers%2Fslapd%2Fentry.c;h=b0cd52e28fda5384293f95be943bee64000f0968;hb=51190984eefbdbedd47185e41ece37f72773744d;hp=d5ee966b570ad152344a50176022a9083e5173df;hpb=42e0d83cb3a1a1c5b25183f1ab74ce7edbe25de7;p=openldap diff --git a/servers/slapd/entry.c b/servers/slapd/entry.c index d5ee966b57..b0cd52e28f 100644 --- a/servers/slapd/entry.c +++ b/servers/slapd/entry.c @@ -1,37 +1,52 @@ /* entry.c - routines for dealing with entries */ +/* $OpenLDAP$ */ +/* + * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved. + * COPYING RESTRICTIONS APPLY, see COPYRIGHT file + */ + +#include "portable.h" #include -#include -#include -#include -#include -#include "slap.h" -void entry_free(); -char *entry2str(); +#include +#include +#include +#include + +#include "slap.h" static unsigned char *ebuf; /* buf returned by entry2str */ static unsigned char *ecur; /* pointer to end of currently used ebuf */ static int emaxsize;/* max size of ebuf */ +int entry_destroy(void) +{ + free( ebuf ); + ebuf = NULL; + ecur = NULL; + emaxsize = 0; + return 0; +} + Entry * -str2entry( char *s ) +str2entry( char *s ) { - int i; Entry *e; Attribute **a; char *type; char *value; char *next; - int vlen, nvals, maxvals; + ber_len_t vlen; + int nvals, maxvals; struct berval bval; struct berval *vals[2]; char ptype[64]; /* - * In string format, an entry looks like this: + * LDIF is used as the string format. + * An entry looks like this: * - * \n * dn: \n * [:[:] \n] * [\n]* @@ -43,33 +58,39 @@ str2entry( char *s ) * or newline. */ - Debug( LDAP_DEBUG_TRACE, "=> str2entry\n", s, 0, 0 ); - - e = (Entry *) ch_calloc( 1, sizeof(Entry) ); + Debug( LDAP_DEBUG_TRACE, "=> str2entry\n", + s ? s : "NULL", 0, 0 ); - /* check to see if there's an id included */ next = s; - if ( isdigit( *s ) ) { - e->e_id = atoi( s ); - if ( (s = str_getline( &next )) == NULL ) { - Debug( LDAP_DEBUG_TRACE, - "<= str2entry NULL (missing newline after id)\n", - 0, 0, 0 ); - return( NULL ); - } + + /* initialize reader/writer lock */ + e = (Entry *) ch_malloc( sizeof(Entry) ); + + if( e == NULL ) { + Debug( LDAP_DEBUG_TRACE, + "<= str2entry NULL (entry allocation failed)\n", + 0, 0, 0 ); + return( NULL ); } - /* dn + attributes */ + /* initialize entry */ + e->e_id = NOID; + e->e_dn = NULL; + e->e_ndn = NULL; e->e_attrs = NULL; + e->e_private = NULL; + + /* dn + attributes */ vals[0] = &bval; vals[1] = NULL; ptype[0] = '\0'; - while ( (s = str_getline( &next )) != NULL ) { + + while ( (s = ldif_getline( &next )) != NULL ) { if ( *s == '\n' || *s == '\0' ) { break; } - if ( str_parse_line( s, &type, &value, &vlen ) != 0 ) { + if ( ldif_parse_line( s, &type, &value, &vlen ) != 0 ) { Debug( LDAP_DEBUG_TRACE, "<= str2entry NULL (parse_line)\n", 0, 0, 0 ); continue; @@ -81,14 +102,19 @@ str2entry( char *s ) maxvals = 0; a = NULL; } + if ( strcasecmp( type, "dn" ) == 0 ) { + free( type ); + if ( e->e_dn != NULL ) { Debug( LDAP_DEBUG_ANY, - "str2entry: entry %d has multiple dns \"%s\" and \"%s\" (second ignored)\n", - e->e_id, e->e_dn, value ); + "str2entry: entry %ld has multiple dns \"%s\" and \"%s\" (second ignored)\n", + e->e_id, e->e_dn, + value != NULL ? value : NULL ); + if( value != NULL ) free( value ); continue; } - e->e_dn = strdup( value ); + e->e_dn = value != NULL ? value : ch_strdup( "" ); continue; } @@ -98,20 +124,32 @@ str2entry( char *s ) != 0 ) { Debug( LDAP_DEBUG_TRACE, "<= str2entry NULL (attr_merge)\n", 0, 0, 0 ); + entry_free( e ); + free( value ); + free( type ); return( NULL ); } + + free( value ); + free( type ); nvals++; } /* check to make sure there was a dn: line */ if ( e->e_dn == NULL ) { - Debug( LDAP_DEBUG_ANY, "str2entry: entry %d has no dn\n", + Debug( LDAP_DEBUG_ANY, "str2entry: entry %ld has no dn\n", e->e_id, 0, 0 ); entry_free( e ); return( NULL ); } - Debug( LDAP_DEBUG_TRACE, "<= str2entry 0x%x\n", e, 0, 0 ); + /* generate normalized dn */ + e->e_ndn = ch_strdup( e->e_dn ); + (void) dn_normalize( e->e_ndn ); + + Debug(LDAP_DEBUG_TRACE, "<= str2entry(%s) -> %ld (0x%lx)\n", + e->e_dn, e->e_id, (unsigned long)e ); + return( e ); } @@ -119,7 +157,7 @@ str2entry( char *s ) #define MAKE_SPACE( n ) { \ while ( ecur + (n) > ebuf + emaxsize ) { \ - int offset; \ + ptrdiff_t offset; \ offset = (int) (ecur - ebuf); \ ebuf = (unsigned char *) ch_realloc( (char *) ebuf, \ emaxsize + GRABSIZE ); \ @@ -131,9 +169,7 @@ str2entry( char *s ) char * entry2str( Entry *e, - int *len, - int printid -) + int *len ) { Attribute *a; struct berval *bv; @@ -148,19 +184,12 @@ entry2str( ecur = ebuf; - if ( printid ) { - /* id + newline */ - MAKE_SPACE( 10 ); - sprintf( (char *) ecur, "%ld\n", e->e_id ); - ecur = (unsigned char *) strchr( (char *) ecur, '\0' ); - } - /* put the dn */ if ( e->e_dn != NULL ) { /* put "dn: " */ tmplen = strlen( e->e_dn ); MAKE_SPACE( LDIF_SIZE_NEEDED( 2, tmplen )); - put_type_and_value( (char **) &ecur, "dn", e->e_dn, tmplen ); + ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, "dn", e->e_dn, tmplen ); } /* put the attributes */ @@ -170,7 +199,7 @@ entry2str( bv = a->a_vals[i]; tmplen = strlen( a->a_type ); MAKE_SPACE( LDIF_SIZE_NEEDED( tmplen, bv->bv_len )); - put_type_and_value( (char **) &ecur, a->a_type, + ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, a->a_type, bv->bv_val, bv->bv_len ); } } @@ -184,15 +213,54 @@ entry2str( void entry_free( Entry *e ) { - int i; Attribute *a, *next; if ( e->e_dn != NULL ) { free( e->e_dn ); + e->e_dn = NULL; + } + if ( e->e_ndn != NULL ) { + free( e->e_ndn ); + e->e_ndn = NULL; } for ( a = e->e_attrs; a != NULL; a = next ) { next = a->a_next; attr_free( a ); } + e->e_attrs = NULL; + e->e_private = NULL; free( e ); } + +/* + * These routines are used only by Backend. + * + * the Entry has three entry points (ways to find things): + * + * by entry e.g., if you already have an entry from the cache + * 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 ) +{ + return( e1 < e2 ? -1 : (e1 > e2 ? 1 : 0) ); +} + +int +entry_dn_cmp( Entry *e1, Entry *e2 ) +{ + /* compare their normalized UPPERCASED dn's */ + return( strcmp( e1->e_ndn, e2->e_ndn ) ); +} + +int +entry_id_cmp( Entry *e1, Entry *e2 ) +{ + return( e1->e_id < e2->e_id ? -1 : (e1->e_id > e2->e_id ? 1 : 0) ); +} +