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_pagerequest_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))
218 rs->sr_err = bdb_cache_find_id(op, NULL,
219 ida, &ei, 0, locker, &lockr );
220 if (rs->sr_err != LDAP_SUCCESS) {
225 /* This should only happen if the curscop IDL has maxed out and
226 * turned into a range that spans IDs indiscriminately
228 if (!is_entry_alias(a)) {
229 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
234 /* Actually dereference the alias */
236 a = deref_base( op, rs, a, &matched, locker, &lockr,
239 /* If the target was not already in our current candidates,
240 * make note of it in the newsubs list. Also
241 * set it in the scopes list so that bdb_search
244 if (bdb_idl_insert(ids, a->e_id) == 0) {
245 bdb_idl_insert(newsubs, a->e_id);
246 bdb_idl_insert(scopes, a->e_id);
248 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
251 } else if (matched) {
252 /* Alias could not be dereferenced, or it deref'd to
253 * an ID we've already seen. Ignore it.
255 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
260 /* If this is a OneLevel search, we're done; oldsubs only had one
261 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
263 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
265 ido = bdb_idl_next( oldsubs, &cursoro );
267 /* If we're done processing the old scopes, did we add any new
268 * scopes in this iteration? If so, go back and do those now.
271 if (BDB_IDL_IS_ZERO(newsubs)) break;
272 BDB_IDL_CPY(oldsubs, newsubs);
273 BDB_IDL_ZERO(newsubs);
275 ido = bdb_idl_first( oldsubs, &cursoro );
278 /* Find the entry corresponding to the next scope. If it can't
279 * be found, ignore it and move on. This should never happen;
280 * we should never see the ID of an entry that doesn't exist.
281 * Set the name so that the scope's IDL can be retrieved.
284 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
286 if ( rs->sr_err != LDAP_SUCCESS ) goto nextido;
292 #define is_sync_protocol(op) \
293 ((op)->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST)
295 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
296 ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
297 #define IS_PSEARCH (op != sop)
300 bdb_drop_psearch( Operation *op, ber_int_t msgid )
303 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
305 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
306 if ( ps_list->o_connid == op->o_connid ) {
307 if ( ps_list->o_msgid == msgid ) {
308 ps_list->o_abandon = 1;
309 LDAP_LIST_REMOVE( ps_list, o_ps_link );
310 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
311 LDAP_STAILQ_REMOVE( &op->o_conn->c_ops, ps_list,
313 LDAP_STAILQ_NEXT( ps_list, o_next ) = NULL;
314 op->o_conn->c_n_ops_executing--;
315 op->o_conn->c_n_ops_completed++;
316 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
326 bdb_abandon( Operation *op, SlapReply *rs )
330 ps = bdb_drop_psearch( op, op->oq_abandon.rs_msgid );
332 if ( ps->o_tmpmemctx ) {
333 sl_mem_destroy( NULL, ps->o_tmpmemctx );
338 return LDAP_UNAVAILABLE;
342 bdb_cancel( Operation *op, SlapReply *rs )
346 ps = bdb_drop_psearch( op, op->oq_cancel.rs_msgid );
348 rs->sr_err = LDAP_CANCELLED;
349 send_ldap_result( ps, rs );
350 if ( ps->o_tmpmemctx ) {
351 sl_mem_destroy( NULL, ps->o_tmpmemctx );
356 return LDAP_UNAVAILABLE;
359 int bdb_search( Operation *op, SlapReply *rs )
361 return bdb_do_search( op, rs, op, NULL, 0 );
364 /* For persistent searches, op is the currently executing operation,
365 * sop is the persistent search. For regular searches, sop = op.
368 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop,
369 Entry *ps_e, int ps_type )
371 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
374 ID candidates[BDB_IDL_UM_SIZE];
375 ID scopes[BDB_IDL_DB_SIZE];
376 Entry *e = NULL, base;
377 Entry *matched = NULL;
379 struct berval realbase = { 0, NULL };
383 AttributeName *attrs;
385 Filter contextcsnand, contextcsnle, cookief, csnfnot,
386 csnfeq, csnfand, csnfge;
387 AttributeAssertion aa_ge, aa_eq, aa_le;
389 struct berval *search_context_csn = NULL;
391 LDAPControl *ctrls[SLAP_MAX_RESPONSE_CONTROLS];
393 AttributeName uuid_attr[2];
395 int entry_sync_state = -1;
396 AttributeName null_attr;
397 int no_sync_state_change = 0;
398 struct slap_limits_set *limit = NULL;
401 u_int32_t locker = 0;
405 int sync_send_present_mode = 1;
411 BerVarray syncUUID_set = NULL;
412 int syncUUID_set_cnt = 0;
415 LDAP_LOG( OPERATION, ENTRY, "bdb_search\n", 0, 0, 0 );
417 Debug( LDAP_DEBUG_TRACE, "=> bdb_search\n",
420 attrs = sop->oq_search.rs_attrs;
422 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
423 struct slap_session_entry *sent;
424 if ( sop->o_sync_state.sid >= 0 ) {
425 LDAP_LIST_FOREACH( sent, &bdb->bi_session_list, se_link ) {
426 if ( sent->se_id == sop->o_sync_state.sid ) {
427 sop->o_sync_slog_size = sent->se_size;
434 /* psearch needs to be registered before refresh begins */
435 /* psearch and refresh transmission is serialized in send_ldap_ber() */
436 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
437 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
438 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
439 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
441 } else if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST
442 && sop->o_sync_slog_size >= 0 )
444 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
445 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
446 if ( ps_list->o_sync_slog_size >= 0 ) {
447 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
455 if ( ps_list->o_sync_slog_omitcsn.bv_len != 0 ) {
456 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
457 if ( sop->o_sync_state.ctxcsn &&
458 sop->o_sync_state.ctxcsn->bv_val != NULL )
460 value_match( &match, slap_schema.si_ad_entryCSN, mr,
461 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
462 sop->o_sync_state.ctxcsn,
463 &ps_list->o_sync_slog_omitcsn,
469 sync_send_present_mode = 0;
472 sync_send_present_mode = 0;
474 } else if ( sop->o_sync_slog_size >= 0 ) {
475 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
477 sop->o_sync_state.sid = -1;
479 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
482 null_attr.an_desc = NULL;
483 null_attr.an_oc = NULL;
484 null_attr.an_oc_exclude = 0;
485 null_attr.an_name.bv_len = 0;
486 null_attr.an_name.bv_val = NULL;
488 for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
489 ctrls[num_ctrls] = NULL;
493 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
495 attrs[0].an_desc = NULL;
496 attrs[0].an_oc = NULL;
497 attrs[0].an_oc_exclude = 0;
498 attrs[0].an_name.bv_len = 0;
499 attrs[0].an_name.bv_val = NULL;
502 manageDSAit = get_manageDSAit( sop );
504 /* Sync control overrides manageDSAit */
505 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
506 if ( manageDSAit == SLAP_NO_CONTROL ) {
507 manageDSAit = SLAP_CRITICAL_CONTROL;
509 } else if ( IS_PSEARCH ) {
510 if ( manageDSAit == SLAP_NO_CONTROL ) {
511 manageDSAit = SLAP_CRITICAL_CONTROL;
515 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
521 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
525 if ( sop->o_req_ndn.bv_len == 0 ) {
526 /* DIT root special case */
527 e = (Entry *) &slap_entry_root;
528 rs->sr_err = LDAP_SUCCESS;
531 /* get entry with reader lock */
532 rs->sr_err = bdb_dn2entry( op, NULL, &sop->o_req_ndn, &ei,
544 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
545 LOCK_ID_FREE (bdb->bi_dbenv, locker );
547 case DB_LOCK_DEADLOCK:
548 case DB_LOCK_NOTGRANTED:
551 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
552 LOCK_ID_FREE (bdb->bi_dbenv, locker );
556 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
557 BDB_IDL_ZERO(candidates);
558 e = deref_base( op, rs, e, &matched, locker, &lock,
563 struct berval matched_dn = { 0, NULL };
565 if ( matched != NULL ) {
567 ber_dupbv( &matched_dn, &matched->e_name );
569 erefs = is_entry_referral( matched )
570 ? get_entry_referrals( op, matched )
573 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
578 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
579 &sop->o_req_dn, sop->oq_search.rs_scope );
580 ber_bvarray_free( erefs );
584 rs->sr_ref = referral_rewrite( default_referral,
585 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
588 rs->sr_err = LDAP_REFERRAL;
589 rs->sr_matched = matched_dn.bv_val;
590 send_ldap_result( sop, rs );
592 LOCK_ID_FREE (bdb->bi_dbenv, locker );
594 ber_bvarray_free( rs->sr_ref );
597 if ( matched_dn.bv_val ) {
598 ber_memfree( matched_dn.bv_val );
599 rs->sr_matched = NULL;
604 if ( !manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
605 /* entry is a referral, don't allow add */
606 struct berval matched_dn;
609 ber_dupbv( &matched_dn, &e->e_name );
610 erefs = get_entry_referrals( op, e );
612 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
616 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
617 &sop->o_req_dn, sop->oq_search.rs_scope );
618 ber_bvarray_free( erefs );
622 LDAP_LOG ( OPERATION, RESULTS,
623 "bdb_search: entry is referral\n", 0, 0, 0 );
625 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
629 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
630 rs->sr_err = LDAP_REFERRAL;
631 rs->sr_matched = matched_dn.bv_val;
632 send_ldap_result( sop, rs );
634 LOCK_ID_FREE (bdb->bi_dbenv, locker );
635 ber_bvarray_free( rs->sr_ref );
637 ber_memfree( matched_dn.bv_val );
638 rs->sr_matched = NULL;
642 if ( get_assert( op ) &&
643 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
645 rs->sr_err = LDAP_ASSERTION_FAILED;
646 send_ldap_result( sop, rs );
650 /* if not root, get appropriate limits */
651 if ( be_isroot( op->o_bd, &sop->o_ndn ) ) {
654 ( void ) get_limits( op->o_bd, &sop->o_ndn, &limit );
657 /* The time/size limits come first because they require very little
658 * effort, so there's no chance the candidates are selected and then
659 * the request is not honored only because of time/size constraints
662 /* if no time limit requested, use soft limit (unless root!) */
664 if ( sop->oq_search.rs_tlimit == 0 ) {
665 sop->oq_search.rs_tlimit = -1; /* allow root to set no limit */
668 if ( sop->oq_search.rs_slimit == 0 ) {
669 sop->oq_search.rs_slimit = -1;
673 /* if no limit is required, use soft limit */
674 if ( sop->oq_search.rs_tlimit <= 0 ) {
675 sop->oq_search.rs_tlimit = limit->lms_t_soft;
677 /* if requested limit higher than hard limit, abort */
678 } else if ( sop->oq_search.rs_tlimit > limit->lms_t_hard ) {
679 /* no hard limit means use soft instead */
680 if ( limit->lms_t_hard == 0
681 && limit->lms_t_soft > -1
682 && sop->oq_search.rs_tlimit > limit->lms_t_soft ) {
683 sop->oq_search.rs_tlimit = limit->lms_t_soft;
685 /* positive hard limit means abort */
686 } else if ( limit->lms_t_hard > 0 ) {
687 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
688 send_ldap_result( sop, rs );
689 rs->sr_err = LDAP_SUCCESS;
693 /* negative hard limit means no limit */
696 /* if no limit is required, use soft limit */
697 if ( sop->oq_search.rs_slimit <= 0 ) {
698 if ( get_pagedresults(sop) && limit->lms_s_pr != 0 ) {
699 sop->oq_search.rs_slimit = limit->lms_s_pr;
701 sop->oq_search.rs_slimit = limit->lms_s_soft;
704 /* if requested limit higher than hard limit, abort */
705 } else if ( sop->oq_search.rs_slimit > limit->lms_s_hard ) {
706 /* no hard limit means use soft instead */
707 if ( limit->lms_s_hard == 0
708 && limit->lms_s_soft > -1
709 && sop->oq_search.rs_slimit > limit->lms_s_soft ) {
710 sop->oq_search.rs_slimit = limit->lms_s_soft;
712 /* positive hard limit means abort */
713 } else if ( limit->lms_s_hard > 0 ) {
714 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
715 send_ldap_result( sop, rs );
716 rs->sr_err = LDAP_SUCCESS;
720 /* negative hard limit means no limit */
724 /* compute it anyway; root does not use it */
725 stoptime = op->o_time + sop->oq_search.rs_tlimit;
727 /* need normalized dn below */
728 ber_dupbv( &realbase, &e->e_nname );
730 /* Copy info to base, must free entry before accessing the database
731 * in search_candidates, to avoid deadlocks.
733 base.e_private = e->e_private;
734 base.e_nname = realbase;
737 if ( e != &slap_entry_root ) {
738 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
743 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn,
744 locker, &ctxcsn_lock );
746 if ( rs->sr_err != LDAP_SUCCESS ) {
747 send_ldap_error( sop, rs, rs->sr_err,
748 "error in csn management in search" );
752 if ( sop->o_sync_mode != SLAP_SYNC_NONE &&
753 sop->o_sync_state.ctxcsn &&
754 sop->o_sync_state.ctxcsn->bv_val &&
755 ber_bvcmp( &sop->o_sync_state.ctxcsn[0], search_context_csn ) == 0 )
757 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
761 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );
764 /* select candidates */
765 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
766 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
769 BDB_IDL_ZERO( candidates );
770 BDB_IDL_ZERO( scopes );
771 rs->sr_err = search_candidates( op, sop, rs, &base,
772 locker, candidates, scopes );
775 if ( !IS_PSEARCH && sop->o_sync_mode != SLAP_SYNC_NONE ) {
776 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
779 /* start cursor at beginning of candidates.
783 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
784 cursor = bdb_idl_search( candidates, ps_e->e_id );
785 if ( candidates[cursor] != ps_e->e_id ) {
786 rs->sr_err = LDAP_SUCCESS;
789 } else if ( ps_e->e_id < BDB_IDL_RANGE_FIRST( candidates ) ||
790 ps_e->e_id > BDB_IDL_RANGE_LAST( candidates ))
792 rs->sr_err = LDAP_SUCCESS;
796 candidates[1] = ps_e->e_id;
799 if ( candidates[0] == 0 ) {
801 LDAP_LOG ( OPERATION, RESULTS,
802 "bdb_search: no candidates\n", 0, 0, 0 );
804 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
808 rs->sr_err = LDAP_SUCCESS;
810 send_ldap_result( sop, rs );
814 /* if not root and candidates exceed to-be-checked entries, abort */
815 if ( !isroot && limit->lms_s_unchecked != -1 ) {
816 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
817 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
818 send_ldap_result( sop, rs );
819 rs->sr_err = LDAP_SUCCESS;
824 if ( isroot || !limit->lms_s_pr_hide ) {
825 tentries = BDB_IDL_N(candidates);
828 if ( get_pagedresults(sop) ) {
829 if ( sop->o_pagedresults_state.ps_cookie == 0 ) {
832 if ( sop->o_pagedresults_size == 0 ) {
833 rs->sr_err = LDAP_SUCCESS;
834 rs->sr_text = "search abandoned by pagedResult size=0";
835 send_ldap_result( sop, rs );
838 for ( id = bdb_idl_first( candidates, &cursor );
839 id != NOID && id <= (ID)( sop->o_pagedresults_state.ps_cookie );
840 id = bdb_idl_next( candidates, &cursor ) ) /* empty */;
842 if ( cursor == NOID ) {
844 LDAP_LOG ( OPERATION, RESULTS,
845 "bdb_search: no paged results candidates\n",
848 Debug( LDAP_DEBUG_TRACE,
849 "bdb_search: no paged results candidates\n",
852 send_pagerequest_response( sop, rs, lastid, 0 );
854 rs->sr_err = LDAP_OTHER;
860 if (( sop->o_sync_mode & SLAP_SYNC_REFRESH ) || IS_PSEARCH ) {
863 cookief.f_choice = LDAP_FILTER_AND;
864 cookief.f_and = &csnfnot;
865 cookief.f_next = NULL;
867 csnfnot.f_choice = LDAP_FILTER_NOT;
868 csnfnot.f_not = &csnfeq;
869 csnfnot.f_next = &csnfand;
871 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
872 csnfeq.f_ava = &aa_eq;
873 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
874 if ( sop->o_sync_state.ctxcsn != NULL ) {
875 csnfeq.f_av_value = *sop->o_sync_state.ctxcsn;
877 csnfeq.f_av_value = slap_empty_bv;
880 csnfand.f_choice = LDAP_FILTER_AND;
881 csnfand.f_and = &csnfge;
882 csnfand.f_next = NULL;
884 csnfge.f_choice = LDAP_FILTER_GE;
885 csnfge.f_ava = &aa_ge;
886 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
887 if ( sop->o_sync_state.ctxcsn != NULL ) {
888 csnfge.f_av_value = *sop->o_sync_state.ctxcsn;
890 csnfge.f_av_value = slap_empty_bv;
893 if ( search_context_csn && !IS_PSEARCH ) {
894 csnfge.f_next = &contextcsnand;
896 contextcsnand.f_choice = LDAP_FILTER_AND;
897 contextcsnand.f_and = &contextcsnle;
898 contextcsnand.f_next = NULL;
900 contextcsnle.f_choice = LDAP_FILTER_LE;
901 contextcsnle.f_ava = &aa_le;
902 contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
903 contextcsnle.f_av_value = *search_context_csn;
904 contextcsnle.f_next = sop->oq_search.rs_filter;
906 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
907 if ( sop->o_sync_state.ctxcsn &&
908 sop->o_sync_state.ctxcsn->bv_val != NULL )
910 value_match( &match, slap_schema.si_ad_entryCSN, mr,
911 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
912 &sop->o_sync_state.ctxcsn[0], search_context_csn,
917 no_sync_state_change = ( match >= 0 );
919 csnfge.f_next = sop->oq_search.rs_filter;
923 for ( id = bdb_idl_first( candidates, &cursor );
924 id != NOID && !no_sync_state_change;
925 id = bdb_idl_next( candidates, &cursor ) )
930 /* check for abandon */
931 if ( sop->o_abandon ) {
933 bdb_drop_psearch( sop, sop->o_msgid );
935 rs->sr_err = LDAP_SUCCESS;
939 if ( sop->o_cancel ) {
940 assert( sop->o_cancel == SLAP_CANCEL_REQ );
941 rs->sr_err = LDAP_CANCELLED;
942 send_ldap_result( sop, rs );
943 sop->o_cancel = SLAP_CANCEL_ACK;
944 rs->sr_err = LDAP_SUCCESS;
948 /* check time limit */
949 if ( sop->oq_search.rs_tlimit != -1 && slap_get_time() > stoptime ) {
950 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
951 rs->sr_ref = rs->sr_v2ref;
952 send_ldap_result( sop, rs );
953 rs->sr_err = LDAP_SUCCESS;
959 /* get the entry with reader lock */
961 rs->sr_err = bdb_cache_find_id( op, NULL,
962 id, &ei, 0, locker, &lock );
964 if (rs->sr_err == LDAP_BUSY) {
965 rs->sr_text = "ldap server busy";
966 send_ldap_result( sop, rs );
969 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
970 || rs->sr_err == DB_LOCK_NOTGRANTED )
975 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
982 if( !BDB_IDL_IS_RANGE(candidates) ) {
983 /* only complain for non-range IDLs */
985 LDAP_LOG ( OPERATION, RESULTS,
986 "bdb_search: candidate %ld not found\n",
989 Debug( LDAP_DEBUG_TRACE,
990 "bdb_search: candidate %ld not found\n",
1003 #ifdef BDB_SUBENTRIES
1004 /* FIXME: send all but syncrepl */
1006 if ( !is_sync_protocol( sop ) )
1009 if ( is_entry_subentry( e ) ) {
1010 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
1011 if(!get_subentries_visibility( sop )) {
1012 /* only subentries are visible */
1016 } else if ( get_subentries( sop ) &&
1017 !get_subentries_visibility( sop ))
1019 /* only subentries are visible */
1023 } else if ( get_subentries_visibility( sop )) {
1024 /* only subentries are visible */
1028 #endif /* BDB_SUBENTRIES */
1030 /* Does this candidate actually satisfy the search scope?
1032 * Note that we don't lock access to the bei_parent pointer.
1033 * Since only leaf nodes can be deleted, the parent of any
1034 * node will always be a valid node. Also since we have
1035 * a Read lock on the data, it cannot be renamed out of the
1036 * scope while we are looking at it, and unless we're using
1037 * BDB_HIER, its parents cannot be moved either.
1039 switch( sop->ors_scope ) {
1040 case LDAP_SCOPE_BASE:
1041 /* This is always true, yes? */
1042 if ( id == base.e_id ) scopeok = 1;
1045 case LDAP_SCOPE_ONELEVEL:
1046 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
1049 case LDAP_SCOPE_CHILDREN:
1050 if ( id == base.e_id ) break;
1052 case LDAP_SCOPE_SUBTREE: {
1054 for (tmp = BEI(e); tmp->bei_parent;
1055 tmp = tmp->bei_parent ) {
1056 if ( tmp->bei_id == base.e_id ) {
1065 /* aliases were already dereferenced in candidate list */
1066 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
1067 /* but if the search base is an alias, and we didn't
1068 * deref it when finding, return it.
1070 if ( is_entry_alias(e) &&
1071 ((sop->ors_deref & LDAP_DEREF_FINDING) ||
1072 !bvmatch(&e->e_nname, &op->o_req_ndn)))
1077 /* scopes is only non-empty for onelevel or subtree */
1078 if ( !scopeok && BDB_IDL_N(scopes) ) {
1080 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
1081 x = bdb_idl_search( scopes, e->e_id );
1082 if ( scopes[x] == e->e_id ) scopeok = 1;
1084 /* subtree, walk up the tree */
1085 EntryInfo *tmp = BEI(e);
1086 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
1087 x = bdb_idl_search( scopes, tmp->bei_id );
1088 if ( scopes[x] == tmp->bei_id ) {
1098 /* Not in scope, ignore it */
1101 LDAP_LOG ( OPERATION, RESULTS,
1102 "bdb_search: %ld scope not okay\n",
1105 Debug( LDAP_DEBUG_TRACE,
1106 "bdb_search: %ld scope not okay\n",
1113 * if it's a referral, add it to the list of referrals. only do
1114 * this for non-base searches, and don't check the filter
1115 * explicitly here since it's only a candidate anyway.
1117 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE
1118 && is_entry_referral( e ) )
1120 BerVarray erefs = get_entry_referrals( sop, e );
1121 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
1122 sop->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
1123 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
1125 send_search_reference( sop, rs );
1127 ber_bvarray_free( rs->sr_ref );
1128 ber_bvarray_free( erefs );
1134 if ( !manageDSAit && is_entry_glue( e )) {
1138 /* if it matches the filter and scope, send it */
1140 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1141 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1143 rs->sr_err = LDAP_COMPARE_TRUE;
1146 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1147 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1148 rs->sr_err = test_filter( sop, rs->sr_entry, &contextcsnand );
1149 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1150 if ( rc_sync == LDAP_COMPARE_TRUE ) {
1151 if ( no_sync_state_change ) {
1153 LDAP_LOG ( OPERATION, RESULTS,
1154 "bdb_search: error in context csn management\n",
1157 Debug( LDAP_DEBUG_TRACE,
1158 "bdb_search: error in context csn management\n",
1162 entry_sync_state = LDAP_SYNC_ADD;
1164 if ( no_sync_state_change ) {
1167 entry_sync_state = LDAP_SYNC_PRESENT;
1171 rs->sr_err = test_filter( sop,
1172 rs->sr_entry, sop->oq_search.rs_filter );
1176 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1177 /* check size limit */
1178 if ( --sop->oq_search.rs_slimit == -1 &&
1179 sop->o_sync_slog_size == -1 )
1182 bdb_cache_return_entry_r( bdb->bi_dbenv,
1183 &bdb->bi_cache, e, &lock );
1186 rs->sr_entry = NULL;
1187 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1188 rs->sr_ref = rs->sr_v2ref;
1189 send_ldap_result( sop, rs );
1190 rs->sr_err = LDAP_SUCCESS;
1194 if ( get_pagedresults(sop) ) {
1195 if ( rs->sr_nentries >= sop->o_pagedresults_size ) {
1196 send_pagerequest_response( sop, rs,
1208 int premodify_found = 0;
1209 int entry_sync_state;
1211 if ( ps_type == LDAP_PSEARCH_BY_ADD ||
1212 ps_type == LDAP_PSEARCH_BY_DELETE ||
1213 ps_type == LDAP_PSEARCH_BY_MODIFY ||
1214 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1216 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1217 struct psid_entry* psid_e;
1218 LDAP_LIST_FOREACH( psid_e,
1219 &op->o_pm_list, ps_link)
1221 if( psid_e->ps_op == sop ) {
1222 premodify_found = 1;
1223 LDAP_LIST_REMOVE(psid_e, ps_link);
1227 if (psid_e != NULL) free (psid_e);
1229 if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1230 entry_sync_state = LDAP_SYNC_ADD;
1231 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1232 entry_sync_state = LDAP_SYNC_DELETE;
1233 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1234 if ( premodify_found ) {
1235 entry_sync_state = LDAP_SYNC_MODIFY;
1237 entry_sync_state = LDAP_SYNC_ADD;
1239 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT ) {
1240 entry_sync_state = LDAP_SYNC_DELETE;
1242 rs->sr_err = LDAP_OTHER;
1245 if ( sop->o_sync_slog_size != -1 ) {
1246 if ( entry_sync_state == LDAP_SYNC_DELETE ) {
1247 result = slap_add_session_log( op, sop, e );
1252 struct berval cookie;
1253 slap_compose_sync_cookie( sop, &cookie,
1255 sop->o_sync_state.sid,
1256 sop->o_sync_state.rid );
1257 rs->sr_err = slap_build_sync_state_ctrl( sop,
1258 rs, e, entry_sync_state, ctrls,
1259 num_ctrls++, 1, &cookie );
1260 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1261 rs->sr_attrs = attrs;
1262 rs->sr_ctrls = ctrls;
1263 result = send_search_entry( sop, rs );
1264 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1265 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1267 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1268 ctrls[num_ctrls] = NULL;
1269 rs->sr_ctrls = NULL;
1271 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1272 struct psid_entry* psid_e;
1273 psid_e = (struct psid_entry *) ch_calloc(1,
1274 sizeof(struct psid_entry));
1275 psid_e->ps_op = sop;
1276 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1281 LDAP_LOG ( OPERATION, RESULTS,
1282 "bdb_search: invalid ps_type (%d) \n",
1285 Debug( LDAP_DEBUG_TRACE,
1286 "bdb_search: invalid ps_type (%d) \n",
1291 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1292 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1293 rs->sr_err = slap_build_sync_state_ctrl( sop,
1294 rs, e, entry_sync_state, ctrls,
1295 num_ctrls++, 0, NULL );
1296 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1297 rs->sr_ctrls = ctrls;
1298 rs->sr_attrs = sop->oq_search.rs_attrs;
1299 result = send_search_entry( sop, rs );
1300 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1302 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1303 ctrls[num_ctrls] = NULL;
1304 rs->sr_ctrls = NULL;
1305 } else { /* PRESENT */
1306 if ( sync_send_present_mode ) {
1307 result = slap_build_syncUUID_set( sop,
1309 if ( result <= 0 ) {
1313 if ( syncUUID_set_cnt ==
1314 SLAP_SYNCUUID_SET_SIZE )
1316 rs->sr_err = LDAP_SUCCESS;
1317 rs->sr_rspoid = LDAP_SYNC_INFO;
1318 rs->sr_ctrls = NULL;
1319 result = slap_send_syncinfo( sop, rs,
1320 LDAP_TAG_SYNC_ID_SET,
1321 NULL, 0, syncUUID_set, 0 );
1322 if ( result != LDAP_SUCCESS ) {
1325 ber_bvarray_free_x( syncUUID_set,
1327 syncUUID_set = NULL;
1328 syncUUID_set_cnt = 0;
1336 rs->sr_attrs = sop->oq_search.rs_attrs;
1337 rs->sr_ctrls = NULL;
1338 result = send_search_entry( sop, rs );
1343 case 0: /* entry sent ok */
1345 case 1: /* entry not sent */
1347 case -1: /* connection closed */
1349 bdb_cache_return_entry_r(bdb->bi_dbenv,
1350 &bdb->bi_cache, e, &lock);
1352 rs->sr_entry = NULL;
1353 rs->sr_err = LDAP_OTHER;
1359 LDAP_LOG ( OPERATION, RESULTS,
1360 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1362 Debug( LDAP_DEBUG_TRACE,
1363 "bdb_search: %ld does not match filter\n",
1370 /* free reader lock */
1372 bdb_cache_return_entry_r( bdb->bi_dbenv,
1373 &bdb->bi_cache, e , &lock );
1374 if ( sop->o_nocaching ) {
1375 bdb_cache_delete_entry( bdb, ei, locker, &lock );
1379 rs->sr_entry = NULL;
1382 ldap_pvt_thread_yield();
1385 if ( syncUUID_set_cnt > 0 ) {
1386 rs->sr_err = LDAP_SUCCESS;
1387 rs->sr_rspoid = LDAP_SYNC_INFO;
1388 rs->sr_ctrls = NULL;
1389 slap_send_syncinfo( sop, rs, LDAP_TAG_SYNC_ID_SET,
1390 NULL, 0, syncUUID_set, 0 );
1391 ber_bvarray_free_x( syncUUID_set, sop->o_tmpmemctx );
1392 syncUUID_set_cnt = 0;
1397 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1398 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1399 struct berval cookie;
1400 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1401 sop->o_sync_state.sid, sop->o_sync_state.rid );
1403 if ( sync_send_present_mode ) {
1404 rs->sr_err = LDAP_SUCCESS;
1405 rs->sr_rspoid = LDAP_SYNC_INFO;
1406 rs->sr_ctrls = NULL;
1407 slap_send_syncinfo( sop, rs,
1408 LDAP_TAG_SYNC_REFRESH_PRESENT, &cookie, 1, NULL, 0 );
1410 if ( !no_sync_state_change ) {
1412 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1413 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1416 if ( ps_list->o_sync_slog_size > 0 ) {
1417 if ( ps_list->o_sync_state.sid ==
1418 sop->o_sync_state.sid ) {
1426 rs->sr_err = LDAP_SUCCESS;
1427 rs->sr_rspoid = NULL;
1428 rs->sr_ctrls = NULL;
1429 slap_send_session_log( op, ps_list, rs );
1431 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1433 rs->sr_err = LDAP_SUCCESS;
1434 rs->sr_rspoid = LDAP_SYNC_INFO;
1435 rs->sr_ctrls = NULL;
1436 slap_send_syncinfo( sop, rs,
1437 LDAP_TAG_SYNC_REFRESH_DELETE, &cookie, 1, NULL, 0 );
1440 if ( cookie.bv_val ) {
1441 ch_free( cookie.bv_val );
1444 /* refreshOnly mode */
1445 struct berval cookie;
1446 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1447 sop->o_sync_state.sid, sop->o_sync_state.rid );
1449 if ( sync_send_present_mode ) {
1450 slap_build_sync_done_ctrl( sop, rs, ctrls,
1451 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1453 if ( !no_sync_state_change ) {
1455 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1456 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1459 if ( ps_list->o_sync_slog_size > 0 ) {
1460 if ( ps_list->o_sync_state.sid ==
1461 sop->o_sync_state.sid ) {
1469 slap_send_session_log( op, ps_list, rs );
1471 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1473 slap_build_sync_done_ctrl( sop, rs, ctrls,
1474 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_DELETES );
1477 rs->sr_ctrls = ctrls;
1478 rs->sr_ref = rs->sr_v2ref;
1479 rs->sr_err = (rs->sr_v2ref == NULL)
1480 ? LDAP_SUCCESS : LDAP_REFERRAL;
1481 rs->sr_rspoid = NULL;
1482 send_ldap_result( sop, rs );
1483 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL ) {
1484 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1487 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1488 ctrls[num_ctrls] = NULL;
1489 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1492 rs->sr_ctrls = NULL;
1493 rs->sr_ref = rs->sr_v2ref;
1494 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1495 rs->sr_rspoid = NULL;
1496 send_ldap_result( sop, rs );
1500 rs->sr_err = LDAP_SUCCESS;
1503 if( !IS_PSEARCH && e != NULL ) {
1504 /* free reader lock */
1505 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1508 LOCK_ID_FREE( bdb->bi_dbenv, locker );
1510 ber_bvfree( search_context_csn );
1512 if( rs->sr_v2ref ) {
1513 ber_bvarray_free( rs->sr_v2ref );
1514 rs->sr_v2ref = NULL;
1516 if( realbase.bv_val ) ch_free( realbase.bv_val );
1522 static int base_candidate(
1528 LDAP_LOG ( OPERATION, ENTRY,
1529 "base_candidate: base: \"%s\" (0x%08lx)\n",
1530 e->e_nname.bv_val, (long) e->e_id, 0);
1532 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1533 e->e_nname.bv_val, (long) e->e_id, 0);
1541 /* Look for "objectClass Present" in this filter.
1542 * Also count depth of filter tree while we're at it.
1544 static int oc_filter(
1553 if( cur > *max ) *max = cur;
1555 switch( f->f_choice ) {
1556 case LDAP_FILTER_PRESENT:
1557 if (f->f_desc == slap_schema.si_ad_objectClass) {
1562 case LDAP_FILTER_AND:
1563 case LDAP_FILTER_OR:
1565 for ( f=f->f_and; f; f=f->f_next ) {
1566 (void) oc_filter(f, cur, max);
1576 static void search_stack_free( void *key, void *data )
1578 ber_memfree_x(data, NULL);
1581 static void *search_stack( Operation *op )
1583 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1586 if ( op->o_threadctx ) {
1587 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1590 ret = bdb->bi_search_stack;
1594 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1596 if ( op->o_threadctx ) {
1597 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1598 ret, search_stack_free );
1600 bdb->bi_search_stack = ret;
1606 static int search_candidates(
1615 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1617 Filter f, rf, xf, nf;
1619 AttributeAssertion aa_ref;
1620 #ifdef BDB_SUBENTRIES
1622 AttributeAssertion aa_subentry;
1626 * This routine takes as input a filter (user-filter)
1627 * and rewrites it as follows:
1628 * (&(scope=DN)[(objectClass=subentry)]
1629 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1633 LDAP_LOG ( OPERATION, ENTRY,
1634 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1635 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope);
1637 Debug(LDAP_DEBUG_TRACE,
1638 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1639 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1642 xf.f_or = op->oq_search.rs_filter;
1643 xf.f_choice = LDAP_FILTER_OR;
1646 /* If the user's filter uses objectClass=*,
1647 * these clauses are redundant.
1649 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1650 && !get_subentries_visibility(op)
1651 && !is_sync_protocol(op) )
1653 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1654 /* match referral objects */
1655 struct berval bv_ref = { sizeof("referral")-1, "referral" };
1656 rf.f_choice = LDAP_FILTER_EQUALITY;
1658 rf.f_av_desc = slap_schema.si_ad_objectClass;
1659 rf.f_av_value = bv_ref;
1660 rf.f_next = xf.f_or;
1667 f.f_choice = LDAP_FILTER_AND;
1669 /* Dummy; we compute scope separately now */
1670 nf.f_choice = SLAPD_FILTER_COMPUTED;
1671 nf.f_result = LDAP_SUCCESS;
1672 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1673 ? op->oq_search.rs_filter : &xf ;
1674 /* Filter depth increased again, adding dummy clause */
1677 #ifdef BDB_SUBENTRIES
1678 if( get_subentries_visibility( op ) ) {
1679 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1680 sf.f_choice = LDAP_FILTER_EQUALITY;
1681 sf.f_ava = &aa_subentry;
1682 sf.f_av_desc = slap_schema.si_ad_objectClass;
1683 sf.f_av_value = bv_subentry;
1684 sf.f_next = nf.f_next;
1689 /* Allocate IDL stack, plus 1 more for former tmp */
1690 if ( depth+1 > bdb->bi_search_stack_depth ) {
1691 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1693 stack = search_stack( stackop );
1696 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1697 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1699 rc = bdb_dn2idl( op, e, ids, stack );
1702 if ( rc == LDAP_SUCCESS ) {
1703 rc = bdb_filter_candidates( op, &f, ids,
1704 stack, stack+BDB_IDL_UM_SIZE );
1707 if ( depth+1 > bdb->bi_search_stack_depth ) {
1713 LDAP_LOG ( OPERATION, DETAIL1,
1714 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1716 Debug(LDAP_DEBUG_TRACE,
1717 "bdb_search_candidates: failed (rc=%d)\n",
1723 LDAP_LOG ( OPERATION, DETAIL1,
1724 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1725 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1726 (long) BDB_IDL_LAST(ids));
1728 Debug(LDAP_DEBUG_TRACE,
1729 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1731 (long) BDB_IDL_FIRST(ids),
1732 (long) BDB_IDL_LAST(ids) );
1740 send_pagerequest_response(
1746 LDAPControl ctrl, *ctrls[2];
1747 BerElementBuffer berbuf;
1748 BerElement *ber = (BerElement *)&berbuf;
1749 struct berval cookie = { 0, NULL };
1750 PagedResultsCookie respcookie;
1753 LDAP_LOG ( OPERATION, ENTRY,
1754 "send_pagerequest_response: lastid: (0x%08lx) "
1755 "nentries: (0x%081x)\n",
1756 lastid, rs->sr_nentries, NULL );
1758 Debug(LDAP_DEBUG_ARGS, "send_pagerequest_response: lastid: (0x%08lx) "
1759 "nentries: (0x%081x)\n", lastid, rs->sr_nentries, NULL );
1762 ctrl.ldctl_value.bv_val = NULL;
1766 ber_init2( ber, NULL, LBER_USE_DER );
1768 respcookie = ( PagedResultsCookie )lastid;
1769 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1770 cookie.bv_len = sizeof( respcookie );
1771 cookie.bv_val = (char *)&respcookie;
1774 * FIXME: we should consider sending an estimate of the entries
1775 * left, after appropriate security check is done
1777 ber_printf( ber, "{iO}", tentries, &cookie );
1779 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1783 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1784 ctrls[0]->ldctl_iscritical = 0;
1786 rs->sr_ctrls = ctrls;
1787 rs->sr_err = LDAP_SUCCESS;
1788 send_ldap_result( op, rs );
1791 (void) ber_free_buf( ber );