1 /* entry.c - routines for dealing with entries */
4 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
14 #include <ac/socket.h>
15 #include <ac/string.h>
19 static unsigned char *ebuf; /* buf returned by entry2str */
20 static unsigned char *ecur; /* pointer to end of currently used ebuf */
21 static int emaxsize;/* max size of ebuf */
23 int entry_destroy(void)
44 struct berval *vals[2];
48 * LDIF is used as the string format.
49 * An entry looks like this:
52 * [<attr>:[:] <value>\n]
53 * [<tab><continuedvalue>\n]*
56 * If a double colon is used after a type, it means the
57 * following value is encoded as a base 64 string. This
58 * happens if the value contains a non-printing character
62 Debug( LDAP_DEBUG_TRACE, "=> str2entry\n",
63 s ? s : "NULL", 0, 0 );
67 /* initialize reader/writer lock */
68 e = (Entry *) ch_malloc( sizeof(Entry) );
71 Debug( LDAP_DEBUG_TRACE,
72 "<= str2entry NULL (entry allocation failed)\n",
77 /* initialize entry */
89 while ( (s = ldif_getline( &next )) != NULL ) {
90 if ( *s == '\n' || *s == '\0' ) {
94 if ( ldif_parse_line( s, &type, &value, &vlen ) != 0 ) {
95 Debug( LDAP_DEBUG_TRACE,
96 "<= str2entry NULL (parse_line)\n", 0, 0, 0 );
100 if ( strcasecmp( type, ptype ) != 0 ) {
101 strncpy( ptype, type, sizeof(ptype) - 1 );
107 if ( strcasecmp( type, "dn" ) == 0 ) {
110 if ( e->e_dn != NULL ) {
111 Debug( LDAP_DEBUG_ANY,
112 "str2entry: entry %ld has multiple dns \"%s\" and \"%s\" (second ignored)\n",
114 value != NULL ? value : NULL );
115 if( value != NULL ) free( value );
118 e->e_dn = value != NULL ? value : ch_strdup( "" );
124 #ifdef SLAPD_SCHEMA_NOT_COMPAT
125 /* not yet implemented */
127 if ( attr_merge_fast( e, type, vals, nvals, 1, &maxvals, &a )
129 Debug( LDAP_DEBUG_TRACE,
130 "<= str2entry NULL (attr_merge)\n", 0, 0, 0 );
143 /* check to make sure there was a dn: line */
144 if ( e->e_dn == NULL ) {
145 Debug( LDAP_DEBUG_ANY, "str2entry: entry %ld has no dn\n",
151 /* generate normalized dn */
152 e->e_ndn = ch_strdup( e->e_dn );
153 (void) dn_normalize( e->e_ndn );
155 Debug(LDAP_DEBUG_TRACE, "<= str2entry(%s) -> %ld (0x%lx)\n",
156 e->e_dn, e->e_id, (unsigned long)e );
161 #define GRABSIZE BUFSIZ
163 #define MAKE_SPACE( n ) { \
164 while ( ecur + (n) > ebuf + emaxsize ) { \
166 offset = (int) (ecur - ebuf); \
167 ebuf = (unsigned char *) ch_realloc( (char *) ebuf, \
168 emaxsize + GRABSIZE ); \
169 emaxsize += GRABSIZE; \
170 ecur = ebuf + offset; \
184 * In string format, an entry looks like this:
186 * [<attr>: <value>\n]*
192 if ( e->e_dn != NULL ) {
194 tmplen = strlen( e->e_dn );
195 MAKE_SPACE( LDIF_SIZE_NEEDED( 2, tmplen ));
196 ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, "dn", e->e_dn, tmplen );
199 /* put the attributes */
200 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
201 /* put "<type>:[:] <value>" line for each value */
202 for ( i = 0; a->a_vals[i] != NULL; i++ ) {
204 #ifdef SLAPD_SCHEMA_NOT_COMPAT
205 tmplen = a->a_desc->ad_cname->bv_len;
207 tmplen = strlen( a->a_type );
209 MAKE_SPACE( LDIF_SIZE_NEEDED( tmplen, bv->bv_len ));
210 ldif_sput( (char **) &ecur, LDIF_PUT_VALUE,
211 #ifdef SLAPD_SCHEMA_NOT_COMPAT
212 a->a_desc->ad_cname->bv_val,
216 bv->bv_val, bv->bv_len );
223 return( (char *) ebuf );
227 entry_free( Entry *e )
231 if ( e->e_dn != NULL ) {
235 if ( e->e_ndn != NULL ) {
239 for ( a = e->e_attrs; a != NULL; a = next ) {
249 * These routines are used only by Backend.
251 * the Entry has three entry points (ways to find things):
253 * by entry e.g., if you already have an entry from the cache
254 * and want to delete it. (really by entry ptr)
255 * by dn e.g., when looking for the base object of a search
256 * by id e.g., for search candidates
258 * these correspond to three different avl trees that are maintained.
262 entry_cmp( Entry *e1, Entry *e2 )
264 return( e1 < e2 ? -1 : (e1 > e2 ? 1 : 0) );
268 entry_dn_cmp( Entry *e1, Entry *e2 )
270 /* compare their normalized UPPERCASED dn's */
271 return( strcmp( e1->e_ndn, e2->e_ndn ) );
275 entry_id_cmp( Entry *e1, Entry *e2 )
277 return( e1->e_id < e2->e_id ? -1 : (e1->e_id > e2->e_id ? 1 : 0) );