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;
116 Connection *ps_conn = ps_op->o_conn;
117 struct berval *base = LDAP_LIST_FIRST(&ps_op->psearch_spec)->base;
118 struct berval *nbase = LDAP_LIST_FIRST(&ps_op->psearch_spec)->nbase;
119 int scope = LDAP_LIST_FIRST(&ps_op->psearch_spec)->scope;
120 int deref = LDAP_LIST_FIRST(&ps_op->psearch_spec)->deref;
121 int slimit = LDAP_LIST_FIRST(&ps_op->psearch_spec)->slimit;
122 int tlimit = LDAP_LIST_FIRST(&ps_op->psearch_spec)->tlimit;
123 Filter *filter = LDAP_LIST_FIRST(&ps_op->psearch_spec)->filter;
124 struct berval *filterstr = LDAP_LIST_FIRST(&ps_op->psearch_spec)->filterstr;
125 int attrsonly = LDAP_LIST_FIRST(&ps_op->psearch_spec)->attrsonly;
126 AttributeName *attrs;
128 if ( psearch_type != LCUP_PSEARCH_BY_DELETE &&
129 psearch_type != LCUP_PSEARCH_BY_SCOPEOUT )
131 attrs = LDAP_LIST_FIRST(&ps_op->psearch_spec)->attrs;
137 LDAP_LOG ( OPERATION, ENTRY, "bdb_back_search\n", 0, 0, 0 );
139 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
143 manageDSAit = get_manageDSAit( ps_op );
145 rc = LOCK_ID (bdb->bi_dbenv, &locker );
150 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
151 NULL, "internal error", NULL, NULL );
155 if ( nbase->bv_len == 0 ) {
156 /* DIT root special case */
157 e = (Entry *) &slap_entry_root;
161 /* get entry with reader lock */
162 if ( deref & LDAP_DEREF_FINDING ) {
163 e = deref_dn_r( be, nbase-, &err, &matched, &text );
169 rc = bdb_dn2entry_r( be, NULL, nbase, &e, &matched, 0, locker, &lock );
178 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache,
181 if (matched != NULL) {
182 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache,
185 send_ldap_result( ps_conn, ps_op, LDAP_BUSY,
186 NULL, "ldap server busy", NULL, NULL );
187 LOCK_ID_FREE( bdb->bi_dbenv, locker );
189 case DB_LOCK_DEADLOCK:
190 case DB_LOCK_NOTGRANTED:
194 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache,
197 if (matched != NULL) {
198 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache,
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,
224 refs = referral_rewrite( erefs, &matched_dn,
226 ber_bvarray_free( erefs );
230 refs = referral_rewrite( default_referral,
234 send_ldap_result( ps_conn, ps_op, rc=LDAP_REFERRAL ,
235 matched_dn.bv_val, text, refs, NULL );
237 LOCK_ID_FREE( bdb->bi_dbenv, locker );
238 if ( refs ) ber_bvarray_free( refs );
239 if ( matched_dn.bv_val ) ber_memfree( matched_dn.bv_val );
243 if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
244 /* entry is a referral, don't allow add */
245 struct berval matched_dn;
246 BerVarray erefs, refs;
248 ber_dupbv( &matched_dn, &e->e_name );
249 erefs = get_entry_referrals( be, ps_conn, ps_op, e );
252 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
256 refs = referral_rewrite( erefs, &matched_dn,
258 ber_bvarray_free( erefs );
262 LDAP_LOG( OPERATION, RESULTS,
263 "bdb_search: entry is referral\n", 0, 0, 0 );
265 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
269 send_ldap_result( ps_conn, ps_op, LDAP_REFERRAL,
271 refs ? NULL : "bad referral object",
274 LOCK_ID_FREE( bdb->bi_dbenv, locker );
275 ber_bvarray_free( refs );
276 ber_memfree( matched_dn.bv_val );
280 /* if not root, get appropriate limits */
281 if ( be_isroot( be, &ps_op->o_ndn ) ) {
284 ( void ) get_limits( be, &ps_op->o_ndn, &limit );
287 /* The time/size limits come first because they require very little
288 * effort, so there's no chance the candidates are selected and then
289 * the request is not honored only because of time/size constraints */
291 /* if no time limit requested, use soft limit (unless root!) */
294 tlimit = -1; /* allow root to set no limit */
302 /* if no limit is required, use soft limit */
304 tlimit = limit->lms_t_soft;
306 /* if requested limit higher than hard limit, abort */
307 } else if ( tlimit > limit->lms_t_hard ) {
308 /* no hard limit means use soft instead */
309 if ( limit->lms_t_hard == 0 && tlimit > limit->lms_t_soft ) {
310 tlimit = limit->lms_t_soft;
312 /* positive hard limit means abort */
313 } else if ( limit->lms_t_hard > 0 ) {
314 send_search_result( ps_conn, ps_op,
315 LDAP_UNWILLING_TO_PERFORM,
316 NULL, NULL, NULL, NULL, 0 );
321 /* negative hard limit means no limit */
324 /* if no limit is required, use soft limit */
326 slimit = limit->lms_s_soft;
328 /* if requested limit higher than hard limit, abort */
329 } else if ( slimit > limit->lms_s_hard ) {
330 /* no hard limit means use soft instead */
331 if ( limit->lms_s_hard == 0 && slimit > limit->lms_s_soft ) {
332 slimit = limit->lms_s_soft;
334 /* positive hard limit means abort */
335 } else if ( limit->lms_s_hard > 0 ) {
336 send_search_result( ps_conn, ps_op,
337 LDAP_UNWILLING_TO_PERFORM,
338 NULL, NULL, NULL, NULL, 0 );
343 /* negative hard limit means no limit */
347 /* compute it anyway; root does not use it */
348 stoptime = ps_op->o_time + tlimit;
350 /* candidates = { e } */
352 candidates[1] = entry->e_id;
354 /* need normalized dn below */
355 ber_dupbv( &realbase, &e->e_nname );
357 if ( e != &slap_entry_root ) {
358 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
362 if ( candidates[0] == 0 ) {
364 LDAP_LOG ( OPERATION, RESULTS,
365 "bdb_search: no candidates\n", 0, 0, 0 );
367 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
371 send_search_result( ps_conn, ps_op,
373 NULL, NULL, NULL, NULL, 0 );
379 /* if not root and candidates exceed to-be-checked entries, abort */
380 if ( !isroot && limit->lms_s_unchecked != -1 ) {
381 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
382 send_search_result( ps_conn, ps_op, LDAP_ADMINLIMIT_EXCEEDED,
383 NULL, NULL, NULL, NULL, 0 );
389 lcupf.f_choice = LDAP_FILTER_AND;
390 lcupf.f_and = &csnfnot;
393 csnfnot.f_choice = LDAP_FILTER_NOT;
394 csnfnot.f_not = &csnfeq;
395 csnfnot.f_next = &csnfand;
397 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
398 csnfeq.f_ava = &aa_eq;
399 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
400 ber_dupbv( &csnfeq.f_av_value, &ps_op->o_clientupdate_state );
402 csnfand.f_choice = LDAP_FILTER_AND;
403 csnfand.f_and = &csnfge;
404 csnfand.f_next = NULL;
406 csnfge.f_choice = LDAP_FILTER_GE;
407 csnfge.f_ava = &aa_ge;
408 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
409 ber_dupbv( &csnfge.f_av_value, &ps_op->o_clientupdate_state );
410 csnfge.f_next = filter;
412 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
413 cursor = bdb_idl_search( candidates, entry->e_id );
414 if ( candidates[cursor] != entry->e_id ) {
419 if ( entry->e_id < BDB_IDL_RANGE_FIRST(candidates) &&
420 entry->e_id > BDB_IDL_RANGE_LAST(candidates) )
429 /* check for abandon */
430 if ( ps_op->o_abandon ) {
435 /* check time limit */
436 if ( tlimit != -1 && slap_get_time() > stoptime ) {
437 send_search_result( ps_conn, ps_op, rc = LDAP_TIMELIMIT_EXCEEDED,
438 NULL, NULL, v2refs, NULL, nentries );
444 #ifdef BDB_SUBENTRIES
445 if ( is_entry_subentry( e ) ) {
446 if( scope != LDAP_SCOPE_BASE ) {
447 if(!get_subentries_visibility( ps_op )) {
448 /* only subentries are visible */
452 } else if ( get_subentries( ps_op ) &&
453 !get_subentries_visibility( ps_op ))
455 /* only subentries are visible */
459 } else if ( get_subentries_visibility( ps_op )) {
460 /* only subentries are visible */
466 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
471 e = deref_entry_r( be, e, &err, &matched, &text );
478 if( e->e_id == id ) {
483 /* need to skip alias which deref into scope */
484 if( scope & LDAP_SCOPE_ONELEVEL ) {
487 dnParent( &e->e_nname, &pdn ):
488 if ( ber_bvcmp( pdn, &realbase ) ) {
492 } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
493 /* alias is within scope */
495 LDAP_LOG ( OPERATION, RESULTS,
496 "bdb_search: \"%s\" in subtree\n", e->edn, 0, 0);
498 Debug( LDAP_DEBUG_TRACE,
499 "bdb_search: \"%s\" in subtree\n",
510 * if it's a referral, add it to the list of referrals. only do
511 * this for non-base searches, and don't check the filter
512 * explicitly here since it's only a candidate anyway.
514 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
515 is_entry_referral( e ) )
520 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
521 if ( !be_issuffix( be, &e->e_nname ) ) {
522 dnParent( &e->e_nname, &dn );
523 scopeok = dn_match( &dn, &realbase );
525 scopeok = (realbase.bv_len == 0);
528 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
529 scopeok = dnIsSuffix( &e->e_nname, &realbase );
536 BerVarray erefs = get_entry_referrals(
537 be, ps_conn, ps_op, e );
538 BerVarray refs = referral_rewrite( erefs,
540 scope == LDAP_SCOPE_SUBTREE
544 send_search_reference( be, ps_conn, ps_op,
545 e, refs, NULL, &v2refs );
547 ber_bvarray_free( refs );
551 LDAP_LOG(OPERATION, DETAIL2,
552 "bdb_search: candidate referral %ld scope not okay\n",
555 Debug( LDAP_DEBUG_TRACE,
556 "bdb_search: candidate referral %ld scope not okay\n",
564 if ( psearch_type != LCUP_PSEARCH_BY_SCOPEOUT ) {
565 rc = test_filter( be, ps_conn, ps_op, e, &lcupf );
567 rc = LDAP_COMPARE_TRUE;
570 if ( rc == LDAP_COMPARE_TRUE ) {
574 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
575 if ( be_issuffix( be, &e->e_nname ) ) {
576 scopeok = (realbase.bv_len == 0);
578 dnParent( &e->e_nname, &dn );
579 scopeok = dn_match( &dn, &realbase );
582 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
583 scopeok = dnIsSuffix( &e->e_nname, &realbase );
590 /* check size limit */
591 if ( --slimit == -1 ) {
592 send_search_result( ps_conn, ps_op,
593 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
594 v2refs, NULL, nentries );
601 #if 0 /* noop is masked SLAP_CTRL_UPDATE */
602 if( ps_op->o_noop ) {
607 if ( psearch_type == LCUP_PSEARCH_BY_ADD ||
608 psearch_type == LCUP_PSEARCH_BY_DELETE ||
609 psearch_type == LCUP_PSEARCH_BY_MODIFY ||
610 psearch_type == LCUP_PSEARCH_BY_SCOPEOUT )
615 const char *text = NULL;
616 LDAPControl *ctrls[2];
619 BerElement *ber = ber_alloc_t( LBER_USE_DER );
623 LDAP_LOG ( OPERATION, RESULTS,
624 "bdb_search: ber_alloc_t failed\n",
627 Debug( LDAP_DEBUG_TRACE,
628 "bdb_search: ber_alloc_t failed\n",
631 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
632 NULL, "internal error", NULL, NULL );
636 LDAP_LIST_FIRST(&ps_op->psearch_spec)->entry_count++;
638 ctrls[0] = ch_malloc ( sizeof ( LDAPControl ) );
641 if ( LDAP_LIST_FIRST(
642 &ps_op->psearch_spec)->entry_count %
643 ps_op->o_clientupdate_interval == 0 )
646 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
647 AttributeDescription *desc = a->a_desc;
648 if ( desc == slap_schema.si_ad_entryCSN ) {
649 ber_dupbv( &entrycsn_bv, &a->a_vals[0] );
650 if ( latest_entrycsn_bv.bv_val == NULL ) {
651 ber_dupbv( &latest_entrycsn_bv,
654 res = value_match( &ret, desc,
655 desc->ad_type->sat_ordering,
656 SLAP_MR_ASSERTION_SYNTAX_MATCH,
657 &entrycsn_bv, &latest_entrycsn_bv,
659 if ( res != LDAP_SUCCESS ) {
662 LDAP_LOG ( OPERATION, RESULTS,
664 "value_match failed\n",
667 Debug( LDAP_DEBUG_TRACE,
669 "value_match failed\n",
675 ch_free(latest_entrycsn_bv.bv_val);
676 latest_entrycsn_bv.bv_val = NULL;
677 ber_dupbv( &latest_entrycsn_bv,
684 if ( psearch_type != LCUP_PSEARCH_BY_DELETE ||
685 psearch_type != LCUP_PSEARCH_BY_SCOPEOUT )
687 ber_printf( ber, "{bb{sON}N}",
688 SLAP_LCUP_STATE_UPDATE_FALSE,
689 SLAP_LCUP_ENTRY_DELETED_FALSE,
690 LCUP_COOKIE_OID, &entrycsn_bv );
692 ber_printf( ber, "{bb{sON}N}",
693 SLAP_LCUP_STATE_UPDATE_FALSE,
694 SLAP_LCUP_ENTRY_DELETED_TRUE,
695 LCUP_COOKIE_OID, &entrycsn_bv );
698 ch_free( entrycsn_bv.bv_val );
699 entrycsn_bv.bv_val = NULL;
702 /* Do not send cookie */
703 if ( psearch_type != LCUP_PSEARCH_BY_DELETE ||
704 psearch_type != LCUP_PSEARCH_BY_SCOPEOUT )
706 ber_printf( ber, "{bbN}",
707 SLAP_LCUP_STATE_UPDATE_FALSE,
708 SLAP_LCUP_ENTRY_DELETED_FALSE );
710 ber_printf( ber, "{bbN}",
711 SLAP_LCUP_STATE_UPDATE_FALSE,
712 SLAP_LCUP_ENTRY_DELETED_TRUE );
716 ctrls[0]->ldctl_oid = LDAP_CONTROL_ENTRY_UPDATE;
717 ctrls[0]->ldctl_iscritical = ps_op->o_clientupdate;
718 ret = ber_flatten( ber, &bv );
722 LDAP_LOG ( OPERATION, RESULTS,
723 "bdb_search: ber_flatten failed\n",
726 Debug( LDAP_DEBUG_TRACE,
727 "bdb_search: ber_flatten failed\n",
730 send_ldap_result( ps_conn, ps_op, rc=LDAP_OTHER,
731 NULL, "internal error", NULL, NULL );
735 ber_dupbv( &ctrls[0]->ldctl_value, bv );
737 result = send_search_entry( be, ps_conn, ps_op,
738 e, attrs, attrsonly, ctrls);
740 ch_free( ctrls[0]->ldctl_value.bv_val );
745 if ( psearch_type == LCUP_PSEARCH_BY_MODIFY ) {
746 struct psid_entry* psid_e;
747 LDAP_LIST_FOREACH( psid_e, &op->premodify_list,
751 LDAP_LIST_FIRST(&ps_op->psearch_spec))
753 LDAP_LIST_REMOVE(psid_e, link);
757 if (psid_e != NULL) free (psid_e);
760 } else if ( psearch_type == LCUP_PSEARCH_BY_PREMODIFY ) {
761 struct psid_entry* psid_e;
762 psid_e = (struct psid_entry *) calloc (1,
763 sizeof(struct psid_entry));
764 psid_e->ps = LDAP_LIST_FIRST(&ps_op->psearch_spec);
765 LDAP_LIST_INSERT_HEAD( &op->premodify_list,
774 case 0: /* entry sent ok */
777 case 1: /* entry not sent */
779 case -1: /* connection closed */
786 LDAP_LOG ( OPERATION, RESULTS,
787 "bdb_search: %ld scope not okay\n", (long) id, 0, 0);
789 Debug( LDAP_DEBUG_TRACE,
790 "bdb_search: %ld scope not okay\n", (long) id, 0, 0 );
795 LDAP_LOG ( OPERATION, RESULTS,
796 "bdb_search: %ld does match filter\n", (long) id, 0, 0);
798 Debug( LDAP_DEBUG_TRACE,
799 "bdb_search: %ld does match filter\n",
808 if ( csnfeq.f_ava != NULL && csnfeq.f_av_value.bv_val != NULL ) {
809 ch_free( csnfeq.f_av_value.bv_val );
812 if ( csnfge.f_ava != NULL && csnfge.f_av_value.bv_val != NULL ) {
813 ch_free( csnfge.f_av_value.bv_val );
816 LOCK_ID_FREE( bdb->bi_dbenv, locker );
818 if( v2refs ) ber_bvarray_free( v2refs );
819 if( realbase.bv_val ) ch_free( realbase.bv_val );
824 #endif /* LDAP_CLIENT_UPDATE */