1 /* filterentry.c - apply a filter to an entry */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
16 /* Portions Copyright (c) 1995 Regents of the University of Michigan.
17 * All rights reserved.
19 * Redistribution and use in source and binary forms are permitted
20 * provided that this notice is preserved and that due credit is given
21 * to the University of Michigan at Ann Arbor. The name of the University
22 * may not be used to endorse or promote products derived from this
23 * software without specific prior written permission. This software
24 * is provided ``as is'' without express or implied warranty.
31 #include <ac/socket.h>
32 #include <ac/string.h>
37 static int test_filter_and( Operation *op, Entry *e, Filter *flist );
38 static int test_filter_or( Operation *op, Entry *e, Filter *flist );
39 static int test_substrings_filter( Operation *op, Entry *e, Filter *f);
40 static int test_ava_filter( Operation *op,
41 Entry *e, AttributeAssertion *ava, int type );
42 static int test_mra_filter( Operation *op,
43 Entry *e, MatchingRuleAssertion *mra );
44 static int test_presence_filter( Operation *op,
45 Entry *e, AttributeDescription *desc );
49 * test_filter - test a filter against a single entry.
51 * LDAP_COMPARE_TRUE filter matched
52 * LDAP_COMPARE_FALSE filter did not match
53 * SLAPD_COMPARE_UNDEFINED filter is undefined
54 * or an ldap result code indicating error
64 Debug( LDAP_DEBUG_FILTER, "=> test_filter\n", 0, 0, 0 );
66 switch ( f->f_choice ) {
67 case SLAPD_FILTER_COMPUTED:
68 Debug( LDAP_DEBUG_FILTER, " COMPUTED %s (%d)\n",
69 f->f_result == LDAP_COMPARE_FALSE ? "false" :
70 f->f_result == LDAP_COMPARE_TRUE ? "true" :
71 f->f_result == SLAPD_COMPARE_UNDEFINED ? "undefined" : "error",
77 case LDAP_FILTER_EQUALITY:
78 Debug( LDAP_DEBUG_FILTER, " EQUALITY\n", 0, 0, 0 );
79 rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_EQUALITY );
82 case LDAP_FILTER_SUBSTRINGS:
83 Debug( LDAP_DEBUG_FILTER, " SUBSTRINGS\n", 0, 0, 0 );
84 rc = test_substrings_filter( op, e, f );
88 Debug( LDAP_DEBUG_FILTER, " GE\n", 0, 0, 0 );
89 rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_GE );
93 Debug( LDAP_DEBUG_FILTER, " LE\n", 0, 0, 0 );
94 rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_LE );
97 case LDAP_FILTER_PRESENT:
98 Debug( LDAP_DEBUG_FILTER, " PRESENT\n", 0, 0, 0 );
99 rc = test_presence_filter( op, e, f->f_desc );
102 case LDAP_FILTER_APPROX:
103 Debug( LDAP_DEBUG_FILTER, " APPROX\n", 0, 0, 0 );
104 rc = test_ava_filter( op, e, f->f_ava, LDAP_FILTER_APPROX );
107 case LDAP_FILTER_AND:
108 Debug( LDAP_DEBUG_FILTER, " AND\n", 0, 0, 0 );
109 rc = test_filter_and( op, e, f->f_and );
113 Debug( LDAP_DEBUG_FILTER, " OR\n", 0, 0, 0 );
114 rc = test_filter_or( op, e, f->f_or );
117 case LDAP_FILTER_NOT:
118 Debug( LDAP_DEBUG_FILTER, " NOT\n", 0, 0, 0 );
119 rc = test_filter( op, e, f->f_not );
121 /* Flip true to false and false to true
122 * but leave Undefined alone.
125 case LDAP_COMPARE_TRUE:
126 rc = LDAP_COMPARE_FALSE;
128 case LDAP_COMPARE_FALSE:
129 rc = LDAP_COMPARE_TRUE;
134 case LDAP_FILTER_EXT:
135 Debug( LDAP_DEBUG_FILTER, " EXT\n", 0, 0, 0 );
136 rc = test_mra_filter( op, e, f->f_mra );
140 Debug( LDAP_DEBUG_ANY, " unknown filter type %lu\n",
142 rc = LDAP_PROTOCOL_ERROR;
145 Debug( LDAP_DEBUG_FILTER, "<= test_filter %d\n", rc, 0, 0 );
149 static int test_mra_filter(
152 MatchingRuleAssertion *mra )
156 BER_MEMFREE_FN *memfree;
160 memfree = slap_sl_free;
162 memctx = op->o_tmpmemctx;
163 memfree = op->o_tmpfree;
166 #ifdef LDAP_COMP_MATCH
167 /* Component Matching */
169 mra->ma_rule->smr_usage & (SLAP_MR_COMPONENT) ){
170 return test_comp_filter_entry( op, e, mra );
173 if ( mra->ma_desc ) {
175 * if ma_desc is available, then we're filtering for
176 * one attribute, and SEARCH permissions can be checked
179 if( !access_allowed( op, e,
180 mra->ma_desc, &mra->ma_value, ACL_SEARCH, NULL ) )
182 return LDAP_INSUFFICIENT_ACCESS;
185 if ( mra->ma_desc == slap_schema.si_ad_entryDN ) {
189 rc = value_match( &ret, slap_schema.si_ad_entryDN, mra->ma_rule,
190 0, &e->e_nname, &mra->ma_value, &text );
192 if( rc != LDAP_SUCCESS ) return rc;
193 if ( ret == 0 ) return LDAP_COMPARE_TRUE;
194 return LDAP_COMPARE_FALSE;
197 for(a = attrs_find( e->e_attrs, mra->ma_desc );
199 a = attrs_find( a->a_next, mra->ma_desc ) )
202 /* If ma_rule is not the same as the attribute's
203 * normal rule, then we can't use the a_nvals.
205 if (mra->ma_rule == a->a_desc->ad_type->sat_equality) {
211 for ( ; bv->bv_val != NULL; bv++ ) {
216 rc = value_match( &ret, a->a_desc, mra->ma_rule, 0,
217 bv, &mra->ma_value, &text );
219 if( rc != LDAP_SUCCESS ) return rc;
220 if ( ret == 0 ) return LDAP_COMPARE_TRUE;
226 * No attribute description: test all
228 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
229 struct berval *bv, value;
230 const char *text = NULL;
233 /* check if matching is appropriate */
234 if ( !mr_usable_with_at( mra->ma_rule, a->a_desc->ad_type )) {
238 /* normalize for equality */
239 rc = asserted_value_validate_normalize( a->a_desc, mra->ma_rule,
240 SLAP_MR_EXT|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX,
241 &mra->ma_value, &value, &text, memctx );
242 if ( rc != LDAP_SUCCESS ) continue;
244 /* check search access */
245 if ( !access_allowed( op, e,
246 a->a_desc, &value, ACL_SEARCH, NULL ) ) {
247 memfree( value.bv_val, memctx );
252 if (mra->ma_rule == a->a_desc->ad_type->sat_equality) {
258 for ( ; bv->bv_val != NULL; bv++ ) {
261 rc = value_match( &ret, a->a_desc, mra->ma_rule, 0,
264 if( rc != LDAP_SUCCESS ) break;
267 rc = LDAP_COMPARE_TRUE;
271 memfree( value.bv_val, memctx );
272 if ( rc != LDAP_SUCCESS ) return rc;
276 /* check attrs in DN AVAs if required */
277 if ( mra->ma_dnattrs ) {
282 /* parse and pretty the dn */
283 rc = dnPrettyDN( NULL, &e->e_name, &dn, memctx );
284 if ( rc != LDAP_SUCCESS ) {
285 return LDAP_INVALID_SYNTAX;
288 /* for each AVA of each RDN ... */
289 for ( iRDN = 0; dn[ iRDN ]; iRDN++ ) {
290 LDAPRDN rdn = dn[ iRDN ];
292 for ( iAVA = 0; rdn[ iAVA ]; iAVA++ ) {
293 LDAPAVA *ava = rdn[ iAVA ];
294 struct berval *bv = &ava->la_value, value;
295 AttributeDescription *ad =
296 (AttributeDescription *)ava->la_private;
302 if ( mra->ma_desc ) {
303 /* have a mra type? check for subtype */
304 if ( !is_ad_subtype( ad, mra->ma_desc ) ) {
307 value = mra->ma_value;
310 const char *text = NULL;
312 /* check if matching is appropriate */
313 if ( !mr_usable_with_at( mra->ma_rule, ad->ad_type )) {
317 /* normalize for equality */
318 rc = asserted_value_validate_normalize( ad,
320 SLAP_MR_EXT|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX,
321 &mra->ma_value, &value, &text, memctx );
322 if ( rc != LDAP_SUCCESS ) continue;
324 /* check search access */
325 if ( !access_allowed( op, e,
326 ad, &value, ACL_SEARCH, NULL ) )
328 memfree( value.bv_val, memctx );
334 rc = value_match( &ret, ad, mra->ma_rule, 0,
337 if ( value.bv_val != mra->ma_value.bv_val ) {
338 memfree( value.bv_val, memctx );
341 if ( rc == LDAP_SUCCESS && ret == 0 ) rc = LDAP_COMPARE_TRUE;
343 if( rc != LDAP_SUCCESS ) {
344 ldap_dnfree_x( dn, memctx );
349 ldap_dnfree_x( dn, memctx );
352 return LDAP_COMPARE_FALSE;
359 AttributeAssertion *ava,
364 if ( !access_allowed( op, e,
365 ava->aa_desc, &ava->aa_value, ACL_SEARCH, NULL ) )
367 return LDAP_INSUFFICIENT_ACCESS;
370 if ( ava->aa_desc == slap_schema.si_ad_hasSubordinates
371 && op && op->o_bd && op->o_bd->be_has_subordinates )
376 if( type != LDAP_FILTER_EQUALITY &&
377 type != LDAP_FILTER_APPROX )
379 /* No other match is allowed */
383 if ( op->o_bd->be_has_subordinates( op, e, &hasSubordinates ) !=
389 if ( hasSubordinates == LDAP_COMPARE_TRUE ) {
392 } else if ( hasSubordinates == LDAP_COMPARE_FALSE ) {
399 if ( bvmatch( &ava->aa_value, &hs ) ) return LDAP_COMPARE_TRUE;
400 return LDAP_COMPARE_FALSE;
403 if ( ava->aa_desc == slap_schema.si_ad_entryDN ) {
408 if( type != LDAP_FILTER_EQUALITY &&
409 type != LDAP_FILTER_APPROX )
411 /* No other match is allowed */
415 mr = slap_schema.si_ad_entryDN->ad_type->sat_equality;
418 rc = value_match( &ret, slap_schema.si_ad_entryDN, mr, 0,
419 &e->e_nname, &ava->aa_value, &text );
421 if( rc != LDAP_SUCCESS ) return rc;
422 if( ret == 0 ) return LDAP_COMPARE_TRUE;
423 return LDAP_COMPARE_FALSE;
426 for(a = attrs_find( e->e_attrs, ava->aa_desc );
428 a = attrs_find( a->a_next, ava->aa_desc ) )
434 case LDAP_FILTER_APPROX:
435 mr = a->a_desc->ad_type->sat_approx;
436 if( mr != NULL ) break;
438 /* use EQUALITY matching rule if no APPROX rule */
440 case LDAP_FILTER_EQUALITY:
441 mr = a->a_desc->ad_type->sat_equality;
446 mr = a->a_desc->ad_type->sat_ordering;
453 if( mr == NULL ) continue;
455 for ( bv = a->a_nvals; bv->bv_val != NULL; bv++ ) {
460 rc = value_match( &ret, a->a_desc, mr, 0,
461 bv, &ava->aa_value, &text );
463 if( rc != LDAP_SUCCESS ) return rc;
466 case LDAP_FILTER_EQUALITY:
467 case LDAP_FILTER_APPROX:
468 if ( ret == 0 ) return LDAP_COMPARE_TRUE;
472 if ( ret >= 0 ) return LDAP_COMPARE_TRUE;
476 if ( ret <= 0 ) return LDAP_COMPARE_TRUE;
482 return LDAP_COMPARE_FALSE;
487 test_presence_filter(
490 AttributeDescription *desc )
494 if ( !access_allowed( op, e, desc, NULL, ACL_SEARCH, NULL ) ) {
495 return LDAP_INSUFFICIENT_ACCESS;
498 if ( desc == slap_schema.si_ad_hasSubordinates ) {
501 * XXX: fairly optimistic: if the function is defined,
502 * then PRESENCE must succeed, because hasSubordinate
503 * is boolean-valued; I think we may live with this
504 * simplification by now
506 if ( op && op->o_bd && op->o_bd->be_has_subordinates ) {
507 return LDAP_COMPARE_TRUE;
510 return LDAP_COMPARE_FALSE;
513 if ( desc == slap_schema.si_ad_entryDN ||
514 desc == slap_schema.si_ad_subschemaSubentry )
516 /* entryDN and subschemaSubentry are always present */
517 return LDAP_COMPARE_TRUE;
520 a = attrs_find( e->e_attrs, desc );
521 return a != NULL ? LDAP_COMPARE_TRUE : LDAP_COMPARE_FALSE;
532 int rtn = LDAP_COMPARE_TRUE; /* True if empty */
534 Debug( LDAP_DEBUG_FILTER, "=> test_filter_and\n", 0, 0, 0 );
536 for ( f = flist; f != NULL; f = f->f_next ) {
537 int rc = test_filter( op, e, f );
539 if ( rc == LDAP_COMPARE_FALSE ) {
540 /* filter is False */
545 if ( rc != LDAP_COMPARE_TRUE ) {
546 /* filter is Undefined unless later elements are False */
551 Debug( LDAP_DEBUG_FILTER, "<= test_filter_and %d\n", rtn, 0, 0 );
563 int rtn = LDAP_COMPARE_FALSE; /* False if empty */
565 Debug( LDAP_DEBUG_FILTER, "=> test_filter_or\n", 0, 0, 0 );
567 for ( f = flist; f != NULL; f = f->f_next ) {
568 int rc = test_filter( op, e, f );
570 if ( rc == LDAP_COMPARE_TRUE ) {
576 if ( rc != LDAP_COMPARE_FALSE ) {
577 /* filter is Undefined unless later elements are True */
582 Debug( LDAP_DEBUG_FILTER, "<= test_filter_or %d\n", rtn, 0, 0 );
588 test_substrings_filter(
595 Debug( LDAP_DEBUG_FILTER, "begin test_substrings_filter\n", 0, 0, 0 );
597 if ( !access_allowed( op, e,
598 f->f_sub_desc, NULL, ACL_SEARCH, NULL ) )
600 return LDAP_INSUFFICIENT_ACCESS;
603 for(a = attrs_find( e->e_attrs, f->f_sub_desc );
605 a = attrs_find( a->a_next, f->f_sub_desc ) )
607 MatchingRule *mr = a->a_desc->ad_type->sat_substr;
610 if( mr == NULL ) continue;
612 for ( bv = a->a_nvals; bv->bv_val != NULL; bv++ ) {
617 rc = value_match( &ret, a->a_desc, mr, 0,
618 bv, f->f_sub, &text );
620 if( rc != LDAP_SUCCESS ) return rc;
621 if ( ret == 0 ) return LDAP_COMPARE_TRUE;
625 Debug( LDAP_DEBUG_FILTER, "end test_substrings_filter 1\n",
627 return LDAP_COMPARE_FALSE;