/* filterentry.c - apply a filter to an entry */
/* $OpenLDAP$ */
-/*
- * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
- * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
+/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
+ *
+ * Copyright 1998-2005 The OpenLDAP Foundation.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted only as authorized by the OpenLDAP
+ * Public License.
+ *
+ * A copy of this license is available in the file LICENSE in the
+ * top-level directory of the distribution or, alternatively, at
+ * <http://www.OpenLDAP.org/license.html>.
+ */
+/* Portions Copyright (c) 1995 Regents of the University of Michigan.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms are permitted
+ * provided that this notice is preserved and that due credit is given
+ * to the University of Michigan at Ann Arbor. The name of the University
+ * may not be used to endorse or promote products derived from this
+ * software without specific prior written permission. This software
+ * is provided ``as is'' without express or implied warranty.
*/
#include "portable.h"
test_filter(
Operation *op,
Entry *e,
- Filter *f
-)
+ Filter *f )
{
int rc;
#ifdef NEW_LOGGING
Debug( LDAP_DEBUG_FILTER, " EQUALITY\n", 0, 0, 0 );
#endif
- rc = test_ava_filter( op, e, f->f_ava,
- LDAP_FILTER_EQUALITY );
+ rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_EQUALITY );
break;
case LDAP_FILTER_SUBSTRINGS:
break;
case LDAP_FILTER_GE:
- rc = test_ava_filter( op, e, f->f_ava,
- LDAP_FILTER_GE );
+ rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_GE );
break;
case LDAP_FILTER_LE:
- rc = test_ava_filter( op, e, f->f_ava,
- LDAP_FILTER_LE );
+ rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_LE );
break;
case LDAP_FILTER_PRESENT:
#else
Debug( LDAP_DEBUG_FILTER, " PRESENT\n", 0, 0, 0 );
#endif
-
rc = test_presence_filter( op, e, f->f_desc );
break;
#else
Debug( LDAP_DEBUG_FILTER, " APPROX\n", 0, 0, 0 );
#endif
- rc = test_ava_filter( op, e, f->f_ava,
- LDAP_FILTER_APPROX );
+ rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_APPROX );
break;
case LDAP_FILTER_AND:
#else
Debug( LDAP_DEBUG_FILTER, " AND\n", 0, 0, 0 );
#endif
-
rc = test_filter_and( op, e, f->f_and );
break;
#else
Debug( LDAP_DEBUG_FILTER, " OR\n", 0, 0, 0 );
#endif
-
rc = test_filter_or( op, e, f->f_or );
break;
#else
Debug( LDAP_DEBUG_FILTER, " NOT\n", 0, 0, 0 );
#endif
-
rc = test_filter( op, e, f->f_not );
/* Flip true to false and false to true
#else
Debug( LDAP_DEBUG_FILTER, " EXT\n", 0, 0, 0 );
#endif
-
rc = test_mra_filter( op, e, f->f_mra );
break;
Debug( LDAP_DEBUG_ANY, " unknown filter type %lu\n",
f->f_choice, 0, 0 );
#endif
-
rc = LDAP_PROTOCOL_ERROR;
}
#else
Debug( LDAP_DEBUG_FILTER, "<= test_filter %d\n", rc, 0, 0 );
#endif
-
return( rc );
}
MatchingRuleAssertion *mra )
{
Attribute *a;
- void *memctx = op ? op->o_tmpmemctx : NULL;
+ void *memctx;
+ BER_MEMFREE_FN *memfree;
+
+ if ( op == NULL ) {
+ memctx = NULL;
+ memfree = slap_sl_free;
+ } else {
+ memctx = op->o_tmpmemctx;
+ memfree = op->o_tmpfree;
+ }
if ( mra->ma_desc ) {
/*
/* If ma_rule is not the same as the attribute's
* normal rule, then we can't use the a_nvals.
*/
- if (mra->ma_rule == a->a_desc->ad_type->sat_equality)
+ if (mra->ma_rule == a->a_desc->ad_type->sat_equality) {
bv = a->a_nvals;
- else
+ } else {
bv = a->a_vals;
- for ( ; bv->bv_val != NULL; bv++ )
- {
+ }
+
+ for ( ; bv->bv_val != NULL; bv++ ) {
int ret;
int rc;
const char *text;
rc = value_match( &ret, a->a_desc, mra->ma_rule, 0,
bv, &mra->ma_value, &text );
- if( rc != LDAP_SUCCESS ) {
- return rc;
- }
-
- if ( ret == 0 ) {
- return LDAP_COMPARE_TRUE;
- }
+ if( rc != LDAP_SUCCESS ) return rc;
+ if ( ret == 0 ) return LDAP_COMPARE_TRUE;
}
}
- } else {
+ } else {
/*
* No attribute description: test all
*/
rc = asserted_value_validate_normalize( a->a_desc, mra->ma_rule,
SLAP_MR_EXT|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX,
&mra->ma_value, &value, &text, memctx );
- if ( rc != LDAP_SUCCESS ) {
- continue;
- }
+ if ( rc != LDAP_SUCCESS ) continue;
/* check search access */
if ( !access_allowed( op, e,
a->a_desc, &value, ACL_SEARCH, NULL ) ) {
+ memfree( value.bv_val, memctx );
continue;
}
/* check match */
- if (mra->ma_rule == a->a_desc->ad_type->sat_equality)
+ if (mra->ma_rule == a->a_desc->ad_type->sat_equality) {
bv = a->a_nvals;
- else
+ } else {
bv = a->a_vals;
- for ( ; bv->bv_val != NULL; bv++ )
- {
+ }
+
+ for ( ; bv->bv_val != NULL; bv++ ) {
int ret;
- int rc;
rc = value_match( &ret, a->a_desc, mra->ma_rule, 0,
bv, &value, &text );
- if( rc != LDAP_SUCCESS ) {
- return rc;
- }
+ if( rc != LDAP_SUCCESS ) break;
if ( ret == 0 ) {
- return LDAP_COMPARE_TRUE;
+ rc = LDAP_COMPARE_TRUE;
+ break;
}
}
+ memfree( value.bv_val, memctx );
+ if ( rc != LDAP_SUCCESS ) return rc;
}
}
for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
LDAPAVA *ava = rdn[ iAVA ];
struct berval *bv = &ava->la_value, value;
- AttributeDescription *ad = (AttributeDescription *)ava->la_private;
+ AttributeDescription *ad =
+ (AttributeDescription *)ava->la_private;
int ret;
- int rc;
const char *text;
assert( ad );
mra->ma_rule,
SLAP_MR_EXT|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX,
&mra->ma_value, &value, &text, memctx );
- if ( rc != LDAP_SUCCESS ) {
- continue;
- }
+ if ( rc != LDAP_SUCCESS ) continue;
/* check search access */
if ( !access_allowed( op, e,
- ad, &value, ACL_SEARCH, NULL ) ) {
+ ad, &value, ACL_SEARCH, NULL ) )
+ {
+ memfree( value.bv_val, memctx );
continue;
}
}
rc = value_match( &ret, ad, mra->ma_rule, 0,
bv, &value, &text );
- if( rc != LDAP_SUCCESS ) {
- ldap_dnfree_x( dn, memctx );
- return rc;
+ if ( value.bv_val != mra->ma_value.bv_val ) {
+ memfree( value.bv_val, memctx );
}
- if ( ret == 0 ) {
+ if ( rc == LDAP_SUCCESS && ret == 0 ) rc = LDAP_COMPARE_TRUE;
+
+ if( rc != LDAP_SUCCESS ) {
ldap_dnfree_x( dn, memctx );
- return LDAP_COMPARE_TRUE;
+ return rc;
}
}
}
+ ldap_dnfree_x( dn, memctx );
}
return LDAP_COMPARE_FALSE;
Operation *op,
Entry *e,
AttributeAssertion *ava,
- int type
-)
+ int type )
{
Attribute *a;
continue;
}
- for ( bv = a->a_nvals; bv->bv_val != NULL; bv++ )
- {
+ for ( bv = a->a_nvals; bv->bv_val != NULL; bv++ ) {
int ret;
int rc;
const char *text;
rc = value_match( &ret, a->a_desc, mr, 0,
bv, &ava->aa_value, &text );
- if( rc != LDAP_SUCCESS ) {
- return rc;
- }
+ if( rc != LDAP_SUCCESS ) return rc;
switch ( type ) {
case LDAP_FILTER_EQUALITY:
case LDAP_FILTER_APPROX:
- if ( ret == 0 ) {
- return LDAP_COMPARE_TRUE;
- }
+ if ( ret == 0 ) return LDAP_COMPARE_TRUE;
break;
case LDAP_FILTER_GE:
- if ( ret >= 0 ) {
- return LDAP_COMPARE_TRUE;
- }
+ if ( ret >= 0 ) return LDAP_COMPARE_TRUE;
break;
case LDAP_FILTER_LE:
- if ( ret <= 0 ) {
- return LDAP_COMPARE_TRUE;
- }
+ if ( ret <= 0 ) return LDAP_COMPARE_TRUE;
break;
}
}
}
if ( ava->aa_desc == slap_schema.si_ad_hasSubordinates
- && op && op->o_bd && op->o_bd->be_has_subordinates ) {
+ && op && op->o_bd && op->o_bd->be_has_subordinates )
+ {
int hasSubordinates;
struct berval hs;
- /*
- * No other match should be allowed ...
- */
- assert( type == LDAP_FILTER_EQUALITY );
+ /* No other match is supported */
+ if( type != LDAP_FILTER_EQUALITY ) return LDAP_OTHER;
- if (op->o_bd->be_has_subordinates( op, e, &hasSubordinates ) != LDAP_SUCCESS) {
+ if ( op->o_bd->be_has_subordinates( op, e, &hasSubordinates ) !=
+ LDAP_SUCCESS )
+ {
return LDAP_OTHER;
}
return LDAP_OTHER;
}
- if ( bvmatch( &ava->aa_value, &hs ) ) {
- return LDAP_COMPARE_TRUE;
- }
-
+ if ( bvmatch( &ava->aa_value, &hs ) ) return LDAP_COMPARE_TRUE;
return LDAP_COMPARE_FALSE;
}
test_presence_filter(
Operation *op,
Entry *e,
- AttributeDescription *desc
-)
+ AttributeDescription *desc )
{
Attribute *a;
- if ( !access_allowed( op, e, desc, NULL, ACL_SEARCH, NULL ) )
- {
+ if ( !access_allowed( op, e, desc, NULL, ACL_SEARCH, NULL ) ) {
return LDAP_INSUFFICIENT_ACCESS;
}
a = attrs_find( e->e_attrs, desc );
-
if ( a == NULL && desc == slap_schema.si_ad_hasSubordinates ) {
/*
test_filter_and(
Operation *op,
Entry *e,
- Filter *flist
-)
+ Filter *flist )
{
Filter *f;
int rtn = LDAP_COMPARE_TRUE; /* True if empty */
Debug( LDAP_DEBUG_FILTER, "=> test_filter_or\n", 0, 0, 0 );
#endif
-
for ( f = flist; f != NULL; f = f->f_next ) {
int rc = test_filter( op, e, f );
#else
Debug( LDAP_DEBUG_FILTER, "<= test_filter_or %d\n", rtn, 0, 0 );
#endif
-
return rtn;
}
test_substrings_filter(
Operation *op,
Entry *e,
- Filter *f
-)
+ Filter *f )
{
Attribute *a;
Debug( LDAP_DEBUG_FILTER, "begin test_substrings_filter\n", 0, 0, 0 );
#endif
-
if ( !access_allowed( op, e,
f->f_sub_desc, NULL, ACL_SEARCH, NULL ) )
{
MatchingRule *mr = a->a_desc->ad_type->sat_substr;
struct berval *bv;
- if( mr == NULL ) {
- continue;
- }
+ if( mr == NULL ) continue;
- for ( bv = a->a_nvals; bv->bv_val != NULL; bv++ )
- {
+ for ( bv = a->a_nvals; bv->bv_val != NULL; bv++ ) {
int ret;
int rc;
const char *text;
rc = value_match( &ret, a->a_desc, mr, 0,
bv, f->f_sub, &text );
- if( rc != LDAP_SUCCESS ) {
- return rc;
- }
-
- if ( ret == 0 ) {
- return LDAP_COMPARE_TRUE;
- }
+ if( rc != LDAP_SUCCESS ) return rc;
+ if ( ret == 0 ) return LDAP_COMPARE_TRUE;
}
}
#ifdef NEW_LOGGING
- LDAP_LOG( FILTER, ENTRY, "test_substrings_filter: return FALSE\n", 0, 0, 0 );
+ LDAP_LOG( FILTER, ENTRY, "test_substrings_filter: return FALSE\n",
+ 0, 0, 0 );
#else
- Debug( LDAP_DEBUG_FILTER, "end test_substrings_filter 1\n", 0, 0, 0 );
+ Debug( LDAP_DEBUG_FILTER, "end test_substrings_filter 1\n",
+ 0, 0, 0 );
#endif
-
return LDAP_COMPARE_FALSE;
}
projects / openldap / blobdiff