1 /* entry.c - routines for dealing with entries */
4 * Copyright 1998-1999 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)
43 struct berval *vals[2];
47 * LDIF is used as the string format.
48 * An entry looks like this:
51 * [<attr>:[:] <value>\n]
52 * [<tab><continuedvalue>\n]*
55 * If a double colon is used after a type, it means the
56 * following value is encoded as a base 64 string. This
57 * happens if the value contains a non-printing character
61 Debug( LDAP_DEBUG_TRACE, "=> str2entry\n",
62 s ? s : "NULL", 0, 0 );
66 /* initialize reader/writer lock */
67 e = (Entry *) ch_malloc( sizeof(Entry) );
70 Debug( LDAP_DEBUG_TRACE,
71 "<= str2entry NULL (entry allocation failed)\n",
76 /* initialize entry */
88 while ( (s = ldif_getline( &next )) != NULL ) {
89 if ( *s == '\n' || *s == '\0' ) {
93 if ( ldif_parse_line( s, &type, &value, &vlen ) != 0 ) {
94 Debug( LDAP_DEBUG_TRACE,
95 "<= str2entry NULL (parse_line)\n", 0, 0, 0 );
99 if ( strcasecmp( type, ptype ) != 0 ) {
100 strncpy( ptype, type, sizeof(ptype) - 1 );
106 if ( strcasecmp( type, "dn" ) == 0 ) {
109 if ( e->e_dn != NULL ) {
110 Debug( LDAP_DEBUG_ANY,
111 "str2entry: entry %ld has multiple dns \"%s\" and \"%s\" (second ignored)\n",
113 value != NULL ? value : NULL );
114 if( value != NULL ) free( value );
117 e->e_dn = value != NULL ? value : ch_strdup( "" );
123 #ifdef SLAPD_SCHEMA_NOT_COMPAT
124 /* not yet implemented */
126 if ( attr_merge_fast( e, type, vals, nvals, 1, &maxvals, &a )
128 Debug( LDAP_DEBUG_TRACE,
129 "<= str2entry NULL (attr_merge)\n", 0, 0, 0 );
142 /* check to make sure there was a dn: line */
143 if ( e->e_dn == NULL ) {
144 Debug( LDAP_DEBUG_ANY, "str2entry: entry %ld has no dn\n",
150 /* generate normalized dn */
151 e->e_ndn = ch_strdup( e->e_dn );
152 (void) dn_normalize( e->e_ndn );
154 Debug(LDAP_DEBUG_TRACE, "<= str2entry(%s) -> %ld (0x%lx)\n",
155 e->e_dn, e->e_id, (unsigned long)e );
160 #define GRABSIZE BUFSIZ
162 #define MAKE_SPACE( n ) { \
163 while ( ecur + (n) > ebuf + emaxsize ) { \
165 offset = (int) (ecur - ebuf); \
166 ebuf = (unsigned char *) ch_realloc( (char *) ebuf, \
167 emaxsize + GRABSIZE ); \
168 emaxsize += GRABSIZE; \
169 ecur = ebuf + offset; \
183 * In string format, an entry looks like this:
185 * [<attr>: <value>\n]*
191 if ( e->e_dn != NULL ) {
193 tmplen = strlen( e->e_dn );
194 MAKE_SPACE( LDIF_SIZE_NEEDED( 2, tmplen ));
195 ldif_sput( (char **) &ecur, LDIF_PUT_VALUE, "dn", e->e_dn, tmplen );
198 /* put the attributes */
199 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
200 /* put "<type>:[:] <value>" line for each value */
201 for ( i = 0; a->a_vals[i] != NULL; i++ ) {
203 #ifdef SLAPD_SCHEMA_NOT_COMPAT
204 tmplen = a->a_desc->ad_cname->bv_len;
206 tmplen = strlen( a->a_type );
208 MAKE_SPACE( LDIF_SIZE_NEEDED( tmplen, bv->bv_len ));
209 ldif_sput( (char **) &ecur, LDIF_PUT_VALUE,
210 #ifdef SLAPD_SCHEMA_NOT_COMPAT
211 a->a_desc->ad_cname->bv_val,
215 bv->bv_val, bv->bv_len );
222 return( (char *) ebuf );
226 entry_free( Entry *e )
230 if ( e->e_dn != NULL ) {
234 if ( e->e_ndn != NULL ) {
238 for ( a = e->e_attrs; a != NULL; a = next ) {
248 * These routines are used only by Backend.
250 * the Entry has three entry points (ways to find things):
252 * by entry e.g., if you already have an entry from the cache
253 * and want to delete it. (really by entry ptr)
254 * by dn e.g., when looking for the base object of a search
255 * by id e.g., for search candidates
257 * these correspond to three different avl trees that are maintained.
261 entry_cmp( Entry *e1, Entry *e2 )
263 return( e1 < e2 ? -1 : (e1 > e2 ? 1 : 0) );
267 entry_dn_cmp( Entry *e1, Entry *e2 )
269 /* compare their normalized UPPERCASED dn's */
270 return( strcmp( e1->e_ndn, e2->e_ndn ) );
274 entry_id_cmp( Entry *e1, Entry *e2 )
276 return( e1->e_id < e2->e_id ? -1 : (e1->e_id > e2->e_id ? 1 : 0) );