X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;ds=sidebyside;f=servers%2Fslapd%2Fback-bdb%2Ffilterindex.c;h=24b2cbe843c407fc2a012078d56455337711394a;hb=89127c93d02d547e89e767af0736ac6d2ebab90d;hp=b1d0059aee918893c5a5745c2c29c7129debde0b;hpb=9ad0c5a2e584396d00b9111da1d83f43fc954805;p=openldap

diff --git a/servers/slapd/back-bdb/filterindex.c b/servers/slapd/back-bdb/filterindex.c
index b1d0059aee..24b2cbe843 100644
--- a/servers/slapd/back-bdb/filterindex.c
+++ b/servers/slapd/back-bdb/filterindex.c
@@ -1,7 +1,7 @@
 /* filterindex.c - generate the list of candidate entries from a filter */
 /* $OpenLDAP$ */
 /*
- * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
  */
 
@@ -13,239 +13,374 @@
 #include "back-bdb.h"
 #include "idl.h"
 
-#ifdef BDB_FILTER_INDICES
-
 static int presence_candidates(
-	Backend *be,
+	Operation *op,
 	AttributeDescription *desc,
 	ID *ids );
 
 static int equality_candidates(
-	Backend *be,
+	Operation *op,
 	AttributeAssertion *ava,
 	ID *ids,
 	ID *tmp );
 static int approx_candidates(
-	Backend *be,
+	Operation *op,
 	AttributeAssertion *ava,
 	ID *ids,
 	ID *tmp );
 static int substring_candidates(
-	Backend *be,
+	Operation *op,
 	SubstringsAssertion *sub,
 	ID *ids,
 	ID *tmp );
 
 static int list_candidates(
-	Backend *be,
+	Operation *op,
 	Filter *flist,
 	int ftype,
 	ID *ids,
-	ID *tmp );
+	ID *tmp,
+	ID *stack );
 
 int
 bdb_filter_candidates(
-	Backend	*be,
+	Operation *op,
 	Filter	*f,
 	ID *ids,
-	ID *tmp )
+	ID *tmp,
+	ID *stack )
 {
-	int rc = -1;
+	int rc = 0;
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ENTRY, "=> bdb_filter_candidates\n", 0, 0, 0 );
+#else
 	Debug( LDAP_DEBUG_FILTER, "=> bdb_filter_candidates\n", 0, 0, 0 );
+#endif
 
 	switch ( f->f_choice ) {
+	case SLAPD_FILTER_COMPUTED:
+		break;
+
 	case SLAPD_FILTER_DN_ONE:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tDN ONE\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tDN ONE\n", 0, 0, 0 );
-		rc = bdb_dn2idl( be, f->f_dn, DN_ONE_PREFIX, ids );
+#endif
+		rc = bdb_dn2idl( op->o_bd, f->f_dn, DN_ONE_PREFIX, ids,
+			op->o_tmpmemctx );
+		if( rc == DB_NOTFOUND ) {
+			BDB_IDL_ZERO( ids );
+			rc = 0;
+		}
 		break;
 
 	case SLAPD_FILTER_DN_SUBTREE:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tDN SUBTREE\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tDN SUBTREE\n", 0, 0, 0 );
-		rc = bdb_dn2idl( be, f->f_dn, DN_SUBTREE_PREFIX, ids );
+#endif
+		rc = bdb_dn2idl( op->o_bd, f->f_dn, DN_SUBTREE_PREFIX, ids,
+			op->o_tmpmemctx );
 		break;
 
 	case LDAP_FILTER_PRESENT:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tPRESENT\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tPRESENT\n", 0, 0, 0 );
-		rc = presence_candidates( be, f->f_desc, ids );
+#endif
+		rc = presence_candidates( op, f->f_desc, ids );
 		break;
 
 	case LDAP_FILTER_EQUALITY:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tEQUALITY\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tEQUALITY\n", 0, 0, 0 );
-		rc = equality_candidates( be, f->f_ava, ids, tmp );
+#endif
+		rc = equality_candidates( op, f->f_ava, ids, tmp );
 		break;
 
 	case LDAP_FILTER_APPROX:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tAPPROX\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tAPPROX\n", 0, 0, 0 );
-		rc = approx_candidates( be, f->f_ava, ids, tmp );
+#endif
+		rc = approx_candidates( op, f->f_ava, ids, tmp );
 		break;
 
 	case LDAP_FILTER_SUBSTRINGS:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tSUBSTRINGS\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tSUBSTRINGS\n", 0, 0, 0 );
-		rc = substring_candidates( be, f->f_sub, ids, tmp );
+#endif
+		rc = substring_candidates( op, f->f_sub, ids, tmp );
 		break;
 
 	case LDAP_FILTER_GE:
 		/* no GE index, use pres */
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tGE\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tGE\n", 0, 0, 0 );
-		rc = presence_candidates( be, f->f_desc, ids );
+#endif
+		rc = presence_candidates( op, f->f_ava->aa_desc, ids );
 		break;
 
 	case LDAP_FILTER_LE:
 		/* no LE index, use pres */
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tLE\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tLE\n", 0, 0, 0 );
-		rc = presence_candidates( be, f->f_desc, ids );
+#endif
+		rc = presence_candidates( op, f->f_ava->aa_desc, ids );
 		break;
 
 	case LDAP_FILTER_NOT:
 		/* no indexing to support NOT filters */
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tNOT\n",0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tNOT\n", 0, 0, 0 );
+#endif
+		{ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+		BDB_IDL_ALL( bdb, ids );
+		}
 		break;
 
 	case LDAP_FILTER_AND:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tAND\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tAND\n", 0, 0, 0 );
-		rc = list_candidates( be, 
-			f->f_and, LDAP_FILTER_AND, ids, tmp );
+#endif
+		rc = list_candidates( op, 
+			f->f_and, LDAP_FILTER_AND, ids, tmp, stack );
 		break;
 
 	case LDAP_FILTER_OR:
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tOR\n", 0, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_FILTER, "\tOR\n", 0, 0, 0 );
-		rc = list_candidates( be, 
-			f->f_or, LDAP_FILTER_OR, ids, tmp );
+#endif
+		rc = list_candidates( op, 
+			f->f_or, LDAP_FILTER_OR, ids, tmp, stack );
 		break;
 
 	default:
-		Debug( LDAP_DEBUG_FILTER, "\tUNKNOWN %d\n",
-			f->f_choice, 0, 0 );
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "=> bdb_filter_candidates: \tUNKNOWN\n", 0, 0, 0 );
+#else
+		Debug( LDAP_DEBUG_FILTER, "\tUNKNOWN %lu\n",
+			(unsigned long) f->f_choice, 0, 0 );
+#endif
+		/* Must not return NULL, otherwise extended filters break */
+		{ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+		BDB_IDL_ALL( bdb, ids );
+		}
 	}
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, 
+		"<= bdb_filter_candidates: id=%ld first=%ld last=%ld\n", 
+		(long)ids[0], (long)BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ));
+#else
 	Debug( LDAP_DEBUG_FILTER,
 		"<= bdb_filter_candidates: id=%ld first=%ld last=%ld\n",
 		(long) ids[0],
 		(long) BDB_IDL_FIRST( ids ),
 		(long) BDB_IDL_LAST( ids ) );
+#endif
 
 	return rc;
 }
 
 static int
 list_candidates(
-	Backend	*be,
+	Operation *op,
 	Filter	*flist,
 	int		ftype,
 	ID *ids,
-	ID *tmp )
+	ID *tmp,
+	ID *save )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	int rc = 0;
 	Filter	*f;
 
-/* Systems that can't increase thread stack size will die with these
- * structures allocated on the stack. */
-#if !defined(LDAP_PVT_THREAD_STACK_SIZE) || (LDAP_PVT_THREAD_STACK_SIZE == 0)
-	ID *save = ch_malloc(BDB_IDL_UM_SIZEOF);
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ARGS, "=> bdb_list_candidates: 0x%x\n", ftype, 0 , 0 );
 #else
-	ID save[BDB_IDL_UM_SIZE];
-#endif
-
 	Debug( LDAP_DEBUG_FILTER, "=> bdb_list_candidates 0x%x\n", ftype, 0, 0 );
+#endif
 
-	if ( ftype == LDAP_FILTER_OR ) {
-		BDB_IDL_ALL( bdb, save );
-		BDB_IDL_ZERO( ids );
-	} else {
-		BDB_IDL_CPY( save, ids );
-	}
+	/* Copy so we can propagate pre-computed IDLs */
+	BDB_IDL_CPY( save, ids );
 
 	for ( f = flist; f != NULL; f = f->f_next ) {
-		rc = bdb_filter_candidates( be, f, save, tmp );
+		rc = bdb_filter_candidates( op, f, save, tmp,
+			save+BDB_IDL_UM_SIZE );
 
 		if ( rc != 0 ) {
-			/* Error: treat as undefined */
-			continue;
+			if ( ftype == LDAP_FILTER_AND ) {
+				rc = 0;
+				continue;
+			}
+			break;
 		}
+
 		
 		if ( ftype == LDAP_FILTER_AND ) {
-			bdb_idl_intersection( ids, save );
+			if ( f == flist ) {
+				BDB_IDL_CPY( ids, save );
+			} else {
+				bdb_idl_intersection( ids, save );
+			}
 			if( BDB_IDL_IS_ZERO( ids ) )
 				break;
 		} else {
-			bdb_idl_union( ids, save );
-			BDB_IDL_ALL( bdb, save );
+			if ( f == flist ) {
+				BDB_IDL_CPY( ids, save );
+			} else {
+				bdb_idl_union( ids, save );
+			}
 		}
 	}
-#if !defined(LDAP_PVT_THREAD_STACK_SIZE) || (LDAP_PVT_THREAD_STACK_SIZE == 0)
-	free(save);
+
+	if( rc == LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_list_candidates: id=%ld first=%ld last=%ld\n",
+			(long) ids[0], (long) BDB_IDL_FIRST( ids ), 
+			(long) BDB_IDL_LAST( ids ) );
+#else
+		Debug( LDAP_DEBUG_FILTER,
+			"<= bdb_list_candidates: id=%ld first=%ld last=%ld\n",
+			(long) ids[0],
+			(long) BDB_IDL_FIRST(ids),
+			(long) BDB_IDL_LAST(ids) );
 #endif
 
-	Debug( LDAP_DEBUG_FILTER,
-		"<= bdb_list_candidates: id=%ld first=%ld last=%ld\n",
-		(long) ids[0],
-		(long) BDB_IDL_FIRST(ids),
-		(long) BDB_IDL_LAST(ids) );
-	return 0;
+	} else {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, ARGS, "<= bdb_list_candidates: rc=%d\n", rc, 0, 0 );
+#else
+		Debug( LDAP_DEBUG_FILTER,
+			"<= bdb_list_candidates: undefined rc=%d\n",
+			rc, 0, 0 );
+#endif
+	}
+
+	return rc;
 }
 
 static int
 presence_candidates(
-	Backend	*be,
+	Operation *op,
 	AttributeDescription *desc,
 	ID *ids )
 {
-	struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+	struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 	DB *db;
 	int rc;
 	slap_mask_t mask;
-	struct berval prefix = {0};
+	struct berval prefix = {0, NULL};
 
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_presence_candidates\n", 0, 0, 0 );
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ENTRY, "=> bdb_presence_candidates (%s)\n", 
+			desc->ad_cname.bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> bdb_presence_candidates (%s)\n",
+			desc->ad_cname.bv_val, 0, 0 );
+#endif
 
 	if( desc == slap_schema.si_ad_objectClass ) {
 		BDB_IDL_ALL( bdb, ids );
 		return 0;
 	}
 
-	rc = bdb_index_param( be, desc, LDAP_FILTER_PRESENT,
+	rc = bdb_index_param( op->o_bd, desc, LDAP_FILTER_PRESENT,
 		&db, &mask, &prefix );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_presence_candidates: (%s) index_param "
+			"returned=%d\n",
+			desc->ad_cname.bv_val, rc, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_presence_candidates: index_param returned=%d\n",
-			rc, 0, 0 );
+			"<= bdb_presence_candidates: (%s) index_param "
+			"returned=%d\n",
+			desc->ad_cname.bv_val, rc, 0 );
+#endif
 		return 0;
 	}
 
 	if( db == NULL ) {
 		/* not indexed */
+#ifdef NEW_LOGGING
+		LDAP_LOG(INDEX, RESULTS, 
+			"<= bdb_presence_candidates: (%s) not indexed\n",
+			desc->ad_cname.bv_val, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_presence_candidates: not indexed\n",
-			0, 0, 0 );
+			"<= bdb_presence_candidates: (%s) not indexed\n",
+			desc->ad_cname.bv_val, 0, 0 );
+#endif
 		return 0;
 	}
 
 	if( prefix.bv_val == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG(INDEX, RESULTS, 
+			"<= bdb_presence_candidates: (%s) no prefix\n",
+			desc->ad_cname.bv_val, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_presence_candidates: no prefix\n",
-			0, 0, 0 );
+			"<= bdb_presence_candidates: (%s) no prefix\n",
+			desc->ad_cname.bv_val, 0, 0 );
+#endif
 		return 0;
 	}
 
-	rc = bdb_key_read( be, db, NULL, &prefix, ids );
+	rc = bdb_key_read( op->o_bd, db, NULL, &prefix, ids );
 
 	if( rc == DB_NOTFOUND ) {
 		BDB_IDL_ZERO( ids );
 		rc = 0;
 	} else if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_presence_candidates: (%s) "
+			"key read failed (%d)\n",
+			desc->ad_cname.bv_val, rc, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_presense_candidates: key read failed (%d)\n",
-			rc, 0, 0 );
+			"<= bdb_presense_candidates: (%s) "
+			"key read failed (%d)\n",
+			desc->ad_cname.bv_val, rc, 0 );
+#endif
 		goto done;
 	}
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, 
+		"<= bdb_presence_candidates: 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_presence_candidates: id=%ld first=%ld last=%ld\n",
 		(long) ids[0],
 		(long) BDB_IDL_FIRST(ids),
 		(long) BDB_IDL_LAST(ids) );
+#endif
 
 done:
 	return rc;
@@ -253,7 +388,7 @@ done:
 
 static int
 equality_candidates(
-	Backend	*be,
+	Operation *op,
 	AttributeAssertion *ava,
 	ID *ids,
 	ID *tmp )
@@ -262,25 +397,46 @@ equality_candidates(
 	int i;
 	int rc;
 	slap_mask_t mask;
-	struct berval prefix = {0};
+	struct berval prefix = {0, NULL};
 	struct berval *keys = NULL;
 	MatchingRule *mr;
 
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_equality_candidates\n", 0, 0, 0 );
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ENTRY, "=> bdb_equality_candidates (%s)\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> bdb_equality_candidates (%s)\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 
-	rc = bdb_index_param( be, ava->aa_desc, LDAP_FILTER_EQUALITY,
+	rc = bdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
 		&db, &mask, &prefix );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_equality_candidates: (%s) "
+			"index_param failed (%d)\n", 
+			ava->aa_desc->ad_cname.bv_val, rc, 0);
+#else
 		Debug( LDAP_DEBUG_ANY,
-			"<= bdb_equality_candidates: index_param failed (%d)\n",
-			rc, 0, 0 );
+			"<= bdb_equality_candidates: (%s) "
+			"index_param failed (%d)\n",
+			ava->aa_desc->ad_cname.bv_val, rc, 0 );
+#endif
 		return rc;
 	}
 
 	if ( db == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG(INDEX, RESULTS, 
+			"<= bdb_equality_candidates: (%s) not indexed\n", 
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_ANY,
-			"<= bdb_equality_candidates: not indexed\n", 0, 0, 0 );
+			"<= bdb_equality_candidates: (%s) not indexed\n", 
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 		return -1;
 	}
 
@@ -300,63 +456,103 @@ equality_candidates(
 		mr,
 		&prefix,
 		&ava->aa_value,
-		&keys );
+		&keys, op->o_tmpmemctx );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_equality_candidates: (%s, %s) "
+			"MR filter failed (%d)\n",
+			prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_equality_candidates: MR filter failed (%d)\n",
-			rc, 0, 0 );
+			"<= bdb_equality_candidates: (%s, %s) "
+			"MR filter failed (%d)\n",
+			prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
+#endif
 		return rc;
 	}
 
 	if( keys == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_equality_candidates: (%s) no keys\n", 
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_equality_candidates: no keys\n",
-			0, 0, 0 );
+			"<= bdb_equality_candidates: (%s) no keys\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 		return 0;
 	}
 
 	for ( i= 0; keys[i].bv_val != NULL; i++ ) {
-		rc = bdb_key_read( be, db, NULL, &keys[i], tmp );
+		rc = bdb_key_read( op->o_bd, db, NULL, &keys[i], tmp );
 
 		if( rc == DB_NOTFOUND ) {
 			BDB_IDL_ZERO( ids );
 			rc = 0;
+			break;
 		} else if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, RESULTS, 
+				"<= bdb_equality_candidates: (%s) "
+				"key read failed (%d)\n",
+				ava->aa_desc->ad_cname.bv_val, rc, 0 );
+#else
 			Debug( LDAP_DEBUG_TRACE,
-				"<= bdb_equality_candidates key read failed (%d)\n",
-				rc, 0, 0 );
+				"<= bdb_equality_candidates: (%s) "
+				"key read failed (%d)\n",
+				ava->aa_desc->ad_cname.bv_val, rc, 0 );
+#endif
 			break;
 		}
 
 		if( BDB_IDL_IS_ZERO( tmp ) ) {
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, RESULTS,
+				"<= bdb_equality_candidates: (%s) NULL\n",
+				ava->aa_desc->ad_cname.bv_val, 0, 0);
+#else
 			Debug( LDAP_DEBUG_TRACE,
-				"<= bdb_equality_candidates NULL\n",
-				0, 0, 0 );
+				"<= bdb_equality_candidates: (%s) NULL\n", 
+				ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 			BDB_IDL_ZERO( ids );
 			break;
 		}
 
-		bdb_idl_intersection( ids, tmp );
+		if ( i == 0 ) {
+			BDB_IDL_CPY( ids, tmp );
+		} else {
+			bdb_idl_intersection( ids, tmp );
+		}
 
 		if( BDB_IDL_IS_ZERO( ids ) )
 			break;
 	}
 
-	bvarray_free( keys );
+	ber_bvarray_free_x( keys, op->o_tmpmemctx );
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, 
+		"<= bdb_equality_candidates: 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_equality_candidates id=%ld, first=%ld, last=%ld\n",
+		"<= bdb_equality_candidates: id=%ld, first=%ld, last=%ld\n",
 		(long) ids[0],
 		(long) BDB_IDL_FIRST(ids),
 		(long) BDB_IDL_LAST(ids) );
+#endif
 	return( rc );
 }
 
 
 static int
 approx_candidates(
-	Backend	*be,
+	Operation *op,
 	AttributeAssertion *ava,
 	ID *ids,
 	ID *tmp )
@@ -365,25 +561,46 @@ approx_candidates(
 	int i;
 	int rc;
 	slap_mask_t mask;
-	struct berval prefix = {0};
+	struct berval prefix = {0, NULL};
 	struct berval *keys = NULL;
 	MatchingRule *mr;
 
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_approx_candidates\n", 0, 0, 0 );
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ENTRY, "=> bdb_approx_candidates (%s)\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> bdb_approx_candidates (%s)\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 
-	rc = bdb_index_param( be, ava->aa_desc, LDAP_FILTER_APPROX,
+	rc = bdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_APPROX,
 		&db, &mask, &prefix );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_approx_candidates: (%s) "
+			"index_param failed (%d)\n",
+			ava->aa_desc->ad_cname.bv_val, rc, 0 );
+#else
 		Debug( LDAP_DEBUG_ANY,
-			"<= bdb_approx_candidates: index_param failed (%d)\n",
-			rc, 0, 0 );
+			"<= bdb_approx_candidates: (%s) "
+			"index_param failed (%d)\n",
+			ava->aa_desc->ad_cname.bv_val, rc, 0 );
+#endif
 		return rc;
 	}
 
 	if ( db == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG(INDEX, RESULTS, 
+			"<= bdb_approx_candidates: (%s) not indexed\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_ANY,
-			"<= bdb_approx_candidates: not indexed\n", 0, 0, 0 );
+			"<= bdb_approx_candidates: (%s) not indexed\n",
+			ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 		return -1;
 	}
 
@@ -408,61 +625,101 @@ approx_candidates(
 		mr,
 		&prefix,
 		&ava->aa_value,
-		&keys );
+		&keys, op->o_tmpmemctx );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_approx_candidates: (%s, %s) "
+			"MR filter failed (%d)\n",
+			prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_approx_candidates: (%s) MR filter failed (%d)\n",
-			prefix.bv_val, rc, 0 );
+			"<= bdb_approx_candidates: (%s, %s) "
+			"MR filter failed (%d)\n",
+			prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
+#endif
 		return rc;
 	}
 
 	if( keys == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_approx_candidates: (%s) no keys (%s)\n",
+			prefix.bv_val, ava->aa_desc->ad_cname.bv_val, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_approx_candidates: no keys (%s)\n",
-			prefix.bv_val, 0, 0 );
+			"<= bdb_approx_candidates: (%s) no keys (%s)\n",
+			prefix.bv_val, ava->aa_desc->ad_cname.bv_val, 0 );
+#endif
 		return 0;
 	}
 
 	for ( i= 0; keys[i].bv_val != NULL; i++ ) {
-		rc = bdb_key_read( be, db, NULL, &keys[i], tmp );
+		rc = bdb_key_read( op->o_bd, db, NULL, &keys[i], tmp );
 
 		if( rc == DB_NOTFOUND ) {
 			BDB_IDL_ZERO( ids );
 			rc = 0;
 			break;
 		} else if( rc != LDAP_SUCCESS ) {
-			Debug( LDAP_DEBUG_TRACE, "<= bdb_approx_candidates key read failed (%d)\n",
-				rc, 0, 0 );
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, RESULTS, 
+				"<= bdb_approx_candidates: (%s) "
+				"key read failed (%d)\n",
+				ava->aa_desc->ad_cname.bv_val, rc, 0);
+#else
+			Debug( LDAP_DEBUG_TRACE,
+				"<= bdb_approx_candidates: (%s) "
+				"key read failed (%d)\n",
+				ava->aa_desc->ad_cname.bv_val, rc, 0 );
+#endif
 			break;
 		}
 
 		if( BDB_IDL_IS_ZERO( tmp ) ) {
-			Debug( LDAP_DEBUG_TRACE, "<= bdb_approx_candidates NULL\n",
-				0, 0, 0 );
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, RESULTS, 
+				"<= bdb_approx_candidates: (%s) NULL\n",
+				ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#else
+			Debug( LDAP_DEBUG_TRACE,
+				"<= bdb_approx_candidates: (%s) NULL\n",
+				ava->aa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 			BDB_IDL_ZERO( ids );
 			break;
 		}
 
-		bdb_idl_intersection( ids, tmp );
+		if ( i == 0 ) {
+			BDB_IDL_CPY( ids, tmp );
+		} else {
+			bdb_idl_intersection( ids, tmp );
+		}
 
 		if( BDB_IDL_IS_ZERO( ids ) )
 			break;
 	}
 
-	bvarray_free( keys );
+	ber_bvarray_free_x( keys, op->o_tmpmemctx );
 
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, 
+		"<= bdb_approx_candidates: 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_approx_candidates %ld, first=%ld, last=%ld\n",
 		(long) ids[0],
 		(long) BDB_IDL_FIRST(ids),
 		(long) BDB_IDL_LAST(ids) );
-
+#endif
 	return( rc );
 }
 
 static int
 substring_candidates(
-	Backend	*be,
+	Operation *op,
 	SubstringsAssertion	*sub,
 	ID *ids,
 	ID *tmp )
@@ -471,37 +728,57 @@ substring_candidates(
 	int i;
 	int rc;
 	slap_mask_t mask;
-	struct berval prefix = {0};
+	struct berval prefix = {0, NULL};
 	struct berval *keys = NULL;
 	MatchingRule *mr;
 
-	Debug( LDAP_DEBUG_TRACE, "=> bdb_substring_candidates\n", 0, 0, 0 );
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, ENTRY, "=> bdb_substring_candidates (%s)\n",
+			sub->sa_desc->ad_cname.bv_val, 0, 0 );
+#else
+	Debug( LDAP_DEBUG_TRACE, "=> bdb_substring_candidates (%s)\n",
+			sub->sa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 
-	rc = bdb_index_param( be, sub->sa_desc, LDAP_FILTER_SUBSTRINGS,
+	rc = bdb_index_param( op->o_bd, sub->sa_desc, LDAP_FILTER_SUBSTRINGS,
 		&db, &mask, &prefix );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_substring_candidates: (%s) "
+			"index_param failed (%d)\n",
+			sub->sa_desc->ad_cname.bv_val, rc, 0);
+#else
 		Debug( LDAP_DEBUG_ANY,
-			"<= bdb_substring_candidates: index_param failed (%d)\n",
-			rc, 0, 0 );
-		return 0;
+			"<= bdb_substring_candidates: (%s) "
+			"index_param failed (%d)\n",
+			sub->sa_desc->ad_cname.bv_val, rc, 0 );
+#endif
+		return rc;
 	}
 
 	if ( db == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_substring_candidates: (%s) not indexed\n",
+			sub->sa_desc->ad_cname.bv_val, 0, 0 );
+#else
 		Debug( LDAP_DEBUG_ANY,
-			"<= bdb_substring_candidates not indexed\n",
-			0, 0, 0 );
-		return 0;
+			"<= bdb_substring_candidates: (%s) not indexed\n",
+			sub->sa_desc->ad_cname.bv_val, 0, 0 );
+#endif
+		return -1;
 	}
 
 	mr = sub->sa_desc->ad_type->sat_substr;
 
 	if( !mr ) {
-		return 0;
+		return -1;
 	}
 
 	if( !mr->smr_filter ) {
-		return 0;
+		return -1;
 	}
 
 	rc = (mr->smr_filter)(
@@ -511,56 +788,95 @@ substring_candidates(
 		mr,
 		&prefix,
 		sub,
-		&keys );
+		&keys, op->o_tmpmemctx );
 
 	if( rc != LDAP_SUCCESS ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_substring_candidates: (%s) "
+			"MR filter failed (%d)\n", 
+			sub->sa_desc->ad_cname.bv_val, rc, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
-			"<= bdb_substring_candidates: (%s) MR filter failed (%d)\n",
+			"<= bdb_substring_candidates: (%s) "
+			"MR filter failed (%d)\n",
 			sub->sa_desc->ad_cname.bv_val, rc, 0 );
-		return 0;
+#endif
+		return rc;
 	}
 
 	if( keys == NULL ) {
+#ifdef NEW_LOGGING
+		LDAP_LOG ( INDEX, RESULTS, 
+			"<= bdb_substring_candidates: (0x%04lx) no keys (%s)\n",
+			mask, sub->sa_desc->ad_cname.bv_val, 0 );
+#else
 		Debug( LDAP_DEBUG_TRACE,
 			"<= bdb_substring_candidates: (0x%04lx) no keys (%s)\n",
 			mask, sub->sa_desc->ad_cname.bv_val, 0 );
+#endif
 		return 0;
 	}
 
 	for ( i= 0; keys[i].bv_val != NULL; i++ ) {
-		rc = bdb_key_read( be, db, NULL, &keys[i], tmp );
+		rc = bdb_key_read( op->o_bd, db, NULL, &keys[i], tmp );
 
 		if( rc == DB_NOTFOUND ) {
 			BDB_IDL_ZERO( ids );
 			rc = 0;
 			break;
 		} else if( rc != LDAP_SUCCESS ) {
-			Debug( LDAP_DEBUG_TRACE, "<= bdb_substring_candidates key read failed (%d)\n",
-				rc, 0, 0 );
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, RESULTS, 
+				"<= bdb_substring_candidates: (%s) "
+				"key read failed (%d)\n",
+				sub->sa_desc->ad_cname.bv_val, rc, 0 );
+#else
+			Debug( LDAP_DEBUG_TRACE,
+				"<= bdb_substring_candidates: (%s) "
+				"key read failed (%d)\n",
+				sub->sa_desc->ad_cname.bv_val, rc, 0 );
+#endif
 			break;
 		}
 
 		if( BDB_IDL_IS_ZERO( tmp ) ) {
-			Debug( LDAP_DEBUG_TRACE, "<= bdb_substring_candidates NULL\n",
-				0, 0, 0 );
+#ifdef NEW_LOGGING
+			LDAP_LOG ( INDEX, RESULTS, 
+				"<= bdb_substring_candidates: (%s) NULL\n",
+				sub->sa_desc->ad_cname.bv_val, 0, 0 );
+#else
+			Debug( LDAP_DEBUG_TRACE,
+				"<= bdb_substring_candidates: (%s) NULL\n",
+				sub->sa_desc->ad_cname.bv_val, 0, 0 );
+#endif
 			BDB_IDL_ZERO( ids );
 			break;
 		}
 
-		bdb_idl_intersection( ids, tmp );
+		if ( i == 0 ) {
+			BDB_IDL_CPY( ids, tmp );
+		} else {
+			bdb_idl_intersection( ids, tmp );
+		}
 
 		if( BDB_IDL_IS_ZERO( ids ) )
 			break;
 	}
 
-	bvarray_free( keys );
+	ber_bvarray_free_x( keys, op->o_tmpmemctx );
 
-	Debug( LDAP_DEBUG_TRACE, "<= bdb_substring_candidates %ld, first=%ld, last=%ld\n",
+#ifdef NEW_LOGGING
+	LDAP_LOG ( INDEX, RESULTS, 
+		"<= bdb_substring_candidates: 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_substring_candidates: %ld, first=%ld, last=%ld\n",
 		(long) ids[0],
 		(long) BDB_IDL_FIRST(ids),
 		(long) BDB_IDL_LAST(ids) );
-
+#endif
 	return( 0 );
 }
 
-#endif