PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
parse_relation.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * parse_relation.c
4  * parser support routines dealing with relations
5  *
6  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  *
10  * IDENTIFICATION
11  * src/backend/parser/parse_relation.c
12  *
13  *-------------------------------------------------------------------------
14  */
15 #include "postgres.h"
16 
17 #include <ctype.h>
18 
19 #include "access/htup_details.h"
20 #include "access/sysattr.h"
21 #include "catalog/heap.h"
22 #include "catalog/namespace.h"
23 #include "catalog/pg_type.h"
24 #include "funcapi.h"
25 #include "nodes/makefuncs.h"
26 #include "nodes/nodeFuncs.h"
27 #include "parser/parsetree.h"
28 #include "parser/parse_enr.h"
29 #include "parser/parse_relation.h"
30 #include "parser/parse_type.h"
31 #include "utils/builtins.h"
32 #include "utils/lsyscache.h"
33 #include "utils/rel.h"
34 #include "utils/syscache.h"
35 #include "utils/varlena.h"
36 
37 
38 #define MAX_FUZZY_DISTANCE 3
39 
41  const char *refname, int location);
42 static RangeTblEntry *scanNameSpaceForRelid(ParseState *pstate, Oid relid,
43  int location);
44 static void check_lateral_ref_ok(ParseState *pstate, ParseNamespaceItem *nsitem,
45  int location);
46 static void markRTEForSelectPriv(ParseState *pstate, RangeTblEntry *rte,
47  int rtindex, AttrNumber col);
48 static void expandRelation(Oid relid, Alias *eref,
49  int rtindex, int sublevels_up,
50  int location, bool include_dropped,
51  List **colnames, List **colvars);
52 static void expandTupleDesc(TupleDesc tupdesc, Alias *eref,
53  int count, int offset,
54  int rtindex, int sublevels_up,
55  int location, bool include_dropped,
56  List **colnames, List **colvars);
57 static int specialAttNum(const char *attname);
58 static bool isQueryUsingTempRelation_walker(Node *node, void *context);
59 
60 
61 /*
62  * refnameRangeTblEntry
63  * Given a possibly-qualified refname, look to see if it matches any RTE.
64  * If so, return a pointer to the RangeTblEntry; else return NULL.
65  *
66  * Optionally get RTE's nesting depth (0 = current) into *sublevels_up.
67  * If sublevels_up is NULL, only consider items at the current nesting
68  * level.
69  *
70  * An unqualified refname (schemaname == NULL) can match any RTE with matching
71  * alias, or matching unqualified relname in the case of alias-less relation
72  * RTEs. It is possible that such a refname matches multiple RTEs in the
73  * nearest nesting level that has a match; if so, we report an error via
74  * ereport().
75  *
76  * A qualified refname (schemaname != NULL) can only match a relation RTE
77  * that (a) has no alias and (b) is for the same relation identified by
78  * schemaname.refname. In this case we convert schemaname.refname to a
79  * relation OID and search by relid, rather than by alias name. This is
80  * peculiar, but it's what SQL says to do.
81  */
84  const char *schemaname,
85  const char *refname,
86  int location,
87  int *sublevels_up)
88 {
89  Oid relId = InvalidOid;
90 
91  if (sublevels_up)
92  *sublevels_up = 0;
93 
94  if (schemaname != NULL)
95  {
96  Oid namespaceId;
97 
98  /*
99  * We can use LookupNamespaceNoError() here because we are only
100  * interested in finding existing RTEs. Checking USAGE permission on
101  * the schema is unnecessary since it would have already been checked
102  * when the RTE was made. Furthermore, we want to report "RTE not
103  * found", not "no permissions for schema", if the name happens to
104  * match a schema name the user hasn't got access to.
105  */
106  namespaceId = LookupNamespaceNoError(schemaname);
107  if (!OidIsValid(namespaceId))
108  return NULL;
109  relId = get_relname_relid(refname, namespaceId);
110  if (!OidIsValid(relId))
111  return NULL;
112  }
113 
114  while (pstate != NULL)
115  {
117 
118  if (OidIsValid(relId))
119  result = scanNameSpaceForRelid(pstate, relId, location);
120  else
121  result = scanNameSpaceForRefname(pstate, refname, location);
122 
123  if (result)
124  return result;
125 
126  if (sublevels_up)
127  (*sublevels_up)++;
128  else
129  break;
130 
131  pstate = pstate->parentParseState;
132  }
133  return NULL;
134 }
135 
136 /*
137  * Search the query's table namespace for an RTE matching the
138  * given unqualified refname. Return the RTE if a unique match, or NULL
139  * if no match. Raise error if multiple matches.
140  *
141  * Note: it might seem that we shouldn't have to worry about the possibility
142  * of multiple matches; after all, the SQL standard disallows duplicate table
143  * aliases within a given SELECT level. Historically, however, Postgres has
144  * been laxer than that. For example, we allow
145  * SELECT ... FROM tab1 x CROSS JOIN (tab2 x CROSS JOIN tab3 y) z
146  * on the grounds that the aliased join (z) hides the aliases within it,
147  * therefore there is no conflict between the two RTEs named "x". However,
148  * if tab3 is a LATERAL subquery, then from within the subquery both "x"es
149  * are visible. Rather than rejecting queries that used to work, we allow
150  * this situation, and complain only if there's actually an ambiguous
151  * reference to "x".
152  */
153 static RangeTblEntry *
154 scanNameSpaceForRefname(ParseState *pstate, const char *refname, int location)
155 {
156  RangeTblEntry *result = NULL;
157  ListCell *l;
158 
159  foreach(l, pstate->p_namespace)
160  {
162  RangeTblEntry *rte = nsitem->p_rte;
163 
164  /* Ignore columns-only items */
165  if (!nsitem->p_rel_visible)
166  continue;
167  /* If not inside LATERAL, ignore lateral-only items */
168  if (nsitem->p_lateral_only && !pstate->p_lateral_active)
169  continue;
170 
171  if (strcmp(rte->eref->aliasname, refname) == 0)
172  {
173  if (result)
174  ereport(ERROR,
175  (errcode(ERRCODE_AMBIGUOUS_ALIAS),
176  errmsg("table reference \"%s\" is ambiguous",
177  refname),
178  parser_errposition(pstate, location)));
179  check_lateral_ref_ok(pstate, nsitem, location);
180  result = rte;
181  }
182  }
183  return result;
184 }
185 
186 /*
187  * Search the query's table namespace for a relation RTE matching the
188  * given relation OID. Return the RTE if a unique match, or NULL
189  * if no match. Raise error if multiple matches.
190  *
191  * See the comments for refnameRangeTblEntry to understand why this
192  * acts the way it does.
193  */
194 static RangeTblEntry *
195 scanNameSpaceForRelid(ParseState *pstate, Oid relid, int location)
196 {
197  RangeTblEntry *result = NULL;
198  ListCell *l;
199 
200  foreach(l, pstate->p_namespace)
201  {
203  RangeTblEntry *rte = nsitem->p_rte;
204 
205  /* Ignore columns-only items */
206  if (!nsitem->p_rel_visible)
207  continue;
208  /* If not inside LATERAL, ignore lateral-only items */
209  if (nsitem->p_lateral_only && !pstate->p_lateral_active)
210  continue;
211 
212  /* yes, the test for alias == NULL should be there... */
213  if (rte->rtekind == RTE_RELATION &&
214  rte->relid == relid &&
215  rte->alias == NULL)
216  {
217  if (result)
218  ereport(ERROR,
219  (errcode(ERRCODE_AMBIGUOUS_ALIAS),
220  errmsg("table reference %u is ambiguous",
221  relid),
222  parser_errposition(pstate, location)));
223  check_lateral_ref_ok(pstate, nsitem, location);
224  result = rte;
225  }
226  }
227  return result;
228 }
229 
230 /*
231  * Search the query's CTE namespace for a CTE matching the given unqualified
232  * refname. Return the CTE (and its levelsup count) if a match, or NULL
233  * if no match. We need not worry about multiple matches, since parse_cte.c
234  * rejects WITH lists containing duplicate CTE names.
235  */
237 scanNameSpaceForCTE(ParseState *pstate, const char *refname,
238  Index *ctelevelsup)
239 {
240  Index levelsup;
241 
242  for (levelsup = 0;
243  pstate != NULL;
244  pstate = pstate->parentParseState, levelsup++)
245  {
246  ListCell *lc;
247 
248  foreach(lc, pstate->p_ctenamespace)
249  {
250  CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
251 
252  if (strcmp(cte->ctename, refname) == 0)
253  {
254  *ctelevelsup = levelsup;
255  return cte;
256  }
257  }
258  }
259  return NULL;
260 }
261 
262 /*
263  * Search for a possible "future CTE", that is one that is not yet in scope
264  * according to the WITH scoping rules. This has nothing to do with valid
265  * SQL semantics, but it's important for error reporting purposes.
266  */
267 static bool
268 isFutureCTE(ParseState *pstate, const char *refname)
269 {
270  for (; pstate != NULL; pstate = pstate->parentParseState)
271  {
272  ListCell *lc;
273 
274  foreach(lc, pstate->p_future_ctes)
275  {
276  CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
277 
278  if (strcmp(cte->ctename, refname) == 0)
279  return true;
280  }
281  }
282  return false;
283 }
284 
285 /*
286  * Search the query's ephemeral named relation namespace for a relation
287  * matching the given unqualified refname.
288  */
289 bool
290 scanNameSpaceForENR(ParseState *pstate, const char *refname)
291 {
292  return name_matches_visible_ENR(pstate, refname);
293 }
294 
295 /*
296  * searchRangeTableForRel
297  * See if any RangeTblEntry could possibly match the RangeVar.
298  * If so, return a pointer to the RangeTblEntry; else return NULL.
299  *
300  * This is different from refnameRangeTblEntry in that it considers every
301  * entry in the ParseState's rangetable(s), not only those that are currently
302  * visible in the p_namespace list(s). This behavior is invalid per the SQL
303  * spec, and it may give ambiguous results (there might be multiple equally
304  * valid matches, but only one will be returned). This must be used ONLY
305  * as a heuristic in giving suitable error messages. See errorMissingRTE.
306  *
307  * Notice that we consider both matches on actual relation (or CTE) name
308  * and matches on alias.
309  */
310 static RangeTblEntry *
312 {
313  const char *refname = relation->relname;
314  Oid relId = InvalidOid;
315  CommonTableExpr *cte = NULL;
316  bool isenr = false;
317  Index ctelevelsup = 0;
318  Index levelsup;
319 
320  /*
321  * If it's an unqualified name, check for possible CTE matches. A CTE
322  * hides any real relation matches. If no CTE, look for a matching
323  * relation.
324  *
325  * NB: It's not critical that RangeVarGetRelid return the correct answer
326  * here in the face of concurrent DDL. If it doesn't, the worst case
327  * scenario is a less-clear error message. Also, the tables involved in
328  * the query are already locked, which reduces the number of cases in
329  * which surprising behavior can occur. So we do the name lookup
330  * unlocked.
331  */
332  if (!relation->schemaname)
333  {
334  cte = scanNameSpaceForCTE(pstate, refname, &ctelevelsup);
335  if (!cte)
336  isenr = scanNameSpaceForENR(pstate, refname);
337  }
338 
339  if (!cte && !isenr)
340  relId = RangeVarGetRelid(relation, NoLock, true);
341 
342  /* Now look for RTEs matching either the relation/CTE/ENR or the alias */
343  for (levelsup = 0;
344  pstate != NULL;
345  pstate = pstate->parentParseState, levelsup++)
346  {
347  ListCell *l;
348 
349  foreach(l, pstate->p_rtable)
350  {
351  RangeTblEntry *rte = (RangeTblEntry *) lfirst(l);
352 
353  if (rte->rtekind == RTE_RELATION &&
354  OidIsValid(relId) &&
355  rte->relid == relId)
356  return rte;
357  if (rte->rtekind == RTE_CTE &&
358  cte != NULL &&
359  rte->ctelevelsup + levelsup == ctelevelsup &&
360  strcmp(rte->ctename, refname) == 0)
361  return rte;
362  if (rte->rtekind == RTE_NAMEDTUPLESTORE &&
363  isenr &&
364  strcmp(rte->enrname, refname) == 0)
365  return rte;
366  if (strcmp(rte->eref->aliasname, refname) == 0)
367  return rte;
368  }
369  }
370  return NULL;
371 }
372 
373 /*
374  * Check for relation-name conflicts between two namespace lists.
375  * Raise an error if any is found.
376  *
377  * Note: we assume that each given argument does not contain conflicts
378  * itself; we just want to know if the two can be merged together.
379  *
380  * Per SQL, two alias-less plain relation RTEs do not conflict even if
381  * they have the same eref->aliasname (ie, same relation name), if they
382  * are for different relation OIDs (implying they are in different schemas).
383  *
384  * We ignore the lateral-only flags in the namespace items: the lists must
385  * not conflict, even when all items are considered visible. However,
386  * columns-only items should be ignored.
387  */
388 void
390  List *namespace2)
391 {
392  ListCell *l1;
393 
394  foreach(l1, namespace1)
395  {
396  ParseNamespaceItem *nsitem1 = (ParseNamespaceItem *) lfirst(l1);
397  RangeTblEntry *rte1 = nsitem1->p_rte;
398  const char *aliasname1 = rte1->eref->aliasname;
399  ListCell *l2;
400 
401  if (!nsitem1->p_rel_visible)
402  continue;
403 
404  foreach(l2, namespace2)
405  {
406  ParseNamespaceItem *nsitem2 = (ParseNamespaceItem *) lfirst(l2);
407  RangeTblEntry *rte2 = nsitem2->p_rte;
408 
409  if (!nsitem2->p_rel_visible)
410  continue;
411  if (strcmp(rte2->eref->aliasname, aliasname1) != 0)
412  continue; /* definitely no conflict */
413  if (rte1->rtekind == RTE_RELATION && rte1->alias == NULL &&
414  rte2->rtekind == RTE_RELATION && rte2->alias == NULL &&
415  rte1->relid != rte2->relid)
416  continue; /* no conflict per SQL rule */
417  ereport(ERROR,
418  (errcode(ERRCODE_DUPLICATE_ALIAS),
419  errmsg("table name \"%s\" specified more than once",
420  aliasname1)));
421  }
422  }
423 }
424 
425 /*
426  * Complain if a namespace item is currently disallowed as a LATERAL reference.
427  * This enforces both SQL:2008's rather odd idea of what to do with a LATERAL
428  * reference to the wrong side of an outer join, and our own prohibition on
429  * referencing the target table of an UPDATE or DELETE as a lateral reference
430  * in a FROM/USING clause.
431  *
432  * Convenience subroutine to avoid multiple copies of a rather ugly ereport.
433  */
434 static void
436  int location)
437 {
438  if (nsitem->p_lateral_only && !nsitem->p_lateral_ok)
439  {
440  /* SQL:2008 demands this be an error, not an invisible item */
441  RangeTblEntry *rte = nsitem->p_rte;
442  char *refname = rte->eref->aliasname;
443 
444  ereport(ERROR,
445  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
446  errmsg("invalid reference to FROM-clause entry for table \"%s\"",
447  refname),
448  (rte == pstate->p_target_rangetblentry) ?
449  errhint("There is an entry for table \"%s\", but it cannot be referenced from this part of the query.",
450  refname) :
451  errdetail("The combining JOIN type must be INNER or LEFT for a LATERAL reference."),
452  parser_errposition(pstate, location)));
453  }
454 }
455 
456 /*
457  * given an RTE, return RT index (starting with 1) of the entry,
458  * and optionally get its nesting depth (0 = current). If sublevels_up
459  * is NULL, only consider rels at the current nesting level.
460  * Raises error if RTE not found.
461  */
462 int
463 RTERangeTablePosn(ParseState *pstate, RangeTblEntry *rte, int *sublevels_up)
464 {
465  int index;
466  ListCell *l;
467 
468  if (sublevels_up)
469  *sublevels_up = 0;
470 
471  while (pstate != NULL)
472  {
473  index = 1;
474  foreach(l, pstate->p_rtable)
475  {
476  if (rte == (RangeTblEntry *) lfirst(l))
477  return index;
478  index++;
479  }
480  pstate = pstate->parentParseState;
481  if (sublevels_up)
482  (*sublevels_up)++;
483  else
484  break;
485  }
486 
487  elog(ERROR, "RTE not found (internal error)");
488  return 0; /* keep compiler quiet */
489 }
490 
491 /*
492  * Given an RT index and nesting depth, find the corresponding RTE.
493  * This is the inverse of RTERangeTablePosn.
494  */
497  int varno,
498  int sublevels_up)
499 {
500  while (sublevels_up-- > 0)
501  {
502  pstate = pstate->parentParseState;
503  Assert(pstate != NULL);
504  }
505  Assert(varno > 0 && varno <= list_length(pstate->p_rtable));
506  return rt_fetch(varno, pstate->p_rtable);
507 }
508 
509 /*
510  * Fetch the CTE for a CTE-reference RTE.
511  *
512  * rtelevelsup is the number of query levels above the given pstate that the
513  * RTE came from. Callers that don't have this information readily available
514  * may pass -1 instead.
515  */
517 GetCTEForRTE(ParseState *pstate, RangeTblEntry *rte, int rtelevelsup)
518 {
519  Index levelsup;
520  ListCell *lc;
521 
522  /* Determine RTE's levelsup if caller didn't know it */
523  if (rtelevelsup < 0)
524  (void) RTERangeTablePosn(pstate, rte, &rtelevelsup);
525 
526  Assert(rte->rtekind == RTE_CTE);
527  levelsup = rte->ctelevelsup + rtelevelsup;
528  while (levelsup-- > 0)
529  {
530  pstate = pstate->parentParseState;
531  if (!pstate) /* shouldn't happen */
532  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
533  }
534  foreach(lc, pstate->p_ctenamespace)
535  {
536  CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
537 
538  if (strcmp(cte->ctename, rte->ctename) == 0)
539  return cte;
540  }
541  /* shouldn't happen */
542  elog(ERROR, "could not find CTE \"%s\"", rte->ctename);
543  return NULL; /* keep compiler quiet */
544 }
545 
546 /*
547  * updateFuzzyAttrMatchState
548  * Using Levenshtein distance, consider if column is best fuzzy match.
549  */
550 static void
551 updateFuzzyAttrMatchState(int fuzzy_rte_penalty,
552  FuzzyAttrMatchState *fuzzystate, RangeTblEntry *rte,
553  const char *actual, const char *match, int attnum)
554 {
555  int columndistance;
556  int matchlen;
557 
558  /* Bail before computing the Levenshtein distance if there's no hope. */
559  if (fuzzy_rte_penalty > fuzzystate->distance)
560  return;
561 
562  /*
563  * Outright reject dropped columns, which can appear here with apparent
564  * empty actual names, per remarks within scanRTEForColumn().
565  */
566  if (actual[0] == '\0')
567  return;
568 
569  /* Use Levenshtein to compute match distance. */
570  matchlen = strlen(match);
571  columndistance =
572  varstr_levenshtein_less_equal(actual, strlen(actual), match, matchlen,
573  1, 1, 1,
574  fuzzystate->distance + 1
575  - fuzzy_rte_penalty,
576  true);
577 
578  /*
579  * If more than half the characters are different, don't treat it as a
580  * match, to avoid making ridiculous suggestions.
581  */
582  if (columndistance > matchlen / 2)
583  return;
584 
585  /*
586  * From this point on, we can ignore the distinction between the RTE-name
587  * distance and the column-name distance.
588  */
589  columndistance += fuzzy_rte_penalty;
590 
591  /*
592  * If the new distance is less than or equal to that of the best match
593  * found so far, update fuzzystate.
594  */
595  if (columndistance < fuzzystate->distance)
596  {
597  /* Store new lowest observed distance for RTE */
598  fuzzystate->distance = columndistance;
599  fuzzystate->rfirst = rte;
600  fuzzystate->first = attnum;
601  fuzzystate->rsecond = NULL;
602  fuzzystate->second = InvalidAttrNumber;
603  }
604  else if (columndistance == fuzzystate->distance)
605  {
606  /*
607  * This match distance may equal a prior match within this same range
608  * table. When that happens, the prior match may also be given, but
609  * only if there is no more than two equally distant matches from the
610  * RTE (in turn, our caller will only accept two equally distant
611  * matches overall).
612  */
613  if (AttributeNumberIsValid(fuzzystate->second))
614  {
615  /* Too many RTE-level matches */
616  fuzzystate->rfirst = NULL;
617  fuzzystate->first = InvalidAttrNumber;
618  fuzzystate->rsecond = NULL;
619  fuzzystate->second = InvalidAttrNumber;
620  /* Clearly, distance is too low a bar (for *any* RTE) */
621  fuzzystate->distance = columndistance - 1;
622  }
623  else if (AttributeNumberIsValid(fuzzystate->first))
624  {
625  /* Record as provisional second match for RTE */
626  fuzzystate->rsecond = rte;
627  fuzzystate->second = attnum;
628  }
629  else if (fuzzystate->distance <= MAX_FUZZY_DISTANCE)
630  {
631  /*
632  * Record as provisional first match (this can occasionally occur
633  * because previous lowest distance was "too low a bar", rather
634  * than being associated with a real match)
635  */
636  fuzzystate->rfirst = rte;
637  fuzzystate->first = attnum;
638  }
639  }
640 }
641 
642 /*
643  * scanRTEForColumn
644  * Search the column names of a single RTE for the given name.
645  * If found, return an appropriate Var node, else return NULL.
646  * If the name proves ambiguous within this RTE, raise error.
647  *
648  * Side effect: if we find a match, mark the RTE as requiring read access
649  * for the column.
650  *
651  * Additional side effect: if fuzzystate is non-NULL, check non-system columns
652  * for an approximate match and update fuzzystate accordingly.
653  */
654 Node *
655 scanRTEForColumn(ParseState *pstate, RangeTblEntry *rte, char *colname,
656  int location, int fuzzy_rte_penalty,
657  FuzzyAttrMatchState *fuzzystate)
658 {
659  Node *result = NULL;
660  int attnum = 0;
661  Var *var;
662  ListCell *c;
663 
664  /*
665  * Scan the user column names (or aliases) for a match. Complain if
666  * multiple matches.
667  *
668  * Note: eref->colnames may include entries for dropped columns, but those
669  * will be empty strings that cannot match any legal SQL identifier, so we
670  * don't bother to test for that case here.
671  *
672  * Should this somehow go wrong and we try to access a dropped column,
673  * we'll still catch it by virtue of the checks in
674  * get_rte_attribute_type(), which is called by make_var(). That routine
675  * has to do a cache lookup anyway, so the check there is cheap. Callers
676  * interested in finding match with shortest distance need to defend
677  * against this directly, though.
678  */
679  foreach(c, rte->eref->colnames)
680  {
681  const char *attcolname = strVal(lfirst(c));
682 
683  attnum++;
684  if (strcmp(attcolname, colname) == 0)
685  {
686  if (result)
687  ereport(ERROR,
688  (errcode(ERRCODE_AMBIGUOUS_COLUMN),
689  errmsg("column reference \"%s\" is ambiguous",
690  colname),
691  parser_errposition(pstate, location)));
692  var = make_var(pstate, rte, attnum, location);
693  /* Require read access to the column */
694  markVarForSelectPriv(pstate, var, rte);
695  result = (Node *) var;
696  }
697 
698  /* Updating fuzzy match state, if provided. */
699  if (fuzzystate != NULL)
700  updateFuzzyAttrMatchState(fuzzy_rte_penalty, fuzzystate,
701  rte, attcolname, colname, attnum);
702  }
703 
704  /*
705  * If we have a unique match, return it. Note that this allows a user
706  * alias to override a system column name (such as OID) without error.
707  */
708  if (result)
709  return result;
710 
711  /*
712  * If the RTE represents a real relation, consider system column names.
713  * Composites are only used for pseudo-relations like ON CONFLICT's
714  * excluded.
715  */
716  if (rte->rtekind == RTE_RELATION &&
718  {
719  /* quick check to see if name could be a system column */
720  attnum = specialAttNum(colname);
721 
722  /* In constraint check, no system column is allowed except tableOid */
723  if (pstate->p_expr_kind == EXPR_KIND_CHECK_CONSTRAINT &&
724  attnum < InvalidAttrNumber && attnum != TableOidAttributeNumber)
725  ereport(ERROR,
726  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
727  errmsg("system column \"%s\" reference in check constraint is invalid",
728  colname),
729  parser_errposition(pstate, location)));
730 
731  if (attnum != InvalidAttrNumber)
732  {
733  /* now check to see if column actually is defined */
735  ObjectIdGetDatum(rte->relid),
736  Int16GetDatum(attnum)))
737  {
738  var = make_var(pstate, rte, attnum, location);
739  /* Require read access to the column */
740  markVarForSelectPriv(pstate, var, rte);
741  result = (Node *) var;
742  }
743  }
744  }
745 
746  return result;
747 }
748 
749 /*
750  * colNameToVar
751  * Search for an unqualified column name.
752  * If found, return the appropriate Var node (or expression).
753  * If not found, return NULL. If the name proves ambiguous, raise error.
754  * If localonly is true, only names in the innermost query are considered.
755  */
756 Node *
757 colNameToVar(ParseState *pstate, char *colname, bool localonly,
758  int location)
759 {
760  Node *result = NULL;
761  ParseState *orig_pstate = pstate;
762 
763  while (pstate != NULL)
764  {
765  ListCell *l;
766 
767  foreach(l, pstate->p_namespace)
768  {
770  RangeTblEntry *rte = nsitem->p_rte;
771  Node *newresult;
772 
773  /* Ignore table-only items */
774  if (!nsitem->p_cols_visible)
775  continue;
776  /* If not inside LATERAL, ignore lateral-only items */
777  if (nsitem->p_lateral_only && !pstate->p_lateral_active)
778  continue;
779 
780  /* use orig_pstate here to get the right sublevels_up */
781  newresult = scanRTEForColumn(orig_pstate, rte, colname, location,
782  0, NULL);
783 
784  if (newresult)
785  {
786  if (result)
787  ereport(ERROR,
788  (errcode(ERRCODE_AMBIGUOUS_COLUMN),
789  errmsg("column reference \"%s\" is ambiguous",
790  colname),
791  parser_errposition(pstate, location)));
792  check_lateral_ref_ok(pstate, nsitem, location);
793  result = newresult;
794  }
795  }
796 
797  if (result != NULL || localonly)
798  break; /* found, or don't want to look at parent */
799 
800  pstate = pstate->parentParseState;
801  }
802 
803  return result;
804 }
805 
806 /*
807  * searchRangeTableForCol
808  * See if any RangeTblEntry could possibly provide the given column name (or
809  * find the best match available). Returns state with relevant details.
810  *
811  * This is different from colNameToVar in that it considers every entry in
812  * the ParseState's rangetable(s), not only those that are currently visible
813  * in the p_namespace list(s). This behavior is invalid per the SQL spec,
814  * and it may give ambiguous results (there might be multiple equally valid
815  * matches, but only one will be returned). This must be used ONLY as a
816  * heuristic in giving suitable error messages. See errorMissingColumn.
817  *
818  * This function is also different in that it will consider approximate
819  * matches -- if the user entered an alias/column pair that is only slightly
820  * different from a valid pair, we may be able to infer what they meant to
821  * type and provide a reasonable hint.
822  *
823  * The FuzzyAttrMatchState will have 'rfirst' pointing to the best RTE
824  * containing the most promising match for the alias and column name. If
825  * the alias and column names match exactly, 'first' will be InvalidAttrNumber;
826  * otherwise, it will be the attribute number for the match. In the latter
827  * case, 'rsecond' may point to a second, equally close approximate match,
828  * and 'second' will contain the attribute number for the second match.
829  */
830 static FuzzyAttrMatchState *
831 searchRangeTableForCol(ParseState *pstate, const char *alias, char *colname,
832  int location)
833 {
834  ParseState *orig_pstate = pstate;
835  FuzzyAttrMatchState *fuzzystate = palloc(sizeof(FuzzyAttrMatchState));
836 
837  fuzzystate->distance = MAX_FUZZY_DISTANCE + 1;
838  fuzzystate->rfirst = NULL;
839  fuzzystate->rsecond = NULL;
840  fuzzystate->first = InvalidAttrNumber;
841  fuzzystate->second = InvalidAttrNumber;
842 
843  while (pstate != NULL)
844  {
845  ListCell *l;
846 
847  foreach(l, pstate->p_rtable)
848  {
849  RangeTblEntry *rte = (RangeTblEntry *) lfirst(l);
850  int fuzzy_rte_penalty = 0;
851 
852  /*
853  * Typically, it is not useful to look for matches within join
854  * RTEs; they effectively duplicate other RTEs for our purposes,
855  * and if a match is chosen from a join RTE, an unhelpful alias is
856  * displayed in the final diagnostic message.
857  */
858  if (rte->rtekind == RTE_JOIN)
859  continue;
860 
861  /*
862  * If the user didn't specify an alias, then matches against one
863  * RTE are as good as another. But if the user did specify an
864  * alias, then we want at least a fuzzy - and preferably an exact
865  * - match for the range table entry.
866  */
867  if (alias != NULL)
868  fuzzy_rte_penalty =
869  varstr_levenshtein_less_equal(alias, strlen(alias),
870  rte->eref->aliasname,
871  strlen(rte->eref->aliasname),
872  1, 1, 1,
873  MAX_FUZZY_DISTANCE + 1,
874  true);
875 
876  /*
877  * Scan for a matching column; if we find an exact match, we're
878  * done. Otherwise, update fuzzystate.
879  */
880  if (scanRTEForColumn(orig_pstate, rte, colname, location,
881  fuzzy_rte_penalty, fuzzystate)
882  && fuzzy_rte_penalty == 0)
883  {
884  fuzzystate->rfirst = rte;
885  fuzzystate->first = InvalidAttrNumber;
886  fuzzystate->rsecond = NULL;
887  fuzzystate->second = InvalidAttrNumber;
888  return fuzzystate;
889  }
890  }
891 
892  pstate = pstate->parentParseState;
893  }
894 
895  return fuzzystate;
896 }
897 
898 /*
899  * markRTEForSelectPriv
900  * Mark the specified column of an RTE as requiring SELECT privilege
901  *
902  * col == InvalidAttrNumber means a "whole row" reference
903  *
904  * The caller should pass the actual RTE if it has it handy; otherwise pass
905  * NULL, and we'll look it up here. (This uglification of the API is
906  * worthwhile because nearly all external callers have the RTE at hand.)
907  */
908 static void
910  int rtindex, AttrNumber col)
911 {
912  if (rte == NULL)
913  rte = rt_fetch(rtindex, pstate->p_rtable);
914 
915  if (rte->rtekind == RTE_RELATION)
916  {
917  /* Make sure the rel as a whole is marked for SELECT access */
918  rte->requiredPerms |= ACL_SELECT;
919  /* Must offset the attnum to fit in a bitmapset */
922  }
923  else if (rte->rtekind == RTE_JOIN)
924  {
925  if (col == InvalidAttrNumber)
926  {
927  /*
928  * A whole-row reference to a join has to be treated as whole-row
929  * references to the two inputs.
930  */
931  JoinExpr *j;
932 
933  if (rtindex > 0 && rtindex <= list_length(pstate->p_joinexprs))
934  j = list_nth_node(JoinExpr, pstate->p_joinexprs, rtindex - 1);
935  else
936  j = NULL;
937  if (j == NULL)
938  elog(ERROR, "could not find JoinExpr for whole-row reference");
939 
940  /* Note: we can't see FromExpr here */
941  if (IsA(j->larg, RangeTblRef))
942  {
943  int varno = ((RangeTblRef *) j->larg)->rtindex;
944 
945  markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
946  }
947  else if (IsA(j->larg, JoinExpr))
948  {
949  int varno = ((JoinExpr *) j->larg)->rtindex;
950 
951  markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
952  }
953  else
954  elog(ERROR, "unrecognized node type: %d",
955  (int) nodeTag(j->larg));
956  if (IsA(j->rarg, RangeTblRef))
957  {
958  int varno = ((RangeTblRef *) j->rarg)->rtindex;
959 
960  markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
961  }
962  else if (IsA(j->rarg, JoinExpr))
963  {
964  int varno = ((JoinExpr *) j->rarg)->rtindex;
965 
966  markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
967  }
968  else
969  elog(ERROR, "unrecognized node type: %d",
970  (int) nodeTag(j->rarg));
971  }
972  else
973  {
974  /*
975  * Regular join attribute, look at the alias-variable list.
976  *
977  * The aliasvar could be either a Var or a COALESCE expression,
978  * but in the latter case we should already have marked the two
979  * referent variables as being selected, due to their use in the
980  * JOIN clause. So we need only be concerned with the Var case.
981  * But we do need to drill down through implicit coercions.
982  */
983  Var *aliasvar;
984 
985  Assert(col > 0 && col <= list_length(rte->joinaliasvars));
986  aliasvar = (Var *) list_nth(rte->joinaliasvars, col - 1);
987  aliasvar = (Var *) strip_implicit_coercions((Node *) aliasvar);
988  if (aliasvar && IsA(aliasvar, Var))
989  markVarForSelectPriv(pstate, aliasvar, NULL);
990  }
991  }
992  /* other RTE types don't require privilege marking */
993 }
994 
995 /*
996  * markVarForSelectPriv
997  * Mark the RTE referenced by a Var as requiring SELECT privilege
998  *
999  * The caller should pass the Var's referenced RTE if it has it handy
1000  * (nearly all do); otherwise pass NULL.
1001  */
1002 void
1004 {
1005  Index lv;
1006 
1007  Assert(IsA(var, Var));
1008  /* Find the appropriate pstate if it's an uplevel Var */
1009  for (lv = 0; lv < var->varlevelsup; lv++)
1010  pstate = pstate->parentParseState;
1011  markRTEForSelectPriv(pstate, rte, var->varno, var->varattno);
1012 }
1013 
1014 /*
1015  * buildRelationAliases
1016  * Construct the eref column name list for a relation RTE.
1017  * This code is also used for function RTEs.
1018  *
1019  * tupdesc: the physical column information
1020  * alias: the user-supplied alias, or NULL if none
1021  * eref: the eref Alias to store column names in
1022  *
1023  * eref->colnames is filled in. Also, alias->colnames is rebuilt to insert
1024  * empty strings for any dropped columns, so that it will be one-to-one with
1025  * physical column numbers.
1026  *
1027  * It is an error for there to be more aliases present than required.
1028  */
1029 static void
1031 {
1032  int maxattrs = tupdesc->natts;
1033  ListCell *aliaslc;
1034  int numaliases;
1035  int varattno;
1036  int numdropped = 0;
1037 
1038  Assert(eref->colnames == NIL);
1039 
1040  if (alias)
1041  {
1042  aliaslc = list_head(alias->colnames);
1043  numaliases = list_length(alias->colnames);
1044  /* We'll rebuild the alias colname list */
1045  alias->colnames = NIL;
1046  }
1047  else
1048  {
1049  aliaslc = NULL;
1050  numaliases = 0;
1051  }
1052 
1053  for (varattno = 0; varattno < maxattrs; varattno++)
1054  {
1055  Form_pg_attribute attr = TupleDescAttr(tupdesc, varattno);
1056  Value *attrname;
1057 
1058  if (attr->attisdropped)
1059  {
1060  /* Always insert an empty string for a dropped column */
1061  attrname = makeString(pstrdup(""));
1062  if (aliaslc)
1063  alias->colnames = lappend(alias->colnames, attrname);
1064  numdropped++;
1065  }
1066  else if (aliaslc)
1067  {
1068  /* Use the next user-supplied alias */
1069  attrname = (Value *) lfirst(aliaslc);
1070  aliaslc = lnext(aliaslc);
1071  alias->colnames = lappend(alias->colnames, attrname);
1072  }
1073  else
1074  {
1075  attrname = makeString(pstrdup(NameStr(attr->attname)));
1076  /* we're done with the alias if any */
1077  }
1078 
1079  eref->colnames = lappend(eref->colnames, attrname);
1080  }
1081 
1082  /* Too many user-supplied aliases? */
1083  if (aliaslc)
1084  ereport(ERROR,
1085  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1086  errmsg("table \"%s\" has %d columns available but %d columns specified",
1087  eref->aliasname, maxattrs - numdropped, numaliases)));
1088 }
1089 
1090 /*
1091  * chooseScalarFunctionAlias
1092  * Select the column alias for a function in a function RTE,
1093  * when the function returns a scalar type (not composite or RECORD).
1094  *
1095  * funcexpr: transformed expression tree for the function call
1096  * funcname: function name (as determined by FigureColname)
1097  * alias: the user-supplied alias for the RTE, or NULL if none
1098  * nfuncs: the number of functions appearing in the function RTE
1099  *
1100  * Note that the name we choose might be overridden later, if the user-given
1101  * alias includes column alias names. That's of no concern here.
1102  */
1103 static char *
1104 chooseScalarFunctionAlias(Node *funcexpr, char *funcname,
1105  Alias *alias, int nfuncs)
1106 {
1107  char *pname;
1108 
1109  /*
1110  * If the expression is a simple function call, and the function has a
1111  * single OUT parameter that is named, use the parameter's name.
1112  */
1113  if (funcexpr && IsA(funcexpr, FuncExpr))
1114  {
1115  pname = get_func_result_name(((FuncExpr *) funcexpr)->funcid);
1116  if (pname)
1117  return pname;
1118  }
1119 
1120  /*
1121  * If there's just one function in the RTE, and the user gave an RTE alias
1122  * name, use that name. (This makes FROM func() AS foo use "foo" as the
1123  * column name as well as the table alias.)
1124  */
1125  if (nfuncs == 1 && alias)
1126  return alias->aliasname;
1127 
1128  /*
1129  * Otherwise use the function name.
1130  */
1131  return funcname;
1132 }
1133 
1134 /*
1135  * Open a table during parse analysis
1136  *
1137  * This is essentially just the same as heap_openrv(), except that it caters
1138  * to some parser-specific error reporting needs, notably that it arranges
1139  * to include the RangeVar's parse location in any resulting error.
1140  *
1141  * Note: properly, lockmode should be declared LOCKMODE not int, but that
1142  * would require importing storage/lock.h into parse_relation.h. Since
1143  * LOCKMODE is typedef'd as int anyway, that seems like overkill.
1144  */
1145 Relation
1146 parserOpenTable(ParseState *pstate, const RangeVar *relation, int lockmode)
1147 {
1148  Relation rel;
1149  ParseCallbackState pcbstate;
1150 
1151  setup_parser_errposition_callback(&pcbstate, pstate, relation->location);
1152  rel = heap_openrv_extended(relation, lockmode, true);
1153  if (rel == NULL)
1154  {
1155  if (relation->schemaname)
1156  ereport(ERROR,
1158  errmsg("relation \"%s.%s\" does not exist",
1159  relation->schemaname, relation->relname)));
1160  else
1161  {
1162  /*
1163  * An unqualified name might be a named ephemeral relation.
1164  */
1165  if (get_visible_ENR_metadata(pstate->p_queryEnv, relation->relname))
1166  rel = NULL;
1167 
1168  /*
1169  * An unqualified name might have been meant as a reference to
1170  * some not-yet-in-scope CTE. The bare "does not exist" message
1171  * has proven remarkably unhelpful for figuring out such problems,
1172  * so we take pains to offer a specific hint.
1173  */
1174  else if (isFutureCTE(pstate, relation->relname))
1175  ereport(ERROR,
1177  errmsg("relation \"%s\" does not exist",
1178  relation->relname),
1179  errdetail("There is a WITH item named \"%s\", but it cannot be referenced from this part of the query.",
1180  relation->relname),
1181  errhint("Use WITH RECURSIVE, or re-order the WITH items to remove forward references.")));
1182  else
1183  ereport(ERROR,
1185  errmsg("relation \"%s\" does not exist",
1186  relation->relname)));
1187  }
1188  }
1190  return rel;
1191 }
1192 
1193 /*
1194  * Add an entry for a relation to the pstate's range table (p_rtable).
1195  *
1196  * Note: formerly this checked for refname conflicts, but that's wrong.
1197  * Caller is responsible for checking for conflicts in the appropriate scope.
1198  */
1199 RangeTblEntry *
1201  RangeVar *relation,
1202  Alias *alias,
1203  bool inh,
1204  bool inFromCl)
1205 {
1207  char *refname = alias ? alias->aliasname : relation->relname;
1208  LOCKMODE lockmode;
1209  Relation rel;
1210 
1211  Assert(pstate != NULL);
1212 
1213  rte->rtekind = RTE_RELATION;
1214  rte->alias = alias;
1215 
1216  /*
1217  * Get the rel's OID. This access also ensures that we have an up-to-date
1218  * relcache entry for the rel. Since this is typically the first access
1219  * to a rel in a statement, be careful to get the right access level
1220  * depending on whether we're doing SELECT FOR UPDATE/SHARE.
1221  */
1222  lockmode = isLockedRefname(pstate, refname) ? RowShareLock : AccessShareLock;
1223  rel = parserOpenTable(pstate, relation, lockmode);
1224  rte->relid = RelationGetRelid(rel);
1225  rte->relkind = rel->rd_rel->relkind;
1226 
1227  /*
1228  * Build the list of effective column names using user-supplied aliases
1229  * and/or actual column names.
1230  */
1231  rte->eref = makeAlias(refname, NIL);
1232  buildRelationAliases(rel->rd_att, alias, rte->eref);
1233 
1234  /*
1235  * Drop the rel refcount, but keep the access lock till end of transaction
1236  * so that the table can't be deleted or have its schema modified
1237  * underneath us.
1238  */
1239  heap_close(rel, NoLock);
1240 
1241  /*
1242  * Set flags and access permissions.
1243  *
1244  * The initial default on access checks is always check-for-READ-access,
1245  * which is the right thing for all except target tables.
1246  */
1247  rte->lateral = false;
1248  rte->inh = inh;
1249  rte->inFromCl = inFromCl;
1250 
1251  rte->requiredPerms = ACL_SELECT;
1252  rte->checkAsUser = InvalidOid; /* not set-uid by default, either */
1253  rte->selectedCols = NULL;
1254  rte->insertedCols = NULL;
1255  rte->updatedCols = NULL;
1256 
1257  /*
1258  * Add completed RTE to pstate's range table list, but not to join list
1259  * nor namespace --- caller must do that if appropriate.
1260  */
1261  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1262 
1263  return rte;
1264 }
1265 
1266 /*
1267  * Add an entry for a relation to the pstate's range table (p_rtable).
1268  *
1269  * This is just like addRangeTableEntry() except that it makes an RTE
1270  * given an already-open relation instead of a RangeVar reference.
1271  */
1272 RangeTblEntry *
1274  Relation rel,
1275  Alias *alias,
1276  bool inh,
1277  bool inFromCl)
1278 {
1280  char *refname = alias ? alias->aliasname : RelationGetRelationName(rel);
1281 
1282  Assert(pstate != NULL);
1283 
1284  rte->rtekind = RTE_RELATION;
1285  rte->alias = alias;
1286  rte->relid = RelationGetRelid(rel);
1287  rte->relkind = rel->rd_rel->relkind;
1288 
1289  /*
1290  * Build the list of effective column names using user-supplied aliases
1291  * and/or actual column names.
1292  */
1293  rte->eref = makeAlias(refname, NIL);
1294  buildRelationAliases(rel->rd_att, alias, rte->eref);
1295 
1296  /*
1297  * Set flags and access permissions.
1298  *
1299  * The initial default on access checks is always check-for-READ-access,
1300  * which is the right thing for all except target tables.
1301  */
1302  rte->lateral = false;
1303  rte->inh = inh;
1304  rte->inFromCl = inFromCl;
1305 
1306  rte->requiredPerms = ACL_SELECT;
1307  rte->checkAsUser = InvalidOid; /* not set-uid by default, either */
1308  rte->selectedCols = NULL;
1309  rte->insertedCols = NULL;
1310  rte->updatedCols = NULL;
1311 
1312  /*
1313  * Add completed RTE to pstate's range table list, but not to join list
1314  * nor namespace --- caller must do that if appropriate.
1315  */
1316  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1317 
1318  return rte;
1319 }
1320 
1321 /*
1322  * Add an entry for a subquery to the pstate's range table (p_rtable).
1323  *
1324  * This is just like addRangeTableEntry() except that it makes a subquery RTE.
1325  * Note that an alias clause *must* be supplied.
1326  */
1327 RangeTblEntry *
1329  Query *subquery,
1330  Alias *alias,
1331  bool lateral,
1332  bool inFromCl)
1333 {
1335  char *refname = alias->aliasname;
1336  Alias *eref;
1337  int numaliases;
1338  int varattno;
1339  ListCell *tlistitem;
1340 
1341  Assert(pstate != NULL);
1342 
1343  rte->rtekind = RTE_SUBQUERY;
1344  rte->relid = InvalidOid;
1345  rte->subquery = subquery;
1346  rte->alias = alias;
1347 
1348  eref = copyObject(alias);
1349  numaliases = list_length(eref->colnames);
1350 
1351  /* fill in any unspecified alias columns */
1352  varattno = 0;
1353  foreach(tlistitem, subquery->targetList)
1354  {
1355  TargetEntry *te = (TargetEntry *) lfirst(tlistitem);
1356 
1357  if (te->resjunk)
1358  continue;
1359  varattno++;
1360  Assert(varattno == te->resno);
1361  if (varattno > numaliases)
1362  {
1363  char *attrname;
1364 
1365  attrname = pstrdup(te->resname);
1366  eref->colnames = lappend(eref->colnames, makeString(attrname));
1367  }
1368  }
1369  if (varattno < numaliases)
1370  ereport(ERROR,
1371  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1372  errmsg("table \"%s\" has %d columns available but %d columns specified",
1373  refname, varattno, numaliases)));
1374 
1375  rte->eref = eref;
1376 
1377  /*
1378  * Set flags and access permissions.
1379  *
1380  * Subqueries are never checked for access rights.
1381  */
1382  rte->lateral = lateral;
1383  rte->inh = false; /* never true for subqueries */
1384  rte->inFromCl = inFromCl;
1385 
1386  rte->requiredPerms = 0;
1387  rte->checkAsUser = InvalidOid;
1388  rte->selectedCols = NULL;
1389  rte->insertedCols = NULL;
1390  rte->updatedCols = NULL;
1391 
1392  /*
1393  * Add completed RTE to pstate's range table list, but not to join list
1394  * nor namespace --- caller must do that if appropriate.
1395  */
1396  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1397 
1398  return rte;
1399 }
1400 
1401 /*
1402  * Add an entry for a function (or functions) to the pstate's range table
1403  * (p_rtable).
1404  *
1405  * This is just like addRangeTableEntry() except that it makes a function RTE.
1406  */
1407 RangeTblEntry *
1409  List *funcnames,
1410  List *funcexprs,
1411  List *coldeflists,
1412  RangeFunction *rangefunc,
1413  bool lateral,
1414  bool inFromCl)
1415 {
1417  Alias *alias = rangefunc->alias;
1418  Alias *eref;
1419  char *aliasname;
1420  int nfuncs = list_length(funcexprs);
1421  TupleDesc *functupdescs;
1422  TupleDesc tupdesc;
1423  ListCell *lc1,
1424  *lc2,
1425  *lc3;
1426  int i;
1427  int j;
1428  int funcno;
1429  int natts,
1430  totalatts;
1431 
1432  Assert(pstate != NULL);
1433 
1434  rte->rtekind = RTE_FUNCTION;
1435  rte->relid = InvalidOid;
1436  rte->subquery = NULL;
1437  rte->functions = NIL; /* we'll fill this list below */
1438  rte->funcordinality = rangefunc->ordinality;
1439  rte->alias = alias;
1440 
1441  /*
1442  * Choose the RTE alias name. We default to using the first function's
1443  * name even when there's more than one; which is maybe arguable but beats
1444  * using something constant like "table".
1445  */
1446  if (alias)
1447  aliasname = alias->aliasname;
1448  else
1449  aliasname = linitial(funcnames);
1450 
1451  eref = makeAlias(aliasname, NIL);
1452  rte->eref = eref;
1453 
1454  /* Process each function ... */
1455  functupdescs = (TupleDesc *) palloc(nfuncs * sizeof(TupleDesc));
1456 
1457  totalatts = 0;
1458  funcno = 0;
1459  forthree(lc1, funcexprs, lc2, funcnames, lc3, coldeflists)
1460  {
1461  Node *funcexpr = (Node *) lfirst(lc1);
1462  char *funcname = (char *) lfirst(lc2);
1463  List *coldeflist = (List *) lfirst(lc3);
1465  TypeFuncClass functypclass;
1466  Oid funcrettype;
1467 
1468  /* Initialize RangeTblFunction node */
1469  rtfunc->funcexpr = funcexpr;
1470  rtfunc->funccolnames = NIL;
1471  rtfunc->funccoltypes = NIL;
1472  rtfunc->funccoltypmods = NIL;
1473  rtfunc->funccolcollations = NIL;
1474  rtfunc->funcparams = NULL; /* not set until planning */
1475 
1476  /*
1477  * Now determine if the function returns a simple or composite type.
1478  */
1479  functypclass = get_expr_result_type(funcexpr,
1480  &funcrettype,
1481  &tupdesc);
1482 
1483  /*
1484  * A coldeflist is required if the function returns RECORD and hasn't
1485  * got a predetermined record type, and is prohibited otherwise.
1486  */
1487  if (coldeflist != NIL)
1488  {
1489  if (functypclass != TYPEFUNC_RECORD)
1490  ereport(ERROR,
1491  (errcode(ERRCODE_SYNTAX_ERROR),
1492  errmsg("a column definition list is only allowed for functions returning \"record\""),
1493  parser_errposition(pstate,
1494  exprLocation((Node *) coldeflist))));
1495  }
1496  else
1497  {
1498  if (functypclass == TYPEFUNC_RECORD)
1499  ereport(ERROR,
1500  (errcode(ERRCODE_SYNTAX_ERROR),
1501  errmsg("a column definition list is required for functions returning \"record\""),
1502  parser_errposition(pstate, exprLocation(funcexpr))));
1503  }
1504 
1505  if (functypclass == TYPEFUNC_COMPOSITE)
1506  {
1507  /* Composite data type, e.g. a table's row type */
1508  Assert(tupdesc);
1509  }
1510  else if (functypclass == TYPEFUNC_SCALAR)
1511  {
1512  /* Base data type, i.e. scalar */
1513  tupdesc = CreateTemplateTupleDesc(1, false);
1514  TupleDescInitEntry(tupdesc,
1515  (AttrNumber) 1,
1516  chooseScalarFunctionAlias(funcexpr, funcname,
1517  alias, nfuncs),
1518  funcrettype,
1519  -1,
1520  0);
1521  }
1522  else if (functypclass == TYPEFUNC_RECORD)
1523  {
1524  ListCell *col;
1525 
1526  /*
1527  * Use the column definition list to construct a tupdesc and fill
1528  * in the RangeTblFunction's lists.
1529  */
1530  tupdesc = CreateTemplateTupleDesc(list_length(coldeflist), false);
1531  i = 1;
1532  foreach(col, coldeflist)
1533  {
1534  ColumnDef *n = (ColumnDef *) lfirst(col);
1535  char *attrname;
1536  Oid attrtype;
1537  int32 attrtypmod;
1538  Oid attrcollation;
1539 
1540  attrname = n->colname;
1541  if (n->typeName->setof)
1542  ereport(ERROR,
1543  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1544  errmsg("column \"%s\" cannot be declared SETOF",
1545  attrname),
1546  parser_errposition(pstate, n->location)));
1547  typenameTypeIdAndMod(pstate, n->typeName,
1548  &attrtype, &attrtypmod);
1549  attrcollation = GetColumnDefCollation(pstate, n, attrtype);
1550  TupleDescInitEntry(tupdesc,
1551  (AttrNumber) i,
1552  attrname,
1553  attrtype,
1554  attrtypmod,
1555  0);
1557  (AttrNumber) i,
1558  attrcollation);
1559  rtfunc->funccolnames = lappend(rtfunc->funccolnames,
1560  makeString(pstrdup(attrname)));
1561  rtfunc->funccoltypes = lappend_oid(rtfunc->funccoltypes,
1562  attrtype);
1563  rtfunc->funccoltypmods = lappend_int(rtfunc->funccoltypmods,
1564  attrtypmod);
1566  attrcollation);
1567 
1568  i++;
1569  }
1570 
1571  /*
1572  * Ensure that the coldeflist defines a legal set of names (no
1573  * duplicates) and datatypes (no pseudo-types, for instance).
1574  */
1576  }
1577  else
1578  ereport(ERROR,
1579  (errcode(ERRCODE_DATATYPE_MISMATCH),
1580  errmsg("function \"%s\" in FROM has unsupported return type %s",
1581  funcname, format_type_be(funcrettype)),
1582  parser_errposition(pstate, exprLocation(funcexpr))));
1583 
1584  /* Finish off the RangeTblFunction and add it to the RTE's list */
1585  rtfunc->funccolcount = tupdesc->natts;
1586  rte->functions = lappend(rte->functions, rtfunc);
1587 
1588  /* Save the tupdesc for use below */
1589  functupdescs[funcno] = tupdesc;
1590  totalatts += tupdesc->natts;
1591  funcno++;
1592  }
1593 
1594  /*
1595  * If there's more than one function, or we want an ordinality column, we
1596  * have to produce a merged tupdesc.
1597  */
1598  if (nfuncs > 1 || rangefunc->ordinality)
1599  {
1600  if (rangefunc->ordinality)
1601  totalatts++;
1602 
1603  /* Merge the tuple descs of each function into a composite one */
1604  tupdesc = CreateTemplateTupleDesc(totalatts, false);
1605  natts = 0;
1606  for (i = 0; i < nfuncs; i++)
1607  {
1608  for (j = 1; j <= functupdescs[i]->natts; j++)
1609  TupleDescCopyEntry(tupdesc, ++natts, functupdescs[i], j);
1610  }
1611 
1612  /* Add the ordinality column if needed */
1613  if (rangefunc->ordinality)
1614  TupleDescInitEntry(tupdesc,
1615  (AttrNumber) ++natts,
1616  "ordinality",
1617  INT8OID,
1618  -1,
1619  0);
1620 
1621  Assert(natts == totalatts);
1622  }
1623  else
1624  {
1625  /* We can just use the single function's tupdesc as-is */
1626  tupdesc = functupdescs[0];
1627  }
1628 
1629  /* Use the tupdesc while assigning column aliases for the RTE */
1630  buildRelationAliases(tupdesc, alias, eref);
1631 
1632  /*
1633  * Set flags and access permissions.
1634  *
1635  * Functions are never checked for access rights (at least, not by the RTE
1636  * permissions mechanism).
1637  */
1638  rte->lateral = lateral;
1639  rte->inh = false; /* never true for functions */
1640  rte->inFromCl = inFromCl;
1641 
1642  rte->requiredPerms = 0;
1643  rte->checkAsUser = InvalidOid;
1644  rte->selectedCols = NULL;
1645  rte->insertedCols = NULL;
1646  rte->updatedCols = NULL;
1647 
1648  /*
1649  * Add completed RTE to pstate's range table list, but not to join list
1650  * nor namespace --- caller must do that if appropriate.
1651  */
1652  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1653 
1654  return rte;
1655 }
1656 
1657 /*
1658  * Add an entry for a table function to the pstate's range table (p_rtable).
1659  *
1660  * This is much like addRangeTableEntry() except that it makes a tablefunc RTE.
1661  */
1662 RangeTblEntry *
1664  TableFunc *tf,
1665  Alias *alias,
1666  bool lateral,
1667  bool inFromCl)
1668 {
1670  char *refname = alias ? alias->aliasname : pstrdup("xmltable");
1671  Alias *eref;
1672  int numaliases;
1673 
1674  Assert(pstate != NULL);
1675 
1676  rte->rtekind = RTE_TABLEFUNC;
1677  rte->relid = InvalidOid;
1678  rte->subquery = NULL;
1679  rte->tablefunc = tf;
1680  rte->coltypes = tf->coltypes;
1681  rte->coltypmods = tf->coltypmods;
1682  rte->colcollations = tf->colcollations;
1683  rte->alias = alias;
1684 
1685  eref = alias ? copyObject(alias) : makeAlias(refname, NIL);
1686  numaliases = list_length(eref->colnames);
1687 
1688  /* fill in any unspecified alias columns */
1689  if (numaliases < list_length(tf->colnames))
1690  eref->colnames = list_concat(eref->colnames,
1691  list_copy_tail(tf->colnames, numaliases));
1692 
1693  rte->eref = eref;
1694 
1695  /*
1696  * Set flags and access permissions.
1697  *
1698  * Tablefuncs are never checked for access rights (at least, not by the
1699  * RTE permissions mechanism).
1700  */
1701  rte->lateral = lateral;
1702  rte->inh = false; /* never true for tablefunc RTEs */
1703  rte->inFromCl = inFromCl;
1704 
1705  rte->requiredPerms = 0;
1706  rte->checkAsUser = InvalidOid;
1707  rte->selectedCols = NULL;
1708  rte->insertedCols = NULL;
1709  rte->updatedCols = NULL;
1710 
1711  /*
1712  * Add completed RTE to pstate's range table list, but not to join list
1713  * nor namespace --- caller must do that if appropriate.
1714  */
1715  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1716 
1717  return rte;
1718 }
1719 
1720 /*
1721  * Add an entry for a VALUES list to the pstate's range table (p_rtable).
1722  *
1723  * This is much like addRangeTableEntry() except that it makes a values RTE.
1724  */
1725 RangeTblEntry *
1727  List *exprs,
1728  List *coltypes,
1729  List *coltypmods,
1730  List *colcollations,
1731  Alias *alias,
1732  bool lateral,
1733  bool inFromCl)
1734 {
1736  char *refname = alias ? alias->aliasname : pstrdup("*VALUES*");
1737  Alias *eref;
1738  int numaliases;
1739  int numcolumns;
1740 
1741  Assert(pstate != NULL);
1742 
1743  rte->rtekind = RTE_VALUES;
1744  rte->relid = InvalidOid;
1745  rte->subquery = NULL;
1746  rte->values_lists = exprs;
1747  rte->coltypes = coltypes;
1748  rte->coltypmods = coltypmods;
1749  rte->colcollations = colcollations;
1750  rte->alias = alias;
1751 
1752  eref = alias ? copyObject(alias) : makeAlias(refname, NIL);
1753 
1754  /* fill in any unspecified alias columns */
1755  numcolumns = list_length((List *) linitial(exprs));
1756  numaliases = list_length(eref->colnames);
1757  while (numaliases < numcolumns)
1758  {
1759  char attrname[64];
1760 
1761  numaliases++;
1762  snprintf(attrname, sizeof(attrname), "column%d", numaliases);
1763  eref->colnames = lappend(eref->colnames,
1764  makeString(pstrdup(attrname)));
1765  }
1766  if (numcolumns < numaliases)
1767  ereport(ERROR,
1768  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1769  errmsg("VALUES lists \"%s\" have %d columns available but %d columns specified",
1770  refname, numcolumns, numaliases)));
1771 
1772  rte->eref = eref;
1773 
1774  /*
1775  * Set flags and access permissions.
1776  *
1777  * Subqueries are never checked for access rights.
1778  */
1779  rte->lateral = lateral;
1780  rte->inh = false; /* never true for values RTEs */
1781  rte->inFromCl = inFromCl;
1782 
1783  rte->requiredPerms = 0;
1784  rte->checkAsUser = InvalidOid;
1785  rte->selectedCols = NULL;
1786  rte->insertedCols = NULL;
1787  rte->updatedCols = NULL;
1788 
1789  /*
1790  * Add completed RTE to pstate's range table list, but not to join list
1791  * nor namespace --- caller must do that if appropriate.
1792  */
1793  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1794 
1795  return rte;
1796 }
1797 
1798 /*
1799  * Add an entry for a join to the pstate's range table (p_rtable).
1800  *
1801  * This is much like addRangeTableEntry() except that it makes a join RTE.
1802  */
1803 RangeTblEntry *
1805  List *colnames,
1806  JoinType jointype,
1807  List *aliasvars,
1808  Alias *alias,
1809  bool inFromCl)
1810 {
1812  Alias *eref;
1813  int numaliases;
1814 
1815  Assert(pstate != NULL);
1816 
1817  /*
1818  * Fail if join has too many columns --- we must be able to reference any
1819  * of the columns with an AttrNumber.
1820  */
1821  if (list_length(aliasvars) > MaxAttrNumber)
1822  ereport(ERROR,
1823  (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
1824  errmsg("joins can have at most %d columns",
1825  MaxAttrNumber)));
1826 
1827  rte->rtekind = RTE_JOIN;
1828  rte->relid = InvalidOid;
1829  rte->subquery = NULL;
1830  rte->jointype = jointype;
1831  rte->joinaliasvars = aliasvars;
1832  rte->alias = alias;
1833 
1834  eref = alias ? copyObject(alias) : makeAlias("unnamed_join", NIL);
1835  numaliases = list_length(eref->colnames);
1836 
1837  /* fill in any unspecified alias columns */
1838  if (numaliases < list_length(colnames))
1839  eref->colnames = list_concat(eref->colnames,
1840  list_copy_tail(colnames, numaliases));
1841 
1842  rte->eref = eref;
1843 
1844  /*
1845  * Set flags and access permissions.
1846  *
1847  * Joins are never checked for access rights.
1848  */
1849  rte->lateral = false;
1850  rte->inh = false; /* never true for joins */
1851  rte->inFromCl = inFromCl;
1852 
1853  rte->requiredPerms = 0;
1854  rte->checkAsUser = InvalidOid;
1855  rte->selectedCols = NULL;
1856  rte->insertedCols = NULL;
1857  rte->updatedCols = NULL;
1858 
1859  /*
1860  * Add completed RTE to pstate's range table list, but not to join list
1861  * nor namespace --- caller must do that if appropriate.
1862  */
1863  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1864 
1865  return rte;
1866 }
1867 
1868 /*
1869  * Add an entry for a CTE reference to the pstate's range table (p_rtable).
1870  *
1871  * This is much like addRangeTableEntry() except that it makes a CTE RTE.
1872  */
1873 RangeTblEntry *
1875  CommonTableExpr *cte,
1876  Index levelsup,
1877  RangeVar *rv,
1878  bool inFromCl)
1879 {
1881  Alias *alias = rv->alias;
1882  char *refname = alias ? alias->aliasname : cte->ctename;
1883  Alias *eref;
1884  int numaliases;
1885  int varattno;
1886  ListCell *lc;
1887 
1888  Assert(pstate != NULL);
1889 
1890  rte->rtekind = RTE_CTE;
1891  rte->ctename = cte->ctename;
1892  rte->ctelevelsup = levelsup;
1893 
1894  /* Self-reference if and only if CTE's parse analysis isn't completed */
1895  rte->self_reference = !IsA(cte->ctequery, Query);
1896  Assert(cte->cterecursive || !rte->self_reference);
1897  /* Bump the CTE's refcount if this isn't a self-reference */
1898  if (!rte->self_reference)
1899  cte->cterefcount++;
1900 
1901  /*
1902  * We throw error if the CTE is INSERT/UPDATE/DELETE without RETURNING.
1903  * This won't get checked in case of a self-reference, but that's OK
1904  * because data-modifying CTEs aren't allowed to be recursive anyhow.
1905  */
1906  if (IsA(cte->ctequery, Query))
1907  {
1908  Query *ctequery = (Query *) cte->ctequery;
1909 
1910  if (ctequery->commandType != CMD_SELECT &&
1911  ctequery->returningList == NIL)
1912  ereport(ERROR,
1913  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1914  errmsg("WITH query \"%s\" does not have a RETURNING clause",
1915  cte->ctename),
1916  parser_errposition(pstate, rv->location)));
1917  }
1918 
1919  rte->coltypes = cte->ctecoltypes;
1920  rte->coltypmods = cte->ctecoltypmods;
1921  rte->colcollations = cte->ctecolcollations;
1922 
1923  rte->alias = alias;
1924  if (alias)
1925  eref = copyObject(alias);
1926  else
1927  eref = makeAlias(refname, NIL);
1928  numaliases = list_length(eref->colnames);
1929 
1930  /* fill in any unspecified alias columns */
1931  varattno = 0;
1932  foreach(lc, cte->ctecolnames)
1933  {
1934  varattno++;
1935  if (varattno > numaliases)
1936  eref->colnames = lappend(eref->colnames, lfirst(lc));
1937  }
1938  if (varattno < numaliases)
1939  ereport(ERROR,
1940  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1941  errmsg("table \"%s\" has %d columns available but %d columns specified",
1942  refname, varattno, numaliases)));
1943 
1944  rte->eref = eref;
1945 
1946  /*
1947  * Set flags and access permissions.
1948  *
1949  * Subqueries are never checked for access rights.
1950  */
1951  rte->lateral = false;
1952  rte->inh = false; /* never true for subqueries */
1953  rte->inFromCl = inFromCl;
1954 
1955  rte->requiredPerms = 0;
1956  rte->checkAsUser = InvalidOid;
1957  rte->selectedCols = NULL;
1958  rte->insertedCols = NULL;
1959  rte->updatedCols = NULL;
1960 
1961  /*
1962  * Add completed RTE to pstate's range table list, but not to join list
1963  * nor namespace --- caller must do that if appropriate.
1964  */
1965  pstate->p_rtable = lappend(pstate->p_rtable, rte);
1966 
1967  return rte;
1968 }
1969 
1970 /*
1971  * Add an entry for an ephemeral named relation reference to the pstate's
1972  * range table (p_rtable).
1973  *
1974  * It is expected that the RangeVar, which up until now is only known to be an
1975  * ephemeral named relation, will (in conjunction with the QueryEnvironment in
1976  * the ParseState), create a RangeTblEntry for a specific *kind* of ephemeral
1977  * named relation, based on enrtype.
1978  *
1979  * This is much like addRangeTableEntry() except that it makes an RTE for an
1980  * ephemeral named relation.
1981  */
1982 RangeTblEntry *
1984  RangeVar *rv,
1985  bool inFromCl)
1986 {
1988  Alias *alias = rv->alias;
1989  char *refname = alias ? alias->aliasname : rv->relname;
1991  TupleDesc tupdesc;
1992  int attno;
1993 
1994  Assert(pstate != NULL);
1995  enrmd = get_visible_ENR(pstate, rv->relname);
1996  Assert(enrmd != NULL);
1997 
1998  switch (enrmd->enrtype)
1999  {
2000  case ENR_NAMED_TUPLESTORE:
2002  break;
2003 
2004  default:
2005  elog(ERROR, "unexpected enrtype: %d", enrmd->enrtype);
2006  return NULL; /* for fussy compilers */
2007  }
2008 
2009  /*
2010  * Record dependency on a relation. This allows plans to be invalidated
2011  * if they access transition tables linked to a table that is altered.
2012  */
2013  rte->relid = enrmd->reliddesc;
2014 
2015  /*
2016  * Build the list of effective column names using user-supplied aliases
2017  * and/or actual column names.
2018  */
2019  tupdesc = ENRMetadataGetTupDesc(enrmd);
2020  rte->eref = makeAlias(refname, NIL);
2021  buildRelationAliases(tupdesc, alias, rte->eref);
2022 
2023  /* Record additional data for ENR, including column type info */
2024  rte->enrname = enrmd->name;
2025  rte->enrtuples = enrmd->enrtuples;
2026  rte->coltypes = NIL;
2027  rte->coltypmods = NIL;
2028  rte->colcollations = NIL;
2029  for (attno = 1; attno <= tupdesc->natts; ++attno)
2030  {
2031  Form_pg_attribute att = TupleDescAttr(tupdesc, attno - 1);
2032 
2033  if (att->attisdropped)
2034  {
2035  /* Record zeroes for a dropped column */
2036  rte->coltypes = lappend_oid(rte->coltypes, InvalidOid);
2037  rte->coltypmods = lappend_int(rte->coltypmods, 0);
2039  }
2040  else
2041  {
2042  /* Let's just make sure we can tell this isn't dropped */
2043  if (att->atttypid == InvalidOid)
2044  elog(ERROR, "atttypid is invalid for non-dropped column in \"%s\"",
2045  rv->relname);
2046  rte->coltypes = lappend_oid(rte->coltypes, att->atttypid);
2047  rte->coltypmods = lappend_int(rte->coltypmods, att->atttypmod);
2049  att->attcollation);
2050  }
2051  }
2052 
2053  /*
2054  * Set flags and access permissions.
2055  *
2056  * ENRs are never checked for access rights.
2057  */
2058  rte->lateral = false;
2059  rte->inh = false; /* never true for ENRs */
2060  rte->inFromCl = inFromCl;
2061 
2062  rte->requiredPerms = 0;
2063  rte->checkAsUser = InvalidOid;
2064  rte->selectedCols = NULL;
2065 
2066  /*
2067  * Add completed RTE to pstate's range table list, but not to join list
2068  * nor namespace --- caller must do that if appropriate.
2069  */
2070  pstate->p_rtable = lappend(pstate->p_rtable, rte);
2071 
2072  return rte;
2073 }
2074 
2075 
2076 /*
2077  * Has the specified refname been selected FOR UPDATE/FOR SHARE?
2078  *
2079  * This is used when we have not yet done transformLockingClause, but need
2080  * to know the correct lock to take during initial opening of relations.
2081  *
2082  * Note: we pay no attention to whether it's FOR UPDATE vs FOR SHARE,
2083  * since the table-level lock is the same either way.
2084  */
2085 bool
2086 isLockedRefname(ParseState *pstate, const char *refname)
2087 {
2088  ListCell *l;
2089 
2090  /*
2091  * If we are in a subquery specified as locked FOR UPDATE/SHARE from
2092  * parent level, then act as though there's a generic FOR UPDATE here.
2093  */
2094  if (pstate->p_locked_from_parent)
2095  return true;
2096 
2097  foreach(l, pstate->p_locking_clause)
2098  {
2099  LockingClause *lc = (LockingClause *) lfirst(l);
2100 
2101  if (lc->lockedRels == NIL)
2102  {
2103  /* all tables used in query */
2104  return true;
2105  }
2106  else
2107  {
2108  /* just the named tables */
2109  ListCell *l2;
2110 
2111  foreach(l2, lc->lockedRels)
2112  {
2113  RangeVar *thisrel = (RangeVar *) lfirst(l2);
2114 
2115  if (strcmp(refname, thisrel->relname) == 0)
2116  return true;
2117  }
2118  }
2119  }
2120  return false;
2121 }
2122 
2123 /*
2124  * Add the given RTE as a top-level entry in the pstate's join list
2125  * and/or namespace list. (We assume caller has checked for any
2126  * namespace conflicts.) The RTE is always marked as unconditionally
2127  * visible, that is, not LATERAL-only.
2128  *
2129  * Note: some callers know that they can find the new ParseNamespaceItem
2130  * at the end of the pstate->p_namespace list. This is a bit ugly but not
2131  * worth complicating this function's signature for.
2132  */
2133 void
2135  bool addToJoinList,
2136  bool addToRelNameSpace, bool addToVarNameSpace)
2137 {
2138  if (addToJoinList)
2139  {
2140  int rtindex = RTERangeTablePosn(pstate, rte, NULL);
2142 
2143  rtr->rtindex = rtindex;
2144  pstate->p_joinlist = lappend(pstate->p_joinlist, rtr);
2145  }
2146  if (addToRelNameSpace || addToVarNameSpace)
2147  {
2148  ParseNamespaceItem *nsitem;
2149 
2150  nsitem = (ParseNamespaceItem *) palloc(sizeof(ParseNamespaceItem));
2151  nsitem->p_rte = rte;
2152  nsitem->p_rel_visible = addToRelNameSpace;
2153  nsitem->p_cols_visible = addToVarNameSpace;
2154  nsitem->p_lateral_only = false;
2155  nsitem->p_lateral_ok = true;
2156  pstate->p_namespace = lappend(pstate->p_namespace, nsitem);
2157  }
2158 }
2159 
2160 /*
2161  * expandRTE -- expand the columns of a rangetable entry
2162  *
2163  * This creates lists of an RTE's column names (aliases if provided, else
2164  * real names) and Vars for each column. Only user columns are considered.
2165  * If include_dropped is FALSE then dropped columns are omitted from the
2166  * results. If include_dropped is TRUE then empty strings and NULL constants
2167  * (not Vars!) are returned for dropped columns.
2168  *
2169  * rtindex, sublevels_up, and location are the varno, varlevelsup, and location
2170  * values to use in the created Vars. Ordinarily rtindex should match the
2171  * actual position of the RTE in its rangetable.
2172  *
2173  * The output lists go into *colnames and *colvars.
2174  * If only one of the two kinds of output list is needed, pass NULL for the
2175  * output pointer for the unwanted one.
2176  */
2177 void
2178 expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up,
2179  int location, bool include_dropped,
2180  List **colnames, List **colvars)
2181 {
2182  int varattno;
2183 
2184  if (colnames)
2185  *colnames = NIL;
2186  if (colvars)
2187  *colvars = NIL;
2188 
2189  switch (rte->rtekind)
2190  {
2191  case RTE_RELATION:
2192  /* Ordinary relation RTE */
2193  expandRelation(rte->relid, rte->eref,
2194  rtindex, sublevels_up, location,
2195  include_dropped, colnames, colvars);
2196  break;
2197  case RTE_SUBQUERY:
2198  {
2199  /* Subquery RTE */
2200  ListCell *aliasp_item = list_head(rte->eref->colnames);
2201  ListCell *tlistitem;
2202 
2203  varattno = 0;
2204  foreach(tlistitem, rte->subquery->targetList)
2205  {
2206  TargetEntry *te = (TargetEntry *) lfirst(tlistitem);
2207 
2208  if (te->resjunk)
2209  continue;
2210  varattno++;
2211  Assert(varattno == te->resno);
2212 
2213  if (colnames)
2214  {
2215  /* Assume there is one alias per target item */
2216  char *label = strVal(lfirst(aliasp_item));
2217 
2218  *colnames = lappend(*colnames, makeString(pstrdup(label)));
2219  aliasp_item = lnext(aliasp_item);
2220  }
2221 
2222  if (colvars)
2223  {
2224  Var *varnode;
2225 
2226  varnode = makeVar(rtindex, varattno,
2227  exprType((Node *) te->expr),
2228  exprTypmod((Node *) te->expr),
2229  exprCollation((Node *) te->expr),
2230  sublevels_up);
2231  varnode->location = location;
2232 
2233  *colvars = lappend(*colvars, varnode);
2234  }
2235  }
2236  }
2237  break;
2238  case RTE_FUNCTION:
2239  {
2240  /* Function RTE */
2241  int atts_done = 0;
2242  ListCell *lc;
2243 
2244  foreach(lc, rte->functions)
2245  {
2246  RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
2247  TypeFuncClass functypclass;
2248  Oid funcrettype;
2249  TupleDesc tupdesc;
2250 
2251  functypclass = get_expr_result_type(rtfunc->funcexpr,
2252  &funcrettype,
2253  &tupdesc);
2254  if (functypclass == TYPEFUNC_COMPOSITE)
2255  {
2256  /* Composite data type, e.g. a table's row type */
2257  Assert(tupdesc);
2258  expandTupleDesc(tupdesc, rte->eref,
2259  rtfunc->funccolcount, atts_done,
2260  rtindex, sublevels_up, location,
2261  include_dropped, colnames, colvars);
2262  }
2263  else if (functypclass == TYPEFUNC_SCALAR)
2264  {
2265  /* Base data type, i.e. scalar */
2266  if (colnames)
2267  *colnames = lappend(*colnames,
2268  list_nth(rte->eref->colnames,
2269  atts_done));
2270 
2271  if (colvars)
2272  {
2273  Var *varnode;
2274 
2275  varnode = makeVar(rtindex, atts_done + 1,
2276  funcrettype, -1,
2277  exprCollation(rtfunc->funcexpr),
2278  sublevels_up);
2279  varnode->location = location;
2280 
2281  *colvars = lappend(*colvars, varnode);
2282  }
2283  }
2284  else if (functypclass == TYPEFUNC_RECORD)
2285  {
2286  if (colnames)
2287  {
2288  List *namelist;
2289 
2290  /* extract appropriate subset of column list */
2291  namelist = list_copy_tail(rte->eref->colnames,
2292  atts_done);
2293  namelist = list_truncate(namelist,
2294  rtfunc->funccolcount);
2295  *colnames = list_concat(*colnames, namelist);
2296  }
2297 
2298  if (colvars)
2299  {
2300  ListCell *l1;
2301  ListCell *l2;
2302  ListCell *l3;
2303  int attnum = atts_done;
2304 
2305  forthree(l1, rtfunc->funccoltypes,
2306  l2, rtfunc->funccoltypmods,
2307  l3, rtfunc->funccolcollations)
2308  {
2309  Oid attrtype = lfirst_oid(l1);
2310  int32 attrtypmod = lfirst_int(l2);
2311  Oid attrcollation = lfirst_oid(l3);
2312  Var *varnode;
2313 
2314  attnum++;
2315  varnode = makeVar(rtindex,
2316  attnum,
2317  attrtype,
2318  attrtypmod,
2319  attrcollation,
2320  sublevels_up);
2321  varnode->location = location;
2322  *colvars = lappend(*colvars, varnode);
2323  }
2324  }
2325  }
2326  else
2327  {
2328  /* addRangeTableEntryForFunction should've caught this */
2329  elog(ERROR, "function in FROM has unsupported return type");
2330  }
2331  atts_done += rtfunc->funccolcount;
2332  }
2333 
2334  /* Append the ordinality column if any */
2335  if (rte->funcordinality)
2336  {
2337  if (colnames)
2338  *colnames = lappend(*colnames,
2339  llast(rte->eref->colnames));
2340 
2341  if (colvars)
2342  {
2343  Var *varnode = makeVar(rtindex,
2344  atts_done + 1,
2345  INT8OID,
2346  -1,
2347  InvalidOid,
2348  sublevels_up);
2349 
2350  *colvars = lappend(*colvars, varnode);
2351  }
2352  }
2353  }
2354  break;
2355  case RTE_JOIN:
2356  {
2357  /* Join RTE */
2358  ListCell *colname;
2359  ListCell *aliasvar;
2360 
2362 
2363  varattno = 0;
2364  forboth(colname, rte->eref->colnames, aliasvar, rte->joinaliasvars)
2365  {
2366  Node *avar = (Node *) lfirst(aliasvar);
2367 
2368  varattno++;
2369 
2370  /*
2371  * During ordinary parsing, there will never be any
2372  * deleted columns in the join; but we have to check since
2373  * this routine is also used by the rewriter, and joins
2374  * found in stored rules might have join columns for
2375  * since-deleted columns. This will be signaled by a null
2376  * pointer in the alias-vars list.
2377  */
2378  if (avar == NULL)
2379  {
2380  if (include_dropped)
2381  {
2382  if (colnames)
2383  *colnames = lappend(*colnames,
2384  makeString(pstrdup("")));
2385  if (colvars)
2386  {
2387  /*
2388  * Can't use join's column type here (it might
2389  * be dropped!); but it doesn't really matter
2390  * what type the Const claims to be.
2391  */
2392  *colvars = lappend(*colvars,
2393  makeNullConst(INT4OID, -1,
2394  InvalidOid));
2395  }
2396  }
2397  continue;
2398  }
2399 
2400  if (colnames)
2401  {
2402  char *label = strVal(lfirst(colname));
2403 
2404  *colnames = lappend(*colnames,
2405  makeString(pstrdup(label)));
2406  }
2407 
2408  if (colvars)
2409  {
2410  Var *varnode;
2411 
2412  varnode = makeVar(rtindex, varattno,
2413  exprType(avar),
2414  exprTypmod(avar),
2415  exprCollation(avar),
2416  sublevels_up);
2417  varnode->location = location;
2418 
2419  *colvars = lappend(*colvars, varnode);
2420  }
2421  }
2422  }
2423  break;
2424  case RTE_TABLEFUNC:
2425  case RTE_VALUES:
2426  case RTE_CTE:
2427  case RTE_NAMEDTUPLESTORE:
2428  {
2429  /* Tablefunc, Values, CTE, or ENR RTE */
2430  ListCell *aliasp_item = list_head(rte->eref->colnames);
2431  ListCell *lct;
2432  ListCell *lcm;
2433  ListCell *lcc;
2434 
2435  varattno = 0;
2436  forthree(lct, rte->coltypes,
2437  lcm, rte->coltypmods,
2438  lcc, rte->colcollations)
2439  {
2440  Oid coltype = lfirst_oid(lct);
2441  int32 coltypmod = lfirst_int(lcm);
2442  Oid colcoll = lfirst_oid(lcc);
2443 
2444  varattno++;
2445 
2446  if (colnames)
2447  {
2448  /* Assume there is one alias per output column */
2449  if (OidIsValid(coltype))
2450  {
2451  char *label = strVal(lfirst(aliasp_item));
2452 
2453  *colnames = lappend(*colnames,
2454  makeString(pstrdup(label)));
2455  }
2456  else if (include_dropped)
2457  *colnames = lappend(*colnames,
2458  makeString(pstrdup("")));
2459 
2460  aliasp_item = lnext(aliasp_item);
2461  }
2462 
2463  if (colvars)
2464  {
2465  if (OidIsValid(coltype))
2466  {
2467  Var *varnode;
2468 
2469  varnode = makeVar(rtindex, varattno,
2470  coltype, coltypmod, colcoll,
2471  sublevels_up);
2472  varnode->location = location;
2473 
2474  *colvars = lappend(*colvars, varnode);
2475  }
2476  else if (include_dropped)
2477  {
2478  /*
2479  * It doesn't really matter what type the Const
2480  * claims to be.
2481  */
2482  *colvars = lappend(*colvars,
2483  makeNullConst(INT4OID, -1,
2484  InvalidOid));
2485  }
2486  }
2487  }
2488  }
2489  break;
2490  default:
2491  elog(ERROR, "unrecognized RTE kind: %d", (int) rte->rtekind);
2492  }
2493 }
2494 
2495 /*
2496  * expandRelation -- expandRTE subroutine
2497  */
2498 static void
2499 expandRelation(Oid relid, Alias *eref, int rtindex, int sublevels_up,
2500  int location, bool include_dropped,
2501  List **colnames, List **colvars)
2502 {
2503  Relation rel;
2504 
2505  /* Get the tupledesc and turn it over to expandTupleDesc */
2506  rel = relation_open(relid, AccessShareLock);
2507  expandTupleDesc(rel->rd_att, eref, rel->rd_att->natts, 0,
2508  rtindex, sublevels_up,
2509  location, include_dropped,
2510  colnames, colvars);
2512 }
2513 
2514 /*
2515  * expandTupleDesc -- expandRTE subroutine
2516  *
2517  * Generate names and/or Vars for the first "count" attributes of the tupdesc,
2518  * and append them to colnames/colvars. "offset" is added to the varattno
2519  * that each Var would otherwise have, and we also skip the first "offset"
2520  * entries in eref->colnames. (These provisions allow use of this code for
2521  * an individual composite-returning function in an RTE_FUNCTION RTE.)
2522  */
2523 static void
2524 expandTupleDesc(TupleDesc tupdesc, Alias *eref, int count, int offset,
2525  int rtindex, int sublevels_up,
2526  int location, bool include_dropped,
2527  List **colnames, List **colvars)
2528 {
2529  ListCell *aliascell = list_head(eref->colnames);
2530  int varattno;
2531 
2532  if (colnames)
2533  {
2534  int i;
2535 
2536  for (i = 0; i < offset; i++)
2537  {
2538  if (aliascell)
2539  aliascell = lnext(aliascell);
2540  }
2541  }
2542 
2543  Assert(count <= tupdesc->natts);
2544  for (varattno = 0; varattno < count; varattno++)
2545  {
2546  Form_pg_attribute attr = TupleDescAttr(tupdesc, varattno);
2547 
2548  if (attr->attisdropped)
2549  {
2550  if (include_dropped)
2551  {
2552  if (colnames)
2553  *colnames = lappend(*colnames, makeString(pstrdup("")));
2554  if (colvars)
2555  {
2556  /*
2557  * can't use atttypid here, but it doesn't really matter
2558  * what type the Const claims to be.
2559  */
2560  *colvars = lappend(*colvars,
2562  }
2563  }
2564  if (aliascell)
2565  aliascell = lnext(aliascell);
2566  continue;
2567  }
2568 
2569  if (colnames)
2570  {
2571  char *label;
2572 
2573  if (aliascell)
2574  {
2575  label = strVal(lfirst(aliascell));
2576  aliascell = lnext(aliascell);
2577  }
2578  else
2579  {
2580  /* If we run out of aliases, use the underlying name */
2581  label = NameStr(attr->attname);
2582  }
2583  *colnames = lappend(*colnames, makeString(pstrdup(label)));
2584  }
2585 
2586  if (colvars)
2587  {
2588  Var *varnode;
2589 
2590  varnode = makeVar(rtindex, varattno + offset + 1,
2591  attr->atttypid, attr->atttypmod,
2592  attr->attcollation,
2593  sublevels_up);
2594  varnode->location = location;
2595 
2596  *colvars = lappend(*colvars, varnode);
2597  }
2598  }
2599 }
2600 
2601 /*
2602  * expandRelAttrs -
2603  * Workhorse for "*" expansion: produce a list of targetentries
2604  * for the attributes of the RTE
2605  *
2606  * As with expandRTE, rtindex/sublevels_up determine the varno/varlevelsup
2607  * fields of the Vars produced, and location sets their location.
2608  * pstate->p_next_resno determines the resnos assigned to the TLEs.
2609  * The referenced columns are marked as requiring SELECT access.
2610  */
2611 List *
2613  int rtindex, int sublevels_up, int location)
2614 {
2615  List *names,
2616  *vars;
2617  ListCell *name,
2618  *var;
2619  List *te_list = NIL;
2620 
2621  expandRTE(rte, rtindex, sublevels_up, location, false,
2622  &names, &vars);
2623 
2624  /*
2625  * Require read access to the table. This is normally redundant with the
2626  * markVarForSelectPriv calls below, but not if the table has zero
2627  * columns.
2628  */
2629  rte->requiredPerms |= ACL_SELECT;
2630 
2631  forboth(name, names, var, vars)
2632  {
2633  char *label = strVal(lfirst(name));
2634  Var *varnode = (Var *) lfirst(var);
2635  TargetEntry *te;
2636 
2637  te = makeTargetEntry((Expr *) varnode,
2638  (AttrNumber) pstate->p_next_resno++,
2639  label,
2640  false);
2641  te_list = lappend(te_list, te);
2642 
2643  /* Require read access to each column */
2644  markVarForSelectPriv(pstate, varnode, rte);
2645  }
2646 
2647  Assert(name == NULL && var == NULL); /* lists not the same length? */
2648 
2649  return te_list;
2650 }
2651 
2652 /*
2653  * get_rte_attribute_name
2654  * Get an attribute name from a RangeTblEntry
2655  *
2656  * This is unlike get_attname() because we use aliases if available.
2657  * In particular, it will work on an RTE for a subselect or join, whereas
2658  * get_attname() only works on real relations.
2659  *
2660  * "*" is returned if the given attnum is InvalidAttrNumber --- this case
2661  * occurs when a Var represents a whole tuple of a relation.
2662  */
2663 char *
2665 {
2666  if (attnum == InvalidAttrNumber)
2667  return "*";
2668 
2669  /*
2670  * If there is a user-written column alias, use it.
2671  */
2672  if (rte->alias &&
2673  attnum > 0 && attnum <= list_length(rte->alias->colnames))
2674  return strVal(list_nth(rte->alias->colnames, attnum - 1));
2675 
2676  /*
2677  * If the RTE is a relation, go to the system catalogs not the
2678  * eref->colnames list. This is a little slower but it will give the
2679  * right answer if the column has been renamed since the eref list was
2680  * built (which can easily happen for rules).
2681  */
2682  if (rte->rtekind == RTE_RELATION)
2683  return get_relid_attribute_name(rte->relid, attnum);
2684 
2685  /*
2686  * Otherwise use the column name from eref. There should always be one.
2687  */
2688  if (attnum > 0 && attnum <= list_length(rte->eref->colnames))
2689  return strVal(list_nth(rte->eref->colnames, attnum - 1));
2690 
2691  /* else caller gave us a bogus attnum */
2692  elog(ERROR, "invalid attnum %d for rangetable entry %s",
2693  attnum, rte->eref->aliasname);
2694  return NULL; /* keep compiler quiet */
2695 }
2696 
2697 /*
2698  * get_rte_attribute_type
2699  * Get attribute type/typmod/collation information from a RangeTblEntry
2700  */
2701 void
2703  Oid *vartype, int32 *vartypmod, Oid *varcollid)
2704 {
2705  switch (rte->rtekind)
2706  {
2707  case RTE_RELATION:
2708  {
2709  /* Plain relation RTE --- get the attribute's type info */
2710  HeapTuple tp;
2711  Form_pg_attribute att_tup;
2712 
2713  tp = SearchSysCache2(ATTNUM,
2714  ObjectIdGetDatum(rte->relid),
2715  Int16GetDatum(attnum));
2716  if (!HeapTupleIsValid(tp)) /* shouldn't happen */
2717  elog(ERROR, "cache lookup failed for attribute %d of relation %u",
2718  attnum, rte->relid);
2719  att_tup = (Form_pg_attribute) GETSTRUCT(tp);
2720 
2721  /*
2722  * If dropped column, pretend it ain't there. See notes in
2723  * scanRTEForColumn.
2724  */
2725  if (att_tup->attisdropped)
2726  ereport(ERROR,
2727  (errcode(ERRCODE_UNDEFINED_COLUMN),
2728  errmsg("column \"%s\" of relation \"%s\" does not exist",
2729  NameStr(att_tup->attname),
2730  get_rel_name(rte->relid))));
2731  *vartype = att_tup->atttypid;
2732  *vartypmod = att_tup->atttypmod;
2733  *varcollid = att_tup->attcollation;
2734  ReleaseSysCache(tp);
2735  }
2736  break;
2737  case RTE_SUBQUERY:
2738  {
2739  /* Subselect RTE --- get type info from subselect's tlist */
2741  attnum);
2742 
2743  if (te == NULL || te->resjunk)
2744  elog(ERROR, "subquery %s does not have attribute %d",
2745  rte->eref->aliasname, attnum);
2746  *vartype = exprType((Node *) te->expr);
2747  *vartypmod = exprTypmod((Node *) te->expr);
2748  *varcollid = exprCollation((Node *) te->expr);
2749  }
2750  break;
2751  case RTE_FUNCTION:
2752  {
2753  /* Function RTE */
2754  ListCell *lc;
2755  int atts_done = 0;
2756 
2757  /* Identify which function covers the requested column */
2758  foreach(lc, rte->functions)
2759  {
2760  RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
2761 
2762  if (attnum > atts_done &&
2763  attnum <= atts_done + rtfunc->funccolcount)
2764  {
2765  TypeFuncClass functypclass;
2766  Oid funcrettype;
2767  TupleDesc tupdesc;
2768 
2769  attnum -= atts_done; /* now relative to this func */
2770  functypclass = get_expr_result_type(rtfunc->funcexpr,
2771  &funcrettype,
2772  &tupdesc);
2773 
2774  if (functypclass == TYPEFUNC_COMPOSITE)
2775  {
2776  /* Composite data type, e.g. a table's row type */
2777  Form_pg_attribute att_tup;
2778 
2779  Assert(tupdesc);
2780  Assert(attnum <= tupdesc->natts);
2781  att_tup = TupleDescAttr(tupdesc, attnum - 1);
2782 
2783  /*
2784  * If dropped column, pretend it ain't there. See
2785  * notes in scanRTEForColumn.
2786  */
2787  if (att_tup->attisdropped)
2788  ereport(ERROR,
2789  (errcode(ERRCODE_UNDEFINED_COLUMN),
2790  errmsg("column \"%s\" of relation \"%s\" does not exist",
2791  NameStr(att_tup->attname),
2792  rte->eref->aliasname)));
2793  *vartype = att_tup->atttypid;
2794  *vartypmod = att_tup->atttypmod;
2795  *varcollid = att_tup->attcollation;
2796  }
2797  else if (functypclass == TYPEFUNC_SCALAR)
2798  {
2799  /* Base data type, i.e. scalar */
2800  *vartype = funcrettype;
2801  *vartypmod = -1;
2802  *varcollid = exprCollation(rtfunc->funcexpr);
2803  }
2804  else if (functypclass == TYPEFUNC_RECORD)
2805  {
2806  *vartype = list_nth_oid(rtfunc->funccoltypes,
2807  attnum - 1);
2808  *vartypmod = list_nth_int(rtfunc->funccoltypmods,
2809  attnum - 1);
2810  *varcollid = list_nth_oid(rtfunc->funccolcollations,
2811  attnum - 1);
2812  }
2813  else
2814  {
2815  /*
2816  * addRangeTableEntryForFunction should've caught
2817  * this
2818  */
2819  elog(ERROR, "function in FROM has unsupported return type");
2820  }
2821  return;
2822  }
2823  atts_done += rtfunc->funccolcount;
2824  }
2825 
2826  /* If we get here, must be looking for the ordinality column */
2827  if (rte->funcordinality && attnum == atts_done + 1)
2828  {
2829  *vartype = INT8OID;
2830  *vartypmod = -1;
2831  *varcollid = InvalidOid;
2832  return;
2833  }
2834 
2835  /* this probably can't happen ... */
2836  ereport(ERROR,
2837  (errcode(ERRCODE_UNDEFINED_COLUMN),
2838  errmsg("column %d of relation \"%s\" does not exist",
2839  attnum,
2840  rte->eref->aliasname)));
2841  }
2842  break;
2843  case RTE_JOIN:
2844  {
2845  /*
2846  * Join RTE --- get type info from join RTE's alias variable
2847  */
2848  Node *aliasvar;
2849 
2850  Assert(attnum > 0 && attnum <= list_length(rte->joinaliasvars));
2851  aliasvar = (Node *) list_nth(rte->joinaliasvars, attnum - 1);
2852  Assert(aliasvar != NULL);
2853  *vartype = exprType(aliasvar);
2854  *vartypmod = exprTypmod(aliasvar);
2855  *varcollid = exprCollation(aliasvar);
2856  }
2857  break;
2858  case RTE_TABLEFUNC:
2859  case RTE_VALUES:
2860  case RTE_CTE:
2861  case RTE_NAMEDTUPLESTORE:
2862  {
2863  /*
2864  * tablefunc, VALUES, CTE, or ENR RTE --- get type info from
2865  * lists in the RTE
2866  */
2867  Assert(attnum > 0 && attnum <= list_length(rte->coltypes));
2868  *vartype = list_nth_oid(rte->coltypes, attnum - 1);
2869  *vartypmod = list_nth_int(rte->coltypmods, attnum - 1);
2870  *varcollid = list_nth_oid(rte->colcollations, attnum - 1);
2871 
2872  /* For ENR, better check for dropped column */
2873  if (!OidIsValid(*vartype))
2874  ereport(ERROR,
2875  (errcode(ERRCODE_UNDEFINED_COLUMN),
2876  errmsg("column %d of relation \"%s\" does not exist",
2877  attnum,
2878  rte->eref->aliasname)));
2879  }
2880  break;
2881  default:
2882  elog(ERROR, "unrecognized RTE kind: %d", (int) rte->rtekind);
2883  }
2884 }
2885 
2886 /*
2887  * get_rte_attribute_is_dropped
2888  * Check whether attempted attribute ref is to a dropped column
2889  */
2890 bool
2892 {
2893  bool result;
2894 
2895  switch (rte->rtekind)
2896  {
2897  case RTE_RELATION:
2898  {
2899  /*
2900  * Plain relation RTE --- get the attribute's catalog entry
2901  */
2902  HeapTuple tp;
2903  Form_pg_attribute att_tup;
2904 
2905  tp = SearchSysCache2(ATTNUM,
2906  ObjectIdGetDatum(rte->relid),
2907  Int16GetDatum(attnum));
2908  if (!HeapTupleIsValid(tp)) /* shouldn't happen */
2909  elog(ERROR, "cache lookup failed for attribute %d of relation %u",
2910  attnum, rte->relid);
2911  att_tup = (Form_pg_attribute) GETSTRUCT(tp);
2912  result = att_tup->attisdropped;
2913  ReleaseSysCache(tp);
2914  }
2915  break;
2916  case RTE_SUBQUERY:
2917  case RTE_TABLEFUNC:
2918  case RTE_VALUES:
2919  case RTE_CTE:
2920 
2921  /*
2922  * Subselect, Table Functions, Values, CTE RTEs never have dropped
2923  * columns
2924  */
2925  result = false;
2926  break;
2927  case RTE_NAMEDTUPLESTORE:
2928  {
2929  /* Check dropped-ness by testing for valid coltype */
2930  if (attnum <= 0 ||
2931  attnum > list_length(rte->coltypes))
2932  elog(ERROR, "invalid varattno %d", attnum);
2933  result = !OidIsValid((list_nth_oid(rte->coltypes, attnum - 1)));
2934  }
2935  break;
2936  case RTE_JOIN:
2937  {
2938  /*
2939  * A join RTE would not have dropped columns when constructed,
2940  * but one in a stored rule might contain columns that were
2941  * dropped from the underlying tables, if said columns are
2942  * nowhere explicitly referenced in the rule. This will be
2943  * signaled to us by a null pointer in the joinaliasvars list.
2944  */
2945  Var *aliasvar;
2946 
2947  if (attnum <= 0 ||
2948  attnum > list_length(rte->joinaliasvars))
2949  elog(ERROR, "invalid varattno %d", attnum);
2950  aliasvar = (Var *) list_nth(rte->joinaliasvars, attnum - 1);
2951 
2952  result = (aliasvar == NULL);
2953  }
2954  break;
2955  case RTE_FUNCTION:
2956  {
2957  /* Function RTE */
2958  ListCell *lc;
2959  int atts_done = 0;
2960 
2961  /*
2962  * Dropped attributes are only possible with functions that
2963  * return named composite types. In such a case we have to
2964  * look up the result type to see if it currently has this
2965  * column dropped. So first, loop over the funcs until we
2966  * find the one that covers the requested column.
2967  */
2968  foreach(lc, rte->functions)
2969  {
2970  RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
2971 
2972  if (attnum > atts_done &&
2973  attnum <= atts_done + rtfunc->funccolcount)
2974  {
2975  TypeFuncClass functypclass;
2976  Oid funcrettype;
2977  TupleDesc tupdesc;
2978 
2979  functypclass = get_expr_result_type(rtfunc->funcexpr,
2980  &funcrettype,
2981  &tupdesc);
2982  if (functypclass == TYPEFUNC_COMPOSITE)
2983  {
2984  /* Composite data type, e.g. a table's row type */
2985  Form_pg_attribute att_tup;
2986 
2987  Assert(tupdesc);
2988  Assert(attnum - atts_done <= tupdesc->natts);
2989  att_tup = TupleDescAttr(tupdesc,
2990  attnum - atts_done - 1);
2991  return att_tup->attisdropped;
2992  }
2993  /* Otherwise, it can't have any dropped columns */
2994  return false;
2995  }
2996  atts_done += rtfunc->funccolcount;
2997  }
2998 
2999  /* If we get here, must be looking for the ordinality column */
3000  if (rte->funcordinality && attnum == atts_done + 1)
3001  return false;
3002 
3003  /* this probably can't happen ... */
3004  ereport(ERROR,
3005  (errcode(ERRCODE_UNDEFINED_COLUMN),
3006  errmsg("column %d of relation \"%s\" does not exist",
3007  attnum,
3008  rte->eref->aliasname)));
3009  result = false; /* keep compiler quiet */
3010  }
3011  break;
3012  default:
3013  elog(ERROR, "unrecognized RTE kind: %d", (int) rte->rtekind);
3014  result = false; /* keep compiler quiet */
3015  }
3016 
3017  return result;
3018 }
3019 
3020 /*
3021  * Given a targetlist and a resno, return the matching TargetEntry
3022  *
3023  * Returns NULL if resno is not present in list.
3024  *
3025  * Note: we need to search, rather than just indexing with list_nth(),
3026  * because not all tlists are sorted by resno.
3027  */
3028 TargetEntry *
3030 {
3031  ListCell *l;
3032 
3033  foreach(l, tlist)
3034  {
3035  TargetEntry *tle = (TargetEntry *) lfirst(l);
3036 
3037  if (tle->resno == resno)
3038  return tle;
3039  }
3040  return NULL;
3041 }
3042 
3043 /*
3044  * Given a Query and rangetable index, return relation's RowMarkClause if any
3045  *
3046  * Returns NULL if relation is not selected FOR UPDATE/SHARE
3047  */
3048 RowMarkClause *
3050 {
3051  ListCell *l;
3052 
3053  foreach(l, qry->rowMarks)
3054  {
3055  RowMarkClause *rc = (RowMarkClause *) lfirst(l);
3056 
3057  if (rc->rti == rtindex)
3058  return rc;
3059  }
3060  return NULL;
3061 }
3062 
3063 /*
3064  * given relation and att name, return attnum of variable
3065  *
3066  * Returns InvalidAttrNumber if the attr doesn't exist (or is dropped).
3067  *
3068  * This should only be used if the relation is already
3069  * heap_open()'ed. Use the cache version get_attnum()
3070  * for access to non-opened relations.
3071  */
3072 int
3073 attnameAttNum(Relation rd, const char *attname, bool sysColOK)
3074 {
3075  int i;
3076 
3077  for (i = 0; i < rd->rd_rel->relnatts; i++)
3078  {
3079  Form_pg_attribute att = TupleDescAttr(rd->rd_att, i);
3080 
3081  if (namestrcmp(&(att->attname), attname) == 0 && !att->attisdropped)
3082  return i + 1;
3083  }
3084 
3085  if (sysColOK)
3086  {
3087  if ((i = specialAttNum(attname)) != InvalidAttrNumber)
3088  {
3089  if (i != ObjectIdAttributeNumber || rd->rd_rel->relhasoids)
3090  return i;
3091  }
3092  }
3093 
3094  /* on failure */
3095  return InvalidAttrNumber;
3096 }
3097 
3098 /* specialAttNum()
3099  *
3100  * Check attribute name to see if it is "special", e.g. "oid".
3101  * - thomas 2000-02-07
3102  *
3103  * Note: this only discovers whether the name could be a system attribute.
3104  * Caller needs to verify that it really is an attribute of the rel,
3105  * at least in the case of "oid", which is now optional.
3106  */
3107 static int
3108 specialAttNum(const char *attname)
3109 {
3110  Form_pg_attribute sysatt;
3111 
3112  sysatt = SystemAttributeByName(attname,
3113  true /* "oid" will be accepted */ );
3114  if (sysatt != NULL)
3115  return sysatt->attnum;
3116  return InvalidAttrNumber;
3117 }
3118 
3119 
3120 /*
3121  * given attribute id, return name of that attribute
3122  *
3123  * This should only be used if the relation is already
3124  * heap_open()'ed. Use the cache version get_atttype()
3125  * for access to non-opened relations.
3126  */
3127 Name
3128 attnumAttName(Relation rd, int attid)
3129 {
3130  if (attid <= 0)
3131  {
3132  Form_pg_attribute sysatt;
3133 
3134  sysatt = SystemAttributeDefinition(attid, rd->rd_rel->relhasoids);
3135  return &sysatt->attname;
3136  }
3137  if (attid > rd->rd_att->natts)
3138  elog(ERROR, "invalid attribute number %d", attid);
3139  return &TupleDescAttr(rd->rd_att, attid - 1)->attname;
3140 }
3141 
3142 /*
3143  * given attribute id, return type of that attribute
3144  *
3145  * This should only be used if the relation is already
3146  * heap_open()'ed. Use the cache version get_atttype()
3147  * for access to non-opened relations.
3148  */
3149 Oid
3150 attnumTypeId(Relation rd, int attid)
3151 {
3152  if (attid <= 0)
3153  {
3154  Form_pg_attribute sysatt;
3155 
3156  sysatt = SystemAttributeDefinition(attid, rd->rd_rel->relhasoids);
3157  return sysatt->atttypid;
3158  }
3159  if (attid > rd->rd_att->natts)
3160  elog(ERROR, "invalid attribute number %d", attid);
3161  return TupleDescAttr(rd->rd_att, attid - 1)->atttypid;
3162 }
3163 
3164 /*
3165  * given attribute id, return collation of that attribute
3166  *
3167  * This should only be used if the relation is already heap_open()'ed.
3168  */
3169 Oid
3171 {
3172  if (attid <= 0)
3173  {
3174  /* All system attributes are of noncollatable types. */
3175  return InvalidOid;
3176  }
3177  if (attid > rd->rd_att->natts)
3178  elog(ERROR, "invalid attribute number %d", attid);
3179  return TupleDescAttr(rd->rd_att, attid - 1)->attcollation;
3180 }
3181 
3182 /*
3183  * Generate a suitable error about a missing RTE.
3184  *
3185  * Since this is a very common type of error, we work rather hard to
3186  * produce a helpful message.
3187  */
3188 void
3190 {
3191  RangeTblEntry *rte;
3192  int sublevels_up;
3193  const char *badAlias = NULL;
3194 
3195  /*
3196  * Check to see if there are any potential matches in the query's
3197  * rangetable. (Note: cases involving a bad schema name in the RangeVar
3198  * will throw error immediately here. That seems OK.)
3199  */
3200  rte = searchRangeTableForRel(pstate, relation);
3201 
3202  /*
3203  * If we found a match that has an alias and the alias is visible in the
3204  * namespace, then the problem is probably use of the relation's real name
3205  * instead of its alias, ie "SELECT foo.* FROM foo f". This mistake is
3206  * common enough to justify a specific hint.
3207  *
3208  * If we found a match that doesn't meet those criteria, assume the
3209  * problem is illegal use of a relation outside its scope, as in the
3210  * MySQL-ism "SELECT ... FROM a, b LEFT JOIN c ON (a.x = c.y)".
3211  */
3212  if (rte && rte->alias &&
3213  strcmp(rte->eref->aliasname, relation->relname) != 0 &&
3214  refnameRangeTblEntry(pstate, NULL, rte->eref->aliasname,
3215  relation->location,
3216  &sublevels_up) == rte)
3217  badAlias = rte->eref->aliasname;
3218 
3219  if (rte)
3220  ereport(ERROR,
3222  errmsg("invalid reference to FROM-clause entry for table \"%s\"",
3223  relation->relname),
3224  (badAlias ?
3225  errhint("Perhaps you meant to reference the table alias \"%s\".",
3226  badAlias) :
3227  errhint("There is an entry for table \"%s\", but it cannot be referenced from this part of the query.",
3228  rte->eref->aliasname)),
3229  parser_errposition(pstate, relation->location)));
3230  else
3231  ereport(ERROR,
3233  errmsg("missing FROM-clause entry for table \"%s\"",
3234  relation->relname),
3235  parser_errposition(pstate, relation->location)));
3236 }
3237 
3238 /*
3239  * Generate a suitable error about a missing column.
3240  *
3241  * Since this is a very common type of error, we work rather hard to
3242  * produce a helpful message.
3243  */
3244 void
3246  char *relname, char *colname, int location)
3247 {
3249  char *closestfirst = NULL;
3250 
3251  /*
3252  * Search the entire rtable looking for possible matches. If we find one,
3253  * emit a hint about it.
3254  *
3255  * TODO: improve this code (and also errorMissingRTE) to mention using
3256  * LATERAL if appropriate.
3257  */
3258  state = searchRangeTableForCol(pstate, relname, colname, location);
3259 
3260  /*
3261  * Extract closest col string for best match, if any.
3262  *
3263  * Infer an exact match referenced despite not being visible from the fact
3264  * that an attribute number was not present in state passed back -- this
3265  * is what is reported when !closestfirst. There might also be an exact
3266  * match that was qualified with an incorrect alias, in which case
3267  * closestfirst will be set (so hint is the same as generic fuzzy case).
3268  */
3269  if (state->rfirst && AttributeNumberIsValid(state->first))
3270  closestfirst = strVal(list_nth(state->rfirst->eref->colnames,
3271  state->first - 1));
3272 
3273  if (!state->rsecond)
3274  {
3275  /*
3276  * Handle case where there is zero or one column suggestions to hint,
3277  * including exact matches referenced but not visible.
3278  */
3279  ereport(ERROR,
3280  (errcode(ERRCODE_UNDEFINED_COLUMN),
3281  relname ?
3282  errmsg("column %s.%s does not exist", relname, colname) :
3283  errmsg("column \"%s\" does not exist", colname),
3284  state->rfirst ? closestfirst ?
3285  errhint("Perhaps you meant to reference the column \"%s.%s\".",
3286  state->rfirst->eref->aliasname, closestfirst) :
3287  errhint("There is a column named \"%s\" in table \"%s\", but it cannot be referenced from this part of the query.",
3288  colname, state->rfirst->eref->aliasname) : 0,
3289  parser_errposition(pstate, location)));
3290  }
3291  else
3292  {
3293  /* Handle case where there are two equally useful column hints */
3294  char *closestsecond;
3295 
3296  closestsecond = strVal(list_nth(state->rsecond->eref->colnames,
3297  state->second - 1));
3298 
3299  ereport(ERROR,
3300  (errcode(ERRCODE_UNDEFINED_COLUMN),
3301  relname ?
3302  errmsg("column %s.%s does not exist", relname, colname) :
3303  errmsg("column \"%s\" does not exist", colname),
3304  errhint("Perhaps you meant to reference the column \"%s.%s\" or the column \"%s.%s\".",
3305  state->rfirst->eref->aliasname, closestfirst,
3306  state->rsecond->eref->aliasname, closestsecond),
3307  parser_errposition(pstate, location)));
3308  }
3309 }
3310 
3311 
3312 /*
3313  * Examine a fully-parsed query, and return TRUE iff any relation underlying
3314  * the query is a temporary relation (table, view, or materialized view).
3315  */
3316 bool
3318 {
3319  return isQueryUsingTempRelation_walker((Node *) query, NULL);
3320 }
3321 
3322 static bool
3324 {
3325  if (node == NULL)
3326  return false;
3327 
3328  if (IsA(node, Query))
3329  {
3330  Query *query = (Query *) node;
3331  ListCell *rtable;
3332 
3333  foreach(rtable, query->rtable)
3334  {
3335  RangeTblEntry *rte = lfirst(rtable);
3336 
3337  if (rte->rtekind == RTE_RELATION)
3338  {
3339  Relation rel = heap_open(rte->relid, AccessShareLock);
3340  char relpersistence = rel->rd_rel->relpersistence;
3341 
3343  if (relpersistence == RELPERSISTENCE_TEMP)
3344  return true;
3345  }
3346  }
3347 
3348  return query_tree_walker(query,
3350  context,
3352  }
3353 
3354  return expression_tree_walker(node,
3356  context);
3357 }
Node * scanRTEForColumn(ParseState *pstate, RangeTblEntry *rte, char *colname, int location, int fuzzy_rte_penalty, FuzzyAttrMatchState *fuzzystate)
Value * makeString(char *str)
Definition: value.c:53
List * lockedRels
Definition: parsenodes.h:737
#define NIL
Definition: pg_list.h:69
Oid list_nth_oid(const List *list, int n)
Definition: list.c:432
bool query_tree_walker(Query *query, bool(*walker)(), void *context, int flags)
Definition: nodeFuncs.c:2246
static bool isQueryUsingTempRelation_walker(Node *node, void *context)
static RangeTblEntry * scanNameSpaceForRefname(ParseState *pstate, const char *refname, int location)
Name attnumAttName(Relation rd, int attid)
Alias * alias
Definition: parsenodes.h:560
#define IsA(nodeptr, _type_)
Definition: nodes.h:560
List * joinaliasvars
Definition: parsenodes.h:989
Index varlevelsup
Definition: primnodes.h:173
int errhint(const char *fmt,...)
Definition: elog.c:987
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:180
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
#define ERRCODE_UNDEFINED_TABLE
Definition: pgbench.c:61
bool isQueryUsingTempRelation(Query *query)
RowMarkClause * get_parse_rowmark(Query *qry, Index rtindex)
int exprLocation(const Node *expr)
Definition: nodeFuncs.c:1186
void CheckAttributeNamesTypes(TupleDesc tupdesc, char relkind, bool allow_system_table_mods)
Definition: heap.c:410
RangeTblEntry * addRangeTableEntryForJoin(ParseState *pstate, List *colnames, JoinType jointype, List *aliasvars, Alias *alias, bool inFromCl)
List * colnames
Definition: primnodes.h:86
Alias * alias
Definition: parsenodes.h:1048
List * colnames
Definition: primnodes.h:43
int LOCKMODE
Definition: lockdefs.h:26
void markVarForSelectPriv(ParseState *pstate, Var *var, RangeTblEntry *rte)
#define ObjectIdAttributeNumber
Definition: sysattr.h:22
List * coltypmods
Definition: primnodes.h:88
QueryEnvironment * p_queryEnv
Definition: parse_node.h:195
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:276
static char * chooseScalarFunctionAlias(Node *funcexpr, char *funcname, Alias *alias, int nfuncs)
#define MaxAttrNumber
Definition: attnum.h:24
static bool isFutureCTE(ParseState *pstate, const char *refname)
#define RangeVarGetRelid(relation, lockmode, missing_ok)
Definition: namespace.h:53
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:84
void get_rte_attribute_type(RangeTblEntry *rte, AttrNumber attnum, Oid *vartype, int32 *vartypmod, Oid *varcollid)
#define forthree(cell1, list1, cell2, list2, cell3, list3)
Definition: pg_list.h:203
char * pstrdup(const char *in)
Definition: mcxt.c:1076
List * coltypmods
Definition: parsenodes.h:1036
static void updateFuzzyAttrMatchState(int fuzzy_rte_penalty, FuzzyAttrMatchState *fuzzystate, RangeTblEntry *rte, const char *actual, const char *match, int attnum)
#define llast(l)
Definition: pg_list.h:131
#define Int16GetDatum(X)
Definition: postgres.h:457
List * list_truncate(List *list, int new_size)
Definition: list.c:350
RangeTblEntry * addRangeTableEntryForENR(ParseState *pstate, RangeVar *rv, bool inFromCl)
Form_pg_attribute SystemAttributeByName(const char *attname, bool relhasoids)
Definition: heap.c:214
#define AccessShareLock
Definition: lockdefs.h:36
CommonTableExpr * GetCTEForRTE(ParseState *pstate, RangeTblEntry *rte, int rtelevelsup)
#define INT4OID
Definition: pg_type.h:316
Relation parserOpenTable(ParseState *pstate, const RangeVar *relation, int lockmode)
Definition: nodes.h:509
#define strVal(v)
Definition: value.h:54
int errcode(int sqlerrcode)
Definition: elog.c:575
int namestrcmp(Name name, const char *str)
Definition: name.c:247
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: heapam.c:1266
AttrNumber varattno
Definition: primnodes.h:168
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
List * list_concat(List *list1, List *list2)
Definition: list.c:321
return result
Definition: formatting.c:1633
int snprintf(char *str, size_t count, const char *fmt,...) pg_attribute_printf(3
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:28
static int specialAttNum(const char *attname)
AclMode requiredPerms
Definition: parsenodes.h:1053
#define heap_close(r, l)
Definition: heapam.h:97
List * list_copy_tail(const List *oldlist, int nskip)
Definition: list.c:1203
bool funcordinality
Definition: parsenodes.h:1000
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
List * rowMarks
Definition: parsenodes.h:161
char * resname
Definition: primnodes.h:1370
Definition: primnodes.h:163
TypeFuncClass get_expr_result_type(Node *expr, Oid *resultTypeId, TupleDesc *resultTupleDesc)
Definition: funcapi.c:227
List * lappend_oid(List *list, Oid datum)
Definition: list.c:164
#define OidIsValid(objectId)
Definition: c.h:532
List * colcollations
Definition: parsenodes.h:1037
RangeTblEntry * refnameRangeTblEntry(ParseState *pstate, const char *schemaname, const char *refname, int location, int *sublevels_up)
int natts
Definition: tupdesc.h:73
List * values_lists
Definition: parsenodes.h:1010
#define RELKIND_COMPOSITE_TYPE
Definition: pg_class.h:166
List * colcollations
Definition: primnodes.h:89
signed int int32
Definition: c.h:246
JoinType
Definition: nodes.h:673
List * targetList
Definition: parsenodes.h:138
Const * makeNullConst(Oid consttype, int32 consttypmod, Oid constcollid)
Definition: makefuncs.c:334
bool p_locked_from_parent
Definition: parse_node.h:190
char * schemaname
Definition: primnodes.h:67
EphemeralNamedRelationMetadata get_visible_ENR(ParseState *pstate, const char *refname)
Definition: parse_enr.c:26
Node * larg
Definition: primnodes.h:1451
Definition: type.h:89
int location
Definition: primnodes.h:73
Alias * makeAlias(const char *aliasname, List *colnames)
Definition: makefuncs.c:384
char * relname
Definition: primnodes.h:68
Relation heap_openrv_extended(const RangeVar *relation, LOCKMODE lockmode, bool missing_ok)
Definition: heapam.c:1347
RangeTblEntry * p_rte
Definition: parse_node.h:246
Bitmapset * selectedCols
Definition: parsenodes.h:1055
void cancel_parser_errposition_callback(ParseCallbackState *pcbstate)
Definition: parse_node.c:161
bool resjunk
Definition: primnodes.h:1375
#define linitial(l)
Definition: pg_list.h:111
List * rtable
Definition: parsenodes.h:135
static RangeTblEntry * searchRangeTableForRel(ParseState *pstate, RangeVar *relation)
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
static void check_lateral_ref_ok(ParseState *pstate, ParseNamespaceItem *nsitem, int location)
TableFunc * tablefunc
Definition: parsenodes.h:1005
#define lfirst_int(lc)
Definition: pg_list.h:107
void TupleDescCopyEntry(TupleDesc dst, AttrNumber dstAttno, TupleDesc src, AttrNumber srcAttno)
Definition: tupdesc.c:211
bool setof
Definition: parsenodes.h:210
RangeTblEntry * rfirst
void TupleDescInitEntryCollation(TupleDesc desc, AttrNumber attributeNumber, Oid collationid)
Definition: tupdesc.c:664
Oid get_relname_relid(const char *relname, Oid relnamespace)
Definition: lsyscache.c:1683
Definition: c.h:487
int location
Definition: primnodes.h:178
List * p_namespace
Definition: parse_node.h:176
#define list_nth_node(type, list, n)
Definition: pg_list.h:227
char * c
void * list_nth(const List *list, int n)
Definition: list.c:410
#define NoLock
Definition: lockdefs.h:34
bool scanNameSpaceForENR(ParseState *pstate, const char *refname)
#define MAX_FUZZY_DISTANCE
JoinType jointype
Definition: parsenodes.h:988
int errdetail(const char *fmt,...)
Definition: elog.c:873
AttrNumber resno
Definition: primnodes.h:1369
RangeTblEntry * addRangeTableEntry(ParseState *pstate, RangeVar *relation, Alias *alias, bool inh, bool inFromCl)
Oid attnumTypeId(Relation rd, int attid)
void errorMissingRTE(ParseState *pstate, RangeVar *relation)
int p_next_resno
Definition: parse_node.h:187
#define RelationGetRelationName(relation)
Definition: rel.h:436
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
#define TableOidAttributeNumber
Definition: sysattr.h:27
List * p_locking_clause
Definition: parse_node.h:189
void checkNameSpaceConflicts(ParseState *pstate, List *namespace1, List *namespace2)
int location
Definition: parsenodes.h:654
TypeFuncClass
Definition: funcapi.h:150
List * ctecoltypmods
Definition: parsenodes.h:1379
List * expandRelAttrs(ParseState *pstate, RangeTblEntry *rte, int rtindex, int sublevels_up, int location)
List * returningList
Definition: parsenodes.h:144
void TupleDescInitEntry(TupleDesc desc, AttrNumber attributeNumber, const char *attributeName, Oid oidtypeid, int32 typmod, int attdim)
Definition: tupdesc.c:505
#define lnext(lc)
Definition: pg_list.h:105
#define ereport(elevel, rest)
Definition: elog.h:122
char * enrname
Definition: parsenodes.h:1042
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:235
Var * makeVar(Index varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
Definition: makefuncs.c:67
void setup_parser_errposition_callback(ParseCallbackState *pcbstate, ParseState *pstate, int location)
Definition: parse_node.c:145
void addRTEtoQuery(ParseState *pstate, RangeTblEntry *rte, bool addToJoinList, bool addToRelNameSpace, bool addToVarNameSpace)
static void expandRelation(Oid relid, Alias *eref, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
List * lappend_int(List *list, int datum)
Definition: list.c:146
void errorMissingColumn(ParseState *pstate, char *relname, char *colname, int location)
List * lappend(List *list, void *datum)
Definition: list.c:128
static void markRTEForSelectPriv(ParseState *pstate, RangeTblEntry *rte, int rtindex, AttrNumber col)
RangeTblEntry * addRangeTableEntryForSubquery(ParseState *pstate, Query *subquery, Alias *alias, bool lateral, bool inFromCl)
Index varno
Definition: primnodes.h:166
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
Oid GetColumnDefCollation(ParseState *pstate, ColumnDef *coldef, Oid typeOid)
Definition: parse_type.c:521
char * get_relid_attribute_name(Oid relid, AttrNumber attnum)
Definition: lsyscache.c:801
struct ParseState * parentParseState
Definition: parse_node.h:170
List * ctecolnames
Definition: parsenodes.h:1377
#define AttributeNumberIsValid(attributeNumber)
Definition: attnum.h:34
List * p_future_ctes
Definition: parse_node.h:180
#define RowShareLock
Definition: lockdefs.h:37
int list_nth_int(const List *list, int n)
Definition: list.c:421
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1117
#define ACL_SELECT
Definition: parsenodes.h:73
Oid attnumCollationId(Relation rd, int attid)
bool self_reference
Definition: parsenodes.h:1017
static char * label
Definition: pg_basebackup.c:82
bool get_rte_attribute_is_dropped(RangeTblEntry *rte, AttrNumber attnum)
RangeTblEntry * GetRTEByRangeTablePosn(ParseState *pstate, int varno, int sublevels_up)
RangeTblEntry * p_target_rangetblentry
Definition: parse_node.h:183
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
unsigned int Index
Definition: c.h:359
List * coltypes
Definition: primnodes.h:87
ParseExprKind p_expr_kind
Definition: parse_node.h:186
TupleDesc rd_att
Definition: rel.h:115
void typenameTypeIdAndMod(ParseState *pstate, const TypeName *typeName, Oid *typeid_p, int32 *typmod_p)
Definition: parse_type.c:293
Form_pg_attribute SystemAttributeDefinition(AttrNumber attno, bool relhasoids)
Definition: heap.c:200
static RangeTblEntry * scanNameSpaceForRelid(ParseState *pstate, Oid relid, int location)
#define InvalidOid
Definition: postgres_ext.h:36
List * funccoltypmods
Definition: parsenodes.h:1086
Bitmapset * updatedCols
Definition: parsenodes.h:1057
bool p_lateral_active
Definition: parse_node.h:178
RangeTblEntry * addRangeTableEntryForFunction(ParseState *pstate, List *funcnames, List *funcexprs, List *coldeflists, RangeFunction *rangefunc, bool lateral, bool inFromCl)
#define INT8OID
Definition: pg_type.h:304
CmdType commandType
Definition: parsenodes.h:110
char * get_rte_attribute_name(RangeTblEntry *rte, AttrNumber attnum)
Var * make_var(ParseState *pstate, RangeTblEntry *rte, int attrno, int location)
Definition: parse_node.c:189
Node * colNameToVar(ParseState *pstate, char *colname, bool localonly, int location)
CommonTableExpr * scanNameSpaceForCTE(ParseState *pstate, const char *refname, Index *ctelevelsup)
List * funccolcollations
Definition: parsenodes.h:1087
#define makeNode(_type_)
Definition: nodes.h:557
RangeTblEntry * addRangeTableEntryForValues(ParseState *pstate, List *exprs, List *coltypes, List *coltypmods, List *colcollations, Alias *alias, bool lateral, bool inFromCl)
Node * rarg
Definition: primnodes.h:1452
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
int attnameAttNum(Relation rd, const char *attname, bool sysColOK)
#define Assert(condition)
Definition: c.h:664
#define lfirst(lc)
Definition: pg_list.h:106
char * aliasname
Definition: primnodes.h:42
Definition: regguts.h:298
List * functions
Definition: parsenodes.h:999
Definition: value.h:42
Expr * expr
Definition: primnodes.h:1368
RangeTblEntry * rsecond
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1843
static int list_length(const List *l)
Definition: pg_list.h:89
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
RangeTblEntry * addRangeTableEntryForTableFunc(ParseState *pstate, TableFunc *tf, Alias *alias, bool lateral, bool inFromCl)
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:720
RangeTblEntry * addRangeTableEntryForRelation(ParseState *pstate, Relation rel, Alias *alias, bool inh, bool inFromCl)
Index ctelevelsup
Definition: parsenodes.h:1016
TypeName * typeName
Definition: parsenodes.h:640
Bitmapset * funcparams
Definition: parsenodes.h:1089
#define SearchSysCacheExists2(cacheId, key1, key2)
Definition: syscache.h:179
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:698
TupleDesc CreateTemplateTupleDesc(int natts, bool hasoid)
Definition: tupdesc.c:43
TupleDesc ENRMetadataGetTupDesc(EphemeralNamedRelationMetadata enrmd)
const char * name
Definition: encode.c:521
#define InvalidAttrNumber
Definition: attnum.h:23
#define nodeTag(nodeptr)
Definition: nodes.h:514
static void expandTupleDesc(TupleDesc tupdesc, Alias *eref, int count, int offset, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
int RTERangeTablePosn(ParseState *pstate, RangeTblEntry *rte, int *sublevels_up)
EphemeralNamedRelationMetadata get_visible_ENR_metadata(QueryEnvironment *queryEnv, const char *refname)
List * ctecoltypes
Definition: parsenodes.h:1378
RTEKind rtekind
Definition: parsenodes.h:945
int varstr_levenshtein_less_equal(const char *source, int slen, const char *target, int tlen, int ins_c, int del_c, int sub_c, int max_d, bool trusted)
char * ctename
Definition: parsenodes.h:1015
Query * subquery
Definition: parsenodes.h:968
double enrtuples
Definition: parsenodes.h:1043
void * palloc(Size size)
Definition: mcxt.c:848
int errmsg(const char *fmt,...)
Definition: elog.c:797
Bitmapset * insertedCols
Definition: parsenodes.h:1056
int i
TargetEntry * get_tle_by_resno(List *tlist, AttrNumber resno)
static void buildRelationAliases(TupleDesc tupdesc, Alias *alias, Alias *eref)
#define NameStr(name)
Definition: c.h:493
bool name_matches_visible_ENR(ParseState *pstate, const char *refname)
Definition: parse_enr.c:20
RangeTblEntry * addRangeTableEntryForCTE(ParseState *pstate, CommonTableExpr *cte, Index levelsup, RangeVar *rv, bool inFromCl)
List * p_ctenamespace
Definition: parse_node.h:179
List * p_joinlist
Definition: parse_node.h:174
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1120
Alias * alias
Definition: primnodes.h:72
EphemeralNameRelationType enrtype
bool isLockedRefname(ParseState *pstate, const char *refname)
char * colname
Definition: parsenodes.h:639
#define elog
Definition: elog.h:219
Alias * eref
Definition: parsenodes.h:1049
List * ctecolcollations
Definition: parsenodes.h:1380
#define copyObject(obj)
Definition: nodes.h:622
#define RELPERSISTENCE_TEMP
Definition: pg_class.h:172
List * coltypes
Definition: parsenodes.h:1035
Definition: regcomp.c:224
Definition: pg_list.h:45
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1726
static FuzzyAttrMatchState * searchRangeTableForCol(ParseState *pstate, const char *alias, char *colname, int location)
int16 AttrNumber
Definition: attnum.h:21
#define RelationGetRelid(relation)
Definition: rel.h:416
List * p_joinexprs
Definition: parse_node.h:173
#define lfirst_oid(lc)
Definition: pg_list.h:108
Oid LookupNamespaceNoError(const char *nspname)
Definition: namespace.c:2823
char * get_func_result_name(Oid functionId)
Definition: funcapi.c:1020
#define QTW_IGNORE_JOINALIASES
Definition: nodeFuncs.h:23
Node * strip_implicit_coercions(Node *node)
Definition: nodeFuncs.c:612
List * p_rtable
Definition: parse_node.h:172
#define SearchSysCache2(cacheId, key1, key2)
Definition: syscache.h:161