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;
399 u_int32_t locker = 0;
403 int sync_send_present_mode = 1;
409 BerVarray syncUUID_set = NULL;
410 int syncUUID_set_cnt = 0;
413 LDAP_LOG( OPERATION, ENTRY, "bdb_search\n", 0, 0, 0 );
415 Debug( LDAP_DEBUG_TRACE, "=> bdb_search\n",
418 attrs = sop->oq_search.rs_attrs;
420 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
421 struct slap_session_entry *sent;
422 if ( sop->o_sync_state.sid >= 0 ) {
423 LDAP_LIST_FOREACH( sent, &bdb->bi_session_list, se_link ) {
424 if ( sent->se_id == sop->o_sync_state.sid ) {
425 sop->o_sync_slog_size = sent->se_size;
432 /* psearch needs to be registered before refresh begins */
433 /* psearch and refresh transmission is serialized in send_ldap_ber() */
434 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
435 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
436 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
437 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
439 } else if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST
440 && sop->o_sync_slog_size >= 0 )
442 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
443 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
444 if ( ps_list->o_sync_slog_size >= 0 ) {
445 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
453 if ( ps_list->o_sync_slog_omitcsn.bv_len != 0 ) {
454 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
455 if ( sop->o_sync_state.ctxcsn &&
456 sop->o_sync_state.ctxcsn->bv_val != NULL )
458 value_match( &match, slap_schema.si_ad_entryCSN, mr,
459 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
460 sop->o_sync_state.ctxcsn,
461 &ps_list->o_sync_slog_omitcsn,
467 sync_send_present_mode = 0;
470 sync_send_present_mode = 0;
472 } else if ( sop->o_sync_slog_size >= 0 ) {
473 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
475 sop->o_sync_state.sid = -1;
477 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
480 null_attr.an_desc = NULL;
481 null_attr.an_oc = NULL;
482 null_attr.an_oc_exclude = 0;
483 null_attr.an_name.bv_len = 0;
484 null_attr.an_name.bv_val = NULL;
486 for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
487 ctrls[num_ctrls] = NULL;
491 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
493 attrs[0].an_desc = NULL;
494 attrs[0].an_oc = NULL;
495 attrs[0].an_oc_exclude = 0;
496 attrs[0].an_name.bv_len = 0;
497 attrs[0].an_name.bv_val = NULL;
500 manageDSAit = get_manageDSAit( sop );
502 /* Sync control overrides manageDSAit */
503 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
504 if ( manageDSAit == SLAP_NO_CONTROL ) {
505 manageDSAit = SLAP_CRITICAL_CONTROL;
507 } else if ( IS_PSEARCH ) {
508 if ( manageDSAit == SLAP_NO_CONTROL ) {
509 manageDSAit = SLAP_CRITICAL_CONTROL;
513 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
519 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
523 if ( sop->o_req_ndn.bv_len == 0 ) {
524 /* DIT root special case */
525 e = (Entry *) &slap_entry_root;
526 rs->sr_err = LDAP_SUCCESS;
529 /* get entry with reader lock */
530 rs->sr_err = bdb_dn2entry( op, NULL, &sop->o_req_ndn, &ei,
542 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
543 LOCK_ID_FREE (bdb->bi_dbenv, locker );
545 case DB_LOCK_DEADLOCK:
546 case DB_LOCK_NOTGRANTED:
549 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
550 LOCK_ID_FREE (bdb->bi_dbenv, locker );
554 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
555 BDB_IDL_ZERO(candidates);
556 e = deref_base( op, rs, e, &matched, locker, &lock,
561 struct berval matched_dn = { 0, NULL };
563 if ( matched != NULL ) {
565 ber_dupbv( &matched_dn, &matched->e_name );
567 erefs = is_entry_referral( matched )
568 ? get_entry_referrals( op, matched )
571 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
576 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
577 &sop->o_req_dn, sop->oq_search.rs_scope );
578 ber_bvarray_free( erefs );
582 rs->sr_ref = referral_rewrite( default_referral,
583 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
586 rs->sr_err = LDAP_REFERRAL;
587 rs->sr_matched = matched_dn.bv_val;
588 send_ldap_result( sop, rs );
590 LOCK_ID_FREE (bdb->bi_dbenv, locker );
592 ber_bvarray_free( rs->sr_ref );
595 if ( matched_dn.bv_val ) {
596 ber_memfree( matched_dn.bv_val );
597 rs->sr_matched = NULL;
602 if ( !manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
603 /* entry is a referral, don't allow add */
604 struct berval matched_dn;
607 ber_dupbv( &matched_dn, &e->e_name );
608 erefs = get_entry_referrals( op, e );
610 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
614 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
615 &sop->o_req_dn, sop->oq_search.rs_scope );
616 ber_bvarray_free( erefs );
620 LDAP_LOG ( OPERATION, RESULTS,
621 "bdb_search: entry is referral\n", 0, 0, 0 );
623 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
627 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
628 rs->sr_err = LDAP_REFERRAL;
629 rs->sr_matched = matched_dn.bv_val;
630 send_ldap_result( sop, rs );
632 LOCK_ID_FREE (bdb->bi_dbenv, locker );
633 ber_bvarray_free( rs->sr_ref );
635 ber_memfree( matched_dn.bv_val );
636 rs->sr_matched = NULL;
640 if ( get_assert( op ) &&
641 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
643 rs->sr_err = LDAP_ASSERTION_FAILED;
644 send_ldap_result( sop, rs );
648 /* compute it anyway; root does not use it */
649 stoptime = op->o_time + sop->ors_tlimit;
651 /* need normalized dn below */
652 ber_dupbv( &realbase, &e->e_nname );
654 /* Copy info to base, must free entry before accessing the database
655 * in search_candidates, to avoid deadlocks.
657 base.e_private = e->e_private;
658 base.e_nname = realbase;
661 if ( e != &slap_entry_root ) {
662 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
667 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn,
668 locker, &ctxcsn_lock );
670 if ( rs->sr_err != LDAP_SUCCESS ) {
671 send_ldap_error( sop, rs, rs->sr_err,
672 "error in csn management in search" );
676 if ( sop->o_sync_mode != SLAP_SYNC_NONE &&
677 sop->o_sync_state.ctxcsn &&
678 sop->o_sync_state.ctxcsn->bv_val &&
679 ber_bvcmp( &sop->o_sync_state.ctxcsn[0], search_context_csn ) == 0 )
681 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
685 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );
688 /* select candidates */
689 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
690 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
693 BDB_IDL_ZERO( candidates );
694 BDB_IDL_ZERO( scopes );
695 rs->sr_err = search_candidates( op, sop, rs, &base,
696 locker, candidates, scopes );
699 if ( !IS_PSEARCH && sop->o_sync_mode != SLAP_SYNC_NONE ) {
700 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
703 /* start cursor at beginning of candidates.
707 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
708 cursor = bdb_idl_search( candidates, ps_e->e_id );
709 if ( candidates[cursor] != ps_e->e_id ) {
710 rs->sr_err = LDAP_SUCCESS;
713 } else if ( ps_e->e_id < BDB_IDL_RANGE_FIRST( candidates ) ||
714 ps_e->e_id > BDB_IDL_RANGE_LAST( candidates ))
716 rs->sr_err = LDAP_SUCCESS;
720 candidates[1] = ps_e->e_id;
723 if ( candidates[0] == 0 ) {
725 LDAP_LOG ( OPERATION, RESULTS,
726 "bdb_search: no candidates\n", 0, 0, 0 );
728 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
735 /* if not root and candidates exceed to-be-checked entries, abort */
736 if ( sop->ors_limit /* isroot == TRUE */
737 && sop->ors_limit->lms_s_unchecked != -1
738 && BDB_IDL_N(candidates) > (unsigned) sop->ors_limit->lms_s_unchecked )
740 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
741 send_ldap_result( sop, rs );
742 rs->sr_err = LDAP_SUCCESS;
746 if ( sop->ors_limit == NULL /* isroot == FALSE */
747 || !sop->ors_limit->lms_s_pr_hide ) {
748 tentries = BDB_IDL_N(candidates);
751 if ( get_pagedresults(sop) ) {
752 if ( sop->o_pagedresults_state.ps_cookie == 0 ) {
755 if ( sop->o_pagedresults_size == 0 ) {
756 rs->sr_err = LDAP_SUCCESS;
757 rs->sr_text = "search abandoned by pagedResult size=0";
758 send_ldap_result( sop, rs );
761 for ( id = bdb_idl_first( candidates, &cursor );
762 id != NOID && id <= (ID)( sop->o_pagedresults_state.ps_cookie );
763 id = bdb_idl_next( candidates, &cursor ) ) /* empty */;
765 if ( cursor == NOID ) {
767 LDAP_LOG ( OPERATION, RESULTS,
768 "bdb_search: no paged results candidates\n",
771 Debug( LDAP_DEBUG_TRACE,
772 "bdb_search: no paged results candidates\n",
775 send_pagerequest_response( sop, rs, lastid, 0 );
777 rs->sr_err = LDAP_OTHER;
783 if (( sop->o_sync_mode & SLAP_SYNC_REFRESH ) || IS_PSEARCH ) {
786 cookief.f_choice = LDAP_FILTER_AND;
787 cookief.f_and = &csnfnot;
788 cookief.f_next = NULL;
790 csnfnot.f_choice = LDAP_FILTER_NOT;
791 csnfnot.f_not = &csnfeq;
792 csnfnot.f_next = &csnfand;
794 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
795 csnfeq.f_ava = &aa_eq;
796 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
797 if ( sop->o_sync_state.ctxcsn != NULL ) {
798 csnfeq.f_av_value = *sop->o_sync_state.ctxcsn;
800 csnfeq.f_av_value = slap_empty_bv;
803 csnfand.f_choice = LDAP_FILTER_AND;
804 csnfand.f_and = &csnfge;
805 csnfand.f_next = NULL;
807 csnfge.f_choice = LDAP_FILTER_GE;
808 csnfge.f_ava = &aa_ge;
809 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
810 if ( sop->o_sync_state.ctxcsn != NULL ) {
811 csnfge.f_av_value = *sop->o_sync_state.ctxcsn;
813 csnfge.f_av_value = slap_empty_bv;
816 if ( search_context_csn && !IS_PSEARCH ) {
817 csnfge.f_next = &contextcsnand;
819 contextcsnand.f_choice = LDAP_FILTER_AND;
820 contextcsnand.f_and = &contextcsnle;
821 contextcsnand.f_next = NULL;
823 contextcsnle.f_choice = LDAP_FILTER_LE;
824 contextcsnle.f_ava = &aa_le;
825 contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
826 contextcsnle.f_av_value = *search_context_csn;
827 contextcsnle.f_next = sop->oq_search.rs_filter;
829 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
830 if ( sop->o_sync_state.ctxcsn &&
831 sop->o_sync_state.ctxcsn->bv_val != NULL )
833 value_match( &match, slap_schema.si_ad_entryCSN, mr,
834 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
835 &sop->o_sync_state.ctxcsn[0], search_context_csn,
840 no_sync_state_change = ( match >= 0 );
842 csnfge.f_next = sop->oq_search.rs_filter;
846 for ( id = bdb_idl_first( candidates, &cursor );
847 id != NOID && !no_sync_state_change;
848 id = bdb_idl_next( candidates, &cursor ) )
853 /* check for abandon */
854 if ( sop->o_abandon ) {
856 bdb_drop_psearch( sop, sop->o_msgid );
858 rs->sr_err = LDAP_SUCCESS;
862 if ( sop->o_cancel ) {
863 assert( sop->o_cancel == SLAP_CANCEL_REQ );
864 rs->sr_err = LDAP_CANCELLED;
865 send_ldap_result( sop, rs );
866 sop->o_cancel = SLAP_CANCEL_ACK;
867 rs->sr_err = LDAP_SUCCESS;
871 /* check time limit */
872 if ( sop->ors_tlimit != -1 && slap_get_time() > stoptime ) {
873 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
874 rs->sr_ref = rs->sr_v2ref;
875 send_ldap_result( sop, rs );
876 rs->sr_err = LDAP_SUCCESS;
882 /* get the entry with reader lock */
884 rs->sr_err = bdb_cache_find_id( op, NULL,
885 id, &ei, 0, locker, &lock );
887 if (rs->sr_err == LDAP_BUSY) {
888 rs->sr_text = "ldap server busy";
889 send_ldap_result( sop, rs );
892 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
893 || rs->sr_err == DB_LOCK_NOTGRANTED )
898 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
905 if( !BDB_IDL_IS_RANGE(candidates) ) {
906 /* only complain for non-range IDLs */
908 LDAP_LOG ( OPERATION, RESULTS,
909 "bdb_search: candidate %ld not found\n",
912 Debug( LDAP_DEBUG_TRACE,
913 "bdb_search: candidate %ld not found\n",
926 #ifdef BDB_SUBENTRIES
927 /* FIXME: send all but syncrepl */
929 if ( !is_sync_protocol( sop ) )
932 if ( is_entry_subentry( e ) ) {
933 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
934 if(!get_subentries_visibility( sop )) {
935 /* only subentries are visible */
939 } else if ( get_subentries( sop ) &&
940 !get_subentries_visibility( sop ))
942 /* only subentries are visible */
946 } else if ( get_subentries_visibility( sop )) {
947 /* only subentries are visible */
951 #endif /* BDB_SUBENTRIES */
953 /* Does this candidate actually satisfy the search scope?
955 * Note that we don't lock access to the bei_parent pointer.
956 * Since only leaf nodes can be deleted, the parent of any
957 * node will always be a valid node. Also since we have
958 * a Read lock on the data, it cannot be renamed out of the
959 * scope while we are looking at it, and unless we're using
960 * BDB_HIER, its parents cannot be moved either.
962 switch( sop->ors_scope ) {
963 case LDAP_SCOPE_BASE:
964 /* This is always true, yes? */
965 if ( id == base.e_id ) scopeok = 1;
968 case LDAP_SCOPE_ONELEVEL:
969 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
972 case LDAP_SCOPE_CHILDREN:
973 if ( id == base.e_id ) break;
975 case LDAP_SCOPE_SUBTREE: {
977 for (tmp = BEI(e); tmp->bei_parent;
978 tmp = tmp->bei_parent ) {
979 if ( tmp->bei_id == base.e_id ) {
988 /* aliases were already dereferenced in candidate list */
989 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
990 /* but if the search base is an alias, and we didn't
991 * deref it when finding, return it.
993 if ( is_entry_alias(e) &&
994 ((sop->ors_deref & LDAP_DEREF_FINDING) ||
995 !bvmatch(&e->e_nname, &op->o_req_ndn)))
1000 /* scopes is only non-empty for onelevel or subtree */
1001 if ( !scopeok && BDB_IDL_N(scopes) ) {
1003 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
1004 x = bdb_idl_search( scopes, e->e_id );
1005 if ( scopes[x] == e->e_id ) scopeok = 1;
1007 /* subtree, walk up the tree */
1008 EntryInfo *tmp = BEI(e);
1009 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
1010 x = bdb_idl_search( scopes, tmp->bei_id );
1011 if ( scopes[x] == tmp->bei_id ) {
1021 /* Not in scope, ignore it */
1024 LDAP_LOG ( OPERATION, RESULTS,
1025 "bdb_search: %ld scope not okay\n",
1028 Debug( LDAP_DEBUG_TRACE,
1029 "bdb_search: %ld scope not okay\n",
1036 * if it's a referral, add it to the list of referrals. only do
1037 * this for non-base searches, and don't check the filter
1038 * explicitly here since it's only a candidate anyway.
1040 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE
1041 && is_entry_referral( e ) )
1043 BerVarray erefs = get_entry_referrals( sop, e );
1044 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
1045 sop->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
1046 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
1048 send_search_reference( sop, rs );
1050 ber_bvarray_free( rs->sr_ref );
1051 ber_bvarray_free( erefs );
1057 if ( !manageDSAit && is_entry_glue( e )) {
1061 /* if it matches the filter and scope, send it */
1063 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1064 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1066 rs->sr_err = LDAP_COMPARE_TRUE;
1069 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1070 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1071 rs->sr_err = test_filter( sop, rs->sr_entry, &contextcsnand );
1072 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1073 if ( rc_sync == LDAP_COMPARE_TRUE ) {
1074 if ( no_sync_state_change ) {
1076 LDAP_LOG ( OPERATION, RESULTS,
1077 "bdb_search: error in context csn management\n",
1080 Debug( LDAP_DEBUG_TRACE,
1081 "bdb_search: error in context csn management\n",
1085 entry_sync_state = LDAP_SYNC_ADD;
1087 if ( no_sync_state_change ) {
1090 entry_sync_state = LDAP_SYNC_PRESENT;
1094 rs->sr_err = test_filter( sop,
1095 rs->sr_entry, sop->oq_search.rs_filter );
1099 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1100 /* check size limit */
1101 if ( --sop->ors_slimit == -1 &&
1102 sop->o_sync_slog_size == -1 )
1105 bdb_cache_return_entry_r( bdb->bi_dbenv,
1106 &bdb->bi_cache, e, &lock );
1109 rs->sr_entry = NULL;
1110 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1111 rs->sr_ref = rs->sr_v2ref;
1112 send_ldap_result( sop, rs );
1113 rs->sr_err = LDAP_SUCCESS;
1117 if ( get_pagedresults(sop) ) {
1118 if ( rs->sr_nentries >= sop->o_pagedresults_size ) {
1119 send_pagerequest_response( sop, rs,
1131 int premodify_found = 0;
1132 int entry_sync_state;
1134 if ( ps_type == LDAP_PSEARCH_BY_ADD ||
1135 ps_type == LDAP_PSEARCH_BY_DELETE ||
1136 ps_type == LDAP_PSEARCH_BY_MODIFY ||
1137 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1139 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1140 struct psid_entry* psid_e;
1141 LDAP_LIST_FOREACH( psid_e,
1142 &op->o_pm_list, ps_link)
1144 if( psid_e->ps_op == sop ) {
1145 premodify_found = 1;
1146 LDAP_LIST_REMOVE(psid_e, ps_link);
1150 if (psid_e != NULL) free (psid_e);
1152 if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1153 entry_sync_state = LDAP_SYNC_ADD;
1154 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1155 entry_sync_state = LDAP_SYNC_DELETE;
1156 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1157 if ( premodify_found ) {
1158 entry_sync_state = LDAP_SYNC_MODIFY;
1160 entry_sync_state = LDAP_SYNC_ADD;
1162 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT ) {
1163 entry_sync_state = LDAP_SYNC_DELETE;
1165 rs->sr_err = LDAP_OTHER;
1168 if ( sop->o_sync_slog_size != -1 ) {
1169 if ( entry_sync_state == LDAP_SYNC_DELETE ) {
1170 result = slap_add_session_log( op, sop, e );
1175 struct berval cookie;
1176 slap_compose_sync_cookie( sop, &cookie,
1178 sop->o_sync_state.sid,
1179 sop->o_sync_state.rid );
1180 rs->sr_err = slap_build_sync_state_ctrl( sop,
1181 rs, e, entry_sync_state, ctrls,
1182 num_ctrls++, 1, &cookie );
1183 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1184 rs->sr_attrs = attrs;
1185 rs->sr_ctrls = ctrls;
1186 result = send_search_entry( sop, rs );
1187 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1188 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1190 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1191 ctrls[num_ctrls] = NULL;
1192 rs->sr_ctrls = NULL;
1194 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1195 struct psid_entry* psid_e;
1196 psid_e = (struct psid_entry *) ch_calloc(1,
1197 sizeof(struct psid_entry));
1198 psid_e->ps_op = sop;
1199 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1204 LDAP_LOG ( OPERATION, RESULTS,
1205 "bdb_search: invalid ps_type (%d) \n",
1208 Debug( LDAP_DEBUG_TRACE,
1209 "bdb_search: invalid ps_type (%d) \n",
1214 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1215 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1216 rs->sr_err = slap_build_sync_state_ctrl( sop,
1217 rs, e, entry_sync_state, ctrls,
1218 num_ctrls++, 0, NULL );
1219 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1220 rs->sr_ctrls = ctrls;
1221 rs->sr_attrs = sop->oq_search.rs_attrs;
1222 result = send_search_entry( sop, rs );
1223 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1225 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1226 ctrls[num_ctrls] = NULL;
1227 rs->sr_ctrls = NULL;
1228 } else { /* PRESENT */
1229 if ( sync_send_present_mode ) {
1230 result = slap_build_syncUUID_set( sop,
1232 if ( result <= 0 ) {
1236 if ( syncUUID_set_cnt ==
1237 SLAP_SYNCUUID_SET_SIZE )
1239 rs->sr_err = LDAP_SUCCESS;
1240 rs->sr_rspoid = LDAP_SYNC_INFO;
1241 rs->sr_ctrls = NULL;
1242 result = slap_send_syncinfo( sop, rs,
1243 LDAP_TAG_SYNC_ID_SET,
1244 NULL, 0, syncUUID_set, 0 );
1245 if ( result != LDAP_SUCCESS ) {
1248 ber_bvarray_free_x( syncUUID_set,
1250 syncUUID_set = NULL;
1251 syncUUID_set_cnt = 0;
1259 rs->sr_attrs = sop->oq_search.rs_attrs;
1260 rs->sr_ctrls = NULL;
1261 result = send_search_entry( sop, rs );
1266 case 0: /* entry sent ok */
1268 case 1: /* entry not sent */
1270 case -1: /* connection closed */
1272 bdb_cache_return_entry_r(bdb->bi_dbenv,
1273 &bdb->bi_cache, e, &lock);
1275 rs->sr_entry = NULL;
1276 rs->sr_err = LDAP_OTHER;
1282 LDAP_LOG ( OPERATION, RESULTS,
1283 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1285 Debug( LDAP_DEBUG_TRACE,
1286 "bdb_search: %ld does not match filter\n",
1293 /* free reader lock */
1295 bdb_cache_return_entry_r( bdb->bi_dbenv,
1296 &bdb->bi_cache, e , &lock );
1297 if ( sop->o_nocaching ) {
1298 bdb_cache_delete_entry( bdb, ei, locker, &lock );
1302 rs->sr_entry = NULL;
1305 ldap_pvt_thread_yield();
1308 if ( syncUUID_set_cnt > 0 ) {
1309 rs->sr_err = LDAP_SUCCESS;
1310 rs->sr_rspoid = LDAP_SYNC_INFO;
1311 rs->sr_ctrls = NULL;
1312 slap_send_syncinfo( sop, rs, LDAP_TAG_SYNC_ID_SET,
1313 NULL, 0, syncUUID_set, 0 );
1314 ber_bvarray_free_x( syncUUID_set, sop->o_tmpmemctx );
1315 syncUUID_set_cnt = 0;
1320 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1321 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1322 struct berval cookie;
1323 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1324 sop->o_sync_state.sid, sop->o_sync_state.rid );
1326 if ( sync_send_present_mode ) {
1327 rs->sr_err = LDAP_SUCCESS;
1328 rs->sr_rspoid = LDAP_SYNC_INFO;
1329 rs->sr_ctrls = NULL;
1330 slap_send_syncinfo( sop, rs,
1331 LDAP_TAG_SYNC_REFRESH_PRESENT, &cookie, 1, NULL, 0 );
1333 if ( !no_sync_state_change ) {
1335 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1336 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1339 if ( ps_list->o_sync_slog_size > 0 ) {
1340 if ( ps_list->o_sync_state.sid ==
1341 sop->o_sync_state.sid ) {
1349 rs->sr_err = LDAP_SUCCESS;
1350 rs->sr_rspoid = NULL;
1351 rs->sr_ctrls = NULL;
1352 slap_send_session_log( op, ps_list, rs );
1354 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1356 rs->sr_err = LDAP_SUCCESS;
1357 rs->sr_rspoid = LDAP_SYNC_INFO;
1358 rs->sr_ctrls = NULL;
1359 slap_send_syncinfo( sop, rs,
1360 LDAP_TAG_SYNC_REFRESH_DELETE, &cookie, 1, NULL, 0 );
1363 if ( cookie.bv_val ) {
1364 ch_free( cookie.bv_val );
1367 /* refreshOnly mode */
1368 struct berval cookie;
1369 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1370 sop->o_sync_state.sid, sop->o_sync_state.rid );
1372 if ( sync_send_present_mode ) {
1373 slap_build_sync_done_ctrl( sop, rs, ctrls,
1374 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1376 if ( !no_sync_state_change ) {
1378 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1379 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1382 if ( ps_list->o_sync_slog_size > 0 ) {
1383 if ( ps_list->o_sync_state.sid ==
1384 sop->o_sync_state.sid ) {
1392 slap_send_session_log( op, ps_list, rs );
1394 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1396 slap_build_sync_done_ctrl( sop, rs, ctrls,
1397 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_DELETES );
1400 rs->sr_ctrls = ctrls;
1401 rs->sr_ref = rs->sr_v2ref;
1402 rs->sr_err = (rs->sr_v2ref == NULL)
1403 ? LDAP_SUCCESS : LDAP_REFERRAL;
1404 rs->sr_rspoid = NULL;
1405 send_ldap_result( sop, rs );
1406 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL ) {
1407 sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1410 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1411 ctrls[num_ctrls] = NULL;
1412 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1415 rs->sr_ctrls = NULL;
1416 rs->sr_ref = rs->sr_v2ref;
1417 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1418 rs->sr_rspoid = NULL;
1419 send_ldap_result( sop, rs );
1423 rs->sr_err = LDAP_SUCCESS;
1426 if( !IS_PSEARCH && e != NULL ) {
1427 /* free reader lock */
1428 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1431 LOCK_ID_FREE( bdb->bi_dbenv, locker );
1433 ber_bvfree( search_context_csn );
1435 if( rs->sr_v2ref ) {
1436 ber_bvarray_free( rs->sr_v2ref );
1437 rs->sr_v2ref = NULL;
1439 if( realbase.bv_val ) ch_free( realbase.bv_val );
1445 static int base_candidate(
1451 LDAP_LOG ( OPERATION, ENTRY,
1452 "base_candidate: base: \"%s\" (0x%08lx)\n",
1453 e->e_nname.bv_val, (long) e->e_id, 0);
1455 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1456 e->e_nname.bv_val, (long) e->e_id, 0);
1464 /* Look for "objectClass Present" in this filter.
1465 * Also count depth of filter tree while we're at it.
1467 static int oc_filter(
1476 if( cur > *max ) *max = cur;
1478 switch( f->f_choice ) {
1479 case LDAP_FILTER_PRESENT:
1480 if (f->f_desc == slap_schema.si_ad_objectClass) {
1485 case LDAP_FILTER_AND:
1486 case LDAP_FILTER_OR:
1488 for ( f=f->f_and; f; f=f->f_next ) {
1489 (void) oc_filter(f, cur, max);
1499 static void search_stack_free( void *key, void *data )
1501 ber_memfree_x(data, NULL);
1504 static void *search_stack( Operation *op )
1506 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1509 if ( op->o_threadctx ) {
1510 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1513 ret = bdb->bi_search_stack;
1517 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1519 if ( op->o_threadctx ) {
1520 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1521 ret, search_stack_free );
1523 bdb->bi_search_stack = ret;
1529 static int search_candidates(
1538 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1540 Filter f, rf, xf, nf;
1542 AttributeAssertion aa_ref;
1543 #ifdef BDB_SUBENTRIES
1545 AttributeAssertion aa_subentry;
1549 * This routine takes as input a filter (user-filter)
1550 * and rewrites it as follows:
1551 * (&(scope=DN)[(objectClass=subentry)]
1552 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1556 LDAP_LOG ( OPERATION, ENTRY,
1557 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1558 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope);
1560 Debug(LDAP_DEBUG_TRACE,
1561 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1562 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1565 xf.f_or = op->oq_search.rs_filter;
1566 xf.f_choice = LDAP_FILTER_OR;
1569 /* If the user's filter uses objectClass=*,
1570 * these clauses are redundant.
1572 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1573 && !get_subentries_visibility(op)
1574 && !is_sync_protocol(op) )
1576 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1577 /* match referral objects */
1578 struct berval bv_ref = { sizeof("referral")-1, "referral" };
1579 rf.f_choice = LDAP_FILTER_EQUALITY;
1581 rf.f_av_desc = slap_schema.si_ad_objectClass;
1582 rf.f_av_value = bv_ref;
1583 rf.f_next = xf.f_or;
1590 f.f_choice = LDAP_FILTER_AND;
1592 /* Dummy; we compute scope separately now */
1593 nf.f_choice = SLAPD_FILTER_COMPUTED;
1594 nf.f_result = LDAP_SUCCESS;
1595 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1596 ? op->oq_search.rs_filter : &xf ;
1597 /* Filter depth increased again, adding dummy clause */
1600 #ifdef BDB_SUBENTRIES
1601 if( get_subentries_visibility( op ) ) {
1602 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1603 sf.f_choice = LDAP_FILTER_EQUALITY;
1604 sf.f_ava = &aa_subentry;
1605 sf.f_av_desc = slap_schema.si_ad_objectClass;
1606 sf.f_av_value = bv_subentry;
1607 sf.f_next = nf.f_next;
1612 /* Allocate IDL stack, plus 1 more for former tmp */
1613 if ( depth+1 > bdb->bi_search_stack_depth ) {
1614 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1616 stack = search_stack( stackop );
1619 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1620 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1622 rc = bdb_dn2idl( op, e, ids, stack );
1625 if ( rc == LDAP_SUCCESS ) {
1626 rc = bdb_filter_candidates( op, &f, ids,
1627 stack, stack+BDB_IDL_UM_SIZE );
1630 if ( depth+1 > bdb->bi_search_stack_depth ) {
1636 LDAP_LOG ( OPERATION, DETAIL1,
1637 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1639 Debug(LDAP_DEBUG_TRACE,
1640 "bdb_search_candidates: failed (rc=%d)\n",
1646 LDAP_LOG ( OPERATION, DETAIL1,
1647 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1648 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1649 (long) BDB_IDL_LAST(ids));
1651 Debug(LDAP_DEBUG_TRACE,
1652 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1654 (long) BDB_IDL_FIRST(ids),
1655 (long) BDB_IDL_LAST(ids) );
1663 send_pagerequest_response(
1669 LDAPControl ctrl, *ctrls[2];
1670 BerElementBuffer berbuf;
1671 BerElement *ber = (BerElement *)&berbuf;
1672 struct berval cookie = { 0, NULL };
1673 PagedResultsCookie respcookie;
1676 LDAP_LOG ( OPERATION, ENTRY,
1677 "send_pagerequest_response: lastid: (0x%08lx) "
1678 "nentries: (0x%081x)\n",
1679 lastid, rs->sr_nentries, NULL );
1681 Debug(LDAP_DEBUG_ARGS, "send_pagerequest_response: lastid: (0x%08lx) "
1682 "nentries: (0x%081x)\n", lastid, rs->sr_nentries, NULL );
1685 ctrl.ldctl_value.bv_val = NULL;
1689 ber_init2( ber, NULL, LBER_USE_DER );
1691 respcookie = ( PagedResultsCookie )lastid;
1692 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1693 cookie.bv_len = sizeof( respcookie );
1694 cookie.bv_val = (char *)&respcookie;
1697 * FIXME: we should consider sending an estimate of the entries
1698 * left, after appropriate security check is done
1700 ber_printf( ber, "{iO}", tentries, &cookie );
1702 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1706 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1707 ctrls[0]->ldctl_iscritical = 0;
1709 rs->sr_ctrls = ctrls;
1710 rs->sr_err = LDAP_SUCCESS;
1711 send_ldap_result( op, rs );
1714 (void) ber_free_buf( ber );