mirror of
https://git.postgresql.org/git/postgresql.git
synced 2026-02-06 06:17:39 +08:00
f6dba10e62
node now does its own grouping of the input rows, and has no need for a preceding GROUP node in the plan pipeline. This allows elimination of the misnamed tuplePerGroup option for GROUP, and actually saves more code in nodeGroup.c than it costs in nodeAgg.c, as well as being presumably faster. Restructure the API of query_planner so that we do not commit to using a sorted or unsorted plan in query_planner; instead grouping_planner makes the decision. (Right now it isn't any smarter than query_planner was, but that will change as soon as it has the option to select a hash- based aggregation step.) Despite all the hackery, no initdb needed since only in-memory node types changed.
68 lines
2.4 KiB
C
68 lines
2.4 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* planmain.h
|
|
* prototypes for various files in optimizer/plan
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $Id: planmain.h,v 1.61 2002/11/06 00:00:45 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef PLANMAIN_H
|
|
#define PLANMAIN_H
|
|
|
|
#include "nodes/plannodes.h"
|
|
#include "nodes/relation.h"
|
|
|
|
/*
|
|
* prototypes for plan/planmain.c
|
|
*/
|
|
extern void query_planner(Query *root, List *tlist, double tuple_fraction,
|
|
Path **cheapest_path, Path **sorted_path);
|
|
|
|
/*
|
|
* prototypes for plan/createplan.c
|
|
*/
|
|
extern Plan *create_plan(Query *root, Path *best_path);
|
|
extern SubqueryScan *make_subqueryscan(List *qptlist, List *qpqual,
|
|
Index scanrelid, Plan *subplan);
|
|
extern Append *make_append(List *appendplans, bool isTarget, List *tlist);
|
|
extern Sort *make_sort(Query *root, List *tlist,
|
|
Plan *lefttree, int keycount);
|
|
extern Sort *make_sort_from_pathkeys(Query *root, List *tlist,
|
|
Plan *lefttree, List *pathkeys);
|
|
extern Agg *make_agg(List *tlist, List *qual, AggStrategy aggstrategy,
|
|
int ngrp, AttrNumber *grpColIdx, Plan *lefttree);
|
|
extern Group *make_group(List *tlist, int ngrp, AttrNumber *grpColIdx,
|
|
Plan *lefttree);
|
|
extern Material *make_material(List *tlist, Plan *lefttree);
|
|
extern Unique *make_unique(List *tlist, Plan *lefttree, List *distinctList);
|
|
extern Limit *make_limit(List *tlist, Plan *lefttree,
|
|
Node *limitOffset, Node *limitCount);
|
|
extern SetOp *make_setop(SetOpCmd cmd, List *tlist, Plan *lefttree,
|
|
List *distinctList, AttrNumber flagColIdx);
|
|
extern Result *make_result(List *tlist, Node *resconstantqual, Plan *subplan);
|
|
|
|
/*
|
|
* prototypes for plan/initsplan.c
|
|
*/
|
|
extern List *add_base_rels_to_query(Query *root, Node *jtnode);
|
|
extern void build_base_rel_tlists(Query *root, List *tlist);
|
|
extern Relids distribute_quals_to_rels(Query *root, Node *jtnode);
|
|
extern void process_implied_equality(Query *root, Node *item1, Node *item2,
|
|
Oid sortop1, Oid sortop2);
|
|
|
|
/*
|
|
* prototypes for plan/setrefs.c
|
|
*/
|
|
extern void set_plan_references(Plan *plan, List *rtable);
|
|
extern List *join_references(List *clauses, List *rtable,
|
|
List *outer_tlist, List *inner_tlist,
|
|
Index acceptable_rel);
|
|
extern void fix_opids(Node *node);
|
|
|
|
#endif /* PLANMAIN_H */
|