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(
21 static int search_candidates(
22 Operation *stackop, /* op with the current threadctx/slab cache */
23 Operation *sop, /* search op */
26 static void send_pagerequest_response(
32 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
33 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
34 ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
36 #define IS_PSEARCH (op != sop)
39 bdb_abandon( Operation *op, SlapReply *rs )
42 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
44 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
45 if ( ps_list->o_connid == op->o_connid ) {
46 if ( ps_list->o_msgid == op->oq_abandon.rs_msgid ) {
47 ps_list->o_abandon = 1;
48 LDAP_LIST_REMOVE( ps_list, o_ps_link );
49 slap_op_free ( ps_list );
54 return LDAP_UNAVAILABLE;
58 bdb_cancel( Operation *op, SlapReply *rs )
61 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
63 LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
64 if ( ps_list->o_connid == op->o_connid ) {
65 if ( ps_list->o_msgid == op->oq_cancel.rs_msgid ) {
66 ps_list->o_cancel = SLAP_CANCEL_DONE;
67 LDAP_LIST_REMOVE( ps_list, o_ps_link );
70 bdb_build_sync_done_ctrl( conn, ps_list, ps_list->ctrls, 1, &latest_entrycsn_bv );
71 send_search_result( conn, ps_list, LDAP_CANCELLED,
72 NULL, NULL, NULL, ps_list->ctrls, ps_list->nentries);
74 rs->sr_err = LDAP_CANCELLED;
76 send_search_result( ps_list, rs );
78 slap_op_free ( ps_list );
83 return LDAP_UNAVAILABLE;
86 int bdb_search( Operation *op, SlapReply *rs )
88 return bdb_do_search( op, rs, op, NULL, 0 );
91 /* For persistent searches, op is the currently executing operation,
92 * sop is the persistent search. For regular searches, sop = op.
95 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop, Entry *ps_e, int ps_type )
97 int bdb_search( Operation *op, SlapReply *rs )
102 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
105 ID candidates[BDB_IDL_UM_SIZE];
107 Entry *matched = NULL;
108 struct berval realbase = { 0, NULL };
110 int nentries = 0, tentries = 0;
112 AttributeName *attrs;
114 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
115 Filter cookief, csnfnot, csnfeq, csnfand, csnfge;
116 AttributeAssertion aa_ge, aa_eq;
118 struct berval entrycsn_bv = { 0, NULL };
119 struct berval latest_entrycsn_bv = { 0, NULL };
120 LDAPControl *ctrls[SLAP_SEARCH_MAX_CTRLS];
122 AttributeName uuid_attr[2];
125 int entry_sync_state = -1;
126 AttributeName null_attr;
129 struct slap_limits_set *limit = NULL;
132 u_int32_t locker = 0;
136 LDAP_LOG ( OPERATION, ENTRY, "bdb_back_search\n", 0, 0, 0 );
138 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
141 attrs = sop->oq_search.rs_attrs;
143 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
144 #ifdef LDAP_CLIENT_UPDATE
145 if ( !IS_PSEARCH && sop->o_clientupdate_type & SLAP_LCUP_PERSIST ) {
146 sop->o_ps_protocol = LDAP_CLIENT_UPDATE;
147 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
152 /* psearch needs to be registered before refresh begins */
153 /* psearch and refresh transmission is serialized in send_ldap_ber() */
154 if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
155 sop->o_ps_protocol = LDAP_SYNC;
156 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
158 null_attr.an_desc = NULL;
159 null_attr.an_oc = NULL;
160 null_attr.an_name.bv_len = 0;
161 null_attr.an_name.bv_val = NULL;
164 for ( num_ctrls = 0; num_ctrls < SLAP_SEARCH_MAX_CTRLS; num_ctrls++ )
165 ctrls[num_ctrls] = NULL;
168 if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
169 #ifdef LDAP_CLIENT_UPDATE
170 if ( sop->o_ps_protocol == LDAP_CLIENT_UPDATE ) {
172 attrs[0].an_desc = slap_schema.si_ad_entryUUID;
173 attrs[0].an_oc = NULL;
174 attrs[0].an_name = attrs[0].an_desc->ad_cname;
175 attrs[1].an_desc = NULL;
176 attrs[1].an_oc = NULL;
177 attrs[1].an_name.bv_len = 0;
178 attrs[1].an_name.bv_val = NULL;
182 if (sop->o_ps_protocol == LDAP_SYNC ) {
184 attrs[0].an_desc = NULL;
185 attrs[0].an_oc = NULL;
186 attrs[0].an_name.bv_len = 0;
187 attrs[0].an_name.bv_val = NULL;
196 manageDSAit = get_manageDSAit( sop );
198 rs->sr_err = LOCK_ID (bdb->bi_dbenv, &locker );
204 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
208 if ( sop->o_req_ndn.bv_len == 0 ) {
209 /* DIT root special case */
210 e = (Entry *) &slap_entry_root;
214 /* get entry with reader lock */
215 if ( deref & LDAP_DEREF_FINDING ) {
216 e = deref_dn_r( op->o_bd, &sop->o_req_ndn, &rs->sr_err, &matched, &rs->sr_text );
222 rs->sr_err = bdb_dn2entry_r( op->o_bd, NULL, &sop->o_req_ndn, &e, &matched, 0, locker, &lock );
231 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
233 if (matched != NULL) {
234 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
236 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
237 LOCK_ID_FREE (bdb->bi_dbenv, locker );
239 case DB_LOCK_DEADLOCK:
240 case DB_LOCK_NOTGRANTED:
244 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
246 if (matched != NULL) {
247 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
249 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
250 LOCK_ID_FREE (bdb->bi_dbenv, locker );
255 struct berval matched_dn = { 0, NULL };
257 if ( matched != NULL ) {
259 ber_dupbv( &matched_dn, &matched->e_name );
261 erefs = is_entry_referral( matched )
262 ? get_entry_referrals( op, matched )
265 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
269 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
270 &sop->o_req_dn, sop->oq_search.rs_scope );
271 ber_bvarray_free( erefs );
275 rs->sr_ref = referral_rewrite( default_referral,
276 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
279 rs->sr_err=LDAP_REFERRAL;
280 rs->sr_matched = matched_dn.bv_val;
281 send_ldap_result( sop, rs );
283 LOCK_ID_FREE (bdb->bi_dbenv, locker );
285 ber_bvarray_free( rs->sr_ref );
288 if ( matched_dn.bv_val ) {
289 ber_memfree( matched_dn.bv_val );
290 rs->sr_matched = NULL;
295 if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
296 /* entry is a referral, don't allow add */
297 struct berval matched_dn;
300 ber_dupbv( &matched_dn, &e->e_name );
301 erefs = get_entry_referrals( op, e );
303 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
307 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
308 &sop->o_req_dn, sop->oq_search.rs_scope );
309 ber_bvarray_free( erefs );
313 LDAP_LOG ( OPERATION, RESULTS,
314 "bdb_search: entry is referral\n", 0, 0, 0 );
316 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
320 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
321 rs->sr_err = LDAP_REFERRAL;
322 rs->sr_matched = matched_dn.bv_val;
323 send_ldap_result( sop, rs );
325 LOCK_ID_FREE (bdb->bi_dbenv, locker );
326 ber_bvarray_free( rs->sr_ref );
328 ber_memfree( matched_dn.bv_val );
329 rs->sr_matched = NULL;
333 /* if not root, get appropriate limits */
334 if ( be_isroot( op->o_bd, &sop->o_ndn ) ) {
337 ( void ) get_limits( op->o_bd, &sop->o_ndn, &limit );
340 /* The time/size limits come first because they require very little
341 * effort, so there's no chance the candidates are selected and then
342 * the request is not honored only because of time/size constraints */
344 /* if no time limit requested, use soft limit (unless root!) */
346 if ( sop->oq_search.rs_tlimit == 0 ) {
347 sop->oq_search.rs_tlimit = -1; /* allow root to set no limit */
350 if ( sop->oq_search.rs_slimit == 0 ) {
351 sop->oq_search.rs_slimit = -1;
355 /* if no limit is required, use soft limit */
356 if ( sop->oq_search.rs_tlimit <= 0 ) {
357 sop->oq_search.rs_tlimit = limit->lms_t_soft;
359 /* if requested limit higher than hard limit, abort */
360 } else if ( sop->oq_search.rs_tlimit > limit->lms_t_hard ) {
361 /* no hard limit means use soft instead */
362 if ( limit->lms_t_hard == 0
363 && limit->lms_t_soft > -1
364 && sop->oq_search.rs_tlimit > limit->lms_t_soft ) {
365 sop->oq_search.rs_tlimit = limit->lms_t_soft;
367 /* positive hard limit means abort */
368 } else if ( limit->lms_t_hard > 0 ) {
369 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
370 send_search_result( sop, rs );
375 /* negative hard limit means no limit */
378 /* if no limit is required, use soft limit */
379 if ( sop->oq_search.rs_slimit <= 0 ) {
380 if ( get_pagedresults(sop) && limit->lms_s_pr != 0 ) {
381 sop->oq_search.rs_slimit = limit->lms_s_pr;
383 sop->oq_search.rs_slimit = limit->lms_s_soft;
386 /* if requested limit higher than hard limit, abort */
387 } else if ( sop->oq_search.rs_slimit > limit->lms_s_hard ) {
388 /* no hard limit means use soft instead */
389 if ( limit->lms_s_hard == 0
390 && limit->lms_s_soft > -1
391 && sop->oq_search.rs_slimit > limit->lms_s_soft ) {
392 sop->oq_search.rs_slimit = limit->lms_s_soft;
394 /* positive hard limit means abort */
395 } else if ( limit->lms_s_hard > 0 ) {
396 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
397 send_search_result( sop, rs );
402 /* negative hard limit means no limit */
406 /* compute it anyway; root does not use it */
407 stoptime = op->o_time + sop->oq_search.rs_tlimit;
409 /* select candidates */
410 if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
411 rs->sr_err = base_candidate( op->o_bd, e, candidates );
414 BDB_IDL_ALL( bdb, candidates );
415 rs->sr_err = search_candidates( op, sop, e, candidates );
418 /* start cursor at beginning of candidates.
421 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
423 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
424 cursor = bdb_idl_search( candidates, ps_e->e_id );
425 if ( candidates[cursor] != ps_e->e_id ) {
426 rs->sr_err = LDAP_SUCCESS;
430 if ( ps_e->e_id < BDB_IDL_RANGE_FIRST(candidates)
431 || ps_e->e_id > BDB_IDL_RANGE_LAST(candidates)){
432 rs->sr_err = LDAP_SUCCESS;
437 candidates[1] = ps_e->e_id;
441 /* need normalized dn below */
442 ber_dupbv( &realbase, &e->e_nname );
444 if ( e != &slap_entry_root ) {
445 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
449 if ( candidates[0] == 0 ) {
451 LDAP_LOG ( OPERATION, RESULTS,
452 "bdb_search: no candidates\n", 0, 0, 0 );
454 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
458 rs->sr_err = LDAP_SUCCESS;
459 send_search_result( sop, rs );
464 /* if not root and candidates exceed to-be-checked entries, abort */
465 if ( !isroot && limit->lms_s_unchecked != -1 ) {
466 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
467 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
468 send_search_result( sop, rs );
474 if ( isroot || !limit->lms_s_pr_hide ) {
475 tentries = BDB_IDL_N(candidates);
478 #ifdef LDAP_CONTROL_PAGEDRESULTS
479 if ( get_pagedresults(sop) ) {
480 if ( sop->o_pagedresults_state.ps_cookie == 0 ) {
483 if ( sop->o_pagedresults_size == 0 ) {
484 rs->sr_err = LDAP_SUCCESS;
485 rs->sr_text = "search abandoned by pagedResult size=0";
486 send_search_result( sop, rs );
489 for ( id = bdb_idl_first( candidates, &cursor );
490 id != NOID && id <= (ID)( sop->o_pagedresults_state.ps_cookie );
491 id = bdb_idl_next( candidates, &cursor ) );
493 if ( cursor == NOID ) {
495 LDAP_LOG ( OPERATION, RESULTS,
496 "bdb_search: no paged results candidates\n",
499 Debug( LDAP_DEBUG_TRACE,
500 "bdb_search: no paged results candidates\n",
503 rs->sr_nentries = nentries;
504 send_pagerequest_response( sop, rs, lastid, 0 );
513 #ifdef LDAP_CLIENT_UPDATE
514 if ( (sop->o_clientupdate_type & SLAP_LCUP_SYNC) ||
515 (IS_PSEARCH && sop->o_ps_protocol == LDAP_CLIENT_UPDATE )) {
516 cookief.f_choice = LDAP_FILTER_AND;
517 cookief.f_and = &csnfnot;
518 cookief.f_next = NULL;
520 csnfnot.f_choice = LDAP_FILTER_NOT;
521 csnfnot.f_not = &csnfeq;
522 csnfnot.f_next = &csnfand;
524 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
525 csnfeq.f_ava = &aa_eq;
526 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
527 csnfeq.f_av_value = sop->o_clientupdate_state;
529 csnfand.f_choice = LDAP_FILTER_AND;
530 csnfand.f_and = &csnfge;
531 csnfand.f_next = NULL;
533 csnfge.f_choice = LDAP_FILTER_GE;
534 csnfge.f_ava = &aa_ge;
535 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
536 csnfge.f_av_value = sop->o_clientupdate_state;
537 csnfge.f_next = sop->oq_search.rs_filter;
540 #if defined(LDAP_CLIENT_UPDATE) && defined(LDAP_SYNC)
544 if ( (sop->o_sync_mode & SLAP_SYNC_REFRESH) ||
545 ( IS_PSEARCH && sop->o_ps_protocol == LDAP_SYNC )) {
546 cookief.f_choice = LDAP_FILTER_AND;
547 cookief.f_and = &csnfnot;
548 cookief.f_next = NULL;
550 csnfnot.f_choice = LDAP_FILTER_NOT;
551 csnfnot.f_not = &csnfeq;
552 csnfnot.f_next = &csnfand;
554 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
555 csnfeq.f_ava = &aa_eq;
556 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
557 csnfeq.f_av_value = sop->o_sync_state;
559 csnfand.f_choice = LDAP_FILTER_AND;
560 csnfand.f_and = &csnfge;
561 csnfand.f_next = NULL;
563 csnfge.f_choice = LDAP_FILTER_GE;
564 csnfge.f_ava = &aa_ge;
565 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
566 csnfge.f_av_value = sop->o_sync_state;
567 csnfge.f_next = sop->oq_search.rs_filter;
571 for ( id = bdb_idl_first( candidates, &cursor );
573 id = bdb_idl_next( candidates, &cursor ) )
579 /* check for abandon */
580 if ( sop->o_abandon ) {
585 #ifdef LDAP_EXOP_X_CANCEL
586 if ( sop->o_cancel ) {
587 assert( sop->o_cancel == SLAP_CANCEL_REQ );
588 rs->sr_err = LDAP_CANCELLED;
589 rs->sr_nentries = nentries;
590 send_search_result( sop, rs );
591 sop->o_cancel = SLAP_CANCEL_ACK;
597 /* check time limit */
598 if ( sop->oq_search.rs_tlimit != -1 && slap_get_time() > stoptime ) {
599 rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
600 rs->sr_ref = rs->sr_v2ref;
601 rs->sr_nentries = nentries;
602 send_search_result( sop, rs );
607 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
611 /* get the entry with reader lock */
612 rs->sr_err = bdb_id2entry_r( op->o_bd, NULL, id, &e, locker, &lock );
614 if (rs->sr_err == LDAP_BUSY) {
615 rs->sr_text = "ldap server busy";
616 send_ldap_result( sop, rs );
619 } else if ( rs->sr_err == DB_LOCK_DEADLOCK || rs->sr_err == DB_LOCK_NOTGRANTED ) {
624 if( !BDB_IDL_IS_RANGE(candidates) ) {
625 /* only complain for non-range IDLs */
627 LDAP_LOG ( OPERATION, RESULTS,
628 "bdb_search: candidate %ld not found\n", (long) id, 0, 0);
630 Debug( LDAP_DEBUG_TRACE,
631 "bdb_search: candidate %ld not found\n",
638 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
645 #ifdef BDB_SUBENTRIES
646 if ( is_entry_subentry( e ) ) {
647 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
648 if(!get_subentries_visibility( sop )) {
649 /* only subentries are visible */
653 } else if ( get_subentries( sop ) &&
654 !get_subentries_visibility( sop ))
656 /* only subentries are visible */
660 } else if ( get_subentries_visibility( sop )) {
661 /* only subentries are visible */
667 if ( sop->oq_search.rs_deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
672 e = deref_entry_r( op->o_bd, e, &rs->sr_err, &matched, &rs->sr_text );
679 if( e->e_id == id ) {
684 /* need to skip alias which deref into scope */
685 if( sop->oq_search.rs_scope & LDAP_SCOPE_ONELEVEL ) {
688 dnParent( &e->e_nname, &pdn ):
689 if ( ber_bvcmp( pdn, &realbase ) ) {
693 } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
694 /* alias is within scope */
696 LDAP_LOG ( OPERATION, RESULTS,
697 "bdb_search: \"%s\" in subtree\n", e->edn, 0, 0);
699 Debug( LDAP_DEBUG_TRACE,
700 "bdb_search: \"%s\" in subtree\n",
711 * if it's a referral, add it to the list of referrals. only do
712 * this for non-base searches, and don't check the filter
713 * explicitly here since it's only a candidate anyway.
715 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE &&
716 is_entry_referral( e ) )
721 if ( !scopeok && sop->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL ) {
722 if ( !be_issuffix( op->o_bd, &e->e_nname ) ) {
723 dnParent( &e->e_nname, &dn );
724 scopeok = dn_match( &dn, &realbase );
726 scopeok = (realbase.bv_len == 0);
729 } else if ( !scopeok && sop->oq_search.rs_scope == LDAP_SCOPE_SUBTREE ) {
730 scopeok = dnIsSuffix( &e->e_nname, &realbase );
737 BerVarray erefs = get_entry_referrals( sop, e );
738 rs->sr_ref = referral_rewrite( erefs,
740 sop->oq_search.rs_scope == LDAP_SCOPE_SUBTREE
744 send_search_reference( sop, rs );
746 ber_bvarray_free( rs->sr_ref );
747 ber_bvarray_free( erefs );
752 LDAP_LOG(OPERATION, DETAIL2,
753 "bdb_search: candidate referral %ld scope not okay\n",
756 Debug( LDAP_DEBUG_TRACE,
757 "bdb_search: candidate referral %ld scope not okay\n",
765 /* if it matches the filter and scope, send it */
766 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
768 if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
769 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
771 rs->sr_err = LDAP_COMPARE_TRUE;
774 #ifdef LDAP_CLIENT_UPDATE
775 if ( sop->o_clientupdate_type & SLAP_LCUP_SYNC ) {
776 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
780 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
781 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
782 rs->sr_err = test_filter( sop, rs->sr_entry, sop->oq_search.rs_filter );
783 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
784 if ( rc_sync == LDAP_COMPARE_TRUE ) {
785 entry_sync_state = LDAP_SYNC_ADD;
787 entry_sync_state = LDAP_SYNC_PRESENT;
794 rs->sr_err = test_filter( sop, rs->sr_entry, sop->oq_search.rs_filter );
796 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
800 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
804 if ( !scopeok && sop->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL ) {
805 if ( be_issuffix( op->o_bd, &e->e_nname ) ) {
806 scopeok = (realbase.bv_len == 0);
808 dnParent( &e->e_nname, &dn );
809 scopeok = dn_match( &dn, &realbase );
812 } else if ( !scopeok && sop->oq_search.rs_scope == LDAP_SCOPE_SUBTREE ) {
813 scopeok = dnIsSuffix( &e->e_nname, &realbase );
820 /* check size limit */
821 if ( --sop->oq_search.rs_slimit == -1 ) {
822 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
825 bdb_cache_return_entry_r( bdb->bi_dbenv,
826 &bdb->bi_cache, e, &lock );
829 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
830 rs->sr_ref = rs->sr_v2ref;
831 rs->sr_nentries = nentries;
832 send_search_result( sop, rs );
836 #ifdef LDAP_CONTROL_PAGEDRESULTS
837 if ( get_pagedresults(sop) ) {
838 if ( nentries >= sop->o_pagedresults_size ) {
839 rs->sr_nentries = nentries;
840 send_pagerequest_response( sop, rs,
851 #if 0 /* noop is masked SLAP_CTRL_UPDATE */
856 #if defined(LDAP_CLIENT_UPDATE) || defined(LDAP_SYNC)
859 int premodify_found = 0;
860 int entry_sync_state;
863 if ( ps_type == LDAP_PSEARCH_BY_ADD ||
864 ps_type == LDAP_PSEARCH_BY_DELETE ||
865 ps_type == LDAP_PSEARCH_BY_MODIFY ||
866 ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
868 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
869 struct psid_entry* psid_e;
870 LDAP_LIST_FOREACH( psid_e, &op->o_pm_list, ps_link)
872 if( psid_e->ps_op == sop )
877 LDAP_LIST_REMOVE(psid_e, ps_link);
881 if (psid_e != NULL) free (psid_e);
884 if ( ps_type == LDAP_PSEARCH_BY_ADD )
885 entry_sync_state = LDAP_SYNC_ADD;
886 else if ( ps_type == LDAP_PSEARCH_BY_DELETE )
887 entry_sync_state = LDAP_SYNC_DELETE;
888 else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
889 if ( premodify_found )
890 entry_sync_state = LDAP_SYNC_MODIFY;
892 entry_sync_state = LDAP_SYNC_ADD;
893 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
894 entry_sync_state = LDAP_SYNC_DELETE;
901 #ifdef LDAP_CLIENT_UPDATE
902 if ( sop->o_ps_protocol == LDAP_CLIENT_UPDATE ) {
903 int entry_count = ++sop->o_ps_entries;
904 if ( IS_BDB_REPLACE(ps_type) ) {
905 rs->sr_err = bdb_build_lcup_update_ctrl( sop, rs, e, entry_count, ctrls,
906 num_ctrls++, &latest_entrycsn_bv, SLAP_LCUP_ENTRY_DELETED_TRUE );
908 rs->sr_err = bdb_build_lcup_update_ctrl( sop, rs, e, entry_count, ctrls,
909 num_ctrls++, &latest_entrycsn_bv, SLAP_LCUP_ENTRY_DELETED_FALSE );
911 if ( rs->sr_err != LDAP_SUCCESS )
913 rs->sr_attrs = attrs;
914 rs->sr_ctrls = ctrls;
915 result = send_search_entry( sop, rs );
916 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL )
917 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
918 ch_free( ctrls[--num_ctrls] );
919 ctrls[num_ctrls] = NULL;
924 if ( sop->o_ps_protocol == LDAP_SYNC ) {
925 rs->sr_err = bdb_build_sync_state_ctrl( sop, rs, e, entry_sync_state, ctrls,
926 num_ctrls++, 1, &latest_entrycsn_bv );
927 if ( rs->sr_err != LDAP_SUCCESS )
929 rs->sr_attrs = attrs;
930 rs->sr_ctrls = ctrls;
931 result = send_search_entry( sop, rs );
932 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL )
933 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
934 ch_free( ctrls[--num_ctrls] );
935 ctrls[num_ctrls] = NULL;
944 } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
945 struct psid_entry* psid_e;
946 psid_e = (struct psid_entry *) calloc (1,
947 sizeof(struct psid_entry));
949 LDAP_LIST_INSERT_HEAD( &op->o_pm_list, psid_e, ps_link );
955 #ifdef LDAP_CLIENT_UPDATE
956 if ( sop->o_clientupdate_type & SLAP_LCUP_SYNC ) {
957 rs->sr_err = bdb_build_lcup_update_ctrl( sop, rs, e, ++entry_count, ctrls,
958 num_ctrls++, &latest_entrycsn_bv, SLAP_LCUP_ENTRY_DELETED_FALSE );
959 if ( rs->sr_err != LDAP_SUCCESS )
961 rs->sr_ctrls = ctrls;
962 rs->sr_attrs = sop->oq_search.rs_attrs;
963 result = send_search_entry( sop, rs );
965 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL )
966 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
967 ch_free( ctrls[--num_ctrls] );
968 ctrls[num_ctrls] = NULL;
973 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
974 rs->sr_err = bdb_build_sync_state_ctrl( sop, rs, e, entry_sync_state, ctrls,
975 num_ctrls++, 0, &latest_entrycsn_bv );
976 if ( rs->sr_err != LDAP_SUCCESS )
979 rs->sr_ctrls = ctrls;
980 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
981 rs->sr_attrs = sop->oq_search.rs_attrs;
982 } else { /* PRESENT */
983 rs->sr_attrs = &null_attr;
985 result = send_search_entry( sop, rs );
987 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL )
988 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
989 ch_free( ctrls[--num_ctrls] );
990 ctrls[num_ctrls] = NULL;
996 rs->sr_attrs = sop->oq_search.rs_attrs;
998 result = send_search_entry( sop, rs );
1003 case 0: /* entry sent ok */
1006 case 1: /* entry not sent */
1008 case -1: /* connection closed */
1010 bdb_cache_return_entry_r(bdb->bi_dbenv,
1011 &bdb->bi_cache, e, &lock);
1013 rs->sr_entry = NULL;
1014 rs->sr_err = LDAP_OTHER;
1020 LDAP_LOG ( OPERATION, RESULTS,
1021 "bdb_search: %ld scope not okay\n", (long) id, 0, 0);
1023 Debug( LDAP_DEBUG_TRACE,
1024 "bdb_search: %ld scope not okay\n",
1030 LDAP_LOG ( OPERATION, RESULTS,
1031 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1033 Debug( LDAP_DEBUG_TRACE,
1034 "bdb_search: %ld does not match filter\n",
1041 /* free reader lock */
1043 bdb_cache_return_entry_r( bdb->bi_dbenv,
1044 &bdb->bi_cache, e , &lock);
1046 rs->sr_entry = NULL;
1049 ldap_pvt_thread_yield();
1053 #ifdef LDAP_CLIENT_UPDATE
1054 if ( sop->o_clientupdate_type & SLAP_LCUP_SYNC ) {
1055 bdb_build_lcup_done_ctrl( sop, rs, ctrls, num_ctrls++, &latest_entrycsn_bv );
1057 rs->sr_ctrls = ctrls;
1058 rs->sr_ref = rs->sr_v2ref;
1059 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1060 rs->sr_nentries = nentries;
1061 send_search_result( sop, rs );
1063 ch_free( latest_entrycsn_bv.bv_val );
1064 latest_entrycsn_bv.bv_val = NULL;
1066 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL )
1067 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
1068 ch_free( ctrls[--num_ctrls] );
1069 ctrls[num_ctrls] = NULL;
1073 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1074 if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1075 /* refreshAndPersist mode */
1076 rs->sr_err = LDAP_SUCCESS;
1077 rs->sr_rspoid = LDAP_SYNC_INFO;
1078 rs->sr_ctrls = NULL;
1079 bdb_send_ldap_intermediate( sop, rs,
1080 LDAP_SYNC_REFRESH_DONE, &latest_entrycsn_bv );
1082 /* refreshOnly mode */
1083 bdb_build_sync_done_ctrl( sop, rs, ctrls, num_ctrls++, 1, &latest_entrycsn_bv );
1084 rs->sr_ctrls = ctrls;
1085 rs->sr_ref = rs->sr_v2ref;
1086 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1087 rs->sr_nentries = nentries;
1088 send_search_result( sop, rs );
1089 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL )
1090 ch_free( ctrls[num_ctrls-1]->ldctl_value.bv_val );
1091 ch_free( ctrls[--num_ctrls] );
1092 ctrls[num_ctrls] = NULL;
1095 ch_free( latest_entrycsn_bv.bv_val );
1096 latest_entrycsn_bv.bv_val = NULL;
1100 rs->sr_ctrls = NULL;
1101 rs->sr_ref = rs->sr_v2ref;
1102 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1103 rs->sr_nentries = nentries;
1104 send_search_result( sop, rs );
1108 rs->sr_err = LDAP_SUCCESS;
1111 if( !IS_PSEARCH && e != NULL ) {
1112 /* free reader lock */
1113 bdb_cache_return_entry_r ( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1116 LOCK_ID_FREE (bdb->bi_dbenv, locker );
1118 if( rs->sr_v2ref ) {
1119 ber_bvarray_free( rs->sr_v2ref );
1120 rs->sr_v2ref = NULL;
1122 if( realbase.bv_val ) ch_free( realbase.bv_val );
1128 static int base_candidate(
1134 LDAP_LOG ( OPERATION, ENTRY,
1135 "base_candidate: base: \"%s\" (0x%08lx)\n", e->e_dn, (long) e->e_id, 0);
1137 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1138 e->e_dn, (long) e->e_id, 0);
1146 /* Look for "objectClass Present" in this filter.
1147 * Also count depth of filter tree while we're at it.
1149 static int oc_filter(
1157 if( cur > *max ) *max = cur;
1159 switch(f->f_choice) {
1160 case LDAP_FILTER_PRESENT:
1161 if (f->f_desc == slap_schema.si_ad_objectClass) {
1166 case LDAP_FILTER_AND:
1167 case LDAP_FILTER_OR:
1169 for (f=f->f_and; f; f=f->f_next) {
1170 (void) oc_filter(f, cur, max);
1180 static void search_stack_free( void *key, void *data)
1185 static void *search_stack(
1189 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1192 if ( op->o_threadctx ) {
1193 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1196 ret = bdb->bi_search_stack;
1200 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE * sizeof( ID ) );
1201 if ( op->o_threadctx ) {
1202 ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1203 ret, search_stack_free );
1205 bdb->bi_search_stack = ret;
1211 static int search_candidates(
1217 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1219 Filter f, scopef, rf, xf;
1221 AttributeAssertion aa_ref;
1222 #ifdef BDB_SUBENTRIES
1224 AttributeAssertion aa_subentry;
1228 AttributeAssertion aa_alias;
1232 * This routine takes as input a filter (user-filter)
1233 * and rewrites it as follows:
1234 * (&(scope=DN)[(objectClass=subentry)]
1235 * (|[(objectClass=referral)(objectClass=alias)](user-filter))
1239 LDAP_LOG ( OPERATION, ENTRY,
1240 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1241 e->e_dn, (long) e->e_id, op->oq_search.rs_scope);
1243 Debug(LDAP_DEBUG_TRACE,
1244 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1245 e->e_dn, (long) e->e_id, op->oq_search.rs_scope );
1248 xf.f_or = op->oq_search.rs_filter;
1249 xf.f_choice = LDAP_FILTER_OR;
1252 /* If the user's filter uses objectClass=*,
1253 * these clauses are redundant.
1255 if (!oc_filter(op->oq_search.rs_filter, 1, &depth) && !get_subentries_visibility(op) ) {
1256 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1257 /* match referral objects */
1258 struct berval bv_ref = { sizeof("referral")-1, "referral" };
1259 rf.f_choice = LDAP_FILTER_EQUALITY;
1261 rf.f_av_desc = slap_schema.si_ad_objectClass;
1262 rf.f_av_value = bv_ref;
1263 rf.f_next = xf.f_or;
1268 if( op->oq_search.rs_deref & LDAP_DEREF_SEARCHING ) {
1269 /* match alias objects */
1270 struct berval bv_alias = { sizeof("alias")-1, "alias" };
1271 af.f_choice = LDAP_FILTER_EQUALITY;
1272 af.f_ava = &aa_alias;
1273 af.f_av_desc = slap_schema.si_ad_objectClass;
1274 af.f_av_value = bv_alias;
1275 af.f_next = xf.f_or;
1279 /* We added one of these clauses, filter depth increased */
1280 if( xf.f_or != op->oq_search.rs_filter ) depth++;
1284 f.f_choice = LDAP_FILTER_AND;
1286 scopef.f_choice = op->oq_search.rs_scope == LDAP_SCOPE_SUBTREE
1287 ? SLAPD_FILTER_DN_SUBTREE
1288 : SLAPD_FILTER_DN_ONE;
1289 scopef.f_dn = &e->e_nname;
1290 scopef.f_next = xf.f_or == op->oq_search.rs_filter ? op->oq_search.rs_filter : &xf ;
1291 /* Filter depth increased again, adding scope clause */
1294 #ifdef BDB_SUBENTRIES
1295 if( get_subentries_visibility( op ) ) {
1296 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1297 sf.f_choice = LDAP_FILTER_EQUALITY;
1298 sf.f_ava = &aa_subentry;
1299 sf.f_av_desc = slap_schema.si_ad_objectClass;
1300 sf.f_av_value = bv_subentry;
1301 sf.f_next = scopef.f_next;
1302 scopef.f_next = &sf;
1306 /* Allocate IDL stack, plus 1 more for former tmp */
1307 if ( depth+1 > bdb->bi_search_stack_depth ) {
1308 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1310 stack = search_stack( stackop );
1313 rc = bdb_filter_candidates( op->o_bd, &f, ids, stack, stack+BDB_IDL_UM_SIZE );
1315 if ( depth+1 > bdb->bi_search_stack_depth ) {
1321 LDAP_LOG ( OPERATION, DETAIL1,
1322 "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0 );
1324 Debug(LDAP_DEBUG_TRACE,
1325 "bdb_search_candidates: failed (rc=%d)\n",
1331 LDAP_LOG ( OPERATION, DETAIL1,
1332 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1333 (long) ids[0], (long) BDB_IDL_FIRST(ids),
1334 (long) BDB_IDL_LAST(ids));
1336 Debug(LDAP_DEBUG_TRACE,
1337 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1339 (long) BDB_IDL_FIRST(ids),
1340 (long) BDB_IDL_LAST(ids) );
1347 #ifdef LDAP_CONTROL_PAGEDRESULTS
1349 send_pagerequest_response(
1355 LDAPControl ctrl, *ctrls[2];
1356 char berbuf[LBER_ELEMENT_SIZEOF];
1357 BerElement *ber = (BerElement *)berbuf;
1358 struct berval cookie = { 0, NULL };
1359 PagedResultsCookie respcookie;
1362 LDAP_LOG ( OPERATION, ENTRY,
1363 "send_pagerequest_response: lastid: (0x%08lx) "
1364 "nentries: (0x%081x)\n",
1365 lastid, rs->sr_nentries, NULL );
1367 Debug(LDAP_DEBUG_ARGS, "send_pagerequest_response: lastid: (0x%08lx) "
1368 "nentries: (0x%081x)\n", lastid, rs->sr_nentries, NULL );
1371 ctrl.ldctl_value.bv_val = NULL;
1375 ber_init2( ber, NULL, LBER_USE_DER );
1377 respcookie = ( PagedResultsCookie )lastid;
1378 op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1379 cookie.bv_len = sizeof( respcookie );
1380 cookie.bv_val = (char *)&respcookie;
1383 * FIXME: we should consider sending an estimate of the entries
1384 * left, after appropriate security check is done
1386 ber_printf( ber, "{iO}", tentries, &cookie );
1388 if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1392 ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1393 ctrls[0]->ldctl_iscritical = 0;
1395 rs->sr_ctrls = ctrls;
1396 rs->sr_err = LDAP_SUCCESS;
1397 send_search_result( op, rs );
1400 (void) ber_free_buf( ber );
1404 #ifdef LDAP_CLIENT_UPDATE
1406 bdb_build_lcup_update_ctrl(
1411 LDAPControl **ctrls,
1413 struct berval *latest_entrycsn_bv,
1420 const char *text = NULL;
1422 char berbuf[LBER_ELEMENT_SIZEOF];
1423 BerElement *ber = (BerElement *)berbuf;
1425 struct berval entrycsn_bv = { 0, NULL };
1427 ber_init2( ber, 0, LBER_USE_DER );
1429 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
1431 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
1432 AttributeDescription *desc = a->a_desc;
1433 if ( desc == slap_schema.si_ad_entryCSN ) {
1434 ber_dupbv( &entrycsn_bv, &a->a_vals[0] );
1435 if ( latest_entrycsn_bv->bv_val == NULL ) {
1436 ber_dupbv( latest_entrycsn_bv, &entrycsn_bv );
1438 res = value_match( &ret, desc,
1439 desc->ad_type->sat_ordering, 0,
1440 &entrycsn_bv, latest_entrycsn_bv, &text );
1441 if ( res != LDAP_SUCCESS ) {
1444 LDAP_LOG ( OPERATION, RESULTS,
1445 "bdb_search: value_match failed\n",
1448 Debug( LDAP_DEBUG_TRACE,
1449 "bdb_search: value_match failed\n",
1455 ch_free( latest_entrycsn_bv->bv_val );
1456 latest_entrycsn_bv->bv_val = NULL;
1457 ber_dupbv( latest_entrycsn_bv, &entrycsn_bv );
1463 if ( entry_count % op->o_clientupdate_interval == 0 )
1466 SLAP_LCUP_STATE_UPDATE_FALSE,
1468 LDAP_CUP_COOKIE_OID, &entrycsn_bv );
1469 else /* Do not send cookie */
1472 SLAP_LCUP_STATE_UPDATE_FALSE,
1475 ch_free( entrycsn_bv.bv_val );
1476 entrycsn_bv.bv_val = NULL;
1478 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_ENTRY_UPDATE;
1479 ctrls[num_ctrls]->ldctl_iscritical = op->o_clientupdate;
1480 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
1482 ber_free_buf( ber );
1486 LDAP_LOG ( OPERATION, RESULTS,
1487 "bdb_build_lcup_ctrl: ber_flatten2 failed\n",
1490 Debug( LDAP_DEBUG_TRACE,
1491 "bdb_build_lcup_ctrl: ber_flatten2 failed\n",
1494 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1498 return LDAP_SUCCESS;
1502 bdb_build_lcup_done_ctrl(
1505 LDAPControl **ctrls,
1507 struct berval *latest_entrycsn_bv )
1510 char berbuf[LBER_ELEMENT_SIZEOF];
1511 BerElement *ber = (BerElement *)berbuf;
1513 ber_init2( ber, NULL, LBER_USE_DER );
1515 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
1517 ber_printf( ber, "{sO", LDAP_CUP_COOKIE_OID, latest_entrycsn_bv );
1518 ber_printf( ber, "N}" );
1520 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_CLIENT_UPDATE_DONE;
1521 ctrls[num_ctrls]->ldctl_iscritical = op->o_clientupdate;
1522 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
1524 ber_free_buf( ber );
1528 LDAP_LOG ( OPERATION, RESULTS,
1529 "bdb_build_lcup_done_ctrl: ber_flatten2 failed\n", 0, 0, 0 );
1531 Debug( LDAP_DEBUG_TRACE, "bdb_build_lcup_done_ctrl: ber_flatten2 failed\n",
1534 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1538 return LDAP_SUCCESS;
1544 bdb_build_sync_state_ctrl(
1548 int entry_sync_state,
1549 LDAPControl **ctrls,
1552 struct berval *latest_entrycsn_bv )
1558 const char *text = NULL;
1560 char berbuf[LBER_ELEMENT_SIZEOF];
1561 BerElement *ber = (BerElement *)berbuf;
1563 struct berval entryuuid_bv = { 0, NULL };
1564 struct berval entrycsn_bv = { 0, NULL };
1566 ber_init2( ber, 0, LBER_USE_DER );
1568 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
1570 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
1571 AttributeDescription *desc = a->a_desc;
1572 if ( desc == slap_schema.si_ad_entryCSN ) {
1573 ber_dupbv( &entrycsn_bv, &a->a_vals[0] );
1574 if ( latest_entrycsn_bv->bv_val == NULL ) {
1575 ber_dupbv( latest_entrycsn_bv, &entrycsn_bv );
1577 res = value_match( &ret, desc,
1578 desc->ad_type->sat_ordering, 0,
1579 &entrycsn_bv, latest_entrycsn_bv, &text );
1580 if ( res != LDAP_SUCCESS ) {
1583 LDAP_LOG ( OPERATION, RESULTS,
1584 "bdb_search: value_match failed\n",
1587 Debug( LDAP_DEBUG_TRACE,
1588 "bdb_search: value_match failed\n",
1593 ch_free( latest_entrycsn_bv->bv_val );
1594 latest_entrycsn_bv->bv_val = NULL;
1595 ber_dupbv( latest_entrycsn_bv, &entrycsn_bv );
1598 } else if ( desc == slap_schema.si_ad_entryUUID ) {
1599 ber_dupbv( &entryuuid_bv, &a->a_vals[0] );
1604 ber_printf( ber, "{eOON}", entry_sync_state, &entryuuid_bv, &entrycsn_bv );
1606 ber_printf( ber, "{eON}", entry_sync_state, &entryuuid_bv );
1608 ch_free( entrycsn_bv.bv_val );
1609 entrycsn_bv.bv_val = NULL;
1610 ch_free( entryuuid_bv.bv_val );
1611 entryuuid_bv.bv_val = NULL;
1613 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_STATE;
1614 ctrls[num_ctrls]->ldctl_iscritical = op->o_sync;
1615 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
1617 ber_free_buf( ber );
1621 LDAP_LOG ( OPERATION, RESULTS,
1622 "bdb_build_sync_ctrl: ber_flatten2 failed\n",
1625 Debug( LDAP_DEBUG_TRACE,
1626 "bdb_build_sync_ctrl: ber_flatten2 failed\n",
1629 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1633 return LDAP_SUCCESS;
1637 bdb_build_sync_done_ctrl(
1640 LDAPControl **ctrls,
1643 struct berval *latest_entrycsn_bv )
1646 char berbuf[LBER_ELEMENT_SIZEOF];
1647 BerElement *ber = (BerElement *)berbuf;
1649 ber_init2( ber, NULL, LBER_USE_DER );
1651 ctrls[num_ctrls] = ch_malloc ( sizeof ( LDAPControl ) );
1653 if ( send_cookie ) {
1654 ber_printf( ber, "{ON}", latest_entrycsn_bv );
1656 ber_printf( ber, "{N}" );
1659 ctrls[num_ctrls]->ldctl_oid = LDAP_CONTROL_SYNC_DONE;
1660 ctrls[num_ctrls]->ldctl_iscritical = op->o_sync;
1661 ret = ber_flatten2( ber, &ctrls[num_ctrls]->ldctl_value, 1 );
1663 ber_free_buf( ber );
1667 LDAP_LOG ( OPERATION, RESULTS,
1668 "bdb_build_lcup_done_ctrl: ber_flatten2 failed\n", 0, 0, 0 );
1670 Debug( LDAP_DEBUG_TRACE, "bdb_build_lcup_done_ctrl: ber_flatten2 failed\n",
1673 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1677 return LDAP_SUCCESS;
1681 bdb_send_ldap_intermediate(
1685 struct berval *cookie )
1687 char berbuf[LBER_ELEMENT_SIZEOF];
1688 BerElement *ber = (BerElement *)berbuf;
1689 struct berval rspdata;
1693 ber_init2( ber, NULL, LBER_USE_DER );
1695 if ( cookie == NULL )
1696 ber_printf( ber, "{eN}", state );
1698 ber_printf( ber, "{eON}", state, cookie );
1700 ret = ber_flatten2( ber, &rspdata, 0 );
1704 LDAP_LOG ( OPERATION, RESULTS,
1705 "bdb_build_lcup_done_ctrl: ber_flatten2 failed\n", 0, 0, 0 );
1707 Debug( LDAP_DEBUG_TRACE, "bdb_build_lcup_done_ctrl: ber_flatten2 failed\n",
1710 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
1714 rs->sr_rspdata = &rspdata;
1715 send_ldap_intermediate_resp( op, rs );
1716 rs->sr_rspdata = NULL;
1717 ber_free_buf( ber );
1719 return LDAP_SUCCESS;