1 /* search.c - search operation */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
20 #include <ac/string.h>
26 static int base_candidate(
31 static int search_candidates(
32 Operation *stackop, /* op with the current threadctx/slab cache */
33 Operation *sop, /* search op */
40 static void send_paged_response(
46 /* Dereference aliases for a single alias entry. Return the final
47 * dereferenced entry on success, NULL on any failure.
49 static Entry * deref_base (
59 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
64 rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
65 rs->sr_text = "maximum deref depth exceeded";
67 while (BDB_IDL_N(tmp) < op->o_bd->be_max_deref_depth) {
68 /* Remember the last entry we looked at, so we can
73 /* If this is part of a subtree or onelevel search,
74 * have we seen this ID before? If so, quit.
76 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
81 /* If we've seen this ID during this deref iteration,
84 if ( bdb_idl_insert( tmp, e->e_id ) ) {
85 rs->sr_err = LDAP_ALIAS_PROBLEM;
86 rs->sr_text = "circular alias";
91 /* If there was a problem getting the aliasedObjectName,
92 * get_alias_dn will have set the error status.
94 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
99 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
109 rs->sr_err = LDAP_ALIAS_PROBLEM;
110 rs->sr_text = "aliasedObject not found";
114 /* Free the previous entry, continue to work with the
115 * one we just retrieved.
117 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
121 /* We found a regular entry. Return this to the caller. The
122 * entry is still locked for Read.
124 if (!is_entry_alias(e)) {
125 rs->sr_err = LDAP_SUCCESS;
133 /* Look for and dereference all aliases within the search scope. Adds
134 * the dereferenced entries to the "ids" list. Requires "stack" to be
135 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
136 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
138 static int search_aliases(
147 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
148 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
149 ID cursora, ida, cursoro, ido, *subscop2;
152 struct berval bv_alias = { sizeof("alias")-1, "alias" };
153 AttributeAssertion aa_alias;
155 DB_LOCK locka, lockr;
158 aliases = stack; /* IDL of all aliases in the database */
159 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
160 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
161 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
162 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
163 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
164 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
166 /* A copy of subscop, because subscop gets clobbered by
167 * the bdb_idl_union/intersection routines
169 subscop2 = tmp + BDB_IDL_DB_SIZE;
171 af.f_choice = LDAP_FILTER_EQUALITY;
172 af.f_ava = &aa_alias;
173 af.f_av_desc = slap_schema.si_ad_objectClass;
174 af.f_av_value = bv_alias;
177 /* Find all aliases in database */
178 BDB_IDL_ZERO( aliases );
179 rs->sr_err = bdb_filter_candidates( op, &af, aliases,
181 if (rs->sr_err != LDAP_SUCCESS) {
185 oldsubs[1] = e->e_id;
188 BDB_IDL_ZERO( visited );
189 BDB_IDL_ZERO( newsubs );
192 ido = bdb_idl_first( oldsubs, &cursoro );
195 /* Set curscop to only the aliases in the current scope. Start with
196 * all the aliases, obtain the IDL for the current scope, and then
197 * get the intersection of these two IDLs. Add the current scope
198 * to the cumulative list of candidates.
200 BDB_IDL_CPY( curscop, aliases );
201 rs->sr_err = bdb_dn2idl( op, e, subscop,
202 subscop2+BDB_IDL_DB_SIZE );
206 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
208 BDB_IDL_CPY(subscop2, subscop);
209 rs->sr_err = bdb_idl_intersection(curscop, subscop);
210 bdb_idl_union( ids, subscop2 );
212 /* Dereference all of the aliases in the current scope. */
214 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
215 ida = bdb_idl_next(curscop, &cursora))
219 rs->sr_err = bdb_cache_find_id(op, NULL,
220 ida, &ei, 0, locker, &lockr );
221 if (rs->sr_err != LDAP_SUCCESS) {
222 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
223 rs->sr_err == DB_LOCK_NOTGRANTED ) goto retry1;
228 /* This should only happen if the curscop IDL has maxed out and
229 * turned into a range that spans IDs indiscriminately
231 if (!is_entry_alias(a)) {
232 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
237 /* Actually dereference the alias */
239 a = deref_base( op, rs, a, &matched, locker, &lockr,
242 /* If the target was not already in our current candidates,
243 * make note of it in the newsubs list. Also
244 * set it in the scopes list so that bdb_search
247 if (bdb_idl_insert(ids, a->e_id) == 0) {
248 bdb_idl_insert(newsubs, a->e_id);
249 bdb_idl_insert(scopes, a->e_id);
251 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
254 } else if (matched) {
255 /* Alias could not be dereferenced, or it deref'd to
256 * an ID we've already seen. Ignore it.
258 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
263 /* If this is a OneLevel search, we're done; oldsubs only had one
264 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
266 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
268 ido = bdb_idl_next( oldsubs, &cursoro );
270 /* If we're done processing the old scopes, did we add any new
271 * scopes in this iteration? If so, go back and do those now.
274 if (BDB_IDL_IS_ZERO(newsubs)) break;
275 BDB_IDL_CPY(oldsubs, newsubs);
276 BDB_IDL_ZERO(newsubs);
278 ido = bdb_idl_first( oldsubs, &cursoro );
281 /* Find the entry corresponding to the next scope. If it can't
282 * be found, ignore it and move on. This should never happen;
283 * we should never see the ID of an entry that doesn't exist.
284 * Set the name so that the scope's IDL can be retrieved.
288 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
290 if ( rs->sr_err != LDAP_SUCCESS ) {
291 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
292 rs->sr_err == DB_LOCK_NOTGRANTED )
301 #define is_sync_protocol(op) \
302 ((op)->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST)
304 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
305 ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
306 #define IS_PSEARCH (op != sop)
309 bdb_drop_psearch( Operation *op, ber_int_t msgid )
312 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
314 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
315 if ( ps_list->o_connid == op->o_connid ) {
316 if ( ps_list->o_msgid == msgid ) {
317 ps_list->o_abandon = 1;
318 LDAP_LIST_REMOVE( ps_list, o_ps_link );
319 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
320 LDAP_STAILQ_REMOVE( &op->o_conn->c_ops, ps_list,
322 LDAP_STAILQ_NEXT( ps_list, o_next ) = NULL;
323 op->o_conn->c_n_ops_executing--;
324 op->o_conn->c_n_ops_completed++;
325 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
335 bdb_abandon( Operation *op, SlapReply *rs )
339 ps = bdb_drop_psearch( op, op->oq_abandon.rs_msgid );
341 if ( ps->o_tmpmemctx ) {
342 slap_sl_mem_destroy( NULL, ps->o_tmpmemctx );
347 return LDAP_UNAVAILABLE;
351 bdb_cancel( Operation *op, SlapReply *rs )
355 ps = bdb_drop_psearch( op, op->oq_cancel.rs_msgid );
357 rs->sr_err = LDAP_CANCELLED;
358 send_ldap_result( ps, rs );
359 if ( ps->o_tmpmemctx ) {
360 slap_sl_mem_destroy( NULL, ps->o_tmpmemctx );
365 return LDAP_UNAVAILABLE;
368 int bdb_search( Operation *op, SlapReply *rs )
370 return bdb_do_search( op, rs, op, NULL, 0 );
373 int bdb_psearch( Operation *op, SlapReply *rs, Operation *sop,
374 Entry *ps_e, int ps_type )
378 sop->o_private = op->o_private;
379 rc = bdb_do_search( op, rs, sop, ps_e, ps_type );
380 sop->o_private = NULL;
385 /* For persistent searches, op is the currently executing operation,
386 * sop is the persistent search. For regular searches, sop = op.
389 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop,
390 Entry *ps_e, int ps_type )
392 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
395 ID candidates[BDB_IDL_UM_SIZE];
396 ID scopes[BDB_IDL_DB_SIZE];
397 Entry *e = NULL, base, e_root = {0};
398 Entry *matched = NULL;
399 EntryInfo *ei, ei_root = {0};
400 struct berval realbase = BER_BVNULL;
404 AttributeName *attrs;
406 Filter contextcsnand, contextcsnle, cookief, csnfnot,
407 csnfeq, csnfand, csnfge;
408 AttributeAssertion aa_ge, aa_eq, aa_le;
409 struct berval *search_context_csn = NULL;
411 LDAPControl *ctrls[SLAP_MAX_RESPONSE_CONTROLS];
413 AttributeName uuid_attr[2];
415 int entry_sync_state = -1;
416 AttributeName null_attr;
417 int no_sync_state_change = 0;
419 u_int32_t locker = 0;
423 int sync_send_present_mode = 1;
429 BerVarray syncUUID_set = NULL;
430 int syncUUID_set_cnt = 0;
432 struct bdb_op_info *opinfo = NULL;
436 LDAP_LOG( OPERATION, ENTRY, "bdb_search\n", 0, 0, 0 );
438 Debug( LDAP_DEBUG_TRACE, "=> bdb_search\n", 0, 0, 0);
440 attrs = sop->oq_search.rs_attrs;
442 opinfo = (struct bdb_op_info *) op->o_private;
444 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
445 struct slap_session_entry *sent;
446 if ( sop->o_sync_state.sid >= 0 ) {
447 LDAP_LIST_FOREACH( sent, &bdb->bi_session_list, se_link ) {
448 if ( sent->se_id == sop->o_sync_state.sid ) {
449 sop->o_sync_slog_size = sent->se_size;
456 /* psearch needs to be registered before refresh begins */
457 /* psearch and refresh transmission is serialized in send_ldap_ber() */
458 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
459 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
460 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
461 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
463 } else if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST
464 && sop->o_sync_slog_size >= 0 )
466 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
467 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
468 if ( ps_list->o_sync_slog_size >= 0 ) {
469 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
477 if ( ps_list->o_sync_slog_omitcsn.bv_len != 0 ) {
478 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
479 if ( sop->o_sync_state.ctxcsn &&
480 sop->o_sync_state.ctxcsn->bv_val != NULL )
482 value_match( &match, slap_schema.si_ad_entryCSN, mr,
483 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
484 sop->o_sync_state.ctxcsn,
485 &ps_list->o_sync_slog_omitcsn,
491 sync_send_present_mode = 0;
494 sync_send_present_mode = 0;
496 } else if ( sop->o_sync_slog_size >= 0 ) {
497 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
499 sop->o_sync_state.sid = -1;
501 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
504 null_attr.an_desc = NULL;
505 null_attr.an_oc = NULL;
506 null_attr.an_oc_exclude = 0;
507 null_attr.an_name.bv_len = 0;
508 null_attr.an_name.bv_val = NULL;
510 for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
511 ctrls[num_ctrls] = NULL;
515 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
517 attrs[0].an_desc = NULL;
518 attrs[0].an_oc = NULL;
519 attrs[0].an_oc_exclude = 0;
520 attrs[0].an_name.bv_len = 0;
521 attrs[0].an_name.bv_val = NULL;
524 manageDSAit = get_manageDSAit( sop );
526 /* Sync control overrides manageDSAit */
527 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
528 if ( manageDSAit == SLAP_NO_CONTROL ) {
529 manageDSAit = SLAP_CRITICAL_CONTROL;
531 } else if ( IS_PSEARCH ) {
532 if ( manageDSAit == SLAP_NO_CONTROL ) {
533 manageDSAit = SLAP_CRITICAL_CONTROL;
538 ltid = opinfo->boi_txn;
539 locker = TXN_ID( ltid );
541 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
547 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
552 if ( sop->o_req_ndn.bv_len == 0 ) {
553 /* DIT root special case */
554 ei_root.bei_e = &e_root;
555 ei_root.bei_parent = &ei_root;
556 e_root.e_private = &ei_root;
558 e_root.e_nname.bv_val="";
559 e_root.e_name.bv_val="";
561 rs->sr_err = LDAP_SUCCESS;
564 /* get entry with reader lock */
565 rs->sr_err = bdb_dn2entry( op, ltid, &sop->o_req_ndn, &ei,
577 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
579 LOCK_ID_FREE (bdb->bi_dbenv, locker );
581 case DB_LOCK_DEADLOCK:
582 case DB_LOCK_NOTGRANTED:
585 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
587 LOCK_ID_FREE (bdb->bi_dbenv, locker );
591 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
592 BDB_IDL_ZERO(candidates);
593 e = deref_base( op, rs, e, &matched, locker, &lock,
598 struct berval matched_dn = BER_BVNULL;
600 if ( matched != NULL ) {
602 ber_dupbv( &matched_dn, &matched->e_name );
604 erefs = is_entry_referral( matched )
605 ? get_entry_referrals( op, matched )
608 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
613 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
614 &sop->o_req_dn, sop->oq_search.rs_scope );
615 ber_bvarray_free( erefs );
619 rs->sr_ref = referral_rewrite( default_referral,
620 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
623 rs->sr_err = LDAP_REFERRAL;
624 rs->sr_matched = matched_dn.bv_val;
625 send_ldap_result( sop, rs );
628 LOCK_ID_FREE (bdb->bi_dbenv, locker );
630 ber_bvarray_free( rs->sr_ref );
633 if ( matched_dn.bv_val ) {
634 ber_memfree( matched_dn.bv_val );
635 rs->sr_matched = NULL;
640 if ( !manageDSAit && e != &e_root && is_entry_referral( e ) ) {
641 /* entry is a referral, don't allow add */
642 struct berval matched_dn;
645 ber_dupbv( &matched_dn, &e->e_name );
646 erefs = get_entry_referrals( op, e );
648 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
652 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
653 &sop->o_req_dn, sop->oq_search.rs_scope );
654 ber_bvarray_free( erefs );
658 LDAP_LOG ( OPERATION, RESULTS,
659 "bdb_search: entry is referral\n", 0, 0, 0 );
661 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
665 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
666 rs->sr_err = LDAP_REFERRAL;
667 rs->sr_matched = matched_dn.bv_val;
668 send_ldap_result( sop, rs );
671 LOCK_ID_FREE (bdb->bi_dbenv, locker );
672 ber_bvarray_free( rs->sr_ref );
674 ber_memfree( matched_dn.bv_val );
675 rs->sr_matched = NULL;
679 if ( get_assert( op ) &&
680 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
682 rs->sr_err = LDAP_ASSERTION_FAILED;
683 send_ldap_result( sop, rs );
687 /* compute it anyway; root does not use it */
688 stoptime = op->o_time + sop->ors_tlimit;
690 /* need normalized dn below */
691 ber_dupbv( &realbase, &e->e_nname );
693 /* Copy info to base, must free entry before accessing the database
694 * in search_candidates, to avoid deadlocks.
696 base.e_private = e->e_private;
697 base.e_nname = realbase;
700 if ( e != &e_root ) {
701 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
706 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn,
707 locker, &ctxcsn_lock );
709 if ( rs->sr_err != LDAP_SUCCESS ) {
710 send_ldap_error( sop, rs, rs->sr_err,
711 "error in csn management in search" );
715 if ( sop->o_sync_mode != SLAP_SYNC_NONE &&
716 sop->o_sync_state.ctxcsn &&
717 sop->o_sync_state.ctxcsn->bv_val &&
718 ber_bvcmp( &sop->o_sync_state.ctxcsn[0], search_context_csn ) == 0 )
720 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
724 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );
727 /* select candidates */
728 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
729 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
732 BDB_IDL_ZERO( candidates );
733 BDB_IDL_ZERO( scopes );
734 rs->sr_err = search_candidates( op, sop, rs, &base,
735 locker, candidates, scopes );
738 if ( !IS_PSEARCH && sop->o_sync_mode != SLAP_SYNC_NONE ) {
739 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
742 /* start cursor at beginning of candidates.
746 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
747 cursor = bdb_idl_search( candidates, ps_e->e_id );
748 if ( candidates[cursor] != ps_e->e_id ) {
749 rs->sr_err = LDAP_SUCCESS;
752 } else if ( ps_e->e_id < BDB_IDL_RANGE_FIRST( candidates ) ||
753 ps_e->e_id > BDB_IDL_RANGE_LAST( candidates ))
755 rs->sr_err = LDAP_SUCCESS;
759 candidates[1] = ps_e->e_id;
762 if ( candidates[0] == 0 ) {
764 LDAP_LOG ( OPERATION, RESULTS,
765 "bdb_search: no candidates\n", 0, 0, 0 );
767 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
774 /* if not root and candidates exceed to-be-checked entries, abort */
775 if ( sop->ors_limit /* isroot == TRUE */ &&
776 sop->ors_limit->lms_s_unchecked != -1 &&
777 BDB_IDL_N(candidates) > (unsigned) sop->ors_limit->lms_s_unchecked )
779 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
780 send_ldap_result( sop, rs );
781 rs->sr_err = LDAP_SUCCESS;
785 if ( sop->ors_limit == NULL /* isroot == FALSE */ ||
786 !sop->ors_limit->lms_s_pr_hide )
788 tentries = BDB_IDL_N(candidates);
791 if ( get_pagedresults(sop) > SLAP_NO_CONTROL ) {
792 if ( (ID)( sop->o_pagedresults_state.ps_cookie ) == 0 ) {
793 id = bdb_idl_first( candidates, &cursor );
796 if ( sop->o_pagedresults_size == 0 ) {
797 rs->sr_err = LDAP_SUCCESS;
798 rs->sr_text = "search abandoned by pagedResult size=0";
799 send_ldap_result( sop, rs );
802 for ( id = bdb_idl_first( candidates, &cursor );
804 id <= (ID)( sop->o_pagedresults_state.ps_cookie );
805 id = bdb_idl_next( candidates, &cursor ) )
811 if ( cursor == NOID ) {
813 LDAP_LOG ( OPERATION, RESULTS,
814 "bdb_search: no paged results candidates\n",
817 Debug( LDAP_DEBUG_TRACE,
818 "bdb_search: no paged results candidates\n",
821 send_paged_response( sop, rs, &lastid, 0 );
823 rs->sr_err = LDAP_OTHER;
829 if (( sop->o_sync_mode & SLAP_SYNC_REFRESH ) || IS_PSEARCH ) {
832 cookief.f_choice = LDAP_FILTER_AND;
833 cookief.f_and = &csnfnot;
834 cookief.f_next = NULL;
836 csnfnot.f_choice = LDAP_FILTER_NOT;
837 csnfnot.f_not = &csnfeq;
838 csnfnot.f_next = &csnfand;
840 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
841 csnfeq.f_ava = &aa_eq;
842 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
843 if ( sop->o_sync_state.ctxcsn != NULL ) {
844 csnfeq.f_av_value = *sop->o_sync_state.ctxcsn;
846 csnfeq.f_av_value = slap_empty_bv;
849 csnfand.f_choice = LDAP_FILTER_AND;
850 csnfand.f_and = &csnfge;
851 csnfand.f_next = NULL;
853 csnfge.f_choice = LDAP_FILTER_GE;
854 csnfge.f_ava = &aa_ge;
855 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
856 if ( sop->o_sync_state.ctxcsn != NULL ) {
857 csnfge.f_av_value = *sop->o_sync_state.ctxcsn;
859 csnfge.f_av_value = slap_empty_bv;
862 if ( search_context_csn && !IS_PSEARCH ) {
863 csnfge.f_next = &contextcsnand;
865 contextcsnand.f_choice = LDAP_FILTER_AND;
866 contextcsnand.f_and = &contextcsnle;
867 contextcsnand.f_next = NULL;
869 contextcsnle.f_choice = LDAP_FILTER_LE;
870 contextcsnle.f_ava = &aa_le;
871 contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
872 contextcsnle.f_av_value = *search_context_csn;
873 contextcsnle.f_next = sop->oq_search.rs_filter;
875 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
876 if ( sop->o_sync_state.ctxcsn &&
877 sop->o_sync_state.ctxcsn->bv_val != NULL )
879 value_match( &match, slap_schema.si_ad_entryCSN, mr,
880 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
881 &sop->o_sync_state.ctxcsn[0], search_context_csn,
886 no_sync_state_change = ( match >= 0 );
888 csnfge.f_next = sop->oq_search.rs_filter;
892 for ( id = bdb_idl_first( candidates, &cursor );
893 id != NOID && !no_sync_state_change;
894 id = bdb_idl_next( candidates, &cursor ) )
899 /* check for abandon */
900 if ( sop->o_abandon ) {
902 bdb_drop_psearch( sop, sop->o_msgid );
904 rs->sr_err = LDAP_SUCCESS;
908 if ( sop->o_cancel ) {
909 assert( sop->o_cancel == SLAP_CANCEL_REQ );
910 rs->sr_err = LDAP_CANCELLED;
911 send_ldap_result( sop, rs );
912 sop->o_cancel = SLAP_CANCEL_ACK;
913 rs->sr_err = LDAP_SUCCESS;
917 /* check time limit */
918 if ( sop->ors_tlimit != SLAP_NO_LIMIT
919 && slap_get_time() > stoptime )
921 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
922 rs->sr_ref = rs->sr_v2ref;
923 send_ldap_result( sop, rs );
924 rs->sr_err = LDAP_SUCCESS;
930 /* get the entry with reader lock */
932 rs->sr_err = bdb_cache_find_id( op, ltid,
933 id, &ei, 0, locker, &lock );
935 if (rs->sr_err == LDAP_BUSY) {
936 rs->sr_text = "ldap server busy";
937 send_ldap_result( sop, rs );
940 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
941 || rs->sr_err == DB_LOCK_NOTGRANTED )
946 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
953 if( !BDB_IDL_IS_RANGE(candidates) ) {
954 /* only complain for non-range IDLs */
956 LDAP_LOG ( OPERATION, RESULTS,
957 "bdb_search: candidate %ld not found\n",
960 Debug( LDAP_DEBUG_TRACE,
961 "bdb_search: candidate %ld not found\n",
974 #ifdef BDB_SUBENTRIES
975 /* FIXME: send all but syncrepl */
977 if ( !is_sync_protocol( sop ) )
980 if ( is_entry_subentry( e ) ) {
981 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
982 if(!get_subentries_visibility( sop )) {
983 /* only subentries are visible */
987 } else if ( get_subentries( sop ) &&
988 !get_subentries_visibility( sop ))
990 /* only subentries are visible */
994 } else if ( get_subentries_visibility( sop )) {
995 /* only subentries are visible */
999 #endif /* BDB_SUBENTRIES */
1001 /* Does this candidate actually satisfy the search scope?
1003 * Note that we don't lock access to the bei_parent pointer.
1004 * Since only leaf nodes can be deleted, the parent of any
1005 * node will always be a valid node. Also since we have
1006 * a Read lock on the data, it cannot be renamed out of the
1007 * scope while we are looking at it, and unless we're using
1008 * BDB_HIER, its parents cannot be moved either.
1010 switch( sop->ors_scope ) {
1011 case LDAP_SCOPE_BASE:
1012 /* This is always true, yes? */
1013 if ( id == base.e_id ) scopeok = 1;
1016 case LDAP_SCOPE_ONELEVEL:
1017 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
1020 #ifdef LDAP_SCOPE_CHILDREN
1021 case LDAP_SCOPE_CHILDREN:
1022 if ( id == base.e_id ) break;
1025 case LDAP_SCOPE_SUBTREE: {
1027 for (tmp = BEI(e); tmp;
1028 tmp = tmp->bei_parent ) {
1029 if ( tmp->bei_id == base.e_id ) {
1038 /* aliases were already dereferenced in candidate list */
1039 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
1040 /* but if the search base is an alias, and we didn't
1041 * deref it when finding, return it.
1043 if ( is_entry_alias(e) &&
1044 ((sop->ors_deref & LDAP_DEREF_FINDING) ||
1045 !bvmatch(&e->e_nname, &op->o_req_ndn)))
1050 /* scopes is only non-empty for onelevel or subtree */
1051 if ( !scopeok && BDB_IDL_N(scopes) ) {
1053 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
1054 x = bdb_idl_search( scopes, e->e_id );
1055 if ( scopes[x] == e->e_id ) scopeok = 1;
1057 /* subtree, walk up the tree */
1058 EntryInfo *tmp = BEI(e);
1059 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
1060 x = bdb_idl_search( scopes, tmp->bei_id );
1061 if ( scopes[x] == tmp->bei_id ) {
1071 /* Not in scope, ignore it */
1074 LDAP_LOG ( OPERATION, RESULTS,
1075 "bdb_search: %ld scope not okay\n",
1078 Debug( LDAP_DEBUG_TRACE,
1079 "bdb_search: %ld scope not okay\n",
1086 * if it's a referral, add it to the list of referrals. only do
1087 * this for non-base searches, and don't check the filter
1088 * explicitly here since it's only a candidate anyway.
1090 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE
1091 && is_entry_referral( e ) )
1093 BerVarray erefs = get_entry_referrals( sop, e );
1094 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
1095 sop->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
1096 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
1098 send_search_reference( sop, rs );
1100 ber_bvarray_free( rs->sr_ref );
1101 ber_bvarray_free( erefs );
1107 if ( !manageDSAit && is_entry_glue( e )) {
1111 /* if it matches the filter and scope, send it */
1113 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1114 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1116 rs->sr_err = LDAP_COMPARE_TRUE;
1120 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1121 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1122 rs->sr_err = test_filter( sop, rs->sr_entry, &contextcsnand );
1123 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1124 if ( rc_sync == LDAP_COMPARE_TRUE ) {
1125 if ( no_sync_state_change ) {
1127 LDAP_LOG ( OPERATION, RESULTS,
1128 "bdb_search: error in context csn management\n",
1131 Debug( LDAP_DEBUG_TRACE,
1132 "bdb_search: error in context csn management\n",
1136 entry_sync_state = LDAP_SYNC_ADD;
1139 if ( no_sync_state_change ) {
1142 entry_sync_state = LDAP_SYNC_PRESENT;
1147 rs->sr_err = test_filter( sop,
1148 rs->sr_entry, sop->oq_search.rs_filter );
1152 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1153 /* check size limit */
1154 if ( --sop->ors_slimit == -1 &&
1155 sop->o_sync_slog_size == -1 )
1158 bdb_cache_return_entry_r( bdb->bi_dbenv,
1159 &bdb->bi_cache, e, &lock );
1162 rs->sr_entry = NULL;
1163 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1164 rs->sr_ref = rs->sr_v2ref;
1165 send_ldap_result( sop, rs );
1166 rs->sr_err = LDAP_SUCCESS;
1170 if ( get_pagedresults(sop) > SLAP_NO_CONTROL ) {
1171 if ( rs->sr_nentries >= sop->o_pagedresults_size ) {
1172 send_paged_response( sop, rs, &lastid, tentries );
1183 int premodify_found = 0;
1184 int entry_sync_state;
1186 if ( ps_type == LDAP_PSEARCH_BY_ADD ||
1187 ps_type == LDAP_PSEARCH_BY_DELETE ||
1188 ps_type == LDAP_PSEARCH_BY_MODIFY ||
1189 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1191 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1192 struct psid_entry* psid_e;
1193 LDAP_LIST_FOREACH( psid_e,
1194 &op->o_pm_list, ps_link)
1196 if( psid_e->ps_op == sop ) {
1197 premodify_found = 1;
1198 LDAP_LIST_REMOVE(psid_e, ps_link);
1202 if (psid_e != NULL) free (psid_e);
1205 if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1206 entry_sync_state = LDAP_SYNC_ADD;
1207 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1208 entry_sync_state = LDAP_SYNC_DELETE;
1209 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1210 if ( premodify_found ) {
1211 entry_sync_state = LDAP_SYNC_MODIFY;
1213 entry_sync_state = LDAP_SYNC_ADD;
1215 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT ) {
1216 entry_sync_state = LDAP_SYNC_DELETE;
1218 rs->sr_err = LDAP_OTHER;
1222 if ( sop->o_sync_slog_size != -1 ) {
1223 if ( entry_sync_state == LDAP_SYNC_DELETE ) {
1224 result = slap_add_session_log( op, sop, e );
1229 struct berval cookie;
1230 slap_compose_sync_cookie( sop, &cookie,
1232 sop->o_sync_state.sid,
1233 sop->o_sync_state.rid );
1234 rs->sr_err = slap_build_sync_state_ctrl( sop,
1235 rs, e, entry_sync_state, ctrls,
1236 num_ctrls++, 1, &cookie );
1237 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1238 rs->sr_attrs = attrs;
1239 rs->sr_ctrls = ctrls;
1241 result = send_search_entry( sop, rs );
1242 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1244 ctrls[num_ctrls-1]->ldctl_value.bv_val,
1246 slap_sl_free( ctrls[--num_ctrls],
1248 ctrls[num_ctrls] = NULL;
1249 rs->sr_ctrls = NULL;
1252 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1253 struct psid_entry* psid_e;
1254 psid_e = (struct psid_entry *) ch_calloc(1,
1255 sizeof(struct psid_entry));
1256 psid_e->ps_op = sop;
1257 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1262 LDAP_LOG ( OPERATION, RESULTS,
1263 "bdb_search: invalid ps_type (%d) \n",
1266 Debug( LDAP_DEBUG_TRACE,
1267 "bdb_search: invalid ps_type (%d) \n",
1273 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1274 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1275 rs->sr_err = slap_build_sync_state_ctrl( sop,
1276 rs, e, entry_sync_state, ctrls,
1277 num_ctrls++, 0, NULL );
1278 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1279 rs->sr_ctrls = ctrls;
1280 rs->sr_attrs = sop->oq_search.rs_attrs;
1282 result = send_search_entry( sop, rs );
1284 ctrls[num_ctrls-1]->ldctl_value.bv_val,
1286 slap_sl_free( ctrls[--num_ctrls],
1288 ctrls[num_ctrls] = NULL;
1289 rs->sr_ctrls = NULL;
1291 } else { /* PRESENT */
1292 if ( sync_send_present_mode ) {
1293 result = slap_build_syncUUID_set( sop,
1295 if ( result <= 0 ) {
1299 if ( syncUUID_set_cnt ==
1300 SLAP_SYNCUUID_SET_SIZE )
1302 rs->sr_err = LDAP_SUCCESS;
1303 rs->sr_rspoid = LDAP_SYNC_INFO;
1304 rs->sr_ctrls = NULL;
1305 result = slap_send_syncinfo( sop, rs,
1306 LDAP_TAG_SYNC_ID_SET,
1307 NULL, 0, syncUUID_set, 0 );
1308 if ( result != LDAP_SUCCESS ) {
1311 ber_bvarray_free_x( syncUUID_set,
1313 syncUUID_set = NULL;
1314 syncUUID_set_cnt = 0;
1324 rs->sr_attrs = sop->oq_search.rs_attrs;
1325 rs->sr_ctrls = NULL;
1327 rs->sr_err = LDAP_SUCCESS;
1328 result = send_search_entry( sop, rs );
1333 case 0: /* entry sent ok */
1335 case 1: /* entry not sent */
1337 case -1: /* connection closed */
1339 bdb_cache_return_entry_r(bdb->bi_dbenv,
1340 &bdb->bi_cache, e, &lock);
1343 rs->sr_entry = NULL;
1344 rs->sr_err = LDAP_OTHER;
1351 LDAP_LOG ( OPERATION, RESULTS,
1352 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1354 Debug( LDAP_DEBUG_TRACE,
1355 "bdb_search: %ld does not match filter\n",
1362 /* free reader lock */
1364 bdb_cache_return_entry_r( bdb->bi_dbenv,
1365 &bdb->bi_cache, e , &lock );
1366 if ( sop->o_nocaching ) {
1367 bdb_cache_delete_entry( bdb, ei, locker, &lock );
1371 rs->sr_entry = NULL;
1374 ldap_pvt_thread_yield();
1377 if ( syncUUID_set_cnt > 0 ) {
1378 rs->sr_err = LDAP_SUCCESS;
1379 rs->sr_rspoid = LDAP_SYNC_INFO;
1380 rs->sr_ctrls = NULL;
1381 slap_send_syncinfo( sop, rs, LDAP_TAG_SYNC_ID_SET,
1382 NULL, 0, syncUUID_set, 0 );
1383 ber_bvarray_free_x( syncUUID_set, sop->o_tmpmemctx );
1384 syncUUID_set_cnt = 0;
1389 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1390 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1391 struct berval cookie;
1392 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1393 sop->o_sync_state.sid, sop->o_sync_state.rid );
1395 if ( sync_send_present_mode ) {
1396 rs->sr_err = LDAP_SUCCESS;
1397 rs->sr_rspoid = LDAP_SYNC_INFO;
1398 rs->sr_ctrls = NULL;
1399 slap_send_syncinfo( sop, rs,
1400 LDAP_TAG_SYNC_REFRESH_PRESENT, &cookie, 1, NULL, 0 );
1403 if ( !no_sync_state_change ) {
1405 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1406 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1409 if ( ps_list->o_sync_slog_size > 0 ) {
1410 if ( ps_list->o_sync_state.sid ==
1411 sop->o_sync_state.sid )
1420 rs->sr_err = LDAP_SUCCESS;
1421 rs->sr_rspoid = NULL;
1422 rs->sr_ctrls = NULL;
1423 slap_send_session_log( op, ps_list, rs );
1425 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1428 rs->sr_err = LDAP_SUCCESS;
1429 rs->sr_rspoid = LDAP_SYNC_INFO;
1430 rs->sr_ctrls = NULL;
1431 slap_send_syncinfo( sop, rs,
1432 LDAP_TAG_SYNC_REFRESH_DELETE, &cookie, 1, NULL, 0 );
1435 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1438 /* refreshOnly mode */
1439 struct berval cookie;
1440 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1441 sop->o_sync_state.sid, sop->o_sync_state.rid );
1443 if ( sync_send_present_mode ) {
1444 slap_build_sync_done_ctrl( sop, rs, ctrls,
1445 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1448 if ( !no_sync_state_change ) {
1450 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1451 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1454 if ( ps_list->o_sync_slog_size > 0 ) {
1455 if ( ps_list->o_sync_state.sid ==
1456 sop->o_sync_state.sid ) {
1464 slap_send_session_log( op, ps_list, rs );
1466 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1469 slap_build_sync_done_ctrl( sop, rs, ctrls,
1470 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_DELETES );
1473 rs->sr_ctrls = ctrls;
1474 rs->sr_ref = rs->sr_v2ref;
1475 rs->sr_err = (rs->sr_v2ref == NULL)
1476 ? LDAP_SUCCESS : LDAP_REFERRAL;
1477 rs->sr_rspoid = NULL;
1478 send_ldap_result( sop, rs );
1479 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL ) {
1480 slap_sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1483 slap_sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1484 ctrls[num_ctrls] = NULL;
1485 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1489 rs->sr_ctrls = NULL;
1490 rs->sr_ref = rs->sr_v2ref;
1491 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1492 rs->sr_rspoid = NULL;
1493 if ( get_pagedresults(sop) > SLAP_NO_CONTROL ) {
1494 send_paged_response( sop, rs, NULL, 0 );
1496 send_ldap_result( sop, rs );
1501 rs->sr_err = LDAP_SUCCESS;
1504 if( !IS_PSEARCH && e != NULL ) {
1505 /* free reader lock */
1506 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1510 LOCK_ID_FREE( bdb->bi_dbenv, locker );
1512 ber_bvfree( search_context_csn );
1514 if( rs->sr_v2ref ) {
1515 ber_bvarray_free( rs->sr_v2ref );
1516 rs->sr_v2ref = NULL;
1518 if( realbase.bv_val ) ch_free( realbase.bv_val );
1524 static int base_candidate(
1530 LDAP_LOG ( OPERATION, ENTRY,
1531 "base_candidate: base: \"%s\" (0x%08lx)\n",
1532 e->e_nname.bv_val, (long) e->e_id, 0);
1534 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1535 e->e_nname.bv_val, (long) e->e_id, 0);
1543 /* Look for "objectClass Present" in this filter.
1544 * Also count depth of filter tree while we're at it.
1546 static int oc_filter(
1555 if( cur > *max ) *max = cur;
1557 switch( f->f_choice ) {
1558 case LDAP_FILTER_PRESENT:
1559 if (f->f_desc == slap_schema.si_ad_objectClass) {
1564 case LDAP_FILTER_AND:
1565 case LDAP_FILTER_OR:
1567 for ( f=f->f_and; f; f=f->f_next ) {
1568 (void) oc_filter(f, cur, max);
1578 static void search_stack_free( void *key, void *data )
1580 ber_memfree_x(data, NULL);
1583 static void *search_stack( Operation *op )
1585 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1588 if ( op->o_threadctx ) {
1589 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1592 ret = bdb->bi_search_stack;
1596 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1598 if ( op->o_threadctx ) {
1599 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1600 ret, search_stack_free );
1602 bdb->bi_search_stack = ret;
1608 static int search_candidates(
1617 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1619 Filter f, rf, xf, nf;
1621 AttributeAssertion aa_ref;
1622 #ifdef BDB_SUBENTRIES
1624 AttributeAssertion aa_subentry;
1628 * This routine takes as input a filter (user-filter)
1629 * and rewrites it as follows:
1630 * (&(scope=DN)[(objectClass=subentry)]
1631 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1635 LDAP_LOG ( OPERATION, ENTRY,
1636 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1637 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope);
1639 Debug(LDAP_DEBUG_TRACE,
1640 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1641 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1644 xf.f_or = op->oq_search.rs_filter;
1645 xf.f_choice = LDAP_FILTER_OR;
1648 /* If the user's filter uses objectClass=*,
1649 * these clauses are redundant.
1651 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1652 && !get_subentries_visibility(op)
1653 && !is_sync_protocol(op) )
1655 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1656 /* match referral objects */
1657 struct berval bv_ref = { sizeof("referral")-1, "referral" };
1658 rf.f_choice = LDAP_FILTER_EQUALITY;
1660 rf.f_av_desc = slap_schema.si_ad_objectClass;
1661 rf.f_av_value = bv_ref;
1662 rf.f_next = xf.f_or;
1669 f.f_choice = LDAP_FILTER_AND;
1671 /* Dummy; we compute scope separately now */
1672 nf.f_choice = SLAPD_FILTER_COMPUTED;
1673 nf.f_result = LDAP_SUCCESS;
1674 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1675 ? op->oq_search.rs_filter : &xf ;
1676 /* Filter depth increased again, adding dummy clause */
1679 #ifdef BDB_SUBENTRIES
1680 if( get_subentries_visibility( op ) ) {
1681 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1682 sf.f_choice = LDAP_FILTER_EQUALITY;
1683 sf.f_ava = &aa_subentry;
1684 sf.f_av_desc = slap_schema.si_ad_objectClass;
1685 sf.f_av_value = bv_subentry;
1686 sf.f_next = nf.f_next;
1691 /* Allocate IDL stack, plus 1 more for former tmp */
1692 if ( depth+1 > bdb->bi_search_stack_depth ) {
1693 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1695 stack = search_stack( stackop );
1698 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1699 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1701 rc = bdb_dn2idl( op, e, ids, stack );
1704 if ( rc == LDAP_SUCCESS ) {
1705 rc = bdb_filter_candidates( op, &f, ids,
1706 stack, stack+BDB_IDL_UM_SIZE );
1709 if ( depth+1 > bdb->bi_search_stack_depth ) {
1715 LDAP_LOG ( OPERATION, DETAIL1,
1716 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1718 Debug(LDAP_DEBUG_TRACE,
1719 "bdb_search_candidates: failed (rc=%d)\n",
1725 LDAP_LOG ( OPERATION, DETAIL1,
1726 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1727 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1728 (long) BDB_IDL_LAST(ids));
1730 Debug(LDAP_DEBUG_TRACE,
1731 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1733 (long) BDB_IDL_FIRST(ids),
1734 (long) BDB_IDL_LAST(ids) );
1742 send_paged_response(
1748 LDAPControl ctrl, *ctrls[2];
1749 BerElementBuffer berbuf;
1750 BerElement *ber = (BerElement *)&berbuf;
1751 PagedResultsCookie respcookie;
1752 struct berval cookie;
1755 LDAP_LOG ( OPERATION, ENTRY,
1756 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1757 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1759 Debug(LDAP_DEBUG_ARGS,
1760 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1761 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1764 ctrl.ldctl_value.bv_val = NULL;
1768 ber_init2( ber, NULL, LBER_USE_DER );
1771 respcookie = ( PagedResultsCookie )(*lastid);
1772 cookie.bv_len = sizeof( respcookie );
1773 cookie.bv_val = (char *)&respcookie;
1776 respcookie = ( PagedResultsCookie )0;
1781 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1782 op->o_conn->c_pagedresults_state.ps_count =
1783 op->o_pagedresults_state.ps_count + rs->sr_nentries;
1785 /* return size of 0 -- no estimate */
1786 ber_printf( ber, "{iO}", 0, &cookie );
1788 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1792 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1793 ctrls[0]->ldctl_iscritical = 0;
1795 rs->sr_ctrls = ctrls;
1796 rs->sr_err = LDAP_SUCCESS;
1797 send_ldap_result( op, rs );
1798 rs->sr_ctrls = NULL;
1801 (void) ber_free_buf( ber );