1 /* search.c - search operation */
4 * Copyright 1998-2000 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(
42 const char *filterstr,
46 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
49 const char *text = NULL;
52 ID candidates[BDB_IDL_UM_SIZE];
54 struct berval **v2refs = NULL;
55 Entry *matched = NULL;
56 struct berval realbase = { 0, NULL };
60 struct slap_limits_set *limit = NULL;
63 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
66 manageDSAit = get_manageDSAit( op );
68 if ( nbase->bv_len == 0 ) {
69 /* DIT root special case */
70 e = (Entry *) &slap_entry_root;
74 /* get entry with reader lock */
75 if ( deref & LDAP_DEREF_FINDING ) {
76 e = deref_dn_r( be, nbase-, &err, &matched, &text );
81 rc = bdb_dn2entry( be, NULL, nbase, &e, &matched, 0 );
89 send_ldap_result( conn, op, rc=LDAP_OTHER,
90 NULL, "internal error", NULL, NULL );
95 struct berval *matched_dn = NULL;
96 struct berval **refs = NULL;
98 if ( matched != NULL ) {
99 struct berval **erefs;
100 matched_dn = ber_bvdup( &matched->e_name );
102 erefs = is_entry_referral( matched )
103 ? get_entry_referrals( be, conn, op, matched )
106 bdb_entry_return( be, matched );
110 refs = referral_rewrite( erefs, matched_dn,
112 ber_bvecfree( erefs );
116 refs = referral_rewrite( default_referral,
120 send_ldap_result( conn, op, rc=LDAP_REFERRAL ,
121 matched_dn ? matched_dn->bv_val : NULL, text, refs, NULL );
123 if ( refs ) ber_bvecfree( refs );
124 if ( matched_dn ) ber_bvfree( matched_dn );
128 if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
129 /* entry is a referral, don't allow add */
130 struct berval *matched_dn = ber_bvdup( &e->e_name );
131 struct berval **erefs = get_entry_referrals( be,
133 struct berval **refs = NULL;
135 bdb_entry_return( be, e );
139 refs = referral_rewrite( erefs, matched_dn,
141 ber_bvecfree( erefs );
144 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
147 send_ldap_result( conn, op, LDAP_REFERRAL,
149 refs ? NULL : "bad referral object",
152 ber_bvecfree( refs );
153 ber_bvfree( matched_dn );
157 /* if not root, get appropriate limits */
158 if ( be_isroot( be, &op->o_ndn ) ) {
161 ( void ) get_limits( be, &op->o_ndn, &limit );
164 /* The time/size limits come first because they require very little
165 * effort, so there's no chance the candidates are selected and then
166 * the request is not honored only because of time/size constraints */
168 /* if no time limit requested, use soft limit (unless root!) */
171 tlimit = -1; /* allow root to set no limit */
179 /* if no limit is required, use soft limit */
181 tlimit = limit->lms_t_soft;
183 /* if requested limit higher than hard limit, abort */
184 } else if ( tlimit > limit->lms_t_hard ) {
185 /* no hard limit means use soft instead */
186 if ( limit->lms_t_hard == 0 ) {
187 tlimit = limit->lms_t_soft;
189 /* positive hard limit means abort */
190 } else if ( limit->lms_t_hard > 0 ) {
191 send_search_result( conn, op,
192 LDAP_UNWILLING_TO_PERFORM,
193 NULL, NULL, NULL, NULL, 0 );
198 /* negative hard limit means no limit */
201 /* if no limit is required, use soft limit */
203 slimit = limit->lms_s_soft;
205 /* if requested limit higher than hard limit, abort */
206 } else if ( slimit > limit->lms_s_hard ) {
207 /* no hard limit means use soft instead */
208 if ( limit->lms_s_hard == 0 ) {
209 slimit = limit->lms_s_soft;
211 /* positive hard limit means abort */
212 } else if ( limit->lms_s_hard > 0 ) {
213 send_search_result( conn, op,
214 LDAP_UNWILLING_TO_PERFORM,
215 NULL, NULL, NULL, NULL, 0 );
220 /* negative hard limit means no limit */
224 /* compute it anyway; root does not use it */
225 stoptime = op->o_time + tlimit;
227 /* select candidates */
228 if ( scope == LDAP_SCOPE_BASE ) {
229 rc = base_candidate( be, e, candidates );
232 BDB_IDL_ALL( bdb, candidates );
233 rc = search_candidates( be, e, filter,
234 scope, deref, manageDSAit, candidates );
237 /* need normalized dn below */
238 ber_dupbv( &realbase, &e->e_nname );
240 /* start cursor at base entry's id
241 * FIXME: hack to make "" base work */
242 cursor = e->e_id == NOID ? 1 : e->e_id;
244 if ( e != &slap_entry_root ) {
245 bdb_entry_return( be, e );
249 if ( candidates[0] == 0 ) {
250 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
253 send_search_result( conn, op,
255 NULL, NULL, NULL, NULL, 0 );
261 /* if not root and candidates exceed to-be-checked entries, abort */
262 if ( !isroot && limit->lms_s_unchecked != -1 ) {
263 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
264 send_search_result( conn, op,
265 LDAP_UNWILLING_TO_PERFORM,
266 NULL, NULL, NULL, NULL, 0 );
272 for ( id = bdb_idl_first( candidates, &cursor );
274 id = bdb_idl_next( candidates, &cursor ) )
278 /* check for abandon */
279 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
280 abandon = op->o_abandon;
281 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
288 /* check time limit */
289 if ( tlimit != -1 && slap_get_time() > stoptime ) {
290 send_search_result( conn, op, rc = LDAP_TIMELIMIT_EXCEEDED,
291 NULL, NULL, v2refs, NULL, nentries );
295 /* get the entry with reader lock */
296 rc = bdb_id2entry( be, NULL, id, &e );
299 if( !BDB_IDL_IS_RANGE(candidates) ) {
300 /* only complain for non-range IDLs */
301 Debug( LDAP_DEBUG_TRACE,
302 "bdb_search: candidate %ld not found\n",
310 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
315 e = deref_entry_r( be, e, &err, &matched, &text );
322 if( e->e_id == id ) {
327 /* need to skip alias which deref into scope */
328 if( scope & LDAP_SCOPE_ONELEVEL ) {
329 char *pdn = dn_parent( NULL, e->e_ndn );
331 if( strcmp( pdn, realbase.bv_val ) ) {
336 } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
337 /* alias is within scope */
338 Debug( LDAP_DEBUG_TRACE,
339 "bdb_search: \"%s\" in subtree\n",
349 * if it's a referral, add it to the list of referrals. only do
350 * this for non-base searches, and don't check the filter
351 * explicitly here since it's only a candidate anyway.
353 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
354 is_entry_referral( e ) )
356 struct berval **erefs = get_entry_referrals(
358 struct berval **refs = referral_rewrite( erefs,
360 scope == LDAP_SCOPE_SUBTREE
364 send_search_reference( be, conn, op,
365 e, refs, NULL, &v2refs );
367 ber_bvecfree( refs );
372 /* if it matches the filter and scope, send it */
373 rc = test_filter( be, conn, op, e, filter );
374 if ( rc == LDAP_COMPARE_TRUE ) {
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 /* check size limit */
396 if ( --slimit == -1 ) {
397 bdb_entry_return( be, e );
399 send_search_result( conn, op,
400 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
401 v2refs, NULL, nentries );
406 int result = send_search_entry( be, conn, op,
407 e, attrs, attrsonly, NULL);
410 case 0: /* entry sent ok */
413 case 1: /* entry not sent */
415 case -1: /* connection closed */
416 bdb_entry_return( be, e );
423 Debug( LDAP_DEBUG_TRACE,
424 "bdb_search: %ld scope not okay\n",
428 Debug( LDAP_DEBUG_TRACE,
429 "bdb_search: %ld does match filter\n",
435 /* free reader lock */
436 bdb_entry_return( be, e );
439 ldap_pvt_thread_yield();
441 send_search_result( conn, op,
442 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
443 NULL, NULL, v2refs, NULL, nentries );
448 ber_bvecfree( v2refs );
449 if( realbase.bv_val ) ch_free( realbase.bv_val );
455 static int base_candidate(
460 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
461 e->e_dn, (long) e->e_id, 0);
468 /* Is "objectClass=xx" mentioned anywhere in this filter? Presence
469 * doesn't count, we're looking for explicit values.
471 static int oc_filter(
477 switch(f->f_choice) {
478 case LDAP_FILTER_EQUALITY:
479 case LDAP_FILTER_APPROX:
480 if (f->f_av_desc == slap_schema.si_ad_objectClass)
484 case LDAP_FILTER_SUBSTRINGS:
485 if (f->f_sub_desc == slap_schema.si_ad_objectClass)
489 case LDAP_FILTER_AND:
491 for (f=f->f_and; f; f=f->f_next)
492 if ((rc = oc_filter(f)))
501 static int search_candidates(
511 Filter f, fand, rf, xf;
512 ID tmp[BDB_IDL_UM_SIZE];
513 AttributeAssertion aa_ref;
514 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
517 AttributeAssertion aa_alias;
520 Debug(LDAP_DEBUG_TRACE,
521 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
522 e->e_dn, (long) e->e_id, scope );
525 xf.f_choice = LDAP_FILTER_OR;
528 /* If the user's filter doesn't mention objectClass, or if
529 * it just uses objectClass=*, these clauses are redundant.
531 if (oc_filter(filter)) {
532 if( !manageDSAit ) { /* match referrals */
533 struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
534 rf.f_choice = LDAP_FILTER_EQUALITY;
536 rf.f_av_desc = slap_schema.si_ad_objectClass;
537 rf.f_av_value = bv_ref;
543 if( deref & LDAP_DEREF_SEARCHING ) { /* match aliases */
544 struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
545 af.f_choice = LDAP_FILTER_EQUALITY;
546 af.f_ava = &aa_alias;
547 af.f_av_desc = slap_schema.si_ad_objectClass;
548 af.f_av_value = bv_alias;
556 f.f_choice = LDAP_FILTER_AND;
558 fand.f_choice = scope == LDAP_SCOPE_SUBTREE
559 ? SLAPD_FILTER_DN_SUBTREE
560 : SLAPD_FILTER_DN_ONE;
561 fand.f_dn = &e->e_nname;
562 fand.f_next = xf.f_or == filter ? filter : &xf ;
565 #ifdef BDB_FILTER_INDICES
566 rc = bdb_filter_candidates( be, &f, ids, tmp );
568 /* FIXME: Original code:
569 BDB_IDL_ID( bdb, ids, e->e_id );
570 * this is a hack to make "" base work; when bdb_filter_candidates
571 * is used this should not be needed any more */
572 BDB_IDL_ID( bdb, ids, (e->e_id == NOID ? 1 : e->e_id) );
576 Debug(LDAP_DEBUG_TRACE,
577 "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
579 (long) BDB_IDL_FIRST(ids),
580 (long) BDB_IDL_LAST(ids) );