1996-07-09 08:22:35 +02:00
|
|
|
/*-------------------------------------------------------------------------
|
|
|
|
*
|
1999-02-14 00:22:53 +01:00
|
|
|
* planner.c
|
1997-09-07 07:04:48 +02:00
|
|
|
* The query optimizer external interface.
|
1996-07-09 08:22:35 +02:00
|
|
|
*
|
2002-06-20 22:29:54 +02:00
|
|
|
* Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
|
2000-01-26 06:58:53 +01:00
|
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
1996-07-09 08:22:35 +02:00
|
|
|
*
|
|
|
|
*
|
|
|
|
* IDENTIFICATION
|
2003-03-05 19:38:14 +01:00
|
|
|
* $Header: /cvsroot/pgsql/src/backend/optimizer/plan/planner.c,v 1.149 2003/03/05 18:38:14 tgl Exp $
|
1996-07-09 08:22:35 +02:00
|
|
|
*
|
|
|
|
*-------------------------------------------------------------------------
|
|
|
|
*/
|
1996-10-31 11:59:42 +01:00
|
|
|
|
1996-07-09 08:22:35 +02:00
|
|
|
#include "postgres.h"
|
|
|
|
|
2002-11-20 00:22:00 +01:00
|
|
|
#include <limits.h>
|
|
|
|
|
2002-11-29 22:39:12 +01:00
|
|
|
#include "catalog/pg_operator.h"
|
1999-07-16 07:00:38 +02:00
|
|
|
#include "catalog/pg_type.h"
|
2002-11-20 00:22:00 +01:00
|
|
|
#include "miscadmin.h"
|
1999-07-16 07:00:38 +02:00
|
|
|
#include "nodes/makefuncs.h"
|
2001-10-18 18:11:42 +02:00
|
|
|
#ifdef OPTIMIZER_DEBUG
|
|
|
|
#include "nodes/print.h"
|
|
|
|
#endif
|
1999-07-16 07:00:38 +02:00
|
|
|
#include "optimizer/clauses.h"
|
2002-11-06 01:00:45 +01:00
|
|
|
#include "optimizer/cost.h"
|
|
|
|
#include "optimizer/pathnode.h"
|
1999-08-21 05:49:17 +02:00
|
|
|
#include "optimizer/paths.h"
|
1999-07-16 07:00:38 +02:00
|
|
|
#include "optimizer/planmain.h"
|
1996-07-09 08:22:35 +02:00
|
|
|
#include "optimizer/planner.h"
|
|
|
|
#include "optimizer/prep.h"
|
1998-02-13 04:37:04 +01:00
|
|
|
#include "optimizer/subselect.h"
|
1996-07-09 08:22:35 +02:00
|
|
|
#include "optimizer/tlist.h"
|
|
|
|
#include "optimizer/var.h"
|
2000-12-07 00:55:19 +01:00
|
|
|
#include "parser/analyze.h"
|
2000-09-29 20:21:41 +02:00
|
|
|
#include "parser/parsetree.h"
|
1999-07-16 07:00:38 +02:00
|
|
|
#include "parser/parse_expr.h"
|
2002-11-29 22:39:12 +01:00
|
|
|
#include "parser/parse_oper.h"
|
2002-11-20 00:22:00 +01:00
|
|
|
#include "utils/selfuncs.h"
|
2002-11-29 22:39:12 +01:00
|
|
|
#include "utils/syscache.h"
|
1999-02-03 20:31:24 +01:00
|
|
|
|
2000-03-21 06:12:12 +01:00
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
/* Expression kind codes for preprocess_expression */
|
2003-01-20 19:55:07 +01:00
|
|
|
#define EXPRKIND_QUAL 0
|
|
|
|
#define EXPRKIND_TARGET 1
|
|
|
|
#define EXPRKIND_RTFUNC 2
|
|
|
|
#define EXPRKIND_ININFO 3
|
2000-09-29 20:21:41 +02:00
|
|
|
|
|
|
|
|
|
|
|
static Node *preprocess_expression(Query *parse, Node *expr, int kind);
|
|
|
|
static void preprocess_qual_conditions(Query *parse, Node *jtnode);
|
2000-11-12 01:37:02 +01:00
|
|
|
static Plan *inheritance_planner(Query *parse, List *inheritlist);
|
|
|
|
static Plan *grouping_planner(Query *parse, double tuple_fraction);
|
2002-11-29 22:39:12 +01:00
|
|
|
static bool hash_safe_grouping(Query *parse);
|
1999-05-03 02:38:44 +02:00
|
|
|
static List *make_subplanTargetList(Query *parse, List *tlist,
|
2003-02-03 16:07:08 +01:00
|
|
|
AttrNumber **groupColIdx, bool *need_tlist_eval);
|
|
|
|
static void locate_grouping_columns(Query *parse,
|
|
|
|
List *tlist,
|
|
|
|
List *sub_tlist,
|
|
|
|
AttrNumber *groupColIdx);
|
2002-11-06 01:00:45 +01:00
|
|
|
static Plan *make_groupsortplan(Query *parse,
|
|
|
|
List *groupClause,
|
|
|
|
AttrNumber *grpColIdx,
|
|
|
|
Plan *subplan);
|
2000-11-09 03:46:17 +01:00
|
|
|
static List *postprocess_setop_tlist(List *new_tlist, List *orig_tlist);
|
|
|
|
|
1996-07-09 08:22:35 +02:00
|
|
|
|
|
|
|
/*****************************************************************************
|
|
|
|
*
|
1997-09-07 07:04:48 +02:00
|
|
|
* Query optimizer entry point
|
|
|
|
*
|
1996-07-09 08:22:35 +02:00
|
|
|
*****************************************************************************/
|
1998-02-26 05:46:47 +01:00
|
|
|
Plan *
|
1998-02-13 04:37:04 +01:00
|
|
|
planner(Query *parse)
|
|
|
|
{
|
|
|
|
Plan *result_plan;
|
2000-07-28 01:16:04 +02:00
|
|
|
Index save_PlannerQueryLevel;
|
|
|
|
List *save_PlannerParamVar;
|
|
|
|
|
|
|
|
/*
|
2000-10-05 21:11:39 +02:00
|
|
|
* The planner can be called recursively (an example is when
|
2001-03-22 05:01:46 +01:00
|
|
|
* eval_const_expressions tries to pre-evaluate an SQL function). So,
|
|
|
|
* these global state variables must be saved and restored.
|
2000-07-28 01:16:04 +02:00
|
|
|
*
|
2001-03-22 05:01:46 +01:00
|
|
|
* These vars cannot be moved into the Query structure since their whole
|
|
|
|
* purpose is communication across multiple sub-Queries.
|
2000-10-05 21:11:39 +02:00
|
|
|
*
|
|
|
|
* Note we do NOT save and restore PlannerPlanId: it exists to assign
|
2002-12-14 01:17:59 +01:00
|
|
|
* unique IDs to SubPlan nodes, and we want those IDs to be unique for
|
2001-03-22 05:01:46 +01:00
|
|
|
* the life of a backend. Also, PlannerInitPlan is saved/restored in
|
|
|
|
* subquery_planner, not here.
|
2000-07-28 01:16:04 +02:00
|
|
|
*/
|
|
|
|
save_PlannerQueryLevel = PlannerQueryLevel;
|
|
|
|
save_PlannerParamVar = PlannerParamVar;
|
1998-02-26 05:46:47 +01:00
|
|
|
|
2000-10-05 21:11:39 +02:00
|
|
|
/* Initialize state for handling outer-level references and params */
|
|
|
|
PlannerQueryLevel = 0; /* will be 1 in top-level subquery_planner */
|
|
|
|
PlannerParamVar = NIL;
|
1998-02-26 05:46:47 +01:00
|
|
|
|
2000-10-05 21:11:39 +02:00
|
|
|
/* primary planning entry point (may recurse for subqueries) */
|
2000-04-12 19:17:23 +02:00
|
|
|
result_plan = subquery_planner(parse, -1.0 /* default case */ );
|
1998-02-26 05:46:47 +01:00
|
|
|
|
2000-10-05 21:11:39 +02:00
|
|
|
Assert(PlannerQueryLevel == 0);
|
2000-03-21 06:12:12 +01:00
|
|
|
|
|
|
|
/* executor wants to know total number of Params used overall */
|
1998-02-26 05:46:47 +01:00
|
|
|
result_plan->nParamExec = length(PlannerParamVar);
|
|
|
|
|
2000-03-21 06:12:12 +01:00
|
|
|
/* final cleanup of the plan */
|
2002-05-18 04:25:50 +02:00
|
|
|
set_plan_references(result_plan, parse->rtable);
|
1999-08-22 22:15:04 +02:00
|
|
|
|
2000-07-28 01:16:04 +02:00
|
|
|
/* restore state for outer planner, if any */
|
|
|
|
PlannerQueryLevel = save_PlannerQueryLevel;
|
|
|
|
PlannerParamVar = save_PlannerParamVar;
|
|
|
|
|
1998-09-01 05:29:17 +02:00
|
|
|
return result_plan;
|
1998-02-13 04:37:04 +01:00
|
|
|
}
|
1996-07-09 08:22:35 +02:00
|
|
|
|
2000-03-21 06:12:12 +01:00
|
|
|
|
2000-02-15 21:49:31 +01:00
|
|
|
/*--------------------
|
2000-03-21 06:12:12 +01:00
|
|
|
* subquery_planner
|
|
|
|
* Invokes the planner on a subquery. We recurse to here for each
|
|
|
|
* sub-SELECT found in the query tree.
|
1997-09-07 07:04:48 +02:00
|
|
|
*
|
2000-02-15 21:49:31 +01:00
|
|
|
* parse is the querytree produced by the parser & rewriter.
|
2000-03-21 06:12:12 +01:00
|
|
|
* tuple_fraction is the fraction of tuples we expect will be retrieved.
|
2000-11-12 01:37:02 +01:00
|
|
|
* tuple_fraction is interpreted as explained for grouping_planner, below.
|
1997-09-07 07:04:48 +02:00
|
|
|
*
|
2000-03-21 06:12:12 +01:00
|
|
|
* Basically, this routine does the stuff that should only be done once
|
2000-11-12 01:37:02 +01:00
|
|
|
* per Query object. It then calls grouping_planner. At one time,
|
|
|
|
* grouping_planner could be invoked recursively on the same Query object;
|
|
|
|
* that's not currently true, but we keep the separation between the two
|
|
|
|
* routines anyway, in case we need it again someday.
|
|
|
|
*
|
2000-10-05 21:11:39 +02:00
|
|
|
* subquery_planner will be called recursively to handle sub-Query nodes
|
|
|
|
* found within the query's expressions and rangetable.
|
1997-09-07 07:04:48 +02:00
|
|
|
*
|
2000-02-15 21:49:31 +01:00
|
|
|
* Returns a query plan.
|
|
|
|
*--------------------
|
1996-07-09 08:22:35 +02:00
|
|
|
*/
|
1998-02-26 05:46:47 +01:00
|
|
|
Plan *
|
2000-03-21 06:12:12 +01:00
|
|
|
subquery_planner(Query *parse, double tuple_fraction)
|
1996-07-09 08:22:35 +02:00
|
|
|
{
|
2000-10-05 21:11:39 +02:00
|
|
|
List *saved_initplan = PlannerInitPlan;
|
|
|
|
int saved_planid = PlannerPlanId;
|
2003-02-10 00:57:19 +01:00
|
|
|
bool hasOuterJoins;
|
2000-10-05 21:11:39 +02:00
|
|
|
Plan *plan;
|
2001-01-18 08:12:37 +01:00
|
|
|
List *newHaving;
|
2000-10-05 21:11:39 +02:00
|
|
|
List *lst;
|
|
|
|
|
|
|
|
/* Set up for a new level of subquery */
|
|
|
|
PlannerQueryLevel++;
|
|
|
|
PlannerInitPlan = NIL;
|
|
|
|
|
2003-01-20 19:55:07 +01:00
|
|
|
/*
|
|
|
|
* Look for IN clauses at the top level of WHERE, and transform them
|
|
|
|
* into joins. Note that this step only handles IN clauses originally
|
|
|
|
* at top level of WHERE; if we pull up any subqueries in the next step,
|
|
|
|
* their INs are processed just before pulling them up.
|
|
|
|
*/
|
|
|
|
parse->in_info_list = NIL;
|
|
|
|
if (parse->hasSubLinks)
|
|
|
|
parse->jointree->quals = pull_up_IN_clauses(parse,
|
|
|
|
parse->jointree->quals);
|
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
/*
|
|
|
|
* Check to see if any subqueries in the rangetable can be merged into
|
|
|
|
* this query.
|
|
|
|
*/
|
|
|
|
parse->jointree = (FromExpr *)
|
2002-04-28 21:54:29 +02:00
|
|
|
pull_up_subqueries(parse, (Node *) parse->jointree, false);
|
2001-03-22 05:01:46 +01:00
|
|
|
|
2002-11-20 00:22:00 +01:00
|
|
|
/*
|
|
|
|
* Detect whether any rangetable entries are RTE_JOIN kind; if not,
|
2003-02-10 00:57:19 +01:00
|
|
|
* we can avoid the expense of doing flatten_join_alias_vars(). Also
|
|
|
|
* check for outer joins --- if none, we can skip reduce_outer_joins().
|
2002-11-20 00:22:00 +01:00
|
|
|
* This must be done after we have done pull_up_subqueries, of course.
|
|
|
|
*/
|
|
|
|
parse->hasJoinRTEs = false;
|
2003-02-10 00:57:19 +01:00
|
|
|
hasOuterJoins = false;
|
2002-11-20 00:22:00 +01:00
|
|
|
foreach(lst, parse->rtable)
|
|
|
|
{
|
|
|
|
RangeTblEntry *rte = (RangeTblEntry *) lfirst(lst);
|
|
|
|
|
|
|
|
if (rte->rtekind == RTE_JOIN)
|
|
|
|
{
|
|
|
|
parse->hasJoinRTEs = true;
|
2003-02-10 00:57:19 +01:00
|
|
|
if (IS_OUTER_JOIN(rte->jointype))
|
|
|
|
{
|
|
|
|
hasOuterJoins = true;
|
|
|
|
/* Can quit scanning once we find an outer join */
|
|
|
|
break;
|
|
|
|
}
|
2002-11-20 00:22:00 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-10-07 06:23:24 +02:00
|
|
|
/*
|
2000-11-12 01:37:02 +01:00
|
|
|
* Do expression preprocessing on targetlist and quals.
|
1999-10-07 06:23:24 +02:00
|
|
|
*/
|
2000-03-21 06:12:12 +01:00
|
|
|
parse->targetList = (List *)
|
2000-09-29 20:21:41 +02:00
|
|
|
preprocess_expression(parse, (Node *) parse->targetList,
|
|
|
|
EXPRKIND_TARGET);
|
|
|
|
|
|
|
|
preprocess_qual_conditions(parse, (Node *) parse->jointree);
|
|
|
|
|
|
|
|
parse->havingQual = preprocess_expression(parse, parse->havingQual,
|
2003-01-20 19:55:07 +01:00
|
|
|
EXPRKIND_QUAL);
|
|
|
|
|
|
|
|
parse->in_info_list = (List *)
|
|
|
|
preprocess_expression(parse, (Node *) parse->in_info_list,
|
|
|
|
EXPRKIND_ININFO);
|
1999-10-07 06:23:24 +02:00
|
|
|
|
2002-05-18 04:25:50 +02:00
|
|
|
/* Also need to preprocess expressions for function RTEs */
|
|
|
|
foreach(lst, parse->rtable)
|
|
|
|
{
|
|
|
|
RangeTblEntry *rte = (RangeTblEntry *) lfirst(lst);
|
|
|
|
|
|
|
|
if (rte->rtekind == RTE_FUNCTION)
|
|
|
|
rte->funcexpr = preprocess_expression(parse, rte->funcexpr,
|
2003-01-20 19:55:07 +01:00
|
|
|
EXPRKIND_RTFUNC);
|
2002-05-18 04:25:50 +02:00
|
|
|
}
|
|
|
|
|
2001-01-18 08:12:37 +01:00
|
|
|
/*
|
|
|
|
* A HAVING clause without aggregates is equivalent to a WHERE clause
|
2001-03-22 05:01:46 +01:00
|
|
|
* (except it can only refer to grouped fields). Transfer any
|
|
|
|
* agg-free clauses of the HAVING qual into WHERE. This may seem like
|
|
|
|
* wasting cycles to cater to stupidly-written queries, but there are
|
|
|
|
* other reasons for doing it. Firstly, if the query contains no aggs
|
|
|
|
* at all, then we aren't going to generate an Agg plan node, and so
|
|
|
|
* there'll be no place to execute HAVING conditions; without this
|
|
|
|
* transfer, we'd lose the HAVING condition entirely, which is wrong.
|
|
|
|
* Secondly, when we push down a qual condition into a sub-query, it's
|
|
|
|
* easiest to push the qual into HAVING always, in case it contains
|
|
|
|
* aggs, and then let this code sort it out.
|
2001-01-18 08:12:37 +01:00
|
|
|
*
|
|
|
|
* Note that both havingQual and parse->jointree->quals are in
|
|
|
|
* implicitly-ANDed-list form at this point, even though they are
|
2001-03-22 05:01:46 +01:00
|
|
|
* declared as Node *. Also note that contain_agg_clause does not
|
2001-01-18 08:12:37 +01:00
|
|
|
* recurse into sub-selects, which is exactly what we need here.
|
|
|
|
*/
|
|
|
|
newHaving = NIL;
|
|
|
|
foreach(lst, (List *) parse->havingQual)
|
|
|
|
{
|
2001-03-22 05:01:46 +01:00
|
|
|
Node *havingclause = (Node *) lfirst(lst);
|
2001-01-18 08:12:37 +01:00
|
|
|
|
|
|
|
if (contain_agg_clause(havingclause))
|
|
|
|
newHaving = lappend(newHaving, havingclause);
|
|
|
|
else
|
|
|
|
parse->jointree->quals = (Node *)
|
|
|
|
lappend((List *) parse->jointree->quals, havingclause);
|
|
|
|
}
|
|
|
|
parse->havingQual = (Node *) newHaving;
|
|
|
|
|
2003-02-10 00:57:19 +01:00
|
|
|
/*
|
|
|
|
* If we have any outer joins, try to reduce them to plain inner joins.
|
|
|
|
* This step is most easily done after we've done expression preprocessing.
|
|
|
|
*/
|
|
|
|
if (hasOuterJoins)
|
|
|
|
reduce_outer_joins(parse);
|
|
|
|
|
2003-01-26 00:10:30 +01:00
|
|
|
/*
|
|
|
|
* See if we can simplify the jointree; opportunities for this may come
|
|
|
|
* from having pulled up subqueries, or from flattening explicit JOIN
|
|
|
|
* syntax. We must do this after flattening JOIN alias variables, since
|
|
|
|
* eliminating explicit JOIN nodes from the jointree will cause
|
2003-02-10 00:57:19 +01:00
|
|
|
* get_relids_for_join() to fail. But it should happen after
|
|
|
|
* reduce_outer_joins, anyway.
|
2003-01-26 00:10:30 +01:00
|
|
|
*/
|
|
|
|
parse->jointree = (FromExpr *)
|
2003-02-10 00:57:19 +01:00
|
|
|
simplify_jointree(parse, (Node *) parse->jointree);
|
2003-01-26 00:10:30 +01:00
|
|
|
|
2000-03-21 06:12:12 +01:00
|
|
|
/*
|
2000-11-12 01:37:02 +01:00
|
|
|
* Do the main planning. If we have an inherited target relation,
|
2001-03-22 05:01:46 +01:00
|
|
|
* that needs special processing, else go straight to
|
|
|
|
* grouping_planner.
|
2000-03-21 06:12:12 +01:00
|
|
|
*/
|
2000-11-12 01:37:02 +01:00
|
|
|
if (parse->resultRelation &&
|
2001-10-25 07:50:21 +02:00
|
|
|
(lst = expand_inherted_rtentry(parse, parse->resultRelation, false))
|
2001-05-20 22:28:20 +02:00
|
|
|
!= NIL)
|
2000-11-12 01:37:02 +01:00
|
|
|
plan = inheritance_planner(parse, lst);
|
|
|
|
else
|
|
|
|
plan = grouping_planner(parse, tuple_fraction);
|
2000-10-05 21:11:39 +02:00
|
|
|
|
|
|
|
/*
|
2001-03-22 05:01:46 +01:00
|
|
|
* If any subplans were generated, or if we're inside a subplan, build
|
2003-02-09 01:30:41 +01:00
|
|
|
* initPlan list and extParam/allParam sets for plan nodes.
|
2000-10-05 21:11:39 +02:00
|
|
|
*/
|
|
|
|
if (PlannerPlanId != saved_planid || PlannerQueryLevel > 1)
|
|
|
|
{
|
2002-12-20 00:25:01 +01:00
|
|
|
Cost initplan_cost = 0;
|
|
|
|
|
2003-02-09 01:30:41 +01:00
|
|
|
/* Prepare extParam/allParam sets for all nodes in tree */
|
|
|
|
SS_finalize_plan(plan, parse->rtable);
|
2001-03-22 05:01:46 +01:00
|
|
|
|
2000-10-05 21:11:39 +02:00
|
|
|
/*
|
2002-12-20 00:25:01 +01:00
|
|
|
* SS_finalize_plan doesn't handle initPlans, so we have to manually
|
|
|
|
* attach them to the topmost plan node, and add their extParams to
|
|
|
|
* the topmost node's, too.
|
|
|
|
*
|
|
|
|
* We also add the total_cost of each initPlan to the startup cost
|
|
|
|
* of the top node. This is a conservative overestimate, since in
|
|
|
|
* fact each initPlan might be executed later than plan startup, or
|
|
|
|
* even not at all.
|
2000-10-05 21:11:39 +02:00
|
|
|
*/
|
|
|
|
plan->initPlan = PlannerInitPlan;
|
2002-12-20 00:25:01 +01:00
|
|
|
|
2000-10-05 21:11:39 +02:00
|
|
|
foreach(lst, plan->initPlan)
|
|
|
|
{
|
2002-12-20 00:25:01 +01:00
|
|
|
SubPlan *initplan = (SubPlan *) lfirst(lst);
|
2000-10-05 21:11:39 +02:00
|
|
|
|
2003-02-09 01:30:41 +01:00
|
|
|
plan->extParam = bms_add_members(plan->extParam,
|
|
|
|
initplan->plan->extParam);
|
2002-12-20 00:25:01 +01:00
|
|
|
initplan_cost += initplan->plan->total_cost;
|
2000-10-05 21:11:39 +02:00
|
|
|
}
|
2002-12-20 00:25:01 +01:00
|
|
|
|
|
|
|
plan->startup_cost += initplan_cost;
|
|
|
|
plan->total_cost += initplan_cost;
|
2000-10-05 21:11:39 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Return to outer subquery context */
|
|
|
|
PlannerQueryLevel--;
|
|
|
|
PlannerInitPlan = saved_initplan;
|
|
|
|
/* we do NOT restore PlannerPlanId; that's not an oversight! */
|
|
|
|
|
|
|
|
return plan;
|
2000-09-29 20:21:41 +02:00
|
|
|
}
|
2000-03-21 06:12:12 +01:00
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
/*
|
|
|
|
* preprocess_expression
|
|
|
|
* Do subquery_planner's preprocessing work for an expression,
|
|
|
|
* which can be a targetlist, a WHERE clause (including JOIN/ON
|
|
|
|
* conditions), or a HAVING clause.
|
|
|
|
*/
|
|
|
|
static Node *
|
|
|
|
preprocess_expression(Query *parse, Node *expr, int kind)
|
|
|
|
{
|
2003-01-15 20:35:48 +01:00
|
|
|
/*
|
|
|
|
* If the query has any join RTEs, replace join alias variables with
|
|
|
|
* base-relation variables. We must do this before sublink processing,
|
|
|
|
* else sublinks expanded out from join aliases wouldn't get processed.
|
|
|
|
*/
|
|
|
|
if (parse->hasJoinRTEs)
|
2003-01-20 19:55:07 +01:00
|
|
|
expr = flatten_join_alias_vars(parse, expr);
|
2003-01-15 20:35:48 +01:00
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
/*
|
|
|
|
* Simplify constant expressions.
|
|
|
|
*
|
|
|
|
* Note that at this point quals have not yet been converted to
|
|
|
|
* implicit-AND form, so we can apply eval_const_expressions directly.
|
|
|
|
*/
|
|
|
|
expr = eval_const_expressions(expr);
|
2000-09-12 23:07:18 +02:00
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
/*
|
2001-03-22 05:01:46 +01:00
|
|
|
* If it's a qual or havingQual, canonicalize it, and convert it to
|
|
|
|
* implicit-AND format.
|
2000-09-29 20:21:41 +02:00
|
|
|
*
|
|
|
|
* XXX Is there any value in re-applying eval_const_expressions after
|
|
|
|
* canonicalize_qual?
|
|
|
|
*/
|
2003-01-20 19:55:07 +01:00
|
|
|
if (kind == EXPRKIND_QUAL)
|
2000-09-29 20:21:41 +02:00
|
|
|
{
|
|
|
|
expr = (Node *) canonicalize_qual((Expr *) expr, true);
|
|
|
|
|
|
|
|
#ifdef OPTIMIZER_DEBUG
|
|
|
|
printf("After canonicalize_qual()\n");
|
|
|
|
pprint(expr);
|
|
|
|
#endif
|
|
|
|
}
|
2000-09-12 23:07:18 +02:00
|
|
|
|
2001-10-30 20:58:58 +01:00
|
|
|
/* Expand SubLinks to SubPlans */
|
2000-09-29 20:21:41 +02:00
|
|
|
if (parse->hasSubLinks)
|
2003-01-20 19:55:07 +01:00
|
|
|
expr = SS_process_sublinks(expr, (kind == EXPRKIND_QUAL));
|
2000-09-29 20:21:41 +02:00
|
|
|
|
|
|
|
/* Replace uplevel vars with Param nodes */
|
|
|
|
if (PlannerQueryLevel > 1)
|
|
|
|
expr = SS_replace_correlation_vars(expr);
|
|
|
|
|
|
|
|
return expr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* preprocess_qual_conditions
|
|
|
|
* Recursively scan the query's jointree and do subquery_planner's
|
|
|
|
* preprocessing work on each qual condition found therein.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
preprocess_qual_conditions(Query *parse, Node *jtnode)
|
|
|
|
{
|
|
|
|
if (jtnode == NULL)
|
|
|
|
return;
|
|
|
|
if (IsA(jtnode, RangeTblRef))
|
|
|
|
{
|
|
|
|
/* nothing to do here */
|
|
|
|
}
|
|
|
|
else if (IsA(jtnode, FromExpr))
|
|
|
|
{
|
|
|
|
FromExpr *f = (FromExpr *) jtnode;
|
|
|
|
List *l;
|
2000-09-12 23:07:18 +02:00
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
foreach(l, f->fromlist)
|
|
|
|
preprocess_qual_conditions(parse, lfirst(l));
|
|
|
|
|
2003-01-20 19:55:07 +01:00
|
|
|
f->quals = preprocess_expression(parse, f->quals, EXPRKIND_QUAL);
|
2000-09-29 20:21:41 +02:00
|
|
|
}
|
|
|
|
else if (IsA(jtnode, JoinExpr))
|
|
|
|
{
|
|
|
|
JoinExpr *j = (JoinExpr *) jtnode;
|
|
|
|
|
|
|
|
preprocess_qual_conditions(parse, j->larg);
|
|
|
|
preprocess_qual_conditions(parse, j->rarg);
|
|
|
|
|
2003-01-20 19:55:07 +01:00
|
|
|
j->quals = preprocess_expression(parse, j->quals, EXPRKIND_QUAL);
|
2000-09-12 23:07:18 +02:00
|
|
|
}
|
|
|
|
else
|
2000-09-29 20:21:41 +02:00
|
|
|
elog(ERROR, "preprocess_qual_conditions: unexpected node type %d",
|
2000-09-12 23:07:18 +02:00
|
|
|
nodeTag(jtnode));
|
|
|
|
}
|
2000-03-21 06:12:12 +01:00
|
|
|
|
|
|
|
/*--------------------
|
2000-11-12 01:37:02 +01:00
|
|
|
* inheritance_planner
|
|
|
|
* Generate a plan in the case where the result relation is an
|
|
|
|
* inheritance set.
|
|
|
|
*
|
|
|
|
* We have to handle this case differently from cases where a source
|
2001-03-22 05:01:46 +01:00
|
|
|
* relation is an inheritance set. Source inheritance is expanded at
|
2000-11-12 01:37:02 +01:00
|
|
|
* the bottom of the plan tree (see allpaths.c), but target inheritance
|
|
|
|
* has to be expanded at the top. The reason is that for UPDATE, each
|
|
|
|
* target relation needs a different targetlist matching its own column
|
|
|
|
* set. (This is not so critical for DELETE, but for simplicity we treat
|
2001-03-22 05:01:46 +01:00
|
|
|
* inherited DELETE the same way.) Fortunately, the UPDATE/DELETE target
|
2000-11-12 01:37:02 +01:00
|
|
|
* can never be the nullable side of an outer join, so it's OK to generate
|
|
|
|
* the plan this way.
|
|
|
|
*
|
|
|
|
* parse is the querytree produced by the parser & rewriter.
|
|
|
|
* inheritlist is an integer list of RT indexes for the result relation set.
|
|
|
|
*
|
|
|
|
* Returns a query plan.
|
|
|
|
*--------------------
|
|
|
|
*/
|
|
|
|
static Plan *
|
|
|
|
inheritance_planner(Query *parse, List *inheritlist)
|
|
|
|
{
|
|
|
|
int parentRTindex = parse->resultRelation;
|
|
|
|
Oid parentOID = getrelid(parentRTindex, parse->rtable);
|
2003-03-05 19:38:14 +01:00
|
|
|
int mainrtlength = length(parse->rtable);
|
2000-11-12 01:37:02 +01:00
|
|
|
List *subplans = NIL;
|
|
|
|
List *tlist = NIL;
|
|
|
|
List *l;
|
|
|
|
|
|
|
|
foreach(l, inheritlist)
|
|
|
|
{
|
2001-03-22 05:01:46 +01:00
|
|
|
int childRTindex = lfirsti(l);
|
|
|
|
Oid childOID = getrelid(childRTindex, parse->rtable);
|
2003-03-05 19:38:14 +01:00
|
|
|
int subrtlength;
|
2001-03-22 05:01:46 +01:00
|
|
|
Query *subquery;
|
|
|
|
Plan *subplan;
|
2000-11-12 01:37:02 +01:00
|
|
|
|
|
|
|
/* Generate modified query with this rel as target */
|
|
|
|
subquery = (Query *) adjust_inherited_attrs((Node *) parse,
|
2001-03-22 05:01:46 +01:00
|
|
|
parentRTindex, parentOID,
|
|
|
|
childRTindex, childOID);
|
2000-11-12 01:37:02 +01:00
|
|
|
/* Generate plan */
|
2001-03-22 05:01:46 +01:00
|
|
|
subplan = grouping_planner(subquery, 0.0 /* retrieve all tuples */ );
|
2000-11-12 01:37:02 +01:00
|
|
|
subplans = lappend(subplans, subplan);
|
2003-03-05 19:38:14 +01:00
|
|
|
/*
|
|
|
|
* It's possible that additional RTEs got added to the rangetable
|
|
|
|
* due to expansion of inherited source tables (see allpaths.c).
|
|
|
|
* If so, we must copy 'em back to the main parse tree's rtable.
|
|
|
|
*
|
|
|
|
* XXX my goodness this is ugly. Really need to think about ways
|
|
|
|
* to rein in planner's habit of scribbling on its input.
|
|
|
|
*/
|
|
|
|
subrtlength = length(subquery->rtable);
|
|
|
|
if (subrtlength > mainrtlength)
|
|
|
|
{
|
|
|
|
List *subrt = subquery->rtable;
|
|
|
|
|
|
|
|
while (mainrtlength-- > 0) /* wish we had nthcdr() */
|
|
|
|
subrt = lnext(subrt);
|
|
|
|
parse->rtable = nconc(parse->rtable, subrt);
|
|
|
|
mainrtlength = subrtlength;
|
|
|
|
}
|
2000-11-12 01:37:02 +01:00
|
|
|
/* Save preprocessed tlist from first rel for use in Append */
|
|
|
|
if (tlist == NIL)
|
|
|
|
tlist = subplan->targetlist;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Save the target-relations list for the executor, too */
|
|
|
|
parse->resultRelations = inheritlist;
|
|
|
|
|
2003-02-15 21:12:41 +01:00
|
|
|
/* Mark result as unordered (probably unnecessary) */
|
|
|
|
parse->query_pathkeys = NIL;
|
|
|
|
|
2000-11-12 01:37:02 +01:00
|
|
|
return (Plan *) make_append(subplans, true, tlist);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*--------------------
|
|
|
|
* grouping_planner
|
|
|
|
* Perform planning steps related to grouping, aggregation, etc.
|
|
|
|
* This primarily means adding top-level processing to the basic
|
|
|
|
* query plan produced by query_planner.
|
2000-03-21 06:12:12 +01:00
|
|
|
*
|
|
|
|
* parse is the querytree produced by the parser & rewriter.
|
|
|
|
* tuple_fraction is the fraction of tuples we expect will be retrieved
|
|
|
|
*
|
|
|
|
* tuple_fraction is interpreted as follows:
|
2000-04-12 19:17:23 +02:00
|
|
|
* < 0: determine fraction by inspection of query (normal case)
|
|
|
|
* 0: expect all tuples to be retrieved
|
2000-03-21 06:12:12 +01:00
|
|
|
* 0 < tuple_fraction < 1: expect the given fraction of tuples available
|
|
|
|
* from the plan to be retrieved
|
|
|
|
* tuple_fraction >= 1: tuple_fraction is the absolute number of tuples
|
|
|
|
* expected to be retrieved (ie, a LIMIT specification)
|
|
|
|
* The normal case is to pass -1, but some callers pass values >= 0 to
|
|
|
|
* override this routine's determination of the appropriate fraction.
|
|
|
|
*
|
2003-02-15 21:12:41 +01:00
|
|
|
* Returns a query plan. Also, parse->query_pathkeys is returned as the
|
|
|
|
* actual output ordering of the plan (in pathkey format).
|
2000-03-21 06:12:12 +01:00
|
|
|
*--------------------
|
|
|
|
*/
|
2000-11-12 01:37:02 +01:00
|
|
|
static Plan *
|
|
|
|
grouping_planner(Query *parse, double tuple_fraction)
|
2000-03-21 06:12:12 +01:00
|
|
|
{
|
|
|
|
List *tlist = parse->targetList;
|
2000-11-12 01:37:02 +01:00
|
|
|
Plan *result_plan;
|
|
|
|
List *current_pathkeys;
|
2000-03-21 06:12:12 +01:00
|
|
|
List *sort_pathkeys;
|
1999-10-07 06:23:24 +02:00
|
|
|
|
2000-10-05 21:11:39 +02:00
|
|
|
if (parse->setOperations)
|
1997-12-24 07:06:58 +01:00
|
|
|
{
|
2000-10-05 21:11:39 +02:00
|
|
|
/*
|
2000-11-09 03:46:17 +01:00
|
|
|
* Construct the plan for set operations. The result will not
|
|
|
|
* need any work except perhaps a top-level sort and/or LIMIT.
|
2000-10-05 21:11:39 +02:00
|
|
|
*/
|
|
|
|
result_plan = plan_set_operations(parse);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We should not need to call preprocess_targetlist, since we must
|
2000-11-09 03:46:17 +01:00
|
|
|
* be in a SELECT query node. Instead, use the targetlist
|
|
|
|
* returned by plan_set_operations (since this tells whether it
|
|
|
|
* returned any resjunk columns!), and transfer any sort key
|
|
|
|
* information from the original tlist.
|
2000-10-05 21:11:39 +02:00
|
|
|
*/
|
|
|
|
Assert(parse->commandType == CMD_SELECT);
|
2000-04-12 19:17:23 +02:00
|
|
|
|
2000-11-09 03:46:17 +01:00
|
|
|
tlist = postprocess_setop_tlist(result_plan->targetlist, tlist);
|
|
|
|
|
2000-12-07 00:55:19 +01:00
|
|
|
/*
|
2001-03-22 05:01:46 +01:00
|
|
|
* Can't handle FOR UPDATE here (parser should have checked
|
|
|
|
* already, but let's make sure).
|
2000-12-07 00:55:19 +01:00
|
|
|
*/
|
|
|
|
if (parse->rowMarks)
|
|
|
|
elog(ERROR, "SELECT FOR UPDATE is not allowed with UNION/INTERSECT/EXCEPT");
|
|
|
|
|
1999-08-23 01:56:45 +02:00
|
|
|
/*
|
2000-11-12 01:37:02 +01:00
|
|
|
* We set current_pathkeys NIL indicating we do not know sort
|
2001-03-22 05:01:46 +01:00
|
|
|
* order. This is correct when the top set operation is UNION
|
|
|
|
* ALL, since the appended-together results are unsorted even if
|
|
|
|
* the subplans were sorted. For other set operations we could be
|
2000-11-12 01:37:02 +01:00
|
|
|
* smarter --- room for future improvement!
|
1999-08-23 01:56:45 +02:00
|
|
|
*/
|
2000-11-12 01:37:02 +01:00
|
|
|
current_pathkeys = NIL;
|
2000-02-15 21:49:31 +01:00
|
|
|
|
2000-04-12 19:17:23 +02:00
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* Calculate pathkeys that represent ordering requirements
|
2000-04-12 19:17:23 +02:00
|
|
|
*/
|
2000-02-15 21:49:31 +01:00
|
|
|
sort_pathkeys = make_pathkeys_for_sortclauses(parse->sortClause,
|
|
|
|
tlist);
|
2002-11-06 01:00:45 +01:00
|
|
|
sort_pathkeys = canonicalize_pathkeys(parse, sort_pathkeys);
|
1997-12-24 07:06:58 +01:00
|
|
|
}
|
1997-09-07 07:04:48 +02:00
|
|
|
else
|
1997-12-18 20:41:44 +01:00
|
|
|
{
|
2002-11-06 01:00:45 +01:00
|
|
|
/* No set operations, do regular planning */
|
1999-05-25 18:15:34 +02:00
|
|
|
List *sub_tlist;
|
2002-11-06 01:00:45 +01:00
|
|
|
List *group_pathkeys;
|
|
|
|
AttrNumber *groupColIdx = NULL;
|
2003-02-03 16:07:08 +01:00
|
|
|
bool need_tlist_eval = true;
|
2003-01-13 01:29:26 +01:00
|
|
|
QualCost tlist_cost;
|
2002-11-21 01:42:20 +01:00
|
|
|
double sub_tuple_fraction;
|
2002-11-06 01:00:45 +01:00
|
|
|
Path *cheapest_path;
|
|
|
|
Path *sorted_path;
|
2002-11-20 00:22:00 +01:00
|
|
|
double dNumGroups = 0;
|
|
|
|
long numGroups = 0;
|
|
|
|
int numAggs = 0;
|
2002-11-21 01:42:20 +01:00
|
|
|
int numGroupCols = length(parse->groupClause);
|
2002-11-06 23:31:24 +01:00
|
|
|
bool use_hashed_grouping = false;
|
1999-04-19 03:43:12 +02:00
|
|
|
|
1999-05-25 18:15:34 +02:00
|
|
|
/* Preprocess targetlist in case we are inside an INSERT/UPDATE. */
|
|
|
|
tlist = preprocess_targetlist(tlist,
|
|
|
|
parse->commandType,
|
|
|
|
parse->resultRelation,
|
|
|
|
parse->rtable);
|
1999-01-25 13:01:19 +01:00
|
|
|
|
1999-05-25 18:15:34 +02:00
|
|
|
/*
|
2000-09-29 20:21:41 +02:00
|
|
|
* Add TID targets for rels selected FOR UPDATE (should this be
|
2001-03-22 05:01:46 +01:00
|
|
|
* done in preprocess_targetlist?). The executor uses the TID to
|
|
|
|
* know which rows to lock, much as for UPDATE or DELETE.
|
1999-05-25 18:15:34 +02:00
|
|
|
*/
|
2000-09-29 20:21:41 +02:00
|
|
|
if (parse->rowMarks)
|
1999-05-25 18:15:34 +02:00
|
|
|
{
|
|
|
|
List *l;
|
|
|
|
|
2000-12-07 00:55:19 +01:00
|
|
|
/*
|
2001-03-22 05:01:46 +01:00
|
|
|
* We've got trouble if the FOR UPDATE appears inside
|
|
|
|
* grouping, since grouping renders a reference to individual
|
|
|
|
* tuple CTIDs invalid. This is also checked at parse time,
|
|
|
|
* but that's insufficient because of rule substitution, query
|
|
|
|
* pullup, etc.
|
2000-12-07 00:55:19 +01:00
|
|
|
*/
|
|
|
|
CheckSelectForUpdate(parse);
|
|
|
|
|
2001-03-22 05:01:46 +01:00
|
|
|
/*
|
|
|
|
* Currently the executor only supports FOR UPDATE at top
|
|
|
|
* level
|
|
|
|
*/
|
2000-12-07 00:55:19 +01:00
|
|
|
if (PlannerQueryLevel > 1)
|
|
|
|
elog(ERROR, "SELECT FOR UPDATE is not allowed in subselects");
|
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
foreach(l, parse->rowMarks)
|
1999-05-25 18:15:34 +02:00
|
|
|
{
|
2000-09-29 20:21:41 +02:00
|
|
|
Index rti = lfirsti(l);
|
|
|
|
char *resname;
|
1999-05-25 18:15:34 +02:00
|
|
|
Resdom *resdom;
|
|
|
|
Var *var;
|
2000-09-29 20:21:41 +02:00
|
|
|
TargetEntry *ctid;
|
1999-05-25 18:15:34 +02:00
|
|
|
|
|
|
|
resname = (char *) palloc(32);
|
2002-08-28 22:46:24 +02:00
|
|
|
snprintf(resname, 32, "ctid%u", rti);
|
1999-05-25 18:15:34 +02:00
|
|
|
resdom = makeResdom(length(tlist) + 1,
|
|
|
|
TIDOID,
|
|
|
|
-1,
|
|
|
|
resname,
|
|
|
|
true);
|
|
|
|
|
2000-09-29 20:21:41 +02:00
|
|
|
var = makeVar(rti,
|
|
|
|
SelfItemPointerAttributeNumber,
|
|
|
|
TIDOID,
|
|
|
|
-1,
|
|
|
|
0);
|
1999-05-25 18:15:34 +02:00
|
|
|
|
2002-12-12 16:49:42 +01:00
|
|
|
ctid = makeTargetEntry(resdom, (Expr *) var);
|
1999-05-25 18:15:34 +02:00
|
|
|
tlist = lappend(tlist, ctid);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-08-23 01:56:45 +02:00
|
|
|
/*
|
|
|
|
* Generate appropriate target list for subplan; may be different
|
|
|
|
* from tlist if grouping or aggregation is needed.
|
|
|
|
*/
|
2003-02-03 16:07:08 +01:00
|
|
|
sub_tlist = make_subplanTargetList(parse, tlist,
|
|
|
|
&groupColIdx, &need_tlist_eval);
|
1999-08-23 01:56:45 +02:00
|
|
|
|
2000-04-12 19:17:23 +02:00
|
|
|
/*
|
|
|
|
* Calculate pathkeys that represent grouping/ordering
|
|
|
|
* requirements
|
|
|
|
*/
|
2000-02-15 21:49:31 +01:00
|
|
|
group_pathkeys = make_pathkeys_for_sortclauses(parse->groupClause,
|
|
|
|
tlist);
|
|
|
|
sort_pathkeys = make_pathkeys_for_sortclauses(parse->sortClause,
|
|
|
|
tlist);
|
|
|
|
|
2002-11-20 00:22:00 +01:00
|
|
|
/*
|
|
|
|
* Will need actual number of aggregates for estimating costs.
|
|
|
|
* Also, it's possible that optimization has eliminated all
|
|
|
|
* aggregates, and we may as well check for that here.
|
2003-02-04 01:50:01 +01:00
|
|
|
*
|
|
|
|
* Note: we do not attempt to detect duplicate aggregates here;
|
|
|
|
* a somewhat-overestimated count is okay for our present purposes.
|
2002-11-20 00:22:00 +01:00
|
|
|
*/
|
|
|
|
if (parse->hasAggs)
|
|
|
|
{
|
2003-02-04 01:50:01 +01:00
|
|
|
numAggs = count_agg_clause((Node *) tlist) +
|
|
|
|
count_agg_clause(parse->havingQual);
|
2002-11-20 00:22:00 +01:00
|
|
|
if (numAggs == 0)
|
|
|
|
parse->hasAggs = false;
|
|
|
|
}
|
|
|
|
|
1999-08-21 05:49:17 +02:00
|
|
|
/*
|
|
|
|
* Figure out whether we need a sorted result from query_planner.
|
|
|
|
*
|
|
|
|
* If we have a GROUP BY clause, then we want a result sorted
|
2000-04-12 19:17:23 +02:00
|
|
|
* properly for grouping. Otherwise, if there is an ORDER BY
|
|
|
|
* clause, we want to sort by the ORDER BY clause. (Note: if we
|
|
|
|
* have both, and ORDER BY is a superset of GROUP BY, it would be
|
|
|
|
* tempting to request sort by ORDER BY --- but that might just
|
|
|
|
* leave us failing to exploit an available sort order at all.
|
|
|
|
* Needs more thought...)
|
1999-08-21 05:49:17 +02:00
|
|
|
*/
|
|
|
|
if (parse->groupClause)
|
2000-02-15 21:49:31 +01:00
|
|
|
parse->query_pathkeys = group_pathkeys;
|
|
|
|
else if (parse->sortClause)
|
|
|
|
parse->query_pathkeys = sort_pathkeys;
|
|
|
|
else
|
|
|
|
parse->query_pathkeys = NIL;
|
|
|
|
|
|
|
|
/*
|
2000-04-12 19:17:23 +02:00
|
|
|
* Figure out whether we expect to retrieve all the tuples that
|
2001-04-02 00:37:19 +02:00
|
|
|
* the plan can generate, or to stop early due to outside factors
|
|
|
|
* such as a cursor. If the caller passed a value >= 0, believe
|
|
|
|
* that value, else do our own examination of the query context.
|
2000-02-15 21:49:31 +01:00
|
|
|
*/
|
|
|
|
if (tuple_fraction < 0.0)
|
1999-08-21 05:49:17 +02:00
|
|
|
{
|
2000-02-15 21:49:31 +01:00
|
|
|
/* Initial assumption is we need all the tuples */
|
|
|
|
tuple_fraction = 0.0;
|
2000-04-12 19:17:23 +02:00
|
|
|
|
2000-02-15 21:49:31 +01:00
|
|
|
/*
|
2001-04-02 00:37:19 +02:00
|
|
|
* Check for retrieve-into-portal, ie DECLARE CURSOR.
|
|
|
|
*
|
|
|
|
* We have no real idea how many tuples the user will ultimately
|
|
|
|
* FETCH from a cursor, but it seems a good bet that he
|
|
|
|
* doesn't want 'em all. Optimize for 10% retrieval (you
|
|
|
|
* gotta better number? Should this be a SETtable parameter?)
|
|
|
|
*/
|
|
|
|
if (parse->isPortal)
|
|
|
|
tuple_fraction = 0.10;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Adjust tuple_fraction if we see that we are going to apply
|
|
|
|
* limiting/grouping/aggregation/etc. This is not overridable by
|
|
|
|
* the caller, since it reflects plan actions that this routine
|
|
|
|
* will certainly take, not assumptions about context.
|
|
|
|
*/
|
|
|
|
if (parse->limitCount != NULL)
|
|
|
|
{
|
|
|
|
/*
|
2001-10-25 07:50:21 +02:00
|
|
|
* A LIMIT clause limits the absolute number of tuples
|
|
|
|
* returned. However, if it's not a constant LIMIT then we
|
|
|
|
* have to punt; for lack of a better idea, assume 10% of the
|
|
|
|
* plan's result is wanted.
|
2000-02-15 21:49:31 +01:00
|
|
|
*/
|
2001-10-25 07:50:21 +02:00
|
|
|
double limit_fraction = 0.0;
|
2001-04-02 00:37:19 +02:00
|
|
|
|
|
|
|
if (IsA(parse->limitCount, Const))
|
2000-02-15 21:49:31 +01:00
|
|
|
{
|
2001-04-02 00:37:19 +02:00
|
|
|
Const *limitc = (Const *) parse->limitCount;
|
|
|
|
int32 count = DatumGetInt32(limitc->constvalue);
|
|
|
|
|
|
|
|
/*
|
2001-10-25 07:50:21 +02:00
|
|
|
* A NULL-constant LIMIT represents "LIMIT ALL", which we
|
|
|
|
* treat the same as no limit (ie, expect to retrieve all
|
|
|
|
* the tuples).
|
2001-04-02 00:37:19 +02:00
|
|
|
*/
|
|
|
|
if (!limitc->constisnull && count > 0)
|
2000-02-15 21:49:31 +01:00
|
|
|
{
|
2001-04-02 00:37:19 +02:00
|
|
|
limit_fraction = (double) count;
|
|
|
|
/* We must also consider the OFFSET, if present */
|
|
|
|
if (parse->limitOffset != NULL)
|
2000-02-21 02:13:04 +01:00
|
|
|
{
|
2001-04-02 00:37:19 +02:00
|
|
|
if (IsA(parse->limitOffset, Const))
|
|
|
|
{
|
|
|
|
int32 offset;
|
|
|
|
|
|
|
|
limitc = (Const *) parse->limitOffset;
|
|
|
|
offset = DatumGetInt32(limitc->constvalue);
|
|
|
|
if (!limitc->constisnull && offset > 0)
|
|
|
|
limit_fraction += (double) offset;
|
|
|
|
}
|
|
|
|
else
|
2000-02-21 02:13:04 +01:00
|
|
|
{
|
2001-04-02 00:37:19 +02:00
|
|
|
/* OFFSET is an expression ... punt ... */
|
|
|
|
limit_fraction = 0.10;
|
2000-02-21 02:13:04 +01:00
|
|
|
}
|
|
|
|
}
|
2000-02-15 21:49:31 +01:00
|
|
|
}
|
2001-04-02 00:37:19 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* LIMIT is an expression ... punt ... */
|
|
|
|
limit_fraction = 0.10;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (limit_fraction > 0.0)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* If we have absolute limits from both caller and LIMIT,
|
2001-10-25 07:50:21 +02:00
|
|
|
* use the smaller value; if one is fractional and the
|
|
|
|
* other absolute, treat the fraction as a fraction of the
|
|
|
|
* absolute value; else we can multiply the two fractions
|
|
|
|
* together.
|
2001-04-02 00:37:19 +02:00
|
|
|
*/
|
|
|
|
if (tuple_fraction >= 1.0)
|
|
|
|
{
|
|
|
|
if (limit_fraction >= 1.0)
|
|
|
|
{
|
|
|
|
/* both absolute */
|
|
|
|
tuple_fraction = Min(tuple_fraction, limit_fraction);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* caller absolute, limit fractional */
|
|
|
|
tuple_fraction *= limit_fraction;
|
|
|
|
if (tuple_fraction < 1.0)
|
|
|
|
tuple_fraction = 1.0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (tuple_fraction > 0.0)
|
|
|
|
{
|
|
|
|
if (limit_fraction >= 1.0)
|
|
|
|
{
|
|
|
|
/* caller fractional, limit absolute */
|
|
|
|
tuple_fraction *= limit_fraction;
|
|
|
|
if (tuple_fraction < 1.0)
|
|
|
|
tuple_fraction = 1.0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* both fractional */
|
|
|
|
tuple_fraction *= limit_fraction;
|
|
|
|
}
|
|
|
|
}
|
2000-02-15 21:49:31 +01:00
|
|
|
else
|
|
|
|
{
|
2001-04-02 00:37:19 +02:00
|
|
|
/* no info from caller, just use limit */
|
|
|
|
tuple_fraction = limit_fraction;
|
2000-02-15 21:49:31 +01:00
|
|
|
}
|
|
|
|
}
|
1999-08-21 05:49:17 +02:00
|
|
|
}
|
2000-04-12 19:17:23 +02:00
|
|
|
|
2002-11-21 01:42:20 +01:00
|
|
|
/*
|
|
|
|
* With grouping or aggregation, the tuple fraction to pass to
|
|
|
|
* query_planner() may be different from what it is at top level.
|
|
|
|
*/
|
|
|
|
sub_tuple_fraction = tuple_fraction;
|
|
|
|
|
2000-02-15 21:49:31 +01:00
|
|
|
if (parse->groupClause)
|
1999-08-21 05:49:17 +02:00
|
|
|
{
|
2000-02-15 21:49:31 +01:00
|
|
|
/*
|
|
|
|
* In GROUP BY mode, we have the little problem that we don't
|
|
|
|
* really know how many input tuples will be needed to make a
|
|
|
|
* group, so we can't translate an output LIMIT count into an
|
2000-03-14 03:23:15 +01:00
|
|
|
* input count. For lack of a better idea, assume 25% of the
|
2000-02-15 21:49:31 +01:00
|
|
|
* input data will be processed if there is any output limit.
|
2000-03-14 03:23:15 +01:00
|
|
|
* However, if the caller gave us a fraction rather than an
|
2000-04-12 19:17:23 +02:00
|
|
|
* absolute count, we can keep using that fraction (which
|
|
|
|
* amounts to assuming that all the groups are about the same
|
|
|
|
* size).
|
2000-02-15 21:49:31 +01:00
|
|
|
*/
|
2002-11-21 01:42:20 +01:00
|
|
|
if (sub_tuple_fraction >= 1.0)
|
|
|
|
sub_tuple_fraction = 0.25;
|
2000-04-12 19:17:23 +02:00
|
|
|
|
2000-02-15 21:49:31 +01:00
|
|
|
/*
|
|
|
|
* If both GROUP BY and ORDER BY are specified, we will need
|
|
|
|
* two levels of sort --- and, therefore, certainly need to
|
|
|
|
* read all the input tuples --- unless ORDER BY is a subset
|
2000-12-14 23:30:45 +01:00
|
|
|
* of GROUP BY. (We have not yet canonicalized the pathkeys,
|
|
|
|
* so must use the slower noncanonical comparison method.)
|
2000-02-15 21:49:31 +01:00
|
|
|
*/
|
|
|
|
if (parse->groupClause && parse->sortClause &&
|
2000-12-14 23:30:45 +01:00
|
|
|
!noncanonical_pathkeys_contained_in(sort_pathkeys,
|
|
|
|
group_pathkeys))
|
2002-11-21 01:42:20 +01:00
|
|
|
sub_tuple_fraction = 0.0;
|
1999-08-21 05:49:17 +02:00
|
|
|
}
|
2000-02-15 21:49:31 +01:00
|
|
|
else if (parse->hasAggs)
|
1999-08-21 05:49:17 +02:00
|
|
|
{
|
2000-04-12 19:17:23 +02:00
|
|
|
/*
|
|
|
|
* Ungrouped aggregate will certainly want all the input
|
|
|
|
* tuples.
|
|
|
|
*/
|
2002-11-21 01:42:20 +01:00
|
|
|
sub_tuple_fraction = 0.0;
|
2000-02-15 21:49:31 +01:00
|
|
|
}
|
|
|
|
else if (parse->distinctClause)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* SELECT DISTINCT, like GROUP, will absorb an unpredictable
|
2000-04-12 19:17:23 +02:00
|
|
|
* number of input tuples per output tuple. Handle the same
|
|
|
|
* way.
|
2000-02-15 21:49:31 +01:00
|
|
|
*/
|
2002-11-21 01:42:20 +01:00
|
|
|
if (sub_tuple_fraction >= 1.0)
|
|
|
|
sub_tuple_fraction = 0.25;
|
1999-08-21 05:49:17 +02:00
|
|
|
}
|
|
|
|
|
2000-04-12 19:17:23 +02:00
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* Generate the best unsorted and presorted paths for this Query
|
|
|
|
* (but note there may not be any presorted path).
|
1999-08-21 05:49:17 +02:00
|
|
|
*/
|
2002-11-21 01:42:20 +01:00
|
|
|
query_planner(parse, sub_tlist, sub_tuple_fraction,
|
2002-11-06 01:00:45 +01:00
|
|
|
&cheapest_path, &sorted_path);
|
1997-12-20 08:59:44 +01:00
|
|
|
|
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* We couldn't canonicalize group_pathkeys and sort_pathkeys before
|
|
|
|
* running query_planner(), so do it now.
|
1997-12-20 08:59:44 +01:00
|
|
|
*/
|
2002-11-06 01:00:45 +01:00
|
|
|
group_pathkeys = canonicalize_pathkeys(parse, group_pathkeys);
|
|
|
|
sort_pathkeys = canonicalize_pathkeys(parse, sort_pathkeys);
|
1997-12-20 08:59:44 +01:00
|
|
|
|
2002-11-06 23:31:24 +01:00
|
|
|
/*
|
|
|
|
* Consider whether we might want to use hashed grouping.
|
|
|
|
*/
|
|
|
|
if (parse->groupClause)
|
|
|
|
{
|
2003-01-20 19:55:07 +01:00
|
|
|
List *groupExprs;
|
|
|
|
|
2002-11-20 00:22:00 +01:00
|
|
|
/*
|
2002-11-21 01:42:20 +01:00
|
|
|
* Always estimate the number of groups. We can't do this until
|
|
|
|
* after running query_planner(), either.
|
2002-11-20 00:22:00 +01:00
|
|
|
*/
|
2003-01-20 19:55:07 +01:00
|
|
|
groupExprs = get_sortgrouplist_exprs(parse->groupClause,
|
|
|
|
parse->targetList);
|
2002-11-20 00:22:00 +01:00
|
|
|
dNumGroups = estimate_num_groups(parse,
|
2003-01-20 19:55:07 +01:00
|
|
|
groupExprs,
|
2002-11-20 00:22:00 +01:00
|
|
|
cheapest_path->parent->rows);
|
2002-11-21 01:42:20 +01:00
|
|
|
/* Also want it as a long int --- but 'ware overflow! */
|
2002-11-20 00:22:00 +01:00
|
|
|
numGroups = (long) Min(dNumGroups, (double) LONG_MAX);
|
|
|
|
|
2002-11-06 23:31:24 +01:00
|
|
|
/*
|
2002-11-29 22:39:12 +01:00
|
|
|
* Check can't-do-it conditions, including whether the grouping
|
|
|
|
* operators are hashjoinable.
|
|
|
|
*
|
2002-11-06 23:31:24 +01:00
|
|
|
* Executor doesn't support hashed aggregation with DISTINCT
|
|
|
|
* aggregates. (Doing so would imply storing *all* the input
|
|
|
|
* values in the hash table, which seems like a certain loser.)
|
|
|
|
*/
|
2002-11-29 22:39:12 +01:00
|
|
|
if (!enable_hashagg || !hash_safe_grouping(parse))
|
2002-11-21 01:42:20 +01:00
|
|
|
use_hashed_grouping = false;
|
|
|
|
else if (parse->hasAggs &&
|
|
|
|
(contain_distinct_agg_clause((Node *) tlist) ||
|
|
|
|
contain_distinct_agg_clause(parse->havingQual)))
|
2002-11-06 23:31:24 +01:00
|
|
|
use_hashed_grouping = false;
|
|
|
|
else
|
|
|
|
{
|
2002-11-20 00:22:00 +01:00
|
|
|
/*
|
|
|
|
* Use hashed grouping if (a) we think we can fit the
|
|
|
|
* hashtable into SortMem, *and* (b) the estimated cost
|
|
|
|
* is no more than doing it the other way. While avoiding
|
|
|
|
* the need for sorted input is usually a win, the fact
|
|
|
|
* that the output won't be sorted may be a loss; so we
|
|
|
|
* need to do an actual cost comparison.
|
|
|
|
*
|
|
|
|
* In most cases we have no good way to estimate the size of
|
|
|
|
* the transition value needed by an aggregate; arbitrarily
|
|
|
|
* assume it is 100 bytes. Also set the overhead per hashtable
|
|
|
|
* entry at 64 bytes.
|
|
|
|
*/
|
|
|
|
int hashentrysize = cheapest_path->parent->width + 64 +
|
|
|
|
numAggs * 100;
|
|
|
|
|
|
|
|
if (hashentrysize * dNumGroups <= SortMem * 1024L)
|
|
|
|
{
|
2002-11-21 01:42:20 +01:00
|
|
|
/*
|
|
|
|
* Okay, do the cost comparison. We need to consider
|
|
|
|
* cheapest_path + hashagg [+ final sort]
|
|
|
|
* versus either
|
|
|
|
* cheapest_path [+ sort] + group or agg [+ final sort]
|
|
|
|
* or
|
|
|
|
* presorted_path + group or agg [+ final sort]
|
|
|
|
* where brackets indicate a step that may not be needed.
|
|
|
|
* We assume query_planner() will have returned a
|
|
|
|
* presorted path only if it's a winner compared to
|
|
|
|
* cheapest_path for this purpose.
|
|
|
|
*
|
|
|
|
* These path variables are dummies that just hold cost
|
|
|
|
* fields; we don't make actual Paths for these steps.
|
|
|
|
*/
|
|
|
|
Path hashed_p;
|
|
|
|
Path sorted_p;
|
|
|
|
|
|
|
|
cost_agg(&hashed_p, parse,
|
|
|
|
AGG_HASHED, numAggs,
|
|
|
|
numGroupCols, dNumGroups,
|
|
|
|
cheapest_path->startup_cost,
|
|
|
|
cheapest_path->total_cost,
|
|
|
|
cheapest_path->parent->rows);
|
|
|
|
/* Result of hashed agg is always unsorted */
|
|
|
|
if (sort_pathkeys)
|
|
|
|
cost_sort(&hashed_p, parse, sort_pathkeys,
|
|
|
|
hashed_p.total_cost,
|
|
|
|
dNumGroups,
|
|
|
|
cheapest_path->parent->width);
|
|
|
|
|
|
|
|
if (sorted_path)
|
|
|
|
{
|
|
|
|
sorted_p.startup_cost = sorted_path->startup_cost;
|
|
|
|
sorted_p.total_cost = sorted_path->total_cost;
|
|
|
|
current_pathkeys = sorted_path->pathkeys;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
sorted_p.startup_cost = cheapest_path->startup_cost;
|
|
|
|
sorted_p.total_cost = cheapest_path->total_cost;
|
|
|
|
current_pathkeys = cheapest_path->pathkeys;
|
|
|
|
}
|
|
|
|
if (!pathkeys_contained_in(group_pathkeys,
|
|
|
|
current_pathkeys))
|
|
|
|
{
|
|
|
|
cost_sort(&sorted_p, parse, group_pathkeys,
|
|
|
|
sorted_p.total_cost,
|
|
|
|
cheapest_path->parent->rows,
|
|
|
|
cheapest_path->parent->width);
|
|
|
|
current_pathkeys = group_pathkeys;
|
|
|
|
}
|
|
|
|
if (parse->hasAggs)
|
|
|
|
cost_agg(&sorted_p, parse,
|
|
|
|
AGG_SORTED, numAggs,
|
|
|
|
numGroupCols, dNumGroups,
|
|
|
|
sorted_p.startup_cost,
|
|
|
|
sorted_p.total_cost,
|
|
|
|
cheapest_path->parent->rows);
|
|
|
|
else
|
|
|
|
cost_group(&sorted_p, parse,
|
|
|
|
numGroupCols, dNumGroups,
|
|
|
|
sorted_p.startup_cost,
|
|
|
|
sorted_p.total_cost,
|
|
|
|
cheapest_path->parent->rows);
|
|
|
|
/* The Agg or Group node will preserve ordering */
|
|
|
|
if (sort_pathkeys &&
|
|
|
|
!pathkeys_contained_in(sort_pathkeys,
|
|
|
|
current_pathkeys))
|
|
|
|
{
|
|
|
|
cost_sort(&sorted_p, parse, sort_pathkeys,
|
|
|
|
sorted_p.total_cost,
|
|
|
|
dNumGroups,
|
|
|
|
cheapest_path->parent->width);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now make the decision using the top-level tuple
|
|
|
|
* fraction. First we have to convert an absolute
|
|
|
|
* count (LIMIT) into fractional form.
|
|
|
|
*/
|
|
|
|
if (tuple_fraction >= 1.0)
|
|
|
|
tuple_fraction /= dNumGroups;
|
|
|
|
|
|
|
|
if (compare_fractional_path_costs(&hashed_p, &sorted_p,
|
2003-02-15 22:39:58 +01:00
|
|
|
tuple_fraction) < 0)
|
2002-11-21 01:42:20 +01:00
|
|
|
{
|
|
|
|
/* Hashed is cheaper, so use it */
|
|
|
|
use_hashed_grouping = true;
|
|
|
|
}
|
2002-11-20 00:22:00 +01:00
|
|
|
}
|
2002-11-06 23:31:24 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-05-25 18:15:34 +02:00
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* Select the best path and create a plan to execute it.
|
|
|
|
*
|
2002-11-21 01:42:20 +01:00
|
|
|
* If we are doing hashed grouping, we will always read all the
|
|
|
|
* input tuples, so use the cheapest-total path. Otherwise,
|
|
|
|
* trust query_planner's decision about which to use.
|
1999-05-03 02:38:44 +02:00
|
|
|
*/
|
2002-11-21 01:42:20 +01:00
|
|
|
if (sorted_path && !use_hashed_grouping)
|
2002-11-06 01:00:45 +01:00
|
|
|
{
|
2002-11-21 01:42:20 +01:00
|
|
|
result_plan = create_plan(parse, sorted_path);
|
|
|
|
current_pathkeys = sorted_path->pathkeys;
|
2002-11-06 01:00:45 +01:00
|
|
|
}
|
1999-08-21 05:49:17 +02:00
|
|
|
else
|
2002-11-06 01:00:45 +01:00
|
|
|
{
|
|
|
|
result_plan = create_plan(parse, cheapest_path);
|
|
|
|
current_pathkeys = cheapest_path->pathkeys;
|
|
|
|
}
|
1999-05-03 02:38:44 +02:00
|
|
|
|
1999-08-23 01:56:45 +02:00
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* create_plan() returns a plan with just a "flat" tlist of required
|
2003-02-03 16:07:08 +01:00
|
|
|
* Vars. Usually we need to insert the sub_tlist as the tlist of the
|
|
|
|
* top plan node. However, we can skip that if we determined that
|
|
|
|
* whatever query_planner chose to return will be good enough.
|
1999-08-23 01:56:45 +02:00
|
|
|
*/
|
2003-02-03 16:07:08 +01:00
|
|
|
if (need_tlist_eval)
|
1999-08-23 01:56:45 +02:00
|
|
|
{
|
2003-02-03 16:07:08 +01:00
|
|
|
/*
|
|
|
|
* If the top-level plan node is one that cannot do expression
|
|
|
|
* evaluation, we must insert a Result node to project the desired
|
|
|
|
* tlist.
|
|
|
|
* Currently, the only plan node we might see here that falls into
|
|
|
|
* that category is Append.
|
|
|
|
*/
|
|
|
|
if (IsA(result_plan, Append))
|
|
|
|
{
|
|
|
|
result_plan = (Plan *) make_result(sub_tlist, NULL,
|
|
|
|
result_plan);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Otherwise, just replace the subplan's flat tlist with
|
|
|
|
* the desired tlist.
|
|
|
|
*/
|
|
|
|
result_plan->targetlist = sub_tlist;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Also, account for the cost of evaluation of the sub_tlist.
|
|
|
|
*
|
|
|
|
* Up to now, we have only been dealing with "flat" tlists,
|
|
|
|
* containing just Vars. So their evaluation cost is zero
|
|
|
|
* according to the model used by cost_qual_eval() (or if you
|
|
|
|
* prefer, the cost is factored into cpu_tuple_cost). Thus we can
|
|
|
|
* avoid accounting for tlist cost throughout query_planner() and
|
|
|
|
* subroutines. But now we've inserted a tlist that might contain
|
|
|
|
* actual operators, sub-selects, etc --- so we'd better account
|
|
|
|
* for its cost.
|
|
|
|
*
|
|
|
|
* Below this point, any tlist eval cost for added-on nodes should
|
|
|
|
* be accounted for as we create those nodes. Presently, of the
|
|
|
|
* node types we can add on, only Agg and Group project new tlists
|
|
|
|
* (the rest just copy their input tuples) --- so make_agg() and
|
|
|
|
* make_group() are responsible for computing the added cost.
|
|
|
|
*/
|
|
|
|
cost_qual_eval(&tlist_cost, sub_tlist);
|
|
|
|
result_plan->startup_cost += tlist_cost.startup;
|
|
|
|
result_plan->total_cost += tlist_cost.startup +
|
|
|
|
tlist_cost.per_tuple * result_plan->plan_rows;
|
1999-08-23 01:56:45 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2000-04-12 19:17:23 +02:00
|
|
|
/*
|
2003-02-03 16:07:08 +01:00
|
|
|
* Since we're using query_planner's tlist and not the one
|
|
|
|
* make_subplanTargetList calculated, we have to refigure
|
|
|
|
* any grouping-column indexes make_subplanTargetList computed.
|
1999-08-23 01:56:45 +02:00
|
|
|
*/
|
2003-02-03 16:07:08 +01:00
|
|
|
locate_grouping_columns(parse, tlist, result_plan->targetlist,
|
|
|
|
groupColIdx);
|
1999-08-23 01:56:45 +02:00
|
|
|
}
|
|
|
|
|
2002-11-06 01:00:45 +01:00
|
|
|
/*
|
2002-11-06 23:31:24 +01:00
|
|
|
* Insert AGG or GROUP node if needed, plus an explicit sort step
|
|
|
|
* if necessary.
|
2002-11-06 01:00:45 +01:00
|
|
|
*
|
|
|
|
* HAVING clause, if any, becomes qual of the Agg node
|
|
|
|
*/
|
2002-11-06 23:31:24 +01:00
|
|
|
if (use_hashed_grouping)
|
2002-11-06 01:00:45 +01:00
|
|
|
{
|
2002-11-06 23:31:24 +01:00
|
|
|
/* Hashed aggregate plan --- no sort needed */
|
2002-11-21 01:42:20 +01:00
|
|
|
result_plan = (Plan *) make_agg(parse,
|
|
|
|
tlist,
|
2002-11-06 23:31:24 +01:00
|
|
|
(List *) parse->havingQual,
|
|
|
|
AGG_HASHED,
|
2002-11-21 01:42:20 +01:00
|
|
|
numGroupCols,
|
2002-11-06 23:31:24 +01:00
|
|
|
groupColIdx,
|
2002-11-20 00:22:00 +01:00
|
|
|
numGroups,
|
|
|
|
numAggs,
|
2002-11-06 23:31:24 +01:00
|
|
|
result_plan);
|
|
|
|
/* Hashed aggregation produces randomly-ordered results */
|
|
|
|
current_pathkeys = NIL;
|
|
|
|
}
|
|
|
|
else if (parse->hasAggs)
|
|
|
|
{
|
|
|
|
/* Plain aggregate plan --- sort if needed */
|
2002-11-06 01:00:45 +01:00
|
|
|
AggStrategy aggstrategy;
|
1997-12-20 08:59:44 +01:00
|
|
|
|
2002-11-06 01:00:45 +01:00
|
|
|
if (parse->groupClause)
|
|
|
|
{
|
|
|
|
if (!pathkeys_contained_in(group_pathkeys, current_pathkeys))
|
|
|
|
{
|
|
|
|
result_plan = make_groupsortplan(parse,
|
|
|
|
parse->groupClause,
|
|
|
|
groupColIdx,
|
|
|
|
result_plan);
|
|
|
|
current_pathkeys = group_pathkeys;
|
|
|
|
}
|
2002-11-06 23:31:24 +01:00
|
|
|
aggstrategy = AGG_SORTED;
|
|
|
|
/*
|
|
|
|
* The AGG node will not change the sort ordering of its
|
|
|
|
* groups, so current_pathkeys describes the result too.
|
|
|
|
*/
|
2002-11-06 01:00:45 +01:00
|
|
|
}
|
|
|
|
else
|
2002-11-06 23:31:24 +01:00
|
|
|
{
|
2002-11-06 01:00:45 +01:00
|
|
|
aggstrategy = AGG_PLAIN;
|
2002-11-06 23:31:24 +01:00
|
|
|
/* Result will be only one row anyway; no sort order */
|
|
|
|
current_pathkeys = NIL;
|
|
|
|
}
|
2002-11-06 01:00:45 +01:00
|
|
|
|
2002-11-21 01:42:20 +01:00
|
|
|
result_plan = (Plan *) make_agg(parse,
|
|
|
|
tlist,
|
2002-11-06 01:00:45 +01:00
|
|
|
(List *) parse->havingQual,
|
|
|
|
aggstrategy,
|
2002-11-21 01:42:20 +01:00
|
|
|
numGroupCols,
|
2002-11-06 01:00:45 +01:00
|
|
|
groupColIdx,
|
2002-11-20 00:22:00 +01:00
|
|
|
numGroups,
|
|
|
|
numAggs,
|
2002-11-06 01:00:45 +01:00
|
|
|
result_plan);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* If there are no Aggs, we shouldn't have any HAVING qual anymore
|
|
|
|
*/
|
|
|
|
Assert(parse->havingQual == NULL);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we have a GROUP BY clause, insert a group node (plus the
|
|
|
|
* appropriate sort node, if necessary).
|
|
|
|
*/
|
|
|
|
if (parse->groupClause)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Add an explicit sort if we couldn't make the path come out
|
|
|
|
* the way the GROUP node needs it.
|
|
|
|
*/
|
|
|
|
if (!pathkeys_contained_in(group_pathkeys, current_pathkeys))
|
|
|
|
{
|
|
|
|
result_plan = make_groupsortplan(parse,
|
|
|
|
parse->groupClause,
|
|
|
|
groupColIdx,
|
|
|
|
result_plan);
|
|
|
|
current_pathkeys = group_pathkeys;
|
|
|
|
}
|
|
|
|
|
2002-11-21 01:42:20 +01:00
|
|
|
result_plan = (Plan *) make_group(parse,
|
|
|
|
tlist,
|
|
|
|
numGroupCols,
|
2002-11-06 01:00:45 +01:00
|
|
|
groupColIdx,
|
2002-11-20 00:22:00 +01:00
|
|
|
dNumGroups,
|
2002-11-06 01:00:45 +01:00
|
|
|
result_plan);
|
2002-11-21 01:42:20 +01:00
|
|
|
/* The Group node won't change sort ordering */
|
2002-11-06 01:00:45 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} /* end of if (setOperations) */
|
1999-01-25 13:01:19 +01:00
|
|
|
|
1997-09-07 07:04:48 +02:00
|
|
|
/*
|
1999-08-21 05:49:17 +02:00
|
|
|
* If we were not able to make the plan come out in the right order,
|
|
|
|
* add an explicit sort step.
|
1997-09-07 07:04:48 +02:00
|
|
|
*/
|
1999-08-23 01:56:45 +02:00
|
|
|
if (parse->sortClause)
|
1997-09-07 07:04:48 +02:00
|
|
|
{
|
2000-04-12 19:17:23 +02:00
|
|
|
if (!pathkeys_contained_in(sort_pathkeys, current_pathkeys))
|
2003-02-15 21:12:41 +01:00
|
|
|
{
|
2003-01-20 19:55:07 +01:00
|
|
|
result_plan = (Plan *) make_sort_from_sortclauses(parse,
|
|
|
|
tlist,
|
|
|
|
result_plan,
|
|
|
|
parse->sortClause);
|
2003-02-15 21:12:41 +01:00
|
|
|
current_pathkeys = sort_pathkeys;
|
|
|
|
}
|
1997-09-07 07:04:48 +02:00
|
|
|
}
|
1999-08-21 05:49:17 +02:00
|
|
|
|
|
|
|
/*
|
2000-10-26 23:38:24 +02:00
|
|
|
* If there is a DISTINCT clause, add the UNIQUE node.
|
1999-08-21 05:49:17 +02:00
|
|
|
*/
|
2000-01-27 19:11:50 +01:00
|
|
|
if (parse->distinctClause)
|
1997-09-07 07:04:48 +02:00
|
|
|
{
|
1999-08-21 05:49:17 +02:00
|
|
|
result_plan = (Plan *) make_unique(tlist, result_plan,
|
2000-01-27 19:11:50 +01:00
|
|
|
parse->distinctClause);
|
2002-11-20 00:22:00 +01:00
|
|
|
/*
|
|
|
|
* If there was grouping or aggregation, leave plan_rows as-is
|
|
|
|
* (ie, assume the result was already mostly unique). If not,
|
|
|
|
* it's reasonable to assume the UNIQUE filter has effects
|
|
|
|
* comparable to GROUP BY.
|
|
|
|
*/
|
|
|
|
if (!parse->groupClause && !parse->hasAggs)
|
2003-01-20 19:55:07 +01:00
|
|
|
{
|
|
|
|
List *distinctExprs;
|
|
|
|
|
|
|
|
distinctExprs = get_sortgrouplist_exprs(parse->distinctClause,
|
|
|
|
parse->targetList);
|
2002-11-20 00:22:00 +01:00
|
|
|
result_plan->plan_rows = estimate_num_groups(parse,
|
2003-01-20 19:55:07 +01:00
|
|
|
distinctExprs,
|
2002-11-20 00:22:00 +01:00
|
|
|
result_plan->plan_rows);
|
2003-01-20 19:55:07 +01:00
|
|
|
}
|
1997-09-07 07:04:48 +02:00
|
|
|
}
|
1996-07-09 08:22:35 +02:00
|
|
|
|
2000-10-26 23:38:24 +02:00
|
|
|
/*
|
|
|
|
* Finally, if there is a LIMIT/OFFSET clause, add the LIMIT node.
|
|
|
|
*/
|
|
|
|
if (parse->limitOffset || parse->limitCount)
|
|
|
|
{
|
|
|
|
result_plan = (Plan *) make_limit(tlist, result_plan,
|
|
|
|
parse->limitOffset,
|
|
|
|
parse->limitCount);
|
|
|
|
}
|
|
|
|
|
2003-02-15 21:12:41 +01:00
|
|
|
/*
|
|
|
|
* Return the actual output ordering in query_pathkeys for possible
|
|
|
|
* use by an outer query level.
|
|
|
|
*/
|
|
|
|
parse->query_pathkeys = current_pathkeys;
|
|
|
|
|
1999-08-21 05:49:17 +02:00
|
|
|
return result_plan;
|
1996-07-09 08:22:35 +02:00
|
|
|
}
|
|
|
|
|
2002-11-29 22:39:12 +01:00
|
|
|
/*
|
|
|
|
* hash_safe_grouping - are grouping operators hashable?
|
|
|
|
*
|
|
|
|
* We assume hashed aggregation will work if the datatype's equality operator
|
|
|
|
* is marked hashjoinable.
|
|
|
|
*/
|
|
|
|
static bool
|
|
|
|
hash_safe_grouping(Query *parse)
|
|
|
|
{
|
|
|
|
List *gl;
|
|
|
|
|
|
|
|
foreach(gl, parse->groupClause)
|
|
|
|
{
|
|
|
|
GroupClause *grpcl = (GroupClause *) lfirst(gl);
|
|
|
|
TargetEntry *tle = get_sortgroupclause_tle(grpcl, parse->targetList);
|
|
|
|
Operator optup;
|
|
|
|
bool oprcanhash;
|
|
|
|
|
|
|
|
optup = equality_oper(tle->resdom->restype, false);
|
|
|
|
oprcanhash = ((Form_pg_operator) GETSTRUCT(optup))->oprcanhash;
|
|
|
|
ReleaseSysCache(optup);
|
|
|
|
if (!oprcanhash)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
1999-05-03 02:38:44 +02:00
|
|
|
/*---------------
|
|
|
|
* make_subplanTargetList
|
1999-08-21 05:49:17 +02:00
|
|
|
* Generate appropriate target list when grouping is required.
|
1999-05-03 02:38:44 +02:00
|
|
|
*
|
2002-11-06 01:00:45 +01:00
|
|
|
* When grouping_planner inserts Aggregate or Group plan nodes above
|
1999-08-21 05:49:17 +02:00
|
|
|
* the result of query_planner, we typically want to pass a different
|
1999-05-03 02:38:44 +02:00
|
|
|
* target list to query_planner than the outer plan nodes should have.
|
1999-08-21 05:49:17 +02:00
|
|
|
* This routine generates the correct target list for the subplan.
|
1999-05-03 02:38:44 +02:00
|
|
|
*
|
|
|
|
* The initial target list passed from the parser already contains entries
|
|
|
|
* for all ORDER BY and GROUP BY expressions, but it will not have entries
|
|
|
|
* for variables used only in HAVING clauses; so we need to add those
|
|
|
|
* variables to the subplan target list. Also, if we are doing either
|
|
|
|
* grouping or aggregation, we flatten all expressions except GROUP BY items
|
|
|
|
* into their component variables; the other expressions will be computed by
|
|
|
|
* the inserted nodes rather than by the subplan. For example,
|
|
|
|
* given a query like
|
|
|
|
* SELECT a+b,SUM(c+d) FROM table GROUP BY a+b;
|
|
|
|
* we want to pass this targetlist to the subplan:
|
1999-08-21 05:49:17 +02:00
|
|
|
* a,b,c,d,a+b
|
1999-05-03 02:38:44 +02:00
|
|
|
* where the a+b target will be used by the Sort/Group steps, and the
|
2000-04-12 19:17:23 +02:00
|
|
|
* other targets will be used for computing the final results. (In the
|
1999-08-21 05:49:17 +02:00
|
|
|
* above example we could theoretically suppress the a and b targets and
|
2001-10-30 20:58:58 +01:00
|
|
|
* pass down only c,d,a+b, but it's not really worth the trouble to
|
|
|
|
* eliminate simple var references from the subplan. We will avoid doing
|
|
|
|
* the extra computation to recompute a+b at the outer level; see
|
|
|
|
* replace_vars_with_subplan_refs() in setrefs.c.)
|
1999-05-03 02:38:44 +02:00
|
|
|
*
|
2003-02-03 16:07:08 +01:00
|
|
|
* If we are grouping or aggregating, *and* there are no non-Var grouping
|
|
|
|
* expressions, then the returned tlist is effectively dummy; we do not
|
|
|
|
* need to force it to be evaluated, because all the Vars it contains
|
|
|
|
* should be present in the output of query_planner anyway.
|
|
|
|
*
|
1999-05-03 02:38:44 +02:00
|
|
|
* 'parse' is the query being processed.
|
1999-08-21 05:49:17 +02:00
|
|
|
* 'tlist' is the query's target list.
|
1999-05-03 02:38:44 +02:00
|
|
|
* 'groupColIdx' receives an array of column numbers for the GROUP BY
|
2003-02-03 16:07:08 +01:00
|
|
|
* expressions (if there are any) in the subplan's target list.
|
|
|
|
* 'need_tlist_eval' is set true if we really need to evaluate the
|
|
|
|
* result tlist.
|
1999-05-03 02:38:44 +02:00
|
|
|
*
|
1999-08-21 05:49:17 +02:00
|
|
|
* The result is the targetlist to be passed to the subplan.
|
1999-05-03 02:38:44 +02:00
|
|
|
*---------------
|
|
|
|
*/
|
|
|
|
static List *
|
|
|
|
make_subplanTargetList(Query *parse,
|
|
|
|
List *tlist,
|
2003-02-03 16:07:08 +01:00
|
|
|
AttrNumber **groupColIdx,
|
|
|
|
bool *need_tlist_eval)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
|
|
|
List *sub_tlist;
|
1999-08-21 05:49:17 +02:00
|
|
|
List *extravars;
|
1999-05-03 02:38:44 +02:00
|
|
|
int numCols;
|
|
|
|
|
|
|
|
*groupColIdx = NULL;
|
|
|
|
|
1999-05-25 18:15:34 +02:00
|
|
|
/*
|
|
|
|
* If we're not grouping or aggregating, nothing to do here;
|
1999-05-03 02:38:44 +02:00
|
|
|
* query_planner should receive the unmodified target list.
|
|
|
|
*/
|
|
|
|
if (!parse->hasAggs && !parse->groupClause && !parse->havingQual)
|
2003-02-03 16:07:08 +01:00
|
|
|
{
|
|
|
|
*need_tlist_eval = true;
|
1999-05-03 02:38:44 +02:00
|
|
|
return tlist;
|
2003-02-03 16:07:08 +01:00
|
|
|
}
|
1999-05-03 02:38:44 +02:00
|
|
|
|
1999-05-25 18:15:34 +02:00
|
|
|
/*
|
1999-08-21 05:49:17 +02:00
|
|
|
* Otherwise, start with a "flattened" tlist (having just the vars
|
1999-08-26 07:09:06 +02:00
|
|
|
* mentioned in the targetlist and HAVING qual --- but not upper-
|
|
|
|
* level Vars; they will be replaced by Params later on).
|
1999-05-03 02:38:44 +02:00
|
|
|
*/
|
1999-08-21 05:49:17 +02:00
|
|
|
sub_tlist = flatten_tlist(tlist);
|
1999-08-26 07:09:06 +02:00
|
|
|
extravars = pull_var_clause(parse->havingQual, false);
|
1999-08-21 05:49:17 +02:00
|
|
|
sub_tlist = add_to_flat_tlist(sub_tlist, extravars);
|
|
|
|
freeList(extravars);
|
2003-02-03 16:07:08 +01:00
|
|
|
*need_tlist_eval = false; /* only eval if not flat tlist */
|
1999-05-03 02:38:44 +02:00
|
|
|
|
|
|
|
/*
|
1999-08-21 05:49:17 +02:00
|
|
|
* If grouping, create sub_tlist entries for all GROUP BY expressions
|
2000-04-12 19:17:23 +02:00
|
|
|
* (GROUP BY items that are simple Vars should be in the list
|
|
|
|
* already), and make an array showing where the group columns are in
|
|
|
|
* the sub_tlist.
|
1999-05-03 02:38:44 +02:00
|
|
|
*/
|
1999-08-21 05:49:17 +02:00
|
|
|
numCols = length(parse->groupClause);
|
|
|
|
if (numCols > 0)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
|
|
|
int keyno = 0;
|
1999-08-21 05:49:17 +02:00
|
|
|
AttrNumber *grpColIdx;
|
|
|
|
List *gl;
|
|
|
|
|
|
|
|
grpColIdx = (AttrNumber *) palloc(sizeof(AttrNumber) * numCols);
|
|
|
|
*groupColIdx = grpColIdx;
|
1999-05-03 02:38:44 +02:00
|
|
|
|
|
|
|
foreach(gl, parse->groupClause)
|
|
|
|
{
|
2000-04-12 19:17:23 +02:00
|
|
|
GroupClause *grpcl = (GroupClause *) lfirst(gl);
|
|
|
|
Node *groupexpr = get_sortgroupclause_expr(grpcl, tlist);
|
|
|
|
TargetEntry *te = NULL;
|
|
|
|
List *sl;
|
1999-05-03 02:38:44 +02:00
|
|
|
|
1999-08-21 05:49:17 +02:00
|
|
|
/* Find or make a matching sub_tlist entry */
|
|
|
|
foreach(sl, sub_tlist)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
1999-08-21 05:49:17 +02:00
|
|
|
te = (TargetEntry *) lfirst(sl);
|
|
|
|
if (equal(groupexpr, te->expr))
|
|
|
|
break;
|
1999-05-03 02:38:44 +02:00
|
|
|
}
|
2000-04-12 19:17:23 +02:00
|
|
|
if (!sl)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
1999-08-21 05:49:17 +02:00
|
|
|
te = makeTargetEntry(makeResdom(length(sub_tlist) + 1,
|
|
|
|
exprType(groupexpr),
|
|
|
|
exprTypmod(groupexpr),
|
|
|
|
NULL,
|
|
|
|
false),
|
2002-12-12 16:49:42 +01:00
|
|
|
(Expr *) groupexpr);
|
1999-08-21 05:49:17 +02:00
|
|
|
sub_tlist = lappend(sub_tlist, te);
|
2003-02-03 16:07:08 +01:00
|
|
|
*need_tlist_eval = true; /* it's not flat anymore */
|
1999-05-03 02:38:44 +02:00
|
|
|
}
|
|
|
|
|
1999-08-21 05:49:17 +02:00
|
|
|
/* and save its resno */
|
|
|
|
grpColIdx[keyno++] = te->resdom->resno;
|
1999-05-03 02:38:44 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return sub_tlist;
|
|
|
|
}
|
|
|
|
|
2003-02-03 16:07:08 +01:00
|
|
|
/*
|
|
|
|
* locate_grouping_columns
|
|
|
|
* Locate grouping columns in the tlist chosen by query_planner.
|
|
|
|
*
|
|
|
|
* This is only needed if we don't use the sub_tlist chosen by
|
|
|
|
* make_subplanTargetList. We have to forget the column indexes found
|
|
|
|
* by that routine and re-locate the grouping vars in the real sub_tlist.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
locate_grouping_columns(Query *parse,
|
|
|
|
List *tlist,
|
|
|
|
List *sub_tlist,
|
|
|
|
AttrNumber *groupColIdx)
|
|
|
|
{
|
|
|
|
int keyno = 0;
|
|
|
|
List *gl;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No work unless grouping.
|
|
|
|
*/
|
|
|
|
if (!parse->groupClause)
|
|
|
|
{
|
|
|
|
Assert(groupColIdx == NULL);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
Assert(groupColIdx != NULL);
|
|
|
|
|
|
|
|
foreach(gl, parse->groupClause)
|
|
|
|
{
|
|
|
|
GroupClause *grpcl = (GroupClause *) lfirst(gl);
|
|
|
|
Node *groupexpr = get_sortgroupclause_expr(grpcl, tlist);
|
|
|
|
TargetEntry *te = NULL;
|
|
|
|
List *sl;
|
|
|
|
|
|
|
|
foreach(sl, sub_tlist)
|
|
|
|
{
|
|
|
|
te = (TargetEntry *) lfirst(sl);
|
|
|
|
if (equal(groupexpr, te->expr))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!sl)
|
|
|
|
elog(ERROR, "locate_grouping_columns: failed");
|
|
|
|
|
|
|
|
groupColIdx[keyno++] = te->resdom->resno;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-08-21 05:49:17 +02:00
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* make_groupsortplan
|
|
|
|
* Add a Sort node to explicitly sort according to the GROUP BY clause.
|
|
|
|
*
|
|
|
|
* Note: the Sort node always just takes a copy of the subplan's tlist
|
|
|
|
* plus ordering information. (This might seem inefficient if the
|
|
|
|
* subplan contains complex GROUP BY expressions, but in fact Sort
|
|
|
|
* does not evaluate its targetlist --- it only outputs the same
|
|
|
|
* tuples in a new order. So the expressions we might be copying
|
|
|
|
* are just dummies with no extra execution cost.)
|
1999-08-21 05:49:17 +02:00
|
|
|
*/
|
1999-05-03 02:38:44 +02:00
|
|
|
static Plan *
|
2002-11-06 01:00:45 +01:00
|
|
|
make_groupsortplan(Query *parse,
|
|
|
|
List *groupClause,
|
|
|
|
AttrNumber *grpColIdx,
|
|
|
|
Plan *subplan)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
2002-11-06 01:00:45 +01:00
|
|
|
List *sort_tlist = new_unsorted_tlist(subplan->targetlist);
|
|
|
|
int keyno = 0;
|
|
|
|
List *gl;
|
1999-05-03 02:38:44 +02:00
|
|
|
|
2002-11-06 01:00:45 +01:00
|
|
|
foreach(gl, groupClause)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
2002-11-06 01:00:45 +01:00
|
|
|
GroupClause *grpcl = (GroupClause *) lfirst(gl);
|
|
|
|
TargetEntry *te = nth(grpColIdx[keyno] - 1, sort_tlist);
|
|
|
|
Resdom *resdom = te->resdom;
|
|
|
|
|
1999-08-21 05:49:17 +02:00
|
|
|
/*
|
2002-11-06 01:00:45 +01:00
|
|
|
* Check for the possibility of duplicate group-by clauses ---
|
|
|
|
* the parser should have removed 'em, but the Sort executor
|
|
|
|
* will get terribly confused if any get through!
|
1999-08-21 05:49:17 +02:00
|
|
|
*/
|
2002-11-06 01:00:45 +01:00
|
|
|
if (resdom->reskey == 0)
|
1999-05-03 02:38:44 +02:00
|
|
|
{
|
2002-11-06 01:00:45 +01:00
|
|
|
/* OK, insert the ordering info needed by the executor. */
|
|
|
|
resdom->reskey = ++keyno;
|
|
|
|
resdom->reskeyop = grpcl->sortop;
|
1999-05-03 02:38:44 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-11-06 01:00:45 +01:00
|
|
|
Assert(keyno > 0);
|
|
|
|
|
|
|
|
return (Plan *) make_sort(parse, sort_tlist, subplan, keyno);
|
1999-05-03 02:38:44 +02:00
|
|
|
}
|
|
|
|
|
2000-11-09 03:46:17 +01:00
|
|
|
/*
|
|
|
|
* postprocess_setop_tlist
|
|
|
|
* Fix up targetlist returned by plan_set_operations().
|
|
|
|
*
|
|
|
|
* We need to transpose sort key info from the orig_tlist into new_tlist.
|
|
|
|
* NOTE: this would not be good enough if we supported resjunk sort keys
|
|
|
|
* for results of set operations --- then, we'd need to project a whole
|
|
|
|
* new tlist to evaluate the resjunk columns. For now, just elog if we
|
|
|
|
* find any resjunk columns in orig_tlist.
|
|
|
|
*/
|
|
|
|
static List *
|
|
|
|
postprocess_setop_tlist(List *new_tlist, List *orig_tlist)
|
|
|
|
{
|
|
|
|
List *l;
|
|
|
|
|
|
|
|
foreach(l, new_tlist)
|
|
|
|
{
|
|
|
|
TargetEntry *new_tle = (TargetEntry *) lfirst(l);
|
|
|
|
TargetEntry *orig_tle;
|
|
|
|
|
|
|
|
/* ignore resjunk columns in setop result */
|
|
|
|
if (new_tle->resdom->resjunk)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
Assert(orig_tlist != NIL);
|
|
|
|
orig_tle = (TargetEntry *) lfirst(orig_tlist);
|
|
|
|
orig_tlist = lnext(orig_tlist);
|
|
|
|
if (orig_tle->resdom->resjunk)
|
|
|
|
elog(ERROR, "postprocess_setop_tlist: resjunk output columns not implemented");
|
|
|
|
Assert(new_tle->resdom->resno == orig_tle->resdom->resno);
|
|
|
|
Assert(new_tle->resdom->restype == orig_tle->resdom->restype);
|
|
|
|
new_tle->resdom->ressortgroupref = orig_tle->resdom->ressortgroupref;
|
|
|
|
}
|
|
|
|
if (orig_tlist != NIL)
|
|
|
|
elog(ERROR, "postprocess_setop_tlist: resjunk output columns not implemented");
|
|
|
|
return new_tlist;
|
|
|
|
}
|