1 /* filterindex.c - generate the list of candidate entries from a filter */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2007 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>.
20 #include <ac/string.h>
24 #ifdef LDAP_COMP_MATCH
25 #include <component.h>
28 static int presence_candidates(
31 AttributeDescription *desc,
34 static int equality_candidates(
37 AttributeAssertion *ava,
40 static int inequality_candidates(
43 AttributeAssertion *ava,
47 static int approx_candidates(
50 AttributeAssertion *ava,
53 static int substring_candidates(
56 SubstringsAssertion *sub,
60 static int list_candidates(
73 MatchingRuleAssertion *mra,
78 #ifdef LDAP_COMP_MATCH
83 MatchingRuleAssertion *mra,
93 AttributeAssertion *ava,
94 AttributeAliasing *aa,
101 bdb_filter_candidates(
110 #ifdef LDAP_COMP_MATCH
111 AttributeAliasing *aa;
113 Debug( LDAP_DEBUG_FILTER, "=> bdb_filter_candidates\n", 0, 0, 0 );
115 if ( f->f_choice & SLAPD_FILTER_UNDEFINED ) {
120 switch ( f->f_choice ) {
121 case SLAPD_FILTER_COMPUTED:
122 switch( f->f_result ) {
123 case SLAPD_COMPARE_UNDEFINED:
124 /* This technically is not the same as FALSE, but it
125 * certainly will produce no matches.
128 case LDAP_COMPARE_FALSE:
131 case LDAP_COMPARE_TRUE: {
132 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
133 BDB_IDL_ALL( bdb, ids );
136 /* this is a pre-computed scope, leave it alone */
140 case LDAP_FILTER_PRESENT:
141 Debug( LDAP_DEBUG_FILTER, "\tPRESENT\n", 0, 0, 0 );
142 rc = presence_candidates( op, locker, f->f_desc, ids );
145 case LDAP_FILTER_EQUALITY:
146 Debug( LDAP_DEBUG_FILTER, "\tEQUALITY\n", 0, 0, 0 );
147 #ifdef LDAP_COMP_MATCH
148 if ( is_aliased_attribute && ( aa = is_aliased_attribute ( f->f_ava->aa_desc ) ) ) {
149 rc = ava_comp_candidates ( op, locker, f->f_ava, aa, ids, tmp, stack );
154 rc = equality_candidates( op, locker, f->f_ava, ids, tmp );
158 case LDAP_FILTER_APPROX:
159 Debug( LDAP_DEBUG_FILTER, "\tAPPROX\n", 0, 0, 0 );
160 rc = approx_candidates( op, locker, f->f_ava, ids, tmp );
163 case LDAP_FILTER_SUBSTRINGS:
164 Debug( LDAP_DEBUG_FILTER, "\tSUBSTRINGS\n", 0, 0, 0 );
165 rc = substring_candidates( op, locker, f->f_sub, ids, tmp );
169 /* if no GE index, use pres */
170 Debug( LDAP_DEBUG_FILTER, "\tGE\n", 0, 0, 0 );
171 if( f->f_ava->aa_desc->ad_type->sat_ordering &&
172 ( f->f_ava->aa_desc->ad_type->sat_ordering->smr_usage & SLAP_MR_ORDERED_INDEX ) )
173 rc = inequality_candidates( op, locker, f->f_ava, ids, tmp, LDAP_FILTER_GE );
175 rc = presence_candidates( op, locker, f->f_ava->aa_desc, ids );
179 /* if no LE index, use pres */
180 Debug( LDAP_DEBUG_FILTER, "\tLE\n", 0, 0, 0 );
181 if( f->f_ava->aa_desc->ad_type->sat_ordering &&
182 ( f->f_ava->aa_desc->ad_type->sat_ordering->smr_usage & SLAP_MR_ORDERED_INDEX ) )
183 rc = inequality_candidates( op, locker, f->f_ava, ids, tmp, LDAP_FILTER_LE );
185 rc = presence_candidates( op, locker, f->f_ava->aa_desc, ids );
188 case LDAP_FILTER_NOT:
189 /* no indexing to support NOT filters */
190 Debug( LDAP_DEBUG_FILTER, "\tNOT\n", 0, 0, 0 );
191 { struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
192 BDB_IDL_ALL( bdb, ids );
196 case LDAP_FILTER_AND:
197 Debug( LDAP_DEBUG_FILTER, "\tAND\n", 0, 0, 0 );
198 rc = list_candidates( op, locker,
199 f->f_and, LDAP_FILTER_AND, ids, tmp, stack );
203 Debug( LDAP_DEBUG_FILTER, "\tOR\n", 0, 0, 0 );
204 rc = list_candidates( op, locker,
205 f->f_or, LDAP_FILTER_OR, ids, tmp, stack );
207 case LDAP_FILTER_EXT:
208 Debug( LDAP_DEBUG_FILTER, "\tEXT\n", 0, 0, 0 );
209 rc = ext_candidates( op, locker, f->f_mra, ids, tmp, stack );
212 Debug( LDAP_DEBUG_FILTER, "\tUNKNOWN %lu\n",
213 (unsigned long) f->f_choice, 0, 0 );
214 /* Must not return NULL, otherwise extended filters break */
215 { struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
216 BDB_IDL_ALL( bdb, ids );
221 Debug( LDAP_DEBUG_FILTER,
222 "<= bdb_filter_candidates: id=%ld first=%ld last=%ld\n",
224 (long) BDB_IDL_FIRST( ids ),
225 (long) BDB_IDL_LAST( ids ) );
230 #ifdef LDAP_COMP_MATCH
232 comp_list_candidates(
235 MatchingRuleAssertion* mra,
236 ComponentFilter *flist,
245 Debug( LDAP_DEBUG_FILTER, "=> comp_list_candidates 0x%x\n", ftype, 0, 0 );
246 for ( f = flist; f != NULL; f = f->cf_next ) {
247 /* ignore precomputed scopes */
248 if ( f->cf_choice == SLAPD_FILTER_COMPUTED &&
249 f->cf_result == LDAP_SUCCESS ) {
252 BDB_IDL_ZERO( save );
253 rc = comp_candidates( op, locker, mra, f, save, tmp, save+BDB_IDL_UM_SIZE );
256 if ( ftype == LDAP_COMP_FILTER_AND ) {
263 if ( ftype == LDAP_COMP_FILTER_AND ) {
265 BDB_IDL_CPY( ids, save );
267 bdb_idl_intersection( ids, save );
269 if( BDB_IDL_IS_ZERO( ids ) )
273 BDB_IDL_CPY( ids, save );
275 bdb_idl_union( ids, save );
280 if( rc == LDAP_SUCCESS ) {
281 Debug( LDAP_DEBUG_FILTER,
282 "<= comp_list_candidates: id=%ld first=%ld last=%ld\n",
284 (long) BDB_IDL_FIRST(ids),
285 (long) BDB_IDL_LAST(ids) );
288 Debug( LDAP_DEBUG_FILTER,
289 "<= comp_list_candidates: undefined rc=%d\n",
297 comp_equality_candidates (
300 MatchingRuleAssertion *mra,
301 ComponentAssertion *ca,
306 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
311 struct berval prefix = {0, NULL};
312 struct berval *keys = NULL;
313 MatchingRule *mr = mra->ma_rule;
315 ComponentReference* cr_list, *cr;
318 BDB_IDL_ALL( bdb, ids );
320 if ( !ca->ca_comp_ref )
323 ai = bdb_attr_mask( op->o_bd->be_private, mra->ma_desc );
330 /* find a component reference to be indexed */
331 sat_syntax = ca->ca_ma_rule->smr_syntax;
332 for ( cr = cr_list ; cr ; cr = cr->cr_next ) {
333 if ( cr->cr_string.bv_len == ca->ca_comp_ref->cr_string.bv_len &&
334 strncmp( cr->cr_string.bv_val, ca->ca_comp_ref->cr_string.bv_val,cr->cr_string.bv_len ) == 0 )
341 rc = bdb_index_param( op->o_bd, mra->ma_desc, LDAP_FILTER_EQUALITY,
342 &db, &mask, &prefix );
344 if( rc != LDAP_SUCCESS ) {
352 if( !mr->smr_filter ) {
356 rc = (ca->ca_ma_rule->smr_filter)(
357 LDAP_FILTER_EQUALITY,
363 &keys, op->o_tmpmemctx );
365 if( rc != LDAP_SUCCESS ) {
372 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
373 rc = bdb_key_read( op->o_bd, db, locker, &keys[i], tmp, NULL, 0 );
375 if( rc == DB_NOTFOUND ) {
379 } else if( rc != LDAP_SUCCESS ) {
383 if( BDB_IDL_IS_ZERO( tmp ) ) {
389 BDB_IDL_CPY( ids, tmp );
391 bdb_idl_intersection( ids, tmp );
394 if( BDB_IDL_IS_ZERO( ids ) )
397 ber_bvarray_free_x( keys, op->o_tmpmemctx );
399 Debug( LDAP_DEBUG_TRACE,
400 "<= comp_equality_candidates: id=%ld, first=%ld, last=%ld\n",
402 (long) BDB_IDL_FIRST(ids),
403 (long) BDB_IDL_LAST(ids) );
408 ava_comp_candidates (
411 AttributeAssertion *ava,
412 AttributeAliasing *aa,
417 MatchingRuleAssertion mra;
419 mra.ma_rule = ava->aa_desc->ad_type->sat_equality;
420 if ( !mra.ma_rule ) {
421 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
422 BDB_IDL_ALL( bdb, ids );
425 mra.ma_desc = aa->aa_aliased_ad;
426 mra.ma_rule = ava->aa_desc->ad_type->sat_equality;
428 return comp_candidates ( op, locker, &mra, ava->aa_cf, ids, tmp, stack );
435 MatchingRuleAssertion *mra,
443 if ( !f ) return LDAP_PROTOCOL_ERROR;
445 Debug( LDAP_DEBUG_FILTER, "comp_candidates\n", 0, 0, 0 );
446 switch ( f->cf_choice ) {
447 case SLAPD_FILTER_COMPUTED:
450 case LDAP_COMP_FILTER_AND:
451 rc = comp_list_candidates( op, locker, mra, f->cf_and, LDAP_COMP_FILTER_AND, ids, tmp, stack );
453 case LDAP_COMP_FILTER_OR:
454 rc = comp_list_candidates( op, locker, mra, f->cf_or, LDAP_COMP_FILTER_OR, ids, tmp, stack );
456 case LDAP_COMP_FILTER_NOT:
457 /* No component indexing supported for NOT filter */
458 Debug( LDAP_DEBUG_FILTER, "\tComponent NOT\n", 0, 0, 0 );
460 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
461 BDB_IDL_ALL( bdb, ids );
463 rc = LDAP_PROTOCOL_ERROR;
465 case LDAP_COMP_FILTER_ITEM:
466 rc = comp_equality_candidates( op, locker, mra, f->cf_ca, ids, tmp, stack );
470 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
471 BDB_IDL_ALL( bdb, ids );
473 rc = LDAP_PROTOCOL_ERROR;
484 MatchingRuleAssertion *mra,
489 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
491 #ifdef LDAP_COMP_MATCH
493 * Currently Only Component Indexing for componentFilterMatch is supported
494 * Indexing for an extensible filter is not supported yet
497 return comp_candidates ( op, locker, mra, mra->ma_cf, ids, tmp, stack);
500 if ( mra->ma_desc == slap_schema.si_ad_entryDN ) {
505 if ( mra->ma_rule == slap_schema.si_mr_distinguishedNameMatch ) {
507 rc = bdb_cache_find_ndn( op, NULL, &mra->ma_value, &ei );
508 if ( rc == LDAP_SUCCESS )
509 bdb_idl_insert( ids, ei->bei_id );
511 bdb_cache_entryinfo_unlock( ei );
513 } else if ( mra->ma_rule && mra->ma_rule->smr_match ==
514 dnRelativeMatch && dnIsSuffix( &mra->ma_value,
515 op->o_bd->be_nsuffix )) {
517 if ( mra->ma_rule == slap_schema.si_mr_dnSuperiorMatch ) {
520 dnParent( &mra->ma_value, &pdn );
521 bdb_cache_find_ndn( op, NULL, &pdn, &ei );
523 bdb_cache_entryinfo_unlock( ei );
524 while ( ei && ei->bei_id ) {
525 bdb_idl_insert( ids, ei->bei_id );
531 if ( mra->ma_rule == slap_schema.si_mr_dnSubtreeMatch )
532 scope = LDAP_SCOPE_SUBTREE;
533 else if ( mra->ma_rule == slap_schema.si_mr_dnOneLevelMatch )
534 scope = LDAP_SCOPE_ONELEVEL;
535 else if ( mra->ma_rule == slap_schema.si_mr_dnSubordinateMatch )
536 scope = LDAP_SCOPE_SUBORDINATE;
538 scope = LDAP_SCOPE_BASE;
539 if ( scope > LDAP_SCOPE_BASE ) {
541 rc = bdb_cache_find_ndn( op, NULL, &mra->ma_value, &ei );
543 bdb_cache_entryinfo_unlock( ei );
544 if ( rc == LDAP_SUCCESS ) {
545 int sc = op->ors_scope;
546 op->ors_scope = scope;
547 rc = bdb_dn2idl( op, locker, &mra->ma_value, ei, ids,
555 BDB_IDL_ALL( bdb, ids );
572 Debug( LDAP_DEBUG_FILTER, "=> bdb_list_candidates 0x%x\n", ftype, 0, 0 );
573 for ( f = flist; f != NULL; f = f->f_next ) {
574 /* ignore precomputed scopes */
575 if ( f->f_choice == SLAPD_FILTER_COMPUTED &&
576 f->f_result == LDAP_SUCCESS ) {
579 BDB_IDL_ZERO( save );
580 rc = bdb_filter_candidates( op, locker, f, save, tmp,
581 save+BDB_IDL_UM_SIZE );
584 if ( ftype == LDAP_FILTER_AND ) {
592 if ( ftype == LDAP_FILTER_AND ) {
594 BDB_IDL_CPY( ids, save );
596 bdb_idl_intersection( ids, save );
598 if( BDB_IDL_IS_ZERO( ids ) )
602 BDB_IDL_CPY( ids, save );
604 bdb_idl_union( ids, save );
609 if( rc == LDAP_SUCCESS ) {
610 Debug( LDAP_DEBUG_FILTER,
611 "<= bdb_list_candidates: id=%ld first=%ld last=%ld\n",
613 (long) BDB_IDL_FIRST(ids),
614 (long) BDB_IDL_LAST(ids) );
617 Debug( LDAP_DEBUG_FILTER,
618 "<= bdb_list_candidates: undefined rc=%d\n",
629 AttributeDescription *desc,
632 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
636 struct berval prefix = {0, NULL};
638 Debug( LDAP_DEBUG_TRACE, "=> bdb_presence_candidates (%s)\n",
639 desc->ad_cname.bv_val, 0, 0 );
641 BDB_IDL_ALL( bdb, ids );
643 if( desc == slap_schema.si_ad_objectClass ) {
647 rc = bdb_index_param( op->o_bd, desc, LDAP_FILTER_PRESENT,
648 &db, &mask, &prefix );
650 if( rc == LDAP_INAPPROPRIATE_MATCHING ) {
652 Debug( LDAP_DEBUG_TRACE,
653 "<= bdb_presence_candidates: (%s) not indexed\n",
654 desc->ad_cname.bv_val, 0, 0 );
658 if( rc != LDAP_SUCCESS ) {
659 Debug( LDAP_DEBUG_TRACE,
660 "<= bdb_presence_candidates: (%s) index_param "
662 desc->ad_cname.bv_val, rc, 0 );
666 if( prefix.bv_val == NULL ) {
667 Debug( LDAP_DEBUG_TRACE,
668 "<= bdb_presence_candidates: (%s) no prefix\n",
669 desc->ad_cname.bv_val, 0, 0 );
673 rc = bdb_key_read( op->o_bd, db, locker, &prefix, ids, NULL, 0 );
675 if( rc == DB_NOTFOUND ) {
678 } else if( rc != LDAP_SUCCESS ) {
679 Debug( LDAP_DEBUG_TRACE,
680 "<= bdb_presense_candidates: (%s) "
681 "key read failed (%d)\n",
682 desc->ad_cname.bv_val, rc, 0 );
686 Debug(LDAP_DEBUG_TRACE,
687 "<= bdb_presence_candidates: id=%ld first=%ld last=%ld\n",
689 (long) BDB_IDL_FIRST(ids),
690 (long) BDB_IDL_LAST(ids) );
700 AttributeAssertion *ava,
704 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
709 struct berval prefix = {0, NULL};
710 struct berval *keys = NULL;
713 Debug( LDAP_DEBUG_TRACE, "=> bdb_equality_candidates (%s)\n",
714 ava->aa_desc->ad_cname.bv_val, 0, 0 );
716 BDB_IDL_ALL( bdb, ids );
718 rc = bdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
719 &db, &mask, &prefix );
721 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
722 Debug( LDAP_DEBUG_ANY,
723 "<= bdb_equality_candidates: (%s) not indexed\n",
724 ava->aa_desc->ad_cname.bv_val, 0, 0 );
728 if( rc != LDAP_SUCCESS ) {
729 Debug( LDAP_DEBUG_ANY,
730 "<= bdb_equality_candidates: (%s) "
731 "index_param failed (%d)\n",
732 ava->aa_desc->ad_cname.bv_val, rc, 0 );
736 mr = ava->aa_desc->ad_type->sat_equality;
741 if( !mr->smr_filter ) {
745 rc = (mr->smr_filter)(
746 LDAP_FILTER_EQUALITY,
748 ava->aa_desc->ad_type->sat_syntax,
752 &keys, op->o_tmpmemctx );
754 if( rc != LDAP_SUCCESS ) {
755 Debug( LDAP_DEBUG_TRACE,
756 "<= bdb_equality_candidates: (%s, %s) "
757 "MR filter failed (%d)\n",
758 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
763 Debug( LDAP_DEBUG_TRACE,
764 "<= bdb_equality_candidates: (%s) no keys\n",
765 ava->aa_desc->ad_cname.bv_val, 0, 0 );
769 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
770 rc = bdb_key_read( op->o_bd, db, locker, &keys[i], tmp, NULL, 0 );
772 if( rc == DB_NOTFOUND ) {
776 } else if( rc != LDAP_SUCCESS ) {
777 Debug( LDAP_DEBUG_TRACE,
778 "<= bdb_equality_candidates: (%s) "
779 "key read failed (%d)\n",
780 ava->aa_desc->ad_cname.bv_val, rc, 0 );
784 if( BDB_IDL_IS_ZERO( tmp ) ) {
785 Debug( LDAP_DEBUG_TRACE,
786 "<= bdb_equality_candidates: (%s) NULL\n",
787 ava->aa_desc->ad_cname.bv_val, 0, 0 );
793 BDB_IDL_CPY( ids, tmp );
795 bdb_idl_intersection( ids, tmp );
798 if( BDB_IDL_IS_ZERO( ids ) )
802 ber_bvarray_free_x( keys, op->o_tmpmemctx );
804 Debug( LDAP_DEBUG_TRACE,
805 "<= bdb_equality_candidates: id=%ld, first=%ld, last=%ld\n",
807 (long) BDB_IDL_FIRST(ids),
808 (long) BDB_IDL_LAST(ids) );
817 AttributeAssertion *ava,
821 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
826 struct berval prefix = {0, NULL};
827 struct berval *keys = NULL;
830 Debug( LDAP_DEBUG_TRACE, "=> bdb_approx_candidates (%s)\n",
831 ava->aa_desc->ad_cname.bv_val, 0, 0 );
833 BDB_IDL_ALL( bdb, ids );
835 rc = bdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_APPROX,
836 &db, &mask, &prefix );
838 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
839 Debug( LDAP_DEBUG_ANY,
840 "<= bdb_approx_candidates: (%s) not indexed\n",
841 ava->aa_desc->ad_cname.bv_val, 0, 0 );
845 if( rc != LDAP_SUCCESS ) {
846 Debug( LDAP_DEBUG_ANY,
847 "<= bdb_approx_candidates: (%s) "
848 "index_param failed (%d)\n",
849 ava->aa_desc->ad_cname.bv_val, rc, 0 );
853 mr = ava->aa_desc->ad_type->sat_approx;
855 /* no approx matching rule, try equality matching rule */
856 mr = ava->aa_desc->ad_type->sat_equality;
863 if( !mr->smr_filter ) {
867 rc = (mr->smr_filter)(
870 ava->aa_desc->ad_type->sat_syntax,
874 &keys, op->o_tmpmemctx );
876 if( rc != LDAP_SUCCESS ) {
877 Debug( LDAP_DEBUG_TRACE,
878 "<= bdb_approx_candidates: (%s, %s) "
879 "MR filter failed (%d)\n",
880 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
885 Debug( LDAP_DEBUG_TRACE,
886 "<= bdb_approx_candidates: (%s) no keys (%s)\n",
887 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, 0 );
891 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
892 rc = bdb_key_read( op->o_bd, db, locker, &keys[i], tmp, NULL, 0 );
894 if( rc == DB_NOTFOUND ) {
898 } else if( rc != LDAP_SUCCESS ) {
899 Debug( LDAP_DEBUG_TRACE,
900 "<= bdb_approx_candidates: (%s) "
901 "key read failed (%d)\n",
902 ava->aa_desc->ad_cname.bv_val, rc, 0 );
906 if( BDB_IDL_IS_ZERO( tmp ) ) {
907 Debug( LDAP_DEBUG_TRACE,
908 "<= bdb_approx_candidates: (%s) NULL\n",
909 ava->aa_desc->ad_cname.bv_val, 0, 0 );
915 BDB_IDL_CPY( ids, tmp );
917 bdb_idl_intersection( ids, tmp );
920 if( BDB_IDL_IS_ZERO( ids ) )
924 ber_bvarray_free_x( keys, op->o_tmpmemctx );
926 Debug( LDAP_DEBUG_TRACE, "<= bdb_approx_candidates %ld, first=%ld, last=%ld\n",
928 (long) BDB_IDL_FIRST(ids),
929 (long) BDB_IDL_LAST(ids) );
934 substring_candidates(
937 SubstringsAssertion *sub,
941 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
946 struct berval prefix = {0, NULL};
947 struct berval *keys = NULL;
950 Debug( LDAP_DEBUG_TRACE, "=> bdb_substring_candidates (%s)\n",
951 sub->sa_desc->ad_cname.bv_val, 0, 0 );
953 BDB_IDL_ALL( bdb, ids );
955 rc = bdb_index_param( op->o_bd, sub->sa_desc, LDAP_FILTER_SUBSTRINGS,
956 &db, &mask, &prefix );
958 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
959 Debug( LDAP_DEBUG_ANY,
960 "<= bdb_substring_candidates: (%s) not indexed\n",
961 sub->sa_desc->ad_cname.bv_val, 0, 0 );
965 if( rc != LDAP_SUCCESS ) {
966 Debug( LDAP_DEBUG_ANY,
967 "<= bdb_substring_candidates: (%s) "
968 "index_param failed (%d)\n",
969 sub->sa_desc->ad_cname.bv_val, rc, 0 );
973 mr = sub->sa_desc->ad_type->sat_substr;
979 if( !mr->smr_filter ) {
983 rc = (mr->smr_filter)(
984 LDAP_FILTER_SUBSTRINGS,
986 sub->sa_desc->ad_type->sat_syntax,
990 &keys, op->o_tmpmemctx );
992 if( rc != LDAP_SUCCESS ) {
993 Debug( LDAP_DEBUG_TRACE,
994 "<= bdb_substring_candidates: (%s) "
995 "MR filter failed (%d)\n",
996 sub->sa_desc->ad_cname.bv_val, rc, 0 );
1000 if( keys == NULL ) {
1001 Debug( LDAP_DEBUG_TRACE,
1002 "<= bdb_substring_candidates: (0x%04lx) no keys (%s)\n",
1003 mask, sub->sa_desc->ad_cname.bv_val, 0 );
1007 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
1008 rc = bdb_key_read( op->o_bd, db, locker, &keys[i], tmp, NULL, 0 );
1010 if( rc == DB_NOTFOUND ) {
1011 BDB_IDL_ZERO( ids );
1014 } else if( rc != LDAP_SUCCESS ) {
1015 Debug( LDAP_DEBUG_TRACE,
1016 "<= bdb_substring_candidates: (%s) "
1017 "key read failed (%d)\n",
1018 sub->sa_desc->ad_cname.bv_val, rc, 0 );
1022 if( BDB_IDL_IS_ZERO( tmp ) ) {
1023 Debug( LDAP_DEBUG_TRACE,
1024 "<= bdb_substring_candidates: (%s) NULL\n",
1025 sub->sa_desc->ad_cname.bv_val, 0, 0 );
1026 BDB_IDL_ZERO( ids );
1031 BDB_IDL_CPY( ids, tmp );
1033 bdb_idl_intersection( ids, tmp );
1036 if( BDB_IDL_IS_ZERO( ids ) )
1040 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1042 Debug( LDAP_DEBUG_TRACE, "<= bdb_substring_candidates: %ld, first=%ld, last=%ld\n",
1044 (long) BDB_IDL_FIRST(ids),
1045 (long) BDB_IDL_LAST(ids) );
1050 inequality_candidates(
1053 AttributeAssertion *ava,
1058 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1062 struct berval prefix = {0, NULL};
1063 struct berval *keys = NULL;
1065 DBC * cursor = NULL;
1067 Debug( LDAP_DEBUG_TRACE, "=> bdb_inequality_candidates (%s)\n",
1068 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1070 BDB_IDL_ALL( bdb, ids );
1072 rc = bdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
1073 &db, &mask, &prefix );
1075 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
1076 Debug( LDAP_DEBUG_ANY,
1077 "<= bdb_inequality_candidates: (%s) not indexed\n",
1078 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1082 if( rc != LDAP_SUCCESS ) {
1083 Debug( LDAP_DEBUG_ANY,
1084 "<= bdb_inequality_candidates: (%s) "
1085 "index_param failed (%d)\n",
1086 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1090 mr = ava->aa_desc->ad_type->sat_equality;
1095 if( !mr->smr_filter ) {
1099 rc = (mr->smr_filter)(
1100 LDAP_FILTER_EQUALITY,
1102 ava->aa_desc->ad_type->sat_syntax,
1106 &keys, op->o_tmpmemctx );
1108 if( rc != LDAP_SUCCESS ) {
1109 Debug( LDAP_DEBUG_TRACE,
1110 "<= bdb_inequality_candidates: (%s, %s) "
1111 "MR filter failed (%d)\n",
1112 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
1116 if( keys == NULL ) {
1117 Debug( LDAP_DEBUG_TRACE,
1118 "<= bdb_inequality_candidates: (%s) no keys\n",
1119 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1123 BDB_IDL_ZERO( ids );
1125 rc = bdb_key_read( op->o_bd, db, locker, &keys[0], tmp, &cursor, gtorlt );
1127 if( rc == DB_NOTFOUND ) {
1130 } else if( rc != LDAP_SUCCESS ) {
1131 Debug( LDAP_DEBUG_TRACE,
1132 "<= bdb_inequality_candidates: (%s) "
1133 "key read failed (%d)\n",
1134 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1138 if( BDB_IDL_IS_ZERO( tmp ) ) {
1139 Debug( LDAP_DEBUG_TRACE,
1140 "<= bdb_inequality_candidates: (%s) NULL\n",
1141 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1145 bdb_idl_union( ids, tmp );
1147 if( op->ors_limit && op->ors_limit->lms_s_unchecked != -1 &&
1148 BDB_IDL_N( ids ) >= (unsigned) op->ors_limit->lms_s_unchecked ) {
1149 cursor->c_close( cursor );
1153 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1155 Debug( LDAP_DEBUG_TRACE,
1156 "<= bdb_inequality_candidates: id=%ld, first=%ld, last=%ld\n",
1158 (long) BDB_IDL_FIRST(ids),
1159 (long) BDB_IDL_LAST(ids) );