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>
25 static int base_candidate(
30 static int search_candidates(
31 Operation *stackop, /* op with the current threadctx/slab cache */
32 Operation *sop, /* search op */
39 static int parse_paged_cookie( Operation *op, SlapReply *rs );
41 static void send_paged_response(
47 static int bdb_pfid_cmp( const void *v_id1, const void *v_id2 );
48 static ID* bdb_id_dup( Operation *op, ID *id );
50 /* Dereference aliases for a single alias entry. Return the final
51 * dereferenced entry on success, NULL on any failure.
53 static Entry * deref_base (
63 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
68 rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
69 rs->sr_text = "maximum deref depth exceeded";
71 while (BDB_IDL_N(tmp) < op->o_bd->be_max_deref_depth) {
72 /* Remember the last entry we looked at, so we can
77 /* If this is part of a subtree or onelevel search,
78 * have we seen this ID before? If so, quit.
80 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
85 /* If we've seen this ID during this deref iteration,
88 if ( bdb_idl_insert( tmp, e->e_id ) ) {
89 rs->sr_err = LDAP_ALIAS_PROBLEM;
90 rs->sr_text = "circular alias";
95 /* If there was a problem getting the aliasedObjectName,
96 * get_alias_dn will have set the error status.
98 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
103 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
113 rs->sr_err = LDAP_ALIAS_PROBLEM;
114 rs->sr_text = "aliasedObject not found";
118 /* Free the previous entry, continue to work with the
119 * one we just retrieved.
121 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
125 /* We found a regular entry. Return this to the caller. The
126 * entry is still locked for Read.
128 if (!is_entry_alias(e)) {
129 rs->sr_err = LDAP_SUCCESS;
137 /* Look for and dereference all aliases within the search scope. Adds
138 * the dereferenced entries to the "ids" list. Requires "stack" to be
139 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
140 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
142 static int search_aliases(
151 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
152 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
153 ID cursora, ida, cursoro, ido, *subscop2;
156 struct berval bv_alias = BER_BVC( "alias" );
157 AttributeAssertion aa_alias;
159 DB_LOCK locka, lockr;
162 aliases = stack; /* IDL of all aliases in the database */
163 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
164 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
165 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
166 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
167 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
168 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
170 /* A copy of subscop, because subscop gets clobbered by
171 * the bdb_idl_union/intersection routines
173 subscop2 = tmp + BDB_IDL_DB_SIZE;
175 af.f_choice = LDAP_FILTER_EQUALITY;
176 af.f_ava = &aa_alias;
177 af.f_av_desc = slap_schema.si_ad_objectClass;
178 af.f_av_value = bv_alias;
181 /* Find all aliases in database */
182 BDB_IDL_ZERO( aliases );
183 rs->sr_err = bdb_filter_candidates( op, &af, aliases,
185 if (rs->sr_err != LDAP_SUCCESS) {
189 oldsubs[1] = e->e_id;
192 BDB_IDL_ZERO( visited );
193 BDB_IDL_ZERO( newsubs );
196 ido = bdb_idl_first( oldsubs, &cursoro );
199 /* Set curscop to only the aliases in the current scope. Start with
200 * all the aliases, obtain the IDL for the current scope, and then
201 * get the intersection of these two IDLs. Add the current scope
202 * to the cumulative list of candidates.
204 BDB_IDL_CPY( curscop, aliases );
205 rs->sr_err = bdb_dn2idl( op, e, subscop,
206 subscop2+BDB_IDL_DB_SIZE );
210 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
212 BDB_IDL_CPY(subscop2, subscop);
213 rs->sr_err = bdb_idl_intersection(curscop, subscop);
214 bdb_idl_union( ids, subscop2 );
216 /* Dereference all of the aliases in the current scope. */
218 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
219 ida = bdb_idl_next(curscop, &cursora))
223 rs->sr_err = bdb_cache_find_id(op, NULL,
224 ida, &ei, 0, locker, &lockr );
225 if (rs->sr_err != LDAP_SUCCESS) {
226 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
227 rs->sr_err == DB_LOCK_NOTGRANTED ) goto retry1;
232 /* This should only happen if the curscop IDL has maxed out and
233 * turned into a range that spans IDs indiscriminately
235 if (!is_entry_alias(a)) {
236 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
241 /* Actually dereference the alias */
243 a = deref_base( op, rs, a, &matched, locker, &lockr,
246 /* If the target was not already in our current candidates,
247 * make note of it in the newsubs list. Also
248 * set it in the scopes list so that bdb_search
251 if (bdb_idl_insert(ids, a->e_id) == 0) {
252 bdb_idl_insert(newsubs, a->e_id);
253 bdb_idl_insert(scopes, a->e_id);
255 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
258 } else if (matched) {
259 /* Alias could not be dereferenced, or it deref'd to
260 * an ID we've already seen. Ignore it.
262 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
267 /* If this is a OneLevel search, we're done; oldsubs only had one
268 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
270 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
272 ido = bdb_idl_next( oldsubs, &cursoro );
274 /* If we're done processing the old scopes, did we add any new
275 * scopes in this iteration? If so, go back and do those now.
278 if (BDB_IDL_IS_ZERO(newsubs)) break;
279 BDB_IDL_CPY(oldsubs, newsubs);
280 BDB_IDL_ZERO(newsubs);
282 ido = bdb_idl_first( oldsubs, &cursoro );
285 /* Find the entry corresponding to the next scope. If it can't
286 * be found, ignore it and move on. This should never happen;
287 * we should never see the ID of an entry that doesn't exist.
288 * Set the name so that the scope's IDL can be retrieved.
292 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
294 if ( rs->sr_err != LDAP_SUCCESS ) {
295 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
296 rs->sr_err == DB_LOCK_NOTGRANTED )
307 #define is_sync_protocol(op) \
308 ((op)->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST)
310 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
311 ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
312 #define IS_PSEARCH (op != sop)
313 #define IS_POST_SEARCH ( op->ors_post_search_id != NOID )
316 bdb_drop_psearch( Operation *op, ber_int_t msgid )
319 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
321 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
322 if ( ps_list->o_connid == op->o_connid ) {
323 if ( ps_list->o_msgid == msgid ) {
324 ps_list->o_abandon = 1;
325 LDAP_LIST_REMOVE( ps_list, o_ps_link );
326 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
327 LDAP_STAILQ_REMOVE( &op->o_conn->c_ops, ps_list,
329 LDAP_STAILQ_NEXT( ps_list, o_next ) = NULL;
330 op->o_conn->c_n_ops_executing--;
331 op->o_conn->c_n_ops_completed++;
332 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
342 bdb_abandon( Operation *op, SlapReply *rs )
345 void *saved_tmpmemctx;
347 ps = bdb_drop_psearch( op, op->oq_abandon.rs_msgid );
349 saved_tmpmemctx = ps->o_tmpmemctx;
351 if (!BER_BVISNULL(&ps->o_req_dn)) {
352 slap_sl_free(ps->o_req_dn.bv_val, ps->o_tmpmemctx );
354 if (!BER_BVISNULL(&ps->o_req_ndn)) {
355 slap_sl_free(ps->o_req_ndn.bv_val, ps->o_tmpmemctx );
357 if (!BER_BVISNULL(&ps->ors_filterstr)) {
358 ps->o_tmpfree(ps->ors_filterstr.bv_val, ps->o_tmpmemctx);
360 if (ps->ors_filter != NULL) {
361 filter_free_x(ps, ps->ors_filter);
363 if (ps->ors_attrs != NULL) {
364 ps->o_tmpfree(ps->ors_attrs, ps->o_tmpmemctx);
369 if ( saved_tmpmemctx ) {
370 slap_sl_mem_destroy( NULL, saved_tmpmemctx );
375 return LDAP_UNAVAILABLE;
379 bdb_cancel( Operation *op, SlapReply *rs )
382 void *saved_tmpmemctx;
384 ps = bdb_drop_psearch( op, op->oq_cancel.rs_msgid );
386 saved_tmpmemctx = ps->o_tmpmemctx;
388 rs->sr_err = LDAP_CANCELLED;
389 send_ldap_result( ps, rs );
391 if (!BER_BVISNULL(&ps->o_req_dn)) {
392 slap_sl_free(ps->o_req_dn.bv_val, ps->o_tmpmemctx );
394 if (!BER_BVISNULL(&ps->o_req_ndn)) {
395 slap_sl_free(ps->o_req_ndn.bv_val, ps->o_tmpmemctx );
397 if (!BER_BVISNULL(&ps->ors_filterstr)) {
398 ps->o_tmpfree(ps->ors_filterstr.bv_val, ps->o_tmpmemctx);
400 if (ps->ors_filter != NULL) {
401 filter_free_x(ps, ps->ors_filter);
403 if (ps->ors_attrs != NULL) {
404 ps->o_tmpfree(ps->ors_attrs, ps->o_tmpmemctx);
409 if ( saved_tmpmemctx ) {
410 slap_sl_mem_destroy( NULL, saved_tmpmemctx );
415 return LDAP_UNAVAILABLE;
418 int bdb_search( Operation *op, SlapReply *rs )
421 struct pc_entry *pce = NULL;
422 struct pc_entry *tmp_pce = NULL;
426 ps_e.e_private = NULL;
427 ldap_pvt_thread_mutex_init( &op->o_pcmutex );
428 LDAP_TAILQ_INIT( &op->o_ps_pre_candidates );
429 LDAP_TAILQ_INIT( &op->o_ps_post_candidates );
431 op->ors_post_search_id = NOID;
432 rc = bdb_do_search( op, rs, op, NULL, 0 );
434 ldap_pvt_thread_mutex_lock( &op->o_pcmutex );
435 pce = LDAP_TAILQ_FIRST( &op->o_ps_post_candidates );
436 ldap_pvt_thread_mutex_unlock( &op->o_pcmutex );
438 while ( rc == LDAP_SUCCESS && pce &&
439 op->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
441 ps_e.e_id = op->ors_post_search_id = pce->pc_id;
442 if ( op->o_sync_csn.bv_val ) {
443 ch_free( op->o_sync_csn.bv_val );
444 op->o_sync_csn.bv_val = NULL;
446 ber_dupbv( &op->o_sync_csn, &pce->pc_csn );
447 ber_dupbv( &ps_e.e_name, &pce->pc_ename );
448 ber_dupbv( &ps_e.e_nname, &pce->pc_enname );
449 a = ch_calloc( 1, sizeof( Attribute ));
450 a->a_desc = slap_schema.si_ad_entryUUID;
451 a->a_vals = ch_calloc( 2, sizeof( struct berval ));
452 ber_dupbv( &a->a_vals[0], &pce->pc_entryUUID );
453 a->a_nvals = a->a_vals;
457 rc = bdb_do_search( op, rs, op, &ps_e, 0 );
460 ldap_pvt_thread_mutex_lock( &op->o_pcmutex );
461 pce = LDAP_TAILQ_NEXT( pce, pc_link );
462 LDAP_TAILQ_REMOVE( &op->o_ps_post_candidates, tmp_pce, pc_link );
463 ldap_pvt_thread_mutex_unlock( &op->o_pcmutex );
465 ch_free( tmp_pce->pc_csn.bv_val );
466 ch_free( tmp_pce->pc_entryUUID.bv_val );
467 ch_free( tmp_pce->pc_ename.bv_val );
468 ch_free( tmp_pce->pc_enname.bv_val );
470 entry_clean( &ps_e );
475 #define BDB_PSEARCH_MAX_WAIT 3
476 int bdb_psearch( Operation *op, SlapReply *rs, Operation *sop,
477 Entry *ps_e, int ps_type )
480 struct pc_entry *pce = NULL;
481 struct pc_entry *p = NULL;
484 op->ors_post_search_id = NOID;
487 case LDAP_PSEARCH_BY_PREMODIFY:
488 case LDAP_PSEARCH_BY_PREDELETE:
490 if ( !op->o_ps_send_wait ) {
491 if ( sop->o_refresh_in_progress ) {
492 pce = (struct pc_entry *) ch_calloc(
493 1, sizeof( struct pc_entry ));
494 pce->pc_id = ps_e->e_id;
495 ldap_pvt_thread_mutex_lock( &sop->o_pcmutex );
496 if ( LDAP_TAILQ_EMPTY( &sop->o_ps_pre_candidates )) {
497 LDAP_TAILQ_INSERT_HEAD(
498 &sop->o_ps_pre_candidates, pce, pc_link );
500 LDAP_TAILQ_FOREACH( p,
501 &sop->o_ps_pre_candidates, pc_link ) {
502 if ( p->pc_id > pce->pc_id )
507 LDAP_TAILQ_INSERT_BEFORE( p, pce, pc_link );
509 LDAP_TAILQ_INSERT_TAIL(
510 &sop->o_ps_pre_candidates,
514 ldap_pvt_thread_mutex_unlock( &sop->o_pcmutex );
516 rc = bdb_do_search( op, rs, sop, ps_e, ps_type );
520 pce = op->o_ps_send_wait;
523 /* Wait until refresh search send the entry */
524 while ( !pce->pc_sent ) {
525 if ( sop->o_refresh_in_progress ) {
526 if ( num_retries == BDB_PSEARCH_MAX_WAIT ) {
527 op->o_ps_send_wait = pce;
530 ldap_pvt_thread_yield();
531 bdb_trans_backoff( ++num_retries );
537 op->o_ps_send_wait = NULL;
539 if ( !sop->o_refresh_in_progress && !pce->pc_sent ) {
540 /* refresh ended without processing pce */
541 /* need to perform psearch for ps_e */
542 ldap_pvt_thread_mutex_lock( &sop->o_pcmutex );
543 LDAP_TAILQ_REMOVE( &sop->o_ps_pre_candidates, pce, pc_link );
544 ldap_pvt_thread_mutex_unlock( &sop->o_pcmutex );
546 rc = bdb_do_search( op, rs, sop, ps_e, ps_type );
549 /* the pce entry was sent in the refresh phase */
550 if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
551 struct psid_entry* psid_e;
552 psid_e = (struct psid_entry *) ch_calloc(1,
553 sizeof(struct psid_entry));
555 LDAP_LIST_INSERT_HEAD( &op->o_pm_list, psid_e, ps_link );
558 ldap_pvt_thread_mutex_lock( &sop->o_pcmutex );
559 LDAP_TAILQ_REMOVE( &sop->o_ps_pre_candidates, pce, pc_link );
560 ldap_pvt_thread_mutex_unlock( &sop->o_pcmutex );
565 case LDAP_PSEARCH_BY_DELETE:
566 case LDAP_PSEARCH_BY_SCOPEOUT:
567 case LDAP_PSEARCH_BY_ADD:
568 case LDAP_PSEARCH_BY_MODIFY:
569 ldap_pvt_thread_mutex_lock( &op->o_pcmutex );
570 if ( sop->o_refresh_in_progress ||
571 !LDAP_TAILQ_EMPTY( &sop->o_ps_post_candidates )) {
572 pce = (struct pc_entry *) ch_calloc( 1, sizeof( struct pc_entry ));
573 pce->pc_id = ps_e->e_id;
574 ber_dupbv( &pce->pc_csn, &op->o_sync_csn );
575 if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
577 for ( a = ps_e->e_attrs; a != NULL; a = a->a_next ) {
578 AttributeDescription *desc = a->a_desc;
579 if ( desc == slap_schema.si_ad_entryUUID ) {
580 ber_dupbv( &pce->pc_entryUUID, &a->a_nvals[0] );
584 ber_dupbv( &pce->pc_ename, &ps_e->e_name );
585 ber_dupbv( &pce->pc_enname, &ps_e->e_nname );
586 LDAP_TAILQ_INSERT_TAIL( &sop->o_ps_post_candidates, pce, pc_link );
587 ldap_pvt_thread_mutex_unlock( &op->o_pcmutex );
589 ldap_pvt_thread_mutex_unlock( &op->o_pcmutex );
590 rc = bdb_do_search( op, rs, sop, ps_e, ps_type );
595 Debug( LDAP_DEBUG_TRACE, "do_psearch: invalid psearch type\n",
601 int bdb_search( Operation *op, SlapReply *rs )
603 return bdb_do_search( op, rs, op, NULL, 0 );
607 /* For persistent searches, op is the currently executing operation,
608 * sop is the persistent search. For regular searches, sop = op.
611 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop,
612 Entry *ps_e, int ps_type )
614 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
617 ID candidates[BDB_IDL_UM_SIZE];
618 ID scopes[BDB_IDL_DB_SIZE];
619 Entry *e = NULL, base, e_root = {0};
620 Entry *matched = NULL;
621 EntryInfo *ei, ei_root = {0};
622 struct berval realbase = BER_BVNULL;
626 AttributeName *attrs;
628 u_int32_t locker = 0;
630 struct bdb_op_info *opinfo = NULL;
634 Filter contextcsnand, contextcsnle, cookief, csnfnot,
635 csnfeq, csnfand, csnfge;
636 AttributeAssertion aa_ge, aa_eq, aa_le;
637 struct berval *search_context_csn = NULL;
639 LDAPControl *ctrls[SLAP_MAX_RESPONSE_CONTROLS];
641 AttributeName uuid_attr[2];
643 int entry_sync_state = -1;
644 AttributeName null_attr;
645 int no_sync_state_change = 0;
649 int sync_send_present_mode = 1;
655 struct pc_entry *pce = NULL;
656 BerVarray syncUUID_set = NULL;
657 int syncUUID_set_cnt = 0;
661 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_search) "\n", 0, 0, 0);
662 attrs = sop->oq_search.rs_attrs;
664 opinfo = (struct bdb_op_info *) op->o_private;
667 if ( !IS_POST_SEARCH && !IS_PSEARCH &&
668 sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
669 struct slap_session_entry *sent;
670 if ( sop->o_sync_state.sid >= 0 ) {
671 LDAP_LIST_FOREACH( sent, &bdb->bi_session_list, se_link ) {
672 if ( sent->se_id == sop->o_sync_state.sid ) {
673 sop->o_sync_slog_size = sent->se_size;
680 /* psearch needs to be registered before refresh begins */
681 if ( !IS_POST_SEARCH && !IS_PSEARCH &&
682 sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
683 sop->o_refresh_in_progress = 1;
684 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
685 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
686 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
688 } else if ( !IS_POST_SEARCH && !IS_PSEARCH &&
689 sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST
690 && sop->o_sync_slog_size >= 0 )
692 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
693 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
694 if ( ps_list->o_sync_slog_size >= 0 ) {
695 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
703 if ( ps_list->o_sync_slog_omitcsn.bv_len != 0 ) {
704 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
705 if ( sop->o_sync_state.ctxcsn &&
706 sop->o_sync_state.ctxcsn->bv_val != NULL )
708 value_match( &match, slap_schema.si_ad_entryCSN, mr,
709 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
710 sop->o_sync_state.ctxcsn,
711 &ps_list->o_sync_slog_omitcsn,
717 sync_send_present_mode = 0;
720 sync_send_present_mode = 0;
722 } else if ( sop->o_sync_slog_size >= 0 ) {
723 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
725 sop->o_sync_state.sid = -1;
727 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
730 null_attr.an_desc = NULL;
731 null_attr.an_oc = NULL;
732 null_attr.an_oc_exclude = 0;
733 BER_BVZERO( &null_attr.an_name );
735 for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
736 ctrls[num_ctrls] = NULL;
740 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
742 attrs[0].an_desc = NULL;
743 attrs[0].an_oc = NULL;
744 attrs[0].an_oc_exclude = 0;
745 BER_BVZERO( &attrs[0].an_name );
749 manageDSAit = get_manageDSAit( sop );
752 /* Sync control overrides manageDSAit */
753 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
754 if ( manageDSAit == SLAP_CONTROL_NONE ) {
755 manageDSAit = SLAP_CONTROL_CRITICAL;
757 } else if ( IS_PSEARCH ) {
758 if ( manageDSAit == SLAP_CONTROL_NONE ) {
759 manageDSAit = SLAP_CONTROL_CRITICAL;
764 if ( opinfo && opinfo->boi_txn ) {
765 ltid = opinfo->boi_txn;
766 locker = TXN_ID( ltid );
768 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
774 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
780 if ( IS_POST_SEARCH ) {
783 candidates[1] = op->ors_post_search_id;
784 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );
789 if ( sop->o_req_ndn.bv_len == 0 ) {
790 /* DIT root special case */
791 ei_root.bei_e = &e_root;
792 ei_root.bei_parent = &ei_root;
793 e_root.e_private = &ei_root;
795 BER_BVSTR( &e_root.e_nname, "" );
796 BER_BVSTR( &e_root.e_name, "" );
798 rs->sr_err = LDAP_SUCCESS;
801 /* get entry with reader lock */
802 rs->sr_err = bdb_dn2entry( op, ltid, &sop->o_req_ndn, &ei,
814 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
816 LOCK_ID_FREE (bdb->bi_dbenv, locker );
818 case DB_LOCK_DEADLOCK:
819 case DB_LOCK_NOTGRANTED:
822 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
824 LOCK_ID_FREE (bdb->bi_dbenv, locker );
828 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
829 BDB_IDL_ZERO(candidates);
830 e = deref_base( op, rs, e, &matched, locker, &lock,
835 struct berval matched_dn = BER_BVNULL;
837 if ( matched != NULL ) {
839 ber_dupbv( &matched_dn, &matched->e_name );
841 erefs = is_entry_referral( matched )
842 ? get_entry_referrals( op, matched )
845 #ifdef SLAP_ZONE_ALLOC
846 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
848 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
853 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
854 &sop->o_req_dn, sop->oq_search.rs_scope );
855 ber_bvarray_free( erefs );
859 #ifdef SLAP_ZONE_ALLOC
860 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
862 rs->sr_ref = referral_rewrite( default_referral,
863 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
866 rs->sr_err = LDAP_REFERRAL;
867 rs->sr_matched = matched_dn.bv_val;
868 send_ldap_result( sop, rs );
871 LOCK_ID_FREE (bdb->bi_dbenv, locker );
873 ber_bvarray_free( rs->sr_ref );
876 if ( matched_dn.bv_val ) {
877 ber_memfree( matched_dn.bv_val );
878 rs->sr_matched = NULL;
883 if ( !manageDSAit && e != &e_root && is_entry_referral( e ) ) {
884 /* entry is a referral, don't allow add */
885 struct berval matched_dn;
888 ber_dupbv( &matched_dn, &e->e_name );
889 erefs = get_entry_referrals( op, e );
891 #ifdef SLAP_ZONE_ALLOC
892 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
894 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
898 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
899 &sop->o_req_dn, sop->oq_search.rs_scope );
900 ber_bvarray_free( erefs );
903 Debug( LDAP_DEBUG_TRACE,
904 LDAP_XSTRING(bdb_search) ": entry is referral\n",
907 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
908 rs->sr_err = LDAP_REFERRAL;
909 rs->sr_matched = matched_dn.bv_val;
910 send_ldap_result( sop, rs );
913 LOCK_ID_FREE (bdb->bi_dbenv, locker );
914 ber_bvarray_free( rs->sr_ref );
916 ber_memfree( matched_dn.bv_val );
917 rs->sr_matched = NULL;
921 if ( get_assert( op ) &&
922 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
924 rs->sr_err = LDAP_ASSERTION_FAILED;
925 #ifdef SLAP_ZONE_ALLOC
926 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
928 send_ldap_result( sop, rs );
932 /* compute it anyway; root does not use it */
933 stoptime = op->o_time + sop->ors_tlimit;
935 /* need normalized dn below */
936 ber_dupbv( &realbase, &e->e_nname );
938 /* Copy info to base, must free entry before accessing the database
939 * in search_candidates, to avoid deadlocks.
941 base.e_private = e->e_private;
942 base.e_nname = realbase;
945 #ifdef SLAP_ZONE_ALLOC
946 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
948 if ( e != &e_root ) {
949 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
955 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn,
956 locker, &ctxcsn_lock );
958 if ( rs->sr_err != LDAP_SUCCESS ) {
959 send_ldap_error( sop, rs, rs->sr_err,
960 "error in csn management in search" );
964 if ( sop->o_sync_mode != SLAP_SYNC_NONE &&
965 sop->o_sync_state.ctxcsn &&
966 sop->o_sync_state.ctxcsn->bv_val &&
967 ber_bvcmp( &sop->o_sync_state.ctxcsn[0], search_context_csn ) == 0 )
969 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
973 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );
977 /* select candidates */
978 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
979 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
982 BDB_IDL_ZERO( candidates );
983 BDB_IDL_ZERO( scopes );
984 rs->sr_err = search_candidates( op, sop, rs, &base,
985 locker, candidates, scopes );
989 if ( !IS_PSEARCH && sop->o_sync_mode != SLAP_SYNC_NONE ) {
990 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
994 /* start cursor at beginning of candidates.
999 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
1000 cursor = bdb_idl_search( candidates, ps_e->e_id );
1001 if ( candidates[cursor] != ps_e->e_id ) {
1002 rs->sr_err = LDAP_SUCCESS;
1005 } else if ( ps_e->e_id < BDB_IDL_RANGE_FIRST( candidates ) ||
1006 ps_e->e_id > BDB_IDL_RANGE_LAST( candidates ))
1008 rs->sr_err = LDAP_SUCCESS;
1012 candidates[1] = ps_e->e_id;
1016 if ( candidates[0] == 0 ) {
1017 Debug( LDAP_DEBUG_TRACE,
1018 LDAP_XSTRING(bdb_search) ": no candidates\n",
1024 /* if not root and candidates exceed to-be-checked entries, abort */
1025 if ( sop->ors_limit /* isroot == FALSE */ &&
1026 sop->ors_limit->lms_s_unchecked != -1 &&
1027 BDB_IDL_N(candidates) > (unsigned) sop->ors_limit->lms_s_unchecked )
1029 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
1030 send_ldap_result( sop, rs );
1031 rs->sr_err = LDAP_SUCCESS;
1035 if ( sop->ors_limit == NULL /* isroot == TRUE */ ||
1036 !sop->ors_limit->lms_s_pr_hide )
1038 tentries = BDB_IDL_N(candidates);
1041 if ( get_pagedresults( sop ) > SLAP_CONTROL_IGNORED ) {
1042 PagedResultsState *ps = sop->o_pagedresults_state;
1043 /* deferred cookie parsing */
1044 rs->sr_err = parse_paged_cookie( sop, rs );
1045 if ( rs->sr_err != LDAP_SUCCESS ) {
1046 send_ldap_result( sop, rs );
1050 if ( (ID)( ps->ps_cookie ) == 0 ) {
1051 id = bdb_idl_first( candidates, &cursor );
1054 if ( ps->ps_size == 0 ) {
1055 rs->sr_err = LDAP_SUCCESS;
1056 rs->sr_text = "search abandoned by pagedResult size=0";
1057 send_ldap_result( sop, rs );
1060 for ( id = bdb_idl_first( candidates, &cursor );
1062 id <= (ID)( ps->ps_cookie );
1063 id = bdb_idl_next( candidates, &cursor ) )
1069 if ( cursor == NOID ) {
1070 Debug( LDAP_DEBUG_TRACE,
1071 LDAP_XSTRING(bdb_search)
1072 ": no paged results candidates\n",
1074 send_paged_response( sop, rs, &lastid, 0 );
1076 rs->sr_err = LDAP_OTHER;
1083 if (( sop->o_sync_mode & SLAP_SYNC_REFRESH ) || IS_PSEARCH ) {
1086 cookief.f_choice = LDAP_FILTER_AND;
1087 cookief.f_and = &csnfnot;
1088 cookief.f_next = NULL;
1090 csnfnot.f_choice = LDAP_FILTER_NOT;
1091 csnfnot.f_not = &csnfeq;
1092 csnfnot.f_next = &csnfand;
1094 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
1095 csnfeq.f_ava = &aa_eq;
1096 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
1097 if ( sop->o_sync_state.ctxcsn != NULL ) {
1098 csnfeq.f_av_value = *sop->o_sync_state.ctxcsn;
1100 csnfeq.f_av_value = slap_empty_bv;
1103 csnfand.f_choice = LDAP_FILTER_AND;
1104 csnfand.f_and = &csnfge;
1105 csnfand.f_next = NULL;
1107 csnfge.f_choice = LDAP_FILTER_GE;
1108 csnfge.f_ava = &aa_ge;
1109 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
1110 if ( sop->o_sync_state.ctxcsn != NULL ) {
1111 csnfge.f_av_value = *sop->o_sync_state.ctxcsn;
1113 csnfge.f_av_value = slap_empty_bv;
1116 if ( search_context_csn && !IS_PSEARCH ) {
1117 csnfge.f_next = &contextcsnand;
1119 contextcsnand.f_choice = LDAP_FILTER_AND;
1120 contextcsnand.f_and = &contextcsnle;
1121 contextcsnand.f_next = NULL;
1123 contextcsnle.f_choice = LDAP_FILTER_LE;
1124 contextcsnle.f_ava = &aa_le;
1125 contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
1126 contextcsnle.f_av_value = *search_context_csn;
1127 contextcsnle.f_next = sop->oq_search.rs_filter;
1129 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
1130 if ( sop->o_sync_state.ctxcsn &&
1131 sop->o_sync_state.ctxcsn->bv_val != NULL )
1133 value_match( &match, slap_schema.si_ad_entryCSN, mr,
1134 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1135 &sop->o_sync_state.ctxcsn[0], search_context_csn,
1140 no_sync_state_change = ( match >= 0 );
1142 csnfge.f_next = sop->oq_search.rs_filter;
1149 for ( id = bdb_idl_first( candidates, &cursor );
1152 && !no_sync_state_change
1154 ; id = bdb_idl_next( candidates, &cursor ) )
1162 if ( !IS_POST_SEARCH ) {
1163 idhole = (ID*) avl_find( sop->o_psearch_finished,
1164 (caddr_t)&id, bdb_pfid_cmp );
1166 avl_delete( &sop->o_psearch_finished,
1167 (caddr_t)idhole, bdb_pfid_cmp );
1168 sop->o_tmpfree( idhole, sop->o_tmpmemctx );
1172 if ( sop->o_refresh_in_progress ) {
1173 ldap_pvt_thread_mutex_lock( &sop->o_pcmutex );
1174 pce = LDAP_TAILQ_FIRST( &sop->o_ps_pre_candidates );
1175 while ( pce && pce->pc_sent ) {
1176 pce = LDAP_TAILQ_NEXT( pce, pc_link );
1178 ldap_pvt_thread_mutex_unlock( &sop->o_pcmutex );
1181 if ( BDB_IDL_IS_RANGE( candidates ) ) {
1182 if ( pce->pc_id >= candidates[1] &&
1183 pce->pc_id <= candidates[2] &&
1184 pce->pc_id > cursor-1 ) {
1187 avl_insert( &sop->o_psearch_finished,
1188 (caddr_t)bdb_id_dup( sop, &pce->pc_id ),
1189 bdb_pfid_cmp, avl_dup_error );
1194 pos = bdb_idl_search(candidates, pce->pc_id);
1195 if ( pos > cursor-1 && pos <= candidates[0] ) {
1198 avl_insert( &sop->o_psearch_finished,
1199 (caddr_t)bdb_id_dup( sop, &pce->pc_id ),
1200 bdb_pfid_cmp, avl_dup_error );
1209 /* check for abandon */
1210 if ( sop->o_abandon ) {
1212 bdb_drop_psearch( sop, sop->o_msgid );
1214 rs->sr_err = LDAP_SUCCESS;
1218 if ( sop->o_cancel ) {
1219 assert( sop->o_cancel == SLAP_CANCEL_REQ );
1220 rs->sr_err = LDAP_CANCELLED;
1221 send_ldap_result( sop, rs );
1222 sop->o_cancel = SLAP_CANCEL_ACK;
1223 rs->sr_err = LDAP_SUCCESS;
1227 /* check for abandon */
1228 if ( sop->o_abandon ) {
1229 rs->sr_err = LDAP_SUCCESS;
1234 /* check time limit */
1235 if ( sop->ors_tlimit != SLAP_NO_LIMIT
1236 && slap_get_time() > stoptime )
1238 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
1239 rs->sr_ref = rs->sr_v2ref;
1240 send_ldap_result( sop, rs );
1241 rs->sr_err = LDAP_SUCCESS;
1249 /* get the entry with reader lock */
1251 rs->sr_err = bdb_cache_find_id( op, ltid,
1252 id, &ei, 0, locker, &lock );
1254 if (rs->sr_err == LDAP_BUSY) {
1255 rs->sr_text = "ldap server busy";
1256 send_ldap_result( sop, rs );
1259 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
1260 || rs->sr_err == DB_LOCK_NOTGRANTED )
1262 goto fetch_entry_retry;
1265 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
1273 if ( IS_POST_SEARCH ) {
1274 /* send LDAP_SYNC_DELETE */
1275 rs->sr_entry = e = ps_e;
1276 goto post_search_no_entry;
1279 if( !BDB_IDL_IS_RANGE(candidates) ) {
1280 /* only complain for non-range IDLs */
1281 Debug( LDAP_DEBUG_TRACE,
1282 LDAP_XSTRING(bdb_search)
1283 ": candidate %ld not found\n",
1297 #ifdef BDB_SUBENTRIES
1298 /* FIXME: send all but syncrepl */
1300 if ( !is_sync_protocol( sop ) )
1303 if ( is_entry_subentry( e ) ) {
1304 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
1305 if(!get_subentries_visibility( sop )) {
1306 /* only subentries are visible */
1310 } else if ( get_subentries( sop ) &&
1311 !get_subentries_visibility( sop ))
1313 /* only subentries are visible */
1317 } else if ( get_subentries_visibility( sop )) {
1318 /* only subentries are visible */
1322 #endif /* BDB_SUBENTRIES */
1324 /* Does this candidate actually satisfy the search scope?
1326 * Note that we don't lock access to the bei_parent pointer.
1327 * Since only leaf nodes can be deleted, the parent of any
1328 * node will always be a valid node. Also since we have
1329 * a Read lock on the data, it cannot be renamed out of the
1330 * scope while we are looking at it, and unless we're using
1331 * BDB_HIER, its parents cannot be moved either.
1333 switch( sop->ors_scope ) {
1334 case LDAP_SCOPE_BASE:
1335 /* This is always true, yes? */
1336 if ( id == base.e_id ) scopeok = 1;
1339 case LDAP_SCOPE_ONELEVEL:
1340 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
1343 #ifdef LDAP_SCOPE_CHILDREN
1344 case LDAP_SCOPE_CHILDREN:
1345 if ( id == base.e_id ) break;
1348 case LDAP_SCOPE_SUBTREE: {
1350 for ( tmp = BEI(e); tmp; tmp = tmp->bei_parent ) {
1351 if ( tmp->bei_id == base.e_id ) {
1359 /* aliases were already dereferenced in candidate list */
1360 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
1361 /* but if the search base is an alias, and we didn't
1362 * deref it when finding, return it.
1364 if ( is_entry_alias(e) &&
1365 ((sop->ors_deref & LDAP_DEREF_FINDING) ||
1366 !bvmatch(&e->e_nname, &op->o_req_ndn)))
1371 /* scopes is only non-empty for onelevel or subtree */
1372 if ( !scopeok && BDB_IDL_N(scopes) ) {
1374 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
1375 x = bdb_idl_search( scopes, e->e_id );
1376 if ( scopes[x] == e->e_id ) scopeok = 1;
1378 /* subtree, walk up the tree */
1379 EntryInfo *tmp = BEI(e);
1380 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
1381 x = bdb_idl_search( scopes, tmp->bei_id );
1382 if ( scopes[x] == tmp->bei_id ) {
1391 /* Not in scope, ignore it */
1393 if ( !IS_POST_SEARCH && !scopeok )
1398 Debug( LDAP_DEBUG_TRACE,
1399 LDAP_XSTRING(bdb_search)
1400 ": %ld scope not okay\n",
1406 * if it's a referral, add it to the list of referrals. only do
1407 * this for non-base searches, and don't check the filter
1408 * explicitly here since it's only a candidate anyway.
1410 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE
1411 && is_entry_referral( e ) )
1413 BerVarray erefs = get_entry_referrals( sop, e );
1414 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
1415 sop->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
1416 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
1418 send_search_reference( sop, rs );
1420 ber_bvarray_free( rs->sr_ref );
1421 ber_bvarray_free( erefs );
1427 if ( !manageDSAit && is_entry_glue( e )) {
1431 /* if it matches the filter and scope, send it */
1433 rs->sr_err = test_filter( sop, rs->sr_entry, sop->oq_search.rs_filter );
1436 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1437 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1439 rs->sr_err = LDAP_COMPARE_TRUE;
1443 if ( !IS_POST_SEARCH ) {
1444 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1445 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1446 rs->sr_err = test_filter( sop, rs->sr_entry,
1448 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1449 if ( rc_sync == LDAP_COMPARE_TRUE ) {
1450 if ( no_sync_state_change ) {
1451 Debug( LDAP_DEBUG_TRACE,
1452 LDAP_XSTRING(bdb_search) ": "
1453 "error in context csn management\n",
1456 entry_sync_state = LDAP_SYNC_ADD;
1459 if ( no_sync_state_change ) {
1462 entry_sync_state = LDAP_SYNC_PRESENT;
1466 rs->sr_err = test_filter( sop,
1467 rs->sr_entry, sop->oq_search.rs_filter );
1471 rs->sr_err = test_filter( sop,
1472 rs->sr_entry, sop->oq_search.rs_filter );
1474 rs->sr_err = LDAP_COMPARE_TRUE;
1480 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1481 /* check size limit */
1482 if ( --sop->ors_slimit == -1
1484 && sop->o_sync_slog_size == -1
1490 #ifdef SLAP_ZONE_ALLOC
1491 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
1493 bdb_cache_return_entry_r( bdb->bi_dbenv,
1494 &bdb->bi_cache, e, &lock );
1499 rs->sr_entry = NULL;
1500 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1501 rs->sr_ref = rs->sr_v2ref;
1502 send_ldap_result( sop, rs );
1503 rs->sr_err = LDAP_SUCCESS;
1507 if ( get_pagedresults(sop) > SLAP_CONTROL_IGNORED ) {
1508 if ( rs->sr_nentries >= ((PagedResultsState *)sop->o_pagedresults_state)->ps_size ) {
1509 send_paged_response( sop, rs, &lastid, tentries );
1519 if (IS_PSEARCH || IS_POST_SEARCH) {
1520 int premodify_found = 0;
1522 if ( IS_POST_SEARCH ||
1523 ps_type == LDAP_PSEARCH_BY_ADD ||
1524 ps_type == LDAP_PSEARCH_BY_DELETE ||
1525 ps_type == LDAP_PSEARCH_BY_MODIFY ||
1526 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1528 if ( !IS_POST_SEARCH &&
1529 ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1530 struct psid_entry* psid_e;
1531 LDAP_LIST_FOREACH( psid_e,
1532 &op->o_pm_list, ps_link)
1534 if( psid_e->ps_op == sop ) {
1535 premodify_found = 1;
1536 LDAP_LIST_REMOVE(psid_e, ps_link);
1540 if (psid_e != NULL) free (psid_e);
1543 if ( IS_POST_SEARCH ) {
1545 entry_sync_state = LDAP_SYNC_ADD;
1547 post_search_no_entry:
1548 entry_sync_state = LDAP_SYNC_DELETE;
1550 } else if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1551 entry_sync_state = LDAP_SYNC_ADD;
1552 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1553 entry_sync_state = LDAP_SYNC_DELETE;
1554 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1555 if ( premodify_found ) {
1556 entry_sync_state = LDAP_SYNC_MODIFY;
1558 entry_sync_state = LDAP_SYNC_ADD;
1560 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT ) {
1561 entry_sync_state = LDAP_SYNC_DELETE;
1563 rs->sr_err = LDAP_OTHER;
1567 if ( sop->o_sync_slog_size != -1 ) {
1568 if ( entry_sync_state == LDAP_SYNC_DELETE ) {
1569 result = slap_add_session_log( op, sop, e );
1574 struct berval cookie;
1575 slap_compose_sync_cookie( sop, &cookie,
1577 sop->o_sync_state.sid,
1578 sop->o_sync_state.rid );
1579 rs->sr_err = slap_build_sync_state_ctrl(
1580 sop, rs, e, entry_sync_state, ctrls,
1581 num_ctrls++, 1, &cookie );
1582 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1583 if (!(IS_POST_SEARCH &&
1584 entry_sync_state == LDAP_SYNC_DELETE)) {
1585 rs->sr_attrs = attrs;
1587 rs->sr_attrs = NULL;
1589 rs->sr_operational_attrs = NULL;
1590 rs->sr_ctrls = ctrls;
1592 result = send_search_entry( sop, rs );
1593 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1595 ctrls[num_ctrls-1]->ldctl_value.bv_val,
1597 slap_sl_free( ctrls[--num_ctrls],
1599 ctrls[num_ctrls] = NULL;
1600 rs->sr_ctrls = NULL;
1603 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1604 struct psid_entry* psid_e;
1605 psid_e = (struct psid_entry *) ch_calloc(1,
1606 sizeof(struct psid_entry));
1607 psid_e->ps_op = sop;
1608 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1612 Debug( LDAP_DEBUG_TRACE,
1613 LDAP_XSTRING(bdb_search)
1614 ": invalid ps_type (%d) \n",
1619 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1620 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1621 rs->sr_err = slap_build_sync_state_ctrl(
1622 sop, rs, e, entry_sync_state, ctrls,
1623 num_ctrls++, 0, NULL );
1624 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1625 rs->sr_ctrls = ctrls;
1626 rs->sr_attrs = sop->oq_search.rs_attrs;
1627 rs->sr_operational_attrs = NULL;
1629 result = send_search_entry( sop, rs );
1631 ctrls[num_ctrls-1]->ldctl_value.bv_val,
1633 slap_sl_free( ctrls[--num_ctrls],
1635 ctrls[num_ctrls] = NULL;
1636 rs->sr_ctrls = NULL;
1638 } else { /* PRESENT */
1639 if ( sync_send_present_mode ) {
1640 result = slap_build_syncUUID_set( sop,
1642 if ( result <= 0 ) {
1646 if ( syncUUID_set_cnt ==
1647 SLAP_SYNCUUID_SET_SIZE )
1649 rs->sr_err = LDAP_SUCCESS;
1650 rs->sr_rspoid = LDAP_SYNC_INFO;
1651 rs->sr_ctrls = NULL;
1652 result = slap_send_syncinfo( sop, rs,
1653 LDAP_TAG_SYNC_ID_SET,
1654 NULL, 0, syncUUID_set, 0 );
1655 if ( result != LDAP_SUCCESS ) {
1658 ber_bvarray_free_x( syncUUID_set,
1660 syncUUID_set = NULL;
1661 syncUUID_set_cnt = 0;
1672 rs->sr_attrs = sop->oq_search.rs_attrs;
1673 rs->sr_operational_attrs = NULL;
1674 rs->sr_ctrls = NULL;
1676 rs->sr_err = LDAP_SUCCESS;
1677 result = send_search_entry( sop, rs );
1684 case 0: /* entry sent ok */
1686 case 1: /* entry not sent */
1688 case -1: /* connection closed */
1692 #ifdef SLAP_ZONE_ALLOC
1693 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
1695 bdb_cache_return_entry_r(bdb->bi_dbenv,
1696 &bdb->bi_cache, e, &lock);
1701 rs->sr_entry = NULL;
1702 rs->sr_err = LDAP_OTHER;
1708 Debug( LDAP_DEBUG_TRACE,
1709 LDAP_XSTRING(bdb_search)
1710 ": %ld does not match filter\n",
1716 /* free reader lock */
1719 if (!(IS_POST_SEARCH &&
1720 entry_sync_state == LDAP_SYNC_DELETE)) {
1721 #ifdef SLAP_ZONE_ALLOC
1722 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
1724 bdb_cache_return_entry_r( bdb->bi_dbenv,
1725 &bdb->bi_cache, e , &lock );
1726 if ( sop->o_nocaching ) {
1727 bdb_cache_delete_entry( bdb, ei, locker, &lock );
1732 #ifdef SLAP_ZONE_ALLOC
1733 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
1735 bdb_cache_return_entry_r( bdb->bi_dbenv,
1736 &bdb->bi_cache, e , &lock );
1739 rs->sr_entry = NULL;
1743 if ( sop->o_refresh_in_progress ) {
1750 ldap_pvt_thread_yield();
1754 if ( syncUUID_set_cnt > 0 ) {
1755 rs->sr_err = LDAP_SUCCESS;
1756 rs->sr_rspoid = LDAP_SYNC_INFO;
1757 rs->sr_ctrls = NULL;
1758 slap_send_syncinfo( sop, rs, LDAP_TAG_SYNC_ID_SET,
1759 NULL, 0, syncUUID_set, 0 );
1760 ber_bvarray_free_x( syncUUID_set, sop->o_tmpmemctx );
1761 syncUUID_set_cnt = 0;
1767 if (!IS_PSEARCH && !IS_POST_SEARCH) {
1768 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1769 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1770 struct berval cookie;
1771 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1772 sop->o_sync_state.sid, sop->o_sync_state.rid );
1774 if ( sync_send_present_mode ) {
1775 rs->sr_err = LDAP_SUCCESS;
1776 rs->sr_rspoid = LDAP_SYNC_INFO;
1777 rs->sr_ctrls = NULL;
1778 slap_send_syncinfo( sop, rs,
1779 LDAP_TAG_SYNC_REFRESH_PRESENT, &cookie, 1, NULL, 0 );
1782 if ( !no_sync_state_change ) {
1784 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1785 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1788 if ( ps_list->o_sync_slog_size > 0 ) {
1789 if ( ps_list->o_sync_state.sid ==
1790 sop->o_sync_state.sid )
1799 rs->sr_err = LDAP_SUCCESS;
1800 rs->sr_rspoid = NULL;
1801 rs->sr_ctrls = NULL;
1802 slap_send_session_log( op, ps_list, rs );
1804 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1807 rs->sr_err = LDAP_SUCCESS;
1808 rs->sr_rspoid = LDAP_SYNC_INFO;
1809 rs->sr_ctrls = NULL;
1810 slap_send_syncinfo( sop, rs,
1811 LDAP_TAG_SYNC_REFRESH_DELETE, &cookie, 1, NULL, 0 );
1814 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1817 /* refreshOnly mode */
1818 struct berval cookie;
1819 slap_compose_sync_cookie( sop, &cookie, search_context_csn,
1820 sop->o_sync_state.sid, sop->o_sync_state.rid );
1822 if ( sync_send_present_mode ) {
1823 slap_build_sync_done_ctrl( sop, rs, ctrls,
1824 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1827 if ( !no_sync_state_change ) {
1829 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1830 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1833 if ( ps_list->o_sync_slog_size > 0 ) {
1834 if ( ps_list->o_sync_state.sid ==
1835 sop->o_sync_state.sid ) {
1843 slap_send_session_log( op, ps_list, rs );
1845 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1848 slap_build_sync_done_ctrl( sop, rs, ctrls,
1849 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_DELETES );
1852 rs->sr_ctrls = ctrls;
1853 rs->sr_ref = rs->sr_v2ref;
1854 rs->sr_err = (rs->sr_v2ref == NULL)
1855 ? LDAP_SUCCESS : LDAP_REFERRAL;
1856 rs->sr_rspoid = NULL;
1857 send_ldap_result( sop, rs );
1858 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL ) {
1859 slap_sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1862 slap_sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1863 ctrls[num_ctrls] = NULL;
1864 if ( cookie.bv_val ) ch_free( cookie.bv_val );
1869 rs->sr_ctrls = NULL;
1870 rs->sr_ref = rs->sr_v2ref;
1871 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1872 rs->sr_rspoid = NULL;
1873 if ( get_pagedresults(sop) > SLAP_CONTROL_IGNORED ) {
1874 send_paged_response( sop, rs, NULL, 0 );
1876 send_ldap_result( sop, rs );
1882 if ( sop->o_refresh_in_progress ) {
1883 sop->o_refresh_in_progress = 0;
1887 rs->sr_err = LDAP_SUCCESS;
1891 if ( sop->o_psearch_finished ) {
1892 avl_free( sop->o_psearch_finished, ch_free );
1895 if( !IS_PSEARCH && e != NULL ) {
1896 /* free reader lock */
1897 #ifdef SLAP_ZONE_ALLOC
1898 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
1900 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1902 ber_bvfree( search_context_csn );
1906 LOCK_ID_FREE( bdb->bi_dbenv, locker );
1908 if( rs->sr_v2ref ) {
1909 ber_bvarray_free( rs->sr_v2ref );
1910 rs->sr_v2ref = NULL;
1912 if( realbase.bv_val ) ch_free( realbase.bv_val );
1918 static int base_candidate(
1923 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1924 e->e_nname.bv_val, (long) e->e_id, 0);
1931 /* Look for "objectClass Present" in this filter.
1932 * Also count depth of filter tree while we're at it.
1934 static int oc_filter(
1943 if( cur > *max ) *max = cur;
1945 switch( f->f_choice ) {
1946 case LDAP_FILTER_PRESENT:
1947 if (f->f_desc == slap_schema.si_ad_objectClass) {
1952 case LDAP_FILTER_AND:
1953 case LDAP_FILTER_OR:
1955 for ( f=f->f_and; f; f=f->f_next ) {
1956 (void) oc_filter(f, cur, max);
1966 static void search_stack_free( void *key, void *data )
1968 ber_memfree_x(data, NULL);
1971 static void *search_stack( Operation *op )
1973 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1976 if ( op->o_threadctx ) {
1977 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1980 ret = bdb->bi_search_stack;
1984 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1986 if ( op->o_threadctx ) {
1987 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1988 ret, search_stack_free );
1990 bdb->bi_search_stack = ret;
1996 static int search_candidates(
2005 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
2007 Filter f, rf, xf, nf;
2009 AttributeAssertion aa_ref;
2010 #ifdef BDB_SUBENTRIES
2012 AttributeAssertion aa_subentry;
2016 * This routine takes as input a filter (user-filter)
2017 * and rewrites it as follows:
2018 * (&(scope=DN)[(objectClass=subentry)]
2019 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
2022 Debug(LDAP_DEBUG_TRACE,
2023 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
2024 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
2026 xf.f_or = op->oq_search.rs_filter;
2027 xf.f_choice = LDAP_FILTER_OR;
2030 /* If the user's filter uses objectClass=*,
2031 * these clauses are redundant.
2033 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
2034 && !get_subentries_visibility(op)
2036 && !is_sync_protocol(op)
2039 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
2040 /* match referral objects */
2041 struct berval bv_ref = BER_BVC( "referral" );
2042 rf.f_choice = LDAP_FILTER_EQUALITY;
2044 rf.f_av_desc = slap_schema.si_ad_objectClass;
2045 rf.f_av_value = bv_ref;
2046 rf.f_next = xf.f_or;
2053 f.f_choice = LDAP_FILTER_AND;
2055 /* Dummy; we compute scope separately now */
2056 nf.f_choice = SLAPD_FILTER_COMPUTED;
2057 nf.f_result = LDAP_SUCCESS;
2058 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
2059 ? op->oq_search.rs_filter : &xf ;
2060 /* Filter depth increased again, adding dummy clause */
2063 #ifdef BDB_SUBENTRIES
2064 if( get_subentries_visibility( op ) ) {
2065 struct berval bv_subentry = BER_BVC( "subentry" );
2066 sf.f_choice = LDAP_FILTER_EQUALITY;
2067 sf.f_ava = &aa_subentry;
2068 sf.f_av_desc = slap_schema.si_ad_objectClass;
2069 sf.f_av_value = bv_subentry;
2070 sf.f_next = nf.f_next;
2075 /* Allocate IDL stack, plus 1 more for former tmp */
2076 if ( depth+1 > bdb->bi_search_stack_depth ) {
2077 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
2079 stack = search_stack( stackop );
2082 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
2083 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
2085 rc = bdb_dn2idl( op, e, ids, stack );
2088 if ( rc == LDAP_SUCCESS ) {
2089 rc = bdb_filter_candidates( op, &f, ids,
2090 stack, stack+BDB_IDL_UM_SIZE );
2093 if ( depth+1 > bdb->bi_search_stack_depth ) {
2098 Debug(LDAP_DEBUG_TRACE,
2099 "bdb_search_candidates: failed (rc=%d)\n",
2103 Debug(LDAP_DEBUG_TRACE,
2104 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
2106 (long) BDB_IDL_FIRST(ids),
2107 (long) BDB_IDL_LAST(ids) );
2114 parse_paged_cookie( Operation *op, SlapReply *rs )
2117 int rc = LDAP_SUCCESS;
2121 struct berval cookie = BER_BVNULL;
2122 PagedResultsState *ps = op->o_pagedresults_state;
2124 /* this function must be invoked only if the pagedResults
2125 * control has been detected, parsed and partially checked
2126 * by the frontend */
2127 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
2129 /* look for the appropriate ctrl structure */
2130 for ( c = op->o_ctrls; c[0] != NULL; c++ ) {
2131 if ( strcmp( c[0]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 )
2137 if ( c[0] == NULL ) {
2138 rs->sr_text = "missing pagedResults control";
2139 return LDAP_PROTOCOL_ERROR;
2142 /* Tested by frontend */
2143 assert( c[0]->ldctl_value.bv_len > 0 );
2145 /* Parse the control value
2146 * realSearchControlValue ::= SEQUENCE {
2147 * size INTEGER (0..maxInt),
2148 * -- requested page size from client
2149 * -- result set size estimate from server
2150 * cookie OCTET STRING
2153 ber = ber_init( &c[0]->ldctl_value );
2154 if ( ber == NULL ) {
2155 rs->sr_text = "internal error";
2159 tag = ber_scanf( ber, "{im}", &size, &cookie );
2161 /* Tested by frontend */
2162 assert( tag != LBER_ERROR );
2163 assert( size >= 0 );
2165 /* cookie decoding/checks deferred to backend... */
2166 if ( cookie.bv_len ) {
2167 PagedResultsCookie reqcookie;
2168 if( cookie.bv_len != sizeof( reqcookie ) ) {
2170 rs->sr_text = "paged results cookie is invalid";
2171 rc = LDAP_PROTOCOL_ERROR;
2175 AC_MEMCPY( &reqcookie, cookie.bv_val, sizeof( reqcookie ));
2177 if ( reqcookie > ps->ps_cookie ) {
2179 rs->sr_text = "paged results cookie is invalid";
2180 rc = LDAP_PROTOCOL_ERROR;
2183 } else if ( reqcookie < ps->ps_cookie ) {
2184 rs->sr_text = "paged results cookie is invalid or old";
2185 rc = LDAP_UNWILLING_TO_PERFORM;
2190 /* Initial request. Initialize state. */
2192 if ( op->o_conn->c_pagedresults_state.ps_cookie != 0 ) {
2193 /* There's another pagedResults control on the
2194 * same connection; reject new pagedResults controls
2195 * (allowed by RFC2696) */
2196 rs->sr_text = "paged results cookie unavailable; try later";
2197 rc = LDAP_UNWILLING_TO_PERFORM;
2206 (void)ber_free( ber, 1 );
2212 send_paged_response(
2218 LDAPControl ctrl, *ctrls[2];
2219 BerElementBuffer berbuf;
2220 BerElement *ber = (BerElement *)&berbuf;
2221 PagedResultsCookie respcookie;
2222 struct berval cookie;
2224 Debug(LDAP_DEBUG_ARGS,
2225 "send_paged_response: lastid=0x%08lx nentries=%d\n",
2226 lastid ? *lastid : 0, rs->sr_nentries, NULL );
2228 BER_BVZERO( &ctrl.ldctl_value );
2232 ber_init2( ber, NULL, LBER_USE_DER );
2235 respcookie = ( PagedResultsCookie )(*lastid);
2236 cookie.bv_len = sizeof( respcookie );
2237 cookie.bv_val = (char *)&respcookie;
2240 respcookie = ( PagedResultsCookie )0;
2241 BER_BVSTR( &cookie, "" );
2244 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
2245 op->o_conn->c_pagedresults_state.ps_count =
2246 ((PagedResultsState *)op->o_pagedresults_state)->ps_count + rs->sr_nentries;
2248 /* return size of 0 -- no estimate */
2249 ber_printf( ber, "{iO}", 0, &cookie );
2251 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
2255 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
2256 ctrls[0]->ldctl_iscritical = 0;
2258 rs->sr_ctrls = ctrls;
2259 rs->sr_err = LDAP_SUCCESS;
2260 send_ldap_result( op, rs );
2261 rs->sr_ctrls = NULL;
2264 (void) ber_free_buf( ber );
2268 bdb_pfid_cmp( const void *v_id1, const void *v_id2 )
2270 const ID *p1 = v_id1, *p2 = v_id2;
2275 bdb_id_dup( Operation *op, ID *id )
2278 new = ch_malloc( sizeof(ID) );