mirror of
https://github.com/postgres/postgres.git
synced 2026-02-12 15:23:16 -05:00
0bf2587df4
look at the actual aggregate transition datatypes and the actual overhead needed by nodeAgg.c, instead of using pessimistic round numbers. Per a discussion with Michael Tiemann.
30 lines
908 B
C
30 lines
908 B
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* nodeAgg.h
|
|
* prototypes for nodeAgg.c
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $PostgreSQL: pgsql/src/include/executor/nodeAgg.h,v 1.24 2005/01/28 19:34:18 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef NODEAGG_H
|
|
#define NODEAGG_H
|
|
|
|
#include "fmgr.h"
|
|
#include "nodes/execnodes.h"
|
|
|
|
extern int ExecCountSlotsAgg(Agg *node);
|
|
extern AggState *ExecInitAgg(Agg *node, EState *estate);
|
|
extern TupleTableSlot *ExecAgg(AggState *node);
|
|
extern void ExecEndAgg(AggState *node);
|
|
extern void ExecReScanAgg(AggState *node, ExprContext *exprCtxt);
|
|
|
|
extern Size hash_agg_entry_size(int numAggs);
|
|
|
|
extern Datum aggregate_dummy(PG_FUNCTION_ARGS);
|
|
|
|
#endif /* NODEAGG_H */
|