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(
40 static int parse_paged_cookie( Operation *op, SlapReply *rs );
42 static void send_paged_response(
48 /* Dereference aliases for a single alias entry. Return the final
49 * dereferenced entry on success, NULL on any failure.
51 static Entry * deref_base (
62 rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
63 rs->sr_text = "maximum deref depth exceeded";
66 /* Remember the last entry we looked at, so we can
71 if (MDB_IDL_N(tmp) >= op->o_bd->be_max_deref_depth) {
76 /* If this is part of a subtree or onelevel search,
77 * have we seen this ID before? If so, quit.
79 if ( visited && mdb_idl_insert( visited, e->e_id ) ) {
84 /* If we've seen this ID during this deref iteration,
87 if ( mdb_idl_insert( tmp, e->e_id ) ) {
88 rs->sr_err = LDAP_ALIAS_PROBLEM;
89 rs->sr_text = "circular alias";
94 /* If there was a problem getting the aliasedObjectName,
95 * get_alias_dn will have set the error status.
97 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
102 rs->sr_err = mdb_dn2entry( op, txn, NULL, &ndn, &e, NULL, 0 );
104 rs->sr_err = LDAP_ALIAS_PROBLEM;
105 rs->sr_text = "aliasedObject not found";
109 /* Free the previous entry, continue to work with the
110 * one we just retrieved.
112 mdb_entry_return( op, *matched );
114 /* We found a regular entry. Return this to the caller.
116 if (!is_entry_alias(e)) {
117 rs->sr_err = LDAP_SUCCESS;
125 /* Look for and dereference all aliases within the search scope.
126 * Requires "stack" to be able to hold 6 levels of DB_SIZE IDLs.
127 * Of course we're hardcoded to require a minimum of 8 UM_SIZE
128 * IDLs so this is never a problem.
130 static int search_aliases(
139 ID *aliases, *curscop, *visited, *newsubs, *oldsubs, *tmp;
140 ID cursora, ida, cursoro, ido;
142 struct berval bv_alias = BER_BVC( "alias" );
143 AttributeAssertion aa_alias = ATTRIBUTEASSERTION_INIT;
147 aliases = stack; /* IDL of all aliases in the database */
148 curscop = aliases + MDB_IDL_DB_SIZE; /* Aliases in the current scope */
149 visited = curscop + MDB_IDL_DB_SIZE; /* IDs we've seen in this search */
150 newsubs = visited + MDB_IDL_DB_SIZE; /* New subtrees we've added */
151 oldsubs = newsubs + MDB_IDL_DB_SIZE; /* Subtrees added previously */
152 tmp = oldsubs + MDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
154 af.f_choice = LDAP_FILTER_EQUALITY;
155 af.f_ava = &aa_alias;
156 af.f_av_desc = slap_schema.si_ad_objectClass;
157 af.f_av_value = bv_alias;
160 /* Find all aliases in database */
161 MDB_IDL_ZERO( aliases );
162 rs->sr_err = mdb_filter_candidates( op, txn, &af, aliases,
164 if (rs->sr_err != LDAP_SUCCESS || MDB_IDL_IS_ZERO( aliases )) {
170 MDB_IDL_ZERO( visited );
171 MDB_IDL_ZERO( newsubs );
174 ido = mdb_idl_first( oldsubs, &cursoro );
177 /* Set curscop to only the aliases in the current scope. Start with
178 * all the aliases, then get the intersection with the scope.
180 rs->sr_err = mdb_idscope( op, txn, e_id, aliases, curscop );
182 /* Dereference all of the aliases in the current scope. */
184 for (ida = mdb_idl_first(curscop, &cursora); ida != NOID;
185 ida = mdb_idl_next(curscop, &cursora))
187 rs->sr_err = mdb_id2entry(op, mci, ida, &a);
188 if (rs->sr_err != LDAP_SUCCESS) {
192 /* This should only happen if the curscop IDL has maxed out and
193 * turned into a range that spans IDs indiscriminately
195 if (!is_entry_alias(a)) {
196 mdb_entry_return(op, a);
200 /* Actually dereference the alias */
202 a = deref_base( op, rs, a, &matched, txn,
205 /* If the target was not already in our current scopes,
206 * make note of it in the newsubs list.
210 mid.mval.mv_data = NULL;
211 if (mdb_id2l_insert(scopes, &mid) == 0) {
212 mdb_idl_insert(newsubs, a->e_id);
214 mdb_entry_return( op, a );
216 } else if (matched) {
217 /* Alias could not be dereferenced, or it deref'd to
218 * an ID we've already seen. Ignore it.
220 mdb_entry_return( op, matched );
225 /* If this is a OneLevel search, we're done; oldsubs only had one
226 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
228 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
230 ido = mdb_idl_next( oldsubs, &cursoro );
232 /* If we're done processing the old scopes, did we add any new
233 * scopes in this iteration? If so, go back and do those now.
236 if (MDB_IDL_IS_ZERO(newsubs)) break;
237 MDB_IDL_CPY(oldsubs, newsubs);
238 MDB_IDL_ZERO(newsubs);
240 ido = mdb_idl_first( oldsubs, &cursoro );
243 /* Find the entry corresponding to the next scope. If it can't
244 * be found, ignore it and move on. This should never happen;
245 * we should never see the ID of an entry that doesn't exist.
249 rs->sr_err = mdb_id2edata(op, mci, ido, &edata);
250 if ( rs->sr_err != MDB_SUCCESS ) {
259 /* Get the next ID from the DB. Used if the candidate list is
260 * a range and simple iteration hits missing entryIDs
263 mdb_get_nextid(MDB_cursor *mci, ID *cursor)
271 key.mv_size = sizeof(ID);
272 rc = mdb_cursor_get( mci, &key, NULL, MDB_SET_RANGE );
275 memcpy( cursor, key.mv_data, sizeof(ID));
279 static void scope_chunk_free( void *key, void *data )
282 for (p1 = data; p1; p1 = p2) {
283 p2 = p1[0].mval.mv_data;
284 ber_memfree_x(p1, NULL);
288 static ID2 *scope_chunk_get( Operation *op )
290 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
293 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
294 (void *)&ret, NULL );
296 ret = ch_malloc( MDB_IDL_UM_SIZE * sizeof( ID2 ));
298 void *r2 = ret[0].mval.mv_data;
299 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
300 r2, scope_chunk_free, NULL, NULL );
305 static void scope_chunk_ret( Operation *op, ID2 *scopes )
307 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
310 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
312 scopes[0].mval.mv_data = ret;
313 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
314 (void *)scopes, scope_chunk_free, NULL, NULL );
317 static void *search_stack( Operation *op );
319 typedef struct ww_ctx {
325 mdb_writewait( Operation *op, slap_callback *sc )
327 ww_ctx *ww = sc->sc_private;
329 mdb_txn_reset( ww->txn );
335 mdb_search( Operation *op, SlapReply *rs )
337 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
338 ID id, cursor, nsubs, ncand, cscope;
340 ID candidates[MDB_IDL_UM_SIZE];
341 ID iscopes[MDB_IDL_DB_SIZE];
344 Entry *e = NULL, *base = NULL;
345 Entry *matched = NULL;
346 AttributeName *attrs;
352 MDB_cursor *mci, *mcd;
354 slap_callback cb = { 0 };
356 mdb_op_info opinfo = {{{0}}}, *moi = &opinfo;
357 MDB_txn *ltid = NULL;
359 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(mdb_search) "\n", 0, 0, 0);
360 attrs = op->oq_search.rs_attrs;
362 manageDSAit = get_manageDSAit( op );
364 rs->sr_err = mdb_opinfo_get( op, mdb, 1, &moi );
369 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
375 rs->sr_err = mdb_cursor_open( ltid, mdb->mi_id2entry, &mci );
377 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
381 rs->sr_err = mdb_cursor_open( ltid, mdb->mi_dn2id, &mcd );
383 mdb_cursor_close( mci );
384 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
388 scopes = scope_chunk_get( op );
389 stack = search_stack( op );
393 isc.oscope = op->ors_scope;
396 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
397 MDB_IDL_ZERO(candidates);
400 /* get entry with reader lock */
401 rs->sr_err = mdb_dn2entry( op, ltid, mcd, &op->o_req_ndn, &e, &nsubs, 1 );
411 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
414 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
418 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
419 if ( matched && is_entry_alias( matched )) {
422 stub.bv_val = op->o_req_ndn.bv_val;
423 stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
424 e = deref_base( op, rs, matched, &matched, ltid,
427 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
429 mdb_entry_return(op, e);
433 } else if ( e && is_entry_alias( e )) {
434 e = deref_base( op, rs, e, &matched, ltid,
440 struct berval matched_dn = BER_BVNULL;
442 if ( matched != NULL ) {
443 BerVarray erefs = NULL;
445 /* return referral only if "disclose"
446 * is granted on the object */
447 if ( ! access_allowed( op, matched,
448 slap_schema.si_ad_entry,
449 NULL, ACL_DISCLOSE, NULL ) )
451 rs->sr_err = LDAP_NO_SUCH_OBJECT;
454 ber_dupbv( &matched_dn, &matched->e_name );
456 erefs = is_entry_referral( matched )
457 ? get_entry_referrals( op, matched )
459 if ( rs->sr_err == MDB_NOTFOUND )
460 rs->sr_err = LDAP_REFERRAL;
461 rs->sr_matched = matched_dn.bv_val;
464 mdb_entry_return(op, matched);
468 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
469 &op->o_req_dn, op->oq_search.rs_scope );
470 ber_bvarray_free( erefs );
474 rs->sr_ref = referral_rewrite( default_referral,
475 NULL, &op->o_req_dn, op->oq_search.rs_scope );
476 rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
479 send_ldap_result( op, rs );
482 ber_bvarray_free( rs->sr_ref );
485 if ( !BER_BVISNULL( &matched_dn ) ) {
486 ber_memfree( matched_dn.bv_val );
487 rs->sr_matched = NULL;
492 /* NOTE: __NEW__ "search" access is required
493 * on searchBase object */
494 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
495 NULL, ACL_SEARCH, NULL, &mask ) )
497 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
498 rs->sr_err = LDAP_NO_SUCH_OBJECT;
500 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
503 mdb_entry_return( op,e);
504 send_ldap_result( op, rs );
508 if ( !manageDSAit && is_entry_referral( e ) ) {
509 /* entry is a referral */
510 struct berval matched_dn = BER_BVNULL;
511 BerVarray erefs = NULL;
513 ber_dupbv( &matched_dn, &e->e_name );
514 erefs = get_entry_referrals( op, e );
516 rs->sr_err = LDAP_REFERRAL;
518 mdb_entry_return( op, e );
522 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
523 &op->o_req_dn, op->oq_search.rs_scope );
524 ber_bvarray_free( erefs );
527 rs->sr_text = "bad_referral object";
531 Debug( LDAP_DEBUG_TRACE,
532 LDAP_XSTRING(mdb_search) ": entry is referral\n",
535 rs->sr_matched = matched_dn.bv_val;
536 send_ldap_result( op, rs );
538 ber_bvarray_free( rs->sr_ref );
540 ber_memfree( matched_dn.bv_val );
541 rs->sr_matched = NULL;
545 if ( get_assert( op ) &&
546 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
548 rs->sr_err = LDAP_ASSERTION_FAILED;
549 mdb_entry_return( op,e);
550 send_ldap_result( op, rs );
554 /* compute it anyway; root does not use it */
555 stoptime = op->o_time + op->ors_tlimit;
561 /* select candidates */
562 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
563 rs->sr_err = base_candidate( op->o_bd, base, candidates );
567 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
570 key.mv_data = &base->e_id;
571 key.mv_size = sizeof( ID );
572 mdb_cursor_get( mcd, &key, &data, MDB_SET );
573 mdb_cursor_count( mcd, &nkids );
575 } else if ( !base->e_id ) {
576 /* we don't maintain nsubs for entryID 0.
577 * just grab entry count from id2entry stat
580 mdb_stat( ltid, mdb->mi_id2entry, &ms );
581 nsubs = ms.ms_entries;
583 MDB_IDL_ZERO( candidates );
585 scopes[1].mid = base->e_id;
586 scopes[1].mval.mv_data = NULL;
587 rs->sr_err = search_candidates( op, rs, base,
588 ltid, mci, candidates, scopes, stack );
589 ncand = MDB_IDL_N( candidates );
590 if ( !base->e_id || ncand == NOID ) {
591 /* grab entry count from id2entry stat
594 mdb_stat( ltid, mdb->mi_id2entry, &ms );
596 nsubs = ms.ms_entries;
598 ncand = ms.ms_entries;
602 /* start cursor at beginning of candidates.
606 if ( candidates[0] == 0 ) {
607 Debug( LDAP_DEBUG_TRACE,
608 LDAP_XSTRING(mdb_search) ": no candidates\n",
614 /* if not root and candidates exceed to-be-checked entries, abort */
615 if ( op->ors_limit /* isroot == FALSE */ &&
616 op->ors_limit->lms_s_unchecked != -1 &&
617 ncand > (unsigned) op->ors_limit->lms_s_unchecked )
619 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
620 send_ldap_result( op, rs );
621 rs->sr_err = LDAP_SUCCESS;
625 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
626 !op->ors_limit->lms_s_pr_hide )
631 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
632 PagedResultsState *ps = op->o_pagedresults_state;
633 /* deferred cookie parsing */
634 rs->sr_err = parse_paged_cookie( op, rs );
635 if ( rs->sr_err != LDAP_SUCCESS ) {
636 send_ldap_result( op, rs );
640 cursor = (ID) ps->ps_cookie;
641 if ( cursor && ps->ps_size == 0 ) {
642 rs->sr_err = LDAP_SUCCESS;
643 rs->sr_text = "search abandoned by pagedResult size=0";
644 send_ldap_result( op, rs );
647 id = mdb_idl_first( candidates, &cursor );
649 Debug( LDAP_DEBUG_TRACE,
650 LDAP_XSTRING(mdb_search)
651 ": no paged results candidates\n",
653 send_paged_response( op, rs, &lastid, 0 );
655 rs->sr_err = LDAP_OTHER;
658 if ( id == (ID)ps->ps_cookie )
659 id = mdb_idl_next( candidates, &cursor );
660 nsubs = ncand; /* always bypass scope'd search */
663 if ( nsubs < ncand ) {
665 /* Do scope-based search */
667 /* if any alias scopes were set, save them */
668 if (scopes[0].mid > 1) {
670 for (cscope = 1; cscope <= scopes[0].mid; cscope++) {
671 /* Ignore the original base */
672 if (scopes[cscope].mid == base->e_id)
674 iscopes[cursor++] = scopes[cscope].mid;
676 iscopes[0] = scopes[0].mid - 1;
683 rc = mdb_dn2id_walk( op, &isc );
690 id = mdb_idl_first( candidates, &cursor );
693 cb.sc_writewait = mdb_writewait;
694 cb.sc_private = &wwctx;
697 cb.sc_next = op->o_callback;
698 op->o_callback = &cb;
707 /* check for abandon */
708 if ( op->o_abandon ) {
709 rs->sr_err = SLAPD_ABANDON;
710 send_ldap_result( op, rs );
714 /* mostly needed by internal searches,
715 * e.g. related to syncrepl, for whom
716 * abandon does not get set... */
717 if ( slapd_shutdown ) {
718 rs->sr_err = LDAP_UNAVAILABLE;
719 send_ldap_disconnect( op, rs );
723 /* check time limit */
724 if ( op->ors_tlimit != SLAP_NO_LIMIT
725 && slap_get_time() > stoptime )
727 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
728 rs->sr_ref = rs->sr_v2ref;
729 send_ldap_result( op, rs );
730 rs->sr_err = LDAP_SUCCESS;
735 if ( nsubs < ncand ) {
737 /* Is this entry in the candidate list? */
739 if (MDB_IDL_IS_RANGE( candidates )) {
740 if ( id >= MDB_IDL_RANGE_FIRST( candidates ) &&
741 id <= MDB_IDL_RANGE_LAST( candidates ))
744 i = mdb_idl_search( candidates, id );
745 if ( candidates[i] == id )
753 /* Does this candidate actually satisfy the search scope?
757 switch( op->ors_scope ) {
758 case LDAP_SCOPE_BASE:
759 /* This is always true, yes? */
760 if ( id == base->e_id ) scopeok = 1;
763 #ifdef LDAP_SCOPE_CHILDREN
764 case LDAP_SCOPE_CHILDREN:
765 if ( id == base->e_id ) break;
768 case LDAP_SCOPE_SUBTREE:
769 if ( id == base->e_id ) {
774 case LDAP_SCOPE_ONELEVEL:
777 rs->sr_err = mdb_idscopes( op, &isc );
778 if ( rs->sr_err == MDB_SUCCESS ) {
782 if ( rs->sr_err == MDB_NOTFOUND )
788 /* Not in scope, ignore it */
791 Debug( LDAP_DEBUG_TRACE,
792 LDAP_XSTRING(mdb_search)
793 ": %ld scope not okay\n",
799 if ( id == base->e_id ) {
804 rs->sr_err = mdb_id2edata( op, mci, id, &edata );
805 if ( rs->sr_err == MDB_NOTFOUND ) {
810 if( !MDB_IDL_IS_RANGE(candidates) ) {
811 /* only complain for non-range IDLs */
812 Debug( LDAP_DEBUG_TRACE,
813 LDAP_XSTRING(mdb_search)
814 ": candidate %ld not found\n",
817 /* get the next ID from the DB */
818 rs->sr_err = mdb_get_nextid( mci, &cursor );
819 if ( rs->sr_err == MDB_NOTFOUND ) {
823 rs->sr_err = LDAP_OTHER;
824 rs->sr_text = "internal error in get_nextid";
825 send_ldap_result( op, rs );
832 } else if ( rs->sr_err ) {
833 rs->sr_err = LDAP_OTHER;
834 rs->sr_text = "internal error in mdb_id2edata";
835 send_ldap_result( op, rs );
839 rs->sr_err = mdb_entry_decode( op, ltid, &edata, &e );
841 rs->sr_err = LDAP_OTHER;
842 rs->sr_text = "internal error in mdb_entry_decode";
843 send_ldap_result( op, rs );
847 e->e_name.bv_val = NULL;
848 e->e_nname.bv_val = NULL;
851 if ( is_entry_subentry( e ) ) {
852 if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
853 if(!get_subentries_visibility( op )) {
854 /* only subentries are visible */
858 } else if ( get_subentries( op ) &&
859 !get_subentries_visibility( op ))
861 /* only subentries are visible */
865 } else if ( get_subentries_visibility( op )) {
866 /* only subentries are visible */
870 /* aliases were already dereferenced in candidate list */
871 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
872 /* but if the search base is an alias, and we didn't
873 * deref it when finding, return it.
875 if ( is_entry_alias(e) &&
876 ((op->ors_deref & LDAP_DEREF_FINDING) || e != base ))
882 if ( !manageDSAit && is_entry_glue( e )) {
887 struct berval pdn, pndn;
891 /* child of base, just append RDNs to base->e_name */
892 if ( nsubs < ncand || isc.scopes[isc.nscope].mid == base->e_id ) {
894 pndn = base->e_nname;
896 mdb_id2name( op, ltid, &isc.mc, scopes[isc.nscope].mid, &pdn, &pndn );
898 e->e_name.bv_len = pdn.bv_len;
899 e->e_nname.bv_len = pndn.bv_len;
900 for (i=0; i<isc.numrdns; i++) {
901 e->e_name.bv_len += isc.rdns[i].bv_len + 1;
902 e->e_nname.bv_len += isc.nrdns[i].bv_len + 1;
904 e->e_name.bv_val = op->o_tmpalloc(e->e_name.bv_len + 1, op->o_tmpmemctx);
905 e->e_nname.bv_val = op->o_tmpalloc(e->e_nname.bv_len + 1, op->o_tmpmemctx);
906 d = e->e_name.bv_val;
907 n = e->e_nname.bv_val;
909 /* RDNs are in top-down order */
910 for (i=isc.numrdns-1; i>=0; i--) {
911 memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
912 d += isc.rdns[i].bv_len;
914 memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
915 n += isc.nrdns[i].bv_len;
919 /* RDNs are in bottom-up order */
920 for (i=0; i<isc.numrdns; i++) {
921 memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
922 d += isc.rdns[i].bv_len;
924 memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
925 n += isc.nrdns[i].bv_len;
931 memcpy(d, pdn.bv_val, pdn.bv_len+1);
932 memcpy(n, pndn.bv_val, pndn.bv_len+1);
939 if (pndn.bv_val != base->e_nname.bv_val) {
940 op->o_tmpfree(pndn.bv_val, op->o_tmpmemctx);
941 op->o_tmpfree(pdn.bv_val, op->o_tmpmemctx);
946 * if it's a referral, add it to the list of referrals. only do
947 * this for non-base searches, and don't check the filter
948 * explicitly here since it's only a candidate anyway.
950 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
951 && is_entry_referral( e ) )
953 BerVarray erefs = get_entry_referrals( op, e );
954 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
955 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
956 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
961 send_search_reference( op, rs );
964 mdb_txn_renew( ltid );
965 mdb_cursor_renew( mci );
966 mdb_cursor_renew( mcd );
969 mdb_entry_return( op, e );
973 ber_bvarray_free( rs->sr_ref );
974 ber_bvarray_free( erefs );
980 /* if it matches the filter and scope, send it */
981 rs->sr_err = test_filter( op, e, op->oq_search.rs_filter );
983 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
984 /* check size limit */
985 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
986 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
987 mdb_entry_return( op, e );
989 send_paged_response( op, rs, &lastid, tentries );
997 rs->sr_attrs = op->oq_search.rs_attrs;
998 rs->sr_operational_attrs = NULL;
1001 RS_ASSERT( e->e_private != NULL );
1003 rs->sr_err = LDAP_SUCCESS;
1004 rs->sr_err = send_search_entry( op, rs );
1007 mdb_txn_renew( ltid );
1008 mdb_cursor_renew( mci );
1009 mdb_cursor_renew( mcd );
1011 rs->sr_attrs = NULL;
1012 rs->sr_entry = NULL;
1014 mdb_entry_return( op, e );
1017 switch ( rs->sr_err ) {
1018 case LDAP_SUCCESS: /* entry sent ok */
1020 default: /* entry not sent */
1023 send_ldap_result( op, rs );
1025 case LDAP_UNAVAILABLE:
1026 case LDAP_SIZELIMIT_EXCEEDED:
1027 if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
1028 rs->sr_ref = rs->sr_v2ref;
1029 send_ldap_result( op, rs );
1030 rs->sr_err = LDAP_SUCCESS;
1033 rs->sr_err = LDAP_OTHER;
1040 Debug( LDAP_DEBUG_TRACE,
1041 LDAP_XSTRING(mdb_search)
1042 ": %ld does not match filter\n",
1049 mdb_entry_return( op, e );
1050 RS_ASSERT( rs->sr_entry == NULL );
1052 rs->sr_entry = NULL;
1055 if ( nsubs < ncand ) {
1056 int rc = mdb_dn2id_walk( op, &isc );
1059 /* We got to the end of a subtree. If there are any
1060 * alias scopes left, search them too.
1062 while (iscopes[0] && cscope < iscopes[0]) {
1064 isc.id = iscopes[cscope];
1066 mdb_entry_return( op, base );
1067 rs->sr_err = mdb_id2entry(op, mci, isc.id, &base);
1068 if ( !rs->sr_err ) {
1069 mdb_id2name( op, ltid, &isc.mc, isc.id, &base->e_name, &base->e_nname );
1071 if (isc.oscope == LDAP_SCOPE_ONELEVEL)
1072 isc.oscope = LDAP_SCOPE_BASE;
1073 rc = mdb_dn2id_walk( op, &isc );
1083 id = mdb_idl_next( candidates, &cursor );
1086 /* remove our writewait callback */
1088 slap_callback **scp = &op->o_callback;
1090 if ( *scp == &cb ) {
1092 cb.sc_private = NULL;
1099 rs->sr_ctrls = NULL;
1100 rs->sr_ref = rs->sr_v2ref;
1101 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1102 rs->sr_rspoid = NULL;
1103 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1104 send_paged_response( op, rs, NULL, 0 );
1106 send_ldap_result( op, rs );
1109 rs->sr_err = LDAP_SUCCESS;
1112 if ( cb.sc_private ) {
1113 /* remove our writewait callback */
1114 slap_callback **scp = &op->o_callback;
1116 if ( *scp == &cb ) {
1118 cb.sc_private = NULL;
1123 mdb_cursor_close( mcd );
1124 mdb_cursor_close( mci );
1125 if ( moi == &opinfo ) {
1126 mdb_txn_reset( moi->moi_txn );
1127 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
1131 if( rs->sr_v2ref ) {
1132 ber_bvarray_free( rs->sr_v2ref );
1133 rs->sr_v2ref = NULL;
1136 mdb_entry_return( op,base);
1137 scope_chunk_ret( op, scopes );
1143 static int base_candidate(
1148 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1149 e->e_nname.bv_val, (long) e->e_id, 0);
1156 /* Look for "objectClass Present" in this filter.
1157 * Also count depth of filter tree while we're at it.
1159 static int oc_filter(
1166 assert( f != NULL );
1168 if( cur > *max ) *max = cur;
1170 switch( f->f_choice ) {
1171 case LDAP_FILTER_PRESENT:
1172 if (f->f_desc == slap_schema.si_ad_objectClass) {
1177 case LDAP_FILTER_AND:
1178 case LDAP_FILTER_OR:
1180 for ( f=f->f_and; f; f=f->f_next ) {
1181 (void) oc_filter(f, cur, max);
1191 static void search_stack_free( void *key, void *data )
1193 ber_memfree_x(data, NULL);
1196 static void *search_stack( Operation *op )
1198 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1201 if ( op->o_threadctx ) {
1202 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)search_stack,
1205 ret = mdb->mi_search_stack;
1209 ret = ch_malloc( mdb->mi_search_stack_depth * MDB_IDL_UM_SIZE
1211 if ( op->o_threadctx ) {
1212 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)search_stack,
1213 ret, search_stack_free, NULL, NULL );
1215 mdb->mi_search_stack = ret;
1221 static int search_candidates(
1231 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1233 Filter *f, rf, xf, nf, sf;
1234 AttributeAssertion aa_ref = ATTRIBUTEASSERTION_INIT;
1235 AttributeAssertion aa_subentry = ATTRIBUTEASSERTION_INIT;
1238 * This routine takes as input a filter (user-filter)
1239 * and rewrites it as follows:
1240 * (&(scope=DN)[(objectClass=subentry)]
1241 * (|[(objectClass=referral)](user-filter))
1244 Debug(LDAP_DEBUG_TRACE,
1245 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1246 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1248 f = op->oq_search.rs_filter;
1250 /* If the user's filter uses objectClass=*,
1251 * these clauses are redundant.
1253 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1254 && !get_subentries_visibility(op)) {
1255 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1256 /* match referral objects */
1257 struct berval bv_ref = BER_BVC( "referral" );
1258 rf.f_choice = LDAP_FILTER_EQUALITY;
1260 rf.f_av_desc = slap_schema.si_ad_objectClass;
1261 rf.f_av_value = bv_ref;
1264 xf.f_choice = LDAP_FILTER_OR;
1271 if( get_subentries_visibility( op ) ) {
1272 struct berval bv_subentry = BER_BVC( "subentry" );
1273 sf.f_choice = LDAP_FILTER_EQUALITY;
1274 sf.f_ava = &aa_subentry;
1275 sf.f_av_desc = slap_schema.si_ad_objectClass;
1276 sf.f_av_value = bv_subentry;
1278 nf.f_choice = LDAP_FILTER_AND;
1285 /* Allocate IDL stack, plus 1 more for former tmp */
1286 if ( depth+1 > mdb->mi_search_stack_depth ) {
1287 stack = ch_malloc( (depth + 1) * MDB_IDL_UM_SIZE * sizeof( ID ) );
1290 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1291 rc = search_aliases( op, rs, e->e_id, txn, mci, scopes, stack );
1296 if ( rc == LDAP_SUCCESS ) {
1297 rc = mdb_filter_candidates( op, txn, f, ids,
1298 stack, stack+MDB_IDL_UM_SIZE );
1301 if ( depth+1 > mdb->mi_search_stack_depth ) {
1306 Debug(LDAP_DEBUG_TRACE,
1307 "mdb_search_candidates: failed (rc=%d)\n",
1311 Debug(LDAP_DEBUG_TRACE,
1312 "mdb_search_candidates: id=%ld first=%ld last=%ld\n",
1314 (long) MDB_IDL_FIRST(ids),
1315 (long) MDB_IDL_LAST(ids) );
1322 parse_paged_cookie( Operation *op, SlapReply *rs )
1324 int rc = LDAP_SUCCESS;
1325 PagedResultsState *ps = op->o_pagedresults_state;
1327 /* this function must be invoked only if the pagedResults
1328 * control has been detected, parsed and partially checked
1329 * by the frontend */
1330 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1332 /* cookie decoding/checks deferred to backend... */
1333 if ( ps->ps_cookieval.bv_len ) {
1334 PagedResultsCookie reqcookie;
1335 if( ps->ps_cookieval.bv_len != sizeof( reqcookie ) ) {
1337 rs->sr_text = "paged results cookie is invalid";
1338 rc = LDAP_PROTOCOL_ERROR;
1342 AC_MEMCPY( &reqcookie, ps->ps_cookieval.bv_val, sizeof( reqcookie ));
1344 if ( reqcookie > ps->ps_cookie ) {
1346 rs->sr_text = "paged results cookie is invalid";
1347 rc = LDAP_PROTOCOL_ERROR;
1350 } else if ( reqcookie < ps->ps_cookie ) {
1351 rs->sr_text = "paged results cookie is invalid or old";
1352 rc = LDAP_UNWILLING_TO_PERFORM;
1357 /* we're going to use ps_cookie */
1358 op->o_conn->c_pagedresults_state.ps_cookie = 0;
1367 send_paged_response(
1373 LDAPControl *ctrls[2];
1374 BerElementBuffer berbuf;
1375 BerElement *ber = (BerElement *)&berbuf;
1376 PagedResultsCookie respcookie;
1377 struct berval cookie;
1379 Debug(LDAP_DEBUG_ARGS,
1380 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1381 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1385 ber_init2( ber, NULL, LBER_USE_DER );
1388 respcookie = ( PagedResultsCookie )(*lastid);
1389 cookie.bv_len = sizeof( respcookie );
1390 cookie.bv_val = (char *)&respcookie;
1393 respcookie = ( PagedResultsCookie )0;
1394 BER_BVSTR( &cookie, "" );
1397 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1398 op->o_conn->c_pagedresults_state.ps_count =
1399 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1402 /* return size of 0 -- no estimate */
1403 ber_printf( ber, "{iO}", 0, &cookie );
1405 ctrls[0] = op->o_tmpalloc( sizeof(LDAPControl), op->o_tmpmemctx );
1406 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1410 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1411 ctrls[0]->ldctl_iscritical = 0;
1413 slap_add_ctrls( op, rs, ctrls );
1414 rs->sr_err = LDAP_SUCCESS;
1415 send_ldap_result( op, rs );
1418 (void) ber_free_buf( ber );