1 /* search.c - search operation */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2007 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, *matched, lock);
125 /* We found a regular entry. Return this to the caller. The
126 * entry is still locked for Read.
128 if (!is_entry_alias(e)) {
129 rs->sr_err = LDAP_SUCCESS;
137 /* Look for and dereference all aliases within the search scope. Adds
138 * the dereferenced entries to the "ids" list. Requires "stack" to be
139 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
140 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
142 static int search_aliases(
151 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
152 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
153 ID cursora, ida, cursoro, ido, *subscop2;
156 struct berval bv_alias = BER_BVC( "alias" );
157 AttributeAssertion aa_alias = ATTRIBUTEASSERTION_INIT;
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, locker, &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, locker, &e->e_nname, BEI(e), subscop,
206 subscop2+BDB_IDL_DB_SIZE );
210 bdb_cache_return_entry_r (bdb, 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, a, &lockr);
240 /* Actually dereference the alias */
242 a = deref_base( op, rs, a, &matched, locker, &lockr,
245 /* If the target was not already in our current candidates,
246 * make note of it in the newsubs list. Also
247 * set it in the scopes list so that bdb_search
250 if (bdb_idl_insert(ids, a->e_id) == 0) {
251 bdb_idl_insert(newsubs, a->e_id);
252 bdb_idl_insert(scopes, a->e_id);
254 bdb_cache_return_entry_r( bdb, a, &lockr);
256 } else if (matched) {
257 /* Alias could not be dereferenced, or it deref'd to
258 * an ID we've already seen. Ignore it.
260 bdb_cache_return_entry_r( bdb, matched, &lockr );
264 /* If this is a OneLevel search, we're done; oldsubs only had one
265 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
267 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
269 ido = bdb_idl_next( oldsubs, &cursoro );
271 /* If we're done processing the old scopes, did we add any new
272 * scopes in this iteration? If so, go back and do those now.
275 if (BDB_IDL_IS_ZERO(newsubs)) break;
276 BDB_IDL_CPY(oldsubs, newsubs);
277 BDB_IDL_ZERO(newsubs);
279 ido = bdb_idl_first( oldsubs, &cursoro );
282 /* Find the entry corresponding to the next scope. If it can't
283 * be found, ignore it and move on. This should never happen;
284 * we should never see the ID of an entry that doesn't exist.
285 * Set the name so that the scope's IDL can be retrieved.
289 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
291 if ( rs->sr_err != LDAP_SUCCESS ) {
292 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
293 rs->sr_err == DB_LOCK_NOTGRANTED )
303 bdb_search( Operation *op, SlapReply *rs )
305 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
308 ID candidates[BDB_IDL_UM_SIZE];
309 ID scopes[BDB_IDL_DB_SIZE];
310 Entry *e = NULL, base, *e_root;
311 Entry *matched = NULL;
313 struct berval realbase = BER_BVNULL;
318 AttributeName *attrs;
320 BDB_LOCKER locker = 0;
322 struct bdb_op_info *opinfo = NULL;
325 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_search) "\n", 0, 0, 0);
326 attrs = op->oq_search.rs_attrs;
328 opinfo = (struct bdb_op_info *) op->o_private;
330 manageDSAit = get_manageDSAit( op );
332 if ( opinfo && opinfo->boi_txn ) {
333 ltid = opinfo->boi_txn;
334 locker = TXN_ID( ltid );
336 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
342 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
347 e_root = bdb->bi_cache.c_dntree.bei_e;
348 if ( op->o_req_ndn.bv_len == 0 ) {
349 /* DIT root special case */
350 ei = e_root->e_private;
351 rs->sr_err = LDAP_SUCCESS;
353 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
354 BDB_IDL_ZERO(candidates);
357 /* get entry with reader lock */
358 rs->sr_err = bdb_dn2entry( op, ltid, &op->o_req_ndn, &ei,
370 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
372 LOCK_ID_FREE (bdb->bi_dbenv, locker );
374 case DB_LOCK_DEADLOCK:
375 case DB_LOCK_NOTGRANTED:
378 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
380 LOCK_ID_FREE (bdb->bi_dbenv, locker );
384 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
385 if ( matched && is_entry_alias( matched )) {
388 stub.bv_val = op->o_req_ndn.bv_val;
389 stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
390 e = deref_base( op, rs, matched, &matched, locker, &lock,
393 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
395 bdb_cache_return_entry_r (bdb, e, &lock);
399 } else if ( e && is_entry_alias( e )) {
400 e = deref_base( op, rs, e, &matched, locker, &lock,
406 struct berval matched_dn = BER_BVNULL;
408 if ( matched != NULL ) {
409 BerVarray erefs = NULL;
411 /* return referral only if "disclose"
412 * is granted on the object */
413 if ( ! access_allowed( op, matched,
414 slap_schema.si_ad_entry,
415 NULL, ACL_DISCLOSE, NULL ) )
417 rs->sr_err = LDAP_NO_SUCH_OBJECT;
420 ber_dupbv( &matched_dn, &matched->e_name );
422 erefs = is_entry_referral( matched )
423 ? get_entry_referrals( op, matched )
425 if ( rs->sr_err == DB_NOTFOUND )
426 rs->sr_err = LDAP_REFERRAL;
427 rs->sr_matched = matched_dn.bv_val;
430 #ifdef SLAP_ZONE_ALLOC
431 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
433 bdb_cache_return_entry_r (bdb, matched, &lock);
437 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
438 &op->o_req_dn, op->oq_search.rs_scope );
439 ber_bvarray_free( erefs );
443 #ifdef SLAP_ZONE_ALLOC
444 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
446 rs->sr_ref = referral_rewrite( default_referral,
447 NULL, &op->o_req_dn, op->oq_search.rs_scope );
448 rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
451 send_ldap_result( op, rs );
454 LOCK_ID_FREE (bdb->bi_dbenv, locker );
456 ber_bvarray_free( rs->sr_ref );
459 if ( !BER_BVISNULL( &matched_dn ) ) {
460 ber_memfree( matched_dn.bv_val );
461 rs->sr_matched = NULL;
466 /* NOTE: __NEW__ "search" access is required
467 * on searchBase object */
468 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
469 NULL, ACL_SEARCH, NULL, &mask ) )
471 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
472 rs->sr_err = LDAP_NO_SUCH_OBJECT;
474 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
477 #ifdef SLAP_ZONE_ALLOC
478 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
481 bdb_cache_return_entry_r(bdb, e, &lock);
483 send_ldap_result( op, rs );
487 if ( !manageDSAit && e != e_root && is_entry_referral( e ) ) {
488 /* entry is a referral, don't allow add */
489 struct berval matched_dn = BER_BVNULL;
490 BerVarray erefs = NULL;
492 ber_dupbv( &matched_dn, &e->e_name );
493 erefs = get_entry_referrals( op, e );
495 rs->sr_err = LDAP_REFERRAL;
497 #ifdef SLAP_ZONE_ALLOC
498 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
500 bdb_cache_return_entry_r( bdb, e, &lock );
504 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
505 &op->o_req_dn, op->oq_search.rs_scope );
506 ber_bvarray_free( erefs );
509 rs->sr_text = "bad_referral object";
513 Debug( LDAP_DEBUG_TRACE,
514 LDAP_XSTRING(bdb_search) ": entry is referral\n",
517 rs->sr_matched = matched_dn.bv_val;
518 send_ldap_result( op, rs );
521 LOCK_ID_FREE (bdb->bi_dbenv, locker );
523 ber_bvarray_free( rs->sr_ref );
525 ber_memfree( matched_dn.bv_val );
526 rs->sr_matched = NULL;
530 if ( get_assert( op ) &&
531 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
533 rs->sr_err = LDAP_ASSERTION_FAILED;
534 #ifdef SLAP_ZONE_ALLOC
535 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
538 bdb_cache_return_entry_r(bdb, e, &lock);
540 send_ldap_result( op, rs );
544 /* compute it anyway; root does not use it */
545 stoptime = op->o_time + op->ors_tlimit;
547 /* need normalized dn below */
548 ber_dupbv( &realbase, &e->e_nname );
550 /* Copy info to base, must free entry before accessing the database
551 * in search_candidates, to avoid deadlocks.
553 base.e_private = e->e_private;
554 base.e_nname = realbase;
557 #ifdef SLAP_ZONE_ALLOC
558 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
561 bdb_cache_return_entry_r(bdb, e, &lock);
565 /* select candidates */
566 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
567 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
570 BDB_IDL_ZERO( candidates );
571 BDB_IDL_ZERO( scopes );
572 rs->sr_err = search_candidates( op, rs, &base,
573 locker, candidates, scopes );
576 /* start cursor at beginning of candidates.
580 if ( candidates[0] == 0 ) {
581 Debug( LDAP_DEBUG_TRACE,
582 LDAP_XSTRING(bdb_search) ": no candidates\n",
588 /* if not root and candidates exceed to-be-checked entries, abort */
589 if ( op->ors_limit /* isroot == FALSE */ &&
590 op->ors_limit->lms_s_unchecked != -1 &&
591 BDB_IDL_N(candidates) > (unsigned) op->ors_limit->lms_s_unchecked )
593 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
594 send_ldap_result( op, rs );
595 rs->sr_err = LDAP_SUCCESS;
599 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
600 !op->ors_limit->lms_s_pr_hide )
602 tentries = BDB_IDL_N(candidates);
605 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
606 PagedResultsState *ps = op->o_pagedresults_state;
607 /* deferred cookie parsing */
608 rs->sr_err = parse_paged_cookie( op, rs );
609 if ( rs->sr_err != LDAP_SUCCESS ) {
610 send_ldap_result( op, rs );
614 if ( (ID)( ps->ps_cookie ) == 0 ) {
615 id = bdb_idl_first( candidates, &cursor );
618 if ( ps->ps_size == 0 ) {
619 rs->sr_err = LDAP_SUCCESS;
620 rs->sr_text = "search abandoned by pagedResult size=0";
621 send_ldap_result( op, rs );
624 for ( id = bdb_idl_first( candidates, &cursor );
626 id <= (ID)( ps->ps_cookie );
627 id = bdb_idl_next( candidates, &cursor ) )
633 if ( cursor == NOID ) {
634 Debug( LDAP_DEBUG_TRACE,
635 LDAP_XSTRING(bdb_search)
636 ": no paged results candidates\n",
638 send_paged_response( op, rs, &lastid, 0 );
640 rs->sr_err = LDAP_OTHER;
646 for ( id = bdb_idl_first( candidates, &cursor );
647 id != NOID ; id = bdb_idl_next( candidates, &cursor ) )
653 /* check for abandon */
654 if ( op->o_abandon ) {
655 rs->sr_err = SLAPD_ABANDON;
659 /* mostly needed by internal searches,
660 * e.g. related to syncrepl, for whom
661 * abandon does not get set... */
662 if ( slapd_shutdown ) {
663 rs->sr_err = LDAP_UNAVAILABLE;
664 send_ldap_disconnect( op, rs );
668 /* check time limit */
669 if ( op->ors_tlimit != SLAP_NO_LIMIT
670 && slap_get_time() > stoptime )
672 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
673 rs->sr_ref = rs->sr_v2ref;
674 send_ldap_result( op, rs );
675 rs->sr_err = LDAP_SUCCESS;
680 /* get the entry with reader lock */
682 rs->sr_err = bdb_cache_find_id( op, ltid,
683 id, &ei, 0, locker, &lock );
685 if (rs->sr_err == LDAP_BUSY) {
686 rs->sr_text = "ldap server busy";
687 send_ldap_result( op, rs );
690 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
691 || rs->sr_err == DB_LOCK_NOTGRANTED )
693 goto fetch_entry_retry;
696 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
703 if( !BDB_IDL_IS_RANGE(candidates) ) {
704 /* only complain for non-range IDLs */
705 Debug( LDAP_DEBUG_TRACE,
706 LDAP_XSTRING(bdb_search)
707 ": candidate %ld not found\n",
716 if ( is_entry_subentry( e ) ) {
717 if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
718 if(!get_subentries_visibility( op )) {
719 /* only subentries are visible */
723 } else if ( get_subentries( op ) &&
724 !get_subentries_visibility( op ))
726 /* only subentries are visible */
730 } else if ( get_subentries_visibility( op )) {
731 /* only subentries are visible */
735 /* Does this candidate actually satisfy the search scope?
737 * Note that we don't lock access to the bei_parent pointer.
738 * Since only leaf nodes can be deleted, the parent of any
739 * node will always be a valid node. Also since we have
740 * a Read lock on the data, it cannot be renamed out of the
741 * scope while we are looking at it, and unless we're using
742 * BDB_HIER, its parents cannot be moved either.
745 switch( op->ors_scope ) {
746 case LDAP_SCOPE_BASE:
747 /* This is always true, yes? */
748 if ( id == base.e_id ) scopeok = 1;
751 case LDAP_SCOPE_ONELEVEL:
752 if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
755 #ifdef LDAP_SCOPE_CHILDREN
756 case LDAP_SCOPE_CHILDREN:
757 if ( id == base.e_id ) break;
760 case LDAP_SCOPE_SUBTREE: {
762 for ( tmp = BEI(e); tmp; tmp = tmp->bei_parent ) {
763 if ( tmp->bei_id == base.e_id ) {
771 /* aliases were already dereferenced in candidate list */
772 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
773 /* but if the search base is an alias, and we didn't
774 * deref it when finding, return it.
776 if ( is_entry_alias(e) &&
777 ((op->ors_deref & LDAP_DEREF_FINDING) ||
778 !bvmatch(&e->e_nname, &op->o_req_ndn)))
783 /* scopes is only non-empty for onelevel or subtree */
784 if ( !scopeok && BDB_IDL_N(scopes) ) {
786 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
787 x = bdb_idl_search( scopes, e->e_id );
788 if ( scopes[x] == e->e_id ) scopeok = 1;
790 /* subtree, walk up the tree */
791 EntryInfo *tmp = BEI(e);
792 for (;tmp->bei_parent; tmp=tmp->bei_parent) {
793 x = bdb_idl_search( scopes, tmp->bei_id );
794 if ( scopes[x] == tmp->bei_id ) {
803 /* Not in scope, ignore it */
806 Debug( LDAP_DEBUG_TRACE,
807 LDAP_XSTRING(bdb_search)
808 ": %ld scope not okay\n",
814 * if it's a referral, add it to the list of referrals. only do
815 * this for non-base searches, and don't check the filter
816 * explicitly here since it's only a candidate anyway.
818 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
819 && is_entry_referral( e ) )
821 BerVarray erefs = get_entry_referrals( op, e );
822 rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
823 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
824 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
826 send_search_reference( op, rs );
828 ber_bvarray_free( rs->sr_ref );
829 ber_bvarray_free( erefs );
835 if ( !manageDSAit && is_entry_glue( e )) {
839 /* if it matches the filter and scope, send it */
840 rs->sr_err = test_filter( op, rs->sr_entry, op->oq_search.rs_filter );
842 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
843 /* check size limit */
844 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
845 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
846 #ifdef SLAP_ZONE_ALLOC
847 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
849 bdb_cache_return_entry_r( bdb, e, &lock );
851 send_paged_response( op, rs, &lastid, tentries );
859 rs->sr_attrs = op->oq_search.rs_attrs;
860 rs->sr_operational_attrs = NULL;
863 rs->sr_err = LDAP_SUCCESS;
864 rs->sr_err = send_search_entry( op, rs );
866 switch ( rs->sr_err ) {
867 case LDAP_SUCCESS: /* entry sent ok */
869 default: /* entry not sent */
871 case LDAP_UNAVAILABLE:
872 case LDAP_SIZELIMIT_EXCEEDED:
873 #ifdef SLAP_ZONE_ALLOC
874 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
876 bdb_cache_return_entry_r(bdb, e, &lock);
879 if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
880 rs->sr_ref = rs->sr_v2ref;
881 send_ldap_result( op, rs );
882 rs->sr_err = LDAP_SUCCESS;
885 rs->sr_err = LDAP_OTHER;
892 Debug( LDAP_DEBUG_TRACE,
893 LDAP_XSTRING(bdb_search)
894 ": %ld does not match filter\n",
900 /* free reader lock */
901 #ifdef SLAP_ZONE_ALLOC
902 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
904 bdb_cache_return_entry_r( bdb, e , &lock );
912 rs->sr_ref = rs->sr_v2ref;
913 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
914 rs->sr_rspoid = NULL;
915 if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
916 send_paged_response( op, rs, NULL, 0 );
918 send_ldap_result( op, rs );
921 rs->sr_err = LDAP_SUCCESS;
925 LOCK_ID_FREE( bdb->bi_dbenv, locker );
928 ber_bvarray_free( rs->sr_v2ref );
931 if( realbase.bv_val ) ch_free( realbase.bv_val );
937 static int base_candidate(
942 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
943 e->e_nname.bv_val, (long) e->e_id, 0);
950 /* Look for "objectClass Present" in this filter.
951 * Also count depth of filter tree while we're at it.
953 static int oc_filter(
962 if( cur > *max ) *max = cur;
964 switch( f->f_choice ) {
965 case LDAP_FILTER_PRESENT:
966 if (f->f_desc == slap_schema.si_ad_objectClass) {
971 case LDAP_FILTER_AND:
974 for ( f=f->f_and; f; f=f->f_next ) {
975 (void) oc_filter(f, cur, max);
985 static void search_stack_free( void *key, void *data )
987 ber_memfree_x(data, NULL);
990 static void *search_stack( Operation *op )
992 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
995 if ( op->o_threadctx ) {
996 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
999 ret = bdb->bi_search_stack;
1003 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1005 if ( op->o_threadctx ) {
1006 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1007 ret, search_stack_free );
1009 bdb->bi_search_stack = ret;
1015 static int search_candidates(
1023 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1025 Filter f, rf, xf, nf;
1027 AttributeAssertion aa_ref = ATTRIBUTEASSERTION_INIT;
1029 AttributeAssertion aa_subentry = ATTRIBUTEASSERTION_INIT;
1032 * This routine takes as input a filter (user-filter)
1033 * and rewrites it as follows:
1034 * (&(scope=DN)[(objectClass=subentry)]
1035 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1038 Debug(LDAP_DEBUG_TRACE,
1039 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1040 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1042 xf.f_or = op->oq_search.rs_filter;
1043 xf.f_choice = LDAP_FILTER_OR;
1046 /* If the user's filter uses objectClass=*,
1047 * these clauses are redundant.
1049 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1050 && !get_subentries_visibility(op)) {
1051 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1052 /* match referral objects */
1053 struct berval bv_ref = BER_BVC( "referral" );
1054 rf.f_choice = LDAP_FILTER_EQUALITY;
1056 rf.f_av_desc = slap_schema.si_ad_objectClass;
1057 rf.f_av_value = bv_ref;
1058 rf.f_next = xf.f_or;
1065 f.f_choice = LDAP_FILTER_AND;
1067 /* Dummy; we compute scope separately now */
1068 nf.f_choice = SLAPD_FILTER_COMPUTED;
1069 nf.f_result = LDAP_SUCCESS;
1070 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1071 ? op->oq_search.rs_filter : &xf ;
1072 /* Filter depth increased again, adding dummy clause */
1075 if( get_subentries_visibility( op ) ) {
1076 struct berval bv_subentry = BER_BVC( "subentry" );
1077 sf.f_choice = LDAP_FILTER_EQUALITY;
1078 sf.f_ava = &aa_subentry;
1079 sf.f_av_desc = slap_schema.si_ad_objectClass;
1080 sf.f_av_value = bv_subentry;
1081 sf.f_next = nf.f_next;
1085 /* Allocate IDL stack, plus 1 more for former tmp */
1086 if ( depth+1 > bdb->bi_search_stack_depth ) {
1087 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1089 stack = search_stack( op );
1092 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1093 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1095 rc = bdb_dn2idl( op, locker, &e->e_nname, BEI(e), ids, stack );
1098 if ( rc == LDAP_SUCCESS ) {
1099 rc = bdb_filter_candidates( op, locker, &f, ids,
1100 stack, stack+BDB_IDL_UM_SIZE );
1103 if ( depth+1 > bdb->bi_search_stack_depth ) {
1108 Debug(LDAP_DEBUG_TRACE,
1109 "bdb_search_candidates: failed (rc=%d)\n",
1113 Debug(LDAP_DEBUG_TRACE,
1114 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1116 (long) BDB_IDL_FIRST(ids),
1117 (long) BDB_IDL_LAST(ids) );
1124 parse_paged_cookie( Operation *op, SlapReply *rs )
1127 int rc = LDAP_SUCCESS;
1131 struct berval cookie = BER_BVNULL;
1132 PagedResultsState *ps = op->o_pagedresults_state;
1134 /* this function must be invoked only if the pagedResults
1135 * control has been detected, parsed and partially checked
1136 * by the frontend */
1137 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1139 /* look for the appropriate ctrl structure */
1140 for ( c = op->o_ctrls; c[0] != NULL; c++ ) {
1141 if ( strcmp( c[0]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 )
1147 if ( c[0] == NULL ) {
1148 rs->sr_text = "missing pagedResults control";
1149 return LDAP_PROTOCOL_ERROR;
1152 /* Tested by frontend */
1153 assert( c[0]->ldctl_value.bv_len > 0 );
1155 /* Parse the control value
1156 * realSearchControlValue ::= SEQUENCE {
1157 * size INTEGER (0..maxInt),
1158 * -- requested page size from client
1159 * -- result set size estimate from server
1160 * cookie OCTET STRING
1163 ber = ber_init( &c[0]->ldctl_value );
1164 if ( ber == NULL ) {
1165 rs->sr_text = "internal error";
1169 tag = ber_scanf( ber, "{im}", &size, &cookie );
1171 /* Tested by frontend */
1172 assert( tag != LBER_ERROR );
1173 assert( size >= 0 );
1175 /* cookie decoding/checks deferred to backend... */
1176 if ( cookie.bv_len ) {
1177 PagedResultsCookie reqcookie;
1178 if( cookie.bv_len != sizeof( reqcookie ) ) {
1180 rs->sr_text = "paged results cookie is invalid";
1181 rc = LDAP_PROTOCOL_ERROR;
1185 AC_MEMCPY( &reqcookie, cookie.bv_val, sizeof( reqcookie ));
1187 if ( reqcookie > ps->ps_cookie ) {
1189 rs->sr_text = "paged results cookie is invalid";
1190 rc = LDAP_PROTOCOL_ERROR;
1193 } else if ( reqcookie < ps->ps_cookie ) {
1194 rs->sr_text = "paged results cookie is invalid or old";
1195 rc = LDAP_UNWILLING_TO_PERFORM;
1200 /* Initial request. Initialize state. */
1202 if ( op->o_conn->c_pagedresults_state.ps_cookie != 0 ) {
1203 /* There's another pagedResults control on the
1204 * same connection; reject new pagedResults controls
1205 * (allowed by RFC2696) */
1206 rs->sr_text = "paged results cookie unavailable; try later";
1207 rc = LDAP_UNWILLING_TO_PERFORM;
1216 (void)ber_free( ber, 1 );
1222 send_paged_response(
1228 LDAPControl ctrl, *ctrls[2];
1229 BerElementBuffer berbuf;
1230 BerElement *ber = (BerElement *)&berbuf;
1231 PagedResultsCookie respcookie;
1232 struct berval cookie;
1234 Debug(LDAP_DEBUG_ARGS,
1235 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1236 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1238 BER_BVZERO( &ctrl.ldctl_value );
1242 ber_init2( ber, NULL, LBER_USE_DER );
1245 respcookie = ( PagedResultsCookie )(*lastid);
1246 cookie.bv_len = sizeof( respcookie );
1247 cookie.bv_val = (char *)&respcookie;
1250 respcookie = ( PagedResultsCookie )0;
1251 BER_BVSTR( &cookie, "" );
1254 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1255 op->o_conn->c_pagedresults_state.ps_count =
1256 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1259 /* return size of 0 -- no estimate */
1260 ber_printf( ber, "{iO}", 0, &cookie );
1262 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1266 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1267 ctrls[0]->ldctl_iscritical = 0;
1269 rs->sr_ctrls = ctrls;
1270 rs->sr_err = LDAP_SUCCESS;
1271 send_ldap_result( op, rs );
1272 rs->sr_ctrls = NULL;
1275 (void) ber_free_buf( ber );