mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
071b9466c4
Add better approx test
343 lines
6.9 KiB
C
343 lines
6.9 KiB
C
/* index.c - routines for dealing with attribute indexes */
|
|
/* $OpenLDAP$ */
|
|
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
|
*
|
|
* Copyright 1998-2004 The OpenLDAP Foundation.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted only as authorized by the OpenLDAP
|
|
* Public License.
|
|
*
|
|
* A copy of this license is available in the file LICENSE in the
|
|
* top-level directory of the distribution or, alternatively, at
|
|
* <http://www.OpenLDAP.org/license.html>.
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ac/string.h>
|
|
#include <ac/socket.h>
|
|
|
|
#include "slap.h"
|
|
#include "back-ldbm.h"
|
|
|
|
static slap_mask_t index_mask(
|
|
Backend *be,
|
|
AttributeDescription *desc,
|
|
char **dbname,
|
|
struct berval *atname )
|
|
{
|
|
AttributeType *at;
|
|
slap_mask_t mask = 0;
|
|
|
|
attr_mask( be->be_private, desc, &mask );
|
|
|
|
if( mask ) {
|
|
*atname = desc->ad_cname;
|
|
*dbname = desc->ad_cname.bv_val;
|
|
return mask;
|
|
}
|
|
|
|
/* If there is a tagging option, did we ever index the base
|
|
* type? If so, check for mask, otherwise it's not there.
|
|
*/
|
|
if( slap_ad_is_tagged( desc ) && desc != desc->ad_type->sat_ad ) {
|
|
/* has tagging option */
|
|
attr_mask( be->be_private, desc->ad_type->sat_ad, &mask );
|
|
|
|
if( mask && ( mask ^ SLAP_INDEX_NOTAGS ) ) {
|
|
*atname = desc->ad_type->sat_cname;
|
|
*dbname = desc->ad_type->sat_cname.bv_val;
|
|
return mask;
|
|
}
|
|
}
|
|
|
|
/* see if supertype defined mask for its subtypes */
|
|
for( at = desc->ad_type->sat_sup; at != NULL ; at = at->sat_sup ) {
|
|
/* If no AD, we've never indexed this type */
|
|
if (!at->sat_ad)
|
|
continue;
|
|
|
|
attr_mask( be->be_private, at->sat_ad, &mask );
|
|
|
|
if( mask && ( mask ^ SLAP_INDEX_NOSUBTYPES ) ) {
|
|
*atname = at->sat_cname;
|
|
*dbname = at->sat_cname.bv_val;
|
|
return mask;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int index_is_indexed(
|
|
Backend *be,
|
|
AttributeDescription *desc )
|
|
{
|
|
slap_mask_t mask;
|
|
char *dbname;
|
|
struct berval prefix;
|
|
|
|
mask = index_mask( be, desc, &dbname, &prefix );
|
|
|
|
if( mask == 0 ) {
|
|
return LDAP_INAPPROPRIATE_MATCHING;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int index_param(
|
|
Backend *be,
|
|
AttributeDescription *desc,
|
|
int ftype,
|
|
char **dbnamep,
|
|
slap_mask_t *maskp,
|
|
struct berval *prefixp )
|
|
{
|
|
slap_mask_t mask;
|
|
char *dbname;
|
|
|
|
mask = index_mask( be, desc, &dbname, prefixp );
|
|
|
|
if( mask == 0 ) {
|
|
return LDAP_INAPPROPRIATE_MATCHING;
|
|
}
|
|
|
|
switch( ftype ) {
|
|
case LDAP_FILTER_PRESENT:
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_PRESENT ) ) {
|
|
goto done;
|
|
}
|
|
break;
|
|
|
|
case LDAP_FILTER_APPROX:
|
|
if ( desc->ad_type->sat_approx ) {
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_APPROX ) ) {
|
|
goto done;
|
|
}
|
|
break;
|
|
}
|
|
|
|
/* Use EQUALITY rule and index for approximate match */
|
|
/* fall thru */
|
|
|
|
case LDAP_FILTER_EQUALITY:
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_EQUALITY ) ) {
|
|
goto done;
|
|
}
|
|
break;
|
|
|
|
case LDAP_FILTER_SUBSTRINGS:
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_SUBSTR ) ) {
|
|
goto done;
|
|
}
|
|
break;
|
|
|
|
default:
|
|
return LDAP_OTHER;
|
|
}
|
|
|
|
return LDAP_INAPPROPRIATE_MATCHING;
|
|
|
|
done:
|
|
*dbnamep = dbname;
|
|
*maskp = mask;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int indexer(
|
|
Operation *op,
|
|
char *dbname,
|
|
struct berval *atname,
|
|
BerVarray vals,
|
|
ID id,
|
|
int opid,
|
|
slap_mask_t mask )
|
|
{
|
|
int rc, i;
|
|
const char *text;
|
|
DBCache *db;
|
|
AttributeDescription *ad = NULL;
|
|
struct berval *keys;
|
|
|
|
assert( mask );
|
|
|
|
rc = slap_bv2ad( atname, &ad, &text );
|
|
|
|
if( rc != LDAP_SUCCESS ) return rc;
|
|
|
|
db = ldbm_cache_open( op->o_bd, dbname, LDBM_SUFFIX, LDBM_WRCREAT );
|
|
|
|
if ( db == NULL ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG( INDEX, ERR,
|
|
"index_read: Could not open db %s%s\n", dbname, LDBM_SUFFIX, 0 );
|
|
#else
|
|
Debug( LDAP_DEBUG_ANY,
|
|
"<= index_read NULL (could not open %s%s)\n",
|
|
dbname, LDBM_SUFFIX, 0 );
|
|
#endif
|
|
|
|
return LDAP_OTHER;
|
|
}
|
|
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_PRESENT ) ) {
|
|
key_change( op->o_bd, db, atname, id, opid );
|
|
}
|
|
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_EQUALITY ) ) {
|
|
rc = ad->ad_type->sat_equality->smr_indexer(
|
|
LDAP_FILTER_EQUALITY,
|
|
mask,
|
|
ad->ad_type->sat_syntax,
|
|
ad->ad_type->sat_equality,
|
|
atname, vals, &keys, op->o_tmpmemctx );
|
|
|
|
if( rc == LDAP_SUCCESS && keys != NULL ) {
|
|
for( i=0; keys[i].bv_val != NULL; i++ ) {
|
|
key_change( op->o_bd, db, &keys[i], id, opid );
|
|
}
|
|
ber_bvarray_free_x( keys, op->o_tmpmemctx );
|
|
}
|
|
}
|
|
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_APPROX ) ) {
|
|
rc = ad->ad_type->sat_approx->smr_indexer(
|
|
LDAP_FILTER_APPROX,
|
|
mask,
|
|
ad->ad_type->sat_syntax,
|
|
ad->ad_type->sat_approx,
|
|
atname, vals, &keys, op->o_tmpmemctx );
|
|
|
|
if( rc == LDAP_SUCCESS && keys != NULL ) {
|
|
for( i=0; keys[i].bv_val != NULL; i++ ) {
|
|
key_change( op->o_bd, db, &keys[i], id, opid );
|
|
}
|
|
ber_bvarray_free_x( keys, op->o_tmpmemctx );
|
|
}
|
|
}
|
|
|
|
if( IS_SLAP_INDEX( mask, SLAP_INDEX_SUBSTR ) ) {
|
|
rc = ad->ad_type->sat_substr->smr_indexer(
|
|
LDAP_FILTER_SUBSTRINGS,
|
|
mask,
|
|
ad->ad_type->sat_syntax,
|
|
ad->ad_type->sat_substr,
|
|
atname, vals, &keys, op->o_tmpmemctx );
|
|
|
|
if( rc == LDAP_SUCCESS && keys != NULL ) {
|
|
for( i=0; keys[i].bv_val != NULL; i++ ) {
|
|
key_change( op->o_bd, db, &keys[i], id, opid );
|
|
}
|
|
ber_bvarray_free_x( keys, op->o_tmpmemctx );
|
|
}
|
|
}
|
|
|
|
ldbm_cache_close( op->o_bd, db );
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int index_at_values(
|
|
Operation *op,
|
|
AttributeType *type,
|
|
struct berval *tags,
|
|
BerVarray vals,
|
|
ID id,
|
|
int opid )
|
|
{
|
|
slap_mask_t mask = 0;
|
|
|
|
if( type->sat_sup ) {
|
|
/* recurse */
|
|
(void) index_at_values( op,
|
|
type->sat_sup, tags,
|
|
vals, id, opid );
|
|
}
|
|
|
|
/* If this type has no AD, we've never used it before */
|
|
if( type->sat_ad ) {
|
|
attr_mask( op->o_bd->be_private, type->sat_ad, &mask );
|
|
}
|
|
|
|
if( mask ) {
|
|
indexer( op, type->sat_cname.bv_val,
|
|
&type->sat_cname,
|
|
vals, id, opid,
|
|
mask );
|
|
}
|
|
|
|
if( tags->bv_len ) {
|
|
AttributeDescription *desc;
|
|
|
|
mask = 0;
|
|
|
|
desc = ad_find_tags(type, tags);
|
|
if( desc ) {
|
|
attr_mask( op->o_bd->be_private, desc, &mask );
|
|
}
|
|
|
|
if( mask ) {
|
|
indexer( op, desc->ad_cname.bv_val, &desc->ad_cname,
|
|
vals, id, opid,
|
|
mask );
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int index_values(
|
|
Operation *op,
|
|
AttributeDescription *desc,
|
|
BerVarray vals,
|
|
ID id,
|
|
int opid )
|
|
{
|
|
(void) index_at_values( op,
|
|
desc->ad_type, &desc->ad_tags,
|
|
vals, id, opid );
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
index_entry(
|
|
Operation *op,
|
|
int opid,
|
|
Entry *e )
|
|
{
|
|
Attribute *ap = e->e_attrs;
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG( INDEX, ENTRY,
|
|
"index_entry: %s (%s)%ld\n", opid == SLAP_INDEX_ADD_OP ? "add" : "del",
|
|
e->e_dn, e->e_id );
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE, "=> index_entry_%s( %ld, \"%s\" )\n",
|
|
opid == SLAP_INDEX_ADD_OP ? "add" : "del",
|
|
e->e_id, e->e_dn );
|
|
#endif
|
|
|
|
/* add each attribute to the indexes */
|
|
for ( ; ap != NULL; ap = ap->a_next ) {
|
|
index_values( op, ap->a_desc,
|
|
ap->a_nvals,
|
|
e->e_id, opid );
|
|
}
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG( INDEX, ENTRY, "index_entry: success\n", 0, 0, 0 );
|
|
#else
|
|
Debug( LDAP_DEBUG_TRACE, "<= index_entry_%s( %ld, \"%s\" ) success\n",
|
|
opid == SLAP_INDEX_ADD_OP ? "add" : "del",
|
|
e->e_id, e->e_dn );
|
|
#endif
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|