1 /* search.c - search operation */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2005 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(
38 static int parse_paged_cookie( Operation *op, SlapReply *rs );
40 static void send_paged_response(
46 /* Dereference aliases for a single alias entry. Return the final
47 * dereferenced entry on success, NULL on any failure.
49 static Entry * deref_base (
59 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
64 rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
65 rs->sr_text = "maximum deref depth exceeded";
68 /* Remember the last entry we looked at, so we can
73 if (BDB_IDL_N(tmp) >= op->o_bd->be_max_deref_depth) {
78 /* If this is part of a subtree or onelevel search,
79 * have we seen this ID before? If so, quit.
81 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
86 /* If we've seen this ID during this deref iteration,
89 if ( bdb_idl_insert( tmp, e->e_id ) ) {
90 rs->sr_err = LDAP_ALIAS_PROBLEM;
91 rs->sr_text = "circular alias";
96 /* If there was a problem getting the aliasedObjectName,
97 * get_alias_dn will have set the error status.
99 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
104 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
114 rs->sr_err = LDAP_ALIAS_PROBLEM;
115 rs->sr_text = "aliasedObject not found";
119 /* Free the previous entry, continue to work with the
120 * one we just retrieved.
122 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
126 /* We found a regular entry. Return this to the caller. The
127 * entry is still locked for Read.
129 if (!is_entry_alias(e)) {
130 rs->sr_err = LDAP_SUCCESS;
138 /* Look for and dereference all aliases within the search scope. Adds
139 * the dereferenced entries to the "ids" list. Requires "stack" to be
140 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
141 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
143 static int search_aliases(
152 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
153 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
154 ID cursora, ida, cursoro, ido, *subscop2;
157 struct berval bv_alias = BER_BVC( "alias" );
158 #ifdef LDAP_COMP_MATCH
159 AttributeAssertion aa_alias = { NULL, BER_BVNULL, NULL };
161 AttributeAssertion aa_alias = { NULL, BER_BVNULL };
164 DB_LOCK locka, lockr;
167 aliases = stack; /* IDL of all aliases in the database */
168 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
169 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
170 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
171 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
172 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
173 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
175 /* A copy of subscop, because subscop gets clobbered by
176 * the bdb_idl_union/intersection routines
178 subscop2 = tmp + BDB_IDL_DB_SIZE;
180 af.f_choice = LDAP_FILTER_EQUALITY;
181 af.f_ava = &aa_alias;
182 af.f_av_desc = slap_schema.si_ad_objectClass;
183 af.f_av_value = bv_alias;
186 /* Find all aliases in database */
187 BDB_IDL_ZERO( aliases );
188 rs->sr_err = bdb_filter_candidates( op, &af, aliases,
190 if (rs->sr_err != LDAP_SUCCESS) {
194 oldsubs[1] = e->e_id;
197 BDB_IDL_ZERO( visited );
198 BDB_IDL_ZERO( newsubs );
201 ido = bdb_idl_first( oldsubs, &cursoro );
204 /* Set curscop to only the aliases in the current scope. Start with
205 * all the aliases, obtain the IDL for the current scope, and then
206 * get the intersection of these two IDLs. Add the current scope
207 * to the cumulative list of candidates.
209 BDB_IDL_CPY( curscop, aliases );
210 rs->sr_err = bdb_dn2idl( op, e, subscop,
211 subscop2+BDB_IDL_DB_SIZE );
215 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
217 BDB_IDL_CPY(subscop2, subscop);
218 rs->sr_err = bdb_idl_intersection(curscop, subscop);
219 bdb_idl_union( ids, subscop2 );
221 /* Dereference all of the aliases in the current scope. */
223 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
224 ida = bdb_idl_next(curscop, &cursora))
228 rs->sr_err = bdb_cache_find_id(op, NULL,
229 ida, &ei, 0, locker, &lockr );
230 if (rs->sr_err != LDAP_SUCCESS) {
231 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
232 rs->sr_err == DB_LOCK_NOTGRANTED ) goto retry1;
237 /* This should only happen if the curscop IDL has maxed out and
238 * turned into a range that spans IDs indiscriminately
240 if (!is_entry_alias(a)) {
241 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
246 /* Actually dereference the alias */
248 a = deref_base( op, rs, a, &matched, locker, &lockr,
251 /* If the target was not already in our current candidates,
252 * make note of it in the newsubs list. Also
253 * set it in the scopes list so that bdb_search
256 if (bdb_idl_insert(ids, a->e_id) == 0) {
257 bdb_idl_insert(newsubs, a->e_id);
258 bdb_idl_insert(scopes, a->e_id);
260 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
263 } else if (matched) {
264 /* Alias could not be dereferenced, or it deref'd to
265 * an ID we've already seen. Ignore it.
267 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
272 /* If this is a OneLevel search, we're done; oldsubs only had one
273 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
275 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
277 ido = bdb_idl_next( oldsubs, &cursoro );
279 /* If we're done processing the old scopes, did we add any new
280 * scopes in this iteration? If so, go back and do those now.
283 if (BDB_IDL_IS_ZERO(newsubs)) break;
284 BDB_IDL_CPY(oldsubs, newsubs);
285 BDB_IDL_ZERO(newsubs);
287 ido = bdb_idl_first( oldsubs, &cursoro );
290 /* Find the entry corresponding to the next scope. If it can't
291 * be found, ignore it and move on. This should never happen;
292 * we should never see the ID of an entry that doesn't exist.
293 * Set the name so that the scope's IDL can be retrieved.
297 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
299 if ( rs->sr_err != LDAP_SUCCESS ) {
300 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
301 rs->sr_err == DB_LOCK_NOTGRANTED )
311 bdb_search( Operation *op, SlapReply *rs )
313 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
316 ID candidates[BDB_IDL_UM_SIZE];
317 ID scopes[BDB_IDL_DB_SIZE];
318 Entry *e = NULL, base, e_root = {0};
319 Entry *matched = NULL;
320 EntryInfo *ei, ei_root = {0};
321 struct berval realbase = BER_BVNULL;
322 #ifdef SLAP_ACL_HONOR_DISCLOSE
328 AttributeName *attrs;
330 u_int32_t locker = 0;
332 struct bdb_op_info *opinfo = NULL;
335 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_search) "\n", 0, 0, 0);
336 attrs = op->oq_search.rs_attrs;
338 opinfo = (struct bdb_op_info *) op->o_private;
340 manageDSAit = get_manageDSAit( op );
342 if ( opinfo && opinfo->boi_txn ) {
343 ltid = opinfo->boi_txn;
344 locker = TXN_ID( ltid );
346 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
352 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
357 if ( op->o_req_ndn.bv_len == 0 ) {
358 /* DIT root special case */
359 ei_root.bei_e = &e_root;
360 ei_root.bei_parent = &ei_root;
361 e_root.e_private = &ei_root;
363 BER_BVSTR( &e_root.e_nname, "" );
364 BER_BVSTR( &e_root.e_name, "" );
366 rs->sr_err = LDAP_SUCCESS;
368 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
369 BDB_IDL_ZERO(candidates);
372 /* get entry with reader lock */
373 rs->sr_err = bdb_dn2entry( op, ltid, &op->o_req_ndn, &ei,
385 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
387 LOCK_ID_FREE (bdb->bi_dbenv, locker );
389 case DB_LOCK_DEADLOCK:
390 case DB_LOCK_NOTGRANTED:
393 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
395 LOCK_ID_FREE (bdb->bi_dbenv, locker );
399 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
400 if ( matched && is_entry_alias( matched )) {
403 stub.bv_val = op->o_req_ndn.bv_val;
404 stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
405 e = deref_base( op, rs, matched, &matched, locker, &lock,
408 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
410 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
415 } else if ( e && is_entry_alias( e )) {
416 e = deref_base( op, rs, e, &matched, locker, &lock,
422 struct berval matched_dn = BER_BVNULL;
424 if ( matched != NULL ) {
425 BerVarray erefs = NULL;
427 #ifdef SLAP_ACL_HONOR_DISCLOSE
428 /* return referral only if "disclose"
429 * is granted on the object */
430 if ( ! access_allowed( op, matched,
431 slap_schema.si_ad_entry,
432 NULL, ACL_DISCLOSE, NULL ) )
434 rs->sr_err = LDAP_NO_SUCH_OBJECT;
437 #endif /* SLAP_ACL_HONOR_DISCLOSE */
439 ber_dupbv( &matched_dn, &matched->e_name );
441 erefs = is_entry_referral( matched )
442 ? get_entry_referrals( op, matched )
444 if ( rs->sr_err == DB_NOTFOUND )
445 rs->sr_err = LDAP_REFERRAL;
446 rs->sr_matched = matched_dn.bv_val;
449 #ifdef SLAP_ZONE_ALLOC
450 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
452 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
457 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
458 &op->o_req_dn, op->oq_search.rs_scope );
459 ber_bvarray_free( erefs );
463 #ifdef SLAP_ZONE_ALLOC
464 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
466 rs->sr_ref = referral_rewrite( default_referral,
467 NULL, &op->o_req_dn, op->oq_search.rs_scope );
468 rs->sr_err = LDAP_REFERRAL;
471 send_ldap_result( op, rs );
474 LOCK_ID_FREE (bdb->bi_dbenv, locker );
476 ber_bvarray_free( rs->sr_ref );
479 if ( !BER_BVISNULL( &matched_dn ) ) {
480 ber_memfree( matched_dn.bv_val );
481 rs->sr_matched = NULL;
486 #ifdef SLAP_ACL_HONOR_DISCLOSE
487 /* NOTE: __NEW__ "search" access is required
488 * on searchBase object */
489 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
490 NULL, ACL_SEARCH, NULL, &mask ) )
492 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
493 rs->sr_err = LDAP_NO_SUCH_OBJECT;
495 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
498 #ifdef SLAP_ZONE_ALLOC
499 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
501 if ( e != &e_root ) {
502 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
504 send_ldap_result( op, rs );
507 #endif /* SLAP_ACL_HONOR_DISCLOSE */
509 if ( !manageDSAit && e != &e_root && is_entry_referral( e ) ) {
510 /* entry is a referral, don't allow add */
511 struct berval matched_dn = BER_BVNULL;
512 BerVarray erefs = NULL;
514 ber_dupbv( &matched_dn, &e->e_name );
515 erefs = get_entry_referrals( op, e );
517 rs->sr_err = LDAP_REFERRAL;
519 #ifdef SLAP_ZONE_ALLOC
520 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
522 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
526 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
527 &op->o_req_dn, op->oq_search.rs_scope );
528 ber_bvarray_free( erefs );
531 rs->sr_text = "bad_referral object";
535 Debug( LDAP_DEBUG_TRACE,
536 LDAP_XSTRING(bdb_search) ": entry is referral\n",
539 rs->sr_matched = matched_dn.bv_val;
540 send_ldap_result( op, rs );
543 LOCK_ID_FREE (bdb->bi_dbenv, locker );
545 ber_bvarray_free( rs->sr_ref );
547 ber_memfree( matched_dn.bv_val );
548 rs->sr_matched = NULL;
552 if ( get_assert( op ) &&
553 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
555 rs->sr_err = LDAP_ASSERTION_FAILED;
556 #ifdef SLAP_ZONE_ALLOC
557 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
559 if ( e != &e_root ) {
560 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
562 send_ldap_result( op, rs );
566 /* compute it anyway; root does not use it */
567 stoptime = op->o_time + op->ors_tlimit;
569 /* need normalized dn below */
570 ber_dupbv( &realbase, &e->e_nname );
572 /* Copy info to base, must free entry before accessing the database
573 * in search_candidates, to avoid deadlocks.
575 base.e_private = e->e_private;
576 base.e_nname = realbase;
579 #ifdef SLAP_ZONE_ALLOC
580 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
582 if ( e != &e_root ) {
583 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
587 /* select candidates */
588 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
589 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
592 BDB_IDL_ZERO( candidates );
593 BDB_IDL_ZERO( scopes );
594 rs->sr_err = search_candidates( op, rs, &base,
595 locker, candidates, scopes );
598 /* start cursor at beginning of candidates.
602 if ( candidates[0] == 0 ) {
603 Debug( LDAP_DEBUG_TRACE,
604 LDAP_XSTRING(bdb_search) ": no candidates\n",
610 /* if not root and candidates exceed to-be-checked entries, abort */
611 if ( op->ors_limit /* isroot == FALSE */ &&
612 op->ors_limit->lms_s_unchecked != -1 &&
613 BDB_IDL_N(candidates) > (unsigned) op->ors_limit->lms_s_unchecked )
615 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
616 send_ldap_result( op, rs );
617 rs->sr_err = LDAP_SUCCESS;
621 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
622 !op->ors_limit->lms_s_pr_hide )
624 tentries = BDB_IDL_N(candidates);
627 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
628 PagedResultsState *ps = op->o_pagedresults_state;
629 /* deferred cookie parsing */
630 rs->sr_err = parse_paged_cookie( op, rs );
631 if ( rs->sr_err != LDAP_SUCCESS ) {
632 send_ldap_result( op, rs );
636 if ( (ID)( ps->ps_cookie ) == 0 ) {
637 id = bdb_idl_first( candidates, &cursor );
640 if ( ps->ps_size == 0 ) {
641 rs->sr_err = LDAP_SUCCESS;
642 rs->sr_text = "search abandoned by pagedResult size=0";
643 send_ldap_result( op, rs );
646 for ( id = bdb_idl_first( candidates, &cursor );
648 id <= (ID)( ps->ps_cookie );
649 id = bdb_idl_next( candidates, &cursor ) )
655 if ( cursor == NOID ) {
656 Debug( LDAP_DEBUG_TRACE,
657 LDAP_XSTRING(bdb_search)
658 ": no paged results candidates\n",
660 send_paged_response( op, rs, &lastid, 0 );
662 rs->sr_err = LDAP_OTHER;
668 for ( id = bdb_idl_first( candidates, &cursor );
669 id != NOID ; id = bdb_idl_next( candidates, &cursor ) )
675 /* check for abandon */
676 if ( op->o_abandon ) {
677 rs->sr_err = SLAPD_ABANDON;
681 /* check time limit */
682 if ( op->ors_tlimit != SLAP_NO_LIMIT
683 && slap_get_time() > stoptime )
685 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
686 rs->sr_ref = rs->sr_v2ref;
687 send_ldap_result( op, rs );
688 rs->sr_err = LDAP_SUCCESS;
693 /* get the entry with reader lock */
695 rs->sr_err = bdb_cache_find_id( op, ltid,
696 id, &ei, 0, locker, &lock );
698 if (rs->sr_err == LDAP_BUSY) {
699 rs->sr_text = "ldap server busy";
700 send_ldap_result( op, rs );
703 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
704 || rs->sr_err == DB_LOCK_NOTGRANTED )
706 goto fetch_entry_retry;
709 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
716 if( !BDB_IDL_IS_RANGE(candidates) ) {
717 /* only complain for non-range IDLs */
718 Debug( LDAP_DEBUG_TRACE,
719 LDAP_XSTRING(bdb_search)
720 ": candidate %ld not found\n",
729 #ifdef BDB_SUBENTRIES
731 if ( is_entry_subentry( e ) ) {
732 if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
733 if(!get_subentries_visibility( op )) {
734 /* only subentries are visible */
738 } else if ( get_subentries( op ) &&
739 !get_subentries_visibility( op ))
741 /* only subentries are visible */
745 } else if ( get_subentries_visibility( op )) {
746 /* only subentries are visible */
750 #endif /* BDB_SUBENTRIES */
752 /* Does this candidate actually satisfy the search scope?
754 * Note that we don't lock access to the bei_parent pointer.
755 * Since only leaf nodes can be deleted, the parent of any
756 * node will always be a valid node. Also since we have
757 * a Read lock on the data, it cannot be renamed out of the
758 * scope while we are looking at it, and unless we're using
759 * BDB_HIER, its parents cannot be moved either.
762 switch( op->ors_scope ) {
763 case LDAP_SCOPE_BASE:
764 /* This is always true, yes? */
765 if ( id == base.e_id ) scopeok = 1;
768 case LDAP_SCOPE_ONELEVEL:
769 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
772 #ifdef LDAP_SCOPE_CHILDREN
773 case LDAP_SCOPE_CHILDREN:
774 if ( id == base.e_id ) break;
777 case LDAP_SCOPE_SUBTREE: {
779 for ( tmp = BEI(e); tmp; tmp = tmp->bei_parent ) {
780 if ( tmp->bei_id == base.e_id ) {
788 /* aliases were already dereferenced in candidate list */
789 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
790 /* but if the search base is an alias, and we didn't
791 * deref it when finding, return it.
793 if ( is_entry_alias(e) &&
794 ((op->ors_deref & LDAP_DEREF_FINDING) ||
795 !bvmatch(&e->e_nname, &op->o_req_ndn)))
800 /* scopes is only non-empty for onelevel or subtree */
801 if ( !scopeok && BDB_IDL_N(scopes) ) {
803 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
804 x = bdb_idl_search( scopes, e->e_id );
805 if ( scopes[x] == e->e_id ) scopeok = 1;
807 /* subtree, walk up the tree */
808 EntryInfo *tmp = BEI(e);
809 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
810 x = bdb_idl_search( scopes, tmp->bei_id );
811 if ( scopes[x] == tmp->bei_id ) {
820 /* Not in scope, ignore it */
823 Debug( LDAP_DEBUG_TRACE,
824 LDAP_XSTRING(bdb_search)
825 ": %ld scope not okay\n",
831 * if it's a referral, add it to the list of referrals. only do
832 * this for non-base searches, and don't check the filter
833 * explicitly here since it's only a candidate anyway.
835 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
836 && is_entry_referral( e ) )
838 BerVarray erefs = get_entry_referrals( op, e );
839 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
840 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
841 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
843 send_search_reference( op, rs );
845 ber_bvarray_free( rs->sr_ref );
846 ber_bvarray_free( erefs );
852 if ( !manageDSAit && is_entry_glue( e )) {
856 /* if it matches the filter and scope, send it */
857 rs->sr_err = test_filter( op, rs->sr_entry, op->oq_search.rs_filter );
859 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
860 /* check size limit */
861 if ( --op->ors_slimit == -1 ) {
862 #ifdef SLAP_ZONE_ALLOC
863 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
865 bdb_cache_return_entry_r( bdb->bi_dbenv,
866 &bdb->bi_cache, e, &lock );
869 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
870 rs->sr_ref = rs->sr_v2ref;
871 send_ldap_result( op, rs );
872 rs->sr_err = LDAP_SUCCESS;
876 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
877 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
878 #ifdef SLAP_ZONE_ALLOC
879 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
881 bdb_cache_return_entry_r( bdb->bi_dbenv,
882 &bdb->bi_cache, e, &lock );
884 send_paged_response( op, rs, &lastid, tentries );
893 rs->sr_attrs = op->oq_search.rs_attrs;
894 rs->sr_operational_attrs = NULL;
897 rs->sr_err = LDAP_SUCCESS;
898 result = send_search_entry( op, rs );
901 case 0: /* entry sent ok */
903 case 1: /* entry not sent */
905 case -1: /* connection closed */
906 #ifdef SLAP_ZONE_ALLOC
907 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
909 bdb_cache_return_entry_r(bdb->bi_dbenv,
910 &bdb->bi_cache, e, &lock);
913 rs->sr_err = LDAP_OTHER;
919 Debug( LDAP_DEBUG_TRACE,
920 LDAP_XSTRING(bdb_search)
921 ": %ld does not match filter\n",
927 /* free reader lock */
928 #ifdef SLAP_ZONE_ALLOC
929 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
931 bdb_cache_return_entry_r( bdb->bi_dbenv,
932 &bdb->bi_cache, e , &lock );
937 ldap_pvt_thread_yield();
942 rs->sr_ref = rs->sr_v2ref;
943 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
944 rs->sr_rspoid = NULL;
945 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
946 send_paged_response( op, rs, NULL, 0 );
948 send_ldap_result( op, rs );
951 rs->sr_err = LDAP_SUCCESS;
955 LOCK_ID_FREE( bdb->bi_dbenv, locker );
958 ber_bvarray_free( rs->sr_v2ref );
961 if( realbase.bv_val ) ch_free( realbase.bv_val );
967 static int base_candidate(
972 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
973 e->e_nname.bv_val, (long) e->e_id, 0);
980 /* Look for "objectClass Present" in this filter.
981 * Also count depth of filter tree while we're at it.
983 static int oc_filter(
992 if( cur > *max ) *max = cur;
994 switch( f->f_choice ) {
995 case LDAP_FILTER_PRESENT:
996 if (f->f_desc == slap_schema.si_ad_objectClass) {
1001 case LDAP_FILTER_AND:
1002 case LDAP_FILTER_OR:
1004 for ( f=f->f_and; f; f=f->f_next ) {
1005 (void) oc_filter(f, cur, max);
1015 static void search_stack_free( void *key, void *data )
1017 ber_memfree_x(data, NULL);
1020 static void *search_stack( Operation *op )
1022 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1025 if ( op->o_threadctx ) {
1026 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1029 ret = bdb->bi_search_stack;
1033 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1035 if ( op->o_threadctx ) {
1036 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1037 ret, search_stack_free );
1039 bdb->bi_search_stack = ret;
1045 static int search_candidates(
1053 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1055 Filter f, rf, xf, nf;
1057 #ifdef LDAP_COMP_MATCH
1058 AttributeAssertion aa_ref = { NULL, BER_BVNULL, NULL };
1060 AttributeAssertion aa_ref = { NULL, BER_BVNULL };
1062 #ifdef BDB_SUBENTRIES
1064 #ifdef LDAP_COMP_MATCH
1065 AttributeAssertion aa_subentry = { NULL, BER_BVNULL, NULL };
1067 AttributeAssertion aa_subentry = { NULL, BER_BVNULL };
1072 * This routine takes as input a filter (user-filter)
1073 * and rewrites it as follows:
1074 * (&(scope=DN)[(objectClass=subentry)]
1075 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1078 Debug(LDAP_DEBUG_TRACE,
1079 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1080 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1082 xf.f_or = op->oq_search.rs_filter;
1083 xf.f_choice = LDAP_FILTER_OR;
1086 /* If the user's filter uses objectClass=*,
1087 * these clauses are redundant.
1089 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1090 && !get_subentries_visibility(op)) {
1091 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1092 /* match referral objects */
1093 struct berval bv_ref = BER_BVC( "referral" );
1094 rf.f_choice = LDAP_FILTER_EQUALITY;
1096 rf.f_av_desc = slap_schema.si_ad_objectClass;
1097 rf.f_av_value = bv_ref;
1098 rf.f_next = xf.f_or;
1105 f.f_choice = LDAP_FILTER_AND;
1107 /* Dummy; we compute scope separately now */
1108 nf.f_choice = SLAPD_FILTER_COMPUTED;
1109 nf.f_result = LDAP_SUCCESS;
1110 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1111 ? op->oq_search.rs_filter : &xf ;
1112 /* Filter depth increased again, adding dummy clause */
1115 #ifdef BDB_SUBENTRIES
1116 if( get_subentries_visibility( op ) ) {
1117 struct berval bv_subentry = BER_BVC( "subentry" );
1118 sf.f_choice = LDAP_FILTER_EQUALITY;
1119 sf.f_ava = &aa_subentry;
1120 sf.f_av_desc = slap_schema.si_ad_objectClass;
1121 sf.f_av_value = bv_subentry;
1122 sf.f_next = nf.f_next;
1127 /* Allocate IDL stack, plus 1 more for former tmp */
1128 if ( depth+1 > bdb->bi_search_stack_depth ) {
1129 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1131 stack = search_stack( op );
1134 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1135 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1137 rc = bdb_dn2idl( op, e, ids, stack );
1140 if ( rc == LDAP_SUCCESS ) {
1141 rc = bdb_filter_candidates( op, &f, ids,
1142 stack, stack+BDB_IDL_UM_SIZE );
1145 if ( depth+1 > bdb->bi_search_stack_depth ) {
1150 Debug(LDAP_DEBUG_TRACE,
1151 "bdb_search_candidates: failed (rc=%d)\n",
1155 Debug(LDAP_DEBUG_TRACE,
1156 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1158 (long) BDB_IDL_FIRST(ids),
1159 (long) BDB_IDL_LAST(ids) );
1166 parse_paged_cookie( Operation *op, SlapReply *rs )
1169 int rc = LDAP_SUCCESS;
1173 struct berval cookie = BER_BVNULL;
1174 PagedResultsState *ps = op->o_pagedresults_state;
1176 /* this function must be invoked only if the pagedResults
1177 * control has been detected, parsed and partially checked
1178 * by the frontend */
1179 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1181 /* look for the appropriate ctrl structure */
1182 for ( c = op->o_ctrls; c[0] != NULL; c++ ) {
1183 if ( strcmp( c[0]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 )
1189 if ( c[0] == NULL ) {
1190 rs->sr_text = "missing pagedResults control";
1191 return LDAP_PROTOCOL_ERROR;
1194 /* Tested by frontend */
1195 assert( c[0]->ldctl_value.bv_len > 0 );
1197 /* Parse the control value
1198 * realSearchControlValue ::= SEQUENCE {
1199 * size INTEGER (0..maxInt),
1200 * -- requested page size from client
1201 * -- result set size estimate from server
1202 * cookie OCTET STRING
1205 ber = ber_init( &c[0]->ldctl_value );
1206 if ( ber == NULL ) {
1207 rs->sr_text = "internal error";
1211 tag = ber_scanf( ber, "{im}", &size, &cookie );
1213 /* Tested by frontend */
1214 assert( tag != LBER_ERROR );
1215 assert( size >= 0 );
1217 /* cookie decoding/checks deferred to backend... */
1218 if ( cookie.bv_len ) {
1219 PagedResultsCookie reqcookie;
1220 if( cookie.bv_len != sizeof( reqcookie ) ) {
1222 rs->sr_text = "paged results cookie is invalid";
1223 rc = LDAP_PROTOCOL_ERROR;
1227 AC_MEMCPY( &reqcookie, cookie.bv_val, sizeof( reqcookie ));
1229 if ( reqcookie > ps->ps_cookie ) {
1231 rs->sr_text = "paged results cookie is invalid";
1232 rc = LDAP_PROTOCOL_ERROR;
1235 } else if ( reqcookie < ps->ps_cookie ) {
1236 rs->sr_text = "paged results cookie is invalid or old";
1237 rc = LDAP_UNWILLING_TO_PERFORM;
1242 /* Initial request. Initialize state. */
1244 if ( op->o_conn->c_pagedresults_state.ps_cookie != 0 ) {
1245 /* There's another pagedResults control on the
1246 * same connection; reject new pagedResults controls
1247 * (allowed by RFC2696) */
1248 rs->sr_text = "paged results cookie unavailable; try later";
1249 rc = LDAP_UNWILLING_TO_PERFORM;
1258 (void)ber_free( ber, 1 );
1264 send_paged_response(
1270 LDAPControl ctrl, *ctrls[2];
1271 BerElementBuffer berbuf;
1272 BerElement *ber = (BerElement *)&berbuf;
1273 PagedResultsCookie respcookie;
1274 struct berval cookie;
1276 Debug(LDAP_DEBUG_ARGS,
1277 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1278 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1280 BER_BVZERO( &ctrl.ldctl_value );
1284 ber_init2( ber, NULL, LBER_USE_DER );
1287 respcookie = ( PagedResultsCookie )(*lastid);
1288 cookie.bv_len = sizeof( respcookie );
1289 cookie.bv_val = (char *)&respcookie;
1292 respcookie = ( PagedResultsCookie )0;
1293 BER_BVSTR( &cookie, "" );
1296 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1297 op->o_conn->c_pagedresults_state.ps_count =
1298 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1301 /* return size of 0 -- no estimate */
1302 ber_printf( ber, "{iO}", 0, &cookie );
1304 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1308 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1309 ctrls[0]->ldctl_iscritical = 0;
1311 rs->sr_ctrls = ctrls;
1312 rs->sr_err = LDAP_SUCCESS;
1313 send_ldap_result( op, rs );
1314 rs->sr_ctrls = NULL;
1317 (void) ber_free_buf( ber );