indxpath.c File Reference
#include "postgres.h"#include <math.h>#include "access/stratnum.h"#include "access/sysattr.h"#include "catalog/pg_am.h"#include "catalog/pg_amop.h"#include "catalog/pg_operator.h"#include "catalog/pg_opfamily.h"#include "catalog/pg_type.h"#include "nodes/makefuncs.h"#include "nodes/nodeFuncs.h"#include "nodes/supportnodes.h"#include "optimizer/cost.h"#include "optimizer/optimizer.h"#include "optimizer/pathnode.h"#include "optimizer/paths.h"#include "optimizer/prep.h"#include "optimizer/restrictinfo.h"#include "utils/lsyscache.h"#include "utils/selfuncs.h"
Include dependency graph for indxpath.c:
Go to the source code of this file.
Data Structures | |
| struct | IndexClauseSet |
| struct | PathClauseUsage |
| struct | ec_member_matches_arg |
| struct | OrArgIndexMatch |
Macros | |
| #define | IndexCollMatchesExprColl(idxcollation, exprcollation) ((idxcollation) == InvalidOid || (idxcollation) == (exprcollation)) |
Enumerations | |
| enum | ScanTypeControl { ST_INDEXSCAN , ST_BITMAPSCAN , ST_ANYSCAN } |
Macro Definition Documentation
◆ IndexCollMatchesExprColl
| #define IndexCollMatchesExprColl | ( | idxcollation, | |
| exprcollation | |||
| ) | ((idxcollation) == InvalidOid || (idxcollation) == (exprcollation)) |
Definition at line 41 of file indxpath.c.
Enumeration Type Documentation
◆ ScanTypeControl
| enum ScanTypeControl |
| Enumerator | |
|---|---|
| ST_INDEXSCAN | |
| ST_BITMAPSCAN | |
| ST_ANYSCAN | |
Definition at line 45 of file indxpath.c.
46{
50} ScanTypeControl;
Function Documentation
◆ adjust_rowcount_for_semijoins()
|
static |
Definition at line 2379 of file indxpath.c.
2383{
2384 ListCell *lc;
2385
2387 {
2389
2393 {
2394 /* Estimate number of unique-ified rows */
2395 double nraw;
2396 double nunique;
2397
2400 sjinfo->semi_rhs_exprs,
2401 nraw,
2402 NULL,
2403 NULL);
2404 if (rowcount > nunique)
2405 rowcount = nunique;
2406 }
2407 }
2408 return rowcount;
2409}
static double approximate_joinrel_size(PlannerInfo *root, Relids relids)
Definition: indxpath.c:2423
double estimate_num_groups(PlannerInfo *root, List *groupExprs, double input_rows, List **pgset, EstimationInfo *estinfo)
Definition: selfuncs.c:3446
Definition: pathnodes.h:3026
Definition: pg_list.h:46
References approximate_joinrel_size(), bms_is_member(), estimate_num_groups(), JOIN_SEMI, SpecialJoinInfo::jointype, lfirst, root, SpecialJoinInfo::semi_rhs_exprs, SpecialJoinInfo::syn_lefthand, and SpecialJoinInfo::syn_righthand.
Referenced by get_loop_count().
◆ approximate_joinrel_size()
|
static |
Definition at line 2423 of file indxpath.c.
2424{
2425 double rowcount = 1.0;
2426 int relid;
2427
2428 relid = -1;
2430 {
2431 RelOptInfo *rel;
2432
2433 /* Paranoia: ignore bogus relid indexes */
2435 continue;
2436 rel = root->simple_rel_array[relid];
2437 if (rel == NULL)
2438 continue;
2440
2441 /* Relation could be proven empty, if so ignore */
2443 continue;
2444
2445 /* Otherwise, rel's rows estimate should be valid by now */
2447
2448 /* Accumulate product */
2449 rowcount *= rel->rows;
2450 }
2451 return rowcount;
2452}
Assert(PointerIsAligned(start, uint64))
Definition: pathnodes.h:887
References Assert(), bms_next_member(), IS_DUMMY_REL, RelOptInfo::relid, root, and RelOptInfo::rows.
Referenced by adjust_rowcount_for_semijoins().
◆ bitmap_and_cost_est()
|
static |
Definition at line 2057 of file indxpath.c.
2058{
2059 BitmapAndPath *apath;
2060
2061 /*
2062 * Might as well build a real BitmapAndPath here, as the work is slightly
2063 * too complicated to be worth repeating just to save one palloc.
2064 */
2066
2068}
static Cost bitmap_scan_cost_est(PlannerInfo *root, RelOptInfo *rel, Path *ipath)
Definition: indxpath.c:2023
BitmapAndPath * create_bitmap_and_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
Definition: pathnode.c:1131
Definition: pathnodes.h:1932
Definition: pathnodes.h:1756
References bitmap_scan_cost_est(), create_bitmap_and_path(), and root.
Referenced by choose_bitmap_and().
◆ bitmap_scan_cost_est()
|
static |
Definition at line 2023 of file indxpath.c.
2024{
2025 BitmapHeapPath bpath;
2026
2027 /* Set up a dummy BitmapHeapPath */
2028 bpath.path.type = T_BitmapHeapPath;
2030 bpath.path.parent = rel;
2032 bpath.path.param_info = ipath->param_info;
2034 bpath.bitmapqual = ipath;
2035
2036 /*
2037 * Check the cost of temporary path without considering parallelism.
2038 * Parallel bitmap heap path will be considered at later stage.
2039 */
2041
2042 /* Now we can do cost_bitmap_heap_scan */
2044 bpath.path.param_info,
2045 ipath,
2047 PATH_REQ_OUTER(ipath)));
2048
2050}
void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info, Path *bitmapqual, double loop_count)
Definition: costsize.c:1023
static double get_loop_count(PlannerInfo *root, Index cur_relid, Relids outer_relids)
Definition: indxpath.c:2326
Definition: pathnodes.h:1920
References BitmapHeapPath::bitmapqual, cost_bitmap_heap_scan(), get_loop_count(), NIL, Path::parallel_workers, BitmapHeapPath::path, PATH_REQ_OUTER, Path::pathkeys, Path::pathtype, RelOptInfo::relid, RelOptInfo::reltarget, root, and Path::total_cost.
Referenced by bitmap_and_cost_est(), and choose_bitmap_and().
◆ build_index_paths()
|
static |
Definition at line 809 of file indxpath.c.
814{
816 IndexPath *ipath;
817 List *index_clauses;
818 Relids outer_relids;
819 double loop_count;
820 List *orderbyclauses;
821 List *orderbyclausecols;
822 List *index_pathkeys;
823 List *useful_pathkeys;
824 bool pathkeys_possibly_useful;
825 bool index_is_ordered;
826 bool index_only_scan;
827 int indexcol;
828
830
831 /*
832 * Check that index supports the desired scan type(s)
833 */
834 switch (scantype)
835 {
839 break;
843 break;
845 /* either or both are OK */
846 break;
847 }
848
849 /*
850 * 1. Combine the per-column IndexClause lists into an overall list.
851 *
852 * In the resulting list, clauses are ordered by index key, so that the
853 * column numbers form a nondecreasing sequence. (This order is depended
854 * on by btree and possibly other places.) The list can be empty, if the
855 * index AM allows that.
856 *
857 * We also build a Relids set showing which outer rels are required by the
858 * selected clauses. Any lateral_relids are included in that, but not
859 * otherwise accounted for.
860 */
861 index_clauses = NIL;
864 {
865 ListCell *lc;
866
868 {
871
874 {
875 /*
876 * Caller asked us to generate IndexPaths that omit any
877 * ScalarArrayOpExpr clauses when the underlying index AM
878 * lacks native support.
879 *
880 * We must omit this clause (and tell caller about it).
881 */
882 *skip_nonnative_saop = true;
883 continue;
884 }
885
886 /* OK to include this clause */
887 index_clauses = lappend(index_clauses, iclause);
888 outer_relids = bms_add_members(outer_relids,
889 rinfo->clause_relids);
890 }
891
892 /*
893 * If no clauses match the first index column, check for amoptionalkey
894 * restriction. We can't generate a scan over an index with
895 * amoptionalkey = false unless there's at least one index clause.
896 * (When working on columns after the first, this test cannot fail. It
897 * is always okay for columns after the first to not have any
898 * clauses.)
899 */
902 }
903
904 /* We do not want the index's rel itself listed in outer_relids */
906
907 /* Compute loop_count for cost estimation purposes */
909
910 /*
911 * 2. Compute pathkeys describing index's ordering, if any, then see how
912 * many of them are actually useful for this query. This is not relevant
913 * if we are only trying to build bitmap indexscans.
914 */
915 pathkeys_possibly_useful = (scantype != ST_BITMAPSCAN &&
917 index_is_ordered = (index->sortopfamily != NULL);
918 if (index_is_ordered && pathkeys_possibly_useful)
919 {
921 ForwardScanDirection);
923 index_pathkeys);
924 orderbyclauses = NIL;
925 orderbyclausecols = NIL;
926 }
928 {
929 /*
930 * See if we can generate ordering operators for query_pathkeys or at
931 * least some prefix thereof. Matching to just a prefix of the
932 * query_pathkeys will allow an incremental sort to be considered on
933 * the index's partially sorted results.
934 */
936 &orderbyclauses,
937 &orderbyclausecols);
939 useful_pathkeys = root->query_pathkeys;
940 else
942 list_length(orderbyclauses));
943 }
944 else
945 {
946 useful_pathkeys = NIL;
947 orderbyclauses = NIL;
948 orderbyclausecols = NIL;
949 }
950
951 /*
952 * 3. Check if an index-only scan is possible. If we're not building
953 * plain indexscans, this isn't relevant since bitmap scans don't support
954 * index data retrieval anyway.
955 */
956 index_only_scan = (scantype != ST_BITMAPSCAN &&
958
959 /*
960 * 4. Generate an indexscan path if there are relevant restriction clauses
961 * in the current clauses, OR the index ordering is potentially useful for
962 * later merging or final output ordering, OR the index has a useful
963 * predicate, OR an index-only scan is possible.
964 */
966 index_only_scan)
967 {
969 index_clauses,
970 orderbyclauses,
971 orderbyclausecols,
972 useful_pathkeys,
973 ForwardScanDirection,
974 index_only_scan,
975 outer_relids,
976 loop_count,
977 false);
978 result = lappend(result, ipath);
979
980 /*
981 * If appropriate, consider parallel index scan. We don't allow
982 * parallel index scan for bitmap index scans.
983 */
985 rel->consider_parallel && outer_relids == NULL &&
986 scantype != ST_BITMAPSCAN)
987 {
989 index_clauses,
990 orderbyclauses,
991 orderbyclausecols,
992 useful_pathkeys,
993 ForwardScanDirection,
994 index_only_scan,
995 outer_relids,
996 loop_count,
997 true);
998
999 /*
1000 * if, after costing the path, we find that it's not worth using
1001 * parallel workers, just free it.
1002 */
1005 else
1006 pfree(ipath);
1007 }
1008 }
1009
1010 /*
1011 * 5. If the index is ordered, a backwards scan might be interesting.
1012 */
1013 if (index_is_ordered && pathkeys_possibly_useful)
1014 {
1016 BackwardScanDirection);
1018 index_pathkeys);
1020 {
1022 index_clauses,
1023 NIL,
1024 NIL,
1025 useful_pathkeys,
1026 BackwardScanDirection,
1027 index_only_scan,
1028 outer_relids,
1029 loop_count,
1030 false);
1031 result = lappend(result, ipath);
1032
1033 /* If appropriate, consider parallel index scan */
1035 rel->consider_parallel && outer_relids == NULL &&
1036 scantype != ST_BITMAPSCAN)
1037 {
1039 index_clauses,
1040 NIL,
1041 NIL,
1042 useful_pathkeys,
1043 BackwardScanDirection,
1044 index_only_scan,
1045 outer_relids,
1046 loop_count,
1047 true);
1048
1049 /*
1050 * if, after costing the path, we find that it's not worth
1051 * using parallel workers, just free it.
1052 */
1055 else
1056 pfree(ipath);
1057 }
1058 }
1059 }
1060
1061 return result;
1062}
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:917
static bool check_index_only(RelOptInfo *rel, IndexOptInfo *index)
Definition: indxpath.c:2227
static void match_pathkeys_to_index(IndexOptInfo *index, List *pathkeys, List **orderby_clauses_p, List **clause_columns_p)
Definition: indxpath.c:3741
List * truncate_useless_pathkeys(PlannerInfo *root, RelOptInfo *rel, List *pathkeys)
Definition: pathkeys.c:2270
bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel)
Definition: pathkeys.c:2319
List * build_index_pathkeys(PlannerInfo *root, IndexOptInfo *index, ScanDirection scandir)
Definition: pathkeys.c:740
IndexPath * create_index_path(PlannerInfo *root, IndexOptInfo *index, List *indexclauses, List *indexorderbys, List *indexorderbycols, List *pathkeys, ScanDirection indexscandir, bool indexonly, Relids required_outer, double loop_count, bool partial_path)
Definition: pathnode.c:1049
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:795
Definition: bitmapset.h:50
Definition: pathnodes.h:1891
Definition: pathnodes.h:1845
Definition: pg_list.h:54
Definition: pathnodes.h:2694
Definition: primnodes.h:911
References add_partial_path(), Assert(), BackwardScanDirection, bms_add_members(), bms_copy(), bms_del_member(), build_index_pathkeys(), check_index_only(), RestrictInfo::clause, RelOptInfo::consider_parallel, create_index_path(), ForwardScanDirection, get_loop_count(), has_useful_pathkeys(), IndexClauseSet::indexclauses, IsA, lappend(), RelOptInfo::lateral_relids, lfirst, list_copy_head(), list_length(), match_pathkeys_to_index(), NIL, Path::parallel_workers, IndexPath::path, pfree(), RelOptInfo::relid, IndexClause::rinfo, root, ST_ANYSCAN, ST_BITMAPSCAN, ST_INDEXSCAN, and truncate_useless_pathkeys().
Referenced by build_paths_for_OR(), and get_index_paths().
◆ build_paths_for_OR()
|
static |
Definition at line 1091 of file indxpath.c.
1093{
1096 ListCell *lc;
1097
1099 {
1101 IndexClauseSet clauseset;
1102 List *indexpaths;
1103 bool useful_predicate;
1104
1105 /* Ignore index if it doesn't support bitmap scans */
1107 continue;
1108
1109 /*
1110 * Ignore partial indexes that do not match the query. If a partial
1111 * index is marked predOK then we know it's OK. Otherwise, we have to
1112 * test whether the added clauses are sufficient to imply the
1113 * predicate. If so, we can use the index in the current context.
1114 *
1115 * We set useful_predicate to true iff the predicate was proven using
1116 * the current set of clauses. This is needed to prevent matching a
1117 * predOK index to an arm of an OR, which would be a legal but
1118 * pointlessly inefficient plan. (A better plan will be generated by
1119 * just scanning the predOK index alone, no OR.)
1120 */
1121 useful_predicate = false;
1123 {
1125 {
1126 /* Usable, but don't set useful_predicate */
1127 }
1128 else
1129 {
1130 /* Form all_clauses if not done already */
1132 all_clauses = list_concat_copy(clauses, other_clauses);
1133
1135 continue; /* can't use it at all */
1136
1138 useful_predicate = true;
1139 }
1140 }
1141
1142 /*
1143 * Identify the restriction clauses that can match the index.
1144 */
1147
1148 /*
1149 * If no matches so far, and the index predicate isn't useful, we
1150 * don't want it.
1151 */
1153 continue;
1154
1155 /*
1156 * Add "other" restriction clauses to the clauseset.
1157 */
1159
1160 /*
1161 * Construct paths if possible.
1162 */
1164 index, &clauseset,
1165 useful_predicate,
1166 ST_BITMAPSCAN,
1167 NULL);
1168 result = list_concat(result, indexpaths);
1169 }
1170
1171 return result;
1172}
static List * build_index_paths(PlannerInfo *root, RelOptInfo *rel, IndexOptInfo *index, IndexClauseSet *clauses, bool useful_predicate, ScanTypeControl scantype, bool *skip_nonnative_saop)
Definition: indxpath.c:809
static void match_clauses_to_index(PlannerInfo *root, List *clauses, IndexOptInfo *index, IndexClauseSet *clauseset)
Definition: indxpath.c:2553
bool predicate_implied_by(List *predicate_list, List *clause_list, bool weak)
Definition: predtest.c:152
Definition: indxpath.c:54
Definition: pathnodes.h:1140
References build_index_paths(), RelOptInfo::indexlist, lfirst, list_concat(), list_concat_copy(), match_clauses_to_index(), MemSet, NIL, IndexClauseSet::nonempty, predicate_implied_by(), root, and ST_BITMAPSCAN.
Referenced by generate_bitmap_or_paths(), and make_bitmap_paths_for_or_group().
◆ check_index_only()
|
static |
Definition at line 2227 of file indxpath.c.
2228{
2229 bool result;
2230 Bitmapset *attrs_used = NULL;
2231 Bitmapset *index_canreturn_attrs = NULL;
2232 ListCell *lc;
2234
2235 /* Index-only scans must be enabled */
2237 return false;
2238
2239 /*
2240 * Check that all needed attributes of the relation are available from the
2241 * index.
2242 */
2243
2244 /*
2245 * First, identify all the attributes needed for joins or final output.
2246 * Note: we must look at rel's targetlist, not the attr_needed data,
2247 * because attr_needed isn't computed for inheritance child rels.
2248 */
2250
2251 /*
2252 * Add all the attributes used by restriction clauses; but consider only
2253 * those clauses not implied by the index predicate, since ones that are
2254 * so implied don't need to be checked explicitly in the plan.
2255 *
2256 * Note: attributes used only in index quals would not be needed at
2257 * runtime either, if we are certain that the index is not lossy. However
2258 * it'd be complicated to account for that accurately, and it doesn't
2259 * matter in most cases, since we'd conclude that such attributes are
2260 * available from the index anyway.
2261 */
2263 {
2265
2267 }
2268
2269 /*
2270 * Construct a bitmapset of columns that the index can return back in an
2271 * index-only scan.
2272 */
2274 {
2276
2277 /*
2278 * For the moment, we just ignore index expressions. It might be nice
2279 * to do something with them, later.
2280 */
2281 if (attno == 0)
2282 continue;
2283
2285 index_canreturn_attrs =
2286 bms_add_member(index_canreturn_attrs,
2287 attno - FirstLowInvalidHeapAttributeNumber);
2288 }
2289
2290 /* Do we have all the necessary attributes? */
2291 result = bms_is_subset(attrs_used, index_canreturn_attrs);
2292
2293 bms_free(attrs_used);
2294 bms_free(index_canreturn_attrs);
2295
2296 return result;
2297}
Definition: nodes.h:135
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
void pull_varattnos(Node *node, Index varno, Bitmapset **varattnos)
Definition: var.c:296
References bms_add_member(), bms_free(), bms_is_subset(), RestrictInfo::clause, enable_indexonlyscan, PathTarget::exprs, FirstLowInvalidHeapAttributeNumber, i, lfirst, pull_varattnos(), RelOptInfo::relid, and RelOptInfo::reltarget.
Referenced by build_index_paths().
◆ check_index_predicates()
| void check_index_predicates | ( | PlannerInfo * | root, |
| RelOptInfo * | rel | ||
| ) |
Definition at line 3966 of file indxpath.c.
3967{
3968 List *clauselist;
3969 bool have_partial;
3970 bool is_target_rel;
3971 Relids otherrels;
3972 ListCell *lc;
3973
3974 /* Indexes are available only on base or "other" member relations. */
3976
3977 /*
3978 * Initialize the indrestrictinfo lists to be identical to
3979 * baserestrictinfo, and check whether there are any partial indexes. If
3980 * not, this is all we need to do.
3981 */
3982 have_partial = false;
3984 {
3986
3989 have_partial = true;
3990 }
3991 if (!have_partial)
3992 return;
3993
3994 /*
3995 * Construct a list of clauses that we can assume true for the purpose of
3996 * proving the index(es) usable. Restriction clauses for the rel are
3997 * always usable, and so are any join clauses that are "movable to" this
3998 * rel. Also, we can consider any EC-derivable join clauses (which must
3999 * be "movable to" this rel, by definition).
4000 */
4002
4003 /* Scan the rel's join clauses */
4005 {
4007
4008 /* Check if clause can be moved to this rel */
4010 continue;
4011
4012 clauselist = lappend(clauselist, rinfo);
4013 }
4014
4015 /*
4016 * Add on any equivalence-derivable join clauses. Computing the correct
4017 * relid sets for generate_join_implied_equalities is slightly tricky
4018 * because the rel could be a child rel rather than a true baserel, and in
4019 * that case we must subtract its parents' relid(s) from all_query_rels.
4020 * Additionally, we mustn't consider clauses that are only computable
4021 * after outer joins that can null the rel.
4022 */
4026 else
4029
4031 clauselist =
4032 list_concat(clauselist,
4035 otherrels),
4036 otherrels,
4037 rel,
4038 NULL));
4039
4040 /*
4041 * Normally we remove quals that are implied by a partial index's
4042 * predicate from indrestrictinfo, indicating that they need not be
4043 * checked explicitly by an indexscan plan using this index. However, if
4044 * the rel is a target relation of UPDATE/DELETE/MERGE/SELECT FOR UPDATE,
4045 * we cannot remove such quals from the plan, because they need to be in
4046 * the plan so that they will be properly rechecked by EvalPlanQual
4047 * testing. Some day we might want to remove such quals from the main
4048 * plan anyway and pass them through to EvalPlanQual via a side channel;
4049 * but for now, we just don't remove implied quals at all for target
4050 * relations.
4051 */
4054
4055 /*
4056 * Now try to prove each index predicate true, and compute the
4057 * indrestrictinfo lists for partial indexes. Note that we compute the
4058 * indrestrictinfo list even for non-predOK indexes; this might seem
4059 * wasteful, but we may be able to use such indexes in OR clauses, cf
4060 * generate_bitmap_or_paths().
4061 */
4063 {
4065 ListCell *lcr;
4066
4068 continue; /* ignore non-partial indexes here */
4069
4072 false);
4073
4074 /* If rel is an update target, leave indrestrictinfo as set above */
4075 if (is_target_rel)
4076 continue;
4077
4078 /* Else compute indrestrictinfo as the non-implied quals */
4081 {
4083
4084 /* predicate_implied_by() assumes first arg is immutable */
4089 }
4090 }
4091}
Bitmapset * bms_difference(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:346
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:1161
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo)
Definition: equivclass.c:1550
PlanRowMark * get_plan_rowmark(List *rowmarks, Index rtindex)
Definition: preptlist.c:526
Relids find_childrel_parents(PlannerInfo *root, RelOptInfo *rel)
Definition: relnode.c:1509
bool join_clause_is_movable_to(RestrictInfo *rinfo, RelOptInfo *baserel)
Definition: restrictinfo.c:575
References Assert(), RelOptInfo::baserestrictinfo, bms_del_members(), bms_difference(), bms_is_empty, bms_is_member(), bms_union(), RestrictInfo::clause, contain_mutable_functions(), find_childrel_parents(), generate_join_implied_equalities(), get_plan_rowmark(), RelOptInfo::indexlist, IS_SIMPLE_REL, join_clause_is_movable_to(), RelOptInfo::joininfo, lappend(), lfirst, list_concat(), list_copy(), list_make1, NIL, RelOptInfo::nulling_relids, predicate_implied_by(), RelOptInfo::relid, RelOptInfo::relids, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, and root.
Referenced by set_plain_rel_size(), and set_tablesample_rel_size().
◆ choose_bitmap_and()
|
static |
Definition at line 1784 of file indxpath.c.
1785{
1787 PathClauseUsage **pathinfoarray;
1788 PathClauseUsage *pathinfo;
1789 List *clauselist;
1791 Cost bestcost = 0;
1793 j;
1794 ListCell *l;
1795
1797 if (npaths == 1)
1799
1800 /*
1801 * In theory we should consider every nonempty subset of the given paths.
1802 * In practice that seems like overkill, given the crude nature of the
1803 * estimates, not to mention the possible effects of higher-level AND and
1804 * OR clauses. Moreover, it's completely impractical if there are a large
1805 * number of paths, since the work would grow as O(2^N).
1806 *
1807 * As a heuristic, we first check for paths using exactly the same sets of
1808 * WHERE clauses + index predicate conditions, and reject all but the
1809 * cheapest-to-scan in any such group. This primarily gets rid of indexes
1810 * that include the interesting columns but also irrelevant columns. (In
1811 * situations where the DBA has gone overboard on creating variant
1812 * indexes, this can make for a very large reduction in the number of
1813 * paths considered further.)
1814 *
1815 * We then sort the surviving paths with the cheapest-to-scan first, and
1816 * for each path, consider using that path alone as the basis for a bitmap
1817 * scan. Then we consider bitmap AND scans formed from that path plus
1818 * each subsequent (higher-cost) path, adding on a subsequent path if it
1819 * results in a reduction in the estimated total scan cost. This means we
1820 * consider about O(N^2) rather than O(2^N) path combinations, which is
1821 * quite tolerable, especially given than N is usually reasonably small
1822 * because of the prefiltering step. The cheapest of these is returned.
1823 *
1824 * We will only consider AND combinations in which no two indexes use the
1825 * same WHERE clause. This is a bit of a kluge: it's needed because
1826 * costsize.c and clausesel.c aren't very smart about redundant clauses.
1827 * They will usually double-count the redundant clauses, producing a
1828 * too-small selectivity that makes a redundant AND step look like it
1829 * reduces the total cost. Perhaps someday that code will be smarter and
1830 * we can remove this limitation. (But note that this also defends
1831 * against flat-out duplicate input paths, which can happen because
1832 * match_join_clauses_to_index will find the same OR join clauses that
1833 * extract_restriction_or_clauses has pulled OR restriction clauses out
1834 * of.)
1835 *
1836 * For the same reason, we reject AND combinations in which an index
1837 * predicate clause duplicates another clause. Here we find it necessary
1838 * to be even stricter: we'll reject a partial index if any of its
1839 * predicate clauses are implied by the set of WHERE clauses and predicate
1840 * clauses used so far. This covers cases such as a condition "x = 42"
1841 * used with a plain index, followed by a clauseless scan of a partial
1842 * index "WHERE x >= 40 AND x < 50". The partial index has been accepted
1843 * only because "x = 42" was present, and so allowing it would partially
1844 * double-count selectivity. (We could use predicate_implied_by on
1845 * regular qual clauses too, to have a more intelligent, but much more
1846 * expensive, check for redundancy --- but in most cases simple equality
1847 * seems to suffice.)
1848 */
1849
1850 /*
1851 * Extract clause usage info and detect any paths that use exactly the
1852 * same set of clauses; keep only the cheapest-to-scan of any such groups.
1853 * The surviving paths are put into an array for qsort'ing.
1854 */
1855 pathinfoarray = (PathClauseUsage **)
1857 clauselist = NIL;
1858 npaths = 0;
1859 foreach(l, paths)
1860 {
1862
1863 pathinfo = classify_index_clause_usage(ipath, &clauselist);
1864
1865 /* If it's unclassifiable, treat it as distinct from all others */
1867 {
1868 pathinfoarray[npaths++] = pathinfo;
1869 continue;
1870 }
1871
1873 {
1876 break;
1877 }
1879 {
1880 /* duplicate clauseids, keep the cheaper one */
1881 Cost ncost;
1882 Cost ocost;
1883 Selectivity nselec;
1884 Selectivity oselec;
1885
1888 if (ncost < ocost)
1889 pathinfoarray[i] = pathinfo;
1890 }
1891 else
1892 {
1893 /* not duplicate clauseids, add to array */
1894 pathinfoarray[npaths++] = pathinfo;
1895 }
1896 }
1897
1898 /* If only one surviving path, we're done */
1899 if (npaths == 1)
1901
1902 /* Sort the surviving paths by index access cost */
1904 path_usage_comparator);
1905
1906 /*
1907 * For each surviving index, consider it as an "AND group leader", and see
1908 * whether adding on any of the later indexes results in an AND path with
1909 * cheaper total cost than before. Then take the cheapest AND group.
1910 *
1911 * Note: paths that are either clauseless or unclassifiable will have
1912 * empty clauseids, so that they will not be rejected by the clauseids
1913 * filter here, nor will they cause later paths to be rejected by it.
1914 */
1916 {
1917 Cost costsofar;
1918 List *qualsofar;
1919 Bitmapset *clauseidsofar;
1920
1921 pathinfo = pathinfoarray[i];
1926
1928 {
1929 Cost newcost;
1930
1931 pathinfo = pathinfoarray[j];
1932 /* Check for redundancy */
1934 continue; /* consider it redundant */
1936 {
1937 bool redundant = false;
1938
1939 /* we check each predicate clause separately */
1941 {
1943
1945 {
1946 redundant = true;
1947 break; /* out of inner foreach loop */
1948 }
1949 }
1950 if (redundant)
1951 continue;
1952 }
1953 /* tentatively add new path to paths, so we can estimate cost */
1956 if (newcost < costsofar)
1957 {
1958 /* keep new path in paths, update subsidiary variables */
1959 costsofar = newcost;
1962 clauseidsofar = bms_add_members(clauseidsofar,
1963 pathinfo->clauseids);
1964 }
1965 else
1966 {
1967 /* reject new path, remove it from paths list */
1969 }
1970 }
1971
1972 /* Keep the cheapest AND-group (or singleton) */
1974 {
1975 bestpaths = paths;
1976 bestcost = costsofar;
1977 }
1978
1979 /* some easy cleanup (we don't try real hard though) */
1980 list_free(qualsofar);
1981 }
1982
1986}
void cost_bitmap_tree_node(Path *path, Cost *cost, Selectivity *selec)
Definition: costsize.c:1122
static Cost bitmap_and_cost_est(PlannerInfo *root, RelOptInfo *rel, List *paths)
Definition: indxpath.c:2057
static PathClauseUsage * classify_index_clause_usage(Path *path, List **clauselist)
Definition: indxpath.c:2086
static int path_usage_comparator(const void *a, const void *b)
Definition: indxpath.c:1990
Definition: indxpath.c:62
References Assert(), bitmap_and_cost_est(), bitmap_scan_cost_est(), bms_add_members(), bms_copy(), bms_equal(), bms_overlap(), classify_index_clause_usage(), PathClauseUsage::clauseids, cost_bitmap_tree_node(), create_bitmap_and_path(), i, j, lappend(), lfirst, linitial, list_concat(), list_concat_copy(), list_free(), list_length(), list_make1, list_truncate(), NIL, palloc(), PathClauseUsage::path, path_usage_comparator(), predicate_implied_by(), PathClauseUsage::preds, qsort, PathClauseUsage::quals, root, and PathClauseUsage::unclassifiable.
Referenced by create_index_paths(), generate_bitmap_or_paths(), and make_bitmap_paths_for_or_group().
◆ classify_index_clause_usage()
|
static |
Definition at line 2086 of file indxpath.c.
2087{
2088 PathClauseUsage *result;
2089 Bitmapset *clauseids;
2090 ListCell *lc;
2091
2093 result->path = path;
2094
2095 /* Recursively find the quals and preds used by the path */
2099
2100 /*
2101 * Some machine-generated queries have outlandish numbers of qual clauses.
2102 * To avoid getting into O(N^2) behavior even in this preliminary
2103 * classification step, we want to limit the number of entries we can
2104 * accumulate in *clauselist. Treat any path with more than 100 quals +
2105 * preds as unclassifiable, which will cause calling code to consider it
2106 * distinct from all other paths.
2107 */
2109 {
2110 result->clauseids = NULL;
2112 return result;
2113 }
2114
2115 /* Build up a bitmapset representing the quals and preds */
2116 clauseids = NULL;
2118 {
2120
2121 clauseids = bms_add_member(clauseids,
2122 find_list_position(node, clauselist));
2123 }
2125 {
2127
2128 clauseids = bms_add_member(clauseids,
2129 find_list_position(node, clauselist));
2130 }
2131 result->clauseids = clauseids;
2133
2134 return result;
2135}
static void find_indexpath_quals(Path *bitmapqual, List **quals, List **preds)
Definition: indxpath.c:2154
static int find_list_position(Node *node, List **nodelist)
Definition: indxpath.c:2201
References bms_add_member(), PathClauseUsage::clauseids, find_indexpath_quals(), find_list_position(), lfirst, list_length(), NIL, palloc(), PathClauseUsage::path, PathClauseUsage::preds, PathClauseUsage::quals, and PathClauseUsage::unclassifiable.
Referenced by choose_bitmap_and().
◆ consider_index_join_clauses()
|
static |
Definition at line 436 of file indxpath.c.
442{
443 int considered_clauses = 0;
445 int indexcol;
446
447 /*
448 * The strategy here is to identify every potentially useful set of outer
449 * rels that can provide indexable join clauses. For each such set,
450 * select all the join clauses available from those outer rels, add on all
451 * the indexable restriction clauses, and generate plain and/or bitmap
452 * index paths for that set of clauses. This is based on the assumption
453 * that it's always better to apply a clause as an indexqual than as a
454 * filter (qpqual); which is where an available clause would end up being
455 * applied if we omit it from the indexquals.
456 *
457 * This looks expensive, but in most practical cases there won't be very
458 * many distinct sets of outer rels to consider. As a safety valve when
459 * that's not true, we use a heuristic: limit the number of outer rel sets
460 * considered to a multiple of the number of clauses considered. (We'll
461 * always consider using each individual join clause, though.)
462 *
463 * For simplicity in selecting relevant clauses, we represent each set of
464 * outer rels as a maximum set of clause_relids --- that is, the indexed
465 * relation itself is also included in the relids set. considered_relids
466 * lists all relids sets we've already tried.
467 */
469 {
470 /* Consider each applicable simple join clause */
473 rclauseset, jclauseset, eclauseset,
474 bitindexpaths,
475 jclauseset->indexclauses[indexcol],
476 considered_clauses,
477 &considered_relids);
478 /* Consider each applicable eclass join clause */
481 rclauseset, jclauseset, eclauseset,
482 bitindexpaths,
483 eclauseset->indexclauses[indexcol],
484 considered_clauses,
485 &considered_relids);
486 }
487}
static void consider_index_join_outer_rels(PlannerInfo *root, RelOptInfo *rel, IndexOptInfo *index, IndexClauseSet *rclauseset, IndexClauseSet *jclauseset, IndexClauseSet *eclauseset, List **bitindexpaths, List *indexjoinclauses, int considered_clauses, List **considered_relids)
Definition: indxpath.c:502
References consider_index_join_outer_rels(), IndexClauseSet::indexclauses, list_length(), NIL, and root.
Referenced by create_index_paths().
◆ consider_index_join_outer_rels()
|
static |
Definition at line 502 of file indxpath.c.
511{
512 ListCell *lc;
513
514 /* Examine relids of each joinclause in the given list */
515 foreach(lc, indexjoinclauses)
516 {
520 int num_considered_relids;
521
522 /* If we already tried its relids set, no need to do so again */
524 continue;
525
526 /*
527 * Generate the union of this clause's relids set with each
528 * previously-tried set. This ensures we try this clause along with
529 * every interesting subset of previous clauses. However, to avoid
530 * exponential growth of planning time when there are many clauses,
531 * limit the number of relid sets accepted to 10 * considered_clauses.
532 *
533 * Note: get_join_index_paths appends entries to *considered_relids,
534 * but we do not need to visit such newly-added entries within this
535 * loop, so we don't use foreach() here. No real harm would be done
536 * if we did visit them, since the subset check would reject them; but
537 * it would waste some cycles.
538 */
539 num_considered_relids = list_length(*considered_relids);
540 for (int pos = 0; pos < num_considered_relids; pos++)
541 {
543
544 /*
545 * If either is a subset of the other, no new set is possible.
546 * This isn't a complete test for redundancy, but it's easy and
547 * cheap. get_join_index_paths will check more carefully if we
548 * already generated the same relids set.
549 */
551 continue;
552
553 /*
554 * If this clause was derived from an equivalence class, the
555 * clause list may contain other clauses derived from the same
556 * eclass. We should not consider that combining this clause with
557 * one of those clauses generates a usefully different
558 * parameterization; so skip if any clause derived from the same
559 * eclass would already have been included when using oldrelids.
560 */
561 if (parent_ec &&
562 eclass_already_used(parent_ec, oldrelids,
563 indexjoinclauses))
564 continue;
565
566 /*
567 * If the number of relid sets considered exceeds our heuristic
568 * limit, stop considering combinations of clauses. We'll still
569 * consider the current clause alone, though (below this loop).
570 */
572 break;
573
574 /* OK, try the union set */
576 rclauseset, jclauseset, eclauseset,
577 bitindexpaths,
578 bms_union(clause_relids, oldrelids),
579 considered_relids);
580 }
581
582 /* Also try this set of relids by itself */
584 rclauseset, jclauseset, eclauseset,
585 bitindexpaths,
586 clause_relids,
587 considered_relids);
588 }
589}
BMS_Comparison bms_subset_compare(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:445
static void get_join_index_paths(PlannerInfo *root, RelOptInfo *rel, IndexOptInfo *index, IndexClauseSet *rclauseset, IndexClauseSet *jclauseset, IndexClauseSet *eclauseset, List **bitindexpaths, Relids relids, List **considered_relids)
Definition: indxpath.c:605
static bool eclass_already_used(EquivalenceClass *parent_ec, Relids oldrelids, List *indexjoinclauses)
Definition: indxpath.c:683
Definition: pathnodes.h:1445
References BMS_DIFFERENT, bms_subset_compare(), bms_union(), eclass_already_used(), get_join_index_paths(), lfirst, list_length(), list_member(), list_nth(), IndexClause::rinfo, and root.
Referenced by consider_index_join_clauses().
◆ create_index_paths()
| void create_index_paths | ( | PlannerInfo * | root, |
| RelOptInfo * | rel | ||
| ) |
Definition at line 239 of file indxpath.c.
240{
241 List *indexpaths;
242 List *bitindexpaths;
243 List *bitjoinpaths;
244 List *joinorclauses;
245 IndexClauseSet rclauseset;
246 IndexClauseSet jclauseset;
247 IndexClauseSet eclauseset;
248 ListCell *lc;
249
250 /* Skip the whole mess if no indexes */
252 return;
253
254 /* Bitmap paths are collected and then dealt with at the end */
255 bitindexpaths = bitjoinpaths = joinorclauses = NIL;
256
257 /* Examine each index in turn */
259 {
261
262 /* Protect limited-size array in IndexClauseSets */
264
265 /*
266 * Ignore partial indexes that do not match the query.
267 * (generate_bitmap_or_paths() might be able to do something with
268 * them, but that's of no concern here.)
269 */
271 continue;
272
273 /*
274 * Identify the restriction clauses that can match the index.
275 */
278
279 /*
280 * Build index paths from the restriction clauses. These will be
281 * non-parameterized paths. Plain paths go directly to add_path(),
282 * bitmap paths are added to bitindexpaths to be handled below.
283 */
285 &bitindexpaths);
286
287 /*
288 * Identify the join clauses that can match the index. For the moment
289 * we keep them separate from the restriction clauses. Note that this
290 * step finds only "loose" join clauses that have not been merged into
291 * EquivalenceClasses. Also, collect join OR clauses for later.
292 */
295 &jclauseset, &joinorclauses);
296
297 /*
298 * Look for EquivalenceClasses that can generate joinclauses matching
299 * the index.
300 */
303 &eclauseset);
304
305 /*
306 * If we found any plain or eclass join clauses, build parameterized
307 * index paths using them.
308 */
311 &rclauseset,
312 &jclauseset,
313 &eclauseset,
314 &bitjoinpaths);
315 }
316
317 /*
318 * Generate BitmapOrPaths for any suitable OR-clauses present in the
319 * restriction list. Add these to bitindexpaths.
320 */
323 bitindexpaths = list_concat(bitindexpaths, indexpaths);
324
325 /*
326 * Likewise, generate BitmapOrPaths for any suitable OR-clauses present in
327 * the joinclause list. Add these to bitjoinpaths.
328 */
330 joinorclauses, rel->baserestrictinfo);
331 bitjoinpaths = list_concat(bitjoinpaths, indexpaths);
332
333 /*
334 * If we found anything usable, generate a BitmapHeapPath for the most
335 * promising combination of restriction bitmap index paths. Note there
336 * will be only one such path no matter how many indexes exist. This
337 * should be sufficient since there's basically only one figure of merit
338 * (total cost) for such a path.
339 */
341 {
342 Path *bitmapqual;
343 BitmapHeapPath *bpath;
344
347 rel->lateral_relids, 1.0, 0);
349
350 /* create a partial bitmap heap path */
353 }
354
355 /*
356 * Likewise, if we found anything usable, generate BitmapHeapPaths for the
357 * most promising combinations of join bitmap index paths. Our strategy
358 * is to generate one such path for each distinct parameterization seen
359 * among the available bitmap index paths. This may look pretty
360 * expensive, but usually there won't be very many distinct
361 * parameterizations. (This logic is quite similar to that in
362 * consider_index_join_clauses, but we're working with whole paths not
363 * individual clauses.)
364 */
366 {
367 List *all_path_outers;
368
369 /* Identify each distinct parameterization seen in bitjoinpaths */
370 all_path_outers = NIL;
371 foreach(lc, bitjoinpaths)
372 {
375
376 all_path_outers = list_append_unique(all_path_outers,
377 required_outer);
378 }
379
380 /* Now, for each distinct parameterization set ... */
381 foreach(lc, all_path_outers)
382 {
384 List *this_path_set;
385 Path *bitmapqual;
386 Relids required_outer;
387 double loop_count;
388 BitmapHeapPath *bpath;
389 ListCell *lcp;
390
391 /* Identify all the bitmap join paths needing no more than that */
392 this_path_set = NIL;
393 foreach(lcp, bitjoinpaths)
394 {
396
398 this_path_set = lappend(this_path_set, path);
399 }
400
401 /*
402 * Add in restriction bitmap paths, since they can be used
403 * together with any join paths.
404 */
405 this_path_set = list_concat(this_path_set, bitindexpaths);
406
407 /* Select best AND combination for this parameterization */
409
410 /* And push that path into the mix */
411 required_outer = PATH_REQ_OUTER(bitmapqual);
414 required_outer, loop_count, 0);
416 }
417 }
418}
void create_partial_bitmap_paths(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual)
Definition: allpaths.c:4198
static Path * choose_bitmap_and(PlannerInfo *root, RelOptInfo *rel, List *paths)
Definition: indxpath.c:1784
static void match_join_clauses_to_index(PlannerInfo *root, RelOptInfo *rel, IndexOptInfo *index, IndexClauseSet *clauseset, List **joinorclauses)
Definition: indxpath.c:2481
static void match_eclass_clauses_to_index(PlannerInfo *root, IndexOptInfo *index, IndexClauseSet *clauseset)
Definition: indxpath.c:2515
static void get_index_paths(PlannerInfo *root, RelOptInfo *rel, IndexOptInfo *index, IndexClauseSet *clauses, List **bitindexpaths)
Definition: indxpath.c:715
static void consider_index_join_clauses(PlannerInfo *root, RelOptInfo *rel, IndexOptInfo *index, IndexClauseSet *rclauseset, IndexClauseSet *jclauseset, IndexClauseSet *eclauseset, List **bitindexpaths)
Definition: indxpath.c:436
static void match_restriction_clauses_to_index(PlannerInfo *root, IndexOptInfo *index, IndexClauseSet *clauseset)
Definition: indxpath.c:2465
static List * generate_bitmap_or_paths(PlannerInfo *root, RelOptInfo *rel, List *clauses, List *other_clauses)
Definition: indxpath.c:1628
BitmapHeapPath * create_bitmap_heap_path(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual, Relids required_outer, double loop_count, int parallel_degree)
Definition: pathnode.c:1098
References add_path(), Assert(), RelOptInfo::baserestrictinfo, bms_is_subset(), choose_bitmap_and(), consider_index_join_clauses(), RelOptInfo::consider_parallel, create_bitmap_heap_path(), create_partial_bitmap_paths(), generate_bitmap_or_paths(), get_index_paths(), get_loop_count(), INDEX_MAX_KEYS, RelOptInfo::indexlist, lappend(), RelOptInfo::lateral_relids, lfirst, list_append_unique(), list_concat(), match_eclass_clauses_to_index(), match_join_clauses_to_index(), match_restriction_clauses_to_index(), MemSet, NIL, IndexClauseSet::nonempty, PATH_REQ_OUTER, RelOptInfo::relid, and root.
Referenced by set_plain_rel_pathlist().
◆ ec_member_matches_indexcol()
|
static |
Definition at line 4104 of file indxpath.c.
4107{
4110 Oid curFamily;
4111 Oid curCollation;
4112
4113 Assert(indexcol < index->nkeycolumns);
4114
4115 curFamily = index->opfamily[indexcol];
4116 curCollation = index->indexcollations[indexcol];
4117
4118 /*
4119 * If it's a btree index, we can reject it if its opfamily isn't
4120 * compatible with the EC, since no clause generated from the EC could be
4121 * used with the index. For non-btree indexes, we can't easily tell
4122 * whether clauses generated from the EC could be used with the index, so
4123 * don't check the opfamily. This might mean we return "true" for a
4124 * useless EC, so we have to recheck the results of
4125 * generate_implied_equalities_for_column; see
4126 * match_eclass_clauses_to_index.
4127 */
4130 return false;
4131
4132 /* We insist on collation match for all index types, though */
4134 return false;
4135
4137}
#define IndexCollMatchesExprColl(idxcollation, exprcollation)
Definition: indxpath.c:41
bool match_index_to_operand(Node *operand, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:4426
Definition: indxpath.c:72
References arg, Assert(), EquivalenceClass::ec_collation, EquivalenceClass::ec_opfamilies, EquivalenceMember::em_expr, IndexCollMatchesExprColl, list_member_oid(), and match_index_to_operand().
Referenced by match_eclass_clauses_to_index().
◆ eclass_already_used()
|
static |
Definition at line 683 of file indxpath.c.
685{
686 ListCell *lc;
687
688 foreach(lc, indexjoinclauses)
689 {
692
693 if (rinfo->parent_ec == parent_ec &&
694 bms_is_subset(rinfo->clause_relids, oldrelids))
695 return true;
696 }
697 return false;
698}
References bms_is_subset(), lfirst, and IndexClause::rinfo.
Referenced by consider_index_join_outer_rels().
◆ expand_indexqual_rowcompare()
|
static |
Definition at line 3519 of file indxpath.c.
3525{
3528 int op_strategy;
3529 Oid op_lefttype;
3530 Oid op_righttype;
3531 int matching_cols;
3532 List *expr_ops;
3533 List *opfamilies;
3534 List *lefttypes;
3535 List *righttypes;
3536 List *new_ops;
3537 List *var_args;
3538 List *non_var_args;
3539
3540 iclause->rinfo = rinfo;
3541 iclause->indexcol = indexcol;
3542
3543 if (var_on_left)
3544 {
3545 var_args = clause->largs;
3546 non_var_args = clause->rargs;
3547 }
3548 else
3549 {
3550 var_args = clause->rargs;
3551 non_var_args = clause->largs;
3552 }
3553
3555 &op_strategy,
3556 &op_lefttype,
3557 &op_righttype);
3558
3559 /* Initialize returned list of which index columns are used */
3561
3562 /* Build lists of ops, opfamilies and operator datatypes in case needed */
3563 expr_ops = list_make1_oid(expr_op);
3565 lefttypes = list_make1_oid(op_lefttype);
3566 righttypes = list_make1_oid(op_righttype);
3567
3568 /*
3569 * See how many of the remaining columns match some index column in the
3570 * same way. As in match_clause_to_indexcol(), the "other" side of any
3571 * potential index condition is OK as long as it doesn't use Vars from the
3572 * indexed relation.
3573 */
3574 matching_cols = 1;
3575
3577 {
3581
3582 expr_op = list_nth_oid(clause->opnos, matching_cols);
3583 if (!var_on_left)
3584 {
3585 /* indexkey is on right, so commute the operator */
3586 expr_op = get_commutator(expr_op);
3588 break; /* operator is not usable */
3589 }
3591 break; /* no good, Var on wrong side */
3593 break; /* no good, volatile comparison value */
3594
3595 /*
3596 * The Var side can match any key column of the index.
3597 */
3599 {
3601 get_op_opfamily_strategy(expr_op,
3604 list_nth_oid(clause->inputcollids,
3605 matching_cols)))
3606 break;
3607 }
3609 break; /* no match found */
3610
3611 /* Add column number to returned list */
3613
3614 /* Add operator info to lists */
3616 &op_strategy,
3617 &op_lefttype,
3618 &op_righttype);
3619 expr_ops = lappend_oid(expr_ops, expr_op);
3621 lefttypes = lappend_oid(lefttypes, op_lefttype);
3622 righttypes = lappend_oid(righttypes, op_righttype);
3623
3624 /* This column matches, keep scanning */
3625 matching_cols++;
3626 }
3627
3628 /* Result is non-lossy if all columns are usable as index quals */
3630
3631 /*
3632 * We can use rinfo->clause as-is if we have var on left and it's all
3633 * usable as index quals.
3634 */
3637 else
3638 {
3639 /*
3640 * We have to generate a modified rowcompare (possibly just one
3641 * OpExpr). The painful part of this is changing < to <= or > to >=,
3642 * so deal with that first.
3643 */
3645 {
3646 /* very easy, just use the commuted operators */
3647 new_ops = expr_ops;
3648 }
3650 op_strategy == BTGreaterEqualStrategyNumber)
3651 {
3652 /* easy, just use the same (possibly commuted) operators */
3653 new_ops = list_truncate(expr_ops, matching_cols);
3654 }
3655 else
3656 {
3657 ListCell *opfamilies_cell;
3658 ListCell *lefttypes_cell;
3659 ListCell *righttypes_cell;
3660
3662 op_strategy = BTLessEqualStrategyNumber;
3664 op_strategy = BTGreaterEqualStrategyNumber;
3665 else
3667 new_ops = NIL;
3668 forthree(opfamilies_cell, opfamilies,
3669 lefttypes_cell, lefttypes,
3670 righttypes_cell, righttypes)
3671 {
3675
3676 expr_op = get_opfamily_member(opfam, lefttype, righttype,
3677 op_strategy);
3680 op_strategy, lefttype, righttype, opfam);
3681 new_ops = lappend_oid(new_ops, expr_op);
3682 }
3683 }
3684
3685 /* If we have more than one matching col, create a subset rowcompare */
3686 if (matching_cols > 1)
3687 {
3689
3691 rc->opnos = new_ops;
3692 rc->opfamilies = list_copy_head(clause->opfamilies,
3693 matching_cols);
3694 rc->inputcollids = list_copy_head(clause->inputcollids,
3695 matching_cols);
3699 (Expr *) rc));
3700 }
3701 else
3702 {
3703 Expr *op;
3704
3705 /* We don't report an index column list in this case */
3707
3711 InvalidOid,
3712 linitial_oid(clause->inputcollids));
3714 }
3715 }
3716
3717 return iclause;
3718}
void get_op_opfamily_properties(Oid opno, Oid opfamily, bool ordering_op, int *strategy, Oid *lefttype, Oid *righttype)
Definition: lsyscache.c:137
int get_op_opfamily_strategy(Oid opno, Oid opfamily)
Definition: lsyscache.c:84
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:167
Expr * make_opclause(Oid opno, Oid opresulttype, bool opretset, Expr *leftop, Expr *rightop, Oid opcollid, Oid inputcollid)
Definition: makefuncs.c:701
Definition: primnodes.h:189
Definition: primnodes.h:1469
References bms_is_member(), BTGreaterEqualStrategyNumber, BTGreaterStrategyNumber, BTLessEqualStrategyNumber, BTLessStrategyNumber, RestrictInfo::clause, RowCompareExpr::cmptype, contain_volatile_functions(), copyObject, elog, ERROR, forthree, get_commutator(), get_op_opfamily_properties(), get_op_opfamily_strategy(), get_opfamily_member(), i, if(), IndexClause::indexcol, IndexCollMatchesExprColl, IndexClause::indexcols, IndexClause::indexquals, InvalidOid, lappend_int(), lappend_oid(), RowCompareExpr::largs, lfirst_oid, linitial, linitial_oid, list_copy_head(), list_length(), list_make1, list_make1_int, list_make1_oid, list_nth(), list_nth_oid(), list_truncate(), IndexClause::lossy, make_opclause(), make_simple_restrictinfo, makeNode, match_index_to_operand(), NIL, OidIsValid, pull_varnos(), RowCompareExpr::rargs, IndexClause::rinfo, and root.
Referenced by match_rowcompare_to_indexcol().
◆ find_indexpath_quals()
Definition at line 2154 of file indxpath.c.
2155{
2157 {
2159 ListCell *l;
2160
2162 {
2164 }
2165 }
2167 {
2169 ListCell *l;
2170
2172 {
2174 }
2175 }
2177 {
2179 ListCell *l;
2180
2182 {
2184
2186 }
2188 }
2189 else
2191}
Definition: pathnodes.h:1945
References BitmapAndPath::bitmapquals, BitmapOrPath::bitmapquals, RestrictInfo::clause, elog, ERROR, find_indexpath_quals(), IndexPath::indexclauses, IndexPath::indexinfo, IndexOptInfo::indpred, IsA, lappend(), lfirst, list_concat(), nodeTag, and IndexClause::rinfo.
Referenced by classify_index_clause_usage(), and find_indexpath_quals().
◆ find_list_position()
◆ generate_bitmap_or_paths()
|
static |
Definition at line 1628 of file indxpath.c.
1630{
1632 List *all_clauses;
1633 ListCell *lc;
1634
1635 /*
1636 * We can use both the current and other clauses as context for
1637 * build_paths_for_OR; no need to remove ORs from the lists.
1638 */
1639 all_clauses = list_concat_copy(clauses, other_clauses);
1640
1641 foreach(lc, clauses)
1642 {
1644 List *pathlist;
1645 Path *bitmapqual;
1647 List *groupedArgs;
1649
1650 /* Ignore RestrictInfos that aren't ORs */
1652 continue;
1653
1654 /*
1655 * We must be able to match at least one index to each of the arms of
1656 * the OR, else we can't use it.
1657 */
1658 pathlist = NIL;
1659
1660 /*
1661 * Group the similar OR-clause arguments into dedicated RestrictInfos,
1662 * because each of those RestrictInfos has a chance to match the index
1663 * as a whole.
1664 */
1666
1668 {
1669 /*
1670 * Some parts of the rinfo were probably grouped. In this case,
1671 * we have a set of sub-rinfos that together are an exact
1672 * duplicate of rinfo. Thus, we need to remove the rinfo from
1673 * other clauses. match_clauses_to_index detects duplicated
1674 * iclauses by comparing pointers to original rinfos that would be
1675 * different. So, we must delete rinfo to avoid de-facto
1676 * duplicated clauses in the index clauses list.
1677 */
1679 }
1680
1682 {
1684 List *indlist;
1685
1686 /* OR arguments should be ANDs or sub-RestrictInfos */
1688 {
1690
1692 andargs,
1693 all_clauses);
1694
1695 /* Recurse in case there are sub-ORs */
1696 indlist = list_concat(indlist,
1698 andargs,
1699 all_clauses));
1700 }
1702 {
1704
1705 /*
1706 * Generate bitmap paths for the group of similar OR-clause
1707 * arguments.
1708 */
1710 rel, ri,
1711 inner_other_clauses);
1712
1714 {
1715 pathlist = NIL;
1716 break;
1717 }
1718 else
1719 {
1720 pathlist = list_concat(pathlist, indlist);
1721 continue;
1722 }
1723 }
1724 else
1725 {
1727 List *orargs;
1728
1729 orargs = list_make1(ri);
1730
1732 orargs,
1733 all_clauses);
1734 }
1735
1736 /*
1737 * If nothing matched this arm, we can't do anything with this OR
1738 * clause.
1739 */
1741 {
1742 pathlist = NIL;
1743 break;
1744 }
1745
1746 /*
1747 * OK, pick the most promising AND combination, and add it to
1748 * pathlist.
1749 */
1751 pathlist = lappend(pathlist, bitmapqual);
1752 }
1753
1755 list_free(inner_other_clauses);
1756
1757 /*
1758 * If we have a match for every arm, then turn them into a
1759 * BitmapOrPath, and add to result list.
1760 */
1762 {
1764 result = lappend(result, bitmapqual);
1765 }
1766 }
1767
1768 return result;
1769}
static List * build_paths_for_OR(PlannerInfo *root, RelOptInfo *rel, List *clauses, List *other_clauses)
Definition: indxpath.c:1091
static List * group_similar_or_args(PlannerInfo *root, RelOptInfo *rel, RestrictInfo *rinfo)
Definition: indxpath.c:1270
static List * make_bitmap_paths_for_or_group(PlannerInfo *root, RelOptInfo *rel, RestrictInfo *ri, List *other_clauses)
Definition: indxpath.c:1547
BitmapOrPath * create_bitmap_or_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
Definition: pathnode.c:1183
bool restriction_is_or_clause(RestrictInfo *restrictinfo)
Definition: restrictinfo.c:407
Definition: primnodes.h:952
References build_paths_for_OR(), castNode, choose_bitmap_and(), create_bitmap_or_path(), generate_bitmap_or_paths(), group_similar_or_args(), is_andclause(), j, lappend(), lfirst, lfirst_node, list_concat(), list_concat_copy(), list_copy(), list_delete(), list_free(), list_make1, make_bitmap_paths_for_or_group(), NIL, restriction_is_or_clause(), and root.
Referenced by create_index_paths(), and generate_bitmap_or_paths().
◆ get_index_clause_from_support()
|
static |
Definition at line 3068 of file indxpath.c.
3074{
3076 SupportRequestIndexCondition req;
3077 List *sresult;
3078
3080 return NULL;
3081
3082 req.type = T_SupportRequestIndexCondition;
3084 req.funcid = funcid;
3086 req.indexarg = indexarg;
3088 req.indexcol = indexcol;
3091
3093
3094 sresult = (List *)
3096 PointerGetDatum(&req)));
3097
3099 {
3102 ListCell *lc;
3103
3104 /*
3105 * The support function API says it should just give back bare
3106 * clauses, so here we must wrap each one in a RestrictInfo.
3107 */
3108 foreach(lc, sresult)
3109 {
3111
3112 indexquals = lappend(indexquals,
3114 }
3115
3116 iclause->rinfo = rinfo;
3117 iclause->indexquals = indexquals;
3119 iclause->indexcol = indexcol;
3121
3122 return iclause;
3123 }
3124
3125 return NULL;
3126}
Definition: supportnodes.h:224
References RestrictInfo::clause, DatumGetPointer(), SupportRequestIndexCondition::funcid, get_func_support(), SupportRequestIndexCondition::index, SupportRequestIndexCondition::indexarg, IndexClause::indexcol, SupportRequestIndexCondition::indexcol, SupportRequestIndexCondition::indexcollation, IndexClause::indexcols, IndexClause::indexquals, lappend(), lfirst, IndexClause::lossy, SupportRequestIndexCondition::lossy, make_simple_restrictinfo, makeNode, NIL, SupportRequestIndexCondition::node, OidFunctionCall1, OidIsValid, SupportRequestIndexCondition::opfamily, PointerGetDatum(), IndexClause::rinfo, root, SupportRequestIndexCondition::root, and SupportRequestIndexCondition::type.
Referenced by match_funcclause_to_indexcol(), and match_opclause_to_indexcol().
◆ get_index_paths()
|
static |
Definition at line 715 of file indxpath.c.
718{
719 List *indexpaths;
720 bool skip_nonnative_saop = false;
721 ListCell *lc;
722
723 /*
724 * Build simple index paths using the clauses. Allow ScalarArrayOpExpr
725 * clauses only if the index AM supports them natively.
726 */
728 index, clauses,
729 index->predOK,
730 ST_ANYSCAN,
731 &skip_nonnative_saop);
732
733 /*
734 * Submit all the ones that can form plain IndexScan plans to add_path. (A
735 * plain IndexPath can represent either a plain IndexScan or an
736 * IndexOnlyScan, but for our purposes here that distinction does not
737 * matter. However, some of the indexes might support only bitmap scans,
738 * and those we mustn't submit to add_path here.)
739 *
740 * Also, pick out the ones that are usable as bitmap scans. For that, we
741 * must discard indexes that don't support bitmap scans, and we also are
742 * only interested in paths that have some selectivity; we should discard
743 * anything that was generated solely for ordering purposes.
744 */
745 foreach(lc, indexpaths)
746 {
748
751
754 ipath->indexselectivity < 1.0))
755 *bitindexpaths = lappend(*bitindexpaths, ipath);
756 }
757
758 /*
759 * If there were ScalarArrayOpExpr clauses that the index can't handle
760 * natively, generate bitmap scan paths relying on executor-managed
761 * ScalarArrayOpExpr.
762 */
763 if (skip_nonnative_saop)
764 {
766 index, clauses,
767 false,
768 ST_BITMAPSCAN,
769 NULL);
770 *bitindexpaths = list_concat(*bitindexpaths, indexpaths);
771 }
772}
References add_path(), build_index_paths(), IndexPath::indexselectivity, lappend(), lfirst, list_concat(), NIL, IndexPath::path, Path::pathkeys, root, ST_ANYSCAN, and ST_BITMAPSCAN.
Referenced by create_index_paths(), and get_join_index_paths().
◆ get_join_index_paths()
|
static |
Definition at line 605 of file indxpath.c.
613{
614 IndexClauseSet clauseset;
615 int indexcol;
616
617 /* If we already considered this relids set, don't repeat the work */
619 return;
620
621 /* Identify indexclauses usable with this relids set */
623
625 {
626 ListCell *lc;
627
628 /* First find applicable simple join clauses */
630 {
632
634 clauseset.indexclauses[indexcol] =
636 }
637
638 /*
639 * Add applicable eclass join clauses. The clauses generated for each
640 * column are redundant (cf generate_implied_equalities_for_column),
641 * so we need at most one. This is the only exception to the general
642 * rule of using all available index clauses.
643 */
645 {
647
649 {
650 clauseset.indexclauses[indexcol] =
652 break;
653 }
654 }
655
656 /* Add restriction clauses */
657 clauseset.indexclauses[indexcol] =
659 rclauseset->indexclauses[indexcol]);
660
663 }
664
665 /* We should have found something, else caller passed silly relids */
667
668 /* Build index path(s) using the collected set of clauses */
670
671 /*
672 * Remember we considered paths for this set of relids.
673 */
674 *considered_relids = lappend(*considered_relids, relids);
675}
References Assert(), bms_is_subset(), get_index_paths(), IndexClauseSet::indexclauses, lappend(), lfirst, list_concat(), list_member(), MemSet, NIL, IndexClauseSet::nonempty, IndexClause::rinfo, and root.
Referenced by consider_index_join_outer_rels().
◆ get_loop_count()
|
static |
Definition at line 2326 of file indxpath.c.
2327{
2328 double result;
2329 int outer_relid;
2330
2331 /* For a non-parameterized path, just return 1.0 quickly */
2332 if (outer_relids == NULL)
2333 return 1.0;
2334
2335 result = 0.0;
2336 outer_relid = -1;
2338 {
2339 RelOptInfo *outer_rel;
2340 double rowcount;
2341
2342 /* Paranoia: ignore bogus relid indexes */
2344 continue;
2345 outer_rel = root->simple_rel_array[outer_relid];
2346 if (outer_rel == NULL)
2347 continue;
2349
2350 /* Other relation could be proven empty, if so ignore */
2352 continue;
2353
2354 /* Otherwise, rel's rows estimate should be valid by now */
2356
2357 /* Check to see if rel is on the inside of any semijoins */
2359 cur_relid,
2360 outer_relid,
2361 outer_rel->rows);
2362
2363 /* Remember smallest row count estimate among the outer rels */
2364 if (result == 0.0 || result > rowcount)
2365 result = rowcount;
2366 }
2367 /* Return 1.0 if we found no valid relations (shouldn't happen) */
2368 return (result > 0.0) ? result : 1.0;
2369}
static double adjust_rowcount_for_semijoins(PlannerInfo *root, Index cur_relid, Index outer_relid, double rowcount)
Definition: indxpath.c:2379
References adjust_rowcount_for_semijoins(), Assert(), bms_next_member(), IS_DUMMY_REL, RelOptInfo::relid, root, and RelOptInfo::rows.
Referenced by bitmap_scan_cost_est(), build_index_paths(), and create_index_paths().
◆ group_similar_or_args()
|
static |
Definition at line 1270 of file indxpath.c.
1271{
1272 int n;
1274 int group_start;
1275 OrArgIndexMatch *matches;
1276 bool matched = false;
1277 ListCell *lc;
1278 ListCell *lc2;
1279 List *orargs;
1282
1284 orargs = ((BoolExpr *) rinfo->orclause)->args;
1285 n = list_length(orargs);
1286
1287 /*
1288 * To avoid N^2 behavior, take utility pass along the list of OR-clause
1289 * arguments. For each argument, fill the OrArgIndexMatch structure,
1290 * which will be used to sort these arguments at the next step.
1291 */
1292 i = -1;
1294 foreach(lc, orargs)
1295 {
1297 RestrictInfo *argrinfo;
1298 OpExpr *clause;
1299 Oid opno;
1300 Node *leftop,
1301 *rightop;
1302 Node *nonConstExpr;
1303 int indexnum;
1304 int colnum;
1305
1306 i++;
1313
1315 continue;
1316
1318
1319 /* Only operator clauses can match */
1321 continue;
1322
1324 opno = clause->opno;
1325
1326 /* Only binary operators can match */
1328 continue;
1329
1330 /*
1331 * Ignore any RelabelType node above the operands. This is needed to
1332 * be able to apply indexscanning in binary-compatible-operator cases.
1333 * Note: we can assume there is at most one RelabelType node;
1334 * eval_const_expressions() will have simplified if more than one.
1335 */
1336 leftop = get_leftop(clause);
1339
1340 rightop = get_rightop(clause);
1343
1344 /*
1345 * Check for clauses of the form: (indexkey operator constant) or
1346 * (constant operator indexkey). But we don't know a particular index
1347 * yet. Therefore, we try to distinguish the potential index key and
1348 * constant first, then search for a matching index key among all
1349 * indexes.
1350 */
1352 !bms_is_member(relid, argrinfo->left_relids) &&
1353 !contain_volatile_functions(leftop))
1354 {
1355 opno = get_commutator(opno);
1356
1358 {
1359 /* commutator doesn't exist, we can't reverse the order */
1360 continue;
1361 }
1362 nonConstExpr = rightop;
1363 }
1365 !bms_is_member(relid, argrinfo->right_relids) &&
1366 !contain_volatile_functions(rightop))
1367 {
1368 nonConstExpr = leftop;
1369 }
1370 else
1371 {
1372 continue;
1373 }
1374
1375 /*
1376 * Match non-constant part to the index key. It's possible that a
1377 * single non-constant part matches multiple index keys. It's OK, we
1378 * just stop with first matching index key. Given that this choice is
1379 * determined the same for every clause, we will group similar clauses
1380 * together anyway.
1381 */
1382 indexnum = 0;
1384 {
1386
1387 /*
1388 * Ignore index if it doesn't support bitmap scans or SAOP
1389 * clauses.
1390 */
1392 continue;
1393
1395 {
1397 {
1402 matched = true;
1403 break;
1404 }
1405 }
1406
1407 /*
1408 * Stop looping through the indexes, if we managed to match
1409 * nonConstExpr to any index column.
1410 */
1412 break;
1413 indexnum++;
1414 }
1415 }
1416
1417 /*
1418 * Fast-path check: if no clause is matching to the index column, we can
1419 * just give up at this stage and return the clause list as-is.
1420 */
1421 if (!matched)
1422 {
1423 pfree(matches);
1424 return orargs;
1425 }
1426
1427 /*
1428 * Sort clauses to make similar clauses go together. But at the same
1429 * time, we would like to change the order of clauses as little as
1430 * possible. To do so, we reorder each group of similar clauses so that
1431 * the first item of the group stays in place, and all the other items are
1432 * moved after it. So, if there are no similar clauses, the order of
1433 * clauses stays the same. When there are some groups, required
1434 * reordering happens while the rest of the clauses remain in their
1435 * places. That is achieved by assigning a 'groupindex' to each clause:
1436 * the number of the first item in the group in the original clause list.
1437 */
1439
1440 /* Assign groupindex to the sorted clauses */
1442 {
1443 /*
1444 * When two clauses are similar and should belong to the same group,
1445 * copy the 'groupindex' from the previous clause. Given we are
1446 * considering clauses in direct order, all the clauses would have a
1447 * 'groupindex' equal to the 'groupindex' of the first clause in the
1448 * group.
1449 */
1454 matches[i].indexnum != -1)
1456 }
1457
1458 /* Re-sort clauses first by groupindex then by argindex */
1460
1461 /*
1462 * Group similar clauses into single sub-restrictinfo. Side effect: the
1463 * resulting list of restrictions will be sorted by indexnum and colnum.
1464 */
1465 group_start = 0;
1467 {
1468 /* Check if it's a group boundary */
1469 if (group_start >= 0 &&
1470 (i == n ||
1471 matches[i].indexnum != matches[group_start].indexnum ||
1472 matches[i].colnum != matches[group_start].colnum ||
1473 matches[i].opno != matches[group_start].opno ||
1474 matches[i].inputcollid != matches[group_start].inputcollid ||
1475 matches[i].indexnum == -1))
1476 {
1477 /*
1478 * One clause in group: add it "as is" to the upper-level OR.
1479 */
1481 {
1482 result = lappend(result,
1483 list_nth(orargs,
1484 matches[group_start].argindex));
1485 }
1486 else
1487 {
1488 /*
1489 * Two or more clauses in a group: create a nested OR.
1490 */
1493 RestrictInfo *subrinfo;
1495
1497
1498 /* Construct the list of nested OR arguments */
1500 {
1502
1506 else
1508 }
1509
1510 /* Construct the nested OR and wrap it with RestrictInfo */
1513 make_orclause(rargs),
1514 rinfo->is_pushed_down,
1515 rinfo->has_clone,
1516 rinfo->is_clone,
1517 rinfo->pseudoconstant,
1518 rinfo->security_level,
1519 rinfo->required_relids,
1520 rinfo->incompatible_relids,
1521 rinfo->outer_relids);
1522 result = lappend(result, subrinfo);
1523 }
1524
1525 group_start = i;
1526 }
1527 }
1528 pfree(matches);
1529 return result;
1530}
static int or_arg_index_match_cmp(const void *a, const void *b)
Definition: indxpath.c:1199
static int or_arg_index_match_cmp_group(const void *a, const void *b)
Definition: indxpath.c:1237
RestrictInfo * make_plain_restrictinfo(PlannerInfo *root, Expr *clause, Expr *orclause, bool is_pushed_down, bool has_clone, bool is_clone, bool pseudoconstant, Index security_level, Relids required_relids, Relids incompatible_relids, Relids outer_relids)
Definition: restrictinfo.c:103
Definition: primnodes.h:831
Definition: indxpath.c:1180
Definition: primnodes.h:1199
References arg, OrArgIndexMatch::argindex, generate_unaccent_rules::args, OpExpr::args, Assert(), bms_is_member(), castNode, RestrictInfo::clause, OrArgIndexMatch::colnum, contain_volatile_functions(), get_commutator(), get_leftop(), get_rightop(), OrArgIndexMatch::groupindex, RestrictInfo::has_clone, i, if(), RestrictInfo::incompatible_relids, RelOptInfo::indexlist, OrArgIndexMatch::indexnum, OrArgIndexMatch::inputcollid, InvalidOid, RestrictInfo::is_clone, RestrictInfo::is_pushed_down, IsA, j, lappend(), lfirst, list_length(), list_nth(), make_orclause(), make_plain_restrictinfo(), match_index_to_operand(), NIL, OidIsValid, OrArgIndexMatch::opno, OpExpr::opno, or_arg_index_match_cmp(), or_arg_index_match_cmp_group(), RestrictInfo::outer_relids, palloc(), pfree(), qsort, RelOptInfo::relid, RestrictInfo::required_relids, root, and RestrictInfo::security_level.
Referenced by generate_bitmap_or_paths().
◆ indexcol_is_bool_constant_for_query()
| bool indexcol_is_bool_constant_for_query | ( | PlannerInfo * | root, |
| IndexOptInfo * | index, | ||
| int | indexcol | ||
| ) |
Definition at line 4375 of file indxpath.c.
4378{
4379 ListCell *lc;
4380
4381 /* If the index isn't boolean, we can't possibly get a match */
4383 return false;
4384
4385 /* Check each restriction clause for the index's rel */
4387 {
4389
4390 /*
4391 * As in match_clause_to_indexcol, never match pseudoconstants to
4392 * indexes. (It might be semantically okay to do so here, but the
4393 * odds of getting a match are negligible, so don't waste the cycles.)
4394 */
4395 if (rinfo->pseudoconstant)
4396 continue;
4397
4398 /* See if we can match the clause's expression to the index column */
4400 return true;
4401 }
4402
4403 return false;
4404}
static IndexClause * match_boolean_index_clause(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:2816
References IsBooleanOpfamily(), lfirst, match_boolean_index_clause(), and root.
Referenced by build_index_pathkeys().
◆ is_pseudo_constant_for_index()
| bool is_pseudo_constant_for_index | ( | PlannerInfo * | root, |
| Node * | expr, | ||
| IndexOptInfo * | index | ||
| ) |
Definition at line 4512 of file indxpath.c.
4513{
4514 /* pull_varnos is cheaper than volatility check, so do that first */
4516 return false; /* no good, contains Var of table */
4518 return false; /* no good, volatile comparison value */
4519 return true;
4520}
References bms_is_member(), contain_volatile_functions(), pull_varnos(), and root.
◆ IsBooleanOpfamily()
|
static |
Definition at line 2791 of file indxpath.c.
2792{
2794 return IsBuiltinBooleanOpfamily(opfamily);
2795 else
2797}
References FirstNormalObjectId, and op_in_opfamily().
Referenced by indexcol_is_bool_constant_for_query(), and match_clause_to_indexcol().
◆ make_bitmap_paths_for_or_group()
|
static |
Definition at line 1547 of file indxpath.c.
1549{
1552 ListCell *lc;
1553 List *orargs;
1555 Cost jointcost = 0.0,
1556 splitcost = 0.0;
1557 Path *bitmapqual;
1558 List *indlist;
1559
1560 /*
1561 * First, try to match the whole group to the one index.
1562 */
1563 orargs = list_make1(ri);
1565 orargs,
1566 other_clauses);
1568 {
1570 jointcost = bitmapqual->total_cost;
1571 jointlist = list_make1(bitmapqual);
1572 }
1573
1574 /*
1575 * If we manage to find a bitmap scan, which uses the group of OR-clause
1576 * arguments as a whole, we can skip matching OR-clause arguments
1577 * one-by-one as long as there are no other clauses, which can bring more
1578 * efficiency to one-by-one case.
1579 */
1581 return jointlist;
1582
1583 /*
1584 * Also try to match all containing clauses one-by-one.
1585 */
1587 {
1589
1591 orargs,
1592 other_clauses);
1593
1595 {
1596 splitlist = NIL;
1597 break;
1598 }
1599
1601 splitcost += bitmapqual->total_cost;
1602 splitlist = lappend(splitlist, bitmapqual);
1603 }
1604
1605 /*
1606 * Pick the best option.
1607 */
1609 return jointlist;
1611 return splitlist;
1612 else
1613 return (jointcost < splitcost) ? jointlist : splitlist;
1614}
References generate_unaccent_rules::args, build_paths_for_OR(), choose_bitmap_and(), lappend(), lfirst, list_make1, NIL, root, and Path::total_cost.
Referenced by generate_bitmap_or_paths().
◆ match_boolean_index_clause()
|
static |
Definition at line 2816 of file indxpath.c.
2820{
2822 Expr *op = NULL;
2823
2824 /* Direct match? */
2826 {
2827 /* convert to indexkey = TRUE */
2829 (Expr *) clause,
2832 }
2833 /* NOT clause? */
2835 {
2837
2839 {
2840 /* convert to indexkey = FALSE */
2845 }
2846 }
2847
2848 /*
2849 * Since we only consider clauses at top level of WHERE, we can convert
2850 * indexkey IS TRUE and indexkey IS FALSE to index searches as well. The
2851 * different meaning for NULL isn't important.
2852 */
2854 {
2857
2860 {
2861 /* convert to indexkey = TRUE */
2866 }
2869 {
2870 /* convert to indexkey = FALSE */
2875 }
2876 }
2877
2878 /*
2879 * If we successfully made an operator clause from the given qual, we must
2880 * wrap it in an IndexClause. It's not lossy.
2881 */
2882 if (op)
2883 {
2885
2886 iclause->rinfo = rinfo;
2889 iclause->indexcol = indexcol;
2891 return iclause;
2892 }
2893
2894 return NULL;
2895}
Definition: primnodes.h:1985
References arg, BooleanTest::arg, BooleanTest::booltesttype, RestrictInfo::clause, get_notclausearg(), if(), IndexClause::indexcol, IndexClause::indexcols, IndexClause::indexquals, InvalidOid, IS_FALSE, is_notclause(), IS_TRUE, IsA, list_make1, IndexClause::lossy, make_opclause(), make_simple_restrictinfo, makeBoolConst(), makeNode, match_index_to_operand(), NIL, IndexClause::rinfo, and root.
Referenced by indexcol_is_bool_constant_for_query(), and match_clause_to_indexcol().
◆ match_clause_to_index()
|
static |
Definition at line 2586 of file indxpath.c.
2590{
2591 int indexcol;
2592
2593 /*
2594 * Never match pseudoconstants to indexes. (Normally a match could not
2595 * happen anyway, since a pseudoconstant clause couldn't contain a Var,
2596 * but what if someone builds an expression index on a constant? It's not
2597 * totally unreasonable to do so with a partial index, either.)
2598 */
2599 if (rinfo->pseudoconstant)
2600 return;
2601
2602 /*
2603 * If clause can't be used as an indexqual because it must wait till after
2604 * some lower-security-level restriction clause, reject it.
2605 */
2607 return;
2608
2609 /* OK, check each index key column for a match */
2611 {
2612 IndexClause *iclause;
2613 ListCell *lc;
2614
2615 /* Ignore duplicates */
2617 {
2619
2621 return;
2622 }
2623
2624 /* OK, try to match the clause to the index column */
2626 rinfo,
2627 indexcol,
2628 index);
2629 if (iclause)
2630 {
2631 /* Success, so record it */
2632 clauseset->indexclauses[indexcol] =
2635 return;
2636 }
2637 }
2638}
static IndexClause * match_clause_to_indexcol(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:2710
bool restriction_is_securely_promotable(RestrictInfo *restrictinfo, RelOptInfo *rel)
Definition: restrictinfo.c:422
References IndexClauseSet::indexclauses, lappend(), lfirst, match_clause_to_indexcol(), IndexClauseSet::nonempty, restriction_is_securely_promotable(), IndexClause::rinfo, and root.
Referenced by match_clauses_to_index(), and match_join_clauses_to_index().
◆ match_clause_to_indexcol()
|
static |
Definition at line 2710 of file indxpath.c.
2714{
2715 IndexClause *iclause;
2717 Oid opfamily;
2718
2719 Assert(indexcol < index->nkeycolumns);
2720
2721 /*
2722 * Historically this code has coped with NULL clauses. That's probably
2723 * not possible anymore, but we might as well continue to cope.
2724 */
2725 if (clause == NULL)
2726 return NULL;
2727
2728 /* First check for boolean-index cases. */
2729 opfamily = index->opfamily[indexcol];
2731 {
2733 if (iclause)
2734 return iclause;
2735 }
2736
2737 /*
2738 * Clause must be an opclause, funcclause, ScalarArrayOpExpr,
2739 * RowCompareExpr, or OR-clause that could be converted to SAOP. Or, if
2740 * the index supports it, we can handle IS NULL/NOT NULL clauses.
2741 */
2743 {
2745 }
2747 {
2749 }
2751 {
2753 }
2755 {
2757 }
2759 {
2761 }
2763 {
2765
2766 if (!nt->argisrow &&
2768 {
2770 iclause->rinfo = rinfo;
2773 iclause->indexcol = indexcol;
2775 return iclause;
2776 }
2777 }
2778
2779 return NULL;
2780}
static IndexClause * match_saopclause_to_indexcol(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:3134
static IndexClause * match_orclause_to_indexcol(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:3296
static IndexClause * match_opclause_to_indexcol(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:2903
static IndexClause * match_rowcompare_to_indexcol(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:3202
static IndexClause * match_funcclause_to_indexcol(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:3022
Definition: primnodes.h:764
Definition: primnodes.h:1961
References NullTest::arg, Assert(), RestrictInfo::clause, IndexClause::indexcol, IndexClause::indexcols, IndexClause::indexquals, IsA, IsBooleanOpfamily(), list_make1, IndexClause::lossy, makeNode, match_boolean_index_clause(), match_funcclause_to_indexcol(), match_index_to_operand(), match_opclause_to_indexcol(), match_orclause_to_indexcol(), match_rowcompare_to_indexcol(), match_saopclause_to_indexcol(), NIL, restriction_is_or_clause(), IndexClause::rinfo, and root.
Referenced by match_clause_to_index().
◆ match_clause_to_ordering_op()
|
static |
Definition at line 3852 of file indxpath.c.
3856{
3857 Oid opfamily;
3858 Oid idxcollation;
3859 Node *leftop,
3860 *rightop;
3861 Oid expr_op;
3862 Oid expr_coll;
3863 Oid sortfamily;
3864 bool commuted;
3865
3866 Assert(indexcol < index->nkeycolumns);
3867
3868 opfamily = index->opfamily[indexcol];
3869 idxcollation = index->indexcollations[indexcol];
3870
3871 /*
3872 * Clause must be a binary opclause.
3873 */
3875 return NULL;
3876 leftop = get_leftop(clause);
3877 rightop = get_rightop(clause);
3878 if (!leftop || !rightop)
3879 return NULL;
3880 expr_op = ((OpExpr *) clause)->opno;
3881 expr_coll = ((OpExpr *) clause)->inputcollid;
3882
3883 /*
3884 * We can forget the whole thing right away if wrong collation.
3885 */
3887 return NULL;
3888
3889 /*
3890 * Check for clauses of the form: (indexkey operator constant) or
3891 * (constant operator indexkey).
3892 */
3894 !contain_var_clause(rightop) &&
3895 !contain_volatile_functions(rightop))
3896 {
3897 commuted = false;
3898 }
3900 !contain_var_clause(leftop) &&
3901 !contain_volatile_functions(leftop))
3902 {
3903 /* Might match, but we need a commuted operator */
3904 expr_op = get_commutator(expr_op);
3906 return NULL;
3907 commuted = true;
3908 }
3909 else
3910 return NULL;
3911
3912 /*
3913 * Is the (commuted) operator an ordering operator for the opfamily? And
3914 * if so, does it yield the right sorting semantics?
3915 */
3916 sortfamily = get_op_opfamily_sortfamily(expr_op, opfamily);
3917 if (sortfamily != pk_opfamily)
3918 return NULL;
3919
3920 /* We have a match. Return clause or a commuted version thereof. */
3921 if (commuted)
3922 {
3924
3925 /* flat-copy all the fields of clause */
3927
3928 /* commute it */
3929 newclause->opno = expr_op;
3930 newclause->opfuncid = InvalidOid;
3932
3933 clause = (Expr *) newclause;
3934 }
3935
3936 return clause;
3937}
Oid get_op_opfamily_sortfamily(Oid opno, Oid opfamily)
Definition: lsyscache.c:109
References OpExpr::args, Assert(), contain_var_clause(), contain_volatile_functions(), get_commutator(), get_leftop(), get_op_opfamily_sortfamily(), get_rightop(), IndexCollMatchesExprColl, InvalidOid, is_opclause(), list_make2, makeNode, match_index_to_operand(), and OpExpr::opno.
Referenced by match_pathkeys_to_index().
◆ match_clauses_to_index()
|
static |
Definition at line 2553 of file indxpath.c.
2557{
2558 ListCell *lc;
2559
2560 foreach(lc, clauses)
2561 {
2563
2565 }
2566}
static void match_clause_to_index(PlannerInfo *root, RestrictInfo *rinfo, IndexOptInfo *index, IndexClauseSet *clauseset)
Definition: indxpath.c:2586
References lfirst_node, match_clause_to_index(), and root.
Referenced by build_paths_for_OR(), match_eclass_clauses_to_index(), and match_restriction_clauses_to_index().
◆ match_eclass_clauses_to_index()
|
static |
Definition at line 2515 of file indxpath.c.
2517{
2518 int indexcol;
2519
2520 /* No work if rel is not in any such ECs */
2522 return;
2523
2525 {
2527 List *clauses;
2528
2529 /* Generate clauses, skipping any that join to lateral_referencers */
2531 arg.indexcol = indexcol;
2533 index->rel,
2535 &arg,
2536 index->rel->lateral_referencers);
2537
2538 /*
2539 * We have to check whether the results actually do match the index,
2540 * since for non-btree indexes the EC's equality operators might not
2541 * be in the index opclass (cf ec_member_matches_indexcol).
2542 */
2544 }
2545}
List * generate_implied_equalities_for_column(PlannerInfo *root, RelOptInfo *rel, ec_matches_callback_type callback, void *callback_arg, Relids prohibited_rels)
Definition: equivclass.c:3239
static bool ec_member_matches_indexcol(PlannerInfo *root, RelOptInfo *rel, EquivalenceClass *ec, EquivalenceMember *em, void *arg)
Definition: indxpath.c:4104
References arg, ec_member_matches_indexcol(), generate_implied_equalities_for_column(), match_clauses_to_index(), and root.
Referenced by create_index_paths().
◆ match_funcclause_to_indexcol()
|
static |
Definition at line 3022 of file indxpath.c.
3026{
3028 int indexarg;
3029 ListCell *lc;
3030
3031 /*
3032 * We have no built-in intelligence about function clauses, but if there's
3033 * a planner support function, it might be able to do something. But, to
3034 * cut down on wasted planning cycles, only call the support function if
3035 * at least one argument matches the target index column.
3036 *
3037 * Note that we don't insist on the other arguments being pseudoconstants;
3038 * the support function has to check that. This is to allow cases where
3039 * only some of the other arguments need to be included in the indexqual.
3040 */
3041 indexarg = 0;
3043 {
3045
3047 {
3049 rinfo,
3050 clause->funcid,
3051 indexarg,
3052 indexcol,
3053 index);
3054 }
3055
3056 indexarg++;
3057 }
3058
3059 return NULL;
3060}
static IndexClause * get_index_clause_from_support(PlannerInfo *root, RestrictInfo *rinfo, Oid funcid, int indexarg, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:3068
References FuncExpr::args, RestrictInfo::clause, FuncExpr::funcid, get_index_clause_from_support(), lfirst, match_index_to_operand(), and root.
Referenced by match_clause_to_indexcol().
◆ match_index_to_operand()
| bool match_index_to_operand | ( | Node * | operand, |
| int | indexcol, | ||
| IndexOptInfo * | index | ||
| ) |
Definition at line 4426 of file indxpath.c.
4429{
4430 int indkey;
4431
4432 /*
4433 * Ignore any RelabelType node above the operand. This is needed to be
4434 * able to apply indexscanning in binary-compatible-operator cases. Note:
4435 * we can assume there is at most one RelabelType node;
4436 * eval_const_expressions() will have simplified if more than one.
4437 */
4440
4441 indkey = index->indexkeys[indexcol];
4442 if (indkey != 0)
4443 {
4444 /*
4445 * Simple index column; operand must be a matching Var.
4446 */
4449 indkey == ((Var *) operand)->varattno &&
4450 ((Var *) operand)->varnullingrels == NULL)
4451 return true;
4452 }
4453 else
4454 {
4455 /*
4456 * Index expression; find the correct expression. (This search could
4457 * be avoided, at the cost of complicating all the callers of this
4458 * routine; doesn't seem worth it.)
4459 */
4460 ListCell *indexpr_item;
4462 Node *indexkey;
4463
4466 {
4468 {
4469 if (indexpr_item == NULL)
4472 }
4473 }
4474 if (indexpr_item == NULL)
4477
4478 /*
4479 * Does it match the operand? Again, strip any relabeling.
4480 */
4483
4485 return true;
4486 }
4487
4488 return false;
4489}
Definition: primnodes.h:262
References arg, elog, equal(), ERROR, i, IsA, lfirst, list_head(), and lnext().
Referenced by ec_member_matches_indexcol(), expand_indexqual_rowcompare(), get_actual_variable_range(), group_similar_or_args(), match_boolean_index_clause(), match_clause_to_indexcol(), match_clause_to_ordering_op(), match_funcclause_to_indexcol(), match_opclause_to_indexcol(), match_orclause_to_indexcol(), match_rowcompare_to_indexcol(), match_saopclause_to_indexcol(), and relation_has_unique_index_ext().
◆ match_join_clauses_to_index()
|
static |
Definition at line 2481 of file indxpath.c.
2485{
2486 ListCell *lc;
2487
2488 /* Scan the rel's join clauses */
2490 {
2492
2493 /* Check if clause can be moved to this rel */
2495 continue;
2496
2497 /*
2498 * Potentially usable, so see if it matches the index or is an OR. Use
2499 * list_append_unique_ptr() here to avoid possible duplicates when
2500 * processing the same clauses with different indexes.
2501 */
2503 *joinorclauses = list_append_unique_ptr(*joinorclauses, rinfo);
2504
2506 }
2507}
References join_clause_is_movable_to(), RelOptInfo::joininfo, lfirst, list_append_unique_ptr(), match_clause_to_index(), restriction_is_or_clause(), and root.
Referenced by create_index_paths().
◆ match_opclause_to_indexcol()
|
static |
Definition at line 2903 of file indxpath.c.
2907{
2908 IndexClause *iclause;
2910 Node *leftop,
2911 *rightop;
2912 Oid expr_op;
2913 Oid expr_coll;
2914 Index index_relid;
2915 Oid opfamily;
2916 Oid idxcollation;
2917
2918 /*
2919 * Only binary operators need apply. (In theory, a planner support
2920 * function could do something with a unary operator, but it seems
2921 * unlikely to be worth the cycles to check.)
2922 */
2924 return NULL;
2925
2928 expr_op = clause->opno;
2929 expr_coll = clause->inputcollid;
2930
2931 index_relid = index->rel->relid;
2932 opfamily = index->opfamily[indexcol];
2933 idxcollation = index->indexcollations[indexcol];
2934
2935 /*
2936 * Check for clauses of the form: (indexkey operator constant) or
2937 * (constant operator indexkey). See match_clause_to_indexcol's notes
2938 * about const-ness.
2939 *
2940 * Note that we don't ask the support function about clauses that don't
2941 * have one of these forms. Again, in principle it might be possible to
2942 * do something, but it seems unlikely to be worth the cycles to check.
2943 */
2945 !bms_is_member(index_relid, rinfo->right_relids) &&
2946 !contain_volatile_functions(rightop))
2947 {
2949 op_in_opfamily(expr_op, opfamily))
2950 {
2952 iclause->rinfo = rinfo;
2955 iclause->indexcol = indexcol;
2957 return iclause;
2958 }
2959
2960 /*
2961 * If we didn't find a member of the index's opfamily, try the support
2962 * function for the operator's underlying function.
2963 */
2966 rinfo,
2967 clause->opfuncid,
2968 0, /* indexarg on left */
2969 indexcol,
2970 index);
2971 }
2972
2974 !bms_is_member(index_relid, rinfo->left_relids) &&
2975 !contain_volatile_functions(leftop))
2976 {
2978 {
2980
2982 op_in_opfamily(comm_op, opfamily))
2983 {
2984 RestrictInfo *commrinfo;
2985
2986 /* Build a commuted OpExpr and RestrictInfo */
2987 commrinfo = commute_restrictinfo(rinfo, comm_op);
2988
2989 /* Make an IndexClause showing that as a derived qual */
2991 iclause->rinfo = rinfo;
2994 iclause->indexcol = indexcol;
2996 return iclause;
2997 }
2998 }
2999
3000 /*
3001 * If we didn't find a member of the index's opfamily, try the support
3002 * function for the operator's underlying function.
3003 */
3006 rinfo,
3007 clause->opfuncid,
3008 1, /* indexarg on right */
3009 indexcol,
3010 index);
3011 }
3012
3013 return NULL;
3014}
RestrictInfo * commute_restrictinfo(RestrictInfo *rinfo, Oid comm_op)
Definition: restrictinfo.c:350
References OpExpr::args, bms_is_member(), RestrictInfo::clause, commute_restrictinfo(), contain_volatile_functions(), get_commutator(), get_index_clause_from_support(), if(), IndexClause::indexcol, IndexCollMatchesExprColl, IndexClause::indexcols, IndexClause::indexquals, linitial, list_length(), list_make1, IndexClause::lossy, lsecond, makeNode, match_index_to_operand(), NIL, OidIsValid, op_in_opfamily(), OpExpr::opno, IndexClause::rinfo, root, and set_opfuncid().
Referenced by match_clause_to_indexcol().
◆ match_orclause_to_indexcol()
|
static |
Definition at line 3296 of file indxpath.c.
3300{
3301 ListCell *lc;
3303 Node *indexExpr = NULL;
3305 ScalarArrayOpExpr *saopexpr = NULL;
3307 IndexClause *iclause;
3311 bool firstTime = true;
3312 bool haveNonConst = false;
3314
3317
3318 /* Ignore index if it doesn't support SAOP clauses */
3320 return NULL;
3321
3322 /*
3323 * Try to convert a list of OR-clauses to a single SAOP expression. Each
3324 * OR entry must be in the form: (indexkey operator constant) or (constant
3325 * operator indexkey). Operators of all the entries must match. To be
3326 * effective, give up on the first non-matching entry. Exit is
3327 * implemented as a break from the loop, which is catched afterwards.
3328 */
3330 {
3331 RestrictInfo *subRinfo;
3332 OpExpr *subClause;
3333 Oid opno;
3334 Node *leftop,
3335 *rightop;
3336 Node *constExpr;
3337
3339 break;
3340
3342
3343 /* Only operator clauses can match */
3345 break;
3346
3348 opno = subClause->opno;
3349
3350 /* Only binary operators can match */
3352 break;
3353
3354 /*
3355 * The parameters below must match between sub-rinfo and its parent as
3356 * make_restrictinfo() fills them with the same values, and further
3357 * modifications are also the same for the whole subtree. However,
3358 * still make a sanity check.
3359 */
3365
3366 /*
3367 * Also, check that required_relids in sub-rinfo is subset of parent's
3368 * required_relids.
3369 */
3371
3372 /* Only the operator returning a boolean suit the transformation. */
3374 break;
3375
3376 /*
3377 * Check for clauses of the form: (indexkey operator constant) or
3378 * (constant operator indexkey). See match_clause_to_indexcol's notes
3379 * about const-ness.
3380 */
3384 !bms_is_member(indexRelid, subRinfo->right_relids) &&
3385 !contain_volatile_functions(rightop))
3386 {
3387 indexExpr = leftop;
3388 constExpr = rightop;
3389 }
3391 !bms_is_member(indexRelid, subRinfo->left_relids) &&
3392 !contain_volatile_functions(leftop))
3393 {
3394 opno = get_commutator(opno);
3396 {
3397 /* commutator doesn't exist, we can't reverse the order */
3398 break;
3399 }
3400 indexExpr = rightop;
3401 constExpr = leftop;
3402 }
3403 else
3404 {
3405 break;
3406 }
3407
3408 /*
3409 * Ignore any RelabelType node above the operands. This is needed to
3410 * be able to apply indexscanning in binary-compatible-operator cases.
3411 * Note: we can assume there is at most one RelabelType node;
3412 * eval_const_expressions() will have simplified if more than one.
3413 */
3418
3419 /* Forbid transformation for composite types, records. */
3422 break;
3423
3424 /*
3425 * Save information about the operator, type, and collation for the
3426 * first matching qual. Then, check that subsequent quals match the
3427 * first.
3428 */
3429 if (firstTime)
3430 {
3431 matchOpno = opno;
3432 consttype = exprType(constExpr);
3433 arraytype = get_array_type(consttype);
3434 inputcollid = subClause->inputcollid;
3435
3436 /*
3437 * Check that the operator is presented in the opfamily and that
3438 * the expression collation matches the index collation. Also,
3439 * there must be an array type to construct an array later.
3440 */
3443 !OidIsValid(arraytype))
3444 break;
3445 firstTime = false;
3446 }
3447 else
3448 {
3449 if (opno != matchOpno ||
3450 inputcollid != subClause->inputcollid ||
3451 consttype != exprType(constExpr))
3452 break;
3453 }
3454
3455 /*
3456 * Check if our list of constants in match_clause_to_indexcol's
3457 * understanding of const-ness have something other than Const.
3458 */
3460 haveNonConst = true;
3461 consts = lappend(consts, constExpr);
3462 }
3463
3464 /*
3465 * Catch the break from the loop above. Normally, a foreach() loop ends
3466 * up with a NULL list cell. A non-NULL list cell indicates a break from
3467 * the foreach() loop. Free the consts list and return NULL then.
3468 */
3469 if (lc != NULL)
3470 {
3471 list_free(consts);
3472 return NULL;
3473 }
3474
3475 saopexpr = make_SAOP_expr(matchOpno, indexExpr, consttype, inputcollid,
3476 inputcollid, consts, haveNonConst);
3477
3478 /*
3479 * Finally, build an IndexClause based on the SAOP node. Use
3480 * make_simple_restrictinfo() to get RestrictInfo with clean selectivity
3481 * estimations, because they may differ from the estimation made for an OR
3482 * clause. Although it is not a lossy expression, keep the original rinfo
3483 * in iclause->rinfo as prescribed.
3484 */
3486 iclause->rinfo = rinfo;
3488 &saopexpr->xpr));
3489 iclause->lossy = false;
3490 iclause->indexcol = indexcol;
3491 iclause->indexcols = NIL;
3492 return iclause;
3493}
ScalarArrayOpExpr * make_SAOP_expr(Oid oper, Node *leftexpr, Oid coltype, Oid arraycollid, Oid inputcollid, List *exprs, bool haveNonConst)
Definition: clauses.c:5453
Definition: primnodes.h:324
References arg, OpExpr::args, BoolExpr::args, Assert(), bms_equal(), bms_is_member(), bms_is_subset(), BoolExpr::boolop, RestrictInfo::clause, contain_volatile_functions(), exprType(), get_array_type(), get_commutator(), get_op_rettype(), if(), RestrictInfo::incompatible_relids, IndexCollMatchesExprColl, InvalidOid, RestrictInfo::is_clone, RestrictInfo::is_pushed_down, IsA, lappend(), lfirst, linitial, list_free(), list_length(), list_make1, lsecond, make_SAOP_expr(), make_simple_restrictinfo, makeNode, match_index_to_operand(), NIL, OidIsValid, op_in_opfamily(), OpExpr::opno, OR_EXPR, RestrictInfo::outer_relids, RestrictInfo::required_relids, root, RestrictInfo::security_level, and type_is_rowtype().
Referenced by match_clause_to_indexcol().
◆ match_pathkeys_to_index()
|
static |
Definition at line 3741 of file indxpath.c.
3744{
3745 ListCell *lc1;
3746
3748 *clause_columns_p = NIL;
3749
3750 /* Only indexes with the amcanorderbyop property are interesting here */
3752 return;
3753
3754 foreach(lc1, pathkeys)
3755 {
3757 bool found = false;
3758 EquivalenceMemberIterator it;
3759 EquivalenceMember *member;
3760
3761
3762 /* Pathkey must request default sort order for the target opfamily */
3764 return;
3765
3766 /* If eclass is volatile, no hope of using an indexscan */
3767 if (pathkey->pk_eclass->ec_has_volatile)
3768 return;
3769
3770 /*
3771 * Try to match eclass member expression(s) to index. Note that child
3772 * EC members are considered, but only when they belong to the target
3773 * relation. (Unlike regular members, the same expression could be a
3774 * child member of more than one EC. Therefore, the same index could
3775 * be considered to match more than one pathkey list, which is OK
3776 * here. See also get_eclass_for_sort_expr.)
3777 */
3778 setup_eclass_member_iterator(&it, pathkey->pk_eclass,
3779 index->rel->relids);
3781 {
3782 int indexcol;
3783
3784 /* No possibility of match if it references other relations */
3786 continue;
3787
3788 /*
3789 * We allow any column of the index to match each pathkey; they
3790 * don't have to match left-to-right as you might expect. This is
3791 * correct for GiST, and it doesn't matter for SP-GiST because
3792 * that doesn't handle multiple columns anyway, and no other
3793 * existing AMs support amcanorderbyop. We might need different
3794 * logic in future for other implementations.
3795 */
3797 {
3798 Expr *expr;
3799
3801 indexcol,
3802 member->em_expr,
3803 pathkey->pk_opfamily);
3804 if (expr)
3805 {
3806 *orderby_clauses_p = lappend(*orderby_clauses_p, expr);
3807 *clause_columns_p = lappend_int(*clause_columns_p, indexcol);
3808 found = true;
3809 break;
3810 }
3811 }
3812
3813 if (found) /* don't want to look at remaining members */
3814 break;
3815 }
3816
3817 /*
3818 * Return the matches found so far when this pathkey couldn't be
3819 * matched to the index.
3820 */
3821 if (!found)
3822 return;
3823 }
3824}
void setup_eclass_member_iterator(EquivalenceMemberIterator *it, EquivalenceClass *ec, Relids child_relids)
Definition: equivclass.c:3156
EquivalenceMember * eclass_member_iterator_next(EquivalenceMemberIterator *it)
Definition: equivclass.c:3175
static Expr * match_clause_to_ordering_op(IndexOptInfo *index, int indexcol, Expr *clause, Oid pk_opfamily)
Definition: indxpath.c:3852
Definition: pathnodes.h:1571
Definition: pathnodes.h:1506
Definition: pathnodes.h:1598
References bms_equal(), COMPARE_LT, eclass_member_iterator_next(), EquivalenceMember::em_expr, EquivalenceMember::em_relids, lappend(), lappend_int(), lfirst, match_clause_to_ordering_op(), NIL, PathKey::pk_cmptype, PathKey::pk_nulls_first, PathKey::pk_opfamily, and setup_eclass_member_iterator().
Referenced by build_index_paths().
◆ match_restriction_clauses_to_index()
|
static |
Definition at line 2465 of file indxpath.c.
2468{
2469 /* We can ignore clauses that are implied by the index predicate */
2471}
References match_clauses_to_index(), and root.
Referenced by create_index_paths().
◆ match_rowcompare_to_indexcol()
|
static |
Definition at line 3202 of file indxpath.c.
3206{
3208 Index index_relid;
3209 Oid opfamily;
3210 Oid idxcollation;
3211 Node *leftop,
3212 *rightop;
3213 bool var_on_left;
3214 Oid expr_op;
3215 Oid expr_coll;
3216
3217 /* Forget it if we're not dealing with a btree index */
3219 return NULL;
3220
3221 index_relid = index->rel->relid;
3222 opfamily = index->opfamily[indexcol];
3223 idxcollation = index->indexcollations[indexcol];
3224
3225 /*
3226 * We could do the matching on the basis of insisting that the opfamily
3227 * shown in the RowCompareExpr be the same as the index column's opfamily,
3228 * but that could fail in the presence of reverse-sort opfamilies: it'd be
3229 * a matter of chance whether RowCompareExpr had picked the forward or
3230 * reverse-sort family. So look only at the operator, and match if it is
3231 * a member of the index's opfamily (after commutation, if the indexkey is
3232 * on the right). We'll worry later about whether any additional
3233 * operators are matchable to the index.
3234 */
3237 expr_op = linitial_oid(clause->opnos);
3238 expr_coll = linitial_oid(clause->inputcollids);
3239
3240 /* Collations must match, if relevant */
3242 return NULL;
3243
3244 /*
3245 * These syntactic tests are the same as in match_opclause_to_indexcol()
3246 */
3249 !contain_volatile_functions(rightop))
3250 {
3251 /* OK, indexkey is on left */
3252 var_on_left = true;
3253 }
3256 !contain_volatile_functions(leftop))
3257 {
3258 /* indexkey is on right, so commute the operator */
3259 expr_op = get_commutator(expr_op);
3261 return NULL;
3262 var_on_left = false;
3263 }
3264 else
3265 return NULL;
3266
3267 /* We're good if the operator is the right type of opfamily member */
3269 {
3275 rinfo,
3276 indexcol,
3277 index,
3278 expr_op,
3279 var_on_left);
3280 }
3281
3282 return NULL;
3283}
static IndexClause * expand_indexqual_rowcompare(PlannerInfo *root, RestrictInfo *rinfo, int indexcol, IndexOptInfo *index, Oid expr_op, bool var_on_left)
Definition: indxpath.c:3519
References bms_is_member(), BTGreaterEqualStrategyNumber, BTGreaterStrategyNumber, BTLessEqualStrategyNumber, BTLessStrategyNumber, RestrictInfo::clause, contain_volatile_functions(), expand_indexqual_rowcompare(), get_commutator(), get_op_opfamily_strategy(), if(), IndexCollMatchesExprColl, InvalidOid, RowCompareExpr::largs, linitial, linitial_oid, match_index_to_operand(), pull_varnos(), RowCompareExpr::rargs, and root.
Referenced by match_clause_to_indexcol().
◆ match_saopclause_to_indexcol()
|
static |
Definition at line 3134 of file indxpath.c.
3138{
3140 Node *leftop,
3141 *rightop;
3142 Relids right_relids;
3143 Oid expr_op;
3144 Oid expr_coll;
3145 Index index_relid;
3146 Oid opfamily;
3147 Oid idxcollation;
3148
3149 /* We only accept ANY clauses, not ALL */
3151 return NULL;
3155 expr_op = saop->opno;
3156 expr_coll = saop->inputcollid;
3157
3158 index_relid = index->rel->relid;
3159 opfamily = index->opfamily[indexcol];
3160 idxcollation = index->indexcollations[indexcol];
3161
3162 /*
3163 * We must have indexkey on the left and a pseudo-constant array argument.
3164 */
3166 !bms_is_member(index_relid, right_relids) &&
3167 !contain_volatile_functions(rightop))
3168 {
3170 op_in_opfamily(expr_op, opfamily))
3171 {
3173
3174 iclause->rinfo = rinfo;
3177 iclause->indexcol = indexcol;
3179 return iclause;
3180 }
3181
3182 /*
3183 * We do not currently ask support functions about ScalarArrayOpExprs,
3184 * though in principle we could.
3185 */
3186 }
3187
3188 return NULL;
3189}
References ScalarArrayOpExpr::args, bms_is_member(), RestrictInfo::clause, contain_volatile_functions(), if(), IndexClause::indexcol, IndexCollMatchesExprColl, IndexClause::indexcols, IndexClause::indexquals, linitial, list_make1, IndexClause::lossy, lsecond, makeNode, match_index_to_operand(), NIL, op_in_opfamily(), ScalarArrayOpExpr::opno, pull_varnos(), IndexClause::rinfo, root, and ScalarArrayOpExpr::useOr.
Referenced by match_clause_to_indexcol().
◆ or_arg_index_match_cmp()
|
static |
Definition at line 1199 of file indxpath.c.
1200{
1203
1205 return -1;
1207 return 1;
1208
1210 return -1;
1212 return 1;
1213
1215 return -1;
1217 return 1;
1218
1220 return -1;
1222 return 1;
1223
1225 return -1;
1227 return 1;
1228
1229 return 0;
1230}
References a, OrArgIndexMatch::argindex, b, OrArgIndexMatch::colnum, OrArgIndexMatch::indexnum, OrArgIndexMatch::inputcollid, and OrArgIndexMatch::opno.
Referenced by group_similar_or_args().
◆ or_arg_index_match_cmp_group()
|
static |
Definition at line 1237 of file indxpath.c.
1238{
1241
1243 return -1;
1245 return 1;
1246
1248 return -1;
1250 return 1;
1251
1252 return 0;
1253}
References a, OrArgIndexMatch::argindex, b, and OrArgIndexMatch::groupindex.
Referenced by group_similar_or_args().
◆ path_usage_comparator()
|
static |
Definition at line 1990 of file indxpath.c.
1991{
1994 Cost acost;
1995 Cost bcost;
1996 Selectivity aselec;
1997 Selectivity bselec;
1998
2001
2002 /*
2003 * If costs are the same, sort by selectivity.
2004 */
2005 if (acost < bcost)
2006 return -1;
2007 if (acost > bcost)
2008 return 1;
2009
2010 if (aselec < bselec)
2011 return -1;
2012 if (aselec > bselec)
2013 return 1;
2014
2015 return 0;
2016}
References a, b, cost_bitmap_tree_node(), and PathClauseUsage::path.
Referenced by choose_bitmap_and().
◆ relation_has_unique_index_ext()
| bool relation_has_unique_index_ext | ( | PlannerInfo * | root, |
| RelOptInfo * | rel, | ||
| List * | restrictlist, | ||
| List * | exprlist, | ||
| List * | oprlist, | ||
| List ** | extra_clauses | ||
| ) |
Definition at line 4177 of file indxpath.c.
4181{
4182 ListCell *ic;
4183
4185
4186 /* Short-circuit if no indexes... */
4188 return false;
4189
4190 /*
4191 * Examine the rel's restriction clauses for usable var = const clauses
4192 * that we can add to the restrictlist.
4193 */
4195 {
4197
4198 /*
4199 * Note: can_join won't be set for a restriction clause, but
4200 * mergeopfamilies will be if it has a mergejoinable operator and
4201 * doesn't contain volatile functions.
4202 */
4204 continue; /* not mergejoinable */
4205
4206 /*
4207 * The clause certainly doesn't refer to anything but the given rel.
4208 * If either side is pseudoconstant then we can use it.
4209 */
4211 {
4212 /* righthand side is inner */
4213 restrictinfo->outer_is_left = true;
4214 }
4216 {
4217 /* lefthand side is inner */
4218 restrictinfo->outer_is_left = false;
4219 }
4220 else
4221 continue;
4222
4223 /* OK, add to list */
4224 restrictlist = lappend(restrictlist, restrictinfo);
4225 }
4226
4227 /* Short-circuit the easy case */
4229 return false;
4230
4231 /* Examine each index of the relation ... */
4233 {
4237
4238 /*
4239 * If the index is not unique, or not immediately enforced, or if it's
4240 * a partial index, it's useless here. We're unable to make use of
4241 * predOK partial unique indexes due to the fact that
4242 * check_index_predicates() also makes use of join predicates to
4243 * determine if the partial index is usable. Here we need proofs that
4244 * hold true before any joins are evaluated.
4245 */
4247 continue;
4248
4249 /*
4250 * Try to find each index column in the lists of conditions. This is
4251 * O(N^2) or worse, but we expect all the lists to be short.
4252 */
4254 {
4255 bool matched = false;
4256 ListCell *lc;
4257 ListCell *lc2;
4258
4259 foreach(lc, restrictlist)
4260 {
4262 Node *rexpr;
4263
4264 /*
4265 * The condition's equality operator must be a member of the
4266 * index opfamily, else it is not asserting the right kind of
4267 * equality behavior for this index. We check this first
4268 * since it's probably cheaper than match_index_to_operand().
4269 */
4271 continue;
4272
4273 /*
4274 * XXX at some point we may need to check collations here too.
4275 * For the moment we assume all collations reduce to the same
4276 * notion of equality.
4277 */
4278
4279 /* OK, see if the condition operand matches the index key */
4280 if (rinfo->outer_is_left)
4282 else
4284
4286 {
4287 matched = true; /* column is unique */
4288
4290 {
4291 MemoryContext oldMemCtx =
4293
4294 /*
4295 * Add filter clause into a list allowing caller to
4296 * know if uniqueness have made not only by join
4297 * clauses.
4298 */
4300 bms_is_empty(rinfo->right_relids));
4301 if (extra_clauses)
4302 exprs = lappend(exprs, rinfo);
4303 MemoryContextSwitchTo(oldMemCtx);
4304 }
4305
4306 break;
4307 }
4308 }
4309
4310 if (matched)
4311 continue;
4312
4313 forboth(lc, exprlist, lc2, oprlist)
4314 {
4317
4318 /* See if the expression matches the index key */
4320 continue;
4321
4322 /*
4323 * The equality operator must be a member of the index
4324 * opfamily, else it is not asserting the right kind of
4325 * equality behavior for this index. We assume the caller
4326 * determined it is an equality operator, so we don't need to
4327 * check any more tightly than this.
4328 */
4330 continue;
4331
4332 /*
4333 * XXX at some point we may need to check collations here too.
4334 * For the moment we assume all collations reduce to the same
4335 * notion of equality.
4336 */
4337
4338 matched = true; /* column is unique */
4339 break;
4340 }
4341
4342 if (!matched)
4343 break; /* no match; this index doesn't help us */
4344 }
4345
4346 /* Matched all key columns of this index? */
4348 {
4349 if (extra_clauses)
4350 *extra_clauses = exprs;
4351 return true;
4352 }
4353 }
4354
4355 return false;
4356}
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:124
Definition: memnodes.h:118
Definition: preproc-array_of_struct.c:43
References Assert(), RelOptInfo::baserestrictinfo, bms_is_empty, bms_membership(), BMS_SINGLETON, RestrictInfo::clause, forboth, get_leftop(), get_rightop(), RelOptInfo::indexlist, lappend(), lfirst, lfirst_oid, list_length(), list_member_oid(), match_index_to_operand(), MemoryContextSwitchTo(), NIL, op_in_opfamily(), and root.
Referenced by rel_is_distinct_for(), and relation_has_unique_index_for().
◆ relation_has_unique_index_for()
| bool relation_has_unique_index_for | ( | PlannerInfo * | root, |
| RelOptInfo * | rel, | ||
| List * | restrictlist, | ||
| List * | exprlist, | ||
| List * | oprlist | ||
| ) |
Definition at line 4162 of file indxpath.c.
4165{
4167 exprlist, oprlist, NULL);
4168}
bool relation_has_unique_index_ext(PlannerInfo *root, RelOptInfo *rel, List *restrictlist, List *exprlist, List *oprlist, List **extra_clauses)
Definition: indxpath.c:4177
References relation_has_unique_index_ext(), and root.
Referenced by create_unique_path().
