1 /* entry.c - routines for dealing with entries */
3 * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
13 #include <ac/socket.h>
14 #include <ac/string.h>
18 static unsigned char *ebuf; /* buf returned by entry2str */
19 static unsigned char *ecur; /* pointer to end of currently used ebuf */
20 static int emaxsize;/* max size of ebuf */
33 struct berval *vals[2];
37 * LDIF is used as the string format.
38 * An entry looks like this:
41 * [<attr>:[:] <value>\n]
42 * [<tab><continuedvalue>\n]*
45 * If a double colon is used after a type, it means the
46 * following value is encoded as a base 64 string. This
47 * happens if the value contains a non-printing character
51 Debug( LDAP_DEBUG_TRACE, "=> str2entry\n",
52 s ? s : "NULL", 0, 0 );
56 /* initialize reader/writer lock */
57 e = (Entry *) ch_calloc( 1, sizeof(Entry) );
60 Debug( LDAP_DEBUG_TRACE,
61 "<= str2entry NULL (entry allocation failed)\n",
74 while ( (s = ldif_getline( &next )) != NULL ) {
75 if ( *s == '\n' || *s == '\0' ) {
79 if ( ldif_parse_line( s, &type, &value, &vlen ) != 0 ) {
80 Debug( LDAP_DEBUG_TRACE,
81 "<= str2entry NULL (parse_line)\n", 0, 0, 0 );
85 if ( strcasecmp( type, ptype ) != 0 ) {
86 strncpy( ptype, type, sizeof(ptype) - 1 );
92 if ( strcasecmp( type, "dn" ) == 0 ) {
93 if ( e->e_dn != NULL ) {
94 Debug( LDAP_DEBUG_ANY,
95 "str2entry: entry %ld has multiple dns \"%s\" and \"%s\" (second ignored)\n",
97 value != NULL ? value : NULL );
100 e->e_dn = ch_strdup( value != NULL ? value : "" );
102 if ( e->e_ndn != NULL ) {
103 Debug( LDAP_DEBUG_ANY,
104 "str2entry: entry %ld already has a normalized dn \"%s\" for \"%s\" (first ignored)\n",
106 value != NULL ? value : NULL );
109 e->e_ndn = ch_strdup( e->e_dn );
110 (void) dn_normalize_case( e->e_ndn );
116 if ( attr_merge_fast( e, type, vals, nvals, 1, &maxvals, &a )
118 Debug( LDAP_DEBUG_TRACE,
119 "<= str2entry NULL (attr_merge)\n", 0, 0, 0 );
126 /* check to make sure there was a dn: line */
127 if ( e->e_dn == NULL ) {
128 Debug( LDAP_DEBUG_ANY, "str2entry: entry %ld has no dn\n",
134 if ( e->e_ndn == NULL ) {
135 Debug( LDAP_DEBUG_ANY,
136 "str2entry: entry %ld (\"%s\") has no normalized dn\n",
137 e->e_id, e->e_dn, 0 );
142 Debug(LDAP_DEBUG_TRACE, "<= str2entry(%s) -> %ld (0x%lx)\n",
143 e->e_dn, e->e_id, (unsigned long)e );
148 #define GRABSIZE BUFSIZ
150 #define MAKE_SPACE( n ) { \
151 while ( ecur + (n) > ebuf + emaxsize ) { \
153 offset = (int) (ecur - ebuf); \
154 ebuf = (unsigned char *) ch_realloc( (char *) ebuf, \
155 emaxsize + GRABSIZE ); \
156 emaxsize += GRABSIZE; \
157 ecur = ebuf + offset; \
171 * In string format, an entry looks like this:
174 * [<attr>: <value>\n]*
180 if ( e->e_dn != NULL ) {
182 tmplen = strlen( e->e_dn );
183 MAKE_SPACE( LDIF_SIZE_NEEDED( 2, tmplen ));
184 ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, "dn", e->e_dn, tmplen );
187 /* put the attributes */
188 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
189 /* put "<type>:[:] <value>" line for each value */
190 for ( i = 0; a->a_vals[i] != NULL; i++ ) {
192 tmplen = strlen( a->a_type );
193 MAKE_SPACE( LDIF_SIZE_NEEDED( tmplen, bv->bv_len ));
194 ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, a->a_type,
195 bv->bv_val, bv->bv_len );
202 return( (char *) ebuf );
206 entry_free( Entry *e )
210 if ( e->e_dn != NULL ) {
214 if ( e->e_ndn != NULL ) {
218 for ( a = e->e_attrs; a != NULL; a = next ) {
228 * These routines are used only by Backend.
230 * the Entry has three entry points (ways to find things):
232 * by entry e.g., if you already have an entry from the cache
233 * and want to delete it. (really by entry ptr)
234 * by dn e.g., when looking for the base object of a search
235 * by id e.g., for search candidates
237 * these correspond to three different avl trees that are maintained.
241 entry_cmp( Entry *e1, Entry *e2 )
243 return( e1 < e2 ? -1 : (e1 > e2 ? 1 : 0) );
247 entry_dn_cmp( Entry *e1, Entry *e2 )
249 /* compare their normalized UPPERCASED dn's */
250 return( strcmp( e1->e_ndn, e2->e_ndn ) );
254 entry_id_cmp( Entry *e1, Entry *e2 )
256 return( e1->e_id < e2->e_id ? -1 : (e1->e_id > e2->e_id ? 1 : 0) );