)
{
int rc, flags;
- struct dbcache *db;
+ DBCache *db;
Datum key, data;
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
}
dn = ch_strdup( dn );
- dn_normalize_case( dn );
+ (void) dn_normalize_case( dn );
key.dptr = dn;
key.dsize = strlen( dn ) + 1;
)
{
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
- struct dbcache *db;
+ DBCache *db;
ID id;
Datum key, data;
dn = ch_strdup( dn );
Debug( LDAP_DEBUG_TRACE, "=> dn2id( \"%s\" )\n", dn, 0, 0 );
- dn_normalize_case( dn );
+ (void) dn_normalize_case( dn );
/* first check the cache */
if ( (id = cache_find_entry_dn2id( be, &li->li_cache, dn )) != NOID ) {
free( dn );
- Debug( LDAP_DEBUG_TRACE, "<= dn2id %lu (in cache)\n", id,
+ Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld (in cache)\n", id,
0, 0 );
return( id );
}
ldbm_datum_free( db->dbc_db, data );
- Debug( LDAP_DEBUG_TRACE, "<= dn2id %lu\n", id, 0, 0 );
+ Debug( LDAP_DEBUG_TRACE, "<= dn2id %ld\n", id, 0, 0 );
return( id );
}
char *dn
)
{
- struct ldbminfo *li = (struct ldbminfo *) be->be_private;
- struct dbcache *db;
+ DBCache *db;
Datum key;
int rc;
}
dn = ch_strdup( dn );
- dn_normalize_case( dn );
+ (void) dn_normalize_case( dn );
key.dptr = dn;
key.dsize = strlen( dn ) + 1;
rc = ldbm_cache_delete( db, key );
+ free( dn );
+
ldbm_cache_close( be, db );
Debug( LDAP_DEBUG_TRACE, "<= dn2id_delete %d\n", rc, 0, 0 );
* entry.
*/
-static Entry *
-dn2entry(
+Entry *
+dn2entry_rw(
Backend *be,
char *dn,
- char **matched,
+ Entry **matched,
int rw
)
{
Debug(LDAP_DEBUG_TRACE, "dn2entry_%s: dn: \"%s\"\n",
rw ? "w" : "r", dn, 0);
- *matched = NULL;
+ if( matched != NULL ) {
+ /* caller cares about match */
+ *matched = NULL;
+ }
if ( (id = dn2id( be, dn )) != NOID &&
- (e = id2entry( be, id, rw )) != NULL )
+ (e = id2entry_rw( be, id, rw )) != NULL )
{
return( e );
}
- /* stop when we get to the suffix */
- if ( be_issuffix( be, dn ) ) {
- return( NULL );
+ if ( id != NOID ) {
+ Debug(LDAP_DEBUG_ANY,
+ "dn2entry_%s: no entry for valid id (%ld), dn \"%s\"\n",
+ rw ? "w" : "r", id, dn);
+ /* must have been deleted from underneath us */
+ /* treat as if NOID was found */
}
+ /* caller doesn't care about match */
+ if( matched == NULL ) return NULL;
+
/* entry does not exist - see how much of the dn does exist */
+ /* dn_parent checks returns NULL if dn is suffix */
if ( (pdn = dn_parent( be, dn )) != NULL ) {
/* get entry with reader lock */
if ( (e = dn2entry_r( be, pdn, matched )) != NULL ) {
- if(*matched != NULL) {
- free(*matched);
- }
- *matched = pdn;
- /* free entry with reader lock */
- cache_return_entry_r( &li->li_cache, e );
- } else {
- free( pdn );
+ *matched = e;
}
+ free( pdn );
}
- return( NULL );
-}
-
-Entry *
-dn2entry_r(
- Backend *be,
- char *dn,
- char **matched
-)
-{
- return( dn2entry( be, dn, matched, 0 ) );
-}
-
-Entry *
-dn2entry_w(
- Backend *be,
- char *dn,
- char **matched
-)
-{
- return( dn2entry( be, dn, matched, 1 ) );
+ return NULL;
}
-
-