diff options
Diffstat (limited to 'servers/slapd/filter.c')
| -rw-r--r-- | servers/slapd/filter.c | 1450 |
1 files changed, 1450 insertions, 0 deletions
diff --git a/servers/slapd/filter.c b/servers/slapd/filter.c new file mode 100644 index 0000000..1d7ee21 --- /dev/null +++ b/servers/slapd/filter.c @@ -0,0 +1,1450 @@ +/* filter.c - routines for parsing and dealing with filters */ +/* $OpenLDAP$ */ +/* This work is part of OpenLDAP Software <http://www.openldap.org/>. + * + * Copyright 1998-2022 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" + +#include <stdio.h> + +#include <ac/socket.h> +#include <ac/string.h> + +#include "slap.h" +#include "lutil.h" + +const Filter *slap_filter_objectClass_pres; +const struct berval *slap_filterstr_objectClass_pres; + +static int get_filter_list( + Operation *op, + BerElement *ber, + Filter **f, + const char **text, + int depth ); + +static int get_ssa( + Operation *op, + BerElement *ber, + Filter *f, + const char **text ); + +static void simple_vrFilter2bv( + Operation *op, + ValuesReturnFilter *f, + struct berval *fstr ); + +static int get_simple_vrFilter( + Operation *op, + BerElement *ber, + ValuesReturnFilter **f, + const char **text ); + +int +filter_init( void ) +{ + static Filter filter_objectClass_pres = { LDAP_FILTER_PRESENT }; + static struct berval filterstr_objectClass_pres = BER_BVC("(objectClass=*)"); + + filter_objectClass_pres.f_desc = slap_schema.si_ad_objectClass; + + slap_filter_objectClass_pres = &filter_objectClass_pres; + slap_filterstr_objectClass_pres = &filterstr_objectClass_pres; + + return 0; +} + +void +filter_destroy( void ) +{ + return; +} + +static int +get_filter0( + Operation *op, + BerElement *ber, + Filter **filt, + const char **text, + int depth ) +{ + ber_tag_t tag; + ber_len_t len; + int err; + Filter f; + + Debug( LDAP_DEBUG_FILTER, "begin get_filter\n" ); + /* + * A filter looks like this coming in: + * Filter ::= CHOICE { + * and [0] SET OF Filter, + * or [1] SET OF Filter, + * not [2] Filter, + * equalityMatch [3] AttributeValueAssertion, + * substrings [4] SubstringFilter, + * greaterOrEqual [5] AttributeValueAssertion, + * lessOrEqual [6] AttributeValueAssertion, + * present [7] AttributeType, + * approxMatch [8] AttributeValueAssertion, + * extensibleMatch [9] MatchingRuleAssertion + * } + * + * SubstringFilter ::= SEQUENCE { + * type AttributeType, + * SEQUENCE OF CHOICE { + * initial [0] IA5String, + * any [1] IA5String, + * final [2] IA5String + * } + * } + * + * MatchingRuleAssertion ::= SEQUENCE { + * matchingRule [1] MatchingRuleId OPTIONAL, + * type [2] AttributeDescription OPTIONAL, + * matchValue [3] AssertionValue, + * dnAttributes [4] BOOLEAN DEFAULT FALSE + * } + * + */ + + if( depth > slap_max_filter_depth ) { + *text = "filter nested too deeply"; + return SLAPD_DISCONNECT; + } + + tag = ber_peek_tag( ber, &len ); + + if( tag == LBER_ERROR ) { + *text = "error decoding filter"; + return SLAPD_DISCONNECT; + } + + err = LDAP_SUCCESS; + + f.f_next = NULL; + f.f_choice = tag; + + switch ( f.f_choice ) { + case LDAP_FILTER_EQUALITY: + Debug( LDAP_DEBUG_FILTER, "EQUALITY\n" ); + err = get_ava( op, ber, &f, SLAP_MR_EQUALITY, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + + assert( f.f_ava != NULL ); + break; + + case LDAP_FILTER_SUBSTRINGS: + Debug( LDAP_DEBUG_FILTER, "SUBSTRINGS\n" ); + err = get_ssa( op, ber, &f, text ); + if( err != LDAP_SUCCESS ) { + break; + } + assert( f.f_sub != NULL ); + break; + + case LDAP_FILTER_GE: + Debug( LDAP_DEBUG_FILTER, "GE\n" ); + err = get_ava( op, ber, &f, SLAP_MR_ORDERING, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + assert( f.f_ava != NULL ); + break; + + case LDAP_FILTER_LE: + Debug( LDAP_DEBUG_FILTER, "LE\n" ); + err = get_ava( op, ber, &f, SLAP_MR_ORDERING, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + assert( f.f_ava != NULL ); + break; + + case LDAP_FILTER_PRESENT: { + struct berval type; + + Debug( LDAP_DEBUG_FILTER, "PRESENT\n" ); + if ( ber_scanf( ber, "m", &type ) == LBER_ERROR ) { + err = SLAPD_DISCONNECT; + *text = "error decoding filter"; + break; + } + + f.f_desc = NULL; + err = slap_bv2ad( &type, &f.f_desc, text ); + + if( err != LDAP_SUCCESS ) { + f.f_choice |= SLAPD_FILTER_UNDEFINED; + err = slap_bv2undef_ad( &type, &f.f_desc, text, + SLAP_AD_PROXIED|SLAP_AD_NOINSERT ); + + if ( err != LDAP_SUCCESS ) { + /* unrecognized attribute description or other error */ + Debug( LDAP_DEBUG_ANY, + "get_filter: conn %lu unknown attribute " + "type=%s (%d)\n", + op->o_connid, type.bv_val, err ); + + err = LDAP_SUCCESS; + f.f_desc = slap_bv2tmp_ad( &type, op->o_tmpmemctx ); + } + *text = NULL; + } + + assert( f.f_desc != NULL ); + } break; + + case LDAP_FILTER_APPROX: + Debug( LDAP_DEBUG_FILTER, "APPROX\n" ); + err = get_ava( op, ber, &f, SLAP_MR_EQUALITY_APPROX, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + assert( f.f_ava != NULL ); + break; + + case LDAP_FILTER_AND: + Debug( LDAP_DEBUG_FILTER, "AND\n" ); + err = get_filter_list( op, ber, &f.f_and, text, depth+1 ); + if ( err != LDAP_SUCCESS ) { + break; + } + if ( f.f_and == NULL ) { + f.f_choice = SLAPD_FILTER_COMPUTED; + f.f_result = LDAP_COMPARE_TRUE; + } + /* no assert - list could be empty */ + break; + + case LDAP_FILTER_OR: + Debug( LDAP_DEBUG_FILTER, "OR\n" ); + err = get_filter_list( op, ber, &f.f_or, text, depth+1 ); + if ( err != LDAP_SUCCESS ) { + break; + } + if ( f.f_or == NULL ) { + f.f_choice = SLAPD_FILTER_COMPUTED; + f.f_result = LDAP_COMPARE_FALSE; + } + /* no assert - list could be empty */ + break; + + case LDAP_FILTER_NOT: + Debug( LDAP_DEBUG_FILTER, "NOT\n" ); + (void) ber_skip_tag( ber, &len ); + err = get_filter0( op, ber, &f.f_not, text, depth+1 ); + if ( err != LDAP_SUCCESS ) { + break; + } + + assert( f.f_not != NULL ); + if ( f.f_not->f_choice == SLAPD_FILTER_COMPUTED ) { + int fresult = f.f_not->f_result; + f.f_choice = SLAPD_FILTER_COMPUTED; + op->o_tmpfree( f.f_not, op->o_tmpmemctx ); + f.f_not = NULL; + + switch( fresult ) { + case LDAP_COMPARE_TRUE: + f.f_result = LDAP_COMPARE_FALSE; + break; + case LDAP_COMPARE_FALSE: + f.f_result = LDAP_COMPARE_TRUE; + break; + default: ; + /* (!Undefined) is Undefined */ + } + } + break; + + case LDAP_FILTER_EXT: + Debug( LDAP_DEBUG_FILTER, "EXTENSIBLE\n" ); + + err = get_mra( op, ber, &f, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + + assert( f.f_mra != NULL ); + break; + + default: + (void) ber_scanf( ber, "x" ); /* skip the element */ + Debug( LDAP_DEBUG_ANY, "get_filter: unknown filter type=%lu\n", + f.f_choice ); + f.f_choice = SLAPD_FILTER_COMPUTED; + f.f_result = SLAPD_COMPARE_UNDEFINED; + break; + } + + if( err != LDAP_SUCCESS && err != SLAPD_DISCONNECT ) { + /* ignore error */ + *text = NULL; + f.f_choice = SLAPD_FILTER_COMPUTED; + f.f_result = SLAPD_COMPARE_UNDEFINED; + err = LDAP_SUCCESS; + } + + if ( err == LDAP_SUCCESS ) { + *filt = op->o_tmpalloc( sizeof(f), op->o_tmpmemctx ); + **filt = f; + } + + Debug( LDAP_DEBUG_FILTER, "end get_filter %d\n", err ); + + return( err ); +} + +int +get_filter( + Operation *op, + BerElement *ber, + Filter **filt, + const char **text ) +{ + return get_filter0( op, ber, filt, text, 0 ); +} + + +static int +get_filter_list( Operation *op, BerElement *ber, + Filter **f, + const char **text, + int depth ) +{ + Filter **new; + int err; + ber_tag_t tag; + ber_len_t len; + char *last; + + Debug( LDAP_DEBUG_FILTER, "begin get_filter_list\n" ); + new = f; + for ( tag = ber_first_element( ber, &len, &last ); + tag != LBER_DEFAULT; + tag = ber_next_element( ber, &len, last ) ) + { + err = get_filter0( op, ber, new, text, depth ); + if ( err != LDAP_SUCCESS ) + return( err ); + new = &(*new)->f_next; + } + *new = NULL; + + Debug( LDAP_DEBUG_FILTER, "end get_filter_list\n" ); + return( LDAP_SUCCESS ); +} + +static int +get_ssa( + Operation *op, + BerElement *ber, + Filter *f, + const char **text ) +{ + ber_tag_t tag; + ber_len_t len; + int rc; + struct berval desc, value, nvalue; + char *last; + SubstringsAssertion ssa; + + *text = "error decoding filter"; + + Debug( LDAP_DEBUG_FILTER, "begin get_ssa\n" ); + if ( ber_scanf( ber, "{m" /*}*/, &desc ) == LBER_ERROR ) { + return SLAPD_DISCONNECT; + } + + *text = NULL; + + ssa.sa_desc = NULL; + ssa.sa_initial.bv_val = NULL; + ssa.sa_any = NULL; + ssa.sa_final.bv_val = NULL; + + rc = slap_bv2ad( &desc, &ssa.sa_desc, text ); + + if( rc != LDAP_SUCCESS ) { + f->f_choice |= SLAPD_FILTER_UNDEFINED; + rc = slap_bv2undef_ad( &desc, &ssa.sa_desc, text, + SLAP_AD_PROXIED|SLAP_AD_NOINSERT ); + + if( rc != LDAP_SUCCESS ) { + Debug( LDAP_DEBUG_ANY, + "get_ssa: conn %lu unknown attribute type=%s (%ld)\n", + op->o_connid, desc.bv_val, (long) rc ); + + ssa.sa_desc = slap_bv2tmp_ad( &desc, op->o_tmpmemctx ); + } + } + + rc = LDAP_PROTOCOL_ERROR; + + /* If there is no substring matching rule, there's nothing + * we can do with this filter. But we continue to parse it + * for logging purposes. + */ + if ( ssa.sa_desc->ad_type->sat_substr == NULL ) { + f->f_choice |= SLAPD_FILTER_UNDEFINED; + Debug( LDAP_DEBUG_FILTER, + "get_ssa: no substring matching rule for attributeType %s\n", + desc.bv_val ); + } + + for ( tag = ber_first_element( ber, &len, &last ); + tag != LBER_DEFAULT; + tag = ber_next_element( ber, &len, last ) ) + { + unsigned usage; + + if ( ber_scanf( ber, "m", &value ) == LBER_ERROR ) { + rc = SLAPD_DISCONNECT; + goto return_error; + } + + if ( value.bv_val == NULL || value.bv_len == 0 ) { + rc = LDAP_INVALID_SYNTAX; + goto return_error; + } + + switch ( tag ) { + case LDAP_SUBSTRING_INITIAL: + if ( ssa.sa_initial.bv_val != NULL + || ssa.sa_any != NULL + || ssa.sa_final.bv_val != NULL ) + { + rc = LDAP_PROTOCOL_ERROR; + goto return_error; + } + usage = SLAP_MR_SUBSTR_INITIAL; + break; + + case LDAP_SUBSTRING_ANY: + if ( ssa.sa_final.bv_val != NULL ) { + rc = LDAP_PROTOCOL_ERROR; + goto return_error; + } + usage = SLAP_MR_SUBSTR_ANY; + break; + + case LDAP_SUBSTRING_FINAL: + if ( ssa.sa_final.bv_val != NULL ) { + rc = LDAP_PROTOCOL_ERROR; + goto return_error; + } + + usage = SLAP_MR_SUBSTR_FINAL; + break; + + default: + Debug( LDAP_DEBUG_FILTER, + " unknown substring choice=%ld\n", + (long) tag ); + + rc = LDAP_PROTOCOL_ERROR; + goto return_error; + } + + /* validate/normalize using equality matching rule validator! */ + rc = asserted_value_validate_normalize( + ssa.sa_desc, ssa.sa_desc->ad_type->sat_equality, + usage, &value, &nvalue, text, op->o_tmpmemctx ); + if( rc != LDAP_SUCCESS ) { + f->f_choice |= SLAPD_FILTER_UNDEFINED; + Debug( LDAP_DEBUG_FILTER, + "get_ssa: illegal value for attributeType %s (%d) %s\n", + desc.bv_val, rc, *text ); + ber_dupbv_x( &nvalue, &value, op->o_tmpmemctx ); + } + + switch ( tag ) { + case LDAP_SUBSTRING_INITIAL: + Debug( LDAP_DEBUG_FILTER, " INITIAL\n" ); + ssa.sa_initial = nvalue; + break; + + case LDAP_SUBSTRING_ANY: + Debug( LDAP_DEBUG_FILTER, " ANY\n" ); + ber_bvarray_add_x( &ssa.sa_any, &nvalue, op->o_tmpmemctx ); + break; + + case LDAP_SUBSTRING_FINAL: + Debug( LDAP_DEBUG_FILTER, " FINAL\n" ); + ssa.sa_final = nvalue; + break; + + default: + assert( 0 ); + slap_sl_free( nvalue.bv_val, op->o_tmpmemctx ); + rc = LDAP_PROTOCOL_ERROR; + +return_error: + Debug( LDAP_DEBUG_FILTER, " error=%ld\n", + (long) rc ); + slap_sl_free( ssa.sa_initial.bv_val, op->o_tmpmemctx ); + ber_bvarray_free_x( ssa.sa_any, op->o_tmpmemctx ); + if ( ssa.sa_desc->ad_flags & SLAP_DESC_TEMPORARY ) + op->o_tmpfree( ssa.sa_desc, op->o_tmpmemctx ); + slap_sl_free( ssa.sa_final.bv_val, op->o_tmpmemctx ); + return rc; + } + + *text = NULL; + rc = LDAP_SUCCESS; + } + + if( rc == LDAP_SUCCESS ) { + f->f_sub = op->o_tmpalloc( sizeof( ssa ), op->o_tmpmemctx ); + *f->f_sub = ssa; + } + + Debug( LDAP_DEBUG_FILTER, "end get_ssa\n" ); + return rc /* LDAP_SUCCESS */ ; +} + +void +filter_free_x( Operation *op, Filter *f, int freeme ) +{ + Filter *p, *next; + + if ( f == NULL ) { + return; + } + + f->f_choice &= SLAPD_FILTER_MASK; + + switch ( f->f_choice ) { + case LDAP_FILTER_PRESENT: + if ( f->f_desc->ad_flags & SLAP_DESC_TEMPORARY ) + op->o_tmpfree( f->f_desc, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_EQUALITY: + case LDAP_FILTER_GE: + case LDAP_FILTER_LE: + case LDAP_FILTER_APPROX: + ava_free( op, f->f_ava, 1 ); + break; + + case LDAP_FILTER_SUBSTRINGS: + if ( f->f_sub_initial.bv_val != NULL ) { + op->o_tmpfree( f->f_sub_initial.bv_val, op->o_tmpmemctx ); + } + ber_bvarray_free_x( f->f_sub_any, op->o_tmpmemctx ); + if ( f->f_sub_final.bv_val != NULL ) { + op->o_tmpfree( f->f_sub_final.bv_val, op->o_tmpmemctx ); + } + if ( f->f_sub->sa_desc->ad_flags & SLAP_DESC_TEMPORARY ) + op->o_tmpfree( f->f_sub->sa_desc, op->o_tmpmemctx ); + op->o_tmpfree( f->f_sub, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_AND: + case LDAP_FILTER_OR: + case LDAP_FILTER_NOT: + for ( p = f->f_list; p != NULL; p = next ) { + next = p->f_next; + filter_free_x( op, p, 1 ); + } + break; + + case LDAP_FILTER_EXT: + mra_free( op, f->f_mra, 1 ); + break; + + case SLAPD_FILTER_COMPUTED: + break; + + default: + Debug( LDAP_DEBUG_ANY, "filter_free: unknown filter type=%lu\n", + f->f_choice ); + break; + } + + if ( freeme ) { + op->o_tmpfree( f, op->o_tmpmemctx ); + } +} + +void +filter_free( Filter *f ) +{ + Operation op; + Opheader ohdr; + + op.o_hdr = &ohdr; + op.o_tmpmemctx = slap_sl_context( f ); + op.o_tmpmfuncs = &slap_sl_mfuncs; + filter_free_x( &op, f, 1 ); +} + +void +filter2bv_x( Operation *op, Filter *f, struct berval *fstr ) +{ + filter2bv_undef_x( op, f, 0, fstr ); +} + +void +filter2bv_undef_x( Operation *op, Filter *f, int noundef, struct berval *fstr ) +{ + int i; + Filter *p; + struct berval tmp, value; + static struct berval + ber_bvfalse = BER_BVC( "(?=false)" ), + ber_bvtrue = BER_BVC( "(?=true)" ), + ber_bvundefined = BER_BVC( "(?=undefined)" ), + ber_bverror = BER_BVC( "(?=error)" ), + ber_bvunknown = BER_BVC( "(?=unknown)" ), + ber_bvnone = BER_BVC( "(?=none)" ), + ber_bvF = BER_BVC( "(|)" ), + ber_bvT = BER_BVC( "(&)" ); + ber_len_t len; + ber_tag_t choice; + int undef, undef2; + char *sign; + + if ( f == NULL ) { + ber_dupbv_x( fstr, &ber_bvnone, op->o_tmpmemctx ); + return; + } + + undef = f->f_choice & SLAPD_FILTER_UNDEFINED; + undef2 = (undef && !noundef); + choice = f->f_choice & SLAPD_FILTER_MASK; + + switch ( choice ) { + case LDAP_FILTER_EQUALITY: + fstr->bv_len = STRLENOF("(=)"); + sign = "="; + goto simple; + case LDAP_FILTER_GE: + fstr->bv_len = STRLENOF("(>=)"); + sign = ">="; + goto simple; + case LDAP_FILTER_LE: + fstr->bv_len = STRLENOF("(<=)"); + sign = "<="; + goto simple; + case LDAP_FILTER_APPROX: + fstr->bv_len = STRLENOF("(~=)"); + sign = "~="; + +simple: + value = f->f_av_value; + if ( f->f_av_desc->ad_type->sat_equality && + !undef && + ( f->f_av_desc->ad_type->sat_equality->smr_usage & SLAP_MR_MUTATION_NORMALIZER )) + { + f->f_av_desc->ad_type->sat_equality->smr_normalize( + (SLAP_MR_DENORMALIZE|SLAP_MR_VALUE_OF_ASSERTION_SYNTAX), + NULL, NULL, &f->f_av_value, &value, op->o_tmpmemctx ); + } + + filter_escape_value_x( &value, &tmp, op->o_tmpmemctx ); + /* NOTE: tmp can legitimately be NULL (meaning empty) + * since in a Filter values in AVAs are supposed + * to have been normalized, meaning that an empty value + * is legal for that attribute's syntax */ + + fstr->bv_len += f->f_av_desc->ad_cname.bv_len + tmp.bv_len; + if ( undef2 ) + fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s)", + undef2 ? "?" : "", + f->f_av_desc->ad_cname.bv_val, sign, + tmp.bv_len ? tmp.bv_val : "" ); + + if ( value.bv_val != f->f_av_value.bv_val ) { + ber_memfree_x( value.bv_val, op->o_tmpmemctx ); + } + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_SUBSTRINGS: + fstr->bv_len = f->f_sub_desc->ad_cname.bv_len + + STRLENOF("(=*)"); + if ( undef2 ) + fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s=*)", + undef2 ? "?" : "", + f->f_sub_desc->ad_cname.bv_val ); + + if ( f->f_sub_initial.bv_val != NULL ) { + ber_len_t tmplen; + + len = fstr->bv_len; + + filter_escape_value_x( &f->f_sub_initial, &tmp, op->o_tmpmemctx ); + tmplen = tmp.bv_len; + + fstr->bv_len += tmplen; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, + fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len - 2], + tmplen + STRLENOF( /*(*/ "*)" ) + 1, + /* "(attr=" */ "%s*)", + tmp.bv_len ? tmp.bv_val : ""); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } + + if ( f->f_sub_any != NULL ) { + for ( i = 0; f->f_sub_any[i].bv_val != NULL; i++ ) { + ber_len_t tmplen; + + len = fstr->bv_len; + filter_escape_value_x( &f->f_sub_any[i], + &tmp, op->o_tmpmemctx ); + tmplen = tmp.bv_len; + + fstr->bv_len += tmplen + STRLENOF( /*(*/ ")" ); + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, + fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len - 1], + tmplen + STRLENOF( /*(*/ "*)" ) + 1, + /* "(attr=[init]*[any*]" */ "%s*)", + tmp.bv_len ? tmp.bv_val : ""); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } + } + + if ( f->f_sub_final.bv_val != NULL ) { + ber_len_t tmplen; + + len = fstr->bv_len; + + filter_escape_value_x( &f->f_sub_final, &tmp, op->o_tmpmemctx ); + tmplen = tmp.bv_len; + + fstr->bv_len += tmplen; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, + fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len - 1], + tmplen + STRLENOF( /*(*/ ")" ) + 1, + /* "(attr=[init*][any*]" */ "%s)", + tmp.bv_len ? tmp.bv_val : ""); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } + + break; + + case LDAP_FILTER_PRESENT: + fstr->bv_len = f->f_desc->ad_cname.bv_len + + STRLENOF("(=*)"); + if ( undef2 ) + fstr->bv_len++; + + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s=*)", + undef2 ? "?" : "", + f->f_desc->ad_cname.bv_val ); + break; + + case LDAP_FILTER_AND: + case LDAP_FILTER_OR: + case LDAP_FILTER_NOT: + fstr->bv_len = STRLENOF("(%)"); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%c)", + f->f_choice == LDAP_FILTER_AND ? '&' : + f->f_choice == LDAP_FILTER_OR ? '|' : '!' ); + + for ( p = f->f_list; p != NULL; p = p->f_next ) { + len = fstr->bv_len; + + filter2bv_undef_x( op, p, noundef, &tmp ); + + fstr->bv_len += tmp.bv_len; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1, + op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len-1], + tmp.bv_len + STRLENOF( /*(*/ ")" ) + 1, + /*"("*/ "%s)", tmp.bv_val ); + + op->o_tmpfree( tmp.bv_val, op->o_tmpmemctx ); + } + + break; + + case LDAP_FILTER_EXT: { + struct berval ad; + + filter_escape_value_x( &f->f_mr_value, &tmp, op->o_tmpmemctx ); + /* NOTE: tmp can legitimately be NULL (meaning empty) + * since in a Filter values in MRAs are supposed + * to have been normalized, meaning that an empty value + * is legal for that attribute's syntax */ + + if ( f->f_mr_desc ) { + ad = f->f_mr_desc->ad_cname; + } else { + ad.bv_len = 0; + ad.bv_val = ""; + } + + fstr->bv_len = ad.bv_len + + ( undef2 ? 1 : 0 ) + + ( f->f_mr_dnattrs ? STRLENOF(":dn") : 0 ) + + ( f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_len + STRLENOF(":") : 0 ) + + tmp.bv_len + STRLENOF("(:=)"); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s%s:=%s)", + undef2 ? "?" : "", + ad.bv_val, + f->f_mr_dnattrs ? ":dn" : "", + f->f_mr_rule_text.bv_len ? ":" : "", + f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_val : "", + tmp.bv_len ? tmp.bv_val : "" ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } break; + + case SLAPD_FILTER_COMPUTED: + switch ( f->f_result ) { + case LDAP_COMPARE_FALSE: + tmp = ( noundef ? ber_bvF : ber_bvfalse ); + break; + + case LDAP_COMPARE_TRUE: + tmp = ( noundef ? ber_bvT : ber_bvtrue ); + break; + + case SLAPD_COMPARE_UNDEFINED: + tmp = ber_bvundefined; + break; + + default: + tmp = ber_bverror; + break; + } + + ber_dupbv_x( fstr, &tmp, op->o_tmpmemctx ); + break; + + default: + ber_dupbv_x( fstr, &ber_bvunknown, op->o_tmpmemctx ); + break; + } +} + +void +filter2bv( Filter *f, struct berval *fstr ) +{ + filter2bv_undef( f, 0, fstr ); +} + +void +filter2bv_undef( Filter *f, int noundef, struct berval *fstr ) +{ + Operation op; + Opheader ohdr; + + op.o_hdr = &ohdr; + op.o_tmpmemctx = NULL; + op.o_tmpmfuncs = &ch_mfuncs; + + filter2bv_undef_x( &op, f, noundef, fstr ); +} + +Filter * +filter_dup( Filter *f, void *memctx ) +{ + BerMemoryFunctions *mf = &slap_sl_mfuncs; + Filter *n; + + if ( !f ) + return NULL; + + n = mf->bmf_malloc( sizeof(Filter), memctx ); + n->f_choice = f->f_choice; + n->f_next = NULL; + + switch( f->f_choice & SLAPD_FILTER_MASK ) { + case SLAPD_FILTER_COMPUTED: + n->f_result = f->f_result; + break; + case LDAP_FILTER_PRESENT: + if ( f->f_desc->ad_flags & SLAP_DESC_TEMPORARY ) + n->f_desc = slap_bv2tmp_ad( &f->f_desc->ad_cname, memctx ); + else + n->f_desc = f->f_desc; + break; + case LDAP_FILTER_EQUALITY: + case LDAP_FILTER_GE: + case LDAP_FILTER_LE: + case LDAP_FILTER_APPROX: + /* Should this be ava_dup() ? */ + n->f_ava = mf->bmf_calloc( 1, sizeof(AttributeAssertion), memctx ); + *n->f_ava = *f->f_ava; + if ( f->f_av_desc->ad_flags & SLAP_DESC_TEMPORARY ) + n->f_av_desc = slap_bv2tmp_ad( &f->f_av_desc->ad_cname, memctx ); + ber_dupbv_x( &n->f_av_value, &f->f_av_value, memctx ); + break; + case LDAP_FILTER_SUBSTRINGS: + n->f_sub = mf->bmf_calloc( 1, sizeof(SubstringsAssertion), memctx ); + if ( f->f_sub_desc->ad_flags & SLAP_DESC_TEMPORARY ) + n->f_sub_desc = slap_bv2tmp_ad( &f->f_sub_desc->ad_cname, memctx ); + else + n->f_sub_desc = f->f_sub_desc; + if ( !BER_BVISNULL( &f->f_sub_initial )) + ber_dupbv_x( &n->f_sub_initial, &f->f_sub_initial, memctx ); + if ( f->f_sub_any ) { + int i; + for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ); + n->f_sub_any = mf->bmf_malloc(( i+1 )*sizeof( struct berval ), + memctx ); + for ( i = 0; !BER_BVISNULL( &f->f_sub_any[i] ); i++ ) { + ber_dupbv_x( &n->f_sub_any[i], &f->f_sub_any[i], memctx ); + } + BER_BVZERO( &n->f_sub_any[i] ); + } + if ( !BER_BVISNULL( &f->f_sub_final )) + ber_dupbv_x( &n->f_sub_final, &f->f_sub_final, memctx ); + break; + case LDAP_FILTER_EXT: { + /* Should this be mra_dup() ? */ + ber_len_t length; + length = sizeof(MatchingRuleAssertion); + if ( !BER_BVISNULL( &f->f_mr_rule_text )) + length += f->f_mr_rule_text.bv_len + 1; + n->f_mra = mf->bmf_calloc( 1, length, memctx ); + *n->f_mra = *f->f_mra; + if ( f->f_mr_desc && ( f->f_sub_desc->ad_flags & SLAP_DESC_TEMPORARY )) + n->f_mr_desc = slap_bv2tmp_ad( &f->f_mr_desc->ad_cname, memctx ); + ber_dupbv_x( &n->f_mr_value, &f->f_mr_value, memctx ); + if ( !BER_BVISNULL( &f->f_mr_rule_text )) { + n->f_mr_rule_text.bv_val = (char *)(n->f_mra+1); + AC_MEMCPY(n->f_mr_rule_text.bv_val, + f->f_mr_rule_text.bv_val, f->f_mr_rule_text.bv_len ); + } + } break; + case LDAP_FILTER_AND: + case LDAP_FILTER_OR: + case LDAP_FILTER_NOT: { + Filter **p; + for ( p = &n->f_list, f = f->f_list; f; f = f->f_next ) { + *p = filter_dup( f, memctx ); + p = &(*p)->f_next; + } + } break; + } + return n; +} + +static int +get_simple_vrFilter( + Operation *op, + BerElement *ber, + ValuesReturnFilter **filt, + const char **text ) +{ + ber_tag_t tag; + ber_len_t len; + int err; + ValuesReturnFilter vrf; + + Debug( LDAP_DEBUG_FILTER, "begin get_simple_vrFilter\n" ); + + tag = ber_peek_tag( ber, &len ); + + if( tag == LBER_ERROR ) { + *text = "error decoding filter"; + return SLAPD_DISCONNECT; + } + + vrf.vrf_next = NULL; + + err = LDAP_SUCCESS; + vrf.vrf_choice = tag; + + switch ( vrf.vrf_choice ) { + case LDAP_FILTER_EQUALITY: + Debug( LDAP_DEBUG_FILTER, "EQUALITY\n" ); + err = get_ava( op, ber, (Filter *)&vrf, SLAP_MR_EQUALITY, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + + assert( vrf.vrf_ava != NULL ); + break; + + case LDAP_FILTER_SUBSTRINGS: + Debug( LDAP_DEBUG_FILTER, "SUBSTRINGS\n" ); + err = get_ssa( op, ber, (Filter *)&vrf, text ); + break; + + case LDAP_FILTER_GE: + Debug( LDAP_DEBUG_FILTER, "GE\n" ); + err = get_ava( op, ber, (Filter *)&vrf, SLAP_MR_ORDERING, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + break; + + case LDAP_FILTER_LE: + Debug( LDAP_DEBUG_FILTER, "LE\n" ); + err = get_ava( op, ber, (Filter *)&vrf, SLAP_MR_ORDERING, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + break; + + case LDAP_FILTER_PRESENT: { + struct berval type; + + Debug( LDAP_DEBUG_FILTER, "PRESENT\n" ); + if ( ber_scanf( ber, "m", &type ) == LBER_ERROR ) { + err = SLAPD_DISCONNECT; + *text = "error decoding filter"; + break; + } + + vrf.vrf_desc = NULL; + err = slap_bv2ad( &type, &vrf.vrf_desc, text ); + + if( err != LDAP_SUCCESS ) { + vrf.vrf_choice |= SLAPD_FILTER_UNDEFINED; + err = slap_bv2undef_ad( &type, &vrf.vrf_desc, text, + SLAP_AD_PROXIED); + + if( err != LDAP_SUCCESS ) { + /* unrecognized attribute description or other error */ + Debug( LDAP_DEBUG_ANY, + "get_simple_vrFilter: conn %lu unknown " + "attribute type=%s (%d)\n", + op->o_connid, type.bv_val, err ); + + vrf.vrf_choice = SLAPD_FILTER_COMPUTED; + vrf.vrf_result = LDAP_COMPARE_FALSE; + err = LDAP_SUCCESS; + break; + } + } + } break; + + case LDAP_FILTER_APPROX: + Debug( LDAP_DEBUG_FILTER, "APPROX\n" ); + err = get_ava( op, ber, (Filter *)&vrf, SLAP_MR_EQUALITY_APPROX, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + break; + + case LDAP_FILTER_EXT: + Debug( LDAP_DEBUG_FILTER, "EXTENSIBLE\n" ); + + err = get_mra( op, ber, (Filter *)&vrf, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + + assert( vrf.vrf_mra != NULL ); + break; + + default: + (void) ber_scanf( ber, "x" ); /* skip the element */ + Debug( LDAP_DEBUG_ANY, "get_simple_vrFilter: unknown filter type=%lu\n", + vrf.vrf_choice ); + vrf.vrf_choice = SLAPD_FILTER_COMPUTED; + vrf.vrf_result = SLAPD_COMPARE_UNDEFINED; + break; + } + + if ( err != LDAP_SUCCESS && err != SLAPD_DISCONNECT ) { + /* ignore error */ + vrf.vrf_choice = SLAPD_FILTER_COMPUTED; + vrf.vrf_result = SLAPD_COMPARE_UNDEFINED; + err = LDAP_SUCCESS; + } + + if ( err == LDAP_SUCCESS ) { + *filt = op->o_tmpalloc( sizeof vrf, op->o_tmpmemctx ); + **filt = vrf; + } + + Debug( LDAP_DEBUG_FILTER, "end get_simple_vrFilter %d\n", err ); + + return err; +} + +int +get_vrFilter( Operation *op, BerElement *ber, + ValuesReturnFilter **vrf, + const char **text ) +{ + /* + * A ValuesReturnFilter looks like this: + * + * ValuesReturnFilter ::= SEQUENCE OF SimpleFilterItem + * SimpleFilterItem ::= CHOICE { + * equalityMatch [3] AttributeValueAssertion, + * substrings [4] SubstringFilter, + * greaterOrEqual [5] AttributeValueAssertion, + * lessOrEqual [6] AttributeValueAssertion, + * present [7] AttributeType, + * approxMatch [8] AttributeValueAssertion, + * extensibleMatch [9] SimpleMatchingAssertion -- LDAPv3 + * } + * + * SubstringFilter ::= SEQUENCE { + * type AttributeType, + * SEQUENCE OF CHOICE { + * initial [0] IA5String, + * any [1] IA5String, + * final [2] IA5String + * } + * } + * + * SimpleMatchingAssertion ::= SEQUENCE { -- LDAPv3 + * matchingRule [1] MatchingRuleId OPTIONAL, + * type [2] AttributeDescription OPTIONAL, + * matchValue [3] AssertionValue } + */ + + ValuesReturnFilter **n; + ber_tag_t tag; + ber_len_t len; + char *last; + + Debug( LDAP_DEBUG_FILTER, "begin get_vrFilter\n" ); + + tag = ber_peek_tag( ber, &len ); + + if( tag == LBER_ERROR ) { + *text = "error decoding vrFilter"; + return SLAPD_DISCONNECT; + } + + if( tag != LBER_SEQUENCE ) { + *text = "error decoding vrFilter, expect SEQUENCE tag"; + return SLAPD_DISCONNECT; + } + + n = vrf; + for ( tag = ber_first_element( ber, &len, &last ); + tag != LBER_DEFAULT; + tag = ber_next_element( ber, &len, last ) ) + { + int err = get_simple_vrFilter( op, ber, n, text ); + + if ( err != LDAP_SUCCESS ) return( err ); + + n = &(*n)->vrf_next; + } + *n = NULL; + + Debug( LDAP_DEBUG_FILTER, "end get_vrFilter\n" ); + return( LDAP_SUCCESS ); +} + +void +vrFilter_free( Operation *op, ValuesReturnFilter *vrf ) +{ + ValuesReturnFilter *next; + + for ( ; vrf != NULL; vrf = next ) { + next = vrf->vrf_next; + + switch ( vrf->vrf_choice & SLAPD_FILTER_MASK ) { + case LDAP_FILTER_PRESENT: + break; + + case LDAP_FILTER_EQUALITY: + case LDAP_FILTER_GE: + case LDAP_FILTER_LE: + case LDAP_FILTER_APPROX: + ava_free( op, vrf->vrf_ava, 1 ); + break; + + case LDAP_FILTER_SUBSTRINGS: + if ( vrf->vrf_sub_initial.bv_val != NULL ) { + op->o_tmpfree( vrf->vrf_sub_initial.bv_val, op->o_tmpmemctx ); + } + ber_bvarray_free_x( vrf->vrf_sub_any, op->o_tmpmemctx ); + if ( vrf->vrf_sub_final.bv_val != NULL ) { + op->o_tmpfree( vrf->vrf_sub_final.bv_val, op->o_tmpmemctx ); + } + op->o_tmpfree( vrf->vrf_sub, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_EXT: + mra_free( op, vrf->vrf_mra, 1 ); + break; + + case SLAPD_FILTER_COMPUTED: + break; + + default: + Debug( LDAP_DEBUG_ANY, "filter_free: unknown filter type=%lu\n", + vrf->vrf_choice ); + break; + } + + op->o_tmpfree( vrf, op->o_tmpmemctx ); + } +} + +void +vrFilter2bv( Operation *op, ValuesReturnFilter *vrf, struct berval *fstr ) +{ + ValuesReturnFilter *p; + struct berval tmp; + ber_len_t len; + + if ( vrf == NULL ) { + ber_str2bv_x( "No filter!", STRLENOF("No filter!"), + 1, fstr, op->o_tmpmemctx ); + return; + } + + fstr->bv_len = STRLENOF("()"); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "()"); + + for ( p = vrf; p != NULL; p = p->vrf_next ) { + len = fstr->bv_len; + + simple_vrFilter2bv( op, p, &tmp ); + + fstr->bv_len += tmp.bv_len; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1, + op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len-1], tmp.bv_len + 2, + /*"("*/ "%s)", tmp.bv_val ); + + op->o_tmpfree( tmp.bv_val, op->o_tmpmemctx ); + } +} + +static void +simple_vrFilter2bv( Operation *op, ValuesReturnFilter *vrf, struct berval *fstr ) +{ + struct berval tmp; + ber_len_t len; + int undef; + + if ( vrf == NULL ) { + ber_str2bv_x( "No filter!", STRLENOF("No filter!"), 1, fstr, + op->o_tmpmemctx ); + return; + } + undef = vrf->vrf_choice & SLAPD_FILTER_UNDEFINED; + + switch ( vrf->vrf_choice & SLAPD_FILTER_MASK ) { + case LDAP_FILTER_EQUALITY: + filter_escape_value_x( &vrf->vrf_av_value, &tmp, op->o_tmpmemctx ); + + fstr->bv_len = vrf->vrf_av_desc->ad_cname.bv_len + + tmp.bv_len + STRLENOF("(=)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)", + vrf->vrf_av_desc->ad_cname.bv_val, + tmp.bv_val ); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_GE: + filter_escape_value_x( &vrf->vrf_av_value, &tmp, op->o_tmpmemctx ); + + fstr->bv_len = vrf->vrf_av_desc->ad_cname.bv_len + + tmp.bv_len + STRLENOF("(>=)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)", + vrf->vrf_av_desc->ad_cname.bv_val, + tmp.bv_val ); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_LE: + filter_escape_value_x( &vrf->vrf_av_value, &tmp, op->o_tmpmemctx ); + + fstr->bv_len = vrf->vrf_av_desc->ad_cname.bv_len + + tmp.bv_len + STRLENOF("(<=)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)", + vrf->vrf_av_desc->ad_cname.bv_val, + tmp.bv_val ); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_APPROX: + filter_escape_value_x( &vrf->vrf_av_value, &tmp, op->o_tmpmemctx ); + + fstr->bv_len = vrf->vrf_av_desc->ad_cname.bv_len + + tmp.bv_len + STRLENOF("(~=)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)", + vrf->vrf_av_desc->ad_cname.bv_val, + tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + break; + + case LDAP_FILTER_SUBSTRINGS: + fstr->bv_len = vrf->vrf_sub_desc->ad_cname.bv_len + + STRLENOF("(=*)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)", + vrf->vrf_sub_desc->ad_cname.bv_val ); + + if ( vrf->vrf_sub_initial.bv_val != NULL ) { + len = fstr->bv_len; + + filter_escape_value_x( &vrf->vrf_sub_initial, &tmp, op->o_tmpmemctx ); + + fstr->bv_len += tmp.bv_len; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1, + op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len-2], tmp.bv_len+3, + /* "(attr=" */ "%s*)", + tmp.bv_val ); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } + + if ( vrf->vrf_sub_any != NULL ) { + int i; + for ( i = 0; vrf->vrf_sub_any[i].bv_val != NULL; i++ ) { + len = fstr->bv_len; + filter_escape_value_x( &vrf->vrf_sub_any[i], &tmp, + op->o_tmpmemctx ); + + fstr->bv_len += tmp.bv_len + 1; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, + fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len-1], tmp.bv_len+3, + /* "(attr=[init]*[any*]" */ "%s*)", + tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } + } + + if ( vrf->vrf_sub_final.bv_val != NULL ) { + len = fstr->bv_len; + + filter_escape_value_x( &vrf->vrf_sub_final, &tmp, op->o_tmpmemctx ); + + fstr->bv_len += tmp.bv_len; + fstr->bv_val = op->o_tmprealloc( fstr->bv_val, fstr->bv_len + 1, + op->o_tmpmemctx ); + + snprintf( &fstr->bv_val[len-1], tmp.bv_len+3, + /* "(attr=[init*][any*]" */ "%s)", + tmp.bv_val ); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } + + break; + + case LDAP_FILTER_PRESENT: + fstr->bv_len = vrf->vrf_desc->ad_cname.bv_len + + STRLENOF("(=*)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)", + vrf->vrf_desc->ad_cname.bv_val ); + break; + + case LDAP_FILTER_EXT: { + struct berval ad; + filter_escape_value_x( &vrf->vrf_mr_value, &tmp, op->o_tmpmemctx ); + + if ( vrf->vrf_mr_desc ) { + ad = vrf->vrf_mr_desc->ad_cname; + } else { + ad.bv_len = 0; + ad.bv_val = ""; + } + + fstr->bv_len = ad.bv_len + + ( vrf->vrf_mr_dnattrs ? STRLENOF(":dn") : 0 ) + + ( vrf->vrf_mr_rule_text.bv_len + ? vrf->vrf_mr_rule_text.bv_len+1 : 0 ) + + tmp.bv_len + STRLENOF("(:=)"); + if ( undef ) fstr->bv_len++; + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); + + snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s%s%s%s:=%s)", + ad.bv_val, + vrf->vrf_mr_dnattrs ? ":dn" : "", + vrf->vrf_mr_rule_text.bv_len ? ":" : "", + vrf->vrf_mr_rule_text.bv_len ? vrf->vrf_mr_rule_text.bv_val : "", + tmp.bv_val ); + + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } break; + + case SLAPD_FILTER_COMPUTED: + ber_str2bv_x( + vrf->vrf_result == LDAP_COMPARE_FALSE ? "(?=false)" : + vrf->vrf_result == LDAP_COMPARE_TRUE ? "(?=true)" : + vrf->vrf_result == SLAPD_COMPARE_UNDEFINED + ? "(?=undefined)" : "(?=error)", + vrf->vrf_result == LDAP_COMPARE_FALSE ? STRLENOF("(?=false)") : + vrf->vrf_result == LDAP_COMPARE_TRUE ? STRLENOF("(?=true)") : + vrf->vrf_result == SLAPD_COMPARE_UNDEFINED + ? STRLENOF("(?=undefined)") : STRLENOF("(?=error)"), + 1, fstr, op->o_tmpmemctx ); + break; + + default: + ber_str2bv_x( "(?=unknown)", STRLENOF("(?=unknown)"), + 1, fstr, op->o_tmpmemctx ); + break; + } +} |