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";
67 while (BDB_IDL_N(tmp) < op->o_bd->be_max_deref_depth) {
68 /* Remember the last entry we looked at, so we can
73 /* If this is part of a subtree or onelevel search,
74 * have we seen this ID before? If so, quit.
76 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
81 /* If we've seen this ID during this deref iteration,
84 if ( bdb_idl_insert( tmp, e->e_id ) ) {
85 rs->sr_err = LDAP_ALIAS_PROBLEM;
86 rs->sr_text = "circular alias";
91 /* If there was a problem getting the aliasedObjectName,
92 * get_alias_dn will have set the error status.
94 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
99 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
109 rs->sr_err = LDAP_ALIAS_PROBLEM;
110 rs->sr_text = "aliasedObject not found";
114 /* Free the previous entry, continue to work with the
115 * one we just retrieved.
117 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
121 /* We found a regular entry. Return this to the caller. The
122 * entry is still locked for Read.
124 if (!is_entry_alias(e)) {
125 rs->sr_err = LDAP_SUCCESS;
133 /* Look for and dereference all aliases within the search scope. Adds
134 * the dereferenced entries to the "ids" list. Requires "stack" to be
135 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
136 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
138 static int search_aliases(
147 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
148 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
149 ID cursora, ida, cursoro, ido, *subscop2;
152 struct berval bv_alias = BER_BVC( "alias" );
153 #ifdef LDAP_COMP_MATCH
154 AttributeAssertion aa_alias = { NULL, BER_BVNULL, NULL };
156 AttributeAssertion aa_alias = { NULL, BER_BVNULL };
159 DB_LOCK locka, lockr;
162 aliases = stack; /* IDL of all aliases in the database */
163 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
164 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
165 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
166 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
167 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
168 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
170 /* A copy of subscop, because subscop gets clobbered by
171 * the bdb_idl_union/intersection routines
173 subscop2 = tmp + BDB_IDL_DB_SIZE;
175 af.f_choice = LDAP_FILTER_EQUALITY;
176 af.f_ava = &aa_alias;
177 af.f_av_desc = slap_schema.si_ad_objectClass;
178 af.f_av_value = bv_alias;
181 /* Find all aliases in database */
182 BDB_IDL_ZERO( aliases );
183 rs->sr_err = bdb_filter_candidates( op, &af, aliases,
185 if (rs->sr_err != LDAP_SUCCESS) {
189 oldsubs[1] = e->e_id;
192 BDB_IDL_ZERO( visited );
193 BDB_IDL_ZERO( newsubs );
196 ido = bdb_idl_first( oldsubs, &cursoro );
199 /* Set curscop to only the aliases in the current scope. Start with
200 * all the aliases, obtain the IDL for the current scope, and then
201 * get the intersection of these two IDLs. Add the current scope
202 * to the cumulative list of candidates.
204 BDB_IDL_CPY( curscop, aliases );
205 rs->sr_err = bdb_dn2idl( op, e, subscop,
206 subscop2+BDB_IDL_DB_SIZE );
210 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
212 BDB_IDL_CPY(subscop2, subscop);
213 rs->sr_err = bdb_idl_intersection(curscop, subscop);
214 bdb_idl_union( ids, subscop2 );
216 /* Dereference all of the aliases in the current scope. */
218 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
219 ida = bdb_idl_next(curscop, &cursora))
223 rs->sr_err = bdb_cache_find_id(op, NULL,
224 ida, &ei, 0, locker, &lockr );
225 if (rs->sr_err != LDAP_SUCCESS) {
226 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
227 rs->sr_err == DB_LOCK_NOTGRANTED ) goto retry1;
232 /* This should only happen if the curscop IDL has maxed out and
233 * turned into a range that spans IDs indiscriminately
235 if (!is_entry_alias(a)) {
236 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
241 /* Actually dereference the alias */
243 a = deref_base( op, rs, a, &matched, locker, &lockr,
246 /* If the target was not already in our current candidates,
247 * make note of it in the newsubs list. Also
248 * set it in the scopes list so that bdb_search
251 if (bdb_idl_insert(ids, a->e_id) == 0) {
252 bdb_idl_insert(newsubs, a->e_id);
253 bdb_idl_insert(scopes, a->e_id);
255 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
258 } else if (matched) {
259 /* Alias could not be dereferenced, or it deref'd to
260 * an ID we've already seen. Ignore it.
262 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
267 /* If this is a OneLevel search, we're done; oldsubs only had one
268 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
270 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
272 ido = bdb_idl_next( oldsubs, &cursoro );
274 /* If we're done processing the old scopes, did we add any new
275 * scopes in this iteration? If so, go back and do those now.
278 if (BDB_IDL_IS_ZERO(newsubs)) break;
279 BDB_IDL_CPY(oldsubs, newsubs);
280 BDB_IDL_ZERO(newsubs);
282 ido = bdb_idl_first( oldsubs, &cursoro );
285 /* Find the entry corresponding to the next scope. If it can't
286 * be found, ignore it and move on. This should never happen;
287 * we should never see the ID of an entry that doesn't exist.
288 * Set the name so that the scope's IDL can be retrieved.
292 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
294 if ( rs->sr_err != LDAP_SUCCESS ) {
295 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
296 rs->sr_err == DB_LOCK_NOTGRANTED )
306 bdb_search( Operation *op, SlapReply *rs )
308 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
311 ID candidates[BDB_IDL_UM_SIZE];
312 ID scopes[BDB_IDL_DB_SIZE];
313 Entry *e = NULL, base, e_root = {0};
314 Entry *matched = NULL;
315 EntryInfo *ei, ei_root = {0};
316 struct berval realbase = BER_BVNULL;
317 #ifdef SLAP_ACL_HONOR_DISCLOSE
323 AttributeName *attrs;
325 u_int32_t locker = 0;
327 struct bdb_op_info *opinfo = NULL;
330 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_search) "\n", 0, 0, 0);
331 attrs = op->oq_search.rs_attrs;
333 opinfo = (struct bdb_op_info *) op->o_private;
335 manageDSAit = get_manageDSAit( op );
337 if ( opinfo && opinfo->boi_txn ) {
338 ltid = opinfo->boi_txn;
339 locker = TXN_ID( ltid );
341 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
347 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
352 if ( op->o_req_ndn.bv_len == 0 ) {
353 /* DIT root special case */
354 ei_root.bei_e = &e_root;
355 ei_root.bei_parent = &ei_root;
356 e_root.e_private = &ei_root;
358 BER_BVSTR( &e_root.e_nname, "" );
359 BER_BVSTR( &e_root.e_name, "" );
361 rs->sr_err = LDAP_SUCCESS;
364 /* get entry with reader lock */
365 rs->sr_err = bdb_dn2entry( op, ltid, &op->o_req_ndn, &ei,
377 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
379 LOCK_ID_FREE (bdb->bi_dbenv, locker );
381 case DB_LOCK_DEADLOCK:
382 case DB_LOCK_NOTGRANTED:
385 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
387 LOCK_ID_FREE (bdb->bi_dbenv, locker );
391 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
392 BDB_IDL_ZERO(candidates);
393 e = deref_base( op, rs, e, &matched, locker, &lock,
398 struct berval matched_dn = BER_BVNULL;
400 if ( matched != NULL ) {
401 BerVarray erefs = NULL;
403 #ifdef SLAP_ACL_HONOR_DISCLOSE
404 /* return referral only if "disclose"
405 * is granted on the object */
406 if ( ! access_allowed( op, matched,
407 slap_schema.si_ad_entry,
408 NULL, ACL_DISCLOSE, NULL ) )
410 rs->sr_err = LDAP_NO_SUCH_OBJECT;
413 #endif /* SLAP_ACL_HONOR_DISCLOSE */
415 ber_dupbv( &matched_dn, &matched->e_name );
417 erefs = is_entry_referral( matched )
418 ? get_entry_referrals( op, matched )
420 rs->sr_err = LDAP_REFERRAL;
421 rs->sr_matched = matched_dn.bv_val;
424 #ifdef SLAP_ZONE_ALLOC
425 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
427 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
432 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
433 &op->o_req_dn, op->oq_search.rs_scope );
434 ber_bvarray_free( erefs );
438 #ifdef SLAP_ZONE_ALLOC
439 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
441 rs->sr_ref = referral_rewrite( default_referral,
442 NULL, &op->o_req_dn, op->oq_search.rs_scope );
443 rs->sr_err = LDAP_REFERRAL;
446 send_ldap_result( op, rs );
449 LOCK_ID_FREE (bdb->bi_dbenv, locker );
451 ber_bvarray_free( rs->sr_ref );
454 if ( !BER_BVISNULL( &matched_dn ) ) {
455 ber_memfree( matched_dn.bv_val );
456 rs->sr_matched = NULL;
461 #ifdef SLAP_ACL_HONOR_DISCLOSE
462 /* NOTE: __NEW__ "search" access is required
463 * on searchBase object */
464 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
465 NULL, ACL_SEARCH, NULL, &mask ) )
467 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
468 rs->sr_err = LDAP_NO_SUCH_OBJECT;
470 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
473 #ifdef SLAP_ZONE_ALLOC
474 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
476 if ( e != &e_root ) {
477 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
479 send_ldap_result( op, rs );
482 #endif /* SLAP_ACL_HONOR_DISCLOSE */
484 if ( !manageDSAit && e != &e_root && is_entry_referral( e ) ) {
485 /* entry is a referral, don't allow add */
486 struct berval matched_dn = BER_BVNULL;
487 BerVarray erefs = NULL;
489 ber_dupbv( &matched_dn, &e->e_name );
490 erefs = get_entry_referrals( op, e );
492 rs->sr_err = LDAP_REFERRAL;
494 #ifdef SLAP_ZONE_ALLOC
495 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
497 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
501 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
502 &op->o_req_dn, op->oq_search.rs_scope );
503 ber_bvarray_free( erefs );
506 rs->sr_text = "bad_referral object";
510 Debug( LDAP_DEBUG_TRACE,
511 LDAP_XSTRING(bdb_search) ": entry is referral\n",
514 rs->sr_matched = matched_dn.bv_val;
515 send_ldap_result( op, rs );
518 LOCK_ID_FREE (bdb->bi_dbenv, locker );
520 ber_bvarray_free( rs->sr_ref );
522 ber_memfree( matched_dn.bv_val );
523 rs->sr_matched = NULL;
527 if ( get_assert( op ) &&
528 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
530 rs->sr_err = LDAP_ASSERTION_FAILED;
531 #ifdef SLAP_ZONE_ALLOC
532 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
534 if ( e != &e_root ) {
535 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
537 send_ldap_result( op, rs );
541 /* compute it anyway; root does not use it */
542 stoptime = op->o_time + op->ors_tlimit;
544 /* need normalized dn below */
545 ber_dupbv( &realbase, &e->e_nname );
547 /* Copy info to base, must free entry before accessing the database
548 * in search_candidates, to avoid deadlocks.
550 base.e_private = e->e_private;
551 base.e_nname = realbase;
554 #ifdef SLAP_ZONE_ALLOC
555 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
557 if ( e != &e_root ) {
558 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
562 /* select candidates */
563 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
564 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
567 BDB_IDL_ZERO( candidates );
568 BDB_IDL_ZERO( scopes );
569 rs->sr_err = search_candidates( op, rs, &base,
570 locker, candidates, scopes );
573 /* start cursor at beginning of candidates.
577 if ( candidates[0] == 0 ) {
578 Debug( LDAP_DEBUG_TRACE,
579 LDAP_XSTRING(bdb_search) ": no candidates\n",
585 /* if not root and candidates exceed to-be-checked entries, abort */
586 if ( op->ors_limit /* isroot == FALSE */ &&
587 op->ors_limit->lms_s_unchecked != -1 &&
588 BDB_IDL_N(candidates) > (unsigned) op->ors_limit->lms_s_unchecked )
590 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
591 send_ldap_result( op, rs );
592 rs->sr_err = LDAP_SUCCESS;
596 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
597 !op->ors_limit->lms_s_pr_hide )
599 tentries = BDB_IDL_N(candidates);
602 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
603 PagedResultsState *ps = op->o_pagedresults_state;
604 /* deferred cookie parsing */
605 rs->sr_err = parse_paged_cookie( op, rs );
606 if ( rs->sr_err != LDAP_SUCCESS ) {
607 send_ldap_result( op, rs );
611 if ( (ID)( ps->ps_cookie ) == 0 ) {
612 id = bdb_idl_first( candidates, &cursor );
615 if ( ps->ps_size == 0 ) {
616 rs->sr_err = LDAP_SUCCESS;
617 rs->sr_text = "search abandoned by pagedResult size=0";
618 send_ldap_result( op, rs );
621 for ( id = bdb_idl_first( candidates, &cursor );
623 id <= (ID)( ps->ps_cookie );
624 id = bdb_idl_next( candidates, &cursor ) )
630 if ( cursor == NOID ) {
631 Debug( LDAP_DEBUG_TRACE,
632 LDAP_XSTRING(bdb_search)
633 ": no paged results candidates\n",
635 send_paged_response( op, rs, &lastid, 0 );
637 rs->sr_err = LDAP_OTHER;
643 for ( id = bdb_idl_first( candidates, &cursor );
644 id != NOID ; id = bdb_idl_next( candidates, &cursor ) )
650 /* check for abandon */
651 if ( op->o_abandon ) {
652 rs->sr_err = SLAPD_ABANDON;
656 /* check time limit */
657 if ( op->ors_tlimit != SLAP_NO_LIMIT
658 && slap_get_time() > stoptime )
660 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
661 rs->sr_ref = rs->sr_v2ref;
662 send_ldap_result( op, rs );
663 rs->sr_err = LDAP_SUCCESS;
668 /* get the entry with reader lock */
670 rs->sr_err = bdb_cache_find_id( op, ltid,
671 id, &ei, 0, locker, &lock );
673 if (rs->sr_err == LDAP_BUSY) {
674 rs->sr_text = "ldap server busy";
675 send_ldap_result( op, rs );
678 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
679 || rs->sr_err == DB_LOCK_NOTGRANTED )
681 goto fetch_entry_retry;
684 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
691 if( !BDB_IDL_IS_RANGE(candidates) ) {
692 /* only complain for non-range IDLs */
693 Debug( LDAP_DEBUG_TRACE,
694 LDAP_XSTRING(bdb_search)
695 ": candidate %ld not found\n",
704 #ifdef BDB_SUBENTRIES
706 if ( is_entry_subentry( e ) ) {
707 if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
708 if(!get_subentries_visibility( op )) {
709 /* only subentries are visible */
713 } else if ( get_subentries( op ) &&
714 !get_subentries_visibility( op ))
716 /* only subentries are visible */
720 } else if ( get_subentries_visibility( op )) {
721 /* only subentries are visible */
725 #endif /* BDB_SUBENTRIES */
727 /* Does this candidate actually satisfy the search scope?
729 * Note that we don't lock access to the bei_parent pointer.
730 * Since only leaf nodes can be deleted, the parent of any
731 * node will always be a valid node. Also since we have
732 * a Read lock on the data, it cannot be renamed out of the
733 * scope while we are looking at it, and unless we're using
734 * BDB_HIER, its parents cannot be moved either.
737 switch( op->ors_scope ) {
738 case LDAP_SCOPE_BASE:
739 /* This is always true, yes? */
740 if ( id == base.e_id ) scopeok = 1;
743 case LDAP_SCOPE_ONELEVEL:
744 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
747 #ifdef LDAP_SCOPE_CHILDREN
748 case LDAP_SCOPE_CHILDREN:
749 if ( id == base.e_id ) break;
752 case LDAP_SCOPE_SUBTREE: {
754 for ( tmp = BEI(e); tmp; tmp = tmp->bei_parent ) {
755 if ( tmp->bei_id == base.e_id ) {
763 /* aliases were already dereferenced in candidate list */
764 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
765 /* but if the search base is an alias, and we didn't
766 * deref it when finding, return it.
768 if ( is_entry_alias(e) &&
769 ((op->ors_deref & LDAP_DEREF_FINDING) ||
770 !bvmatch(&e->e_nname, &op->o_req_ndn)))
775 /* scopes is only non-empty for onelevel or subtree */
776 if ( !scopeok && BDB_IDL_N(scopes) ) {
778 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
779 x = bdb_idl_search( scopes, e->e_id );
780 if ( scopes[x] == e->e_id ) scopeok = 1;
782 /* subtree, walk up the tree */
783 EntryInfo *tmp = BEI(e);
784 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
785 x = bdb_idl_search( scopes, tmp->bei_id );
786 if ( scopes[x] == tmp->bei_id ) {
795 /* Not in scope, ignore it */
798 Debug( LDAP_DEBUG_TRACE,
799 LDAP_XSTRING(bdb_search)
800 ": %ld scope not okay\n",
806 * if it's a referral, add it to the list of referrals. only do
807 * this for non-base searches, and don't check the filter
808 * explicitly here since it's only a candidate anyway.
810 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
811 && is_entry_referral( e ) )
813 BerVarray erefs = get_entry_referrals( op, e );
814 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
815 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
816 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
818 send_search_reference( op, rs );
820 ber_bvarray_free( rs->sr_ref );
821 ber_bvarray_free( erefs );
827 if ( !manageDSAit && is_entry_glue( e )) {
831 /* if it matches the filter and scope, send it */
832 rs->sr_err = test_filter( op, rs->sr_entry, op->oq_search.rs_filter );
834 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
835 /* check size limit */
836 if ( --op->ors_slimit == -1 ) {
837 #ifdef SLAP_ZONE_ALLOC
838 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
840 bdb_cache_return_entry_r( bdb->bi_dbenv,
841 &bdb->bi_cache, e, &lock );
844 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
845 rs->sr_ref = rs->sr_v2ref;
846 send_ldap_result( op, rs );
847 rs->sr_err = LDAP_SUCCESS;
851 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
852 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
853 #ifdef SLAP_ZONE_ALLOC
854 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
856 bdb_cache_return_entry_r( bdb->bi_dbenv,
857 &bdb->bi_cache, e, &lock );
859 send_paged_response( op, rs, &lastid, tentries );
868 rs->sr_attrs = op->oq_search.rs_attrs;
869 rs->sr_operational_attrs = NULL;
872 rs->sr_err = LDAP_SUCCESS;
873 result = send_search_entry( op, rs );
876 case 0: /* entry sent ok */
878 case 1: /* entry not sent */
880 case -1: /* connection closed */
881 #ifdef SLAP_ZONE_ALLOC
882 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
884 bdb_cache_return_entry_r(bdb->bi_dbenv,
885 &bdb->bi_cache, e, &lock);
888 rs->sr_err = LDAP_OTHER;
894 Debug( LDAP_DEBUG_TRACE,
895 LDAP_XSTRING(bdb_search)
896 ": %ld does not match filter\n",
902 /* free reader lock */
903 #ifdef SLAP_ZONE_ALLOC
904 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
906 bdb_cache_return_entry_r( bdb->bi_dbenv,
907 &bdb->bi_cache, e , &lock );
912 ldap_pvt_thread_yield();
917 rs->sr_ref = rs->sr_v2ref;
918 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
919 rs->sr_rspoid = NULL;
920 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
921 send_paged_response( op, rs, NULL, 0 );
923 send_ldap_result( op, rs );
926 rs->sr_err = LDAP_SUCCESS;
930 LOCK_ID_FREE( bdb->bi_dbenv, locker );
933 ber_bvarray_free( rs->sr_v2ref );
936 if( realbase.bv_val ) ch_free( realbase.bv_val );
942 static int base_candidate(
947 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
948 e->e_nname.bv_val, (long) e->e_id, 0);
955 /* Look for "objectClass Present" in this filter.
956 * Also count depth of filter tree while we're at it.
958 static int oc_filter(
967 if( cur > *max ) *max = cur;
969 switch( f->f_choice ) {
970 case LDAP_FILTER_PRESENT:
971 if (f->f_desc == slap_schema.si_ad_objectClass) {
976 case LDAP_FILTER_AND:
979 for ( f=f->f_and; f; f=f->f_next ) {
980 (void) oc_filter(f, cur, max);
990 static void search_stack_free( void *key, void *data )
992 ber_memfree_x(data, NULL);
995 static void *search_stack( Operation *op )
997 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1000 if ( op->o_threadctx ) {
1001 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1004 ret = bdb->bi_search_stack;
1008 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1010 if ( op->o_threadctx ) {
1011 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1012 ret, search_stack_free );
1014 bdb->bi_search_stack = ret;
1020 static int search_candidates(
1028 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1030 Filter f, rf, xf, nf;
1032 #ifdef LDAP_COMP_MATCH
1033 AttributeAssertion aa_ref = { NULL, BER_BVNULL, NULL };
1035 AttributeAssertion aa_ref = { NULL, BER_BVNULL };
1037 #ifdef BDB_SUBENTRIES
1039 #ifdef LDAP_COMP_MATCH
1040 AttributeAssertion aa_subentry = { NULL, BER_BVNULL, NULL };
1042 AttributeAssertion aa_subentry = { NULL, BER_BVNULL };
1047 * This routine takes as input a filter (user-filter)
1048 * and rewrites it as follows:
1049 * (&(scope=DN)[(objectClass=subentry)]
1050 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1053 Debug(LDAP_DEBUG_TRACE,
1054 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1055 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1057 xf.f_or = op->oq_search.rs_filter;
1058 xf.f_choice = LDAP_FILTER_OR;
1061 /* If the user's filter uses objectClass=*,
1062 * these clauses are redundant.
1064 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1065 && !get_subentries_visibility(op)) {
1066 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1067 /* match referral objects */
1068 struct berval bv_ref = BER_BVC( "referral" );
1069 rf.f_choice = LDAP_FILTER_EQUALITY;
1071 rf.f_av_desc = slap_schema.si_ad_objectClass;
1072 rf.f_av_value = bv_ref;
1073 rf.f_next = xf.f_or;
1080 f.f_choice = LDAP_FILTER_AND;
1082 /* Dummy; we compute scope separately now */
1083 nf.f_choice = SLAPD_FILTER_COMPUTED;
1084 nf.f_result = LDAP_SUCCESS;
1085 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1086 ? op->oq_search.rs_filter : &xf ;
1087 /* Filter depth increased again, adding dummy clause */
1090 #ifdef BDB_SUBENTRIES
1091 if( get_subentries_visibility( op ) ) {
1092 struct berval bv_subentry = BER_BVC( "subentry" );
1093 sf.f_choice = LDAP_FILTER_EQUALITY;
1094 sf.f_ava = &aa_subentry;
1095 sf.f_av_desc = slap_schema.si_ad_objectClass;
1096 sf.f_av_value = bv_subentry;
1097 sf.f_next = nf.f_next;
1102 /* Allocate IDL stack, plus 1 more for former tmp */
1103 if ( depth+1 > bdb->bi_search_stack_depth ) {
1104 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1106 stack = search_stack( op );
1109 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1110 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1112 rc = bdb_dn2idl( op, e, ids, stack );
1115 if ( rc == LDAP_SUCCESS ) {
1116 rc = bdb_filter_candidates( op, &f, ids,
1117 stack, stack+BDB_IDL_UM_SIZE );
1120 if ( depth+1 > bdb->bi_search_stack_depth ) {
1125 Debug(LDAP_DEBUG_TRACE,
1126 "bdb_search_candidates: failed (rc=%d)\n",
1130 Debug(LDAP_DEBUG_TRACE,
1131 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1133 (long) BDB_IDL_FIRST(ids),
1134 (long) BDB_IDL_LAST(ids) );
1141 parse_paged_cookie( Operation *op, SlapReply *rs )
1144 int rc = LDAP_SUCCESS;
1148 struct berval cookie = BER_BVNULL;
1149 PagedResultsState *ps = op->o_pagedresults_state;
1151 /* this function must be invoked only if the pagedResults
1152 * control has been detected, parsed and partially checked
1153 * by the frontend */
1154 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1156 /* look for the appropriate ctrl structure */
1157 for ( c = op->o_ctrls; c[0] != NULL; c++ ) {
1158 if ( strcmp( c[0]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 )
1164 if ( c[0] == NULL ) {
1165 rs->sr_text = "missing pagedResults control";
1166 return LDAP_PROTOCOL_ERROR;
1169 /* Tested by frontend */
1170 assert( c[0]->ldctl_value.bv_len > 0 );
1172 /* Parse the control value
1173 * realSearchControlValue ::= SEQUENCE {
1174 * size INTEGER (0..maxInt),
1175 * -- requested page size from client
1176 * -- result set size estimate from server
1177 * cookie OCTET STRING
1180 ber = ber_init( &c[0]->ldctl_value );
1181 if ( ber == NULL ) {
1182 rs->sr_text = "internal error";
1186 tag = ber_scanf( ber, "{im}", &size, &cookie );
1188 /* Tested by frontend */
1189 assert( tag != LBER_ERROR );
1190 assert( size >= 0 );
1192 /* cookie decoding/checks deferred to backend... */
1193 if ( cookie.bv_len ) {
1194 PagedResultsCookie reqcookie;
1195 if( cookie.bv_len != sizeof( reqcookie ) ) {
1197 rs->sr_text = "paged results cookie is invalid";
1198 rc = LDAP_PROTOCOL_ERROR;
1202 AC_MEMCPY( &reqcookie, cookie.bv_val, sizeof( reqcookie ));
1204 if ( reqcookie > ps->ps_cookie ) {
1206 rs->sr_text = "paged results cookie is invalid";
1207 rc = LDAP_PROTOCOL_ERROR;
1210 } else if ( reqcookie < ps->ps_cookie ) {
1211 rs->sr_text = "paged results cookie is invalid or old";
1212 rc = LDAP_UNWILLING_TO_PERFORM;
1217 /* Initial request. Initialize state. */
1219 if ( op->o_conn->c_pagedresults_state.ps_cookie != 0 ) {
1220 /* There's another pagedResults control on the
1221 * same connection; reject new pagedResults controls
1222 * (allowed by RFC2696) */
1223 rs->sr_text = "paged results cookie unavailable; try later";
1224 rc = LDAP_UNWILLING_TO_PERFORM;
1233 (void)ber_free( ber, 1 );
1239 send_paged_response(
1245 LDAPControl ctrl, *ctrls[2];
1246 BerElementBuffer berbuf;
1247 BerElement *ber = (BerElement *)&berbuf;
1248 PagedResultsCookie respcookie;
1249 struct berval cookie;
1251 Debug(LDAP_DEBUG_ARGS,
1252 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1253 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1255 BER_BVZERO( &ctrl.ldctl_value );
1259 ber_init2( ber, NULL, LBER_USE_DER );
1262 respcookie = ( PagedResultsCookie )(*lastid);
1263 cookie.bv_len = sizeof( respcookie );
1264 cookie.bv_val = (char *)&respcookie;
1267 respcookie = ( PagedResultsCookie )0;
1268 BER_BVSTR( &cookie, "" );
1271 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1272 op->o_conn->c_pagedresults_state.ps_count =
1273 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1276 /* return size of 0 -- no estimate */
1277 ber_printf( ber, "{iO}", 0, &cookie );
1279 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1283 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1284 ctrls[0]->ldctl_iscritical = 0;
1286 rs->sr_ctrls = ctrls;
1287 rs->sr_err = LDAP_SUCCESS;
1288 send_ldap_result( op, rs );
1289 rs->sr_ctrls = NULL;
1292 (void) ber_free_buf( ber );