/* dn2id.c - routines to deal with the dn2id index */
/* $OpenLDAP$ */
/*
- * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
ptr, rc, 0 );
goto done;
}
- }
-
- pdn = dn_parent( be, ptr );
-
- if( pdn != NULL ) {
+
+ rc = dnParent( ptr, (const char **)&pdn );
+ if ( rc != LDAP_SUCCESS ) {
+ Debug( LDAP_DEBUG_ANY,
+ "=> bdb_dn2id_add: dnParent(\"%s\") failed\n",
+ ptr, 0, 0 );
+ goto done;
+ }
+
key.size -= pdn - ptr;
pdn[-1] = DN_ONE_PREFIX;
key.data = pdn - 1;
+ ptr = pdn;
rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY,
"=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
- pdn, rc, 0 );
+ ptr, rc, 0 );
goto done;
}
}
- while( pdn != NULL ) {
- if ( be_issuffix( be, pdn ))
- break;
- pdn[-1] = DN_SUBTREE_PREFIX;
+ while( !be_issuffix( be, ptr )) {
+ ptr[-1] = DN_SUBTREE_PREFIX;
rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY,
"=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
- pdn, rc, 0 );
+ ptr, rc, 0 );
break;
}
- ptr = pdn;
- pdn = dn_parent( be, pdn );
+ rc = dnParent( ptr, &pdn );
+ if ( rc != LDAP_SUCCESS ) {
+ Debug( LDAP_DEBUG_ANY,
+ "=> bdb_dn2id_add: dnParent(\"%s\") failed\n",
+ ptr, 0, 0 );
+ goto done;
+ }
+
key.size -= pdn - ptr;
key.data = pdn - 1;
+ ptr = pdn;
}
done:
ptr, rc, 0 );
goto done;
}
- }
- pdn = dn_parent( be, ptr );
+ rc = dnParent( ptr, &pdn );
+ if ( rc != LDAP_SUCCESS ) {
+ Debug( LDAP_DEBUG_ANY,
+ "=> bdb_dn2id_delete: dnParent(\"%s\") failed\n",
+ ptr, 0, 0 );
+ goto done;
+ }
- if( pdn != NULL ) {
key.size -= pdn - ptr;
pdn[-1] = DN_ONE_PREFIX;
key.data = pdn - 1;
+ ptr = pdn;
rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY,
"=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
- pdn, rc, 0 );
+ ptr, rc, 0 );
goto done;
}
}
- while( pdn != NULL ) {
- if ( be_issuffix( be, pdn ))
- break;
-
- pdn[-1] = DN_SUBTREE_PREFIX;
+ while( !be_issuffix( be, ptr )) {
+ ptr[-1] = DN_SUBTREE_PREFIX;
rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
if( rc != 0 ) {
Debug( LDAP_DEBUG_ANY,
"=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
- pdn, rc, 0 );
+ ptr, rc, 0 );
goto done;
}
- ptr = pdn;
- pdn = dn_parent( be, pdn );
+ rc = dnParent( ptr, &pdn );
+ if ( rc != LDAP_SUCCESS ) {
+ Debug( LDAP_DEBUG_ANY,
+ "=> bdb_dn2id_delete: dnParent(\"%s\") failed\n",
+ ptr, 0, 0 );
+ goto done;
+ }
+
key.size -= pdn - ptr;
key.data = pdn - 1;
+ ptr = pdn;
}
done:
Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
+ assert (id);
+
+ *id = bdb_cache_find_entry_ndn2id(be, &bdb->bi_cache, dn);
+ if (*id != NOID) {
+ return 0;
+ }
+
DBTzero( &key );
key.size = dn->bv_len + 2;
key.data = ch_malloc( key.size );
DBT key, data;
struct bdb_info *bdb = (struct bdb_info *) be->be_private;
DB *db = bdb->bi_dn2id->bdi_db;
- char *buf, *dn;
+ char *buf;
+ struct berval dn;
+ ID cached_id;
Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_matched( \"%s\" )\n", in->bv_val, 0, 0 );
key.size = in->bv_len + 2;
buf = ch_malloc( key.size );
key.data = buf;
- dn = buf+1;
- AC_MEMCPY( dn, in->bv_val, key.size - 1 );
+ dn.bv_val = buf+1;
+ dn.bv_len = key.size - 2;
+ AC_MEMCPY( dn.bv_val, in->bv_val, key.size - 1 );
/* store the ID */
DBTzero( &data );
data.flags = DB_DBT_USERMEM;
while(1) {
- dn[-1] = DN_BASE_PREFIX;
+ dn.bv_val[-1] = DN_BASE_PREFIX;
*id = NOID;
- /* fetch it */
- rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
+ /* lookup cache */
+ cached_id = bdb_cache_find_entry_ndn2id(be, &bdb->bi_cache, &dn);
+
+ if (cached_id != NOID) {
+ rc = 0;
+ *id = cached_id;
+ if ( dn.bv_val != buf+1 ) {
+ *id2 = *id;
+ }
+ break;
+ } else {
+ /* fetch it */
+ rc = db->get(db, txn, &key, &data, bdb->bi_db_opflags );
+ }
if( rc == DB_NOTFOUND ) {
- char *pdn = dn_parent( be, dn );
+ char *pdn = NULL;
+
+ if ( ! be_issuffix( be, dn.bv_val ) ) {
+ rc = dnParent( dn.bv_val, &pdn );
+ if ( rc != LDAP_SUCCESS ) {
+ Debug( LDAP_DEBUG_TRACE,
+ "<= bdb_dn2id_matched: dnParent(\"%s\") failed\n",
+ dn, 0, 0 );
+ break;
+ }
+ }
if( pdn == NULL || *pdn == '\0' ) {
Debug( LDAP_DEBUG_TRACE,
break;
}
- key.size -= pdn - dn;
- dn = pdn;
+ key.size -= pdn - dn.bv_val;
+ dn.bv_val = pdn;
+ dn.bv_len = key.size - 2;
key.data = pdn - 1;
} else if ( rc == 0 ) {
(long) sizeof(ID), (long) data.size, 0 );
}
- if( dn != buf+1 ) {
+ if( dn.bv_val != buf+1 ) {
*id2 = *id;
}
Debug( LDAP_DEBUG_TRACE,
"<= bdb_dn2id_matched: id=0x%08lx: %s %s\n",
- (long) *id, *id2 == 0 ? "entry" : "matched", dn );
+ (long) *id, *id2 == 0 ? "entry" : "matched", dn.bv_val );
break;
} else {
free( key.data );
Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %schildren (%d)\n",
- dn,
+ dn->bv_val,
rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
db_strerror(rc) ), rc );
idNode *b
)
{
+#if 0
return strcmp(a->i_rdn->nrdn.bv_val, b->i_rdn->nrdn.bv_val);
+#endif
+ /* should be slightly better without ordering drawbacks */
+ return ber_bvcmp(&a->i_rdn->nrdn, &b->i_rdn->nrdn);
}
idNode * bdb_find_id_node(
projects / openldap / blobdiff