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-2012 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 );
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 );
694 if ( rc == LDAP_SUCCESS ) {
695 /* exactly one ID can match */
704 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
705 &dbi, &mask, &prefix );
707 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
708 Debug( LDAP_DEBUG_ANY,
709 "<= mdb_equality_candidates: (%s) not indexed\n",
710 ava->aa_desc->ad_cname.bv_val, 0, 0 );
714 if( rc != LDAP_SUCCESS ) {
715 Debug( LDAP_DEBUG_ANY,
716 "<= mdb_equality_candidates: (%s) "
717 "index_param failed (%d)\n",
718 ava->aa_desc->ad_cname.bv_val, rc, 0 );
722 mr = ava->aa_desc->ad_type->sat_equality;
727 if( !mr->smr_filter ) {
731 rc = (mr->smr_filter)(
732 LDAP_FILTER_EQUALITY,
734 ava->aa_desc->ad_type->sat_syntax,
738 &keys, op->o_tmpmemctx );
740 if( rc != LDAP_SUCCESS ) {
741 Debug( LDAP_DEBUG_TRACE,
742 "<= mdb_equality_candidates: (%s, %s) "
743 "MR filter failed (%d)\n",
744 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
749 Debug( LDAP_DEBUG_TRACE,
750 "<= mdb_equality_candidates: (%s) no keys\n",
751 ava->aa_desc->ad_cname.bv_val, 0, 0 );
755 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
756 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
758 if( rc == MDB_NOTFOUND ) {
762 } else if( rc != LDAP_SUCCESS ) {
763 Debug( LDAP_DEBUG_TRACE,
764 "<= mdb_equality_candidates: (%s) "
765 "key read failed (%d)\n",
766 ava->aa_desc->ad_cname.bv_val, rc, 0 );
770 if( MDB_IDL_IS_ZERO( tmp ) ) {
771 Debug( LDAP_DEBUG_TRACE,
772 "<= mdb_equality_candidates: (%s) NULL\n",
773 ava->aa_desc->ad_cname.bv_val, 0, 0 );
779 MDB_IDL_CPY( ids, tmp );
781 mdb_idl_intersection( ids, tmp );
784 if( MDB_IDL_IS_ZERO( ids ) )
788 ber_bvarray_free_x( keys, op->o_tmpmemctx );
790 Debug( LDAP_DEBUG_TRACE,
791 "<= mdb_equality_candidates: id=%ld, first=%ld, last=%ld\n",
793 (long) MDB_IDL_FIRST(ids),
794 (long) MDB_IDL_LAST(ids) );
803 AttributeAssertion *ava,
811 struct berval prefix = {0, NULL};
812 struct berval *keys = NULL;
815 Debug( LDAP_DEBUG_TRACE, "=> mdb_approx_candidates (%s)\n",
816 ava->aa_desc->ad_cname.bv_val, 0, 0 );
820 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_APPROX,
821 &dbi, &mask, &prefix );
823 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
824 Debug( LDAP_DEBUG_ANY,
825 "<= mdb_approx_candidates: (%s) not indexed\n",
826 ava->aa_desc->ad_cname.bv_val, 0, 0 );
830 if( rc != LDAP_SUCCESS ) {
831 Debug( LDAP_DEBUG_ANY,
832 "<= mdb_approx_candidates: (%s) "
833 "index_param failed (%d)\n",
834 ava->aa_desc->ad_cname.bv_val, rc, 0 );
838 mr = ava->aa_desc->ad_type->sat_approx;
840 /* no approx matching rule, try equality matching rule */
841 mr = ava->aa_desc->ad_type->sat_equality;
848 if( !mr->smr_filter ) {
852 rc = (mr->smr_filter)(
855 ava->aa_desc->ad_type->sat_syntax,
859 &keys, op->o_tmpmemctx );
861 if( rc != LDAP_SUCCESS ) {
862 Debug( LDAP_DEBUG_TRACE,
863 "<= mdb_approx_candidates: (%s, %s) "
864 "MR filter failed (%d)\n",
865 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
870 Debug( LDAP_DEBUG_TRACE,
871 "<= mdb_approx_candidates: (%s) no keys (%s)\n",
872 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, 0 );
876 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
877 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
879 if( rc == MDB_NOTFOUND ) {
883 } else if( rc != LDAP_SUCCESS ) {
884 Debug( LDAP_DEBUG_TRACE,
885 "<= mdb_approx_candidates: (%s) "
886 "key read failed (%d)\n",
887 ava->aa_desc->ad_cname.bv_val, rc, 0 );
891 if( MDB_IDL_IS_ZERO( tmp ) ) {
892 Debug( LDAP_DEBUG_TRACE,
893 "<= mdb_approx_candidates: (%s) NULL\n",
894 ava->aa_desc->ad_cname.bv_val, 0, 0 );
900 MDB_IDL_CPY( ids, tmp );
902 mdb_idl_intersection( ids, tmp );
905 if( MDB_IDL_IS_ZERO( ids ) )
909 ber_bvarray_free_x( keys, op->o_tmpmemctx );
911 Debug( LDAP_DEBUG_TRACE, "<= mdb_approx_candidates %ld, first=%ld, last=%ld\n",
913 (long) MDB_IDL_FIRST(ids),
914 (long) MDB_IDL_LAST(ids) );
919 substring_candidates(
922 SubstringsAssertion *sub,
930 struct berval prefix = {0, NULL};
931 struct berval *keys = NULL;
934 Debug( LDAP_DEBUG_TRACE, "=> mdb_substring_candidates (%s)\n",
935 sub->sa_desc->ad_cname.bv_val, 0, 0 );
939 rc = mdb_index_param( op->o_bd, sub->sa_desc, LDAP_FILTER_SUBSTRINGS,
940 &dbi, &mask, &prefix );
942 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
943 Debug( LDAP_DEBUG_ANY,
944 "<= mdb_substring_candidates: (%s) not indexed\n",
945 sub->sa_desc->ad_cname.bv_val, 0, 0 );
949 if( rc != LDAP_SUCCESS ) {
950 Debug( LDAP_DEBUG_ANY,
951 "<= mdb_substring_candidates: (%s) "
952 "index_param failed (%d)\n",
953 sub->sa_desc->ad_cname.bv_val, rc, 0 );
957 mr = sub->sa_desc->ad_type->sat_substr;
963 if( !mr->smr_filter ) {
967 rc = (mr->smr_filter)(
968 LDAP_FILTER_SUBSTRINGS,
970 sub->sa_desc->ad_type->sat_syntax,
974 &keys, op->o_tmpmemctx );
976 if( rc != LDAP_SUCCESS ) {
977 Debug( LDAP_DEBUG_TRACE,
978 "<= mdb_substring_candidates: (%s) "
979 "MR filter failed (%d)\n",
980 sub->sa_desc->ad_cname.bv_val, rc, 0 );
985 Debug( LDAP_DEBUG_TRACE,
986 "<= mdb_substring_candidates: (0x%04lx) no keys (%s)\n",
987 mask, sub->sa_desc->ad_cname.bv_val, 0 );
991 for ( i= 0; keys[i].bv_val != NULL; i++ ) {
992 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[i], tmp, NULL, 0 );
994 if( rc == MDB_NOTFOUND ) {
998 } else if( rc != LDAP_SUCCESS ) {
999 Debug( LDAP_DEBUG_TRACE,
1000 "<= mdb_substring_candidates: (%s) "
1001 "key read failed (%d)\n",
1002 sub->sa_desc->ad_cname.bv_val, rc, 0 );
1006 if( MDB_IDL_IS_ZERO( tmp ) ) {
1007 Debug( LDAP_DEBUG_TRACE,
1008 "<= mdb_substring_candidates: (%s) NULL\n",
1009 sub->sa_desc->ad_cname.bv_val, 0, 0 );
1010 MDB_IDL_ZERO( ids );
1015 MDB_IDL_CPY( ids, tmp );
1017 mdb_idl_intersection( ids, tmp );
1020 if( MDB_IDL_IS_ZERO( ids ) )
1024 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1026 Debug( LDAP_DEBUG_TRACE, "<= mdb_substring_candidates: %ld, first=%ld, last=%ld\n",
1028 (long) MDB_IDL_FIRST(ids),
1029 (long) MDB_IDL_LAST(ids) );
1034 inequality_candidates(
1037 AttributeAssertion *ava,
1045 struct berval prefix = {0, NULL};
1046 struct berval *keys = NULL;
1048 MDB_cursor *cursor = NULL;
1050 Debug( LDAP_DEBUG_TRACE, "=> mdb_inequality_candidates (%s)\n",
1051 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1055 rc = mdb_index_param( op->o_bd, ava->aa_desc, LDAP_FILTER_EQUALITY,
1056 &dbi, &mask, &prefix );
1058 if ( rc == LDAP_INAPPROPRIATE_MATCHING ) {
1059 Debug( LDAP_DEBUG_ANY,
1060 "<= mdb_inequality_candidates: (%s) not indexed\n",
1061 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1065 if( rc != LDAP_SUCCESS ) {
1066 Debug( LDAP_DEBUG_ANY,
1067 "<= mdb_inequality_candidates: (%s) "
1068 "index_param failed (%d)\n",
1069 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1073 mr = ava->aa_desc->ad_type->sat_equality;
1078 if( !mr->smr_filter ) {
1082 rc = (mr->smr_filter)(
1083 LDAP_FILTER_EQUALITY,
1085 ava->aa_desc->ad_type->sat_syntax,
1089 &keys, op->o_tmpmemctx );
1091 if( rc != LDAP_SUCCESS ) {
1092 Debug( LDAP_DEBUG_TRACE,
1093 "<= mdb_inequality_candidates: (%s, %s) "
1094 "MR filter failed (%d)\n",
1095 prefix.bv_val, ava->aa_desc->ad_cname.bv_val, rc );
1099 if( keys == NULL ) {
1100 Debug( LDAP_DEBUG_TRACE,
1101 "<= mdb_inequality_candidates: (%s) no keys\n",
1102 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1106 MDB_IDL_ZERO( ids );
1108 rc = mdb_key_read( op->o_bd, rtxn, dbi, &keys[0], tmp, &cursor, gtorlt );
1110 if( rc == MDB_NOTFOUND ) {
1113 } else if( rc != LDAP_SUCCESS ) {
1114 Debug( LDAP_DEBUG_TRACE,
1115 "<= mdb_inequality_candidates: (%s) "
1116 "key read failed (%d)\n",
1117 ava->aa_desc->ad_cname.bv_val, rc, 0 );
1121 if( MDB_IDL_IS_ZERO( tmp ) ) {
1122 Debug( LDAP_DEBUG_TRACE,
1123 "<= mdb_inequality_candidates: (%s) NULL\n",
1124 ava->aa_desc->ad_cname.bv_val, 0, 0 );
1128 mdb_idl_union( ids, tmp );
1130 if( op->ors_limit && op->ors_limit->lms_s_unchecked != -1 &&
1131 MDB_IDL_N( ids ) >= (unsigned) op->ors_limit->lms_s_unchecked ) {
1132 mdb_cursor_close( cursor );
1136 ber_bvarray_free_x( keys, op->o_tmpmemctx );
1138 Debug( LDAP_DEBUG_TRACE,
1139 "<= mdb_inequality_candidates: id=%ld, first=%ld, last=%ld\n",
1141 (long) MDB_IDL_FIRST(ids),
1142 (long) MDB_IDL_LAST(ids) );