X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=servers%2Fslapd%2Fback-bdb%2Fdn2id.c;h=19dc5d30742217996c6bd2bf2334446d67aa0746;hb=1a9bc6655ddf9a1d08ee4f5e6e4ef6a7707ca5f7;hp=2b1d3d603283ebda3fd7528570c804800462ddf3;hpb=75064ce91dca217a45640a35553a2e87e2f1e4b0;p=openldap

diff --git a/servers/slapd/back-bdb/dn2id.c b/servers/slapd/back-bdb/dn2id.c
index 2b1d3d6032..19dc5d3074 100644
--- a/servers/slapd/back-bdb/dn2id.c
+++ b/servers/slapd/back-bdb/dn2id.c
@@ -1,8 +1,17 @@
 /* dn2id.c - routines to deal with the dn2id index */
 /* $OpenLDAP$ */
-/*
- * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
- * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
+/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
+ *
+ * Copyright 2000-2004 The OpenLDAP Foundation.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted only as authorized by the OpenLDAP
+ * Public License.
+ *
+ * A copy of this license is available in the file LICENSE in the
+ * top-level directory of the distribution or, alternatively, at
+ * <http://www.OpenLDAP.org/license.html>.
  */
 
 #include "portable.h"
@@ -12,32 +21,43 @@
 
 #include "back-bdb.h"
 #include "idl.h"
+#include "lutil.h"
 
 #ifndef BDB_HIER
 int
 bdb_dn2id_add(
-	BackendDB	*be,
+	Operation *op,
 	DB_TXN *txn,
-	char *pdn,
+	EntryInfo *eip,
 	Entry		*e )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	DB *db = bdb->bi_dn2id->bdi_db;
 	int		rc;
 	DBT		key, data;
-	char		*buf, *ptr;
+	char		*buf;
+	struct berval	ptr, pdn;
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, "bdb_dn2id_add( \"%s\", 0x%08lx )\n",
+		e->e_ndn, (long) e->e_id, 0 );
+#else
 	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add( \"%s\", 0x%08lx )\n",
 		e->e_ndn, (long) e->e_id, 0 );
+#endif
 	assert( e->e_id != NOID );
 
 	DBTzero( &key );
-	key.size = strlen( e->e_ndn ) + 2;
-	buf = ch_malloc( key.size );
+	key.size = e->e_nname.bv_len + 2;
+	key.ulen = key.size;
+	key.flags = DB_DBT_USERMEM;
+	buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
 	key.data = buf;
 	buf[0] = DN_BASE_PREFIX;
-	ptr = buf + 1;
-	AC_MEMCPY( ptr, e->e_ndn, key.size - 1 );
+	ptr.bv_val = buf + 1;
+	ptr.bv_len = e->e_nname.bv_len;
+	AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
+	ptr.bv_val[ptr.bv_len] = '\0';
 
 	DBTzero( &data );
 	data.data = (char *) &e->e_id;
@@ -46,193 +66,269 @@ bdb_dn2id_add(
 	/* store it -- don't override */
 	rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
 	if( rc != 0 ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ERR, "bdb_dn2id_add: put failed: %s %d\n",
+			db_strerror(rc), rc, 0 );
+#else
 		Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_add: put failed: %s %d\n",
 			db_strerror(rc), rc, 0 );
+#endif
 		goto done;
 	}
 
-	if( !be_issuffix( be, ptr )) {
+#ifndef BDB_MULTIPLE_SUFFIXES
+	if( !be_issuffix( op->o_bd, &ptr )) {
+#endif
 		buf[0] = DN_SUBTREE_PREFIX;
-		rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
+		rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
 		if( rc != 0 ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, ERR, 
+				"=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
+				ptr.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_ANY,
-			"=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
-			ptr, rc, 0 );
+			"=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
+			ptr.bv_val, rc, 0 );
+#endif
 			goto done;
 		}
-	}
-
-	pdn = dn_parent( be, ptr );
-
-	if( pdn != NULL ) {
-		key.size -= pdn - ptr;
-		pdn[-1] = DN_ONE_PREFIX;
-		key.data = pdn - 1;
+		
+#ifdef BDB_MULTIPLE_SUFFIXES
+	if( !be_issuffix( op->o_bd, &ptr )) {
+#endif
+		dnParent( &ptr, &pdn );
+	
+		key.size = pdn.bv_len + 2;
+		key.ulen = key.size;
+		pdn.bv_val[-1] = DN_ONE_PREFIX;
+		key.data = pdn.bv_val-1;
+		ptr = pdn;
 
-		rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
+		rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
 
 		if( rc != 0 ) {
-			Debug( LDAP_DEBUG_ANY,
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, ERR, 
 				"=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
-					pdn, rc, 0 );
-			goto done;
-		}
-
-		pdn[-1] = DN_SUBTREE_PREFIX;
-		rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
-
-		if( rc != 0 ) {
+				ptr.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_ANY,
-				"=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
-					pdn, rc, 0 );
+				"=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
+					ptr.bv_val, rc, 0 );
+#endif
 			goto done;
 		}
-		ptr = pdn;
-		pdn = dn_parent( be, pdn );
+#ifndef BDB_MULTIPLE_SUFFIXES
 	}
 
-	while( pdn != NULL ) {
-		pdn[-1] = DN_SUBTREE_PREFIX;
-		key.size -= pdn - ptr;
-		key.data = pdn - 1;
+	while( !be_issuffix( op->o_bd, &ptr ))
+#else
+	for (;;)
+#endif
+	{
+		ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
 
-		rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
+		rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
 
 		if( rc != 0 ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, ERR, 
+				"=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
+				ptr.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_ANY,
 				"=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
-					pdn, rc, 0 );
+					ptr.bv_val, rc, 0 );
+#endif
 			break;
 		}
+#ifdef BDB_MULTIPLE_SUFFIXES
+		if( be_issuffix( op->o_bd, &ptr )) break;
+#endif
+		dnParent( &ptr, &pdn );
+
+		key.size = pdn.bv_len + 2;
+		key.ulen = key.size;
+		key.data = pdn.bv_val - 1;
 		ptr = pdn;
-		pdn = dn_parent( be, pdn );
 	}
+#ifdef BDB_MULTIPLE_SUFFIXES
+	}
+#endif
 
 done:
-	ch_free( buf );
+	op->o_tmpfree( buf, op->o_tmpmemctx );
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
+#else
 	Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
+#endif
 	return rc;
 }
 
 int
 bdb_dn2id_delete(
-	BackendDB	*be,
+	Operation *op,
 	DB_TXN *txn,
-	char	*pdn,
+	EntryInfo	*eip,
 	Entry		*e )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	DB *db = bdb->bi_dn2id->bdi_db;
 	int		rc;
 	DBT		key;
-	char		*buf, *ptr;
+	char		*buf;
+	struct berval	pdn, ptr;
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, 
+		"=> bdb_dn2id_delete ( \"%s\", 0x%08lx )\n", e->e_ndn, e->e_id, 0);
+#else
 	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", 0x%08lx )\n",
 		e->e_ndn, e->e_id, 0 );
+#endif
 
 	DBTzero( &key );
-	key.size = strlen( e->e_ndn ) + 2;
-	buf = ch_malloc( key.size );
+	key.size = e->e_nname.bv_len + 2;
+	buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
 	key.data = buf;
 	key.flags = DB_DBT_USERMEM;
 	buf[0] = DN_BASE_PREFIX;
-	ptr = buf+1;
-	AC_MEMCPY( ptr, e->e_ndn, key.size - 1 );
+	ptr.bv_val = buf+1;
+	ptr.bv_len = e->e_nname.bv_len;
+	AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
+	ptr.bv_val[ptr.bv_len] = '\0';
 
 	/* delete it */
 	rc = db->del( db, txn, &key, 0 );
 	if( rc != 0 ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ERR, 
+			"=> bdb_dn2id_delete: delete failed: %s %d\n", 
+			db_strerror(rc), rc, 0 );
+#else
 		Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete: delete failed: %s %d\n",
 			db_strerror(rc), rc, 0 );
+#endif
 		goto done;
 	}
 
-	if( !be_issuffix( be, ptr )) {
+#ifndef BDB_MULTIPLE_SUFFIXES
+	if( !be_issuffix( op->o_bd, &ptr )) {
+#endif
 		buf[0] = DN_SUBTREE_PREFIX;
-		rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
+		rc = db->del( db, txn, &key, 0 );
 		if( rc != 0 ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, ERR, 
+				"=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n", 
+				ptr.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_ANY,
 			"=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
-			ptr, rc, 0 );
+			ptr.bv_val, rc, 0 );
+#endif
 			goto done;
 		}
-	}
 
-	pdn = dn_parent( be, ptr );
+#ifdef BDB_MULTIPLE_SUFFIXES
+	if( !be_issuffix( op->o_bd, &ptr )) {
+#endif
+		dnParent( &ptr, &pdn );
 
-	if( pdn != NULL ) {
-		key.size -= pdn - ptr;
-		pdn[-1] = DN_ONE_PREFIX;
-		key.data = pdn - 1;
+		key.size = pdn.bv_len + 2;
+		key.ulen = key.size;
+		pdn.bv_val[-1] = DN_ONE_PREFIX;
+		key.data = pdn.bv_val - 1;
+		ptr = pdn;
 
-		rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
+		rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
 
 		if( rc != 0 ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, ERR, 
+				"=> bdb_dn2id_delete: parent (%s) delete failed: %d\n", 
+				ptr.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_ANY,
 				"=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
-				pdn, rc, 0 );
-			goto done;
-		}
-
-		pdn[-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.bv_val, rc, 0 );
+#endif
 			goto done;
 		}
-		ptr = pdn;
-		pdn = dn_parent( be, pdn );
+#ifndef BDB_MULTIPLE_SUFFIXES
 	}
 
-	while( pdn != NULL ) {
-		pdn[-1] = DN_SUBTREE_PREFIX;
-		key.size -= pdn - ptr;
-		key.data = pdn - 1;
+	while( !be_issuffix( op->o_bd, &ptr )) {
+#else
+	for (;;) {
+#endif
+		ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
 
-		rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
+		rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
 		if( rc != 0 ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, ERR, 
+				"=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n", 
+				ptr.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_ANY,
 				"=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
-				pdn, rc, 0 );
+				ptr.bv_val, rc, 0 );
+#endif
 			goto done;
 		}
+#ifdef BDB_MULTIPLE_SUFFIXES
+		if( be_issuffix( op->o_bd, &ptr )) break;
+#endif
+		dnParent( &ptr, &pdn );
+
+		key.size = pdn.bv_len + 2;
+		key.ulen = key.size;
+		key.data = pdn.bv_val - 1;
 		ptr = pdn;
-		pdn = dn_parent( be, pdn );
 	}
+#ifdef BDB_MULTIPLE_SUFFIXES
+	}
+#endif
 
 done:
-	ch_free( buf );
+	op->o_tmpfree( buf, op->o_tmpmemctx );
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
+#else
 	Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
+#endif
 	return rc;
 }
 
 int
 bdb_dn2id(
-	BackendDB	*be,
+	Operation *op,
 	DB_TXN *txn,
-	const char	*dn,
-	ID *id )
+	struct berval	*dn,
+	EntryInfo *ei )
 {
 	int		rc;
 	DBT		key, data;
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	DB *db = bdb->bi_dn2id->bdi_db;
 
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn, 0, 0 );
-
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
+#endif
 	DBTzero( &key );
-	key.size = strlen( dn ) + 2;
-	key.data = ch_malloc( key.size );
+	key.size = dn->bv_len + 2;
+	key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
 	((char *)key.data)[0] = DN_BASE_PREFIX;
-	AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
+	AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
 
 	/* store the ID */
 	DBTzero( &data );
-	data.data = id;
+	data.data = &ei->bei_id;
 	data.ulen = sizeof(ID);
 	data.flags = DB_DBT_USERMEM;
 
@@ -240,117 +336,61 @@ bdb_dn2id(
 	rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
 
 	if( rc != 0 ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ERR, "<= bdb_dn2id: get failed %s (%d)\n", 
+			db_strerror(rc), rc, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
 			db_strerror( rc ), rc, 0 );
+#endif
 	} else {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_dn2id: got id=0x%08lx\n", ei->bei_id, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
-			*id, 0, 0 );
+			ei->bei_id, 0, 0 );
+#endif
 	}
 
-	ch_free( key.data );
-	return rc;
-}
-
-int
-bdb_dn2id_matched(
-	BackendDB	*be,
-	DB_TXN *txn,
-	const char	*in,
-	ID *id,
-	char **matchedDN )
-{
-	int		rc;
-	DBT		key, data;
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	DB *db = bdb->bi_dn2id->bdi_db;
-	const char *dn = in;
-
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_matched( \"%s\" )\n", dn, 0, 0 );
-
-	DBTzero( &key );
-	key.size = strlen( dn ) + 2;
-	key.data = ch_malloc( key.size );
-	((char *)key.data)[0] = DN_BASE_PREFIX;
-
-	/* store the ID */
-	DBTzero( &data );
-	data.data = id;
-	data.ulen = sizeof(ID);
-	data.flags = DB_DBT_USERMEM;
-
-	*matchedDN = NULL;
-
-	while(1) {
-		AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
-
-		*id = NOID;
-
-		/* fetch it */
-		rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
-
-		if( rc == DB_NOTFOUND ) {
-			char *pdn = dn_parent( be, dn );
-
-			if( pdn == NULL || *pdn == '\0' ) {
-				Debug( LDAP_DEBUG_TRACE,
-					"<= bdb_dn2id_matched: no match\n",
-					0, 0, 0 );
-				break;
-			}
-
-			dn = pdn;
-			key.size = strlen( dn ) + 2;
-
-		} else if ( rc == 0 ) {
-			if( data.size != sizeof( ID ) ) {
-				Debug( LDAP_DEBUG_ANY,
-					"<= bdb_dn2id_matched: get size mismatch: "
-					"expected %ld, got %ld\n",
-					(long) sizeof(ID), (long) data.size, 0 );
-			}
-
-			if( in != dn ) {
-				*matchedDN = (char *) dn;
-			}
-
-			Debug( LDAP_DEBUG_TRACE,
-				"<= bdb_dn2id_matched: id=0x%08lx: %s %s\n",
-				(long) *id, *matchedDN == NULL ? "entry" : "matched", dn );
-			break;
-
-		} else {
-			Debug( LDAP_DEBUG_ANY,
-				"<= bdb_dn2id_matched: get failed: %s (%d)\n",
-				db_strerror(rc), rc, 0 );
-			break;
-		}
-	}
-
-	ch_free( key.data );
+	op->o_tmpfree( key.data, op->o_tmpmemctx );
 	return rc;
 }
 
 int
 bdb_dn2id_children(
-	BackendDB	*be,
+	Operation *op,
 	DB_TXN *txn,
-	const char *dn )
+	Entry *e )
 {
-	int		rc;
 	DBT		key, data;
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	DB *db = bdb->bi_dn2id->bdi_db;
 	ID		id;
+	int		rc;
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, 
+		"=> bdb_dn2id_children( %s )\n", e->e_nname.bv_val, 0, 0 );
+#else
 	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
-		dn, 0, 0 );
-
+		e->e_nname.bv_val, 0, 0 );
+#endif
 	DBTzero( &key );
-	key.size = strlen( dn ) + 2;
-	key.data = ch_malloc( key.size );
+	key.size = e->e_nname.bv_len + 2;
+	key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
 	((char *)key.data)[0] = DN_ONE_PREFIX;
-	AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
-
+	AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
+
+#ifdef SLAP_IDL_CACHE
+	if ( bdb->bi_idl_cache_size ) {
+		rc = bdb_idl_cache_get( bdb, db, &key, NULL );
+		if ( rc != LDAP_NO_SUCH_OBJECT ) {
+			op->o_tmpfree( key.data, op->o_tmpmemctx );
+			return rc;
+		}
+	}
+#endif
 	/* we actually could do a empty get... */
 	DBTzero( &data );
 	data.data = &id;
@@ -360,573 +400,730 @@ bdb_dn2id_children(
 	data.dlen = sizeof(id);
 
 	rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
-
-	Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %schildren (%d)\n",
-		dn,
+	op->o_tmpfree( key.data, op->o_tmpmemctx );
+
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, DETAIL1, 
+		"<= bdb_dn2id_children( %s ): %s (%d)\n", 
+		e->e_nname.bv_val, rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
+		db_strerror(rc)), rc );
+#else
+	Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %s (%d)\n",
+		e->e_nname.bv_val,
 		rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
 			db_strerror(rc) ), rc );
+#endif
 
 	return rc;
 }
 
 int
 bdb_dn2idl(
-	BackendDB	*be,
-	const char	*dn,
-	int prefix,
-	ID *ids )
+	Operation *op,
+	Entry *e,
+	ID *ids,
+	ID *stack )
 {
 	int		rc;
 	DBT		key;
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	DB *db = bdb->bi_dn2id->bdi_db;
-
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n", dn, 0, 0 );
-
-	if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn))
-	{
+	int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
+		? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
+
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2ididl( \"%s\" )\n",
+		e->e_nname.bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n",
+		e->e_nname.bv_val, 0, 0 );
+#endif
+
+#ifndef	BDB_MULTIPLE_SUFFIXES
+	if ( prefix == DN_SUBTREE_PREFIX && BEI(e)->bei_parent->bei_id == 0 ) {
 		BDB_IDL_ALL(bdb, ids);
 		return 0;
 	}
+#endif
 
 	DBTzero( &key );
-	key.size = strlen( dn ) + 2;
-	key.data = ch_malloc( key.size );
+	key.size = e->e_nname.bv_len + 2;
+	key.ulen = key.size;
+	key.flags = DB_DBT_USERMEM;
+	key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
 	((char *)key.data)[0] = prefix;
-	AC_MEMCPY( &((char *)key.data)[1], dn, key.size - 1 );
+	AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
 
-	rc = bdb_idl_fetch_key( be, db, NULL, &key, ids );
+	rc = bdb_idl_fetch_key( op->o_bd, db, NULL, &key, ids );
 
 	if( rc != 0 ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ERR, 
+			"<= bdb_dn2ididl: get failed: %s (%d)\n", db_strerror(rc), rc, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
 			"<= bdb_dn2idl: get failed: %s (%d)\n",
 			db_strerror( rc ), rc, 0 );
+#endif
 
 	} else {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_dn2ididl: id=%ld first=%ld last=%ld\n", 
+			(long) ids[0], (long) BDB_IDL_FIRST( ids ), 
+			(long) BDB_IDL_LAST( ids ) );
+#else
 		Debug( LDAP_DEBUG_TRACE,
 			"<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
 			(long) ids[0],
 			(long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
+#endif
 	}
 
-	ch_free( key.data );
+	op->o_tmpfree( key.data, op->o_tmpmemctx );
 	return rc;
 }
 #else	/* BDB_HIER */
 
-/* Experimental management routines for a hierarchically structured backend.
+/* Experimental management routines for a hierarchically structured database.
  *
  * Unsupported! Use at your own risk!
+ * -- Howard Chu, Symas Corp. 2003.
+ *
+ * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
+ * entry in this database is a struct diskNode, keyed by entryID and with
+ * the data containing the RDN and entryID of the node's children. We use
+ * a B-Tree with sorted duplicates to store all the children of a node under
+ * the same key. Also, the first item under the key contains the entry's own
+ * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
+ * well as top-down. To keep this info first in the list, the nrdnlen is set
+ * to the negative of its value.
  *
- * Instead of a dn2id database, we use an id2parent database. Each entry in
- * this database is a struct diskNode, containing the ID of the node's parent
- * and the RDN of the node.
+ * The diskNode is a variable length structure. This definition is not
+ * directly usable for in-memory manipulation.
  */
 typedef struct diskNode {
-	ID parent;
-	struct berval rdn;
-	struct berval nrdn;
+	ID entryID;
+	short nrdnlen;
+	char nrdn[1];
+	char rdn[1];
 } diskNode;
 
-/* In bdb_db_open() we call bdb_build_tree() which reads the entire id2parent
- * database into memory (into an AVL tree). Next we iterate through each node
- * of this tree, connecting each child to its parent. The nodes in this AVL
- * tree are a struct idNode. The immediate (Onelevel) children of a node are
- * referenced in the i_kids AVL tree. With this arrangement, there is no need
- * to maintain the DN_ONE_PREFIX or DN_SUBTREE_PREFIX database keys. Note that
- * the DN of an entry is constructed by walking up the list of i_parent
- * pointers, so no full DN is stored on disk anywhere. This makes modrdn
- * extremely efficient, even when operating on a populated subtree.
- *
- * The idNode tree is searched directly from the root when performing id to
- * entry lookups. The tree is traversed using the i_kids subtrees when
- * performing dn to id lookups.
- */
-typedef struct idNode {
-	ID i_id;
-	struct idNode *i_parent;
-	diskNode *i_rdn;
-	Avlnode *i_kids;
-	ldap_pvt_thread_rdwr_t i_kids_rdwr;
-} idNode;
-
-/* strcopy is like strcpy except it returns a pointer to the trailing NUL of
- * the result string. This allows fast construction of catenated strings
- * without the overhead of strlen/strcat.
+/* Sort function for the sorted duplicate data items of a dn2id key.
+ * Sorts based on normalized RDN, in length order.
  */
-char *
-bdb_strcopy(
-	char *a,
-	char *b
+int
+hdb_dup_compare(
+	DB *db, 
+	const DBT *usrkey,
+	const DBT *curkey
 )
 {
-	if (!a || !b)
-		return a;
-	
-	while (*a++ = *b++) ;
-	return a-1;
+	char *u = (char *)&(((diskNode *)(usrkey->data))->nrdnlen);
+	char *c = (char *)&(((diskNode *)(curkey->data))->nrdnlen);
+	int rc, i;
+
+	/* data is not aligned, cannot compare directly */
+#ifdef WORDS_BIGENDIAN
+	for( i = 0; i < (int)sizeof(short); i++)
+#else
+	for( i = sizeof(short)-1; i >= 0; i--)
+#endif
+	{
+		rc = u[i] - c[i];
+		if( rc ) return rc;
+	}
+	return strcmp( u+sizeof(short), c+sizeof(short) );
 }
 
-/* The main AVL tree is sorted in ID order. The i_kids AVL trees are
- * sorted in lexical order. These are the various helper routines used
- * for the searches and sorts.
+/* This function constructs a full DN for a given entry.
  */
-static int
-node_find_cmp(
-	ID id,
-	idNode *n
-)
-{
-	return id - n->i_id;
-}
-
-static int
-node_frdn_cmp(
-	char *nrdn,
-	idNode *n
-)
-{
-	return strcmp(nrdn, n->i_rdn->nrdn.bv_val);
-}
-
-static int
-node_add_cmp(
-	idNode *a,
-	idNode *b
-)
-{
-	return a->i_id - b->i_id;
-}
-
-static int
-node_rdn_cmp(
-	idNode *a,
-	idNode *b
-)
-{
-	return strcmp(a->i_rdn->nrdn.bv_val, b->i_rdn->nrdn.bv_val);
-}
-
-idNode * bdb_find_id_node(
-	ID id,
-	Avlnode *tree
-)
-{
-	return avl_find(tree, (const void *)id, (AVL_CMP)node_find_cmp);
-}
-
-idNode * bdb_find_rdn_node(
-	char *nrdn,
-	Avlnode *tree
-)
-{
-	return avl_find(tree, (const void *)nrdn, (AVL_CMP)node_frdn_cmp);
-}
-
-/* This function links a node into its parent's i_kids tree. */
-int bdb_insert_kid(
-	idNode *a,
-	Avlnode *tree
-)
-{
-	int rc;
-
-	if (a->i_rdn->parent == 0)
-		return 0;
-	a->i_parent = bdb_find_id_node(a->i_rdn->parent, tree);
-	if (!a->i_parent)
-		return -1;
-	ldap_pvt_thread_rdwr_wlock(&a->i_parent->i_kids_rdwr);
-	rc = avl_insert( &a->i_parent->i_kids, (caddr_t) a,
-		(AVL_CMP)node_rdn_cmp, (AVL_DUP) avl_dup_error );
-	ldap_pvt_thread_rdwr_wunlock(&a->i_parent->i_kids_rdwr);
-	return rc;
-}
-
-/* This function adds a node into the main AVL tree */
-idNode *bdb_add_node(
-	ID id,
-	char *d,
-	struct bdb_info *bdb
+int hdb_fix_dn(
+	Entry *e,
+	int checkit
 )
 {
-	idNode *node;
-
-	node = (idNode *)ch_malloc(sizeof(idNode));
-	node->i_id = id;
-	node->i_parent = NULL;
-	node->i_kids = NULL;
-	node->i_rdn = (diskNode *)d;
-	node->i_rdn->rdn.bv_val += (long)d;
-	node->i_rdn->nrdn.bv_val += (long)d;
-	ldap_pvt_thread_rdwr_init(&node->i_kids_rdwr);
-	avl_insert( &bdb->bi_tree, (caddr_t) node,
-			(AVL_CMP)node_add_cmp, (AVL_DUP) avl_dup_error );
-	if (id == 1)
-		bdb->bi_troot = node;
-	return node;
-}
-
-/* This function initializes the trees at startup time. */
-int bdb_build_tree(
-	Backend *be
-)
-{
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	int i, rc;
-	DBC *cursor;
-	DBT key, data;
-	ID id;
-	idNode *node;
-	char **rdns;
-
-	bdb->bi_tree = NULL;
+	EntryInfo *ei;
+	int rlen = 0, nrlen = 0;
+	char *ptr, *nptr;
+	int max = 0;
 
-	rc = bdb->bi_id2parent->bdi_db->cursor(
-		bdb->bi_id2parent->bdi_db, NULL, &cursor,
-		bdb->bi_db_opflags );
-	if( rc != 0 ) {
-		return NOID;
+	/* count length of all DN components */
+	for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
+		rlen += ei->bei_rdn.bv_len + 1;
+		nrlen += ei->bei_nrdn.bv_len + 1;
+		if (ei->bei_modrdns > max) max = ei->bei_modrdns;
 	}
 
-	/* When be_suffix is turned into struct berval or LDAPDN
-	 * life will get a lot easier... Since no DNs live on disk, we
-	 * need to operate on the be_suffix to fully qualify our DNs.
-	 * We need to know how many components are in the suffix DN,
-	 * so we can tell where the suffix ends and our nodes begin.
-	 *
-	 * Note that this code always uses be_suffix[0], so defining
-	 * multiple suffixes for a single backend won't work!
-	 */
-	bdb->bi_sufflen = strlen(be->be_suffix[0]);
-
-	rdns = ldap_explode_dn(be->be_nsuffix[0]->bv_val, 0);
-	for (i=0; rdns[i]; i++);
-	bdb->bi_nrdns = i;
-	charray_free(rdns);
-
-	DBTzero( &key );
-	DBTzero( &data );
-	key.data = (char *)&id;
-	key.ulen = sizeof( id );
-	key.flags = DB_DBT_USERMEM;
-	data.flags = DB_DBT_MALLOC;
-
-	while (cursor->c_get( cursor, &key, &data, DB_NEXT ) == 0) {
-		bdb_add_node( id, data.data, bdb );
+	/* See if the entry DN was invalidated by a subtree rename */
+	if ( checkit ) {
+		if ( BEI(e)->bei_modrdns >= max ) {
+			return 0;
+		}
+		/* We found a mismatch, tell the caller to lock it */
+		if ( checkit == 1 ) {
+			return 1;
+		}
+		/* checkit == 2. do the fix. */
+		free( e->e_name.bv_val );
+		free( e->e_nname.bv_val );
 	}
-	cursor->c_close( cursor );
-
-	rc = avl_apply(bdb->bi_tree, (AVL_APPLY)bdb_insert_kid, bdb->bi_tree,
-		-1, AVL_INORDER );
 
-	return rc;
-}
-
-/* This function constructs a full DN for a given id. We really should
- * be passing idNodes directly, to save some effort...
- */
-int bdb_fix_dn(
-	BackendDB *be,
-	ID id,
-	Entry *e
-)
-{
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	idNode *n, *o;
-	int rlen, nrlen;
-	char *ptr, *nptr;
-	
-	ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
-	o = bdb_find_id_node(id, bdb->bi_tree);
-	rlen = bdb->bi_sufflen + 1;
-	nrlen = be->be_nsuffix[0]->bv_len + 1;
-	for (n = o; n; n=n->i_parent) {
-		rlen += n->i_rdn->rdn.bv_len + 1;
-		nrlen += n->i_rdn->nrdn.bv_len + 1;
-	}
-	e->e_dn = ch_malloc(rlen + nrlen);
-	e->e_ndn = e->e_dn + rlen;
-	ptr = e->e_dn;
-	nptr = e->e_ndn;
-	for (n = o; n; n=n->i_parent) {
-		ptr = bdb_strcopy(ptr, n->i_rdn->rdn.bv_val);
-		*ptr++ = ',';
-		nptr = bdb_strcopy(nptr, n->i_rdn->nrdn.bv_val);
-		*nptr++ = ',';
-	}
-	ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
-
-	ptr--;
-	nptr--;
-	strcpy(ptr, be->be_suffix[0]);
-	strcpy(nptr, be->be_nsuffix[0]->bv_val);
+	e->e_name.bv_len = rlen - 1;
+	e->e_nname.bv_len = nrlen - 1;
+	e->e_name.bv_val = ch_malloc(rlen);
+	e->e_nname.bv_val = ch_malloc(nrlen);
+	ptr = e->e_name.bv_val;
+	nptr = e->e_nname.bv_val;
+	for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
+		ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
+		nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
+		if ( ei->bei_parent ) {
+			*ptr++ = ',';
+			*nptr++ = ',';
+		}
+	}
+	BEI(e)->bei_modrdns = max;
+	ptr[-1] = '\0';
+	nptr[-1] = '\0';
 
 	return 0;
 }
 
+/* We add two elements to the DN2ID database - a data item under the parent's
+ * entryID containing the child's RDN and entryID, and an item under the
+ * child's entryID containing the parent's entryID.
+ */
 int
-bdb_dn2id_add(
-	BackendDB	*be,
+hdb_dn2id_add(
+	Operation	*op,
 	DB_TXN *txn,
-	char	*pdn,
+	EntryInfo	*eip,
 	Entry		*e )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	int		rc, rlen, nrlen;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+	DB *db = bdb->bi_dn2id->bdi_db;
 	DBT		key, data;
-	DB *db = bdb->bi_id2parent->bdi_db;
+	int		rc, rlen, nrlen;
 	diskNode *d;
-	idNode *n;
+	char *ptr;
 
-	nrlen = dn_rdnlen( be, e->e_ndn );
+	nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
 	if (nrlen) {
-		rlen = dn_rdnlen( be, e->e_dn );
-	} else {
-		rlen = 0;
-	}
-
-	d = ch_malloc(sizeof(diskNode) + rlen + nrlen + 2);
-	d->rdn.bv_len = rlen;
-	d->nrdn.bv_len = nrlen;
-	d->rdn.bv_val = (char *)(d+1);
-	d->nrdn.bv_val = d->rdn.bv_val + rlen + 1;
-	strncpy(d->rdn.bv_val, e->e_dn, rlen);
-	d->rdn.bv_val[rlen] = '\0';
-	strncpy(d->nrdn.bv_val, e->e_ndn, nrlen);
-	d->nrdn.bv_val[nrlen] = '\0';
-	d->rdn.bv_val -= (long)d;
-	d->nrdn.bv_val -= (long)d;
-
-	if (pdn) {
-		bdb_dn2id(be, txn, pdn, &d->parent);
+		rlen = dn_rdnlen( op->o_bd, &e->e_name );
 	} else {
-		d->parent = 0;
+		nrlen = e->e_nname.bv_len;
+		rlen = e->e_name.bv_len;
 	}
 
+	d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
+	d->entryID = e->e_id;
+	d->nrdnlen = nrlen;
+	ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
+	*ptr++ = '\0';
+	ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
+	*ptr = '\0';
+
 	DBTzero(&key);
 	DBTzero(&data);
-	key.data = &e->e_id;
+	key.data = &eip->bei_id;
 	key.size = sizeof(ID);
 	key.flags = DB_DBT_USERMEM;
 
+#ifdef SLAP_IDL_CACHE
+	if ( bdb->bi_idl_cache_size ) {
+		bdb_idl_cache_del( bdb, db, &key );
+	}
+#endif
 	data.data = d;
-	data.size = sizeof(diskNode) + rlen + nrlen + 2;
+	data.size = sizeof(diskNode) + rlen + nrlen;
 	data.flags = DB_DBT_USERMEM;
 
-	rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
+	rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
 
 	if (rc == 0) {
-		ldap_pvt_thread_rdwr_wlock(&bdb->bi_tree_rdwr);
-		n = bdb_add_node( e->e_id, data.data, bdb);
-		ldap_pvt_thread_rdwr_wunlock(&bdb->bi_tree_rdwr);
-
-		if (d->parent) {
-			ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
-			bdb_insert_kid(n, bdb->bi_tree);
-			ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
-		}
-	} else {
-		free(d);
+		key.data = &e->e_id;
+		d->entryID = eip->bei_id;
+		d->nrdnlen = 0 - nrlen;
+
+		rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
 	}
+
+	op->o_tmpfree( d, op->o_tmpmemctx );
+
 	return rc;
 }
 
 int
-bdb_dn2id_delete(
-	BackendDB	*be,
+hdb_dn2id_delete(
+	Operation	*op,
 	DB_TXN *txn,
-	char	*pdn,
+	EntryInfo	*eip,
 	Entry	*e )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	int rc;
-	DBT		key;
-	DB *db = bdb->bi_id2parent->bdi_db;
-	idNode *n;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+	DB *db = bdb->bi_dn2id->bdi_db;
+	DBT		key, data;
+	DBC	*cursor;
+	diskNode *d;
+	int rc, nrlen;
 
 	DBTzero(&key);
-	key.size = sizeof(e->e_id);
-	key.data = &e->e_id;
+	key.size = sizeof(ID);
+	key.ulen = key.size;
+	key.data = &eip->bei_id;
+	key.flags = DB_DBT_USERMEM;
 
-	rc = db->del( db, txn, &key, 0);
+	DBTzero(&data);
+	data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len;
+	data.ulen = data.size;
+	data.dlen = data.size;
+	data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
+
+#ifdef SLAP_IDL_CACHE
+	if ( bdb->bi_idl_cache_size ) {
+		bdb_idl_cache_del( bdb, db, &key );
+	}
+#endif
+	rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+	if ( rc ) return rc;
+
+	d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
+	d->entryID = e->e_id;
+	d->nrdnlen = BEI(e)->bei_nrdn.bv_len;
+	strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
+	data.data = d;
 
-	ldap_pvt_thread_rdwr_wlock(&bdb->bi_tree_rdwr);
-	n = avl_delete(&bdb->bi_tree, (void *)e->e_id, (AVL_CMP)node_find_cmp);
-	if (n) {
-		if (n->i_parent) {
-			ldap_pvt_thread_rdwr_wlock(&n->i_parent->i_kids_rdwr);
-			avl_delete(&n->i_parent->i_kids, n->i_rdn->nrdn.bv_val,
-				(AVL_CMP)node_frdn_cmp);
-			ldap_pvt_thread_rdwr_wunlock(&n->i_parent->i_kids_rdwr);
-		}
-		free(n->i_rdn);
-		ldap_pvt_thread_rdwr_destroy(&n->i_kids_rdwr);
-		free(n);
+	/* Delete our ID from the parent's list */
+	rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH | DB_RMW );
+	if ( rc == 0 )
+		rc = cursor->c_del( cursor, 0 );
+
+	/* Delete our ID from the tree. With sorted duplicates, this
+	 * will leave any child nodes still hanging around. This is OK
+	 * for modrdn, which will add our info back in later.
+	 */
+	if ( rc == 0 ) {
+		key.data = &e->e_id;
+		rc = cursor->c_get( cursor, &key, &data, DB_SET | DB_RMW );
+		if ( rc == 0 )
+			rc = cursor->c_del( cursor, 0 );
 	}
-	if (e->e_id == 1)
-		bdb->bi_troot = NULL;
-	ldap_pvt_thread_rdwr_wunlock(&bdb->bi_tree_rdwr);
+	cursor->c_close( cursor );
+	op->o_tmpfree( d, op->o_tmpmemctx );
 
 	return rc;
 }
 
+
 int
-bdb_dn2id_matched(
-	BackendDB	*be,
+hdb_dn2id(
+	Operation	*op,
 	DB_TXN *txn,
-	const char	*in,
-	ID *id,
-	char **matchedDN )
+	struct berval	*in,
+	EntryInfo	*ei )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	int		i;
-	char		**rdns;
-	idNode *n, *p;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+	DB *db = bdb->bi_dn2id->bdi_db;
+	DBT		key, data;
+	DBC	*cursor;
+	int		rc = 0, nrlen;
+	diskNode *d;
+	char	*ptr;
+	ID idp = ei->bei_parent->bei_id;
 
-	if (!bdb->bi_troot)
-		return DB_NOTFOUND;
+	nrlen = dn_rdnlen( op->o_bd, in );
+	if (!nrlen) nrlen = in->bv_len;
 
-	p = bdb->bi_troot;
-	if (be_issuffix(be, in)) {
-		*id = p->i_id;
-		return 0;
-	}
+	DBTzero(&key);
+	key.size = sizeof(ID);
+	key.data = &idp;
+	key.ulen = sizeof(ID);
+	key.flags = DB_DBT_USERMEM;
 
-	rdns = ldap_explode_dn(in, 0);
-	for (i=0; rdns[i]; i++);
-	i -= bdb->bi_nrdns;
-	if (i < 0)
-		return -1;
-	n = p;
-	ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
-	for (--i; i>=0; i--) {
-		ldap_pvt_thread_rdwr_rlock(&p->i_kids_rdwr);
-		n = bdb_find_rdn_node(rdns[i], p->i_kids);
-		ldap_pvt_thread_rdwr_runlock(&p->i_kids_rdwr);
-		if (!n) break;
-		p = n;
-	}
-	ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
-
-	if (n) {
-		*id = n->i_id;
-	} else if (matchedDN) {
-		int len = 0, j;
-		char *ptr;
-		++i;
-		for (j=i; rdns[j]; j++)
-			len += strlen(rdns[j]) + 1;
-		ptr = ch_malloc(len);
-		*matchedDN = ptr;
-		for (;rdns[i]; i++) {
-			ptr = bdb_strcopy(ptr, rdns[i]);
-			*ptr++ = ',';
+	DBTzero(&data);
+	data.size = sizeof(diskNode) + nrlen;
+	data.ulen = data.size * 3;
+	data.flags = DB_DBT_USERMEM;
+
+	rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+	if ( rc ) return rc;
+
+	d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
+	d->nrdnlen = nrlen;
+	ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
+	*ptr = '\0';
+	data.data = d;
+
+	rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH );
+	if ( rc == 0 ) {
+		ei->bei_id = d->entryID;
+		ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
+		ptr = d->nrdn + nrlen + 1;
+		ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
+		if ( !ei->bei_parent->bei_dkids ) {
+			db_recno_t dkids;
+			/* How many children does the parent have? */
+			/* FIXME: do we need to lock the parent
+			 * entryinfo? Seems safe...
+			 */
+			cursor->c_count( cursor, &dkids, 0 );
+			ei->bei_parent->bei_dkids = dkids;
 		}
-		ptr[-1] = '\0';
 	}
-	return n ? 0 : DB_NOTFOUND;
+	cursor->c_close( cursor );
+	op->o_tmpfree( d, op->o_tmpmemctx );
+
+	return rc;
 }
 
 int
-bdb_dn2id(
-	BackendDB	*be,
+hdb_dn2id_parent(
+	Operation *op,
 	DB_TXN *txn,
-	const char	*dn,
-	ID *id )
+	EntryInfo *ei,
+	ID *idp )
 {
-	return bdb_dn2id_matched(be, txn, dn, id, NULL);
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+	DB *db = bdb->bi_dn2id->bdi_db;
+	DBT		key, data;
+	DBC	*cursor;
+	int		rc = 0;
+	diskNode *d;
+	char	*ptr;
+	unsigned char *pt2;
+
+	DBTzero(&key);
+	key.size = sizeof(ID);
+	key.data = &ei->bei_id;
+	key.ulen = sizeof(ID);
+	key.flags = DB_DBT_USERMEM;
+
+	DBTzero(&data);
+	data.flags = DB_DBT_USERMEM;
+
+	rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+	if ( rc ) return rc;
+
+	data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
+	d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
+	data.data = d;
+
+	rc = cursor->c_get( cursor, &key, &data, DB_SET );
+	if ( rc == 0 ) {
+		if (d->nrdnlen >= 0) {
+			rc = LDAP_OTHER;
+		} else {
+			db_recno_t dkids;
+			*idp = d->entryID;
+			ei->bei_nrdn.bv_len = 0 - d->nrdnlen;
+			ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
+			ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
+				ei->bei_nrdn.bv_len;
+			ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
+			ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
+			/* How many children does this node have? */
+			cursor->c_count( cursor, &dkids, 0 );
+			ei->bei_dkids = dkids;
+		}
+	}
+	cursor->c_close( cursor );
+	op->o_tmpfree( d, op->o_tmpmemctx );
+	return rc;
 }
 
 int
-bdb_dn2id_children(
-	BackendDB	*be,
+hdb_dn2id_children(
+	Operation *op,
 	DB_TXN *txn,
-	const char *dn )
+	Entry *e )
 {
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+	DB *db = bdb->bi_dn2id->bdi_db;
+	DBT		key, data;
+	DBC		*cursor;
 	int		rc;
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 	ID		id;
-	idNode *n;
+	diskNode d;
 
-	rc = bdb_dn2id(be, txn, dn, &id);
-	if (rc != 0)
-		return rc;
-
-	ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
-	n = bdb_find_id_node(id, bdb->bi_tree);
-	ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
+	DBTzero(&key);
+	key.size = sizeof(ID);
+	key.data = &e->e_id;
+	key.flags = DB_DBT_USERMEM;
 
-	if (!n->i_kids)
-		return DB_NOTFOUND;
-	else
-		return 0;
+#ifdef SLAP_IDL_CACHE
+	if ( bdb->bi_idl_cache_size ) {
+		rc = bdb_idl_cache_get( bdb, db, &key, NULL );
+		if ( rc != LDAP_NO_SUCH_OBJECT ) {
+			return rc;
+		}
+	}
+#endif
+	DBTzero(&data);
+	data.data = &d;
+	data.ulen = sizeof(d);
+	data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
+	data.dlen = sizeof(d);
+
+	rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+	if ( rc ) return rc;
+
+	rc = cursor->c_get( cursor, &key, &data, DB_SET );
+	if ( rc == 0 ) {
+		db_recno_t dkids;
+		rc = cursor->c_count( cursor, &dkids, 0 );
+		if ( rc == 0 ) {
+			BEI(e)->bei_dkids = dkids;
+			if ( dkids < 2 ) rc = DB_NOTFOUND;
+		}
+	}
+	cursor->c_close( cursor );
+	return rc;
 }
 
-/* Since we don't store IDLs for onelevel or subtree, we have to construct
- * them on the fly... Perhaps the i_kids tree ought to just be an IDL?
+/* bdb_dn2idl:
+ * We can't just use bdb_idl_fetch_key because
+ * 1 - our data items are longer than just an entry ID
+ * 2 - our data items are sorted alphabetically by nrdn, not by ID.
+ *
+ * We descend the tree recursively, so we define this cookie
+ * to hold our necessary state information. The bdb_dn2idl_internal
+ * function uses this cookie when calling itself.
  */
+
+struct dn2id_cookie {
+	struct bdb_info *bdb;
+	DB *db;
+	int prefix;
+	int rc;
+	EntryInfo *ei;
+	ID id;
+	ID dbuf;
+	ID *ids;
+	void *ptr;
+	ID tmp[BDB_IDL_DB_SIZE];
+	ID *buf;
+	DBT key;
+	DBT data;
+	DBC *dbc;
+	Operation *op;
+};
+
 static int
-insert_one(
-	idNode *n,
-	ID *ids
-)
+apply_func(
+	void *data,
+	void *arg )
 {
-	return bdb_idl_insert(ids, n->i_id);
+	EntryInfo *ei = data;
+	ID *idl = arg;
+
+	bdb_idl_insert( idl, ei->bei_id );
+	return 0;
 }
 
 static int
-insert_sub(
-	idNode *n,
-	ID *ids
+hdb_dn2idl_internal(
+	struct dn2id_cookie *cx
 )
 {
-	int rc;
+#ifdef SLAP_IDL_CACHE
+	if ( cx->bdb->bi_idl_cache_size ) {
+		cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
+		if ( cx->rc == DB_NOTFOUND ) {
+			return cx->rc;
+		}
+		if ( cx->rc == LDAP_SUCCESS ) {
+			goto gotit;
+		}
+	}
+#endif
+	BDB_IDL_ZERO( cx->tmp );
+
+	if ( !cx->ei ) {
+		cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
+		if ( !cx->ei ) {
+			cx->rc = DB_NOTFOUND;
+			goto saveit;
+		}
+	}
 
-	rc = bdb_idl_insert(ids, n->i_id);
-	if (rc == 0) {
-		ldap_pvt_thread_rdwr_rlock(&n->i_kids_rdwr);
-		rc = avl_apply(n->i_kids, (AVL_APPLY)insert_sub, ids, -1,
-			AVL_INORDER);
-		ldap_pvt_thread_rdwr_runlock(&n->i_kids_rdwr);
+	bdb_cache_entryinfo_lock( cx->ei );
+
+	/* If number of kids in the cache differs from on-disk, load
+	 * up all the kids from the database
+	 */
+	if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
+		EntryInfo ei;
+		db_recno_t dkids = cx->ei->bei_dkids;
+		ei.bei_parent = cx->ei;
+
+		bdb_cache_entryinfo_unlock( cx->ei );
+
+		cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
+			cx->bdb->bi_db_opflags );
+		if ( cx->rc ) return cx->rc;
+
+		cx->data.data = &cx->dbuf;
+		cx->data.ulen = sizeof(ID);
+		cx->data.dlen = sizeof(ID);
+		cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
+
+		/* The first item holds the parent ID. Ignore it. */
+		cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
+		if ( cx->rc ) {
+			cx->dbc->c_close( cx->dbc );
+			if ( cx->rc == DB_NOTFOUND ) goto saveit;
+			return cx->rc;
+		}
+
+		/* If the on-disk count is zero we've never checked it.
+		 * Count it now.
+		 */
+		if ( !dkids ) {
+			cx->dbc->c_count( cx->dbc, &dkids, 0 );
+			cx->ei->bei_dkids = dkids;
+		}
+
+		cx->data.data = cx->buf;
+		cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
+		cx->data.flags = DB_DBT_USERMEM;
+
+		/* Fetch the rest of the IDs in a loop... */
+		while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
+			DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
+			u_int8_t *j;
+			size_t len;
+			DB_MULTIPLE_INIT( cx->ptr, &cx->data );
+			while (cx->ptr) {
+				DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
+				if (j) {
+					EntryInfo *ei2;
+					diskNode *d = (diskNode *)j;
+					short nrlen;
+
+					AC_MEMCPY( &ei.bei_id, &d->entryID, sizeof(ID) );
+					AC_MEMCPY( &nrlen, &d->nrdnlen, sizeof(d->nrdnlen) );
+					ei.bei_nrdn.bv_len = nrlen;
+					/* nrdn/rdn are set in-place.
+					 * hdb_cache_load will copy them as needed
+					 */
+					ei.bei_nrdn.bv_val = d->nrdn;
+					ei.bei_rdn.bv_len = len - sizeof(diskNode) - ei.bei_nrdn.bv_len;
+					ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
+					bdb_idl_insert( cx->tmp, ei.bei_id );
+					hdb_cache_load( cx->bdb, &ei, &ei2 );
+				}
+			}
+		}
+		cx->rc = cx->dbc->c_close( cx->dbc );
+	} else {
+		/* The in-memory cache is in sync with the on-disk data.
+		 * do we have any kids?
+		 */
+		cx->rc = 0;
+		if ( cx->ei->bei_ckids > 0 ) {
+
+			/* Walk the kids tree; order is irrelevant since bdb_idl_insert
+			 * will insert in sorted order.
+			 */
+			avl_apply( cx->ei->bei_kids, apply_func, cx->tmp, -1, AVL_POSTORDER );
+		}
+		bdb_cache_entryinfo_unlock( cx->ei );
 	}
-	return rc;
+
+saveit:
+#ifdef SLAP_IDL_CACHE
+	if ( cx->bdb->bi_idl_cache_max_size ) {
+		bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
+	}
+#endif
+	;
+gotit:
+	if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
+		if ( cx->prefix == DN_SUBTREE_PREFIX ) {
+			if (cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS) {
+				bdb_idl_union( cx->ids, cx->tmp );
+			} else {
+				ID *save, idcurs;
+				EntryInfo *ei = cx->ei;
+				int nokids = 1;
+				save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
+					cx->op->o_tmpmemctx );
+				BDB_IDL_CPY( save, cx->tmp );
+				bdb_idl_union( cx->ids, cx->tmp );
+
+				idcurs = 0;
+				for ( cx->id = bdb_idl_first( save, &idcurs );
+					cx->id != NOID;
+					cx->id = bdb_idl_next( save, &idcurs )) {
+					cx->ei = NULL;
+					hdb_dn2idl_internal( cx );
+					if ( !BDB_IDL_IS_ZERO( cx->tmp ))
+						nokids = 0;
+				}
+				cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
+				if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
+			}
+			/* Make sure caller knows it had kids! */
+			cx->tmp[0]=1;
+
+			cx->rc = 0;
+		} else {
+			BDB_IDL_CPY( cx->ids, cx->tmp );
+		}
+	}
+	return cx->rc;
 }
 
 int
-bdb_dn2idl(
-	BackendDB	*be,
-	const char	*dn,
-	int prefix,
-	ID *ids )
+hdb_dn2idl(
+	Operation	*op,
+	Entry		*e,
+	ID *ids,
+	ID *stack )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
-	int		rc;
-	ID		id;
-	idNode		*n;
-
-	if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn)) {
-		BDB_IDL_ALL(bdb, ids);
+	struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
+	struct dn2id_cookie cx;
+
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, 
+		"=> hdb_dn2ididl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
+#endif
+
+#ifndef BDB_MULTIPLE_SUFFIXES
+	if ( op->ors_scope != LDAP_SCOPE_ONELEVEL && 
+		BEI(e)->bei_parent->bei_id == 0 )
+	{
+		BDB_IDL_ALL( bdb, ids );
 		return 0;
 	}
+#endif
+
+	cx.id = e->e_id;
+	cx.ei = BEI(e);
+	cx.bdb = bdb;
+	cx.db = cx.bdb->bi_dn2id->bdi_db;
+	cx.prefix = op->ors_scope == LDAP_SCOPE_ONELEVEL
+		? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
+	cx.ids = ids;
+	cx.buf = stack;
+	cx.op = op;
+
+	BDB_IDL_ZERO( ids );
+	if ( cx.prefix == DN_SUBTREE_PREFIX ) {
+		bdb_idl_insert( ids, cx.id );
+	}
 
-	rc = bdb_dn2id(be, NULL, dn, &id);
-	if (rc) return rc;
+	DBTzero(&cx.key);
+	cx.key.data = &cx.id;
+	cx.key.ulen = sizeof(ID);
+	cx.key.size = sizeof(ID);
+	cx.key.flags = DB_DBT_USERMEM;
 
-	ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
-	n = bdb_find_id_node(id, bdb->bi_tree);
-	ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
+	DBTzero(&cx.data);
 
-	ids[0] = 0;
-	ldap_pvt_thread_rdwr_rlock(&n->i_kids_rdwr);
-	if (prefix == DN_ONE_PREFIX) {
-		rc = avl_apply(n->i_kids, (AVL_APPLY)insert_one, ids, -1,
-			AVL_INORDER);
-	} else {
-		rc = avl_apply(n->i_kids, (AVL_APPLY)insert_sub, ids, -1,
-			AVL_INORDER);
-	}
-	ldap_pvt_thread_rdwr_runlock(&n->i_kids_rdwr);
-	return rc;
+	return hdb_dn2idl_internal(&cx);
 }
 #endif	/* BDB_HIER */