PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
parse_agg.h File Reference
Include dependency graph for parse_agg.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

void transformAggregateCall (ParseState *pstate, Aggref *agg, List *args, List *aggorder, bool agg_distinct)
 
NodetransformGroupingFunc (ParseState *pstate, GroupingFunc *g)
 
void transformWindowFuncCall (ParseState *pstate, WindowFunc *wfunc, WindowDef *windef)
 
void parseCheckAggregates (ParseState *pstate, Query *qry)
 
Listexpand_grouping_sets (List *groupingSets, int limit)
 
int get_aggregate_argtypes (Aggref *aggref, Oid *inputTypes)
 
Oid resolve_aggregate_transtype (Oid aggfuncid, Oid aggtranstype, Oid *inputTypes, int numArguments)
 
void build_aggregate_transfn_expr (Oid *agg_input_types, int agg_num_inputs, int agg_num_direct_inputs, bool agg_variadic, Oid agg_state_type, Oid agg_input_collation, Oid transfn_oid, Oid invtransfn_oid, Expr **transfnexpr, Expr **invtransfnexpr)
 
void build_aggregate_combinefn_expr (Oid agg_state_type, Oid agg_input_collation, Oid combinefn_oid, Expr **combinefnexpr)
 
void build_aggregate_serialfn_expr (Oid serialfn_oid, Expr **serialfnexpr)
 
void build_aggregate_deserialfn_expr (Oid deserialfn_oid, Expr **deserialfnexpr)
 
void build_aggregate_finalfn_expr (Oid *agg_input_types, int num_finalfn_inputs, Oid agg_state_type, Oid agg_result_type, Oid agg_input_collation, Oid finalfn_oid, Expr **finalfnexpr)
 

Function Documentation

void build_aggregate_combinefn_expr ( Oid  agg_state_type,
Oid  agg_input_collation,
Oid  combinefn_oid,
Expr **  combinefnexpr 
)

Definition at line 1943 of file parse_agg.c.

References generate_unaccent_rules::args, COERCE_EXPLICIT_CALL, InvalidOid, list_make2, make_agg_arg(), and makeFuncExpr().

Referenced by build_pertrans_for_aggref().

1947 {
1948  Node *argp;
1949  List *args;
1950  FuncExpr *fexpr;
1951 
1952  /* combinefn takes two arguments of the aggregate state type */
1953  argp = make_agg_arg(agg_state_type, agg_input_collation);
1954 
1955  args = list_make2(argp, argp);
1956 
1957  fexpr = makeFuncExpr(combinefn_oid,
1958  agg_state_type,
1959  args,
1960  InvalidOid,
1961  agg_input_collation,
1963  /* combinefn is currently never treated as variadic */
1964  *combinefnexpr = (Expr *) fexpr;
1965 }
#define list_make2(x1, x2)
Definition: pg_list.h:140
static Node * make_agg_arg(Oid argtype, Oid argcollation)
Definition: parse_agg.c:2059
Definition: nodes.h:509
#define InvalidOid
Definition: postgres_ext.h:36
Definition: pg_list.h:45
FuncExpr * makeFuncExpr(Oid funcid, Oid rettype, List *args, Oid funccollid, Oid inputcollid, CoercionForm fformat)
Definition: makefuncs.c:517
void build_aggregate_deserialfn_expr ( Oid  deserialfn_oid,
Expr **  deserialfnexpr 
)

Definition at line 1995 of file parse_agg.c.

References generate_unaccent_rules::args, BYTEAOID, COERCE_EXPLICIT_CALL, INTERNALOID, InvalidOid, list_make2, make_agg_arg(), and makeFuncExpr().

Referenced by build_pertrans_for_aggref().

1997 {
1998  List *args;
1999  FuncExpr *fexpr;
2000 
2001  /* deserialfn always takes BYTEA, INTERNAL and returns INTERNAL */
2004 
2005  fexpr = makeFuncExpr(deserialfn_oid,
2006  INTERNALOID,
2007  args,
2008  InvalidOid,
2009  InvalidOid,
2011  *deserialfnexpr = (Expr *) fexpr;
2012 }
#define list_make2(x1, x2)
Definition: pg_list.h:140
static Node * make_agg_arg(Oid argtype, Oid argcollation)
Definition: parse_agg.c:2059
#define InvalidOid
Definition: postgres_ext.h:36
#define INTERNALOID
Definition: pg_type.h:698
#define BYTEAOID
Definition: pg_type.h:292
Definition: pg_list.h:45
FuncExpr * makeFuncExpr(Oid funcid, Oid rettype, List *args, Oid funccollid, Oid inputcollid, CoercionForm fformat)
Definition: makefuncs.c:517
void build_aggregate_finalfn_expr ( Oid agg_input_types,
int  num_finalfn_inputs,
Oid  agg_state_type,
Oid  agg_result_type,
Oid  agg_input_collation,
Oid  finalfn_oid,
Expr **  finalfnexpr 
)

Definition at line 2019 of file parse_agg.c.

References generate_unaccent_rules::args, COERCE_EXPLICIT_CALL, i, InvalidOid, lappend(), list_make1, make_agg_arg(), and makeFuncExpr().

Referenced by ExecInitAgg(), and initialize_peragg().

2026 {
2027  List *args;
2028  int i;
2029 
2030  /*
2031  * Build expr tree for final function
2032  */
2033  args = list_make1(make_agg_arg(agg_state_type, agg_input_collation));
2034 
2035  /* finalfn may take additional args, which match agg's input types */
2036  for (i = 0; i < num_finalfn_inputs - 1; i++)
2037  {
2038  args = lappend(args,
2039  make_agg_arg(agg_input_types[i], agg_input_collation));
2040  }
2041 
2042  *finalfnexpr = (Expr *) makeFuncExpr(finalfn_oid,
2043  agg_result_type,
2044  args,
2045  InvalidOid,
2046  agg_input_collation,
2048  /* finalfn is currently never treated as variadic */
2049 }
static Node * make_agg_arg(Oid argtype, Oid argcollation)
Definition: parse_agg.c:2059
#define list_make1(x1)
Definition: pg_list.h:139
List * lappend(List *list, void *datum)
Definition: list.c:128
#define InvalidOid
Definition: postgres_ext.h:36
int i
Definition: pg_list.h:45
FuncExpr * makeFuncExpr(Oid funcid, Oid rettype, List *args, Oid funccollid, Oid inputcollid, CoercionForm fformat)
Definition: makefuncs.c:517
void build_aggregate_serialfn_expr ( Oid  serialfn_oid,
Expr **  serialfnexpr 
)

Definition at line 1972 of file parse_agg.c.

References generate_unaccent_rules::args, BYTEAOID, COERCE_EXPLICIT_CALL, INTERNALOID, InvalidOid, list_make1, make_agg_arg(), and makeFuncExpr().

Referenced by build_pertrans_for_aggref().

1974 {
1975  List *args;
1976  FuncExpr *fexpr;
1977 
1978  /* serialfn always takes INTERNAL and returns BYTEA */
1980 
1981  fexpr = makeFuncExpr(serialfn_oid,
1982  BYTEAOID,
1983  args,
1984  InvalidOid,
1985  InvalidOid,
1987  *serialfnexpr = (Expr *) fexpr;
1988 }
static Node * make_agg_arg(Oid argtype, Oid argcollation)
Definition: parse_agg.c:2059
#define list_make1(x1)
Definition: pg_list.h:139
#define InvalidOid
Definition: postgres_ext.h:36
#define INTERNALOID
Definition: pg_type.h:698
#define BYTEAOID
Definition: pg_type.h:292
Definition: pg_list.h:45
FuncExpr * makeFuncExpr(Oid funcid, Oid rettype, List *args, Oid funccollid, Oid inputcollid, CoercionForm fformat)
Definition: makefuncs.c:517
void build_aggregate_transfn_expr ( Oid agg_input_types,
int  agg_num_inputs,
int  agg_num_direct_inputs,
bool  agg_variadic,
Oid  agg_state_type,
Oid  agg_input_collation,
Oid  transfn_oid,
Oid  invtransfn_oid,
Expr **  transfnexpr,
Expr **  invtransfnexpr 
)

Definition at line 1882 of file parse_agg.c.

References generate_unaccent_rules::args, COERCE_EXPLICIT_CALL, FuncExpr::funcvariadic, i, InvalidOid, lappend(), list_make1, make_agg_arg(), makeFuncExpr(), and OidIsValid.

Referenced by build_pertrans_for_aggref(), and initialize_peragg().

1892 {
1893  List *args;
1894  FuncExpr *fexpr;
1895  int i;
1896 
1897  /*
1898  * Build arg list to use in the transfn FuncExpr node.
1899  */
1900  args = list_make1(make_agg_arg(agg_state_type, agg_input_collation));
1901 
1902  for (i = agg_num_direct_inputs; i < agg_num_inputs; i++)
1903  {
1904  args = lappend(args,
1905  make_agg_arg(agg_input_types[i], agg_input_collation));
1906  }
1907 
1908  fexpr = makeFuncExpr(transfn_oid,
1909  agg_state_type,
1910  args,
1911  InvalidOid,
1912  agg_input_collation,
1914  fexpr->funcvariadic = agg_variadic;
1915  *transfnexpr = (Expr *) fexpr;
1916 
1917  /*
1918  * Build invtransfn expression if requested, with same args as transfn
1919  */
1920  if (invtransfnexpr != NULL)
1921  {
1922  if (OidIsValid(invtransfn_oid))
1923  {
1924  fexpr = makeFuncExpr(invtransfn_oid,
1925  agg_state_type,
1926  args,
1927  InvalidOid,
1928  agg_input_collation,
1930  fexpr->funcvariadic = agg_variadic;
1931  *invtransfnexpr = (Expr *) fexpr;
1932  }
1933  else
1934  *invtransfnexpr = NULL;
1935  }
1936 }
static Node * make_agg_arg(Oid argtype, Oid argcollation)
Definition: parse_agg.c:2059
#define OidIsValid(objectId)
Definition: c.h:532
#define list_make1(x1)
Definition: pg_list.h:139
List * lappend(List *list, void *datum)
Definition: list.c:128
#define InvalidOid
Definition: postgres_ext.h:36
int i
Definition: pg_list.h:45
bool funcvariadic
Definition: primnodes.h:452
FuncExpr * makeFuncExpr(Oid funcid, Oid rettype, List *args, Oid funccollid, Oid inputcollid, CoercionForm fformat)
Definition: makefuncs.c:517
List* expand_grouping_sets ( List groupingSets,
int  limit 
)

Definition at line 1702 of file parse_agg.c.

References Assert, buf, cmp_list_len_asc(), expand_groupingset_node(), for_each_cell, lappend(), lfirst, linitial, list_head(), list_length(), list_union_int(), lnext, NIL, palloc(), pfree(), and qsort.

Referenced by parseCheckAggregates(), and preprocess_grouping_sets().

1703 {
1704  List *expanded_groups = NIL;
1705  List *result = NIL;
1706  double numsets = 1;
1707  ListCell *lc;
1708 
1709  if (groupingSets == NIL)
1710  return NIL;
1711 
1712  foreach(lc, groupingSets)
1713  {
1714  List *current_result = NIL;
1715  GroupingSet *gs = lfirst(lc);
1716 
1717  current_result = expand_groupingset_node(gs);
1718 
1719  Assert(current_result != NIL);
1720 
1721  numsets *= list_length(current_result);
1722 
1723  if (limit >= 0 && numsets > limit)
1724  return NIL;
1725 
1726  expanded_groups = lappend(expanded_groups, current_result);
1727  }
1728 
1729  /*
1730  * Do cartesian product between sublists of expanded_groups. While at it,
1731  * remove any duplicate elements from individual grouping sets (we must
1732  * NOT change the number of sets though)
1733  */
1734 
1735  foreach(lc, (List *) linitial(expanded_groups))
1736  {
1737  result = lappend(result, list_union_int(NIL, (List *) lfirst(lc)));
1738  }
1739 
1740  for_each_cell(lc, lnext(list_head(expanded_groups)))
1741  {
1742  List *p = lfirst(lc);
1743  List *new_result = NIL;
1744  ListCell *lc2;
1745 
1746  foreach(lc2, result)
1747  {
1748  List *q = lfirst(lc2);
1749  ListCell *lc3;
1750 
1751  foreach(lc3, p)
1752  {
1753  new_result = lappend(new_result,
1754  list_union_int(q, (List *) lfirst(lc3)));
1755  }
1756  }
1757  result = new_result;
1758  }
1759 
1760  if (list_length(result) > 1)
1761  {
1762  int result_len = list_length(result);
1763  List **buf = palloc(sizeof(List *) * result_len);
1764  List **ptr = buf;
1765 
1766  foreach(lc, result)
1767  {
1768  *ptr++ = lfirst(lc);
1769  }
1770 
1771  qsort(buf, result_len, sizeof(List *), cmp_list_len_asc);
1772 
1773  result = NIL;
1774  ptr = buf;
1775 
1776  while (result_len-- > 0)
1777  result = lappend(result, *ptr++);
1778 
1779  pfree(buf);
1780  }
1781 
1782  return result;
1783 }
static int cmp_list_len_asc(const void *a, const void *b)
Definition: parse_agg.c:1686
#define NIL
Definition: pg_list.h:69
void pfree(void *pointer)
Definition: mcxt.c:949
#define linitial(l)
Definition: pg_list.h:111
static List * expand_groupingset_node(GroupingSet *gs)
Definition: parse_agg.c:1581
static char * buf
Definition: pg_test_fsync.c:67
List * list_union_int(const List *list1, const List *list2)
Definition: list.c:744
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
#define lnext(lc)
Definition: pg_list.h:105
List * lappend(List *list, void *datum)
Definition: list.c:128
#define Assert(condition)
Definition: c.h:664
#define lfirst(lc)
Definition: pg_list.h:106
static int list_length(const List *l)
Definition: pg_list.h:89
#define for_each_cell(cell, initcell)
Definition: pg_list.h:169
void * palloc(Size size)
Definition: mcxt.c:848
#define qsort(a, b, c, d)
Definition: port.h:443
Definition: pg_list.h:45
int get_aggregate_argtypes ( Aggref aggref,
Oid inputTypes 
)

Definition at line 1801 of file parse_agg.c.

References Aggref::aggargtypes, Assert, FUNC_MAX_ARGS, lfirst_oid, and list_length().

Referenced by ExecInitAgg(), get_agg_clause_costs_walker(), and get_agg_expr().

1802 {
1803  int numArguments = 0;
1804  ListCell *lc;
1805 
1807 
1808  foreach(lc, aggref->aggargtypes)
1809  {
1810  inputTypes[numArguments++] = lfirst_oid(lc);
1811  }
1812 
1813  return numArguments;
1814 }
#define FUNC_MAX_ARGS
List * aggargtypes
Definition: primnodes.h:299
#define Assert(condition)
Definition: c.h:664
static int list_length(const List *l)
Definition: pg_list.h:89
#define lfirst_oid(lc)
Definition: pg_list.h:108
void parseCheckAggregates ( ParseState pstate,
Query qry 
)

Definition at line 992 of file parse_agg.c.

References Assert, check_ungrouped_columns(), CurrentMemoryContext, ereport, errcode(), errmsg(), ERROR, expand_grouping_sets(), TargetEntry::expr, exprLocation(), finalize_grouping_exprs(), flatten_join_alias_vars(), for_each_cell, get_sortgroupclause_tle(), Query::groupClause, Query::groupingSets, PlannerInfo::hasJoinRTEs, Query::havingQual, IsA, lappend(), lcons(), lfirst, linitial, list_head(), list_intersection_int(), list_length(), list_member_int(), lnext, locate_agg_of_level(), makeNode, NIL, ParseState::p_hasAggs, ParseState::p_rtable, PlannerInfo::parse, parser_errposition(), PlannerInfo::planner_cxt, TargetEntry::ressortgroupref, RTE_CTE, RTE_JOIN, RangeTblEntry::rtekind, RangeTblEntry::self_reference, and Query::targetList.

Referenced by transformDeleteStmt(), transformSelectStmt(), and transformSetOperationStmt().

993 {
994  List *gset_common = NIL;
995  List *groupClauses = NIL;
996  List *groupClauseCommonVars = NIL;
997  bool have_non_var_grouping;
998  List *func_grouped_rels = NIL;
999  ListCell *l;
1000  bool hasJoinRTEs;
1001  bool hasSelfRefRTEs;
1002  PlannerInfo *root = NULL;
1003  Node *clause;
1004 
1005  /* This should only be called if we found aggregates or grouping */
1006  Assert(pstate->p_hasAggs || qry->groupClause || qry->havingQual || qry->groupingSets);
1007 
1008  /*
1009  * If we have grouping sets, expand them and find the intersection of all
1010  * sets.
1011  */
1012  if (qry->groupingSets)
1013  {
1014  /*
1015  * The limit of 4096 is arbitrary and exists simply to avoid resource
1016  * issues from pathological constructs.
1017  */
1018  List *gsets = expand_grouping_sets(qry->groupingSets, 4096);
1019 
1020  if (!gsets)
1021  ereport(ERROR,
1022  (errcode(ERRCODE_STATEMENT_TOO_COMPLEX),
1023  errmsg("too many grouping sets present (maximum 4096)"),
1024  parser_errposition(pstate,
1025  qry->groupClause
1026  ? exprLocation((Node *) qry->groupClause)
1027  : exprLocation((Node *) qry->groupingSets))));
1028 
1029  /*
1030  * The intersection will often be empty, so help things along by
1031  * seeding the intersect with the smallest set.
1032  */
1033  gset_common = linitial(gsets);
1034 
1035  if (gset_common)
1036  {
1037  for_each_cell(l, lnext(list_head(gsets)))
1038  {
1039  gset_common = list_intersection_int(gset_common, lfirst(l));
1040  if (!gset_common)
1041  break;
1042  }
1043  }
1044 
1045  /*
1046  * If there was only one grouping set in the expansion, AND if the
1047  * groupClause is non-empty (meaning that the grouping set is not
1048  * empty either), then we can ditch the grouping set and pretend we
1049  * just had a normal GROUP BY.
1050  */
1051  if (list_length(gsets) == 1 && qry->groupClause)
1052  qry->groupingSets = NIL;
1053  }
1054 
1055  /*
1056  * Scan the range table to see if there are JOIN or self-reference CTE
1057  * entries. We'll need this info below.
1058  */
1059  hasJoinRTEs = hasSelfRefRTEs = false;
1060  foreach(l, pstate->p_rtable)
1061  {
1062  RangeTblEntry *rte = (RangeTblEntry *) lfirst(l);
1063 
1064  if (rte->rtekind == RTE_JOIN)
1065  hasJoinRTEs = true;
1066  else if (rte->rtekind == RTE_CTE && rte->self_reference)
1067  hasSelfRefRTEs = true;
1068  }
1069 
1070  /*
1071  * Build a list of the acceptable GROUP BY expressions for use by
1072  * check_ungrouped_columns().
1073  *
1074  * We get the TLE, not just the expr, because GROUPING wants to know the
1075  * sortgroupref.
1076  */
1077  foreach(l, qry->groupClause)
1078  {
1079  SortGroupClause *grpcl = (SortGroupClause *) lfirst(l);
1080  TargetEntry *expr;
1081 
1082  expr = get_sortgroupclause_tle(grpcl, qry->targetList);
1083  if (expr == NULL)
1084  continue; /* probably cannot happen */
1085 
1086  groupClauses = lcons(expr, groupClauses);
1087  }
1088 
1089  /*
1090  * If there are join alias vars involved, we have to flatten them to the
1091  * underlying vars, so that aliased and unaliased vars will be correctly
1092  * taken as equal. We can skip the expense of doing this if no rangetable
1093  * entries are RTE_JOIN kind. We use the planner's flatten_join_alias_vars
1094  * routine to do the flattening; it wants a PlannerInfo root node, which
1095  * fortunately can be mostly dummy.
1096  */
1097  if (hasJoinRTEs)
1098  {
1099  root = makeNode(PlannerInfo);
1100  root->parse = qry;
1102  root->hasJoinRTEs = true;
1103 
1104  groupClauses = (List *) flatten_join_alias_vars(root,
1105  (Node *) groupClauses);
1106  }
1107 
1108  /*
1109  * Detect whether any of the grouping expressions aren't simple Vars; if
1110  * they're all Vars then we don't have to work so hard in the recursive
1111  * scans. (Note we have to flatten aliases before this.)
1112  *
1113  * Track Vars that are included in all grouping sets separately in
1114  * groupClauseCommonVars, since these are the only ones we can use to
1115  * check for functional dependencies.
1116  */
1117  have_non_var_grouping = false;
1118  foreach(l, groupClauses)
1119  {
1120  TargetEntry *tle = lfirst(l);
1121 
1122  if (!IsA(tle->expr, Var))
1123  {
1124  have_non_var_grouping = true;
1125  }
1126  else if (!qry->groupingSets ||
1127  list_member_int(gset_common, tle->ressortgroupref))
1128  {
1129  groupClauseCommonVars = lappend(groupClauseCommonVars, tle->expr);
1130  }
1131  }
1132 
1133  /*
1134  * Check the targetlist and HAVING clause for ungrouped variables.
1135  *
1136  * Note: because we check resjunk tlist elements as well as regular ones,
1137  * this will also find ungrouped variables that came from ORDER BY and
1138  * WINDOW clauses. For that matter, it's also going to examine the
1139  * grouping expressions themselves --- but they'll all pass the test ...
1140  *
1141  * We also finalize GROUPING expressions, but for that we need to traverse
1142  * the original (unflattened) clause in order to modify nodes.
1143  */
1144  clause = (Node *) qry->targetList;
1145  finalize_grouping_exprs(clause, pstate, qry,
1146  groupClauses, root,
1147  have_non_var_grouping);
1148  if (hasJoinRTEs)
1149  clause = flatten_join_alias_vars(root, clause);
1150  check_ungrouped_columns(clause, pstate, qry,
1151  groupClauses, groupClauseCommonVars,
1152  have_non_var_grouping,
1153  &func_grouped_rels);
1154 
1155  clause = (Node *) qry->havingQual;
1156  finalize_grouping_exprs(clause, pstate, qry,
1157  groupClauses, root,
1158  have_non_var_grouping);
1159  if (hasJoinRTEs)
1160  clause = flatten_join_alias_vars(root, clause);
1161  check_ungrouped_columns(clause, pstate, qry,
1162  groupClauses, groupClauseCommonVars,
1163  have_non_var_grouping,
1164  &func_grouped_rels);
1165 
1166  /*
1167  * Per spec, aggregates can't appear in a recursive term.
1168  */
1169  if (pstate->p_hasAggs && hasSelfRefRTEs)
1170  ereport(ERROR,
1171  (errcode(ERRCODE_INVALID_RECURSION),
1172  errmsg("aggregate functions are not allowed in a recursive query's recursive term"),
1173  parser_errposition(pstate,
1174  locate_agg_of_level((Node *) qry, 0))));
1175 }
#define NIL
Definition: pg_list.h:69
#define IsA(nodeptr, _type_)
Definition: nodes.h:560
Query * parse
Definition: relation.h:155
TargetEntry * get_sortgroupclause_tle(SortGroupClause *sgClause, List *targetList)
Definition: tlist.c:370
bool hasJoinRTEs
Definition: relation.h:302
int exprLocation(const Node *expr)
Definition: nodeFuncs.c:1186
List * list_intersection_int(const List *list1, const List *list2)
Definition: list.c:826
List * groupingSets
Definition: parsenodes.h:148
Definition: nodes.h:509
int errcode(int sqlerrcode)
Definition: elog.c:575
bool p_hasAggs
Definition: parse_node.h:198
Definition: primnodes.h:163
List * targetList
Definition: parsenodes.h:138
static void check_ungrouped_columns(Node *node, ParseState *pstate, Query *qry, List *groupClauses, List *groupClauseVars, bool have_non_var_grouping, List **func_grouped_rels)
Definition: parse_agg.c:1199
#define linitial(l)
Definition: pg_list.h:111
#define ERROR
Definition: elog.h:43
static void finalize_grouping_exprs(Node *node, ParseState *pstate, Query *qry, List *groupClauses, PlannerInfo *root, bool have_non_var_grouping)
Definition: parse_agg.c:1407
bool list_member_int(const List *list, int datum)
Definition: list.c:485
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
#define lnext(lc)
Definition: pg_list.h:105
#define ereport(elevel, rest)
Definition: elog.h:122
List * lappend(List *list, void *datum)
Definition: list.c:128
int locate_agg_of_level(Node *node, int levelsup)
Definition: rewriteManip.c:131
Node * flatten_join_alias_vars(PlannerInfo *root, Node *node)
Definition: var.c:670
bool self_reference
Definition: parsenodes.h:1017
List * lcons(void *datum, List *list)
Definition: list.c:259
#define makeNode(_type_)
Definition: nodes.h:557
#define Assert(condition)
Definition: c.h:664
#define lfirst(lc)
Definition: pg_list.h:106
Expr * expr
Definition: primnodes.h:1368
static int list_length(const List *l)
Definition: pg_list.h:89
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
#define for_each_cell(cell, initcell)
Definition: pg_list.h:169
List * expand_grouping_sets(List *groupingSets, int limit)
Definition: parse_agg.c:1702
RTEKind rtekind
Definition: parsenodes.h:945
List * groupClause
Definition: parsenodes.h:146
int errmsg(const char *fmt,...)
Definition: elog.c:797
Index ressortgroupref
Definition: primnodes.h:1371
MemoryContext planner_cxt
Definition: relation.h:290
Node * havingQual
Definition: parsenodes.h:150
Definition: pg_list.h:45
List * p_rtable
Definition: parse_node.h:172
Oid resolve_aggregate_transtype ( Oid  aggfuncid,
Oid  aggtranstype,
Oid inputTypes,
int  numArguments 
)

Definition at line 1827 of file parse_agg.c.

References Assert, enforce_generic_type_consistency(), get_func_signature(), IsPolymorphicType, and pfree().

Referenced by get_agg_clause_costs_walker(), and initialize_peragg().

1831 {
1832  /* resolve actual type of transition state, if polymorphic */
1833  if (IsPolymorphicType(aggtranstype))
1834  {
1835  /* have to fetch the agg's declared input types... */
1836  Oid *declaredArgTypes;
1837  int agg_nargs;
1838 
1839  (void) get_func_signature(aggfuncid, &declaredArgTypes, &agg_nargs);
1840 
1841  /*
1842  * VARIADIC ANY aggs could have more actual than declared args, but
1843  * such extra args can't affect polymorphic type resolution.
1844  */
1845  Assert(agg_nargs <= numArguments);
1846 
1847  aggtranstype = enforce_generic_type_consistency(inputTypes,
1848  declaredArgTypes,
1849  agg_nargs,
1850  aggtranstype,
1851  false);
1852  pfree(declaredArgTypes);
1853  }
1854  return aggtranstype;
1855 }
Oid get_func_signature(Oid funcid, Oid **argtypes, int *nargs)
Definition: lsyscache.c:1500
unsigned int Oid
Definition: postgres_ext.h:31
void pfree(void *pointer)
Definition: mcxt.c:949
#define IsPolymorphicType(typid)
Definition: pg_type.h:745
Oid enforce_generic_type_consistency(Oid *actual_arg_types, Oid *declared_arg_types, int nargs, Oid rettype, bool allow_poly)
#define Assert(condition)
Definition: c.h:664
void transformAggregateCall ( ParseState pstate,
Aggref agg,
List args,
List aggorder,
bool  agg_distinct 
)

Definition at line 103 of file parse_agg.c.

References addTargetToSortList(), Aggref::aggargtypes, Aggref::aggdirectargs, Aggref::aggdistinct, Aggref::aggkind, AGGKIND_IS_ORDERED_SET, Aggref::aggorder, arg, Aggref::args, Assert, check_agglevels_and_constraints(), ereport, errcode(), errdetail(), errmsg(), ERROR, EXPR_KIND_ORDER_BY, exprLocation(), exprType(), forboth, format_type_be(), get_sortgroupclause_expr(), lappend(), lappend_oid(), lfirst, list_copy_tail(), list_length(), list_truncate(), makeTargetEntry(), NIL, OidIsValid, ParseState::p_next_resno, parser_errposition(), SortGroupClause::sortop, transformDistinctClause(), and transformSortClause().

Referenced by ParseFuncOrColumn().

105 {
106  List *argtypes = NIL;
107  List *tlist = NIL;
108  List *torder = NIL;
109  List *tdistinct = NIL;
110  AttrNumber attno = 1;
111  int save_next_resno;
112  ListCell *lc;
113 
114  /*
115  * Before separating the args into direct and aggregated args, make a list
116  * of their data type OIDs for use later.
117  */
118  foreach(lc, args)
119  {
120  Expr *arg = (Expr *) lfirst(lc);
121 
122  argtypes = lappend_oid(argtypes, exprType((Node *) arg));
123  }
124  agg->aggargtypes = argtypes;
125 
127  {
128  /*
129  * For an ordered-set agg, the args list includes direct args and
130  * aggregated args; we must split them apart.
131  */
132  int numDirectArgs = list_length(args) - list_length(aggorder);
133  List *aargs;
134  ListCell *lc2;
135 
136  Assert(numDirectArgs >= 0);
137 
138  aargs = list_copy_tail(args, numDirectArgs);
139  agg->aggdirectargs = list_truncate(args, numDirectArgs);
140 
141  /*
142  * Build a tlist from the aggregated args, and make a sortlist entry
143  * for each one. Note that the expressions in the SortBy nodes are
144  * ignored (they are the raw versions of the transformed args); we are
145  * just looking at the sort information in the SortBy nodes.
146  */
147  forboth(lc, aargs, lc2, aggorder)
148  {
149  Expr *arg = (Expr *) lfirst(lc);
150  SortBy *sortby = (SortBy *) lfirst(lc2);
151  TargetEntry *tle;
152 
153  /* We don't bother to assign column names to the entries */
154  tle = makeTargetEntry(arg, attno++, NULL, false);
155  tlist = lappend(tlist, tle);
156 
157  torder = addTargetToSortList(pstate, tle,
158  torder, tlist, sortby);
159  }
160 
161  /* Never any DISTINCT in an ordered-set agg */
162  Assert(!agg_distinct);
163  }
164  else
165  {
166  /* Regular aggregate, so it has no direct args */
167  agg->aggdirectargs = NIL;
168 
169  /*
170  * Transform the plain list of Exprs into a targetlist.
171  */
172  foreach(lc, args)
173  {
174  Expr *arg = (Expr *) lfirst(lc);
175  TargetEntry *tle;
176 
177  /* We don't bother to assign column names to the entries */
178  tle = makeTargetEntry(arg, attno++, NULL, false);
179  tlist = lappend(tlist, tle);
180  }
181 
182  /*
183  * If we have an ORDER BY, transform it. This will add columns to the
184  * tlist if they appear in ORDER BY but weren't already in the arg
185  * list. They will be marked resjunk = true so we can tell them apart
186  * from regular aggregate arguments later.
187  *
188  * We need to mess with p_next_resno since it will be used to number
189  * any new targetlist entries.
190  */
191  save_next_resno = pstate->p_next_resno;
192  pstate->p_next_resno = attno;
193 
194  torder = transformSortClause(pstate,
195  aggorder,
196  &tlist,
198  true /* force SQL99 rules */ );
199 
200  /*
201  * If we have DISTINCT, transform that to produce a distinctList.
202  */
203  if (agg_distinct)
204  {
205  tdistinct = transformDistinctClause(pstate, &tlist, torder, true);
206 
207  /*
208  * Remove this check if executor support for hashed distinct for
209  * aggregates is ever added.
210  */
211  foreach(lc, tdistinct)
212  {
213  SortGroupClause *sortcl = (SortGroupClause *) lfirst(lc);
214 
215  if (!OidIsValid(sortcl->sortop))
216  {
217  Node *expr = get_sortgroupclause_expr(sortcl, tlist);
218 
219  ereport(ERROR,
220  (errcode(ERRCODE_UNDEFINED_FUNCTION),
221  errmsg("could not identify an ordering operator for type %s",
222  format_type_be(exprType(expr))),
223  errdetail("Aggregates with DISTINCT must be able to sort their inputs."),
224  parser_errposition(pstate, exprLocation(expr))));
225  }
226  }
227  }
228 
229  pstate->p_next_resno = save_next_resno;
230  }
231 
232  /* Update the Aggref with the transformation results */
233  agg->args = tlist;
234  agg->aggorder = torder;
235  agg->aggdistinct = tdistinct;
236 
237  check_agglevels_and_constraints(pstate, (Node *) agg);
238 }
List * aggdistinct
Definition: primnodes.h:303
#define NIL
Definition: pg_list.h:69
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:180
int exprLocation(const Node *expr)
Definition: nodeFuncs.c:1186
List * addTargetToSortList(ParseState *pstate, TargetEntry *tle, List *sortlist, List *targetlist, SortBy *sortby)
List * transformSortClause(ParseState *pstate, List *orderlist, List **targetlist, ParseExprKind exprKind, bool useSQL99)
List * list_truncate(List *list, int new_size)
Definition: list.c:350
Node * get_sortgroupclause_expr(SortGroupClause *sgClause, List *targetList)
Definition: tlist.c:382
Definition: nodes.h:509
int errcode(int sqlerrcode)
Definition: elog.c:575
List * args
Definition: primnodes.h:301
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
static void check_agglevels_and_constraints(ParseState *pstate, Node *expr)
Definition: parse_agg.c:287
List * list_copy_tail(const List *oldlist, int nskip)
Definition: list.c:1203
List * lappend_oid(List *list, Oid datum)
Definition: list.c:164
#define OidIsValid(objectId)
Definition: c.h:532
#define AGGKIND_IS_ORDERED_SET(kind)
Definition: pg_aggregate.h:129
List * aggargtypes
Definition: primnodes.h:299
#define ERROR
Definition: elog.h:43
List * aggorder
Definition: primnodes.h:302
int errdetail(const char *fmt,...)
Definition: elog.c:873
int p_next_resno
Definition: parse_node.h:187
List * aggdirectargs
Definition: primnodes.h:300
#define ereport(elevel, rest)
Definition: elog.h:122
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:235
List * lappend(List *list, void *datum)
Definition: list.c:128
#define Assert(condition)
Definition: c.h:664
#define lfirst(lc)
Definition: pg_list.h:106
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
static int list_length(const List *l)
Definition: pg_list.h:89
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
int errmsg(const char *fmt,...)
Definition: elog.c:797
void * arg
char aggkind
Definition: primnodes.h:308
List * transformDistinctClause(ParseState *pstate, List **targetlist, List *sortClause, bool is_agg)
Definition: pg_list.h:45
int16 AttrNumber
Definition: attnum.h:21
Node* transformGroupingFunc ( ParseState pstate,
GroupingFunc g 
)

Definition at line 248 of file parse_agg.c.

References generate_unaccent_rules::args, GroupingFunc::args, check_agglevels_and_constraints(), ereport, errcode(), errmsg(), ERROR, lappend(), lfirst, list_length(), GroupingFunc::location, makeNode, NIL, ParseState::p_expr_kind, parser_errposition(), and transformExpr().

Referenced by transformExprRecurse().

249 {
250  ListCell *lc;
251  List *args = p->args;
252  List *result_list = NIL;
254 
255  if (list_length(args) > 31)
256  ereport(ERROR,
257  (errcode(ERRCODE_TOO_MANY_ARGUMENTS),
258  errmsg("GROUPING must have fewer than 32 arguments"),
259  parser_errposition(pstate, p->location)));
260 
261  foreach(lc, args)
262  {
263  Node *current_result;
264 
265  current_result = transformExpr(pstate, (Node *) lfirst(lc), pstate->p_expr_kind);
266 
267  /* acceptability of expressions is checked later */
268 
269  result_list = lappend(result_list, current_result);
270  }
271 
272  result->args = result_list;
273  result->location = p->location;
274 
275  check_agglevels_and_constraints(pstate, (Node *) result);
276 
277  return (Node *) result;
278 }
#define NIL
Definition: pg_list.h:69
List * args
Definition: primnodes.h:341
Node * transformExpr(ParseState *pstate, Node *expr, ParseExprKind exprKind)
Definition: parse_expr.c:146
Definition: nodes.h:509
int errcode(int sqlerrcode)
Definition: elog.c:575
static void check_agglevels_and_constraints(ParseState *pstate, Node *expr)
Definition: parse_agg.c:287
#define ERROR
Definition: elog.h:43
#define ereport(elevel, rest)
Definition: elog.h:122
List * lappend(List *list, void *datum)
Definition: list.c:128
ParseExprKind p_expr_kind
Definition: parse_node.h:186
#define makeNode(_type_)
Definition: nodes.h:557
#define lfirst(lc)
Definition: pg_list.h:106
static int list_length(const List *l)
Definition: pg_list.h:89
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
int errmsg(const char *fmt,...)
Definition: elog.c:797
Definition: pg_list.h:45
void transformWindowFuncCall ( ParseState pstate,
WindowFunc wfunc,
WindowDef windef 
)

Definition at line 761 of file parse_agg.c.

References _, WindowFunc::args, Assert, contain_windowfuncs(), WindowDef::endOffset, equal(), ereport, errcode(), errmsg(), errmsg_internal(), ERROR, EXPR_KIND_ALTER_COL_TRANSFORM, EXPR_KIND_CHECK_CONSTRAINT, EXPR_KIND_COLUMN_DEFAULT, EXPR_KIND_DISTINCT_ON, EXPR_KIND_DOMAIN_CHECK, EXPR_KIND_EXECUTE_PARAMETER, EXPR_KIND_FILTER, EXPR_KIND_FROM_FUNCTION, EXPR_KIND_FROM_SUBSELECT, EXPR_KIND_FUNCTION_DEFAULT, EXPR_KIND_GROUP_BY, EXPR_KIND_HAVING, EXPR_KIND_INDEX_EXPRESSION, EXPR_KIND_INDEX_PREDICATE, EXPR_KIND_INSERT_TARGET, EXPR_KIND_JOIN_ON, EXPR_KIND_JOIN_USING, EXPR_KIND_LIMIT, EXPR_KIND_NONE, EXPR_KIND_OFFSET, EXPR_KIND_ORDER_BY, EXPR_KIND_OTHER, EXPR_KIND_PARTITION_EXPRESSION, EXPR_KIND_POLICY, EXPR_KIND_RETURNING, EXPR_KIND_SELECT_TARGET, EXPR_KIND_TRIGGER_WHEN, EXPR_KIND_UPDATE_SOURCE, EXPR_KIND_UPDATE_TARGET, EXPR_KIND_VALUES, EXPR_KIND_VALUES_SINGLE, EXPR_KIND_WHERE, EXPR_KIND_WINDOW_FRAME_RANGE, EXPR_KIND_WINDOW_FRAME_ROWS, EXPR_KIND_WINDOW_ORDER, EXPR_KIND_WINDOW_PARTITION, FRAMEOPTION_DEFAULTS, WindowDef::frameOptions, lappend(), lfirst, list_length(), locate_windowfunc(), WindowFunc::location, WindowDef::location, WindowDef::name, NIL, WindowDef::orderClause, ParseState::p_expr_kind, ParseState::p_hasWindowFuncs, ParseState::p_windowdefs, ParseExprKindName(), parser_errposition(), WindowDef::partitionClause, WindowDef::refname, WindowDef::startOffset, and WindowFunc::winref.

Referenced by ParseFuncOrColumn().

763 {
764  const char *err;
765  bool errkind;
766 
767  /*
768  * A window function call can't contain another one (but aggs are OK). XXX
769  * is this required by spec, or just an unimplemented feature?
770  *
771  * Note: we don't need to check the filter expression here, because the
772  * context checks done below and in transformAggregateCall would have
773  * already rejected any window funcs or aggs within the filter.
774  */
775  if (pstate->p_hasWindowFuncs &&
776  contain_windowfuncs((Node *) wfunc->args))
777  ereport(ERROR,
778  (errcode(ERRCODE_WINDOWING_ERROR),
779  errmsg("window function calls cannot be nested"),
780  parser_errposition(pstate,
781  locate_windowfunc((Node *) wfunc->args))));
782 
783  /*
784  * Check to see if the window function is in an invalid place within the
785  * query.
786  *
787  * For brevity we support two schemes for reporting an error here: set
788  * "err" to a custom message, or set "errkind" true if the error context
789  * is sufficiently identified by what ParseExprKindName will return, *and*
790  * what it will return is just a SQL keyword. (Otherwise, use a custom
791  * message to avoid creating translation problems.)
792  */
793  err = NULL;
794  errkind = false;
795  switch (pstate->p_expr_kind)
796  {
797  case EXPR_KIND_NONE:
798  Assert(false); /* can't happen */
799  break;
800  case EXPR_KIND_OTHER:
801  /* Accept window func here; caller must throw error if wanted */
802  break;
803  case EXPR_KIND_JOIN_ON:
805  err = _("window functions are not allowed in JOIN conditions");
806  break;
808  /* can't get here, but just in case, throw an error */
809  errkind = true;
810  break;
812  err = _("window functions are not allowed in functions in FROM");
813  break;
814  case EXPR_KIND_WHERE:
815  errkind = true;
816  break;
817  case EXPR_KIND_POLICY:
818  err = _("window functions are not allowed in policy expressions");
819  break;
820  case EXPR_KIND_HAVING:
821  errkind = true;
822  break;
823  case EXPR_KIND_FILTER:
824  errkind = true;
825  break;
830  err = _("window functions are not allowed in window definitions");
831  break;
833  /* okay */
834  break;
838  errkind = true;
839  break;
840  case EXPR_KIND_GROUP_BY:
841  errkind = true;
842  break;
843  case EXPR_KIND_ORDER_BY:
844  /* okay */
845  break;
847  /* okay */
848  break;
849  case EXPR_KIND_LIMIT:
850  case EXPR_KIND_OFFSET:
851  errkind = true;
852  break;
853  case EXPR_KIND_RETURNING:
854  errkind = true;
855  break;
856  case EXPR_KIND_VALUES:
858  errkind = true;
859  break;
862  err = _("window functions are not allowed in check constraints");
863  break;
866  err = _("window functions are not allowed in DEFAULT expressions");
867  break;
869  err = _("window functions are not allowed in index expressions");
870  break;
872  err = _("window functions are not allowed in index predicates");
873  break;
875  err = _("window functions are not allowed in transform expressions");
876  break;
878  err = _("window functions are not allowed in EXECUTE parameters");
879  break;
881  err = _("window functions are not allowed in trigger WHEN conditions");
882  break;
884  err = _("window functions are not allowed in partition key expression");
885  break;
886 
887  /*
888  * There is intentionally no default: case here, so that the
889  * compiler will warn if we add a new ParseExprKind without
890  * extending this switch. If we do see an unrecognized value at
891  * runtime, the behavior will be the same as for EXPR_KIND_OTHER,
892  * which is sane anyway.
893  */
894  }
895  if (err)
896  ereport(ERROR,
897  (errcode(ERRCODE_WINDOWING_ERROR),
898  errmsg_internal("%s", err),
899  parser_errposition(pstate, wfunc->location)));
900  if (errkind)
901  ereport(ERROR,
902  (errcode(ERRCODE_WINDOWING_ERROR),
903  /* translator: %s is name of a SQL construct, eg GROUP BY */
904  errmsg("window functions are not allowed in %s",
905  ParseExprKindName(pstate->p_expr_kind)),
906  parser_errposition(pstate, wfunc->location)));
907 
908  /*
909  * If the OVER clause just specifies a window name, find that WINDOW
910  * clause (which had better be present). Otherwise, try to match all the
911  * properties of the OVER clause, and make a new entry in the p_windowdefs
912  * list if no luck.
913  */
914  if (windef->name)
915  {
916  Index winref = 0;
917  ListCell *lc;
918 
919  Assert(windef->refname == NULL &&
920  windef->partitionClause == NIL &&
921  windef->orderClause == NIL &&
923 
924  foreach(lc, pstate->p_windowdefs)
925  {
926  WindowDef *refwin = (WindowDef *) lfirst(lc);
927 
928  winref++;
929  if (refwin->name && strcmp(refwin->name, windef->name) == 0)
930  {
931  wfunc->winref = winref;
932  break;
933  }
934  }
935  if (lc == NULL) /* didn't find it? */
936  ereport(ERROR,
937  (errcode(ERRCODE_UNDEFINED_OBJECT),
938  errmsg("window \"%s\" does not exist", windef->name),
939  parser_errposition(pstate, windef->location)));
940  }
941  else
942  {
943  Index winref = 0;
944  ListCell *lc;
945 
946  foreach(lc, pstate->p_windowdefs)
947  {
948  WindowDef *refwin = (WindowDef *) lfirst(lc);
949 
950  winref++;
951  if (refwin->refname && windef->refname &&
952  strcmp(refwin->refname, windef->refname) == 0)
953  /* matched on refname */ ;
954  else if (!refwin->refname && !windef->refname)
955  /* matched, no refname */ ;
956  else
957  continue;
958  if (equal(refwin->partitionClause, windef->partitionClause) &&
959  equal(refwin->orderClause, windef->orderClause) &&
960  refwin->frameOptions == windef->frameOptions &&
961  equal(refwin->startOffset, windef->startOffset) &&
962  equal(refwin->endOffset, windef->endOffset))
963  {
964  /* found a duplicate window specification */
965  wfunc->winref = winref;
966  break;
967  }
968  }
969  if (lc == NULL) /* didn't find it? */
970  {
971  pstate->p_windowdefs = lappend(pstate->p_windowdefs, windef);
972  wfunc->winref = list_length(pstate->p_windowdefs);
973  }
974  }
975 
976  pstate->p_hasWindowFuncs = true;
977 }
List * partitionClause
Definition: parsenodes.h:488
#define NIL
Definition: pg_list.h:69
#define FRAMEOPTION_DEFAULTS
Definition: parsenodes.h:524
List * args
Definition: primnodes.h:359
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:2964
int frameOptions
Definition: parsenodes.h:490
char * name
Definition: parsenodes.h:486
Definition: nodes.h:509
int errcode(int sqlerrcode)
Definition: elog.c:575
int locate_windowfunc(Node *node)
Definition: rewriteManip.c:235
Index winref
Definition: primnodes.h:361
const char * ParseExprKindName(ParseExprKind exprKind)
Definition: parse_expr.c:3393
bool p_hasWindowFuncs
Definition: parse_node.h:199
Node * startOffset
Definition: parsenodes.h:491
#define ERROR
Definition: elog.h:43
int location
Definition: parsenodes.h:493
List * p_windowdefs
Definition: parse_node.h:185
Node * endOffset
Definition: parsenodes.h:492
#define ereport(elevel, rest)
Definition: elog.h:122
List * lappend(List *list, void *datum)
Definition: list.c:128
List * orderClause
Definition: parsenodes.h:489
unsigned int Index
Definition: c.h:359
ParseExprKind p_expr_kind
Definition: parse_node.h:186
int errmsg_internal(const char *fmt,...)
Definition: elog.c:827
int location
Definition: primnodes.h:364
#define Assert(condition)
Definition: c.h:664
#define lfirst(lc)
Definition: pg_list.h:106
static int list_length(const List *l)
Definition: pg_list.h:89
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
int errmsg(const char *fmt,...)
Definition: elog.c:797
char * refname
Definition: parsenodes.h:487
#define _(x)
Definition: elog.c:84
bool contain_windowfuncs(Node *node)
Definition: rewriteManip.c:197