1 /* lcup.c - lcup operations */
3 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
15 #ifdef LDAP_CLIENT_UPDATE
24 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
26 LDAP_LIST_FOREACH ( ps_list, &bdb->psearch_list, link ) {
27 if ( ps_list->o_connid == conn->c_connid ) {
28 if ( ps_list->o_msgid == id ) {
29 ps_list->o_abandon = 1;
30 LDAP_LIST_REMOVE( ps_list, link );
31 slap_op_free ( ps_list );
36 return LDAP_UNAVAILABLE;
55 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
57 LDAP_LIST_FIRST(&op->psearch_spec) = (struct lcup_search_spec *)
58 calloc ( 1, sizeof ( struct lcup_search_spec ) );
60 LDAP_LIST_FIRST(&op->psearch_spec)->op = op;
62 LDAP_LIST_FIRST(&op->psearch_spec)->base = ber_dupbv(NULL, base);
63 LDAP_LIST_FIRST(&op->psearch_spec)->nbase = ber_dupbv(NULL, nbase);
65 LDAP_LIST_FIRST(&op->psearch_spec)->scope = scope;
66 LDAP_LIST_FIRST(&op->psearch_spec)->deref = deref;
67 LDAP_LIST_FIRST(&op->psearch_spec)->slimit = slimit;
68 LDAP_LIST_FIRST(&op->psearch_spec)->tlimit = tlimit;
70 LDAP_LIST_FIRST(&op->psearch_spec)->filter = filter;
71 LDAP_LIST_FIRST(&op->psearch_spec)->filterstr = ber_dupbv(NULL, fstr);
72 LDAP_LIST_FIRST(&op->psearch_spec)->attrs = attrs;
74 LDAP_LIST_FIRST(&op->psearch_spec)->attrsonly = attrsonly;
76 LDAP_LIST_FIRST(&op->psearch_spec)->entry_count = 0;
78 LDAP_LIST_INSERT_HEAD( &bdb->psearch_list, op, link );
90 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
92 const char *text = NULL;
96 ID candidates[BDB_IDL_UM_SIZE];
98 BerVarray v2refs = NULL;
99 Entry *matched = NULL;
100 struct berval realbase = { 0, NULL };
104 Filter lcupf, csnfnot, csnfeq, csnfand, csnfge;
105 AttributeAssertion aa_ge, aa_eq;
106 struct berval entrycsn_bv = { 0, NULL };
107 struct berval latest_entrycsn_bv = { 0, NULL };
109 struct slap_limits_set *limit = NULL;
113 #ifdef SLAP_X_FILTER_HASSUBORDINATES
114 int filter_hasSubordinates = 0;
115 Attribute *hasSubordinates = NULL;
116 #endif /* SLAP_X_FILTER_HASSUBORDINATES */
121 Connection *ps_conn = ps_op->o_conn;
122 struct berval *base = LDAP_LIST_FIRST(&ps_op->psearch_spec)->base;
123 struct berval *nbase = LDAP_LIST_FIRST(&ps_op->psearch_spec)->nbase;
124 int scope = LDAP_LIST_FIRST(&ps_op->psearch_spec)->scope;
125 int deref = LDAP_LIST_FIRST(&ps_op->psearch_spec)->deref;
126 int slimit = LDAP_LIST_FIRST(&ps_op->psearch_spec)->slimit;
127 int tlimit = LDAP_LIST_FIRST(&ps_op->psearch_spec)->tlimit;
128 Filter *filter = LDAP_LIST_FIRST(&ps_op->psearch_spec)->filter;
129 struct berval *filterstr = LDAP_LIST_FIRST(&ps_op->psearch_spec)->filterstr;
130 int attrsonly = LDAP_LIST_FIRST(&ps_op->psearch_spec)->attrsonly;
131 AttributeName *attrs;
133 if ( psearch_type != LCUP_PSEARCH_BY_DELETE &&
134 psearch_type != LCUP_PSEARCH_BY_SCOPEOUT ) {
135 attrs = LDAP_LIST_FIRST(&ps_op->psearch_spec)->attrs;
141 LDAP_LOG ( OPERATION, ENTRY, "bdb_back_search\n", 0, 0, 0 );
143 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
147 manageDSAit = get_manageDSAit( ps_op );
149 rc = LOCK_ID (bdb->bi_dbenv, &locker );
154 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
155 NULL, "internal error", NULL, NULL );
159 if ( nbase->bv_len == 0 ) {
160 /* DIT root special case */
161 e = (Entry *) &slap_entry_root;
165 /* get entry with reader lock */
166 if ( deref & LDAP_DEREF_FINDING ) {
167 e = deref_dn_r( be, nbase-, &err, &matched, &text );
173 rc = bdb_dn2entry_r( be, NULL, nbase, &e, &matched, 0, locker, &lock );
182 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
184 if (matched != NULL) {
185 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
187 send_ldap_result( ps_conn, ps_op, LDAP_BUSY,
188 NULL, "ldap server busy", NULL, NULL );
189 LOCK_ID_FREE (bdb->bi_dbenv, locker );
191 case DB_LOCK_DEADLOCK:
192 case DB_LOCK_NOTGRANTED:
196 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
198 if (matched != NULL) {
199 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
201 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
202 NULL, "internal error", NULL, NULL );
203 LOCK_ID_FREE (bdb->bi_dbenv, locker );
208 struct berval matched_dn = { 0, NULL };
209 BerVarray refs = NULL;
211 if ( matched != NULL ) {
213 ber_dupbv( &matched_dn, &matched->e_name );
215 erefs = is_entry_referral( matched )
216 ? get_entry_referrals( be, ps_conn, ps_op, matched )
219 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, matched, &lock);
223 refs = referral_rewrite( erefs, &matched_dn,
225 ber_bvarray_free( erefs );
229 refs = referral_rewrite( default_referral,
233 send_ldap_result( ps_conn, ps_op, rc=LDAP_REFERRAL ,
234 matched_dn.bv_val, text, refs, NULL );
236 LOCK_ID_FREE (bdb->bi_dbenv, locker );
237 if ( refs ) ber_bvarray_free( refs );
238 if ( matched_dn.bv_val ) ber_memfree( matched_dn.bv_val );
242 if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
243 /* entry is a referral, don't allow add */
244 struct berval matched_dn;
245 BerVarray erefs, refs;
247 ber_dupbv( &matched_dn, &e->e_name );
248 erefs = get_entry_referrals( be, ps_conn, ps_op, e );
251 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
255 refs = referral_rewrite( erefs, &matched_dn,
257 ber_bvarray_free( erefs );
261 LDAP_LOG ( OPERATION, RESULTS,
262 "bdb_search: entry is referral\n", 0, 0, 0 );
264 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
268 send_ldap_result( ps_conn, ps_op, LDAP_REFERRAL,
270 refs ? NULL : "bad referral object",
273 LOCK_ID_FREE (bdb->bi_dbenv, locker );
274 ber_bvarray_free( refs );
275 ber_memfree( matched_dn.bv_val );
279 /* if not root, get appropriate limits */
280 if ( be_isroot( be, &ps_op->o_ndn ) ) {
283 ( void ) get_limits( be, &ps_op->o_ndn, &limit );
286 /* The time/size limits come first because they require very little
287 * effort, so there's no chance the candidates are selected and then
288 * the request is not honored only because of time/size constraints */
290 /* if no time limit requested, use soft limit (unless root!) */
293 tlimit = -1; /* allow root to set no limit */
301 /* if no limit is required, use soft limit */
303 tlimit = limit->lms_t_soft;
305 /* if requested limit higher than hard limit, abort */
306 } else if ( tlimit > limit->lms_t_hard ) {
307 /* no hard limit means use soft instead */
308 if ( limit->lms_t_hard == 0 && tlimit > limit->lms_t_soft ) {
309 tlimit = limit->lms_t_soft;
311 /* positive hard limit means abort */
312 } else if ( limit->lms_t_hard > 0 ) {
313 send_search_result( ps_conn, ps_op,
314 LDAP_UNWILLING_TO_PERFORM,
315 NULL, NULL, NULL, NULL, 0 );
320 /* negative hard limit means no limit */
323 /* if no limit is required, use soft limit */
325 slimit = limit->lms_s_soft;
327 /* if requested limit higher than hard limit, abort */
328 } else if ( slimit > limit->lms_s_hard ) {
329 /* no hard limit means use soft instead */
330 if ( limit->lms_s_hard == 0 && slimit > limit->lms_s_soft ) {
331 slimit = limit->lms_s_soft;
333 /* positive hard limit means abort */
334 } else if ( limit->lms_s_hard > 0 ) {
335 send_search_result( ps_conn, ps_op,
336 LDAP_UNWILLING_TO_PERFORM,
337 NULL, NULL, NULL, NULL, 0 );
342 /* negative hard limit means no limit */
346 /* compute it anyway; root does not use it */
347 stoptime = ps_op->o_time + tlimit;
349 /* candidates = { e } */
351 candidates[1] = entry->e_id;
353 /* need normalized dn below */
354 ber_dupbv( &realbase, &e->e_nname );
356 if ( e != &slap_entry_root ) {
357 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
361 if ( candidates[0] == 0 ) {
363 LDAP_LOG ( OPERATION, RESULTS,
364 "bdb_search: no candidates\n", 0, 0, 0 );
366 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
370 send_search_result( ps_conn, ps_op,
372 NULL, NULL, NULL, NULL, 0 );
378 /* if not root and candidates exceed to-be-checked entries, abort */
379 if ( !isroot && limit->lms_s_unchecked != -1 ) {
380 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
381 send_search_result( ps_conn, ps_op,
382 LDAP_ADMINLIMIT_EXCEEDED,
383 NULL, NULL, NULL, NULL, 0 );
389 #ifdef SLAP_X_FILTER_HASSUBORDINATES
391 * is hasSubordinates used in the filter ?
392 * FIXME: we may compute this directly when parsing the filter
394 filter_hasSubordinates = filter_has_subordinates( filter );
395 #endif /* SLAP_X_FILTER_HASSUBORDINATES */
397 lcupf.f_choice = LDAP_FILTER_AND;
398 lcupf.f_and = &csnfnot;
401 csnfnot.f_choice = LDAP_FILTER_NOT;
402 csnfnot.f_not = &csnfeq;
403 csnfnot.f_next = &csnfand;
405 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
406 csnfeq.f_ava = &aa_eq;
407 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
408 ber_dupbv( &csnfeq.f_av_value, &ps_op->o_clientupdate_state );
410 csnfand.f_choice = LDAP_FILTER_AND;
411 csnfand.f_and = &csnfge;
412 csnfand.f_next = NULL;
414 csnfge.f_choice = LDAP_FILTER_GE;
415 csnfge.f_ava = &aa_ge;
416 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
417 ber_dupbv( &csnfge.f_av_value, &ps_op->o_clientupdate_state );
418 csnfge.f_next = filter;
420 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
421 cursor = bdb_idl_search( candidates, entry->e_id );
422 if ( candidates[cursor] != entry->e_id ) {
427 if ( entry->e_id < BDB_IDL_RANGE_FIRST(candidates) &&
428 entry->e_id > BDB_IDL_RANGE_LAST(candidates) ) {
436 /* check for abandon */
437 if ( ps_op->o_abandon ) {
442 /* check time limit */
443 if ( tlimit != -1 && slap_get_time() > stoptime ) {
444 send_search_result( ps_conn, ps_op, rc = LDAP_TIMELIMIT_EXCEEDED,
445 NULL, NULL, v2refs, NULL, nentries );
451 #ifdef BDB_SUBENTRIES
452 if ( is_entry_subentry( e ) ) {
453 if( scope != LDAP_SCOPE_BASE ) {
454 if(!get_subentries_visibility( ps_op )) {
455 /* only subentries are visible */
459 } else if ( get_subentries( ps_op ) &&
460 !get_subentries_visibility( ps_op ))
462 /* only subentries are visible */
466 } else if ( get_subentries_visibility( ps_op )) {
467 /* only subentries are visible */
473 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
478 e = deref_entry_r( be, e, &err, &matched, &text );
485 if( e->e_id == id ) {
490 /* need to skip alias which deref into scope */
491 if( scope & LDAP_SCOPE_ONELEVEL ) {
494 dnParent( &e->e_nname, &pdn ):
495 if ( ber_bvcmp( pdn, &realbase ) ) {
499 } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
500 /* alias is within scope */
502 LDAP_LOG ( OPERATION, RESULTS,
503 "bdb_search: \"%s\" in subtree\n", e->edn, 0, 0);
505 Debug( LDAP_DEBUG_TRACE,
506 "bdb_search: \"%s\" in subtree\n",
517 * if it's a referral, add it to the list of referrals. only do
518 * this for non-base searches, and don't check the filter
519 * explicitly here since it's only a candidate anyway.
521 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
522 is_entry_referral( e ) )
527 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
528 if ( !be_issuffix( be, &e->e_nname ) ) {
529 dnParent( &e->e_nname, &dn );
530 scopeok = dn_match( &dn, &realbase );
532 scopeok = (realbase.bv_len == 0);
535 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
536 scopeok = dnIsSuffix( &e->e_nname, &realbase );
543 BerVarray erefs = get_entry_referrals(
544 be, ps_conn, ps_op, e );
545 BerVarray refs = referral_rewrite( erefs,
547 scope == LDAP_SCOPE_SUBTREE
551 send_search_reference( be, ps_conn, ps_op,
552 e, refs, NULL, &v2refs );
554 ber_bvarray_free( refs );
558 LDAP_LOG(OPERATION, DETAIL2,
559 "bdb_search: candidate referral %ld scope not okay\n",
562 Debug( LDAP_DEBUG_TRACE,
563 "bdb_search: candidate referral %ld scope not okay\n",
571 #ifdef SLAP_X_FILTER_HASSUBORDINATES
573 * if hasSubordinates is used in the filter,
574 * append it to the entry's attributes
576 if ( filter_hasSubordinates ) {
579 rc = bdb_hasSubordinates( be, ps_conn, ps_op, e, &hs);
580 if ( rc != LDAP_SUCCESS ) {
584 hasSubordinates = slap_operational_hasSubordinate(
585 hs == LDAP_COMPARE_TRUE );
587 if ( hasSubordinates == NULL ) {
591 hasSubordinates->a_next = e->e_attrs;
592 e->e_attrs = hasSubordinates;
594 #endif /* SLAP_X_FILTER_HASSUBORDINATES */
596 if ( psearch_type != LCUP_PSEARCH_BY_SCOPEOUT ) {
597 rc = test_filter( be, ps_conn, ps_op, e, &lcupf );
599 rc = LDAP_COMPARE_TRUE;
602 #ifdef SLAP_X_FILTER_HASSUBORDINATES
603 if ( hasSubordinates ) {
605 * FIXME: this is fairly inefficient, because
606 * if hasSubordinates is among the required
607 * attrs, it will be added again later;
608 * maybe we should leave it and check
609 * check later if it's already present,
612 e->e_attrs = e->e_attrs->a_next;
613 attr_free( hasSubordinates );
615 #endif /* SLAP_X_FILTER_HASSUBORDINATES */
617 if ( rc == LDAP_COMPARE_TRUE ) {
621 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
622 if ( be_issuffix( be, &e->e_nname ) ) {
623 scopeok = (realbase.bv_len == 0);
625 dnParent( &e->e_nname, &dn );
626 scopeok = dn_match( &dn, &realbase );
629 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
630 scopeok = dnIsSuffix( &e->e_nname, &realbase );
637 /* check size limit */
638 if ( --slimit == -1 ) {
639 send_search_result( ps_conn, ps_op,
640 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
641 v2refs, NULL, nentries );
648 #if 0 /* noop is masked SLAP_CTRL_UPDATE */
649 if( ps_op->o_noop ) {
654 if ( psearch_type == LCUP_PSEARCH_BY_ADD ||
655 psearch_type == LCUP_PSEARCH_BY_DELETE ||
656 psearch_type == LCUP_PSEARCH_BY_MODIFY ||
657 psearch_type == LCUP_PSEARCH_BY_SCOPEOUT ) {
661 const char *text = NULL;
662 LDAPControl *ctrls[2];
665 BerElement *ber = ber_alloc_t( LBER_USE_DER );
669 LDAP_LOG ( OPERATION, RESULTS,
670 "bdb_search: ber_alloc_t failed\n",
673 Debug( LDAP_DEBUG_TRACE,
674 "bdb_search: ber_alloc_t failed\n",
677 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
678 NULL, "internal error", NULL, NULL );
682 LDAP_LIST_FIRST(&ps_op->psearch_spec)->entry_count++;
684 ctrls[0] = ch_malloc ( sizeof ( LDAPControl ) );
687 if ( LDAP_LIST_FIRST(&ps_op->psearch_spec)->entry_count % ps_op->o_clientupdate_interval == 0 ) {
689 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
690 AttributeDescription *desc = a->a_desc;
691 if ( desc == slap_schema.si_ad_entryCSN ) {
692 ber_dupbv( &entrycsn_bv, &a->a_vals[0] );
693 if ( latest_entrycsn_bv.bv_val == NULL ) {
694 ber_dupbv( &latest_entrycsn_bv, &entrycsn_bv );
696 res = value_match( &ret, desc,
697 desc->ad_type->sat_ordering,
698 SLAP_MR_ASSERTION_SYNTAX_MATCH,
699 &entrycsn_bv, &latest_entrycsn_bv, &text );
700 if ( res != LDAP_SUCCESS ) {
703 LDAP_LOG ( OPERATION, RESULTS,
704 "bdb_search: value_match failed\n",
707 Debug( LDAP_DEBUG_TRACE,
708 "bdb_search: value_match failed\n",
714 ch_free( latest_entrycsn_bv.bv_val );
715 latest_entrycsn_bv.bv_val = NULL;
716 ber_dupbv( &latest_entrycsn_bv,
723 if ( psearch_type != LCUP_PSEARCH_BY_DELETE || psearch_type != LCUP_PSEARCH_BY_SCOPEOUT ) {
726 SLAP_LCUP_STATE_UPDATE_FALSE,
727 SLAP_LCUP_ENTRY_DELETED_FALSE,
728 LCUP_COOKIE_OID, &entrycsn_bv );
732 SLAP_LCUP_STATE_UPDATE_FALSE,
733 SLAP_LCUP_ENTRY_DELETED_TRUE,
734 LCUP_COOKIE_OID, &entrycsn_bv );
737 ch_free( entrycsn_bv.bv_val );
738 entrycsn_bv.bv_val = NULL;
741 /* Do not send cookie */
742 if ( psearch_type != LCUP_PSEARCH_BY_DELETE || psearch_type != LCUP_PSEARCH_BY_SCOPEOUT ) {
745 SLAP_LCUP_STATE_UPDATE_FALSE,
746 SLAP_LCUP_ENTRY_DELETED_FALSE );
750 SLAP_LCUP_STATE_UPDATE_FALSE,
751 SLAP_LCUP_ENTRY_DELETED_TRUE );
755 ctrls[0]->ldctl_oid = LDAP_CONTROL_ENTRY_UPDATE;
756 ctrls[0]->ldctl_iscritical = ps_op->o_clientupdate;
757 ret = ber_flatten( ber, &bv );
761 LDAP_LOG ( OPERATION, RESULTS,
762 "bdb_search: ber_flatten failed\n",
765 Debug( LDAP_DEBUG_TRACE,
766 "bdb_search: ber_flatten failed\n",
769 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
770 NULL, "internal error", NULL, NULL );
774 ber_dupbv( &ctrls[0]->ldctl_value, bv );
776 result = send_search_entry( be, ps_conn, ps_op,
777 e, attrs, attrsonly, ctrls);
779 ch_free( ctrls[0]->ldctl_value.bv_val );
784 if ( psearch_type == LCUP_PSEARCH_BY_MODIFY ) {
785 struct psid_entry* psid_e;
786 LDAP_LIST_FOREACH( psid_e, &op->premodify_list, link) {
787 if (psid_e->ps == LDAP_LIST_FIRST(&ps_op->psearch_spec)) {
788 LDAP_LIST_REMOVE(psid_e, link);
795 } else if ( psearch_type == LCUP_PSEARCH_BY_PREMODIFY ) {
796 struct psid_entry* psid_e;
797 psid_e = (struct psid_entry *) calloc (1, sizeof (struct psid_entry));
798 psid_e->ps = LDAP_LIST_FIRST(&ps_op->psearch_spec);
799 LDAP_LIST_INSERT_HEAD( &op->premodify_list, psid_e, link );
808 case 0: /* entry sent ok */
811 case 1: /* entry not sent */
813 case -1: /* connection closed */
820 LDAP_LOG ( OPERATION, RESULTS,
821 "bdb_search: %ld scope not okay\n", (long) id, 0, 0);
823 Debug( LDAP_DEBUG_TRACE,
824 "bdb_search: %ld scope not okay\n",
830 LDAP_LOG ( OPERATION, RESULTS,
831 "bdb_search: %ld does match filter\n", (long) id, 0, 0);
833 Debug( LDAP_DEBUG_TRACE,
834 "bdb_search: %ld does match filter\n",
843 if ( csnfeq.f_ava != NULL && csnfeq.f_av_value.bv_val != NULL ) {
844 ch_free( csnfeq.f_av_value.bv_val );
847 if ( csnfge.f_ava != NULL && csnfge.f_av_value.bv_val != NULL ) {
848 ch_free( csnfge.f_av_value.bv_val );
851 LOCK_ID_FREE (bdb->bi_dbenv, locker );
853 if( v2refs ) ber_bvarray_free( v2refs );
854 if( realbase.bv_val ) ch_free( realbase.bv_val );
859 #endif /* LDAP_CLIENT_UPDATE */