1 /* search.c - search operation */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
17 static int base_candidate(
22 static int search_candidates(
23 Operation *stackop, /* op with the current threadctx/slab cache */
24 Operation *sop, /* search op */
31 static void send_pagerequest_response(
37 /* Dereference aliases for a single alias entry. Return the final
38 * dereferenced entry on success, NULL on any failure.
40 static Entry * deref_base (
50 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
55 rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
56 rs->sr_text = "maximum deref depth exceeded";
58 while (BDB_IDL_N(tmp) < op->o_bd->be_max_deref_depth) {
60 /* Remember the last entry we looked at, so we can
65 /* If this is part of a subtree or onelevel search,
66 * have we seen this ID before? If so, quit.
68 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
73 /* If we've seen this ID during this deref iteration,
76 if ( bdb_idl_insert( tmp, e->e_id ) ) {
77 rs->sr_err = LDAP_ALIAS_PROBLEM;
78 rs->sr_text = "circular alias";
83 /* If there was a problem getting the aliasedObjectName,
84 * get_alias_dn will have set the error status.
86 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
91 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
94 if ( ei ) e = ei->bei_e;
98 rs->sr_err = LDAP_ALIAS_PROBLEM;
99 rs->sr_text = "aliasedObject not found";
103 /* Free the previous entry, continue to work with the
104 * one we just retrieved.
106 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
110 /* We found a regular entry. Return this to the caller. The
111 * entry is still locked for Read.
113 if (!is_entry_alias(e)) {
114 rs->sr_err = LDAP_SUCCESS;
122 /* Look for and dereference all aliases within the search scope. Adds
123 * the dereferenced entries to the "ids" list. Requires "stack" to be
124 * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
125 * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
127 static int search_aliases(
137 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
138 ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
139 ID cursora, ida, cursoro, ido, *subscop2;
142 struct berval bv_alias = { sizeof("alias")-1, "alias" };
143 AttributeAssertion aa_alias;
145 DB_LOCK locka, lockr;
148 aliases = stack; /* IDL of all aliases in the database */
149 curscop = aliases + BDB_IDL_DB_SIZE; /* Aliases in the current scope */
150 subscop = curscop + BDB_IDL_DB_SIZE; /* The current scope */
151 visited = subscop + BDB_IDL_DB_SIZE; /* IDs we've seen in this search */
152 newsubs = visited + BDB_IDL_DB_SIZE; /* New subtrees we've added */
153 oldsubs = newsubs + BDB_IDL_DB_SIZE; /* Subtrees added previously */
154 tmp = oldsubs + BDB_IDL_DB_SIZE; /* Scratch space for deref_base() */
156 /* A copy of subscop, because subscop gets clobbered by
157 * the bdb_idl_union/intersection routines
159 subscop2 = tmp + BDB_IDL_DB_SIZE;
161 af.f_choice = LDAP_FILTER_EQUALITY;
162 af.f_ava = &aa_alias;
163 af.f_av_desc = slap_schema.si_ad_objectClass;
164 af.f_av_value = bv_alias;
167 /* Find all aliases in database */
168 BDB_IDL_ZERO( aliases );
169 rs->sr_err = bdb_filter_candidates( op, &af, aliases,
171 if (rs->sr_err != LDAP_SUCCESS) {
175 oldsubs[1] = e->e_id;
178 BDB_IDL_ZERO( visited );
179 BDB_IDL_ZERO( newsubs );
182 ido = bdb_idl_first( oldsubs, &cursoro );
185 /* Set curscop to only the aliases in the current scope. Start with
186 * all the aliases, obtain the IDL for the current scope, and then
187 * get the intersection of these two IDLs. Add the current scope
188 * to the cumulative list of candidates.
190 BDB_IDL_CPY( curscop, aliases );
191 rs->sr_err = bdb_dn2idl( op, e, subscop,
192 subscop2+BDB_IDL_DB_SIZE );
196 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
198 BDB_IDL_CPY(subscop2, subscop);
199 rs->sr_err = bdb_idl_intersection(curscop, subscop);
200 bdb_idl_union( ids, subscop2 );
202 /* Dereference all of the aliases in the current scope. */
204 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
205 ida = bdb_idl_next(curscop, &cursora))
208 rs->sr_err = bdb_cache_find_id(op, NULL,
209 ida, &ei, 0, locker, &lockr );
210 if (rs->sr_err != LDAP_SUCCESS) {
215 /* This should only happen if the curscop IDL has maxed out and
216 * turned into a range that spans IDs indiscriminately
218 if (!is_entry_alias(a)) {
219 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
224 /* Actually dereference the alias */
226 a = deref_base( op, rs, a, &matched, locker, &lockr,
229 /* If the target was not already in our current candidates,
230 * make note of it in the newsubs list. Also
231 * set it in the scopes list so that bdb_search
234 if (bdb_idl_insert(ids, a->e_id) == 0) {
235 bdb_idl_insert(newsubs, a->e_id);
236 bdb_idl_insert(scopes, a->e_id);
238 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
241 } else if (matched) {
242 /* Alias could not be dereferenced, or it deref'd to
243 * an ID we've already seen. Ignore it.
245 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
250 /* If this is a OneLevel search, we're done; oldsubs only had one
251 * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
253 if (op->ors_scope != LDAP_SCOPE_SUBTREE) break;
255 ido = bdb_idl_next( oldsubs, &cursoro );
257 /* If we're done processing the old scopes, did we add any new
258 * scopes in this iteration? If so, go back and do those now.
261 if (BDB_IDL_IS_ZERO(newsubs)) break;
262 BDB_IDL_CPY(oldsubs, newsubs);
263 BDB_IDL_ZERO(newsubs);
265 ido = bdb_idl_first( oldsubs, &cursoro );
268 /* Find the entry corresponding to the next scope. If it can't
269 * be found, ignore it and move on. This should never happen;
270 * we should never see the ID of an entry that doesn't exist.
271 * Set the name so that the scope's IDL can be retrieved.
274 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
276 if (rs->sr_err != LDAP_SUCCESS) goto nextido;
283 int is_sync_protocol( Operation *op )
285 if ( op->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST )
290 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
291 ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
292 #define IS_PSEARCH (op != sop)
295 bdb_abandon( Operation *op, SlapReply *rs )
298 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
300 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
301 if ( ps_list->o_connid == op->o_connid ) {
302 if ( ps_list->o_msgid == op->oq_abandon.rs_msgid ) {
303 ps_list->o_abandon = 1;
304 LDAP_LIST_REMOVE( ps_list, o_ps_link );
305 slap_op_free ( ps_list );
310 return LDAP_UNAVAILABLE;
314 bdb_cancel( Operation *op, SlapReply *rs )
317 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
319 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
320 if ( ps_list->o_connid == op->o_connid ) {
321 if ( ps_list->o_msgid == op->oq_cancel.rs_msgid ) {
322 ps_list->o_cancel = SLAP_CANCEL_DONE;
323 LDAP_LIST_REMOVE( ps_list, o_ps_link );
325 rs->sr_err = LDAP_CANCELLED;
326 send_ldap_result( ps_list, rs );
328 if ( ps_list->o_tmpmemctx ) {
329 sl_mem_destroy( NULL, ps_list->o_tmpmemctx );
332 slap_op_free ( ps_list );
337 return LDAP_UNAVAILABLE;
340 int bdb_search( Operation *op, SlapReply *rs )
342 return bdb_do_search( op, rs, op, NULL, 0 );
345 /* For persistent searches, op is the currently executing operation,
346 * sop is the persistent search. For regular searches, sop = op.
349 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop,
350 Entry *ps_e, int ps_type )
352 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
355 ID candidates[BDB_IDL_UM_SIZE];
356 ID scopes[BDB_IDL_DB_SIZE];
357 Entry *e = NULL, base;
358 Entry *matched = NULL;
360 struct berval realbase = { 0, NULL };
364 AttributeName *attrs;
366 Filter contextcsnand, contextcsnle, cookief, csnfnot, csnfeq, csnfand, csnfge;
367 Filter omitcsnf, omitcsnfle;
368 AttributeAssertion aa_ge, aa_eq, aa_le;
370 struct berval *search_context_csn = NULL;
372 LDAPControl *ctrls[SLAP_MAX_RESPONSE_CONTROLS];
374 AttributeName uuid_attr[2];
376 int entry_sync_state = -1;
377 AttributeName null_attr;
378 int no_sync_state_change = 0;
379 struct slap_limits_set *limit = NULL;
382 u_int32_t locker = 0;
386 LDAP_LOG( OPERATION, ENTRY, "bdb_back_search\n", 0, 0, 0 );
388 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
391 attrs = sop->oq_search.rs_attrs;
393 /* psearch needs to be registered before refresh begins */
394 /* psearch and refresh transmission is serialized in send_ldap_ber() */
395 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
396 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
398 null_attr.an_desc = NULL;
399 null_attr.an_oc = NULL;
400 null_attr.an_name.bv_len = 0;
401 null_attr.an_name.bv_val = NULL;
403 for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
404 ctrls[num_ctrls] = NULL;
408 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
410 attrs[0].an_desc = NULL;
411 attrs[0].an_oc = NULL;
412 attrs[0].an_name.bv_len = 0;
413 attrs[0].an_name.bv_val = NULL;
416 manageDSAit = get_manageDSAit( sop );
418 /* Sync control overrides manageDSAit */
420 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
421 if ( manageDSAit == SLAP_NO_CONTROL )
422 manageDSAit = SLAP_CRITICAL_CONTROL;
423 } else if ( IS_PSEARCH ) {
424 if ( manageDSAit == SLAP_NO_CONTROL )
425 manageDSAit = SLAP_CRITICAL_CONTROL;
428 rs->sr_err = LOCK_ID (bdb->bi_dbenv, &locker );
434 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
438 if ( sop->o_req_ndn.bv_len == 0 ) {
439 /* DIT root special case */
440 e = (Entry *) &slap_entry_root;
441 rs->sr_err = LDAP_SUCCESS;
444 /* get entry with reader lock */
445 rs->sr_err = bdb_dn2entry( op, NULL, &sop->o_req_ndn, &ei,
451 matched = ei->bei_e; break;
453 e = ei->bei_e; break;
455 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
456 LOCK_ID_FREE (bdb->bi_dbenv, locker );
458 case DB_LOCK_DEADLOCK:
459 case DB_LOCK_NOTGRANTED:
462 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
463 LOCK_ID_FREE (bdb->bi_dbenv, locker );
467 if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
468 BDB_IDL_ZERO(candidates);
469 e = deref_base( op, rs, e, &matched, locker, &lock,
474 struct berval matched_dn = { 0, NULL };
476 if ( matched != NULL ) {
478 ber_dupbv( &matched_dn, &matched->e_name );
480 erefs = is_entry_referral( matched )
481 ? get_entry_referrals( op, matched )
484 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
489 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
490 &sop->o_req_dn, sop->oq_search.rs_scope );
491 ber_bvarray_free( erefs );
495 rs->sr_ref = referral_rewrite( default_referral,
496 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
499 rs->sr_err = LDAP_REFERRAL;
500 rs->sr_matched = matched_dn.bv_val;
501 send_ldap_result( sop, rs );
503 LOCK_ID_FREE (bdb->bi_dbenv, locker );
505 ber_bvarray_free( rs->sr_ref );
508 if ( matched_dn.bv_val ) {
509 ber_memfree( matched_dn.bv_val );
510 rs->sr_matched = NULL;
515 if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
516 /* entry is a referral, don't allow add */
517 struct berval matched_dn;
520 ber_dupbv( &matched_dn, &e->e_name );
521 erefs = get_entry_referrals( op, e );
523 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
527 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
528 &sop->o_req_dn, sop->oq_search.rs_scope );
529 ber_bvarray_free( erefs );
533 LDAP_LOG ( OPERATION, RESULTS,
534 "bdb_search: entry is referral\n", 0, 0, 0 );
536 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
540 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
541 rs->sr_err = LDAP_REFERRAL;
542 rs->sr_matched = matched_dn.bv_val;
543 send_ldap_result( sop, rs );
545 LOCK_ID_FREE (bdb->bi_dbenv, locker );
546 ber_bvarray_free( rs->sr_ref );
548 ber_memfree( matched_dn.bv_val );
549 rs->sr_matched = NULL;
553 if ( get_assert( op ) &&
554 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
556 rs->sr_err = LDAP_ASSERTION_FAILED;
557 send_ldap_result( sop, rs );
561 /* if not root, get appropriate limits */
562 if ( be_isroot( op->o_bd, &sop->o_ndn ) ) {
565 ( void ) get_limits( op->o_bd, &sop->o_ndn, &limit );
568 /* The time/size limits come first because they require very little
569 * effort, so there's no chance the candidates are selected and then
570 * the request is not honored only because of time/size constraints */
572 /* if no time limit requested, use soft limit (unless root!) */
574 if ( sop->oq_search.rs_tlimit == 0 ) {
575 sop->oq_search.rs_tlimit = -1; /* allow root to set no limit */
578 if ( sop->oq_search.rs_slimit == 0 ) {
579 sop->oq_search.rs_slimit = -1;
583 /* if no limit is required, use soft limit */
584 if ( sop->oq_search.rs_tlimit <= 0 ) {
585 sop->oq_search.rs_tlimit = limit->lms_t_soft;
587 /* if requested limit higher than hard limit, abort */
588 } else if ( sop->oq_search.rs_tlimit > limit->lms_t_hard ) {
589 /* no hard limit means use soft instead */
590 if ( limit->lms_t_hard == 0
591 && limit->lms_t_soft > -1
592 && sop->oq_search.rs_tlimit > limit->lms_t_soft ) {
593 sop->oq_search.rs_tlimit = limit->lms_t_soft;
595 /* positive hard limit means abort */
596 } else if ( limit->lms_t_hard > 0 ) {
597 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
598 send_ldap_result( sop, rs );
599 rs->sr_err = LDAP_SUCCESS;
603 /* negative hard limit means no limit */
606 /* if no limit is required, use soft limit */
607 if ( sop->oq_search.rs_slimit <= 0 ) {
608 if ( get_pagedresults(sop) && limit->lms_s_pr != 0 ) {
609 sop->oq_search.rs_slimit = limit->lms_s_pr;
611 sop->oq_search.rs_slimit = limit->lms_s_soft;
614 /* if requested limit higher than hard limit, abort */
615 } else if ( sop->oq_search.rs_slimit > limit->lms_s_hard ) {
616 /* no hard limit means use soft instead */
617 if ( limit->lms_s_hard == 0
618 && limit->lms_s_soft > -1
619 && sop->oq_search.rs_slimit > limit->lms_s_soft ) {
620 sop->oq_search.rs_slimit = limit->lms_s_soft;
622 /* positive hard limit means abort */
623 } else if ( limit->lms_s_hard > 0 ) {
624 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
625 send_ldap_result( sop, rs );
626 rs->sr_err = LDAP_SUCCESS;
630 /* negative hard limit means no limit */
634 /* compute it anyway; root does not use it */
635 stoptime = op->o_time + sop->oq_search.rs_tlimit;
637 /* need normalized dn below */
638 ber_dupbv( &realbase, &e->e_nname );
640 /* Copy info to base, must free entry before accessing the database
641 * in search_candidates, to avoid deadlocks.
643 base.e_private = e->e_private;
644 base.e_nname = realbase;
647 if ( e != &slap_entry_root ) {
648 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
652 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn, locker, &ctxcsn_lock );
654 if ( rs->sr_err != LDAP_SUCCESS ) {
655 send_ldap_error( sop, rs, rs->sr_err, "error in csn management in search" );
659 /* select candidates */
660 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
661 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
664 BDB_IDL_ZERO( candidates );
665 BDB_IDL_ZERO( scopes );
666 rs->sr_err = search_candidates( op, sop, rs, &base, locker, candidates, scopes );
669 if ( sop->o_sync_mode != SLAP_SYNC_NONE ) {
670 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
673 /* start cursor at beginning of candidates.
677 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
678 cursor = bdb_idl_search( candidates, ps_e->e_id );
679 if ( candidates[cursor] != ps_e->e_id ) {
680 rs->sr_err = LDAP_SUCCESS;
684 if ( ps_e->e_id < BDB_IDL_RANGE_FIRST(candidates)
685 || ps_e->e_id > BDB_IDL_RANGE_LAST(candidates)){
686 rs->sr_err = LDAP_SUCCESS;
691 candidates[1] = ps_e->e_id;
694 if ( candidates[0] == 0 ) {
696 LDAP_LOG ( OPERATION, RESULTS,
697 "bdb_search: no candidates\n", 0, 0, 0 );
699 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
703 rs->sr_err = LDAP_SUCCESS;
705 send_ldap_result( sop, rs );
709 /* if not root and candidates exceed to-be-checked entries, abort */
710 if ( !isroot && limit->lms_s_unchecked != -1 ) {
711 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
712 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
713 send_ldap_result( sop, rs );
714 rs->sr_err = LDAP_SUCCESS;
719 if ( isroot || !limit->lms_s_pr_hide ) {
720 tentries = BDB_IDL_N(candidates);
723 #ifdef LDAP_CONTROL_PAGEDRESULTS
724 if ( get_pagedresults(sop) ) {
725 if ( sop->o_pagedresults_state.ps_cookie == 0 ) {
728 if ( sop->o_pagedresults_size == 0 ) {
729 rs->sr_err = LDAP_SUCCESS;
730 rs->sr_text = "search abandoned by pagedResult size=0";
731 send_ldap_result( sop, rs );
734 for ( id = bdb_idl_first( candidates, &cursor );
735 id != NOID && id <= (ID)( sop->o_pagedresults_state.ps_cookie );
736 id = bdb_idl_next( candidates, &cursor ) );
738 if ( cursor == NOID ) {
740 LDAP_LOG ( OPERATION, RESULTS,
741 "bdb_search: no paged results candidates\n",
744 Debug( LDAP_DEBUG_TRACE,
745 "bdb_search: no paged results candidates\n",
748 send_pagerequest_response( sop, rs, lastid, 0 );
750 rs->sr_err = LDAP_OTHER;
757 if ( (sop->o_sync_mode & SLAP_SYNC_REFRESH) || IS_PSEARCH )
763 cookief.f_choice = LDAP_FILTER_AND;
764 cookief.f_and = &csnfnot;
765 cookief.f_next = NULL;
767 csnfnot.f_choice = LDAP_FILTER_NOT;
768 csnfnot.f_not = &csnfeq;
769 csnfnot.f_next = &csnfand;
771 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
772 csnfeq.f_ava = &aa_eq;
773 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
774 csnfeq.f_av_value = sop->o_sync_state;
776 csnfand.f_choice = LDAP_FILTER_AND;
777 csnfand.f_and = &csnfge;
778 csnfand.f_next = NULL;
780 csnfge.f_choice = LDAP_FILTER_GE;
781 csnfge.f_ava = &aa_ge;
782 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
783 csnfge.f_av_value = sop->o_sync_state;
785 if ( search_context_csn && !IS_PSEARCH ) {
786 csnfge.f_next = &contextcsnand;
788 contextcsnand.f_choice = LDAP_FILTER_AND;
789 contextcsnand.f_and = &contextcsnle;
790 contextcsnand.f_next = NULL;
792 contextcsnle.f_choice = LDAP_FILTER_LE;
793 contextcsnle.f_ava = &aa_le;
794 contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
795 contextcsnle.f_av_value = *search_context_csn;
796 contextcsnle.f_next = sop->oq_search.rs_filter;
798 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
799 if ( sop->o_sync_state.bv_len != 0 ) {
800 value_match( &match, slap_schema.si_ad_entryCSN, mr,
801 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
802 &sop->o_sync_state, search_context_csn, &text );
806 no_sync_state_change = !match;
808 csnfge.f_next = sop->oq_search.rs_filter;
812 for ( id = bdb_idl_first( candidates, &cursor );
814 id = bdb_idl_next( candidates, &cursor ) )
819 /* check for abandon */
820 if ( sop->o_abandon ) {
821 rs->sr_err = LDAP_SUCCESS;
825 #ifdef LDAP_EXOP_X_CANCEL
826 if ( sop->o_cancel ) {
827 assert( sop->o_cancel == SLAP_CANCEL_REQ );
828 rs->sr_err = LDAP_CANCELLED;
829 send_ldap_result( sop, rs );
830 sop->o_cancel = SLAP_CANCEL_ACK;
831 rs->sr_err = LDAP_SUCCESS;
836 /* check time limit */
837 if ( sop->oq_search.rs_tlimit != -1 && slap_get_time() > stoptime ) {
838 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
839 rs->sr_ref = rs->sr_v2ref;
840 send_ldap_result( sop, rs );
841 rs->sr_err = LDAP_SUCCESS;
848 /* get the entry with reader lock */
850 rs->sr_err = bdb_cache_find_id( op, NULL,
851 id, &ei, 0, locker, &lock );
853 if (rs->sr_err == LDAP_BUSY) {
854 rs->sr_text = "ldap server busy";
855 send_ldap_result( sop, rs );
858 } else if ( rs->sr_err == DB_LOCK_DEADLOCK
859 || rs->sr_err == DB_LOCK_NOTGRANTED )
864 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
871 if( !BDB_IDL_IS_RANGE(candidates) ) {
872 /* only complain for non-range IDLs */
874 LDAP_LOG ( OPERATION, RESULTS,
875 "bdb_search: candidate %ld not found\n",
878 Debug( LDAP_DEBUG_TRACE,
879 "bdb_search: candidate %ld not found\n",
891 #ifdef BDB_SUBENTRIES
892 /* FIXME: send all but syncrepl
893 if ( !is_sync_protocol( sop ) ) {
895 if ( is_entry_subentry( e ) ) {
896 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
897 if(!get_subentries_visibility( sop )) {
898 /* only subentries are visible */
902 } else if ( get_subentries( sop ) &&
903 !get_subentries_visibility( sop ))
905 /* only subentries are visible */
909 } else if ( get_subentries_visibility( sop )) {
910 /* only subentries are visible */
918 /* Does this candidate actually satisfy the search scope?
920 * Note that we don't lock access to the bei_parent pointer.
921 * Since only leaf nodes can be deleted, the parent of any
922 * node will always be a valid node. Also since we have
923 * a Read lock on the data, it cannot be renamed out of the
924 * scope while we are looking at it, and unless we're using
925 * BDB_HIER, its parents cannot be moved either.
927 switch( sop->ors_scope ) {
928 case LDAP_SCOPE_BASE:
929 /* This is always true, yes? */
930 if ( id == base.e_id )
933 case LDAP_SCOPE_ONELEVEL:
934 if ( ei->bei_parent->bei_id == base.e_id )
937 case LDAP_SCOPE_SUBTREE:
939 for ( tmp = BEI(e); tmp->bei_parent;
940 tmp = tmp->bei_parent ) {
941 if ( tmp->bei_id == base.e_id ) {
950 /* aliases were already dereferenced in candidate list */
951 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
952 /* but if the search base is an alias, and we didn't
953 * deref it when finding, return it.
955 if ( is_entry_alias(e) &&
956 ((sop->ors_deref & LDAP_DEREF_FINDING)
957 || !bvmatch(&e->e_nname, &op->o_req_ndn)))
962 /* scopes is only non-empty for onelevel or subtree */
963 if ( !scopeok && BDB_IDL_N(scopes) ) {
965 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
966 x = bdb_idl_search( scopes,
968 if ( scopes[x] == e->e_id )
971 /* subtree, walk up the tree */
972 EntryInfo *tmp = BEI(e);
973 for (;tmp->bei_parent;
974 tmp=tmp->bei_parent) {
976 scopes, tmp->bei_id );
977 if ( scopes[x] == tmp->bei_id ) {
987 /* Not in scope, ignore it */
990 LDAP_LOG ( OPERATION, RESULTS,
991 "bdb_search: %ld scope not okay\n",
994 Debug( LDAP_DEBUG_TRACE,
995 "bdb_search: %ld scope not okay\n",
1002 * if it's a referral, add it to the list of referrals. only do
1003 * this for non-base searches, and don't check the filter
1004 * explicitly here since it's only a candidate anyway.
1006 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE
1007 && is_entry_referral( e ) )
1009 BerVarray erefs = get_entry_referrals( sop, e );
1010 rs->sr_ref = referral_rewrite( erefs,
1012 sop->oq_search.rs_scope == LDAP_SCOPE_SUBTREE
1013 ? LDAP_SCOPE_SUBTREE
1014 : LDAP_SCOPE_BASE );
1016 send_search_reference( sop, rs );
1018 ber_bvarray_free( rs->sr_ref );
1019 ber_bvarray_free( erefs );
1025 if ( !manageDSAit && is_entry_glue( e )) {
1029 /* if it matches the filter and scope, send it */
1031 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1032 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1034 rs->sr_err = LDAP_COMPARE_TRUE;
1037 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1038 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1039 rs->sr_err = test_filter( sop,
1040 rs->sr_entry, &contextcsnand );
1041 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1042 if ( rc_sync == LDAP_COMPARE_TRUE ) {
1043 if ( no_sync_state_change ) {
1045 LDAP_LOG ( OPERATION, RESULTS,
1046 "bdb_search: error in context csn management\n",
1049 Debug( LDAP_DEBUG_TRACE,
1050 "bdb_search: error in context csn management\n",
1054 entry_sync_state = LDAP_SYNC_ADD;
1056 if ( no_sync_state_change ) {
1059 entry_sync_state = LDAP_SYNC_PRESENT;
1063 rs->sr_err = test_filter( sop,
1064 rs->sr_entry, sop->oq_search.rs_filter );
1068 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1069 /* check size limit */
1070 if ( --sop->oq_search.rs_slimit == -1 ) {
1072 bdb_cache_return_entry_r( bdb->bi_dbenv,
1073 &bdb->bi_cache, e, &lock );
1076 rs->sr_entry = NULL;
1077 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1078 rs->sr_ref = rs->sr_v2ref;
1079 send_ldap_result( sop, rs );
1080 rs->sr_err = LDAP_SUCCESS;
1084 #ifdef LDAP_CONTROL_PAGEDRESULTS
1085 if ( get_pagedresults(sop) ) {
1086 if ( rs->sr_nentries >= sop->o_pagedresults_size ) {
1087 send_pagerequest_response( sop, rs,
1099 #if 0 /* noop is masked SLAP_CTRL_UPDATE */
1105 int premodify_found = 0;
1106 int entry_sync_state;
1108 if ( ps_type == LDAP_PSEARCH_BY_ADD ||
1109 ps_type == LDAP_PSEARCH_BY_DELETE ||
1110 ps_type == LDAP_PSEARCH_BY_MODIFY ||
1111 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1113 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1114 struct psid_entry* psid_e;
1115 LDAP_LIST_FOREACH( psid_e,
1116 &op->o_pm_list, ps_link)
1118 if( psid_e->ps_op == sop ) {
1119 premodify_found = 1;
1120 LDAP_LIST_REMOVE(psid_e, ps_link);
1124 if (psid_e != NULL) free (psid_e);
1126 if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1127 entry_sync_state = LDAP_SYNC_ADD;
1128 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1129 entry_sync_state = LDAP_SYNC_DELETE;
1130 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1131 if ( premodify_found ) {
1132 entry_sync_state = LDAP_SYNC_MODIFY;
1134 entry_sync_state = LDAP_SYNC_ADD;
1136 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1137 entry_sync_state = LDAP_SYNC_DELETE;
1139 rs->sr_err = LDAP_OTHER;
1142 rs->sr_err = bdb_build_sync_state_ctrl( sop,
1143 rs, e, entry_sync_state, ctrls,
1144 num_ctrls++, 1, search_context_csn );
1145 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1146 rs->sr_attrs = attrs;
1147 rs->sr_ctrls = ctrls;
1148 result = send_search_entry( sop, rs );
1149 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
1150 ch_free( ctrls[--num_ctrls] );
1151 ctrls[num_ctrls] = NULL;
1152 rs->sr_ctrls = NULL;
1154 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1155 struct psid_entry* psid_e;
1156 psid_e = (struct psid_entry *) calloc (1,
1157 sizeof(struct psid_entry));
1158 psid_e->ps_op = sop;
1159 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1163 printf("Error !\n");
1166 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1167 rs->sr_err = bdb_build_sync_state_ctrl( sop,
1168 rs, e, entry_sync_state, ctrls,
1169 num_ctrls++, 0, search_context_csn );
1170 if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1172 rs->sr_ctrls = ctrls;
1173 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1174 rs->sr_attrs = sop->oq_search.rs_attrs;
1175 } else { /* PRESENT */
1176 rs->sr_attrs = &null_attr;
1178 result = send_search_entry( sop, rs );
1179 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
1180 ch_free( ctrls[--num_ctrls] );
1181 ctrls[num_ctrls] = NULL;
1182 rs->sr_ctrls = NULL;
1184 rs->sr_attrs = sop->oq_search.rs_attrs;
1185 rs->sr_ctrls = NULL;
1186 result = send_search_entry( sop, rs );
1191 case 0: /* entry sent ok */
1193 case 1: /* entry not sent */
1195 case -1: /* connection closed */
1197 bdb_cache_return_entry_r(bdb->bi_dbenv,
1198 &bdb->bi_cache, e, &lock);
1200 rs->sr_entry = NULL;
1201 rs->sr_err = LDAP_OTHER;
1207 LDAP_LOG ( OPERATION, RESULTS,
1208 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1210 Debug( LDAP_DEBUG_TRACE,
1211 "bdb_search: %ld does not match filter\n",
1218 /* free reader lock */
1220 bdb_cache_return_entry_r( bdb->bi_dbenv,
1221 &bdb->bi_cache, e , &lock);
1224 rs->sr_entry = NULL;
1227 ldap_pvt_thread_yield();
1231 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1232 rs->sr_err = LDAP_SUCCESS;
1233 rs->sr_rspoid = LDAP_SYNC_INFO;
1234 rs->sr_ctrls = NULL;
1235 bdb_send_ldap_intermediate( sop, rs,
1236 LDAP_SYNC_STATE_MODE_DONE, search_context_csn );
1238 /* If changelog is supported, this is where to process it */
1240 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1241 /* refreshAndPersist mode */
1242 bdb_send_ldap_intermediate( sop, rs,
1243 LDAP_SYNC_LOG_MODE_DONE, search_context_csn );
1245 /* refreshOnly mode */
1246 bdb_build_sync_done_ctrl( sop, rs, ctrls,
1247 num_ctrls++, 1, search_context_csn );
1248 rs->sr_ctrls = ctrls;
1249 rs->sr_ref = rs->sr_v2ref;
1250 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1251 send_ldap_result( sop, rs );
1252 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL ) {
1253 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
1255 ch_free( ctrls[--num_ctrls] );
1256 ctrls[num_ctrls] = NULL;
1259 rs->sr_ctrls = NULL;
1260 rs->sr_ref = rs->sr_v2ref;
1261 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1262 send_ldap_result( sop, rs );
1266 rs->sr_err = LDAP_SUCCESS;
1269 if( !IS_PSEARCH && e != NULL ) {
1270 /* free reader lock */
1271 bdb_cache_return_entry_r ( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1274 LOCK_ID_FREE (bdb->bi_dbenv, locker );
1276 ber_bvfree( search_context_csn );
1278 if( rs->sr_v2ref ) {
1279 ber_bvarray_free( rs->sr_v2ref );
1280 rs->sr_v2ref = NULL;
1282 if( realbase.bv_val ) ch_free( realbase.bv_val );
1288 static int base_candidate(
1294 LDAP_LOG ( OPERATION, ENTRY,
1295 "base_candidate: base: \"%s\" (0x%08lx)\n",
1296 e->e_nname.bv_val, (long) e->e_id, 0);
1298 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1299 e->e_nname.bv_val, (long) e->e_id, 0);
1307 /* Look for "objectClass Present" in this filter.
1308 * Also count depth of filter tree while we're at it.
1310 static int oc_filter(
1318 if( cur > *max ) *max = cur;
1320 switch(f->f_choice) {
1321 case LDAP_FILTER_PRESENT:
1322 if (f->f_desc == slap_schema.si_ad_objectClass) {
1327 case LDAP_FILTER_AND:
1328 case LDAP_FILTER_OR:
1330 for (f=f->f_and; f; f=f->f_next) {
1331 (void) oc_filter(f, cur, max);
1341 static void search_stack_free( void *key, void *data )
1343 ber_memfree_x(data, NULL);
1346 static void *search_stack(
1350 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1353 if ( op->o_threadctx ) {
1354 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1357 ret = bdb->bi_search_stack;
1361 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1363 if ( op->o_threadctx ) {
1364 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1365 ret, search_stack_free );
1367 bdb->bi_search_stack = ret;
1373 static int search_candidates(
1382 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1384 Filter f, rf, xf, nf;
1386 AttributeAssertion aa_ref;
1387 #ifdef BDB_SUBENTRIES
1389 AttributeAssertion aa_subentry;
1393 * This routine takes as input a filter (user-filter)
1394 * and rewrites it as follows:
1395 * (&(scope=DN)[(objectClass=subentry)]
1396 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1400 LDAP_LOG ( OPERATION, ENTRY,
1401 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1402 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope);
1404 Debug(LDAP_DEBUG_TRACE,
1405 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1406 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1409 xf.f_or = op->oq_search.rs_filter;
1410 xf.f_choice = LDAP_FILTER_OR;
1413 /* If the user's filter uses objectClass=*,
1414 * these clauses are redundant.
1416 if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1417 && !get_subentries_visibility(op)
1418 && !is_sync_protocol(op) )
1420 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1421 /* match referral objects */
1422 struct berval bv_ref = { sizeof("referral")-1, "referral" };
1423 rf.f_choice = LDAP_FILTER_EQUALITY;
1425 rf.f_av_desc = slap_schema.si_ad_objectClass;
1426 rf.f_av_value = bv_ref;
1427 rf.f_next = xf.f_or;
1434 f.f_choice = LDAP_FILTER_AND;
1436 /* Dummy; we compute scope separately now */
1437 nf.f_choice = SLAPD_FILTER_COMPUTED;
1438 nf.f_result = LDAP_SUCCESS;
1439 nf.f_next = xf.f_or == op->oq_search.rs_filter
1440 ? op->oq_search.rs_filter : &xf ;
1441 /* Filter depth increased again, adding dummy clause */
1444 #ifdef BDB_SUBENTRIES
1445 if( get_subentries_visibility( op ) ) {
1446 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1447 sf.f_choice = LDAP_FILTER_EQUALITY;
1448 sf.f_ava = &aa_subentry;
1449 sf.f_av_desc = slap_schema.si_ad_objectClass;
1450 sf.f_av_value = bv_subentry;
1451 sf.f_next = nf.f_next;
1456 /* Allocate IDL stack, plus 1 more for former tmp */
1457 if ( depth+1 > bdb->bi_search_stack_depth ) {
1458 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1460 stack = search_stack( stackop );
1463 if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1464 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1466 rc = bdb_dn2idl( op, e, ids, stack );
1469 if ( rc == LDAP_SUCCESS ) {
1470 rc = bdb_filter_candidates( op, &f, ids,
1471 stack, stack+BDB_IDL_UM_SIZE );
1474 if ( depth+1 > bdb->bi_search_stack_depth ) {
1480 LDAP_LOG ( OPERATION, DETAIL1,
1481 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1483 Debug(LDAP_DEBUG_TRACE,
1484 "bdb_search_candidates: failed (rc=%d)\n",
1490 LDAP_LOG ( OPERATION, DETAIL1,
1491 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1492 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1493 (long) BDB_IDL_LAST(ids));
1495 Debug(LDAP_DEBUG_TRACE,
1496 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1498 (long) BDB_IDL_FIRST(ids),
1499 (long) BDB_IDL_LAST(ids) );
1506 #ifdef LDAP_CONTROL_PAGEDRESULTS
1508 send_pagerequest_response(
1514 LDAPControl ctrl, *ctrls[2];
1515 char berbuf[LBER_ELEMENT_SIZEOF];
1516 BerElement *ber = (BerElement *)berbuf;
1517 struct berval cookie = { 0, NULL };
1518 PagedResultsCookie respcookie;
1521 LDAP_LOG ( OPERATION, ENTRY,
1522 "send_pagerequest_response: lastid: (0x%08lx) "
1523 "nentries: (0x%081x)\n",
1524 lastid, rs->sr_nentries, NULL );
1526 Debug(LDAP_DEBUG_ARGS, "send_pagerequest_response: lastid: (0x%08lx) "
1527 "nentries: (0x%081x)\n", lastid, rs->sr_nentries, NULL );
1530 ctrl.ldctl_value.bv_val = NULL;
1534 ber_init2( ber, NULL, LBER_USE_DER );
1536 respcookie = ( PagedResultsCookie )lastid;
1537 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1538 cookie.bv_len = sizeof( respcookie );
1539 cookie.bv_val = (char *)&respcookie;
1542 * FIXME: we should consider sending an estimate of the entries
1543 * left, after appropriate security check is done
1545 ber_printf( ber, "{iO}", tentries, &cookie );
1547 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1551 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1552 ctrls[0]->ldctl_iscritical = 0;
1554 rs->sr_ctrls = ctrls;
1555 rs->sr_err = LDAP_SUCCESS;
1556 send_ldap_result( op, rs );
1559 (void) ber_free_buf( ber );
1564 bdb_build_sync_state_ctrl(
1568 int entry_sync_state,
1569 LDAPControl **ctrls,
1577 const char *text = NULL;
1579 char berbuf[LBER_ELEMENT_SIZEOF];
1580 BerElement *ber = (BerElement *)berbuf;
1582 struct berval entryuuid_bv = { 0, NULL };
1584 ber_init2( ber, 0, LBER_USE_DER );
1586 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
1588 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
1589 AttributeDescription *desc = a->a_desc;
1590 if ( desc == slap_schema.si_ad_entryUUID ) {
1591 ber_dupbv( &entryuuid_bv, &a->a_vals[0] );
1595 if ( send_cookie && csn ) {
1596 ber_printf( ber, "{eOON}",
1597 entry_sync_state, &entryuuid_bv, csn );
1599 ber_printf( ber, "{eON}",
1600 entry_sync_state, &entryuuid_bv );
1603 ch_free( entryuuid_bv.bv_val );
1604 entryuuid_bv.bv_val = NULL;
1606 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
1607 ctrls[num_ctrls]->ldctl_iscritical = op->o_sync;
1608 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
1610 ber_free_buf( ber );
1614 LDAP_LOG ( OPERATION, RESULTS,
1615 "bdb_build_sync_ctrl: ber_flatten2 failed\n",
1618 Debug( LDAP_DEBUG_TRACE,
1619 "bdb_build_sync_ctrl: ber_flatten2 failed\n",
1622 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1626 return LDAP_SUCCESS;
1630 bdb_build_sync_done_ctrl(
1633 LDAPControl **ctrls,
1636 struct berval *csn )
1639 char berbuf[LBER_ELEMENT_SIZEOF];
1640 BerElement *ber = (BerElement *)berbuf;
1642 ber_init2( ber, NULL, LBER_USE_DER );
1644 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
1646 if ( send_cookie && csn ) {
1647 ber_printf( ber, "{ON}", csn );
1649 ber_printf( ber, "{N}" );
1652 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
1653 ctrls[num_ctrls]->ldctl_iscritical = op->o_sync;
1654 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
1656 ber_free_buf( ber );
1660 LDAP_LOG ( OPERATION, RESULTS,
1661 "bdb_build_sync_done_ctrl: ber_flatten2 failed\n",
1664 Debug( LDAP_DEBUG_TRACE,
1665 "bdb_build_sync_done_ctrl: ber_flatten2 failed\n",
1668 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1672 return LDAP_SUCCESS;
1676 bdb_send_ldap_intermediate(
1680 struct berval *cookie )
1682 char berbuf[LBER_ELEMENT_SIZEOF];
1683 BerElement *ber = (BerElement *)berbuf;
1684 struct berval rspdata;
1688 ber_init2( ber, NULL, LBER_USE_DER );
1690 if ( cookie == NULL ) {
1691 ber_printf( ber, "{eN}", state );
1693 ber_printf( ber, "{eON}", state, cookie );
1696 ret = ber_flatten2( ber, &rspdata, 0 );
1700 LDAP_LOG ( OPERATION, RESULTS,
1701 "bdb_send_ldap_intermediate: ber_flatten2 failed\n",
1704 Debug( LDAP_DEBUG_TRACE,
1705 "bdb_send_ldap_intermediate: ber_flatten2 failed\n",
1708 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1712 rs->sr_rspdata = &rspdata;
1713 send_ldap_intermediate( op, rs );
1714 rs->sr_rspdata = NULL;
1715 ber_free_buf( ber );
1717 return LDAP_SUCCESS;