1 /* search.c - ldbm backend search function */
4 * Copyright 1998-2000 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 const char *filterstr,
43 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
45 const char *text = NULL;
50 struct berval **v2refs = NULL;
51 Entry *matched = NULL;
52 char *realbase = NULL;
54 int manageDSAit = get_manageDSAit( op );
56 Debug(LDAP_DEBUG_TRACE, "=> ldbm_back_search\n", 0, 0, 0);
58 /* get entry with reader lock */
59 if ( deref & LDAP_DEREF_FINDING ) {
60 e = deref_dn_r( be, nbase, &err, &matched, &text );
63 e = dn2entry_r( be, nbase, &matched );
64 err = e != NULL ? LDAP_SUCCESS : LDAP_REFERRAL;
69 char *matched_dn = NULL;
70 struct berval **refs = NULL;
72 if ( matched != NULL ) {
73 matched_dn = ch_strdup( matched->e_dn );
75 refs = is_entry_referral( matched )
76 ? get_entry_referrals( be, conn, op, matched )
79 cache_return_entry_r( &li->li_cache, matched );
81 refs = default_referral;
84 send_ldap_result( conn, op, err,
85 matched_dn, text, refs, NULL );
87 if( matched != NULL ) {
95 if (!manageDSAit && is_entry_referral( e ) ) {
96 /* entry is a referral, don't allow add */
97 char *matched_dn = ch_strdup( e->e_dn );
98 struct berval **refs = get_entry_referrals( be,
101 cache_return_entry_r( &li->li_cache, e );
103 Debug( LDAP_DEBUG_TRACE,
104 "ldbm_search: entry is referral\n",
107 send_ldap_result( conn, op, LDAP_REFERRAL,
108 matched_dn, NULL, refs, NULL );
110 ber_bvecfree( refs );
116 if ( is_entry_alias( e ) ) {
118 deref = LDAP_DEREF_NEVER;
121 if ( tlimit == 0 && be_isroot( be, op->o_ndn ) ) {
122 tlimit = -1; /* allow root to set no limit */
124 tlimit = (tlimit > be->be_timelimit || tlimit < 1) ?
125 be->be_timelimit : tlimit;
126 stoptime = op->o_time + tlimit;
129 if ( slimit == 0 && be_isroot( be, op->o_ndn ) ) {
130 slimit = -1; /* allow root to set no limit */
132 slimit = (slimit > be->be_sizelimit || slimit < 1) ?
133 be->be_sizelimit : slimit;
136 if ( scope == LDAP_SCOPE_BASE ) {
137 candidates = base_candidate( be, e );
140 candidates = search_candidates( be, e, filter,
141 scope, deref, manageDSAit );
144 /* need normalized dn below */
145 realbase = ch_strdup( e->e_ndn );
147 cache_return_entry_r( &li->li_cache, e );
149 if ( candidates == NULL ) {
151 Debug( LDAP_DEBUG_TRACE, "ldbm_search: no candidates\n",
154 send_search_result( conn, op,
156 NULL, NULL, NULL, NULL, 0 );
162 for ( id = idl_firstid( candidates, &cursor ); id != NOID;
163 id = idl_nextid( candidates, &cursor ) )
167 /* check for abandon */
168 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
170 if ( op->o_abandon ) {
171 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
176 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
178 /* check time limit */
179 if ( tlimit != -1 && slap_get_time() > stoptime ) {
180 send_search_result( conn, op, LDAP_TIMELIMIT_EXCEEDED,
181 NULL, NULL, v2refs, NULL, nentries );
186 /* get the entry with reader lock */
187 e = id2entry_r( be, id );
190 Debug( LDAP_DEBUG_TRACE,
191 "ldbm_search: candidate %ld not found\n",
197 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
202 e = deref_entry_r( be, e, &err, &matched, &text );
209 if( e->e_id == id ) {
214 /* need to skip alias which deref into scope */
215 if( scope & LDAP_SCOPE_ONELEVEL ) {
216 char *pdn = dn_parent( NULL, e->e_ndn );
218 if( strcmp( pdn, realbase ) ) {
225 } else if ( dn_issuffix( e->e_ndn, realbase ) ) {
226 /* alias is within scope */
227 Debug( LDAP_DEBUG_TRACE,
228 "ldbm_search: \"%s\" in subtree\n",
237 * if it's a referral, add it to the list of referrals. only do
238 * this for non-base searches, and don't check the filter
239 * explicitly here since it's only a candidate anyway.
241 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
242 is_entry_referral( e ) )
244 struct berval **refs = get_entry_referrals(
247 send_search_reference( be, conn, op,
248 e, refs, scope, NULL, &v2refs );
250 ber_bvecfree( refs );
255 /* if it matches the filter and scope, send it */
256 if ( test_filter( be, conn, op, e, filter ) == LDAP_COMPARE_TRUE ) {
260 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
261 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
262 (void) dn_normalize( dn );
263 scopeok = (dn == realbase)
265 : (strcmp( dn, realbase ) ? 0 : 1 );
269 scopeok = (realbase == NULL || *realbase == '\0');
272 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
273 dn = ch_strdup( e->e_ndn );
274 scopeok = dn_issuffix( dn, realbase );
282 /* check size limit */
283 if ( --slimit == -1 ) {
284 cache_return_entry_r( &li->li_cache, e );
285 send_search_result( conn, op,
286 LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
287 v2refs, NULL, nentries );
293 int result = send_search_entry(be, conn, op,
294 e, attrs, attrsonly, NULL);
297 case 0: /* entry sent ok */
300 case 1: /* entry not sent */
302 case -1: /* connection closed */
303 cache_return_entry_r( &li->li_cache, e );
309 Debug( LDAP_DEBUG_TRACE,
310 "ldbm_search: candidate %ld scope not okay\n",
314 Debug( LDAP_DEBUG_TRACE,
315 "ldbm_search: candidate %ld does not match filter\n",
321 /* free reader lock */
322 cache_return_entry_r( &li->li_cache, e );
325 ldap_pvt_thread_yield();
327 send_search_result( conn, op,
328 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
329 NULL, NULL, v2refs, NULL, nentries );
334 if( candidates != NULL )
335 idl_free( candidates );
337 ber_bvecfree( v2refs );
338 if( realbase ) free( realbase );
350 Debug(LDAP_DEBUG_TRACE, "base_candidates: base: \"%s\"\n",
353 idl = idl_alloc( 1 );
354 idl_insert( &idl, e->e_id, 1 );
368 ID_BLOCK *candidates;
369 Filter f, fand, rf, af, xf;
370 AttributeAssertion aa_ref, aa_alias;
371 static struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
372 static struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
374 Debug(LDAP_DEBUG_TRACE,
375 "search_candidates: base=\"%s\" s=%d d=%d\n",
376 e->e_ndn, scope, deref );
379 xf.f_choice = LDAP_FILTER_OR;
383 /* match referrals */
384 rf.f_choice = LDAP_FILTER_EQUALITY;
386 rf.f_av_desc = slap_schema.si_ad_objectClass;
387 rf.f_av_value = &bv_ref;
392 if( deref & LDAP_DEREF_SEARCHING ) {
394 af.f_choice = LDAP_FILTER_EQUALITY;
395 af.f_ava = &aa_alias;
396 af.f_av_desc = slap_schema.si_ad_objectClass;
397 af.f_av_value = &bv_alias;
403 f.f_choice = LDAP_FILTER_AND;
405 fand.f_choice = scope == LDAP_SCOPE_SUBTREE
406 ? SLAPD_FILTER_DN_SUBTREE
407 : SLAPD_FILTER_DN_ONE;
408 fand.f_dn = e->e_ndn;
409 fand.f_next = xf.f_or == filter ? filter : &xf ;
411 candidates = filter_candidates( be, &f );
413 return( candidates );