1 /* search.c - search operation */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2018 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(
39 static int parse_paged_cookie( Operation *op, SlapReply *rs );
41 static void send_paged_response(
47 /* Dereference aliases for a single alias entry. Return the final
48 * dereferenced entry on success, NULL on any failure.
50 static Entry * deref_base (
61 rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
62 rs->sr_text = "maximum deref depth exceeded";
65 /* Remember the last entry we looked at, so we can
70 if (MDB_IDL_N(tmp) >= op->o_bd->be_max_deref_depth) {
75 /* If this is part of a subtree or onelevel search,
76 * have we seen this ID before? If so, quit.
78 if ( visited && mdb_idl_insert( visited, e->e_id ) ) {
83 /* If we've seen this ID during this deref iteration,
86 if ( mdb_idl_insert( tmp, e->e_id ) ) {
87 rs->sr_err = LDAP_ALIAS_PROBLEM;
88 rs->sr_text = "circular alias";
93 /* If there was a problem getting the aliasedObjectName,
94 * get_alias_dn will have set the error status.
96 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
101 rs->sr_err = mdb_dn2entry( op, txn, NULL, &ndn, &e, NULL, 0 );
103 rs->sr_err = LDAP_ALIAS_PROBLEM;
104 rs->sr_text = "aliasedObject not found";
108 /* Free the previous entry, continue to work with the
109 * one we just retrieved.
111 mdb_entry_return( op, *matched );
113 /* We found a regular entry. Return this to the caller.
115 if (!is_entry_alias(e)) {
116 rs->sr_err = LDAP_SUCCESS;
124 /* Look for and dereference all aliases within the search scope.
125 * Requires "stack" to be able to hold 6 levels of DB_SIZE IDLs.
126 * Of course we're hardcoded to require a minimum of 8 UM_SIZE
127 * IDLs so this is never a problem.
129 static int search_aliases(
137 ID *aliases, *curscop, *visited, *newsubs, *oldsubs, *tmp;
138 ID cursora, ida, cursoro, ido;
140 struct berval bv_alias = BER_BVC( "alias" );
141 AttributeAssertion aa_alias = ATTRIBUTEASSERTION_INIT;
144 aliases = stack; /* IDL of all aliases in the database */
145 curscop = aliases + MDB_IDL_DB_SIZE; /* Aliases in the current scope */
146 visited = curscop + MDB_IDL_DB_SIZE; /* IDs we've seen in this search */
147 newsubs = visited + MDB_IDL_DB_SIZE; /* New subtrees we've added */
148 oldsubs = newsubs + MDB_IDL_DB_SIZE; /* Subtrees added previously */
149 tmp = oldsubs + MDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
151 af.f_choice = LDAP_FILTER_EQUALITY;
152 af.f_ava = &aa_alias;
153 af.f_av_desc = slap_schema.si_ad_objectClass;
154 af.f_av_value = bv_alias;
157 /* Find all aliases in database */
158 MDB_IDL_ZERO( aliases );
159 rs->sr_err = mdb_filter_candidates( op, isc->mt, &af, aliases,
161 if (rs->sr_err != LDAP_SUCCESS || MDB_IDL_IS_ZERO( aliases )) {
167 MDB_IDL_ZERO( visited );
168 MDB_IDL_ZERO( newsubs );
171 ido = mdb_idl_first( oldsubs, &cursoro );
174 /* Set curscop to only the aliases in the current scope. Start with
175 * all the aliases, then get the intersection with the scope.
177 rs->sr_err = mdb_idscope( op, isc->mt, e_id, aliases, curscop );
179 /* Dereference all of the aliases in the current scope. */
181 for (ida = mdb_idl_first(curscop, &cursora); ida != NOID;
182 ida = mdb_idl_next(curscop, &cursora))
184 rs->sr_err = mdb_id2entry(op, mci, ida, &a);
185 if (rs->sr_err != LDAP_SUCCESS) {
189 /* This should only happen if the curscop IDL has maxed out and
190 * turned into a range that spans IDs indiscriminately
192 if (!is_entry_alias(a)) {
193 mdb_entry_return(op, a);
197 /* Actually dereference the alias */
199 a = deref_base( op, rs, a, &matched, isc->mt,
202 /* If the target was not already in our current scopes,
203 * make note of it in the newsubs list.
207 mid.mval.mv_data = NULL;
208 if (op->ors_scope == LDAP_SCOPE_SUBTREE) {
210 /* if ID is a child of any of our current scopes,
211 * ignore it, it's already included.
213 if (mdb_idscopechk(op, isc))
216 if (mdb_id2l_insert(isc->scopes, &mid) == 0) {
217 mdb_idl_insert(newsubs, a->e_id);
219 skip: mdb_entry_return( op, a );
221 } else if (matched) {
222 /* Alias could not be dereferenced, or it deref'd to
223 * an ID we've already seen. Ignore it.
225 mdb_entry_return( op, matched );
230 /* If this is a OneLevel search, we're done; oldsubs only had one
231 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
233 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
235 ido = mdb_idl_next( oldsubs, &cursoro );
237 /* If we're done processing the old scopes, did we add any new
238 * scopes in this iteration? If so, go back and do those now.
241 if (MDB_IDL_IS_ZERO(newsubs)) break;
242 MDB_IDL_CPY(oldsubs, newsubs);
243 MDB_IDL_ZERO(newsubs);
245 ido = mdb_idl_first( oldsubs, &cursoro );
248 /* Find the entry corresponding to the next scope. If it can't
249 * be found, ignore it and move on. This should never happen;
250 * we should never see the ID of an entry that doesn't exist.
254 rs->sr_err = mdb_id2edata(op, mci, ido, &edata);
255 if ( rs->sr_err != MDB_SUCCESS ) {
264 /* Get the next ID from the DB. Used if the candidate list is
265 * a range and simple iteration hits missing entryIDs
268 mdb_get_nextid(MDB_cursor *mci, ID *cursor)
276 key.mv_size = sizeof(ID);
277 rc = mdb_cursor_get( mci, &key, NULL, MDB_SET_RANGE );
280 memcpy( cursor, key.mv_data, sizeof(ID));
284 static void scope_chunk_free( void *key, void *data )
287 for (p1 = data; p1; p1 = p2) {
288 p2 = p1[0].mval.mv_data;
289 ber_memfree_x(p1, NULL);
293 static ID2 *scope_chunk_get( Operation *op )
297 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
298 (void *)&ret, NULL );
300 ret = ch_malloc( MDB_IDL_UM_SIZE * sizeof( ID2 ));
302 void *r2 = ret[0].mval.mv_data;
303 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
304 r2, scope_chunk_free, NULL, NULL );
309 static void scope_chunk_ret( Operation *op, ID2 *scopes )
313 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
315 scopes[0].mval.mv_data = ret;
316 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
317 (void *)scopes, scope_chunk_free, NULL, NULL );
320 static void *search_stack( Operation *op );
322 typedef struct ww_ctx {
324 MDB_cursor *mcd; /* if set, save cursor context */
331 /* ITS#7904 if we get blocked while writing results to client,
332 * release the current reader txn and reacquire it after we
334 * Slight problem - if we're doing a scope-based walk (mdb_dn2id_walk)
335 * to return results, we need to remember the state of the mcd cursor.
336 * If the node that cursor was pointing to gets deleted while we're
337 * blocked, we may be unable to restore the cursor position. In that
338 * case return an LDAP_BUSY error - let the client know this search
339 * couldn't succeed, but might succeed on a retry.
342 mdb_rtxn_snap( Operation *op, ww_ctx *ww )
344 /* save cursor position and release read txn */
347 mdb_cursor_get( ww->mcd, &key, &data, MDB_GET_CURRENT );
348 memcpy( &ww->key, key.mv_data, sizeof(ID) );
349 ww->data.mv_size = data.mv_size;
350 ww->data.mv_data = op->o_tmpalloc( data.mv_size, op->o_tmpmemctx );
351 memcpy(ww->data.mv_data, data.mv_data, data.mv_size);
353 mdb_txn_reset( ww->txn );
358 mdb_writewait( Operation *op, slap_callback *sc )
360 ww_ctx *ww = sc->sc_private;
362 mdb_rtxn_snap( op, ww );
367 mdb_waitfixup( Operation *op, ww_ctx *ww, MDB_cursor *mci, MDB_cursor *mcd, IdScopes *isc )
372 mdb_txn_renew( ww->txn );
373 mdb_cursor_renew( ww->txn, mci );
374 mdb_cursor_renew( ww->txn, mcd );
376 key.mv_size = sizeof(ID);
377 if ( ww->mcd ) { /* scope-based search using dn2id_walk */
381 mdb_dn2id_wrestore( op, isc );
383 key.mv_data = &ww->key;
385 rc = mdb_cursor_get( mcd, &key, &data, MDB_GET_BOTH );
386 if ( rc == MDB_NOTFOUND ) {
388 rc = mdb_cursor_get( mcd, &key, &data, MDB_GET_BOTH_RANGE );
389 /* the loop will skip this node using NEXT_DUP but we want it
390 * sent, so go back one space first
392 if ( rc == MDB_SUCCESS )
393 mdb_cursor_get( mcd, &key, &data, MDB_PREV_DUP );
399 op->o_tmpfree( ww->data.mv_data, op->o_tmpmemctx );
400 ww->data.mv_data = NULL;
401 } else if ( isc->scopes[0].mid > 1 ) { /* candidate-based search */
403 for ( i=1; i<isc->scopes[0].mid; i++ ) {
404 if ( !isc->scopes[i].mval.mv_data )
406 key.mv_data = &isc->scopes[i].mid;
407 mdb_cursor_get( mcd, &key, &isc->scopes[i].mval, MDB_SET );
414 mdb_search( Operation *op, SlapReply *rs )
416 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
417 ID id, cursor, nsubs, ncand, cscope;
419 ID candidates[MDB_IDL_UM_SIZE];
420 ID iscopes[MDB_IDL_DB_SIZE];
423 Entry *e = NULL, *base = NULL;
424 Entry *matched = NULL;
425 AttributeName *attrs;
431 MDB_cursor *mci, *mcd;
433 slap_callback cb = { 0 };
435 mdb_op_info opinfo = {{{0}}}, *moi = &opinfo;
436 MDB_txn *ltid = NULL;
438 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(mdb_search) "\n", 0, 0, 0);
439 attrs = op->oq_search.rs_attrs;
441 manageDSAit = get_manageDSAit( op );
443 rs->sr_err = mdb_opinfo_get( op, mdb, 1, &moi );
448 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
454 rs->sr_err = mdb_cursor_open( ltid, mdb->mi_id2entry, &mci );
456 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
460 rs->sr_err = mdb_cursor_open( ltid, mdb->mi_dn2id, &mcd );
462 mdb_cursor_close( mci );
463 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
467 scopes = scope_chunk_get( op );
468 stack = search_stack( op );
472 isc.oscope = op->ors_scope;
475 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
476 MDB_IDL_ZERO(candidates);
479 /* get entry with reader lock */
480 rs->sr_err = mdb_dn2entry( op, ltid, mcd, &op->o_req_ndn, &e, &nsubs, 1 );
490 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
493 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
497 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
498 if ( matched && is_entry_alias( matched )) {
501 stub.bv_val = op->o_req_ndn.bv_val;
502 stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
503 e = deref_base( op, rs, matched, &matched, ltid,
506 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
508 mdb_entry_return(op, e);
512 } else if ( e && is_entry_alias( e )) {
513 e = deref_base( op, rs, e, &matched, ltid,
519 struct berval matched_dn = BER_BVNULL;
521 if ( matched != NULL ) {
522 BerVarray erefs = NULL;
524 /* return referral only if "disclose"
525 * is granted on the object */
526 if ( ! access_allowed( op, matched,
527 slap_schema.si_ad_entry,
528 NULL, ACL_DISCLOSE, NULL ) )
530 rs->sr_err = LDAP_NO_SUCH_OBJECT;
533 ber_dupbv( &matched_dn, &matched->e_name );
535 erefs = is_entry_referral( matched )
536 ? get_entry_referrals( op, matched )
538 if ( rs->sr_err == MDB_NOTFOUND )
539 rs->sr_err = LDAP_REFERRAL;
540 rs->sr_matched = matched_dn.bv_val;
543 mdb_entry_return(op, matched);
547 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
548 &op->o_req_dn, op->oq_search.rs_scope );
549 ber_bvarray_free( erefs );
553 rs->sr_ref = referral_rewrite( default_referral,
554 NULL, &op->o_req_dn, op->oq_search.rs_scope );
555 rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
558 send_ldap_result( op, rs );
561 ber_bvarray_free( rs->sr_ref );
564 if ( !BER_BVISNULL( &matched_dn ) ) {
565 ber_memfree( matched_dn.bv_val );
566 rs->sr_matched = NULL;
571 /* NOTE: __NEW__ "search" access is required
572 * on searchBase object */
573 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
574 NULL, ACL_SEARCH, NULL, &mask ) )
576 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
577 rs->sr_err = LDAP_NO_SUCH_OBJECT;
579 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
582 mdb_entry_return( op,e);
583 send_ldap_result( op, rs );
587 if ( !manageDSAit && is_entry_referral( e ) ) {
588 /* entry is a referral */
589 struct berval matched_dn = BER_BVNULL;
590 BerVarray erefs = NULL;
592 ber_dupbv( &matched_dn, &e->e_name );
593 erefs = get_entry_referrals( op, e );
595 rs->sr_err = LDAP_REFERRAL;
597 mdb_entry_return( op, e );
601 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
602 &op->o_req_dn, op->oq_search.rs_scope );
603 ber_bvarray_free( erefs );
606 rs->sr_text = "bad_referral object";
610 Debug( LDAP_DEBUG_TRACE,
611 LDAP_XSTRING(mdb_search) ": entry is referral\n",
614 rs->sr_matched = matched_dn.bv_val;
615 send_ldap_result( op, rs );
617 ber_bvarray_free( rs->sr_ref );
619 ber_memfree( matched_dn.bv_val );
620 rs->sr_matched = NULL;
624 if ( get_assert( op ) &&
625 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
627 rs->sr_err = LDAP_ASSERTION_FAILED;
628 mdb_entry_return( op,e);
629 send_ldap_result( op, rs );
633 /* compute it anyway; root does not use it */
634 stoptime = op->o_time + op->ors_tlimit;
640 /* select candidates */
641 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
642 rs->sr_err = base_candidate( op->o_bd, base, candidates );
646 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
649 key.mv_data = &base->e_id;
650 key.mv_size = sizeof( ID );
651 mdb_cursor_get( mcd, &key, &data, MDB_SET );
652 mdb_cursor_count( mcd, &nkids );
654 } else if ( !base->e_id ) {
655 /* we don't maintain nsubs for entryID 0.
656 * just grab entry count from id2entry stat
659 mdb_stat( ltid, mdb->mi_id2entry, &ms );
660 nsubs = ms.ms_entries;
662 MDB_IDL_ZERO( candidates );
664 scopes[1].mid = base->e_id;
665 scopes[1].mval.mv_data = NULL;
666 rs->sr_err = search_candidates( op, rs, base,
667 &isc, mci, candidates, stack );
668 ncand = MDB_IDL_N( candidates );
669 if ( !base->e_id || ncand == NOID ) {
670 /* grab entry count from id2entry stat
673 mdb_stat( ltid, mdb->mi_id2entry, &ms );
675 nsubs = ms.ms_entries;
677 ncand = ms.ms_entries;
681 /* start cursor at beginning of candidates.
685 if ( candidates[0] == 0 ) {
686 Debug( LDAP_DEBUG_TRACE,
687 LDAP_XSTRING(mdb_search) ": no candidates\n",
693 /* if not root and candidates exceed to-be-checked entries, abort */
694 if ( op->ors_limit /* isroot == FALSE */ &&
695 op->ors_limit->lms_s_unchecked != -1 &&
696 ncand > (unsigned) op->ors_limit->lms_s_unchecked )
698 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
699 send_ldap_result( op, rs );
700 rs->sr_err = LDAP_SUCCESS;
704 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
705 !op->ors_limit->lms_s_pr_hide )
712 /* If we're running in our own read txn */
713 if ( moi == &opinfo ) {
714 cb.sc_writewait = mdb_writewait;
715 cb.sc_private = &wwctx;
718 cb.sc_next = op->o_callback;
719 op->o_callback = &cb;
722 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
723 PagedResultsState *ps = op->o_pagedresults_state;
724 /* deferred cookie parsing */
725 rs->sr_err = parse_paged_cookie( op, rs );
726 if ( rs->sr_err != LDAP_SUCCESS ) {
727 send_ldap_result( op, rs );
731 cursor = (ID) ps->ps_cookie;
732 if ( cursor && ps->ps_size == 0 ) {
733 rs->sr_err = LDAP_SUCCESS;
734 rs->sr_text = "search abandoned by pagedResult size=0";
735 send_ldap_result( op, rs );
738 id = mdb_idl_first( candidates, &cursor );
740 Debug( LDAP_DEBUG_TRACE,
741 LDAP_XSTRING(mdb_search)
742 ": no paged results candidates\n",
744 send_paged_response( op, rs, &lastid, 0 );
746 rs->sr_err = LDAP_OTHER;
749 if ( id == (ID)ps->ps_cookie )
750 id = mdb_idl_next( candidates, &cursor );
751 nsubs = ncand; /* always bypass scope'd search */
754 if ( nsubs < ncand ) {
756 /* Do scope-based search */
758 /* if any alias scopes were set, save them */
759 if (scopes[0].mid > 1) {
761 for (cscope = 1; cscope <= scopes[0].mid; cscope++) {
762 /* Ignore the original base */
763 if (scopes[cscope].mid == base->e_id)
765 iscopes[cursor++] = scopes[cscope].mid;
767 iscopes[0] = scopes[0].mid - 1;
775 rc = mdb_dn2id_walk( op, &isc );
782 id = mdb_idl_first( candidates, &cursor );
792 /* check for abandon */
793 if ( op->o_abandon ) {
794 rs->sr_err = SLAPD_ABANDON;
795 send_ldap_result( op, rs );
799 /* mostly needed by internal searches,
800 * e.g. related to syncrepl, for whom
801 * abandon does not get set... */
802 if ( slapd_shutdown ) {
803 rs->sr_err = LDAP_UNAVAILABLE;
804 send_ldap_disconnect( op, rs );
808 /* check time limit */
809 if ( op->ors_tlimit != SLAP_NO_LIMIT
810 && slap_get_time() > stoptime )
812 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
813 rs->sr_ref = rs->sr_v2ref;
814 send_ldap_result( op, rs );
815 rs->sr_err = LDAP_SUCCESS;
820 if ( nsubs < ncand ) {
822 /* Is this entry in the candidate list? */
824 if (MDB_IDL_IS_RANGE( candidates )) {
825 if ( id >= MDB_IDL_RANGE_FIRST( candidates ) &&
826 id <= MDB_IDL_RANGE_LAST( candidates ))
829 i = mdb_idl_search( candidates, id );
830 if (i <= candidates[0] && candidates[i] == id )
838 /* Does this candidate actually satisfy the search scope?
842 switch( op->ors_scope ) {
843 case LDAP_SCOPE_BASE:
844 /* This is always true, yes? */
845 if ( id == base->e_id ) scopeok = 1;
848 #ifdef LDAP_SCOPE_CHILDREN
849 case LDAP_SCOPE_CHILDREN:
850 if ( id == base->e_id ) break;
853 case LDAP_SCOPE_SUBTREE:
854 if ( id == base->e_id ) {
859 case LDAP_SCOPE_ONELEVEL:
860 if ( id == base->e_id ) break;
863 rs->sr_err = mdb_idscopes( op, &isc );
864 if ( rs->sr_err == MDB_SUCCESS ) {
868 if ( rs->sr_err == MDB_NOTFOUND )
874 /* Not in scope, ignore it */
877 Debug( LDAP_DEBUG_TRACE,
878 LDAP_XSTRING(mdb_search)
879 ": %ld scope not okay\n",
885 if ( id == base->e_id ) {
890 rs->sr_err = mdb_id2edata( op, mci, id, &edata );
891 if ( rs->sr_err == MDB_NOTFOUND ) {
896 if( !MDB_IDL_IS_RANGE(candidates) ) {
897 /* only complain for non-range IDLs */
898 Debug( LDAP_DEBUG_TRACE,
899 LDAP_XSTRING(mdb_search)
900 ": candidate %ld not found\n",
903 /* get the next ID from the DB */
904 rs->sr_err = mdb_get_nextid( mci, &cursor );
905 if ( rs->sr_err == MDB_NOTFOUND ) {
909 rs->sr_err = LDAP_OTHER;
910 rs->sr_text = "internal error in get_nextid";
911 send_ldap_result( op, rs );
918 } else if ( rs->sr_err ) {
919 rs->sr_err = LDAP_OTHER;
920 rs->sr_text = "internal error in mdb_id2edata";
921 send_ldap_result( op, rs );
925 rs->sr_err = mdb_entry_decode( op, ltid, &edata, id, &e );
927 rs->sr_err = LDAP_OTHER;
928 rs->sr_text = "internal error in mdb_entry_decode";
929 send_ldap_result( op, rs );
933 e->e_name.bv_val = NULL;
934 e->e_nname.bv_val = NULL;
937 if ( is_entry_subentry( e ) ) {
938 if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
939 if(!get_subentries_visibility( op )) {
940 /* only subentries are visible */
944 } else if ( get_subentries( op ) &&
945 !get_subentries_visibility( op ))
947 /* only subentries are visible */
951 } else if ( get_subentries_visibility( op )) {
952 /* only subentries are visible */
956 /* aliases were already dereferenced in candidate list */
957 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
958 /* but if the search base is an alias, and we didn't
959 * deref it when finding, return it.
961 if ( is_entry_alias(e) &&
962 ((op->ors_deref & LDAP_DEREF_FINDING) || e != base ))
968 if ( !manageDSAit && is_entry_glue( e )) {
973 struct berval pdn, pndn;
977 /* child of base, just append RDNs to base->e_name */
978 if ( nsubs < ncand || isc.scopes[isc.nscope].mid == base->e_id ) {
980 pndn = base->e_nname;
982 mdb_id2name( op, ltid, &isc.mc, scopes[isc.nscope].mid, &pdn, &pndn );
984 e->e_name.bv_len = pdn.bv_len;
985 e->e_nname.bv_len = pndn.bv_len;
986 for (i=0; i<isc.numrdns; i++) {
987 e->e_name.bv_len += isc.rdns[i].bv_len + 1;
988 e->e_nname.bv_len += isc.nrdns[i].bv_len + 1;
990 e->e_name.bv_val = op->o_tmpalloc(e->e_name.bv_len + 1, op->o_tmpmemctx);
991 e->e_nname.bv_val = op->o_tmpalloc(e->e_nname.bv_len + 1, op->o_tmpmemctx);
992 d = e->e_name.bv_val;
993 n = e->e_nname.bv_val;
995 /* RDNs are in top-down order */
996 for (i=isc.numrdns-1; i>=0; i--) {
997 memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
998 d += isc.rdns[i].bv_len;
1000 memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
1001 n += isc.nrdns[i].bv_len;
1005 /* RDNs are in bottom-up order */
1006 for (i=0; i<isc.numrdns; i++) {
1007 memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
1008 d += isc.rdns[i].bv_len;
1010 memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
1011 n += isc.nrdns[i].bv_len;
1017 memcpy(d, pdn.bv_val, pdn.bv_len+1);
1018 memcpy(n, pndn.bv_val, pndn.bv_len+1);
1023 e->e_nname.bv_len--;
1025 if (pndn.bv_val != base->e_nname.bv_val) {
1026 op->o_tmpfree(pndn.bv_val, op->o_tmpmemctx);
1027 op->o_tmpfree(pdn.bv_val, op->o_tmpmemctx);
1032 * if it's a referral, add it to the list of referrals. only do
1033 * this for non-base searches, and don't check the filter
1034 * explicitly here since it's only a candidate anyway.
1036 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
1037 && is_entry_referral( e ) )
1039 BerVarray erefs = get_entry_referrals( op, e );
1040 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
1041 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
1042 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
1047 send_search_reference( op, rs );
1050 mdb_entry_return( op, e );
1051 rs->sr_entry = NULL;
1054 ber_bvarray_free( rs->sr_ref );
1055 ber_bvarray_free( erefs );
1061 /* if it matches the filter and scope, send it */
1062 rs->sr_err = test_filter( op, e, op->oq_search.rs_filter );
1064 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1065 /* check size limit */
1066 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1067 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
1069 mdb_entry_return( op, e );
1071 send_paged_response( op, rs, &lastid, tentries );
1079 rs->sr_attrs = op->oq_search.rs_attrs;
1080 rs->sr_operational_attrs = NULL;
1081 rs->sr_ctrls = NULL;
1083 RS_ASSERT( e->e_private != NULL );
1085 rs->sr_err = LDAP_SUCCESS;
1086 rs->sr_err = send_search_entry( op, rs );
1087 rs->sr_attrs = NULL;
1088 rs->sr_entry = NULL;
1090 mdb_entry_return( op, e );
1093 switch ( rs->sr_err ) {
1094 case LDAP_SUCCESS: /* entry sent ok */
1096 default: /* entry not sent */
1099 send_ldap_result( op, rs );
1101 case LDAP_UNAVAILABLE:
1102 case LDAP_SIZELIMIT_EXCEEDED:
1103 if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
1104 rs->sr_ref = rs->sr_v2ref;
1105 send_ldap_result( op, rs );
1106 rs->sr_err = LDAP_SUCCESS;
1109 rs->sr_err = LDAP_OTHER;
1116 Debug( LDAP_DEBUG_TRACE,
1117 LDAP_XSTRING(mdb_search)
1118 ": %ld does not match filter\n",
1123 if ( moi == &opinfo && !wwctx.flag && mdb->mi_rtxn_size ) {
1125 if ( wwctx.nentries >= mdb->mi_rtxn_size ) {
1128 mdb_env_info(mdb->mi_dbenv, &ei);
1129 if ( ei.me_last_txnid > mdb_txn_id( ltid ))
1130 mdb_rtxn_snap( op, &wwctx );
1134 rs->sr_err = mdb_waitfixup( op, &wwctx, mci, mcd, &isc );
1136 send_ldap_result( op, rs );
1143 mdb_entry_return( op, e );
1144 RS_ASSERT( rs->sr_entry == NULL );
1146 rs->sr_entry = NULL;
1149 if ( nsubs < ncand ) {
1150 int rc = mdb_dn2id_walk( op, &isc );
1153 /* We got to the end of a subtree. If there are any
1154 * alias scopes left, search them too.
1156 while (iscopes[0] && cscope < iscopes[0]) {
1158 isc.id = iscopes[cscope];
1160 mdb_entry_return( op, base );
1161 rs->sr_err = mdb_id2entry(op, mci, isc.id, &base);
1162 if ( !rs->sr_err ) {
1163 mdb_id2name( op, ltid, &isc.mc, isc.id, &base->e_name, &base->e_nname );
1165 if (isc.oscope == LDAP_SCOPE_ONELEVEL)
1166 isc.oscope = LDAP_SCOPE_BASE;
1167 rc = mdb_dn2id_walk( op, &isc );
1177 id = mdb_idl_next( candidates, &cursor );
1182 rs->sr_ctrls = NULL;
1183 rs->sr_ref = rs->sr_v2ref;
1184 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1185 rs->sr_rspoid = NULL;
1186 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1187 send_paged_response( op, rs, NULL, 0 );
1189 send_ldap_result( op, rs );
1192 rs->sr_err = LDAP_SUCCESS;
1195 if ( cb.sc_private ) {
1196 /* remove our writewait callback */
1197 slap_callback **scp = &op->o_callback;
1199 if ( *scp == &cb ) {
1201 cb.sc_private = NULL;
1206 mdb_cursor_close( mcd );
1207 mdb_cursor_close( mci );
1208 if ( moi == &opinfo ) {
1209 mdb_txn_reset( moi->moi_txn );
1210 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
1214 if( rs->sr_v2ref ) {
1215 ber_bvarray_free( rs->sr_v2ref );
1216 rs->sr_v2ref = NULL;
1219 mdb_entry_return( op, base );
1220 scope_chunk_ret( op, scopes );
1226 static int base_candidate(
1231 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1232 e->e_nname.bv_val, (long) e->e_id, 0);
1239 /* Look for "objectClass Present" in this filter.
1240 * Also count depth of filter tree while we're at it.
1242 static int oc_filter(
1249 assert( f != NULL );
1251 if( cur > *max ) *max = cur;
1253 switch( f->f_choice ) {
1254 case LDAP_FILTER_PRESENT:
1255 if (f->f_desc == slap_schema.si_ad_objectClass) {
1260 case LDAP_FILTER_AND:
1261 case LDAP_FILTER_OR:
1263 for ( f=f->f_and; f; f=f->f_next ) {
1264 (void) oc_filter(f, cur, max);
1274 static void search_stack_free( void *key, void *data )
1276 ber_memfree_x(data, NULL);
1279 static void *search_stack( Operation *op )
1281 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1284 if ( op->o_threadctx ) {
1285 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)search_stack,
1288 ret = mdb->mi_search_stack;
1292 ret = ch_malloc( mdb->mi_search_stack_depth * MDB_IDL_UM_SIZE
1294 if ( op->o_threadctx ) {
1295 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)search_stack,
1296 ret, search_stack_free, NULL, NULL );
1298 mdb->mi_search_stack = ret;
1304 static int search_candidates(
1313 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1315 Filter *f, rf, xf, nf, sf;
1316 AttributeAssertion aa_ref = ATTRIBUTEASSERTION_INIT;
1317 AttributeAssertion aa_subentry = ATTRIBUTEASSERTION_INIT;
1320 * This routine takes as input a filter (user-filter)
1321 * and rewrites it as follows:
1322 * (&(scope=DN)[(objectClass=subentry)]
1323 * (|[(objectClass=referral)](user-filter))
1326 Debug(LDAP_DEBUG_TRACE,
1327 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1328 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1330 f = op->oq_search.rs_filter;
1332 /* If the user's filter uses objectClass=*,
1333 * these clauses are redundant.
1335 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1336 && !get_subentries_visibility(op)) {
1337 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1338 /* match referral objects */
1339 struct berval bv_ref = BER_BVC( "referral" );
1340 rf.f_choice = LDAP_FILTER_EQUALITY;
1342 rf.f_av_desc = slap_schema.si_ad_objectClass;
1343 rf.f_av_value = bv_ref;
1346 xf.f_choice = LDAP_FILTER_OR;
1353 if( get_subentries_visibility( op ) ) {
1354 struct berval bv_subentry = BER_BVC( "subentry" );
1355 sf.f_choice = LDAP_FILTER_EQUALITY;
1356 sf.f_ava = &aa_subentry;
1357 sf.f_av_desc = slap_schema.si_ad_objectClass;
1358 sf.f_av_value = bv_subentry;
1360 nf.f_choice = LDAP_FILTER_AND;
1367 /* Allocate IDL stack, plus 1 more for former tmp */
1368 if ( depth+1 > mdb->mi_search_stack_depth ) {
1369 stack = ch_malloc( (depth + 1) * MDB_IDL_UM_SIZE * sizeof( ID ) );
1372 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1373 rc = search_aliases( op, rs, e->e_id, isc, mci, stack );
1378 if ( rc == LDAP_SUCCESS ) {
1379 rc = mdb_filter_candidates( op, isc->mt, f, ids,
1380 stack, stack+MDB_IDL_UM_SIZE );
1383 if ( depth+1 > mdb->mi_search_stack_depth ) {
1388 Debug(LDAP_DEBUG_TRACE,
1389 "mdb_search_candidates: failed (rc=%d)\n",
1393 Debug(LDAP_DEBUG_TRACE,
1394 "mdb_search_candidates: id=%ld first=%ld last=%ld\n",
1396 (long) MDB_IDL_FIRST(ids),
1397 (long) MDB_IDL_LAST(ids) );
1404 parse_paged_cookie( Operation *op, SlapReply *rs )
1406 int rc = LDAP_SUCCESS;
1407 PagedResultsState *ps = op->o_pagedresults_state;
1409 /* this function must be invoked only if the pagedResults
1410 * control has been detected, parsed and partially checked
1411 * by the frontend */
1412 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1414 /* cookie decoding/checks deferred to backend... */
1415 if ( ps->ps_cookieval.bv_len ) {
1416 PagedResultsCookie reqcookie;
1417 if( ps->ps_cookieval.bv_len != sizeof( reqcookie ) ) {
1419 rs->sr_text = "paged results cookie is invalid";
1420 rc = LDAP_PROTOCOL_ERROR;
1424 AC_MEMCPY( &reqcookie, ps->ps_cookieval.bv_val, sizeof( reqcookie ));
1426 if ( reqcookie > ps->ps_cookie ) {
1428 rs->sr_text = "paged results cookie is invalid";
1429 rc = LDAP_PROTOCOL_ERROR;
1432 } else if ( reqcookie < ps->ps_cookie ) {
1433 rs->sr_text = "paged results cookie is invalid or old";
1434 rc = LDAP_UNWILLING_TO_PERFORM;
1439 /* we're going to use ps_cookie */
1440 op->o_conn->c_pagedresults_state.ps_cookie = 0;
1449 send_paged_response(
1455 LDAPControl *ctrls[2];
1456 BerElementBuffer berbuf;
1457 BerElement *ber = (BerElement *)&berbuf;
1458 PagedResultsCookie respcookie;
1459 struct berval cookie;
1461 Debug(LDAP_DEBUG_ARGS,
1462 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1463 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1467 ber_init2( ber, NULL, LBER_USE_DER );
1470 respcookie = ( PagedResultsCookie )(*lastid);
1471 cookie.bv_len = sizeof( respcookie );
1472 cookie.bv_val = (char *)&respcookie;
1475 respcookie = ( PagedResultsCookie )0;
1476 BER_BVSTR( &cookie, "" );
1479 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1480 op->o_conn->c_pagedresults_state.ps_count =
1481 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1484 /* return size of 0 -- no estimate */
1485 ber_printf( ber, "{iO}", 0, &cookie );
1487 ctrls[0] = op->o_tmpalloc( sizeof(LDAPControl), op->o_tmpmemctx );
1488 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1492 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1493 ctrls[0]->ldctl_iscritical = 0;
1495 slap_add_ctrls( op, rs, ctrls );
1496 rs->sr_err = LDAP_SUCCESS;
1497 send_ldap_result( op, rs );
1500 (void) ber_free_buf( ber );