mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
5173 lines
113 KiB
C
5173 lines
113 KiB
C
/* schema_init.c - init builtin schema */
|
|
/* $OpenLDAP$ */
|
|
/*
|
|
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <stdio.h>
|
|
#include <limits.h>
|
|
|
|
#include <ac/ctype.h>
|
|
#include <ac/errno.h>
|
|
#include <ac/string.h>
|
|
#include <ac/socket.h>
|
|
|
|
#include "slap.h"
|
|
#include "ldap_pvt.h"
|
|
|
|
#include "ldap_utf8.h"
|
|
|
|
#include "lutil_hash.h"
|
|
/* We should replace MD5 with a faster hash */
|
|
#define HASH_BYTES LUTIL_HASH_BYTES
|
|
#define HASH_CONTEXT lutil_HASH_CTX
|
|
#define HASH_Init(c) lutil_HASHInit(c)
|
|
#define HASH_Update(c,buf,len) lutil_HASHUpdate(c,buf,len)
|
|
#define HASH_Final(d,c) lutil_HASHFinal(d,c)
|
|
|
|
/* recycled validatation routines */
|
|
#define berValidate blobValidate
|
|
|
|
/* unimplemented pretters */
|
|
#define integerPretty NULL
|
|
#ifndef USE_LDAP_DN_PARSING
|
|
# define dnPretty NULL
|
|
#else
|
|
# define SLAP_LDAPDN_PRETTY 0x1
|
|
#endif /* !USE_LDAP_DN_PARSING */
|
|
|
|
/* recycled matching routines */
|
|
#define bitStringMatch octetStringMatch
|
|
#define numericStringMatch caseIgnoreIA5Match
|
|
#define objectIdentifierMatch caseIgnoreIA5Match
|
|
#define telephoneNumberMatch caseIgnoreIA5Match
|
|
#define telephoneNumberSubstringsMatch caseIgnoreIA5SubstringsMatch
|
|
#define generalizedTimeMatch caseIgnoreIA5Match
|
|
#define generalizedTimeOrderingMatch caseIgnoreIA5Match
|
|
#define uniqueMemberMatch dnMatch
|
|
|
|
/* approx matching rules */
|
|
#define directoryStringApproxMatchOID "1.3.6.1.4.1.4203.666.4.4"
|
|
#define directoryStringApproxMatch approxMatch
|
|
#define directoryStringApproxIndexer approxIndexer
|
|
#define directoryStringApproxFilter approxFilter
|
|
#define IA5StringApproxMatchOID "1.3.6.1.4.1.4203.666.4.5"
|
|
#define IA5StringApproxMatch approxMatch
|
|
#define IA5StringApproxIndexer approxIndexer
|
|
#define IA5StringApproxFilter approxFilter
|
|
|
|
/* orderring matching rules */
|
|
#define caseIgnoreOrderingMatch caseIgnoreMatch
|
|
#define caseExactOrderingMatch caseExactMatch
|
|
|
|
/* unimplemented matching routines */
|
|
#define caseIgnoreListMatch NULL
|
|
#define caseIgnoreListSubstringsMatch NULL
|
|
#define protocolInformationMatch NULL
|
|
#define integerFirstComponentMatch NULL
|
|
|
|
#define OpenLDAPaciMatch NULL
|
|
#define authPasswordMatch NULL
|
|
|
|
/* recycled indexing/filtering routines */
|
|
#define dnIndexer caseExactIgnoreIndexer
|
|
#define dnFilter caseExactIgnoreFilter
|
|
#define bitStringFilter octetStringFilter
|
|
#define bitStringIndexer octetStringIndexer
|
|
|
|
#define telephoneNumberIndexer caseIgnoreIA5Indexer
|
|
#define telephoneNumberFilter caseIgnoreIA5Filter
|
|
#define telephoneNumberSubstringsIndexer caseIgnoreIA5SubstringsIndexer
|
|
#define telephoneNumberSubstringsFilter caseIgnoreIA5SubstringsFilter
|
|
|
|
/* must match OIDs below */
|
|
#define caseExactMatchOID "2.5.13.5"
|
|
#define caseExactSubstringsMatchOID "2.5.13.7"
|
|
|
|
static char *strcasechr( const char *str, int c )
|
|
{
|
|
char *lower = strchr( str, TOLOWER(c) );
|
|
char *upper = strchr( str, TOUPPER(c) );
|
|
|
|
if( lower && upper ) {
|
|
return lower < upper ? lower : upper;
|
|
} else if ( lower ) {
|
|
return lower;
|
|
} else {
|
|
return upper;
|
|
}
|
|
}
|
|
|
|
static int
|
|
octetStringMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
|
|
|
|
if( match == 0 ) {
|
|
match = memcmp( value->bv_val,
|
|
((struct berval *) assertedValue)->bv_val,
|
|
value->bv_len );
|
|
}
|
|
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int octetStringIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* just count them */
|
|
}
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( i > 0 );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
values[i]->bv_val, values[i]->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[i] = ber_bvdup( &digest );
|
|
}
|
|
|
|
keys[i] = NULL;
|
|
|
|
*keysp = keys;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int octetStringFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value = (struct berval *) assertValue;
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * 2 );
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[0] = ber_bvdup( &digest );
|
|
keys[1] = NULL;
|
|
|
|
*keysp = keys;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
#ifdef USE_LDAP_DN_PARSING
|
|
|
|
#define AVA_PRIVATE( ava ) ( ( AttributeDescription * )(ava)->la_private )
|
|
|
|
/*
|
|
* In-place, schema-aware validation of the
|
|
* structural representation of a distinguished name.
|
|
*/
|
|
static int
|
|
LDAPDN_validate( LDAPDN *dn )
|
|
{
|
|
int iRDN;
|
|
int rc;
|
|
|
|
assert( dn );
|
|
|
|
for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
|
|
LDAPRDN *rdn = dn[ iRDN ][ 0 ];
|
|
int iAVA;
|
|
|
|
for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
|
|
LDAPAVA *ava = rdn[ iAVA ][ 0 ];
|
|
AttributeDescription *ad;
|
|
slap_syntax_validate_func *validate = NULL;
|
|
|
|
if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
|
|
const char *text = NULL;
|
|
|
|
rc = slap_bv2ad( ava->la_attr, &ad, &text );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
ava->la_private = ( void * )ad;
|
|
}
|
|
|
|
/*
|
|
* Replace attr oid/name with the canonical name
|
|
*/
|
|
ber_bvfree( ava->la_attr );
|
|
ava->la_attr = ber_bvdup( &ad->ad_cname );
|
|
|
|
validate = ad->ad_type->sat_syntax->ssyn_validate;
|
|
|
|
if ( validate ) {
|
|
/*
|
|
* validate value by validate function
|
|
*/
|
|
rc = ( *validate )( ad->ad_type->sat_syntax,
|
|
ava->la_value );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
dnValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
int rc;
|
|
LDAPDN *dn = NULL;
|
|
|
|
if ( in->bv_len == 0 ) {
|
|
return( LDAP_SUCCESS );
|
|
}
|
|
|
|
rc = ldap_str2dn( in->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
|
|
|
|
/*
|
|
* Schema-aware validate
|
|
*/
|
|
if ( rc == LDAP_SUCCESS ) {
|
|
rc = LDAPDN_validate( dn );
|
|
}
|
|
|
|
ldapava_free_dn( dn );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return( LDAP_INVALID_SYNTAX );
|
|
}
|
|
|
|
return( LDAP_SUCCESS );
|
|
}
|
|
|
|
static void
|
|
AVA_Sort( LDAPRDN *rdn, int iAVA )
|
|
{
|
|
int i;
|
|
LDAPAVA *ava_in = rdn[ iAVA ][ 0 ];
|
|
|
|
for ( i = 0; i < iAVA; i++ ) {
|
|
LDAPAVA *ava = rdn[ i ][ 0 ];
|
|
int a, j;
|
|
|
|
a = strcmp( ava_in->la_attr->bv_val, ava->la_attr->bv_val );
|
|
|
|
if ( a > 0 ) {
|
|
break;
|
|
}
|
|
|
|
while ( a == 0 ) {
|
|
int v, d;
|
|
|
|
d = ava_in->la_value->bv_len - ava->la_value->bv_len;
|
|
|
|
v = memcmp( ava_in->la_value->bv_val,
|
|
ava->la_value->bv_val,
|
|
d <= 0 ? ava_in->la_value->bv_len
|
|
: ava->la_value->bv_len );
|
|
|
|
if ( v == 0 && d != 0 ) {
|
|
v = d;
|
|
}
|
|
|
|
if ( v <= 0 ) {
|
|
/*
|
|
* got it!
|
|
*/
|
|
break;
|
|
}
|
|
|
|
if ( ++i == iAVA ) {
|
|
/*
|
|
* already sorted
|
|
*/
|
|
return;
|
|
}
|
|
|
|
ava = rdn[ i ][ 0 ];
|
|
a = strcmp( ava_in->la_value->bv_val,
|
|
ava->la_value->bv_val );
|
|
}
|
|
|
|
/*
|
|
* move ahead
|
|
*/
|
|
for ( j = iAVA; j > i; j-- ) {
|
|
rdn[ j ][ 0 ] = rdn[ j - 1 ][ 0 ];
|
|
}
|
|
rdn[ i ][ 0 ] = ava_in;
|
|
|
|
return;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* In-place, schema-aware normalization / "pretty"ing of the
|
|
* structural representation of a distinguished name.
|
|
*/
|
|
static int
|
|
LDAPDN_rewrite( LDAPDN *dn, unsigned flags )
|
|
{
|
|
int iRDN;
|
|
int rc;
|
|
|
|
assert( dn );
|
|
|
|
for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
|
|
LDAPRDN *rdn = dn[ iRDN ][ 0 ];
|
|
int iAVA;
|
|
|
|
for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
|
|
LDAPAVA *ava = rdn[ iAVA ][ 0 ];
|
|
AttributeDescription *ad;
|
|
slap_syntax_transform_func *transf = NULL;
|
|
MatchingRule *mr;
|
|
struct berval *bv = NULL;
|
|
|
|
if ( ( ad = AVA_PRIVATE( ava ) ) == NULL ) {
|
|
const char *text = NULL;
|
|
|
|
rc = slap_bv2ad( ava->la_attr, &ad, &text );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
ava->la_private = ( void * )ad;
|
|
}
|
|
|
|
/*
|
|
* Replace attr oid/name with the canonical name
|
|
*/
|
|
ber_bvfree( ava->la_attr );
|
|
ava->la_attr = ber_bvdup( &ad->ad_cname );
|
|
|
|
if( flags & SLAP_LDAPDN_PRETTY ) {
|
|
transf = ad->ad_type->sat_syntax->ssyn_pretty;
|
|
mr = NULL;
|
|
} else {
|
|
transf = ad->ad_type->sat_syntax->ssyn_normalize;
|
|
mr = ad->ad_type->sat_equality;
|
|
}
|
|
|
|
if ( transf ) {
|
|
/*
|
|
* transform value by normalize/pretty function
|
|
*/
|
|
rc = ( *transf )( ad->ad_type->sat_syntax,
|
|
ava->la_value, &bv );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
if( mr && ( mr->smr_usage & SLAP_MR_DN_FOLD ) ) {
|
|
struct berval *s = bv;
|
|
|
|
bv = ber_bvstr( UTF8normalize( bv ? bv : ava->la_value,
|
|
UTF8_CASEFOLD ) );
|
|
|
|
ber_bvfree( s );
|
|
}
|
|
|
|
if( bv ) {
|
|
ber_bvfree( ava->la_value );
|
|
ava->la_value = bv;
|
|
}
|
|
|
|
AVA_Sort( rdn, iAVA );
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
dnNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *out = NULL;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, ">>> dnNormalize: <%s>\n", val->bv_val, 0, 0 );
|
|
|
|
if ( val->bv_len != 0 ) {
|
|
LDAPDN *dn = NULL;
|
|
char *dn_out = NULL;
|
|
int rc;
|
|
|
|
/*
|
|
* Go to structural representation
|
|
*/
|
|
rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/*
|
|
* Schema-aware rewrite
|
|
*/
|
|
if ( LDAPDN_rewrite( dn, 0 ) != LDAP_SUCCESS ) {
|
|
ldapava_free_dn( dn );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/*
|
|
* Back to string representation
|
|
*/
|
|
rc = ldap_dn2str( dn, &dn_out, LDAP_DN_FORMAT_LDAPV3 );
|
|
|
|
ldapava_free_dn( dn );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
out = ber_bvstr( dn_out );
|
|
|
|
} else {
|
|
out = ber_bvdup( val );
|
|
}
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "<<< dnNormalize: <%s>\n", out->bv_val, 0, 0 );
|
|
|
|
*normalized = out;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
dnPretty(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **pretty)
|
|
{
|
|
struct berval *out = NULL;
|
|
|
|
Debug( LDAP_DEBUG_TRACE, ">>> dnPretty: <%s>\n", val->bv_val, 0, 0 );
|
|
|
|
if ( val->bv_len != 0 ) {
|
|
LDAPDN *dn = NULL;
|
|
char *dn_out = NULL;
|
|
int rc;
|
|
|
|
/* FIXME: should be liberal in what we accept */
|
|
rc = ldap_str2dn( val->bv_val, &dn, LDAP_DN_FORMAT_LDAP );
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/*
|
|
* Schema-aware rewrite
|
|
*/
|
|
if ( LDAPDN_rewrite( dn, SLAP_LDAPDN_PRETTY ) != LDAP_SUCCESS ) {
|
|
ldapava_free_dn( dn );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/* FIXME: not sure why the default isn't pretty */
|
|
rc = ldap_dn2str( dn, &dn_out,
|
|
LDAP_DN_FORMAT_LDAPV3 | LDAP_DN_PRETTY );
|
|
|
|
ldapava_free_dn( dn );
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
out = ber_bvstr( dn_out );
|
|
|
|
} else {
|
|
out = ber_bvdup( val );
|
|
}
|
|
|
|
Debug( LDAP_DEBUG_TRACE, "<<< dnPretty: <%s>\n", out->bv_val, 0, 0 );
|
|
|
|
*pretty = out;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
dnMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match;
|
|
struct berval *asserted = (struct berval *) assertedValue;
|
|
|
|
match = value->bv_len - asserted->bv_len;
|
|
|
|
if ( match == 0 ) {
|
|
match = strcmp( value->bv_val, asserted->bv_val );
|
|
}
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"dnMatch: %d\n %s\n %s\n", match,
|
|
value->bv_val, asserted->bv_val ));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
|
|
match, value->bv_val, asserted->bv_val );
|
|
#endif
|
|
|
|
*matchp = match;
|
|
return( LDAP_SUCCESS );
|
|
}
|
|
|
|
#else /* !USE_LDAP_DN_PARSING */
|
|
|
|
static int
|
|
dnValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
int rc;
|
|
char *dn;
|
|
|
|
if( in->bv_len == 0 ) return LDAP_SUCCESS;
|
|
|
|
dn = ch_strdup( in->bv_val );
|
|
|
|
if( dn == NULL ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
|
|
} else if ( strlen( in->bv_val ) != in->bv_len ) {
|
|
rc = LDAP_INVALID_SYNTAX;
|
|
|
|
} else if ( dn_validate( dn ) == NULL ) {
|
|
rc = LDAP_INVALID_SYNTAX;
|
|
|
|
} else {
|
|
rc = LDAP_SUCCESS;
|
|
}
|
|
|
|
ch_free( dn );
|
|
return rc;
|
|
}
|
|
|
|
int
|
|
dnNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *out;
|
|
|
|
if ( val->bv_len != 0 ) {
|
|
char *dn;
|
|
out = ber_bvstr( UTF8normalize( val, UTF8_CASEFOLD ) );
|
|
|
|
dn = dn_validate( out->bv_val );
|
|
|
|
if( dn == NULL ) {
|
|
ber_bvfree( out );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
out->bv_val = dn;
|
|
out->bv_len = strlen( dn );
|
|
} else {
|
|
out = ber_bvdup( val );
|
|
}
|
|
|
|
*normalized = out;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
dnMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match;
|
|
struct berval *asserted = (struct berval *) assertedValue;
|
|
|
|
match = value->bv_len - asserted->bv_len;
|
|
|
|
if( match == 0 ) {
|
|
#ifdef USE_DN_NORMALIZE
|
|
match = strcmp( value->bv_val, asserted->bv_val );
|
|
#else
|
|
match = strcasecmp( value->bv_val, asserted->bv_val );
|
|
#endif
|
|
}
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"dnMatch: %d\n %s\n %s\n", match,
|
|
value->bv_val, asserted->bv_val ));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "dnMatch %d\n\t\"%s\"\n\t\"%s\"\n",
|
|
match, value->bv_val, asserted->bv_val );
|
|
#endif
|
|
|
|
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
#endif /* !USE_LDAP_DN_PARSING */
|
|
|
|
static int
|
|
nameUIDValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
int rc;
|
|
struct berval *dn;
|
|
|
|
if( in->bv_len == 0 ) return LDAP_SUCCESS;
|
|
|
|
dn = ber_bvdup( in );
|
|
|
|
if( dn->bv_val[dn->bv_len-1] == '\'' ) {
|
|
/* assume presence of optional UID */
|
|
ber_len_t i;
|
|
|
|
for(i=dn->bv_len-2; i>2; i--) {
|
|
if( dn->bv_val[i] != '0' && dn->bv_val[i] != '1' ) {
|
|
break;
|
|
}
|
|
}
|
|
if( dn->bv_val[i] != '\'' ||
|
|
dn->bv_val[i-1] != 'B' ||
|
|
dn->bv_val[i-2] != '#' ) {
|
|
ber_bvfree( dn );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/* trim the UID to allow use of dn_validate */
|
|
dn->bv_val[i-2] = '\0';
|
|
}
|
|
|
|
rc = dn_validate( dn->bv_val ) == NULL
|
|
? LDAP_INVALID_SYNTAX : LDAP_SUCCESS;
|
|
|
|
ber_bvfree( dn );
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
nameUIDNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *out = ber_bvdup( val );
|
|
|
|
if( out->bv_len != 0 ) {
|
|
char *dn;
|
|
ber_len_t dnlen;
|
|
char *uid = NULL;
|
|
ber_len_t uidlen = 0;
|
|
|
|
if( out->bv_val[out->bv_len-1] == '\'' ) {
|
|
/* assume presence of optional UID */
|
|
uid = strrchr( out->bv_val, '#' );
|
|
|
|
if( uid == NULL ) {
|
|
ber_bvfree( out );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
uidlen = out->bv_len - (out->bv_val - uid);
|
|
/* temporarily trim the UID */
|
|
*uid = '\0';
|
|
}
|
|
|
|
#ifdef USE_DN_NORMALIZE
|
|
dn = dn_normalize( out->bv_val );
|
|
#else
|
|
dn = dn_validate( out->bv_val );
|
|
#endif
|
|
|
|
if( dn == NULL ) {
|
|
ber_bvfree( out );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
dnlen = strlen(dn);
|
|
|
|
if( uidlen ) {
|
|
/* restore the separator */
|
|
*uid = '#';
|
|
/* shift the UID */
|
|
SAFEMEMCPY( &dn[dnlen], uid, uidlen );
|
|
}
|
|
|
|
out->bv_val = dn;
|
|
out->bv_len = dnlen + uidlen;
|
|
}
|
|
|
|
*normalized = out;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
inValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
/* any value allowed */
|
|
return LDAP_OTHER;
|
|
}
|
|
|
|
static int
|
|
blobValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
/* any value allowed */
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
bitStringValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
ber_len_t i;
|
|
|
|
/* very unforgiving validation, requires no normalization
|
|
* before simplistic matching
|
|
*/
|
|
if( in->bv_len < 3 ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/*
|
|
* rfc 2252 section 6.3 Bit String
|
|
* bitstring = "'" *binary-digit "'"
|
|
* binary-digit = "0" / "1"
|
|
* example: '0101111101'B
|
|
*/
|
|
|
|
if( in->bv_val[0] != '\'' ||
|
|
in->bv_val[in->bv_len-2] != '\'' ||
|
|
in->bv_val[in->bv_len-1] != 'B' )
|
|
{
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
for( i=in->bv_len-3; i>0; i-- ) {
|
|
if( in->bv_val[i] != '0' && in->bv_val[i] != '1' ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
bitStringNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
/*
|
|
* A normalized bitString is has no extaneous (leading) zero bits.
|
|
* That is, '00010'B is normalized to '10'B
|
|
* However, as a special case, '0'B requires no normalization.
|
|
*/
|
|
struct berval *newval;
|
|
char *p;
|
|
|
|
/* start at the first bit */
|
|
p = &val->bv_val[1];
|
|
|
|
/* Find the first non-zero bit */
|
|
while ( *p == '0' ) p++;
|
|
|
|
newval = (struct berval *) ch_malloc( sizeof(struct berval) );
|
|
|
|
if( *p == '\'' ) {
|
|
/* no non-zero bits */
|
|
newval->bv_val = ch_strdup("\'0\'B");
|
|
newval->bv_len = sizeof("\'0\'B") - 1;
|
|
goto done;
|
|
}
|
|
|
|
newval->bv_val = ch_malloc( val->bv_len + 1 );
|
|
|
|
newval->bv_val[0] = '\'';
|
|
newval->bv_len = 1;
|
|
|
|
for( ; *p != '\0'; p++ ) {
|
|
newval->bv_val[newval->bv_len++] = *p;
|
|
}
|
|
|
|
newval->bv_val[newval->bv_len] = '\0';
|
|
|
|
done:
|
|
*normalized = newval;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/*
|
|
* Handling boolean syntax and matching is quite rigid.
|
|
* A more flexible approach would be to allow a variety
|
|
* of strings to be normalized and prettied into TRUE
|
|
* and FALSE.
|
|
*/
|
|
static int
|
|
booleanValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
/* very unforgiving validation, requires no normalization
|
|
* before simplistic matching
|
|
*/
|
|
|
|
if( in->bv_len == 4 ) {
|
|
if( !memcmp( in->bv_val, "TRUE", 4 ) ) {
|
|
return LDAP_SUCCESS;
|
|
}
|
|
} else if( in->bv_len == 5 ) {
|
|
if( !memcmp( in->bv_val, "FALSE", 5 ) ) {
|
|
return LDAP_SUCCESS;
|
|
}
|
|
}
|
|
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
static int
|
|
booleanMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
/* simplistic matching allowed by rigid validation */
|
|
struct berval *asserted = (struct berval *) assertedValue;
|
|
*matchp = value->bv_len != asserted->bv_len;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
UTF8StringValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
ber_len_t count;
|
|
int len;
|
|
unsigned char *u = in->bv_val;
|
|
|
|
if( !in->bv_len ) return LDAP_INVALID_SYNTAX;
|
|
|
|
for( count = in->bv_len; count > 0; count-=len, u+=len ) {
|
|
/* get the length indicated by the first byte */
|
|
len = LDAP_UTF8_CHARLEN( u );
|
|
|
|
/* should not be zero */
|
|
if( len == 0 ) return LDAP_INVALID_SYNTAX;
|
|
|
|
/* make sure len corresponds with the offset
|
|
to the next character */
|
|
if( LDAP_UTF8_OFFSET( u ) != len ) return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
if( count != 0 ) return LDAP_INVALID_SYNTAX;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
UTF8StringNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *newval;
|
|
char *p, *q, *s;
|
|
|
|
newval = ch_malloc( sizeof( struct berval ) );
|
|
|
|
p = val->bv_val;
|
|
|
|
/* Ignore initial whitespace */
|
|
while ( ldap_utf8_isspace( p ) ) {
|
|
LDAP_UTF8_INCR( p );
|
|
}
|
|
|
|
if( *p == '\0' ) {
|
|
ch_free( newval );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
newval->bv_val = ch_strdup( p );
|
|
p = q = newval->bv_val;
|
|
s = NULL;
|
|
|
|
while ( *p ) {
|
|
int len;
|
|
|
|
if ( ldap_utf8_isspace( p ) ) {
|
|
len = LDAP_UTF8_COPY(q,p);
|
|
s=q;
|
|
p+=len;
|
|
q+=len;
|
|
|
|
/* Ignore the extra whitespace */
|
|
while ( ldap_utf8_isspace( p ) ) {
|
|
LDAP_UTF8_INCR( p );
|
|
}
|
|
} else {
|
|
len = LDAP_UTF8_COPY(q,p);
|
|
s=NULL;
|
|
p+=len;
|
|
q+=len;
|
|
}
|
|
}
|
|
|
|
assert( *newval->bv_val );
|
|
assert( newval->bv_val < p );
|
|
assert( q <= p );
|
|
|
|
/* cannot start with a space */
|
|
assert( !ldap_utf8_isspace(newval->bv_val) );
|
|
|
|
/*
|
|
* If the string ended in space, backup the pointer one
|
|
* position. One is enough because the above loop collapsed
|
|
* all whitespace to a single space.
|
|
*/
|
|
|
|
if ( s != NULL ) {
|
|
q = s;
|
|
}
|
|
|
|
/* cannot end with a space */
|
|
assert( !ldap_utf8_isspace( LDAP_UTF8_PREV(q) ) );
|
|
|
|
/* null terminate */
|
|
*q = '\0';
|
|
|
|
newval->bv_len = q - newval->bv_val;
|
|
*normalized = newval;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Returns Unicode cannonically normalized copy of a substring assertion
|
|
* Skipping attribute description */
|
|
SubstringsAssertion *
|
|
UTF8SubstringsassertionNormalize(
|
|
SubstringsAssertion *sa,
|
|
char casefold )
|
|
{
|
|
SubstringsAssertion *nsa;
|
|
int i;
|
|
|
|
nsa = (SubstringsAssertion *)ch_calloc( 1, sizeof(SubstringsAssertion) );
|
|
if( nsa == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
if( sa->sa_initial != NULL ) {
|
|
nsa->sa_initial = ber_bvstr( UTF8normalize( sa->sa_initial, casefold ) );
|
|
if( nsa->sa_initial == NULL ) {
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
if( sa->sa_any != NULL ) {
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
/* empty */
|
|
}
|
|
nsa->sa_any = (struct berval **)ch_malloc( (i + 1) * sizeof(struct berval *) );
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
nsa->sa_any[i] = ber_bvstr( UTF8normalize( sa->sa_any[i], casefold ) );
|
|
if( nsa->sa_any[i] == NULL ) {
|
|
goto err;
|
|
}
|
|
}
|
|
nsa->sa_any[i] = NULL;
|
|
}
|
|
|
|
if( sa->sa_final != NULL ) {
|
|
nsa->sa_final = ber_bvstr( UTF8normalize( sa->sa_final, casefold ) );
|
|
if( nsa->sa_final == NULL ) {
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
return nsa;
|
|
|
|
err:
|
|
ber_bvfree( nsa->sa_final );
|
|
ber_bvecfree( nsa->sa_any );
|
|
ber_bvfree( nsa->sa_initial );
|
|
ch_free( nsa );
|
|
return NULL;
|
|
}
|
|
|
|
/* Strip characters with the 8th bit set */
|
|
char *
|
|
strip8bitChars(
|
|
char *in )
|
|
{
|
|
char *p = in, *q;
|
|
|
|
if( in == NULL ) {
|
|
return NULL;
|
|
}
|
|
while( *p ) {
|
|
if( *p & 0x80 ) {
|
|
q = p;
|
|
while( *++q & 0x80 ) {
|
|
/* empty */
|
|
}
|
|
p = memmove(p, q, strlen(q) + 1);
|
|
} else {
|
|
p++;
|
|
}
|
|
}
|
|
return in;
|
|
}
|
|
|
|
#ifndef SLAPD_APPROX_OLDSINGLESTRING
|
|
|
|
#if defined(SLAPD_APPROX_INITIALS)
|
|
#define SLAPD_APPROX_DELIMITER "._ "
|
|
#define SLAPD_APPROX_WORDLEN 2
|
|
#else
|
|
#define SLAPD_APPROX_DELIMITER " "
|
|
#define SLAPD_APPROX_WORDLEN 1
|
|
#endif
|
|
|
|
static int
|
|
approxMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
char *val, *nval, *assertv, **values, **words, *c;
|
|
int i, count, len, nextchunk=0, nextavail=0;
|
|
size_t avlen;
|
|
|
|
/* Yes, this is necessary */
|
|
nval = UTF8normalize( value, UTF8_NOCASEFOLD );
|
|
if( nval == NULL ) {
|
|
*matchp = 1;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
strip8bitChars( nval );
|
|
|
|
/* Yes, this is necessary */
|
|
assertv = UTF8normalize( ((struct berval *)assertedValue),
|
|
UTF8_NOCASEFOLD );
|
|
if( assertv == NULL ) {
|
|
ch_free( nval );
|
|
*matchp = 1;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
strip8bitChars( assertv );
|
|
avlen = strlen( assertv );
|
|
|
|
/* Isolate how many words there are */
|
|
for( c=nval,count=1; *c; c++ ) {
|
|
c = strpbrk( c, SLAPD_APPROX_DELIMITER );
|
|
if ( c == NULL ) break;
|
|
*c = '\0';
|
|
count++;
|
|
}
|
|
|
|
/* Get a phonetic copy of each word */
|
|
words = (char **)ch_malloc( count * sizeof(char *) );
|
|
values = (char **)ch_malloc( count * sizeof(char *) );
|
|
for( c=nval,i=0; i<count; i++,c+=strlen(c)+1 ) {
|
|
words[i] = c;
|
|
values[i] = phonetic(c);
|
|
}
|
|
|
|
/* Work through the asserted value's words, to see if at least some
|
|
of the words are there, in the same order. */
|
|
len = 0;
|
|
while ( nextchunk < avlen ) {
|
|
len = strcspn( assertv + nextchunk, SLAPD_APPROX_DELIMITER);
|
|
if( len == 0 ) {
|
|
nextchunk++;
|
|
continue;
|
|
}
|
|
#if defined(SLAPD_APPROX_INITIALS)
|
|
else if( len == 1 ) {
|
|
/* Single letter words need to at least match one word's initial */
|
|
for( i=nextavail; i<count; i++ )
|
|
if( !strncasecmp( assertv+nextchunk, words[i], 1 )) {
|
|
nextavail=i+1;
|
|
break;
|
|
}
|
|
}
|
|
#endif
|
|
else {
|
|
/* Isolate the next word in the asserted value and phonetic it */
|
|
assertv[nextchunk+len] = '\0';
|
|
val = phonetic( assertv + nextchunk );
|
|
|
|
/* See if this phonetic chunk is in the remaining words of *value */
|
|
for( i=nextavail; i<count; i++ ){
|
|
if( !strcmp( val, values[i] ) ){
|
|
nextavail = i+1;
|
|
break;
|
|
}
|
|
}
|
|
ch_free( val );
|
|
}
|
|
|
|
/* This chunk in the asserted value was NOT within the *value. */
|
|
if( i >= count ) {
|
|
nextavail=-1;
|
|
break;
|
|
}
|
|
|
|
/* Go on to the next word in the asserted value */
|
|
nextchunk += len+1;
|
|
}
|
|
|
|
/* If some of the words were seen, call it a match */
|
|
if( nextavail > 0 ) {
|
|
*matchp = 0;
|
|
}
|
|
else {
|
|
*matchp = 1;
|
|
}
|
|
|
|
/* Cleanup allocs */
|
|
free( assertv );
|
|
for( i=0; i<count; i++ ) {
|
|
ch_free( values[i] );
|
|
}
|
|
ch_free( values );
|
|
ch_free( words );
|
|
ch_free( nval );
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
approxIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
char *val, *c;
|
|
int i,j, len, wordcount, keycount=0;
|
|
struct berval **newkeys, **keys=NULL;
|
|
|
|
for( j=0; values[j] != NULL; j++ ) {
|
|
/* Yes, this is necessary */
|
|
val = UTF8normalize( values[j], UTF8_NOCASEFOLD );
|
|
strip8bitChars( val );
|
|
|
|
/* Isolate how many words there are. There will be a key for each */
|
|
for( wordcount=0,c=val; *c; c++) {
|
|
len = strcspn(c, SLAPD_APPROX_DELIMITER);
|
|
if( len >= SLAPD_APPROX_WORDLEN ) wordcount++;
|
|
c+= len;
|
|
if (*c == '\0') break;
|
|
*c = '\0';
|
|
}
|
|
|
|
/* Allocate/increase storage to account for new keys */
|
|
newkeys = (struct berval **)ch_malloc( (keycount + wordcount + 1)
|
|
* sizeof(struct berval *) );
|
|
memcpy( newkeys, keys, keycount * sizeof(struct berval *) );
|
|
if( keys ) ch_free( keys );
|
|
keys = newkeys;
|
|
|
|
/* Get a phonetic copy of each word */
|
|
for( c=val,i=0; i<wordcount; c+=len+1 ) {
|
|
len = strlen( c );
|
|
if( len < SLAPD_APPROX_WORDLEN ) continue;
|
|
keys[keycount] = (struct berval *)ch_malloc( sizeof(struct berval) );
|
|
keys[keycount]->bv_val = phonetic( c );
|
|
keys[keycount]->bv_len = strlen( keys[keycount]->bv_val );
|
|
keycount++;
|
|
i++;
|
|
}
|
|
|
|
free( val );
|
|
}
|
|
keys[keycount] = NULL;
|
|
*keysp = keys;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
approxFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
char *val, *c;
|
|
int i, count, len;
|
|
struct berval **keys;
|
|
|
|
/* Yes, this is necessary */
|
|
val = UTF8normalize( ((struct berval *)assertValue),
|
|
UTF8_NOCASEFOLD );
|
|
if( val == NULL ) {
|
|
keys = (struct berval **)ch_malloc( sizeof(struct berval *) );
|
|
keys[0] = NULL;
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
strip8bitChars( val );
|
|
|
|
/* Isolate how many words there are. There will be a key for each */
|
|
for( count=0,c=val; *c; c++) {
|
|
len = strcspn(c, SLAPD_APPROX_DELIMITER);
|
|
if( len >= SLAPD_APPROX_WORDLEN ) count++;
|
|
c+= len;
|
|
if (*c == '\0') break;
|
|
*c = '\0';
|
|
}
|
|
|
|
/* Allocate storage for new keys */
|
|
keys = (struct berval **)ch_malloc( (count + 1) * sizeof(struct berval *) );
|
|
|
|
/* Get a phonetic copy of each word */
|
|
for( c=val,i=0; i<count; c+=len+1 ) {
|
|
len = strlen(c);
|
|
if( len < SLAPD_APPROX_WORDLEN ) continue;
|
|
keys[i] = ber_bvstr( phonetic( c ) );
|
|
i++;
|
|
}
|
|
|
|
free( val );
|
|
|
|
keys[count] = NULL;
|
|
*keysp = keys;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
|
|
#else
|
|
/* No other form of Approximate Matching is defined */
|
|
|
|
static int
|
|
approxMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
char *vapprox, *avapprox;
|
|
char *s, *t;
|
|
|
|
/* Yes, this is necessary */
|
|
s = UTF8normalize( value, UTF8_NOCASEFOLD );
|
|
if( s == NULL ) {
|
|
*matchp = 1;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Yes, this is necessary */
|
|
t = UTF8normalize( ((struct berval *)assertedValue),
|
|
UTF8_NOCASEFOLD );
|
|
if( t == NULL ) {
|
|
free( s );
|
|
*matchp = -1;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
vapprox = phonetic( strip8bitChars( s ) );
|
|
avapprox = phonetic( strip8bitChars( t ) );
|
|
|
|
free( s );
|
|
free( t );
|
|
|
|
*matchp = strcmp( vapprox, avapprox );
|
|
|
|
ch_free( vapprox );
|
|
ch_free( avapprox );
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int
|
|
approxIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
struct berval **keys;
|
|
char *s;
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* empty - just count them */
|
|
}
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( i > 0 );
|
|
|
|
keys = (struct berval **)ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
/* Copy each value and run it through phonetic() */
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* Yes, this is necessary */
|
|
s = UTF8normalize( values[i], UTF8_NOCASEFOLD );
|
|
|
|
/* strip 8-bit chars and run through phonetic() */
|
|
keys[i] = ber_bvstr( phonetic( strip8bitChars( s ) ) );
|
|
free( s );
|
|
}
|
|
keys[i] = NULL;
|
|
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
|
|
int
|
|
approxFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
struct berval **keys;
|
|
char *s;
|
|
|
|
keys = (struct berval **)ch_malloc( sizeof( struct berval * ) * 2 );
|
|
|
|
/* Yes, this is necessary */
|
|
s = UTF8normalize( ((struct berval *)assertValue),
|
|
UTF8_NOCASEFOLD );
|
|
if( s == NULL ) {
|
|
keys[0] = NULL;
|
|
} else {
|
|
/* strip 8-bit chars and run through phonetic() */
|
|
keys[0] = ber_bvstr( phonetic( strip8bitChars( s ) ) );
|
|
free( s );
|
|
keys[1] = NULL;
|
|
}
|
|
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
#endif
|
|
|
|
|
|
static int
|
|
caseExactMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
*matchp = UTF8normcmp( value->bv_val,
|
|
((struct berval *) assertedValue)->bv_val,
|
|
UTF8_NOCASEFOLD );
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
caseExactIgnoreSubstringsMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match = 0;
|
|
SubstringsAssertion *sub = NULL;
|
|
struct berval left;
|
|
int i;
|
|
ber_len_t inlen=0;
|
|
char *nav, casefold;
|
|
|
|
casefold = strcmp( mr->smr_oid, caseExactSubstringsMatchOID )
|
|
? UTF8_CASEFOLD : UTF8_NOCASEFOLD;
|
|
|
|
nav = UTF8normalize( value, casefold );
|
|
if( nav == NULL ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
left.bv_val = nav;
|
|
left.bv_len = strlen( nav );
|
|
|
|
sub = UTF8SubstringsassertionNormalize( assertedValue, casefold );
|
|
if( sub == NULL ) {
|
|
match = -1;
|
|
goto done;
|
|
}
|
|
|
|
/* Add up asserted input length */
|
|
if( sub->sa_initial ) {
|
|
inlen += sub->sa_initial->bv_len;
|
|
}
|
|
if( sub->sa_any ) {
|
|
for(i=0; sub->sa_any[i] != NULL; i++) {
|
|
inlen += sub->sa_any[i]->bv_len;
|
|
}
|
|
}
|
|
if( sub->sa_final ) {
|
|
inlen += sub->sa_final->bv_len;
|
|
}
|
|
|
|
if( sub->sa_initial ) {
|
|
if( inlen > left.bv_len ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncmp( sub->sa_initial->bv_val, left.bv_val,
|
|
sub->sa_initial->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
goto done;
|
|
}
|
|
|
|
left.bv_val += sub->sa_initial->bv_len;
|
|
left.bv_len -= sub->sa_initial->bv_len;
|
|
inlen -= sub->sa_initial->bv_len;
|
|
}
|
|
|
|
if( sub->sa_final ) {
|
|
if( inlen > left.bv_len ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncmp( sub->sa_final->bv_val,
|
|
&left.bv_val[left.bv_len - sub->sa_final->bv_len],
|
|
sub->sa_final->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
goto done;
|
|
}
|
|
|
|
left.bv_len -= sub->sa_final->bv_len;
|
|
inlen -= sub->sa_final->bv_len;
|
|
}
|
|
|
|
if( sub->sa_any ) {
|
|
for(i=0; sub->sa_any[i]; i++) {
|
|
ber_len_t idx;
|
|
char *p;
|
|
|
|
retry:
|
|
if( inlen > left.bv_len ) {
|
|
/* not enough length */
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
if( sub->sa_any[i]->bv_len == 0 ) {
|
|
continue;
|
|
}
|
|
|
|
p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
|
|
|
|
if( p == NULL ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
idx = p - left.bv_val;
|
|
assert( idx < left.bv_len );
|
|
|
|
if( idx >= left.bv_len ) {
|
|
/* this shouldn't happen */
|
|
free( nav );
|
|
ch_free( sub->sa_final );
|
|
ber_bvecfree( sub->sa_any );
|
|
ch_free( sub->sa_initial );
|
|
ch_free( sub );
|
|
return LDAP_OTHER;
|
|
}
|
|
|
|
left.bv_val = p;
|
|
left.bv_len -= idx;
|
|
|
|
if( sub->sa_any[i]->bv_len > left.bv_len ) {
|
|
/* not enough left */
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncmp( left.bv_val,
|
|
sub->sa_any[i]->bv_val,
|
|
sub->sa_any[i]->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
left.bv_val++;
|
|
left.bv_len--;
|
|
goto retry;
|
|
}
|
|
|
|
left.bv_val += sub->sa_any[i]->bv_len;
|
|
left.bv_len -= sub->sa_any[i]->bv_len;
|
|
inlen -= sub->sa_any[i]->bv_len;
|
|
}
|
|
}
|
|
|
|
done:
|
|
free( nav );
|
|
if( sub != NULL ) {
|
|
ber_bvfree( sub->sa_final );
|
|
ber_bvecfree( sub->sa_any );
|
|
ber_bvfree( sub->sa_initial );
|
|
ch_free( sub );
|
|
}
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int caseExactIgnoreIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
char casefold;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* empty - just count them */
|
|
}
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( i > 0 );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
casefold = strcmp( mr->smr_oid, caseExactMatchOID )
|
|
? UTF8_CASEFOLD : UTF8_NOCASEFOLD;
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
struct berval *value;
|
|
value = ber_bvstr( UTF8normalize( values[i],
|
|
casefold ) );
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
ber_bvfree( value );
|
|
|
|
keys[i] = ber_bvdup( &digest );
|
|
}
|
|
|
|
keys[i] = NULL;
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int caseExactIgnoreFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
char casefold;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value;
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
casefold = strcmp( mr->smr_oid, caseExactMatchOID )
|
|
? UTF8_CASEFOLD : UTF8_NOCASEFOLD;
|
|
|
|
value = ber_bvstr( UTF8normalize( ((struct berval *) assertValue),
|
|
casefold ) );
|
|
/* This usually happens if filter contains bad UTF8 */
|
|
if( value == NULL ) {
|
|
keys = ch_malloc( sizeof( struct berval * ) );
|
|
keys[0] = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * 2 );
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[0] = ber_bvdup( &digest );
|
|
keys[1] = NULL;
|
|
|
|
ber_bvfree( value );
|
|
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Substrings Index generation function */
|
|
int caseExactIgnoreSubstringsIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
char casefold;
|
|
ber_len_t i, nkeys;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
struct berval **nvalues;
|
|
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
nkeys=0;
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* empty - just count them */
|
|
}
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( i > 0 );
|
|
|
|
casefold = strcmp( mr->smr_oid, caseExactSubstringsMatchOID )
|
|
? UTF8_CASEFOLD : UTF8_NOCASEFOLD;
|
|
|
|
nvalues = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
nvalues[i] = ber_bvstr( UTF8normalize( values[i],
|
|
casefold ) );
|
|
}
|
|
nvalues[i] = NULL;
|
|
values = nvalues;
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* count number of indices to generate */
|
|
if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
|
|
continue;
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
|
|
( SLAP_INDEX_SUBSTR_MINLEN - 1);
|
|
} else {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
|
|
( SLAP_INDEX_SUBSTR_MINLEN - 1);
|
|
} else {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
|
|
}
|
|
}
|
|
}
|
|
|
|
if( nkeys == 0 ) {
|
|
/* no keys to generate */
|
|
*keysp = NULL;
|
|
ber_bvecfree( nvalues );
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
nkeys=0;
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
ber_len_t j,max;
|
|
struct berval *value;
|
|
|
|
if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
|
|
|
|
value = values[i];
|
|
|
|
if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
|
|
( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
|
|
{
|
|
char pre = SLAP_INDEX_SUBSTR_PREFIX;
|
|
max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
|
|
|
|
for( j=0; j<max; j++ ) {
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[j],
|
|
SLAP_INDEX_SUBSTR_MAXLEN );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
}
|
|
|
|
max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
|
|
char pre;
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
|
|
pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, j );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
|
|
pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[value->bv_len-j], j );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if( nkeys > 0 ) {
|
|
keys[nkeys] = NULL;
|
|
*keysp = keys;
|
|
} else {
|
|
ch_free( keys );
|
|
*keysp = NULL;
|
|
}
|
|
|
|
ber_bvecfree( nvalues );
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int caseExactIgnoreSubstringsFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
SubstringsAssertion *sa;
|
|
char pre, casefold;
|
|
ber_len_t nkeys = 0;
|
|
size_t slen, mlen, klen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value;
|
|
struct berval digest;
|
|
|
|
casefold = strcmp( mr->smr_oid, caseExactSubstringsMatchOID )
|
|
? UTF8_CASEFOLD : UTF8_NOCASEFOLD;
|
|
|
|
sa = UTF8SubstringsassertionNormalize( assertValue, casefold );
|
|
if( sa == NULL ) {
|
|
*keysp = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
|
|
sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
nkeys++;
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
|
|
ber_len_t i;
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
/* don't bother accounting for stepping */
|
|
nkeys += sa->sa_any[i]->bv_len -
|
|
( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
|
|
}
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
|
|
sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
nkeys++;
|
|
}
|
|
|
|
if( nkeys == 0 ) {
|
|
ber_bvfree( sa->sa_final );
|
|
ber_bvecfree( sa->sa_any );
|
|
ber_bvfree( sa->sa_initial );
|
|
ch_free( sa );
|
|
*keysp = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
|
|
nkeys = 0;
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
|
|
sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
|
|
value = sa->sa_initial;
|
|
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
|
|
ber_len_t i, j;
|
|
pre = SLAP_INDEX_SUBSTR_PREFIX;
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN;
|
|
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
continue;
|
|
}
|
|
|
|
value = sa->sa_any[i];
|
|
|
|
for(j=0;
|
|
j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
|
|
j += SLAP_INDEX_SUBSTR_STEP )
|
|
{
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[j], klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
|
|
sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
|
|
value = sa->sa_final;
|
|
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[value->bv_len-klen], klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( nkeys > 0 ) {
|
|
keys[nkeys] = NULL;
|
|
*keysp = keys;
|
|
} else {
|
|
ch_free( keys );
|
|
*keysp = NULL;
|
|
}
|
|
ber_bvfree( sa->sa_final );
|
|
ber_bvecfree( sa->sa_any );
|
|
ber_bvfree( sa->sa_initial );
|
|
ch_free( sa );
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
caseIgnoreMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
*matchp = UTF8normcmp( value->bv_val,
|
|
((struct berval *) assertedValue)->bv_val,
|
|
UTF8_CASEFOLD );
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
oidValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
ber_len_t i;
|
|
|
|
if( val->bv_len == 0 ) {
|
|
/* disallow empty strings */
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
if( OID_LEADCHAR(val->bv_val[0]) ) {
|
|
int dot = 0;
|
|
for(i=1; i < val->bv_len; i++) {
|
|
if( OID_SEPARATOR( val->bv_val[i] ) ) {
|
|
if( dot++ ) return 1;
|
|
} else if ( OID_CHAR( val->bv_val[i] ) ) {
|
|
dot = 0;
|
|
} else {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return !dot ? LDAP_SUCCESS : LDAP_INVALID_SYNTAX;
|
|
|
|
} else if( DESC_LEADCHAR(val->bv_val[0]) ) {
|
|
for(i=1; i < val->bv_len; i++) {
|
|
if( !DESC_CHAR(val->bv_val[i] ) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
static int
|
|
integerMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
char *v, *av;
|
|
int vsign=0, avsign=0;
|
|
struct berval *asserted;
|
|
ber_len_t vlen, avlen;
|
|
|
|
|
|
/* Start off pessimistic */
|
|
*matchp = 1;
|
|
|
|
/* Skip past leading spaces/zeros, and get the sign of the *value number */
|
|
v = value->bv_val;
|
|
vlen = value->bv_len;
|
|
while( vlen ) {
|
|
if( ASCII_SPACE(*v) || ( *v == '0' )) {
|
|
/* empty -- skip spaces */
|
|
}
|
|
else if ( *v == '+' ) {
|
|
vsign = 1;
|
|
}
|
|
else if ( *v == '-' ) {
|
|
vsign = -1;
|
|
}
|
|
else if ( ASCII_DIGIT(*v) ) {
|
|
if ( vsign == 0 ) vsign = 1;
|
|
vsign *= 2;
|
|
break;
|
|
}
|
|
v++;
|
|
vlen--;
|
|
}
|
|
|
|
/* Skip past leading spaces/zeros, and get the sign of the *assertedValue
|
|
number */
|
|
asserted = (struct berval *) assertedValue;
|
|
av = asserted->bv_val;
|
|
avlen = asserted->bv_len;
|
|
while( avlen ) {
|
|
if( ASCII_SPACE(*av) || ( *av == '0' )) {
|
|
/* empty -- skip spaces */
|
|
}
|
|
else if ( *av == '+' ) {
|
|
avsign = 1;
|
|
}
|
|
else if ( *av == '-' ) {
|
|
avsign = -1;
|
|
}
|
|
else if ( ASCII_DIGIT(*av) ) {
|
|
if ( avsign == 0 ) avsign = 1;
|
|
avsign *= 2;
|
|
break;
|
|
}
|
|
av++;
|
|
avlen--;
|
|
}
|
|
|
|
/* The two ?sign vars are now one of :
|
|
-2 negative non-zero number
|
|
-1 -0 \
|
|
0 0 collapse these three to 0
|
|
+1 +0 /
|
|
+2 positive non-zero number
|
|
*/
|
|
if ( abs( vsign ) == 1 ) vsign = 0;
|
|
if ( abs( avsign ) == 1 ) avsign = 0;
|
|
|
|
if( vsign != avsign ) return LDAP_SUCCESS;
|
|
|
|
/* Check the significant digits */
|
|
while( vlen && avlen ) {
|
|
if( *v != *av ) break;
|
|
v++;
|
|
vlen--;
|
|
av++;
|
|
avlen--;
|
|
}
|
|
|
|
/* If all digits compared equal, the numbers are equal */
|
|
if(( vlen == 0 ) && ( avlen == 0 )) {
|
|
*matchp = 0;
|
|
}
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
integerValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
ber_len_t i;
|
|
|
|
if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
|
|
|
|
if(( val->bv_val[0] == '+' ) || ( val->bv_val[0] == '-' )) {
|
|
if( val->bv_len < 2 ) return LDAP_INVALID_SYNTAX;
|
|
} else if( !ASCII_DIGIT(val->bv_val[0]) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
for( i=1; i < val->bv_len; i++ ) {
|
|
if( !ASCII_DIGIT(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
integerNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
char *p;
|
|
int negative=0;
|
|
struct berval *newval;
|
|
ber_len_t len;
|
|
|
|
|
|
p = val->bv_val;
|
|
len = val->bv_len;
|
|
|
|
/* Ignore leading spaces */
|
|
while ( len && ( *p == ' ' )) {
|
|
p++;
|
|
len--;
|
|
}
|
|
|
|
/* save sign */
|
|
if( len ) {
|
|
negative = ( *p == '-' );
|
|
if(( *p == '-' ) || ( *p == '+' )) {
|
|
p++;
|
|
len--;
|
|
}
|
|
}
|
|
|
|
/* Ignore leading zeros */
|
|
while ( len && ( *p == '0' )) {
|
|
p++;
|
|
len--;
|
|
}
|
|
|
|
newval = (struct berval *) ch_malloc( sizeof(struct berval) );
|
|
|
|
/* If there are no non-zero digits left, the number is zero, otherwise
|
|
allocate space for the number and copy it into the buffer */
|
|
if( len == 0 ) {
|
|
newval->bv_val = ch_strdup("0");
|
|
newval->bv_len = 1;
|
|
}
|
|
else {
|
|
newval->bv_len = len+negative;
|
|
newval->bv_val = ch_malloc( newval->bv_len );
|
|
if( negative ) {
|
|
newval->bv_val[0] = '-';
|
|
}
|
|
memcpy( newval->bv_val + negative, p, len );
|
|
}
|
|
|
|
*normalized = newval;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int integerIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
struct berval **keys;
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( values != NULL && values[0] != NULL );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* empty -- just count them */
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
integerNormalize( syntax, values[i], &keys[i] );
|
|
}
|
|
|
|
keys[i] = NULL;
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int integerFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
struct berval **keys;
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * 2 );
|
|
integerNormalize( syntax, assertValue, &keys[0] );
|
|
keys[1] = NULL;
|
|
*keysp = keys;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
|
|
static int
|
|
countryStringValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
if( val->bv_len != 2 ) return LDAP_INVALID_SYNTAX;
|
|
|
|
if( !SLAP_PRINTABLE(val->bv_val[0]) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
if( !SLAP_PRINTABLE(val->bv_val[1]) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
printableStringValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
ber_len_t i;
|
|
|
|
if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
|
|
|
|
for(i=0; i < val->bv_len; i++) {
|
|
if( !SLAP_PRINTABLE(val->bv_val[i]) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
printablesStringValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
ber_len_t i;
|
|
|
|
if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
|
|
|
|
for(i=0; i < val->bv_len; i++) {
|
|
if( !SLAP_PRINTABLES(val->bv_val[i]) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
IA5StringValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
ber_len_t i;
|
|
|
|
if( !val->bv_len ) return LDAP_INVALID_SYNTAX;
|
|
|
|
for(i=0; i < val->bv_len; i++) {
|
|
if( !isascii(val->bv_val[i]) ) return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
IA5StringNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *newval;
|
|
char *p, *q;
|
|
|
|
newval = ch_malloc( sizeof( struct berval ) );
|
|
|
|
p = val->bv_val;
|
|
|
|
/* Ignore initial whitespace */
|
|
while ( ASCII_SPACE( *p ) ) {
|
|
p++;
|
|
}
|
|
|
|
if( *p == '\0' ) {
|
|
ch_free( newval );
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
newval->bv_val = ch_strdup( p );
|
|
p = q = newval->bv_val;
|
|
|
|
while ( *p ) {
|
|
if ( ASCII_SPACE( *p ) ) {
|
|
*q++ = *p++;
|
|
|
|
/* Ignore the extra whitespace */
|
|
while ( ASCII_SPACE( *p ) ) {
|
|
p++;
|
|
}
|
|
} else {
|
|
*q++ = *p++;
|
|
}
|
|
}
|
|
|
|
assert( *newval->bv_val );
|
|
assert( newval->bv_val < p );
|
|
assert( q <= p );
|
|
|
|
/* cannot start with a space */
|
|
assert( !ASCII_SPACE(*newval->bv_val) );
|
|
|
|
/*
|
|
* If the string ended in space, backup the pointer one
|
|
* position. One is enough because the above loop collapsed
|
|
* all whitespace to a single space.
|
|
*/
|
|
|
|
if ( ASCII_SPACE( q[-1] ) ) {
|
|
--q;
|
|
}
|
|
|
|
/* cannot end with a space */
|
|
assert( !ASCII_SPACE( q[-1] ) );
|
|
|
|
/* null terminate */
|
|
*q = '\0';
|
|
|
|
newval->bv_len = q - newval->bv_val;
|
|
*normalized = newval;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
caseExactIA5Match(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
|
|
|
|
if( match == 0 ) {
|
|
match = strncmp( value->bv_val,
|
|
((struct berval *) assertedValue)->bv_val,
|
|
value->bv_len );
|
|
}
|
|
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
caseExactIA5SubstringsMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match = 0;
|
|
SubstringsAssertion *sub = assertedValue;
|
|
struct berval left = *value;
|
|
int i;
|
|
ber_len_t inlen=0;
|
|
|
|
/* Add up asserted input length */
|
|
if( sub->sa_initial ) {
|
|
inlen += sub->sa_initial->bv_len;
|
|
}
|
|
if( sub->sa_any ) {
|
|
for(i=0; sub->sa_any[i] != NULL; i++) {
|
|
inlen += sub->sa_any[i]->bv_len;
|
|
}
|
|
}
|
|
if( sub->sa_final ) {
|
|
inlen += sub->sa_final->bv_len;
|
|
}
|
|
|
|
if( sub->sa_initial ) {
|
|
if( inlen > left.bv_len ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncmp( sub->sa_initial->bv_val, left.bv_val,
|
|
sub->sa_initial->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
goto done;
|
|
}
|
|
|
|
left.bv_val += sub->sa_initial->bv_len;
|
|
left.bv_len -= sub->sa_initial->bv_len;
|
|
inlen -= sub->sa_initial->bv_len;
|
|
}
|
|
|
|
if( sub->sa_final ) {
|
|
if( inlen > left.bv_len ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncmp( sub->sa_final->bv_val,
|
|
&left.bv_val[left.bv_len - sub->sa_final->bv_len],
|
|
sub->sa_final->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
goto done;
|
|
}
|
|
|
|
left.bv_len -= sub->sa_final->bv_len;
|
|
inlen -= sub->sa_final->bv_len;
|
|
}
|
|
|
|
if( sub->sa_any ) {
|
|
for(i=0; sub->sa_any[i]; i++) {
|
|
ber_len_t idx;
|
|
char *p;
|
|
|
|
retry:
|
|
if( inlen > left.bv_len ) {
|
|
/* not enough length */
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
if( sub->sa_any[i]->bv_len == 0 ) {
|
|
continue;
|
|
}
|
|
|
|
p = strchr( left.bv_val, *sub->sa_any[i]->bv_val );
|
|
|
|
if( p == NULL ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
idx = p - left.bv_val;
|
|
assert( idx < left.bv_len );
|
|
|
|
if( idx >= left.bv_len ) {
|
|
/* this shouldn't happen */
|
|
return LDAP_OTHER;
|
|
}
|
|
|
|
left.bv_val = p;
|
|
left.bv_len -= idx;
|
|
|
|
if( sub->sa_any[i]->bv_len > left.bv_len ) {
|
|
/* not enough left */
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncmp( left.bv_val,
|
|
sub->sa_any[i]->bv_val,
|
|
sub->sa_any[i]->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
left.bv_val++;
|
|
left.bv_len--;
|
|
goto retry;
|
|
}
|
|
|
|
left.bv_val += sub->sa_any[i]->bv_len;
|
|
left.bv_len -= sub->sa_any[i]->bv_len;
|
|
inlen -= sub->sa_any[i]->bv_len;
|
|
}
|
|
}
|
|
|
|
done:
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int caseExactIA5Indexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* empty - just count them */
|
|
}
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( i > 0 );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
struct berval *value = values[i];
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[i] = ber_bvdup( &digest );
|
|
}
|
|
|
|
keys[i] = NULL;
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int caseExactIA5Filter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value;
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
value = (struct berval *) assertValue;
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * 2 );
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[0] = ber_bvdup( &digest );
|
|
keys[1] = NULL;
|
|
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Substrings Index generation function */
|
|
int caseExactIA5SubstringsIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
ber_len_t i, nkeys;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( values != NULL && values[0] != NULL );
|
|
|
|
nkeys=0;
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* count number of indices to generate */
|
|
if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
|
|
continue;
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
|
|
( SLAP_INDEX_SUBSTR_MINLEN - 1);
|
|
} else {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
|
|
( SLAP_INDEX_SUBSTR_MINLEN - 1);
|
|
} else {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
|
|
}
|
|
}
|
|
}
|
|
|
|
if( nkeys == 0 ) {
|
|
/* no keys to generate */
|
|
*keysp = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
nkeys=0;
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
ber_len_t j,max;
|
|
struct berval *value;
|
|
|
|
value = values[i];
|
|
if( value->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
|
|
|
|
if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
|
|
( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
|
|
{
|
|
char pre = SLAP_INDEX_SUBSTR_PREFIX;
|
|
max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
|
|
|
|
for( j=0; j<max; j++ ) {
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[j],
|
|
SLAP_INDEX_SUBSTR_MAXLEN );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
}
|
|
|
|
max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
|
|
char pre;
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
|
|
pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, j );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
|
|
pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[value->bv_len-j], j );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
if( nkeys > 0 ) {
|
|
keys[nkeys] = NULL;
|
|
*keysp = keys;
|
|
} else {
|
|
ch_free( keys );
|
|
*keysp = NULL;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int caseExactIA5SubstringsFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
SubstringsAssertion *sa = assertValue;
|
|
char pre;
|
|
ber_len_t nkeys = 0;
|
|
size_t slen, mlen, klen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value;
|
|
struct berval digest;
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
|
|
sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
nkeys++;
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
|
|
ber_len_t i;
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
/* don't bother accounting for stepping */
|
|
nkeys += sa->sa_any[i]->bv_len -
|
|
( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
|
|
}
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
|
|
sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
nkeys++;
|
|
}
|
|
|
|
if( nkeys == 0 ) {
|
|
*keysp = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
|
|
nkeys = 0;
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL && sa->sa_initial != NULL &&
|
|
sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
|
|
value = sa->sa_initial;
|
|
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY && sa->sa_any != NULL ) {
|
|
ber_len_t i, j;
|
|
pre = SLAP_INDEX_SUBSTR_PREFIX;
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN;
|
|
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
continue;
|
|
}
|
|
|
|
value = sa->sa_any[i];
|
|
|
|
for(j=0;
|
|
j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
|
|
j += SLAP_INDEX_SUBSTR_STEP )
|
|
{
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[j], klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL && sa->sa_final != NULL &&
|
|
sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
|
|
value = sa->sa_final;
|
|
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[value->bv_len-klen], klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( nkeys > 0 ) {
|
|
keys[nkeys] = NULL;
|
|
*keysp = keys;
|
|
} else {
|
|
ch_free( keys );
|
|
*keysp = NULL;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
caseIgnoreIA5Match(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match = value->bv_len - ((struct berval *) assertedValue)->bv_len;
|
|
|
|
if( match == 0 && value->bv_len ) {
|
|
match = strncasecmp( value->bv_val,
|
|
((struct berval *) assertedValue)->bv_val,
|
|
value->bv_len );
|
|
}
|
|
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
caseIgnoreIA5SubstringsMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int match = 0;
|
|
SubstringsAssertion *sub = assertedValue;
|
|
struct berval left = *value;
|
|
int i;
|
|
ber_len_t inlen=0;
|
|
|
|
/* Add up asserted input length */
|
|
if( sub->sa_initial ) {
|
|
inlen += sub->sa_initial->bv_len;
|
|
}
|
|
if( sub->sa_any ) {
|
|
for(i=0; sub->sa_any[i] != NULL; i++) {
|
|
inlen += sub->sa_any[i]->bv_len;
|
|
}
|
|
}
|
|
if( sub->sa_final ) {
|
|
inlen += sub->sa_final->bv_len;
|
|
}
|
|
|
|
if( sub->sa_initial ) {
|
|
if( inlen > left.bv_len ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncasecmp( sub->sa_initial->bv_val, left.bv_val,
|
|
sub->sa_initial->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
goto done;
|
|
}
|
|
|
|
left.bv_val += sub->sa_initial->bv_len;
|
|
left.bv_len -= sub->sa_initial->bv_len;
|
|
inlen -= sub->sa_initial->bv_len;
|
|
}
|
|
|
|
if( sub->sa_final ) {
|
|
if( inlen > left.bv_len ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncasecmp( sub->sa_final->bv_val,
|
|
&left.bv_val[left.bv_len - sub->sa_final->bv_len],
|
|
sub->sa_final->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
goto done;
|
|
}
|
|
|
|
left.bv_len -= sub->sa_final->bv_len;
|
|
inlen -= sub->sa_final->bv_len;
|
|
}
|
|
|
|
if( sub->sa_any ) {
|
|
for(i=0; sub->sa_any[i]; i++) {
|
|
ber_len_t idx;
|
|
char *p;
|
|
|
|
retry:
|
|
if( inlen > left.bv_len ) {
|
|
/* not enough length */
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
if( sub->sa_any[i]->bv_len == 0 ) {
|
|
continue;
|
|
}
|
|
|
|
p = strcasechr( left.bv_val, *sub->sa_any[i]->bv_val );
|
|
|
|
if( p == NULL ) {
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
idx = p - left.bv_val;
|
|
assert( idx < left.bv_len );
|
|
|
|
if( idx >= left.bv_len ) {
|
|
/* this shouldn't happen */
|
|
return LDAP_OTHER;
|
|
}
|
|
|
|
left.bv_val = p;
|
|
left.bv_len -= idx;
|
|
|
|
if( sub->sa_any[i]->bv_len > left.bv_len ) {
|
|
/* not enough left */
|
|
match = 1;
|
|
goto done;
|
|
}
|
|
|
|
match = strncasecmp( left.bv_val,
|
|
sub->sa_any[i]->bv_val,
|
|
sub->sa_any[i]->bv_len );
|
|
|
|
if( match != 0 ) {
|
|
left.bv_val++;
|
|
left.bv_len--;
|
|
|
|
goto retry;
|
|
}
|
|
|
|
left.bv_val += sub->sa_any[i]->bv_len;
|
|
left.bv_len -= sub->sa_any[i]->bv_len;
|
|
inlen -= sub->sa_any[i]->bv_len;
|
|
}
|
|
}
|
|
|
|
done:
|
|
*matchp = match;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int caseIgnoreIA5Indexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( values != NULL && values[0] != NULL );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* just count them */
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
struct berval *value = ber_bvdup( values[i] );
|
|
ldap_pvt_str2upper( value->bv_val );
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
ber_bvfree( value );
|
|
|
|
keys[i] = ber_bvdup( &digest );
|
|
}
|
|
|
|
keys[i] = NULL;
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
int caseIgnoreIA5Filter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value;
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
value = ber_bvdup( (struct berval *) assertValue );
|
|
ldap_pvt_str2upper( value->bv_val );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * 2 );
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, value->bv_len );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[0] = ber_bvdup( &digest );
|
|
keys[1] = NULL;
|
|
|
|
ber_bvfree( value );
|
|
|
|
*keysp = keys;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Substrings Index generation function */
|
|
int caseIgnoreIA5SubstringsIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
ber_len_t i, nkeys;
|
|
size_t slen, mlen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval digest;
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( values != NULL && values[0] != NULL );
|
|
|
|
nkeys=0;
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* count number of indices to generate */
|
|
if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) {
|
|
continue;
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
|
|
( SLAP_INDEX_SUBSTR_MINLEN - 1);
|
|
} else {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_ANY ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
|
|
}
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
|
|
if( values[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
nkeys += SLAP_INDEX_SUBSTR_MAXLEN -
|
|
( SLAP_INDEX_SUBSTR_MINLEN - 1);
|
|
} else {
|
|
nkeys += values[i]->bv_len - ( SLAP_INDEX_SUBSTR_MINLEN - 1 );
|
|
}
|
|
}
|
|
}
|
|
|
|
if( nkeys == 0 ) {
|
|
/* no keys to generate */
|
|
*keysp = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
nkeys=0;
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
int j,max;
|
|
struct berval *value;
|
|
|
|
if( values[i]->bv_len < SLAP_INDEX_SUBSTR_MINLEN ) continue;
|
|
|
|
value = ber_bvdup( values[i] );
|
|
ldap_pvt_str2upper( value->bv_val );
|
|
|
|
if( ( flags & SLAP_INDEX_SUBSTR_ANY ) &&
|
|
( value->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) )
|
|
{
|
|
char pre = SLAP_INDEX_SUBSTR_PREFIX;
|
|
max = value->bv_len - ( SLAP_INDEX_SUBSTR_MAXLEN - 1);
|
|
|
|
for( j=0; j<max; j++ ) {
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[j],
|
|
SLAP_INDEX_SUBSTR_MAXLEN );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
}
|
|
|
|
max = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
for( j=SLAP_INDEX_SUBSTR_MINLEN; j<=max; j++ ) {
|
|
char pre;
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_INITIAL ) {
|
|
pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, j );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( flags & SLAP_INDEX_SUBSTR_FINAL ) {
|
|
pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[value->bv_len-j], j );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
}
|
|
|
|
ber_bvfree( value );
|
|
}
|
|
|
|
if( nkeys > 0 ) {
|
|
keys[nkeys] = NULL;
|
|
*keysp = keys;
|
|
} else {
|
|
ch_free( keys );
|
|
*keysp = NULL;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
int caseIgnoreIA5SubstringsFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
SubstringsAssertion *sa = assertValue;
|
|
char pre;
|
|
ber_len_t nkeys = 0;
|
|
size_t slen, mlen, klen;
|
|
struct berval **keys;
|
|
HASH_CONTEXT HASHcontext;
|
|
unsigned char HASHdigest[HASH_BYTES];
|
|
struct berval *value;
|
|
struct berval digest;
|
|
|
|
if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
|
|
sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
nkeys++;
|
|
}
|
|
|
|
if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
|
|
ber_len_t i;
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
if( sa->sa_any[i]->bv_len >= SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
/* don't bother accounting for stepping */
|
|
nkeys += sa->sa_any[i]->bv_len -
|
|
( SLAP_INDEX_SUBSTR_MAXLEN - 1 );
|
|
}
|
|
}
|
|
}
|
|
|
|
if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
|
|
sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
nkeys++;
|
|
}
|
|
|
|
if( nkeys == 0 ) {
|
|
*keysp = NULL;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
digest.bv_val = HASHdigest;
|
|
digest.bv_len = sizeof(HASHdigest);
|
|
|
|
slen = strlen( syntax->ssyn_oid );
|
|
mlen = strlen( mr->smr_oid );
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (nkeys+1) );
|
|
nkeys = 0;
|
|
|
|
if((flags & SLAP_INDEX_SUBSTR_INITIAL) && sa->sa_initial != NULL &&
|
|
sa->sa_initial->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
pre = SLAP_INDEX_SUBSTR_INITIAL_PREFIX;
|
|
value = ber_bvdup( sa->sa_initial );
|
|
ldap_pvt_str2upper( value->bv_val );
|
|
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
value->bv_val, klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
ber_bvfree( value );
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if((flags & SLAP_INDEX_SUBSTR_ANY) && sa->sa_any != NULL ) {
|
|
ber_len_t i, j;
|
|
pre = SLAP_INDEX_SUBSTR_PREFIX;
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN;
|
|
|
|
for( i=0; sa->sa_any[i] != NULL; i++ ) {
|
|
if( sa->sa_any[i]->bv_len < SLAP_INDEX_SUBSTR_MAXLEN ) {
|
|
continue;
|
|
}
|
|
|
|
value = ber_bvdup( sa->sa_any[i] );
|
|
ldap_pvt_str2upper( value->bv_val );
|
|
|
|
for(j=0;
|
|
j <= value->bv_len - SLAP_INDEX_SUBSTR_MAXLEN;
|
|
j += SLAP_INDEX_SUBSTR_STEP )
|
|
{
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[j], klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
ber_bvfree( value );
|
|
}
|
|
}
|
|
|
|
if((flags & SLAP_INDEX_SUBSTR_FINAL) && sa->sa_final != NULL &&
|
|
sa->sa_final->bv_len >= SLAP_INDEX_SUBSTR_MINLEN )
|
|
{
|
|
pre = SLAP_INDEX_SUBSTR_FINAL_PREFIX;
|
|
value = ber_bvdup( sa->sa_final );
|
|
ldap_pvt_str2upper( value->bv_val );
|
|
|
|
klen = SLAP_INDEX_SUBSTR_MAXLEN < value->bv_len
|
|
? SLAP_INDEX_SUBSTR_MAXLEN : value->bv_len;
|
|
|
|
HASH_Init( &HASHcontext );
|
|
if( prefix != NULL && prefix->bv_len > 0 ) {
|
|
HASH_Update( &HASHcontext,
|
|
prefix->bv_val, prefix->bv_len );
|
|
}
|
|
HASH_Update( &HASHcontext,
|
|
&pre, sizeof( pre ) );
|
|
HASH_Update( &HASHcontext,
|
|
syntax->ssyn_oid, slen );
|
|
HASH_Update( &HASHcontext,
|
|
mr->smr_oid, mlen );
|
|
HASH_Update( &HASHcontext,
|
|
&value->bv_val[value->bv_len-klen], klen );
|
|
HASH_Final( HASHdigest, &HASHcontext );
|
|
|
|
ber_bvfree( value );
|
|
keys[nkeys++] = ber_bvdup( &digest );
|
|
}
|
|
|
|
if( nkeys > 0 ) {
|
|
keys[nkeys] = NULL;
|
|
*keysp = keys;
|
|
} else {
|
|
ch_free( keys );
|
|
*keysp = NULL;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
numericStringValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
ber_len_t i;
|
|
|
|
for(i=0; i < in->bv_len; i++) {
|
|
if( !SLAP_NUMERIC(in->bv_val[i]) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
numericStringNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
/* removal all spaces */
|
|
struct berval *newval;
|
|
char *p, *q;
|
|
|
|
newval = ch_malloc( sizeof( struct berval ) );
|
|
newval->bv_val = ch_malloc( val->bv_len + 1 );
|
|
|
|
p = val->bv_val;
|
|
q = newval->bv_val;
|
|
|
|
while ( *p ) {
|
|
if ( ASCII_SPACE( *p ) ) {
|
|
/* Ignore whitespace */
|
|
p++;
|
|
} else {
|
|
*q++ = *p++;
|
|
}
|
|
}
|
|
|
|
/* we should have copied no more then is in val */
|
|
assert( (q - newval->bv_val) <= (p - val->bv_val) );
|
|
|
|
/* null terminate */
|
|
*q = '\0';
|
|
|
|
newval->bv_len = q - newval->bv_val;
|
|
*normalized = newval;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
objectIdentifierFirstComponentMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
int rc = LDAP_SUCCESS;
|
|
int match;
|
|
struct berval *asserted = (struct berval *) assertedValue;
|
|
ber_len_t i;
|
|
struct berval oid;
|
|
|
|
if( value->bv_len == 0 || value->bv_val[0] != '(' /*')'*/ ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/* trim leading white space */
|
|
for( i=1; ASCII_SPACE(value->bv_val[i]) && i < value->bv_len; i++ ) {
|
|
/* empty */
|
|
}
|
|
|
|
/* grab next word */
|
|
oid.bv_val = &value->bv_val[i];
|
|
oid.bv_len = value->bv_len - i;
|
|
for( i=1; ASCII_SPACE(value->bv_val[i]) && i < oid.bv_len; i++ ) {
|
|
/* empty */
|
|
}
|
|
oid.bv_len = i;
|
|
|
|
/* insert attributeTypes, objectclass check here */
|
|
if( OID_LEADCHAR(asserted->bv_val[0]) ) {
|
|
rc = objectIdentifierMatch( &match, flags, syntax, mr, &oid, asserted );
|
|
|
|
} else {
|
|
char *stored = ch_malloc( oid.bv_len + 1 );
|
|
AC_MEMCPY( stored, oid.bv_val, oid.bv_len );
|
|
stored[oid.bv_len] = '\0';
|
|
|
|
if ( !strcmp( syntax->ssyn_oid, SLAP_SYNTAX_MATCHINGRULES_OID ) ) {
|
|
MatchingRule *asserted_mr = mr_find( asserted->bv_val );
|
|
MatchingRule *stored_mr = mr_find( stored );
|
|
|
|
if( asserted_mr == NULL ) {
|
|
rc = SLAPD_COMPARE_UNDEFINED;
|
|
} else {
|
|
match = asserted_mr != stored_mr;
|
|
}
|
|
|
|
} else if ( !strcmp( syntax->ssyn_oid,
|
|
SLAP_SYNTAX_ATTRIBUTETYPES_OID ) )
|
|
{
|
|
AttributeType *asserted_at = at_find( asserted->bv_val );
|
|
AttributeType *stored_at = at_find( stored );
|
|
|
|
if( asserted_at == NULL ) {
|
|
rc = SLAPD_COMPARE_UNDEFINED;
|
|
} else {
|
|
match = asserted_at != stored_at;
|
|
}
|
|
|
|
} else if ( !strcmp( syntax->ssyn_oid,
|
|
SLAP_SYNTAX_OBJECTCLASSES_OID ) )
|
|
{
|
|
ObjectClass *asserted_oc = oc_find( asserted->bv_val );
|
|
ObjectClass *stored_oc = oc_find( stored );
|
|
|
|
if( asserted_oc == NULL ) {
|
|
rc = SLAPD_COMPARE_UNDEFINED;
|
|
} else {
|
|
match = asserted_oc != stored_oc;
|
|
}
|
|
}
|
|
|
|
ch_free( stored );
|
|
}
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"objectIdentifierFirstComponentMatch: %d\n %s\n %s\n",
|
|
match, value->bv_val, asserted->bv_val ));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "objectIdentifierFirstComponentMatch "
|
|
"%d\n\t\"%s\"\n\t\"%s\"\n",
|
|
match, value->bv_val, asserted->bv_val );
|
|
#endif
|
|
|
|
|
|
if( rc == LDAP_SUCCESS ) *matchp = match;
|
|
return rc;
|
|
}
|
|
|
|
static int
|
|
integerBitAndMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
long lValue, lAssertedValue;
|
|
|
|
/* safe to assume integers are NUL terminated? */
|
|
lValue = strtoul(value->bv_val, NULL, 10);
|
|
if(( lValue == LONG_MIN || lValue == LONG_MAX) && errno == ERANGE )
|
|
return LDAP_CONSTRAINT_VIOLATION;
|
|
|
|
lAssertedValue = strtol(((struct berval *)assertedValue)->bv_val, NULL, 10);
|
|
if(( lAssertedValue == LONG_MIN || lAssertedValue == LONG_MAX) && errno == ERANGE )
|
|
return LDAP_CONSTRAINT_VIOLATION;
|
|
|
|
*matchp = (lValue & lAssertedValue);
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
integerBitOrMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
long lValue, lAssertedValue;
|
|
|
|
/* safe to assume integers are NUL terminated? */
|
|
lValue = strtoul(value->bv_val, NULL, 10);
|
|
if(( lValue == LONG_MIN || lValue == LONG_MAX) && errno == ERANGE )
|
|
return LDAP_CONSTRAINT_VIOLATION;
|
|
|
|
lAssertedValue = strtol(((struct berval *)assertedValue)->bv_val, NULL, 10);
|
|
if(( lAssertedValue == LONG_MIN || lAssertedValue == LONG_MAX) && errno == ERANGE )
|
|
return LDAP_CONSTRAINT_VIOLATION;
|
|
|
|
*matchp = (lValue | lAssertedValue);
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
#ifdef HAVE_TLS
|
|
#include <openssl/x509.h>
|
|
#include <openssl/err.h>
|
|
char digit[] = "0123456789";
|
|
|
|
/*
|
|
* Next function returns a string representation of a ASN1_INTEGER.
|
|
* It works for unlimited lengths.
|
|
*/
|
|
|
|
static struct berval *
|
|
asn1_integer2str(ASN1_INTEGER *a)
|
|
{
|
|
char buf[256];
|
|
char *p;
|
|
|
|
/* We work backwards, make it fill from the end of buf */
|
|
p = buf + sizeof(buf) - 1;
|
|
*p = '\0';
|
|
|
|
if ( a == NULL || a->length == 0 ) {
|
|
*--p = '0';
|
|
} else {
|
|
int i;
|
|
int n = a->length;
|
|
int base = 0;
|
|
unsigned int *copy;
|
|
|
|
/* We want to preserve the original */
|
|
copy = ch_malloc(n*sizeof(unsigned int));
|
|
for (i = 0; i<n; i++) {
|
|
copy[i] = a->data[i];
|
|
}
|
|
|
|
/*
|
|
* base indicates the index of the most significant
|
|
* byte that might be nonzero. When it goes off the
|
|
* end, we now there is nothing left to do.
|
|
*/
|
|
while (base < n) {
|
|
unsigned int carry;
|
|
|
|
carry = 0;
|
|
for (i = base; i<n; i++ ) {
|
|
copy[i] += carry*256;
|
|
carry = copy[i] % 10;
|
|
copy[i] /= 10;
|
|
}
|
|
if (p <= buf+1) {
|
|
/*
|
|
* Way too large, we need to leave
|
|
* room for sign if negative
|
|
*/
|
|
free(copy);
|
|
return NULL;
|
|
}
|
|
*--p = digit[carry];
|
|
if (copy[base] == 0)
|
|
base++;
|
|
}
|
|
free(copy);
|
|
}
|
|
|
|
if ( a->type == V_ASN1_NEG_INTEGER ) {
|
|
*--p = '-';
|
|
}
|
|
|
|
return ber_bvstrdup(p);
|
|
}
|
|
|
|
/* Get a DN in RFC2253 format from a X509_NAME internal struct */
|
|
static struct berval *
|
|
dn_openssl2ldap(X509_NAME *name)
|
|
{
|
|
char issuer_dn[1024];
|
|
BIO *bio;
|
|
|
|
bio = BIO_new(BIO_s_mem());
|
|
if ( !bio ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"dn_openssl2ldap: error creating BIO_s_mem: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL)));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "dn_openssl2ldap: "
|
|
"error creating BIO: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL), NULL, NULL );
|
|
#endif
|
|
return NULL;
|
|
}
|
|
X509_NAME_print_ex(bio, name, 0, XN_FLAG_RFC2253);
|
|
|
|
BIO_gets(bio, issuer_dn, 1024);
|
|
|
|
BIO_free(bio);
|
|
return ber_bvstrdup(issuer_dn);
|
|
}
|
|
|
|
/*
|
|
* Given a certificate in DER format, extract the corresponding
|
|
* assertion value for certificateExactMatch
|
|
*/
|
|
static int
|
|
certificateExactConvert(
|
|
struct berval * in,
|
|
struct berval ** out )
|
|
{
|
|
X509 *xcert;
|
|
unsigned char *p = in->bv_val;
|
|
struct berval *serial;
|
|
struct berval *issuer_dn;
|
|
struct berval *bv_tmp;
|
|
|
|
xcert = d2i_X509(NULL, &p, in->bv_len);
|
|
if ( !xcert ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"certificateExactConvert: error parsing cert: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL)));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "certificateExactConvert: "
|
|
"error parsing cert: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL), NULL, NULL );
|
|
#endif
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
serial = asn1_integer2str(xcert->cert_info->serialNumber);
|
|
if ( !serial ) {
|
|
X509_free(xcert);
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
issuer_dn = dn_openssl2ldap(X509_get_issuer_name(xcert));
|
|
if ( !issuer_dn ) {
|
|
X509_free(xcert);
|
|
ber_bvfree(serial);
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
/* Actually, dn_openssl2ldap returns in a normalized format, but
|
|
it is different from our normalized format */
|
|
bv_tmp = issuer_dn;
|
|
if ( dnNormalize(NULL, bv_tmp, &issuer_dn) != LDAP_SUCCESS ) {
|
|
X509_free(xcert);
|
|
ber_bvfree(serial);
|
|
ber_bvfree(bv_tmp);
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
ber_bvfree(bv_tmp);
|
|
|
|
X509_free(xcert);
|
|
|
|
*out = ch_malloc(sizeof(struct berval));
|
|
(*out)->bv_len = serial->bv_len + 3 + issuer_dn->bv_len + 1;
|
|
(*out)->bv_val = ch_malloc((*out)->bv_len);
|
|
p = (*out)->bv_val;
|
|
AC_MEMCPY(p, serial->bv_val, serial->bv_len);
|
|
p += serial->bv_len;
|
|
AC_MEMCPY(p, " $ ", 3);
|
|
p += 3;
|
|
AC_MEMCPY(p, issuer_dn->bv_val, issuer_dn->bv_len);
|
|
p += issuer_dn->bv_len;
|
|
*p++ = '\0';
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"certificateExactConvert: \n %s\n",
|
|
(*out)->bv_val));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "certificateExactConvert "
|
|
"\n\t\"%s\"\n",
|
|
(*out)->bv_val, NULL, NULL );
|
|
#endif
|
|
|
|
ber_bvfree(serial);
|
|
ber_bvfree(issuer_dn);
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
serial_and_issuer_parse(
|
|
struct berval *assertion,
|
|
struct berval **serial,
|
|
struct berval **issuer_dn
|
|
)
|
|
{
|
|
char *begin;
|
|
char *end;
|
|
char *p;
|
|
char *q;
|
|
|
|
begin = assertion->bv_val;
|
|
end = assertion->bv_val+assertion->bv_len-1;
|
|
for (p=begin; p<=end && *p != '$'; p++)
|
|
;
|
|
if ( p > end )
|
|
return LDAP_INVALID_SYNTAX;
|
|
|
|
/* p now points at the $ sign, now use begin and end to delimit the
|
|
serial number */
|
|
while (ASCII_SPACE(*begin))
|
|
begin++;
|
|
end = p-1;
|
|
while (ASCII_SPACE(*end))
|
|
end--;
|
|
|
|
q = ch_malloc( (end-begin+1)+1 );
|
|
AC_MEMCPY( q, begin, end-begin+1 );
|
|
q[end-begin+1] = '\0';
|
|
*serial = ber_bvstr(q);
|
|
|
|
/* now extract the issuer, remember p was at the dollar sign */
|
|
begin = p+1;
|
|
end = assertion->bv_val+assertion->bv_len-1;
|
|
while (ASCII_SPACE(*begin))
|
|
begin++;
|
|
/* should we trim spaces at the end too? is it safe always? */
|
|
|
|
q = ch_malloc( (end-begin+1)+1 );
|
|
AC_MEMCPY( q, begin, end-begin+1 );
|
|
q[end-begin+1] = '\0';
|
|
*issuer_dn = ber_bvstr(dn_normalize(q));
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
certificateExactMatch(
|
|
int *matchp,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *value,
|
|
void *assertedValue )
|
|
{
|
|
X509 *xcert;
|
|
unsigned char *p = value->bv_val;
|
|
struct berval *serial;
|
|
struct berval *issuer_dn;
|
|
struct berval *asserted_serial;
|
|
struct berval *asserted_issuer_dn;
|
|
int ret;
|
|
|
|
xcert = d2i_X509(NULL, &p, value->bv_len);
|
|
if ( !xcert ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"certificateExactMatch: error parsing cert: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL)));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "certificateExactMatch: "
|
|
"error parsing cert: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL), NULL, NULL );
|
|
#endif
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
serial = asn1_integer2str(xcert->cert_info->serialNumber);
|
|
issuer_dn = dn_openssl2ldap(X509_get_issuer_name(xcert));
|
|
|
|
X509_free(xcert);
|
|
|
|
serial_and_issuer_parse(assertedValue,
|
|
&asserted_serial,
|
|
&asserted_issuer_dn);
|
|
|
|
ret = integerMatch(
|
|
matchp,
|
|
flags,
|
|
slap_schema.si_syn_integer,
|
|
slap_schema.si_mr_integerMatch,
|
|
serial,
|
|
asserted_serial);
|
|
if ( ret == LDAP_SUCCESS ) {
|
|
if ( *matchp == 0 ) {
|
|
/* We need to normalize everything for dnMatch */
|
|
ret = dnMatch(
|
|
matchp,
|
|
flags,
|
|
slap_schema.si_syn_distinguishedName,
|
|
slap_schema.si_mr_distinguishedNameMatch,
|
|
issuer_dn,
|
|
asserted_issuer_dn);
|
|
}
|
|
}
|
|
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"certificateExactMatch: %d\n %s $ %s\n %s $ %s\n",
|
|
*matchp, serial->bv_val, issuer_dn->bv_val,
|
|
asserted->serial->bv_val, asserted_issuer_dn->bv_val));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "certificateExactMatch "
|
|
"%d\n\t\"%s $ %s\"\n",
|
|
*matchp, serial->bv_val, issuer_dn->bv_val );
|
|
Debug( LDAP_DEBUG_ARGS, "\t\"%s $ %s\"\n",
|
|
asserted_serial->bv_val, asserted_issuer_dn->bv_val,
|
|
NULL );
|
|
#endif
|
|
|
|
ber_bvfree(serial);
|
|
ber_bvfree(issuer_dn);
|
|
ber_bvfree(asserted_serial);
|
|
ber_bvfree(asserted_issuer_dn);
|
|
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* Index generation function
|
|
* We just index the serials, in most scenarios the issuer DN is one of
|
|
* a very small set of values.
|
|
*/
|
|
int certificateExactIndexer(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
struct berval **values,
|
|
struct berval ***keysp )
|
|
{
|
|
int i;
|
|
struct berval **keys;
|
|
X509 *xcert;
|
|
unsigned char *p;
|
|
struct berval * serial;
|
|
|
|
/* we should have at least one value at this point */
|
|
assert( values != NULL && values[0] != NULL );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
/* empty -- just count them */
|
|
}
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * (i+1) );
|
|
|
|
for( i=0; values[i] != NULL; i++ ) {
|
|
p = values[i]->bv_val;
|
|
xcert = d2i_X509(NULL, &p, values[i]->bv_len);
|
|
if ( !xcert ) {
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"certificateExactIndexer: error parsing cert: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL)));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "certificateExactIndexer: "
|
|
"error parsing cert: %s\n",
|
|
ERR_error_string(ERR_get_error(),NULL),
|
|
NULL, NULL );
|
|
#endif
|
|
/* Do we leak keys on error? */
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
serial = asn1_integer2str(xcert->cert_info->serialNumber);
|
|
X509_free(xcert);
|
|
integerNormalize( slap_schema.si_syn_integer,
|
|
serial,
|
|
&keys[i] );
|
|
ber_bvfree(serial);
|
|
#ifdef NEW_LOGGING
|
|
LDAP_LOG(( "schema", LDAP_LEVEL_ENTRY,
|
|
"certificateExactIndexer: returning: %s\n",
|
|
keys[i]->bv_val));
|
|
#else
|
|
Debug( LDAP_DEBUG_ARGS, "certificateExactIndexer: "
|
|
"returning: %s\n",
|
|
keys[i]->bv_val,
|
|
NULL, NULL );
|
|
#endif
|
|
}
|
|
|
|
keys[i] = NULL;
|
|
*keysp = keys;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
/* Index generation function */
|
|
/* We think this is always called with a value in matching rule syntax */
|
|
int certificateExactFilter(
|
|
slap_mask_t use,
|
|
slap_mask_t flags,
|
|
Syntax *syntax,
|
|
MatchingRule *mr,
|
|
struct berval *prefix,
|
|
void * assertValue,
|
|
struct berval ***keysp )
|
|
{
|
|
struct berval **keys;
|
|
struct berval *asserted_serial;
|
|
struct berval *asserted_issuer_dn;
|
|
|
|
serial_and_issuer_parse(assertValue,
|
|
&asserted_serial,
|
|
&asserted_issuer_dn);
|
|
|
|
keys = ch_malloc( sizeof( struct berval * ) * 2 );
|
|
integerNormalize( syntax, asserted_serial, &keys[0] );
|
|
keys[1] = NULL;
|
|
*keysp = keys;
|
|
|
|
ber_bvfree(asserted_serial);
|
|
ber_bvfree(asserted_issuer_dn);
|
|
return LDAP_SUCCESS;
|
|
}
|
|
#endif
|
|
|
|
static int
|
|
check_time_syntax (struct berval *val,
|
|
int start,
|
|
int *parts)
|
|
{
|
|
static int ceiling[9] = { 99, 99, 11, 30, 23, 59, 59, 12, 59 };
|
|
static int mdays[2][12] = {
|
|
/* non-leap years */
|
|
{ 30, 27, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 },
|
|
/* leap years */
|
|
{ 30, 28, 30, 29, 30, 29, 30, 30, 29, 30, 29, 30 }
|
|
};
|
|
char *p, *e;
|
|
int part, c, tzoffset, leapyear = 0 ;
|
|
|
|
if( val->bv_len == 0 ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
p = (char *)val->bv_val;
|
|
e = p + val->bv_len;
|
|
|
|
/* Ignore initial whitespace */
|
|
while ( ( p < e ) && ASCII_SPACE( *p ) ) {
|
|
p++;
|
|
}
|
|
|
|
if (e - p < 13 - (2 * start)) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
for (part = 0; part < 9; part++) {
|
|
parts[part] = 0;
|
|
}
|
|
|
|
for (part = start; part < 7; part++) {
|
|
c = *p;
|
|
if ((part == 6) && (c == 'Z' || c == '+' || c == '-')) {
|
|
part++;
|
|
break;
|
|
}
|
|
p++;
|
|
c -= '0';
|
|
if (p == e) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
if (c < 0 || c > 9) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
parts[part] = c;
|
|
|
|
c = *p++ - '0';
|
|
if (p == e) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
if (c < 0 || c > 9) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
parts[part] *= 10;
|
|
parts[part] += c;
|
|
|
|
if (part == 2 || part == 3) {
|
|
parts[part]--;
|
|
}
|
|
if (parts[part] < 0) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
if (parts[part] > ceiling[part]) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
/* leapyear check for the Gregorian calendar (year>1581) */
|
|
if (((parts[1] % 4 == 0) && (parts[1] != 0)) ||
|
|
((parts[0] % 4 == 0) && (parts[1] == 0)))
|
|
{
|
|
leapyear = 1;
|
|
}
|
|
|
|
if (parts[3] > mdays[leapyear][parts[2]]) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
c = *p++;
|
|
if (c == 'Z') {
|
|
tzoffset = 0; /* UTC */
|
|
} else if (c != '+' && c != '-') {
|
|
return LDAP_INVALID_SYNTAX;
|
|
} else {
|
|
if (c == '-') {
|
|
tzoffset = -1;
|
|
} else /* c == '+' */ {
|
|
tzoffset = 1;
|
|
}
|
|
|
|
if (p > e - 4) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
for (part = 7; part < 9; part++) {
|
|
c = *p++ - '0';
|
|
if (c < 0 || c > 9) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
parts[part] = c;
|
|
|
|
c = *p++ - '0';
|
|
if (c < 0 || c > 9) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
parts[part] *= 10;
|
|
parts[part] += c;
|
|
if (parts[part] < 0 || parts[part] > ceiling[part]) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Ignore trailing whitespace */
|
|
while ( ( p < e ) && ASCII_SPACE( *p ) ) {
|
|
p++;
|
|
}
|
|
if (p != e) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
switch ( tzoffset ) {
|
|
case -1: /* negativ offset to UTC, ie west of Greenwich */
|
|
parts[4] += parts[7];
|
|
parts[5] += parts[8];
|
|
for (part = 6; --part > 0; ) { /* offset is just hhmm, no seconds */
|
|
if (part != 3) {
|
|
c = ceiling[part];
|
|
} else {
|
|
c = mdays[leapyear][parts[2]];
|
|
}
|
|
if (parts[part] > c) {
|
|
parts[part] -= c + 1;
|
|
parts[part - 1]++;
|
|
}
|
|
}
|
|
break;
|
|
case 1: /* positive offset to UTC, ie east of Greenwich */
|
|
parts[4] -= parts[7];
|
|
parts[5] -= parts[8];
|
|
for (part = 6; --part > 0; ) {
|
|
if (part != 3) {
|
|
c = ceiling[part];
|
|
} else {
|
|
/* first arg to % needs to be non negativ */
|
|
c = mdays[leapyear][(parts[2] - 1 + 12) % 12];
|
|
}
|
|
if (parts[part] < 0) {
|
|
parts[part] += c + 1;
|
|
parts[part - 1]--;
|
|
}
|
|
}
|
|
break;
|
|
case 0: /* already UTC */
|
|
break;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
utcTimeNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *out;
|
|
int parts[9], rc;
|
|
|
|
rc = check_time_syntax(val, 1, parts);
|
|
if (rc != LDAP_SUCCESS) {
|
|
return rc;
|
|
}
|
|
|
|
*normalized = NULL;
|
|
out = ch_malloc( sizeof(struct berval) );
|
|
if( out == NULL ) {
|
|
return LBER_ERROR_MEMORY;
|
|
}
|
|
|
|
out->bv_val = ch_malloc( 14 );
|
|
if ( out->bv_val == NULL ) {
|
|
ch_free( out );
|
|
return LBER_ERROR_MEMORY;
|
|
}
|
|
|
|
sprintf( out->bv_val, "%02d%02d%02d%02d%02d%02dZ",
|
|
parts[1], parts[2] + 1, parts[3] + 1,
|
|
parts[4], parts[5], parts[6] );
|
|
out->bv_len = 13;
|
|
*normalized = out;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
utcTimeValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
int parts[9];
|
|
|
|
return check_time_syntax(in, 1, parts);
|
|
}
|
|
|
|
static int
|
|
generalizedTimeValidate(
|
|
Syntax *syntax,
|
|
struct berval *in )
|
|
{
|
|
int parts[9];
|
|
|
|
return check_time_syntax(in, 0, parts);
|
|
}
|
|
|
|
static int
|
|
generalizedTimeNormalize(
|
|
Syntax *syntax,
|
|
struct berval *val,
|
|
struct berval **normalized )
|
|
{
|
|
struct berval *out;
|
|
int parts[9], rc;
|
|
|
|
rc = check_time_syntax(val, 0, parts);
|
|
if (rc != LDAP_SUCCESS) {
|
|
return rc;
|
|
}
|
|
|
|
*normalized = NULL;
|
|
out = ch_malloc( sizeof(struct berval) );
|
|
if( out == NULL ) {
|
|
return LBER_ERROR_MEMORY;
|
|
}
|
|
|
|
out->bv_val = ch_malloc( 16 );
|
|
if ( out->bv_val == NULL ) {
|
|
ch_free( out );
|
|
return LBER_ERROR_MEMORY;
|
|
}
|
|
|
|
sprintf( out->bv_val, "%02d%02d%02d%02d%02d%02d%02dZ",
|
|
parts[0], parts[1], parts[2] + 1, parts[3] + 1,
|
|
parts[4], parts[5], parts[6] );
|
|
out->bv_len = 15;
|
|
*normalized = out;
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
nisNetgroupTripleValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
char *p, *e;
|
|
int commas = 0;
|
|
|
|
if ( val->bv_len == 0 ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
p = (char *)val->bv_val;
|
|
e = p + val->bv_len;
|
|
|
|
if ( *p != '(' /*')'*/ ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
for ( p++; ( p < e ) && ( *p != ')' ); p++ ) {
|
|
if ( *p == ',' ) {
|
|
commas++;
|
|
if ( commas > 2 ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
} else if ( !ATTR_CHAR( *p ) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
if ( ( commas != 2 ) || ( *p != /*'('*/ ')' ) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
p++;
|
|
|
|
if (p != e) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
bootParameterValidate(
|
|
Syntax *syntax,
|
|
struct berval *val )
|
|
{
|
|
char *p, *e;
|
|
|
|
if ( val->bv_len == 0 ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
p = (char *)val->bv_val;
|
|
e = p + val->bv_len;
|
|
|
|
/* key */
|
|
for (; ( p < e ) && ( *p != '=' ); p++ ) {
|
|
if ( !ATTR_CHAR( *p ) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
if ( *p != '=' ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/* server */
|
|
for ( p++; ( p < e ) && ( *p != ':' ); p++ ) {
|
|
if ( !ATTR_CHAR( *p ) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
if ( *p != ':' ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
|
|
/* path */
|
|
for ( p++; p < e; p++ ) {
|
|
if ( !ATTR_CHAR( *p ) ) {
|
|
return LDAP_INVALID_SYNTAX;
|
|
}
|
|
}
|
|
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
struct syntax_defs_rec {
|
|
char *sd_desc;
|
|
int sd_flags;
|
|
slap_syntax_validate_func *sd_validate;
|
|
slap_syntax_transform_func *sd_normalize;
|
|
slap_syntax_transform_func *sd_pretty;
|
|
#ifdef SLAPD_BINARY_CONVERSION
|
|
slap_syntax_transform_func *sd_ber2str;
|
|
slap_syntax_transform_func *sd_str2ber;
|
|
#endif
|
|
};
|
|
|
|
#define X_BINARY "X-BINARY-TRANSFER-REQUIRED 'TRUE' "
|
|
#define X_NOT_H_R "X-NOT-HUMAN-READABLE 'TRUE' "
|
|
|
|
struct syntax_defs_rec syntax_defs[] = {
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.1 DESC 'ACI Item' " X_BINARY X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.2 DESC 'Access Point' " X_NOT_H_R ")",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.3 DESC 'Attribute Type Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.4 DESC 'Audio' " X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.5 DESC 'Binary' " X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BER, berValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.6 DESC 'Bit String' )",
|
|
0, bitStringValidate, bitStringNormalize, NULL },
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.7 DESC 'Boolean' )",
|
|
0, booleanValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.8 DESC 'Certificate' "
|
|
X_BINARY X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.9 DESC 'Certificate List' "
|
|
X_BINARY X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.10 DESC 'Certificate Pair' "
|
|
X_BINARY X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.11 DESC 'Country String' )",
|
|
0, countryStringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.12 DESC 'Distinguished Name' )",
|
|
0, dnValidate, dnNormalize, dnPretty},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.13 DESC 'Data Quality' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.14 DESC 'Delivery Method' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.15 DESC 'Directory String' )",
|
|
0, UTF8StringValidate, UTF8StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.16 DESC 'DIT Content Rule Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.17 DESC 'DIT Structure Rule Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.19 DESC 'DSA Quality' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.20 DESC 'DSE Type' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.21 DESC 'Enhanced Guide' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.22 DESC 'Facsimile Telephone Number' )",
|
|
0, printablesStringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.23 DESC 'Fax' " X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BLOB, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.24 DESC 'Generalized Time' )",
|
|
0, generalizedTimeValidate, generalizedTimeNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.25 DESC 'Guide' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.26 DESC 'IA5 String' )",
|
|
0, IA5StringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.27 DESC 'Integer' )",
|
|
0, integerValidate, integerNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.28 DESC 'JPEG' " X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BLOB, blobValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.29 DESC 'Master And Shadow Access Points' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.30 DESC 'Matching Rule Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.31 DESC 'Matching Rule Use Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.32 DESC 'Mail Preference' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.33 DESC 'MHS OR Address' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.34 DESC 'Name And Optional UID' )",
|
|
0, nameUIDValidate, nameUIDNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.35 DESC 'Name Form Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.36 DESC 'Numeric String' )",
|
|
0, numericStringValidate, numericStringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.37 DESC 'Object Class Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.38 DESC 'OID' )",
|
|
0, oidValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.39 DESC 'Other Mailbox' )",
|
|
0, IA5StringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.40 DESC 'Octet String' )",
|
|
0, blobValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.41 DESC 'Postal Address' )",
|
|
0, UTF8StringValidate, UTF8StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.42 DESC 'Protocol Information' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.43 DESC 'Presentation Address' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.44 DESC 'Printable String' )",
|
|
0, printableStringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.49 DESC 'Supported Algorithm' "
|
|
X_BINARY X_NOT_H_R ")",
|
|
SLAP_SYNTAX_BINARY|SLAP_SYNTAX_BER, berValidate, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.50 DESC 'Telephone Number' )",
|
|
0, printableStringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.51 DESC 'Teletex Terminal Identifier' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.52 DESC 'Telex Number' )",
|
|
0, printablesStringValidate, IA5StringNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.53 DESC 'UTC Time' )",
|
|
0, utcTimeValidate, utcTimeNormalize, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.54 DESC 'LDAP Syntax Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.55 DESC 'Modify Rights' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.56 DESC 'LDAP Schema Definition' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.57 DESC 'LDAP Schema Description' )",
|
|
0, NULL, NULL, NULL},
|
|
{"( 1.3.6.1.4.1.1466.115.121.1.58 DESC 'Substring Assertion' )",
|
|
0, NULL, NULL, NULL},
|
|
|
|
/* RFC 2307 NIS Syntaxes */
|
|
{"( 1.3.6.1.1.1.0.0 DESC 'RFC2307 NIS Netgroup Triple' )",
|
|
0, nisNetgroupTripleValidate, NULL, NULL},
|
|
{"( 1.3.6.1.1.1.0.1 DESC 'RFC2307 Boot Parameter' )",
|
|
0, bootParameterValidate, NULL, NULL},
|
|
|
|
#ifdef HAVE_TLS
|
|
/* From PKIX */
|
|
/* These OIDs are not published yet, but will be in the next
|
|
* I-D for PKIX LDAPv3 schema as have been advanced by David
|
|
* Chadwick in private mail.
|
|
*/
|
|
{"( 1.2.826.0.1.3344810.7.1 DESC 'Serial Number and Issuer' )",
|
|
0, NULL, NULL, NULL},
|
|
#endif
|
|
|
|
/* OpenLDAP Experimental Syntaxes */
|
|
{"( 1.3.6.1.4.1.4203.666.2.1 DESC 'OpenLDAP Experimental ACI' )",
|
|
SLAP_SYNTAX_HIDE,
|
|
UTF8StringValidate /* THIS WILL CHANGE FOR NEW ACI SYNTAX */,
|
|
NULL, NULL},
|
|
|
|
/* needs updating */
|
|
{"( 1.3.6.1.4.1.4203.666.2.2 DESC 'OpenLDAP authPassword' )",
|
|
SLAP_SYNTAX_HIDE, NULL, NULL, NULL},
|
|
|
|
/* OpenLDAP Void Syntax */
|
|
{"( 1.3.6.1.4.1.4203.1.1.1 DESC 'OpenLDAP void' )" ,
|
|
SLAP_SYNTAX_HIDE, inValidate, NULL, NULL},
|
|
{NULL, 0, NULL, NULL, NULL}
|
|
};
|
|
|
|
struct mrule_defs_rec {
|
|
char * mrd_desc;
|
|
slap_mask_t mrd_usage;
|
|
slap_mr_convert_func * mrd_convert;
|
|
slap_mr_normalize_func * mrd_normalize;
|
|
slap_mr_match_func * mrd_match;
|
|
slap_mr_indexer_func * mrd_indexer;
|
|
slap_mr_filter_func * mrd_filter;
|
|
|
|
char * mrd_associated;
|
|
};
|
|
|
|
/*
|
|
* Other matching rules in X.520 that we do not use (yet):
|
|
*
|
|
* 2.5.13.9 numericStringOrderingMatch
|
|
* 2.5.13.15 integerOrderingMatch
|
|
* 2.5.13.18 octetStringOrderingMatch
|
|
* 2.5.13.19 octetStringSubstringsMatch
|
|
* 2.5.13.25 uTCTimeMatch
|
|
* 2.5.13.26 uTCTimeOrderingMatch
|
|
* 2.5.13.31 directoryStringFirstComponentMatch
|
|
* 2.5.13.32 wordMatch
|
|
* 2.5.13.33 keywordMatch
|
|
* 2.5.13.35 certificateMatch
|
|
* 2.5.13.36 certificatePairExactMatch
|
|
* 2.5.13.37 certificatePairMatch
|
|
* 2.5.13.38 certificateListExactMatch
|
|
* 2.5.13.39 certificateListMatch
|
|
* 2.5.13.40 algorithmIdentifierMatch
|
|
* 2.5.13.41 storedPrefixMatch
|
|
* 2.5.13.42 attributeCertificateMatch
|
|
* 2.5.13.43 readerAndKeyIDMatch
|
|
* 2.5.13.44 attributeIntegrityMatch
|
|
*/
|
|
|
|
struct mrule_defs_rec mrule_defs[] = {
|
|
/*
|
|
* EQUALITY matching rules must be listed after associated APPROX
|
|
* matching rules. So, we list all APPROX matching rules first.
|
|
*/
|
|
{"( " directoryStringApproxMatchOID " NAME 'directoryStringApproxMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
|
|
SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
directoryStringApproxMatch,
|
|
directoryStringApproxIndexer,
|
|
directoryStringApproxFilter,
|
|
NULL},
|
|
|
|
{"( " IA5StringApproxMatchOID " NAME 'IA5StringApproxMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
|
|
SLAP_MR_EQUALITY_APPROX | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
IA5StringApproxMatch,
|
|
IA5StringApproxIndexer,
|
|
IA5StringApproxFilter,
|
|
NULL},
|
|
|
|
/*
|
|
* Other matching rules
|
|
*/
|
|
|
|
{"( 2.5.13.0 NAME 'objectIdentifierMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
objectIdentifierMatch, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.1 NAME 'distinguishedNameMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.12 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
dnMatch, dnIndexer, dnFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.2 NAME 'caseIgnoreMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
|
|
NULL, NULL,
|
|
caseIgnoreMatch, caseExactIgnoreIndexer, caseExactIgnoreFilter,
|
|
directoryStringApproxMatchOID },
|
|
|
|
{"( 2.5.13.3 NAME 'caseIgnoreOrderingMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
|
|
SLAP_MR_ORDERING,
|
|
NULL, NULL,
|
|
caseIgnoreOrderingMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.4 NAME 'caseIgnoreSubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
|
|
SLAP_MR_SUBSTR | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
caseExactIgnoreSubstringsMatch,
|
|
caseExactIgnoreSubstringsIndexer,
|
|
caseExactIgnoreSubstringsFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.5 NAME 'caseExactMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
caseExactMatch, caseExactIgnoreIndexer, caseExactIgnoreFilter,
|
|
directoryStringApproxMatchOID },
|
|
|
|
{"( 2.5.13.6 NAME 'caseExactOrderingMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 )",
|
|
SLAP_MR_ORDERING,
|
|
NULL, NULL,
|
|
caseExactOrderingMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.7 NAME 'caseExactSubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
|
|
SLAP_MR_SUBSTR | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
caseExactIgnoreSubstringsMatch,
|
|
caseExactIgnoreSubstringsIndexer,
|
|
caseExactIgnoreSubstringsFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.8 NAME 'numericStringMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.36 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
|
|
NULL, NULL,
|
|
caseIgnoreIA5Match,
|
|
caseIgnoreIA5Indexer,
|
|
caseIgnoreIA5Filter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.10 NAME 'numericStringSubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
|
|
SLAP_MR_SUBSTR | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
caseIgnoreIA5SubstringsMatch,
|
|
caseIgnoreIA5SubstringsIndexer,
|
|
caseIgnoreIA5SubstringsFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.11 NAME 'caseIgnoreListMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.41 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
|
|
NULL, NULL,
|
|
caseIgnoreListMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.12 NAME 'caseIgnoreListSubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
|
|
SLAP_MR_SUBSTR | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
caseIgnoreListSubstringsMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.13 NAME 'booleanMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.7 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
booleanMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.14 NAME 'integerMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
integerMatch, integerIndexer, integerFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.16 NAME 'bitStringMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.6 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
bitStringMatch, bitStringIndexer, bitStringFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.17 NAME 'octetStringMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
octetStringMatch, octetStringIndexer, octetStringFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.20 NAME 'telephoneNumberMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.50 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
|
|
NULL, NULL,
|
|
telephoneNumberMatch,
|
|
telephoneNumberIndexer,
|
|
telephoneNumberFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.21 NAME 'telephoneNumberSubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.58 )",
|
|
SLAP_MR_SUBSTR | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
telephoneNumberSubstringsMatch,
|
|
telephoneNumberSubstringsIndexer,
|
|
telephoneNumberSubstringsFilter,
|
|
NULL},
|
|
|
|
{"( 2.5.13.22 NAME 'presentationAddressMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.43 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
NULL, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.23 NAME 'uniqueMemberMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.34 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
uniqueMemberMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.24 NAME 'protocolInformationMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.42 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
protocolInformationMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.27 NAME 'generalizedTimeMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
generalizedTimeMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.28 NAME 'generalizedTimeOrderingMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.24 )",
|
|
SLAP_MR_ORDERING,
|
|
NULL, NULL,
|
|
generalizedTimeOrderingMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.29 NAME 'integerFirstComponentMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
integerFirstComponentMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 2.5.13.30 NAME 'objectIdentifierFirstComponentMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.38 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
objectIdentifierFirstComponentMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
#ifdef HAVE_TLS
|
|
{"( 2.5.13.34 NAME 'certificateExactMatch' "
|
|
"SYNTAX 1.2.826.0.1.3344810.7.1 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
certificateExactConvert, NULL,
|
|
certificateExactMatch,
|
|
certificateExactIndexer, certificateExactFilter,
|
|
NULL},
|
|
#endif
|
|
|
|
{"( 1.3.6.1.4.1.1466.109.114.1 NAME 'caseExactIA5Match' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
caseExactIA5Match, caseExactIA5Indexer, caseExactIA5Filter,
|
|
IA5StringApproxMatchOID },
|
|
|
|
{"( 1.3.6.1.4.1.1466.109.114.2 NAME 'caseIgnoreIA5Match' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
|
|
SLAP_MR_EQUALITY | SLAP_MR_EXT | SLAP_MR_DN_FOLD,
|
|
NULL, NULL,
|
|
caseIgnoreIA5Match, caseIgnoreIA5Indexer, caseIgnoreIA5Filter,
|
|
IA5StringApproxMatchOID },
|
|
|
|
{"( 1.3.6.1.4.1.1466.109.114.3 NAME 'caseIgnoreIA5SubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
|
|
SLAP_MR_SUBSTR,
|
|
NULL, NULL,
|
|
caseIgnoreIA5SubstringsMatch,
|
|
caseIgnoreIA5SubstringsIndexer,
|
|
caseIgnoreIA5SubstringsFilter,
|
|
NULL},
|
|
|
|
{"( 1.3.6.1.4.1.4203.1.2.1 NAME 'caseExactIA5SubstringsMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.26 )",
|
|
SLAP_MR_SUBSTR,
|
|
NULL, NULL,
|
|
caseExactIA5SubstringsMatch,
|
|
caseExactIA5SubstringsIndexer,
|
|
caseExactIA5SubstringsFilter,
|
|
NULL},
|
|
|
|
/* needs updating */
|
|
{"( 1.3.6.1.4.1.4203.666.4.1 NAME 'authPasswordMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.40 )",
|
|
SLAP_MR_EQUALITY,
|
|
NULL, NULL,
|
|
authPasswordMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 1.3.6.1.4.1.4203.666.4.2 NAME 'OpenLDAPaciMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.4203.666.2.1 )",
|
|
SLAP_MR_EQUALITY,
|
|
NULL, NULL,
|
|
OpenLDAPaciMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 1.2.840.113556.1.4.803 NAME 'integerBitAndMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
|
|
SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
integerBitAndMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{"( 1.2.840.113556.1.4.804 NAME 'integerBitOrMatch' "
|
|
"SYNTAX 1.3.6.1.4.1.1466.115.121.1.27 )",
|
|
SLAP_MR_EXT,
|
|
NULL, NULL,
|
|
integerBitOrMatch, NULL, NULL,
|
|
NULL},
|
|
|
|
{NULL, SLAP_MR_NONE, NULL, NULL, NULL, NULL}
|
|
};
|
|
|
|
int
|
|
schema_init( void )
|
|
{
|
|
int res;
|
|
int i;
|
|
|
|
/* we should only be called once (from main) */
|
|
assert( schema_init_done == 0 );
|
|
|
|
for ( i=0; syntax_defs[i].sd_desc != NULL; i++ ) {
|
|
res = register_syntax( syntax_defs[i].sd_desc,
|
|
syntax_defs[i].sd_flags,
|
|
syntax_defs[i].sd_validate,
|
|
syntax_defs[i].sd_normalize,
|
|
syntax_defs[i].sd_pretty
|
|
#ifdef SLAPD_BINARY_CONVERSION
|
|
,
|
|
syntax_defs[i].sd_ber2str,
|
|
syntax_defs[i].sd_str2ber
|
|
#endif
|
|
);
|
|
|
|
if ( res ) {
|
|
fprintf( stderr, "schema_init: Error registering syntax %s\n",
|
|
syntax_defs[i].sd_desc );
|
|
return LDAP_OTHER;
|
|
}
|
|
}
|
|
|
|
for ( i=0; mrule_defs[i].mrd_desc != NULL; i++ ) {
|
|
if( mrule_defs[i].mrd_usage == SLAP_MR_NONE ) {
|
|
fprintf( stderr,
|
|
"schema_init: Ingoring unusable matching rule %s\n",
|
|
mrule_defs[i].mrd_desc );
|
|
continue;
|
|
}
|
|
|
|
res = register_matching_rule(
|
|
mrule_defs[i].mrd_desc,
|
|
mrule_defs[i].mrd_usage,
|
|
mrule_defs[i].mrd_convert,
|
|
mrule_defs[i].mrd_normalize,
|
|
mrule_defs[i].mrd_match,
|
|
mrule_defs[i].mrd_indexer,
|
|
mrule_defs[i].mrd_filter,
|
|
mrule_defs[i].mrd_associated );
|
|
|
|
if ( res ) {
|
|
fprintf( stderr,
|
|
"schema_init: Error registering matching rule %s\n",
|
|
mrule_defs[i].mrd_desc );
|
|
return LDAP_OTHER;
|
|
}
|
|
}
|
|
schema_init_done = 1;
|
|
return LDAP_SUCCESS;
|
|
}
|
|
|
|
void
|
|
schema_destroy( void )
|
|
{
|
|
oc_destroy();
|
|
at_destroy();
|
|
mr_destroy();
|
|
syn_destroy();
|
|
}
|