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>
16 static int base_candidate(
20 static int search_candidates(
29 static ID idl_first( ID *ids, ID *cursor );
30 static ID idl_next( ID *ids, ID *cursor );
44 const char *filterstr,
48 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
51 const char *text = NULL;
54 ID candidates[BDB_IDL_SIZE];
56 struct berval **v2refs = NULL;
57 Entry *matched = NULL;
58 char *realbase = NULL;
62 Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
65 manageDSAit = get_manageDSAit( op );
68 /* get entry with reader lock */
69 if ( deref & LDAP_DEREF_FINDING ) {
70 e = deref_dn_r( be, nbase, &err, &matched, &text );
75 rc = bdb_dn2entry( be, NULL, nbase, &e, &matched, 0 );
83 send_ldap_result( conn, op, rc=LDAP_OTHER,
84 NULL, "internal error", NULL, NULL );
89 char *matched_dn = NULL;
90 struct berval **refs = NULL;
92 if ( matched != NULL ) {
93 matched_dn = ch_strdup( matched->e_dn );
95 refs = is_entry_referral( matched )
96 ? get_entry_referrals( be, conn, op, matched )
100 refs = default_referral;
103 send_ldap_result( conn, op, rc=LDAP_REFERRAL ,
104 matched_dn, text, refs, NULL );
106 if( matched != NULL ) {
107 ber_bvecfree( refs );
109 bdb_entry_return( be, matched );
115 if (!manageDSAit && is_entry_referral( e ) ) {
116 /* entry is a referral, don't allow add */
117 char *matched_dn = ch_strdup( e->e_dn );
118 struct berval **refs = get_entry_referrals( be,
121 bdb_entry_return( be, e );
123 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
126 send_ldap_result( conn, op, LDAP_REFERRAL,
127 matched_dn, NULL, refs, NULL );
129 ber_bvecfree( refs );
135 if ( tlimit == 0 && be_isroot( be, op->o_ndn ) ) {
136 tlimit = -1; /* allow root to set no limit */
138 tlimit = (tlimit > be->be_timelimit || tlimit < 1) ?
139 be->be_timelimit : tlimit;
140 stoptime = op->o_time + tlimit;
143 if ( slimit == 0 && be_isroot( be, op->o_ndn ) ) {
144 slimit = -1; /* allow root to set no limit */
146 slimit = (slimit > be->be_sizelimit || slimit < 1) ?
147 be->be_sizelimit : slimit;
150 if ( scope == LDAP_SCOPE_BASE ) {
151 rc = base_candidate( be, e, candidates );
154 rc = search_candidates( be, e, filter,
155 scope, deref, manageDSAit, candidates );
158 /* need normalized dn below */
159 realbase = ch_strdup( e->e_ndn );
161 /* start cursor at base entry's id */
164 bdb_entry_return( be, e );
166 if ( candidates[0] == 0 ) {
167 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
170 send_search_result( conn, op,
172 NULL, NULL, NULL, NULL, 0 );
178 for ( id = idl_first( candidates, &cursor );
180 id = idl_next( candidates, &cursor ) )
184 /* check for abandon */
185 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
186 abandon = op->o_abandon;
187 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
194 /* check time limit */
195 if ( tlimit != -1 && slap_get_time() > stoptime ) {
196 send_search_result( conn, op, rc = LDAP_TIMELIMIT_EXCEEDED,
197 NULL, NULL, v2refs, NULL, nentries );
201 /* get the entry with reader lock */
202 rc = bdb_id2entry( be, NULL, id, &e );
205 if( !BDB_IDL_IS_RANGE(candidates) ) {
206 /* only complain for non-range IDLs */
207 Debug( LDAP_DEBUG_TRACE,
208 "bdb_search: candidate %ld not found\n",
216 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
221 e = deref_entry_r( be, e, &err, &matched, &text );
228 if( e->e_id == id ) {
233 /* need to skip alias which deref into scope */
234 if( scope & LDAP_SCOPE_ONELEVEL ) {
235 char *pdn = dn_parent( NULL, e->e_ndn );
237 if( strcmp( pdn, realbase ) ) {
244 } else if ( dn_issuffix( e->e_ndn, realbase ) ) {
245 /* alias is within scope */
246 Debug( LDAP_DEBUG_TRACE,
247 "bdb_search: \"%s\" in subtree\n",
257 * if it's a referral, add it to the list of referrals. only do
258 * this for non-base searches, and don't check the filter
259 * explicitly here since it's only a candidate anyway.
261 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
262 is_entry_referral( e ) )
264 struct berval **refs = get_entry_referrals(
267 send_search_reference( be, conn, op,
268 e, refs, scope, NULL, &v2refs );
270 ber_bvecfree( refs );
275 /* if it matches the filter and scope, send it */
276 rc = test_filter( be, conn, op, e, filter );
277 if ( rc == LDAP_COMPARE_TRUE ) {
281 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
282 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
283 (void) dn_normalize( dn );
284 scopeok = (dn == realbase)
286 : (strcmp( dn, realbase ) ? 0 : 1 );
290 scopeok = (realbase == NULL || *realbase == '\0');
293 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
294 dn = ch_strdup( e->e_ndn );
295 scopeok = dn_issuffix( dn, realbase );
303 /* check size limit */
304 if ( --slimit == -1 ) {
305 bdb_entry_return( be, e );
306 send_search_result( conn, op,
307 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
308 v2refs, NULL, nentries );
313 int result = send_search_entry( be, conn, op,
314 e, attrs, attrsonly, NULL);
317 case 0: /* entry sent ok */
320 case 1: /* entry not sent */
322 case -1: /* connection closed */
323 bdb_entry_return( be, e );
329 Debug( LDAP_DEBUG_TRACE,
330 "bdb_search: %ld scope not okay\n",
334 Debug( LDAP_DEBUG_TRACE,
335 "bdb_search: %ld does match filter\n",
341 /* free reader lock */
342 bdb_entry_return( be, e );
345 ldap_pvt_thread_yield();
347 send_search_result( conn, op,
348 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
349 NULL, NULL, v2refs, NULL, nentries );
354 ber_bvecfree( v2refs );
355 if( realbase ) ch_free( realbase );
361 static int base_candidate(
366 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
367 e->e_dn, (long) e->e_id, 0);
374 static int search_candidates(
384 Filter f, fand, rf, af, xf;
385 AttributeAssertion aa_ref, aa_alias;
387 Debug(LDAP_DEBUG_TRACE,
388 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
389 e->e_dn, (long) e->e_id, scope );
392 xf.f_choice = LDAP_FILTER_OR;
396 /* match referrals */
397 static struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
398 rf.f_choice = LDAP_FILTER_EQUALITY;
400 rf.f_av_desc = slap_schema.si_ad_objectClass;
401 rf.f_av_value = &bv_ref;
407 if( deref & LDAP_DEREF_SEARCHING ) {
409 static struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
410 af.f_choice = LDAP_FILTER_EQUALITY;
411 af.f_ava = &aa_alias;
412 af.f_av_desc = slap_schema.si_ad_objectClass;
413 af.f_av_value = &bv_alias;
420 f.f_choice = LDAP_FILTER_AND;
422 fand.f_choice = scope == LDAP_SCOPE_SUBTREE
423 ? SLAPD_FILTER_DN_SUBTREE
424 : SLAPD_FILTER_DN_ONE;
425 fand.f_dn = e->e_ndn;
426 fand.f_next = xf.f_or == filter ? filter : &xf ;
429 rc = bdb_filter_candidates( be, &f, ids );
434 ids[2] = e->e_id+128;
438 Debug(LDAP_DEBUG_TRACE,
439 "search_candidates: id=%ld first=%ld last=%ld\n",
441 BDB_IDL_IS_RANGE( ids ) ? ids[2] : ids[ids[0]] );
446 static ID idl_first( ID *ids, ID *cursor )
455 if ( BDB_IDL_IS_RANGE( ids ) ) {
456 if( *cursor < ids[1] ) {
462 pos = bdb_idl_search( ids, *cursor );
472 static ID idl_next( ID *ids, ID *cursor )
474 if ( BDB_IDL_IS_RANGE( ids ) ) {
475 if( ids[2] < ++(*cursor) ) {
481 if ( *cursor < ids[0] ) {
482 return ids[(*cursor)++];