PostgreSQL Source Code  git master
tlist.h File Reference
#include "nodes/pathnodes.h"
Include dependency graph for tlist.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define create_pathtarget(root, tlist)   set_pathtarget_cost_width(root, make_pathtarget_from_tlist(tlist))
 

Functions

TargetEntrytlist_member (Expr *node, List *targetlist)
 
TargetEntrytlist_member_ignore_relabel (Expr *node, List *targetlist)
 
Listadd_to_flat_tlist (List *tlist, List *exprs)
 
Listget_tlist_exprs (List *tlist, bool includeJunk)
 
bool tlist_same_exprs (List *tlist1, List *tlist2)
 
bool tlist_same_datatypes (List *tlist, List *colTypes, bool junkOK)
 
bool tlist_same_collations (List *tlist, List *colCollations, bool junkOK)
 
void apply_tlist_labeling (List *dest_tlist, List *src_tlist)
 
Oidextract_grouping_ops (List *groupClause)
 
Oidextract_grouping_collations (List *groupClause, List *tlist)
 
AttrNumberextract_grouping_cols (List *groupClause, List *tlist)
 
bool grouping_is_sortable (List *groupClause)
 
bool grouping_is_hashable (List *groupClause)
 
PathTargetmake_pathtarget_from_tlist (List *tlist)
 
Listmake_tlist_from_pathtarget (PathTarget *target)
 
PathTargetcopy_pathtarget (PathTarget *src)
 
PathTargetcreate_empty_pathtarget (void)
 
void add_column_to_pathtarget (PathTarget *target, Expr *expr, Index sortgroupref)
 
void add_new_column_to_pathtarget (PathTarget *target, Expr *expr)
 
void add_new_columns_to_pathtarget (PathTarget *target, List *exprs)
 
void apply_pathtarget_labeling_to_tlist (List *tlist, PathTarget *target)
 
void split_pathtarget_at_srfs (PlannerInfo *root, PathTarget *target, PathTarget *input_target, List **targets, List **targets_contain_srfs)
 

Macro Definition Documentation

◆ create_pathtarget

Function Documentation

◆ add_column_to_pathtarget()

void add_column_to_pathtarget ( PathTarget target,
Expr expr,
Index  sortgroupref 
)

Definition at line 705 of file tlist.c.

References PathTarget::exprs, lappend(), list_length(), palloc0(), repalloc(), and PathTarget::sortgrouprefs.

Referenced by add_new_column_to_pathtarget(), add_sp_item_to_pathtarget(), create_one_window_path(), make_group_input_target(), make_partial_grouping_target(), make_sort_input_target(), and make_window_input_target().

706 {
707  /* Updating the exprs list is easy ... */
708  target->exprs = lappend(target->exprs, expr);
709  /* ... the sortgroupref data, a bit less so */
710  if (target->sortgrouprefs)
711  {
712  int nexprs = list_length(target->exprs);
713 
714  /* This might look inefficient, but actually it's usually cheap */
715  target->sortgrouprefs = (Index *)
716  repalloc(target->sortgrouprefs, nexprs * sizeof(Index));
717  target->sortgrouprefs[nexprs - 1] = sortgroupref;
718  }
719  else if (sortgroupref)
720  {
721  /* Adding sortgroupref labeling to a previously unlabeled target */
722  int nexprs = list_length(target->exprs);
723 
724  target->sortgrouprefs = (Index *) palloc0(nexprs * sizeof(Index));
725  target->sortgrouprefs[nexprs - 1] = sortgroupref;
726  }
727 }
Index * sortgrouprefs
Definition: pathnodes.h:1079
List * lappend(List *list, void *datum)
Definition: list.c:336
List * exprs
Definition: pathnodes.h:1078
void * palloc0(Size size)
Definition: mcxt.c:981
unsigned int Index
Definition: c.h:537
static int list_length(const List *l)
Definition: pg_list.h:149
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1070

◆ add_new_column_to_pathtarget()

void add_new_column_to_pathtarget ( PathTarget target,
Expr expr 
)

Definition at line 741 of file tlist.c.

References add_column_to_pathtarget(), PathTarget::exprs, and list_member().

Referenced by add_new_columns_to_pathtarget().

742 {
743  if (!list_member(target->exprs, expr))
744  add_column_to_pathtarget(target, expr, 0);
745 }
void add_column_to_pathtarget(PathTarget *target, Expr *expr, Index sortgroupref)
Definition: tlist.c:705
bool list_member(const List *list, const void *datum)
Definition: list.c:628
List * exprs
Definition: pathnodes.h:1078

◆ add_new_columns_to_pathtarget()

void add_new_columns_to_pathtarget ( PathTarget target,
List exprs 
)

Definition at line 752 of file tlist.c.

References add_new_column_to_pathtarget(), and lfirst.

Referenced by make_group_input_target(), make_partial_grouping_target(), make_sort_input_target(), and make_window_input_target().

753 {
754  ListCell *lc;
755 
756  foreach(lc, exprs)
757  {
758  Expr *expr = (Expr *) lfirst(lc);
759 
760  add_new_column_to_pathtarget(target, expr);
761  }
762 }
#define lfirst(lc)
Definition: pg_list.h:169
void add_new_column_to_pathtarget(PathTarget *target, Expr *expr)
Definition: tlist.c:741

◆ add_to_flat_tlist()

List* add_to_flat_tlist ( List tlist,
List exprs 
)

Definition at line 149 of file tlist.c.

References copyObject, lappend(), lfirst, list_length(), makeTargetEntry(), and tlist_member().

Referenced by build_tlist_to_deparse(), and foreign_grouping_ok().

150 {
151  int next_resno = list_length(tlist) + 1;
152  ListCell *lc;
153 
154  foreach(lc, exprs)
155  {
156  Expr *expr = (Expr *) lfirst(lc);
157 
158  if (!tlist_member(expr, tlist))
159  {
160  TargetEntry *tle;
161 
162  tle = makeTargetEntry(copyObject(expr), /* copy needed?? */
163  next_resno++,
164  NULL,
165  false);
166  tlist = lappend(tlist, tle);
167  }
168  }
169  return tlist;
170 }
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:238
List * lappend(List *list, void *datum)
Definition: list.c:336
TargetEntry * tlist_member(Expr *node, List *targetlist)
Definition: tlist.c:68
#define lfirst(lc)
Definition: pg_list.h:169
static int list_length(const List *l)
Definition: pg_list.h:149
#define copyObject(obj)
Definition: nodes.h:644

◆ apply_pathtarget_labeling_to_tlist()

void apply_pathtarget_labeling_to_tlist ( List tlist,
PathTarget target 
)

Definition at line 774 of file tlist.c.

References elog, ERROR, PathTarget::exprs, i, IsA, lfirst, TargetEntry::ressortgroupref, PathTarget::sortgrouprefs, tlist_member(), and tlist_member_match_var().

Referenced by create_projection_plan(), and create_scan_plan().

775 {
776  int i;
777  ListCell *lc;
778 
779  /* Nothing to do if PathTarget has no sortgrouprefs data */
780  if (target->sortgrouprefs == NULL)
781  return;
782 
783  i = 0;
784  foreach(lc, target->exprs)
785  {
786  Expr *expr = (Expr *) lfirst(lc);
787  TargetEntry *tle;
788 
789  if (target->sortgrouprefs[i])
790  {
791  /*
792  * For Vars, use tlist_member_match_var's weakened matching rule;
793  * this allows us to deal with some cases where a set-returning
794  * function has been inlined, so that we now have more knowledge
795  * about what it returns than we did when the original Var was
796  * created. Otherwise, use regular equal() to find the matching
797  * TLE. (In current usage, only the Var case is actually needed;
798  * but it seems best to have sane behavior here for non-Vars too.)
799  */
800  if (expr && IsA(expr, Var))
801  tle = tlist_member_match_var((Var *) expr, tlist);
802  else
803  tle = tlist_member(expr, tlist);
804 
805  /*
806  * Complain if noplace for the sortgrouprefs label, or if we'd
807  * have to label a column twice. (The case where it already has
808  * the desired label probably can't happen, but we may as well
809  * allow for it.)
810  */
811  if (!tle)
812  elog(ERROR, "ORDER/GROUP BY expression not found in targetlist");
813  if (tle->ressortgroupref != 0 &&
814  tle->ressortgroupref != target->sortgrouprefs[i])
815  elog(ERROR, "targetlist item has multiple sortgroupref labels");
816 
817  tle->ressortgroupref = target->sortgrouprefs[i];
818  }
819  i++;
820  }
821 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:579
Definition: primnodes.h:181
#define ERROR
Definition: elog.h:45
Index * sortgrouprefs
Definition: pathnodes.h:1079
List * exprs
Definition: pathnodes.h:1078
TargetEntry * tlist_member(Expr *node, List *targetlist)
Definition: tlist.c:68
static TargetEntry * tlist_member_match_var(Var *var, List *targetlist)
Definition: tlist.c:119
#define lfirst(lc)
Definition: pg_list.h:169
#define elog(elevel,...)
Definition: elog.h:228
int i
Index ressortgroupref
Definition: primnodes.h:1434

◆ apply_tlist_labeling()

void apply_tlist_labeling ( List dest_tlist,
List src_tlist 
)

Definition at line 335 of file tlist.c.

References Assert, forboth, lfirst, list_length(), TargetEntry::resjunk, TargetEntry::resname, TargetEntry::resno, TargetEntry::resorigcol, TargetEntry::resorigtbl, and TargetEntry::ressortgroupref.

Referenced by clean_up_removed_plan_level(), create_modifytable_plan(), and create_plan().

336 {
337  ListCell *ld,
338  *ls;
339 
340  Assert(list_length(dest_tlist) == list_length(src_tlist));
341  forboth(ld, dest_tlist, ls, src_tlist)
342  {
343  TargetEntry *dest_tle = (TargetEntry *) lfirst(ld);
344  TargetEntry *src_tle = (TargetEntry *) lfirst(ls);
345 
346  Assert(dest_tle->resno == src_tle->resno);
347  dest_tle->resname = src_tle->resname;
348  dest_tle->ressortgroupref = src_tle->ressortgroupref;
349  dest_tle->resorigtbl = src_tle->resorigtbl;
350  dest_tle->resorigcol = src_tle->resorigcol;
351  dest_tle->resjunk = src_tle->resjunk;
352  }
353 }
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:446
Oid resorigtbl
Definition: primnodes.h:1436
char * resname
Definition: primnodes.h:1433
bool resjunk
Definition: primnodes.h:1438
AttrNumber resno
Definition: primnodes.h:1432
#define Assert(condition)
Definition: c.h:792
#define lfirst(lc)
Definition: pg_list.h:169
static int list_length(const List *l)
Definition: pg_list.h:149
AttrNumber resorigcol
Definition: primnodes.h:1437
Index ressortgroupref
Definition: primnodes.h:1434

◆ copy_pathtarget()

PathTarget* copy_pathtarget ( PathTarget src)

Definition at line 667 of file tlist.c.

References PathTarget::exprs, list_copy(), list_length(), makeNode, palloc(), and PathTarget::sortgrouprefs.

Referenced by apply_scanjoin_target_to_paths(), create_one_window_path(), create_partitionwise_grouping_paths(), and reparameterize_path_by_child().

668 {
670 
671  /* Copy scalar fields */
672  memcpy(dst, src, sizeof(PathTarget));
673  /* Shallow-copy the expression list */
674  dst->exprs = list_copy(src->exprs);
675  /* Duplicate sortgrouprefs if any (if not, the memcpy handled this) */
676  if (src->sortgrouprefs)
677  {
678  Size nbytes = list_length(src->exprs) * sizeof(Index);
679 
680  dst->sortgrouprefs = (Index *) palloc(nbytes);
681  memcpy(dst->sortgrouprefs, src->sortgrouprefs, nbytes);
682  }
683  return dst;
684 }
List * list_copy(const List *oldlist)
Definition: list.c:1418
Index * sortgrouprefs
Definition: pathnodes.h:1079
List * exprs
Definition: pathnodes.h:1078
unsigned int Index
Definition: c.h:537
#define makeNode(_type_)
Definition: nodes.h:576
size_t Size
Definition: c.h:528
static int list_length(const List *l)
Definition: pg_list.h:149
void * palloc(Size size)
Definition: mcxt.c:950

◆ create_empty_pathtarget()

PathTarget* create_empty_pathtarget ( void  )

Definition at line 691 of file tlist.c.

References makeNode.

Referenced by build_child_join_rel(), build_join_rel(), build_simple_rel(), fetch_upper_rel(), make_group_input_target(), make_partial_grouping_target(), make_sort_input_target(), make_window_input_target(), and split_pathtarget_at_srfs().

692 {
693  /* This is easy, but we don't want callers to hard-wire this ... */
694  return makeNode(PathTarget);
695 }
#define makeNode(_type_)
Definition: nodes.h:576

◆ extract_grouping_collations()

Oid* extract_grouping_collations ( List groupClause,
List tlist 
)

Definition at line 506 of file tlist.c.

References TargetEntry::expr, exprCollation(), get_sortgroupclause_tle(), lfirst, list_length(), and palloc().

Referenced by create_agg_plan(), create_group_plan(), and create_groupingsets_plan().

507 {
508  int numCols = list_length(groupClause);
509  int colno = 0;
510  Oid *grpCollations;
511  ListCell *glitem;
512 
513  grpCollations = (Oid *) palloc(sizeof(Oid) * numCols);
514 
515  foreach(glitem, groupClause)
516  {
517  SortGroupClause *groupcl = (SortGroupClause *) lfirst(glitem);
518  TargetEntry *tle = get_sortgroupclause_tle(groupcl, tlist);
519 
520  grpCollations[colno++] = exprCollation((Node *) tle->expr);
521  }
522 
523  return grpCollations;
524 }
TargetEntry * get_sortgroupclause_tle(SortGroupClause *sgClause, List *targetList)
Definition: tlist.c:384
Definition: nodes.h:528
unsigned int Oid
Definition: postgres_ext.h:31
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
static int list_length(const List *l)
Definition: pg_list.h:149
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:759
void * palloc(Size size)
Definition: mcxt.c:950

◆ extract_grouping_cols()

AttrNumber* extract_grouping_cols ( List groupClause,
List tlist 
)

Definition at line 531 of file tlist.c.

References get_sortgroupclause_tle(), lfirst, list_length(), palloc(), and TargetEntry::resno.

Referenced by create_agg_plan(), and create_group_plan().

532 {
533  AttrNumber *grpColIdx;
534  int numCols = list_length(groupClause);
535  int colno = 0;
536  ListCell *glitem;
537 
538  grpColIdx = (AttrNumber *) palloc(sizeof(AttrNumber) * numCols);
539 
540  foreach(glitem, groupClause)
541  {
542  SortGroupClause *groupcl = (SortGroupClause *) lfirst(glitem);
543  TargetEntry *tle = get_sortgroupclause_tle(groupcl, tlist);
544 
545  grpColIdx[colno++] = tle->resno;
546  }
547 
548  return grpColIdx;
549 }
TargetEntry * get_sortgroupclause_tle(SortGroupClause *sgClause, List *targetList)
Definition: tlist.c:384
AttrNumber resno
Definition: primnodes.h:1432
#define lfirst(lc)
Definition: pg_list.h:169
static int list_length(const List *l)
Definition: pg_list.h:149
void * palloc(Size size)
Definition: mcxt.c:950
int16 AttrNumber
Definition: attnum.h:21

◆ extract_grouping_ops()

Oid* extract_grouping_ops ( List groupClause)

Definition at line 480 of file tlist.c.

References Assert, SortGroupClause::eqop, lfirst, list_length(), OidIsValid, and palloc().

Referenced by create_agg_plan(), create_group_plan(), and create_groupingsets_plan().

481 {
482  int numCols = list_length(groupClause);
483  int colno = 0;
484  Oid *groupOperators;
485  ListCell *glitem;
486 
487  groupOperators = (Oid *) palloc(sizeof(Oid) * numCols);
488 
489  foreach(glitem, groupClause)
490  {
491  SortGroupClause *groupcl = (SortGroupClause *) lfirst(glitem);
492 
493  groupOperators[colno] = groupcl->eqop;
494  Assert(OidIsValid(groupOperators[colno]));
495  colno++;
496  }
497 
498  return groupOperators;
499 }
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:698
#define Assert(condition)
Definition: c.h:792
#define lfirst(lc)
Definition: pg_list.h:169
static int list_length(const List *l)
Definition: pg_list.h:149
void * palloc(Size size)
Definition: mcxt.c:950

◆ get_tlist_exprs()

List* get_tlist_exprs ( List tlist,
bool  includeJunk 
)

Definition at line 180 of file tlist.c.

References TargetEntry::expr, lappend(), lfirst, NIL, and TargetEntry::resjunk.

Referenced by recurse_set_operations().

181 {
182  List *result = NIL;
183  ListCell *l;
184 
185  foreach(l, tlist)
186  {
187  TargetEntry *tle = (TargetEntry *) lfirst(l);
188 
189  if (tle->resjunk && !includeJunk)
190  continue;
191 
192  result = lappend(result, tle->expr);
193  }
194  return result;
195 }
#define NIL
Definition: pg_list.h:65
bool resjunk
Definition: primnodes.h:1438
List * lappend(List *list, void *datum)
Definition: list.c:336
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
Definition: pg_list.h:50

◆ grouping_is_hashable()

bool grouping_is_hashable ( List groupClause)

Definition at line 577 of file tlist.c.

References SortGroupClause::hashable, and lfirst.

Referenced by choose_hashed_setop(), create_distinct_paths(), create_grouping_paths(), and generate_recursion_path().

578 {
579  ListCell *glitem;
580 
581  foreach(glitem, groupClause)
582  {
583  SortGroupClause *groupcl = (SortGroupClause *) lfirst(glitem);
584 
585  if (!groupcl->hashable)
586  return false;
587  }
588  return true;
589 }
#define lfirst(lc)
Definition: pg_list.h:169

◆ grouping_is_sortable()

bool grouping_is_sortable ( List groupClause)

Definition at line 557 of file tlist.c.

References lfirst, OidIsValid, and SortGroupClause::sortop.

Referenced by adjust_foreign_grouping_path_cost(), choose_hashed_setop(), create_distinct_paths(), create_grouping_paths(), make_pathkeys_for_window(), and standard_qp_callback().

558 {
559  ListCell *glitem;
560 
561  foreach(glitem, groupClause)
562  {
563  SortGroupClause *groupcl = (SortGroupClause *) lfirst(glitem);
564 
565  if (!OidIsValid(groupcl->sortop))
566  return false;
567  }
568  return true;
569 }
#define OidIsValid(objectId)
Definition: c.h:698
#define lfirst(lc)
Definition: pg_list.h:169

◆ make_pathtarget_from_tlist()

PathTarget* make_pathtarget_from_tlist ( List tlist)

Definition at line 608 of file tlist.c.

References TargetEntry::expr, PathTarget::exprs, i, lappend(), lfirst, list_length(), makeNode, palloc(), TargetEntry::ressortgroupref, and PathTarget::sortgrouprefs.

609 {
610  PathTarget *target = makeNode(PathTarget);
611  int i;
612  ListCell *lc;
613 
614  target->sortgrouprefs = (Index *) palloc(list_length(tlist) * sizeof(Index));
615 
616  i = 0;
617  foreach(lc, tlist)
618  {
619  TargetEntry *tle = (TargetEntry *) lfirst(lc);
620 
621  target->exprs = lappend(target->exprs, tle->expr);
622  target->sortgrouprefs[i] = tle->ressortgroupref;
623  i++;
624  }
625 
626  return target;
627 }
Index * sortgrouprefs
Definition: pathnodes.h:1079
List * lappend(List *list, void *datum)
Definition: list.c:336
List * exprs
Definition: pathnodes.h:1078
unsigned int Index
Definition: c.h:537
#define makeNode(_type_)
Definition: nodes.h:576
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
static int list_length(const List *l)
Definition: pg_list.h:149
void * palloc(Size size)
Definition: mcxt.c:950
int i
Index ressortgroupref
Definition: primnodes.h:1434

◆ make_tlist_from_pathtarget()

List* make_tlist_from_pathtarget ( PathTarget target)

Definition at line 634 of file tlist.c.

References PathTarget::exprs, i, lappend(), lfirst, makeTargetEntry(), NIL, TargetEntry::ressortgroupref, and PathTarget::sortgrouprefs.

Referenced by set_subquery_pathlist().

635 {
636  List *tlist = NIL;
637  int i;
638  ListCell *lc;
639 
640  i = 0;
641  foreach(lc, target->exprs)
642  {
643  Expr *expr = (Expr *) lfirst(lc);
644  TargetEntry *tle;
645 
646  tle = makeTargetEntry(expr,
647  i + 1,
648  NULL,
649  false);
650  if (target->sortgrouprefs)
651  tle->ressortgroupref = target->sortgrouprefs[i];
652  tlist = lappend(tlist, tle);
653  i++;
654  }
655 
656  return tlist;
657 }
#define NIL
Definition: pg_list.h:65
Index * sortgrouprefs
Definition: pathnodes.h:1079
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:238
List * lappend(List *list, void *datum)
Definition: list.c:336
List * exprs
Definition: pathnodes.h:1078
#define lfirst(lc)
Definition: pg_list.h:169
int i
Index ressortgroupref
Definition: primnodes.h:1434
Definition: pg_list.h:50

◆ split_pathtarget_at_srfs()

void split_pathtarget_at_srfs ( PlannerInfo root,
PathTarget target,
PathTarget input_target,
List **  targets,
List **  targets_contain_srfs 
)

Definition at line 881 of file tlist.c.

References add_sp_item_to_pathtarget(), add_sp_items_to_pathtarget(), create_empty_pathtarget(), split_pathtarget_context::current_depth, split_pathtarget_context::current_input_srfs, split_pathtarget_context::current_input_vars, split_pathtarget_context::current_sgref, split_pathtarget_item::expr, PathTarget::exprs, for_each_cell, forthree, get_pathtarget_sortgroupref, split_pathtarget_context::input_target_exprs, IS_SRF_CALL, lappend(), lappend_int(), split_pathtarget_context::level_input_srfs, split_pathtarget_context::level_input_vars, split_pathtarget_context::level_srfs, lfirst, list_concat(), list_make1, list_make1_int, list_member(), list_nth_cell(), lnext(), NIL, set_pathtarget_cost_width(), and split_pathtarget_walker().

Referenced by grouping_planner().

884 {
885  split_pathtarget_context context;
886  int max_depth;
887  bool need_extra_projection;
888  List *prev_level_tlist;
889  int lci;
890  ListCell *lc,
891  *lc1,
892  *lc2,
893  *lc3;
894 
895  /*
896  * It's not unusual for planner.c to pass us two physically identical
897  * targets, in which case we can conclude without further ado that all
898  * expressions are available from the input. (The logic below would
899  * arrive at the same conclusion, but much more tediously.)
900  */
901  if (target == input_target)
902  {
903  *targets = list_make1(target);
904  *targets_contain_srfs = list_make1_int(false);
905  return;
906  }
907 
908  /* Pass any input_target exprs down to split_pathtarget_walker() */
909  context.input_target_exprs = input_target ? input_target->exprs : NIL;
910 
911  /*
912  * Initialize with empty level-zero lists, and no levels after that.
913  * (Note: we could dispense with representing level zero explicitly, since
914  * it will never receive any SRFs, but then we'd have to special-case that
915  * level when we get to building result PathTargets. Level zero describes
916  * the SRF-free PathTarget that will be given to the input plan node.)
917  */
918  context.level_srfs = list_make1(NIL);
919  context.level_input_vars = list_make1(NIL);
920  context.level_input_srfs = list_make1(NIL);
921 
922  /* Initialize data we'll accumulate across all the target expressions */
923  context.current_input_vars = NIL;
924  context.current_input_srfs = NIL;
925  max_depth = 0;
926  need_extra_projection = false;
927 
928  /* Scan each expression in the PathTarget looking for SRFs */
929  lci = 0;
930  foreach(lc, target->exprs)
931  {
932  Node *node = (Node *) lfirst(lc);
933 
934  /* Tell split_pathtarget_walker about this expr's sortgroupref */
935  context.current_sgref = get_pathtarget_sortgroupref(target, lci);
936  lci++;
937 
938  /*
939  * Find all SRFs and Vars (and Var-like nodes) in this expression, and
940  * enter them into appropriate lists within the context struct.
941  */
942  context.current_depth = 0;
943  split_pathtarget_walker(node, &context);
944 
945  /* An expression containing no SRFs is of no further interest */
946  if (context.current_depth == 0)
947  continue;
948 
949  /*
950  * Track max SRF nesting depth over the whole PathTarget. Also, if
951  * this expression establishes a new max depth, we no longer care
952  * whether previous expressions contained nested SRFs; we can handle
953  * any required projection for them in the final ProjectSet node.
954  */
955  if (max_depth < context.current_depth)
956  {
957  max_depth = context.current_depth;
958  need_extra_projection = false;
959  }
960 
961  /*
962  * If any maximum-depth SRF is not at the top level of its expression,
963  * we'll need an extra Result node to compute the top-level scalar
964  * expression.
965  */
966  if (max_depth == context.current_depth && !IS_SRF_CALL(node))
967  need_extra_projection = true;
968  }
969 
970  /*
971  * If we found no SRFs needing evaluation (maybe they were all present in
972  * input_target, or maybe they were all removed by const-simplification),
973  * then no ProjectSet is needed; fall out.
974  */
975  if (max_depth == 0)
976  {
977  *targets = list_make1(target);
978  *targets_contain_srfs = list_make1_int(false);
979  return;
980  }
981 
982  /*
983  * The Vars and SRF outputs needed at top level can be added to the last
984  * level_input lists if we don't need an extra projection step. If we do
985  * need one, add a SRF-free level to the lists.
986  */
987  if (need_extra_projection)
988  {
989  context.level_srfs = lappend(context.level_srfs, NIL);
990  context.level_input_vars = lappend(context.level_input_vars,
991  context.current_input_vars);
992  context.level_input_srfs = lappend(context.level_input_srfs,
993  context.current_input_srfs);
994  }
995  else
996  {
997  lc = list_nth_cell(context.level_input_vars, max_depth);
998  lfirst(lc) = list_concat(lfirst(lc), context.current_input_vars);
999  lc = list_nth_cell(context.level_input_srfs, max_depth);
1000  lfirst(lc) = list_concat(lfirst(lc), context.current_input_srfs);
1001  }
1002 
1003  /*
1004  * Now construct the output PathTargets. The original target can be used
1005  * as-is for the last one, but we need to construct a new SRF-free target
1006  * representing what the preceding plan node has to emit, as well as a
1007  * target for each intermediate ProjectSet node.
1008  */
1009  *targets = *targets_contain_srfs = NIL;
1010  prev_level_tlist = NIL;
1011 
1012  forthree(lc1, context.level_srfs,
1013  lc2, context.level_input_vars,
1014  lc3, context.level_input_srfs)
1015  {
1016  List *level_srfs = (List *) lfirst(lc1);
1017  PathTarget *ntarget;
1018 
1019  if (lnext(context.level_srfs, lc1) == NULL)
1020  {
1021  ntarget = target;
1022  }
1023  else
1024  {
1025  ntarget = create_empty_pathtarget();
1026 
1027  /*
1028  * This target should actually evaluate any SRFs of the current
1029  * level, and it needs to propagate forward any Vars needed by
1030  * later levels, as well as SRFs computed earlier and needed by
1031  * later levels.
1032  */
1033  add_sp_items_to_pathtarget(ntarget, level_srfs);
1034  for_each_cell(lc, context.level_input_vars,
1035  lnext(context.level_input_vars, lc2))
1036  {
1037  List *input_vars = (List *) lfirst(lc);
1038 
1039  add_sp_items_to_pathtarget(ntarget, input_vars);
1040  }
1041  for_each_cell(lc, context.level_input_srfs,
1042  lnext(context.level_input_srfs, lc3))
1043  {
1044  List *input_srfs = (List *) lfirst(lc);
1045  ListCell *lcx;
1046 
1047  foreach(lcx, input_srfs)
1048  {
1049  split_pathtarget_item *item = lfirst(lcx);
1050 
1051  if (list_member(prev_level_tlist, item->expr))
1052  add_sp_item_to_pathtarget(ntarget, item);
1053  }
1054  }
1055  set_pathtarget_cost_width(root, ntarget);
1056  }
1057 
1058  /*
1059  * Add current target and does-it-compute-SRFs flag to output lists.
1060  */
1061  *targets = lappend(*targets, ntarget);
1062  *targets_contain_srfs = lappend_int(*targets_contain_srfs,
1063  (level_srfs != NIL));
1064 
1065  /* Remember this level's output for next pass */
1066  prev_level_tlist = ntarget->exprs;
1067  }
1068 }
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:691
#define NIL
Definition: pg_list.h:65
List * level_input_vars
Definition: tlist.c:41
PathTarget * set_pathtarget_cost_width(PlannerInfo *root, PathTarget *target)
Definition: costsize.c:5670
static void add_sp_item_to_pathtarget(PathTarget *target, split_pathtarget_item *item)
Definition: tlist.c:1202
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:322
static ListCell * list_nth_cell(const List *list, int n)
Definition: pg_list.h:256
#define for_each_cell(cell, lst, initcell)
Definition: pg_list.h:417
#define forthree(cell1, list1, cell2, list2, cell3, list3)
Definition: pg_list.h:491
Definition: nodes.h:528
List * list_concat(List *list1, const List *list2)
Definition: list.c:530
List * current_input_srfs
Definition: tlist.c:45
#define list_make1(x1)
Definition: pg_list.h:206
bool list_member(const List *list, const void *datum)
Definition: list.c:628
List * level_input_srfs
Definition: tlist.c:42
static void add_sp_items_to_pathtarget(PathTarget *target, List *items)
Definition: tlist.c:1248
#define list_make1_int(x1)
Definition: pg_list.h:221
List * lappend_int(List *list, int datum)
Definition: list.c:354
List * lappend(List *list, void *datum)
Definition: list.c:336
List * exprs
Definition: pathnodes.h:1078
#define get_pathtarget_sortgroupref(target, colno)
Definition: pathnodes.h:1085
List * input_target_exprs
Definition: tlist.c:38
#define lfirst(lc)
Definition: pg_list.h:169
#define IS_SRF_CALL(node)
Definition: optimizer.h:28
static bool split_pathtarget_walker(Node *node, split_pathtarget_context *context)
Definition: tlist.c:1077
Definition: pg_list.h:50
List * current_input_vars
Definition: tlist.c:44

◆ tlist_member()

TargetEntry* tlist_member ( Expr node,
List targetlist 
)

Definition at line 68 of file tlist.c.

References equal(), TargetEntry::expr, and lfirst.

Referenced by add_to_flat_tlist(), apply_pathtarget_labeling_to_tlist(), build_remote_returning(), create_unique_plan(), preprocess_targetlist(), rebuild_fdw_scan_tlist(), and search_indexed_tlist_for_non_var().

69 {
70  ListCell *temp;
71 
72  foreach(temp, targetlist)
73  {
74  TargetEntry *tlentry = (TargetEntry *) lfirst(temp);
75 
76  if (equal(node, tlentry->expr))
77  return tlentry;
78  }
79  return NULL;
80 }
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3042
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431

◆ tlist_member_ignore_relabel()

TargetEntry* tlist_member_ignore_relabel ( Expr node,
List targetlist 
)

Definition at line 89 of file tlist.c.

References arg, equal(), TargetEntry::expr, IsA, and lfirst.

Referenced by prepare_sort_from_pathkeys().

90 {
91  ListCell *temp;
92 
93  while (node && IsA(node, RelabelType))
94  node = ((RelabelType *) node)->arg;
95 
96  foreach(temp, targetlist)
97  {
98  TargetEntry *tlentry = (TargetEntry *) lfirst(temp);
99  Expr *tlexpr = tlentry->expr;
100 
101  while (tlexpr && IsA(tlexpr, RelabelType))
102  tlexpr = ((RelabelType *) tlexpr)->arg;
103 
104  if (equal(node, tlexpr))
105  return tlentry;
106  }
107  return NULL;
108 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:579
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3042
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
void * arg

◆ tlist_same_collations()

bool tlist_same_collations ( List tlist,
List colCollations,
bool  junkOK 
)

Definition at line 299 of file tlist.c.

References TargetEntry::expr, exprCollation(), lfirst, lfirst_oid, list_head(), lnext(), and TargetEntry::resjunk.

Referenced by recurse_set_operations().

300 {
301  ListCell *l;
302  ListCell *curColColl = list_head(colCollations);
303 
304  foreach(l, tlist)
305  {
306  TargetEntry *tle = (TargetEntry *) lfirst(l);
307 
308  if (tle->resjunk)
309  {
310  if (!junkOK)
311  return false;
312  }
313  else
314  {
315  if (curColColl == NULL)
316  return false; /* tlist longer than colCollations */
317  if (exprCollation((Node *) tle->expr) != lfirst_oid(curColColl))
318  return false;
319  curColColl = lnext(colCollations, curColColl);
320  }
321  }
322  if (curColColl != NULL)
323  return false; /* tlist shorter than colCollations */
324  return true;
325 }
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:322
Definition: nodes.h:528
bool resjunk
Definition: primnodes.h:1438
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:759
#define lfirst_oid(lc)
Definition: pg_list.h:171

◆ tlist_same_datatypes()

bool tlist_same_datatypes ( List tlist,
List colTypes,
bool  junkOK 
)

Definition at line 265 of file tlist.c.

References TargetEntry::expr, exprType(), lfirst, lfirst_oid, list_head(), lnext(), and TargetEntry::resjunk.

Referenced by is_simple_union_all_recurse(), and recurse_set_operations().

266 {
267  ListCell *l;
268  ListCell *curColType = list_head(colTypes);
269 
270  foreach(l, tlist)
271  {
272  TargetEntry *tle = (TargetEntry *) lfirst(l);
273 
274  if (tle->resjunk)
275  {
276  if (!junkOK)
277  return false;
278  }
279  else
280  {
281  if (curColType == NULL)
282  return false; /* tlist longer than colTypes */
283  if (exprType((Node *) tle->expr) != lfirst_oid(curColType))
284  return false;
285  curColType = lnext(colTypes, curColType);
286  }
287  }
288  if (curColType != NULL)
289  return false; /* tlist shorter than colTypes */
290  return true;
291 }
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:322
Definition: nodes.h:528
bool resjunk
Definition: primnodes.h:1438
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
#define lfirst_oid(lc)
Definition: pg_list.h:171

◆ tlist_same_exprs()

bool tlist_same_exprs ( List tlist1,
List tlist2 
)

Definition at line 235 of file tlist.c.

References equal(), TargetEntry::expr, forboth, lfirst, and list_length().

Referenced by change_plan_targetlist(), and create_projection_plan().

236 {
237  ListCell *lc1,
238  *lc2;
239 
240  if (list_length(tlist1) != list_length(tlist2))
241  return false; /* not same length, so can't match */
242 
243  forboth(lc1, tlist1, lc2, tlist2)
244  {
245  TargetEntry *tle1 = (TargetEntry *) lfirst(lc1);
246  TargetEntry *tle2 = (TargetEntry *) lfirst(lc2);
247 
248  if (!equal(tle1->expr, tle2->expr))
249  return false;
250  }
251 
252  return true;
253 }
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:446
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3042
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1431
static int list_length(const List *l)
Definition: pg_list.h:149