X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=servers%2Fslapd%2Ffilter.c;h=0bfc702e6a03d3469633317f62c67e7e0deea4dc;hb=021443bd5d355b8171dcbe4650c67507b9e1b83b;hp=11ce1afdef71c08853976f7d047f32b6b592a6cb;hpb=1880c23029f01704a90e9ddd847b779b2f271edf;p=openldap diff --git a/servers/slapd/filter.c b/servers/slapd/filter.c index 11ce1afdef..0bfc702e6a 100644 --- a/servers/slapd/filter.c +++ b/servers/slapd/filter.c @@ -1,8 +1,27 @@ /* filter.c - routines for parsing and dealing with filters */ /* $OpenLDAP$ */ -/* - * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved. - * COPYING RESTRICTIONS APPLY, see COPYRIGHT file +/* This work is part of OpenLDAP Software . + * + * 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 + * . + */ +/* 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" @@ -15,24 +34,36 @@ #include "slap.h" static int get_filter_list( - Connection *conn, + Operation *op, BerElement *ber, Filter **f, const char **text ); -static int get_substring_filter( - Connection *conn, +static int get_ssa( + Operation *op, BerElement *ber, - Filter *f, + SubstringsAssertion **s, const char **text ); -static int filter_escape_value( +static int filter_escape_value_x( struct berval *in, - struct berval *out ); + struct berval *out, + void *ctx ); + +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 get_filter( - Connection *conn, + Operation *op, BerElement *ber, Filter **filt, const char **text ) @@ -40,14 +71,9 @@ get_filter( ber_tag_t tag; ber_len_t len; int err; - Filter *f; + Filter f; -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ENTRY, "get_filter: conn %d\n", - conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "begin get_filter\n", 0, 0, 0 ); -#endif /* * A filter looks like this coming in: * Filter ::= CHOICE { @@ -60,7 +86,7 @@ get_filter( * lessOrEqual [6] AttributeValueAssertion, * present [7] AttributeType,, * approxMatch [8] AttributeValueAssertion - * extensibleMatch [9] MatchingRuleAssertion + * extensibleMatch [9] MatchingRuleAssertion * } * * SubstringFilter ::= SEQUENCE { @@ -88,202 +114,182 @@ get_filter( return SLAPD_DISCONNECT; } - f = (Filter *) ch_malloc( sizeof(Filter) ); - f->f_next = NULL; - err = LDAP_SUCCESS; - f->f_choice = tag; - switch ( f->f_choice ) { + f.f_next = NULL; + f.f_choice = tag; + + switch ( f.f_choice ) { case LDAP_FILTER_EQUALITY: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL2, - "get_filter: conn %d EQUALITY\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "EQUALITY\n", 0, 0, 0 ); -#endif - err = get_ava( ber, &f->f_ava, SLAP_MR_EQUALITY, text ); + err = get_ava( op, ber, &f.f_ava, SLAP_MR_EQUALITY, text ); if ( err != LDAP_SUCCESS ) { break; } - assert( f->f_ava != NULL ); + assert( f.f_ava != NULL ); break; case LDAP_FILTER_SUBSTRINGS: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d SUBSTRINGS\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "SUBSTRINGS\n", 0, 0, 0 ); -#endif - err = get_substring_filter( conn, ber, f, text ); + err = get_ssa( op, ber, &f.f_sub, text ); + if( err != LDAP_SUCCESS ) { + break; + } + assert( f.f_sub != NULL ); break; case LDAP_FILTER_GE: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d GE\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "GE\n", 0, 0, 0 ); -#endif - err = get_ava( ber, &f->f_ava, SLAP_MR_ORDERING, text ); + err = get_ava( op, ber, &f.f_ava, SLAP_MR_ORDERING, text ); if ( err != LDAP_SUCCESS ) { break; } + assert( f.f_ava != NULL ); break; case LDAP_FILTER_LE: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d LE\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "LE\n", 0, 0, 0 ); -#endif - err = get_ava( ber, &f->f_ava, SLAP_MR_ORDERING, text ); + err = get_ava( op, ber, &f.f_ava, SLAP_MR_ORDERING, text ); if ( err != LDAP_SUCCESS ) { break; } + assert( f.f_ava != NULL ); break; case LDAP_FILTER_PRESENT: { struct berval type; -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d PRESENT\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "PRESENT\n", 0, 0, 0 ); -#endif 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 ); + f.f_desc = NULL; + err = slap_bv2ad( &type, &f.f_desc, text ); if( err != LDAP_SUCCESS ) { /* unrecognized attribute description or other error */ - f->f_choice = SLAPD_FILTER_COMPUTED; - f->f_result = LDAP_COMPARE_FALSE; + Debug( LDAP_DEBUG_ANY, + "get_filter: conn %d unknown attribute " + "type=%s (%d)\n", + op->o_connid, type.bv_val, err ); + + f.f_choice = SLAPD_FILTER_COMPUTED; + f.f_result = LDAP_COMPARE_FALSE; err = LDAP_SUCCESS; + *text = NULL; break; } + + assert( f.f_desc != NULL ); } break; case LDAP_FILTER_APPROX: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d APPROX\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "APPROX\n", 0, 0, 0 ); -#endif - err = get_ava( ber, &f->f_ava, SLAP_MR_EQUALITY_APPROX, text ); + err = get_ava( op, ber, &f.f_ava, SLAP_MR_EQUALITY_APPROX, text ); if ( err != LDAP_SUCCESS ) { break; } + assert( f.f_ava != NULL ); break; case LDAP_FILTER_AND: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d AND\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "AND\n", 0, 0, 0 ); -#endif - err = get_filter_list( conn, ber, &f->f_and, text ); + err = get_filter_list( op, ber, &f.f_and, text ); 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: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d OR\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "OR\n", 0, 0, 0 ); -#endif - err = get_filter_list( conn, ber, &f->f_or, text ); + err = get_filter_list( op, ber, &f.f_or, text ); 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: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d NOT\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "NOT\n", 0, 0, 0 ); -#endif (void) ber_skip_tag( ber, &len ); - err = get_filter( conn, ber, &f->f_not, text ); + err = get_filter( op, ber, &f.f_not, text ); 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: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_filter: conn %d EXTENSIBLE\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "EXTENSIBLE\n", 0, 0, 0 ); -#endif - err = get_mra( ber, &f->f_mra, text ); + err = get_mra( op, ber, &f.f_mra, text ); if ( err != LDAP_SUCCESS ) { break; } - assert( f->f_mra != NULL ); - + assert( f.f_mra != NULL ); break; default: (void) ber_scanf( ber, "x" ); /* skip the element */ -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ERR, - "get_filter: conn %d unknown filter type=%lu\n", - conn->c_connid, f->f_choice )); -#else Debug( LDAP_DEBUG_ANY, "get_filter: unknown filter type=%lu\n", - f->f_choice, 0, 0 ); -#endif - f->f_choice = SLAPD_FILTER_COMPUTED; - f->f_result = SLAPD_COMPARE_UNDEFINED; + f.f_choice, 0, 0 ); + f.f_choice = SLAPD_FILTER_COMPUTED; + f.f_result = SLAPD_COMPARE_UNDEFINED; break; } - if ( err != LDAP_SUCCESS ) { - if( err != SLAPD_DISCONNECT ) { - /* ignore error */ - f->f_choice = SLAPD_FILTER_COMPUTED; - f->f_result = SLAPD_COMPARE_UNDEFINED; - err = LDAP_SUCCESS; - *filt = f; + 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; + } - } else { - free(f); - } - } else { - *filt = f; + if ( err == LDAP_SUCCESS ) { + *filt = op->o_tmpalloc( sizeof(f), op->o_tmpmemctx ); + **filt = f; } -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL2, - "get_filter: conn %d exit\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "end get_filter %d\n", err, 0, 0 ); -#endif + return( err ); } static int -get_filter_list( Connection *conn, BerElement *ber, +get_filter_list( Operation *op, BerElement *ber, Filter **f, const char **text ) { @@ -293,75 +299,72 @@ get_filter_list( Connection *conn, BerElement *ber, ber_len_t len; char *last; -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ENTRY, - "get_filter_list: conn %d start\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "begin get_filter_list\n", 0, 0, 0 ); -#endif new = f; - for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT; + for ( tag = ber_first_element( ber, &len, &last ); + tag != LBER_DEFAULT; tag = ber_next_element( ber, &len, last ) ) { - err = get_filter( conn, ber, new, text ); + err = get_filter( op, ber, new, text ); if ( err != LDAP_SUCCESS ) return( err ); new = &(*new)->f_next; } *new = NULL; -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ENTRY, - "get_filter_list: conn %d exit\n", conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, "end get_filter_list\n", 0, 0, 0 ); -#endif return( LDAP_SUCCESS ); } static int -get_substring_filter( - Connection *conn, +get_ssa( + Operation *op, BerElement *ber, - Filter *f, + SubstringsAssertion **out, const char **text ) { ber_tag_t tag; ber_len_t len; ber_tag_t rc; - struct berval value; - struct berval escaped; + struct berval desc, value, nvalue; char *last; - struct berval bv; + SubstringsAssertion ssa; + *text = "error decoding filter"; + *out = NULL; -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ENTRY, - "get_substring_filter: conn %d begin\n", conn->c_connid )); -#else - Debug( LDAP_DEBUG_FILTER, "begin get_substring_filter\n", 0, 0, 0 ); -#endif - if ( ber_scanf( ber, "{m" /*}*/, &bv ) == LBER_ERROR ) { + Debug( LDAP_DEBUG_FILTER, "begin get_ssa\n", 0, 0, 0 ); + if ( ber_scanf( ber, "{m" /*}*/, &desc ) == LBER_ERROR ) { return SLAPD_DISCONNECT; } - f->f_sub = ch_calloc( 1, sizeof(SubstringsAssertion) ); - f->f_sub_desc = NULL; - rc = slap_bv2ad( &bv, &f->f_sub_desc, text ); + *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 ) { - text = NULL; - ch_free( f->f_sub ); - f->f_choice = SLAPD_FILTER_COMPUTED; - f->f_result = SLAPD_COMPARE_UNDEFINED; - return LDAP_SUCCESS; + Debug( LDAP_DEBUG_ANY, + "get_ssa: conn %d unknown attribute type=%s (%d)\n", + op->o_connid, desc.bv_val, rc ); + + /* skip over the rest of this filter */ + for ( tag = ber_first_element( ber, &len, &last ); + tag != LBER_DEFAULT; + tag = ber_next_element( ber, &len, last ) ) { + ber_scanf( ber, "x" ); + } + return rc; } - f->f_sub_initial.bv_val = NULL; - f->f_sub_any = NULL; - f->f_sub_final.bv_val = NULL; + rc = LDAP_PROTOCOL_ERROR; - for ( tag = ber_first_element( ber, &len, &last ); tag != LBER_DEFAULT; + for ( tag = ber_first_element( ber, &len, &last ); + tag != LBER_DEFAULT; tag = ber_next_element( ber, &len, last ) ) { unsigned usage; @@ -393,131 +396,93 @@ get_substring_filter( default: rc = LDAP_PROTOCOL_ERROR; -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ERR, - "get_filter_substring: conn %d unknown substring choice=%ld\n", - conn->c_connid, (long)tag )); -#else Debug( LDAP_DEBUG_FILTER, " unknown substring choice=%ld\n", (long) tag, 0, 0 ); -#endif - goto return_error; - } - /* valiate using equality matching rule validator! */ - rc = value_validate( f->f_sub_desc->ad_type->sat_equality, - &value, text ); - if( rc != LDAP_SUCCESS ) { goto return_error; } - rc = value_normalize( f->f_sub_desc, usage, - &value, &bv, text ); + /* 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 ) { goto return_error; } - value = bv; - rc = LDAP_PROTOCOL_ERROR; switch ( tag ) { case LDAP_SUBSTRING_INITIAL: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_substring_filter: conn %d INITIAL\n", - conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, " INITIAL\n", 0, 0, 0 ); -#endif - if ( f->f_sub_initial.bv_val != NULL - || f->f_sub_any != NULL - || f->f_sub_final.bv_val != NULL ) + if ( ssa.sa_initial.bv_val != NULL + || ssa.sa_any != NULL + || ssa.sa_final.bv_val != NULL ) { - free( value.bv_val ); + slap_sl_free( nvalue.bv_val, op->o_tmpmemctx ); goto return_error; } - f->f_sub_initial = value; + ssa.sa_initial = nvalue; break; case LDAP_SUBSTRING_ANY: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_substring_filter: conn %d ANY\n", - conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, " ANY\n", 0, 0, 0 ); -#endif - if ( f->f_sub_final.bv_val != NULL ) { - free( value.bv_val ); + if ( ssa.sa_final.bv_val != NULL ) { + slap_sl_free( nvalue.bv_val, op->o_tmpmemctx ); goto return_error; } - ber_bvarray_add( &f->f_sub_any, &value ); + ber_bvarray_add_x( &ssa.sa_any, &nvalue, op->o_tmpmemctx ); break; case LDAP_SUBSTRING_FINAL: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_DETAIL1, - "get_substring_filter: conn %d FINAL\n", - conn->c_connid )); -#else Debug( LDAP_DEBUG_FILTER, " FINAL\n", 0, 0, 0 ); -#endif - if ( f->f_sub_final.bv_val != NULL ) { - free( value.bv_val ); + if ( ssa.sa_final.bv_val != NULL ) { + slap_sl_free( nvalue.bv_val, op->o_tmpmemctx ); goto return_error; } - f->f_sub_final = value; + ssa.sa_final = nvalue; break; default: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_INFO, - "get_substring_filter: conn %d unknown substring type %ld\n", - conn->c_connid, (long)tag )); -#else Debug( LDAP_DEBUG_FILTER, " unknown substring type=%ld\n", (long) tag, 0, 0 ); -#endif - free( value.bv_val ); + assert( 0 ); + slap_sl_free( nvalue.bv_val, op->o_tmpmemctx ); return_error: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_INFO, - "get_substring_filter: conn %d error %ld\n", - conn->c_connid, (long)rc )); -#else Debug( LDAP_DEBUG_FILTER, " error=%ld\n", (long) rc, 0, 0 ); -#endif - free( f->f_sub_initial.bv_val ); - ber_bvarray_free( f->f_sub_any ); - free( f->f_sub_final.bv_val ); - ch_free( f->f_sub ); + slap_sl_free( ssa.sa_initial.bv_val, op->o_tmpmemctx ); + ber_bvarray_free_x( ssa.sa_any, op->o_tmpmemctx ); + slap_sl_free( ssa.sa_final.bv_val, op->o_tmpmemctx ); return rc; } + + rc = LDAP_SUCCESS; } -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ENTRY, - "get_substring_filter: conn %d exit\n", conn->c_connid )); -#else - Debug( LDAP_DEBUG_FILTER, "end get_substring_filter\n", 0, 0, 0 ); -#endif - return( LDAP_SUCCESS ); + if( rc == LDAP_SUCCESS ) { + *out = op->o_tmpalloc( sizeof( ssa ), op->o_tmpmemctx ); + **out = ssa; + } + + Debug( LDAP_DEBUG_FILTER, "end get_ssa\n", 0, 0, 0 ); + + return rc /* LDAP_SUCCESS */ ; } void -filter_free( Filter *f ) +filter_free_x( Operation *op, Filter *f ) { Filter *p, *next; @@ -533,18 +498,18 @@ filter_free( Filter *f ) case LDAP_FILTER_GE: case LDAP_FILTER_LE: case LDAP_FILTER_APPROX: - ava_free( f->f_ava, 1 ); + ava_free( op, f->f_ava, 1 ); break; case LDAP_FILTER_SUBSTRINGS: if ( f->f_sub_initial.bv_val != NULL ) { - free( f->f_sub_initial.bv_val ); + op->o_tmpfree( f->f_sub_initial.bv_val, op->o_tmpmemctx ); } - ber_bvarray_free( f->f_sub_any ); + ber_bvarray_free_x( f->f_sub_any, op->o_tmpmemctx ); if ( f->f_sub_final.bv_val != NULL ) { - free( f->f_sub_final.bv_val ); + op->o_tmpfree( f->f_sub_final.bv_val, op->o_tmpmemctx ); } - ch_free( f->f_sub ); + op->o_tmpfree( f->f_sub, op->o_tmpmemctx ); break; case LDAP_FILTER_AND: @@ -552,207 +517,118 @@ filter_free( Filter *f ) case LDAP_FILTER_NOT: for ( p = f->f_list; p != NULL; p = next ) { next = p->f_next; - filter_free( p ); + filter_free_x( op, p ); } break; case LDAP_FILTER_EXT: - mra_free( f->f_mra, 1 ); + mra_free( op, f->f_mra, 1 ); break; case SLAPD_FILTER_COMPUTED: break; default: -#ifdef NEW_LOGGING - LDAP_LOG(( "filter", LDAP_LEVEL_ERR, - "filter_free: unknown filter type %lu\n", f->f_choice )); -#else Debug( LDAP_DEBUG_ANY, "filter_free: unknown filter type=%lu\n", f->f_choice, 0, 0 ); -#endif break; } - free( f ); + op->o_tmpfree( f, op->o_tmpmemctx ); } -#ifdef LDAP_DEBUG void -filter_print( Filter *f ) +filter_free( Filter *f ) { - int i; - Filter *p; - struct berval escaped; - - if ( f == NULL ) { - fprintf( stderr, "No filter!" ); - } + Operation op; + Opheader ohdr; - switch ( f->f_choice ) { - case LDAP_FILTER_EQUALITY: - filter_escape_value( &f->f_av_value, &escaped ); - fprintf( stderr, "(%s=%s)", - f->f_av_desc->ad_cname.bv_val, - escaped.bv_val ); - ber_memfree( escaped.bv_val ); - break; - - case LDAP_FILTER_GE: - filter_escape_value( &f->f_av_value, &escaped ); - fprintf( stderr, "(%s>=%s)", - f->f_av_desc->ad_cname.bv_val, - escaped.bv_val ); - ber_memfree( escaped.bv_val ); - break; - - case LDAP_FILTER_LE: - filter_escape_value( &f->f_av_value, &escaped ); - fprintf( stderr, "(%s<=%s)", - f->f_ava->aa_desc->ad_cname.bv_val, - escaped.bv_val ); - ber_memfree( escaped.bv_val ); - break; - - case LDAP_FILTER_APPROX: - filter_escape_value( &f->f_av_value, &escaped ); - fprintf( stderr, "(%s~=%s)", - f->f_ava->aa_desc->ad_cname.bv_val, - escaped.bv_val ); - ber_memfree( escaped.bv_val ); - break; - - case LDAP_FILTER_SUBSTRINGS: - fprintf( stderr, "(%s=" /*)*/, - f->f_sub_desc->ad_cname.bv_val ); - if ( f->f_sub_initial.bv_val != NULL ) { - filter_escape_value( &f->f_sub_initial, &escaped ); - fprintf( stderr, "%s", - escaped.bv_val ); - ber_memfree( escaped.bv_val ); - } - if ( f->f_sub_any != NULL ) { - for ( i = 0; f->f_sub_any[i].bv_val != NULL; i++ ) { - filter_escape_value( &f->f_sub_any[i], &escaped ); - fprintf( stderr, "*%s", - escaped.bv_val ); - ber_memfree( escaped.bv_val ); - } - } - if ( f->f_sub_final.bv_val != NULL ) { - filter_escape_value( &f->f_sub_final, &escaped ); - fprintf( stderr, - "*%s", escaped.bv_val ); - ber_memfree( escaped.bv_val ); - } - fprintf( stderr, /*(*/ ")" ); - break; - - case LDAP_FILTER_PRESENT: - fprintf( stderr, "(%s=*)", - f->f_desc->ad_cname.bv_val ); - break; - - case LDAP_FILTER_AND: - case LDAP_FILTER_OR: - case LDAP_FILTER_NOT: - fprintf( stderr, "(%c" /*)*/, - f->f_choice == LDAP_FILTER_AND ? '&' : - f->f_choice == LDAP_FILTER_OR ? '|' : '!' ); - for ( p = f->f_list; p != NULL; p = p->f_next ) { - filter_print( p ); - } - fprintf( stderr, /*(*/ ")" ); - break; - - case SLAPD_FILTER_COMPUTED: - fprintf( stderr, "(?=%s)", - f->f_result == LDAP_COMPARE_FALSE ? "false" : - f->f_result == LDAP_COMPARE_TRUE ? "true" : - f->f_result == SLAPD_COMPARE_UNDEFINED ? "undefined" : - "error" ); - break; - - default: - fprintf( stderr, "(unknown-filter=%lu)", f->f_choice ); - break; - } + op.o_hdr = &ohdr; + op.o_tmpmemctx = slap_sl_context( f ); + op.o_tmpmfuncs = &slap_sl_mfuncs; + filter_free_x( &op, f ); } -#endif /* ldap_debug */ void -filter2bv( Filter *f, struct berval *fstr ) +filter2bv_x( Operation *op, Filter *f, struct berval *fstr ) { - int i; - Filter *p; - struct berval tmp; - ber_len_t len; + int i; + Filter *p; + struct berval tmp; + 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_len_t len; if ( f == NULL ) { - ber_str2bv( "No filter!", sizeof("No filter!")-1, 1, fstr ); + ber_dupbv_x( fstr, &ber_bvnone, op->o_tmpmemctx ); return; } switch ( f->f_choice ) { case LDAP_FILTER_EQUALITY: - filter_escape_value( &f->f_av_value, &tmp ); + filter_escape_value_x( &f->f_av_value, &tmp, op->o_tmpmemctx ); fstr->bv_len = f->f_av_desc->ad_cname.bv_len + tmp.bv_len + ( sizeof("(=)") - 1 ); - fstr->bv_val = malloc( fstr->bv_len + 1 ); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=%s)", f->f_av_desc->ad_cname.bv_val, tmp.bv_val ); - ber_memfree( tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); break; case LDAP_FILTER_GE: - filter_escape_value( &f->f_av_value, &tmp ); + filter_escape_value_x( &f->f_av_value, &tmp, op->o_tmpmemctx ); fstr->bv_len = f->f_av_desc->ad_cname.bv_len + tmp.bv_len + ( sizeof("(>=)") - 1 ); - fstr->bv_val = malloc( fstr->bv_len + 1 ); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s>=%s)", f->f_av_desc->ad_cname.bv_val, tmp.bv_val ); - ber_memfree( tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); break; case LDAP_FILTER_LE: - filter_escape_value( &f->f_av_value, &tmp ); + filter_escape_value_x( &f->f_av_value, &tmp, op->o_tmpmemctx ); fstr->bv_len = f->f_av_desc->ad_cname.bv_len + tmp.bv_len + ( sizeof("(<=)") - 1 ); - fstr->bv_val = malloc( fstr->bv_len + 1 ); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s<=%s)", f->f_av_desc->ad_cname.bv_val, tmp.bv_val ); - ber_memfree( tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); break; case LDAP_FILTER_APPROX: - filter_escape_value( &f->f_av_value, &tmp ); + filter_escape_value_x( &f->f_av_value, &tmp, op->o_tmpmemctx ); fstr->bv_len = f->f_av_desc->ad_cname.bv_len + tmp.bv_len + ( sizeof("(~=)") - 1 ); - fstr->bv_val = malloc( fstr->bv_len + 1 ); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s~=%s)", f->f_av_desc->ad_cname.bv_val, tmp.bv_val ); - ber_memfree( tmp.bv_val ); + 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 + ( sizeof("(=*)") - 1 ); - fstr->bv_val = malloc( fstr->bv_len + 128 ); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 128, op->o_tmpmemctx ); snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)", f->f_sub_desc->ad_cname.bv_val ); @@ -760,46 +636,50 @@ filter2bv( Filter *f, struct berval *fstr ) if ( f->f_sub_initial.bv_val != NULL ) { len = fstr->bv_len; - filter_escape_value( &f->f_sub_initial, &tmp ); + filter_escape_value_x( &f->f_sub_initial, &tmp, op->o_tmpmemctx ); fstr->bv_len += tmp.bv_len; - fstr->bv_val = ch_realloc( fstr->bv_val, fstr->bv_len + 1 ); + 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( 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++ ) { len = fstr->bv_len; - filter_escape_value( &f->f_sub_any[i], &tmp ); + filter_escape_value_x( &f->f_sub_any[i], + &tmp, op->o_tmpmemctx ); fstr->bv_len += tmp.bv_len + 1; - fstr->bv_val = ch_realloc( fstr->bv_val, fstr->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( tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); } } if ( f->f_sub_final.bv_val != NULL ) { len = fstr->bv_len; - filter_escape_value( &f->f_sub_final, &tmp ); + filter_escape_value_x( &f->f_sub_final, &tmp, op->o_tmpmemctx ); fstr->bv_len += tmp.bv_len; - fstr->bv_val = ch_realloc( fstr->bv_val, fstr->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( tmp.bv_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); } break; @@ -807,7 +687,7 @@ filter2bv( Filter *f, struct berval *fstr ) case LDAP_FILTER_PRESENT: fstr->bv_len = f->f_desc->ad_cname.bv_len + ( sizeof("(=*)") - 1 ); - fstr->bv_val = malloc( fstr->bv_len + 1 ); + fstr->bv_val = op->o_tmpalloc( fstr->bv_len + 1, op->o_tmpmemctx ); snprintf( fstr->bv_val, fstr->bv_len + 1, "(%s=*)", f->f_desc->ad_cname.bv_val ); @@ -817,7 +697,7 @@ filter2bv( Filter *f, struct berval *fstr ) case LDAP_FILTER_OR: case LDAP_FILTER_NOT: fstr->bv_len = sizeof("(%)") - 1; - fstr->bv_val = malloc( fstr->bv_len + 128 ); + 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 ? '&' : @@ -826,47 +706,99 @@ filter2bv( Filter *f, struct berval *fstr ) for ( p = f->f_list; p != NULL; p = p->f_next ) { len = fstr->bv_len; - filter2bv( p, &tmp ); + filter2bv_x( op, p, &tmp ); fstr->bv_len += tmp.bv_len; - fstr->bv_val = ch_realloc( fstr->bv_val, fstr->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 + 2, /*"("*/ "%s)", tmp.bv_val ); - ch_free( 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 ); + + 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 + + ( f->f_mr_dnattrs ? sizeof(":dn")-1 : 0 ) + + ( f->f_mr_rule_text.bv_len ? f->f_mr_rule_text.bv_len+1 : 0 ) + + tmp.bv_len + ( sizeof("(:=)") - 1 ); + 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, + 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_val ); + ber_memfree_x( tmp.bv_val, op->o_tmpmemctx ); + } break; + case SLAPD_FILTER_COMPUTED: - ber_str2bv( - f->f_result == LDAP_COMPARE_FALSE ? "(?=false)" : - f->f_result == LDAP_COMPARE_TRUE ? "(?=true)" : - f->f_result == SLAPD_COMPARE_UNDEFINED ? "(?=undefined)" : - "(?=error)", - f->f_result == LDAP_COMPARE_FALSE ? sizeof("(?=false)")-1 : - f->f_result == LDAP_COMPARE_TRUE ? sizeof("(?=true)")-1 : - f->f_result == SLAPD_COMPARE_UNDEFINED ? sizeof("(?=undefined)")-1 : - sizeof("(?=error)")-1, - 1, fstr ); - break; + switch ( f->f_result ) { + case LDAP_COMPARE_FALSE: + tmp = ber_bvfalse; + break; + case LDAP_COMPARE_TRUE: + tmp = 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_str2bv( "(?=unknown)", sizeof("(?=unknown)")-1, 1, fstr ); + ber_dupbv_x( fstr, &ber_bvunknown, op->o_tmpmemctx ); break; } } -static int filter_escape_value( +void +filter2bv( Filter *f, struct berval *fstr ) +{ + Operation op; + Opheader ohdr; + + op.o_hdr = &ohdr; + op.o_tmpmemctx = NULL; + op.o_tmpmfuncs = &ch_mfuncs; + + filter2bv_x( &op, f, fstr ); +} + +static int +filter_escape_value_x( struct berval *in, - struct berval *out ) + struct berval *out, + void *ctx ) { ber_len_t i; assert( in ); assert( out ); - out->bv_val = (char *) ch_malloc( ( in->bv_len * 3 ) + 1 ); + i = in->bv_len * 3 + 1; + out->bv_val = ctx ? slap_sl_malloc( i, ctx ) : ch_malloc( i ); out->bv_len = 0; for( i=0; i < in->bv_len ; i++ ) { @@ -882,3 +814,481 @@ static int filter_escape_value( out->bv_val[out->bv_len] = '\0'; return LDAP_SUCCESS; } + +int +filter_escape_value( + struct berval *in, + struct berval *out ) +{ + return filter_escape_value_x( in, out, NULL ); +} + +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", 0, 0, 0 ); + + 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", 0, 0, 0 ); + err = get_ava( op, ber, &vrf.vrf_ava, 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", 0, 0, 0 ); + err = get_ssa( op, ber, &vrf.vrf_sub, text ); + break; + + case LDAP_FILTER_GE: + Debug( LDAP_DEBUG_FILTER, "GE\n", 0, 0, 0 ); + err = get_ava( op, ber, &vrf.vrf_ava, SLAP_MR_ORDERING, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + break; + + case LDAP_FILTER_LE: + Debug( LDAP_DEBUG_FILTER, "LE\n", 0, 0, 0 ); + err = get_ava( op, ber, &vrf.vrf_ava, SLAP_MR_ORDERING, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + break; + + case LDAP_FILTER_PRESENT: { + struct berval type; + + Debug( LDAP_DEBUG_FILTER, "PRESENT\n", 0, 0, 0 ); + 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 ) { + /* unrecognized attribute description or other error */ + Debug( LDAP_DEBUG_ANY, + "get_simple_vrFilter: conn %d 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", 0, 0, 0 ); + err = get_ava( op, ber, &vrf.vrf_ava, SLAP_MR_EQUALITY_APPROX, text ); + if ( err != LDAP_SUCCESS ) { + break; + } + break; + + case LDAP_FILTER_EXT: + Debug( LDAP_DEBUG_FILTER, "EXTENSIBLE\n", 0, 0, 0 ); + + err = get_mra( op, ber, &vrf.vrf_mra, 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, 0, 0 ); + 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 = ch_malloc( sizeof vrf ); + **filt = vrf; + } + + Debug( LDAP_DEBUG_FILTER, "end get_simple_vrFilter %d\n", err, 0, 0 ); + + 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", 0, 0, 0 ); + + 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", 0, 0, 0 ); + return( LDAP_SUCCESS ); +} + +void +vrFilter_free( Operation *op, ValuesReturnFilter *vrf ) +{ + ValuesReturnFilter *p, *next; + + if ( vrf == NULL ) { + return; + } + + for ( p = vrf; p != NULL; p = next ) { + next = p->vrf_next; + + switch ( vrf->vrf_choice ) { + 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, 0, 0 ); + 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!", sizeof("No filter!")-1, + 1, fstr, op->o_tmpmemctx ); + return; + } + + fstr->bv_len = sizeof("()") - 1; + 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; + + if ( vrf == NULL ) { + ber_str2bv_x( "No filter!", sizeof("No filter!")-1, 1, fstr, + op->o_tmpmemctx ); + return; + } + + switch ( vrf->vrf_choice ) { + 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 + ( sizeof("(=)") - 1 ); + 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 + ( sizeof("(>=)") - 1 ); + 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 + ( sizeof("(<=)") - 1 ); + 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 + ( sizeof("(~=)") - 1 ); + 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 + + ( sizeof("(=*)") - 1 ); + 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 + + ( sizeof("(=*)") - 1 ); + 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 ? sizeof(":dn")-1 : 0 ) + + ( vrf->vrf_mr_rule_text.bv_len + ? vrf->vrf_mr_rule_text.bv_len+1 : 0 ) + + tmp.bv_len + ( sizeof("(:=)") - 1 ); + 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 ? sizeof("(?=false)")-1 : + vrf->vrf_result == LDAP_COMPARE_TRUE ? sizeof("(?=true)")-1 : + vrf->vrf_result == SLAPD_COMPARE_UNDEFINED + ? sizeof("(?=undefined)")-1 : sizeof("(?=error)")-1, + 1, fstr, op->o_tmpmemctx ); + break; + + default: + ber_str2bv_x( "(?=unknown)", sizeof("(?=unknown)")-1, + 1, fstr, op->o_tmpmemctx ); + break; + } +}