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 Debug( LDAP_DEBUG_TRACE,
206 "bdb_search: candidate %ld not found\n",
213 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
218 e = deref_entry_r( be, e, &err, &matched, &text );
225 if( e->e_id == id ) {
230 /* need to skip alias which deref into scope */
231 if( scope & LDAP_SCOPE_ONELEVEL ) {
232 char *pdn = dn_parent( NULL, e->e_ndn );
234 if( strcmp( pdn, realbase ) ) {
241 } else if ( dn_issuffix( e->e_ndn, realbase ) ) {
242 /* alias is within scope */
243 Debug( LDAP_DEBUG_TRACE,
244 "bdb_search: \"%s\" in subtree\n",
254 * if it's a referral, add it to the list of referrals. only do
255 * this for non-base searches, and don't check the filter
256 * explicitly here since it's only a candidate anyway.
258 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
259 is_entry_referral( e ) )
261 struct berval **refs = get_entry_referrals(
264 send_search_reference( be, conn, op,
265 e, refs, scope, NULL, &v2refs );
267 ber_bvecfree( refs );
272 /* if it matches the filter and scope, send it */
273 rc = test_filter( be, conn, op, e, filter );
274 if ( rc == LDAP_COMPARE_TRUE ) {
278 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
279 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
280 (void) dn_normalize( dn );
281 scopeok = (dn == realbase)
283 : (strcmp( dn, realbase ) ? 0 : 1 );
287 scopeok = (realbase == NULL || *realbase == '\0');
290 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
291 dn = ch_strdup( e->e_ndn );
292 scopeok = dn_issuffix( dn, realbase );
300 /* check size limit */
301 if ( --slimit == -1 ) {
302 bdb_entry_return( be, e );
303 send_search_result( conn, op,
304 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
305 v2refs, NULL, nentries );
310 int result = send_search_entry( be, conn, op,
311 e, attrs, attrsonly, NULL);
314 case 0: /* entry sent ok */
317 case 1: /* entry not sent */
319 case -1: /* connection closed */
320 bdb_entry_return( be, e );
326 Debug( LDAP_DEBUG_TRACE,
327 "bdb_search: %ld scope not okay\n",
331 Debug( LDAP_DEBUG_TRACE,
332 "bdb_search: %ld does match filter\n",
338 /* free reader lock */
339 bdb_entry_return( be, e );
342 ldap_pvt_thread_yield();
344 send_search_result( conn, op,
345 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
346 NULL, NULL, v2refs, NULL, nentries );
351 ber_bvecfree( v2refs );
352 if( realbase ) ch_free( realbase );
358 static int base_candidate(
363 Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
364 e->e_dn, (long) e->e_id, 0);
371 static int search_candidates(
381 Filter f, fand, rf, af, xf;
382 AttributeAssertion aa_ref, aa_alias;
384 Debug(LDAP_DEBUG_TRACE,
385 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
386 e->e_dn, (long) e->e_id, scope );
389 xf.f_choice = LDAP_FILTER_OR;
393 /* match referrals */
394 static struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
395 rf.f_choice = LDAP_FILTER_EQUALITY;
397 rf.f_av_desc = slap_schema.si_ad_objectClass;
398 rf.f_av_value = &bv_ref;
404 if( deref & LDAP_DEREF_SEARCHING ) {
406 static struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
407 af.f_choice = LDAP_FILTER_EQUALITY;
408 af.f_ava = &aa_alias;
409 af.f_av_desc = slap_schema.si_ad_objectClass;
410 af.f_av_value = &bv_alias;
417 f.f_choice = LDAP_FILTER_AND;
419 fand.f_choice = scope == LDAP_SCOPE_SUBTREE
420 ? SLAPD_FILTER_DN_SUBTREE
421 : SLAPD_FILTER_DN_ONE;
422 fand.f_dn = e->e_ndn;
423 fand.f_next = xf.f_or == filter ? filter : &xf ;
426 rc = bdb_filter_candidates( be, &f, ids );
431 ids[2] = e->e_id+128;
435 Debug(LDAP_DEBUG_TRACE,
436 "search_candidates: id=%ld first=%ld last=%ld\n",
438 BDB_IDL_IS_RANGE( ids ) ? ids[2] : ids[ids[0]] );
443 static ID idl_first( ID *ids, ID *cursor )
452 if ( BDB_IDL_IS_RANGE( ids ) ) {
453 if( *cursor < ids[1] ) {
459 pos = bdb_idl_search( ids, *cursor );
469 static ID idl_next( ID *ids, ID *cursor )
471 if ( BDB_IDL_IS_RANGE( ids ) ) {
472 if( ids[2] < ++(*cursor) ) {
478 if ( *cursor < ids[0] ) {
479 return ids[(*cursor)++];