Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * plancat.c
4 : * routines for accessing the system catalogs
5 : *
6 : *
7 : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
8 : * Portions Copyright (c) 1994, Regents of the University of California
9 : *
10 : *
11 : * IDENTIFICATION
12 : * src/backend/optimizer/util/plancat.c
13 : *
14 : *-------------------------------------------------------------------------
15 : */
16 : #include "postgres.h"
17 :
18 : #include <math.h>
19 :
20 : #include "access/genam.h"
21 : #include "access/htup_details.h"
22 : #include "access/nbtree.h"
23 : #include "access/sysattr.h"
24 : #include "access/table.h"
25 : #include "access/tableam.h"
26 : #include "access/transam.h"
27 : #include "access/xlog.h"
28 : #include "catalog/catalog.h"
29 : #include "catalog/heap.h"
30 : #include "catalog/pg_am.h"
31 : #include "catalog/pg_proc.h"
32 : #include "catalog/pg_statistic_ext.h"
33 : #include "catalog/pg_statistic_ext_data.h"
34 : #include "foreign/fdwapi.h"
35 : #include "miscadmin.h"
36 : #include "nodes/makefuncs.h"
37 : #include "nodes/nodeFuncs.h"
38 : #include "nodes/supportnodes.h"
39 : #include "optimizer/cost.h"
40 : #include "optimizer/optimizer.h"
41 : #include "optimizer/plancat.h"
42 : #include "parser/parse_relation.h"
43 : #include "parser/parsetree.h"
44 : #include "partitioning/partdesc.h"
45 : #include "rewrite/rewriteHandler.h"
46 : #include "rewrite/rewriteManip.h"
47 : #include "statistics/statistics.h"
48 : #include "storage/bufmgr.h"
49 : #include "tcop/tcopprot.h"
50 : #include "utils/builtins.h"
51 : #include "utils/lsyscache.h"
52 : #include "utils/partcache.h"
53 : #include "utils/rel.h"
54 : #include "utils/snapmgr.h"
55 : #include "utils/syscache.h"
56 :
57 : /* GUC parameter */
58 : int constraint_exclusion = CONSTRAINT_EXCLUSION_PARTITION;
59 :
60 : /* Hook for plugins to get control in get_relation_info() */
61 : get_relation_info_hook_type get_relation_info_hook = NULL;
62 :
63 : typedef struct NotnullHashEntry
64 : {
65 : Oid relid; /* OID of the relation */
66 : Bitmapset *notnullattnums; /* attnums of NOT NULL columns */
67 : } NotnullHashEntry;
68 :
69 :
70 : static void get_relation_foreign_keys(PlannerInfo *root, RelOptInfo *rel,
71 : Relation relation, bool inhparent);
72 : static bool infer_collation_opclass_match(InferenceElem *elem, Relation idxRel,
73 : List *idxExprs);
74 : static List *get_relation_constraints(PlannerInfo *root,
75 : Oid relationObjectId, RelOptInfo *rel,
76 : bool include_noinherit,
77 : bool include_notnull,
78 : bool include_partition);
79 : static List *build_index_tlist(PlannerInfo *root, IndexOptInfo *index,
80 : Relation heapRelation);
81 : static List *get_relation_statistics(PlannerInfo *root, RelOptInfo *rel,
82 : Relation relation);
83 : static void set_relation_partition_info(PlannerInfo *root, RelOptInfo *rel,
84 : Relation relation);
85 : static PartitionScheme find_partition_scheme(PlannerInfo *root,
86 : Relation relation);
87 : static void set_baserel_partition_key_exprs(Relation relation,
88 : RelOptInfo *rel);
89 : static void set_baserel_partition_constraint(Relation relation,
90 : RelOptInfo *rel);
91 :
92 :
93 : /*
94 : * get_relation_info -
95 : * Retrieves catalog information for a given relation.
96 : *
97 : * Given the Oid of the relation, return the following info into fields
98 : * of the RelOptInfo struct:
99 : *
100 : * min_attr lowest valid AttrNumber
101 : * max_attr highest valid AttrNumber
102 : * indexlist list of IndexOptInfos for relation's indexes
103 : * statlist list of StatisticExtInfo for relation's statistic objects
104 : * serverid if it's a foreign table, the server OID
105 : * fdwroutine if it's a foreign table, the FDW function pointers
106 : * pages number of pages
107 : * tuples number of tuples
108 : * rel_parallel_workers user-defined number of parallel workers
109 : *
110 : * Also, add information about the relation's foreign keys to root->fkey_list.
111 : *
112 : * Also, initialize the attr_needed[] and attr_widths[] arrays. In most
113 : * cases these are left as zeroes, but sometimes we need to compute attr
114 : * widths here, and we may as well cache the results for costsize.c.
115 : *
116 : * If inhparent is true, all we need to do is set up the attr arrays:
117 : * the RelOptInfo actually represents the appendrel formed by an inheritance
118 : * tree, and so the parent rel's physical size and index information isn't
119 : * important for it, however, for partitioned tables, we do populate the
120 : * indexlist as the planner uses unique indexes as unique proofs for certain
121 : * optimizations.
122 : */
123 : void
124 246825 : get_relation_info(PlannerInfo *root, Oid relationObjectId, bool inhparent,
125 : RelOptInfo *rel)
126 : {
127 246825 : Index varno = rel->relid;
128 : Relation relation;
129 : bool hasindex;
130 246825 : List *indexinfos = NIL;
131 :
132 : /*
133 : * We need not lock the relation since it was already locked, either by
134 : * the rewriter or when expand_inherited_rtentry() added it to the query's
135 : * rangetable.
136 : */
137 246825 : relation = table_open(relationObjectId, NoLock);
138 :
139 : /*
140 : * Relations without a table AM can be used in a query only if they are of
141 : * special-cased relkinds. This check prevents us from crashing later if,
142 : * for example, a view's ON SELECT rule has gone missing. Note that
143 : * table_open() already rejected indexes and composite types; spell the
144 : * error the same way it does.
145 : */
146 246825 : if (!relation->rd_tableam)
147 : {
148 10330 : if (!(relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE ||
149 9067 : relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE))
150 0 : ereport(ERROR,
151 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
152 : errmsg("cannot open relation \"%s\"",
153 : RelationGetRelationName(relation)),
154 : errdetail_relkind_not_supported(relation->rd_rel->relkind)));
155 : }
156 :
157 : /* Temporary and unlogged relations are inaccessible during recovery. */
158 246825 : if (!RelationIsPermanent(relation) && RecoveryInProgress())
159 0 : ereport(ERROR,
160 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
161 : errmsg("cannot access temporary or unlogged relations during recovery")));
162 :
163 246825 : rel->min_attr = FirstLowInvalidHeapAttributeNumber + 1;
164 246825 : rel->max_attr = RelationGetNumberOfAttributes(relation);
165 246825 : rel->reltablespace = RelationGetForm(relation)->reltablespace;
166 :
167 : Assert(rel->max_attr >= rel->min_attr);
168 246825 : rel->attr_needed = (Relids *)
169 246825 : palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
170 246825 : rel->attr_widths = (int32 *)
171 246825 : palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
172 :
173 : /*
174 : * Record which columns are defined as NOT NULL. We leave this
175 : * unpopulated for non-partitioned inheritance parent relations as it's
176 : * ambiguous as to what it means. Some child tables may have a NOT NULL
177 : * constraint for a column while others may not. We could work harder and
178 : * build a unioned set of all child relations notnullattnums, but there's
179 : * currently no need. The RelOptInfo corresponding to the !inh
180 : * RangeTblEntry does get populated.
181 : */
182 246825 : if (!inhparent || relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
183 227369 : rel->notnullattnums = find_relation_notnullatts(root, relationObjectId);
184 :
185 : /*
186 : * Estimate relation size --- unless it's an inheritance parent, in which
187 : * case the size we want is not the rel's own size but the size of its
188 : * inheritance tree. That will be computed in set_append_rel_size().
189 : */
190 246825 : if (!inhparent)
191 218322 : estimate_rel_size(relation, rel->attr_widths - rel->min_attr,
192 218322 : &rel->pages, &rel->tuples, &rel->allvisfrac);
193 :
194 : /* Retrieve the parallel_workers reloption, or -1 if not set. */
195 246825 : rel->rel_parallel_workers = RelationGetParallelWorkers(relation, -1);
196 :
197 : /*
198 : * Make list of indexes. Ignore indexes on system catalogs if told to.
199 : * Don't bother with indexes from traditional inheritance parents. For
200 : * partitioned tables, we need a list of at least unique indexes as these
201 : * serve as unique proofs for certain planner optimizations. However,
202 : * let's not discriminate here and just record all partitioned indexes
203 : * whether they're unique indexes or not.
204 : */
205 246825 : if ((inhparent && relation->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
206 227369 : || (IgnoreSystemIndexes && IsSystemRelation(relation)))
207 19456 : hasindex = false;
208 : else
209 227369 : hasindex = relation->rd_rel->relhasindex;
210 :
211 246825 : if (hasindex)
212 : {
213 : List *indexoidlist;
214 : LOCKMODE lmode;
215 : ListCell *l;
216 :
217 183921 : indexoidlist = RelationGetIndexList(relation);
218 :
219 : /*
220 : * For each index, we get the same type of lock that the executor will
221 : * need, and do not release it. This saves a couple of trips to the
222 : * shared lock manager while not creating any real loss of
223 : * concurrency, because no schema changes could be happening on the
224 : * index while we hold lock on the parent rel, and no lock type used
225 : * for queries blocks any other kind of index operation.
226 : */
227 183921 : lmode = root->simple_rte_array[varno]->rellockmode;
228 :
229 569109 : foreach(l, indexoidlist)
230 : {
231 385188 : Oid indexoid = lfirst_oid(l);
232 : Relation indexRelation;
233 : Form_pg_index index;
234 385188 : const IndexAmRoutine *amroutine = NULL;
235 : IndexOptInfo *info;
236 : int ncolumns,
237 : nkeycolumns;
238 : int i;
239 :
240 : /*
241 : * Extract info from the relation descriptor for the index.
242 : */
243 385188 : indexRelation = index_open(indexoid, lmode);
244 385188 : index = indexRelation->rd_index;
245 :
246 : /*
247 : * Ignore invalid indexes, since they can't safely be used for
248 : * queries. Note that this is OK because the data structure we
249 : * are constructing is only used by the planner --- the executor
250 : * still needs to insert into "invalid" indexes, if they're marked
251 : * indisready.
252 : */
253 385188 : if (!index->indisvalid)
254 : {
255 11 : index_close(indexRelation, NoLock);
256 11 : continue;
257 : }
258 :
259 : /*
260 : * If the index is valid, but cannot yet be used, ignore it; but
261 : * mark the plan we are generating as transient. See
262 : * src/backend/access/heap/README.HOT for discussion.
263 : */
264 385177 : if (index->indcheckxmin &&
265 135 : !TransactionIdPrecedes(HeapTupleHeaderGetXmin(indexRelation->rd_indextuple->t_data),
266 : TransactionXmin))
267 : {
268 76 : root->glob->transientPlan = true;
269 76 : index_close(indexRelation, NoLock);
270 76 : continue;
271 : }
272 :
273 385101 : info = makeNode(IndexOptInfo);
274 :
275 385101 : info->indexoid = index->indexrelid;
276 385101 : info->reltablespace =
277 385101 : RelationGetForm(indexRelation)->reltablespace;
278 385101 : info->rel = rel;
279 385101 : info->ncolumns = ncolumns = index->indnatts;
280 385101 : info->nkeycolumns = nkeycolumns = index->indnkeyatts;
281 :
282 385101 : info->indexkeys = palloc_array(int, ncolumns);
283 385101 : info->indexcollations = palloc_array(Oid, nkeycolumns);
284 385101 : info->opfamily = palloc_array(Oid, nkeycolumns);
285 385101 : info->opcintype = palloc_array(Oid, nkeycolumns);
286 385101 : info->canreturn = palloc_array(bool, ncolumns);
287 :
288 1104150 : for (i = 0; i < ncolumns; i++)
289 : {
290 719049 : info->indexkeys[i] = index->indkey.values[i];
291 719049 : info->canreturn[i] = index_can_return(indexRelation, i + 1);
292 : }
293 :
294 1103941 : for (i = 0; i < nkeycolumns; i++)
295 : {
296 718840 : info->opfamily[i] = indexRelation->rd_opfamily[i];
297 718840 : info->opcintype[i] = indexRelation->rd_opcintype[i];
298 718840 : info->indexcollations[i] = indexRelation->rd_indcollation[i];
299 : }
300 :
301 385101 : info->relam = indexRelation->rd_rel->relam;
302 :
303 : /*
304 : * We don't have an AM for partitioned indexes, so we'll just
305 : * NULLify the AM related fields for those.
306 : */
307 385101 : if (indexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
308 : {
309 : /* We copy just the fields we need, not all of rd_indam */
310 381622 : amroutine = indexRelation->rd_indam;
311 381622 : info->amcanorderbyop = amroutine->amcanorderbyop;
312 381622 : info->amoptionalkey = amroutine->amoptionalkey;
313 381622 : info->amsearcharray = amroutine->amsearcharray;
314 381622 : info->amsearchnulls = amroutine->amsearchnulls;
315 381622 : info->amcanparallel = amroutine->amcanparallel;
316 381622 : info->amhasgettuple = (amroutine->amgettuple != NULL);
317 763244 : info->amhasgetbitmap = amroutine->amgetbitmap != NULL &&
318 381622 : relation->rd_tableam->scan_bitmap_next_tuple != NULL;
319 752156 : info->amcanmarkpos = (amroutine->ammarkpos != NULL &&
320 370534 : amroutine->amrestrpos != NULL);
321 381622 : info->amcostestimate = amroutine->amcostestimate;
322 : Assert(info->amcostestimate != NULL);
323 :
324 : /* Fetch index opclass options */
325 381622 : info->opclassoptions = RelationGetIndexAttOptions(indexRelation, true);
326 :
327 : /*
328 : * Fetch the ordering information for the index, if any.
329 : */
330 381622 : if (info->relam == BTREE_AM_OID)
331 : {
332 : /*
333 : * If it's a btree index, we can use its opfamily OIDs
334 : * directly as the sort ordering opfamily OIDs.
335 : */
336 : Assert(amroutine->amcanorder);
337 :
338 370534 : info->sortopfamily = info->opfamily;
339 370534 : info->reverse_sort = palloc_array(bool, nkeycolumns);
340 370534 : info->nulls_first = palloc_array(bool, nkeycolumns);
341 :
342 944401 : for (i = 0; i < nkeycolumns; i++)
343 : {
344 573867 : int16 opt = indexRelation->rd_indoption[i];
345 :
346 573867 : info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
347 573867 : info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
348 : }
349 : }
350 11088 : else if (amroutine->amcanorder)
351 : {
352 : /*
353 : * Otherwise, identify the corresponding btree opfamilies
354 : * by trying to map this index's "<" operators into btree.
355 : * Since "<" uniquely defines the behavior of a sort
356 : * order, this is a sufficient test.
357 : *
358 : * XXX This method is rather slow and complicated. It'd
359 : * be better to have a way to explicitly declare the
360 : * corresponding btree opfamily for each opfamily of the
361 : * other index type.
362 : */
363 0 : info->sortopfamily = palloc_array(Oid, nkeycolumns);
364 0 : info->reverse_sort = palloc_array(bool, nkeycolumns);
365 0 : info->nulls_first = palloc_array(bool, nkeycolumns);
366 :
367 0 : for (i = 0; i < nkeycolumns; i++)
368 : {
369 0 : int16 opt = indexRelation->rd_indoption[i];
370 : Oid ltopr;
371 : Oid opfamily;
372 : Oid opcintype;
373 : CompareType cmptype;
374 :
375 0 : info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
376 0 : info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
377 :
378 0 : ltopr = get_opfamily_member_for_cmptype(info->opfamily[i],
379 0 : info->opcintype[i],
380 0 : info->opcintype[i],
381 : COMPARE_LT);
382 0 : if (OidIsValid(ltopr) &&
383 0 : get_ordering_op_properties(ltopr,
384 : &opfamily,
385 : &opcintype,
386 0 : &cmptype) &&
387 0 : opcintype == info->opcintype[i] &&
388 0 : cmptype == COMPARE_LT)
389 : {
390 : /* Successful mapping */
391 0 : info->sortopfamily[i] = opfamily;
392 : }
393 : else
394 : {
395 : /* Fail ... quietly treat index as unordered */
396 0 : info->sortopfamily = NULL;
397 0 : info->reverse_sort = NULL;
398 0 : info->nulls_first = NULL;
399 0 : break;
400 : }
401 : }
402 : }
403 : else
404 : {
405 11088 : info->sortopfamily = NULL;
406 11088 : info->reverse_sort = NULL;
407 11088 : info->nulls_first = NULL;
408 : }
409 : }
410 : else
411 : {
412 3479 : info->amcanorderbyop = false;
413 3479 : info->amoptionalkey = false;
414 3479 : info->amsearcharray = false;
415 3479 : info->amsearchnulls = false;
416 3479 : info->amcanparallel = false;
417 3479 : info->amhasgettuple = false;
418 3479 : info->amhasgetbitmap = false;
419 3479 : info->amcanmarkpos = false;
420 3479 : info->amcostestimate = NULL;
421 :
422 3479 : info->sortopfamily = NULL;
423 3479 : info->reverse_sort = NULL;
424 3479 : info->nulls_first = NULL;
425 : }
426 :
427 : /*
428 : * Fetch the index expressions and predicate, if any. We must
429 : * modify the copies we obtain from the relcache to have the
430 : * correct varno for the parent relation, so that they match up
431 : * correctly against qual clauses.
432 : *
433 : * After fixing the varnos, we need to run the index expressions
434 : * and predicate through const-simplification again, using a valid
435 : * "root". This ensures that NullTest quals for Vars can be
436 : * properly reduced.
437 : */
438 385101 : info->indexprs = RelationGetIndexExpressions(indexRelation);
439 385101 : info->indpred = RelationGetIndexPredicate(indexRelation);
440 385101 : if (info->indexprs)
441 : {
442 1516 : if (varno != 1)
443 969 : ChangeVarNodes((Node *) info->indexprs, 1, varno, 0);
444 :
445 1516 : info->indexprs = (List *)
446 1516 : eval_const_expressions(root, (Node *) info->indexprs);
447 : }
448 385101 : if (info->indpred)
449 : {
450 538 : if (varno != 1)
451 63 : ChangeVarNodes((Node *) info->indpred, 1, varno, 0);
452 :
453 538 : info->indpred = (List *)
454 538 : eval_const_expressions(root,
455 538 : (Node *) make_ands_explicit(info->indpred));
456 538 : info->indpred = make_ands_implicit((Expr *) info->indpred);
457 : }
458 :
459 : /* Build targetlist using the completed indexprs data */
460 385101 : info->indextlist = build_index_tlist(root, info, relation);
461 :
462 385101 : info->indrestrictinfo = NIL; /* set later, in indxpath.c */
463 385101 : info->predOK = false; /* set later, in indxpath.c */
464 385101 : info->unique = index->indisunique;
465 385101 : info->nullsnotdistinct = index->indnullsnotdistinct;
466 385101 : info->immediate = index->indimmediate;
467 385101 : info->hypothetical = false;
468 :
469 : /*
470 : * Estimate the index size. If it's not a partial index, we lock
471 : * the number-of-tuples estimate to equal the parent table; if it
472 : * is partial then we have to use the same methods as we would for
473 : * a table, except we can be sure that the index is not larger
474 : * than the table. We must ignore partitioned indexes here as
475 : * there are not physical indexes.
476 : */
477 385101 : if (indexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
478 : {
479 381622 : if (info->indpred == NIL)
480 : {
481 381096 : info->pages = RelationGetNumberOfBlocks(indexRelation);
482 381096 : info->tuples = rel->tuples;
483 : }
484 : else
485 : {
486 : double allvisfrac; /* dummy */
487 :
488 526 : estimate_rel_size(indexRelation, NULL,
489 526 : &info->pages, &info->tuples, &allvisfrac);
490 526 : if (info->tuples > rel->tuples)
491 9 : info->tuples = rel->tuples;
492 : }
493 :
494 : /*
495 : * Get tree height while we have the index open
496 : */
497 381622 : if (amroutine->amgettreeheight)
498 : {
499 370534 : info->tree_height = amroutine->amgettreeheight(indexRelation);
500 : }
501 : else
502 : {
503 : /* For other index types, just set it to "unknown" for now */
504 11088 : info->tree_height = -1;
505 : }
506 : }
507 : else
508 : {
509 : /* Zero these out for partitioned indexes */
510 3479 : info->pages = 0;
511 3479 : info->tuples = 0.0;
512 3479 : info->tree_height = -1;
513 : }
514 :
515 385101 : index_close(indexRelation, NoLock);
516 :
517 : /*
518 : * We've historically used lcons() here. It'd make more sense to
519 : * use lappend(), but that causes the planner to change behavior
520 : * in cases where two indexes seem equally attractive. For now,
521 : * stick with lcons() --- few tables should have so many indexes
522 : * that the O(N^2) behavior of lcons() is really a problem.
523 : */
524 385101 : indexinfos = lcons(info, indexinfos);
525 : }
526 :
527 183921 : list_free(indexoidlist);
528 : }
529 :
530 246825 : rel->indexlist = indexinfos;
531 :
532 246825 : rel->statlist = get_relation_statistics(root, rel, relation);
533 :
534 : /* Grab foreign-table info using the relcache, while we have it */
535 246825 : if (relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
536 : {
537 : /* Check if the access to foreign tables is restricted */
538 1263 : if (unlikely((restrict_nonsystem_relation_kind & RESTRICT_RELKIND_FOREIGN_TABLE) != 0))
539 : {
540 : /* there must not be built-in foreign tables */
541 : Assert(RelationGetRelid(relation) >= FirstNormalObjectId);
542 :
543 2 : ereport(ERROR,
544 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
545 : errmsg("access to non-system foreign table is restricted")));
546 : }
547 :
548 1261 : rel->serverid = GetForeignServerIdByRelId(RelationGetRelid(relation));
549 1261 : rel->fdwroutine = GetFdwRoutineForRelation(relation, true);
550 : }
551 : else
552 : {
553 245562 : rel->serverid = InvalidOid;
554 245562 : rel->fdwroutine = NULL;
555 : }
556 :
557 : /* Collect info about relation's foreign keys, if relevant */
558 246816 : get_relation_foreign_keys(root, rel, relation, inhparent);
559 :
560 : /* Collect info about functions implemented by the rel's table AM. */
561 246816 : if (relation->rd_tableam &&
562 236495 : relation->rd_tableam->scan_set_tidrange != NULL &&
563 236495 : relation->rd_tableam->scan_getnextslot_tidrange != NULL)
564 236495 : rel->amflags |= AMFLAG_HAS_TID_RANGE;
565 :
566 : /*
567 : * Collect info about relation's partitioning scheme, if any. Only
568 : * inheritance parents may be partitioned.
569 : */
570 246816 : if (inhparent && relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
571 9047 : set_relation_partition_info(root, rel, relation);
572 :
573 246816 : table_close(relation, NoLock);
574 :
575 : /*
576 : * Allow a plugin to editorialize on the info we obtained from the
577 : * catalogs. Actions might include altering the assumed relation size,
578 : * removing an index, or adding a hypothetical index to the indexlist.
579 : *
580 : * An extension can also modify rel->pgs_mask here to control path
581 : * generation.
582 : */
583 246816 : if (get_relation_info_hook)
584 0 : (*get_relation_info_hook) (root, relationObjectId, inhparent, rel);
585 246816 : }
586 :
587 : /*
588 : * get_relation_foreign_keys -
589 : * Retrieves foreign key information for a given relation.
590 : *
591 : * ForeignKeyOptInfos for relevant foreign keys are created and added to
592 : * root->fkey_list. We do this now while we have the relcache entry open.
593 : * We could sometimes avoid making useless ForeignKeyOptInfos if we waited
594 : * until all RelOptInfos have been built, but the cost of re-opening the
595 : * relcache entries would probably exceed any savings.
596 : */
597 : static void
598 246816 : get_relation_foreign_keys(PlannerInfo *root, RelOptInfo *rel,
599 : Relation relation, bool inhparent)
600 : {
601 246816 : List *rtable = root->parse->rtable;
602 : List *cachedfkeys;
603 : ListCell *lc;
604 :
605 : /*
606 : * If it's not a baserel, we don't care about its FKs. Also, if the query
607 : * references only a single relation, we can skip the lookup since no FKs
608 : * could satisfy the requirements below.
609 : */
610 471360 : if (rel->reloptkind != RELOPT_BASEREL ||
611 224544 : list_length(rtable) < 2)
612 127717 : return;
613 :
614 : /*
615 : * If it's the parent of an inheritance tree, ignore its FKs. We could
616 : * make useful FK-based deductions if we found that all members of the
617 : * inheritance tree have equivalent FK constraints, but detecting that
618 : * would require code that hasn't been written.
619 : */
620 119099 : if (inhparent)
621 2991 : return;
622 :
623 : /*
624 : * Extract data about relation's FKs from the relcache. Note that this
625 : * list belongs to the relcache and might disappear in a cache flush, so
626 : * we must not do any further catalog access within this function.
627 : */
628 116108 : cachedfkeys = RelationGetFKeyList(relation);
629 :
630 : /*
631 : * Figure out which FKs are of interest for this query, and create
632 : * ForeignKeyOptInfos for them. We want only FKs that reference some
633 : * other RTE of the current query. In queries containing self-joins,
634 : * there might be more than one other RTE for a referenced table, and we
635 : * should make a ForeignKeyOptInfo for each occurrence.
636 : *
637 : * Ideally, we would ignore RTEs that correspond to non-baserels, but it's
638 : * too hard to identify those here, so we might end up making some useless
639 : * ForeignKeyOptInfos. If so, match_foreign_keys_to_quals() will remove
640 : * them again.
641 : */
642 117417 : foreach(lc, cachedfkeys)
643 : {
644 1309 : ForeignKeyCacheInfo *cachedfk = (ForeignKeyCacheInfo *) lfirst(lc);
645 : Index rti;
646 : ListCell *lc2;
647 :
648 : /* conrelid should always be that of the table we're considering */
649 : Assert(cachedfk->conrelid == RelationGetRelid(relation));
650 :
651 : /* skip constraints currently not enforced */
652 1309 : if (!cachedfk->conenforced)
653 9 : continue;
654 :
655 : /* Scan to find other RTEs matching confrelid */
656 1300 : rti = 0;
657 5746 : foreach(lc2, rtable)
658 : {
659 4446 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc2);
660 : ForeignKeyOptInfo *info;
661 :
662 4446 : rti++;
663 : /* Ignore if not the correct table */
664 4446 : if (rte->rtekind != RTE_RELATION ||
665 2771 : rte->relid != cachedfk->confrelid)
666 3355 : continue;
667 : /* Ignore if it's an inheritance parent; doesn't really match */
668 1091 : if (rte->inh)
669 135 : continue;
670 : /* Ignore self-referential FKs; we only care about joins */
671 956 : if (rti == rel->relid)
672 66 : continue;
673 :
674 : /* OK, let's make an entry */
675 890 : info = makeNode(ForeignKeyOptInfo);
676 890 : info->con_relid = rel->relid;
677 890 : info->ref_relid = rti;
678 890 : info->nkeys = cachedfk->nkeys;
679 890 : memcpy(info->conkey, cachedfk->conkey, sizeof(info->conkey));
680 890 : memcpy(info->confkey, cachedfk->confkey, sizeof(info->confkey));
681 890 : memcpy(info->conpfeqop, cachedfk->conpfeqop, sizeof(info->conpfeqop));
682 : /* zero out fields to be filled by match_foreign_keys_to_quals */
683 890 : info->nmatched_ec = 0;
684 890 : info->nconst_ec = 0;
685 890 : info->nmatched_rcols = 0;
686 890 : info->nmatched_ri = 0;
687 890 : memset(info->eclass, 0, sizeof(info->eclass));
688 890 : memset(info->fk_eclass_member, 0, sizeof(info->fk_eclass_member));
689 890 : memset(info->rinfos, 0, sizeof(info->rinfos));
690 :
691 890 : root->fkey_list = lappend(root->fkey_list, info);
692 : }
693 : }
694 : }
695 :
696 : /*
697 : * get_relation_notnullatts -
698 : * Retrieves column not-null constraint information for a given relation.
699 : *
700 : * We do this while we have the relcache entry open, and store the column
701 : * not-null constraint information in a hash table based on the relation OID.
702 : */
703 : void
704 268304 : get_relation_notnullatts(PlannerInfo *root, Relation relation)
705 : {
706 268304 : Oid relid = RelationGetRelid(relation);
707 : NotnullHashEntry *hentry;
708 : bool found;
709 268304 : Bitmapset *notnullattnums = NULL;
710 :
711 : /* bail out if the relation has no not-null constraints */
712 268304 : if (relation->rd_att->constr == NULL ||
713 179246 : !relation->rd_att->constr->has_not_null)
714 112180 : return;
715 :
716 : /* create the hash table if it hasn't been created yet */
717 176413 : if (root->glob->rel_notnullatts_hash == NULL)
718 : {
719 : HTAB *hashtab;
720 : HASHCTL hash_ctl;
721 :
722 90398 : hash_ctl.keysize = sizeof(Oid);
723 90398 : hash_ctl.entrysize = sizeof(NotnullHashEntry);
724 90398 : hash_ctl.hcxt = CurrentMemoryContext;
725 :
726 90398 : hashtab = hash_create("Relation NOT NULL attnums",
727 : 64L, /* arbitrary initial size */
728 : &hash_ctl,
729 : HASH_ELEM | HASH_BLOBS | HASH_CONTEXT);
730 :
731 90398 : root->glob->rel_notnullatts_hash = hashtab;
732 : }
733 :
734 : /*
735 : * Create a hash entry for this relation OID, if we don't have one
736 : * already.
737 : */
738 176413 : hentry = (NotnullHashEntry *) hash_search(root->glob->rel_notnullatts_hash,
739 : &relid,
740 : HASH_ENTER,
741 : &found);
742 :
743 : /* bail out if a hash entry already exists for this relation OID */
744 176413 : if (found)
745 20289 : return;
746 :
747 : /* collect the column not-null constraint information for this relation */
748 2296604 : for (int i = 0; i < relation->rd_att->natts; i++)
749 : {
750 2140480 : CompactAttribute *attr = TupleDescCompactAttr(relation->rd_att, i);
751 :
752 : Assert(attr->attnullability != ATTNULLABLE_UNKNOWN);
753 :
754 2140480 : if (attr->attnullability == ATTNULLABLE_VALID)
755 : {
756 1808182 : notnullattnums = bms_add_member(notnullattnums, i + 1);
757 :
758 : /*
759 : * Per RemoveAttributeById(), dropped columns will have their
760 : * attnotnull unset, so we needn't check for dropped columns in
761 : * the above condition.
762 : */
763 : Assert(!attr->attisdropped);
764 : }
765 : }
766 :
767 : /* ... and initialize the new hash entry */
768 156124 : hentry->notnullattnums = notnullattnums;
769 : }
770 :
771 : /*
772 : * find_relation_notnullatts -
773 : * Searches the hash table and returns the column not-null constraint
774 : * information for a given relation.
775 : */
776 : Bitmapset *
777 237182 : find_relation_notnullatts(PlannerInfo *root, Oid relid)
778 : {
779 : NotnullHashEntry *hentry;
780 : bool found;
781 :
782 237182 : if (root->glob->rel_notnullatts_hash == NULL)
783 62126 : return NULL;
784 :
785 175056 : hentry = (NotnullHashEntry *) hash_search(root->glob->rel_notnullatts_hash,
786 : &relid,
787 : HASH_FIND,
788 : &found);
789 175056 : if (!found)
790 2865 : return NULL;
791 :
792 172191 : return hentry->notnullattnums;
793 : }
794 :
795 : /*
796 : * infer_arbiter_indexes -
797 : * Determine the unique indexes used to arbitrate speculative insertion.
798 : *
799 : * Uses user-supplied inference clause expressions and predicate to match a
800 : * unique index from those defined and ready on the heap relation (target).
801 : * An exact match is required on columns/expressions (although they can appear
802 : * in any order). However, the predicate given by the user need only restrict
803 : * insertion to a subset of some part of the table covered by some particular
804 : * unique index (in particular, a partial unique index) in order to be
805 : * inferred.
806 : *
807 : * The implementation does not consider which B-Tree operator class any
808 : * particular available unique index attribute uses, unless one was specified
809 : * in the inference specification. The same is true of collations. In
810 : * particular, there is no system dependency on the default operator class for
811 : * the purposes of inference. If no opclass (or collation) is specified, then
812 : * all matching indexes (that may or may not match the default in terms of
813 : * each attribute opclass/collation) are used for inference.
814 : */
815 : List *
816 1145 : infer_arbiter_indexes(PlannerInfo *root)
817 : {
818 1145 : OnConflictExpr *onconflict = root->parse->onConflict;
819 :
820 : /* Iteration state */
821 : Index varno;
822 : RangeTblEntry *rte;
823 : Relation relation;
824 1145 : Oid indexOidFromConstraint = InvalidOid;
825 : List *indexList;
826 1145 : List *indexRelList = NIL;
827 :
828 : /*
829 : * Required attributes and expressions used to match indexes to the clause
830 : * given by the user. In the ON CONFLICT ON CONSTRAINT case, we compute
831 : * these from that constraint's index to match all other indexes, to
832 : * account for the case where that index is being concurrently reindexed.
833 : */
834 1145 : List *inferIndexExprs = (List *) onconflict->arbiterWhere;
835 1145 : Bitmapset *inferAttrs = NULL;
836 1145 : List *inferElems = NIL;
837 :
838 : /* Results */
839 1145 : List *results = NIL;
840 1145 : bool foundValid = false;
841 :
842 : /*
843 : * Quickly return NIL for ON CONFLICT DO NOTHING without an inference
844 : * specification or named constraint. ON CONFLICT DO SELECT/UPDATE
845 : * statements must always provide one or the other (but parser ought to
846 : * have caught that already).
847 : */
848 1145 : if (onconflict->arbiterElems == NIL &&
849 222 : onconflict->constraint == InvalidOid)
850 117 : return NIL;
851 :
852 : /*
853 : * We need not lock the relation since it was already locked, either by
854 : * the rewriter or when expand_inherited_rtentry() added it to the query's
855 : * rangetable.
856 : */
857 1028 : varno = root->parse->resultRelation;
858 1028 : rte = rt_fetch(varno, root->parse->rtable);
859 :
860 1028 : relation = table_open(rte->relid, NoLock);
861 :
862 : /*
863 : * Build normalized/BMS representation of plain indexed attributes, as
864 : * well as a separate list of expression items. This simplifies matching
865 : * the cataloged definition of indexes.
866 : */
867 3206 : foreach_ptr(InferenceElem, elem, onconflict->arbiterElems)
868 : {
869 : Var *var;
870 : int attno;
871 :
872 : /* we cannot also have a constraint name, per grammar */
873 : Assert(!OidIsValid(onconflict->constraint));
874 :
875 1150 : if (!IsA(elem->expr, Var))
876 : {
877 : /* If not a plain Var, just shove it in inferElems for now */
878 89 : inferElems = lappend(inferElems, elem->expr);
879 89 : continue;
880 : }
881 :
882 1061 : var = (Var *) elem->expr;
883 1061 : attno = var->varattno;
884 :
885 1061 : if (attno == 0)
886 0 : ereport(ERROR,
887 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
888 : errmsg("whole row unique index inference specifications are not supported")));
889 :
890 1061 : inferAttrs = bms_add_member(inferAttrs,
891 : attno - FirstLowInvalidHeapAttributeNumber);
892 : }
893 :
894 : /*
895 : * Next, open all the indexes. We need this list for two things: first,
896 : * if an ON CONSTRAINT clause was given, and that constraint's index is
897 : * undergoing REINDEX CONCURRENTLY, then we need to consider all matches
898 : * for that index. Second, if an attribute list was specified in the ON
899 : * CONFLICT clause, we use the list to find the indexes whose attributes
900 : * match that list.
901 : */
902 1028 : indexList = RelationGetIndexList(relation);
903 3335 : foreach_oid(indexoid, indexList)
904 : {
905 : Relation idxRel;
906 :
907 : /* obtain the same lock type that the executor will ultimately use */
908 1279 : idxRel = index_open(indexoid, rte->rellockmode);
909 1279 : indexRelList = lappend(indexRelList, idxRel);
910 : }
911 :
912 : /*
913 : * If a constraint was named in the command, look up its index. We don't
914 : * return it immediately because we need some additional sanity checks,
915 : * and also because we need to include other indexes as arbiters to
916 : * account for REINDEX CONCURRENTLY processing it.
917 : */
918 1028 : if (onconflict->constraint != InvalidOid)
919 : {
920 : /* we cannot also have an explicit list of elements, per grammar */
921 : Assert(onconflict->arbiterElems == NIL);
922 :
923 105 : indexOidFromConstraint = get_constraint_index(onconflict->constraint);
924 105 : if (indexOidFromConstraint == InvalidOid)
925 0 : ereport(ERROR,
926 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
927 : errmsg("constraint in ON CONFLICT clause has no associated index")));
928 :
929 : /*
930 : * Find the named constraint index to extract its attributes and
931 : * predicates.
932 : */
933 224 : foreach_ptr(RelationData, idxRel, indexRelList)
934 : {
935 119 : Form_pg_index idxForm = idxRel->rd_index;
936 :
937 119 : if (indexOidFromConstraint == idxForm->indexrelid)
938 : {
939 : /* Found it. */
940 : Assert(idxForm->indisready);
941 :
942 : /*
943 : * Set up inferElems and inferIndexExprs to match the
944 : * constraint index, so that we can match them in the loop
945 : * below.
946 : */
947 291 : for (int natt = 0; natt < idxForm->indnkeyatts; natt++)
948 : {
949 : int attno;
950 :
951 186 : attno = idxRel->rd_index->indkey.values[natt];
952 186 : if (attno != InvalidAttrNumber)
953 : inferAttrs =
954 177 : bms_add_member(inferAttrs,
955 : attno - FirstLowInvalidHeapAttributeNumber);
956 : }
957 :
958 105 : inferElems = RelationGetIndexExpressions(idxRel);
959 105 : inferIndexExprs = RelationGetIndexPredicate(idxRel);
960 105 : break;
961 : }
962 : }
963 : }
964 :
965 : /*
966 : * Using that representation, iterate through the list of indexes on the
967 : * target relation to find matches.
968 : */
969 3251 : foreach_ptr(RelationData, idxRel, indexRelList)
970 : {
971 : Form_pg_index idxForm;
972 : Bitmapset *indexedAttrs;
973 : List *idxExprs;
974 : List *predExprs;
975 : AttrNumber natt;
976 : bool match;
977 :
978 : /*
979 : * Extract info from the relation descriptor for the index.
980 : *
981 : * Let executor complain about !indimmediate case directly, because
982 : * enforcement needs to occur there anyway when an inference clause is
983 : * omitted.
984 : */
985 1279 : idxForm = idxRel->rd_index;
986 :
987 : /*
988 : * Ignore indexes that aren't indisready, because we cannot trust
989 : * their catalog structure yet. However, if any indexes are marked
990 : * indisready but not yet indisvalid, we still consider them, because
991 : * they might turn valid while we're running. Doing it this way
992 : * allows a concurrent transaction with a slightly later catalog
993 : * snapshot infer the same set of indexes, which is critical to
994 : * prevent spurious 'duplicate key' errors.
995 : *
996 : * However, another critical aspect is that a unique index that isn't
997 : * yet marked indisvalid=true might not be complete yet, meaning it
998 : * wouldn't detect possible duplicate rows. In order to prevent false
999 : * negatives, we require that we include in the set of inferred
1000 : * indexes at least one index that is marked valid.
1001 : */
1002 1279 : if (!idxForm->indisready)
1003 0 : continue;
1004 :
1005 : /*
1006 : * Ignore invalid indexes for partitioned tables. It's possible that
1007 : * some partitions don't have the index (yet), and then we would not
1008 : * find a match during ExecInitPartitionInfo.
1009 : */
1010 1279 : if (relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE &&
1011 126 : !idxForm->indisvalid)
1012 6 : continue;
1013 :
1014 : /*
1015 : * Note that we do not perform a check against indcheckxmin (like e.g.
1016 : * get_relation_info()) here to eliminate candidates, because
1017 : * uniqueness checking only cares about the most recently committed
1018 : * tuple versions.
1019 : */
1020 :
1021 : /*
1022 : * Look for match for "ON constraint_name" variant, which may not be a
1023 : * unique constraint. This can only be a constraint name.
1024 : */
1025 1273 : if (indexOidFromConstraint == idxForm->indexrelid)
1026 : {
1027 : /*
1028 : * ON CONFLICT DO UPDATE and ON CONFLICT DO SELECT are not
1029 : * supported with exclusion constraints.
1030 : */
1031 105 : if (idxForm->indisexclusion &&
1032 87 : (onconflict->action == ONCONFLICT_UPDATE ||
1033 48 : onconflict->action == ONCONFLICT_SELECT))
1034 42 : ereport(ERROR,
1035 : errcode(ERRCODE_WRONG_OBJECT_TYPE),
1036 : errmsg("ON CONFLICT DO %s not supported with exclusion constraints",
1037 : onconflict->action == ONCONFLICT_UPDATE ? "UPDATE" : "SELECT"));
1038 :
1039 : /* Consider this one a match already */
1040 63 : results = lappend_oid(results, idxForm->indexrelid);
1041 63 : foundValid |= idxForm->indisvalid;
1042 63 : continue;
1043 : }
1044 1168 : else if (indexOidFromConstraint != InvalidOid)
1045 : {
1046 : /*
1047 : * In the case of "ON constraint_name DO SELECT/UPDATE" we need to
1048 : * skip non-unique candidates.
1049 : */
1050 18 : if (!idxForm->indisunique &&
1051 3 : (onconflict->action == ONCONFLICT_UPDATE ||
1052 3 : onconflict->action == ONCONFLICT_SELECT))
1053 0 : continue;
1054 : }
1055 : else
1056 : {
1057 : /*
1058 : * Only considering conventional inference at this point (not
1059 : * named constraints), so index under consideration can be
1060 : * immediately skipped if it's not unique.
1061 : */
1062 1150 : if (!idxForm->indisunique)
1063 2 : continue;
1064 : }
1065 :
1066 : /*
1067 : * So-called unique constraints with WITHOUT OVERLAPS are really
1068 : * exclusion constraints, so skip those too.
1069 : */
1070 1166 : if (idxForm->indisexclusion)
1071 75 : continue;
1072 :
1073 : /* Build BMS representation of plain (non expression) index attrs */
1074 1091 : indexedAttrs = NULL;
1075 2464 : for (natt = 0; natt < idxForm->indnkeyatts; natt++)
1076 : {
1077 1373 : int attno = idxRel->rd_index->indkey.values[natt];
1078 :
1079 1373 : if (attno != 0)
1080 1213 : indexedAttrs = bms_add_member(indexedAttrs,
1081 : attno - FirstLowInvalidHeapAttributeNumber);
1082 : }
1083 :
1084 : /* Non-expression attributes (if any) must match */
1085 1091 : if (!bms_equal(indexedAttrs, inferAttrs))
1086 216 : continue;
1087 :
1088 : /* Expression attributes (if any) must match */
1089 875 : idxExprs = RelationGetIndexExpressions(idxRel);
1090 875 : if (idxExprs)
1091 : {
1092 91 : if (varno != 1)
1093 3 : ChangeVarNodes((Node *) idxExprs, 1, varno, 0);
1094 :
1095 91 : idxExprs = (List *) eval_const_expressions(root, (Node *) idxExprs);
1096 : }
1097 :
1098 : /*
1099 : * If arbiterElems are present, check them. (Note that if a
1100 : * constraint name was given in the command line, this list is NIL.)
1101 : */
1102 875 : match = true;
1103 2799 : foreach_ptr(InferenceElem, elem, onconflict->arbiterElems)
1104 : {
1105 : /*
1106 : * Ensure that collation/opclass aspects of inference expression
1107 : * element match. Even though this loop is primarily concerned
1108 : * with matching expressions, it is a convenient point to check
1109 : * this for both expressions and ordinary (non-expression)
1110 : * attributes appearing as inference elements.
1111 : */
1112 1073 : if (!infer_collation_opclass_match(elem, idxRel, idxExprs))
1113 : {
1114 18 : match = false;
1115 18 : break;
1116 : }
1117 :
1118 : /*
1119 : * Plain Vars don't factor into count of expression elements, and
1120 : * the question of whether or not they satisfy the index
1121 : * definition has already been considered (they must).
1122 : */
1123 1055 : if (IsA(elem->expr, Var))
1124 964 : continue;
1125 :
1126 : /*
1127 : * Might as well avoid redundant check in the rare cases where
1128 : * infer_collation_opclass_match() is required to do real work.
1129 : * Otherwise, check that element expression appears in cataloged
1130 : * index definition.
1131 : */
1132 91 : if (elem->infercollid != InvalidOid ||
1133 161 : elem->inferopclass != InvalidOid ||
1134 79 : list_member(idxExprs, elem->expr))
1135 85 : continue;
1136 :
1137 6 : match = false;
1138 6 : break;
1139 : }
1140 875 : if (!match)
1141 24 : continue;
1142 :
1143 : /*
1144 : * In case of inference from an attribute list, ensure that the
1145 : * expression elements from inference clause are not missing any
1146 : * cataloged expressions. This does the right thing when unique
1147 : * indexes redundantly repeat the same attribute, or if attributes
1148 : * redundantly appear multiple times within an inference clause.
1149 : *
1150 : * In case a constraint was named, ensure the candidate has an equal
1151 : * set of expressions as the named constraint's index.
1152 : */
1153 851 : if (list_difference(idxExprs, inferElems) != NIL)
1154 27 : continue;
1155 :
1156 824 : predExprs = RelationGetIndexPredicate(idxRel);
1157 824 : if (predExprs)
1158 : {
1159 37 : if (varno != 1)
1160 3 : ChangeVarNodes((Node *) predExprs, 1, varno, 0);
1161 :
1162 : predExprs = (List *)
1163 37 : eval_const_expressions(root,
1164 37 : (Node *) make_ands_explicit(predExprs));
1165 37 : predExprs = make_ands_implicit((Expr *) predExprs);
1166 : }
1167 :
1168 : /*
1169 : * Partial indexes affect each form of ON CONFLICT differently: if a
1170 : * constraint was named, then the predicates must be identical. In
1171 : * conventional inference, the index's predicate must be implied by
1172 : * the WHERE clause.
1173 : */
1174 824 : if (OidIsValid(indexOidFromConstraint))
1175 : {
1176 6 : if (list_difference(predExprs, inferIndexExprs) != NIL)
1177 0 : continue;
1178 : }
1179 : else
1180 : {
1181 818 : if (!predicate_implied_by(predExprs, inferIndexExprs, false))
1182 18 : continue;
1183 : }
1184 :
1185 : /* All good -- consider this index a match */
1186 806 : results = lappend_oid(results, idxForm->indexrelid);
1187 806 : foundValid |= idxForm->indisvalid;
1188 : }
1189 :
1190 : /* Close all indexes */
1191 3209 : foreach_ptr(RelationData, idxRel, indexRelList)
1192 : {
1193 1237 : index_close(idxRel, NoLock);
1194 : }
1195 :
1196 986 : list_free(indexList);
1197 986 : list_free(indexRelList);
1198 986 : table_close(relation, NoLock);
1199 :
1200 : /* We require at least one indisvalid index */
1201 986 : if (results == NIL || !foundValid)
1202 160 : ereport(ERROR,
1203 : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1204 : errmsg("there is no unique or exclusion constraint matching the ON CONFLICT specification")));
1205 :
1206 826 : return results;
1207 : }
1208 :
1209 : /*
1210 : * infer_collation_opclass_match - ensure infer element opclass/collation match
1211 : *
1212 : * Given unique index inference element from inference specification, if
1213 : * collation was specified, or if opclass was specified, verify that there is
1214 : * at least one matching indexed attribute (occasionally, there may be more).
1215 : * Skip this in the common case where inference specification does not include
1216 : * collation or opclass (instead matching everything, regardless of cataloged
1217 : * collation/opclass of indexed attribute).
1218 : *
1219 : * At least historically, Postgres has not offered collations or opclasses
1220 : * with alternative-to-default notions of equality, so these additional
1221 : * criteria should only be required infrequently.
1222 : *
1223 : * Don't give up immediately when an inference element matches some attribute
1224 : * cataloged as indexed but not matching additional opclass/collation
1225 : * criteria. This is done so that the implementation is as forgiving as
1226 : * possible of redundancy within cataloged index attributes (or, less
1227 : * usefully, within inference specification elements). If collations actually
1228 : * differ between apparently redundantly indexed attributes (redundant within
1229 : * or across indexes), then there really is no redundancy as such.
1230 : *
1231 : * Note that if an inference element specifies an opclass and a collation at
1232 : * once, both must match in at least one particular attribute within index
1233 : * catalog definition in order for that inference element to be considered
1234 : * inferred/satisfied.
1235 : */
1236 : static bool
1237 1073 : infer_collation_opclass_match(InferenceElem *elem, Relation idxRel,
1238 : List *idxExprs)
1239 : {
1240 : AttrNumber natt;
1241 1073 : Oid inferopfamily = InvalidOid; /* OID of opclass opfamily */
1242 1073 : Oid inferopcinputtype = InvalidOid; /* OID of opclass input type */
1243 1073 : int nplain = 0; /* # plain attrs observed */
1244 :
1245 : /*
1246 : * If inference specification element lacks collation/opclass, then no
1247 : * need to check for exact match.
1248 : */
1249 1073 : if (elem->infercollid == InvalidOid && elem->inferopclass == InvalidOid)
1250 1016 : return true;
1251 :
1252 : /*
1253 : * Lookup opfamily and input type, for matching indexes
1254 : */
1255 57 : if (elem->inferopclass)
1256 : {
1257 42 : inferopfamily = get_opclass_family(elem->inferopclass);
1258 42 : inferopcinputtype = get_opclass_input_type(elem->inferopclass);
1259 : }
1260 :
1261 123 : for (natt = 1; natt <= idxRel->rd_att->natts; natt++)
1262 : {
1263 105 : Oid opfamily = idxRel->rd_opfamily[natt - 1];
1264 105 : Oid opcinputtype = idxRel->rd_opcintype[natt - 1];
1265 105 : Oid collation = idxRel->rd_indcollation[natt - 1];
1266 105 : int attno = idxRel->rd_index->indkey.values[natt - 1];
1267 :
1268 105 : if (attno != 0)
1269 84 : nplain++;
1270 :
1271 105 : if (elem->inferopclass != InvalidOid &&
1272 33 : (inferopfamily != opfamily || inferopcinputtype != opcinputtype))
1273 : {
1274 : /* Attribute needed to match opclass, but didn't */
1275 45 : continue;
1276 : }
1277 :
1278 60 : if (elem->infercollid != InvalidOid &&
1279 42 : elem->infercollid != collation)
1280 : {
1281 : /* Attribute needed to match collation, but didn't */
1282 18 : continue;
1283 : }
1284 :
1285 : /* If one matching index att found, good enough -- return true */
1286 42 : if (IsA(elem->expr, Var))
1287 : {
1288 27 : if (((Var *) elem->expr)->varattno == attno)
1289 27 : return true;
1290 : }
1291 15 : else if (attno == 0)
1292 : {
1293 15 : Node *nattExpr = list_nth(idxExprs, (natt - 1) - nplain);
1294 :
1295 : /*
1296 : * Note that unlike routines like match_index_to_operand() we
1297 : * don't need to care about RelabelType. Neither the index
1298 : * definition nor the inference clause should contain them.
1299 : */
1300 15 : if (equal(elem->expr, nattExpr))
1301 12 : return true;
1302 : }
1303 : }
1304 :
1305 18 : return false;
1306 : }
1307 :
1308 : /*
1309 : * estimate_rel_size - estimate # pages and # tuples in a table or index
1310 : *
1311 : * We also estimate the fraction of the pages that are marked all-visible in
1312 : * the visibility map, for use in estimation of index-only scans.
1313 : *
1314 : * If attr_widths isn't NULL, it points to the zero-index entry of the
1315 : * relation's attr_widths[] cache; we fill this in if we have need to compute
1316 : * the attribute widths for estimation purposes.
1317 : */
1318 : void
1319 235912 : estimate_rel_size(Relation rel, int32 *attr_widths,
1320 : BlockNumber *pages, double *tuples, double *allvisfrac)
1321 : {
1322 : BlockNumber curpages;
1323 : BlockNumber relpages;
1324 : double reltuples;
1325 : BlockNumber relallvisible;
1326 : double density;
1327 :
1328 235912 : if (RELKIND_HAS_TABLE_AM(rel->rd_rel->relkind))
1329 : {
1330 234094 : table_relation_estimate_size(rel, attr_widths, pages, tuples,
1331 : allvisfrac);
1332 : }
1333 1818 : else if (rel->rd_rel->relkind == RELKIND_INDEX)
1334 : {
1335 : /*
1336 : * XXX: It'd probably be good to move this into a callback, individual
1337 : * index types e.g. know if they have a metapage.
1338 : */
1339 :
1340 : /* it has storage, ok to call the smgr */
1341 526 : curpages = RelationGetNumberOfBlocks(rel);
1342 :
1343 : /* report estimated # pages */
1344 526 : *pages = curpages;
1345 : /* quick exit if rel is clearly empty */
1346 526 : if (curpages == 0)
1347 : {
1348 0 : *tuples = 0;
1349 0 : *allvisfrac = 0;
1350 0 : return;
1351 : }
1352 :
1353 : /* coerce values in pg_class to more desirable types */
1354 526 : relpages = (BlockNumber) rel->rd_rel->relpages;
1355 526 : reltuples = (double) rel->rd_rel->reltuples;
1356 526 : relallvisible = (BlockNumber) rel->rd_rel->relallvisible;
1357 :
1358 : /*
1359 : * Discount the metapage while estimating the number of tuples. This
1360 : * is a kluge because it assumes more than it ought to about index
1361 : * structure. Currently it's OK for btree, hash, and GIN indexes but
1362 : * suspect for GiST indexes.
1363 : */
1364 526 : if (relpages > 0)
1365 : {
1366 517 : curpages--;
1367 517 : relpages--;
1368 : }
1369 :
1370 : /* estimate number of tuples from previous tuple density */
1371 526 : if (reltuples >= 0 && relpages > 0)
1372 357 : density = reltuples / (double) relpages;
1373 : else
1374 : {
1375 : /*
1376 : * If we have no data because the relation was never vacuumed,
1377 : * estimate tuple width from attribute datatypes. We assume here
1378 : * that the pages are completely full, which is OK for tables
1379 : * (since they've presumably not been VACUUMed yet) but is
1380 : * probably an overestimate for indexes. Fortunately
1381 : * get_relation_info() can clamp the overestimate to the parent
1382 : * table's size.
1383 : *
1384 : * Note: this code intentionally disregards alignment
1385 : * considerations, because (a) that would be gilding the lily
1386 : * considering how crude the estimate is, and (b) it creates
1387 : * platform dependencies in the default plans which are kind of a
1388 : * headache for regression testing.
1389 : *
1390 : * XXX: Should this logic be more index specific?
1391 : */
1392 : int32 tuple_width;
1393 :
1394 169 : tuple_width = get_rel_data_width(rel, attr_widths);
1395 169 : tuple_width += MAXALIGN(SizeofHeapTupleHeader);
1396 169 : tuple_width += sizeof(ItemIdData);
1397 : /* note: integer division is intentional here */
1398 169 : density = (BLCKSZ - SizeOfPageHeaderData) / tuple_width;
1399 : }
1400 526 : *tuples = rint(density * (double) curpages);
1401 :
1402 : /*
1403 : * We use relallvisible as-is, rather than scaling it up like we do
1404 : * for the pages and tuples counts, on the theory that any pages added
1405 : * since the last VACUUM are most likely not marked all-visible. But
1406 : * costsize.c wants it converted to a fraction.
1407 : */
1408 526 : if (relallvisible == 0 || curpages <= 0)
1409 526 : *allvisfrac = 0;
1410 0 : else if ((double) relallvisible >= curpages)
1411 0 : *allvisfrac = 1;
1412 : else
1413 0 : *allvisfrac = (double) relallvisible / curpages;
1414 : }
1415 : else
1416 : {
1417 : /*
1418 : * Just use whatever's in pg_class. This covers foreign tables,
1419 : * sequences, and also relkinds without storage (shouldn't get here?);
1420 : * see initializations in AddNewRelationTuple(). Note that FDW must
1421 : * cope if reltuples is -1!
1422 : */
1423 1292 : *pages = rel->rd_rel->relpages;
1424 1292 : *tuples = rel->rd_rel->reltuples;
1425 1292 : *allvisfrac = 0;
1426 : }
1427 : }
1428 :
1429 :
1430 : /*
1431 : * get_rel_data_width
1432 : *
1433 : * Estimate the average width of (the data part of) the relation's tuples.
1434 : *
1435 : * If attr_widths isn't NULL, it points to the zero-index entry of the
1436 : * relation's attr_widths[] cache; use and update that cache as appropriate.
1437 : *
1438 : * Currently we ignore dropped columns. Ideally those should be included
1439 : * in the result, but we haven't got any way to get info about them; and
1440 : * since they might be mostly NULLs, treating them as zero-width is not
1441 : * necessarily the wrong thing anyway.
1442 : */
1443 : int32
1444 81007 : get_rel_data_width(Relation rel, int32 *attr_widths)
1445 : {
1446 81007 : int64 tuple_width = 0;
1447 : int i;
1448 :
1449 437781 : for (i = 1; i <= RelationGetNumberOfAttributes(rel); i++)
1450 : {
1451 356774 : Form_pg_attribute att = TupleDescAttr(rel->rd_att, i - 1);
1452 : int32 item_width;
1453 :
1454 356774 : if (att->attisdropped)
1455 1348 : continue;
1456 :
1457 : /* use previously cached data, if any */
1458 355426 : if (attr_widths != NULL && attr_widths[i] > 0)
1459 : {
1460 2924 : tuple_width += attr_widths[i];
1461 2924 : continue;
1462 : }
1463 :
1464 : /* This should match set_rel_width() in costsize.c */
1465 352502 : item_width = get_attavgwidth(RelationGetRelid(rel), i);
1466 352502 : if (item_width <= 0)
1467 : {
1468 351575 : item_width = get_typavgwidth(att->atttypid, att->atttypmod);
1469 : Assert(item_width > 0);
1470 : }
1471 352502 : if (attr_widths != NULL)
1472 313403 : attr_widths[i] = item_width;
1473 352502 : tuple_width += item_width;
1474 : }
1475 :
1476 81007 : return clamp_width_est(tuple_width);
1477 : }
1478 :
1479 : /*
1480 : * get_relation_data_width
1481 : *
1482 : * External API for get_rel_data_width: same behavior except we have to
1483 : * open the relcache entry.
1484 : */
1485 : int32
1486 1278 : get_relation_data_width(Oid relid, int32 *attr_widths)
1487 : {
1488 : int32 result;
1489 : Relation relation;
1490 :
1491 : /* As above, assume relation is already locked */
1492 1278 : relation = table_open(relid, NoLock);
1493 :
1494 1278 : result = get_rel_data_width(relation, attr_widths);
1495 :
1496 1278 : table_close(relation, NoLock);
1497 :
1498 1278 : return result;
1499 : }
1500 :
1501 :
1502 : /*
1503 : * get_relation_constraints
1504 : *
1505 : * Retrieve the applicable constraint expressions of the given relation.
1506 : * Only constraints that have been validated are considered.
1507 : *
1508 : * Returns a List (possibly empty) of constraint expressions. Each one
1509 : * has been canonicalized, and its Vars are changed to have the varno
1510 : * indicated by rel->relid. This allows the expressions to be easily
1511 : * compared to expressions taken from WHERE.
1512 : *
1513 : * If include_noinherit is true, it's okay to include constraints that
1514 : * are marked NO INHERIT.
1515 : *
1516 : * If include_notnull is true, "col IS NOT NULL" expressions are generated
1517 : * and added to the result for each column that's marked attnotnull.
1518 : *
1519 : * If include_partition is true, and the relation is a partition,
1520 : * also include the partitioning constraints.
1521 : *
1522 : * Note: at present this is invoked at most once per relation per planner
1523 : * run, and in many cases it won't be invoked at all, so there seems no
1524 : * point in caching the data in RelOptInfo.
1525 : */
1526 : static List *
1527 10830 : get_relation_constraints(PlannerInfo *root,
1528 : Oid relationObjectId, RelOptInfo *rel,
1529 : bool include_noinherit,
1530 : bool include_notnull,
1531 : bool include_partition)
1532 : {
1533 10830 : List *result = NIL;
1534 10830 : Index varno = rel->relid;
1535 : Relation relation;
1536 : TupleConstr *constr;
1537 :
1538 : /*
1539 : * We assume the relation has already been safely locked.
1540 : */
1541 10830 : relation = table_open(relationObjectId, NoLock);
1542 :
1543 10830 : constr = relation->rd_att->constr;
1544 10830 : if (constr != NULL)
1545 : {
1546 4185 : int num_check = constr->num_check;
1547 : int i;
1548 :
1549 4504 : for (i = 0; i < num_check; i++)
1550 : {
1551 : Node *cexpr;
1552 :
1553 : /*
1554 : * If this constraint hasn't been fully validated yet, we must
1555 : * ignore it here.
1556 : */
1557 319 : if (!constr->check[i].ccvalid)
1558 27 : continue;
1559 :
1560 : /*
1561 : * NOT ENFORCED constraints are always marked as invalid, which
1562 : * should have been ignored.
1563 : */
1564 : Assert(constr->check[i].ccenforced);
1565 :
1566 : /*
1567 : * Also ignore if NO INHERIT and we weren't told that that's safe.
1568 : */
1569 292 : if (constr->check[i].ccnoinherit && !include_noinherit)
1570 0 : continue;
1571 :
1572 292 : cexpr = stringToNode(constr->check[i].ccbin);
1573 :
1574 : /*
1575 : * Fix Vars to have the desired varno. This must be done before
1576 : * const-simplification because eval_const_expressions reduces
1577 : * NullTest for Vars based on varno.
1578 : */
1579 292 : if (varno != 1)
1580 280 : ChangeVarNodes(cexpr, 1, varno, 0);
1581 :
1582 : /*
1583 : * Run each expression through const-simplification and
1584 : * canonicalization. This is not just an optimization, but is
1585 : * necessary, because we will be comparing it to
1586 : * similarly-processed qual clauses, and may fail to detect valid
1587 : * matches without this. This must match the processing done to
1588 : * qual clauses in preprocess_expression()! (We can skip the
1589 : * stuff involving subqueries, however, since we don't allow any
1590 : * in check constraints.)
1591 : */
1592 292 : cexpr = eval_const_expressions(root, cexpr);
1593 :
1594 292 : cexpr = (Node *) canonicalize_qual((Expr *) cexpr, true);
1595 :
1596 : /*
1597 : * Finally, convert to implicit-AND format (that is, a List) and
1598 : * append the resulting item(s) to our output list.
1599 : */
1600 292 : result = list_concat(result,
1601 292 : make_ands_implicit((Expr *) cexpr));
1602 : }
1603 :
1604 : /* Add NOT NULL constraints in expression form, if requested */
1605 4185 : if (include_notnull && constr->has_not_null)
1606 : {
1607 3940 : int natts = relation->rd_att->natts;
1608 :
1609 16101 : for (i = 1; i <= natts; i++)
1610 : {
1611 12161 : CompactAttribute *att = TupleDescCompactAttr(relation->rd_att, i - 1);
1612 :
1613 12161 : if (att->attnullability == ATTNULLABLE_VALID && !att->attisdropped)
1614 : {
1615 4841 : Form_pg_attribute wholeatt = TupleDescAttr(relation->rd_att, i - 1);
1616 4841 : NullTest *ntest = makeNode(NullTest);
1617 :
1618 4841 : ntest->arg = (Expr *) makeVar(varno,
1619 : i,
1620 : wholeatt->atttypid,
1621 : wholeatt->atttypmod,
1622 : wholeatt->attcollation,
1623 : 0);
1624 4841 : ntest->nulltesttype = IS_NOT_NULL;
1625 :
1626 : /*
1627 : * argisrow=false is correct even for a composite column,
1628 : * because attnotnull does not represent a SQL-spec IS NOT
1629 : * NULL test in such a case, just IS DISTINCT FROM NULL.
1630 : */
1631 4841 : ntest->argisrow = false;
1632 4841 : ntest->location = -1;
1633 4841 : result = lappend(result, ntest);
1634 : }
1635 : }
1636 : }
1637 : }
1638 :
1639 : /*
1640 : * Add partitioning constraints, if requested.
1641 : */
1642 10830 : if (include_partition && relation->rd_rel->relispartition)
1643 : {
1644 : /* make sure rel->partition_qual is set */
1645 6 : set_baserel_partition_constraint(relation, rel);
1646 6 : result = list_concat(result, rel->partition_qual);
1647 : }
1648 :
1649 : /*
1650 : * Expand virtual generated columns in the constraint expressions.
1651 : */
1652 10830 : if (result)
1653 4054 : result = (List *) expand_generated_columns_in_expr((Node *) result,
1654 : relation,
1655 : varno);
1656 :
1657 10830 : table_close(relation, NoLock);
1658 :
1659 10830 : return result;
1660 : }
1661 :
1662 : /*
1663 : * Try loading data for the statistics object.
1664 : *
1665 : * We don't know if the data (specified by statOid and inh value) exist.
1666 : * The result is stored in stainfos list.
1667 : */
1668 : static void
1669 2028 : get_relation_statistics_worker(List **stainfos, RelOptInfo *rel,
1670 : Oid statOid, bool inh,
1671 : Bitmapset *keys, List *exprs)
1672 : {
1673 : Form_pg_statistic_ext_data dataForm;
1674 : HeapTuple dtup;
1675 :
1676 2028 : dtup = SearchSysCache2(STATEXTDATASTXOID,
1677 : ObjectIdGetDatum(statOid), BoolGetDatum(inh));
1678 2028 : if (!HeapTupleIsValid(dtup))
1679 1024 : return;
1680 :
1681 1004 : dataForm = (Form_pg_statistic_ext_data) GETSTRUCT(dtup);
1682 :
1683 : /* add one StatisticExtInfo for each kind built */
1684 1004 : if (statext_is_kind_built(dtup, STATS_EXT_NDISTINCT))
1685 : {
1686 359 : StatisticExtInfo *info = makeNode(StatisticExtInfo);
1687 :
1688 359 : info->statOid = statOid;
1689 359 : info->inherit = dataForm->stxdinherit;
1690 359 : info->rel = rel;
1691 359 : info->kind = STATS_EXT_NDISTINCT;
1692 359 : info->keys = bms_copy(keys);
1693 359 : info->exprs = exprs;
1694 :
1695 359 : *stainfos = lappend(*stainfos, info);
1696 : }
1697 :
1698 1004 : if (statext_is_kind_built(dtup, STATS_EXT_DEPENDENCIES))
1699 : {
1700 266 : StatisticExtInfo *info = makeNode(StatisticExtInfo);
1701 :
1702 266 : info->statOid = statOid;
1703 266 : info->inherit = dataForm->stxdinherit;
1704 266 : info->rel = rel;
1705 266 : info->kind = STATS_EXT_DEPENDENCIES;
1706 266 : info->keys = bms_copy(keys);
1707 266 : info->exprs = exprs;
1708 :
1709 266 : *stainfos = lappend(*stainfos, info);
1710 : }
1711 :
1712 1004 : if (statext_is_kind_built(dtup, STATS_EXT_MCV))
1713 : {
1714 443 : StatisticExtInfo *info = makeNode(StatisticExtInfo);
1715 :
1716 443 : info->statOid = statOid;
1717 443 : info->inherit = dataForm->stxdinherit;
1718 443 : info->rel = rel;
1719 443 : info->kind = STATS_EXT_MCV;
1720 443 : info->keys = bms_copy(keys);
1721 443 : info->exprs = exprs;
1722 :
1723 443 : *stainfos = lappend(*stainfos, info);
1724 : }
1725 :
1726 1004 : if (statext_is_kind_built(dtup, STATS_EXT_EXPRESSIONS))
1727 : {
1728 407 : StatisticExtInfo *info = makeNode(StatisticExtInfo);
1729 :
1730 407 : info->statOid = statOid;
1731 407 : info->inherit = dataForm->stxdinherit;
1732 407 : info->rel = rel;
1733 407 : info->kind = STATS_EXT_EXPRESSIONS;
1734 407 : info->keys = bms_copy(keys);
1735 407 : info->exprs = exprs;
1736 :
1737 407 : *stainfos = lappend(*stainfos, info);
1738 : }
1739 :
1740 1004 : ReleaseSysCache(dtup);
1741 : }
1742 :
1743 : /*
1744 : * get_relation_statistics
1745 : * Retrieve extended statistics defined on the table.
1746 : *
1747 : * Returns a List (possibly empty) of StatisticExtInfo objects describing
1748 : * the statistics. Note that this doesn't load the actual statistics data,
1749 : * just the identifying metadata. Only stats actually built are considered.
1750 : */
1751 : static List *
1752 246825 : get_relation_statistics(PlannerInfo *root, RelOptInfo *rel,
1753 : Relation relation)
1754 : {
1755 246825 : Index varno = rel->relid;
1756 : List *statoidlist;
1757 246825 : List *stainfos = NIL;
1758 : ListCell *l;
1759 :
1760 246825 : statoidlist = RelationGetStatExtList(relation);
1761 :
1762 247839 : foreach(l, statoidlist)
1763 : {
1764 1014 : Oid statOid = lfirst_oid(l);
1765 : Form_pg_statistic_ext staForm;
1766 : HeapTuple htup;
1767 1014 : Bitmapset *keys = NULL;
1768 1014 : List *exprs = NIL;
1769 : int i;
1770 :
1771 1014 : htup = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(statOid));
1772 1014 : if (!HeapTupleIsValid(htup))
1773 0 : elog(ERROR, "cache lookup failed for statistics object %u", statOid);
1774 1014 : staForm = (Form_pg_statistic_ext) GETSTRUCT(htup);
1775 :
1776 : /*
1777 : * First, build the array of columns covered. This is ultimately
1778 : * wasted if no stats within the object have actually been built, but
1779 : * it doesn't seem worth troubling over that case.
1780 : */
1781 2877 : for (i = 0; i < staForm->stxkeys.dim1; i++)
1782 1863 : keys = bms_add_member(keys, staForm->stxkeys.values[i]);
1783 :
1784 : /*
1785 : * Preprocess expressions (if any). We read the expressions, fix the
1786 : * varnos, and run them through eval_const_expressions.
1787 : *
1788 : * XXX We don't know yet if there are any data for this stats object,
1789 : * with either stxdinherit value. But it's reasonable to assume there
1790 : * is at least one of those, possibly both. So it's better to process
1791 : * keys and expressions here.
1792 : */
1793 : {
1794 : bool isnull;
1795 : Datum datum;
1796 :
1797 : /* decode expression (if any) */
1798 1014 : datum = SysCacheGetAttr(STATEXTOID, htup,
1799 : Anum_pg_statistic_ext_stxexprs, &isnull);
1800 :
1801 1014 : if (!isnull)
1802 : {
1803 : char *exprsString;
1804 :
1805 412 : exprsString = TextDatumGetCString(datum);
1806 412 : exprs = (List *) stringToNode(exprsString);
1807 412 : pfree(exprsString);
1808 :
1809 : /*
1810 : * Modify the copies we obtain from the relcache to have the
1811 : * correct varno for the parent relation, so that they match
1812 : * up correctly against qual clauses.
1813 : *
1814 : * This must be done before const-simplification because
1815 : * eval_const_expressions reduces NullTest for Vars based on
1816 : * varno.
1817 : */
1818 412 : if (varno != 1)
1819 0 : ChangeVarNodes((Node *) exprs, 1, varno, 0);
1820 :
1821 : /*
1822 : * Run the expressions through eval_const_expressions. This is
1823 : * not just an optimization, but is necessary, because the
1824 : * planner will be comparing them to similarly-processed qual
1825 : * clauses, and may fail to detect valid matches without this.
1826 : * We must not use canonicalize_qual, however, since these
1827 : * aren't qual expressions.
1828 : */
1829 412 : exprs = (List *) eval_const_expressions(root, (Node *) exprs);
1830 :
1831 : /* May as well fix opfuncids too */
1832 412 : fix_opfuncids((Node *) exprs);
1833 : }
1834 : }
1835 :
1836 : /* extract statistics for possible values of stxdinherit flag */
1837 :
1838 1014 : get_relation_statistics_worker(&stainfos, rel, statOid, true, keys, exprs);
1839 :
1840 1014 : get_relation_statistics_worker(&stainfos, rel, statOid, false, keys, exprs);
1841 :
1842 1014 : ReleaseSysCache(htup);
1843 1014 : bms_free(keys);
1844 : }
1845 :
1846 246825 : list_free(statoidlist);
1847 :
1848 246825 : return stainfos;
1849 : }
1850 :
1851 : /*
1852 : * relation_excluded_by_constraints
1853 : *
1854 : * Detect whether the relation need not be scanned because it has either
1855 : * self-inconsistent restrictions, or restrictions inconsistent with the
1856 : * relation's applicable constraints.
1857 : *
1858 : * Note: this examines only rel->relid, rel->reloptkind, and
1859 : * rel->baserestrictinfo; therefore it can be called before filling in
1860 : * other fields of the RelOptInfo.
1861 : */
1862 : bool
1863 273412 : relation_excluded_by_constraints(PlannerInfo *root,
1864 : RelOptInfo *rel, RangeTblEntry *rte)
1865 : {
1866 : bool include_noinherit;
1867 : bool include_notnull;
1868 273412 : bool include_partition = false;
1869 : List *safe_restrictions;
1870 : List *constraint_pred;
1871 : List *safe_constraints;
1872 : ListCell *lc;
1873 :
1874 : /* As of now, constraint exclusion works only with simple relations. */
1875 : Assert(IS_SIMPLE_REL(rel));
1876 :
1877 : /*
1878 : * If there are no base restriction clauses, we have no hope of proving
1879 : * anything below, so fall out quickly.
1880 : */
1881 273412 : if (rel->baserestrictinfo == NIL)
1882 125503 : return false;
1883 :
1884 : /*
1885 : * Regardless of the setting of constraint_exclusion, detect
1886 : * constant-FALSE-or-NULL restriction clauses. Although const-folding
1887 : * will reduce "anything AND FALSE" to just "FALSE", the baserestrictinfo
1888 : * list can still have other members besides the FALSE constant, due to
1889 : * qual pushdown and other mechanisms; so check them all. This doesn't
1890 : * fire very often, but it seems cheap enough to be worth doing anyway.
1891 : * (Without this, we'd miss some optimizations that 9.5 and earlier found
1892 : * via much more roundabout methods.)
1893 : */
1894 367420 : foreach(lc, rel->baserestrictinfo)
1895 : {
1896 219843 : RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1897 219843 : Expr *clause = rinfo->clause;
1898 :
1899 219843 : if (clause && IsA(clause, Const) &&
1900 332 : (((Const *) clause)->constisnull ||
1901 329 : !DatumGetBool(((Const *) clause)->constvalue)))
1902 332 : return true;
1903 : }
1904 :
1905 : /*
1906 : * Skip further tests, depending on constraint_exclusion.
1907 : */
1908 147577 : switch (constraint_exclusion)
1909 : {
1910 27 : case CONSTRAINT_EXCLUSION_OFF:
1911 : /* In 'off' mode, never make any further tests */
1912 27 : return false;
1913 :
1914 147478 : case CONSTRAINT_EXCLUSION_PARTITION:
1915 :
1916 : /*
1917 : * When constraint_exclusion is set to 'partition' we only handle
1918 : * appendrel members. Partition pruning has already been applied,
1919 : * so there is no need to consider the rel's partition constraints
1920 : * here.
1921 : */
1922 147478 : if (rel->reloptkind == RELOPT_OTHER_MEMBER_REL)
1923 10937 : break; /* appendrel member, so process it */
1924 136541 : return false;
1925 :
1926 72 : case CONSTRAINT_EXCLUSION_ON:
1927 :
1928 : /*
1929 : * In 'on' mode, always apply constraint exclusion. If we are
1930 : * considering a baserel that is a partition (i.e., it was
1931 : * directly named rather than expanded from a parent table), then
1932 : * its partition constraints haven't been considered yet, so
1933 : * include them in the processing here.
1934 : */
1935 72 : if (rel->reloptkind == RELOPT_BASEREL)
1936 57 : include_partition = true;
1937 72 : break; /* always try to exclude */
1938 : }
1939 :
1940 : /*
1941 : * Check for self-contradictory restriction clauses. We dare not make
1942 : * deductions with non-immutable functions, but any immutable clauses that
1943 : * are self-contradictory allow us to conclude the scan is unnecessary.
1944 : *
1945 : * Note: strip off RestrictInfo because predicate_refuted_by() isn't
1946 : * expecting to see any in its predicate argument.
1947 : */
1948 11009 : safe_restrictions = NIL;
1949 25947 : foreach(lc, rel->baserestrictinfo)
1950 : {
1951 14938 : RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1952 :
1953 14938 : if (!contain_mutable_functions((Node *) rinfo->clause))
1954 14168 : safe_restrictions = lappend(safe_restrictions, rinfo->clause);
1955 : }
1956 :
1957 : /*
1958 : * We can use weak refutation here, since we're comparing restriction
1959 : * clauses with restriction clauses.
1960 : */
1961 11009 : if (predicate_refuted_by(safe_restrictions, safe_restrictions, true))
1962 36 : return true;
1963 :
1964 : /*
1965 : * Only plain relations have constraints, so stop here for other rtekinds.
1966 : */
1967 10973 : if (rte->rtekind != RTE_RELATION)
1968 143 : return false;
1969 :
1970 : /*
1971 : * If we are scanning just this table, we can use NO INHERIT constraints,
1972 : * but not if we're scanning its children too. (Note that partitioned
1973 : * tables should never have NO INHERIT constraints; but it's not necessary
1974 : * for us to assume that here.)
1975 : */
1976 10830 : include_noinherit = !rte->inh;
1977 :
1978 : /*
1979 : * Currently, attnotnull constraints must be treated as NO INHERIT unless
1980 : * this is a partitioned table. In future we might track their
1981 : * inheritance status more accurately, allowing this to be refined.
1982 : *
1983 : * XXX do we need/want to change this?
1984 : */
1985 10830 : include_notnull = (!rte->inh || rte->relkind == RELKIND_PARTITIONED_TABLE);
1986 :
1987 : /*
1988 : * Fetch the appropriate set of constraint expressions.
1989 : */
1990 10830 : constraint_pred = get_relation_constraints(root, rte->relid, rel,
1991 : include_noinherit,
1992 : include_notnull,
1993 : include_partition);
1994 :
1995 : /*
1996 : * We do not currently enforce that CHECK constraints contain only
1997 : * immutable functions, so it's necessary to check here. We daren't draw
1998 : * conclusions from plan-time evaluation of non-immutable functions. Since
1999 : * they're ANDed, we can just ignore any mutable constraints in the list,
2000 : * and reason about the rest.
2001 : */
2002 10830 : safe_constraints = NIL;
2003 16053 : foreach(lc, constraint_pred)
2004 : {
2005 5223 : Node *pred = (Node *) lfirst(lc);
2006 :
2007 5223 : if (!contain_mutable_functions(pred))
2008 5223 : safe_constraints = lappend(safe_constraints, pred);
2009 : }
2010 :
2011 : /*
2012 : * The constraints are effectively ANDed together, so we can just try to
2013 : * refute the entire collection at once. This may allow us to make proofs
2014 : * that would fail if we took them individually.
2015 : *
2016 : * Note: we use rel->baserestrictinfo, not safe_restrictions as might seem
2017 : * an obvious optimization. Some of the clauses might be OR clauses that
2018 : * have volatile and nonvolatile subclauses, and it's OK to make
2019 : * deductions with the nonvolatile parts.
2020 : *
2021 : * We need strong refutation because we have to prove that the constraints
2022 : * would yield false, not just NULL.
2023 : */
2024 10830 : if (predicate_refuted_by(safe_constraints, rel->baserestrictinfo, false))
2025 96 : return true;
2026 :
2027 10734 : return false;
2028 : }
2029 :
2030 :
2031 : /*
2032 : * build_physical_tlist
2033 : *
2034 : * Build a targetlist consisting of exactly the relation's user attributes,
2035 : * in order. The executor can special-case such tlists to avoid a projection
2036 : * step at runtime, so we use such tlists preferentially for scan nodes.
2037 : *
2038 : * Exception: if there are any dropped or missing columns, we punt and return
2039 : * NIL. Ideally we would like to handle these cases too. However this
2040 : * creates problems for ExecTypeFromTL, which may be asked to build a tupdesc
2041 : * for a tlist that includes vars of no-longer-existent types. In theory we
2042 : * could dig out the required info from the pg_attribute entries of the
2043 : * relation, but that data is not readily available to ExecTypeFromTL.
2044 : * For now, we don't apply the physical-tlist optimization when there are
2045 : * dropped cols.
2046 : *
2047 : * We also support building a "physical" tlist for subqueries, functions,
2048 : * values lists, table expressions, and CTEs, since the same optimization can
2049 : * occur in SubqueryScan, FunctionScan, ValuesScan, CteScan, TableFunc,
2050 : * NamedTuplestoreScan, and WorkTableScan nodes.
2051 : */
2052 : List *
2053 99485 : build_physical_tlist(PlannerInfo *root, RelOptInfo *rel)
2054 : {
2055 99485 : List *tlist = NIL;
2056 99485 : Index varno = rel->relid;
2057 99485 : RangeTblEntry *rte = planner_rt_fetch(varno, root);
2058 : Relation relation;
2059 : Query *subquery;
2060 : Var *var;
2061 : ListCell *l;
2062 : int attrno,
2063 : numattrs;
2064 : List *colvars;
2065 :
2066 99485 : switch (rte->rtekind)
2067 : {
2068 82900 : case RTE_RELATION:
2069 : /* Assume we already have adequate lock */
2070 82900 : relation = table_open(rte->relid, NoLock);
2071 :
2072 82900 : numattrs = RelationGetNumberOfAttributes(relation);
2073 1470455 : for (attrno = 1; attrno <= numattrs; attrno++)
2074 : {
2075 1387624 : Form_pg_attribute att_tup = TupleDescAttr(relation->rd_att,
2076 : attrno - 1);
2077 :
2078 1387624 : if (att_tup->attisdropped || att_tup->atthasmissing)
2079 : {
2080 : /* found a dropped or missing col, so punt */
2081 69 : tlist = NIL;
2082 69 : break;
2083 : }
2084 :
2085 1387555 : var = makeVar(varno,
2086 : attrno,
2087 : att_tup->atttypid,
2088 : att_tup->atttypmod,
2089 : att_tup->attcollation,
2090 : 0);
2091 :
2092 1387555 : tlist = lappend(tlist,
2093 1387555 : makeTargetEntry((Expr *) var,
2094 : attrno,
2095 : NULL,
2096 : false));
2097 : }
2098 :
2099 82900 : table_close(relation, NoLock);
2100 82900 : break;
2101 :
2102 4134 : case RTE_SUBQUERY:
2103 4134 : subquery = rte->subquery;
2104 13694 : foreach(l, subquery->targetList)
2105 : {
2106 9560 : TargetEntry *tle = (TargetEntry *) lfirst(l);
2107 :
2108 : /*
2109 : * A resjunk column of the subquery can be reflected as
2110 : * resjunk in the physical tlist; we need not punt.
2111 : */
2112 9560 : var = makeVarFromTargetEntry(varno, tle);
2113 :
2114 9560 : tlist = lappend(tlist,
2115 9560 : makeTargetEntry((Expr *) var,
2116 9560 : tle->resno,
2117 : NULL,
2118 9560 : tle->resjunk));
2119 : }
2120 4134 : break;
2121 :
2122 12451 : case RTE_FUNCTION:
2123 : case RTE_TABLEFUNC:
2124 : case RTE_VALUES:
2125 : case RTE_CTE:
2126 : case RTE_NAMEDTUPLESTORE:
2127 : case RTE_RESULT:
2128 : /* Not all of these can have dropped cols, but share code anyway */
2129 12451 : expandRTE(rte, varno, 0, VAR_RETURNING_DEFAULT, -1,
2130 : true /* include dropped */ , NULL, &colvars);
2131 62876 : foreach(l, colvars)
2132 : {
2133 50425 : var = (Var *) lfirst(l);
2134 :
2135 : /*
2136 : * A non-Var in expandRTE's output means a dropped column;
2137 : * must punt.
2138 : */
2139 50425 : if (!IsA(var, Var))
2140 : {
2141 0 : tlist = NIL;
2142 0 : break;
2143 : }
2144 :
2145 50425 : tlist = lappend(tlist,
2146 50425 : makeTargetEntry((Expr *) var,
2147 50425 : var->varattno,
2148 : NULL,
2149 : false));
2150 : }
2151 12451 : break;
2152 :
2153 0 : default:
2154 : /* caller error */
2155 0 : elog(ERROR, "unsupported RTE kind %d in build_physical_tlist",
2156 : (int) rte->rtekind);
2157 : break;
2158 : }
2159 :
2160 99485 : return tlist;
2161 : }
2162 :
2163 : /*
2164 : * build_index_tlist
2165 : *
2166 : * Build a targetlist representing the columns of the specified index.
2167 : * Each column is represented by a Var for the corresponding base-relation
2168 : * column, or an expression in base-relation Vars, as appropriate.
2169 : *
2170 : * There are never any dropped columns in indexes, so unlike
2171 : * build_physical_tlist, we need no failure case.
2172 : */
2173 : static List *
2174 385101 : build_index_tlist(PlannerInfo *root, IndexOptInfo *index,
2175 : Relation heapRelation)
2176 : {
2177 385101 : List *tlist = NIL;
2178 385101 : Index varno = index->rel->relid;
2179 : ListCell *indexpr_item;
2180 : int i;
2181 :
2182 385101 : indexpr_item = list_head(index->indexprs);
2183 1104150 : for (i = 0; i < index->ncolumns; i++)
2184 : {
2185 719049 : int indexkey = index->indexkeys[i];
2186 : Expr *indexvar;
2187 :
2188 719049 : if (indexkey != 0)
2189 : {
2190 : /* simple column */
2191 : const FormData_pg_attribute *att_tup;
2192 :
2193 717529 : if (indexkey < 0)
2194 0 : att_tup = SystemAttributeDefinition(indexkey);
2195 : else
2196 717529 : att_tup = TupleDescAttr(heapRelation->rd_att, indexkey - 1);
2197 :
2198 717529 : indexvar = (Expr *) makeVar(varno,
2199 : indexkey,
2200 717529 : att_tup->atttypid,
2201 717529 : att_tup->atttypmod,
2202 717529 : att_tup->attcollation,
2203 : 0);
2204 : }
2205 : else
2206 : {
2207 : /* expression column */
2208 1520 : if (indexpr_item == NULL)
2209 0 : elog(ERROR, "wrong number of index expressions");
2210 1520 : indexvar = (Expr *) lfirst(indexpr_item);
2211 1520 : indexpr_item = lnext(index->indexprs, indexpr_item);
2212 : }
2213 :
2214 719049 : tlist = lappend(tlist,
2215 719049 : makeTargetEntry(indexvar,
2216 719049 : i + 1,
2217 : NULL,
2218 : false));
2219 : }
2220 385101 : if (indexpr_item != NULL)
2221 0 : elog(ERROR, "wrong number of index expressions");
2222 :
2223 385101 : return tlist;
2224 : }
2225 :
2226 : /*
2227 : * restriction_selectivity
2228 : *
2229 : * Returns the selectivity of a specified restriction operator clause.
2230 : * This code executes registered procedures stored in the
2231 : * operator relation, by calling the function manager.
2232 : *
2233 : * See clause_selectivity() for the meaning of the additional parameters.
2234 : */
2235 : Selectivity
2236 382246 : restriction_selectivity(PlannerInfo *root,
2237 : Oid operatorid,
2238 : List *args,
2239 : Oid inputcollid,
2240 : int varRelid)
2241 : {
2242 382246 : RegProcedure oprrest = get_oprrest(operatorid);
2243 : float8 result;
2244 :
2245 : /*
2246 : * if the oprrest procedure is missing for whatever reason, use a
2247 : * selectivity of 0.5
2248 : */
2249 382246 : if (!oprrest)
2250 80 : return (Selectivity) 0.5;
2251 :
2252 382166 : result = DatumGetFloat8(OidFunctionCall4Coll(oprrest,
2253 : inputcollid,
2254 : PointerGetDatum(root),
2255 : ObjectIdGetDatum(operatorid),
2256 : PointerGetDatum(args),
2257 : Int32GetDatum(varRelid)));
2258 :
2259 382151 : if (result < 0.0 || result > 1.0)
2260 0 : elog(ERROR, "invalid restriction selectivity: %f", result);
2261 :
2262 382151 : return (Selectivity) result;
2263 : }
2264 :
2265 : /*
2266 : * join_selectivity
2267 : *
2268 : * Returns the selectivity of a specified join operator clause.
2269 : * This code executes registered procedures stored in the
2270 : * operator relation, by calling the function manager.
2271 : *
2272 : * See clause_selectivity() for the meaning of the additional parameters.
2273 : */
2274 : Selectivity
2275 137107 : join_selectivity(PlannerInfo *root,
2276 : Oid operatorid,
2277 : List *args,
2278 : Oid inputcollid,
2279 : JoinType jointype,
2280 : SpecialJoinInfo *sjinfo)
2281 : {
2282 137107 : RegProcedure oprjoin = get_oprjoin(operatorid);
2283 : float8 result;
2284 :
2285 : /*
2286 : * if the oprjoin procedure is missing for whatever reason, use a
2287 : * selectivity of 0.5
2288 : */
2289 137107 : if (!oprjoin)
2290 73 : return (Selectivity) 0.5;
2291 :
2292 137034 : result = DatumGetFloat8(OidFunctionCall5Coll(oprjoin,
2293 : inputcollid,
2294 : PointerGetDatum(root),
2295 : ObjectIdGetDatum(operatorid),
2296 : PointerGetDatum(args),
2297 : Int16GetDatum(jointype),
2298 : PointerGetDatum(sjinfo)));
2299 :
2300 137034 : if (result < 0.0 || result > 1.0)
2301 0 : elog(ERROR, "invalid join selectivity: %f", result);
2302 :
2303 137034 : return (Selectivity) result;
2304 : }
2305 :
2306 : /*
2307 : * function_selectivity
2308 : *
2309 : * Attempt to estimate the selectivity of a specified boolean function clause
2310 : * by asking its support function. If the function lacks support, return -1.
2311 : *
2312 : * See clause_selectivity() for the meaning of the additional parameters.
2313 : */
2314 : Selectivity
2315 6638 : function_selectivity(PlannerInfo *root,
2316 : Oid funcid,
2317 : List *args,
2318 : Oid inputcollid,
2319 : bool is_join,
2320 : int varRelid,
2321 : JoinType jointype,
2322 : SpecialJoinInfo *sjinfo)
2323 : {
2324 6638 : RegProcedure prosupport = get_func_support(funcid);
2325 : SupportRequestSelectivity req;
2326 : SupportRequestSelectivity *sresult;
2327 :
2328 6638 : if (!prosupport)
2329 6623 : return (Selectivity) -1; /* no support function */
2330 :
2331 15 : req.type = T_SupportRequestSelectivity;
2332 15 : req.root = root;
2333 15 : req.funcid = funcid;
2334 15 : req.args = args;
2335 15 : req.inputcollid = inputcollid;
2336 15 : req.is_join = is_join;
2337 15 : req.varRelid = varRelid;
2338 15 : req.jointype = jointype;
2339 15 : req.sjinfo = sjinfo;
2340 15 : req.selectivity = -1; /* to catch failure to set the value */
2341 :
2342 : sresult = (SupportRequestSelectivity *)
2343 15 : DatumGetPointer(OidFunctionCall1(prosupport,
2344 : PointerGetDatum(&req)));
2345 :
2346 15 : if (sresult != &req)
2347 0 : return (Selectivity) -1; /* function did not honor request */
2348 :
2349 15 : if (req.selectivity < 0.0 || req.selectivity > 1.0)
2350 0 : elog(ERROR, "invalid function selectivity: %f", req.selectivity);
2351 :
2352 15 : return (Selectivity) req.selectivity;
2353 : }
2354 :
2355 : /*
2356 : * add_function_cost
2357 : *
2358 : * Get an estimate of the execution cost of a function, and *add* it to
2359 : * the contents of *cost. The estimate may include both one-time and
2360 : * per-tuple components, since QualCost does.
2361 : *
2362 : * The funcid must always be supplied. If it is being called as the
2363 : * implementation of a specific parsetree node (FuncExpr, OpExpr,
2364 : * WindowFunc, etc), pass that as "node", else pass NULL.
2365 : *
2366 : * In some usages root might be NULL, too.
2367 : */
2368 : void
2369 600899 : add_function_cost(PlannerInfo *root, Oid funcid, Node *node,
2370 : QualCost *cost)
2371 : {
2372 : HeapTuple proctup;
2373 : Form_pg_proc procform;
2374 :
2375 600899 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2376 600899 : if (!HeapTupleIsValid(proctup))
2377 0 : elog(ERROR, "cache lookup failed for function %u", funcid);
2378 600899 : procform = (Form_pg_proc) GETSTRUCT(proctup);
2379 :
2380 600899 : if (OidIsValid(procform->prosupport))
2381 : {
2382 : SupportRequestCost req;
2383 : SupportRequestCost *sresult;
2384 :
2385 17973 : req.type = T_SupportRequestCost;
2386 17973 : req.root = root;
2387 17973 : req.funcid = funcid;
2388 17973 : req.node = node;
2389 :
2390 : /* Initialize cost fields so that support function doesn't have to */
2391 17973 : req.startup = 0;
2392 17973 : req.per_tuple = 0;
2393 :
2394 : sresult = (SupportRequestCost *)
2395 17973 : DatumGetPointer(OidFunctionCall1(procform->prosupport,
2396 : PointerGetDatum(&req)));
2397 :
2398 17973 : if (sresult == &req)
2399 : {
2400 : /* Success, so accumulate support function's estimate into *cost */
2401 9 : cost->startup += req.startup;
2402 9 : cost->per_tuple += req.per_tuple;
2403 9 : ReleaseSysCache(proctup);
2404 9 : return;
2405 : }
2406 : }
2407 :
2408 : /* No support function, or it failed, so rely on procost */
2409 600890 : cost->per_tuple += procform->procost * cpu_operator_cost;
2410 :
2411 600890 : ReleaseSysCache(proctup);
2412 : }
2413 :
2414 : /*
2415 : * get_function_rows
2416 : *
2417 : * Get an estimate of the number of rows returned by a set-returning function.
2418 : *
2419 : * The funcid must always be supplied. In current usage, the calling node
2420 : * will always be supplied, and will be either a FuncExpr or OpExpr.
2421 : * But it's a good idea to not fail if it's NULL.
2422 : *
2423 : * In some usages root might be NULL, too.
2424 : *
2425 : * Note: this returns the unfiltered result of the support function, if any.
2426 : * It's usually a good idea to apply clamp_row_est() to the result, but we
2427 : * leave it to the caller to do so.
2428 : */
2429 : double
2430 28525 : get_function_rows(PlannerInfo *root, Oid funcid, Node *node)
2431 : {
2432 : HeapTuple proctup;
2433 : Form_pg_proc procform;
2434 : double result;
2435 :
2436 28525 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2437 28525 : if (!HeapTupleIsValid(proctup))
2438 0 : elog(ERROR, "cache lookup failed for function %u", funcid);
2439 28525 : procform = (Form_pg_proc) GETSTRUCT(proctup);
2440 :
2441 : Assert(procform->proretset); /* else caller error */
2442 :
2443 28525 : if (OidIsValid(procform->prosupport))
2444 : {
2445 : SupportRequestRows req;
2446 : SupportRequestRows *sresult;
2447 :
2448 10770 : req.type = T_SupportRequestRows;
2449 10770 : req.root = root;
2450 10770 : req.funcid = funcid;
2451 10770 : req.node = node;
2452 :
2453 10770 : req.rows = 0; /* just for sanity */
2454 :
2455 : sresult = (SupportRequestRows *)
2456 10770 : DatumGetPointer(OidFunctionCall1(procform->prosupport,
2457 : PointerGetDatum(&req)));
2458 :
2459 10770 : if (sresult == &req)
2460 : {
2461 : /* Success */
2462 8673 : ReleaseSysCache(proctup);
2463 8673 : return req.rows;
2464 : }
2465 : }
2466 :
2467 : /* No support function, or it failed, so rely on prorows */
2468 19852 : result = procform->prorows;
2469 :
2470 19852 : ReleaseSysCache(proctup);
2471 :
2472 19852 : return result;
2473 : }
2474 :
2475 : /*
2476 : * has_unique_index
2477 : *
2478 : * Detect whether there is a unique index on the specified attribute
2479 : * of the specified relation, thus allowing us to conclude that all
2480 : * the (non-null) values of the attribute are distinct.
2481 : *
2482 : * This function does not check the index's indimmediate property, which
2483 : * means that uniqueness may transiently fail to hold intra-transaction.
2484 : * That's appropriate when we are making statistical estimates, but beware
2485 : * of using this for any correctness proofs.
2486 : */
2487 : bool
2488 1189661 : has_unique_index(RelOptInfo *rel, AttrNumber attno)
2489 : {
2490 : ListCell *ilist;
2491 :
2492 2906545 : foreach(ilist, rel->indexlist)
2493 : {
2494 2086990 : IndexOptInfo *index = (IndexOptInfo *) lfirst(ilist);
2495 :
2496 : /*
2497 : * Note: ignore partial indexes, since they don't allow us to conclude
2498 : * that all attr values are distinct, *unless* they are marked predOK
2499 : * which means we know the index's predicate is satisfied by the
2500 : * query. We don't take any interest in expressional indexes either.
2501 : * Also, a multicolumn unique index doesn't allow us to conclude that
2502 : * just the specified attr is unique.
2503 : */
2504 2086990 : if (index->unique &&
2505 1458317 : index->nkeycolumns == 1 &&
2506 789679 : index->indexkeys[0] == attno &&
2507 370147 : (index->indpred == NIL || index->predOK))
2508 370106 : return true;
2509 : }
2510 819555 : return false;
2511 : }
2512 :
2513 :
2514 : /*
2515 : * has_row_triggers
2516 : *
2517 : * Detect whether the specified relation has any row-level triggers for event.
2518 : */
2519 : bool
2520 258 : has_row_triggers(PlannerInfo *root, Index rti, CmdType event)
2521 : {
2522 258 : RangeTblEntry *rte = planner_rt_fetch(rti, root);
2523 : Relation relation;
2524 : TriggerDesc *trigDesc;
2525 258 : bool result = false;
2526 :
2527 : /* Assume we already have adequate lock */
2528 258 : relation = table_open(rte->relid, NoLock);
2529 :
2530 258 : trigDesc = relation->trigdesc;
2531 258 : switch (event)
2532 : {
2533 82 : case CMD_INSERT:
2534 82 : if (trigDesc &&
2535 13 : (trigDesc->trig_insert_after_row ||
2536 7 : trigDesc->trig_insert_before_row))
2537 13 : result = true;
2538 82 : break;
2539 95 : case CMD_UPDATE:
2540 95 : if (trigDesc &&
2541 24 : (trigDesc->trig_update_after_row ||
2542 14 : trigDesc->trig_update_before_row))
2543 18 : result = true;
2544 95 : break;
2545 81 : case CMD_DELETE:
2546 81 : if (trigDesc &&
2547 15 : (trigDesc->trig_delete_after_row ||
2548 9 : trigDesc->trig_delete_before_row))
2549 8 : result = true;
2550 81 : break;
2551 : /* There is no separate event for MERGE, only INSERT/UPDATE/DELETE */
2552 0 : case CMD_MERGE:
2553 0 : result = false;
2554 0 : break;
2555 0 : default:
2556 0 : elog(ERROR, "unrecognized CmdType: %d", (int) event);
2557 : break;
2558 : }
2559 :
2560 258 : table_close(relation, NoLock);
2561 258 : return result;
2562 : }
2563 :
2564 : /*
2565 : * has_transition_tables
2566 : *
2567 : * Detect whether the specified relation has any transition tables for event.
2568 : */
2569 : bool
2570 195 : has_transition_tables(PlannerInfo *root, Index rti, CmdType event)
2571 : {
2572 195 : RangeTblEntry *rte = planner_rt_fetch(rti, root);
2573 : Relation relation;
2574 : TriggerDesc *trigDesc;
2575 195 : bool result = false;
2576 :
2577 : Assert(rte->rtekind == RTE_RELATION);
2578 :
2579 : /* Currently foreign tables cannot have transition tables */
2580 195 : if (rte->relkind == RELKIND_FOREIGN_TABLE)
2581 145 : return result;
2582 :
2583 : /* Assume we already have adequate lock */
2584 50 : relation = table_open(rte->relid, NoLock);
2585 :
2586 50 : trigDesc = relation->trigdesc;
2587 50 : switch (event)
2588 : {
2589 0 : case CMD_INSERT:
2590 0 : if (trigDesc &&
2591 0 : trigDesc->trig_insert_new_table)
2592 0 : result = true;
2593 0 : break;
2594 30 : case CMD_UPDATE:
2595 30 : if (trigDesc &&
2596 4 : (trigDesc->trig_update_old_table ||
2597 0 : trigDesc->trig_update_new_table))
2598 4 : result = true;
2599 30 : break;
2600 20 : case CMD_DELETE:
2601 20 : if (trigDesc &&
2602 4 : trigDesc->trig_delete_old_table)
2603 4 : result = true;
2604 20 : break;
2605 : /* There is no separate event for MERGE, only INSERT/UPDATE/DELETE */
2606 0 : case CMD_MERGE:
2607 0 : result = false;
2608 0 : break;
2609 0 : default:
2610 0 : elog(ERROR, "unrecognized CmdType: %d", (int) event);
2611 : break;
2612 : }
2613 :
2614 50 : table_close(relation, NoLock);
2615 50 : return result;
2616 : }
2617 :
2618 : /*
2619 : * has_stored_generated_columns
2620 : *
2621 : * Does table identified by RTI have any STORED GENERATED columns?
2622 : */
2623 : bool
2624 219 : has_stored_generated_columns(PlannerInfo *root, Index rti)
2625 : {
2626 219 : RangeTblEntry *rte = planner_rt_fetch(rti, root);
2627 : Relation relation;
2628 : TupleDesc tupdesc;
2629 219 : bool result = false;
2630 :
2631 : /* Assume we already have adequate lock */
2632 219 : relation = table_open(rte->relid, NoLock);
2633 :
2634 219 : tupdesc = RelationGetDescr(relation);
2635 219 : result = tupdesc->constr && tupdesc->constr->has_generated_stored;
2636 :
2637 219 : table_close(relation, NoLock);
2638 :
2639 219 : return result;
2640 : }
2641 :
2642 : /*
2643 : * get_dependent_generated_columns
2644 : *
2645 : * Get the column numbers of any STORED GENERATED columns of the relation
2646 : * that depend on any column listed in target_cols. Both the input and
2647 : * result bitmapsets contain column numbers offset by
2648 : * FirstLowInvalidHeapAttributeNumber.
2649 : */
2650 : Bitmapset *
2651 45 : get_dependent_generated_columns(PlannerInfo *root, Index rti,
2652 : Bitmapset *target_cols)
2653 : {
2654 45 : Bitmapset *dependentCols = NULL;
2655 45 : RangeTblEntry *rte = planner_rt_fetch(rti, root);
2656 : Relation relation;
2657 : TupleDesc tupdesc;
2658 : TupleConstr *constr;
2659 :
2660 : /* Assume we already have adequate lock */
2661 45 : relation = table_open(rte->relid, NoLock);
2662 :
2663 45 : tupdesc = RelationGetDescr(relation);
2664 45 : constr = tupdesc->constr;
2665 :
2666 45 : if (constr && constr->has_generated_stored)
2667 : {
2668 6 : for (int i = 0; i < constr->num_defval; i++)
2669 : {
2670 4 : AttrDefault *defval = &constr->defval[i];
2671 : Node *expr;
2672 4 : Bitmapset *attrs_used = NULL;
2673 :
2674 : /* skip if not generated column */
2675 4 : if (!TupleDescCompactAttr(tupdesc, defval->adnum - 1)->attgenerated)
2676 0 : continue;
2677 :
2678 : /* identify columns this generated column depends on */
2679 4 : expr = stringToNode(defval->adbin);
2680 4 : pull_varattnos(expr, 1, &attrs_used);
2681 :
2682 4 : if (bms_overlap(target_cols, attrs_used))
2683 4 : dependentCols = bms_add_member(dependentCols,
2684 4 : defval->adnum - FirstLowInvalidHeapAttributeNumber);
2685 : }
2686 : }
2687 :
2688 45 : table_close(relation, NoLock);
2689 :
2690 45 : return dependentCols;
2691 : }
2692 :
2693 : /*
2694 : * set_relation_partition_info
2695 : *
2696 : * Set partitioning scheme and related information for a partitioned table.
2697 : */
2698 : static void
2699 9047 : set_relation_partition_info(PlannerInfo *root, RelOptInfo *rel,
2700 : Relation relation)
2701 : {
2702 : PartitionDesc partdesc;
2703 :
2704 : /*
2705 : * Create the PartitionDirectory infrastructure if we didn't already.
2706 : */
2707 9047 : if (root->glob->partition_directory == NULL)
2708 : {
2709 6093 : root->glob->partition_directory =
2710 6093 : CreatePartitionDirectory(CurrentMemoryContext, true);
2711 : }
2712 :
2713 9047 : partdesc = PartitionDirectoryLookup(root->glob->partition_directory,
2714 : relation);
2715 9047 : rel->part_scheme = find_partition_scheme(root, relation);
2716 : Assert(partdesc != NULL && rel->part_scheme != NULL);
2717 9047 : rel->boundinfo = partdesc->boundinfo;
2718 9047 : rel->nparts = partdesc->nparts;
2719 9047 : set_baserel_partition_key_exprs(relation, rel);
2720 9047 : set_baserel_partition_constraint(relation, rel);
2721 9047 : }
2722 :
2723 : /*
2724 : * find_partition_scheme
2725 : *
2726 : * Find or create a PartitionScheme for this Relation.
2727 : */
2728 : static PartitionScheme
2729 9047 : find_partition_scheme(PlannerInfo *root, Relation relation)
2730 : {
2731 9047 : PartitionKey partkey = RelationGetPartitionKey(relation);
2732 : ListCell *lc;
2733 : int partnatts,
2734 : i;
2735 : PartitionScheme part_scheme;
2736 :
2737 : /* A partitioned table should have a partition key. */
2738 : Assert(partkey != NULL);
2739 :
2740 9047 : partnatts = partkey->partnatts;
2741 :
2742 : /* Search for a matching partition scheme and return if found one. */
2743 9992 : foreach(lc, root->part_schemes)
2744 : {
2745 3248 : part_scheme = lfirst(lc);
2746 :
2747 : /* Match partitioning strategy and number of keys. */
2748 3248 : if (partkey->strategy != part_scheme->strategy ||
2749 2753 : partnatts != part_scheme->partnatts)
2750 720 : continue;
2751 :
2752 : /* Match partition key type properties. */
2753 2528 : if (memcmp(partkey->partopfamily, part_scheme->partopfamily,
2754 2303 : sizeof(Oid) * partnatts) != 0 ||
2755 2303 : memcmp(partkey->partopcintype, part_scheme->partopcintype,
2756 2303 : sizeof(Oid) * partnatts) != 0 ||
2757 2303 : memcmp(partkey->partcollation, part_scheme->partcollation,
2758 : sizeof(Oid) * partnatts) != 0)
2759 225 : continue;
2760 :
2761 : /*
2762 : * Length and byval information should match when partopcintype
2763 : * matches.
2764 : */
2765 : Assert(memcmp(partkey->parttyplen, part_scheme->parttyplen,
2766 : sizeof(int16) * partnatts) == 0);
2767 : Assert(memcmp(partkey->parttypbyval, part_scheme->parttypbyval,
2768 : sizeof(bool) * partnatts) == 0);
2769 :
2770 : /*
2771 : * If partopfamily and partopcintype matched, must have the same
2772 : * partition comparison functions. Note that we cannot reliably
2773 : * Assert the equality of function structs themselves for they might
2774 : * be different across PartitionKey's, so just Assert for the function
2775 : * OIDs.
2776 : */
2777 : #ifdef USE_ASSERT_CHECKING
2778 : for (i = 0; i < partkey->partnatts; i++)
2779 : Assert(partkey->partsupfunc[i].fn_oid ==
2780 : part_scheme->partsupfunc[i].fn_oid);
2781 : #endif
2782 :
2783 : /* Found matching partition scheme. */
2784 2303 : return part_scheme;
2785 : }
2786 :
2787 : /*
2788 : * Did not find matching partition scheme. Create one copying relevant
2789 : * information from the relcache. We need to copy the contents of the
2790 : * array since the relcache entry may not survive after we have closed the
2791 : * relation.
2792 : */
2793 6744 : part_scheme = palloc0_object(PartitionSchemeData);
2794 6744 : part_scheme->strategy = partkey->strategy;
2795 6744 : part_scheme->partnatts = partkey->partnatts;
2796 :
2797 6744 : part_scheme->partopfamily = palloc_array(Oid, partnatts);
2798 6744 : memcpy(part_scheme->partopfamily, partkey->partopfamily,
2799 : sizeof(Oid) * partnatts);
2800 :
2801 6744 : part_scheme->partopcintype = palloc_array(Oid, partnatts);
2802 6744 : memcpy(part_scheme->partopcintype, partkey->partopcintype,
2803 : sizeof(Oid) * partnatts);
2804 :
2805 6744 : part_scheme->partcollation = palloc_array(Oid, partnatts);
2806 6744 : memcpy(part_scheme->partcollation, partkey->partcollation,
2807 : sizeof(Oid) * partnatts);
2808 :
2809 6744 : part_scheme->parttyplen = palloc_array(int16, partnatts);
2810 6744 : memcpy(part_scheme->parttyplen, partkey->parttyplen,
2811 : sizeof(int16) * partnatts);
2812 :
2813 6744 : part_scheme->parttypbyval = palloc_array(bool, partnatts);
2814 6744 : memcpy(part_scheme->parttypbyval, partkey->parttypbyval,
2815 : sizeof(bool) * partnatts);
2816 :
2817 6744 : part_scheme->partsupfunc = palloc_array(FmgrInfo, partnatts);
2818 14436 : for (i = 0; i < partnatts; i++)
2819 7692 : fmgr_info_copy(&part_scheme->partsupfunc[i], &partkey->partsupfunc[i],
2820 : CurrentMemoryContext);
2821 :
2822 : /* Add the partitioning scheme to PlannerInfo. */
2823 6744 : root->part_schemes = lappend(root->part_schemes, part_scheme);
2824 :
2825 6744 : return part_scheme;
2826 : }
2827 :
2828 : /*
2829 : * set_baserel_partition_key_exprs
2830 : *
2831 : * Builds partition key expressions for the given base relation and fills
2832 : * rel->partexprs.
2833 : */
2834 : static void
2835 9047 : set_baserel_partition_key_exprs(Relation relation,
2836 : RelOptInfo *rel)
2837 : {
2838 9047 : PartitionKey partkey = RelationGetPartitionKey(relation);
2839 : int partnatts;
2840 : int cnt;
2841 : List **partexprs;
2842 : ListCell *lc;
2843 9047 : Index varno = rel->relid;
2844 :
2845 : Assert(IS_SIMPLE_REL(rel) && rel->relid > 0);
2846 :
2847 : /* A partitioned table should have a partition key. */
2848 : Assert(partkey != NULL);
2849 :
2850 9047 : partnatts = partkey->partnatts;
2851 9047 : partexprs = palloc_array(List *, partnatts);
2852 9047 : lc = list_head(partkey->partexprs);
2853 :
2854 19057 : for (cnt = 0; cnt < partnatts; cnt++)
2855 : {
2856 : Expr *partexpr;
2857 10010 : AttrNumber attno = partkey->partattrs[cnt];
2858 :
2859 10010 : if (attno != InvalidAttrNumber)
2860 : {
2861 : /* Single column partition key is stored as a Var node. */
2862 : Assert(attno > 0);
2863 :
2864 9539 : partexpr = (Expr *) makeVar(varno, attno,
2865 9539 : partkey->parttypid[cnt],
2866 9539 : partkey->parttypmod[cnt],
2867 9539 : partkey->parttypcoll[cnt], 0);
2868 : }
2869 : else
2870 : {
2871 471 : if (lc == NULL)
2872 0 : elog(ERROR, "wrong number of partition key expressions");
2873 :
2874 : /* Re-stamp the expression with given varno. */
2875 471 : partexpr = (Expr *) copyObject(lfirst(lc));
2876 471 : ChangeVarNodes((Node *) partexpr, 1, varno, 0);
2877 471 : lc = lnext(partkey->partexprs, lc);
2878 : }
2879 :
2880 : /* Base relations have a single expression per key. */
2881 10010 : partexprs[cnt] = list_make1(partexpr);
2882 : }
2883 :
2884 9047 : rel->partexprs = partexprs;
2885 :
2886 : /*
2887 : * A base relation does not have nullable partition key expressions, since
2888 : * no outer join is involved. We still allocate an array of empty
2889 : * expression lists to keep partition key expression handling code simple.
2890 : * See build_joinrel_partition_info() and match_expr_to_partition_keys().
2891 : */
2892 9047 : rel->nullable_partexprs = palloc0_array(List *, partnatts);
2893 9047 : }
2894 :
2895 : /*
2896 : * set_baserel_partition_constraint
2897 : *
2898 : * Builds the partition constraint for the given base relation and sets it
2899 : * in the given RelOptInfo. All Var nodes are restamped with the relid of the
2900 : * given relation.
2901 : */
2902 : static void
2903 9053 : set_baserel_partition_constraint(Relation relation, RelOptInfo *rel)
2904 : {
2905 : List *partconstr;
2906 :
2907 9053 : if (rel->partition_qual) /* already done */
2908 0 : return;
2909 :
2910 : /*
2911 : * Run the partition quals through const-simplification similar to check
2912 : * constraints. We skip canonicalize_qual, though, because partition
2913 : * quals should be in canonical form already; also, since the qual is in
2914 : * implicit-AND format, we'd have to explicitly convert it to explicit-AND
2915 : * format and back again.
2916 : */
2917 9053 : partconstr = RelationGetPartitionQual(relation);
2918 9053 : if (partconstr)
2919 : {
2920 1873 : partconstr = (List *) expression_planner((Expr *) partconstr);
2921 1873 : if (rel->relid != 1)
2922 1828 : ChangeVarNodes((Node *) partconstr, 1, rel->relid, 0);
2923 1873 : rel->partition_qual = partconstr;
2924 : }
2925 : }
|
