mirror of
https://git.postgresql.org/git/postgresql.git
synced 2026-02-13 01:47:05 +08:00
9ff79b9d4e
This patch takes care of a number of problems having to do with failure to choose valid join orders and incorrect handling of lateral references pulled up from subqueries. Notable changes: * Add a LateralJoinInfo data structure similar to SpecialJoinInfo, to represent join ordering constraints created by lateral references. (I first considered extending the SpecialJoinInfo structure, but the semantics are different enough that a separate data structure seems better.) Extend join_is_legal() and related functions to prevent trying to form unworkable joins, and to ensure that we will consider joins that satisfy lateral references even if the joins would be clauseless. * Fill in the infrastructure needed for the last few types of relation scan paths to support parameterization. We'd have wanted this eventually anyway, but it is necessary now because a relation that gets pulled up out of a UNION ALL subquery may acquire a reltargetlist containing lateral references, meaning that its paths *have* to be parameterized whether or not we have any code that can push join quals down into the scan. * Compute data about lateral references early in query_planner(), and save in RelOptInfo nodes, to avoid repetitive calculations later. * Assorted corner-case bug fixes. There's probably still some bugs left, but this is a lot closer to being real than it was before.
50 lines
1.4 KiB
C
50 lines
1.4 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* planner.h
|
|
* prototypes for planner.c.
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* src/include/optimizer/planner.h
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef PLANNER_H
|
|
#define PLANNER_H
|
|
|
|
#include "nodes/plannodes.h"
|
|
#include "nodes/relation.h"
|
|
|
|
|
|
/* Hook for plugins to get control in planner() */
|
|
typedef PlannedStmt *(*planner_hook_type) (Query *parse,
|
|
int cursorOptions,
|
|
ParamListInfo boundParams);
|
|
extern PGDLLIMPORT planner_hook_type planner_hook;
|
|
|
|
|
|
extern PlannedStmt *planner(Query *parse, int cursorOptions,
|
|
ParamListInfo boundParams);
|
|
extern PlannedStmt *standard_planner(Query *parse, int cursorOptions,
|
|
ParamListInfo boundParams);
|
|
|
|
extern Plan *subquery_planner(PlannerGlobal *glob, Query *parse,
|
|
PlannerInfo *parent_root,
|
|
bool hasRecursion, double tuple_fraction,
|
|
PlannerInfo **subroot);
|
|
|
|
extern void add_tlist_costs_to_plan(PlannerInfo *root, Plan *plan,
|
|
List *tlist);
|
|
|
|
extern bool is_dummy_plan(Plan *plan);
|
|
|
|
extern Expr *expression_planner(Expr *expr);
|
|
|
|
extern Expr *preprocess_phv_expression(PlannerInfo *root, Expr *expr);
|
|
|
|
extern bool plan_cluster_use_sort(Oid tableOid, Oid indexOid);
|
|
|
|
#endif /* PLANNER_H */
|