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-2011 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 ) {
491 rc = mdb_dn2id( op, rtxn, &mra->ma_value, &id, NULL );
492 if ( rc == MDB_SUCCESS ) {
493 mdb_idl_insert( ids, id );
496 } else if ( mra->ma_rule && mra->ma_rule->smr_match ==
497 dnRelativeMatch && dnIsSuffix( &mra->ma_value,
498 op->o_bd->be_nsuffix )) {
500 if ( mra->ma_rule == slap_schema.si_mr_dnSuperiorMatch ) {
502 dnParent( &mra->ma_value, &pdn );
503 rc = mdb_dn2id( op, rtxn, &pdn, &id, NULL );
504 if ( rc == MDB_SUCCESS ) {
505 while ( ei && ei->bei_id ) {
506 mdb_idl_insert( ids, ei->bei_id );
512 if ( mra->ma_rule == slap_schema.si_mr_dnSubtreeMatch )
513 scope = LDAP_SCOPE_SUBTREE;
514 else if ( mra->ma_rule == slap_schema.si_mr_dnOneLevelMatch )
515 scope = LDAP_SCOPE_ONELEVEL;
516 else if ( mra->ma_rule == slap_schema.si_mr_dnSubordinateMatch )
517 scope = LDAP_SCOPE_SUBORDINATE;
519 scope = LDAP_SCOPE_BASE;
520 if ( scope > LDAP_SCOPE_BASE ) {
522 rc = mdb_cache_find_ndn( op, rtxn, &mra->ma_value, &ei );
524 mdb_cache_entryinfo_unlock( ei );
525 if ( rc == LDAP_SUCCESS ) {
526 int sc = op->ors_scope;
527 op->ors_scope = scope;
528 rc = mdb_dn2idl( op, rtxn, &mra->ma_value, ei, ids,
554 Debug( LDAP_DEBUG_FILTER, "=> mdb_list_candidates 0x%x\n", ftype, 0, 0 );
555 for ( f = flist; f != NULL; f = f->f_next ) {
556 /* ignore precomputed scopes */
557 if ( f->f_choice == SLAPD_FILTER_COMPUTED &&
558 f->f_result == LDAP_SUCCESS ) {
561 MDB_IDL_ZERO( save );
562 rc = mdb_filter_candidates( op, rtxn, f, save, tmp,
563 save+MDB_IDL_UM_SIZE );
566 if ( ftype == LDAP_FILTER_AND ) {
574 if ( ftype == LDAP_FILTER_AND ) {
576 MDB_IDL_CPY( ids, save );
578 mdb_idl_intersection( ids, save );
580 if( MDB_IDL_IS_ZERO( ids ) )
584 MDB_IDL_CPY( ids, save );
586 mdb_idl_union( ids, save );
591 if( rc == LDAP_SUCCESS ) {
592 Debug( LDAP_DEBUG_FILTER,
593 "<= mdb_list_candidates: id=%ld first=%ld last=%ld\n",
595 (long) MDB_IDL_FIRST(ids),
596 (long) MDB_IDL_LAST(ids) );
599 Debug( LDAP_DEBUG_FILTER,
600 "<= mdb_list_candidates: undefined rc=%d\n",
611 AttributeDescription *desc,
617 struct berval prefix = {0, NULL};
619 Debug( LDAP_DEBUG_TRACE, "=> mdb_presence_candidates (%s)\n",
620 desc->ad_cname.bv_val, 0, 0 );
624 if( desc == slap_schema.si_ad_objectClass ) {
628 rc = mdb_index_param( op->o_bd, desc, LDAP_FILTER_PRESENT,
629 &dbi, &mask, &prefix );
631 if( rc == LDAP_INAPPROPRIATE_MATCHING ) {
633 Debug( LDAP_DEBUG_TRACE,
634 "<= mdb_presence_candidates: (%s) not indexed\n",
635 desc->ad_cname.bv_val, 0, 0 );
639 if( rc != LDAP_SUCCESS ) {
640 Debug( LDAP_DEBUG_TRACE,
641 "<= mdb_presence_candidates: (%s) index_param "
643 desc->ad_cname.bv_val, rc, 0 );
647 if( prefix.bv_val == NULL ) {
648 Debug( LDAP_DEBUG_TRACE,
649 "<= mdb_presence_candidates: (%s) no prefix\n",
650 desc->ad_cname.bv_val, 0, 0 );
654 rc = mdb_key_read( op->o_bd, rtxn, dbi, &prefix, ids, NULL, 0 );
656 if( rc == MDB_NOTFOUND ) {
659 } else if( rc != LDAP_SUCCESS ) {
660 Debug( LDAP_DEBUG_TRACE,
661 "<= mdb_presense_candidates: (%s) "
662 "key read failed (%d)\n",
663 desc->ad_cname.bv_val, rc, 0 );
667 Debug(LDAP_DEBUG_TRACE,
668 "<= mdb_presence_candidates: id=%ld first=%ld last=%ld\n",
670 (long) MDB_IDL_FIRST(ids),
671 (long) MDB_IDL_LAST(ids) );
681 AttributeAssertion *ava,
685 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
690 struct berval prefix = {0, NULL};
691 struct berval *keys = NULL;
694 Debug( LDAP_DEBUG_TRACE, "=> mdb_equality_candidates (%s)\n",
695 ava->aa_desc->ad_cname.bv_val, 0, 0 );
697 if ( ava->aa_desc == slap_schema.si_ad_entryDN ) {
699 rc = mdb_dn2id( op, rtxn, &ava->aa_value, &id, NULL );
700 if ( rc == LDAP_SUCCESS ) {
701 /* exactly one ID can match */
710 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
711 &dbi, &mask, &prefix );
713 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
714 Debug( LDAP_DEBUG_ANY,
715 "<= mdb_equality_candidates: (%s) not indexed\n",
716 ava->aa_desc->ad_cname.bv_val, 0, 0 );
720 if( rc != LDAP_SUCCESS ) {
721 Debug( LDAP_DEBUG_ANY,
722 "<= mdb_equality_candidates: (%s) "
723 "index_param failed (%d)\n",
724 ava->aa_desc->ad_cname.bv_val, rc, 0 );
728 mr = ava->aa_desc->ad_type->sat_equality;
733 if( !mr->smr_filter ) {
737 rc = (mr->smr_filter)(
738 LDAP_FILTER_EQUALITY,
740 ava->aa_desc->ad_type->sat_syntax,
744 &keys, op->o_tmpmemctx );
746 if( rc != LDAP_SUCCESS ) {
747 Debug( LDAP_DEBUG_TRACE,
748 "<= mdb_equality_candidates: (%s, %s) "
749 "MR filter failed (%d)\n",
750 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
755 Debug( LDAP_DEBUG_TRACE,
756 "<= mdb_equality_candidates: (%s) no keys\n",
757 ava->aa_desc->ad_cname.bv_val, 0, 0 );
761 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
762 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
764 if( rc == MDB_NOTFOUND ) {
768 } else if( rc != LDAP_SUCCESS ) {
769 Debug( LDAP_DEBUG_TRACE,
770 "<= mdb_equality_candidates: (%s) "
771 "key read failed (%d)\n",
772 ava->aa_desc->ad_cname.bv_val, rc, 0 );
776 if( MDB_IDL_IS_ZERO( tmp ) ) {
777 Debug( LDAP_DEBUG_TRACE,
778 "<= mdb_equality_candidates: (%s) NULL\n",
779 ava->aa_desc->ad_cname.bv_val, 0, 0 );
785 MDB_IDL_CPY( ids, tmp );
787 mdb_idl_intersection( ids, tmp );
790 if( MDB_IDL_IS_ZERO( ids ) )
794 ber_bvarray_free_x( keys, op->o_tmpmemctx );
796 Debug( LDAP_DEBUG_TRACE,
797 "<= mdb_equality_candidates: id=%ld, first=%ld, last=%ld\n",
799 (long) MDB_IDL_FIRST(ids),
800 (long) MDB_IDL_LAST(ids) );
809 AttributeAssertion *ava,
817 struct berval prefix = {0, NULL};
818 struct berval *keys = NULL;
821 Debug( LDAP_DEBUG_TRACE, "=> mdb_approx_candidates (%s)\n",
822 ava->aa_desc->ad_cname.bv_val, 0, 0 );
826 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_APPROX,
827 &dbi, &mask, &prefix );
829 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
830 Debug( LDAP_DEBUG_ANY,
831 "<= mdb_approx_candidates: (%s) not indexed\n",
832 ava->aa_desc->ad_cname.bv_val, 0, 0 );
836 if( rc != LDAP_SUCCESS ) {
837 Debug( LDAP_DEBUG_ANY,
838 "<= mdb_approx_candidates: (%s) "
839 "index_param failed (%d)\n",
840 ava->aa_desc->ad_cname.bv_val, rc, 0 );
844 mr = ava->aa_desc->ad_type->sat_approx;
846 /* no approx matching rule, try equality matching rule */
847 mr = ava->aa_desc->ad_type->sat_equality;
854 if( !mr->smr_filter ) {
858 rc = (mr->smr_filter)(
861 ava->aa_desc->ad_type->sat_syntax,
865 &keys, op->o_tmpmemctx );
867 if( rc != LDAP_SUCCESS ) {
868 Debug( LDAP_DEBUG_TRACE,
869 "<= mdb_approx_candidates: (%s, %s) "
870 "MR filter failed (%d)\n",
871 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
876 Debug( LDAP_DEBUG_TRACE,
877 "<= mdb_approx_candidates: (%s) no keys (%s)\n",
878 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, 0 );
882 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
883 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
885 if( rc == MDB_NOTFOUND ) {
889 } else if( rc != LDAP_SUCCESS ) {
890 Debug( LDAP_DEBUG_TRACE,
891 "<= mdb_approx_candidates: (%s) "
892 "key read failed (%d)\n",
893 ava->aa_desc->ad_cname.bv_val, rc, 0 );
897 if( MDB_IDL_IS_ZERO( tmp ) ) {
898 Debug( LDAP_DEBUG_TRACE,
899 "<= mdb_approx_candidates: (%s) NULL\n",
900 ava->aa_desc->ad_cname.bv_val, 0, 0 );
906 MDB_IDL_CPY( ids, tmp );
908 mdb_idl_intersection( ids, tmp );
911 if( MDB_IDL_IS_ZERO( ids ) )
915 ber_bvarray_free_x( keys, op->o_tmpmemctx );
917 Debug( LDAP_DEBUG_TRACE, "<= mdb_approx_candidates %ld, first=%ld, last=%ld\n",
919 (long) MDB_IDL_FIRST(ids),
920 (long) MDB_IDL_LAST(ids) );
925 substring_candidates(
928 SubstringsAssertion *sub,
936 struct berval prefix = {0, NULL};
937 struct berval *keys = NULL;
940 Debug( LDAP_DEBUG_TRACE, "=> mdb_substring_candidates (%s)\n",
941 sub->sa_desc->ad_cname.bv_val, 0, 0 );
945 rc = mdb_index_param( op->o_bd, sub->sa_desc, LDAP_FILTER_SUBSTRINGS,
946 &dbi, &mask, &prefix );
948 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
949 Debug( LDAP_DEBUG_ANY,
950 "<= mdb_substring_candidates: (%s) not indexed\n",
951 sub->sa_desc->ad_cname.bv_val, 0, 0 );
955 if( rc != LDAP_SUCCESS ) {
956 Debug( LDAP_DEBUG_ANY,
957 "<= mdb_substring_candidates: (%s) "
958 "index_param failed (%d)\n",
959 sub->sa_desc->ad_cname.bv_val, rc, 0 );
963 mr = sub->sa_desc->ad_type->sat_substr;
969 if( !mr->smr_filter ) {
973 rc = (mr->smr_filter)(
974 LDAP_FILTER_SUBSTRINGS,
976 sub->sa_desc->ad_type->sat_syntax,
980 &keys, op->o_tmpmemctx );
982 if( rc != LDAP_SUCCESS ) {
983 Debug( LDAP_DEBUG_TRACE,
984 "<= mdb_substring_candidates: (%s) "
985 "MR filter failed (%d)\n",
986 sub->sa_desc->ad_cname.bv_val, rc, 0 );
991 Debug( LDAP_DEBUG_TRACE,
992 "<= mdb_substring_candidates: (0x%04lx) no keys (%s)\n",
993 mask, sub->sa_desc->ad_cname.bv_val, 0 );
997 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
998 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
1000 if( rc == MDB_NOTFOUND ) {
1001 MDB_IDL_ZERO( ids );
1004 } else if( rc != LDAP_SUCCESS ) {
1005 Debug( LDAP_DEBUG_TRACE,
1006 "<= mdb_substring_candidates: (%s) "
1007 "key read failed (%d)\n",
1008 sub->sa_desc->ad_cname.bv_val, rc, 0 );
1012 if( MDB_IDL_IS_ZERO( tmp ) ) {
1013 Debug( LDAP_DEBUG_TRACE,
1014 "<= mdb_substring_candidates: (%s) NULL\n",
1015 sub->sa_desc->ad_cname.bv_val, 0, 0 );
1016 MDB_IDL_ZERO( ids );
1021 MDB_IDL_CPY( ids, tmp );
1023 mdb_idl_intersection( ids, tmp );
1026 if( MDB_IDL_IS_ZERO( ids ) )
1030 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1032 Debug( LDAP_DEBUG_TRACE, "<= mdb_substring_candidates: %ld, first=%ld, last=%ld\n",
1034 (long) MDB_IDL_FIRST(ids),
1035 (long) MDB_IDL_LAST(ids) );
1040 inequality_candidates(
1043 AttributeAssertion *ava,
1051 struct berval prefix = {0, NULL};
1052 struct berval *keys = NULL;
1054 MDB_cursor *cursor = NULL;
1056 Debug( LDAP_DEBUG_TRACE, "=> mdb_inequality_candidates (%s)\n",
1057 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1061 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
1062 &dbi, &mask, &prefix );
1064 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
1065 Debug( LDAP_DEBUG_ANY,
1066 "<= mdb_inequality_candidates: (%s) not indexed\n",
1067 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1071 if( rc != LDAP_SUCCESS ) {
1072 Debug( LDAP_DEBUG_ANY,
1073 "<= mdb_inequality_candidates: (%s) "
1074 "index_param failed (%d)\n",
1075 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1079 mr = ava->aa_desc->ad_type->sat_equality;
1084 if( !mr->smr_filter ) {
1088 rc = (mr->smr_filter)(
1089 LDAP_FILTER_EQUALITY,
1091 ava->aa_desc->ad_type->sat_syntax,
1095 &keys, op->o_tmpmemctx );
1097 if( rc != LDAP_SUCCESS ) {
1098 Debug( LDAP_DEBUG_TRACE,
1099 "<= mdb_inequality_candidates: (%s, %s) "
1100 "MR filter failed (%d)\n",
1101 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
1105 if( keys == NULL ) {
1106 Debug( LDAP_DEBUG_TRACE,
1107 "<= mdb_inequality_candidates: (%s) no keys\n",
1108 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1112 MDB_IDL_ZERO( ids );
1114 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[0], tmp, &cursor, gtorlt );
1116 if( rc == MDB_NOTFOUND ) {
1119 } else if( rc != LDAP_SUCCESS ) {
1120 Debug( LDAP_DEBUG_TRACE,
1121 "<= mdb_inequality_candidates: (%s) "
1122 "key read failed (%d)\n",
1123 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1127 if( MDB_IDL_IS_ZERO( tmp ) ) {
1128 Debug( LDAP_DEBUG_TRACE,
1129 "<= mdb_inequality_candidates: (%s) NULL\n",
1130 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1134 mdb_idl_union( ids, tmp );
1136 if( op->ors_limit && op->ors_limit->lms_s_unchecked != -1 &&
1137 MDB_IDL_N( ids ) >= (unsigned) op->ors_limit->lms_s_unchecked ) {
1138 mdb_cursor_close( cursor );
1142 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1144 Debug( LDAP_DEBUG_TRACE,
1145 "<= mdb_inequality_candidates: id=%ld, first=%ld, last=%ld\n",
1147 (long) MDB_IDL_FIRST(ids),
1148 (long) MDB_IDL_LAST(ids) );