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 #ifdef LDAP_COMP_MATCH
158 AttributeAssertion aa_alias = { NULL, BER_BVNULL, NULL };
160 AttributeAssertion aa_alias = { NULL, BER_BVNULL };
163 DB_LOCK locka, lockr;
166 aliases = stack; /* IDL of all aliases in the database */
167 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
168 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
169 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
170 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
171 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
172 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
174 /* A copy of subscop, because subscop gets clobbered by
175 * the bdb_idl_union/intersection routines
177 subscop2 = tmp + BDB_IDL_DB_SIZE;
179 af.f_choice = LDAP_FILTER_EQUALITY;
180 af.f_ava = &aa_alias;
181 af.f_av_desc = slap_schema.si_ad_objectClass;
182 af.f_av_value = bv_alias;
185 /* Find all aliases in database */
186 BDB_IDL_ZERO( aliases );
187 rs->sr_err = bdb_filter_candidates( op, locker, &af, aliases,
189 if (rs->sr_err != LDAP_SUCCESS) {
193 oldsubs[1] = e->e_id;
196 BDB_IDL_ZERO( visited );
197 BDB_IDL_ZERO( newsubs );
200 ido = bdb_idl_first( oldsubs, &cursoro );
203 /* Set curscop to only the aliases in the current scope. Start with
204 * all the aliases, obtain the IDL for the current scope, and then
205 * get the intersection of these two IDLs. Add the current scope
206 * to the cumulative list of candidates.
208 BDB_IDL_CPY( curscop, aliases );
209 rs->sr_err = bdb_dn2idl( op, locker, e, subscop,
210 subscop2+BDB_IDL_DB_SIZE );
214 bdb_cache_return_entry_r (bdb, e, &locka);
216 BDB_IDL_CPY(subscop2, subscop);
217 rs->sr_err = bdb_idl_intersection(curscop, subscop);
218 bdb_idl_union( ids, subscop2 );
220 /* Dereference all of the aliases in the current scope. */
222 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
223 ida = bdb_idl_next(curscop, &cursora))
227 rs->sr_err = bdb_cache_find_id(op, NULL,
228 ida, &ei, 0, locker, &lockr );
229 if (rs->sr_err != LDAP_SUCCESS) {
230 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
231 rs->sr_err == DB_LOCK_NOTGRANTED ) goto retry1;
236 /* This should only happen if the curscop IDL has maxed out and
237 * turned into a range that spans IDs indiscriminately
239 if (!is_entry_alias(a)) {
240 bdb_cache_return_entry_r (bdb, a, &lockr);
244 /* Actually dereference the alias */
246 a = deref_base( op, rs, a, &matched, locker, &lockr,
249 /* If the target was not already in our current candidates,
250 * make note of it in the newsubs list. Also
251 * set it in the scopes list so that bdb_search
254 if (bdb_idl_insert(ids, a->e_id) == 0) {
255 bdb_idl_insert(newsubs, a->e_id);
256 bdb_idl_insert(scopes, a->e_id);
258 bdb_cache_return_entry_r( bdb, a, &lockr);
260 } else if (matched) {
261 /* Alias could not be dereferenced, or it deref'd to
262 * an ID we've already seen. Ignore it.
264 bdb_cache_return_entry_r( bdb, matched, &lockr );
268 /* If this is a OneLevel search, we're done; oldsubs only had one
269 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
271 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
273 ido = bdb_idl_next( oldsubs, &cursoro );
275 /* If we're done processing the old scopes, did we add any new
276 * scopes in this iteration? If so, go back and do those now.
279 if (BDB_IDL_IS_ZERO(newsubs)) break;
280 BDB_IDL_CPY(oldsubs, newsubs);
281 BDB_IDL_ZERO(newsubs);
283 ido = bdb_idl_first( oldsubs, &cursoro );
286 /* Find the entry corresponding to the next scope. If it can't
287 * be found, ignore it and move on. This should never happen;
288 * we should never see the ID of an entry that doesn't exist.
289 * Set the name so that the scope's IDL can be retrieved.
293 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
295 if ( rs->sr_err != LDAP_SUCCESS ) {
296 if ( rs->sr_err == DB_LOCK_DEADLOCK ||
297 rs->sr_err == DB_LOCK_NOTGRANTED )
307 bdb_search( Operation *op, SlapReply *rs )
309 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
312 ID candidates[BDB_IDL_UM_SIZE];
313 ID scopes[BDB_IDL_DB_SIZE];
314 Entry *e = NULL, base, e_root = {0};
315 Entry *matched = NULL;
316 EntryInfo *ei, ei_root = {0};
317 struct berval realbase = BER_BVNULL;
322 AttributeName *attrs;
324 u_int32_t locker = 0;
326 struct bdb_op_info *opinfo = NULL;
329 Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_search) "\n", 0, 0, 0);
330 attrs = op->oq_search.rs_attrs;
332 opinfo = (struct bdb_op_info *) op->o_private;
334 manageDSAit = get_manageDSAit( op );
336 if ( opinfo && opinfo->boi_txn ) {
337 ltid = opinfo->boi_txn;
338 locker = TXN_ID( ltid );
340 rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
346 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
351 if ( op->o_req_ndn.bv_len == 0 ) {
352 /* DIT root special case */
353 ei_root.bei_e = &e_root;
354 ei_root.bei_parent = &ei_root;
355 e_root.e_private = &ei_root;
357 BER_BVSTR( &e_root.e_nname, "" );
358 BER_BVSTR( &e_root.e_name, "" );
360 rs->sr_err = LDAP_SUCCESS;
362 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
363 BDB_IDL_ZERO(candidates);
366 /* get entry with reader lock */
367 rs->sr_err = bdb_dn2entry( op, ltid, &op->o_req_ndn, &ei,
379 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
381 LOCK_ID_FREE (bdb->bi_dbenv, locker );
383 case DB_LOCK_DEADLOCK:
384 case DB_LOCK_NOTGRANTED:
387 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
389 LOCK_ID_FREE (bdb->bi_dbenv, locker );
393 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
394 if ( matched && is_entry_alias( matched )) {
397 stub.bv_val = op->o_req_ndn.bv_val;
398 stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
399 e = deref_base( op, rs, matched, &matched, locker, &lock,
402 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
404 bdb_cache_return_entry_r (bdb, e, &lock);
408 } else if ( e && is_entry_alias( e )) {
409 e = deref_base( op, rs, e, &matched, locker, &lock,
415 struct berval matched_dn = BER_BVNULL;
417 if ( matched != NULL ) {
418 BerVarray erefs = NULL;
420 /* return referral only if "disclose"
421 * is granted on the object */
422 if ( ! access_allowed( op, matched,
423 slap_schema.si_ad_entry,
424 NULL, ACL_DISCLOSE, NULL ) )
426 rs->sr_err = LDAP_NO_SUCH_OBJECT;
429 ber_dupbv( &matched_dn, &matched->e_name );
431 erefs = is_entry_referral( matched )
432 ? get_entry_referrals( op, matched )
434 if ( rs->sr_err == DB_NOTFOUND )
435 rs->sr_err = LDAP_REFERRAL;
436 rs->sr_matched = matched_dn.bv_val;
439 #ifdef SLAP_ZONE_ALLOC
440 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
442 bdb_cache_return_entry_r (bdb, matched, &lock);
446 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
447 &op->o_req_dn, op->oq_search.rs_scope );
448 ber_bvarray_free( erefs );
452 #ifdef SLAP_ZONE_ALLOC
453 slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
455 rs->sr_ref = referral_rewrite( default_referral,
456 NULL, &op->o_req_dn, op->oq_search.rs_scope );
457 rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
460 send_ldap_result( op, rs );
463 LOCK_ID_FREE (bdb->bi_dbenv, locker );
465 ber_bvarray_free( rs->sr_ref );
468 if ( !BER_BVISNULL( &matched_dn ) ) {
469 ber_memfree( matched_dn.bv_val );
470 rs->sr_matched = NULL;
475 /* NOTE: __NEW__ "search" access is required
476 * on searchBase object */
477 if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
478 NULL, ACL_SEARCH, NULL, &mask ) )
480 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
481 rs->sr_err = LDAP_NO_SUCH_OBJECT;
483 rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
486 #ifdef SLAP_ZONE_ALLOC
487 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
489 if ( e != &e_root ) {
490 bdb_cache_return_entry_r(bdb, e, &lock);
492 send_ldap_result( op, rs );
496 if ( !manageDSAit && e != &e_root && is_entry_referral( e ) ) {
497 /* entry is a referral, don't allow add */
498 struct berval matched_dn = BER_BVNULL;
499 BerVarray erefs = NULL;
501 ber_dupbv( &matched_dn, &e->e_name );
502 erefs = get_entry_referrals( op, e );
504 rs->sr_err = LDAP_REFERRAL;
506 #ifdef SLAP_ZONE_ALLOC
507 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
509 bdb_cache_return_entry_r( bdb, e, &lock );
513 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
514 &op->o_req_dn, op->oq_search.rs_scope );
515 ber_bvarray_free( erefs );
518 rs->sr_text = "bad_referral object";
522 Debug( LDAP_DEBUG_TRACE,
523 LDAP_XSTRING(bdb_search) ": entry is referral\n",
526 rs->sr_matched = matched_dn.bv_val;
527 send_ldap_result( op, rs );
530 LOCK_ID_FREE (bdb->bi_dbenv, locker );
532 ber_bvarray_free( rs->sr_ref );
534 ber_memfree( matched_dn.bv_val );
535 rs->sr_matched = NULL;
539 if ( get_assert( op ) &&
540 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
542 rs->sr_err = LDAP_ASSERTION_FAILED;
543 #ifdef SLAP_ZONE_ALLOC
544 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
546 if ( e != &e_root ) {
547 bdb_cache_return_entry_r(bdb, e, &lock);
549 send_ldap_result( op, rs );
553 /* compute it anyway; root does not use it */
554 stoptime = op->o_time + op->ors_tlimit;
556 /* need normalized dn below */
557 ber_dupbv( &realbase, &e->e_nname );
559 /* Copy info to base, must free entry before accessing the database
560 * in search_candidates, to avoid deadlocks.
562 base.e_private = e->e_private;
563 base.e_nname = realbase;
566 #ifdef SLAP_ZONE_ALLOC
567 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
569 if ( e != &e_root ) {
570 bdb_cache_return_entry_r(bdb, e, &lock);
574 /* select candidates */
575 if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
576 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
579 BDB_IDL_ZERO( candidates );
580 BDB_IDL_ZERO( scopes );
581 rs->sr_err = search_candidates( op, rs, &base,
582 locker, candidates, scopes );
585 /* start cursor at beginning of candidates.
589 if ( candidates[0] == 0 ) {
590 Debug( LDAP_DEBUG_TRACE,
591 LDAP_XSTRING(bdb_search) ": no candidates\n",
597 /* if not root and candidates exceed to-be-checked entries, abort */
598 if ( op->ors_limit /* isroot == FALSE */ &&
599 op->ors_limit->lms_s_unchecked != -1 &&
600 BDB_IDL_N(candidates) > (unsigned) op->ors_limit->lms_s_unchecked )
602 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
603 send_ldap_result( op, rs );
604 rs->sr_err = LDAP_SUCCESS;
608 if ( op->ors_limit == NULL /* isroot == TRUE */ ||
609 !op->ors_limit->lms_s_pr_hide )
611 tentries = BDB_IDL_N(candidates);
614 if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
615 PagedResultsState *ps = op->o_pagedresults_state;
616 /* deferred cookie parsing */
617 rs->sr_err = parse_paged_cookie( op, rs );
618 if ( rs->sr_err != LDAP_SUCCESS ) {
619 send_ldap_result( op, rs );
623 if ( (ID)( ps->ps_cookie ) == 0 ) {
624 id = bdb_idl_first( candidates, &cursor );
627 if ( ps->ps_size == 0 ) {
628 rs->sr_err = LDAP_SUCCESS;
629 rs->sr_text = "search abandoned by pagedResult size=0";
630 send_ldap_result( op, rs );
633 for ( id = bdb_idl_first( candidates, &cursor );
635 id <= (ID)( ps->ps_cookie );
636 id = bdb_idl_next( candidates, &cursor ) )
642 if ( cursor == NOID ) {
643 Debug( LDAP_DEBUG_TRACE,
644 LDAP_XSTRING(bdb_search)
645 ": no paged results candidates\n",
647 send_paged_response( op, rs, &lastid, 0 );
649 rs->sr_err = LDAP_OTHER;
655 for ( id = bdb_idl_first( candidates, &cursor );
656 id != NOID ; id = bdb_idl_next( candidates, &cursor ) )
662 /* check for abandon */
663 if ( op->o_abandon ) {
664 rs->sr_err = SLAPD_ABANDON;
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 #ifdef LDAP_COMP_MATCH
1028 AttributeAssertion aa_ref = { NULL, BER_BVNULL, NULL };
1030 AttributeAssertion aa_ref = { NULL, BER_BVNULL };
1033 #ifdef LDAP_COMP_MATCH
1034 AttributeAssertion aa_subentry = { NULL, BER_BVNULL, NULL };
1036 AttributeAssertion aa_subentry = { NULL, BER_BVNULL };
1040 * This routine takes as input a filter (user-filter)
1041 * and rewrites it as follows:
1042 * (&(scope=DN)[(objectClass=subentry)]
1043 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1046 Debug(LDAP_DEBUG_TRACE,
1047 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1048 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1050 xf.f_or = op->oq_search.rs_filter;
1051 xf.f_choice = LDAP_FILTER_OR;
1054 /* If the user's filter uses objectClass=*,
1055 * these clauses are redundant.
1057 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1058 && !get_subentries_visibility(op)) {
1059 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1060 /* match referral objects */
1061 struct berval bv_ref = BER_BVC( "referral" );
1062 rf.f_choice = LDAP_FILTER_EQUALITY;
1064 rf.f_av_desc = slap_schema.si_ad_objectClass;
1065 rf.f_av_value = bv_ref;
1066 rf.f_next = xf.f_or;
1073 f.f_choice = LDAP_FILTER_AND;
1075 /* Dummy; we compute scope separately now */
1076 nf.f_choice = SLAPD_FILTER_COMPUTED;
1077 nf.f_result = LDAP_SUCCESS;
1078 nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1079 ? op->oq_search.rs_filter : &xf ;
1080 /* Filter depth increased again, adding dummy clause */
1083 if( get_subentries_visibility( op ) ) {
1084 struct berval bv_subentry = BER_BVC( "subentry" );
1085 sf.f_choice = LDAP_FILTER_EQUALITY;
1086 sf.f_ava = &aa_subentry;
1087 sf.f_av_desc = slap_schema.si_ad_objectClass;
1088 sf.f_av_value = bv_subentry;
1089 sf.f_next = nf.f_next;
1093 /* Allocate IDL stack, plus 1 more for former tmp */
1094 if ( depth+1 > bdb->bi_search_stack_depth ) {
1095 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1097 stack = search_stack( op );
1100 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1101 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1103 rc = bdb_dn2idl( op, locker, e, ids, stack );
1106 if ( rc == LDAP_SUCCESS ) {
1107 rc = bdb_filter_candidates( op, locker, &f, ids,
1108 stack, stack+BDB_IDL_UM_SIZE );
1111 if ( depth+1 > bdb->bi_search_stack_depth ) {
1116 Debug(LDAP_DEBUG_TRACE,
1117 "bdb_search_candidates: failed (rc=%d)\n",
1121 Debug(LDAP_DEBUG_TRACE,
1122 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1124 (long) BDB_IDL_FIRST(ids),
1125 (long) BDB_IDL_LAST(ids) );
1132 parse_paged_cookie( Operation *op, SlapReply *rs )
1135 int rc = LDAP_SUCCESS;
1139 struct berval cookie = BER_BVNULL;
1140 PagedResultsState *ps = op->o_pagedresults_state;
1142 /* this function must be invoked only if the pagedResults
1143 * control has been detected, parsed and partially checked
1144 * by the frontend */
1145 assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1147 /* look for the appropriate ctrl structure */
1148 for ( c = op->o_ctrls; c[0] != NULL; c++ ) {
1149 if ( strcmp( c[0]->ldctl_oid, LDAP_CONTROL_PAGEDRESULTS ) == 0 )
1155 if ( c[0] == NULL ) {
1156 rs->sr_text = "missing pagedResults control";
1157 return LDAP_PROTOCOL_ERROR;
1160 /* Tested by frontend */
1161 assert( c[0]->ldctl_value.bv_len > 0 );
1163 /* Parse the control value
1164 * realSearchControlValue ::= SEQUENCE {
1165 * size INTEGER (0..maxInt),
1166 * -- requested page size from client
1167 * -- result set size estimate from server
1168 * cookie OCTET STRING
1171 ber = ber_init( &c[0]->ldctl_value );
1172 if ( ber == NULL ) {
1173 rs->sr_text = "internal error";
1177 tag = ber_scanf( ber, "{im}", &size, &cookie );
1179 /* Tested by frontend */
1180 assert( tag != LBER_ERROR );
1181 assert( size >= 0 );
1183 /* cookie decoding/checks deferred to backend... */
1184 if ( cookie.bv_len ) {
1185 PagedResultsCookie reqcookie;
1186 if( cookie.bv_len != sizeof( reqcookie ) ) {
1188 rs->sr_text = "paged results cookie is invalid";
1189 rc = LDAP_PROTOCOL_ERROR;
1193 AC_MEMCPY( &reqcookie, cookie.bv_val, sizeof( reqcookie ));
1195 if ( reqcookie > ps->ps_cookie ) {
1197 rs->sr_text = "paged results cookie is invalid";
1198 rc = LDAP_PROTOCOL_ERROR;
1201 } else if ( reqcookie < ps->ps_cookie ) {
1202 rs->sr_text = "paged results cookie is invalid or old";
1203 rc = LDAP_UNWILLING_TO_PERFORM;
1208 /* Initial request. Initialize state. */
1210 if ( op->o_conn->c_pagedresults_state.ps_cookie != 0 ) {
1211 /* There's another pagedResults control on the
1212 * same connection; reject new pagedResults controls
1213 * (allowed by RFC2696) */
1214 rs->sr_text = "paged results cookie unavailable; try later";
1215 rc = LDAP_UNWILLING_TO_PERFORM;
1224 (void)ber_free( ber, 1 );
1230 send_paged_response(
1236 LDAPControl ctrl, *ctrls[2];
1237 BerElementBuffer berbuf;
1238 BerElement *ber = (BerElement *)&berbuf;
1239 PagedResultsCookie respcookie;
1240 struct berval cookie;
1242 Debug(LDAP_DEBUG_ARGS,
1243 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1244 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1246 BER_BVZERO( &ctrl.ldctl_value );
1250 ber_init2( ber, NULL, LBER_USE_DER );
1253 respcookie = ( PagedResultsCookie )(*lastid);
1254 cookie.bv_len = sizeof( respcookie );
1255 cookie.bv_val = (char *)&respcookie;
1258 respcookie = ( PagedResultsCookie )0;
1259 BER_BVSTR( &cookie, "" );
1262 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1263 op->o_conn->c_pagedresults_state.ps_count =
1264 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1267 /* return size of 0 -- no estimate */
1268 ber_printf( ber, "{iO}", 0, &cookie );
1270 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1274 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1275 ctrls[0]->ldctl_iscritical = 0;
1277 rs->sr_ctrls = ctrls;
1278 rs->sr_err = LDAP_SUCCESS;
1279 send_ldap_result( op, rs );
1280 rs->sr_ctrls = NULL;
1283 (void) ber_free_buf( ber );