1 /* search.c - search operation */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2014 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;
145 aliases = stack; /* IDL of all aliases in the database */
146 curscop = aliases + MDB_IDL_DB_SIZE; /* Aliases in the current scope */
147 visited = curscop + MDB_IDL_DB_SIZE; /* IDs we've seen in this search */
148 newsubs = visited + MDB_IDL_DB_SIZE; /* New subtrees we've added */
149 oldsubs = newsubs + MDB_IDL_DB_SIZE; /* Subtrees added previously */
150 tmp = oldsubs + MDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
152 af.f_choice = LDAP_FILTER_EQUALITY;
153 af.f_ava = &aa_alias;
154 af.f_av_desc = slap_schema.si_ad_objectClass;
155 af.f_av_value = bv_alias;
158 /* Find all aliases in database */
159 MDB_IDL_ZERO( aliases );
160 rs->sr_err = mdb_filter_candidates( op, isc->mt, &af, aliases,
162 if (rs->sr_err != LDAP_SUCCESS || MDB_IDL_IS_ZERO( aliases )) {
168 MDB_IDL_ZERO( visited );
169 MDB_IDL_ZERO( newsubs );
172 ido = mdb_idl_first( oldsubs, &cursoro );
175 /* Set curscop to only the aliases in the current scope. Start with
176 * all the aliases, then get the intersection with the scope.
178 rs->sr_err = mdb_idscope( op, isc->mt, e_id, aliases, curscop );
180 /* Dereference all of the aliases in the current scope. */
182 for (ida = mdb_idl_first(curscop, &cursora); ida != NOID;
183 ida = mdb_idl_next(curscop, &cursora))
185 rs->sr_err = mdb_id2entry(op, mci, ida, &a);
186 if (rs->sr_err != LDAP_SUCCESS) {
190 /* This should only happen if the curscop IDL has maxed out and
191 * turned into a range that spans IDs indiscriminately
193 if (!is_entry_alias(a)) {
194 mdb_entry_return(op, a);
198 /* Actually dereference the alias */
200 a = deref_base( op, rs, a, &matched, isc->mt,
203 /* If the target was not already in our current scopes,
204 * make note of it in the newsubs list.
208 mid.mval.mv_data = NULL;
209 if (op->ors_scope == LDAP_SCOPE_SUBTREE) {
211 /* if ID is a child of any of our current scopes,
212 * ignore it, it's already included.
214 if (mdb_idscopechk(op, isc))
217 if (mdb_id2l_insert(isc->scopes, &mid) == 0) {
218 mdb_idl_insert(newsubs, a->e_id);
220 skip: mdb_entry_return( op, a );
222 } else if (matched) {
223 /* Alias could not be dereferenced, or it deref'd to
224 * an ID we've already seen. Ignore it.
226 mdb_entry_return( op, matched );
231 /* If this is a OneLevel search, we're done; oldsubs only had one
232 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
234 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
236 ido = mdb_idl_next( oldsubs, &cursoro );
238 /* If we're done processing the old scopes, did we add any new
239 * scopes in this iteration? If so, go back and do those now.
242 if (MDB_IDL_IS_ZERO(newsubs)) break;
243 MDB_IDL_CPY(oldsubs, newsubs);
244 MDB_IDL_ZERO(newsubs);
246 ido = mdb_idl_first( oldsubs, &cursoro );
249 /* Find the entry corresponding to the next scope. If it can't
250 * be found, ignore it and move on. This should never happen;
251 * we should never see the ID of an entry that doesn't exist.
255 rs->sr_err = mdb_id2edata(op, mci, ido, &edata);
256 if ( rs->sr_err != MDB_SUCCESS ) {
265 /* Get the next ID from the DB. Used if the candidate list is
266 * a range and simple iteration hits missing entryIDs
269 mdb_get_nextid(MDB_cursor *mci, ID *cursor)
277 key.mv_size = sizeof(ID);
278 rc = mdb_cursor_get( mci, &key, NULL, MDB_SET_RANGE );
281 memcpy( cursor, key.mv_data, sizeof(ID));
285 static void scope_chunk_free( void *key, void *data )
288 for (p1 = data; p1; p1 = p2) {
289 p2 = p1[0].mval.mv_data;
290 ber_memfree_x(p1, NULL);
294 static ID2 *scope_chunk_get( Operation *op )
296 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
299 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
300 (void *)&ret, NULL );
302 ret = ch_malloc( MDB_IDL_UM_SIZE * sizeof( ID2 ));
304 void *r2 = ret[0].mval.mv_data;
305 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
306 r2, scope_chunk_free, NULL, NULL );
311 static void scope_chunk_ret( Operation *op, ID2 *scopes )
313 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
316 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
318 scopes[0].mval.mv_data = ret;
319 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
320 (void *)scopes, scope_chunk_free, NULL, NULL );
323 static void *search_stack( Operation *op );
325 typedef struct ww_ctx {
327 MDB_cursor *mcd; /* if set, save cursor context */
333 /* ITS#7904 if we get blocked while writing results to client,
334 * release the current reader txn and reacquire it after we
336 * Slight problem - if we're doing a scope-based walk (mdb_dn2id_walk)
337 * to return results, we need to remember the state of the mcd cursor.
338 * If the node that cursor was pointing to gets deleted while we're
339 * blocked, we may be unable to restore the cursor position. In that
340 * case return an LDAP_BUSY error - let the client know this search
341 * couldn't succeed, but might succeed on a retry.
344 mdb_writewait( Operation *op, slap_callback *sc )
346 ww_ctx *ww = sc->sc_private;
350 mdb_cursor_get( ww->mcd, &key, &data, MDB_GET_CURRENT );
351 memcpy( &ww->key, key.mv_data, sizeof(ID) );
352 ww->data.mv_size = data.mv_size;
353 ww->data.mv_data = op->o_tmpalloc( data.mv_size, op->o_tmpmemctx );
354 memcpy(ww->data.mv_data, data.mv_data, data.mv_size);
356 mdb_txn_reset( ww->txn );
362 mdb_waitfixup( Operation *op, ww_ctx *ww, MDB_cursor *mci, MDB_cursor *mcd )
366 mdb_txn_renew( ww->txn );
367 mdb_cursor_renew( ww->txn, mci );
368 mdb_cursor_renew( ww->txn, mcd );
371 key.mv_size = sizeof(ID);
372 key.mv_data = &ww->key;
374 rc = mdb_cursor_get( mcd, &key, &data, MDB_GET_BOTH );
375 if ( rc == MDB_NOTFOUND ) {
377 rc = mdb_cursor_get( mcd, &key, &data, MDB_GET_BOTH_RANGE );
378 /* the loop will skip this node using NEXT_DUP but we want it
379 * sent, so go back one space first
381 if ( rc == MDB_SUCCESS )
382 mdb_cursor_get( mcd, &key, &data, MDB_PREV_DUP );
388 op->o_tmpfree( ww->data.mv_data, op->o_tmpmemctx );
389 ww->data.mv_data = NULL;
395 mdb_search( Operation *op, SlapReply *rs )
397 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
398 ID id, cursor, nsubs, ncand, cscope;
400 ID candidates[MDB_IDL_UM_SIZE];
401 ID iscopes[MDB_IDL_DB_SIZE];
404 Entry *e = NULL, *base = NULL;
405 Entry *matched = NULL;
406 AttributeName *attrs;
412 MDB_cursor *mci, *mcd;
414 slap_callback cb = { 0 };
416 mdb_op_info opinfo = {{{0}}}, *moi = &opinfo;
417 MDB_txn *ltid = NULL;
419 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(mdb_search) "\n", 0, 0, 0);
420 attrs = op->oq_search.rs_attrs;
422 manageDSAit = get_manageDSAit( op );
424 rs->sr_err = mdb_opinfo_get( op, mdb, 1, &moi );
429 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
435 rs->sr_err = mdb_cursor_open( ltid, mdb->mi_id2entry, &mci );
437 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
441 rs->sr_err = mdb_cursor_open( ltid, mdb->mi_dn2id, &mcd );
443 mdb_cursor_close( mci );
444 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
448 scopes = scope_chunk_get( op );
449 stack = search_stack( op );
453 isc.oscope = op->ors_scope;
456 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
457 MDB_IDL_ZERO(candidates);
460 /* get entry with reader lock */
461 rs->sr_err = mdb_dn2entry( op, ltid, mcd, &op->o_req_ndn, &e, &nsubs, 1 );
471 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
474 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
478 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
479 if ( matched && is_entry_alias( matched )) {
482 stub.bv_val = op->o_req_ndn.bv_val;
483 stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
484 e = deref_base( op, rs, matched, &matched, ltid,
487 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
489 mdb_entry_return(op, e);
493 } else if ( e && is_entry_alias( e )) {
494 e = deref_base( op, rs, e, &matched, ltid,
500 struct berval matched_dn = BER_BVNULL;
502 if ( matched != NULL ) {
503 BerVarray erefs = NULL;
505 /* return referral only if "disclose"
506 * is granted on the object */
507 if ( ! access_allowed( op, matched,
508 slap_schema.si_ad_entry,
509 NULL, ACL_DISCLOSE, NULL ) )
511 rs->sr_err = LDAP_NO_SUCH_OBJECT;
514 ber_dupbv( &matched_dn, &matched->e_name );
516 erefs = is_entry_referral( matched )
517 ? get_entry_referrals( op, matched )
519 if ( rs->sr_err == MDB_NOTFOUND )
520 rs->sr_err = LDAP_REFERRAL;
521 rs->sr_matched = matched_dn.bv_val;
524 mdb_entry_return(op, matched);
528 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
529 &op->o_req_dn, op->oq_search.rs_scope );
530 ber_bvarray_free( erefs );
534 rs->sr_ref = referral_rewrite( default_referral,
535 NULL, &op->o_req_dn, op->oq_search.rs_scope );
536 rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
539 send_ldap_result( op, rs );
542 ber_bvarray_free( rs->sr_ref );
545 if ( !BER_BVISNULL( &matched_dn ) ) {
546 ber_memfree( matched_dn.bv_val );
547 rs->sr_matched = NULL;
552 /* NOTE: __NEW__ "search" access is required
553 * on searchBase object */
554 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
555 NULL, ACL_SEARCH, NULL, &mask ) )
557 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
558 rs->sr_err = LDAP_NO_SUCH_OBJECT;
560 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
563 mdb_entry_return( op,e);
564 send_ldap_result( op, rs );
568 if ( !manageDSAit && is_entry_referral( e ) ) {
569 /* entry is a referral */
570 struct berval matched_dn = BER_BVNULL;
571 BerVarray erefs = NULL;
573 ber_dupbv( &matched_dn, &e->e_name );
574 erefs = get_entry_referrals( op, e );
576 rs->sr_err = LDAP_REFERRAL;
578 mdb_entry_return( op, e );
582 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
583 &op->o_req_dn, op->oq_search.rs_scope );
584 ber_bvarray_free( erefs );
587 rs->sr_text = "bad_referral object";
591 Debug( LDAP_DEBUG_TRACE,
592 LDAP_XSTRING(mdb_search) ": entry is referral\n",
595 rs->sr_matched = matched_dn.bv_val;
596 send_ldap_result( op, rs );
598 ber_bvarray_free( rs->sr_ref );
600 ber_memfree( matched_dn.bv_val );
601 rs->sr_matched = NULL;
605 if ( get_assert( op ) &&
606 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
608 rs->sr_err = LDAP_ASSERTION_FAILED;
609 mdb_entry_return( op,e);
610 send_ldap_result( op, rs );
614 /* compute it anyway; root does not use it */
615 stoptime = op->o_time + op->ors_tlimit;
621 /* select candidates */
622 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
623 rs->sr_err = base_candidate( op->o_bd, base, candidates );
627 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
630 key.mv_data = &base->e_id;
631 key.mv_size = sizeof( ID );
632 mdb_cursor_get( mcd, &key, &data, MDB_SET );
633 mdb_cursor_count( mcd, &nkids );
635 } else if ( !base->e_id ) {
636 /* we don't maintain nsubs for entryID 0.
637 * just grab entry count from id2entry stat
640 mdb_stat( ltid, mdb->mi_id2entry, &ms );
641 nsubs = ms.ms_entries;
643 MDB_IDL_ZERO( candidates );
645 scopes[1].mid = base->e_id;
646 scopes[1].mval.mv_data = NULL;
647 rs->sr_err = search_candidates( op, rs, base,
648 &isc, mci, candidates, stack );
649 ncand = MDB_IDL_N( candidates );
650 if ( !base->e_id || ncand == NOID ) {
651 /* grab entry count from id2entry stat
654 mdb_stat( ltid, mdb->mi_id2entry, &ms );
656 nsubs = ms.ms_entries;
658 ncand = ms.ms_entries;
662 /* start cursor at beginning of candidates.
666 if ( candidates[0] == 0 ) {
667 Debug( LDAP_DEBUG_TRACE,
668 LDAP_XSTRING(mdb_search) ": no candidates\n",
674 /* if not root and candidates exceed to-be-checked entries, abort */
675 if ( op->ors_limit /* isroot == FALSE */ &&
676 op->ors_limit->lms_s_unchecked != -1 &&
677 ncand > (unsigned) op->ors_limit->lms_s_unchecked )
679 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
680 send_ldap_result( op, rs );
681 rs->sr_err = LDAP_SUCCESS;
685 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
686 !op->ors_limit->lms_s_pr_hide )
692 /* If we're running in our own read txn */
693 if ( moi == &opinfo ) {
694 cb.sc_writewait = mdb_writewait;
695 cb.sc_private = &wwctx;
698 cb.sc_next = op->o_callback;
699 op->o_callback = &cb;
702 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
703 PagedResultsState *ps = op->o_pagedresults_state;
704 /* deferred cookie parsing */
705 rs->sr_err = parse_paged_cookie( op, rs );
706 if ( rs->sr_err != LDAP_SUCCESS ) {
707 send_ldap_result( op, rs );
711 cursor = (ID) ps->ps_cookie;
712 if ( cursor && ps->ps_size == 0 ) {
713 rs->sr_err = LDAP_SUCCESS;
714 rs->sr_text = "search abandoned by pagedResult size=0";
715 send_ldap_result( op, rs );
718 id = mdb_idl_first( candidates, &cursor );
720 Debug( LDAP_DEBUG_TRACE,
721 LDAP_XSTRING(mdb_search)
722 ": no paged results candidates\n",
724 send_paged_response( op, rs, &lastid, 0 );
726 rs->sr_err = LDAP_OTHER;
729 if ( id == (ID)ps->ps_cookie )
730 id = mdb_idl_next( candidates, &cursor );
731 nsubs = ncand; /* always bypass scope'd search */
734 if ( nsubs < ncand ) {
736 /* Do scope-based search */
738 /* if any alias scopes were set, save them */
739 if (scopes[0].mid > 1) {
741 for (cscope = 1; cscope <= scopes[0].mid; cscope++) {
742 /* Ignore the original base */
743 if (scopes[cscope].mid == base->e_id)
745 iscopes[cursor++] = scopes[cscope].mid;
747 iscopes[0] = scopes[0].mid - 1;
755 rc = mdb_dn2id_walk( op, &isc );
762 id = mdb_idl_first( candidates, &cursor );
772 /* check for abandon */
773 if ( op->o_abandon ) {
774 rs->sr_err = SLAPD_ABANDON;
775 send_ldap_result( op, rs );
779 /* mostly needed by internal searches,
780 * e.g. related to syncrepl, for whom
781 * abandon does not get set... */
782 if ( slapd_shutdown ) {
783 rs->sr_err = LDAP_UNAVAILABLE;
784 send_ldap_disconnect( op, rs );
788 /* check time limit */
789 if ( op->ors_tlimit != SLAP_NO_LIMIT
790 && slap_get_time() > stoptime )
792 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
793 rs->sr_ref = rs->sr_v2ref;
794 send_ldap_result( op, rs );
795 rs->sr_err = LDAP_SUCCESS;
800 if ( nsubs < ncand ) {
802 /* Is this entry in the candidate list? */
804 if (MDB_IDL_IS_RANGE( candidates )) {
805 if ( id >= MDB_IDL_RANGE_FIRST( candidates ) &&
806 id <= MDB_IDL_RANGE_LAST( candidates ))
809 i = mdb_idl_search( candidates, id );
810 if ( candidates[i] == id )
818 /* Does this candidate actually satisfy the search scope?
822 switch( op->ors_scope ) {
823 case LDAP_SCOPE_BASE:
824 /* This is always true, yes? */
825 if ( id == base->e_id ) scopeok = 1;
828 #ifdef LDAP_SCOPE_CHILDREN
829 case LDAP_SCOPE_CHILDREN:
830 if ( id == base->e_id ) break;
833 case LDAP_SCOPE_SUBTREE:
834 if ( id == base->e_id ) {
839 case LDAP_SCOPE_ONELEVEL:
842 rs->sr_err = mdb_idscopes( op, &isc );
843 if ( rs->sr_err == MDB_SUCCESS ) {
847 if ( rs->sr_err == MDB_NOTFOUND )
853 /* Not in scope, ignore it */
856 Debug( LDAP_DEBUG_TRACE,
857 LDAP_XSTRING(mdb_search)
858 ": %ld scope not okay\n",
864 if ( id == base->e_id ) {
869 rs->sr_err = mdb_id2edata( op, mci, id, &edata );
870 if ( rs->sr_err == MDB_NOTFOUND ) {
875 if( !MDB_IDL_IS_RANGE(candidates) ) {
876 /* only complain for non-range IDLs */
877 Debug( LDAP_DEBUG_TRACE,
878 LDAP_XSTRING(mdb_search)
879 ": candidate %ld not found\n",
882 /* get the next ID from the DB */
883 rs->sr_err = mdb_get_nextid( mci, &cursor );
884 if ( rs->sr_err == MDB_NOTFOUND ) {
888 rs->sr_err = LDAP_OTHER;
889 rs->sr_text = "internal error in get_nextid";
890 send_ldap_result( op, rs );
897 } else if ( rs->sr_err ) {
898 rs->sr_err = LDAP_OTHER;
899 rs->sr_text = "internal error in mdb_id2edata";
900 send_ldap_result( op, rs );
904 rs->sr_err = mdb_entry_decode( op, ltid, &edata, &e );
906 rs->sr_err = LDAP_OTHER;
907 rs->sr_text = "internal error in mdb_entry_decode";
908 send_ldap_result( op, rs );
912 e->e_name.bv_val = NULL;
913 e->e_nname.bv_val = NULL;
916 if ( is_entry_subentry( e ) ) {
917 if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
918 if(!get_subentries_visibility( op )) {
919 /* only subentries are visible */
923 } else if ( get_subentries( op ) &&
924 !get_subentries_visibility( op ))
926 /* only subentries are visible */
930 } else if ( get_subentries_visibility( op )) {
931 /* only subentries are visible */
935 /* aliases were already dereferenced in candidate list */
936 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
937 /* but if the search base is an alias, and we didn't
938 * deref it when finding, return it.
940 if ( is_entry_alias(e) &&
941 ((op->ors_deref & LDAP_DEREF_FINDING) || e != base ))
947 if ( !manageDSAit && is_entry_glue( e )) {
952 struct berval pdn, pndn;
956 /* child of base, just append RDNs to base->e_name */
957 if ( nsubs < ncand || isc.scopes[isc.nscope].mid == base->e_id ) {
959 pndn = base->e_nname;
961 mdb_id2name( op, ltid, &isc.mc, scopes[isc.nscope].mid, &pdn, &pndn );
963 e->e_name.bv_len = pdn.bv_len;
964 e->e_nname.bv_len = pndn.bv_len;
965 for (i=0; i<isc.numrdns; i++) {
966 e->e_name.bv_len += isc.rdns[i].bv_len + 1;
967 e->e_nname.bv_len += isc.nrdns[i].bv_len + 1;
969 e->e_name.bv_val = op->o_tmpalloc(e->e_name.bv_len + 1, op->o_tmpmemctx);
970 e->e_nname.bv_val = op->o_tmpalloc(e->e_nname.bv_len + 1, op->o_tmpmemctx);
971 d = e->e_name.bv_val;
972 n = e->e_nname.bv_val;
974 /* RDNs are in top-down order */
975 for (i=isc.numrdns-1; i>=0; i--) {
976 memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
977 d += isc.rdns[i].bv_len;
979 memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
980 n += isc.nrdns[i].bv_len;
984 /* RDNs are in bottom-up order */
985 for (i=0; i<isc.numrdns; i++) {
986 memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
987 d += isc.rdns[i].bv_len;
989 memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
990 n += isc.nrdns[i].bv_len;
996 memcpy(d, pdn.bv_val, pdn.bv_len+1);
997 memcpy(n, pndn.bv_val, pndn.bv_len+1);
1002 e->e_nname.bv_len--;
1004 if (pndn.bv_val != base->e_nname.bv_val) {
1005 op->o_tmpfree(pndn.bv_val, op->o_tmpmemctx);
1006 op->o_tmpfree(pdn.bv_val, op->o_tmpmemctx);
1011 * if it's a referral, add it to the list of referrals. only do
1012 * this for non-base searches, and don't check the filter
1013 * explicitly here since it's only a candidate anyway.
1015 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
1016 && is_entry_referral( e ) )
1018 BerVarray erefs = get_entry_referrals( op, e );
1019 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
1020 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
1021 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
1026 send_search_reference( op, rs );
1029 mdb_entry_return( op, e );
1030 rs->sr_entry = NULL;
1033 ber_bvarray_free( rs->sr_ref );
1034 ber_bvarray_free( erefs );
1038 rs->sr_err = mdb_waitfixup( op, &wwctx, mci, mcd );
1040 send_ldap_result( op, rs );
1048 /* if it matches the filter and scope, send it */
1049 rs->sr_err = test_filter( op, e, op->oq_search.rs_filter );
1051 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1052 /* check size limit */
1053 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1054 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
1055 mdb_entry_return( op, e );
1057 send_paged_response( op, rs, &lastid, tentries );
1065 rs->sr_attrs = op->oq_search.rs_attrs;
1066 rs->sr_operational_attrs = NULL;
1067 rs->sr_ctrls = NULL;
1069 RS_ASSERT( e->e_private != NULL );
1071 rs->sr_err = LDAP_SUCCESS;
1072 rs->sr_err = send_search_entry( op, rs );
1073 rs->sr_attrs = NULL;
1074 rs->sr_entry = NULL;
1076 mdb_entry_return( op, e );
1079 switch ( rs->sr_err ) {
1080 case LDAP_SUCCESS: /* entry sent ok */
1082 default: /* entry not sent */
1085 send_ldap_result( op, rs );
1087 case LDAP_UNAVAILABLE:
1088 case LDAP_SIZELIMIT_EXCEEDED:
1089 if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
1090 rs->sr_ref = rs->sr_v2ref;
1091 send_ldap_result( op, rs );
1092 rs->sr_err = LDAP_SUCCESS;
1095 rs->sr_err = LDAP_OTHER;
1100 rs->sr_err = mdb_waitfixup( op, &wwctx, mci, mcd );
1102 send_ldap_result( op, rs );
1109 Debug( LDAP_DEBUG_TRACE,
1110 LDAP_XSTRING(mdb_search)
1111 ": %ld does not match filter\n",
1118 mdb_entry_return( op, e );
1119 RS_ASSERT( rs->sr_entry == NULL );
1121 rs->sr_entry = NULL;
1124 if ( nsubs < ncand ) {
1125 int rc = mdb_dn2id_walk( op, &isc );
1128 /* We got to the end of a subtree. If there are any
1129 * alias scopes left, search them too.
1131 while (iscopes[0] && cscope < iscopes[0]) {
1133 isc.id = iscopes[cscope];
1135 mdb_entry_return( op, base );
1136 rs->sr_err = mdb_id2entry(op, mci, isc.id, &base);
1137 if ( !rs->sr_err ) {
1138 mdb_id2name( op, ltid, &isc.mc, isc.id, &base->e_name, &base->e_nname );
1140 if (isc.oscope == LDAP_SCOPE_ONELEVEL)
1141 isc.oscope = LDAP_SCOPE_BASE;
1142 rc = mdb_dn2id_walk( op, &isc );
1152 id = mdb_idl_next( candidates, &cursor );
1157 rs->sr_ctrls = NULL;
1158 rs->sr_ref = rs->sr_v2ref;
1159 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1160 rs->sr_rspoid = NULL;
1161 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1162 send_paged_response( op, rs, NULL, 0 );
1164 send_ldap_result( op, rs );
1167 rs->sr_err = LDAP_SUCCESS;
1170 if ( cb.sc_private ) {
1171 /* remove our writewait callback */
1172 slap_callback **scp = &op->o_callback;
1174 if ( *scp == &cb ) {
1176 cb.sc_private = NULL;
1181 mdb_cursor_close( mcd );
1182 mdb_cursor_close( mci );
1183 if ( moi == &opinfo ) {
1184 mdb_txn_reset( moi->moi_txn );
1185 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
1189 if( rs->sr_v2ref ) {
1190 ber_bvarray_free( rs->sr_v2ref );
1191 rs->sr_v2ref = NULL;
1194 mdb_entry_return( op, base );
1195 scope_chunk_ret( op, scopes );
1201 static int base_candidate(
1206 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1207 e->e_nname.bv_val, (long) e->e_id, 0);
1214 /* Look for "objectClass Present" in this filter.
1215 * Also count depth of filter tree while we're at it.
1217 static int oc_filter(
1224 assert( f != NULL );
1226 if( cur > *max ) *max = cur;
1228 switch( f->f_choice ) {
1229 case LDAP_FILTER_PRESENT:
1230 if (f->f_desc == slap_schema.si_ad_objectClass) {
1235 case LDAP_FILTER_AND:
1236 case LDAP_FILTER_OR:
1238 for ( f=f->f_and; f; f=f->f_next ) {
1239 (void) oc_filter(f, cur, max);
1249 static void search_stack_free( void *key, void *data )
1251 ber_memfree_x(data, NULL);
1254 static void *search_stack( Operation *op )
1256 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1259 if ( op->o_threadctx ) {
1260 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)search_stack,
1263 ret = mdb->mi_search_stack;
1267 ret = ch_malloc( mdb->mi_search_stack_depth * MDB_IDL_UM_SIZE
1269 if ( op->o_threadctx ) {
1270 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)search_stack,
1271 ret, search_stack_free, NULL, NULL );
1273 mdb->mi_search_stack = ret;
1279 static int search_candidates(
1288 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1290 Filter *f, rf, xf, nf, sf;
1291 AttributeAssertion aa_ref = ATTRIBUTEASSERTION_INIT;
1292 AttributeAssertion aa_subentry = ATTRIBUTEASSERTION_INIT;
1295 * This routine takes as input a filter (user-filter)
1296 * and rewrites it as follows:
1297 * (&(scope=DN)[(objectClass=subentry)]
1298 * (|[(objectClass=referral)](user-filter))
1301 Debug(LDAP_DEBUG_TRACE,
1302 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1303 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1305 f = op->oq_search.rs_filter;
1307 /* If the user's filter uses objectClass=*,
1308 * these clauses are redundant.
1310 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1311 && !get_subentries_visibility(op)) {
1312 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1313 /* match referral objects */
1314 struct berval bv_ref = BER_BVC( "referral" );
1315 rf.f_choice = LDAP_FILTER_EQUALITY;
1317 rf.f_av_desc = slap_schema.si_ad_objectClass;
1318 rf.f_av_value = bv_ref;
1321 xf.f_choice = LDAP_FILTER_OR;
1328 if( get_subentries_visibility( op ) ) {
1329 struct berval bv_subentry = BER_BVC( "subentry" );
1330 sf.f_choice = LDAP_FILTER_EQUALITY;
1331 sf.f_ava = &aa_subentry;
1332 sf.f_av_desc = slap_schema.si_ad_objectClass;
1333 sf.f_av_value = bv_subentry;
1335 nf.f_choice = LDAP_FILTER_AND;
1342 /* Allocate IDL stack, plus 1 more for former tmp */
1343 if ( depth+1 > mdb->mi_search_stack_depth ) {
1344 stack = ch_malloc( (depth + 1) * MDB_IDL_UM_SIZE * sizeof( ID ) );
1347 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1348 rc = search_aliases( op, rs, e->e_id, isc, mci, stack );
1353 if ( rc == LDAP_SUCCESS ) {
1354 rc = mdb_filter_candidates( op, isc->mt, f, ids,
1355 stack, stack+MDB_IDL_UM_SIZE );
1358 if ( depth+1 > mdb->mi_search_stack_depth ) {
1363 Debug(LDAP_DEBUG_TRACE,
1364 "mdb_search_candidates: failed (rc=%d)\n",
1368 Debug(LDAP_DEBUG_TRACE,
1369 "mdb_search_candidates: id=%ld first=%ld last=%ld\n",
1371 (long) MDB_IDL_FIRST(ids),
1372 (long) MDB_IDL_LAST(ids) );
1379 parse_paged_cookie( Operation *op, SlapReply *rs )
1381 int rc = LDAP_SUCCESS;
1382 PagedResultsState *ps = op->o_pagedresults_state;
1384 /* this function must be invoked only if the pagedResults
1385 * control has been detected, parsed and partially checked
1386 * by the frontend */
1387 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1389 /* cookie decoding/checks deferred to backend... */
1390 if ( ps->ps_cookieval.bv_len ) {
1391 PagedResultsCookie reqcookie;
1392 if( ps->ps_cookieval.bv_len != sizeof( reqcookie ) ) {
1394 rs->sr_text = "paged results cookie is invalid";
1395 rc = LDAP_PROTOCOL_ERROR;
1399 AC_MEMCPY( &reqcookie, ps->ps_cookieval.bv_val, sizeof( reqcookie ));
1401 if ( reqcookie > ps->ps_cookie ) {
1403 rs->sr_text = "paged results cookie is invalid";
1404 rc = LDAP_PROTOCOL_ERROR;
1407 } else if ( reqcookie < ps->ps_cookie ) {
1408 rs->sr_text = "paged results cookie is invalid or old";
1409 rc = LDAP_UNWILLING_TO_PERFORM;
1414 /* we're going to use ps_cookie */
1415 op->o_conn->c_pagedresults_state.ps_cookie = 0;
1424 send_paged_response(
1430 LDAPControl *ctrls[2];
1431 BerElementBuffer berbuf;
1432 BerElement *ber = (BerElement *)&berbuf;
1433 PagedResultsCookie respcookie;
1434 struct berval cookie;
1436 Debug(LDAP_DEBUG_ARGS,
1437 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1438 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1442 ber_init2( ber, NULL, LBER_USE_DER );
1445 respcookie = ( PagedResultsCookie )(*lastid);
1446 cookie.bv_len = sizeof( respcookie );
1447 cookie.bv_val = (char *)&respcookie;
1450 respcookie = ( PagedResultsCookie )0;
1451 BER_BVSTR( &cookie, "" );
1454 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1455 op->o_conn->c_pagedresults_state.ps_count =
1456 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1459 /* return size of 0 -- no estimate */
1460 ber_printf( ber, "{iO}", 0, &cookie );
1462 ctrls[0] = op->o_tmpalloc( sizeof(LDAPControl), op->o_tmpmemctx );
1463 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1467 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1468 ctrls[0]->ldctl_iscritical = 0;
1470 slap_add_ctrls( op, rs, ctrls );
1471 rs->sr_err = LDAP_SUCCESS;
1472 send_ldap_result( op, rs );
1475 (void) ber_free_buf( ber );