mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
700 lines
16 KiB
C
700 lines
16 KiB
C
/* search.c - search operation */
|
|
/* $OpenLDAP$ */
|
|
/*
|
|
* Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
#include <ac/string.h>
|
|
|
|
#include "back-bdb.h"
|
|
#include "idl.h"
|
|
#include "external.h"
|
|
|
|
static int base_candidate(
|
|
BackendDB *be,
|
|
Entry *e,
|
|
ID *ids );
|
|
static int search_candidates(
|
|
BackendDB *be,
|
|
Operation *op,
|
|
Entry *e,
|
|
Filter *filter,
|
|
int scope,
|
|
int deref,
|
|
ID *ids );
|
|
|
|
int
|
|
bdb_search(
|
|
BackendDB *be,
|
|
Connection *conn,
|
|
Operation *op,
|
|
struct berval *base,
|
|
struct berval *nbase,
|
|
int scope,
|
|
int deref,
|
|
int slimit,
|
|
int tlimit,
|
|
Filter *filter,
|
|
struct berval *filterstr,
|
|
AttributeName *attrs,
|
|
int attrsonly )
|
|
{
|
|
struct bdb_info *bdb = (struct bdb_info *) be->be_private;
|
|
int rc;
|
|
const char *text = NULL;
|
|
time_t stoptime;
|
|
ID id, cursor;
|
|
ID candidates[BDB_IDL_UM_SIZE];
|
|
Entry *e = NULL;
|
|
BerVarray v2refs = NULL;
|
|
Entry *matched = NULL;
|
|
struct berval realbase = { 0, NULL };
|
|
int nentries = 0;
|
|
int manageDSAit;
|
|
|
|
struct slap_limits_set *limit = NULL;
|
|
int isroot = 0;
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_ENTRY,"bdb_back_search\n"));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
|
|
0, 0, 0);
|
|
#endif
|
|
|
|
manageDSAit = get_manageDSAit( op );
|
|
|
|
if ( nbase->bv_len == 0 ) {
|
|
/* DIT root special case */
|
|
e = (Entry *) &slap_entry_root;
|
|
rc = 0;
|
|
} else
|
|
#ifdef BDB_ALIASES
|
|
/* get entry with reader lock */
|
|
if ( deref & LDAP_DEREF_FINDING ) {
|
|
e = deref_dn_r( be, nbase-, &err, &matched, &text );
|
|
|
|
} else
|
|
#endif
|
|
{
|
|
rc = bdb_dn2entry_r( be, NULL, nbase, &e, &matched, 0 );
|
|
}
|
|
|
|
switch(rc) {
|
|
case DB_NOTFOUND:
|
|
case 0:
|
|
break;
|
|
default:
|
|
if (e != NULL) {
|
|
bdb_cache_return_entry_r(&bdb->bi_cache, e);
|
|
}
|
|
if (matched != NULL) {
|
|
bdb_cache_return_entry_r(&bdb->bi_cache, matched);
|
|
}
|
|
send_ldap_result( conn, op, rc=LDAP_OTHER,
|
|
NULL, "internal error", NULL, NULL );
|
|
return rc;
|
|
}
|
|
|
|
if ( e == NULL ) {
|
|
struct berval matched_dn = { 0, NULL };
|
|
BerVarray refs = NULL;
|
|
|
|
if ( matched != NULL ) {
|
|
BerVarray erefs;
|
|
|
|
ber_dupbv( &matched_dn, &matched->e_name );
|
|
|
|
erefs = is_entry_referral( matched )
|
|
? get_entry_referrals( be, conn, op, matched )
|
|
: NULL;
|
|
|
|
bdb_cache_return_entry_r (&bdb->bi_cache, matched);
|
|
matched = NULL;
|
|
|
|
if( erefs ) {
|
|
refs = referral_rewrite( erefs, &matched_dn,
|
|
base, scope );
|
|
ber_bvarray_free( erefs );
|
|
}
|
|
|
|
} else {
|
|
refs = referral_rewrite( default_referral,
|
|
NULL, base, scope );
|
|
}
|
|
|
|
send_ldap_result( conn, op, rc=LDAP_REFERRAL ,
|
|
matched_dn.bv_val, text, refs, NULL );
|
|
|
|
if ( refs ) ber_bvarray_free( refs );
|
|
if ( matched_dn.bv_val ) ber_memfree( matched_dn.bv_val );
|
|
return rc;
|
|
}
|
|
|
|
if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
|
|
/* entry is a referral, don't allow add */
|
|
struct berval matched_dn;
|
|
BerVarray erefs, refs;
|
|
|
|
ber_dupbv( &matched_dn, &e->e_name );
|
|
erefs = get_entry_referrals( be, conn, op, e );
|
|
refs = NULL;
|
|
|
|
bdb_cache_return_entry_r( &bdb->bi_cache, e );
|
|
e = NULL;
|
|
|
|
if( erefs ) {
|
|
refs = referral_rewrite( erefs, &matched_dn,
|
|
base, scope );
|
|
ber_bvarray_free( erefs );
|
|
}
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_RESULTS,"bdb_search: entry is referral\n"));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
|
|
0, 0, 0 );
|
|
#endif
|
|
|
|
send_ldap_result( conn, op, LDAP_REFERRAL,
|
|
matched_dn.bv_val,
|
|
refs ? NULL : "bad referral object",
|
|
refs, NULL );
|
|
|
|
ber_bvarray_free( refs );
|
|
ber_memfree( matched_dn.bv_val );
|
|
return 1;
|
|
}
|
|
|
|
/* if not root, get appropriate limits */
|
|
if ( be_isroot( be, &op->o_ndn ) ) {
|
|
isroot = 1;
|
|
} else {
|
|
( void ) get_limits( be, &op->o_ndn, &limit );
|
|
}
|
|
|
|
/* The time/size limits come first because they require very little
|
|
* effort, so there's no chance the candidates are selected and then
|
|
* the request is not honored only because of time/size constraints */
|
|
|
|
/* if no time limit requested, use soft limit (unless root!) */
|
|
if ( isroot ) {
|
|
if ( tlimit == 0 ) {
|
|
tlimit = -1; /* allow root to set no limit */
|
|
}
|
|
|
|
if ( slimit == 0 ) {
|
|
slimit = -1;
|
|
}
|
|
|
|
} else {
|
|
/* if no limit is required, use soft limit */
|
|
if ( tlimit <= 0 ) {
|
|
tlimit = limit->lms_t_soft;
|
|
|
|
/* if requested limit higher than hard limit, abort */
|
|
} else if ( tlimit > limit->lms_t_hard ) {
|
|
/* no hard limit means use soft instead */
|
|
if ( limit->lms_t_hard == 0 ) {
|
|
tlimit = limit->lms_t_soft;
|
|
|
|
/* positive hard limit means abort */
|
|
} else if ( limit->lms_t_hard > 0 ) {
|
|
send_search_result( conn, op,
|
|
LDAP_UNWILLING_TO_PERFORM,
|
|
NULL, NULL, NULL, NULL, 0 );
|
|
rc = 0;
|
|
goto done;
|
|
}
|
|
|
|
/* negative hard limit means no limit */
|
|
}
|
|
|
|
/* if no limit is required, use soft limit */
|
|
if ( slimit <= 0 ) {
|
|
slimit = limit->lms_s_soft;
|
|
|
|
/* if requested limit higher than hard limit, abort */
|
|
} else if ( slimit > limit->lms_s_hard ) {
|
|
/* no hard limit means use soft instead */
|
|
if ( limit->lms_s_hard == 0 ) {
|
|
slimit = limit->lms_s_soft;
|
|
|
|
/* positive hard limit means abort */
|
|
} else if ( limit->lms_s_hard > 0 ) {
|
|
send_search_result( conn, op,
|
|
LDAP_UNWILLING_TO_PERFORM,
|
|
NULL, NULL, NULL, NULL, 0 );
|
|
rc = 0;
|
|
goto done;
|
|
}
|
|
|
|
/* negative hard limit means no limit */
|
|
}
|
|
}
|
|
|
|
/* compute it anyway; root does not use it */
|
|
stoptime = op->o_time + tlimit;
|
|
|
|
/* select candidates */
|
|
if ( scope == LDAP_SCOPE_BASE ) {
|
|
rc = base_candidate( be, e, candidates );
|
|
|
|
} else {
|
|
BDB_IDL_ALL( bdb, candidates );
|
|
rc = search_candidates( be, op, e, filter,
|
|
scope, deref, candidates );
|
|
}
|
|
|
|
/* need normalized dn below */
|
|
ber_dupbv( &realbase, &e->e_nname );
|
|
|
|
/* start cursor at base entry's id
|
|
* FIXME: hack to make "" base work
|
|
* FIXME: moddn needs to assign new ID for this to work
|
|
*/
|
|
cursor = e->e_id == NOID ? 1 : e->e_id;
|
|
|
|
if ( e != &slap_entry_root ) {
|
|
bdb_cache_return_entry_r(&bdb->bi_cache, e);
|
|
}
|
|
e = NULL;
|
|
|
|
if ( candidates[0] == 0 ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_RESULTS,"bdb_search: no candidates\n"));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
|
|
0, 0, 0 );
|
|
#endif
|
|
|
|
send_search_result( conn, op,
|
|
LDAP_SUCCESS,
|
|
NULL, NULL, NULL, NULL, 0 );
|
|
|
|
rc = 1;
|
|
goto done;
|
|
}
|
|
|
|
/* if not root and candidates exceed to-be-checked entries, abort */
|
|
if ( !isroot && limit->lms_s_unchecked != -1 ) {
|
|
if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
|
|
send_search_result( conn, op,
|
|
LDAP_UNWILLING_TO_PERFORM,
|
|
NULL, NULL, NULL, NULL, 0 );
|
|
rc = 1;
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
for ( id = bdb_idl_first( candidates, &cursor );
|
|
id != NOID;
|
|
id = bdb_idl_next( candidates, &cursor ) )
|
|
{
|
|
int scopeok = 0;
|
|
|
|
/* check for abandon */
|
|
if ( op->o_abandon ) {
|
|
rc = 0;
|
|
goto done;
|
|
}
|
|
|
|
/* check time limit */
|
|
if ( tlimit != -1 && slap_get_time() > stoptime ) {
|
|
send_search_result( conn, op, rc = LDAP_TIMELIMIT_EXCEEDED,
|
|
NULL, NULL, v2refs, NULL, nentries );
|
|
goto done;
|
|
}
|
|
|
|
/* get the entry with reader lock */
|
|
rc = bdb_id2entry_r( be, NULL, id, &e );
|
|
|
|
if ( e == NULL ) {
|
|
if( !BDB_IDL_IS_RANGE(candidates) ) {
|
|
/* only complain for non-range IDLs */
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_RESULTS,"bdb_search: candidate %ld not found\n", (long) id));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
"bdb_search: candidate %ld not found\n",
|
|
(long) id, 0, 0 );
|
|
#endif
|
|
}
|
|
|
|
goto loop_continue;
|
|
}
|
|
|
|
#ifdef BDB_SUBENTRIES
|
|
if ( is_entry_subentry( e ) ) {
|
|
if( scope != LDAP_SCOPE_BASE ) {
|
|
if(!get_subentries_visibility( op )) {
|
|
/* only subentries are visible */
|
|
goto loop_continue;
|
|
}
|
|
|
|
} else if ( get_subentries( op ) &&
|
|
!get_subentries_visibility( op ))
|
|
{
|
|
/* only subentries are visible */
|
|
goto loop_continue;
|
|
}
|
|
|
|
} else if ( get_subentries_visibility( op )) {
|
|
/* only subentries are visible */
|
|
goto loop_continue;
|
|
}
|
|
#endif
|
|
|
|
#ifdef BDB_ALIASES
|
|
if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
|
|
Entry *matched;
|
|
int err;
|
|
const char *text;
|
|
|
|
e = deref_entry_r( be, e, &err, &matched, &text );
|
|
|
|
if( e == NULL ) {
|
|
e = matched;
|
|
goto loop_continue;
|
|
}
|
|
|
|
if( e->e_id == id ) {
|
|
/* circular loop */
|
|
goto loop_continue;
|
|
}
|
|
|
|
/* need to skip alias which deref into scope */
|
|
if( scope & LDAP_SCOPE_ONELEVEL ) {
|
|
struct berval pdn;
|
|
|
|
dnParent( &e->e_nname, &pdn ):
|
|
if ( ber_bvcmp( pdn, &realbase ) ) {
|
|
goto loop_continue;
|
|
}
|
|
|
|
} else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
|
|
/* alias is within scope */
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_RESULTS,"bdb_search: \"%s\" in subtree\n", e->edn));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
"bdb_search: \"%s\" in subtree\n",
|
|
e->e_dn, 0, 0 );
|
|
#endif
|
|
goto loop_continue;
|
|
}
|
|
|
|
scopeok = 1;
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* if it's a referral, add it to the list of referrals. only do
|
|
* this for non-base searches, and don't check the filter
|
|
* explicitly here since it's only a candidate anyway.
|
|
*/
|
|
if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
|
|
is_entry_referral( e ) )
|
|
{
|
|
BerVarray erefs = get_entry_referrals(
|
|
be, conn, op, e );
|
|
BerVarray refs = referral_rewrite( erefs,
|
|
&e->e_name, NULL,
|
|
scope == LDAP_SCOPE_SUBTREE
|
|
? LDAP_SCOPE_SUBTREE
|
|
: LDAP_SCOPE_BASE );
|
|
|
|
send_search_reference( be, conn, op,
|
|
e, refs, NULL, &v2refs );
|
|
|
|
ber_bvarray_free( refs );
|
|
|
|
goto loop_continue;
|
|
}
|
|
|
|
/* if it matches the filter and scope, send it */
|
|
rc = test_filter( be, conn, op, e, filter );
|
|
if ( rc == LDAP_COMPARE_TRUE ) {
|
|
struct berval dn;
|
|
|
|
/* check scope */
|
|
if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
|
|
if ( be_issuffix( be, &e->e_nname ) ) {
|
|
scopeok = (realbase.bv_len == 0);
|
|
} else {
|
|
dnParent( &e->e_nname, &dn );
|
|
scopeok = dn_match( &dn, &realbase );
|
|
}
|
|
|
|
} else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
|
|
scopeok = dnIsSuffix( &e->e_nname, &realbase );
|
|
|
|
} else {
|
|
scopeok = 1;
|
|
}
|
|
|
|
if ( scopeok ) {
|
|
/* check size limit */
|
|
if ( --slimit == -1 ) {
|
|
bdb_cache_return_entry_r (&bdb->bi_cache, e);
|
|
e = NULL;
|
|
send_search_result( conn, op,
|
|
rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
|
|
v2refs, NULL, nentries );
|
|
goto done;
|
|
}
|
|
|
|
if (e) {
|
|
int result;
|
|
|
|
if( op->o_noop ) {
|
|
result = 0;
|
|
} else {
|
|
result = send_search_entry( be, conn, op,
|
|
e, attrs, attrsonly, NULL);
|
|
}
|
|
|
|
switch (result) {
|
|
case 0: /* entry sent ok */
|
|
nentries++;
|
|
break;
|
|
case 1: /* entry not sent */
|
|
break;
|
|
case -1: /* connection closed */
|
|
bdb_cache_return_entry_r(&bdb->bi_cache, e);
|
|
e = NULL;
|
|
rc = LDAP_OTHER;
|
|
goto done;
|
|
}
|
|
}
|
|
} else {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_RESULTS,"bdb_search: %ld scope not okay\n", (long) id));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
"bdb_search: %ld scope not okay\n",
|
|
(long) id, 0, 0 );
|
|
#endif
|
|
}
|
|
} else {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_RESULTS,"bdb_search: %ld does match filter\n", (long) id));
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE,
|
|
"bdb_search: %ld does match filter\n",
|
|
(long) id, 0, 0 );
|
|
#endif
|
|
}
|
|
|
|
loop_continue:
|
|
if( e != NULL ) {
|
|
/* free reader lock */
|
|
bdb_cache_return_entry_r ( &bdb->bi_cache, e );
|
|
e = NULL;
|
|
}
|
|
|
|
ldap_pvt_thread_yield();
|
|
}
|
|
send_search_result( conn, op,
|
|
v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
|
|
NULL, NULL, v2refs, NULL, nentries );
|
|
|
|
rc = 0;
|
|
|
|
done:
|
|
if( e != NULL ) {
|
|
/* free reader lock */
|
|
bdb_cache_return_entry_r ( &bdb->bi_cache, e );
|
|
}
|
|
|
|
if( v2refs ) ber_bvarray_free( v2refs );
|
|
if( realbase.bv_val ) ch_free( realbase.bv_val );
|
|
|
|
return rc;
|
|
}
|
|
|
|
|
|
static int base_candidate(
|
|
BackendDB *be,
|
|
Entry *e,
|
|
ID *ids )
|
|
{
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_ENTRY,"base_candidate: base: \"%s\" (0x%08lx)\n", e->e_dn, (long) e->e_id));
|
|
#else
|
|
Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
|
|
e->e_dn, (long) e->e_id, 0);
|
|
#endif
|
|
|
|
ids[0] = 1;
|
|
ids[1] = e->e_id;
|
|
return 0;
|
|
}
|
|
|
|
/* Is "objectClass=xx" mentioned anywhere in this filter? Presence
|
|
* doesn't count, we're looking for explicit values. Also count depth
|
|
* of filter tree while we're at it.
|
|
*/
|
|
static int oc_filter(
|
|
Filter *f,
|
|
int cur,
|
|
int *max
|
|
)
|
|
{
|
|
int rc = 0;
|
|
|
|
if( cur > *max ) *max = cur;
|
|
|
|
switch(f->f_choice) {
|
|
case LDAP_FILTER_EQUALITY:
|
|
case LDAP_FILTER_APPROX:
|
|
if (f->f_av_desc == slap_schema.si_ad_objectClass)
|
|
rc = 1;
|
|
break;
|
|
|
|
case LDAP_FILTER_SUBSTRINGS:
|
|
if (f->f_sub_desc == slap_schema.si_ad_objectClass)
|
|
rc = 1;
|
|
break;
|
|
|
|
case LDAP_FILTER_AND:
|
|
case LDAP_FILTER_OR:
|
|
cur++;
|
|
for (f=f->f_and; f; f=f->f_next)
|
|
if ((rc = oc_filter(f, cur, max)))
|
|
break;
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
static int search_candidates(
|
|
BackendDB *be,
|
|
Operation *op,
|
|
Entry *e,
|
|
Filter *filter,
|
|
int scope,
|
|
int deref,
|
|
ID *ids )
|
|
{
|
|
int rc, depth = 1;
|
|
Filter f, scopef, rf, xf;
|
|
ID *stack;
|
|
AttributeAssertion aa_ref;
|
|
#ifdef BDB_SUBENTRIES
|
|
Filter sf;
|
|
AttributeAssertion aa_subentry;
|
|
#endif
|
|
#ifdef BDB_ALIASES
|
|
Filter af;
|
|
AttributeAssertion aa_alias;
|
|
#endif
|
|
|
|
/*
|
|
* This routine takes as input a filter (user-filter)
|
|
* and rewrites it as follows:
|
|
* (&(scope=DN)[(objectClass=subentry)]
|
|
* (|[(objectClass=referral)(objectClass=alias)](user-filter))
|
|
*/
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_ENTRY,"search_candidates: base=\"%s\" (0x%08lx) scope=%d\n", e->e_dn, (long) e->e_id, scope));
|
|
#else
|
|
Debug(LDAP_DEBUG_TRACE,
|
|
"search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
|
|
e->e_dn, (long) e->e_id, scope );
|
|
#endif
|
|
|
|
xf.f_or = filter;
|
|
xf.f_choice = LDAP_FILTER_OR;
|
|
xf.f_next = NULL;
|
|
|
|
/* If the user's filter doesn't mention objectClass, or if
|
|
* it just uses objectClass=*, these clauses are redundant.
|
|
*/
|
|
if (oc_filter(filter, 1, &depth) && !get_subentries_visibility(op) ) {
|
|
if( !get_manageDSAit(op) ) { /* match referrals */
|
|
struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
|
|
rf.f_choice = LDAP_FILTER_EQUALITY;
|
|
rf.f_ava = &aa_ref;
|
|
rf.f_av_desc = slap_schema.si_ad_objectClass;
|
|
rf.f_av_value = bv_ref;
|
|
rf.f_next = xf.f_or;
|
|
xf.f_or = &rf;
|
|
}
|
|
|
|
#ifdef BDB_ALIASES
|
|
if( deref & LDAP_DEREF_SEARCHING ) { /* match aliases */
|
|
struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
|
|
af.f_choice = LDAP_FILTER_EQUALITY;
|
|
af.f_ava = &aa_alias;
|
|
af.f_av_desc = slap_schema.si_ad_objectClass;
|
|
af.f_av_value = bv_alias;
|
|
af.f_next = xf.f_or;
|
|
xf.f_or = ⁡
|
|
}
|
|
#endif
|
|
/* We added one of these clauses, filter depth increased */
|
|
if( xf.f_or != filter ) depth++;
|
|
}
|
|
|
|
f.f_next = NULL;
|
|
f.f_choice = LDAP_FILTER_AND;
|
|
f.f_and = &scopef;
|
|
scopef.f_choice = scope == LDAP_SCOPE_SUBTREE
|
|
? SLAPD_FILTER_DN_SUBTREE
|
|
: SLAPD_FILTER_DN_ONE;
|
|
scopef.f_dn = &e->e_nname;
|
|
scopef.f_next = xf.f_or == filter ? filter : &xf ;
|
|
/* Filter depth increased again, adding scope clause */
|
|
depth++;
|
|
|
|
#ifdef BDB_SUBENTRIES
|
|
if( get_subentries_visibility( op ) ) {
|
|
struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
|
|
sf.f_choice = LDAP_FILTER_EQUALITY;
|
|
sf.f_ava = &aa_subentry;
|
|
sf.f_av_desc = slap_schema.si_ad_objectClass;
|
|
sf.f_av_value = bv_subentry;
|
|
sf.f_next = scopef.f_next;
|
|
scopef.f_next = &sf;
|
|
}
|
|
#endif
|
|
|
|
/* Allocate IDL stack, plus 1 more for former tmp */
|
|
stack = malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
|
|
|
|
rc = bdb_filter_candidates( be, &f, ids, stack, stack+BDB_IDL_UM_SIZE );
|
|
|
|
free( stack );
|
|
|
|
if( rc ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_DETAIL1,"bdb_search_candidates: failed (rc=%d)\n", rc));
|
|
#else
|
|
Debug(LDAP_DEBUG_TRACE,
|
|
"bdb_search_candidates: failed (rc=%d)\n",
|
|
rc, NULL, NULL );
|
|
#endif
|
|
|
|
} else {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG (( "search", LDAP_LEVEL_DETAIL1,"bdb_search_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_search_candidates: id=%ld first=%ld last=%ld\n",
|
|
(long) ids[0],
|
|
(long) BDB_IDL_FIRST(ids),
|
|
(long) BDB_IDL_LAST(ids) );
|
|
#endif
|
|
}
|
|
|
|
return rc;
|
|
}
|