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-2014 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 mdb_filter_candidates(
110 #ifdef LDAP_COMP_MATCH
111 AttributeAliasing *aa;
113 Debug( LDAP_DEBUG_FILTER, "=> mdb_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:
135 /* this is a pre-computed scope, leave it alone */
139 case LDAP_FILTER_PRESENT:
140 Debug( LDAP_DEBUG_FILTER, "\tPRESENT\n", 0, 0, 0 );
141 rc = presence_candidates( op, rtxn, f->f_desc, ids );
144 case LDAP_FILTER_EQUALITY:
145 Debug( LDAP_DEBUG_FILTER, "\tEQUALITY\n", 0, 0, 0 );
146 #ifdef LDAP_COMP_MATCH
147 if ( is_aliased_attribute && ( aa = is_aliased_attribute ( f->f_ava->aa_desc ) ) ) {
148 rc = ava_comp_candidates ( op, rtxn, f->f_ava, aa, ids, tmp, stack );
153 rc = equality_candidates( op, rtxn, f->f_ava, ids, tmp );
157 case LDAP_FILTER_APPROX:
158 Debug( LDAP_DEBUG_FILTER, "\tAPPROX\n", 0, 0, 0 );
159 rc = approx_candidates( op, rtxn, f->f_ava, ids, tmp );
162 case LDAP_FILTER_SUBSTRINGS:
163 Debug( LDAP_DEBUG_FILTER, "\tSUBSTRINGS\n", 0, 0, 0 );
164 rc = substring_candidates( op, rtxn, f->f_sub, ids, tmp );
168 /* if no GE index, use pres */
169 Debug( LDAP_DEBUG_FILTER, "\tGE\n", 0, 0, 0 );
170 if( f->f_ava->aa_desc->ad_type->sat_ordering &&
171 ( f->f_ava->aa_desc->ad_type->sat_ordering->smr_usage & SLAP_MR_ORDERED_INDEX ) )
172 rc = inequality_candidates( op, rtxn, f->f_ava, ids, tmp, LDAP_FILTER_GE );
174 rc = presence_candidates( op, rtxn, f->f_ava->aa_desc, ids );
178 /* if no LE index, use pres */
179 Debug( LDAP_DEBUG_FILTER, "\tLE\n", 0, 0, 0 );
180 if( f->f_ava->aa_desc->ad_type->sat_ordering &&
181 ( f->f_ava->aa_desc->ad_type->sat_ordering->smr_usage & SLAP_MR_ORDERED_INDEX ) )
182 rc = inequality_candidates( op, rtxn, f->f_ava, ids, tmp, LDAP_FILTER_LE );
184 rc = presence_candidates( op, rtxn, f->f_ava->aa_desc, ids );
187 case LDAP_FILTER_NOT:
188 /* no indexing to support NOT filters */
189 Debug( LDAP_DEBUG_FILTER, "\tNOT\n", 0, 0, 0 );
193 case LDAP_FILTER_AND:
194 Debug( LDAP_DEBUG_FILTER, "\tAND\n", 0, 0, 0 );
195 rc = list_candidates( op, rtxn,
196 f->f_and, LDAP_FILTER_AND, ids, tmp, stack );
200 Debug( LDAP_DEBUG_FILTER, "\tOR\n", 0, 0, 0 );
201 rc = list_candidates( op, rtxn,
202 f->f_or, LDAP_FILTER_OR, ids, tmp, stack );
204 case LDAP_FILTER_EXT:
205 Debug( LDAP_DEBUG_FILTER, "\tEXT\n", 0, 0, 0 );
206 rc = ext_candidates( op, rtxn, f->f_mra, ids, tmp, stack );
209 Debug( LDAP_DEBUG_FILTER, "\tUNKNOWN %lu\n",
210 (unsigned long) f->f_choice, 0, 0 );
211 /* Must not return NULL, otherwise extended filters break */
216 Debug( LDAP_DEBUG_FILTER,
217 "<= mdb_filter_candidates: id=%ld first=%ld last=%ld\n",
219 (long) MDB_IDL_FIRST( ids ),
220 (long) MDB_IDL_LAST( ids ) );
225 #ifdef LDAP_COMP_MATCH
227 comp_list_candidates(
230 MatchingRuleAssertion* mra,
231 ComponentFilter *flist,
240 Debug( LDAP_DEBUG_FILTER, "=> comp_list_candidates 0x%x\n", ftype, 0, 0 );
241 for ( f = flist; f != NULL; f = f->cf_next ) {
242 /* ignore precomputed scopes */
243 if ( f->cf_choice == SLAPD_FILTER_COMPUTED &&
244 f->cf_result == LDAP_SUCCESS ) {
247 MDB_IDL_ZERO( save );
248 rc = comp_candidates( op, rtxn, mra, f, save, tmp, save+MDB_IDL_UM_SIZE );
251 if ( ftype == LDAP_COMP_FILTER_AND ) {
258 if ( ftype == LDAP_COMP_FILTER_AND ) {
260 MDB_IDL_CPY( ids, save );
262 mdb_idl_intersection( ids, save );
264 if( MDB_IDL_IS_ZERO( ids ) )
268 MDB_IDL_CPY( ids, save );
270 mdb_idl_union( ids, save );
275 if( rc == LDAP_SUCCESS ) {
276 Debug( LDAP_DEBUG_FILTER,
277 "<= comp_list_candidates: id=%ld first=%ld last=%ld\n",
279 (long) MDB_IDL_FIRST(ids),
280 (long) MDB_IDL_LAST(ids) );
283 Debug( LDAP_DEBUG_FILTER,
284 "<= comp_list_candidates: undefined rc=%d\n",
292 comp_equality_candidates (
295 MatchingRuleAssertion *mra,
296 ComponentAssertion *ca,
305 struct berval prefix = {0, NULL};
306 struct berval *keys = NULL;
307 MatchingRule *mr = mra->ma_rule;
309 ComponentReference* cr_list, *cr;
314 if ( !ca->ca_comp_ref )
317 ai = mdb_attr_mask( op->o_bd->be_private, mra->ma_desc );
324 /* find a component reference to be indexed */
325 sat_syntax = ca->ca_ma_rule->smr_syntax;
326 for ( cr = cr_list ; cr ; cr = cr->cr_next ) {
327 if ( cr->cr_string.bv_len == ca->ca_comp_ref->cr_string.bv_len &&
328 strncmp( cr->cr_string.bv_val, ca->ca_comp_ref->cr_string.bv_val,cr->cr_string.bv_len ) == 0 )
335 rc = mdb_index_param( op->o_bd, mra->ma_desc, LDAP_FILTER_EQUALITY,
336 &dbi, &mask, &prefix );
338 if( rc != LDAP_SUCCESS ) {
346 if( !mr->smr_filter ) {
350 rc = (ca->ca_ma_rule->smr_filter)(
351 LDAP_FILTER_EQUALITY,
357 &keys, op->o_tmpmemctx );
359 if( rc != LDAP_SUCCESS ) {
366 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
367 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
369 if( rc == MDB_NOTFOUND ) {
373 } else if( rc != LDAP_SUCCESS ) {
377 if( MDB_IDL_IS_ZERO( tmp ) ) {
383 MDB_IDL_CPY( ids, tmp );
385 mdb_idl_intersection( ids, tmp );
388 if( MDB_IDL_IS_ZERO( ids ) )
391 ber_bvarray_free_x( keys, op->o_tmpmemctx );
393 Debug( LDAP_DEBUG_TRACE,
394 "<= comp_equality_candidates: id=%ld, first=%ld, last=%ld\n",
396 (long) MDB_IDL_FIRST(ids),
397 (long) MDB_IDL_LAST(ids) );
402 ava_comp_candidates (
405 AttributeAssertion *ava,
406 AttributeAliasing *aa,
411 MatchingRuleAssertion mra;
413 mra.ma_rule = ava->aa_desc->ad_type->sat_equality;
414 if ( !mra.ma_rule ) {
418 mra.ma_desc = aa->aa_aliased_ad;
419 mra.ma_rule = ava->aa_desc->ad_type->sat_equality;
421 return comp_candidates ( op, rtxn, &mra, ava->aa_cf, ids, tmp, stack );
428 MatchingRuleAssertion *mra,
436 if ( !f ) return LDAP_PROTOCOL_ERROR;
438 Debug( LDAP_DEBUG_FILTER, "comp_candidates\n", 0, 0, 0 );
439 switch ( f->cf_choice ) {
440 case SLAPD_FILTER_COMPUTED:
443 case LDAP_COMP_FILTER_AND:
444 rc = comp_list_candidates( op, rtxn, mra, f->cf_and, LDAP_COMP_FILTER_AND, ids, tmp, stack );
446 case LDAP_COMP_FILTER_OR:
447 rc = comp_list_candidates( op, rtxn, mra, f->cf_or, LDAP_COMP_FILTER_OR, ids, tmp, stack );
449 case LDAP_COMP_FILTER_NOT:
450 /* No component indexing supported for NOT filter */
451 Debug( LDAP_DEBUG_FILTER, "\tComponent NOT\n", 0, 0, 0 );
453 rc = LDAP_PROTOCOL_ERROR;
455 case LDAP_COMP_FILTER_ITEM:
456 rc = comp_equality_candidates( op, rtxn, mra, f->cf_ca, ids, tmp, stack );
460 rc = LDAP_PROTOCOL_ERROR;
471 MatchingRuleAssertion *mra,
476 #ifdef LDAP_COMP_MATCH
478 * Currently Only Component Indexing for componentFilterMatch is supported
479 * Indexing for an extensible filter is not supported yet
482 return comp_candidates ( op, rtxn, mra, mra->ma_cf, ids, tmp, stack);
485 if ( mra->ma_desc == slap_schema.si_ad_entryDN ) {
490 if ( mra->ma_rule == slap_schema.si_mr_distinguishedNameMatch ) {
492 rc = mdb_dn2id( op, rtxn, NULL, &mra->ma_value, &id, NULL, NULL, NULL );
493 if ( rc == MDB_SUCCESS ) {
494 mdb_idl_insert( ids, id );
497 } else if ( mra->ma_rule && mra->ma_rule->smr_match ==
498 dnRelativeMatch && dnIsSuffix( &mra->ma_value,
499 op->o_bd->be_nsuffix )) {
501 if ( mra->ma_rule == slap_schema.si_mr_dnSuperiorMatch ) {
502 mdb_dn2sups( op, rtxn, &mra->ma_value, ids );
505 if ( mra->ma_rule == slap_schema.si_mr_dnSubtreeMatch )
506 scope = LDAP_SCOPE_SUBTREE;
507 else if ( mra->ma_rule == slap_schema.si_mr_dnOneLevelMatch )
508 scope = LDAP_SCOPE_ONELEVEL;
509 else if ( mra->ma_rule == slap_schema.si_mr_dnSubordinateMatch )
510 scope = LDAP_SCOPE_SUBORDINATE;
512 goto base; /* scope = LDAP_SCOPE_BASE; */
514 if ( scope > LDAP_SCOPE_BASE ) {
516 rc = mdb_cache_find_ndn( op, rtxn, &mra->ma_value, &ei );
518 mdb_cache_entryinfo_unlock( ei );
519 if ( rc == LDAP_SUCCESS ) {
520 int sc = op->ors_scope;
521 op->ors_scope = scope;
522 rc = mdb_dn2idl( op, rtxn, &mra->ma_value, ei, ids,
549 Debug( LDAP_DEBUG_FILTER, "=> mdb_list_candidates 0x%x\n", ftype, 0, 0 );
550 for ( f = flist; f != NULL; f = f->f_next ) {
551 /* ignore precomputed scopes */
552 if ( f->f_choice == SLAPD_FILTER_COMPUTED &&
553 f->f_result == LDAP_SUCCESS ) {
556 MDB_IDL_ZERO( save );
557 rc = mdb_filter_candidates( op, rtxn, f, save, tmp,
558 save+MDB_IDL_UM_SIZE );
561 if ( ftype == LDAP_FILTER_AND ) {
569 if ( ftype == LDAP_FILTER_AND ) {
571 MDB_IDL_CPY( ids, save );
573 mdb_idl_intersection( ids, save );
575 if( MDB_IDL_IS_ZERO( ids ) )
579 MDB_IDL_CPY( ids, save );
581 mdb_idl_union( ids, save );
586 if( rc == LDAP_SUCCESS ) {
587 Debug( LDAP_DEBUG_FILTER,
588 "<= mdb_list_candidates: id=%ld first=%ld last=%ld\n",
590 (long) MDB_IDL_FIRST(ids),
591 (long) MDB_IDL_LAST(ids) );
594 Debug( LDAP_DEBUG_FILTER,
595 "<= mdb_list_candidates: undefined rc=%d\n",
606 AttributeDescription *desc,
612 struct berval prefix = {0, NULL};
614 Debug( LDAP_DEBUG_TRACE, "=> mdb_presence_candidates (%s)\n",
615 desc->ad_cname.bv_val, 0, 0 );
619 if( desc == slap_schema.si_ad_objectClass ) {
623 rc = mdb_index_param( op->o_bd, desc, LDAP_FILTER_PRESENT,
624 &dbi, &mask, &prefix );
626 if( rc == LDAP_INAPPROPRIATE_MATCHING ) {
628 Debug( LDAP_DEBUG_TRACE,
629 "<= mdb_presence_candidates: (%s) not indexed\n",
630 desc->ad_cname.bv_val, 0, 0 );
634 if( rc != LDAP_SUCCESS ) {
635 Debug( LDAP_DEBUG_TRACE,
636 "<= mdb_presence_candidates: (%s) index_param "
638 desc->ad_cname.bv_val, rc, 0 );
642 if( prefix.bv_val == NULL ) {
643 Debug( LDAP_DEBUG_TRACE,
644 "<= mdb_presence_candidates: (%s) no prefix\n",
645 desc->ad_cname.bv_val, 0, 0 );
649 rc = mdb_key_read( op->o_bd, rtxn, dbi, &prefix, ids, NULL, 0 );
651 if( rc == MDB_NOTFOUND ) {
654 } else if( rc != LDAP_SUCCESS ) {
655 Debug( LDAP_DEBUG_TRACE,
656 "<= mdb_presense_candidates: (%s) "
657 "key read failed (%d)\n",
658 desc->ad_cname.bv_val, rc, 0 );
662 Debug(LDAP_DEBUG_TRACE,
663 "<= mdb_presence_candidates: id=%ld first=%ld last=%ld\n",
665 (long) MDB_IDL_FIRST(ids),
666 (long) MDB_IDL_LAST(ids) );
676 AttributeAssertion *ava,
684 struct berval prefix = {0, NULL};
685 struct berval *keys = NULL;
688 Debug( LDAP_DEBUG_TRACE, "=> mdb_equality_candidates (%s)\n",
689 ava->aa_desc->ad_cname.bv_val, 0, 0 );
691 if ( ava->aa_desc == slap_schema.si_ad_entryDN ) {
693 rc = mdb_dn2id( op, rtxn, NULL, &ava->aa_value, &id, NULL, NULL, NULL );
694 if ( rc == LDAP_SUCCESS ) {
695 /* exactly one ID can match */
699 if ( rc == MDB_NOTFOUND ) {
708 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
709 &dbi, &mask, &prefix );
711 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
712 Debug( LDAP_DEBUG_ANY,
713 "<= mdb_equality_candidates: (%s) not indexed\n",
714 ava->aa_desc->ad_cname.bv_val, 0, 0 );
718 if( rc != LDAP_SUCCESS ) {
719 Debug( LDAP_DEBUG_ANY,
720 "<= mdb_equality_candidates: (%s) "
721 "index_param failed (%d)\n",
722 ava->aa_desc->ad_cname.bv_val, rc, 0 );
726 mr = ava->aa_desc->ad_type->sat_equality;
731 if( !mr->smr_filter ) {
735 rc = (mr->smr_filter)(
736 LDAP_FILTER_EQUALITY,
738 ava->aa_desc->ad_type->sat_syntax,
742 &keys, op->o_tmpmemctx );
744 if( rc != LDAP_SUCCESS ) {
745 Debug( LDAP_DEBUG_TRACE,
746 "<= mdb_equality_candidates: (%s, %s) "
747 "MR filter failed (%d)\n",
748 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
753 Debug( LDAP_DEBUG_TRACE,
754 "<= mdb_equality_candidates: (%s) no keys\n",
755 ava->aa_desc->ad_cname.bv_val, 0, 0 );
759 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
760 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
762 if( rc == MDB_NOTFOUND ) {
766 } else if( rc != LDAP_SUCCESS ) {
767 Debug( LDAP_DEBUG_TRACE,
768 "<= mdb_equality_candidates: (%s) "
769 "key read failed (%d)\n",
770 ava->aa_desc->ad_cname.bv_val, rc, 0 );
774 if( MDB_IDL_IS_ZERO( tmp ) ) {
775 Debug( LDAP_DEBUG_TRACE,
776 "<= mdb_equality_candidates: (%s) NULL\n",
777 ava->aa_desc->ad_cname.bv_val, 0, 0 );
783 MDB_IDL_CPY( ids, tmp );
785 mdb_idl_intersection( ids, tmp );
788 if( MDB_IDL_IS_ZERO( ids ) )
792 ber_bvarray_free_x( keys, op->o_tmpmemctx );
794 Debug( LDAP_DEBUG_TRACE,
795 "<= mdb_equality_candidates: id=%ld, first=%ld, last=%ld\n",
797 (long) MDB_IDL_FIRST(ids),
798 (long) MDB_IDL_LAST(ids) );
807 AttributeAssertion *ava,
815 struct berval prefix = {0, NULL};
816 struct berval *keys = NULL;
819 Debug( LDAP_DEBUG_TRACE, "=> mdb_approx_candidates (%s)\n",
820 ava->aa_desc->ad_cname.bv_val, 0, 0 );
824 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_APPROX,
825 &dbi, &mask, &prefix );
827 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
828 Debug( LDAP_DEBUG_ANY,
829 "<= mdb_approx_candidates: (%s) not indexed\n",
830 ava->aa_desc->ad_cname.bv_val, 0, 0 );
834 if( rc != LDAP_SUCCESS ) {
835 Debug( LDAP_DEBUG_ANY,
836 "<= mdb_approx_candidates: (%s) "
837 "index_param failed (%d)\n",
838 ava->aa_desc->ad_cname.bv_val, rc, 0 );
842 mr = ava->aa_desc->ad_type->sat_approx;
844 /* no approx matching rule, try equality matching rule */
845 mr = ava->aa_desc->ad_type->sat_equality;
852 if( !mr->smr_filter ) {
856 rc = (mr->smr_filter)(
859 ava->aa_desc->ad_type->sat_syntax,
863 &keys, op->o_tmpmemctx );
865 if( rc != LDAP_SUCCESS ) {
866 Debug( LDAP_DEBUG_TRACE,
867 "<= mdb_approx_candidates: (%s, %s) "
868 "MR filter failed (%d)\n",
869 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
874 Debug( LDAP_DEBUG_TRACE,
875 "<= mdb_approx_candidates: (%s) no keys (%s)\n",
876 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, 0 );
880 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
881 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
883 if( rc == MDB_NOTFOUND ) {
887 } else if( rc != LDAP_SUCCESS ) {
888 Debug( LDAP_DEBUG_TRACE,
889 "<= mdb_approx_candidates: (%s) "
890 "key read failed (%d)\n",
891 ava->aa_desc->ad_cname.bv_val, rc, 0 );
895 if( MDB_IDL_IS_ZERO( tmp ) ) {
896 Debug( LDAP_DEBUG_TRACE,
897 "<= mdb_approx_candidates: (%s) NULL\n",
898 ava->aa_desc->ad_cname.bv_val, 0, 0 );
904 MDB_IDL_CPY( ids, tmp );
906 mdb_idl_intersection( ids, tmp );
909 if( MDB_IDL_IS_ZERO( ids ) )
913 ber_bvarray_free_x( keys, op->o_tmpmemctx );
915 Debug( LDAP_DEBUG_TRACE, "<= mdb_approx_candidates %ld, first=%ld, last=%ld\n",
917 (long) MDB_IDL_FIRST(ids),
918 (long) MDB_IDL_LAST(ids) );
923 substring_candidates(
926 SubstringsAssertion *sub,
934 struct berval prefix = {0, NULL};
935 struct berval *keys = NULL;
938 Debug( LDAP_DEBUG_TRACE, "=> mdb_substring_candidates (%s)\n",
939 sub->sa_desc->ad_cname.bv_val, 0, 0 );
943 rc = mdb_index_param( op->o_bd, sub->sa_desc, LDAP_FILTER_SUBSTRINGS,
944 &dbi, &mask, &prefix );
946 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
947 Debug( LDAP_DEBUG_ANY,
948 "<= mdb_substring_candidates: (%s) not indexed\n",
949 sub->sa_desc->ad_cname.bv_val, 0, 0 );
953 if( rc != LDAP_SUCCESS ) {
954 Debug( LDAP_DEBUG_ANY,
955 "<= mdb_substring_candidates: (%s) "
956 "index_param failed (%d)\n",
957 sub->sa_desc->ad_cname.bv_val, rc, 0 );
961 mr = sub->sa_desc->ad_type->sat_substr;
967 if( !mr->smr_filter ) {
971 rc = (mr->smr_filter)(
972 LDAP_FILTER_SUBSTRINGS,
974 sub->sa_desc->ad_type->sat_syntax,
978 &keys, op->o_tmpmemctx );
980 if( rc != LDAP_SUCCESS ) {
981 Debug( LDAP_DEBUG_TRACE,
982 "<= mdb_substring_candidates: (%s) "
983 "MR filter failed (%d)\n",
984 sub->sa_desc->ad_cname.bv_val, rc, 0 );
989 Debug( LDAP_DEBUG_TRACE,
990 "<= mdb_substring_candidates: (0x%04lx) no keys (%s)\n",
991 mask, sub->sa_desc->ad_cname.bv_val, 0 );
995 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
996 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
998 if( rc == MDB_NOTFOUND ) {
1002 } else if( rc != LDAP_SUCCESS ) {
1003 Debug( LDAP_DEBUG_TRACE,
1004 "<= mdb_substring_candidates: (%s) "
1005 "key read failed (%d)\n",
1006 sub->sa_desc->ad_cname.bv_val, rc, 0 );
1010 if( MDB_IDL_IS_ZERO( tmp ) ) {
1011 Debug( LDAP_DEBUG_TRACE,
1012 "<= mdb_substring_candidates: (%s) NULL\n",
1013 sub->sa_desc->ad_cname.bv_val, 0, 0 );
1014 MDB_IDL_ZERO( ids );
1019 MDB_IDL_CPY( ids, tmp );
1021 mdb_idl_intersection( ids, tmp );
1024 if( MDB_IDL_IS_ZERO( ids ) )
1028 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1030 Debug( LDAP_DEBUG_TRACE, "<= mdb_substring_candidates: %ld, first=%ld, last=%ld\n",
1032 (long) MDB_IDL_FIRST(ids),
1033 (long) MDB_IDL_LAST(ids) );
1038 inequality_candidates(
1041 AttributeAssertion *ava,
1049 struct berval prefix = {0, NULL};
1050 struct berval *keys = NULL;
1052 MDB_cursor *cursor = NULL;
1054 Debug( LDAP_DEBUG_TRACE, "=> mdb_inequality_candidates (%s)\n",
1055 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1059 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
1060 &dbi, &mask, &prefix );
1062 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
1063 Debug( LDAP_DEBUG_ANY,
1064 "<= mdb_inequality_candidates: (%s) not indexed\n",
1065 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1069 if( rc != LDAP_SUCCESS ) {
1070 Debug( LDAP_DEBUG_ANY,
1071 "<= mdb_inequality_candidates: (%s) "
1072 "index_param failed (%d)\n",
1073 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1077 mr = ava->aa_desc->ad_type->sat_equality;
1082 if( !mr->smr_filter ) {
1086 rc = (mr->smr_filter)(
1087 LDAP_FILTER_EQUALITY,
1089 ava->aa_desc->ad_type->sat_syntax,
1093 &keys, op->o_tmpmemctx );
1095 if( rc != LDAP_SUCCESS ) {
1096 Debug( LDAP_DEBUG_TRACE,
1097 "<= mdb_inequality_candidates: (%s, %s) "
1098 "MR filter failed (%d)\n",
1099 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
1103 if( keys == NULL ) {
1104 Debug( LDAP_DEBUG_TRACE,
1105 "<= mdb_inequality_candidates: (%s) no keys\n",
1106 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1110 MDB_IDL_ZERO( ids );
1112 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[0], tmp, &cursor, gtorlt );
1114 if( rc == MDB_NOTFOUND ) {
1117 } else if( rc != LDAP_SUCCESS ) {
1118 Debug( LDAP_DEBUG_TRACE,
1119 "<= mdb_inequality_candidates: (%s) "
1120 "key read failed (%d)\n",
1121 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1125 if( MDB_IDL_IS_ZERO( tmp ) ) {
1126 Debug( LDAP_DEBUG_TRACE,
1127 "<= mdb_inequality_candidates: (%s) NULL\n",
1128 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1132 mdb_idl_union( ids, tmp );
1134 if( op->ors_limit && op->ors_limit->lms_s_unchecked != -1 &&
1135 MDB_IDL_N( ids ) >= (unsigned) op->ors_limit->lms_s_unchecked ) {
1136 mdb_cursor_close( cursor );
1140 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1142 Debug( LDAP_DEBUG_TRACE,
1143 "<= mdb_inequality_candidates: id=%ld, first=%ld, last=%ld\n",
1145 (long) MDB_IDL_FIRST(ids),
1146 (long) MDB_IDL_LAST(ids) );