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) {
69 /* Remember the last entry we looked at, so we can
74 /* If this is part of a subtree or onelevel search,
75 * have we seen this ID before? If so, quit.
77 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
82 /* If we've seen this ID during this deref iteration,
85 if ( bdb_idl_insert( tmp, e->e_id ) ) {
86 rs->sr_err = LDAP_ALIAS_PROBLEM;
87 rs->sr_text = "circular alias";
92 /* If there was a problem getting the aliasedObjectName,
93 * get_alias_dn will have set the error status.
95 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
100 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
103 if ( ei ) e = ei->bei_e;
107 rs->sr_err = LDAP_ALIAS_PROBLEM;
108 rs->sr_text = "aliasedObject not found";
112 /* Free the previous entry, continue to work with the
113 * one we just retrieved.
115 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
119 /* We found a regular entry. Return this to the caller. The
120 * entry is still locked for Read.
122 if (!is_entry_alias(e)) {
123 rs->sr_err = LDAP_SUCCESS;
131 /* Look for and dereference all aliases within the search scope. Adds
132 * the dereferenced entries to the "ids" list. Requires "stack" to be
133 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
134 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
136 static int search_aliases(
146 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
147 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
148 ID cursora, ida, cursoro, ido, *subscop2;
151 struct berval bv_alias = { sizeof("alias")-1, "alias" };
152 AttributeAssertion aa_alias;
154 DB_LOCK locka, lockr;
157 aliases = stack; /* IDL of all aliases in the database */
158 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
159 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
160 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
161 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
162 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
163 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
165 /* A copy of subscop, because subscop gets clobbered by
166 * the bdb_idl_union/intersection routines
168 subscop2 = tmp + BDB_IDL_DB_SIZE;
170 af.f_choice = LDAP_FILTER_EQUALITY;
171 af.f_ava = &aa_alias;
172 af.f_av_desc = slap_schema.si_ad_objectClass;
173 af.f_av_value = bv_alias;
176 /* Find all aliases in database */
177 BDB_IDL_ZERO( aliases );
178 rs->sr_err = bdb_filter_candidates( op, &af, aliases,
180 if (rs->sr_err != LDAP_SUCCESS) {
184 oldsubs[1] = e->e_id;
187 BDB_IDL_ZERO( visited );
188 BDB_IDL_ZERO( newsubs );
191 ido = bdb_idl_first( oldsubs, &cursoro );
194 /* Set curscop to only the aliases in the current scope. Start with
195 * all the aliases, obtain the IDL for the current scope, and then
196 * get the intersection of these two IDLs. Add the current scope
197 * to the cumulative list of candidates.
199 BDB_IDL_CPY( curscop, aliases );
200 rs->sr_err = bdb_dn2idl( op, e, subscop,
201 subscop2+BDB_IDL_DB_SIZE );
205 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
207 BDB_IDL_CPY(subscop2, subscop);
208 rs->sr_err = bdb_idl_intersection(curscop, subscop);
209 bdb_idl_union( ids, subscop2 );
211 /* Dereference all of the aliases in the current scope. */
213 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
214 ida = bdb_idl_next(curscop, &cursora))
217 rs->sr_err = bdb_cache_find_id(op, NULL,
218 ida, &ei, 0, locker, &lockr );
219 if (rs->sr_err != LDAP_SUCCESS) {
224 /* This should only happen if the curscop IDL has maxed out and
225 * turned into a range that spans IDs indiscriminately
227 if (!is_entry_alias(a)) {
228 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
233 /* Actually dereference the alias */
235 a = deref_base( op, rs, a, &matched, locker, &lockr,
238 /* If the target was not already in our current candidates,
239 * make note of it in the newsubs list. Also
240 * set it in the scopes list so that bdb_search
243 if (bdb_idl_insert(ids, a->e_id) == 0) {
244 bdb_idl_insert(newsubs, a->e_id);
245 bdb_idl_insert(scopes, a->e_id);
247 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
250 } else if (matched) {
251 /* Alias could not be dereferenced, or it deref'd to
252 * an ID we've already seen. Ignore it.
254 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
259 /* If this is a OneLevel search, we're done; oldsubs only had one
260 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
262 if (op->ors_scope != LDAP_SCOPE_SUBTREE) break;
264 ido = bdb_idl_next( oldsubs, &cursoro );
266 /* If we're done processing the old scopes, did we add any new
267 * scopes in this iteration? If so, go back and do those now.
270 if (BDB_IDL_IS_ZERO(newsubs)) break;
271 BDB_IDL_CPY(oldsubs, newsubs);
272 BDB_IDL_ZERO(newsubs);
274 ido = bdb_idl_first( oldsubs, &cursoro );
277 /* Find the entry corresponding to the next scope. If it can't
278 * be found, ignore it and move on. This should never happen;
279 * we should never see the ID of an entry that doesn't exist.
280 * Set the name so that the scope's IDL can be retrieved.
283 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
285 if ( rs->sr_err != LDAP_SUCCESS ) goto nextido;
292 int is_sync_protocol( Operation *op )
294 if ( op->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST )
299 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
300 ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
301 #define IS_PSEARCH (op != sop)
304 bdb_drop_psearch( Operation *op, ber_int_t msgid )
307 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
309 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
310 if ( ps_list->o_connid == op->o_connid ) {
311 if ( ps_list->o_msgid == msgid ) {
312 ps_list->o_abandon = 1;
313 LDAP_LIST_REMOVE( ps_list, o_ps_link );
314 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
315 LDAP_STAILQ_REMOVE( &op->o_conn->c_ops, ps_list,
317 LDAP_STAILQ_NEXT( ps_list, o_next ) = NULL;
318 op->o_conn->c_n_ops_executing--;
319 op->o_conn->c_n_ops_completed++;
320 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
330 bdb_abandon( Operation *op, SlapReply *rs )
334 ps = bdb_drop_psearch( op, op->oq_abandon.rs_msgid );
336 if ( ps->o_tmpmemctx ) {
337 sl_mem_destroy( NULL, ps->o_tmpmemctx );
342 return LDAP_UNAVAILABLE;
346 bdb_cancel( Operation *op, SlapReply *rs )
350 ps = bdb_drop_psearch( op, op->oq_cancel.rs_msgid );
352 rs->sr_err = LDAP_CANCELLED;
353 send_ldap_result( ps, rs );
354 if ( ps->o_tmpmemctx ) {
355 sl_mem_destroy( NULL, ps->o_tmpmemctx );
360 return LDAP_UNAVAILABLE;
363 int bdb_search( Operation *op, SlapReply *rs )
365 return bdb_do_search( op, rs, op, NULL, 0 );
368 /* For persistent searches, op is the currently executing operation,
369 * sop is the persistent search. For regular searches, sop = op.
372 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop,
373 Entry *ps_e, int ps_type )
375 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
378 ID candidates[BDB_IDL_UM_SIZE];
379 ID scopes[BDB_IDL_DB_SIZE];
380 Entry *e = NULL, base;
381 Entry *matched = NULL;
383 struct berval realbase = { 0, NULL };
387 AttributeName *attrs;
389 Filter contextcsnand, contextcsnle, cookief, csnfnot,
390 csnfeq, csnfand, csnfge;
391 AttributeAssertion aa_ge, aa_eq, aa_le;
393 struct berval *search_context_csn = NULL;
395 LDAPControl *ctrls[SLAP_MAX_RESPONSE_CONTROLS];
397 AttributeName uuid_attr[2];
399 int entry_sync_state = -1;
400 AttributeName null_attr;
401 int no_sync_state_change = 0;
402 struct slap_limits_set *limit = NULL;
405 u_int32_t locker = 0;
409 int sync_send_present_mode = 1;
415 BerVarray syncUUID_set = NULL;
416 int syncUUID_set_cnt = 0;
419 LDAP_LOG( OPERATION, ENTRY, "bdb_search\n", 0, 0, 0 );
421 Debug( LDAP_DEBUG_TRACE, "=> bdb_search\n",
424 attrs = sop->oq_search.rs_attrs;
426 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
427 struct slap_session_entry *sent;
428 if ( sop->o_sync_state.sid >= 0 ) {
429 LDAP_LIST_FOREACH( sent, &bdb->bi_session_list, se_link ) {
430 if ( sent->se_id == sop->o_sync_state.sid ) {
431 sop->o_sync_slog_size = sent->se_size;
438 /* psearch needs to be registered before refresh begins */
439 /* psearch and refresh transmission is serialized in send_ldap_ber() */
440 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
441 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
442 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
443 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
445 } else if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST
446 && sop->o_sync_slog_size >= 0 )
448 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
449 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
450 if ( ps_list->o_sync_slog_size >= 0 ) {
451 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
459 if ( ps_list->o_sync_slog_omitcsn.bv_len != 0 ) {
460 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
461 if ( sop->o_sync_state.ctxcsn &&
462 sop->o_sync_state.ctxcsn->bv_val != NULL )
464 value_match( &match, slap_schema.si_ad_entryCSN, mr,
465 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
466 sop->o_sync_state.ctxcsn,
467 &ps_list->o_sync_slog_omitcsn,
473 sync_send_present_mode = 0;
476 sync_send_present_mode = 0;
478 } else if ( sop->o_sync_slog_size >= 0 ) {
479 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
481 sop->o_sync_state.sid = -1;
483 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
486 null_attr.an_desc = NULL;
487 null_attr.an_oc = NULL;
488 null_attr.an_oc_exclude = 0;
489 null_attr.an_name.bv_len = 0;
490 null_attr.an_name.bv_val = NULL;
492 for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
493 ctrls[num_ctrls] = NULL;
497 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
499 attrs[0].an_desc = NULL;
500 attrs[0].an_oc = NULL;
501 attrs[0].an_oc_exclude = 0;
502 attrs[0].an_name.bv_len = 0;
503 attrs[0].an_name.bv_val = NULL;
506 manageDSAit = get_manageDSAit( sop );
508 /* Sync control overrides manageDSAit */
509 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
510 if ( manageDSAit == SLAP_NO_CONTROL ) {
511 manageDSAit = SLAP_CRITICAL_CONTROL;
513 } else if ( IS_PSEARCH ) {
514 if ( manageDSAit == SLAP_NO_CONTROL ) {
515 manageDSAit = SLAP_CRITICAL_CONTROL;
519 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
525 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
529 if ( sop->o_req_ndn.bv_len == 0 ) {
530 /* DIT root special case */
531 e = (Entry *) &slap_entry_root;
532 rs->sr_err = LDAP_SUCCESS;
535 /* get entry with reader lock */
536 rs->sr_err = bdb_dn2entry( op, NULL, &sop->o_req_ndn, &ei,
548 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
549 LOCK_ID_FREE (bdb->bi_dbenv, locker );
551 case DB_LOCK_DEADLOCK:
552 case DB_LOCK_NOTGRANTED:
555 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
556 LOCK_ID_FREE (bdb->bi_dbenv, locker );
560 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
561 BDB_IDL_ZERO(candidates);
562 e = deref_base( op, rs, e, &matched, locker, &lock,
567 struct berval matched_dn = { 0, NULL };
569 if ( matched != NULL ) {
571 ber_dupbv( &matched_dn, &matched->e_name );
573 erefs = is_entry_referral( matched )
574 ? get_entry_referrals( op, matched )
577 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
582 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
583 &sop->o_req_dn, sop->oq_search.rs_scope );
584 ber_bvarray_free( erefs );
588 rs->sr_ref = referral_rewrite( default_referral,
589 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
592 rs->sr_err = LDAP_REFERRAL;
593 rs->sr_matched = matched_dn.bv_val;
594 send_ldap_result( sop, rs );
596 LOCK_ID_FREE (bdb->bi_dbenv, locker );
598 ber_bvarray_free( rs->sr_ref );
601 if ( matched_dn.bv_val ) {
602 ber_memfree( matched_dn.bv_val );
603 rs->sr_matched = NULL;
608 if ( !manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
609 /* entry is a referral, don't allow add */
610 struct berval matched_dn;
613 ber_dupbv( &matched_dn, &e->e_name );
614 erefs = get_entry_referrals( op, e );
616 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
620 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
621 &sop->o_req_dn, sop->oq_search.rs_scope );
622 ber_bvarray_free( erefs );
626 LDAP_LOG ( OPERATION, RESULTS,
627 "bdb_search: entry is referral\n", 0, 0, 0 );
629 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
633 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
634 rs->sr_err = LDAP_REFERRAL;
635 rs->sr_matched = matched_dn.bv_val;
636 send_ldap_result( sop, rs );
638 LOCK_ID_FREE (bdb->bi_dbenv, locker );
639 ber_bvarray_free( rs->sr_ref );
641 ber_memfree( matched_dn.bv_val );
642 rs->sr_matched = NULL;
646 if ( get_assert( op ) &&
647 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
649 rs->sr_err = LDAP_ASSERTION_FAILED;
650 send_ldap_result( sop, rs );
654 /* if not root, get appropriate limits */
655 if ( be_isroot( op->o_bd, &sop->o_ndn ) ) {
658 ( void ) get_limits( op, &sop->o_ndn, &limit );
661 /* The time/size limits come first because they require very little
662 * effort, so there's no chance the candidates are selected and then
663 * the request is not honored only because of time/size constraints
666 /* if no time limit requested, use soft limit (unless root!) */
668 if ( sop->oq_search.rs_tlimit == 0 ) {
669 sop->oq_search.rs_tlimit = -1; /* allow root to set no limit */
672 if ( sop->oq_search.rs_slimit == 0 ) {
673 sop->oq_search.rs_slimit = -1;
677 /* if no limit is required, use soft limit */
678 if ( sop->oq_search.rs_tlimit <= 0 ) {
679 sop->oq_search.rs_tlimit = limit->lms_t_soft;
681 /* if requested limit higher than hard limit, abort */
682 } else if ( sop->oq_search.rs_tlimit > limit->lms_t_hard ) {
683 /* no hard limit means use soft instead */
684 if ( limit->lms_t_hard == 0
685 && limit->lms_t_soft > -1
686 && sop->oq_search.rs_tlimit > limit->lms_t_soft ) {
687 sop->oq_search.rs_tlimit = limit->lms_t_soft;
689 /* positive hard limit means abort */
690 } else if ( limit->lms_t_hard > 0 ) {
691 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
692 send_ldap_result( sop, rs );
693 rs->sr_err = LDAP_SUCCESS;
697 /* negative hard limit means no limit */
700 /* if no limit is required, use soft limit */
701 if ( sop->oq_search.rs_slimit <= 0 ) {
702 if ( get_pagedresults(sop) && limit->lms_s_pr != 0 ) {
703 sop->oq_search.rs_slimit = limit->lms_s_pr;
705 sop->oq_search.rs_slimit = limit->lms_s_soft;
708 /* if requested limit higher than hard limit, abort */
709 } else if ( sop->oq_search.rs_slimit > limit->lms_s_hard ) {
710 /* no hard limit means use soft instead */
711 if ( limit->lms_s_hard == 0
712 && limit->lms_s_soft > -1
713 && sop->oq_search.rs_slimit > limit->lms_s_soft ) {
714 sop->oq_search.rs_slimit = limit->lms_s_soft;
716 /* positive hard limit means abort */
717 } else if ( limit->lms_s_hard > 0 ) {
718 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
719 send_ldap_result( sop, rs );
720 rs->sr_err = LDAP_SUCCESS;
724 /* negative hard limit means no limit */
728 /* compute it anyway; root does not use it */
729 stoptime = op->o_time + sop->oq_search.rs_tlimit;
731 /* need normalized dn below */
732 ber_dupbv( &realbase, &e->e_nname );
734 /* Copy info to base, must free entry before accessing the database
735 * in search_candidates, to avoid deadlocks.
737 base.e_private = e->e_private;
738 base.e_nname = realbase;
741 if ( e != &slap_entry_root ) {
742 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
747 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn,
748 locker, &ctxcsn_lock );
750 if ( rs->sr_err != LDAP_SUCCESS ) {
751 send_ldap_error( sop, rs, rs->sr_err,
752 "error in csn management in search" );
756 if ( sop->o_sync_mode != SLAP_SYNC_NONE &&
757 sop->o_sync_state.ctxcsn &&
758 sop->o_sync_state.ctxcsn->bv_val &&
759 ber_bvcmp( &sop->o_sync_state.ctxcsn[0], search_context_csn ) == 0 )
761 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
765 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );
768 /* select candidates */
769 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
770 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
773 BDB_IDL_ZERO( candidates );
774 BDB_IDL_ZERO( scopes );
775 rs->sr_err = search_candidates( op, sop, rs, &base,
776 locker, candidates, scopes );
779 if ( !IS_PSEARCH && sop->o_sync_mode != SLAP_SYNC_NONE ) {
780 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
783 /* start cursor at beginning of candidates.
787 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
788 cursor = bdb_idl_search( candidates, ps_e->e_id );
789 if ( candidates[cursor] != ps_e->e_id ) {
790 rs->sr_err = LDAP_SUCCESS;
793 } else if ( ps_e->e_id < BDB_IDL_RANGE_FIRST( candidates ) ||
794 ps_e->e_id > BDB_IDL_RANGE_LAST( candidates ))
796 rs->sr_err = LDAP_SUCCESS;
800 candidates[1] = ps_e->e_id;
803 if ( candidates[0] == 0 ) {
805 LDAP_LOG ( OPERATION, RESULTS,
806 "bdb_search: no candidates\n", 0, 0, 0 );
808 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
815 /* if not root and candidates exceed to-be-checked entries, abort */
816 if ( !isroot && limit->lms_s_unchecked != -1 ) {
817 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
818 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
819 send_ldap_result( sop, rs );
820 rs->sr_err = LDAP_SUCCESS;
825 if ( isroot || !limit->lms_s_pr_hide ) {
826 tentries = BDB_IDL_N(candidates);
829 if ( get_pagedresults(sop) ) {
830 if ( sop->o_pagedresults_state.ps_cookie == 0 ) {
833 if ( sop->o_pagedresults_size == 0 ) {
834 rs->sr_err = LDAP_SUCCESS;
835 rs->sr_text = "search abandoned by pagedResult size=0";
836 send_ldap_result( sop, rs );
839 for ( id = bdb_idl_first( candidates, &cursor );
840 id != NOID && id <= (ID)( sop->o_pagedresults_state.ps_cookie );
841 id = bdb_idl_next( candidates, &cursor ) ) /* empty */;
843 if ( cursor == NOID ) {
845 LDAP_LOG ( OPERATION, RESULTS,
846 "bdb_search: no paged results candidates\n",
849 Debug( LDAP_DEBUG_TRACE,
850 "bdb_search: no paged results candidates\n",
853 send_pagerequest_response( sop, rs, lastid, 0 );
855 rs->sr_err = LDAP_OTHER;
861 if (( sop->o_sync_mode & SLAP_SYNC_REFRESH ) || IS_PSEARCH ) {
864 cookief.f_choice = LDAP_FILTER_AND;
865 cookief.f_and = &csnfnot;
866 cookief.f_next = NULL;
868 csnfnot.f_choice = LDAP_FILTER_NOT;
869 csnfnot.f_not = &csnfeq;
870 csnfnot.f_next = &csnfand;
872 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
873 csnfeq.f_ava = &aa_eq;
874 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
875 if ( sop->o_sync_state.ctxcsn != NULL ) {
876 csnfeq.f_av_value = *sop->o_sync_state.ctxcsn;
878 csnfeq.f_av_value = slap_empty_bv;
881 csnfand.f_choice = LDAP_FILTER_AND;
882 csnfand.f_and = &csnfge;
883 csnfand.f_next = NULL;
885 csnfge.f_choice = LDAP_FILTER_GE;
886 csnfge.f_ava = &aa_ge;
887 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
888 if ( sop->o_sync_state.ctxcsn != NULL ) {
889 csnfge.f_av_value = *sop->o_sync_state.ctxcsn;
891 csnfge.f_av_value = slap_empty_bv;
894 if ( search_context_csn && !IS_PSEARCH ) {
895 csnfge.f_next = &contextcsnand;
897 contextcsnand.f_choice = LDAP_FILTER_AND;
898 contextcsnand.f_and = &contextcsnle;
899 contextcsnand.f_next = NULL;
901 contextcsnle.f_choice = LDAP_FILTER_LE;
902 contextcsnle.f_ava = &aa_le;
903 contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
904 contextcsnle.f_av_value = *search_context_csn;
905 contextcsnle.f_next = sop->oq_search.rs_filter;
907 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
908 if ( sop->o_sync_state.ctxcsn &&
909 sop->o_sync_state.ctxcsn->bv_val != NULL )
911 value_match( &match, slap_schema.si_ad_entryCSN, mr,
912 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
913 &sop->o_sync_state.ctxcsn[0], search_context_csn,
918 no_sync_state_change = ( match >= 0 );
920 csnfge.f_next = sop->oq_search.rs_filter;
924 for ( id = bdb_idl_first( candidates, &cursor );
925 id != NOID && !no_sync_state_change;
926 id = bdb_idl_next( candidates, &cursor ) )
931 /* check for abandon */
932 if ( sop->o_abandon ) {
934 bdb_drop_psearch( sop, sop->o_msgid );
936 rs->sr_err = LDAP_SUCCESS;
940 if ( sop->o_cancel ) {
941 assert( sop->o_cancel == SLAP_CANCEL_REQ );
942 rs->sr_err = LDAP_CANCELLED;
943 send_ldap_result( sop, rs );
944 sop->o_cancel = SLAP_CANCEL_ACK;
945 rs->sr_err = LDAP_SUCCESS;
949 /* check time limit */
950 if ( sop->oq_search.rs_tlimit != -1 && slap_get_time() > stoptime ) {
951 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
952 rs->sr_ref = rs->sr_v2ref;
953 send_ldap_result( sop, rs );
954 rs->sr_err = LDAP_SUCCESS;
960 /* get the entry with reader lock */
962 rs->sr_err = bdb_cache_find_id( op, NULL,
963 id, &ei, 0, locker, &lock );
965 if (rs->sr_err == LDAP_BUSY) {
966 rs->sr_text = "ldap server busy";
967 send_ldap_result( sop, rs );
970 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
971 || rs->sr_err == DB_LOCK_NOTGRANTED )
976 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
983 if( !BDB_IDL_IS_RANGE(candidates) ) {
984 /* only complain for non-range IDLs */
986 LDAP_LOG ( OPERATION, RESULTS,
987 "bdb_search: candidate %ld not found\n",
990 Debug( LDAP_DEBUG_TRACE,
991 "bdb_search: candidate %ld not found\n",
1004 #ifdef BDB_SUBENTRIES
1005 /* FIXME: send all but syncrepl */
1007 if ( !is_sync_protocol( sop ) )
1010 if ( is_entry_subentry( e ) ) {
1011 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
1012 if(!get_subentries_visibility( sop )) {
1013 /* only subentries are visible */
1017 } else if ( get_subentries( sop ) &&
1018 !get_subentries_visibility( sop ))
1020 /* only subentries are visible */
1024 } else if ( get_subentries_visibility( sop )) {
1025 /* only subentries are visible */
1029 #endif /* BDB_SUBENTRIES */
1031 /* Does this candidate actually satisfy the search scope?
1033 * Note that we don't lock access to the bei_parent pointer.
1034 * Since only leaf nodes can be deleted, the parent of any
1035 * node will always be a valid node. Also since we have
1036 * a Read lock on the data, it cannot be renamed out of the
1037 * scope while we are looking at it, and unless we're using
1038 * BDB_HIER, its parents cannot be moved either.
1040 switch( sop->ors_scope ) {
1041 case LDAP_SCOPE_BASE:
1042 /* This is always true, yes? */
1043 if ( id == base.e_id ) scopeok = 1;
1046 case LDAP_SCOPE_ONELEVEL:
1047 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
1050 case LDAP_SCOPE_SUBTREE: {
1052 for (tmp = BEI(e); tmp->bei_parent;
1053 tmp = tmp->bei_parent ) {
1054 if ( tmp->bei_id == base.e_id ) {
1063 /* aliases were already dereferenced in candidate list */
1064 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
1065 /* but if the search base is an alias, and we didn't
1066 * deref it when finding, return it.
1068 if ( is_entry_alias(e) &&
1069 ((sop->ors_deref & LDAP_DEREF_FINDING) ||
1070 !bvmatch(&e->e_nname, &op->o_req_ndn)))
1075 /* scopes is only non-empty for onelevel or subtree */
1076 if ( !scopeok && BDB_IDL_N(scopes) ) {
1078 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
1079 x = bdb_idl_search( scopes,
1081 if ( scopes[x] == e->e_id )
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,
1123 sop->oq_search.rs_scope == LDAP_SCOPE_SUBTREE
1124 ? LDAP_SCOPE_SUBTREE
1125 : LDAP_SCOPE_BASE );
1127 send_search_reference( sop, rs );
1129 ber_bvarray_free( rs->sr_ref );
1130 ber_bvarray_free( erefs );
1136 if ( !manageDSAit && is_entry_glue( e )) {
1140 /* if it matches the filter and scope, send it */
1142 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1143 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1145 rs->sr_err = LDAP_COMPARE_TRUE;
1148 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1149 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1150 rs->sr_err = test_filter( sop, rs->sr_entry, &contextcsnand );
1151 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1152 if ( rc_sync == LDAP_COMPARE_TRUE ) {
1153 if ( no_sync_state_change ) {
1155 LDAP_LOG ( OPERATION, RESULTS,
1156 "bdb_search: error in context csn management\n",
1159 Debug( LDAP_DEBUG_TRACE,
1160 "bdb_search: error in context csn management\n",
1164 entry_sync_state = LDAP_SYNC_ADD;
1166 if ( no_sync_state_change ) {
1169 entry_sync_state = LDAP_SYNC_PRESENT;
1173 rs->sr_err = test_filter( sop,
1174 rs->sr_entry, sop->oq_search.rs_filter );
1178 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1179 /* check size limit */
1180 if ( --sop->oq_search.rs_slimit == -1 &&
1181 sop->o_sync_slog_size == -1 )
1184 bdb_cache_return_entry_r( bdb->bi_dbenv,
1185 &bdb->bi_cache, e, &lock );
1188 rs->sr_entry = NULL;
1189 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1190 rs->sr_ref = rs->sr_v2ref;
1191 send_ldap_result( sop, rs );
1192 rs->sr_err = LDAP_SUCCESS;
1196 if ( get_pagedresults(sop) ) {
1197 if ( rs->sr_nentries >= sop->o_pagedresults_size ) {
1198 send_pagerequest_response( sop, rs,
1210 int premodify_found = 0;
1211 int entry_sync_state;
1213 if ( ps_type == LDAP_PSEARCH_BY_ADD ||
1214 ps_type == LDAP_PSEARCH_BY_DELETE ||
1215 ps_type == LDAP_PSEARCH_BY_MODIFY ||
1216 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1218 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1219 struct psid_entry* psid_e;
1220 LDAP_LIST_FOREACH( psid_e,
1221 &op->o_pm_list, ps_link)
1223 if( psid_e->ps_op == sop ) {
1224 premodify_found = 1;
1225 LDAP_LIST_REMOVE(psid_e, ps_link);
1229 if (psid_e != NULL) free (psid_e);
1231 if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1232 entry_sync_state = LDAP_SYNC_ADD;
1233 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1234 entry_sync_state = LDAP_SYNC_DELETE;
1235 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1236 if ( premodify_found ) {
1237 entry_sync_state = LDAP_SYNC_MODIFY;
1239 entry_sync_state = LDAP_SYNC_ADD;
1241 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT ) {
1242 entry_sync_state = LDAP_SYNC_DELETE;
1244 rs->sr_err = LDAP_OTHER;
1247 if ( sop->o_sync_slog_size != -1 ) {
1248 if ( entry_sync_state == LDAP_SYNC_DELETE ) {
1249 result = slap_add_session_log( op, sop, e );
1254 struct berval cookie;
1255 slap_compose_sync_cookie( sop, &cookie,
1257 sop->o_sync_state.sid,
1258 sop->o_sync_state.rid );
1259 rs->sr_err = slap_build_sync_state_ctrl( sop,
1260 rs, e, entry_sync_state, ctrls,
1261 num_ctrls++, 1, &cookie );
1262 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1263 rs->sr_attrs = attrs;
1264 rs->sr_ctrls = ctrls;
1265 result = send_search_entry( sop, rs );
1266 if ( cookie.bv_val )
1267 ch_free( cookie.bv_val );
1268 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1270 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1271 ctrls[num_ctrls] = NULL;
1272 rs->sr_ctrls = NULL;
1274 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1275 struct psid_entry* psid_e;
1276 psid_e = (struct psid_entry *) ch_calloc (1,
1277 sizeof(struct psid_entry));
1278 psid_e->ps_op = sop;
1279 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1284 LDAP_LOG ( OPERATION, RESULTS,
1285 "bdb_search: invalid ps_type (%d) \n",
1288 Debug( LDAP_DEBUG_TRACE,
1289 "bdb_search: invalid ps_type (%d) \n",
1294 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1296 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1297 rs->sr_err = slap_build_sync_state_ctrl( sop,
1298 rs, e, entry_sync_state, ctrls,
1299 num_ctrls++, 0, NULL );
1300 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1301 rs->sr_ctrls = ctrls;
1302 rs->sr_attrs = sop->oq_search.rs_attrs;
1303 result = send_search_entry( sop, rs );
1304 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1306 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1307 ctrls[num_ctrls] = NULL;
1308 rs->sr_ctrls = NULL;
1309 } else { /* PRESENT */
1310 if ( sync_send_present_mode ) {
1311 result = slap_build_syncUUID_set( sop,
1313 if ( result <= 0 ) {
1317 if ( syncUUID_set_cnt == SLAP_SYNCUUID_SET_SIZE ) {
1318 rs->sr_err = LDAP_SUCCESS;
1319 rs->sr_rspoid = LDAP_SYNC_INFO;
1320 rs->sr_ctrls = NULL;
1321 result = slap_send_syncinfo( sop, rs,
1322 LDAP_TAG_SYNC_ID_SET,
1323 NULL, 0, syncUUID_set, 0 );
1324 if ( result != LDAP_SUCCESS )
1326 ber_bvarray_free_x( syncUUID_set,
1328 syncUUID_set = NULL;
1329 syncUUID_set_cnt = 0;
1337 rs->sr_attrs = sop->oq_search.rs_attrs;
1338 rs->sr_ctrls = NULL;
1339 result = send_search_entry( sop, rs );
1344 case 0: /* entry sent ok */
1346 case 1: /* entry not sent */
1348 case -1: /* connection closed */
1350 bdb_cache_return_entry_r(bdb->bi_dbenv,
1351 &bdb->bi_cache, e, &lock);
1353 rs->sr_entry = NULL;
1354 rs->sr_err = LDAP_OTHER;
1360 LDAP_LOG ( OPERATION, RESULTS,
1361 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1363 Debug( LDAP_DEBUG_TRACE,
1364 "bdb_search: %ld does not match filter\n",
1371 /* free reader lock */
1373 bdb_cache_return_entry_r( bdb->bi_dbenv,
1374 &bdb->bi_cache, e , &lock );
1375 if ( sop->o_nocaching ) {
1376 bdb_cache_delete_entry( bdb, ei, locker, &lock );
1380 rs->sr_entry = NULL;
1383 ldap_pvt_thread_yield();
1386 if ( syncUUID_set_cnt > 0 ) {
1387 rs->sr_err = LDAP_SUCCESS;
1388 rs->sr_rspoid = LDAP_SYNC_INFO;
1389 rs->sr_ctrls = NULL;
1390 slap_send_syncinfo( sop, rs, LDAP_TAG_SYNC_ID_SET,
1391 NULL, 0, syncUUID_set, 0 );
1392 ber_bvarray_free_x( syncUUID_set, sop->o_tmpmemctx );
1393 syncUUID_set_cnt = 0;
1398 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1399 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1400 struct berval cookie;
1401 slap_compose_sync_cookie( sop, &cookie,
1403 sop->o_sync_state.sid,
1404 sop->o_sync_state.rid );
1406 if ( sync_send_present_mode ) {
1407 rs->sr_err = LDAP_SUCCESS;
1408 rs->sr_rspoid = LDAP_SYNC_INFO;
1409 rs->sr_ctrls = NULL;
1410 slap_send_syncinfo( sop, rs,
1411 LDAP_TAG_SYNC_REFRESH_PRESENT, &cookie, 1, NULL, 0 );
1413 if ( !no_sync_state_change ) {
1415 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1416 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
1417 if ( ps_list->o_sync_slog_size > 0 ) {
1418 if ( ps_list->o_sync_state.sid == 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,
1448 sop->o_sync_state.sid,
1449 sop->o_sync_state.rid );
1451 if ( sync_send_present_mode ) {
1452 slap_build_sync_done_ctrl( sop, rs, ctrls,
1453 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1455 if ( !no_sync_state_change ) {
1457 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1458 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1460 if ( ps_list->o_sync_slog_size > 0 ) {
1461 if ( ps_list->o_sync_state.sid ==
1462 sop->o_sync_state.sid ) {
1470 slap_send_session_log( op, ps_list, rs );
1472 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1474 slap_build_sync_done_ctrl( sop, rs, ctrls,
1475 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_DELETES );
1478 rs->sr_ctrls = ctrls;
1479 rs->sr_ref = rs->sr_v2ref;
1480 rs->sr_err = (rs->sr_v2ref == NULL) ? 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, sop->o_tmpmemctx );
1486 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1487 ctrls[num_ctrls] = NULL;
1488 if ( cookie.bv_val )
1489 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(
1554 if( cur > *max ) *max = cur;
1556 switch(f->f_choice) {
1557 case LDAP_FILTER_PRESENT:
1558 if (f->f_desc == slap_schema.si_ad_objectClass) {
1563 case LDAP_FILTER_AND:
1564 case LDAP_FILTER_OR:
1566 for (f=f->f_and; f; f=f->f_next) {
1567 (void) oc_filter(f, cur, max);
1577 static void search_stack_free( void *key, void *data )
1579 ber_memfree_x(data, NULL);
1582 static void *search_stack( Operation *op )
1584 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1587 if ( op->o_threadctx ) {
1588 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1591 ret = bdb->bi_search_stack;
1595 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1597 if ( op->o_threadctx ) {
1598 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1599 ret, search_stack_free );
1601 bdb->bi_search_stack = ret;
1607 static int search_candidates(
1616 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1618 Filter f, rf, xf, nf;
1620 AttributeAssertion aa_ref;
1621 #ifdef BDB_SUBENTRIES
1623 AttributeAssertion aa_subentry;
1627 * This routine takes as input a filter (user-filter)
1628 * and rewrites it as follows:
1629 * (&(scope=DN)[(objectClass=subentry)]
1630 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1634 LDAP_LOG ( OPERATION, ENTRY,
1635 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1636 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope);
1638 Debug(LDAP_DEBUG_TRACE,
1639 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1640 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1643 xf.f_or = op->oq_search.rs_filter;
1644 xf.f_choice = LDAP_FILTER_OR;
1647 /* If the user's filter uses objectClass=*,
1648 * these clauses are redundant.
1650 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1651 && !get_subentries_visibility(op)
1652 && !is_sync_protocol(op) )
1654 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1655 /* match referral objects */
1656 struct berval bv_ref = { sizeof("referral")-1, "referral" };
1657 rf.f_choice = LDAP_FILTER_EQUALITY;
1659 rf.f_av_desc = slap_schema.si_ad_objectClass;
1660 rf.f_av_value = bv_ref;
1661 rf.f_next = xf.f_or;
1668 f.f_choice = LDAP_FILTER_AND;
1670 /* Dummy; we compute scope separately now */
1671 nf.f_choice = SLAPD_FILTER_COMPUTED;
1672 nf.f_result = LDAP_SUCCESS;
1673 nf.f_next = xf.f_or == op->oq_search.rs_filter
1674 ? op->oq_search.rs_filter : &xf ;
1675 /* Filter depth increased again, adding dummy clause */
1678 #ifdef BDB_SUBENTRIES
1679 if( get_subentries_visibility( op ) ) {
1680 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1681 sf.f_choice = LDAP_FILTER_EQUALITY;
1682 sf.f_ava = &aa_subentry;
1683 sf.f_av_desc = slap_schema.si_ad_objectClass;
1684 sf.f_av_value = bv_subentry;
1685 sf.f_next = nf.f_next;
1690 /* Allocate IDL stack, plus 1 more for former tmp */
1691 if ( depth+1 > bdb->bi_search_stack_depth ) {
1692 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1694 stack = search_stack( stackop );
1697 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1698 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1700 rc = bdb_dn2idl( op, e, ids, stack );
1703 if ( rc == LDAP_SUCCESS ) {
1704 rc = bdb_filter_candidates( op, &f, ids,
1705 stack, stack+BDB_IDL_UM_SIZE );
1708 if ( depth+1 > bdb->bi_search_stack_depth ) {
1714 LDAP_LOG ( OPERATION, DETAIL1,
1715 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1717 Debug(LDAP_DEBUG_TRACE,
1718 "bdb_search_candidates: failed (rc=%d)\n",
1724 LDAP_LOG ( OPERATION, DETAIL1,
1725 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1726 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1727 (long) BDB_IDL_LAST(ids));
1729 Debug(LDAP_DEBUG_TRACE,
1730 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1732 (long) BDB_IDL_FIRST(ids),
1733 (long) BDB_IDL_LAST(ids) );
1741 send_pagerequest_response(
1747 LDAPControl ctrl, *ctrls[2];
1748 BerElementBuffer berbuf;
1749 BerElement *ber = (BerElement *)&berbuf;
1750 struct berval cookie = { 0, NULL };
1751 PagedResultsCookie respcookie;
1754 LDAP_LOG ( OPERATION, ENTRY,
1755 "send_pagerequest_response: lastid: (0x%08lx) "
1756 "nentries: (0x%081x)\n",
1757 lastid, rs->sr_nentries, NULL );
1759 Debug(LDAP_DEBUG_ARGS, "send_pagerequest_response: lastid: (0x%08lx) "
1760 "nentries: (0x%081x)\n", lastid, rs->sr_nentries, NULL );
1763 ctrl.ldctl_value.bv_val = NULL;
1767 ber_init2( ber, NULL, LBER_USE_DER );
1769 respcookie = ( PagedResultsCookie )lastid;
1770 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1771 cookie.bv_len = sizeof( respcookie );
1772 cookie.bv_val = (char *)&respcookie;
1775 * FIXME: we should consider sending an estimate of the entries
1776 * left, after appropriate security check is done
1778 ber_printf( ber, "{iO}", tentries, &cookie );
1780 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1784 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1785 ctrls[0]->ldctl_iscritical = 0;
1787 rs->sr_ctrls = ctrls;
1788 rs->sr_err = LDAP_SUCCESS;
1789 send_ldap_result( op, rs );
1792 (void) ber_free_buf( ber );