1 /* search.c - search operation */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
17 static int base_candidate(
21 static int search_candidates(
42 struct berval *filterstr,
46 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
48 const char *text = NULL;
51 ID candidates[BDB_IDL_UM_SIZE];
53 BerVarray v2refs = NULL;
54 Entry *matched = NULL;
55 struct berval realbase = { 0, NULL };
59 #ifdef LDAP_CLIENT_UPDATE
60 Filter lcupf, csnfnot, csnfeq, csnfand, csnfge;
61 AttributeAssertion aa_ge, aa_eq;
63 struct berval entrycsn_bv = { 0, NULL };
64 struct berval latest_entrycsn_bv = { 0, NULL };
65 #endif /* LDAP_CLIENT_UPDATE */
67 struct slap_limits_set *limit = NULL;
74 LDAP_LOG ( OPERATION, ENTRY, "bdb_back_search\n", 0, 0, 0 );
76 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
80 #ifdef LDAP_CLIENT_UPDATE
81 if ( op->o_clientupdate_type & SLAP_LCUP_PERSIST ) {
82 bdb_add_psearch_spec( be, conn, op, base, base, scope,
83 deref, slimit, tlimit, filter, filterstr, attrs, attrsonly );
89 manageDSAit = get_manageDSAit( op );
91 rc = LOCK_ID (bdb->bi_dbenv, &locker );
96 send_ldap_result( conn, op, rc=LDAP_OTHER,
97 NULL, "internal error", NULL, NULL );
101 if ( nbase->bv_len == 0 ) {
102 /* DIT root special case */
103 e = (Entry *) &slap_entry_root;
107 /* get entry with reader lock */
108 if ( deref & LDAP_DEREF_FINDING ) {
109 e = deref_dn_r( be, nbase-, &err, &matched, &text );
115 rc = bdb_dn2entry_r( be, NULL, nbase, &e, &matched, 0, locker, &lock );
124 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
126 if (matched != NULL) {
127 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
129 send_ldap_result( conn, op, LDAP_BUSY,
130 NULL, "ldap server busy", NULL, NULL );
131 LOCK_ID_FREE (bdb->bi_dbenv, locker );
133 case DB_LOCK_DEADLOCK:
134 case DB_LOCK_NOTGRANTED:
138 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
140 if (matched != NULL) {
141 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
143 send_ldap_result( conn, op, rc=LDAP_OTHER,
144 NULL, "internal error", NULL, NULL );
145 LOCK_ID_FREE (bdb->bi_dbenv, locker );
150 struct berval matched_dn = { 0, NULL };
151 BerVarray refs = NULL;
153 if ( matched != NULL ) {
155 ber_dupbv( &matched_dn, &matched->e_name );
157 erefs = is_entry_referral( matched )
158 ? get_entry_referrals( be, conn, op, matched )
161 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
165 refs = referral_rewrite( erefs, &matched_dn,
167 ber_bvarray_free( erefs );
171 refs = referral_rewrite( default_referral,
175 send_ldap_result( conn, op, rc=LDAP_REFERRAL ,
176 matched_dn.bv_val, text, refs, NULL );
178 LOCK_ID_FREE (bdb->bi_dbenv, locker );
179 if ( refs ) ber_bvarray_free( refs );
180 if ( matched_dn.bv_val ) ber_memfree( matched_dn.bv_val );
184 if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
185 /* entry is a referral, don't allow add */
186 struct berval matched_dn;
187 BerVarray erefs, refs;
189 ber_dupbv( &matched_dn, &e->e_name );
190 erefs = get_entry_referrals( be, conn, op, e );
193 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
197 refs = referral_rewrite( erefs, &matched_dn,
199 ber_bvarray_free( erefs );
203 LDAP_LOG ( OPERATION, RESULTS,
204 "bdb_search: entry is referral\n", 0, 0, 0 );
206 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
210 send_ldap_result( conn, op, LDAP_REFERRAL,
212 refs ? NULL : "bad referral object",
215 LOCK_ID_FREE (bdb->bi_dbenv, locker );
216 ber_bvarray_free( refs );
217 ber_memfree( matched_dn.bv_val );
221 /* if not root, get appropriate limits */
222 if ( be_isroot( be, &op->o_ndn ) ) {
225 ( void ) get_limits( be, &op->o_ndn, &limit );
228 /* The time/size limits come first because they require very little
229 * effort, so there's no chance the candidates are selected and then
230 * the request is not honored only because of time/size constraints */
232 /* if no time limit requested, use soft limit (unless root!) */
235 tlimit = -1; /* allow root to set no limit */
243 /* if no limit is required, use soft limit */
245 tlimit = limit->lms_t_soft;
247 /* if requested limit higher than hard limit, abort */
248 } else if ( tlimit > limit->lms_t_hard ) {
249 /* no hard limit means use soft instead */
250 if ( limit->lms_t_hard == 0 && tlimit > limit->lms_t_soft ) {
251 tlimit = limit->lms_t_soft;
253 /* positive hard limit means abort */
254 } else if ( limit->lms_t_hard > 0 ) {
255 send_search_result( conn, op,
256 LDAP_UNWILLING_TO_PERFORM,
257 NULL, NULL, NULL, NULL, 0 );
262 /* negative hard limit means no limit */
265 /* if no limit is required, use soft limit */
267 slimit = limit->lms_s_soft;
269 /* if requested limit higher than hard limit, abort */
270 } else if ( slimit > limit->lms_s_hard ) {
271 /* no hard limit means use soft instead */
272 if ( limit->lms_s_hard == 0 && slimit > limit->lms_s_soft ) {
273 slimit = limit->lms_s_soft;
275 /* positive hard limit means abort */
276 } else if ( limit->lms_s_hard > 0 ) {
277 send_search_result( conn, op,
278 LDAP_UNWILLING_TO_PERFORM,
279 NULL, NULL, NULL, NULL, 0 );
284 /* negative hard limit means no limit */
288 /* compute it anyway; root does not use it */
289 stoptime = op->o_time + tlimit;
291 /* select candidates */
292 if ( scope == LDAP_SCOPE_BASE ) {
293 rc = base_candidate( be, e, candidates );
296 BDB_IDL_ALL( bdb, candidates );
297 rc = search_candidates( be, op, e, filter,
298 scope, deref, candidates );
301 /* need normalized dn below */
302 ber_dupbv( &realbase, &e->e_nname );
304 /* start cursor at beginning of candidates.
308 if ( e != &slap_entry_root ) {
309 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
313 if ( candidates[0] == 0 ) {
315 LDAP_LOG ( OPERATION, RESULTS,
316 "bdb_search: no candidates\n", 0, 0, 0 );
318 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
322 send_search_result( conn, op,
324 NULL, NULL, NULL, NULL, 0 );
330 /* if not root and candidates exceed to-be-checked entries, abort */
331 if ( !isroot && limit->lms_s_unchecked != -1 ) {
332 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
333 send_search_result( conn, op,
334 LDAP_ADMINLIMIT_EXCEEDED,
335 NULL, NULL, NULL, NULL, 0 );
341 #ifdef LDAP_CLIENT_UPDATE
342 if ( op->o_clientupdate_type & SLAP_LCUP_SYNC ) {
343 lcupf.f_choice = LDAP_FILTER_AND;
344 lcupf.f_and = &csnfnot;
347 csnfnot.f_choice = LDAP_FILTER_NOT;
348 csnfnot.f_not = &csnfeq;
349 csnfnot.f_next = &csnfand;
351 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
352 csnfeq.f_ava = &aa_eq;
353 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
354 ber_dupbv( &csnfeq.f_av_value, &op->o_clientupdate_state );
356 csnfand.f_choice = LDAP_FILTER_AND;
357 csnfand.f_and = &csnfge;
358 csnfand.f_next = NULL;
360 csnfge.f_choice = LDAP_FILTER_GE;
361 csnfge.f_ava = &aa_ge;
362 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
363 ber_dupbv( &csnfge.f_av_value, &op->o_clientupdate_state );
364 csnfge.f_next = filter;
366 #endif /* LDAP_CLIENT_UPDATE */
368 for ( id = bdb_idl_first( candidates, &cursor );
370 id = bdb_idl_next( candidates, &cursor ) )
374 /* check for abandon */
375 if ( op->o_abandon ) {
380 /* check time limit */
381 if ( tlimit != -1 && slap_get_time() > stoptime ) {
382 send_search_result( conn, op, rc = LDAP_TIMELIMIT_EXCEEDED,
383 NULL, NULL, v2refs, NULL, nentries );
388 /* get the entry with reader lock */
389 rc = bdb_id2entry_r( be, NULL, id, &e, locker, &lock );
391 if (rc == LDAP_BUSY) {
392 send_ldap_result( conn, op, rc=LDAP_BUSY,
393 NULL, "ldap server busy", NULL, NULL );
396 } else if ( rc == DB_LOCK_DEADLOCK || rc == DB_LOCK_NOTGRANTED ) {
401 if( !BDB_IDL_IS_RANGE(candidates) ) {
402 /* only complain for non-range IDLs */
404 LDAP_LOG ( OPERATION, RESULTS,
405 "bdb_search: candidate %ld not found\n", (long) id, 0, 0);
407 Debug( LDAP_DEBUG_TRACE,
408 "bdb_search: candidate %ld not found\n",
416 #ifdef BDB_SUBENTRIES
417 if ( is_entry_subentry( e ) ) {
418 if( scope != LDAP_SCOPE_BASE ) {
419 if(!get_subentries_visibility( op )) {
420 /* only subentries are visible */
424 } else if ( get_subentries( op ) &&
425 !get_subentries_visibility( op ))
427 /* only subentries are visible */
431 } else if ( get_subentries_visibility( op )) {
432 /* only subentries are visible */
438 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
443 e = deref_entry_r( be, e, &err, &matched, &text );
450 if( e->e_id == id ) {
455 /* need to skip alias which deref into scope */
456 if( scope & LDAP_SCOPE_ONELEVEL ) {
459 dnParent( &e->e_nname, &pdn ):
460 if ( ber_bvcmp( pdn, &realbase ) ) {
464 } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
465 /* alias is within scope */
467 LDAP_LOG ( OPERATION, RESULTS,
468 "bdb_search: \"%s\" in subtree\n", e->edn, 0, 0);
470 Debug( LDAP_DEBUG_TRACE,
471 "bdb_search: \"%s\" in subtree\n",
482 * if it's a referral, add it to the list of referrals. only do
483 * this for non-base searches, and don't check the filter
484 * explicitly here since it's only a candidate anyway.
486 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
487 is_entry_referral( e ) )
492 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
493 if ( !be_issuffix( be, &e->e_nname ) ) {
494 dnParent( &e->e_nname, &dn );
495 scopeok = dn_match( &dn, &realbase );
497 scopeok = (realbase.bv_len == 0);
500 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
501 scopeok = dnIsSuffix( &e->e_nname, &realbase );
508 BerVarray erefs = get_entry_referrals(
510 BerVarray refs = referral_rewrite( erefs,
512 scope == LDAP_SCOPE_SUBTREE
516 send_search_reference( be, conn, op,
517 e, refs, NULL, &v2refs );
519 ber_bvarray_free( refs );
523 LDAP_LOG(OPERATION, DETAIL2,
524 "bdb_search: candidate referral %ld scope not okay\n",
527 Debug( LDAP_DEBUG_TRACE,
528 "bdb_search: candidate referral %ld scope not okay\n",
536 /* if it matches the filter and scope, send it */
537 #ifdef LDAP_CLIENT_UPDATE
538 if ( op->o_clientupdate_type & SLAP_LCUP_SYNC ) {
539 rc = test_filter( be, conn, op, e, &lcupf );
541 #endif /* LDAP_CLIENT_UPDATE */
543 rc = test_filter( be, conn, op, e, filter );
546 if ( rc == LDAP_COMPARE_TRUE ) {
550 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
551 if ( be_issuffix( be, &e->e_nname ) ) {
552 scopeok = (realbase.bv_len == 0);
554 dnParent( &e->e_nname, &dn );
555 scopeok = dn_match( &dn, &realbase );
558 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
559 scopeok = dnIsSuffix( &e->e_nname, &realbase );
566 /* check size limit */
567 if ( --slimit == -1 ) {
568 bdb_cache_return_entry_r( bdb->bi_dbenv,
569 &bdb->bi_cache, e, &lock );
571 send_search_result( conn, op,
572 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
573 v2refs, NULL, nentries );
580 #if 0 /* noop is masked SLAP_CTRL_UPDATE */
586 #ifdef LDAP_CLIENT_UPDATE
587 if ( op->o_clientupdate_type & SLAP_LCUP_SYNC ) {
591 const char *text = NULL;
592 LDAPControl *ctrls[2];
595 BerElement *ber = ber_alloc_t( LBER_USE_DER );
599 LDAP_LOG ( OPERATION, RESULTS,
600 "bdb_search: ber_alloc_t failed\n",
603 Debug( LDAP_DEBUG_TRACE,
604 "bdb_search: ber_alloc_t failed\n",
607 send_ldap_result( conn, op, rc=LDAP_OTHER,
608 NULL, "internal error", NULL, NULL );
614 ctrls[0] = ch_malloc ( sizeof ( LDAPControl ) );
617 if ( entry_count % op->o_clientupdate_interval == 0 ) {
619 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
620 AttributeDescription *desc = a->a_desc;
621 if ( desc == slap_schema.si_ad_entryCSN ) {
622 ber_dupbv( &entrycsn_bv, &a->a_vals[0] );
623 if ( latest_entrycsn_bv.bv_val == NULL ) {
624 ber_dupbv( &latest_entrycsn_bv, &entrycsn_bv );
626 res = value_match( &ret, desc,
627 desc->ad_type->sat_ordering,
628 SLAP_MR_ASSERTION_SYNTAX_MATCH,
629 &entrycsn_bv, &latest_entrycsn_bv, &text );
630 if ( res != LDAP_SUCCESS ) {
633 LDAP_LOG ( OPERATION, RESULTS,
634 "bdb_search: value_match failed\n",
637 Debug( LDAP_DEBUG_TRACE,
638 "bdb_search: value_match failed\n",
644 ch_free( latest_entrycsn_bv.bv_val );
645 latest_entrycsn_bv.bv_val = NULL;
646 ber_dupbv( &latest_entrycsn_bv,
655 SLAP_LCUP_STATE_UPDATE_FALSE,
656 SLAP_LCUP_ENTRY_DELETED_FALSE,
657 LCUP_COOKIE_OID, &entrycsn_bv );
659 ch_free( entrycsn_bv.bv_val );
660 entrycsn_bv.bv_val = NULL;
663 /* Do not send cookie */
666 SLAP_LCUP_STATE_UPDATE_FALSE,
667 SLAP_LCUP_ENTRY_DELETED_FALSE );
670 ctrls[0]->ldctl_oid = LDAP_CONTROL_ENTRY_UPDATE;
671 ctrls[0]->ldctl_iscritical = op->o_clientupdate;
672 ret = ber_flatten( ber, &bv );
676 LDAP_LOG ( OPERATION, RESULTS,
677 "bdb_search: ber_flatten failed\n",
680 Debug( LDAP_DEBUG_TRACE,
681 "bdb_search: ber_flatten failed\n",
684 send_ldap_result( conn, op, rc=LDAP_OTHER,
685 NULL, "internal error", NULL, NULL );
689 ber_dupbv( &ctrls[0]->ldctl_value, bv );
691 result = send_search_entry( be, conn, op,
692 e, attrs, attrsonly, ctrls);
694 ch_free( ctrls[0]->ldctl_value.bv_val );
699 #endif /* LDAP_CLIENT_UPDATE */
701 result = send_search_entry( be, conn, op,
702 e, attrs, attrsonly, NULL);
707 case 0: /* entry sent ok */
710 case 1: /* entry not sent */
712 case -1: /* connection closed */
713 bdb_cache_return_entry_r(bdb->bi_dbenv,
714 &bdb->bi_cache, e, &lock);
722 LDAP_LOG ( OPERATION, RESULTS,
723 "bdb_search: %ld scope not okay\n", (long) id, 0, 0);
725 Debug( LDAP_DEBUG_TRACE,
726 "bdb_search: %ld scope not okay\n",
732 LDAP_LOG ( OPERATION, RESULTS,
733 "bdb_search: %ld does match filter\n", (long) id, 0, 0);
735 Debug( LDAP_DEBUG_TRACE,
736 "bdb_search: %ld does match filter\n",
743 /* free reader lock */
744 bdb_cache_return_entry_r( bdb->bi_dbenv,
745 &bdb->bi_cache, e , &lock);
749 ldap_pvt_thread_yield();
752 #ifdef LDAP_CLIENT_UPDATE
753 if ( op->o_clientupdate_type & SLAP_LCUP_SYNC ) {
755 LDAPControl *ctrls[2];
756 BerElement *ber = ber_alloc_t( LBER_USE_DER );
761 LDAP_LOG ( OPERATION, RESULTS,
762 "bdb_search: ber_alloc_t failed\n", 0, 0, 0 );
764 Debug( LDAP_DEBUG_TRACE, "bdb_search: ber_alloc_t failed\n",
767 send_ldap_result( conn, op, rc=LDAP_OTHER,
768 NULL, "internal error", NULL, NULL );
772 ctrls[0] = ch_malloc ( sizeof ( LDAPControl ) );
775 ber_printf( ber, "{sO", LCUP_COOKIE_OID, &latest_entrycsn_bv );
776 ber_printf( ber, "N}" );
778 ctrls[0]->ldctl_oid = LDAP_CONTROL_CLIENT_UPDATE_DONE;
779 ctrls[0]->ldctl_iscritical = op->o_clientupdate;
780 ret = ber_flatten( ber, &bv );
784 LDAP_LOG ( OPERATION, RESULTS,
785 "bdb_search: ber_flatten failed\n", 0, 0, 0 );
787 Debug( LDAP_DEBUG_TRACE, "bdb_search: ber_flatten failed\n",
790 send_ldap_result( conn, op, rc=LDAP_OTHER,
791 NULL, "internal error", NULL, NULL );
795 ber_dupbv( &ctrls[0]->ldctl_value, bv );
797 send_search_result( conn, op,
798 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
799 NULL, NULL, v2refs, ctrls, nentries );
801 ch_free( latest_entrycsn_bv.bv_val );
802 latest_entrycsn_bv.bv_val = NULL;
803 ch_free( ctrls[0]->ldctl_value.bv_val );
808 #endif /* LDAP_CLIENT_UPDATE */
810 send_search_result( conn, op,
811 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
812 NULL, NULL, v2refs, NULL, nentries );
819 /* free reader lock */
820 bdb_cache_return_entry_r ( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
823 #ifdef LDAP_CLIENT_UPDATE
824 if ( op->o_clientupdate_type & SLAP_LCUP_SYNC ) {
825 if ( csnfeq.f_ava != NULL && csnfeq.f_av_value.bv_val != NULL ) {
826 ch_free( csnfeq.f_av_value.bv_val );
829 if ( csnfge.f_ava != NULL && csnfge.f_av_value.bv_val != NULL ) {
830 ch_free( csnfge.f_av_value.bv_val );
833 #endif /* LDAP_CLIENT_UPDATE */
835 LOCK_ID_FREE (bdb->bi_dbenv, locker );
837 if( v2refs ) ber_bvarray_free( v2refs );
838 if( realbase.bv_val ) ch_free( realbase.bv_val );
844 static int base_candidate(
850 LDAP_LOG ( OPERATION, ENTRY,
851 "base_candidate: base: \"%s\" (0x%08lx)\n", e->e_dn, (long) e->e_id, 0);
853 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
854 e->e_dn, (long) e->e_id, 0);
862 /* Look for "objectClass Present" in this filter.
863 * Also count depth of filter tree while we're at it.
865 static int oc_filter(
873 if( cur > *max ) *max = cur;
875 switch(f->f_choice) {
876 case LDAP_FILTER_PRESENT:
877 if (f->f_desc == slap_schema.si_ad_objectClass) {
882 case LDAP_FILTER_AND:
885 for (f=f->f_and; f; f=f->f_next) {
886 (void) oc_filter(f, cur, max);
896 static int search_candidates(
906 Filter f, scopef, rf, xf;
908 AttributeAssertion aa_ref;
909 #ifdef BDB_SUBENTRIES
911 AttributeAssertion aa_subentry;
915 AttributeAssertion aa_alias;
919 * This routine takes as input a filter (user-filter)
920 * and rewrites it as follows:
921 * (&(scope=DN)[(objectClass=subentry)]
922 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
926 LDAP_LOG ( OPERATION, ENTRY,
927 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
928 e->e_dn, (long) e->e_id, scope);
930 Debug(LDAP_DEBUG_TRACE,
931 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
932 e->e_dn, (long) e->e_id, scope );
936 xf.f_choice = LDAP_FILTER_OR;
939 /* If the user's filter uses objectClass=*,
940 * these clauses are redundant.
942 if (!oc_filter(filter, 1, &depth) && !get_subentries_visibility(op) ) {
943 if( !get_manageDSAit(op) ) { /* match referrals */
944 struct berval bv_ref = { sizeof("referral")-1, "referral" };
945 rf.f_choice = LDAP_FILTER_EQUALITY;
947 rf.f_av_desc = slap_schema.si_ad_objectClass;
948 rf.f_av_value = bv_ref;
954 if( deref & LDAP_DEREF_SEARCHING ) { /* match aliases */
955 struct berval bv_alias = { sizeof("alias")-1, "alias" };
956 af.f_choice = LDAP_FILTER_EQUALITY;
957 af.f_ava = &aa_alias;
958 af.f_av_desc = slap_schema.si_ad_objectClass;
959 af.f_av_value = bv_alias;
964 /* We added one of these clauses, filter depth increased */
965 if( xf.f_or != filter ) depth++;
969 f.f_choice = LDAP_FILTER_AND;
971 scopef.f_choice = scope == LDAP_SCOPE_SUBTREE
972 ? SLAPD_FILTER_DN_SUBTREE
973 : SLAPD_FILTER_DN_ONE;
974 scopef.f_dn = &e->e_nname;
975 scopef.f_next = xf.f_or == filter ? filter : &xf ;
976 /* Filter depth increased again, adding scope clause */
979 #ifdef BDB_SUBENTRIES
980 if( get_subentries_visibility( op ) ) {
981 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
982 sf.f_choice = LDAP_FILTER_EQUALITY;
983 sf.f_ava = &aa_subentry;
984 sf.f_av_desc = slap_schema.si_ad_objectClass;
985 sf.f_av_value = bv_subentry;
986 sf.f_next = scopef.f_next;
991 /* Allocate IDL stack, plus 1 more for former tmp */
992 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
994 rc = bdb_filter_candidates( be, &f, ids, stack, stack+BDB_IDL_UM_SIZE );
1000 LDAP_LOG ( OPERATION, DETAIL1,
1001 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1003 Debug(LDAP_DEBUG_TRACE,
1004 "bdb_search_candidates: failed (rc=%d)\n",
1010 LDAP_LOG ( OPERATION, DETAIL1,
1011 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1012 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1013 (long) BDB_IDL_LAST(ids));
1015 Debug(LDAP_DEBUG_TRACE,
1016 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1018 (long) BDB_IDL_FIRST(ids),
1019 (long) BDB_IDL_LAST(ids) );