openldap/servers/slapd/back-bdb/search.c

587 lines
13 KiB
C
Raw Normal View History

2000-09-26 02:59:15 +08:00
/* search.c - search operation */
/* $OpenLDAP$ */
/*
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
#include "portable.h"
#include <stdio.h>
#include <ac/string.h>
#include "back-bdb.h"
2001-06-15 15:08:37 +08:00
#include "idl.h"
2000-09-26 13:33:37 +08:00
#include "external.h"
2000-09-26 02:59:15 +08:00
static int base_candidate(
BackendDB *be,
2000-09-26 02:59:15 +08:00
Entry *e,
ID *ids );
static int search_candidates(
BackendDB *be,
Entry *e,
Filter *filter,
int scope,
int deref,
int manageDSAit,
ID *ids );
2000-09-26 02:59:15 +08:00
int
bdb_search(
BackendDB *be,
Connection *conn,
Operation *op,
const char *base,
const char *nbase,
int scope,
int deref,
int slimit,
int tlimit,
Filter *filter,
const char *filterstr,
char **attrs,
int attrsonly )
2000-09-26 02:59:15 +08:00
{
struct bdb_info *bdb = (struct bdb_info *) be->be_private;
2000-09-26 13:33:37 +08:00
int abandon;
int rc;
2000-09-26 02:59:15 +08:00
const char *text = NULL;
time_t stoptime;
ID id, cursor;
ID candidates[BDB_IDL_UM_SIZE];
2000-09-26 02:59:15 +08:00
Entry *e = NULL;
struct berval **v2refs = NULL;
Entry *matched = NULL;
char *realbase = NULL;
int nentries = 0;
2000-09-26 13:33:37 +08:00
int manageDSAit;
struct slap_limits_set *limit = NULL;
int isroot = 0;
2000-09-26 13:33:37 +08:00
Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
0, 0, 0);
2000-09-26 02:59:15 +08:00
2000-09-26 13:33:37 +08:00
manageDSAit = get_manageDSAit( op );
2000-09-26 02:59:15 +08:00
if ( *nbase == '\0' ) {
/* DIT root special case */
e = (Entry *) &slap_entry_root;
rc = 0;
} else
#ifdef BDB_ALIASES
/* get entry with reader lock */
if ( deref & LDAP_DEREF_FINDING ) {
e = deref_dn_r( be, nbase, &err, &matched, &text );
} else
#endif
{
rc = bdb_dn2entry( be, NULL, nbase, &e, &matched, 0 );
}
2000-09-26 02:59:15 +08:00
switch(rc) {
case DB_NOTFOUND:
case 0:
break;
default:
send_ldap_result( conn, op, rc=LDAP_OTHER,
NULL, "internal error", NULL, NULL );
2000-09-26 02:59:15 +08:00
return rc;
}
if ( e == NULL ) {
char *matched_dn = NULL;
struct berval **refs = NULL;
if ( matched != NULL ) {
struct berval **erefs;
2000-09-26 02:59:15 +08:00
matched_dn = ch_strdup( matched->e_dn );
erefs = is_entry_referral( matched )
? get_entry_referrals( be, conn, op, matched,
base, scope )
2000-09-26 02:59:15 +08:00
: NULL;
bdb_entry_return( be, matched );
matched = NULL;
if( erefs ) {
refs = referral_rewrite( erefs, matched_dn,
base, scope );
ber_bvecfree( erefs );
}
2000-09-26 02:59:15 +08:00
} else {
refs = referral_rewrite( default_referral,
NULL, base, scope );
2000-09-26 02:59:15 +08:00
}
send_ldap_result( conn, op, rc=LDAP_REFERRAL ,
2000-09-26 02:59:15 +08:00
matched_dn, text, refs, NULL );
ber_bvecfree( refs );
free( matched_dn );
2000-09-26 02:59:15 +08:00
return rc;
2000-09-26 02:59:15 +08:00
}
2001-11-27 11:41:03 +08:00
if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
2000-09-26 02:59:15 +08:00
/* entry is a referral, don't allow add */
char *matched_dn = ch_strdup( e->e_dn );
struct berval **erefs = get_entry_referrals( be,
conn, op, e, base, scope );
struct berval **refs = NULL;
2000-09-26 02:59:15 +08:00
bdb_entry_return( be, e );
2000-09-28 10:27:49 +08:00
e = NULL;
2000-09-26 02:59:15 +08:00
if( erefs ) {
refs = referral_rewrite( erefs, matched_dn,
base, scope );
ber_bvecfree( erefs );
}
2000-09-26 02:59:15 +08:00
Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
0, 0, 0 );
send_ldap_result( conn, op, LDAP_REFERRAL,
matched_dn, refs ? NULL : "bad referral object",
refs, NULL );
2000-09-26 02:59:15 +08:00
ber_bvecfree( refs );
free( matched_dn );
return 1;
}
/* if not root, get appropriate limits */
2001-12-26 03:48:26 +08:00
if ( be_isroot( be, &op->o_ndn ) ) {
isroot = 1;
2000-09-26 02:59:15 +08:00
} else {
( void ) get_limits( be, op->o_ndn.bv_val, &limit );
2000-09-26 02:59:15 +08:00
}
/* The time/size limits come first because they require very little
* effort, so there's no chance the candidates are selected and then
* the request is not honored only because of time/size constraints */
/* if no time limit requested, use soft limit (unless root!) */
2001-11-13 01:12:43 +08:00
if ( isroot ) {
if ( tlimit == 0 ) {
2001-11-27 11:41:03 +08:00
tlimit = -1; /* allow root to set no limit */
}
2001-11-13 01:12:43 +08:00
if ( slimit == 0 ) {
slimit = -1;
}
} else {
/* if no limit is required, use soft limit */
if ( tlimit <= 0 ) {
tlimit = limit->lms_t_soft;
2001-11-13 01:12:43 +08:00
/* if requested limit higher than hard limit, abort */
} else if ( tlimit > limit->lms_t_hard ) {
/* no hard limit means use soft instead */
if ( limit->lms_t_hard == 0 ) {
tlimit = limit->lms_t_soft;
/* positive hard limit means abort */
} else if ( limit->lms_t_hard > 0 ) {
send_search_result( conn, op,
LDAP_UNWILLING_TO_PERFORM,
NULL, NULL, NULL, NULL, 0 );
rc = 0;
goto done;
}
2001-11-13 01:12:43 +08:00
/* negative hard limit means no limit */
}
2001-11-13 01:12:43 +08:00
/* if no limit is required, use soft limit */
if ( slimit <= 0 ) {
slimit = limit->lms_s_soft;
2001-11-13 01:12:43 +08:00
/* if requested limit higher than hard limit, abort */
} else if ( slimit > limit->lms_s_hard ) {
/* no hard limit means use soft instead */
if ( limit->lms_s_hard == 0 ) {
slimit = limit->lms_s_soft;
/* positive hard limit means abort */
} else if ( limit->lms_s_hard > 0 ) {
send_search_result( conn, op,
LDAP_UNWILLING_TO_PERFORM,
NULL, NULL, NULL, NULL, 0 );
rc = 0;
goto done;
}
/* negative hard limit means no limit */
}
2000-09-26 02:59:15 +08:00
}
2001-11-13 01:12:43 +08:00
/* compute it anyway; root does not use it */
stoptime = op->o_time + tlimit;
/* select candidates */
2000-09-26 02:59:15 +08:00
if ( scope == LDAP_SCOPE_BASE ) {
rc = base_candidate( be, e, candidates );
} else {
BDB_IDL_ALL( bdb, candidates );
2000-09-26 02:59:15 +08:00
rc = search_candidates( be, e, filter,
scope, deref, manageDSAit, candidates );
2000-09-26 02:59:15 +08:00
}
/* need normalized dn below */
realbase = ch_strdup( e->e_ndn );
/* start cursor at base entry's id
* FIXME: hack to make "" base work */
cursor = e->e_id == NOID ? 1 : e->e_id;
2000-09-26 02:59:15 +08:00
if ( e != &slap_entry_root ) {
bdb_entry_return( be, e );
}
2000-09-28 10:27:49 +08:00
e = NULL;
2000-09-26 02:59:15 +08:00
if ( candidates[0] == 0 ) {
Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
0, 0, 0 );
send_search_result( conn, op,
LDAP_SUCCESS,
NULL, NULL, NULL, NULL, 0 );
rc = 1;
goto done;
}
/* if not root and candidates exceed to-be-checked entries, abort */
if ( !isroot && limit->lms_s_unchecked != -1 ) {
2001-12-10 02:57:46 +08:00
if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
send_search_result( conn, op,
LDAP_UNWILLING_TO_PERFORM,
NULL, NULL, NULL, NULL, 0 );
rc = 1;
goto done;
}
}
2001-06-15 15:08:37 +08:00
for ( id = bdb_idl_first( candidates, &cursor );
2000-09-26 02:59:15 +08:00
id != NOID;
2001-06-15 15:08:37 +08:00
id = bdb_idl_next( candidates, &cursor ) )
2000-09-26 02:59:15 +08:00
{
int scopeok = 0;
/* check for abandon */
ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
abandon = op->o_abandon;
ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
if ( abandon ) {
rc = 0;
goto done;
}
/* check time limit */
if ( tlimit != -1 && slap_get_time() > stoptime ) {
send_search_result( conn, op, rc = LDAP_TIMELIMIT_EXCEEDED,
2000-09-26 02:59:15 +08:00
NULL, NULL, v2refs, NULL, nentries );
goto done;
}
/* get the entry with reader lock */
rc = bdb_id2entry( be, NULL, id, &e );
if ( e == NULL ) {
if( !BDB_IDL_IS_RANGE(candidates) ) {
/* only complain for non-range IDLs */
Debug( LDAP_DEBUG_TRACE,
"bdb_search: candidate %ld not found\n",
(long) id, 0, 0 );
}
2000-09-26 02:59:15 +08:00
goto loop_continue;
}
#ifdef BDB_ALIASES
2000-09-26 02:59:15 +08:00
if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
Entry *matched;
int err;
const char *text;
e = deref_entry_r( be, e, &err, &matched, &text );
if( e == NULL ) {
e = matched;
goto loop_continue;
}
if( e->e_id == id ) {
/* circular loop */
goto loop_continue;
}
/* need to skip alias which deref into scope */
if( scope & LDAP_SCOPE_ONELEVEL ) {
char *pdn = dn_parent( NULL, e->e_ndn );
2000-09-26 02:59:15 +08:00
if ( pdn != NULL ) {
if( strcmp( pdn, realbase ) ) {
goto loop_continue;
}
}
} else if ( dn_issuffix( e->e_ndn, realbase ) ) {
/* alias is within scope */
Debug( LDAP_DEBUG_TRACE,
"bdb_search: \"%s\" in subtree\n",
e->e_dn, 0, 0 );
goto loop_continue;
}
scopeok = 1;
}
#endif
2000-09-26 02:59:15 +08:00
/*
* if it's a referral, add it to the list of referrals. only do
* this for non-base searches, and don't check the filter
* explicitly here since it's only a candidate anyway.
*/
if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
is_entry_referral( e ) )
{
struct berval **erefs = get_entry_referrals(
be, conn, op, e, NULL, scope );
2001-12-08 09:16:10 +08:00
struct berval **refs = referral_rewrite( erefs, e->e_dn, NULL,
scope == LDAP_SCOPE_SUBTREE
? LDAP_SCOPE_SUBTREE
: LDAP_SCOPE_BASE );
2000-09-26 02:59:15 +08:00
send_search_reference( be, conn, op,
e, refs, NULL, &v2refs );
2000-09-26 02:59:15 +08:00
ber_bvecfree( refs );
goto loop_continue;
}
/* if it matches the filter and scope, send it */
rc = test_filter( be, conn, op, e, filter );
if ( rc == LDAP_COMPARE_TRUE ) {
2000-09-26 02:59:15 +08:00
char *dn;
/* check scope */
if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
2000-09-26 02:59:15 +08:00
scopeok = (dn == realbase)
? 1
: (strcmp( dn, realbase ) ? 0 : 1 );
} else {
scopeok = (realbase == NULL || *realbase == '\0');
}
} else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
dn = ch_strdup( e->e_ndn );
scopeok = dn_issuffix( dn, realbase );
free( dn );
} else {
scopeok = 1;
}
if ( scopeok ) {
/* check size limit */
if ( --slimit == -1 ) {
bdb_entry_return( be, e );
2000-09-28 10:27:49 +08:00
e = NULL;
2000-09-26 02:59:15 +08:00
send_search_result( conn, op,
rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
2000-09-26 02:59:15 +08:00
v2refs, NULL, nentries );
goto done;
}
if (e) {
int result = send_search_entry( be, conn, op,
e, attrs, attrsonly, NULL);
switch (result) {
case 0: /* entry sent ok */
nentries++;
break;
case 1: /* entry not sent */
break;
case -1: /* connection closed */
bdb_entry_return( be, e );
2000-09-28 10:27:49 +08:00
e = NULL;
rc = LDAP_OTHER;
2000-09-26 02:59:15 +08:00
goto done;
}
}
} else {
Debug( LDAP_DEBUG_TRACE,
"bdb_search: %ld scope not okay\n",
(long) id, 0, 0 );
2000-09-26 02:59:15 +08:00
}
} else {
Debug( LDAP_DEBUG_TRACE,
"bdb_search: %ld does match filter\n",
(long) id, 0, 0 );
2000-09-26 02:59:15 +08:00
}
loop_continue:
if( e != NULL ) {
/* free reader lock */
bdb_entry_return( be, e );
}
ldap_pvt_thread_yield();
}
send_search_result( conn, op,
v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
NULL, NULL, v2refs, NULL, nentries );
rc = 0;
done:
ber_bvecfree( v2refs );
if( realbase ) ch_free( realbase );
2000-09-26 02:59:15 +08:00
return rc;
}
static int base_candidate(
BackendDB *be,
2000-09-26 02:59:15 +08:00
Entry *e,
ID *ids )
{
2000-09-27 03:26:08 +08:00
Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
2000-09-26 02:59:15 +08:00
e->e_dn, (long) e->e_id, 0);
ids[0] = 1;
ids[1] = e->e_id;
return 0;
}
/* Is "objectClass=xx" mentioned anywhere in this filter? Presence
* doesn't count, we're looking for explicit values.
*/
static int oc_filter(
Filter *f
)
{
int rc = 0;
switch(f->f_choice) {
case LDAP_FILTER_EQUALITY:
case LDAP_FILTER_APPROX:
if (f->f_av_desc == slap_schema.si_ad_objectClass)
rc = 1;
break;
case LDAP_FILTER_SUBSTRINGS:
if (f->f_sub_desc == slap_schema.si_ad_objectClass)
rc = 1;
break;
case LDAP_FILTER_AND:
case LDAP_FILTER_OR:
for (f=f->f_and; f; f=f->f_next)
if ((rc = oc_filter(f)))
break;
break;
default:
break;
}
return rc;
}
static int search_candidates(
BackendDB *be,
Entry *e,
Filter *filter,
int scope,
int deref,
int manageDSAit,
ID *ids )
{
int rc;
2001-06-15 15:08:37 +08:00
Filter f, fand, rf, xf;
ID tmp[BDB_IDL_UM_SIZE];
2001-06-15 15:08:37 +08:00
AttributeAssertion aa_ref;
struct bdb_info *bdb = (struct bdb_info *) be->be_private;
#ifdef BDB_ALIASES
Filter af;
AttributeAssertion aa_alias;
#endif
Debug(LDAP_DEBUG_TRACE,
"search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
e->e_dn, (long) e->e_id, scope );
xf.f_or = filter;
xf.f_choice = LDAP_FILTER_OR;
xf.f_next = NULL;
/* If the user's filter doesn't mention objectClass, or if
* it just uses objectClass=*, these clauses are redundant.
*/
if (oc_filter(filter)) {
2001-11-27 11:41:03 +08:00
if( !manageDSAit ) { /* match referrals */
static struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
rf.f_choice = LDAP_FILTER_EQUALITY;
rf.f_ava = &aa_ref;
rf.f_av_desc = slap_schema.si_ad_objectClass;
rf.f_av_value = &bv_ref;
rf.f_next = xf.f_or;
xf.f_or = &rf;
}
#ifdef BDB_ALIASES
2001-11-27 11:41:03 +08:00
if( deref & LDAP_DEREF_SEARCHING ) { /* match aliases */
static struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
af.f_choice = LDAP_FILTER_EQUALITY;
af.f_ava = &aa_alias;
af.f_av_desc = slap_schema.si_ad_objectClass;
af.f_av_value = &bv_alias;
af.f_next = xf.f_or;
xf.f_or = &af;
}
#endif
}
f.f_next = NULL;
f.f_choice = LDAP_FILTER_AND;
f.f_and = &fand;
fand.f_choice = scope == LDAP_SCOPE_SUBTREE
? SLAPD_FILTER_DN_SUBTREE
: SLAPD_FILTER_DN_ONE;
fand.f_dn = e->e_ndn;
fand.f_next = xf.f_or == filter ? filter : &xf ;
2001-06-15 15:08:37 +08:00
#ifdef BDB_FILTER_INDICES
rc = bdb_filter_candidates( be, &f, ids, tmp );
#else
/* FIXME: Original code:
2001-06-15 15:08:37 +08:00
BDB_IDL_ID( bdb, ids, e->e_id );
* this is a hack to make "" base work; when bdb_filter_candidates
* is used this should not be needed any more */
BDB_IDL_ID( bdb, ids, (e->e_id == NOID ? 1 : e->e_id) );
rc = 0;
#endif
2000-09-27 06:22:42 +08:00
Debug(LDAP_DEBUG_TRACE,
"bdb_search_candidates: id=%ld first=%ld last=%ld\n",
(long) ids[0],
(long) BDB_IDL_FIRST(ids),
(long) BDB_IDL_LAST(ids) );
return rc;
}