1 /* search.c - ldbm backend search function */
4 * Copyright 1998-1999 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 );
43 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
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, base, &err, &matched, &text );
63 e = dn2entry_r( be, base, &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, "entry is referral\n", 0,
106 send_ldap_result( conn, op, LDAP_REFERRAL,
107 matched_dn, NULL, refs, NULL );
109 ber_bvecfree( refs );
115 if ( tlimit == 0 && be_isroot( be, op->o_ndn ) ) {
116 tlimit = -1; /* allow root to set no limit */
118 tlimit = (tlimit > be->be_timelimit || tlimit < 1) ?
119 be->be_timelimit : tlimit;
120 stoptime = op->o_time + tlimit;
123 if ( slimit == 0 && be_isroot( be, op->o_ndn ) ) {
124 slimit = -1; /* allow root to set no limit */
126 slimit = (slimit > be->be_sizelimit || slimit < 1) ?
127 be->be_sizelimit : slimit;
130 if ( scope == LDAP_SCOPE_BASE) {
131 candidates = base_candidate( be, e );
134 candidates = search_candidates( be, e, filter,
135 scope, deref, manageDSAit );
138 /* need normalized dn below */
139 realbase = ch_strdup( e->e_ndn );
140 cache_return_entry_r( &li->li_cache, e );
142 if ( candidates == NULL ) {
144 Debug( LDAP_DEBUG_TRACE, "no candidates\n", 0,
147 send_search_result( conn, op,
149 NULL, NULL, NULL, NULL, 0 );
155 for ( id = idl_firstid( candidates, &cursor ); id != NOID;
156 id = idl_nextid( candidates, &cursor ) )
160 /* check for abandon */
161 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
163 if ( op->o_abandon ) {
164 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
169 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
171 /* check time limit */
172 if ( tlimit != -1 && slap_get_time() > stoptime ) {
173 send_search_result( conn, op, LDAP_TIMELIMIT_EXCEEDED,
174 NULL, NULL, v2refs, NULL, nentries );
179 /* get the entry with reader lock */
180 e = id2entry_r( be, id );
183 Debug( LDAP_DEBUG_ARGS, "search: candidate %ld not found\n",
189 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
194 e = deref_entry_r( be, e, &err, &matched, &text );
201 if( e->e_id == id ) {
206 /* need to skip alias which deref into scope */
207 if( scope & LDAP_SCOPE_ONELEVEL ) {
208 char *pdn = dn_parent( NULL, e->e_ndn );
210 if( strcmp( pdn, realbase ) ) {
217 } else if ( dn_issuffix( e->e_ndn, realbase ) ) {
218 /* alias is within scope */
219 Debug( LDAP_DEBUG_ARGS, "search: \"%s\" in subtree\n",
228 * if it's a referral, add it to the list of referrals. only do
229 * this for non-base searches, and don't check the filter
230 * explicitly here since it's only a candidate anyway.
232 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
233 is_entry_referral( e ) )
235 struct berval **refs = get_entry_referrals(
238 send_search_reference( be, conn, op,
239 e, refs, scope, NULL, &v2refs );
241 ber_bvecfree( refs );
246 /* if it matches the filter and scope, send it */
247 if ( test_filter( be, conn, op, e, filter ) == 0 ) {
251 if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
252 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
253 (void) dn_normalize_case( dn );
254 scopeok = (dn == realbase)
256 : (strcmp( dn, realbase ) ? 0 : 1 );
260 scopeok = (realbase == NULL || *realbase == '\0');
263 } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
264 dn = ch_strdup( e->e_ndn );
265 scopeok = dn_issuffix( dn, realbase );
273 /* check size limit */
274 if ( --slimit == -1 ) {
275 cache_return_entry_r( &li->li_cache, e );
276 send_search_result( conn, op,
277 LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
278 v2refs, NULL, nentries );
284 switch ( send_search_entry( be, conn, op, e,
285 attrs, attrsonly, NULL ) ) {
286 case 0: /* entry sent ok */
289 case 1: /* entry not sent */
291 case -1: /* connection closed */
292 cache_return_entry_r( &li->li_cache, e );
298 Debug( LDAP_DEBUG_TRACE, "candidate %ld scope not okay\n",
302 Debug( LDAP_DEBUG_TRACE, "candidate %ld does match filter\n",
308 /* free reader lock */
309 cache_return_entry_r( &li->li_cache, e );
312 ldap_pvt_thread_yield();
314 send_search_result( conn, op,
315 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
316 NULL, NULL, v2refs, NULL, nentries );
321 if( candidates != NULL )
322 idl_free( candidates );
324 ber_bvecfree( v2refs );
325 if( realbase ) free( realbase );
338 Debug(LDAP_DEBUG_TRACE, "base_candidates: base: \"%s\"\n",
341 idl = idl_alloc( 1 );
342 idl_insert( &idl, e->e_id, 1 );
357 ID_BLOCK *candidates;
358 Filter *f, *rf, *af, *lf;
360 Debug(LDAP_DEBUG_TRACE, "search_candidates: base=\"%s\" s=%d d=%d\n",
361 e->e_ndn, scope, deref );
366 /* match referrals */
367 rf = (Filter *) ch_malloc( sizeof(Filter) );
369 rf->f_choice = LDAP_FILTER_OR;
370 rf->f_or = (Filter *) ch_malloc( sizeof(Filter) );
371 rf->f_or->f_choice = LDAP_FILTER_EQUALITY;
372 rf->f_or->f_avtype = ch_strdup( "objectclass" );
373 rf->f_or->f_avvalue.bv_val = ch_strdup( "REFERRAL" );
374 rf->f_or->f_avvalue.bv_len = sizeof("REFERRAL")-1;
375 rf->f_or->f_next = filter;
382 if( deref & LDAP_DEREF_SEARCHING ) {
384 af = (Filter *) ch_malloc( sizeof(Filter) );
386 af->f_choice = LDAP_FILTER_OR;
387 af->f_or = (Filter *) ch_malloc( sizeof(Filter) );
388 af->f_or->f_choice = LDAP_FILTER_EQUALITY;
389 af->f_or->f_avtype = ch_strdup( "objectclass" );
390 af->f_or->f_avvalue.bv_val = ch_strdup( "ALIAS" );
391 af->f_or->f_avvalue.bv_len = sizeof("ALIAS")-1;
392 af->f_or->f_next = f;
398 if ( scope == LDAP_SCOPE_SUBTREE ) {
399 lf = (Filter *) ch_malloc( sizeof(Filter) );
401 lf->f_choice = LDAP_FILTER_AND;
402 lf->f_and = (Filter *) ch_malloc( sizeof(Filter) );
404 lf->f_and->f_choice = SLAPD_FILTER_DN_SUBTREE;
405 lf->f_and->f_dn = e->e_ndn;
407 lf->f_and->f_next = f;
410 } else if ( scope == LDAP_SCOPE_ONELEVEL ) {
411 lf = (Filter *) ch_malloc( sizeof(Filter) );
413 lf->f_choice = LDAP_FILTER_AND;
414 lf->f_and = (Filter *) ch_malloc( sizeof(Filter) );
416 lf->f_and->f_choice = SLAPD_FILTER_DN_ONE;
417 lf->f_and->f_dn = e->e_ndn;
419 lf->f_and->f_next = f;
426 candidates = filter_candidates( be, f );
428 /* free up filter additions we allocated above */
435 af->f_or->f_next = NULL;
440 rf->f_or->f_next = NULL;
444 return( candidates );