1 /* search.c - ldbm backend search function */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
12 #include <ac/string.h>
13 #include <ac/socket.h>
16 #include "back-ldbm.h"
17 #include "proto-back-ldbm.h"
19 static ID_BLOCK *base_candidate(
20 Backend *be, Entry *e );
22 static ID_BLOCK *search_candidates(
23 Backend *be, Entry *e, Filter *filter,
24 int scope, int deref, int manageDSAit );
39 struct berval *filterstr,
43 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
45 const char *text = NULL;
50 BVarray v2refs = NULL;
51 Entry *matched = NULL;
52 struct berval realbase = { 0, NULL };
54 int manageDSAit = get_manageDSAit( op );
55 int cscope = LDAP_SCOPE_DEFAULT;
57 struct slap_limits_set *limit = NULL;
61 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
62 "ldbm_back_search: enter\n" ));
64 Debug(LDAP_DEBUG_TRACE, "=> ldbm_back_search\n", 0, 0, 0);
68 if ( nbase->bv_len == 0 ) {
69 /* DIT root special case */
70 e = (Entry *) &slap_entry_root;
72 /* need normalized dn below */
73 ber_dupbv( &realbase, &e->e_nname );
75 candidates = search_candidates( be, e, filter,
76 scope, deref, manageDSAit );
80 } else if ( deref & LDAP_DEREF_FINDING ) {
81 /* deref dn and get entry with reader lock */
82 e = deref_dn_r( be, nbase, &err, &matched, &text );
84 if( err == LDAP_NO_SUCH_OBJECT ) err = LDAP_REFERRAL;
87 /* get entry with reader lock */
88 e = dn2entry_r( be, nbase, &matched );
89 err = e != NULL ? LDAP_SUCCESS : LDAP_REFERRAL;
94 struct berval *matched_dn = NULL;
97 if ( matched != NULL ) {
99 matched_dn = ber_bvdup( &matched->e_name );
101 erefs = is_entry_referral( matched )
102 ? get_entry_referrals( be, conn, op, matched )
105 cache_return_entry_r( &li->li_cache, matched );
108 refs = referral_rewrite( erefs, matched_dn,
111 bvarray_free( erefs );
115 refs = referral_rewrite( default_referral,
119 send_ldap_result( conn, op, err,
120 matched_dn ? matched_dn->bv_val : NULL,
123 bvarray_free( refs );
124 ber_bvfree( matched_dn );
128 if (!manageDSAit && is_entry_referral( e ) ) {
129 /* entry is a referral, don't allow add */
130 struct berval *matched_dn = ber_bvdup( &e->e_name );
131 BVarray erefs = get_entry_referrals( be, conn, op, e );
134 cache_return_entry_r( &li->li_cache, e );
137 LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
138 "ldbm_search: entry (%s) is a referral.\n",
141 Debug( LDAP_DEBUG_TRACE,
142 "ldbm_search: entry is referral\n",
147 refs = referral_rewrite( erefs, matched_dn,
150 bvarray_free( erefs );
154 send_ldap_result( conn, op, LDAP_REFERRAL,
155 matched_dn->bv_val, NULL, refs, NULL );
156 bvarray_free( refs );
159 send_ldap_result( conn, op, LDAP_OTHER,
161 "bad referral object", NULL, NULL );
164 ber_bvfree( matched_dn );
168 if ( is_entry_alias( e ) ) {
170 deref = LDAP_DEREF_NEVER;
173 if ( scope == LDAP_SCOPE_BASE ) {
174 cscope = LDAP_SCOPE_BASE;
175 candidates = base_candidate( be, e );
178 cscope = ( scope != LDAP_SCOPE_SUBTREE )
179 ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE;
180 candidates = search_candidates( be, e, filter,
181 scope, deref, manageDSAit );
184 /* need normalized dn below */
185 ber_dupbv( &realbase, &e->e_nname );
187 cache_return_entry_r( &li->li_cache, e );
190 if ( candidates == NULL ) {
193 LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
194 "ldbm_search: no candidates\n" ));
196 Debug( LDAP_DEBUG_TRACE, "ldbm_search: no candidates\n",
200 send_search_result( conn, op,
202 NULL, NULL, NULL, NULL, 0 );
208 /* if not root, get appropriate limits */
209 if ( be_isroot( be, &op->o_ndn ) ) {
212 ( void ) get_limits( be, &op->o_ndn, &limit );
215 /* if candidates exceed to-be-checked entries, abort */
216 if ( !isroot && limit->lms_s_unchecked != -1 ) {
217 if ( ID_BLOCK_NIDS( candidates ) > (unsigned) limit->lms_s_unchecked ) {
218 send_search_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
219 NULL, NULL, NULL, NULL, 0 );
225 /* if root an no specific limit is required, allow unlimited search */
236 /* if no limit is required, use soft limit */
238 tlimit = limit->lms_t_soft;
240 /* if requested limit higher than hard limit, abort */
241 } else if ( tlimit > limit->lms_t_hard ) {
242 /* no hard limit means use soft instead */
243 if ( limit->lms_t_hard == 0 ) {
244 tlimit = limit->lms_t_soft;
246 /* positive hard limit means abort */
247 } else if ( limit->lms_t_hard > 0 ) {
248 send_search_result( conn, op,
249 LDAP_UNWILLING_TO_PERFORM,
250 NULL, NULL, NULL, NULL, 0 );
255 /* negative hard limit means no limit */
258 /* if no limit is required, use soft limit */
260 slimit = limit->lms_s_soft;
262 /* if requested limit higher than hard limit, abort */
263 } else if ( slimit > limit->lms_s_hard ) {
264 /* no hard limit means use soft instead */
265 if ( limit->lms_s_hard == 0 ) {
266 slimit = limit->lms_s_soft;
268 /* positive hard limit means abort */
269 } else if ( limit->lms_s_hard > 0 ) {
270 send_search_result( conn, op,
271 LDAP_UNWILLING_TO_PERFORM,
272 NULL, NULL, NULL, NULL, 0 );
277 /* negative hard limit means no limit */
281 /* compute it anyway; root does not use it */
282 stoptime = op->o_time + tlimit;
284 for ( id = idl_firstid( candidates, &cursor ); id != NOID;
285 id = idl_nextid( candidates, &cursor ) )
289 /* check for abandon */
290 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
292 if ( op->o_abandon ) {
293 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
298 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
300 /* check time limit */
301 if ( tlimit != -1 && slap_get_time() > stoptime ) {
302 send_search_result( conn, op, LDAP_TIMELIMIT_EXCEEDED,
303 NULL, NULL, v2refs, NULL, nentries );
308 /* get the entry with reader lock */
309 e = id2entry_r( be, id );
313 LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
314 "ldbm_search: candidate %ld not found.\n", id ));
316 Debug( LDAP_DEBUG_TRACE,
317 "ldbm_search: candidate %ld not found\n",
324 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
329 e = deref_entry_r( be, e, &err, &matched, &text );
336 if( e->e_id == id ) {
341 /* need to skip alias which deref into scope */
342 if( scope & LDAP_SCOPE_ONELEVEL ) {
343 char *pdn = dn_parent( NULL, e->e_ndn );
345 if( strcmp( pdn, realbase.bv_val ) ) {
350 } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
351 /* alias is within scope */
353 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
354 "ldbm_search: alias \"%s\" in subtree\n", e->e_dn ));
356 Debug( LDAP_DEBUG_TRACE,
357 "ldbm_search: alias \"%s\" in subtree\n",
368 * if it's a referral, add it to the list of referrals. only do
369 * this for non-base searches, and don't check the filter
370 * explicitly here since it's only a candidate anyway.
372 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
373 is_entry_referral( e ) )
378 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
379 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
380 scopeok = (dn == realbase.bv_val)
382 : (strcmp( dn, realbase.bv_val ) ? 0 : 1 );
384 scopeok = (realbase.bv_len == 0);
387 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
388 scopeok = dnIsSuffix( &e->e_nname, &realbase );
395 BVarray erefs = get_entry_referrals(
397 BVarray refs = referral_rewrite( erefs,
399 scope == LDAP_SCOPE_SUBTREE
403 send_search_reference( be, conn, op,
404 e, refs, NULL, &v2refs );
406 bvarray_free( refs );
410 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL2,
411 "ldbm_search: candidate referral %ld scope not okay\n",
414 Debug( LDAP_DEBUG_TRACE,
415 "ldbm_search: candidate referral %ld scope not okay\n",
423 /* if it matches the filter and scope, send it */
424 if ( test_filter( be, conn, op, e, filter ) == LDAP_COMPARE_TRUE ) {
428 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
429 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
430 scopeok = (dn == realbase.bv_val)
432 : (strcmp( dn, realbase.bv_val ) ? 0 : 1 );
434 scopeok = (realbase.bv_len == 0);
437 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
438 scopeok = dnIsSuffix( &e->e_nname, &realbase );
445 /* check size limit */
446 if ( --slimit == -1 ) {
447 cache_return_entry_r( &li->li_cache, e );
448 send_search_result( conn, op,
449 LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
450 v2refs, NULL, nentries );
456 int result = send_search_entry(be, conn, op,
457 e, attrs, attrsonly, NULL);
460 case 0: /* entry sent ok */
463 case 1: /* entry not sent */
465 case -1: /* connection closed */
466 cache_return_entry_r( &li->li_cache, e );
473 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL2,
474 "ldbm_search: candidate entry %ld scope not okay\n", id ));
476 Debug( LDAP_DEBUG_TRACE,
477 "ldbm_search: candidate entry %ld scope not okay\n",
484 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL2,
485 "ldbm_search: candidate entry %ld does not match filter\n", id ));
487 Debug( LDAP_DEBUG_TRACE,
488 "ldbm_search: candidate entry %ld does not match filter\n",
495 /* free reader lock */
496 cache_return_entry_r( &li->li_cache, e );
499 ldap_pvt_thread_yield();
502 send_search_result( conn, op,
503 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
504 NULL, NULL, v2refs, NULL, nentries );
509 if( candidates != NULL )
510 idl_free( candidates );
512 if( v2refs ) bvarray_free( v2refs );
513 if( realbase.bv_val ) free( realbase.bv_val );
526 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
527 "base_candidate: base (%s)\n", e->e_dn ));
529 Debug(LDAP_DEBUG_TRACE, "base_candidates: base: \"%s\"\n",
534 idl = idl_alloc( 1 );
535 idl_insert( &idl, e->e_id, 1 );
549 ID_BLOCK *candidates;
550 Filter f, fand, rf, af, xf;
551 AttributeAssertion aa_ref, aa_alias;
552 struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
553 struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
556 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
557 "search_candidates: base (%s) scope %d deref %d\n",
558 e->e_ndn, scope, deref ));
560 Debug(LDAP_DEBUG_TRACE,
561 "search_candidates: base=\"%s\" s=%d d=%d\n",
562 e->e_ndn, scope, deref );
567 xf.f_choice = LDAP_FILTER_OR;
571 /* match referrals */
572 rf.f_choice = LDAP_FILTER_EQUALITY;
574 rf.f_av_desc = slap_schema.si_ad_objectClass;
575 rf.f_av_value = bv_ref;
580 if( deref & LDAP_DEREF_SEARCHING ) {
582 af.f_choice = LDAP_FILTER_EQUALITY;
583 af.f_ava = &aa_alias;
584 af.f_av_desc = slap_schema.si_ad_objectClass;
585 af.f_av_value = bv_alias;
591 f.f_choice = LDAP_FILTER_AND;
593 fand.f_choice = scope == LDAP_SCOPE_SUBTREE
594 ? SLAPD_FILTER_DN_SUBTREE
595 : SLAPD_FILTER_DN_ONE;
596 fand.f_dn = &e->e_nname;
597 fand.f_next = xf.f_or == filter ? filter : &xf ;
599 candidates = filter_candidates( be, &f );
601 return( candidates );