| 1 |
/*------------------------------------------------------------------------- |
| 2 |
* |
| 3 |
* indxpath.c |
| 4 |
* Routines to determine which indexes are usable for scanning a |
| 5 |
* given relation, and create Paths accordingly. |
| 6 |
* |
| 7 |
* Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group |
| 8 |
* Portions Copyright (c) 1994, Regents of the University of California |
| 9 |
* |
| 10 |
* |
| 11 |
* IDENTIFICATION |
| 12 |
* src/backend/optimizer/path/indxpath.c |
| 13 |
* |
| 14 |
*------------------------------------------------------------------------- |
| 15 |
*/ |
| 16 |
#include "postgres.h" |
| 17 |
|
| 18 |
#include <math.h> |
| 19 |
|
| 20 |
#include "access/stratnum.h" |
| 21 |
#include "access/sysattr.h" |
| 22 |
#include "catalog/pg_am.h" |
| 23 |
#include "catalog/pg_amop.h" |
| 24 |
#include "catalog/pg_operator.h" |
| 25 |
#include "catalog/pg_opfamily.h" |
| 26 |
#include "catalog/pg_type.h" |
| 27 |
#include "nodes/makefuncs.h" |
| 28 |
#include "nodes/nodeFuncs.h" |
| 29 |
#include "nodes/supportnodes.h" |
| 30 |
#include "optimizer/cost.h" |
| 31 |
#include "optimizer/optimizer.h" |
| 32 |
#include "optimizer/pathnode.h" |
| 33 |
#include "optimizer/paths.h" |
| 34 |
#include "optimizer/placeholder.h" |
| 35 |
#include "optimizer/prep.h" |
| 36 |
#include "optimizer/restrictinfo.h" |
| 37 |
#include "utils/lsyscache.h" |
| 38 |
#include "utils/selfuncs.h" |
| 39 |
|
| 40 |
|
| 41 |
/* XXX see PartCollMatchesExprColl */ |
| 42 |
#define IndexCollMatchesExprColl(idxcollation, exprcollation) \ |
| 43 |
((idxcollation) == InvalidOid || (idxcollation) == (exprcollation)) |
| 44 |
|
| 45 |
/* Whether we are looking for plain indexscan, bitmap scan, or either */ |
| 46 |
typedef enum |
| 47 |
{ |
| 48 |
ST_INDEXSCAN, /* must support amgettuple */ |
| 49 |
ST_BITMAPSCAN, /* must support amgetbitmap */ |
| 50 |
ST_ANYSCAN, /* either is okay */ |
| 51 |
} ScanTypeControl; |
| 52 |
|
| 53 |
/* Data structure for collecting qual clauses that match an index */ |
| 54 |
typedef struct |
| 55 |
{ |
| 56 |
bool nonempty; /* True if lists are not all empty */ |
| 57 |
/* Lists of IndexClause nodes, one list per index column */ |
| 58 |
List *indexclauses[INDEX_MAX_KEYS]; |
| 59 |
} IndexClauseSet; |
| 60 |
|
| 61 |
/* Per-path data used within choose_bitmap_and() */ |
| 62 |
typedef struct |
| 63 |
{ |
| 64 |
Path *path; /* IndexPath, BitmapAndPath, or BitmapOrPath */ |
| 65 |
List *quals; /* the WHERE clauses it uses */ |
| 66 |
List *preds; /* predicates of its partial index(es) */ |
| 67 |
Bitmapset *clauseids; /* quals+preds represented as a bitmapset */ |
| 68 |
bool unclassifiable; /* has too many quals+preds to process? */ |
| 69 |
} PathClauseUsage; |
| 70 |
|
| 71 |
/* Callback argument for ec_member_matches_indexcol */ |
| 72 |
typedef struct |
| 73 |
{ |
| 74 |
IndexOptInfo *index; /* index we're considering */ |
| 75 |
int indexcol; /* index column we want to match to */ |
| 76 |
} ec_member_matches_arg; |
| 77 |
|
| 78 |
|
| 79 |
static void consider_index_join_clauses(PlannerInfo *root, RelOptInfo *rel, |
| 80 |
IndexOptInfo *index, |
| 81 |
IndexClauseSet *rclauseset, |
| 82 |
IndexClauseSet *jclauseset, |
| 83 |
IndexClauseSet *eclauseset, |
| 84 |
List **bitindexpaths); |
| 85 |
static void consider_index_join_outer_rels(PlannerInfo *root, RelOptInfo *rel, |
| 86 |
IndexOptInfo *index, |
| 87 |
IndexClauseSet *rclauseset, |
| 88 |
IndexClauseSet *jclauseset, |
| 89 |
IndexClauseSet *eclauseset, |
| 90 |
List **bitindexpaths, |
| 91 |
List *indexjoinclauses, |
| 92 |
int considered_clauses, |
| 93 |
List **considered_relids); |
| 94 |
static void get_join_index_paths(PlannerInfo *root, RelOptInfo *rel, |
| 95 |
IndexOptInfo *index, |
| 96 |
IndexClauseSet *rclauseset, |
| 97 |
IndexClauseSet *jclauseset, |
| 98 |
IndexClauseSet *eclauseset, |
| 99 |
List **bitindexpaths, |
| 100 |
Relids relids, |
| 101 |
List **considered_relids); |
| 102 |
static bool eclass_already_used(EquivalenceClass *parent_ec, Relids oldrelids, |
| 103 |
List *indexjoinclauses); |
| 104 |
static void get_index_paths(PlannerInfo *root, RelOptInfo *rel, |
| 105 |
IndexOptInfo *index, IndexClauseSet *clauses, |
| 106 |
List **bitindexpaths); |
| 107 |
static List *build_index_paths(PlannerInfo *root, RelOptInfo *rel, |
| 108 |
IndexOptInfo *index, IndexClauseSet *clauses, |
| 109 |
bool useful_predicate, |
| 110 |
ScanTypeControl scantype, |
| 111 |
bool *skip_nonnative_saop); |
| 112 |
static List *build_paths_for_OR(PlannerInfo *root, RelOptInfo *rel, |
| 113 |
List *clauses, List *other_clauses); |
| 114 |
static List *generate_bitmap_or_paths(PlannerInfo *root, RelOptInfo *rel, |
| 115 |
List *clauses, List *other_clauses); |
| 116 |
static Path *choose_bitmap_and(PlannerInfo *root, RelOptInfo *rel, |
| 117 |
List *paths); |
| 118 |
static int path_usage_comparator(const void *a, const void *b); |
| 119 |
static Cost bitmap_scan_cost_est(PlannerInfo *root, RelOptInfo *rel, |
| 120 |
Path *ipath); |
| 121 |
static Cost bitmap_and_cost_est(PlannerInfo *root, RelOptInfo *rel, |
| 122 |
List *paths); |
| 123 |
static PathClauseUsage *classify_index_clause_usage(Path *path, |
| 124 |
List **clauselist); |
| 125 |
static void find_indexpath_quals(Path *bitmapqual, List **quals, List **preds); |
| 126 |
static int find_list_position(Node *node, List **nodelist); |
| 127 |
static bool check_index_only(RelOptInfo *rel, IndexOptInfo *index); |
| 128 |
static double get_loop_count(PlannerInfo *root, Index cur_relid, Relids outer_relids); |
| 129 |
static double adjust_rowcount_for_semijoins(PlannerInfo *root, |
| 130 |
Index cur_relid, |
| 131 |
Index outer_relid, |
| 132 |
double rowcount); |
| 133 |
static double approximate_joinrel_size(PlannerInfo *root, Relids relids); |
| 134 |
static void match_restriction_clauses_to_index(PlannerInfo *root, |
| 135 |
IndexOptInfo *index, |
| 136 |
IndexClauseSet *clauseset); |
| 137 |
static void match_join_clauses_to_index(PlannerInfo *root, |
| 138 |
RelOptInfo *rel, IndexOptInfo *index, |
| 139 |
IndexClauseSet *clauseset, |
| 140 |
List **joinorclauses); |
| 141 |
static void match_eclass_clauses_to_index(PlannerInfo *root, |
| 142 |
IndexOptInfo *index, |
| 143 |
IndexClauseSet *clauseset); |
| 144 |
static void match_clauses_to_index(PlannerInfo *root, |
| 145 |
List *clauses, |
| 146 |
IndexOptInfo *index, |
| 147 |
IndexClauseSet *clauseset); |
| 148 |
static void match_clause_to_index(PlannerInfo *root, |
| 149 |
RestrictInfo *rinfo, |
| 150 |
IndexOptInfo *index, |
| 151 |
IndexClauseSet *clauseset); |
| 152 |
static IndexClause *match_clause_to_indexcol(PlannerInfo *root, |
| 153 |
RestrictInfo *rinfo, |
| 154 |
int indexcol, |
| 155 |
IndexOptInfo *index); |
| 156 |
static bool IsBooleanOpfamily(Oid opfamily); |
| 157 |
static IndexClause *match_boolean_index_clause(PlannerInfo *root, |
| 158 |
RestrictInfo *rinfo, |
| 159 |
int indexcol, IndexOptInfo *index); |
| 160 |
static IndexClause *match_opclause_to_indexcol(PlannerInfo *root, |
| 161 |
RestrictInfo *rinfo, |
| 162 |
int indexcol, |
| 163 |
IndexOptInfo *index); |
| 164 |
static IndexClause *match_funcclause_to_indexcol(PlannerInfo *root, |
| 165 |
RestrictInfo *rinfo, |
| 166 |
int indexcol, |
| 167 |
IndexOptInfo *index); |
| 168 |
static IndexClause *get_index_clause_from_support(PlannerInfo *root, |
| 169 |
RestrictInfo *rinfo, |
| 170 |
Oid funcid, |
| 171 |
int indexarg, |
| 172 |
int indexcol, |
| 173 |
IndexOptInfo *index); |
| 174 |
static IndexClause *match_saopclause_to_indexcol(PlannerInfo *root, |
| 175 |
RestrictInfo *rinfo, |
| 176 |
int indexcol, |
| 177 |
IndexOptInfo *index); |
| 178 |
static IndexClause *match_rowcompare_to_indexcol(PlannerInfo *root, |
| 179 |
RestrictInfo *rinfo, |
| 180 |
int indexcol, |
| 181 |
IndexOptInfo *index); |
| 182 |
static IndexClause *match_orclause_to_indexcol(PlannerInfo *root, |
| 183 |
RestrictInfo *rinfo, |
| 184 |
int indexcol, |
| 185 |
IndexOptInfo *index); |
| 186 |
static IndexClause *expand_indexqual_rowcompare(PlannerInfo *root, |
| 187 |
RestrictInfo *rinfo, |
| 188 |
int indexcol, |
| 189 |
IndexOptInfo *index, |
| 190 |
Oid expr_op, |
| 191 |
bool var_on_left); |
| 192 |
static void match_pathkeys_to_index(IndexOptInfo *index, List *pathkeys, |
| 193 |
List **orderby_clauses_p, |
| 194 |
List **clause_columns_p); |
| 195 |
static Expr *match_clause_to_ordering_op(IndexOptInfo *index, |
| 196 |
int indexcol, Expr *clause, Oid pk_opfamily); |
| 197 |
static bool ec_member_matches_indexcol(PlannerInfo *root, RelOptInfo *rel, |
| 198 |
EquivalenceClass *ec, EquivalenceMember *em, |
| 199 |
void *arg); |
| 200 |
|
| 201 |
|
| 202 |
/* |
| 203 |
* create_index_paths() |
| 204 |
* Generate all interesting index paths for the given relation. |
| 205 |
* Candidate paths are added to the rel's pathlist (using add_path). |
| 206 |
* |
| 207 |
* To be considered for an index scan, an index must match one or more |
| 208 |
* restriction clauses or join clauses from the query's qual condition, |
| 209 |
* or match the query's ORDER BY condition, or have a predicate that |
| 210 |
* matches the query's qual condition. |
| 211 |
* |
| 212 |
* There are two basic kinds of index scans. A "plain" index scan uses |
| 213 |
* only restriction clauses (possibly none at all) in its indexqual, |
| 214 |
* so it can be applied in any context. A "parameterized" index scan uses |
| 215 |
* join clauses (plus restriction clauses, if available) in its indexqual. |
| 216 |
* When joining such a scan to one of the relations supplying the other |
| 217 |
* variables used in its indexqual, the parameterized scan must appear as |
| 218 |
* the inner relation of a nestloop join; it can't be used on the outer side, |
| 219 |
* nor in a merge or hash join. In that context, values for the other rels' |
| 220 |
* attributes are available and fixed during any one scan of the indexpath. |
| 221 |
* |
| 222 |
* An IndexPath is generated and submitted to add_path() for each plain or |
| 223 |
* parameterized index scan this routine deems potentially interesting for |
| 224 |
* the current query. |
| 225 |
* |
| 226 |
* 'rel' is the relation for which we want to generate index paths |
| 227 |
* |
| 228 |
* Note: check_index_predicates() must have been run previously for this rel. |
| 229 |
* |
| 230 |
* Note: in cases involving LATERAL references in the relation's tlist, it's |
| 231 |
* possible that rel->lateral_relids is nonempty. Currently, we include |
| 232 |
* lateral_relids into the parameterization reported for each path, but don't |
| 233 |
* take it into account otherwise. The fact that any such rels *must* be |
| 234 |
* available as parameter sources perhaps should influence our choices of |
| 235 |
* index quals ... but for now, it doesn't seem worth troubling over. |
| 236 |
* In particular, comments below about "unparameterized" paths should be read |
| 237 |
* as meaning "unparameterized so far as the indexquals are concerned". |
| 238 |
*/ |
| 239 |
void |
| 240 |
create_index_paths(PlannerInfo *root, RelOptInfo *rel) |
| 241 |
{ |
| 242 |
List *indexpaths; |
| 243 |
List *bitindexpaths; |
| 244 |
List *bitjoinpaths; |
| 245 |
List *joinorclauses; |
| 246 |
IndexClauseSet rclauseset; |
| 247 |
IndexClauseSet jclauseset; |
| 248 |
IndexClauseSet eclauseset; |
| 249 |
ListCell *lc; |
| 250 |
|
| 251 |
/* Skip the whole mess if no indexes */ |
| 252 |
if (rel->indexlist == NIL) |
| 253 |
return; |
| 254 |
|
| 255 |
/* Bitmap paths are collected and then dealt with at the end */ |
| 256 |
bitindexpaths = bitjoinpaths = joinorclauses = NIL; |
| 257 |
|
| 258 |
/* Examine each index in turn */ |
| 259 |
foreach(lc, rel->indexlist) |
| 260 |
{ |
| 261 |
IndexOptInfo *index = (IndexOptInfo *) lfirst(lc); |
| 262 |
|
| 263 |
/* Protect limited-size array in IndexClauseSets */ |
| 264 |
Assert(index->nkeycolumns <= INDEX_MAX_KEYS); |
| 265 |
|
| 266 |
/* |
| 267 |
* Ignore partial indexes that do not match the query. |
| 268 |
* (generate_bitmap_or_paths() might be able to do something with |
| 269 |
* them, but that's of no concern here.) |
| 270 |
*/ |
| 271 |
if (index->indpred != NIL && !index->predOK) |
| 272 |
continue; |
| 273 |
|
| 274 |
/* |
| 275 |
* Identify the restriction clauses that can match the index. |
| 276 |
*/ |
| 277 |
MemSet(&rclauseset, 0, sizeof(rclauseset)); |
| 278 |
match_restriction_clauses_to_index(root, index, &rclauseset); |
| 279 |
|
| 280 |
/* |
| 281 |
* Build index paths from the restriction clauses. These will be |
| 282 |
* non-parameterized paths. Plain paths go directly to add_path(), |
| 283 |
* bitmap paths are added to bitindexpaths to be handled below. |
| 284 |
*/ |
| 285 |
get_index_paths(root, rel, index, &rclauseset, |
| 286 |
&bitindexpaths); |
| 287 |
|
| 288 |
/* |
| 289 |
* Identify the join clauses that can match the index. For the moment |
| 290 |
* we keep them separate from the restriction clauses. Note that this |
| 291 |
* step finds only "loose" join clauses that have not been merged into |
| 292 |
* EquivalenceClasses. Also, collect join OR clauses for later. |
| 293 |
*/ |
| 294 |
MemSet(&jclauseset, 0, sizeof(jclauseset)); |
| 295 |
match_join_clauses_to_index(root, rel, index, |
| 296 |
&jclauseset, &joinorclauses); |
| 297 |
|
| 298 |
/* |
| 299 |
* Look for EquivalenceClasses that can generate joinclauses matching |
| 300 |
* the index. |
| 301 |
*/ |
| 302 |
MemSet(&eclauseset, 0, sizeof(eclauseset)); |
| 303 |
match_eclass_clauses_to_index(root, index, |
| 304 |
&eclauseset); |
| 305 |
|
| 306 |
/* |
| 307 |
* If we found any plain or eclass join clauses, build parameterized |
| 308 |
* index paths using them. |
| 309 |
*/ |
| 310 |
if (jclauseset.nonempty || eclauseset.nonempty) |
| 311 |
consider_index_join_clauses(root, rel, index, |
| 312 |
&rclauseset, |
| 313 |
&jclauseset, |
| 314 |
&eclauseset, |
| 315 |
&bitjoinpaths); |
| 316 |
} |
| 317 |
|
| 318 |
/* |
| 319 |
* Generate BitmapOrPaths for any suitable OR-clauses present in the |
| 320 |
* restriction list. Add these to bitindexpaths. |
| 321 |
*/ |
| 322 |
indexpaths = generate_bitmap_or_paths(root, rel, |
| 323 |
rel->baserestrictinfo, NIL); |
| 324 |
bitindexpaths = list_concat(bitindexpaths, indexpaths); |
| 325 |
|
| 326 |
/* |
| 327 |
* Likewise, generate BitmapOrPaths for any suitable OR-clauses present in |
| 328 |
* the joinclause list. Add these to bitjoinpaths. |
| 329 |
*/ |
| 330 |
indexpaths = generate_bitmap_or_paths(root, rel, |
| 331 |
joinorclauses, rel->baserestrictinfo); |
| 332 |
bitjoinpaths = list_concat(bitjoinpaths, indexpaths); |
| 333 |
|
| 334 |
/* |
| 335 |
* If we found anything usable, generate a BitmapHeapPath for the most |
| 336 |
* promising combination of restriction bitmap index paths. Note there |
| 337 |
* will be only one such path no matter how many indexes exist. This |
| 338 |
* should be sufficient since there's basically only one figure of merit |
| 339 |
* (total cost) for such a path. |
| 340 |
*/ |
| 341 |
if (bitindexpaths != NIL) |
| 342 |
{ |
| 343 |
Path *bitmapqual; |
| 344 |
BitmapHeapPath *bpath; |
| 345 |
|
| 346 |
bitmapqual = choose_bitmap_and(root, rel, bitindexpaths); |
| 347 |
bpath = create_bitmap_heap_path(root, rel, bitmapqual, |
| 348 |
rel->lateral_relids, 1.0, 0); |
| 349 |
add_path(rel, (Path *) bpath); |
| 350 |
|
| 351 |
/* create a partial bitmap heap path */ |
| 352 |
if (rel->consider_parallel && rel->lateral_relids == NULL) |
| 353 |
create_partial_bitmap_paths(root, rel, bitmapqual); |
| 354 |
} |
| 355 |
|
| 356 |
/* |
| 357 |
* Likewise, if we found anything usable, generate BitmapHeapPaths for the |
| 358 |
* most promising combinations of join bitmap index paths. Our strategy |
| 359 |
* is to generate one such path for each distinct parameterization seen |
| 360 |
* among the available bitmap index paths. This may look pretty |
| 361 |
* expensive, but usually there won't be very many distinct |
| 362 |
* parameterizations. (This logic is quite similar to that in |
| 363 |
* consider_index_join_clauses, but we're working with whole paths not |
| 364 |
* individual clauses.) |
| 365 |
*/ |
| 366 |
if (bitjoinpaths != NIL) |
| 367 |
{ |
| 368 |
List *all_path_outers; |
| 369 |
|
| 370 |
/* Identify each distinct parameterization seen in bitjoinpaths */ |
| 371 |
all_path_outers = NIL; |
| 372 |
foreach(lc, bitjoinpaths) |
| 373 |
{ |
| 374 |
Path *path = (Path *) lfirst(lc); |
| 375 |
Relids required_outer = PATH_REQ_OUTER(path); |
| 376 |
|
| 377 |
all_path_outers = list_append_unique(all_path_outers, |
| 378 |
required_outer); |
| 379 |
} |
| 380 |
|
| 381 |
/* Now, for each distinct parameterization set ... */ |
| 382 |
foreach(lc, all_path_outers) |
| 383 |
{ |
| 384 |
Relids max_outers = (Relids) lfirst(lc); |
| 385 |
List *this_path_set; |
| 386 |
Path *bitmapqual; |
| 387 |
Relids required_outer; |
| 388 |
double loop_count; |
| 389 |
BitmapHeapPath *bpath; |
| 390 |
ListCell *lcp; |
| 391 |
|
| 392 |
/* Identify all the bitmap join paths needing no more than that */ |
| 393 |
this_path_set = NIL; |
| 394 |
foreach(lcp, bitjoinpaths) |
| 395 |
{ |
| 396 |
Path *path = (Path *) lfirst(lcp); |
| 397 |
|
| 398 |
if (bms_is_subset(PATH_REQ_OUTER(path), max_outers)) |
| 399 |
this_path_set = lappend(this_path_set, path); |
| 400 |
} |
| 401 |
|
| 402 |
/* |
| 403 |
* Add in restriction bitmap paths, since they can be used |
| 404 |
* together with any join paths. |
| 405 |
*/ |
| 406 |
this_path_set = list_concat(this_path_set, bitindexpaths); |
| 407 |
|
| 408 |
/* Select best AND combination for this parameterization */ |
| 409 |
bitmapqual = choose_bitmap_and(root, rel, this_path_set); |
| 410 |
|
| 411 |
/* And push that path into the mix */ |
| 412 |
required_outer = PATH_REQ_OUTER(bitmapqual); |
| 413 |
loop_count = get_loop_count(root, rel->relid, required_outer); |
| 414 |
bpath = create_bitmap_heap_path(root, rel, bitmapqual, |
| 415 |
required_outer, loop_count, 0); |
| 416 |
add_path(rel, (Path *) bpath); |
| 417 |
} |
| 418 |
} |
| 419 |
} |
| 420 |
|
| 421 |
/* |
| 422 |
* consider_index_join_clauses |
| 423 |
* Given sets of join clauses for an index, decide which parameterized |
| 424 |
* index paths to build. |
| 425 |
* |
| 426 |
* Plain indexpaths are sent directly to add_path, while potential |
| 427 |
* bitmap indexpaths are added to *bitindexpaths for later processing. |
| 428 |
* |
| 429 |
* 'rel' is the index's heap relation |
| 430 |
* 'index' is the index for which we want to generate paths |
| 431 |
* 'rclauseset' is the collection of indexable restriction clauses |
| 432 |
* 'jclauseset' is the collection of indexable simple join clauses |
| 433 |
* 'eclauseset' is the collection of indexable clauses from EquivalenceClasses |
| 434 |
* '*bitindexpaths' is the list to add bitmap paths to |
| 435 |
*/ |
| 436 |
static void |
| 437 |
consider_index_join_clauses(PlannerInfo *root, RelOptInfo *rel, |
| 438 |
IndexOptInfo *index, |
| 439 |
IndexClauseSet *rclauseset, |
| 440 |
IndexClauseSet *jclauseset, |
| 441 |
IndexClauseSet *eclauseset, |
| 442 |
List **bitindexpaths) |
| 443 |
{ |
| 444 |
int considered_clauses = 0; |
| 445 |
List *considered_relids = NIL; |
| 446 |
int indexcol; |
| 447 |
|
| 448 |
/* |
| 449 |
* The strategy here is to identify every potentially useful set of outer |
| 450 |
* rels that can provide indexable join clauses. For each such set, |
| 451 |
* select all the join clauses available from those outer rels, add on all |
| 452 |
* the indexable restriction clauses, and generate plain and/or bitmap |
| 453 |
* index paths for that set of clauses. This is based on the assumption |
| 454 |
* that it's always better to apply a clause as an indexqual than as a |
| 455 |
* filter (qpqual); which is where an available clause would end up being |
| 456 |
* applied if we omit it from the indexquals. |
| 457 |
* |
| 458 |
* This looks expensive, but in most practical cases there won't be very |
| 459 |
* many distinct sets of outer rels to consider. As a safety valve when |
| 460 |
* that's not true, we use a heuristic: limit the number of outer rel sets |
| 461 |
* considered to a multiple of the number of clauses considered. (We'll |
| 462 |
* always consider using each individual join clause, though.) |
| 463 |
* |
| 464 |
* For simplicity in selecting relevant clauses, we represent each set of |
| 465 |
* outer rels as a maximum set of clause_relids --- that is, the indexed |
| 466 |
* relation itself is also included in the relids set. considered_relids |
| 467 |
* lists all relids sets we've already tried. |
| 468 |
*/ |
| 469 |
for (indexcol = 0; indexcol < index->nkeycolumns; indexcol++) |
| 470 |
{ |
| 471 |
/* Consider each applicable simple join clause */ |
| 472 |
considered_clauses += list_length(jclauseset->indexclauses[indexcol]); |
| 473 |
consider_index_join_outer_rels(root, rel, index, |
| 474 |
rclauseset, jclauseset, eclauseset, |
| 475 |
bitindexpaths, |
| 476 |
jclauseset->indexclauses[indexcol], |
| 477 |
considered_clauses, |
| 478 |
&considered_relids); |
| 479 |
/* Consider each applicable eclass join clause */ |
| 480 |
considered_clauses += list_length(eclauseset->indexclauses[indexcol]); |
| 481 |
consider_index_join_outer_rels(root, rel, index, |
| 482 |
rclauseset, jclauseset, eclauseset, |
| 483 |
bitindexpaths, |
| 484 |
eclauseset->indexclauses[indexcol], |
| 485 |
considered_clauses, |
| 486 |
&considered_relids); |
| 487 |
} |
| 488 |
} |
| 489 |
|
| 490 |
/* |
| 491 |
* consider_index_join_outer_rels |
| 492 |
* Generate parameterized paths based on clause relids in the clause list. |
| 493 |
* |
| 494 |
* Workhorse for consider_index_join_clauses; see notes therein for rationale. |
| 495 |
* |
| 496 |
* 'rel', 'index', 'rclauseset', 'jclauseset', 'eclauseset', and |
| 497 |
* 'bitindexpaths' as above |
| 498 |
* 'indexjoinclauses' is a list of IndexClauses for join clauses |
| 499 |
* 'considered_clauses' is the total number of clauses considered (so far) |
| 500 |
* '*considered_relids' is a list of all relids sets already considered |
| 501 |
*/ |
| 502 |
static void |
| 503 |
consider_index_join_outer_rels(PlannerInfo *root, RelOptInfo *rel, |
| 504 |
IndexOptInfo *index, |
| 505 |
IndexClauseSet *rclauseset, |
| 506 |
IndexClauseSet *jclauseset, |
| 507 |
IndexClauseSet *eclauseset, |
| 508 |
List **bitindexpaths, |
| 509 |
List *indexjoinclauses, |
| 510 |
int considered_clauses, |
| 511 |
List **considered_relids) |
| 512 |
{ |
| 513 |
ListCell *lc; |
| 514 |
|
| 515 |
/* Examine relids of each joinclause in the given list */ |
| 516 |
foreach(lc, indexjoinclauses) |
| 517 |
{ |
| 518 |
IndexClause *iclause = (IndexClause *) lfirst(lc); |
| 519 |
Relids clause_relids = iclause->rinfo->clause_relids; |
| 520 |
EquivalenceClass *parent_ec = iclause->rinfo->parent_ec; |
| 521 |
int num_considered_relids; |
| 522 |
|
| 523 |
/* If we already tried its relids set, no need to do so again */ |
| 524 |
if (list_member(*considered_relids, clause_relids)) |
| 525 |
continue; |
| 526 |
|
| 527 |
/* |
| 528 |
* Generate the union of this clause's relids set with each |
| 529 |
* previously-tried set. This ensures we try this clause along with |
| 530 |
* every interesting subset of previous clauses. However, to avoid |
| 531 |
* exponential growth of planning time when there are many clauses, |
| 532 |
* limit the number of relid sets accepted to 10 * considered_clauses. |
| 533 |
* |
| 534 |
* Note: get_join_index_paths appends entries to *considered_relids, |
| 535 |
* but we do not need to visit such newly-added entries within this |
| 536 |
* loop, so we don't use foreach() here. No real harm would be done |
| 537 |
* if we did visit them, since the subset check would reject them; but |
| 538 |
* it would waste some cycles. |
| 539 |
*/ |
| 540 |
num_considered_relids = list_length(*considered_relids); |
| 541 |
for (int pos = 0; pos < num_considered_relids; pos++) |
| 542 |
{ |
| 543 |
Relids oldrelids = (Relids) list_nth(*considered_relids, pos); |
| 544 |
|
| 545 |
/* |
| 546 |
* If either is a subset of the other, no new set is possible. |
| 547 |
* This isn't a complete test for redundancy, but it's easy and |
| 548 |
* cheap. get_join_index_paths will check more carefully if we |
| 549 |
* already generated the same relids set. |
| 550 |
*/ |
| 551 |
if (bms_subset_compare(clause_relids, oldrelids) != BMS_DIFFERENT) |
| 552 |
continue; |
| 553 |
|
| 554 |
/* |
| 555 |
* If this clause was derived from an equivalence class, the |
| 556 |
* clause list may contain other clauses derived from the same |
| 557 |
* eclass. We should not consider that combining this clause with |
| 558 |
* one of those clauses generates a usefully different |
| 559 |
* parameterization; so skip if any clause derived from the same |
| 560 |
* eclass would already have been included when using oldrelids. |
| 561 |
*/ |
| 562 |
if (parent_ec && |
| 563 |
eclass_already_used(parent_ec, oldrelids, |
| 564 |
indexjoinclauses)) |
| 565 |
continue; |
| 566 |
|
| 567 |
/* |
| 568 |
* If the number of relid sets considered exceeds our heuristic |
| 569 |
* limit, stop considering combinations of clauses. We'll still |
| 570 |
* consider the current clause alone, though (below this loop). |
| 571 |
*/ |
| 572 |
if (list_length(*considered_relids) >= 10 * considered_clauses) |
| 573 |
break; |
| 574 |
|
| 575 |
/* OK, try the union set */ |
| 576 |
get_join_index_paths(root, rel, index, |
| 577 |
rclauseset, jclauseset, eclauseset, |
| 578 |
bitindexpaths, |
| 579 |
bms_union(clause_relids, oldrelids), |
| 580 |
considered_relids); |
| 581 |
} |
| 582 |
|
| 583 |
/* Also try this set of relids by itself */ |
| 584 |
get_join_index_paths(root, rel, index, |
| 585 |
rclauseset, jclauseset, eclauseset, |
| 586 |
bitindexpaths, |
| 587 |
clause_relids, |
| 588 |
considered_relids); |
| 589 |
} |
| 590 |
} |
| 591 |
|
| 592 |
/* |
| 593 |
* get_join_index_paths |
| 594 |
* Generate index paths using clauses from the specified outer relations. |
| 595 |
* In addition to generating paths, relids is added to *considered_relids |
| 596 |
* if not already present. |
| 597 |
* |
| 598 |
* Workhorse for consider_index_join_clauses; see notes therein for rationale. |
| 599 |
* |
| 600 |
* 'rel', 'index', 'rclauseset', 'jclauseset', 'eclauseset', |
| 601 |
* 'bitindexpaths', 'considered_relids' as above |
| 602 |
* 'relids' is the current set of relids to consider (the target rel plus |
| 603 |
* one or more outer rels) |
| 604 |
*/ |
| 605 |
static void |
| 606 |
get_join_index_paths(PlannerInfo *root, RelOptInfo *rel, |
| 607 |
IndexOptInfo *index, |
| 608 |
IndexClauseSet *rclauseset, |
| 609 |
IndexClauseSet *jclauseset, |
| 610 |
IndexClauseSet *eclauseset, |
| 611 |
List **bitindexpaths, |
| 612 |
Relids relids, |
| 613 |
List **considered_relids) |
| 614 |
{ |
| 615 |
IndexClauseSet clauseset; |
| 616 |
int indexcol; |
| 617 |
|
| 618 |
/* If we already considered this relids set, don't repeat the work */ |
| 619 |
if (list_member(*considered_relids, relids)) |
| 620 |
return; |
| 621 |
|
| 622 |
/* Identify indexclauses usable with this relids set */ |
| 623 |
MemSet(&clauseset, 0, sizeof(clauseset)); |
| 624 |
|
| 625 |
for (indexcol = 0; indexcol < index->nkeycolumns; indexcol++) |
| 626 |
{ |
| 627 |
ListCell *lc; |
| 628 |
|
| 629 |
/* First find applicable simple join clauses */ |
| 630 |
foreach(lc, jclauseset->indexclauses[indexcol]) |
| 631 |
{ |
| 632 |
IndexClause *iclause = (IndexClause *) lfirst(lc); |
| 633 |
|
| 634 |
if (bms_is_subset(iclause->rinfo->clause_relids, relids)) |
| 635 |
clauseset.indexclauses[indexcol] = |
| 636 |
lappend(clauseset.indexclauses[indexcol], iclause); |
| 637 |
} |
| 638 |
|
| 639 |
/* |
| 640 |
* Add applicable eclass join clauses. The clauses generated for each |
| 641 |
* column are redundant (cf generate_implied_equalities_for_column), |
| 642 |
* so we need at most one. This is the only exception to the general |
| 643 |
* rule of using all available index clauses. |
| 644 |
*/ |
| 645 |
foreach(lc, eclauseset->indexclauses[indexcol]) |
| 646 |
{ |
| 647 |
IndexClause *iclause = (IndexClause *) lfirst(lc); |
| 648 |
|
| 649 |
if (bms_is_subset(iclause->rinfo->clause_relids, relids)) |
| 650 |
{ |
| 651 |
clauseset.indexclauses[indexcol] = |
| 652 |
lappend(clauseset.indexclauses[indexcol], iclause); |
| 653 |
break; |
| 654 |
} |
| 655 |
} |
| 656 |
|
| 657 |
/* Add restriction clauses */ |
| 658 |
clauseset.indexclauses[indexcol] = |
| 659 |
list_concat(clauseset.indexclauses[indexcol], |
| 660 |
rclauseset->indexclauses[indexcol]); |
| 661 |
|
| 662 |
if (clauseset.indexclauses[indexcol] != NIL) |
| 663 |
clauseset.nonempty = true; |
| 664 |
} |
| 665 |
|
| 666 |
/* We should have found something, else caller passed silly relids */ |
| 667 |
Assert(clauseset.nonempty); |
| 668 |
|
| 669 |
/* Build index path(s) using the collected set of clauses */ |
| 670 |
get_index_paths(root, rel, index, &clauseset, bitindexpaths); |
| 671 |
|
| 672 |
/* |
| 673 |
* Remember we considered paths for this set of relids. |
| 674 |
*/ |
| 675 |
*considered_relids = lappend(*considered_relids, relids); |
| 676 |
} |
| 677 |
|
| 678 |
/* |
| 679 |
* eclass_already_used |
| 680 |
* True if any join clause usable with oldrelids was generated from |
| 681 |
* the specified equivalence class. |
| 682 |
*/ |
| 683 |
static bool |
| 684 |
eclass_already_used(EquivalenceClass *parent_ec, Relids oldrelids, |
| 685 |
List *indexjoinclauses) |
| 686 |
{ |
| 687 |
ListCell *lc; |
| 688 |
|
| 689 |
foreach(lc, indexjoinclauses) |
| 690 |
{ |
| 691 |
IndexClause *iclause = (IndexClause *) lfirst(lc); |
| 692 |
RestrictInfo *rinfo = iclause->rinfo; |
| 693 |
|
| 694 |
if (rinfo->parent_ec == parent_ec && |
| 695 |
bms_is_subset(rinfo->clause_relids, oldrelids)) |
| 696 |
return true; |
| 697 |
} |
| 698 |
return false; |
| 699 |
} |
| 700 |
|
| 701 |
|
| 702 |
/* |
| 703 |
* get_index_paths |
| 704 |
* Given an index and a set of index clauses for it, construct IndexPaths. |
| 705 |
* |
| 706 |
* Plain indexpaths are sent directly to add_path, while potential |
| 707 |
* bitmap indexpaths are added to *bitindexpaths for later processing. |
| 708 |
* |
| 709 |
* This is a fairly simple frontend to build_index_paths(). Its reason for |
| 710 |
* existence is mainly to handle ScalarArrayOpExpr quals properly. If the |
| 711 |
* index AM supports them natively, we should just include them in simple |
| 712 |
* index paths. If not, we should exclude them while building simple index |
| 713 |
* paths, and then make a separate attempt to include them in bitmap paths. |
| 714 |
*/ |
| 715 |
static void |
| 716 |
get_index_paths(PlannerInfo *root, RelOptInfo *rel, |
| 717 |
IndexOptInfo *index, IndexClauseSet *clauses, |
| 718 |
List **bitindexpaths) |
| 719 |
{ |
| 720 |
List *indexpaths; |
| 721 |
bool skip_nonnative_saop = false; |
| 722 |
ListCell *lc; |
| 723 |
|
| 724 |
/* |
| 725 |
* Build simple index paths using the clauses. Allow ScalarArrayOpExpr |
| 726 |
* clauses only if the index AM supports them natively. |
| 727 |
*/ |
| 728 |
indexpaths = build_index_paths(root, rel, |
| 729 |
index, clauses, |
| 730 |
index->predOK, |
| 731 |
ST_ANYSCAN, |
| 732 |
&skip_nonnative_saop); |
| 733 |
|
| 734 |
/* |
| 735 |
* Submit all the ones that can form plain IndexScan plans to add_path. (A |
| 736 |
* plain IndexPath can represent either a plain IndexScan or an |
| 737 |
* IndexOnlyScan, but for our purposes here that distinction does not |
| 738 |
* matter. However, some of the indexes might support only bitmap scans, |
| 739 |
* and those we mustn't submit to add_path here.) |
| 740 |
* |
| 741 |
* Also, pick out the ones that are usable as bitmap scans. For that, we |
| 742 |
* must discard indexes that don't support bitmap scans, and we also are |
| 743 |
* only interested in paths that have some selectivity; we should discard |
| 744 |
* anything that was generated solely for ordering purposes. |
| 745 |
*/ |
| 746 |
foreach(lc, indexpaths) |
| 747 |
{ |
| 748 |
IndexPath *ipath = (IndexPath *) lfirst(lc); |
| 749 |
|
| 750 |
if (index->amhasgettuple) |
| 751 |
add_path(rel, (Path *) ipath); |
| 752 |
|
| 753 |
if (index->amhasgetbitmap && |
| 754 |
(ipath->path.pathkeys == NIL || |
| 755 |
ipath->indexselectivity < 1.0)) |
| 756 |
*bitindexpaths = lappend(*bitindexpaths, ipath); |
| 757 |
} |
| 758 |
|
| 759 |
/* |
| 760 |
* If there were ScalarArrayOpExpr clauses that the index can't handle |
| 761 |
* natively, generate bitmap scan paths relying on executor-managed |
| 762 |
* ScalarArrayOpExpr. |
| 763 |
*/ |
| 764 |
if (skip_nonnative_saop) |
| 765 |
{ |
| 766 |
indexpaths = build_index_paths(root, rel, |
| 767 |
index, clauses, |
| 768 |
false, |
| 769 |
ST_BITMAPSCAN, |
| 770 |
NULL); |
| 771 |
*bitindexpaths = list_concat(*bitindexpaths, indexpaths); |
| 772 |
} |
| 773 |
} |
| 774 |
|
| 775 |
/* |
| 776 |
* build_index_paths |
| 777 |
* Given an index and a set of index clauses for it, construct zero |
| 778 |
* or more IndexPaths. It also constructs zero or more partial IndexPaths. |
| 779 |
* |
| 780 |
* We return a list of paths because (1) this routine checks some cases |
| 781 |
* that should cause us to not generate any IndexPath, and (2) in some |
| 782 |
* cases we want to consider both a forward and a backward scan, so as |
| 783 |
* to obtain both sort orders. Note that the paths are just returned |
| 784 |
* to the caller and not immediately fed to add_path(). |
| 785 |
* |
| 786 |
* At top level, useful_predicate should be exactly the index's predOK flag |
| 787 |
* (ie, true if it has a predicate that was proven from the restriction |
| 788 |
* clauses). When working on an arm of an OR clause, useful_predicate |
| 789 |
* should be true if the predicate required the current OR list to be proven. |
| 790 |
* Note that this routine should never be called at all if the index has an |
| 791 |
* unprovable predicate. |
| 792 |
* |
| 793 |
* scantype indicates whether we want to create plain indexscans, bitmap |
| 794 |
* indexscans, or both. When it's ST_BITMAPSCAN, we will not consider |
| 795 |
* index ordering while deciding if a Path is worth generating. |
| 796 |
* |
| 797 |
* If skip_nonnative_saop is non-NULL, we ignore ScalarArrayOpExpr clauses |
| 798 |
* unless the index AM supports them directly, and we set *skip_nonnative_saop |
| 799 |
* to true if we found any such clauses (caller must initialize the variable |
| 800 |
* to false). If it's NULL, we do not ignore ScalarArrayOpExpr clauses. |
| 801 |
* |
| 802 |
* 'rel' is the index's heap relation |
| 803 |
* 'index' is the index for which we want to generate paths |
| 804 |
* 'clauses' is the collection of indexable clauses (IndexClause nodes) |
| 805 |
* 'useful_predicate' indicates whether the index has a useful predicate |
| 806 |
* 'scantype' indicates whether we need plain or bitmap scan support |
| 807 |
* 'skip_nonnative_saop' indicates whether to accept SAOP if index AM doesn't |
| 808 |
*/ |
| 809 |
static List * |
| 810 |
build_index_paths(PlannerInfo *root, RelOptInfo *rel, |
| 811 |
IndexOptInfo *index, IndexClauseSet *clauses, |
| 812 |
bool useful_predicate, |
| 813 |
ScanTypeControl scantype, |
| 814 |
bool *skip_nonnative_saop) |
| 815 |
{ |
| 816 |
List *result = NIL; |
| 817 |
IndexPath *ipath; |
| 818 |
List *index_clauses; |
| 819 |
Relids outer_relids; |
| 820 |
double loop_count; |
| 821 |
List *orderbyclauses; |
| 822 |
List *orderbyclausecols; |
| 823 |
List *index_pathkeys; |
| 824 |
List *useful_pathkeys; |
| 825 |
bool pathkeys_possibly_useful; |
| 826 |
bool index_is_ordered; |
| 827 |
bool index_only_scan; |
| 828 |
int indexcol; |
| 829 |
|
| 830 |
Assert(skip_nonnative_saop != NULL || scantype == ST_BITMAPSCAN); |
| 831 |
|
| 832 |
/* |
| 833 |
* Check that index supports the desired scan type(s) |
| 834 |
*/ |
| 835 |
switch (scantype) |
| 836 |
{ |
| 837 |
case ST_INDEXSCAN: |
| 838 |
if (!index->amhasgettuple) |
| 839 |
return NIL; |
| 840 |
break; |
| 841 |
case ST_BITMAPSCAN: |
| 842 |
if (!index->amhasgetbitmap) |
| 843 |
return NIL; |
| 844 |
break; |
| 845 |
case ST_ANYSCAN: |
| 846 |
/* either or both are OK */ |
| 847 |
break; |
| 848 |
} |
| 849 |
|
| 850 |
/* |
| 851 |
* 1. Combine the per-column IndexClause lists into an overall list. |
| 852 |
* |
| 853 |
* In the resulting list, clauses are ordered by index key, so that the |
| 854 |
* column numbers form a nondecreasing sequence. (This order is depended |
| 855 |
* on by btree and possibly other places.) The list can be empty, if the |
| 856 |
* index AM allows that. |
| 857 |
* |
| 858 |
* We also build a Relids set showing which outer rels are required by the |
| 859 |
* selected clauses. Any lateral_relids are included in that, but not |
| 860 |
* otherwise accounted for. |
| 861 |
*/ |
| 862 |
index_clauses = NIL; |
| 863 |
outer_relids = bms_copy(rel->lateral_relids); |
| 864 |
for (indexcol = 0; indexcol < index->nkeycolumns; indexcol++) |
| 865 |
{ |
| 866 |
ListCell *lc; |
| 867 |
|
| 868 |
foreach(lc, clauses->indexclauses[indexcol]) |
| 869 |
{ |
| 870 |
IndexClause *iclause = (IndexClause *) lfirst(lc); |
| 871 |
RestrictInfo *rinfo = iclause->rinfo; |
| 872 |
|
| 873 |
if (skip_nonnative_saop && !index->amsearcharray && |
| 874 |
IsA(rinfo->clause, ScalarArrayOpExpr)) |
| 875 |
{ |
| 876 |
/* |
| 877 |
* Caller asked us to generate IndexPaths that omit any |
| 878 |
* ScalarArrayOpExpr clauses when the underlying index AM |
| 879 |
* lacks native support. |
| 880 |
* |
| 881 |
* We must omit this clause (and tell caller about it). |
| 882 |
*/ |
| 883 |
*skip_nonnative_saop = true; |
| 884 |
continue; |
| 885 |
} |
| 886 |
|
| 887 |
/* OK to include this clause */ |
| 888 |
index_clauses = lappend(index_clauses, iclause); |
| 889 |
outer_relids = bms_add_members(outer_relids, |
| 890 |
rinfo->clause_relids); |
| 891 |
} |
| 892 |
|
| 893 |
/* |
| 894 |
* If no clauses match the first index column, check for amoptionalkey |
| 895 |
* restriction. We can't generate a scan over an index with |
| 896 |
* amoptionalkey = false unless there's at least one index clause. |
| 897 |
* (When working on columns after the first, this test cannot fail. It |
| 898 |
* is always okay for columns after the first to not have any |
| 899 |
* clauses.) |
| 900 |
*/ |
| 901 |
if (index_clauses == NIL && !index->amoptionalkey) |
| 902 |
return NIL; |
| 903 |
} |
| 904 |
|
| 905 |
/* We do not want the index's rel itself listed in outer_relids */ |
| 906 |
outer_relids = bms_del_member(outer_relids, rel->relid); |
| 907 |
|
| 908 |
/* Compute loop_count for cost estimation purposes */ |
| 909 |
loop_count = get_loop_count(root, rel->relid, outer_relids); |
| 910 |
|
| 911 |
/* |
| 912 |
* 2. Compute pathkeys describing index's ordering, if any, then see how |
| 913 |
* many of them are actually useful for this query. This is not relevant |
| 914 |
* if we are only trying to build bitmap indexscans. |
| 915 |
*/ |
| 916 |
pathkeys_possibly_useful = (scantype != ST_BITMAPSCAN && |
| 917 |
has_useful_pathkeys(root, rel)); |
| 918 |
index_is_ordered = (index->sortopfamily != NULL); |
| 919 |
if (index_is_ordered && pathkeys_possibly_useful) |
| 920 |
{ |
| 921 |
index_pathkeys = build_index_pathkeys(root, index, |
| 922 |
ForwardScanDirection); |
| 923 |
useful_pathkeys = truncate_useless_pathkeys(root, rel, |
| 924 |
index_pathkeys); |
| 925 |
orderbyclauses = NIL; |
| 926 |
orderbyclausecols = NIL; |
| 927 |
} |
| 928 |
else if (index->amcanorderbyop && pathkeys_possibly_useful) |
| 929 |
{ |
| 930 |
/* |
| 931 |
* See if we can generate ordering operators for query_pathkeys or at |
| 932 |
* least some prefix thereof. Matching to just a prefix of the |
| 933 |
* query_pathkeys will allow an incremental sort to be considered on |
| 934 |
* the index's partially sorted results. |
| 935 |
*/ |
| 936 |
match_pathkeys_to_index(index, root->query_pathkeys, |
| 937 |
&orderbyclauses, |
| 938 |
&orderbyclausecols); |
| 939 |
if (list_length(root->query_pathkeys) == list_length(orderbyclauses)) |
| 940 |
useful_pathkeys = root->query_pathkeys; |
| 941 |
else |
| 942 |
useful_pathkeys = list_copy_head(root->query_pathkeys, |
| 943 |
list_length(orderbyclauses)); |
| 944 |
} |
| 945 |
else |
| 946 |
{ |
| 947 |
useful_pathkeys = NIL; |
| 948 |
orderbyclauses = NIL; |
| 949 |
orderbyclausecols = NIL; |
| 950 |
} |
| 951 |
|
| 952 |
/* |
| 953 |
* 3. Check if an index-only scan is possible. If we're not building |
| 954 |
* plain indexscans, this isn't relevant since bitmap scans don't support |
| 955 |
* index data retrieval anyway. |
| 956 |
*/ |
| 957 |
index_only_scan = (scantype != ST_BITMAPSCAN && |
| 958 |
check_index_only(rel, index)); |
| 959 |
|
| 960 |
/* |
| 961 |
* 4. Generate an indexscan path if there are relevant restriction clauses |
| 962 |
* in the current clauses, OR the index ordering is potentially useful for |
| 963 |
* later merging or final output ordering, OR the index has a useful |
| 964 |
* predicate, OR an index-only scan is possible. |
| 965 |
*/ |
| 966 |
if (index_clauses != NIL || useful_pathkeys != NIL || useful_predicate || |
| 967 |
index_only_scan) |
| 968 |
{ |
| 969 |
ipath = create_index_path(root, index, |
| 970 |
index_clauses, |
| 971 |
orderbyclauses, |
| 972 |
orderbyclausecols, |
| 973 |
useful_pathkeys, |
| 974 |
ForwardScanDirection, |
| 975 |
index_only_scan, |
| 976 |
outer_relids, |
| 977 |
loop_count, |
| 978 |
false); |
| 979 |
result = lappend(result, ipath); |
| 980 |
|
| 981 |
/* |
| 982 |
* If appropriate, consider parallel index scan. We don't allow |
| 983 |
* parallel index scan for bitmap index scans. |
| 984 |
*/ |
| 985 |
if (index->amcanparallel && |
| 986 |
rel->consider_parallel && outer_relids == NULL && |
| 987 |
scantype != ST_BITMAPSCAN) |
| 988 |
{ |
| 989 |
ipath = create_index_path(root, index, |
| 990 |
index_clauses, |
| 991 |
orderbyclauses, |
| 992 |
orderbyclausecols, |
| 993 |
useful_pathkeys, |
| 994 |
ForwardScanDirection, |
| 995 |
index_only_scan, |
| 996 |
outer_relids, |
| 997 |
loop_count, |
| 998 |
true); |
| 999 |
|
| 1000 |
/* |
| 1001 |
* if, after costing the path, we find that it's not worth using |
| 1002 |
* parallel workers, just free it. |
| 1003 |
*/ |
| 1004 |
if (ipath->path.parallel_workers > 0) |
| 1005 |
add_partial_path(rel, (Path *) ipath); |
| 1006 |
else |
| 1007 |
pfree(ipath); |
| 1008 |
} |
| 1009 |
} |
| 1010 |
|
| 1011 |
/* |
| 1012 |
* 5. If the index is ordered, a backwards scan might be interesting. |
| 1013 |
*/ |
| 1014 |
if (index_is_ordered && pathkeys_possibly_useful) |
| 1015 |
{ |
| 1016 |
index_pathkeys = build_index_pathkeys(root, index, |
| 1017 |
BackwardScanDirection); |
| 1018 |
useful_pathkeys = truncate_useless_pathkeys(root, rel, |
| 1019 |
index_pathkeys); |
| 1020 |
if (useful_pathkeys != NIL) |
| 1021 |
{ |
| 1022 |
ipath = create_index_path(root, index, |
| 1023 |
index_clauses, |
| 1024 |
NIL, |
| 1025 |
NIL, |
| 1026 |
useful_pathkeys, |
| 1027 |
BackwardScanDirection, |
| 1028 |
index_only_scan, |
| 1029 |
outer_relids, |
| 1030 |
loop_count, |
| 1031 |
false); |
| 1032 |
result = lappend(result, ipath); |
| 1033 |
|
| 1034 |
/* If appropriate, consider parallel index scan */ |
| 1035 |
if (index->amcanparallel && |
| 1036 |
rel->consider_parallel && outer_relids == NULL && |
| 1037 |
scantype != ST_BITMAPSCAN) |
| 1038 |
{ |
| 1039 |
ipath = create_index_path(root, index, |
| 1040 |
index_clauses, |
| 1041 |
NIL, |
| 1042 |
NIL, |
| 1043 |
useful_pathkeys, |
| 1044 |
BackwardScanDirection, |
| 1045 |
index_only_scan, |
| 1046 |
outer_relids, |
| 1047 |
loop_count, |
| 1048 |
true); |
| 1049 |
|
| 1050 |
/* |
| 1051 |
* if, after costing the path, we find that it's not worth |
| 1052 |
* using parallel workers, just free it. |
| 1053 |
*/ |
| 1054 |
if (ipath->path.parallel_workers > 0) |
| 1055 |
add_partial_path(rel, (Path *) ipath); |
| 1056 |
else |
| 1057 |
pfree(ipath); |
| 1058 |
} |
| 1059 |
} |
| 1060 |
} |
| 1061 |
|
| 1062 |
return result; |
| 1063 |
} |
| 1064 |
|
| 1065 |
/* |
| 1066 |
* build_paths_for_OR |
| 1067 |
* Given a list of restriction clauses from one arm of an OR clause, |
| 1068 |
* construct all matching IndexPaths for the relation. |
| 1069 |
* |
| 1070 |
* Here we must scan all indexes of the relation, since a bitmap OR tree |
| 1071 |
* can use multiple indexes. |
| 1072 |
* |
| 1073 |
* The caller actually supplies two lists of restriction clauses: some |
| 1074 |
* "current" ones and some "other" ones. Both lists can be used freely |
| 1075 |
* to match keys of the index, but an index must use at least one of the |
| 1076 |
* "current" clauses to be considered usable. The motivation for this is |
| 1077 |
* examples like |
| 1078 |
* WHERE (x = 42) AND (... OR (y = 52 AND z = 77) OR ....) |
| 1079 |
* While we are considering the y/z subclause of the OR, we can use "x = 42" |
| 1080 |
* as one of the available index conditions; but we shouldn't match the |
| 1081 |
* subclause to any index on x alone, because such a Path would already have |
| 1082 |
* been generated at the upper level. So we could use an index on x,y,z |
| 1083 |
* or an index on x,y for the OR subclause, but not an index on just x. |
| 1084 |
* When dealing with a partial index, a match of the index predicate to |
| 1085 |
* one of the "current" clauses also makes the index usable. |
| 1086 |
* |
| 1087 |
* 'rel' is the relation for which we want to generate index paths |
| 1088 |
* 'clauses' is the current list of clauses (RestrictInfo nodes) |
| 1089 |
* 'other_clauses' is the list of additional upper-level clauses |
| 1090 |
*/ |
| 1091 |
static List * |
| 1092 |
build_paths_for_OR(PlannerInfo *root, RelOptInfo *rel, |
| 1093 |
List *clauses, List *other_clauses) |
| 1094 |
{ |
| 1095 |
List *result = NIL; |
| 1096 |
List *all_clauses = NIL; /* not computed till needed */ |
| 1097 |
ListCell *lc; |
| 1098 |
|
| 1099 |
foreach(lc, rel->indexlist) |
| 1100 |
{ |
| 1101 |
IndexOptInfo *index = (IndexOptInfo *) lfirst(lc); |
| 1102 |
IndexClauseSet clauseset; |
| 1103 |
List *indexpaths; |
| 1104 |
bool useful_predicate; |
| 1105 |
|
| 1106 |
/* Ignore index if it doesn't support bitmap scans */ |
| 1107 |
if (!index->amhasgetbitmap) |
| 1108 |
continue; |
| 1109 |
|
| 1110 |
/* |
| 1111 |
* Ignore partial indexes that do not match the query. If a partial |
| 1112 |
* index is marked predOK then we know it's OK. Otherwise, we have to |
| 1113 |
* test whether the added clauses are sufficient to imply the |
| 1114 |
* predicate. If so, we can use the index in the current context. |
| 1115 |
* |
| 1116 |
* We set useful_predicate to true iff the predicate was proven using |
| 1117 |
* the current set of clauses. This is needed to prevent matching a |
| 1118 |
* predOK index to an arm of an OR, which would be a legal but |
| 1119 |
* pointlessly inefficient plan. (A better plan will be generated by |
| 1120 |
* just scanning the predOK index alone, no OR.) |
| 1121 |
*/ |
| 1122 |
useful_predicate = false; |
| 1123 |
if (index->indpred != NIL) |
| 1124 |
{ |
| 1125 |
if (index->predOK) |
| 1126 |
{ |
| 1127 |
/* Usable, but don't set useful_predicate */ |
| 1128 |
} |
| 1129 |
else |
| 1130 |
{ |
| 1131 |
/* Form all_clauses if not done already */ |
| 1132 |
if (all_clauses == NIL) |
| 1133 |
all_clauses = list_concat_copy(clauses, other_clauses); |
| 1134 |
|
| 1135 |
if (!predicate_implied_by(index->indpred, all_clauses, false)) |
| 1136 |
continue; /* can't use it at all */ |
| 1137 |
|
| 1138 |
if (!predicate_implied_by(index->indpred, other_clauses, false)) |
| 1139 |
useful_predicate = true; |
| 1140 |
} |
| 1141 |
} |
| 1142 |
|
| 1143 |
/* |
| 1144 |
* Identify the restriction clauses that can match the index. |
| 1145 |
*/ |
| 1146 |
MemSet(&clauseset, 0, sizeof(clauseset)); |
| 1147 |
match_clauses_to_index(root, clauses, index, &clauseset); |
| 1148 |
|
| 1149 |
/* |
| 1150 |
* If no matches so far, and the index predicate isn't useful, we |
| 1151 |
* don't want it. |
| 1152 |
*/ |
| 1153 |
if (!clauseset.nonempty && !useful_predicate) |
| 1154 |
continue; |
| 1155 |
|
| 1156 |
/* |
| 1157 |
* Add "other" restriction clauses to the clauseset. |
| 1158 |
*/ |
| 1159 |
match_clauses_to_index(root, other_clauses, index, &clauseset); |
| 1160 |
|
| 1161 |
/* |
| 1162 |
* Construct paths if possible. |
| 1163 |
*/ |
| 1164 |
indexpaths = build_index_paths(root, rel, |
| 1165 |
index, &clauseset, |
| 1166 |
useful_predicate, |
| 1167 |
ST_BITMAPSCAN, |
| 1168 |
NULL); |
| 1169 |
result = list_concat(result, indexpaths); |
| 1170 |
} |
| 1171 |
|
| 1172 |
return result; |
| 1173 |
} |
| 1174 |
|
| 1175 |
/* |
| 1176 |
* Utility structure used to group similar OR-clause arguments in |
| 1177 |
* group_similar_or_args(). It represents information about the OR-clause |
| 1178 |
* argument and its matching index key. |
| 1179 |
*/ |
| 1180 |
typedef struct |
| 1181 |
{ |
| 1182 |
int indexnum; /* index of the matching index, or -1 if no |
| 1183 |
* matching index */ |
| 1184 |
int colnum; /* index of the matching column, or -1 if no |
| 1185 |
* matching index */ |
| 1186 |
Oid opno; /* OID of the OpClause operator, or InvalidOid |
| 1187 |
* if not an OpExpr */ |
| 1188 |
Oid inputcollid; /* OID of the OpClause input collation */ |
| 1189 |
int argindex; /* index of the clause in the list of |
| 1190 |
* arguments */ |
| 1191 |
int groupindex; /* value of argindex for the fist clause in |
| 1192 |
* the group of similar clauses */ |
| 1193 |
} OrArgIndexMatch; |
| 1194 |
|
| 1195 |
/* |
| 1196 |
* Comparison function for OrArgIndexMatch which provides sort order placing |
| 1197 |
* similar OR-clause arguments together. |
| 1198 |
*/ |
| 1199 |
static int |
| 1200 |
or_arg_index_match_cmp(const void *a, const void *b) |
| 1201 |
{ |
| 1202 |
const OrArgIndexMatch *match_a = (const OrArgIndexMatch *) a; |
| 1203 |
const OrArgIndexMatch *match_b = (const OrArgIndexMatch *) b; |
| 1204 |
|
| 1205 |
if (match_a->indexnum < match_b->indexnum) |
| 1206 |
return -1; |
| 1207 |
else if (match_a->indexnum > match_b->indexnum) |
| 1208 |
return 1; |
| 1209 |
|
| 1210 |
if (match_a->colnum < match_b->colnum) |
| 1211 |
return -1; |
| 1212 |
else if (match_a->colnum > match_b->colnum) |
| 1213 |
return 1; |
| 1214 |
|
| 1215 |
if (match_a->opno < match_b->opno) |
| 1216 |
return -1; |
| 1217 |
else if (match_a->opno > match_b->opno) |
| 1218 |
return 1; |
| 1219 |
|
| 1220 |
if (match_a->inputcollid < match_b->inputcollid) |
| 1221 |
return -1; |
| 1222 |
else if (match_a->inputcollid > match_b->inputcollid) |
| 1223 |
return 1; |
| 1224 |
|
| 1225 |
if (match_a->argindex < match_b->argindex) |
| 1226 |
return -1; |
| 1227 |
else if (match_a->argindex > match_b->argindex) |
| 1228 |
return 1; |
| 1229 |
|
| 1230 |
return 0; |
| 1231 |
} |
| 1232 |
|
| 1233 |
/* |
| 1234 |
* Another comparison function for OrArgIndexMatch. It sorts groups together |
| 1235 |
* using groupindex. The group items are then sorted by argindex. |
| 1236 |
*/ |
| 1237 |
static int |
| 1238 |
or_arg_index_match_cmp_group(const void *a, const void *b) |
| 1239 |
{ |
| 1240 |
const OrArgIndexMatch *match_a = (const OrArgIndexMatch *) a; |
| 1241 |
const OrArgIndexMatch *match_b = (const OrArgIndexMatch *) b; |
| 1242 |
|
| 1243 |
if (match_a->groupindex < match_b->groupindex) |
| 1244 |
return -1; |
| 1245 |
else if (match_a->groupindex > match_b->groupindex) |
| 1246 |
return 1; |
| 1247 |
|
| 1248 |
if (match_a->argindex < match_b->argindex) |
| 1249 |
return -1; |
| 1250 |
else if (match_a->argindex > match_b->argindex) |
| 1251 |
return 1; |
| 1252 |
|
| 1253 |
return 0; |
| 1254 |
} |
| 1255 |
|
| 1256 |
/* |
| 1257 |
* group_similar_or_args |
| 1258 |
* Transform incoming OR-restrictinfo into a list of sub-restrictinfos, |
| 1259 |
* each of them containing a subset of similar OR-clause arguments from |
| 1260 |
* the source rinfo. |
| 1261 |
* |
| 1262 |
* Similar OR-clause arguments are of the form "indexkey op constant" having |
| 1263 |
* the same indexkey, operator, and collation. Constant may comprise either |
| 1264 |
* Const or Param. It may be employed later, during the |
| 1265 |
* match_clause_to_indexcol() to transform the whole OR-sub-rinfo to an SAOP |
| 1266 |
* clause. |
| 1267 |
* |
| 1268 |
* Returns the processed list of OR-clause arguments. |
| 1269 |
*/ |
| 1270 |
static List * |
| 1271 |
group_similar_or_args(PlannerInfo *root, RelOptInfo *rel, RestrictInfo *rinfo) |
| 1272 |
{ |
| 1273 |
int n; |
| 1274 |
int i; |
| 1275 |
int group_start; |
| 1276 |
OrArgIndexMatch *matches; |
| 1277 |
bool matched = false; |
| 1278 |
ListCell *lc; |
| 1279 |
ListCell *lc2; |
| 1280 |
List *orargs; |
| 1281 |
List *result = NIL; |
| 1282 |
Index relid = rel->relid; |
| 1283 |
|
| 1284 |
Assert(IsA(rinfo->orclause, BoolExpr)); |
| 1285 |
orargs = ((BoolExpr *) rinfo->orclause)->args; |
| 1286 |
n = list_length(orargs); |
| 1287 |
|
| 1288 |
/* |
| 1289 |
* To avoid N^2 behavior, take utility pass along the list of OR-clause |
| 1290 |
* arguments. For each argument, fill the OrArgIndexMatch structure, |
| 1291 |
* which will be used to sort these arguments at the next step. |
| 1292 |
*/ |
| 1293 |
i = -1; |
| 1294 |
matches = (OrArgIndexMatch *) palloc(sizeof(OrArgIndexMatch) * n); |
| 1295 |
foreach(lc, orargs) |
| 1296 |
{ |
| 1297 |
Node *arg = lfirst(lc); |
| 1298 |
RestrictInfo *argrinfo; |
| 1299 |
OpExpr *clause; |
| 1300 |
Oid opno; |
| 1301 |
Node *leftop, |
| 1302 |
*rightop; |
| 1303 |
Node *nonConstExpr; |
| 1304 |
int indexnum; |
| 1305 |
int colnum; |
| 1306 |
|
| 1307 |
i++; |
| 1308 |
matches[i].argindex = i; |
| 1309 |
matches[i].groupindex = i; |
| 1310 |
matches[i].indexnum = -1; |
| 1311 |
matches[i].colnum = -1; |
| 1312 |
matches[i].opno = InvalidOid; |
| 1313 |
matches[i].inputcollid = InvalidOid; |
| 1314 |
|
| 1315 |
if (!IsA(arg, RestrictInfo)) |
| 1316 |
continue; |
| 1317 |
|
| 1318 |
argrinfo = castNode(RestrictInfo, arg); |
| 1319 |
|
| 1320 |
/* Only operator clauses can match */ |
| 1321 |
if (!IsA(argrinfo->clause, OpExpr)) |
| 1322 |
continue; |
| 1323 |
|
| 1324 |
clause = (OpExpr *) argrinfo->clause; |
| 1325 |
opno = clause->opno; |
| 1326 |
|
| 1327 |
/* Only binary operators can match */ |
| 1328 |
if (list_length(clause->args) != 2) |
| 1329 |
continue; |
| 1330 |
|
| 1331 |
/* |
| 1332 |
* Ignore any RelabelType node above the operands. This is needed to |
| 1333 |
* be able to apply indexscanning in binary-compatible-operator cases. |
| 1334 |
* Note: we can assume there is at most one RelabelType node; |
| 1335 |
* eval_const_expressions() will have simplified if more than one. |
| 1336 |
*/ |
| 1337 |
leftop = get_leftop(clause); |
| 1338 |
if (IsA(leftop, RelabelType)) |
| 1339 |
leftop = (Node *) ((RelabelType *) leftop)->arg; |
| 1340 |
|
| 1341 |
rightop = get_rightop(clause); |
| 1342 |
if (IsA(rightop, RelabelType)) |
| 1343 |
rightop = (Node *) ((RelabelType *) rightop)->arg; |
| 1344 |
|
| 1345 |
/* |
| 1346 |
* Check for clauses of the form: (indexkey operator constant) or |
| 1347 |
* (constant operator indexkey). But we don't know a particular index |
| 1348 |
* yet. Therefore, we try to distinguish the potential index key and |
| 1349 |
* constant first, then search for a matching index key among all |
| 1350 |
* indexes. |
| 1351 |
*/ |
| 1352 |
if (bms_is_member(relid, argrinfo->right_relids) && |
| 1353 |
!bms_is_member(relid, argrinfo->left_relids) && |
| 1354 |
!contain_volatile_functions(leftop)) |
| 1355 |
{ |
| 1356 |
opno = get_commutator(opno); |
| 1357 |
|
| 1358 |
if (!OidIsValid(opno)) |
| 1359 |
{ |
| 1360 |
/* commutator doesn't exist, we can't reverse the order */ |
| 1361 |
continue; |
| 1362 |
} |
| 1363 |
nonConstExpr = rightop; |
| 1364 |
} |
| 1365 |
else if (bms_is_member(relid, argrinfo->left_relids) && |
| 1366 |
!bms_is_member(relid, argrinfo->right_relids) && |
| 1367 |
!contain_volatile_functions(rightop)) |
| 1368 |
{ |
| 1369 |
nonConstExpr = leftop; |
| 1370 |
} |
| 1371 |
else |
| 1372 |
{ |
| 1373 |
continue; |
| 1374 |
} |
| 1375 |
|
| 1376 |
/* |
| 1377 |
* Match non-constant part to the index key. It's possible that a |
| 1378 |
* single non-constant part matches multiple index keys. It's OK, we |
| 1379 |
* just stop with first matching index key. Given that this choice is |
| 1380 |
* determined the same for every clause, we will group similar clauses |
| 1381 |
* together anyway. |
| 1382 |
*/ |
| 1383 |
indexnum = 0; |
| 1384 |
foreach(lc2, rel->indexlist) |
| 1385 |
{ |
| 1386 |
IndexOptInfo *index = (IndexOptInfo *) lfirst(lc2); |
| 1387 |
|
| 1388 |
/* |
| 1389 |
* Ignore index if it doesn't support bitmap scans or SAOP |
| 1390 |
* clauses. |
| 1391 |
*/ |
| 1392 |
if (!index->amhasgetbitmap || !index->amsearcharray) |
| 1393 |
continue; |
| 1394 |
|
| 1395 |
for (colnum = 0; colnum < index->nkeycolumns; colnum++) |
| 1396 |
{ |
| 1397 |
if (match_index_to_operand(nonConstExpr, colnum, index)) |
| 1398 |
{ |
| 1399 |
matches[i].indexnum = indexnum; |
| 1400 |
matches[i].colnum = colnum; |
| 1401 |
matches[i].opno = opno; |
| 1402 |
matches[i].inputcollid = clause->inputcollid; |
| 1403 |
matched = true; |
| 1404 |
break; |
| 1405 |
} |
| 1406 |
} |
| 1407 |
|
| 1408 |
/* |
| 1409 |
* Stop looping through the indexes, if we managed to match |
| 1410 |
* nonConstExpr to any index column. |
| 1411 |
*/ |
| 1412 |
if (matches[i].indexnum >= 0) |
| 1413 |
break; |
| 1414 |
indexnum++; |
| 1415 |
} |
| 1416 |
} |
| 1417 |
|
| 1418 |
/* |
| 1419 |
* Fast-path check: if no clause is matching to the index column, we can |
| 1420 |
* just give up at this stage and return the clause list as-is. |
| 1421 |
*/ |
| 1422 |
if (!matched) |
| 1423 |
{ |
| 1424 |
pfree(matches); |
| 1425 |
return orargs; |
| 1426 |
} |
| 1427 |
|
| 1428 |
/* |
| 1429 |
* Sort clauses to make similar clauses go together. But at the same |
| 1430 |
* time, we would like to change the order of clauses as little as |
| 1431 |
* possible. To do so, we reorder each group of similar clauses so that |
| 1432 |
* the first item of the group stays in place, and all the other items are |
| 1433 |
* moved after it. So, if there are no similar clauses, the order of |
| 1434 |
* clauses stays the same. When there are some groups, required |
| 1435 |
* reordering happens while the rest of the clauses remain in their |
| 1436 |
* places. That is achieved by assigning a 'groupindex' to each clause: |
| 1437 |
* the number of the first item in the group in the original clause list. |
| 1438 |
*/ |
| 1439 |
qsort(matches, n, sizeof(OrArgIndexMatch), or_arg_index_match_cmp); |
| 1440 |
|
| 1441 |
/* Assign groupindex to the sorted clauses */ |
| 1442 |
for (i = 1; i < n; i++) |
| 1443 |
{ |
| 1444 |
/* |
| 1445 |
* When two clauses are similar and should belong to the same group, |
| 1446 |
* copy the 'groupindex' from the previous clause. Given we are |
| 1447 |
* considering clauses in direct order, all the clauses would have a |
| 1448 |
* 'groupindex' equal to the 'groupindex' of the first clause in the |
| 1449 |
* group. |
| 1450 |
*/ |
| 1451 |
if (matches[i].indexnum == matches[i - 1].indexnum && |
| 1452 |
matches[i].colnum == matches[i - 1].colnum && |
| 1453 |
matches[i].opno == matches[i - 1].opno && |
| 1454 |
matches[i].inputcollid == matches[i - 1].inputcollid && |
| 1455 |
matches[i].indexnum != -1) |
| 1456 |
matches[i].groupindex = matches[i - 1].groupindex; |
| 1457 |
} |
| 1458 |
|
| 1459 |
/* Re-sort clauses first by groupindex then by argindex */ |
| 1460 |
qsort(matches, n, sizeof(OrArgIndexMatch), or_arg_index_match_cmp_group); |
| 1461 |
|
| 1462 |
/* |
| 1463 |
* Group similar clauses into single sub-restrictinfo. Side effect: the |
| 1464 |
* resulting list of restrictions will be sorted by indexnum and colnum. |
| 1465 |
*/ |
| 1466 |
group_start = 0; |
| 1467 |
for (i = 1; i <= n; i++) |
| 1468 |
{ |
| 1469 |
/* Check if it's a group boundary */ |
| 1470 |
if (group_start >= 0 && |
| 1471 |
(i == n || |
| 1472 |
matches[i].indexnum != matches[group_start].indexnum || |
| 1473 |
matches[i].colnum != matches[group_start].colnum || |
| 1474 |
matches[i].opno != matches[group_start].opno || |
| 1475 |
matches[i].inputcollid != matches[group_start].inputcollid || |
| 1476 |
matches[i].indexnum == -1)) |
| 1477 |
{ |
| 1478 |
/* |
| 1479 |
* One clause in group: add it "as is" to the upper-level OR. |
| 1480 |
*/ |
| 1481 |
if (i - group_start == 1) |
| 1482 |
{ |
| 1483 |
result = lappend(result, |
| 1484 |
list_nth(orargs, |
| 1485 |
matches[group_start].argindex)); |
| 1486 |
} |
| 1487 |
else |
| 1488 |
{ |
| 1489 |
/* |
| 1490 |
* Two or more clauses in a group: create a nested OR. |
| 1491 |
*/ |
| 1492 |
List *args = NIL; |
| 1493 |
List *rargs = NIL; |
| 1494 |
RestrictInfo *subrinfo; |
| 1495 |
int j; |
| 1496 |
|
| 1497 |
Assert(i - group_start >= 2); |
| 1498 |
|
| 1499 |
/* Construct the list of nested OR arguments */ |
| 1500 |
for (j = group_start; j < i; j++) |
| 1501 |
{ |
| 1502 |
Node *arg = list_nth(orargs, matches[j].argindex); |
| 1503 |
|
| 1504 |
rargs = lappend(rargs, arg); |
| 1505 |
if (IsA(arg, RestrictInfo)) |
| 1506 |
args = lappend(args, ((RestrictInfo *) arg)->clause); |
| 1507 |
else |
| 1508 |
args = lappend(args, arg); |
| 1509 |
} |
| 1510 |
|
| 1511 |
/* Construct the nested OR and wrap it with RestrictInfo */ |
| 1512 |
subrinfo = make_plain_restrictinfo(root, |
| 1513 |
make_orclause(args), |
| 1514 |
make_orclause(rargs), |
| 1515 |
rinfo->is_pushed_down, |
| 1516 |
rinfo->has_clone, |
| 1517 |
rinfo->is_clone, |
| 1518 |
rinfo->pseudoconstant, |
| 1519 |
rinfo->security_level, |
| 1520 |
rinfo->required_relids, |
| 1521 |
rinfo->incompatible_relids, |
| 1522 |
rinfo->outer_relids); |
| 1523 |
result = lappend(result, subrinfo); |
| 1524 |
} |
| 1525 |
|
| 1526 |
group_start = i; |
| 1527 |
} |
| 1528 |
} |
| 1529 |
pfree(matches); |
| 1530 |
return result; |
| 1531 |
} |
| 1532 |
|
| 1533 |
/* |
| 1534 |
* make_bitmap_paths_for_or_group |
| 1535 |
* Generate bitmap paths for a group of similar OR-clause arguments |
| 1536 |
* produced by group_similar_or_args(). |
| 1537 |
* |
| 1538 |
* This function considers two cases: (1) matching a group of clauses to |
| 1539 |
* the index as a whole, and (2) matching the individual clauses one-by-one. |
| 1540 |
* (1) typically comprises an optimal solution. If not, (2) typically |
| 1541 |
* comprises fair alternative. |
| 1542 |
* |
| 1543 |
* Ideally, we could consider all arbitrary splits of arguments into |
| 1544 |
* subgroups, but that could lead to unacceptable computational complexity. |
| 1545 |
* This is why we only consider two cases of above. |
| 1546 |
*/ |
| 1547 |
static List * |
| 1548 |
make_bitmap_paths_for_or_group(PlannerInfo *root, RelOptInfo *rel, |
| 1549 |
RestrictInfo *ri, List *other_clauses) |
| 1550 |
{ |
| 1551 |
List *jointlist = NIL; |
| 1552 |
List *splitlist = NIL; |
| 1553 |
ListCell *lc; |
| 1554 |
List *orargs; |
| 1555 |
List *args = ((BoolExpr *) ri->orclause)->args; |
| 1556 |
Cost jointcost = 0.0, |
| 1557 |
splitcost = 0.0; |
| 1558 |
Path *bitmapqual; |
| 1559 |
List *indlist; |
| 1560 |
|
| 1561 |
/* |
| 1562 |
* First, try to match the whole group to the one index. |
| 1563 |
*/ |
| 1564 |
orargs = list_make1(ri); |
| 1565 |
indlist = build_paths_for_OR(root, rel, |
| 1566 |
orargs, |
| 1567 |
other_clauses); |
| 1568 |
if (indlist != NIL) |
| 1569 |
{ |
| 1570 |
bitmapqual = choose_bitmap_and(root, rel, indlist); |
| 1571 |
jointcost = bitmapqual->total_cost; |
| 1572 |
jointlist = list_make1(bitmapqual); |
| 1573 |
} |
| 1574 |
|
| 1575 |
/* |
| 1576 |
* If we manage to find a bitmap scan, which uses the group of OR-clause |
| 1577 |
* arguments as a whole, we can skip matching OR-clause arguments |
| 1578 |
* one-by-one as long as there are no other clauses, which can bring more |
| 1579 |
* efficiency to one-by-one case. |
| 1580 |
*/ |
| 1581 |
if (jointlist != NIL && other_clauses == NIL) |
| 1582 |
return jointlist; |
| 1583 |
|
| 1584 |
/* |
| 1585 |
* Also try to match all containing clauses one-by-one. |
| 1586 |
*/ |
| 1587 |
foreach(lc, args) |
| 1588 |
{ |
| 1589 |
orargs = list_make1(lfirst(lc)); |
| 1590 |
|
| 1591 |
indlist = build_paths_for_OR(root, rel, |
| 1592 |
orargs, |
| 1593 |
other_clauses); |
| 1594 |
|
| 1595 |
if (indlist == NIL) |
| 1596 |
{ |
| 1597 |
splitlist = NIL; |
| 1598 |
break; |
| 1599 |
} |
| 1600 |
|
| 1601 |
bitmapqual = choose_bitmap_and(root, rel, indlist); |
| 1602 |
splitcost += bitmapqual->total_cost; |
| 1603 |
splitlist = lappend(splitlist, bitmapqual); |
| 1604 |
} |
| 1605 |
|
| 1606 |
/* |
| 1607 |
* Pick the best option. |
| 1608 |
*/ |
| 1609 |
if (splitlist == NIL) |
| 1610 |
return jointlist; |
| 1611 |
else if (jointlist == NIL) |
| 1612 |
return splitlist; |
| 1613 |
else |
| 1614 |
return (jointcost < splitcost) ? jointlist : splitlist; |
| 1615 |
} |
| 1616 |
|
| 1617 |
|
| 1618 |
/* |
| 1619 |
* generate_bitmap_or_paths |
| 1620 |
* Look through the list of clauses to find OR clauses, and generate |
| 1621 |
* a BitmapOrPath for each one we can handle that way. Return a list |
| 1622 |
* of the generated BitmapOrPaths. |
| 1623 |
* |
| 1624 |
* other_clauses is a list of additional clauses that can be assumed true |
| 1625 |
* for the purpose of generating indexquals, but are not to be searched for |
| 1626 |
* ORs. (See build_paths_for_OR() for motivation.) |
| 1627 |
*/ |
| 1628 |
static List * |
| 1629 |
generate_bitmap_or_paths(PlannerInfo *root, RelOptInfo *rel, |
| 1630 |
List *clauses, List *other_clauses) |
| 1631 |
{ |
| 1632 |
List *result = NIL; |
| 1633 |
List *all_clauses; |
| 1634 |
ListCell *lc; |
| 1635 |
|
| 1636 |
/* |
| 1637 |
* We can use both the current and other clauses as context for |
| 1638 |
* build_paths_for_OR; no need to remove ORs from the lists. |
| 1639 |
*/ |
| 1640 |
all_clauses = list_concat_copy(clauses, other_clauses); |
| 1641 |
|
| 1642 |
foreach(lc, clauses) |
| 1643 |
{ |
| 1644 |
RestrictInfo *rinfo = lfirst_node(RestrictInfo, lc); |
| 1645 |
List *pathlist; |
| 1646 |
Path *bitmapqual; |
| 1647 |
ListCell *j; |
| 1648 |
List *groupedArgs; |
| 1649 |
List *inner_other_clauses = NIL; |
| 1650 |
|
| 1651 |
/* Ignore RestrictInfos that aren't ORs */ |
| 1652 |
if (!restriction_is_or_clause(rinfo)) |
| 1653 |
continue; |
| 1654 |
|
| 1655 |
/* |
| 1656 |
* We must be able to match at least one index to each of the arms of |
| 1657 |
* the OR, else we can't use it. |
| 1658 |
*/ |
| 1659 |
pathlist = NIL; |
| 1660 |
|
| 1661 |
/* |
| 1662 |
* Group the similar OR-clause arguments into dedicated RestrictInfos, |
| 1663 |
* because each of those RestrictInfos has a chance to match the index |
| 1664 |
* as a whole. |
| 1665 |
*/ |
| 1666 |
groupedArgs = group_similar_or_args(root, rel, rinfo); |
| 1667 |
|
| 1668 |
if (groupedArgs != ((BoolExpr *) rinfo->orclause)->args) |
| 1669 |
{ |
| 1670 |
/* |
| 1671 |
* Some parts of the rinfo were probably grouped. In this case, |
| 1672 |
* we have a set of sub-rinfos that together are an exact |
| 1673 |
* duplicate of rinfo. Thus, we need to remove the rinfo from |
| 1674 |
* other clauses. match_clauses_to_index detects duplicated |
| 1675 |
* iclauses by comparing pointers to original rinfos that would be |
| 1676 |
* different. So, we must delete rinfo to avoid de-facto |
| 1677 |
* duplicated clauses in the index clauses list. |
| 1678 |
*/ |
| 1679 |
inner_other_clauses = list_delete(list_copy(all_clauses), rinfo); |
| 1680 |
} |
| 1681 |
|
| 1682 |
foreach(j, groupedArgs) |
| 1683 |
{ |
| 1684 |
Node *orarg = (Node *) lfirst(j); |
| 1685 |
List *indlist; |
| 1686 |
|
| 1687 |
/* OR arguments should be ANDs or sub-RestrictInfos */ |
| 1688 |
if (is_andclause(orarg)) |
| 1689 |
{ |
| 1690 |
List *andargs = ((BoolExpr *) orarg)->args; |
| 1691 |
|
| 1692 |
indlist = build_paths_for_OR(root, rel, |
| 1693 |
andargs, |
| 1694 |
all_clauses); |
| 1695 |
|
| 1696 |
/* Recurse in case there are sub-ORs */ |
| 1697 |
indlist = list_concat(indlist, |
| 1698 |
generate_bitmap_or_paths(root, rel, |
| 1699 |
andargs, |
| 1700 |
all_clauses)); |
| 1701 |
} |
| 1702 |
else if (restriction_is_or_clause(castNode(RestrictInfo, orarg))) |
| 1703 |
{ |
| 1704 |
RestrictInfo *ri = castNode(RestrictInfo, orarg); |
| 1705 |
|
| 1706 |
/* |
| 1707 |
* Generate bitmap paths for the group of similar OR-clause |
| 1708 |
* arguments. |
| 1709 |
*/ |
| 1710 |
indlist = make_bitmap_paths_for_or_group(root, |
| 1711 |
rel, ri, |
| 1712 |
inner_other_clauses); |
| 1713 |
|
| 1714 |
if (indlist == NIL) |
| 1715 |
{ |
| 1716 |
pathlist = NIL; |
| 1717 |
break; |
| 1718 |
} |
| 1719 |
else |
| 1720 |
{ |
| 1721 |
pathlist = list_concat(pathlist, indlist); |
| 1722 |
continue; |
| 1723 |
} |
| 1724 |
} |
| 1725 |
else |
| 1726 |
{ |
| 1727 |
RestrictInfo *ri = castNode(RestrictInfo, orarg); |
| 1728 |
List *orargs; |
| 1729 |
|
| 1730 |
orargs = list_make1(ri); |
| 1731 |
|
| 1732 |
indlist = build_paths_for_OR(root, rel, |
| 1733 |
orargs, |
| 1734 |
all_clauses); |
| 1735 |
} |
| 1736 |
|
| 1737 |
/* |
| 1738 |
* If nothing matched this arm, we can't do anything with this OR |
| 1739 |
* clause. |
| 1740 |
*/ |
| 1741 |
if (indlist == NIL) |
| 1742 |
{ |
| 1743 |
pathlist = NIL; |
| 1744 |
break; |
| 1745 |
} |
| 1746 |
|
| 1747 |
/* |
| 1748 |
* OK, pick the most promising AND combination, and add it to |
| 1749 |
* pathlist. |
| 1750 |
*/ |
| 1751 |
bitmapqual = choose_bitmap_and(root, rel, indlist); |
| 1752 |
pathlist = lappend(pathlist, bitmapqual); |
| 1753 |
} |
| 1754 |
|
| 1755 |
if (inner_other_clauses != NIL) |
| 1756 |
list_free(inner_other_clauses); |
| 1757 |
|
| 1758 |
/* |
| 1759 |
* If we have a match for every arm, then turn them into a |
| 1760 |
* BitmapOrPath, and add to result list. |
| 1761 |
*/ |
| 1762 |
if (pathlist != NIL) |
| 1763 |
{ |
| 1764 |
bitmapqual = (Path *) create_bitmap_or_path(root, rel, pathlist); |
| 1765 |
result = lappend(result, bitmapqual); |
| 1766 |
} |
| 1767 |
} |
| 1768 |
|
| 1769 |
return result; |
| 1770 |
} |
| 1771 |
|
| 1772 |
|
| 1773 |
/* |
| 1774 |
* choose_bitmap_and |
| 1775 |
* Given a nonempty list of bitmap paths, AND them into one path. |
| 1776 |
* |
| 1777 |
* This is a nontrivial decision since we can legally use any subset of the |
| 1778 |
* given path set. We want to choose a good tradeoff between selectivity |
| 1779 |
* and cost of computing the bitmap. |
| 1780 |
* |
| 1781 |
* The result is either a single one of the inputs, or a BitmapAndPath |
| 1782 |
* combining multiple inputs. |
| 1783 |
*/ |
| 1784 |
static Path * |
| 1785 |
choose_bitmap_and(PlannerInfo *root, RelOptInfo *rel, List *paths) |
| 1786 |
{ |
| 1787 |
int npaths = list_length(paths); |
| 1788 |
PathClauseUsage **pathinfoarray; |
| 1789 |
PathClauseUsage *pathinfo; |
| 1790 |
List *clauselist; |
| 1791 |
List *bestpaths = NIL; |
| 1792 |
Cost bestcost = 0; |
| 1793 |
int i, |
| 1794 |
j; |
| 1795 |
ListCell *l; |
| 1796 |
|
| 1797 |
Assert(npaths > 0); /* else caller error */ |
| 1798 |
if (npaths == 1) |
| 1799 |
return (Path *) linitial(paths); /* easy case */ |
| 1800 |
|
| 1801 |
/* |
| 1802 |
* In theory we should consider every nonempty subset of the given paths. |
| 1803 |
* In practice that seems like overkill, given the crude nature of the |
| 1804 |
* estimates, not to mention the possible effects of higher-level AND and |
| 1805 |
* OR clauses. Moreover, it's completely impractical if there are a large |
| 1806 |
* number of paths, since the work would grow as O(2^N). |
| 1807 |
* |
| 1808 |
* As a heuristic, we first check for paths using exactly the same sets of |
| 1809 |
* WHERE clauses + index predicate conditions, and reject all but the |
| 1810 |
* cheapest-to-scan in any such group. This primarily gets rid of indexes |
| 1811 |
* that include the interesting columns but also irrelevant columns. (In |
| 1812 |
* situations where the DBA has gone overboard on creating variant |
| 1813 |
* indexes, this can make for a very large reduction in the number of |
| 1814 |
* paths considered further.) |
| 1815 |
* |
| 1816 |
* We then sort the surviving paths with the cheapest-to-scan first, and |
| 1817 |
* for each path, consider using that path alone as the basis for a bitmap |
| 1818 |
* scan. Then we consider bitmap AND scans formed from that path plus |
| 1819 |
* each subsequent (higher-cost) path, adding on a subsequent path if it |
| 1820 |
* results in a reduction in the estimated total scan cost. This means we |
| 1821 |
* consider about O(N^2) rather than O(2^N) path combinations, which is |
| 1822 |
* quite tolerable, especially given than N is usually reasonably small |
| 1823 |
* because of the prefiltering step. The cheapest of these is returned. |
| 1824 |
* |
| 1825 |
* We will only consider AND combinations in which no two indexes use the |
| 1826 |
* same WHERE clause. This is a bit of a kluge: it's needed because |
| 1827 |
* costsize.c and clausesel.c aren't very smart about redundant clauses. |
| 1828 |
* They will usually double-count the redundant clauses, producing a |
| 1829 |
* too-small selectivity that makes a redundant AND step look like it |
| 1830 |
* reduces the total cost. Perhaps someday that code will be smarter and |
| 1831 |
* we can remove this limitation. (But note that this also defends |
| 1832 |
* against flat-out duplicate input paths, which can happen because |
| 1833 |
* match_join_clauses_to_index will find the same OR join clauses that |
| 1834 |
* extract_restriction_or_clauses has pulled OR restriction clauses out |
| 1835 |
* of.) |
| 1836 |
* |
| 1837 |
* For the same reason, we reject AND combinations in which an index |
| 1838 |
* predicate clause duplicates another clause. Here we find it necessary |
| 1839 |
* to be even stricter: we'll reject a partial index if any of its |
| 1840 |
* predicate clauses are implied by the set of WHERE clauses and predicate |
| 1841 |
* clauses used so far. This covers cases such as a condition "x = 42" |
| 1842 |
* used with a plain index, followed by a clauseless scan of a partial |
| 1843 |
* index "WHERE x >= 40 AND x < 50". The partial index has been accepted |
| 1844 |
* only because "x = 42" was present, and so allowing it would partially |
| 1845 |
* double-count selectivity. (We could use predicate_implied_by on |
| 1846 |
* regular qual clauses too, to have a more intelligent, but much more |
| 1847 |
* expensive, check for redundancy --- but in most cases simple equality |
| 1848 |
* seems to suffice.) |
| 1849 |
*/ |
| 1850 |
|
| 1851 |
/* |
| 1852 |
* Extract clause usage info and detect any paths that use exactly the |
| 1853 |
* same set of clauses; keep only the cheapest-to-scan of any such groups. |
| 1854 |
* The surviving paths are put into an array for qsort'ing. |
| 1855 |
*/ |
| 1856 |
pathinfoarray = (PathClauseUsage **) |
| 1857 |
palloc(npaths * sizeof(PathClauseUsage *)); |
| 1858 |
clauselist = NIL; |
| 1859 |
npaths = 0; |
| 1860 |
foreach(l, paths) |
| 1861 |
{ |
| 1862 |
Path *ipath = (Path *) lfirst(l); |
| 1863 |
|
| 1864 |
pathinfo = classify_index_clause_usage(ipath, &clauselist); |
| 1865 |
|
| 1866 |
/* If it's unclassifiable, treat it as distinct from all others */ |
| 1867 |
if (pathinfo->unclassifiable) |
| 1868 |
{ |
| 1869 |
pathinfoarray[npaths++] = pathinfo; |
| 1870 |
continue; |
| 1871 |
} |
| 1872 |
|
| 1873 |
for (i = 0; i < npaths; i++) |
| 1874 |
{ |
| 1875 |
if (!pathinfoarray[i]->unclassifiable && |
| 1876 |
bms_equal(pathinfo->clauseids, pathinfoarray[i]->clauseids)) |
| 1877 |
break; |
| 1878 |
} |
| 1879 |
if (i < npaths) |
| 1880 |
{ |
| 1881 |
/* duplicate clauseids, keep the cheaper one */ |
| 1882 |
Cost ncost; |
| 1883 |
Cost ocost; |
| 1884 |
Selectivity nselec; |
| 1885 |
Selectivity oselec; |
| 1886 |
|
| 1887 |
cost_bitmap_tree_node(pathinfo->path, &ncost, &nselec); |
| 1888 |
cost_bitmap_tree_node(pathinfoarray[i]->path, &ocost, &oselec); |
| 1889 |
if (ncost < ocost) |
| 1890 |
pathinfoarray[i] = pathinfo; |
| 1891 |
} |
| 1892 |
else |
| 1893 |
{ |
| 1894 |
/* not duplicate clauseids, add to array */ |
| 1895 |
pathinfoarray[npaths++] = pathinfo; |
| 1896 |
} |
| 1897 |
} |
| 1898 |
|
| 1899 |
/* If only one surviving path, we're done */ |
| 1900 |
if (npaths == 1) |
| 1901 |
return pathinfoarray[0]->path; |
| 1902 |
|
| 1903 |
/* Sort the surviving paths by index access cost */ |
| 1904 |
qsort(pathinfoarray, npaths, sizeof(PathClauseUsage *), |
| 1905 |
path_usage_comparator); |
| 1906 |
|
| 1907 |
/* |
| 1908 |
* For each surviving index, consider it as an "AND group leader", and see |
| 1909 |
* whether adding on any of the later indexes results in an AND path with |
| 1910 |
* cheaper total cost than before. Then take the cheapest AND group. |
| 1911 |
* |
| 1912 |
* Note: paths that are either clauseless or unclassifiable will have |
| 1913 |
* empty clauseids, so that they will not be rejected by the clauseids |
| 1914 |
* filter here, nor will they cause later paths to be rejected by it. |
| 1915 |
*/ |
| 1916 |
for (i = 0; i < npaths; i++) |
| 1917 |
{ |
| 1918 |
Cost costsofar; |
| 1919 |
List *qualsofar; |
| 1920 |
Bitmapset *clauseidsofar; |
| 1921 |
|
| 1922 |
pathinfo = pathinfoarray[i]; |
| 1923 |
paths = list_make1(pathinfo->path); |
| 1924 |
costsofar = bitmap_scan_cost_est(root, rel, pathinfo->path); |
| 1925 |
qualsofar = list_concat_copy(pathinfo->quals, pathinfo->preds); |
| 1926 |
clauseidsofar = bms_copy(pathinfo->clauseids); |
| 1927 |
|
| 1928 |
for (j = i + 1; j < npaths; j++) |
| 1929 |
{ |
| 1930 |
Cost newcost; |
| 1931 |
|
| 1932 |
pathinfo = pathinfoarray[j]; |
| 1933 |
/* Check for redundancy */ |
| 1934 |
if (bms_overlap(pathinfo->clauseids, clauseidsofar)) |
| 1935 |
continue; /* consider it redundant */ |
| 1936 |
if (pathinfo->preds) |
| 1937 |
{ |
| 1938 |
bool redundant = false; |
| 1939 |
|
| 1940 |
/* we check each predicate clause separately */ |
| 1941 |
foreach(l, pathinfo->preds) |
| 1942 |
{ |
| 1943 |
Node *np = (Node *) lfirst(l); |
| 1944 |
|
| 1945 |
if (predicate_implied_by(list_make1(np), qualsofar, false)) |
| 1946 |
{ |
| 1947 |
redundant = true; |
| 1948 |
break; /* out of inner foreach loop */ |
| 1949 |
} |
| 1950 |
} |
| 1951 |
if (redundant) |
| 1952 |
continue; |
| 1953 |
} |
| 1954 |
/* tentatively add new path to paths, so we can estimate cost */ |
| 1955 |
paths = lappend(paths, pathinfo->path); |
| 1956 |
newcost = bitmap_and_cost_est(root, rel, paths); |
| 1957 |
if (newcost < costsofar) |
| 1958 |
{ |
| 1959 |
/* keep new path in paths, update subsidiary variables */ |
| 1960 |
costsofar = newcost; |
| 1961 |
qualsofar = list_concat(qualsofar, pathinfo->quals); |
| 1962 |
qualsofar = list_concat(qualsofar, pathinfo->preds); |
| 1963 |
clauseidsofar = bms_add_members(clauseidsofar, |
| 1964 |
pathinfo->clauseids); |
| 1965 |
} |
| 1966 |
else |
| 1967 |
{ |
| 1968 |
/* reject new path, remove it from paths list */ |
| 1969 |
paths = list_truncate(paths, list_length(paths) - 1); |
| 1970 |
} |
| 1971 |
} |
| 1972 |
|
| 1973 |
/* Keep the cheapest AND-group (or singleton) */ |
| 1974 |
if (i == 0 || costsofar < bestcost) |
| 1975 |
{ |
| 1976 |
bestpaths = paths; |
| 1977 |
bestcost = costsofar; |
| 1978 |
} |
| 1979 |
|
| 1980 |
/* some easy cleanup (we don't try real hard though) */ |
| 1981 |
list_free(qualsofar); |
| 1982 |
} |
| 1983 |
|
| 1984 |
if (list_length(bestpaths) == 1) |
| 1985 |
return (Path *) linitial(bestpaths); /* no need for AND */ |
| 1986 |
return (Path *) create_bitmap_and_path(root, rel, bestpaths); |
| 1987 |
} |
| 1988 |
|
| 1989 |
/* qsort comparator to sort in increasing index access cost order */ |
| 1990 |
static int |
| 1991 |
path_usage_comparator(const void *a, const void *b) |
| 1992 |
{ |
| 1993 |
PathClauseUsage *pa = *(PathClauseUsage *const *) a; |
| 1994 |
PathClauseUsage *pb = *(PathClauseUsage *const *) b; |
| 1995 |
Cost acost; |
| 1996 |
Cost bcost; |
| 1997 |
Selectivity aselec; |
| 1998 |
Selectivity bselec; |
| 1999 |
|
| 2000 |
cost_bitmap_tree_node(pa->path, &acost, &aselec); |
| 2001 |
cost_bitmap_tree_node(pb->path, &bcost, &bselec); |
| 2002 |
|
| 2003 |
/* |
| 2004 |
* If costs are the same, sort by selectivity. |
| 2005 |
*/ |
| 2006 |
if (acost < bcost) |
| 2007 |
return -1; |
| 2008 |
if (acost > bcost) |
| 2009 |
return 1; |
| 2010 |
|
| 2011 |
if (aselec < bselec) |
| 2012 |
return -1; |
| 2013 |
if (aselec > bselec) |
| 2014 |
return 1; |
| 2015 |
|
| 2016 |
return 0; |
| 2017 |
} |
| 2018 |
|
| 2019 |
/* |
| 2020 |
* Estimate the cost of actually executing a bitmap scan with a single |
| 2021 |
* index path (which could be a BitmapAnd or BitmapOr node). |
| 2022 |
*/ |
| 2023 |
static Cost |
| 2024 |
bitmap_scan_cost_est(PlannerInfo *root, RelOptInfo *rel, Path *ipath) |
| 2025 |
{ |
| 2026 |
BitmapHeapPath bpath; |
| 2027 |
|
| 2028 |
/* Set up a dummy BitmapHeapPath */ |
| 2029 |
bpath.path.type = T_BitmapHeapPath; |
| 2030 |
bpath.path.pathtype = T_BitmapHeapScan; |
| 2031 |
bpath.path.parent = rel; |
| 2032 |
bpath.path.pathtarget = rel->reltarget; |
| 2033 |
bpath.path.param_info = ipath->param_info; |
| 2034 |
bpath.path.pathkeys = NIL; |
| 2035 |
bpath.bitmapqual = ipath; |
| 2036 |
|
| 2037 |
/* |
| 2038 |
* Check the cost of temporary path without considering parallelism. |
| 2039 |
* Parallel bitmap heap path will be considered at later stage. |
| 2040 |
*/ |
| 2041 |
bpath.path.parallel_workers = 0; |
| 2042 |
|
| 2043 |
/* Now we can do cost_bitmap_heap_scan */ |
| 2044 |
cost_bitmap_heap_scan(&bpath.path, root, rel, |
| 2045 |
bpath.path.param_info, |
| 2046 |
ipath, |
| 2047 |
get_loop_count(root, rel->relid, |
| 2048 |
PATH_REQ_OUTER(ipath))); |
| 2049 |
|
| 2050 |
return bpath.path.total_cost; |
| 2051 |
} |
| 2052 |
|
| 2053 |
/* |
| 2054 |
* Estimate the cost of actually executing a BitmapAnd scan with the given |
| 2055 |
* inputs. |
| 2056 |
*/ |
| 2057 |
static Cost |
| 2058 |
bitmap_and_cost_est(PlannerInfo *root, RelOptInfo *rel, List *paths) |
| 2059 |
{ |
| 2060 |
BitmapAndPath *apath; |
| 2061 |
|
| 2062 |
/* |
| 2063 |
* Might as well build a real BitmapAndPath here, as the work is slightly |
| 2064 |
* too complicated to be worth repeating just to save one palloc. |
| 2065 |
*/ |
| 2066 |
apath = create_bitmap_and_path(root, rel, paths); |
| 2067 |
|
| 2068 |
return bitmap_scan_cost_est(root, rel, (Path *) apath); |
| 2069 |
} |
| 2070 |
|
| 2071 |
|
| 2072 |
/* |
| 2073 |
* classify_index_clause_usage |
| 2074 |
* Construct a PathClauseUsage struct describing the WHERE clauses and |
| 2075 |
* index predicate clauses used by the given indexscan path. |
| 2076 |
* We consider two clauses the same if they are equal(). |
| 2077 |
* |
| 2078 |
* At some point we might want to migrate this info into the Path data |
| 2079 |
* structure proper, but for the moment it's only needed within |
| 2080 |
* choose_bitmap_and(). |
| 2081 |
* |
| 2082 |
* *clauselist is used and expanded as needed to identify all the distinct |
| 2083 |
* clauses seen across successive calls. Caller must initialize it to NIL |
| 2084 |
* before first call of a set. |
| 2085 |
*/ |
| 2086 |
static PathClauseUsage * |
| 2087 |
classify_index_clause_usage(Path *path, List **clauselist) |
| 2088 |
{ |
| 2089 |
PathClauseUsage *result; |
| 2090 |
Bitmapset *clauseids; |
| 2091 |
ListCell *lc; |
| 2092 |
|
| 2093 |
result = (PathClauseUsage *) palloc(sizeof(PathClauseUsage)); |
| 2094 |
result->path = path; |
| 2095 |
|
| 2096 |
/* Recursively find the quals and preds used by the path */ |
| 2097 |
result->quals = NIL; |
| 2098 |
result->preds = NIL; |
| 2099 |
find_indexpath_quals(path, &result->quals, &result->preds); |
| 2100 |
|
| 2101 |
/* |
| 2102 |
* Some machine-generated queries have outlandish numbers of qual clauses. |
| 2103 |
* To avoid getting into O(N^2) behavior even in this preliminary |
| 2104 |
* classification step, we want to limit the number of entries we can |
| 2105 |
* accumulate in *clauselist. Treat any path with more than 100 quals + |
| 2106 |
* preds as unclassifiable, which will cause calling code to consider it |
| 2107 |
* distinct from all other paths. |
| 2108 |
*/ |
| 2109 |
if (list_length(result->quals) + list_length(result->preds) > 100) |
| 2110 |
{ |
| 2111 |
result->clauseids = NULL; |
| 2112 |
result->unclassifiable = true; |
| 2113 |
return result; |
| 2114 |
} |
| 2115 |
|
| 2116 |
/* Build up a bitmapset representing the quals and preds */ |
| 2117 |
clauseids = NULL; |
| 2118 |
foreach(lc, result->quals) |
| 2119 |
{ |
| 2120 |
Node *node = (Node *) lfirst(lc); |
| 2121 |
|
| 2122 |
clauseids = bms_add_member(clauseids, |
| 2123 |
find_list_position(node, clauselist)); |
| 2124 |
} |
| 2125 |
foreach(lc, result->preds) |
| 2126 |
{ |
| 2127 |
Node *node = (Node *) lfirst(lc); |
| 2128 |
|
| 2129 |
clauseids = bms_add_member(clauseids, |
| 2130 |
find_list_position(node, clauselist)); |
| 2131 |
} |
| 2132 |
result->clauseids = clauseids; |
| 2133 |
result->unclassifiable = false; |
| 2134 |
|
| 2135 |
return result; |
| 2136 |
} |
| 2137 |
|
| 2138 |
|
| 2139 |
/* |
| 2140 |
* find_indexpath_quals |
| 2141 |
* |
| 2142 |
* Given the Path structure for a plain or bitmap indexscan, extract lists |
| 2143 |
* of all the index clauses and index predicate conditions used in the Path. |
| 2144 |
* These are appended to the initial contents of *quals and *preds (hence |
| 2145 |
* caller should initialize those to NIL). |
| 2146 |
* |
| 2147 |
* Note we are not trying to produce an accurate representation of the AND/OR |
| 2148 |
* semantics of the Path, but just find out all the base conditions used. |
| 2149 |
* |
| 2150 |
* The result lists contain pointers to the expressions used in the Path, |
| 2151 |
* but all the list cells are freshly built, so it's safe to destructively |
| 2152 |
* modify the lists (eg, by concat'ing with other lists). |
| 2153 |
*/ |
| 2154 |
static void |
| 2155 |
find_indexpath_quals(Path *bitmapqual, List **quals, List **preds) |
| 2156 |
{ |
| 2157 |
if (IsA(bitmapqual, BitmapAndPath)) |
| 2158 |
{ |
| 2159 |
BitmapAndPath *apath = (BitmapAndPath *) bitmapqual; |
| 2160 |
ListCell *l; |
| 2161 |
|
| 2162 |
foreach(l, apath->bitmapquals) |
| 2163 |
{ |
| 2164 |
find_indexpath_quals((Path *) lfirst(l), quals, preds); |
| 2165 |
} |
| 2166 |
} |
| 2167 |
else if (IsA(bitmapqual, BitmapOrPath)) |
| 2168 |
{ |
| 2169 |
BitmapOrPath *opath = (BitmapOrPath *) bitmapqual; |
| 2170 |
ListCell *l; |
| 2171 |
|
| 2172 |
foreach(l, opath->bitmapquals) |
| 2173 |
{ |
| 2174 |
find_indexpath_quals((Path *) lfirst(l), quals, preds); |
| 2175 |
} |
| 2176 |
} |
| 2177 |
else if (IsA(bitmapqual, IndexPath)) |
| 2178 |
{ |
| 2179 |
IndexPath *ipath = (IndexPath *) bitmapqual; |
| 2180 |
ListCell *l; |
| 2181 |
|
| 2182 |
foreach(l, ipath->indexclauses) |
| 2183 |
{ |
| 2184 |
IndexClause *iclause = (IndexClause *) lfirst(l); |
| 2185 |
|
| 2186 |
*quals = lappend(*quals, iclause->rinfo->clause); |
| 2187 |
} |
| 2188 |
*preds = list_concat(*preds, ipath->indexinfo->indpred); |
| 2189 |
} |
| 2190 |
else |
| 2191 |
elog(ERROR, "unrecognized node type: %d", nodeTag(bitmapqual)); |
| 2192 |
} |
| 2193 |
|
| 2194 |
|
| 2195 |
/* |
| 2196 |
* find_list_position |
| 2197 |
* Return the given node's position (counting from 0) in the given |
| 2198 |
* list of nodes. If it's not equal() to any existing list member, |
| 2199 |
* add it at the end, and return that position. |
| 2200 |
*/ |
| 2201 |
static int |
| 2202 |
find_list_position(Node *node, List **nodelist) |
| 2203 |
{ |
| 2204 |
int i; |
| 2205 |
ListCell *lc; |
| 2206 |
|
| 2207 |
i = 0; |
| 2208 |
foreach(lc, *nodelist) |
| 2209 |
{ |
| 2210 |
Node *oldnode = (Node *) lfirst(lc); |
| 2211 |
|
| 2212 |
if (equal(node, oldnode)) |
| 2213 |
return i; |
| 2214 |
i++; |
| 2215 |
} |
| 2216 |
|
| 2217 |
*nodelist = lappend(*nodelist, node); |
| 2218 |
|
| 2219 |
return i; |
| 2220 |
} |
| 2221 |
|
| 2222 |
|
| 2223 |
/* |
| 2224 |
* check_index_only |
| 2225 |
* Determine whether an index-only scan is possible for this index. |
| 2226 |
*/ |
| 2227 |
static bool |
| 2228 |
check_index_only(RelOptInfo *rel, IndexOptInfo *index) |
| 2229 |
{ |
| 2230 |
bool result; |
| 2231 |
Bitmapset *attrs_used = NULL; |
| 2232 |
Bitmapset *index_canreturn_attrs = NULL; |
| 2233 |
ListCell *lc; |
| 2234 |
int i; |
| 2235 |
|
| 2236 |
/* Index-only scans must be enabled */ |
| 2237 |
if (!enable_indexonlyscan) |
| 2238 |
return false; |
| 2239 |
|
| 2240 |
/* |
| 2241 |
* Check that all needed attributes of the relation are available from the |
| 2242 |
* index. |
| 2243 |
*/ |
| 2244 |
|
| 2245 |
/* |
| 2246 |
* First, identify all the attributes needed for joins or final output. |
| 2247 |
* Note: we must look at rel's targetlist, not the attr_needed data, |
| 2248 |
* because attr_needed isn't computed for inheritance child rels. |
| 2249 |
*/ |
| 2250 |
pull_varattnos((Node *) rel->reltarget->exprs, rel->relid, &attrs_used); |
| 2251 |
|
| 2252 |
/* |
| 2253 |
* Add all the attributes used by restriction clauses; but consider only |
| 2254 |
* those clauses not implied by the index predicate, since ones that are |
| 2255 |
* so implied don't need to be checked explicitly in the plan. |
| 2256 |
* |
| 2257 |
* Note: attributes used only in index quals would not be needed at |
| 2258 |
* runtime either, if we are certain that the index is not lossy. However |
| 2259 |
* it'd be complicated to account for that accurately, and it doesn't |
| 2260 |
* matter in most cases, since we'd conclude that such attributes are |
| 2261 |
* available from the index anyway. |
| 2262 |
*/ |
| 2263 |
foreach(lc, index->indrestrictinfo) |
| 2264 |
{ |
| 2265 |
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc); |
| 2266 |
|
| 2267 |
pull_varattnos((Node *) rinfo->clause, rel->relid, &attrs_used); |
| 2268 |
} |
| 2269 |
|
| 2270 |
/* |
| 2271 |
* Construct a bitmapset of columns that the index can return back in an |
| 2272 |
* index-only scan. |
| 2273 |
*/ |
| 2274 |
for (i = 0; i < index->ncolumns; i++) |
| 2275 |
{ |
| 2276 |
int attno = index->indexkeys[i]; |
| 2277 |
|
| 2278 |
/* |
| 2279 |
* For the moment, we just ignore index expressions. It might be nice |
| 2280 |
* to do something with them, later. |
| 2281 |
*/ |
| 2282 |
if (attno == 0) |
| 2283 |
continue; |
| 2284 |
|
| 2285 |
if (index->canreturn[i]) |
| 2286 |
index_canreturn_attrs = |
| 2287 |
bms_add_member(index_canreturn_attrs, |
| 2288 |
attno - FirstLowInvalidHeapAttributeNumber); |
| 2289 |
} |
| 2290 |
|
| 2291 |
/* Do we have all the necessary attributes? */ |
| 2292 |
result = bms_is_subset(attrs_used, index_canreturn_attrs); |
| 2293 |
|
| 2294 |
bms_free(attrs_used); |
| 2295 |
bms_free(index_canreturn_attrs); |
| 2296 |
|
| 2297 |
return result; |
| 2298 |
} |
| 2299 |
|
| 2300 |
/* |
| 2301 |
* get_loop_count |
| 2302 |
* Choose the loop count estimate to use for costing a parameterized path |
| 2303 |
* with the given set of outer relids. |
| 2304 |
* |
| 2305 |
* Since we produce parameterized paths before we've begun to generate join |
| 2306 |
* relations, it's impossible to predict exactly how many times a parameterized |
| 2307 |
* path will be iterated; we don't know the size of the relation that will be |
| 2308 |
* on the outside of the nestloop. However, we should try to account for |
| 2309 |
* multiple iterations somehow in costing the path. The heuristic embodied |
| 2310 |
* here is to use the rowcount of the smallest other base relation needed in |
| 2311 |
* the join clauses used by the path. (We could alternatively consider the |
| 2312 |
* largest one, but that seems too optimistic.) This is of course the right |
| 2313 |
* answer for single-other-relation cases, and it seems like a reasonable |
| 2314 |
* zero-order approximation for multiway-join cases. |
| 2315 |
* |
| 2316 |
* In addition, we check to see if the other side of each join clause is on |
| 2317 |
* the inside of some semijoin that the current relation is on the outside of. |
| 2318 |
* If so, the only way that a parameterized path could be used is if the |
| 2319 |
* semijoin RHS has been unique-ified, so we should use the number of unique |
| 2320 |
* RHS rows rather than using the relation's raw rowcount. |
| 2321 |
* |
| 2322 |
* Note: for this to work, allpaths.c must establish all baserel size |
| 2323 |
* estimates before it begins to compute paths, or at least before it |
| 2324 |
* calls create_index_paths(). |
| 2325 |
*/ |
| 2326 |
static double |
| 2327 |
get_loop_count(PlannerInfo *root, Index cur_relid, Relids outer_relids) |
| 2328 |
{ |
| 2329 |
double result; |
| 2330 |
int outer_relid; |
| 2331 |
|
| 2332 |
/* For a non-parameterized path, just return 1.0 quickly */ |
| 2333 |
if (outer_relids == NULL) |
| 2334 |
return 1.0; |
| 2335 |
|
| 2336 |
result = 0.0; |
| 2337 |
outer_relid = -1; |
| 2338 |
while ((outer_relid = bms_next_member(outer_relids, outer_relid)) >= 0) |
| 2339 |
{ |
| 2340 |
RelOptInfo *outer_rel; |
| 2341 |
double rowcount; |
| 2342 |
|
| 2343 |
/* Paranoia: ignore bogus relid indexes */ |
| 2344 |
if (outer_relid >= root->simple_rel_array_size) |
| 2345 |
continue; |
| 2346 |
outer_rel = root->simple_rel_array[outer_relid]; |
| 2347 |
if (outer_rel == NULL) |
| 2348 |
continue; |
| 2349 |
Assert(outer_rel->relid == outer_relid); /* sanity check on array */ |
| 2350 |
|
| 2351 |
/* Other relation could be proven empty, if so ignore */ |
| 2352 |
if (IS_DUMMY_REL(outer_rel)) |
| 2353 |
continue; |
| 2354 |
|
| 2355 |
/* Otherwise, rel's rows estimate should be valid by now */ |
| 2356 |
Assert(outer_rel->rows > 0); |
| 2357 |
|
| 2358 |
/* Check to see if rel is on the inside of any semijoins */ |
| 2359 |
rowcount = adjust_rowcount_for_semijoins(root, |
| 2360 |
cur_relid, |
| 2361 |
outer_relid, |
| 2362 |
outer_rel->rows); |
| 2363 |
|
| 2364 |
/* Remember smallest row count estimate among the outer rels */ |
| 2365 |
if (result == 0.0 || result > rowcount) |
| 2366 |
result = rowcount; |
| 2367 |
} |
| 2368 |
/* Return 1.0 if we found no valid relations (shouldn't happen) */ |
| 2369 |
return (result > 0.0) ? result : 1.0; |
| 2370 |
} |
| 2371 |
|
| 2372 |
/* |
| 2373 |
* Check to see if outer_relid is on the inside of any semijoin that cur_relid |
| 2374 |
* is on the outside of. If so, replace rowcount with the estimated number of |
| 2375 |
* unique rows from the semijoin RHS (assuming that's smaller, which it might |
| 2376 |
* not be). The estimate is crude but it's the best we can do at this stage |
| 2377 |
* of the proceedings. |
| 2378 |
*/ |
| 2379 |
static double |
| 2380 |
adjust_rowcount_for_semijoins(PlannerInfo *root, |
| 2381 |
Index cur_relid, |
| 2382 |
Index outer_relid, |
| 2383 |
double rowcount) |
| 2384 |
{ |
| 2385 |
ListCell *lc; |
| 2386 |
|
| 2387 |
foreach(lc, root->join_info_list) |
| 2388 |
{ |
| 2389 |
SpecialJoinInfo *sjinfo = (SpecialJoinInfo *) lfirst(lc); |
| 2390 |
|
| 2391 |
if (sjinfo->jointype == JOIN_SEMI && |
| 2392 |
bms_is_member(cur_relid, sjinfo->syn_lefthand) && |
| 2393 |
bms_is_member(outer_relid, sjinfo->syn_righthand)) |
| 2394 |
{ |
| 2395 |
/* Estimate number of unique-ified rows */ |
| 2396 |
double nraw; |
| 2397 |
double nunique; |
| 2398 |
|
| 2399 |
nraw = approximate_joinrel_size(root, sjinfo->syn_righthand); |
| 2400 |
nunique = estimate_num_groups(root, |
| 2401 |
sjinfo->semi_rhs_exprs, |
| 2402 |
nraw, |
| 2403 |
NULL, |
| 2404 |
NULL); |
| 2405 |
if (rowcount > nunique) |
| 2406 |
rowcount = nunique; |
| 2407 |
} |
| 2408 |
} |
| 2409 |
return rowcount; |
| 2410 |
} |
| 2411 |
|
| 2412 |
/* |
| 2413 |
* Make an approximate estimate of the size of a joinrel. |
| 2414 |
* |
| 2415 |
* We don't have enough info at this point to get a good estimate, so we |
| 2416 |
* just multiply the base relation sizes together. Fortunately, this is |
| 2417 |
* the right answer anyway for the most common case with a single relation |
| 2418 |
* on the RHS of a semijoin. Also, estimate_num_groups() has only a weak |
| 2419 |
* dependency on its input_rows argument (it basically uses it as a clamp). |
| 2420 |
* So we might be able to get a fairly decent end result even with a severe |
| 2421 |
* overestimate of the RHS's raw size. |
| 2422 |
*/ |
| 2423 |
static double |
| 2424 |
approximate_joinrel_size(PlannerInfo *root, Relids relids) |
| 2425 |
{ |
| 2426 |
double rowcount = 1.0; |
| 2427 |
int relid; |
| 2428 |
|
| 2429 |
relid = -1; |
| 2430 |
while ((relid = bms_next_member(relids, relid)) >= 0) |
| 2431 |
{ |
| 2432 |
RelOptInfo *rel; |
| 2433 |
|
| 2434 |
/* Paranoia: ignore bogus relid indexes */ |
| 2435 |
if (relid >= root->simple_rel_array_size) |
| 2436 |
continue; |
| 2437 |
rel = root->simple_rel_array[relid]; |
| 2438 |
if (rel == NULL) |
| 2439 |
continue; |
| 2440 |
Assert(rel->relid == relid); /* sanity check on array */ |
| 2441 |
|
| 2442 |
/* Relation could be proven empty, if so ignore */ |
| 2443 |
if (IS_DUMMY_REL(rel)) |
| 2444 |
continue; |
| 2445 |
|
| 2446 |
/* Otherwise, rel's rows estimate should be valid by now */ |
| 2447 |
Assert(rel->rows > 0); |
| 2448 |
|
| 2449 |
/* Accumulate product */ |
| 2450 |
rowcount *= rel->rows; |
| 2451 |
} |
| 2452 |
return rowcount; |
| 2453 |
} |
| 2454 |
|
| 2455 |
|
| 2456 |
/**************************************************************************** |
| 2457 |
* ---- ROUTINES TO CHECK QUERY CLAUSES ---- |
| 2458 |
****************************************************************************/ |
| 2459 |
|
| 2460 |
/* |
| 2461 |
* match_restriction_clauses_to_index |
| 2462 |
* Identify restriction clauses for the rel that match the index. |
| 2463 |
* Matching clauses are added to *clauseset. |
| 2464 |
*/ |
| 2465 |
static void |
| 2466 |
match_restriction_clauses_to_index(PlannerInfo *root, |
| 2467 |
IndexOptInfo *index, |
| 2468 |
IndexClauseSet *clauseset) |
| 2469 |
{ |
| 2470 |
/* We can ignore clauses that are implied by the index predicate */ |
| 2471 |
match_clauses_to_index(root, index->indrestrictinfo, index, clauseset); |
| 2472 |
} |
| 2473 |
|
| 2474 |
/* |
| 2475 |
* match_join_clauses_to_index |
| 2476 |
* Identify join clauses for the rel that match the index. |
| 2477 |
* Matching clauses are added to *clauseset. |
| 2478 |
* Also, add any potentially usable join OR clauses to *joinorclauses. |
| 2479 |
* They also might be processed by match_clause_to_index() as a whole. |
| 2480 |
*/ |
| 2481 |
static void |
| 2482 |
match_join_clauses_to_index(PlannerInfo *root, |
| 2483 |
RelOptInfo *rel, IndexOptInfo *index, |
| 2484 |
IndexClauseSet *clauseset, |
| 2485 |
List **joinorclauses) |
| 2486 |
{ |
| 2487 |
ListCell *lc; |
| 2488 |
|
| 2489 |
/* Scan the rel's join clauses */ |
| 2490 |
foreach(lc, rel->joininfo) |
| 2491 |
{ |
| 2492 |
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc); |
| 2493 |
|
| 2494 |
/* Check if clause can be moved to this rel */ |
| 2495 |
if (!join_clause_is_movable_to(rinfo, rel)) |
| 2496 |
continue; |
| 2497 |
|
| 2498 |
/* |
| 2499 |
* Potentially usable, so see if it matches the index or is an OR. Use |
| 2500 |
* list_append_unique_ptr() here to avoid possible duplicates when |
| 2501 |
* processing the same clauses with different indexes. |
| 2502 |
*/ |
| 2503 |
if (restriction_is_or_clause(rinfo)) |
| 2504 |
*joinorclauses = list_append_unique_ptr(*joinorclauses, rinfo); |
| 2505 |
|
| 2506 |
match_clause_to_index(root, rinfo, index, clauseset); |
| 2507 |
} |
| 2508 |
} |
| 2509 |
|
| 2510 |
/* |
| 2511 |
* match_eclass_clauses_to_index |
| 2512 |
* Identify EquivalenceClass join clauses for the rel that match the index. |
| 2513 |
* Matching clauses are added to *clauseset. |
| 2514 |
*/ |
| 2515 |
static void |
| 2516 |
match_eclass_clauses_to_index(PlannerInfo *root, IndexOptInfo *index, |
| 2517 |
IndexClauseSet *clauseset) |
| 2518 |
{ |
| 2519 |
int indexcol; |
| 2520 |
|
| 2521 |
/* No work if rel is not in any such ECs */ |
| 2522 |
if (!index->rel->has_eclass_joins) |
| 2523 |
return; |
| 2524 |
|
| 2525 |
for (indexcol = 0; indexcol < index->nkeycolumns; indexcol++) |
| 2526 |
{ |
| 2527 |
ec_member_matches_arg arg; |
| 2528 |
List *clauses; |
| 2529 |
|
| 2530 |
/* Generate clauses, skipping any that join to lateral_referencers */ |
| 2531 |
arg.index = index; |
| 2532 |
arg.indexcol = indexcol; |
| 2533 |
clauses = generate_implied_equalities_for_column(root, |
| 2534 |
index->rel, |
| 2535 |
ec_member_matches_indexcol, |
| 2536 |
&arg, |
| 2537 |
index->rel->lateral_referencers); |
| 2538 |
|
| 2539 |
/* |
| 2540 |
* We have to check whether the results actually do match the index, |
| 2541 |
* since for non-btree indexes the EC's equality operators might not |
| 2542 |
* be in the index opclass (cf ec_member_matches_indexcol). |
| 2543 |
*/ |
| 2544 |
match_clauses_to_index(root, clauses, index, clauseset); |
| 2545 |
} |
| 2546 |
} |
| 2547 |
|
| 2548 |
/* |
| 2549 |
* match_clauses_to_index |
| 2550 |
* Perform match_clause_to_index() for each clause in a list. |
| 2551 |
* Matching clauses are added to *clauseset. |
| 2552 |
*/ |
| 2553 |
static void |
| 2554 |
match_clauses_to_index(PlannerInfo *root, |
| 2555 |
List *clauses, |
| 2556 |
IndexOptInfo *index, |
| 2557 |
IndexClauseSet *clauseset) |
| 2558 |
{ |
| 2559 |
ListCell *lc; |
| 2560 |
|
| 2561 |
foreach(lc, clauses) |
| 2562 |
{ |
| 2563 |
RestrictInfo *rinfo = lfirst_node(RestrictInfo, lc); |
| 2564 |
|
| 2565 |
match_clause_to_index(root, rinfo, index, clauseset); |
| 2566 |
} |
| 2567 |
} |
| 2568 |
|
| 2569 |
/* |
| 2570 |
* match_clause_to_index |
| 2571 |
* Test whether a qual clause can be used with an index. |
| 2572 |
* |
| 2573 |
* If the clause is usable, add an IndexClause entry for it to the appropriate |
| 2574 |
* list in *clauseset. (*clauseset must be initialized to zeroes before first |
| 2575 |
* call.) |
| 2576 |
* |
| 2577 |
* Note: in some circumstances we may find the same RestrictInfos coming from |
| 2578 |
* multiple places. Defend against redundant outputs by refusing to add a |
| 2579 |
* clause twice (pointer equality should be a good enough check for this). |
| 2580 |
* |
| 2581 |
* Note: it's possible that a badly-defined index could have multiple matching |
| 2582 |
* columns. We always select the first match if so; this avoids scenarios |
| 2583 |
* wherein we get an inflated idea of the index's selectivity by using the |
| 2584 |
* same clause multiple times with different index columns. |
| 2585 |
*/ |
| 2586 |
static void |
| 2587 |
match_clause_to_index(PlannerInfo *root, |
| 2588 |
RestrictInfo *rinfo, |
| 2589 |
IndexOptInfo *index, |
| 2590 |
IndexClauseSet *clauseset) |
| 2591 |
{ |
| 2592 |
int indexcol; |
| 2593 |
|
| 2594 |
/* |
| 2595 |
* Never match pseudoconstants to indexes. (Normally a match could not |
| 2596 |
* happen anyway, since a pseudoconstant clause couldn't contain a Var, |
| 2597 |
* but what if someone builds an expression index on a constant? It's not |
| 2598 |
* totally unreasonable to do so with a partial index, either.) |
| 2599 |
*/ |
| 2600 |
if (rinfo->pseudoconstant) |
| 2601 |
return; |
| 2602 |
|
| 2603 |
/* |
| 2604 |
* If clause can't be used as an indexqual because it must wait till after |
| 2605 |
* some lower-security-level restriction clause, reject it. |
| 2606 |
*/ |
| 2607 |
if (!restriction_is_securely_promotable(rinfo, index->rel)) |
| 2608 |
return; |
| 2609 |
|
| 2610 |
/* OK, check each index key column for a match */ |
| 2611 |
for (indexcol = 0; indexcol < index->nkeycolumns; indexcol++) |
| 2612 |
{ |
| 2613 |
IndexClause *iclause; |
| 2614 |
ListCell *lc; |
| 2615 |
|
| 2616 |
/* Ignore duplicates */ |
| 2617 |
foreach(lc, clauseset->indexclauses[indexcol]) |
| 2618 |
{ |
| 2619 |
iclause = (IndexClause *) lfirst(lc); |
| 2620 |
|
| 2621 |
if (iclause->rinfo == rinfo) |
| 2622 |
return; |
| 2623 |
} |
| 2624 |
|
| 2625 |
/* OK, try to match the clause to the index column */ |
| 2626 |
iclause = match_clause_to_indexcol(root, |
| 2627 |
rinfo, |
| 2628 |
indexcol, |
| 2629 |
index); |
| 2630 |
if (iclause) |
| 2631 |
{ |
| 2632 |
/* Success, so record it */ |
| 2633 |
clauseset->indexclauses[indexcol] = |
| 2634 |
lappend(clauseset->indexclauses[indexcol], iclause); |
| 2635 |
clauseset->nonempty = true; |
| 2636 |
return; |
| 2637 |
} |
| 2638 |
} |
| 2639 |
} |
| 2640 |
|
| 2641 |
/* |
| 2642 |
* match_clause_to_indexcol() |
| 2643 |
* Determine whether a restriction clause matches a column of an index, |
| 2644 |
* and if so, build an IndexClause node describing the details. |
| 2645 |
* |
| 2646 |
* To match an index normally, an operator clause: |
| 2647 |
* |
| 2648 |
* (1) must be in the form (indexkey op const) or (const op indexkey); |
| 2649 |
* and |
| 2650 |
* (2) must contain an operator which is in the index's operator family |
| 2651 |
* for this column; and |
| 2652 |
* (3) must match the collation of the index, if collation is relevant. |
| 2653 |
* |
| 2654 |
* Our definition of "const" is exceedingly liberal: we allow anything that |
| 2655 |
* doesn't involve a volatile function or a Var of the index's relation. |
| 2656 |
* In particular, Vars belonging to other relations of the query are |
| 2657 |
* accepted here, since a clause of that form can be used in a |
| 2658 |
* parameterized indexscan. It's the responsibility of higher code levels |
| 2659 |
* to manage restriction and join clauses appropriately. |
| 2660 |
* |
| 2661 |
* Note: we do need to check for Vars of the index's relation on the |
| 2662 |
* "const" side of the clause, since clauses like (a.f1 OP (b.f2 OP a.f3)) |
| 2663 |
* are not processable by a parameterized indexscan on a.f1, whereas |
| 2664 |
* something like (a.f1 OP (b.f2 OP c.f3)) is. |
| 2665 |
* |
| 2666 |
* Presently, the executor can only deal with indexquals that have the |
| 2667 |
* indexkey on the left, so we can only use clauses that have the indexkey |
| 2668 |
* on the right if we can commute the clause to put the key on the left. |
| 2669 |
* We handle that by generating an IndexClause with the correctly-commuted |
| 2670 |
* opclause as a derived indexqual. |
| 2671 |
* |
| 2672 |
* If the index has a collation, the clause must have the same collation. |
| 2673 |
* For collation-less indexes, we assume it doesn't matter; this is |
| 2674 |
* necessary for cases like "hstore ? text", wherein hstore's operators |
| 2675 |
* don't care about collation but the clause will get marked with a |
| 2676 |
* collation anyway because of the text argument. (This logic is |
| 2677 |
* embodied in the macro IndexCollMatchesExprColl.) |
| 2678 |
* |
| 2679 |
* It is also possible to match RowCompareExpr clauses to indexes (but |
| 2680 |
* currently, only btree indexes handle this). |
| 2681 |
* |
| 2682 |
* It is also possible to match ScalarArrayOpExpr clauses to indexes, when |
| 2683 |
* the clause is of the form "indexkey op ANY (arrayconst)". |
| 2684 |
* |
| 2685 |
* It is also possible to match a list of OR clauses if it might be |
| 2686 |
* transformed into a single ScalarArrayOpExpr clause. On success, |
| 2687 |
* the returning index clause will contain a transformed clause. |
| 2688 |
* |
| 2689 |
* For boolean indexes, it is also possible to match the clause directly |
| 2690 |
* to the indexkey; or perhaps the clause is (NOT indexkey). |
| 2691 |
* |
| 2692 |
* And, last but not least, some operators and functions can be processed |
| 2693 |
* to derive (typically lossy) indexquals from a clause that isn't in |
| 2694 |
* itself indexable. If we see that any operand of an OpExpr or FuncExpr |
| 2695 |
* matches the index key, and the function has a planner support function |
| 2696 |
* attached to it, we'll invoke the support function to see if such an |
| 2697 |
* indexqual can be built. |
| 2698 |
* |
| 2699 |
* 'rinfo' is the clause to be tested (as a RestrictInfo node). |
| 2700 |
* 'indexcol' is a column number of 'index' (counting from 0). |
| 2701 |
* 'index' is the index of interest. |
| 2702 |
* |
| 2703 |
* Returns an IndexClause if the clause can be used with this index key, |
| 2704 |
* or NULL if not. |
| 2705 |
* |
| 2706 |
* NOTE: This routine always returns NULL if the clause is an AND clause. |
| 2707 |
* Higher-level routines deal with OR and AND clauses. OR clause can be |
| 2708 |
* matched as a whole by match_orclause_to_indexcol() though. |
| 2709 |
*/ |
| 2710 |
static IndexClause * |
| 2711 |
match_clause_to_indexcol(PlannerInfo *root, |
| 2712 |
RestrictInfo *rinfo, |
| 2713 |
int indexcol, |
| 2714 |
IndexOptInfo *index) |
| 2715 |
{ |
| 2716 |
IndexClause *iclause; |
| 2717 |
Expr *clause = rinfo->clause; |
| 2718 |
Oid opfamily; |
| 2719 |
|
| 2720 |
Assert(indexcol < index->nkeycolumns); |
| 2721 |
|
| 2722 |
/* |
| 2723 |
* Historically this code has coped with NULL clauses. That's probably |
| 2724 |
* not possible anymore, but we might as well continue to cope. |
| 2725 |
*/ |
| 2726 |
if (clause == NULL) |
| 2727 |
return NULL; |
| 2728 |
|
| 2729 |
/* First check for boolean-index cases. */ |
| 2730 |
opfamily = index->opfamily[indexcol]; |
| 2731 |
if (IsBooleanOpfamily(opfamily)) |
| 2732 |
{ |
| 2733 |
iclause = match_boolean_index_clause(root, rinfo, indexcol, index); |
| 2734 |
if (iclause) |
| 2735 |
return iclause; |
| 2736 |
} |
| 2737 |
|
| 2738 |
/* |
| 2739 |
* Clause must be an opclause, funcclause, ScalarArrayOpExpr, |
| 2740 |
* RowCompareExpr, or OR-clause that could be converted to SAOP. Or, if |
| 2741 |
* the index supports it, we can handle IS NULL/NOT NULL clauses. |
| 2742 |
*/ |
| 2743 |
if (IsA(clause, OpExpr)) |
| 2744 |
{ |
| 2745 |
return match_opclause_to_indexcol(root, rinfo, indexcol, index); |
| 2746 |
} |
| 2747 |
else if (IsA(clause, FuncExpr)) |
| 2748 |
{ |
| 2749 |
return match_funcclause_to_indexcol(root, rinfo, indexcol, index); |
| 2750 |
} |
| 2751 |
else if (IsA(clause, ScalarArrayOpExpr)) |
| 2752 |
{ |
| 2753 |
return match_saopclause_to_indexcol(root, rinfo, indexcol, index); |
| 2754 |
} |
| 2755 |
else if (IsA(clause, RowCompareExpr)) |
| 2756 |
{ |
| 2757 |
return match_rowcompare_to_indexcol(root, rinfo, indexcol, index); |
| 2758 |
} |
| 2759 |
else if (restriction_is_or_clause(rinfo)) |
| 2760 |
{ |
| 2761 |
return match_orclause_to_indexcol(root, rinfo, indexcol, index); |
| 2762 |
} |
| 2763 |
else if (index->amsearchnulls && IsA(clause, NullTest)) |
| 2764 |
{ |
| 2765 |
NullTest *nt = (NullTest *) clause; |
| 2766 |
|
| 2767 |
if (!nt->argisrow && |
| 2768 |
match_index_to_operand((Node *) nt->arg, indexcol, index)) |
| 2769 |
{ |
| 2770 |
iclause = makeNode(IndexClause); |
| 2771 |
iclause->rinfo = rinfo; |
| 2772 |
iclause->indexquals = list_make1(rinfo); |
| 2773 |
iclause->lossy = false; |
| 2774 |
iclause->indexcol = indexcol; |
| 2775 |
iclause->indexcols = NIL; |
| 2776 |
return iclause; |
| 2777 |
} |
| 2778 |
} |
| 2779 |
|
| 2780 |
return NULL; |
| 2781 |
} |
| 2782 |
|
| 2783 |
/* |
| 2784 |
* IsBooleanOpfamily |
| 2785 |
* Detect whether an opfamily supports boolean equality as an operator. |
| 2786 |
* |
| 2787 |
* If the opfamily OID is in the range of built-in objects, we can rely |
| 2788 |
* on hard-wired knowledge of which built-in opfamilies support this. |
| 2789 |
* For extension opfamilies, there's no choice but to do a catcache lookup. |
| 2790 |
*/ |
| 2791 |
static bool |
| 2792 |
IsBooleanOpfamily(Oid opfamily) |
| 2793 |
{ |
| 2794 |
if (opfamily < FirstNormalObjectId) |
| 2795 |
return IsBuiltinBooleanOpfamily(opfamily); |
| 2796 |
else |
| 2797 |
return op_in_opfamily(BooleanEqualOperator, opfamily); |
| 2798 |
} |
| 2799 |
|
| 2800 |
/* |
| 2801 |
* match_boolean_index_clause |
| 2802 |
* Recognize restriction clauses that can be matched to a boolean index. |
| 2803 |
* |
| 2804 |
* The idea here is that, for an index on a boolean column that supports the |
| 2805 |
* BooleanEqualOperator, we can transform a plain reference to the indexkey |
| 2806 |
* into "indexkey = true", or "NOT indexkey" into "indexkey = false", etc, |
| 2807 |
* so as to make the expression indexable using the index's "=" operator. |
| 2808 |
* Since Postgres 8.1, we must do this because constant simplification does |
| 2809 |
* the reverse transformation; without this code there'd be no way to use |
| 2810 |
* such an index at all. |
| 2811 |
* |
| 2812 |
* This should be called only when IsBooleanOpfamily() recognizes the |
| 2813 |
* index's operator family. We check to see if the clause matches the |
| 2814 |
* index's key, and if so, build a suitable IndexClause. |
| 2815 |
*/ |
| 2816 |
static IndexClause * |
| 2817 |
match_boolean_index_clause(PlannerInfo *root, |
| 2818 |
RestrictInfo *rinfo, |
| 2819 |
int indexcol, |
| 2820 |
IndexOptInfo *index) |
| 2821 |
{ |
| 2822 |
Node *clause = (Node *) rinfo->clause; |
| 2823 |
Expr *op = NULL; |
| 2824 |
|
| 2825 |
/* Direct match? */ |
| 2826 |
if (match_index_to_operand(clause, indexcol, index)) |
| 2827 |
{ |
| 2828 |
/* convert to indexkey = TRUE */ |
| 2829 |
op = make_opclause(BooleanEqualOperator, BOOLOID, false, |
| 2830 |
(Expr *) clause, |
| 2831 |
(Expr *) makeBoolConst(true, false), |
| 2832 |
InvalidOid, InvalidOid); |
| 2833 |
} |
| 2834 |
/* NOT clause? */ |
| 2835 |
else if (is_notclause(clause)) |
| 2836 |
{ |
| 2837 |
Node *arg = (Node *) get_notclausearg((Expr *) clause); |
| 2838 |
|
| 2839 |
if (match_index_to_operand(arg, indexcol, index)) |
| 2840 |
{ |
| 2841 |
/* convert to indexkey = FALSE */ |
| 2842 |
op = make_opclause(BooleanEqualOperator, BOOLOID, false, |
| 2843 |
(Expr *) arg, |
| 2844 |
(Expr *) makeBoolConst(false, false), |
| 2845 |
InvalidOid, InvalidOid); |
| 2846 |
} |
| 2847 |
} |
| 2848 |
|
| 2849 |
/* |
| 2850 |
* Since we only consider clauses at top level of WHERE, we can convert |
| 2851 |
* indexkey IS TRUE and indexkey IS FALSE to index searches as well. The |
| 2852 |
* different meaning for NULL isn't important. |
| 2853 |
*/ |
| 2854 |
else if (clause && IsA(clause, BooleanTest)) |
| 2855 |
{ |
| 2856 |
BooleanTest *btest = (BooleanTest *) clause; |
| 2857 |
Node *arg = (Node *) btest->arg; |
| 2858 |
|
| 2859 |
if (btest->booltesttype == IS_TRUE && |
| 2860 |
match_index_to_operand(arg, indexcol, index)) |
| 2861 |
{ |
| 2862 |
/* convert to indexkey = TRUE */ |
| 2863 |
op = make_opclause(BooleanEqualOperator, BOOLOID, false, |
| 2864 |
(Expr *) arg, |
| 2865 |
(Expr *) makeBoolConst(true, false), |
| 2866 |
InvalidOid, InvalidOid); |
| 2867 |
} |
| 2868 |
else if (btest->booltesttype == IS_FALSE && |
| 2869 |
match_index_to_operand(arg, indexcol, index)) |
| 2870 |
{ |
| 2871 |
/* convert to indexkey = FALSE */ |
| 2872 |
op = make_opclause(BooleanEqualOperator, BOOLOID, false, |
| 2873 |
(Expr *) arg, |
| 2874 |
(Expr *) makeBoolConst(false, false), |
| 2875 |
InvalidOid, InvalidOid); |
| 2876 |
} |
| 2877 |
} |
| 2878 |
|
| 2879 |
/* |
| 2880 |
* If we successfully made an operator clause from the given qual, we must |
| 2881 |
* wrap it in an IndexClause. It's not lossy. |
| 2882 |
*/ |
| 2883 |
if (op) |
| 2884 |
{ |
| 2885 |
IndexClause *iclause = makeNode(IndexClause); |
| 2886 |
|
| 2887 |
iclause->rinfo = rinfo; |
| 2888 |
iclause->indexquals = list_make1(make_simple_restrictinfo(root, op)); |
| 2889 |
iclause->lossy = false; |
| 2890 |
iclause->indexcol = indexcol; |
| 2891 |
iclause->indexcols = NIL; |
| 2892 |
return iclause; |
| 2893 |
} |
| 2894 |
|
| 2895 |
return NULL; |
| 2896 |
} |
| 2897 |
|
| 2898 |
/* |
| 2899 |
* match_opclause_to_indexcol() |
| 2900 |
* Handles the OpExpr case for match_clause_to_indexcol(), |
| 2901 |
* which see for comments. |
| 2902 |
*/ |
| 2903 |
static IndexClause * |
| 2904 |
match_opclause_to_indexcol(PlannerInfo *root, |
| 2905 |
RestrictInfo *rinfo, |
| 2906 |
int indexcol, |
| 2907 |
IndexOptInfo *index) |
| 2908 |
{ |
| 2909 |
IndexClause *iclause; |
| 2910 |
OpExpr *clause = (OpExpr *) rinfo->clause; |
| 2911 |
Node *leftop, |
| 2912 |
*rightop; |
| 2913 |
Oid expr_op; |
| 2914 |
Oid expr_coll; |
| 2915 |
Index index_relid; |
| 2916 |
Oid opfamily; |
| 2917 |
Oid idxcollation; |
| 2918 |
|
| 2919 |
/* |
| 2920 |
* Only binary operators need apply. (In theory, a planner support |
| 2921 |
* function could do something with a unary operator, but it seems |
| 2922 |
* unlikely to be worth the cycles to check.) |
| 2923 |
*/ |
| 2924 |
if (list_length(clause->args) != 2) |
| 2925 |
return NULL; |
| 2926 |
|
| 2927 |
leftop = (Node *) linitial(clause->args); |
| 2928 |
rightop = (Node *) lsecond(clause->args); |
| 2929 |
expr_op = clause->opno; |
| 2930 |
expr_coll = clause->inputcollid; |
| 2931 |
|
| 2932 |
index_relid = index->rel->relid; |
| 2933 |
opfamily = index->opfamily[indexcol]; |
| 2934 |
idxcollation = index->indexcollations[indexcol]; |
| 2935 |
|
| 2936 |
/* |
| 2937 |
* Check for clauses of the form: (indexkey operator constant) or |
| 2938 |
* (constant operator indexkey). See match_clause_to_indexcol's notes |
| 2939 |
* about const-ness. |
| 2940 |
* |
| 2941 |
* Note that we don't ask the support function about clauses that don't |
| 2942 |
* have one of these forms. Again, in principle it might be possible to |
| 2943 |
* do something, but it seems unlikely to be worth the cycles to check. |
| 2944 |
*/ |
| 2945 |
if (match_index_to_operand(leftop, indexcol, index) && |
| 2946 |
!bms_is_member(index_relid, rinfo->right_relids) && |
| 2947 |
!contain_volatile_functions(rightop)) |
| 2948 |
{ |
| 2949 |
if (IndexCollMatchesExprColl(idxcollation, expr_coll) && |
| 2950 |
op_in_opfamily(expr_op, opfamily)) |
| 2951 |
{ |
| 2952 |
iclause = makeNode(IndexClause); |
| 2953 |
iclause->rinfo = rinfo; |
| 2954 |
iclause->indexquals = list_make1(rinfo); |
| 2955 |
iclause->lossy = false; |
| 2956 |
iclause->indexcol = indexcol; |
| 2957 |
iclause->indexcols = NIL; |
| 2958 |
return iclause; |
| 2959 |
} |
| 2960 |
|
| 2961 |
/* |
| 2962 |
* If we didn't find a member of the index's opfamily, try the support |
| 2963 |
* function for the operator's underlying function. |
| 2964 |
*/ |
| 2965 |
set_opfuncid(clause); /* make sure we have opfuncid */ |
| 2966 |
return get_index_clause_from_support(root, |
| 2967 |
rinfo, |
| 2968 |
clause->opfuncid, |
| 2969 |
0, /* indexarg on left */ |
| 2970 |
indexcol, |
| 2971 |
index); |
| 2972 |
} |
| 2973 |
|
| 2974 |
if (match_index_to_operand(rightop, indexcol, index) && |
| 2975 |
!bms_is_member(index_relid, rinfo->left_relids) && |
| 2976 |
!contain_volatile_functions(leftop)) |
| 2977 |
{ |
| 2978 |
if (IndexCollMatchesExprColl(idxcollation, expr_coll)) |
| 2979 |
{ |
| 2980 |
Oid comm_op = get_commutator(expr_op); |
| 2981 |
|
| 2982 |
if (OidIsValid(comm_op) && |
| 2983 |
op_in_opfamily(comm_op, opfamily)) |
| 2984 |
{ |
| 2985 |
RestrictInfo *commrinfo; |
| 2986 |
|
| 2987 |
/* Build a commuted OpExpr and RestrictInfo */ |
| 2988 |
commrinfo = commute_restrictinfo(rinfo, comm_op); |
| 2989 |
|
| 2990 |
/* Make an IndexClause showing that as a derived qual */ |
| 2991 |
iclause = makeNode(IndexClause); |
| 2992 |
iclause->rinfo = rinfo; |
| 2993 |
iclause->indexquals = list_make1(commrinfo); |
| 2994 |
iclause->lossy = false; |
| 2995 |
iclause->indexcol = indexcol; |
| 2996 |
iclause->indexcols = NIL; |
| 2997 |
return iclause; |
| 2998 |
} |
| 2999 |
} |
| 3000 |
|
| 3001 |
/* |
| 3002 |
* If we didn't find a member of the index's opfamily, try the support |
| 3003 |
* function for the operator's underlying function. |
| 3004 |
*/ |
| 3005 |
set_opfuncid(clause); /* make sure we have opfuncid */ |
| 3006 |
return get_index_clause_from_support(root, |
| 3007 |
rinfo, |
| 3008 |
clause->opfuncid, |
| 3009 |
1, /* indexarg on right */ |
| 3010 |
indexcol, |
| 3011 |
index); |
| 3012 |
} |
| 3013 |
|
| 3014 |
return NULL; |
| 3015 |
} |
| 3016 |
|
| 3017 |
/* |
| 3018 |
* match_funcclause_to_indexcol() |
| 3019 |
* Handles the FuncExpr case for match_clause_to_indexcol(), |
| 3020 |
* which see for comments. |
| 3021 |
*/ |
| 3022 |
static IndexClause * |
| 3023 |
match_funcclause_to_indexcol(PlannerInfo *root, |
| 3024 |
RestrictInfo *rinfo, |
| 3025 |
int indexcol, |
| 3026 |
IndexOptInfo *index) |
| 3027 |
{ |
| 3028 |
FuncExpr *clause = (FuncExpr *) rinfo->clause; |
| 3029 |
int indexarg; |
| 3030 |
ListCell *lc; |
| 3031 |
|
| 3032 |
/* |
| 3033 |
* We have no built-in intelligence about function clauses, but if there's |
| 3034 |
* a planner support function, it might be able to do something. But, to |
| 3035 |
* cut down on wasted planning cycles, only call the support function if |
| 3036 |
* at least one argument matches the target index column. |
| 3037 |
* |
| 3038 |
* Note that we don't insist on the other arguments being pseudoconstants; |
| 3039 |
* the support function has to check that. This is to allow cases where |
| 3040 |
* only some of the other arguments need to be included in the indexqual. |
| 3041 |
*/ |
| 3042 |
indexarg = 0; |
| 3043 |
foreach(lc, clause->args) |
| 3044 |
{ |
| 3045 |
Node *op = (Node *) lfirst(lc); |
| 3046 |
|
| 3047 |
if (match_index_to_operand(op, indexcol, index)) |
| 3048 |
{ |
| 3049 |
return get_index_clause_from_support(root, |
| 3050 |
rinfo, |
| 3051 |
clause->funcid, |
| 3052 |
indexarg, |
| 3053 |
indexcol, |
| 3054 |
index); |
| 3055 |
} |
| 3056 |
|
| 3057 |
indexarg++; |
| 3058 |
} |
| 3059 |
|
| 3060 |
return NULL; |
| 3061 |
} |
| 3062 |
|
| 3063 |
/* |
| 3064 |
* get_index_clause_from_support() |
| 3065 |
* If the function has a planner support function, try to construct |
| 3066 |
* an IndexClause using indexquals created by the support function. |
| 3067 |
*/ |
| 3068 |
static IndexClause * |
| 3069 |
get_index_clause_from_support(PlannerInfo *root, |
| 3070 |
RestrictInfo *rinfo, |
| 3071 |
Oid funcid, |
| 3072 |
int indexarg, |
| 3073 |
int indexcol, |
| 3074 |
IndexOptInfo *index) |
| 3075 |
{ |
| 3076 |
Oid prosupport = get_func_support(funcid); |
| 3077 |
SupportRequestIndexCondition req; |
| 3078 |
List *sresult; |
| 3079 |
|
| 3080 |
if (!OidIsValid(prosupport)) |
| 3081 |
return NULL; |
| 3082 |
|
| 3083 |
req.type = T_SupportRequestIndexCondition; |
| 3084 |
req.root = root; |
| 3085 |
req.funcid = funcid; |
| 3086 |
req.node = (Node *) rinfo->clause; |
| 3087 |
req.indexarg = indexarg; |
| 3088 |
req.index = index; |
| 3089 |
req.indexcol = indexcol; |
| 3090 |
req.opfamily = index->opfamily[indexcol]; |
| 3091 |
req.indexcollation = index->indexcollations[indexcol]; |
| 3092 |
|
| 3093 |
req.lossy = true; /* default assumption */ |
| 3094 |
|
| 3095 |
sresult = (List *) |
| 3096 |
DatumGetPointer(OidFunctionCall1(prosupport, |
| 3097 |
PointerGetDatum(&req))); |
| 3098 |
|
| 3099 |
if (sresult != NIL) |
| 3100 |
{ |
| 3101 |
IndexClause *iclause = makeNode(IndexClause); |
| 3102 |
List *indexquals = NIL; |
| 3103 |
ListCell *lc; |
| 3104 |
|
| 3105 |
/* |
| 3106 |
* The support function API says it should just give back bare |
| 3107 |
* clauses, so here we must wrap each one in a RestrictInfo. |
| 3108 |
*/ |
| 3109 |
foreach(lc, sresult) |
| 3110 |
{ |
| 3111 |
Expr *clause = (Expr *) lfirst(lc); |
| 3112 |
|
| 3113 |
indexquals = lappend(indexquals, |
| 3114 |
make_simple_restrictinfo(root, clause)); |
| 3115 |
} |
| 3116 |
|
| 3117 |
iclause->rinfo = rinfo; |
| 3118 |
iclause->indexquals = indexquals; |
| 3119 |
iclause->lossy = req.lossy; |
| 3120 |
iclause->indexcol = indexcol; |
| 3121 |
iclause->indexcols = NIL; |
| 3122 |
|
| 3123 |
return iclause; |
| 3124 |
} |
| 3125 |
|
| 3126 |
return NULL; |
| 3127 |
} |
| 3128 |
|
| 3129 |
/* |
| 3130 |
* match_saopclause_to_indexcol() |
| 3131 |
* Handles the ScalarArrayOpExpr case for match_clause_to_indexcol(), |
| 3132 |
* which see for comments. |
| 3133 |
*/ |
| 3134 |
static IndexClause * |
| 3135 |
match_saopclause_to_indexcol(PlannerInfo *root, |
| 3136 |
RestrictInfo *rinfo, |
| 3137 |
int indexcol, |
| 3138 |
IndexOptInfo *index) |
| 3139 |
{ |
| 3140 |
ScalarArrayOpExpr *saop = (ScalarArrayOpExpr *) rinfo->clause; |
| 3141 |
Node *leftop, |
| 3142 |
*rightop; |
| 3143 |
Relids right_relids; |
| 3144 |
Oid expr_op; |
| 3145 |
Oid expr_coll; |
| 3146 |
Index index_relid; |
| 3147 |
Oid opfamily; |
| 3148 |
Oid idxcollation; |
| 3149 |
|
| 3150 |
/* We only accept ANY clauses, not ALL */ |
| 3151 |
if (!saop->useOr) |
| 3152 |
return NULL; |
| 3153 |
leftop = (Node *) linitial(saop->args); |
| 3154 |
rightop = (Node *) lsecond(saop->args); |
| 3155 |
right_relids = pull_varnos(root, rightop); |
| 3156 |
expr_op = saop->opno; |
| 3157 |
expr_coll = saop->inputcollid; |
| 3158 |
|
| 3159 |
index_relid = index->rel->relid; |
| 3160 |
opfamily = index->opfamily[indexcol]; |
| 3161 |
idxcollation = index->indexcollations[indexcol]; |
| 3162 |
|
| 3163 |
/* |
| 3164 |
* We must have indexkey on the left and a pseudo-constant array argument. |
| 3165 |
*/ |
| 3166 |
if (match_index_to_operand(leftop, indexcol, index) && |
| 3167 |
!bms_is_member(index_relid, right_relids) && |
| 3168 |
!contain_volatile_functions(rightop)) |
| 3169 |
{ |
| 3170 |
if (IndexCollMatchesExprColl(idxcollation, expr_coll) && |
| 3171 |
op_in_opfamily(expr_op, opfamily)) |
| 3172 |
{ |
| 3173 |
IndexClause *iclause = makeNode(IndexClause); |
| 3174 |
|
| 3175 |
iclause->rinfo = rinfo; |
| 3176 |
iclause->indexquals = list_make1(rinfo); |
| 3177 |
iclause->lossy = false; |
| 3178 |
iclause->indexcol = indexcol; |
| 3179 |
iclause->indexcols = NIL; |
| 3180 |
return iclause; |
| 3181 |
} |
| 3182 |
|
| 3183 |
/* |
| 3184 |
* We do not currently ask support functions about ScalarArrayOpExprs, |
| 3185 |
* though in principle we could. |
| 3186 |
*/ |
| 3187 |
} |
| 3188 |
|
| 3189 |
return NULL; |
| 3190 |
} |
| 3191 |
|
| 3192 |
/* |
| 3193 |
* match_rowcompare_to_indexcol() |
| 3194 |
* Handles the RowCompareExpr case for match_clause_to_indexcol(), |
| 3195 |
* which see for comments. |
| 3196 |
* |
| 3197 |
* In this routine we check whether the first column of the row comparison |
| 3198 |
* matches the target index column. This is sufficient to guarantee that some |
| 3199 |
* index condition can be constructed from the RowCompareExpr --- the rest |
| 3200 |
* is handled by expand_indexqual_rowcompare(). |
| 3201 |
*/ |
| 3202 |
static IndexClause * |
| 3203 |
match_rowcompare_to_indexcol(PlannerInfo *root, |
| 3204 |
RestrictInfo *rinfo, |
| 3205 |
int indexcol, |
| 3206 |
IndexOptInfo *index) |
| 3207 |
{ |
| 3208 |
RowCompareExpr *clause = (RowCompareExpr *) rinfo->clause; |
| 3209 |
Index index_relid; |
| 3210 |
Oid opfamily; |
| 3211 |
Oid idxcollation; |
| 3212 |
Node *leftop, |
| 3213 |
*rightop; |
| 3214 |
bool var_on_left; |
| 3215 |
Oid expr_op; |
| 3216 |
Oid expr_coll; |
| 3217 |
|
| 3218 |
/* Forget it if we're not dealing with a btree index */ |
| 3219 |
if (index->relam != BTREE_AM_OID) |
| 3220 |
return NULL; |
| 3221 |
|
| 3222 |
index_relid = index->rel->relid; |
| 3223 |
opfamily = index->opfamily[indexcol]; |
| 3224 |
idxcollation = index->indexcollations[indexcol]; |
| 3225 |
|
| 3226 |
/* |
| 3227 |
* We could do the matching on the basis of insisting that the opfamily |
| 3228 |
* shown in the RowCompareExpr be the same as the index column's opfamily, |
| 3229 |
* but that could fail in the presence of reverse-sort opfamilies: it'd be |
| 3230 |
* a matter of chance whether RowCompareExpr had picked the forward or |
| 3231 |
* reverse-sort family. So look only at the operator, and match if it is |
| 3232 |
* a member of the index's opfamily (after commutation, if the indexkey is |
| 3233 |
* on the right). We'll worry later about whether any additional |
| 3234 |
* operators are matchable to the index. |
| 3235 |
*/ |
| 3236 |
leftop = (Node *) linitial(clause->largs); |
| 3237 |
rightop = (Node *) linitial(clause->rargs); |
| 3238 |
expr_op = linitial_oid(clause->opnos); |
| 3239 |
expr_coll = linitial_oid(clause->inputcollids); |
| 3240 |
|
| 3241 |
/* Collations must match, if relevant */ |
| 3242 |
if (!IndexCollMatchesExprColl(idxcollation, expr_coll)) |
| 3243 |
return NULL; |
| 3244 |
|
| 3245 |
/* |
| 3246 |
* These syntactic tests are the same as in match_opclause_to_indexcol() |
| 3247 |
*/ |
| 3248 |
if (match_index_to_operand(leftop, indexcol, index) && |
| 3249 |
!bms_is_member(index_relid, pull_varnos(root, rightop)) && |
| 3250 |
!contain_volatile_functions(rightop)) |
| 3251 |
{ |
| 3252 |
/* OK, indexkey is on left */ |
| 3253 |
var_on_left = true; |
| 3254 |
} |
| 3255 |
else if (match_index_to_operand(rightop, indexcol, index) && |
| 3256 |
!bms_is_member(index_relid, pull_varnos(root, leftop)) && |
| 3257 |
!contain_volatile_functions(leftop)) |
| 3258 |
{ |
| 3259 |
/* indexkey is on right, so commute the operator */ |
| 3260 |
expr_op = get_commutator(expr_op); |
| 3261 |
if (expr_op == InvalidOid) |
| 3262 |
return NULL; |
| 3263 |
var_on_left = false; |
| 3264 |
} |
| 3265 |
else |
| 3266 |
return NULL; |
| 3267 |
|
| 3268 |
/* We're good if the operator is the right type of opfamily member */ |
| 3269 |
switch (get_op_opfamily_strategy(expr_op, opfamily)) |
| 3270 |
{ |
| 3271 |
case BTLessStrategyNumber: |
| 3272 |
case BTLessEqualStrategyNumber: |
| 3273 |
case BTGreaterEqualStrategyNumber: |
| 3274 |
case BTGreaterStrategyNumber: |
| 3275 |
return expand_indexqual_rowcompare(root, |
| 3276 |
rinfo, |
| 3277 |
indexcol, |
| 3278 |
index, |
| 3279 |
expr_op, |
| 3280 |
var_on_left); |
| 3281 |
} |
| 3282 |
|
| 3283 |
return NULL; |
| 3284 |
} |
| 3285 |
|
| 3286 |
/* |
| 3287 |
* match_orclause_to_indexcol() |
| 3288 |
* Handles the OR-expr case for match_clause_to_indexcol() in the case |
| 3289 |
* when it could be transformed to ScalarArrayOpExpr. |
| 3290 |
* |
| 3291 |
* In this routine, we attempt to transform a list of OR-clause args into a |
| 3292 |
* single SAOP expression matching the target index column. On success, |
| 3293 |
* return an IndexClause containing the transformed expression. |
| 3294 |
* Return NULL if the transformation fails. |
| 3295 |
*/ |
| 3296 |
static IndexClause * |
| 3297 |
match_orclause_to_indexcol(PlannerInfo *root, |
| 3298 |
RestrictInfo *rinfo, |
| 3299 |
int indexcol, |
| 3300 |
IndexOptInfo *index) |
| 3301 |
{ |
| 3302 |
BoolExpr *orclause = (BoolExpr *) rinfo->orclause; |
| 3303 |
List *consts = NIL; |
| 3304 |
Node *indexExpr = NULL; |
| 3305 |
Oid matchOpno = InvalidOid; |
| 3306 |
Oid consttype = InvalidOid; |
| 3307 |
Oid arraytype = InvalidOid; |
| 3308 |
Oid inputcollid = InvalidOid; |
| 3309 |
bool firstTime = true; |
| 3310 |
bool haveNonConst = false; |
| 3311 |
Index indexRelid = index->rel->relid; |
| 3312 |
ScalarArrayOpExpr *saopexpr; |
| 3313 |
IndexClause *iclause; |
| 3314 |
ListCell *lc; |
| 3315 |
|
| 3316 |
/* Forget it if index doesn't support SAOP clauses */ |
| 3317 |
if (!index->amsearcharray) |
| 3318 |
return NULL; |
| 3319 |
|
| 3320 |
/* |
| 3321 |
* Try to convert a list of OR-clauses to a single SAOP expression. Each |
| 3322 |
* OR entry must be in the form: (indexkey operator constant) or (constant |
| 3323 |
* operator indexkey). Operators of all the entries must match. On |
| 3324 |
* discovery of anything unsupported, we give up by breaking out of the |
| 3325 |
* loop immediately and returning NULL. |
| 3326 |
*/ |
| 3327 |
foreach(lc, orclause->args) |
| 3328 |
{ |
| 3329 |
RestrictInfo *subRinfo = (RestrictInfo *) lfirst(lc); |
| 3330 |
OpExpr *subClause; |
| 3331 |
Oid opno; |
| 3332 |
Node *leftop, |
| 3333 |
*rightop; |
| 3334 |
Node *constExpr; |
| 3335 |
|
| 3336 |
/* If it's not a RestrictInfo (i.e. it's a sub-AND), we can't use it */ |
| 3337 |
if (!IsA(subRinfo, RestrictInfo)) |
| 3338 |
break; |
| 3339 |
|
| 3340 |
/* Only operator clauses can match */ |
| 3341 |
if (!IsA(subRinfo->clause, OpExpr)) |
| 3342 |
break; |
| 3343 |
|
| 3344 |
subClause = (OpExpr *) subRinfo->clause; |
| 3345 |
opno = subClause->opno; |
| 3346 |
|
| 3347 |
/* Only binary operators can match */ |
| 3348 |
if (list_length(subClause->args) != 2) |
| 3349 |
break; |
| 3350 |
|
| 3351 |
/* |
| 3352 |
* Check for clauses of the form: (indexkey operator constant) or |
| 3353 |
* (constant operator indexkey). These tests should agree with |
| 3354 |
* match_opclause_to_indexcol. |
| 3355 |
*/ |
| 3356 |
leftop = (Node *) linitial(subClause->args); |
| 3357 |
rightop = (Node *) lsecond(subClause->args); |
| 3358 |
if (match_index_to_operand(leftop, indexcol, index) && |
| 3359 |
!bms_is_member(indexRelid, subRinfo->right_relids) && |
| 3360 |
!contain_volatile_functions(rightop)) |
| 3361 |
{ |
| 3362 |
indexExpr = leftop; |
| 3363 |
constExpr = rightop; |
| 3364 |
} |
| 3365 |
else if (match_index_to_operand(rightop, indexcol, index) && |
| 3366 |
!bms_is_member(indexRelid, subRinfo->left_relids) && |
| 3367 |
!contain_volatile_functions(leftop)) |
| 3368 |
{ |
| 3369 |
opno = get_commutator(opno); |
| 3370 |
if (!OidIsValid(opno)) |
| 3371 |
{ |
| 3372 |
/* commutator doesn't exist, we can't reverse the order */ |
| 3373 |
break; |
| 3374 |
} |
| 3375 |
indexExpr = rightop; |
| 3376 |
constExpr = leftop; |
| 3377 |
} |
| 3378 |
else |
| 3379 |
{ |
| 3380 |
break; |
| 3381 |
} |
| 3382 |
|
| 3383 |
/* |
| 3384 |
* Save information about the operator, type, and collation for the |
| 3385 |
* first matching qual. Then, check that subsequent quals match the |
| 3386 |
* first. |
| 3387 |
*/ |
| 3388 |
if (firstTime) |
| 3389 |
{ |
| 3390 |
matchOpno = opno; |
| 3391 |
consttype = exprType(constExpr); |
| 3392 |
arraytype = get_array_type(consttype); |
| 3393 |
inputcollid = subClause->inputcollid; |
| 3394 |
|
| 3395 |
/* |
| 3396 |
* Check that the operator is presented in the opfamily and that |
| 3397 |
* the expression collation matches the index collation. Also, |
| 3398 |
* there must be an array type to construct an array later. |
| 3399 |
*/ |
| 3400 |
if (!IndexCollMatchesExprColl(index->indexcollations[indexcol], |
| 3401 |
inputcollid) || |
| 3402 |
!op_in_opfamily(matchOpno, index->opfamily[indexcol]) || |
| 3403 |
!OidIsValid(arraytype)) |
| 3404 |
break; |
| 3405 |
|
| 3406 |
/* |
| 3407 |
* Disallow if either type is RECORD, mainly because we can't be |
| 3408 |
* positive that all the RHS expressions are the same record type. |
| 3409 |
*/ |
| 3410 |
if (consttype == RECORDOID || exprType(indexExpr) == RECORDOID) |
| 3411 |
break; |
| 3412 |
|
| 3413 |
firstTime = false; |
| 3414 |
} |
| 3415 |
else |
| 3416 |
{ |
| 3417 |
if (matchOpno != opno || |
| 3418 |
inputcollid != subClause->inputcollid || |
| 3419 |
consttype != exprType(constExpr)) |
| 3420 |
break; |
| 3421 |
} |
| 3422 |
|
| 3423 |
/* |
| 3424 |
* The righthand inputs don't necessarily have to be plain Consts, but |
| 3425 |
* make_SAOP_expr needs to know if any are not. |
| 3426 |
*/ |
| 3427 |
if (!IsA(constExpr, Const)) |
| 3428 |
haveNonConst = true; |
| 3429 |
|
| 3430 |
consts = lappend(consts, constExpr); |
| 3431 |
} |
| 3432 |
|
| 3433 |
/* |
| 3434 |
* Handle failed conversion from breaking out of the loop because of an |
| 3435 |
* unsupported qual. Also check that we have an indexExpr, just in case |
| 3436 |
* the OR list was somehow empty (it shouldn't be). Return NULL to |
| 3437 |
* indicate the conversion failed. |
| 3438 |
*/ |
| 3439 |
if (lc != NULL || indexExpr == NULL) |
| 3440 |
{ |
| 3441 |
list_free(consts); /* might as well */ |
| 3442 |
return NULL; |
| 3443 |
} |
| 3444 |
|
| 3445 |
/* |
| 3446 |
* Build the new SAOP node. We use the indexExpr from the last OR arm; |
| 3447 |
* since all the arms passed match_index_to_operand, it shouldn't matter |
| 3448 |
* which one we use. But using "inputcollid" twice is a bit of a cheat: |
| 3449 |
* we might end up with an array Const node that is labeled with a |
| 3450 |
* collation despite its elements being of a noncollatable type. But |
| 3451 |
* nothing is likely to complain about that, so we don't bother being more |
| 3452 |
* accurate. |
| 3453 |
*/ |
| 3454 |
saopexpr = make_SAOP_expr(matchOpno, indexExpr, consttype, inputcollid, |
| 3455 |
inputcollid, consts, haveNonConst); |
| 3456 |
Assert(saopexpr != NULL); |
| 3457 |
|
| 3458 |
/* |
| 3459 |
* Finally, build an IndexClause based on the SAOP node. It's not lossy. |
| 3460 |
*/ |
| 3461 |
iclause = makeNode(IndexClause); |
| 3462 |
iclause->rinfo = rinfo; |
| 3463 |
iclause->indexquals = list_make1(make_simple_restrictinfo(root, |
| 3464 |
(Expr *) saopexpr)); |
| 3465 |
iclause->lossy = false; |
| 3466 |
iclause->indexcol = indexcol; |
| 3467 |
iclause->indexcols = NIL; |
| 3468 |
return iclause; |
| 3469 |
} |
| 3470 |
|
| 3471 |
/* |
| 3472 |
* expand_indexqual_rowcompare --- expand a single indexqual condition |
| 3473 |
* that is a RowCompareExpr |
| 3474 |
* |
| 3475 |
* It's already known that the first column of the row comparison matches |
| 3476 |
* the specified column of the index. We can use additional columns of the |
| 3477 |
* row comparison as index qualifications, so long as they match the index |
| 3478 |
* in the "same direction", ie, the indexkeys are all on the same side of the |
| 3479 |
* clause and the operators are all the same-type members of the opfamilies. |
| 3480 |
* |
| 3481 |
* If all the columns of the RowCompareExpr match in this way, we just use it |
| 3482 |
* as-is, except for possibly commuting it to put the indexkeys on the left. |
| 3483 |
* |
| 3484 |
* Otherwise, we build a shortened RowCompareExpr (if more than one |
| 3485 |
* column matches) or a simple OpExpr (if the first-column match is all |
| 3486 |
* there is). In these cases the modified clause is always "<=" or ">=" |
| 3487 |
* even when the original was "<" or ">" --- this is necessary to match all |
| 3488 |
* the rows that could match the original. (We are building a lossy version |
| 3489 |
* of the row comparison when we do this, so we set lossy = true.) |
| 3490 |
* |
| 3491 |
* Note: this is really just the last half of match_rowcompare_to_indexcol, |
| 3492 |
* but we split it out for comprehensibility. |
| 3493 |
*/ |
| 3494 |
static IndexClause * |
| 3495 |
expand_indexqual_rowcompare(PlannerInfo *root, |
| 3496 |
RestrictInfo *rinfo, |
| 3497 |
int indexcol, |
| 3498 |
IndexOptInfo *index, |
| 3499 |
Oid expr_op, |
| 3500 |
bool var_on_left) |
| 3501 |
{ |
| 3502 |
IndexClause *iclause = makeNode(IndexClause); |
| 3503 |
RowCompareExpr *clause = (RowCompareExpr *) rinfo->clause; |
| 3504 |
int op_strategy; |
| 3505 |
Oid op_lefttype; |
| 3506 |
Oid op_righttype; |
| 3507 |
int matching_cols; |
| 3508 |
List *expr_ops; |
| 3509 |
List *opfamilies; |
| 3510 |
List *lefttypes; |
| 3511 |
List *righttypes; |
| 3512 |
List *new_ops; |
| 3513 |
List *var_args; |
| 3514 |
List *non_var_args; |
| 3515 |
|
| 3516 |
iclause->rinfo = rinfo; |
| 3517 |
iclause->indexcol = indexcol; |
| 3518 |
|
| 3519 |
if (var_on_left) |
| 3520 |
{ |
| 3521 |
var_args = clause->largs; |
| 3522 |
non_var_args = clause->rargs; |
| 3523 |
} |
| 3524 |
else |
| 3525 |
{ |
| 3526 |
var_args = clause->rargs; |
| 3527 |
non_var_args = clause->largs; |
| 3528 |
} |
| 3529 |
|
| 3530 |
get_op_opfamily_properties(expr_op, index->opfamily[indexcol], false, |
| 3531 |
&op_strategy, |
| 3532 |
&op_lefttype, |
| 3533 |
&op_righttype); |
| 3534 |
|
| 3535 |
/* Initialize returned list of which index columns are used */ |
| 3536 |
iclause->indexcols = list_make1_int(indexcol); |
| 3537 |
|
| 3538 |
/* Build lists of ops, opfamilies and operator datatypes in case needed */ |
| 3539 |
expr_ops = list_make1_oid(expr_op); |
| 3540 |
opfamilies = list_make1_oid(index->opfamily[indexcol]); |
| 3541 |
lefttypes = list_make1_oid(op_lefttype); |
| 3542 |
righttypes = list_make1_oid(op_righttype); |
| 3543 |
|
| 3544 |
/* |
| 3545 |
* See how many of the remaining columns match some index column in the |
| 3546 |
* same way. As in match_clause_to_indexcol(), the "other" side of any |
| 3547 |
* potential index condition is OK as long as it doesn't use Vars from the |
| 3548 |
* indexed relation. |
| 3549 |
*/ |
| 3550 |
matching_cols = 1; |
| 3551 |
|
| 3552 |
while (matching_cols < list_length(var_args)) |
| 3553 |
{ |
| 3554 |
Node *varop = (Node *) list_nth(var_args, matching_cols); |
| 3555 |
Node *constop = (Node *) list_nth(non_var_args, matching_cols); |
| 3556 |
int i; |
| 3557 |
|
| 3558 |
expr_op = list_nth_oid(clause->opnos, matching_cols); |
| 3559 |
if (!var_on_left) |
| 3560 |
{ |
| 3561 |
/* indexkey is on right, so commute the operator */ |
| 3562 |
expr_op = get_commutator(expr_op); |
| 3563 |
if (expr_op == InvalidOid) |
| 3564 |
break; /* operator is not usable */ |
| 3565 |
} |
| 3566 |
if (bms_is_member(index->rel->relid, pull_varnos(root, constop))) |
| 3567 |
break; /* no good, Var on wrong side */ |
| 3568 |
if (contain_volatile_functions(constop)) |
| 3569 |
break; /* no good, volatile comparison value */ |
| 3570 |
|
| 3571 |
/* |
| 3572 |
* The Var side can match any key column of the index. |
| 3573 |
*/ |
| 3574 |
for (i = 0; i < index->nkeycolumns; i++) |
| 3575 |
{ |
| 3576 |
if (match_index_to_operand(varop, i, index) && |
| 3577 |
get_op_opfamily_strategy(expr_op, |
| 3578 |
index->opfamily[i]) == op_strategy && |
| 3579 |
IndexCollMatchesExprColl(index->indexcollations[i], |
| 3580 |
list_nth_oid(clause->inputcollids, |
| 3581 |
matching_cols))) |
| 3582 |
break; |
| 3583 |
} |
| 3584 |
if (i >= index->nkeycolumns) |
| 3585 |
break; /* no match found */ |
| 3586 |
|
| 3587 |
/* Add column number to returned list */ |
| 3588 |
iclause->indexcols = lappend_int(iclause->indexcols, i); |
| 3589 |
|
| 3590 |
/* Add operator info to lists */ |
| 3591 |
get_op_opfamily_properties(expr_op, index->opfamily[i], false, |
| 3592 |
&op_strategy, |
| 3593 |
&op_lefttype, |
| 3594 |
&op_righttype); |
| 3595 |
expr_ops = lappend_oid(expr_ops, expr_op); |
| 3596 |
opfamilies = lappend_oid(opfamilies, index->opfamily[i]); |
| 3597 |
lefttypes = lappend_oid(lefttypes, op_lefttype); |
| 3598 |
righttypes = lappend_oid(righttypes, op_righttype); |
| 3599 |
|
| 3600 |
/* This column matches, keep scanning */ |
| 3601 |
matching_cols++; |
| 3602 |
} |
| 3603 |
|
| 3604 |
/* Result is non-lossy if all columns are usable as index quals */ |
| 3605 |
iclause->lossy = (matching_cols != list_length(clause->opnos)); |
| 3606 |
|
| 3607 |
/* |
| 3608 |
* We can use rinfo->clause as-is if we have var on left and it's all |
| 3609 |
* usable as index quals. |
| 3610 |
*/ |
| 3611 |
if (var_on_left && !iclause->lossy) |
| 3612 |
iclause->indexquals = list_make1(rinfo); |
| 3613 |
else |
| 3614 |
{ |
| 3615 |
/* |
| 3616 |
* We have to generate a modified rowcompare (possibly just one |
| 3617 |
* OpExpr). The painful part of this is changing < to <= or > to >=, |
| 3618 |
* so deal with that first. |
| 3619 |
*/ |
| 3620 |
if (!iclause->lossy) |
| 3621 |
{ |
| 3622 |
/* very easy, just use the commuted operators */ |
| 3623 |
new_ops = expr_ops; |
| 3624 |
} |
| 3625 |
else if (op_strategy == BTLessEqualStrategyNumber || |
| 3626 |
op_strategy == BTGreaterEqualStrategyNumber) |
| 3627 |
{ |
| 3628 |
/* easy, just use the same (possibly commuted) operators */ |
| 3629 |
new_ops = list_truncate(expr_ops, matching_cols); |
| 3630 |
} |
| 3631 |
else |
| 3632 |
{ |
| 3633 |
ListCell *opfamilies_cell; |
| 3634 |
ListCell *lefttypes_cell; |
| 3635 |
ListCell *righttypes_cell; |
| 3636 |
|
| 3637 |
if (op_strategy == BTLessStrategyNumber) |
| 3638 |
op_strategy = BTLessEqualStrategyNumber; |
| 3639 |
else if (op_strategy == BTGreaterStrategyNumber) |
| 3640 |
op_strategy = BTGreaterEqualStrategyNumber; |
| 3641 |
else |
| 3642 |
elog(ERROR, "unexpected strategy number %d", op_strategy); |
| 3643 |
new_ops = NIL; |
| 3644 |
forthree(opfamilies_cell, opfamilies, |
| 3645 |
lefttypes_cell, lefttypes, |
| 3646 |
righttypes_cell, righttypes) |
| 3647 |
{ |
| 3648 |
Oid opfam = lfirst_oid(opfamilies_cell); |
| 3649 |
Oid lefttype = lfirst_oid(lefttypes_cell); |
| 3650 |
Oid righttype = lfirst_oid(righttypes_cell); |
| 3651 |
|
| 3652 |
expr_op = get_opfamily_member(opfam, lefttype, righttype, |
| 3653 |
op_strategy); |
| 3654 |
if (!OidIsValid(expr_op)) /* should not happen */ |
| 3655 |
elog(ERROR, "missing operator %d(%u,%u) in opfamily %u", |
| 3656 |
op_strategy, lefttype, righttype, opfam); |
| 3657 |
new_ops = lappend_oid(new_ops, expr_op); |
| 3658 |
} |
| 3659 |
} |
| 3660 |
|
| 3661 |
/* If we have more than one matching col, create a subset rowcompare */ |
| 3662 |
if (matching_cols > 1) |
| 3663 |
{ |
| 3664 |
RowCompareExpr *rc = makeNode(RowCompareExpr); |
| 3665 |
|
| 3666 |
rc->cmptype = (CompareType) op_strategy; |
| 3667 |
rc->opnos = new_ops; |
| 3668 |
rc->opfamilies = list_copy_head(clause->opfamilies, |
| 3669 |
matching_cols); |
| 3670 |
rc->inputcollids = list_copy_head(clause->inputcollids, |
| 3671 |
matching_cols); |
| 3672 |
rc->largs = list_copy_head(var_args, matching_cols); |
| 3673 |
rc->rargs = list_copy_head(non_var_args, matching_cols); |
| 3674 |
iclause->indexquals = list_make1(make_simple_restrictinfo(root, |
| 3675 |
(Expr *) rc)); |
| 3676 |
} |
| 3677 |
else |
| 3678 |
{ |
| 3679 |
Expr *op; |
| 3680 |
|
| 3681 |
/* We don't report an index column list in this case */ |
| 3682 |
iclause->indexcols = NIL; |
| 3683 |
|
| 3684 |
op = make_opclause(linitial_oid(new_ops), BOOLOID, false, |
| 3685 |
copyObject(linitial(var_args)), |
| 3686 |
copyObject(linitial(non_var_args)), |
| 3687 |
InvalidOid, |
| 3688 |
linitial_oid(clause->inputcollids)); |
| 3689 |
iclause->indexquals = list_make1(make_simple_restrictinfo(root, op)); |
| 3690 |
} |
| 3691 |
} |
| 3692 |
|
| 3693 |
return iclause; |
| 3694 |
} |
| 3695 |
|
| 3696 |
|
| 3697 |
/**************************************************************************** |
| 3698 |
* ---- ROUTINES TO CHECK ORDERING OPERATORS ---- |
| 3699 |
****************************************************************************/ |
| 3700 |
|
| 3701 |
/* |
| 3702 |
* match_pathkeys_to_index |
| 3703 |
* For the given 'index' and 'pathkeys', output a list of suitable ORDER |
| 3704 |
* BY expressions, each of the form "indexedcol operator pseudoconstant", |
| 3705 |
* along with an integer list of the index column numbers (zero based) |
| 3706 |
* that each clause would be used with. |
| 3707 |
* |
| 3708 |
* This attempts to find an ORDER BY and index column number for all items in |
| 3709 |
* the pathkey list, however, if we're unable to match any given pathkey to an |
| 3710 |
* index column, we return just the ones matched by the function so far. This |
| 3711 |
* allows callers who are interested in partial matches to get them. Callers |
| 3712 |
* can determine a partial match vs a full match by checking the outputted |
| 3713 |
* list lengths. A full match will have one item in the output lists for each |
| 3714 |
* item in the given 'pathkeys' list. |
| 3715 |
*/ |
| 3716 |
static void |
| 3717 |
match_pathkeys_to_index(IndexOptInfo *index, List *pathkeys, |
| 3718 |
List **orderby_clauses_p, |
| 3719 |
List **clause_columns_p) |
| 3720 |
{ |
| 3721 |
ListCell *lc1; |
| 3722 |
|
| 3723 |
*orderby_clauses_p = NIL; /* set default results */ |
| 3724 |
*clause_columns_p = NIL; |
| 3725 |
|
| 3726 |
/* Only indexes with the amcanorderbyop property are interesting here */ |
| 3727 |
if (!index->amcanorderbyop) |
| 3728 |
return; |
| 3729 |
|
| 3730 |
foreach(lc1, pathkeys) |
| 3731 |
{ |
| 3732 |
PathKey *pathkey = (PathKey *) lfirst(lc1); |
| 3733 |
bool found = false; |
| 3734 |
EquivalenceMemberIterator it; |
| 3735 |
EquivalenceMember *member; |
| 3736 |
|
| 3737 |
|
| 3738 |
/* Pathkey must request default sort order for the target opfamily */ |
| 3739 |
if (pathkey->pk_cmptype != COMPARE_LT || pathkey->pk_nulls_first) |
| 3740 |
return; |
| 3741 |
|
| 3742 |
/* If eclass is volatile, no hope of using an indexscan */ |
| 3743 |
if (pathkey->pk_eclass->ec_has_volatile) |
| 3744 |
return; |
| 3745 |
|
| 3746 |
/* |
| 3747 |
* Try to match eclass member expression(s) to index. Note that child |
| 3748 |
* EC members are considered, but only when they belong to the target |
| 3749 |
* relation. (Unlike regular members, the same expression could be a |
| 3750 |
* child member of more than one EC. Therefore, the same index could |
| 3751 |
* be considered to match more than one pathkey list, which is OK |
| 3752 |
* here. See also get_eclass_for_sort_expr.) |
| 3753 |
*/ |
| 3754 |
setup_eclass_member_iterator(&it, pathkey->pk_eclass, |
| 3755 |
index->rel->relids); |
| 3756 |
while ((member = eclass_member_iterator_next(&it)) != NULL) |
| 3757 |
{ |
| 3758 |
int indexcol; |
| 3759 |
|
| 3760 |
/* No possibility of match if it references other relations */ |
| 3761 |
if (!bms_equal(member->em_relids, index->rel->relids)) |
| 3762 |
continue; |
| 3763 |
|
| 3764 |
/* |
| 3765 |
* We allow any column of the index to match each pathkey; they |
| 3766 |
* don't have to match left-to-right as you might expect. This is |
| 3767 |
* correct for GiST, and it doesn't matter for SP-GiST because |
| 3768 |
* that doesn't handle multiple columns anyway, and no other |
| 3769 |
* existing AMs support amcanorderbyop. We might need different |
| 3770 |
* logic in future for other implementations. |
| 3771 |
*/ |
| 3772 |
for (indexcol = 0; indexcol < index->nkeycolumns; indexcol++) |
| 3773 |
{ |
| 3774 |
Expr *expr; |
| 3775 |
|
| 3776 |
expr = match_clause_to_ordering_op(index, |
| 3777 |
indexcol, |
| 3778 |
member->em_expr, |
| 3779 |
pathkey->pk_opfamily); |
| 3780 |
if (expr) |
| 3781 |
{ |
| 3782 |
*orderby_clauses_p = lappend(*orderby_clauses_p, expr); |
| 3783 |
*clause_columns_p = lappend_int(*clause_columns_p, indexcol); |
| 3784 |
found = true; |
| 3785 |
break; |
| 3786 |
} |
| 3787 |
} |
| 3788 |
|
| 3789 |
if (found) /* don't want to look at remaining members */ |
| 3790 |
break; |
| 3791 |
} |
| 3792 |
|
| 3793 |
/* |
| 3794 |
* Return the matches found so far when this pathkey couldn't be |
| 3795 |
* matched to the index. |
| 3796 |
*/ |
| 3797 |
if (!found) |
| 3798 |
return; |
| 3799 |
} |
| 3800 |
} |
| 3801 |
|
| 3802 |
/* |
| 3803 |
* match_clause_to_ordering_op |
| 3804 |
* Determines whether an ordering operator expression matches an |
| 3805 |
* index column. |
| 3806 |
* |
| 3807 |
* This is similar to, but simpler than, match_clause_to_indexcol. |
| 3808 |
* We only care about simple OpExpr cases. The input is a bare |
| 3809 |
* expression that is being ordered by, which must be of the form |
| 3810 |
* (indexkey op const) or (const op indexkey) where op is an ordering |
| 3811 |
* operator for the column's opfamily. |
| 3812 |
* |
| 3813 |
* 'index' is the index of interest. |
| 3814 |
* 'indexcol' is a column number of 'index' (counting from 0). |
| 3815 |
* 'clause' is the ordering expression to be tested. |
| 3816 |
* 'pk_opfamily' is the btree opfamily describing the required sort order. |
| 3817 |
* |
| 3818 |
* Note that we currently do not consider the collation of the ordering |
| 3819 |
* operator's result. In practical cases the result type will be numeric |
| 3820 |
* and thus have no collation, and it's not very clear what to match to |
| 3821 |
* if it did have a collation. The index's collation should match the |
| 3822 |
* ordering operator's input collation, not its result. |
| 3823 |
* |
| 3824 |
* If successful, return 'clause' as-is if the indexkey is on the left, |
| 3825 |
* otherwise a commuted copy of 'clause'. If no match, return NULL. |
| 3826 |
*/ |
| 3827 |
static Expr * |
| 3828 |
match_clause_to_ordering_op(IndexOptInfo *index, |
| 3829 |
int indexcol, |
| 3830 |
Expr *clause, |
| 3831 |
Oid pk_opfamily) |
| 3832 |
{ |
| 3833 |
Oid opfamily; |
| 3834 |
Oid idxcollation; |
| 3835 |
Node *leftop, |
| 3836 |
*rightop; |
| 3837 |
Oid expr_op; |
| 3838 |
Oid expr_coll; |
| 3839 |
Oid sortfamily; |
| 3840 |
bool commuted; |
| 3841 |
|
| 3842 |
Assert(indexcol < index->nkeycolumns); |
| 3843 |
|
| 3844 |
opfamily = index->opfamily[indexcol]; |
| 3845 |
idxcollation = index->indexcollations[indexcol]; |
| 3846 |
|
| 3847 |
/* |
| 3848 |
* Clause must be a binary opclause. |
| 3849 |
*/ |
| 3850 |
if (!is_opclause(clause)) |
| 3851 |
return NULL; |
| 3852 |
leftop = get_leftop(clause); |
| 3853 |
rightop = get_rightop(clause); |
| 3854 |
if (!leftop || !rightop) |
| 3855 |
return NULL; |
| 3856 |
expr_op = ((OpExpr *) clause)->opno; |
| 3857 |
expr_coll = ((OpExpr *) clause)->inputcollid; |
| 3858 |
|
| 3859 |
/* |
| 3860 |
* We can forget the whole thing right away if wrong collation. |
| 3861 |
*/ |
| 3862 |
if (!IndexCollMatchesExprColl(idxcollation, expr_coll)) |
| 3863 |
return NULL; |
| 3864 |
|
| 3865 |
/* |
| 3866 |
* Check for clauses of the form: (indexkey operator constant) or |
| 3867 |
* (constant operator indexkey). |
| 3868 |
*/ |
| 3869 |
if (match_index_to_operand(leftop, indexcol, index) && |
| 3870 |
!contain_var_clause(rightop) && |
| 3871 |
!contain_volatile_functions(rightop)) |
| 3872 |
{ |
| 3873 |
commuted = false; |
| 3874 |
} |
| 3875 |
else if (match_index_to_operand(rightop, indexcol, index) && |
| 3876 |
!contain_var_clause(leftop) && |
| 3877 |
!contain_volatile_functions(leftop)) |
| 3878 |
{ |
| 3879 |
/* Might match, but we need a commuted operator */ |
| 3880 |
expr_op = get_commutator(expr_op); |
| 3881 |
if (expr_op == InvalidOid) |
| 3882 |
return NULL; |
| 3883 |
commuted = true; |
| 3884 |
} |
| 3885 |
else |
| 3886 |
return NULL; |
| 3887 |
|
| 3888 |
/* |
| 3889 |
* Is the (commuted) operator an ordering operator for the opfamily? And |
| 3890 |
* if so, does it yield the right sorting semantics? |
| 3891 |
*/ |
| 3892 |
sortfamily = get_op_opfamily_sortfamily(expr_op, opfamily); |
| 3893 |
if (sortfamily != pk_opfamily) |
| 3894 |
return NULL; |
| 3895 |
|
| 3896 |
/* We have a match. Return clause or a commuted version thereof. */ |
| 3897 |
if (commuted) |
| 3898 |
{ |
| 3899 |
OpExpr *newclause = makeNode(OpExpr); |
| 3900 |
|
| 3901 |
/* flat-copy all the fields of clause */ |
| 3902 |
memcpy(newclause, clause, sizeof(OpExpr)); |
| 3903 |
|
| 3904 |
/* commute it */ |
| 3905 |
newclause->opno = expr_op; |
| 3906 |
newclause->opfuncid = InvalidOid; |
| 3907 |
newclause->args = list_make2(rightop, leftop); |
| 3908 |
|
| 3909 |
clause = (Expr *) newclause; |
| 3910 |
} |
| 3911 |
|
| 3912 |
return clause; |
| 3913 |
} |
| 3914 |
|
| 3915 |
|
| 3916 |
/**************************************************************************** |
| 3917 |
* ---- ROUTINES TO DO PARTIAL INDEX PREDICATE TESTS ---- |
| 3918 |
****************************************************************************/ |
| 3919 |
|
| 3920 |
/* |
| 3921 |
* check_index_predicates |
| 3922 |
* Set the predicate-derived IndexOptInfo fields for each index |
| 3923 |
* of the specified relation. |
| 3924 |
* |
| 3925 |
* predOK is set true if the index is partial and its predicate is satisfied |
| 3926 |
* for this query, ie the query's WHERE clauses imply the predicate. |
| 3927 |
* |
| 3928 |
* indrestrictinfo is set to the relation's baserestrictinfo list less any |
| 3929 |
* conditions that are implied by the index's predicate. (Obviously, for a |
| 3930 |
* non-partial index, this is the same as baserestrictinfo.) Such conditions |
| 3931 |
* can be dropped from the plan when using the index, in certain cases. |
| 3932 |
* |
| 3933 |
* At one time it was possible for this to get re-run after adding more |
| 3934 |
* restrictions to the rel, thus possibly letting us prove more indexes OK. |
| 3935 |
* That doesn't happen any more (at least not in the core code's usage), |
| 3936 |
* but this code still supports it in case extensions want to mess with the |
| 3937 |
* baserestrictinfo list. We assume that adding more restrictions can't make |
| 3938 |
* an index not predOK. We must recompute indrestrictinfo each time, though, |
| 3939 |
* to make sure any newly-added restrictions get into it if needed. |
| 3940 |
*/ |
| 3941 |
void |
| 3942 |
check_index_predicates(PlannerInfo *root, RelOptInfo *rel) |
| 3943 |
{ |
| 3944 |
List *clauselist; |
| 3945 |
bool have_partial; |
| 3946 |
bool is_target_rel; |
| 3947 |
Relids otherrels; |
| 3948 |
ListCell *lc; |
| 3949 |
|
| 3950 |
/* Indexes are available only on base or "other" member relations. */ |
| 3951 |
Assert(IS_SIMPLE_REL(rel)); |
| 3952 |
|
| 3953 |
/* |
| 3954 |
* Initialize the indrestrictinfo lists to be identical to |
| 3955 |
* baserestrictinfo, and check whether there are any partial indexes. If |
| 3956 |
* not, this is all we need to do. |
| 3957 |
*/ |
| 3958 |
have_partial = false; |
| 3959 |
foreach(lc, rel->indexlist) |
| 3960 |
{ |
| 3961 |
IndexOptInfo *index = (IndexOptInfo *) lfirst(lc); |
| 3962 |
|
| 3963 |
index->indrestrictinfo = rel->baserestrictinfo; |
| 3964 |
if (index->indpred) |
| 3965 |
have_partial = true; |
| 3966 |
} |
| 3967 |
if (!have_partial) |
| 3968 |
return; |
| 3969 |
|
| 3970 |
/* |
| 3971 |
* Construct a list of clauses that we can assume true for the purpose of |
| 3972 |
* proving the index(es) usable. Restriction clauses for the rel are |
| 3973 |
* always usable, and so are any join clauses that are "movable to" this |
| 3974 |
* rel. Also, we can consider any EC-derivable join clauses (which must |
| 3975 |
* be "movable to" this rel, by definition). |
| 3976 |
*/ |
| 3977 |
clauselist = list_copy(rel->baserestrictinfo); |
| 3978 |
|
| 3979 |
/* Scan the rel's join clauses */ |
| 3980 |
foreach(lc, rel->joininfo) |
| 3981 |
{ |
| 3982 |
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc); |
| 3983 |
|
| 3984 |
/* Check if clause can be moved to this rel */ |
| 3985 |
if (!join_clause_is_movable_to(rinfo, rel)) |
| 3986 |
continue; |
| 3987 |
|
| 3988 |
clauselist = lappend(clauselist, rinfo); |
| 3989 |
} |
| 3990 |
|
| 3991 |
/* |
| 3992 |
* Add on any equivalence-derivable join clauses. Computing the correct |
| 3993 |
* relid sets for generate_join_implied_equalities is slightly tricky |
| 3994 |
* because the rel could be a child rel rather than a true baserel, and in |
| 3995 |
* that case we must subtract its parents' relid(s) from all_query_rels. |
| 3996 |
* Additionally, we mustn't consider clauses that are only computable |
| 3997 |
* after outer joins that can null the rel. |
| 3998 |
*/ |
| 3999 |
if (rel->reloptkind == RELOPT_OTHER_MEMBER_REL) |
| 4000 |
otherrels = bms_difference(root->all_query_rels, |
| 4001 |
find_childrel_parents(root, rel)); |
| 4002 |
else |
| 4003 |
otherrels = bms_difference(root->all_query_rels, rel->relids); |
| 4004 |
otherrels = bms_del_members(otherrels, rel->nulling_relids); |
| 4005 |
|
| 4006 |
if (!bms_is_empty(otherrels)) |
| 4007 |
clauselist = |
| 4008 |
list_concat(clauselist, |
| 4009 |
generate_join_implied_equalities(root, |
| 4010 |
bms_union(rel->relids, |
| 4011 |
otherrels), |
| 4012 |
otherrels, |
| 4013 |
rel, |
| 4014 |
NULL)); |
| 4015 |
|
| 4016 |
/* |
| 4017 |
* Normally we remove quals that are implied by a partial index's |
| 4018 |
* predicate from indrestrictinfo, indicating that they need not be |
| 4019 |
* checked explicitly by an indexscan plan using this index. However, if |
| 4020 |
* the rel is a target relation of UPDATE/DELETE/MERGE/SELECT FOR UPDATE, |
| 4021 |
* we cannot remove such quals from the plan, because they need to be in |
| 4022 |
* the plan so that they will be properly rechecked by EvalPlanQual |
| 4023 |
* testing. Some day we might want to remove such quals from the main |
| 4024 |
* plan anyway and pass them through to EvalPlanQual via a side channel; |
| 4025 |
* but for now, we just don't remove implied quals at all for target |
| 4026 |
* relations. |
| 4027 |
*/ |
| 4028 |
is_target_rel = (bms_is_member(rel->relid, root->all_result_relids) || |
| 4029 |
get_plan_rowmark(root->rowMarks, rel->relid) != NULL); |
| 4030 |
|
| 4031 |
/* |
| 4032 |
* Now try to prove each index predicate true, and compute the |
| 4033 |
* indrestrictinfo lists for partial indexes. Note that we compute the |
| 4034 |
* indrestrictinfo list even for non-predOK indexes; this might seem |
| 4035 |
* wasteful, but we may be able to use such indexes in OR clauses, cf |
| 4036 |
* generate_bitmap_or_paths(). |
| 4037 |
*/ |
| 4038 |
foreach(lc, rel->indexlist) |
| 4039 |
{ |
| 4040 |
IndexOptInfo *index = (IndexOptInfo *) lfirst(lc); |
| 4041 |
ListCell *lcr; |
| 4042 |
|
| 4043 |
if (index->indpred == NIL) |
| 4044 |
continue; /* ignore non-partial indexes here */ |
| 4045 |
|
| 4046 |
if (!index->predOK) /* don't repeat work if already proven OK */ |
| 4047 |
index->predOK = predicate_implied_by(index->indpred, clauselist, |
| 4048 |
false); |
| 4049 |
|
| 4050 |
/* If rel is an update target, leave indrestrictinfo as set above */ |
| 4051 |
if (is_target_rel) |
| 4052 |
continue; |
| 4053 |
|
| 4054 |
/* |
| 4055 |
* If index is !amoptionalkey, also leave indrestrictinfo as set |
| 4056 |
* above. Otherwise we risk removing all quals for the first index |
| 4057 |
* key and then not being able to generate an indexscan at all. It |
| 4058 |
* would be better to be more selective, but we've not yet identified |
| 4059 |
* which if any of the quals match the first index key. |
| 4060 |
*/ |
| 4061 |
if (!index->amoptionalkey) |
| 4062 |
continue; |
| 4063 |
|
| 4064 |
/* Else compute indrestrictinfo as the non-implied quals */ |
| 4065 |
index->indrestrictinfo = NIL; |
| 4066 |
foreach(lcr, rel->baserestrictinfo) |
| 4067 |
{ |
| 4068 |
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lcr); |
| 4069 |
|
| 4070 |
/* predicate_implied_by() assumes first arg is immutable */ |
| 4071 |
if (contain_mutable_functions((Node *) rinfo->clause) || |
| 4072 |
!predicate_implied_by(list_make1(rinfo->clause), |
| 4073 |
index->indpred, false)) |
| 4074 |
index->indrestrictinfo = lappend(index->indrestrictinfo, rinfo); |
| 4075 |
} |
| 4076 |
} |
| 4077 |
} |
| 4078 |
|
| 4079 |
/**************************************************************************** |
| 4080 |
* ---- ROUTINES TO CHECK EXTERNALLY-VISIBLE CONDITIONS ---- |
| 4081 |
****************************************************************************/ |
| 4082 |
|
| 4083 |
/* |
| 4084 |
* ec_member_matches_indexcol |
| 4085 |
* Test whether an EquivalenceClass member matches an index column. |
| 4086 |
* |
| 4087 |
* This is a callback for use by generate_implied_equalities_for_column. |
| 4088 |
*/ |
| 4089 |
static bool |
| 4090 |
ec_member_matches_indexcol(PlannerInfo *root, RelOptInfo *rel, |
| 4091 |
EquivalenceClass *ec, EquivalenceMember *em, |
| 4092 |
void *arg) |
| 4093 |
{ |
| 4094 |
IndexOptInfo *index = ((ec_member_matches_arg *) arg)->index; |
| 4095 |
int indexcol = ((ec_member_matches_arg *) arg)->indexcol; |
| 4096 |
Oid curFamily; |
| 4097 |
Oid curCollation; |
| 4098 |
|
| 4099 |
Assert(indexcol < index->nkeycolumns); |
| 4100 |
|
| 4101 |
curFamily = index->opfamily[indexcol]; |
| 4102 |
curCollation = index->indexcollations[indexcol]; |
| 4103 |
|
| 4104 |
/* |
| 4105 |
* If it's a btree index, we can reject it if its opfamily isn't |
| 4106 |
* compatible with the EC, since no clause generated from the EC could be |
| 4107 |
* used with the index. For non-btree indexes, we can't easily tell |
| 4108 |
* whether clauses generated from the EC could be used with the index, so |
| 4109 |
* don't check the opfamily. This might mean we return "true" for a |
| 4110 |
* useless EC, so we have to recheck the results of |
| 4111 |
* generate_implied_equalities_for_column; see |
| 4112 |
* match_eclass_clauses_to_index. |
| 4113 |
*/ |
| 4114 |
if (index->relam == BTREE_AM_OID && |
| 4115 |
!list_member_oid(ec->ec_opfamilies, curFamily)) |
| 4116 |
return false; |
| 4117 |
|
| 4118 |
/* We insist on collation match for all index types, though */ |
| 4119 |
if (!IndexCollMatchesExprColl(curCollation, ec->ec_collation)) |
| 4120 |
return false; |
| 4121 |
|
| 4122 |
return match_index_to_operand((Node *) em->em_expr, indexcol, index); |
| 4123 |
} |
| 4124 |
|
| 4125 |
/* |
| 4126 |
* relation_has_unique_index_for |
| 4127 |
* Determine whether the relation provably has at most one row satisfying |
| 4128 |
* a set of equality conditions, because the conditions constrain all |
| 4129 |
* columns of some unique index. |
| 4130 |
* |
| 4131 |
* The conditions can be represented in either or both of two ways: |
| 4132 |
* 1. A list of RestrictInfo nodes, where the caller has already determined |
| 4133 |
* that each condition is a mergejoinable equality with an expression in |
| 4134 |
* this relation on one side, and an expression not involving this relation |
| 4135 |
* on the other. The transient outer_is_left flag is used to identify which |
| 4136 |
* side we should look at: left side if outer_is_left is false, right side |
| 4137 |
* if it is true. |
| 4138 |
* 2. A list of expressions in this relation, and a corresponding list of |
| 4139 |
* equality operators. The caller must have already checked that the operators |
| 4140 |
* represent equality. (Note: the operators could be cross-type; the |
| 4141 |
* expressions should correspond to their RHS inputs.) |
| 4142 |
* |
| 4143 |
* The caller need only supply equality conditions arising from joins; |
| 4144 |
* this routine automatically adds in any usable baserestrictinfo clauses. |
| 4145 |
* (Note that the passed-in restrictlist will be destructively modified!) |
| 4146 |
*/ |
| 4147 |
bool |
| 4148 |
relation_has_unique_index_for(PlannerInfo *root, RelOptInfo *rel, |
| 4149 |
List *restrictlist, |
| 4150 |
List *exprlist, List *oprlist) |
| 4151 |
{ |
| 4152 |
return relation_has_unique_index_ext(root, rel, restrictlist, |
| 4153 |
exprlist, oprlist, NULL); |
| 4154 |
} |
| 4155 |
|
| 4156 |
/* |
| 4157 |
* relation_has_unique_index_ext |
| 4158 |
* Same as relation_has_unique_index_for(), but supports extra_clauses |
| 4159 |
* parameter. If extra_clauses isn't NULL, return baserestrictinfo clauses |
| 4160 |
* which were used to derive uniqueness. |
| 4161 |
*/ |
| 4162 |
bool |
| 4163 |
relation_has_unique_index_ext(PlannerInfo *root, RelOptInfo *rel, |
| 4164 |
List *restrictlist, |
| 4165 |
List *exprlist, List *oprlist, |
| 4166 |
List **extra_clauses) |
| 4167 |
{ |
| 4168 |
ListCell *ic; |
| 4169 |
|
| 4170 |
Assert(list_length(exprlist) == list_length(oprlist)); |
| 4171 |
|
| 4172 |
/* Short-circuit if no indexes... */ |
| 4173 |
if (rel->indexlist == NIL) |
| 4174 |
return false; |
| 4175 |
|
| 4176 |
/* |
| 4177 |
* Examine the rel's restriction clauses for usable var = const clauses |
| 4178 |
* that we can add to the restrictlist. |
| 4179 |
*/ |
| 4180 |
foreach(ic, rel->baserestrictinfo) |
| 4181 |
{ |
| 4182 |
RestrictInfo *restrictinfo = (RestrictInfo *) lfirst(ic); |
| 4183 |
|
| 4184 |
/* |
| 4185 |
* Note: can_join won't be set for a restriction clause, but |
| 4186 |
* mergeopfamilies will be if it has a mergejoinable operator and |
| 4187 |
* doesn't contain volatile functions. |
| 4188 |
*/ |
| 4189 |
if (restrictinfo->mergeopfamilies == NIL) |
| 4190 |
continue; /* not mergejoinable */ |
| 4191 |
|
| 4192 |
/* |
| 4193 |
* The clause certainly doesn't refer to anything but the given rel. |
| 4194 |
* If either side is pseudoconstant then we can use it. |
| 4195 |
*/ |
| 4196 |
if (bms_is_empty(restrictinfo->left_relids)) |
| 4197 |
{ |
| 4198 |
/* righthand side is inner */ |
| 4199 |
restrictinfo->outer_is_left = true; |
| 4200 |
} |
| 4201 |
else if (bms_is_empty(restrictinfo->right_relids)) |
| 4202 |
{ |
| 4203 |
/* lefthand side is inner */ |
| 4204 |
restrictinfo->outer_is_left = false; |
| 4205 |
} |
| 4206 |
else |
| 4207 |
continue; |
| 4208 |
|
| 4209 |
/* OK, add to list */ |
| 4210 |
restrictlist = lappend(restrictlist, restrictinfo); |
| 4211 |
} |
| 4212 |
|
| 4213 |
/* Short-circuit the easy case */ |
| 4214 |
if (restrictlist == NIL && exprlist == NIL) |
| 4215 |
return false; |
| 4216 |
|
| 4217 |
/* Examine each index of the relation ... */ |
| 4218 |
foreach(ic, rel->indexlist) |
| 4219 |
{ |
| 4220 |
IndexOptInfo *ind = (IndexOptInfo *) lfirst(ic); |
| 4221 |
int c; |
| 4222 |
List *exprs = NIL; |
| 4223 |
|
| 4224 |
/* |
| 4225 |
* If the index is not unique, or not immediately enforced, or if it's |
| 4226 |
* a partial index, it's useless here. We're unable to make use of |
| 4227 |
* predOK partial unique indexes due to the fact that |
| 4228 |
* check_index_predicates() also makes use of join predicates to |
| 4229 |
* determine if the partial index is usable. Here we need proofs that |
| 4230 |
* hold true before any joins are evaluated. |
| 4231 |
*/ |
| 4232 |
if (!ind->unique || !ind->immediate || ind->indpred != NIL) |
| 4233 |
continue; |
| 4234 |
|
| 4235 |
/* |
| 4236 |
* Try to find each index column in the lists of conditions. This is |
| 4237 |
* O(N^2) or worse, but we expect all the lists to be short. |
| 4238 |
*/ |
| 4239 |
for (c = 0; c < ind->nkeycolumns; c++) |
| 4240 |
{ |
| 4241 |
bool matched = false; |
| 4242 |
ListCell *lc; |
| 4243 |
ListCell *lc2; |
| 4244 |
|
| 4245 |
foreach(lc, restrictlist) |
| 4246 |
{ |
| 4247 |
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc); |
| 4248 |
Node *rexpr; |
| 4249 |
|
| 4250 |
/* |
| 4251 |
* The condition's equality operator must be a member of the |
| 4252 |
* index opfamily, else it is not asserting the right kind of |
| 4253 |
* equality behavior for this index. We check this first |
| 4254 |
* since it's probably the cheapest test. |
| 4255 |
*/ |
| 4256 |
if (!list_member_oid(rinfo->mergeopfamilies, ind->opfamily[c])) |
| 4257 |
continue; |
| 4258 |
|
| 4259 |
/* |
| 4260 |
* The index's collation must agree with the clause's input |
| 4261 |
* collation on equality, else the index's uniqueness does not |
| 4262 |
* imply uniqueness under the clause's equality semantics. |
| 4263 |
*/ |
| 4264 |
if (!collations_agree_on_equality(ind->indexcollations[c], |
| 4265 |
exprInputCollation((Node *) rinfo->clause))) |
| 4266 |
continue; |
| 4267 |
|
| 4268 |
/* OK, see if the condition operand matches the index key */ |
| 4269 |
if (rinfo->outer_is_left) |
| 4270 |
rexpr = get_rightop(rinfo->clause); |
| 4271 |
else |
| 4272 |
rexpr = get_leftop(rinfo->clause); |
| 4273 |
|
| 4274 |
if (match_index_to_operand(rexpr, c, ind)) |
| 4275 |
{ |
| 4276 |
matched = true; /* column is unique */ |
| 4277 |
|
| 4278 |
if (bms_membership(rinfo->clause_relids) == BMS_SINGLETON) |
| 4279 |
{ |
| 4280 |
MemoryContext oldMemCtx = |
| 4281 |
MemoryContextSwitchTo(root->planner_cxt); |
| 4282 |
|
| 4283 |
/* |
| 4284 |
* Add filter clause into a list allowing caller to |
| 4285 |
* know if uniqueness have made not only by join |
| 4286 |
* clauses. |
| 4287 |
*/ |
| 4288 |
Assert(bms_is_empty(rinfo->left_relids) || |
| 4289 |
bms_is_empty(rinfo->right_relids)); |
| 4290 |
if (extra_clauses) |
| 4291 |
exprs = lappend(exprs, rinfo); |
| 4292 |
MemoryContextSwitchTo(oldMemCtx); |
| 4293 |
} |
| 4294 |
|
| 4295 |
break; |
| 4296 |
} |
| 4297 |
} |
| 4298 |
|
| 4299 |
if (matched) |
| 4300 |
continue; |
| 4301 |
|
| 4302 |
forboth(lc, exprlist, lc2, oprlist) |
| 4303 |
{ |
| 4304 |
Node *expr = (Node *) lfirst(lc); |
| 4305 |
Oid opr = lfirst_oid(lc2); |
| 4306 |
|
| 4307 |
/* See if the expression matches the index key */ |
| 4308 |
if (!match_index_to_operand(expr, c, ind)) |
| 4309 |
continue; |
| 4310 |
|
| 4311 |
/* |
| 4312 |
* The equality operator must be a member of the index |
| 4313 |
* opfamily, else it is not asserting the right kind of |
| 4314 |
* equality behavior for this index. We assume the caller |
| 4315 |
* determined it is an equality operator, so we don't need to |
| 4316 |
* check any more tightly than this. |
| 4317 |
*/ |
| 4318 |
if (!op_in_opfamily(opr, ind->opfamily[c])) |
| 4319 |
continue; |
| 4320 |
|
| 4321 |
/* |
| 4322 |
* The index's collation must agree with the operand's |
| 4323 |
* collation on equality, else the index's uniqueness does not |
| 4324 |
* imply uniqueness under the operator's equality semantics. |
| 4325 |
*/ |
| 4326 |
if (!collations_agree_on_equality(ind->indexcollations[c], |
| 4327 |
exprCollation(expr))) |
| 4328 |
continue; |
| 4329 |
|
| 4330 |
matched = true; /* column is unique */ |
| 4331 |
break; |
| 4332 |
} |
| 4333 |
|
| 4334 |
if (!matched) |
| 4335 |
break; /* no match; this index doesn't help us */ |
| 4336 |
} |
| 4337 |
|
| 4338 |
/* Matched all key columns of this index? */ |
| 4339 |
if (c == ind->nkeycolumns) |
| 4340 |
{ |
| 4341 |
if (extra_clauses) |
| 4342 |
*extra_clauses = exprs; |
| 4343 |
return true; |
| 4344 |
} |
| 4345 |
} |
| 4346 |
|
| 4347 |
return false; |
| 4348 |
} |
| 4349 |
|
| 4350 |
/* |
| 4351 |
* indexcol_is_bool_constant_for_query |
| 4352 |
* |
| 4353 |
* If an index column is constrained to have a constant value by the query's |
| 4354 |
* WHERE conditions, then it's irrelevant for sort-order considerations. |
| 4355 |
* Usually that means we have a restriction clause WHERE indexcol = constant, |
| 4356 |
* which gets turned into an EquivalenceClass containing a constant, which |
| 4357 |
* is recognized as redundant by build_index_pathkeys(). But if the index |
| 4358 |
* column is a boolean variable (or expression), then we are not going to |
| 4359 |
* see WHERE indexcol = constant, because expression preprocessing will have |
| 4360 |
* simplified that to "WHERE indexcol" or "WHERE NOT indexcol". So we are not |
| 4361 |
* going to have a matching EquivalenceClass (unless the query also contains |
| 4362 |
* "ORDER BY indexcol"). To allow such cases to work the same as they would |
| 4363 |
* for non-boolean values, this function is provided to detect whether the |
| 4364 |
* specified index column matches a boolean restriction clause. |
| 4365 |
*/ |
| 4366 |
bool |
| 4367 |
indexcol_is_bool_constant_for_query(PlannerInfo *root, |
| 4368 |
IndexOptInfo *index, |
| 4369 |
int indexcol) |
| 4370 |
{ |
| 4371 |
ListCell *lc; |
| 4372 |
|
| 4373 |
/* If the index isn't boolean, we can't possibly get a match */ |
| 4374 |
if (!IsBooleanOpfamily(index->opfamily[indexcol])) |
| 4375 |
return false; |
| 4376 |
|
| 4377 |
/* Check each restriction clause for the index's rel */ |
| 4378 |
foreach(lc, index->rel->baserestrictinfo) |
| 4379 |
{ |
| 4380 |
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc); |
| 4381 |
|
| 4382 |
/* |
| 4383 |
* As in match_clause_to_indexcol, never match pseudoconstants to |
| 4384 |
* indexes. (It might be semantically okay to do so here, but the |
| 4385 |
* odds of getting a match are negligible, so don't waste the cycles.) |
| 4386 |
*/ |
| 4387 |
if (rinfo->pseudoconstant) |
| 4388 |
continue; |
| 4389 |
|
| 4390 |
/* See if we can match the clause's expression to the index column */ |
| 4391 |
if (match_boolean_index_clause(root, rinfo, indexcol, index)) |
| 4392 |
return true; |
| 4393 |
} |
| 4394 |
|
| 4395 |
return false; |
| 4396 |
} |
| 4397 |
|
| 4398 |
|
| 4399 |
/**************************************************************************** |
| 4400 |
* ---- ROUTINES TO CHECK OPERANDS ---- |
| 4401 |
****************************************************************************/ |
| 4402 |
|
| 4403 |
/* |
| 4404 |
* match_index_to_operand() |
| 4405 |
* Generalized test for a match between an index's key |
| 4406 |
* and the operand on one side of a restriction or join clause. |
| 4407 |
* |
| 4408 |
* operand: the nodetree to be compared to the index |
| 4409 |
* indexcol: the column number of the index (counting from 0) |
| 4410 |
* index: the index of interest |
| 4411 |
* |
| 4412 |
* Note that we aren't interested in collations here; the caller must check |
| 4413 |
* for a collation match, if it's dealing with an operator where that matters. |
| 4414 |
* |
| 4415 |
* This is exported for use in selfuncs.c. |
| 4416 |
*/ |
| 4417 |
bool |
| 4418 |
match_index_to_operand(Node *operand, |
| 4419 |
int indexcol, |
| 4420 |
IndexOptInfo *index) |
| 4421 |
{ |
| 4422 |
int indkey; |
| 4423 |
|
| 4424 |
/* |
| 4425 |
* Ignore any PlaceHolderVar node contained in the operand. This is |
| 4426 |
* needed to be able to apply indexscanning in cases where the operand (or |
| 4427 |
* a subtree) has been wrapped in PlaceHolderVars to enforce separate |
| 4428 |
* identity or as a result of outer joins. |
| 4429 |
*/ |
| 4430 |
operand = strip_noop_phvs(operand); |
| 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. |
| 4435 |
* |
| 4436 |
* Note: we must handle nested RelabelType nodes here. While |
| 4437 |
* eval_const_expressions() will have simplified them to at most one |
| 4438 |
* layer, our prior stripping of PlaceHolderVars may have brought separate |
| 4439 |
* RelabelTypes into adjacency. |
| 4440 |
*/ |
| 4441 |
while (operand && IsA(operand, RelabelType)) |
| 4442 |
operand = (Node *) ((RelabelType *) operand)->arg; |
| 4443 |
|
| 4444 |
indkey = index->indexkeys[indexcol]; |
| 4445 |
if (indkey != 0) |
| 4446 |
{ |
| 4447 |
/* |
| 4448 |
* Simple index column; operand must be a matching Var. |
| 4449 |
*/ |
| 4450 |
if (operand && IsA(operand, Var) && |
| 4451 |
index->rel->relid == ((Var *) operand)->varno && |
| 4452 |
indkey == ((Var *) operand)->varattno && |
| 4453 |
((Var *) operand)->varnullingrels == NULL) |
| 4454 |
return true; |
| 4455 |
} |
| 4456 |
else |
| 4457 |
{ |
| 4458 |
/* |
| 4459 |
* Index expression; find the correct expression. (This search could |
| 4460 |
* be avoided, at the cost of complicating all the callers of this |
| 4461 |
* routine; doesn't seem worth it.) |
| 4462 |
*/ |
| 4463 |
ListCell *indexpr_item; |
| 4464 |
int i; |
| 4465 |
Node *indexkey; |
| 4466 |
|
| 4467 |
indexpr_item = list_head(index->indexprs); |
| 4468 |
for (i = 0; i < indexcol; i++) |
| 4469 |
{ |
| 4470 |
if (index->indexkeys[i] == 0) |
| 4471 |
{ |
| 4472 |
if (indexpr_item == NULL) |
| 4473 |
elog(ERROR, "wrong number of index expressions"); |
| 4474 |
indexpr_item = lnext(index->indexprs, indexpr_item); |
| 4475 |
} |
| 4476 |
} |
| 4477 |
if (indexpr_item == NULL) |
| 4478 |
elog(ERROR, "wrong number of index expressions"); |
| 4479 |
indexkey = (Node *) lfirst(indexpr_item); |
| 4480 |
|
| 4481 |
/* |
| 4482 |
* Does it match the operand? Again, strip any relabeling. |
| 4483 |
*/ |
| 4484 |
if (indexkey && IsA(indexkey, RelabelType)) |
| 4485 |
indexkey = (Node *) ((RelabelType *) indexkey)->arg; |
| 4486 |
|
| 4487 |
if (equal(indexkey, operand)) |
| 4488 |
return true; |
| 4489 |
} |
| 4490 |
|
| 4491 |
return false; |
| 4492 |
} |
| 4493 |
|
| 4494 |
/* |
| 4495 |
* strip_phvs_in_index_operand |
| 4496 |
* |
| 4497 |
* Retained as a backward-compatibility wrapper around strip_noop_phvs() to |
| 4498 |
* avoid breaking third-party extensions that may reference this function. New |
| 4499 |
* code should call strip_noop_phvs() directly. |
| 4500 |
*/ |
| 4501 |
Node * |
| 4502 |
strip_phvs_in_index_operand(Node *operand) |
| 4503 |
{ |
| 4504 |
return strip_noop_phvs(operand); |
| 4505 |
} |
| 4506 |
|
| 4507 |
/* |
| 4508 |
* is_pseudo_constant_for_index() |
| 4509 |
* Test whether the given expression can be used as an indexscan |
| 4510 |
* comparison value. |
| 4511 |
* |
| 4512 |
* An indexscan comparison value must not contain any volatile functions, |
| 4513 |
* and it can't contain any Vars of the index's own table. Vars of |
| 4514 |
* other tables are okay, though; in that case we'd be producing an |
| 4515 |
* indexqual usable in a parameterized indexscan. This is, therefore, |
| 4516 |
* a weaker condition than is_pseudo_constant_clause(). |
| 4517 |
* |
| 4518 |
* This function is exported for use by planner support functions, |
| 4519 |
* which will have available the IndexOptInfo, but not any RestrictInfo |
| 4520 |
* infrastructure. It is making the same test made by functions above |
| 4521 |
* such as match_opclause_to_indexcol(), but those rely where possible |
| 4522 |
* on RestrictInfo information about variable membership. |
| 4523 |
* |
| 4524 |
* expr: the nodetree to be checked |
| 4525 |
* index: the index of interest |
| 4526 |
*/ |
| 4527 |
bool |
| 4528 |
is_pseudo_constant_for_index(PlannerInfo *root, Node *expr, IndexOptInfo *index) |
| 4529 |
{ |
| 4530 |
/* pull_varnos is cheaper than volatility check, so do that first */ |
| 4531 |
if (bms_is_member(index->rel->relid, pull_varnos(root, expr))) |
| 4532 |
return false; /* no good, contains Var of table */ |
| 4533 |
if (contain_volatile_functions(expr)) |
| 4534 |
return false; /* no good, volatile comparison value */ |
| 4535 |
return true; |
| 4536 |
} |