Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
acl.h	12.79 KB	-rw-r--r--
array.h	10.97 KB	-rw-r--r--
ascii.h	579 B	-rw-r--r--
attoptcache.h	725 B	-rw-r--r--
builtins.h	47.77 KB	-rw-r--r--
bytea.h	1.58 KB	-rw-r--r--
cash.h	2.07 KB	-rw-r--r--
catcache.h	7.51 KB	-rw-r--r--
combocid.h	698 B	-rw-r--r--
date.h	7.73 KB	-rw-r--r--
datetime.h	9.92 KB	-rw-r--r--
datum.h	1.48 KB	-rw-r--r--
dynahash.h	498 B	-rw-r--r--
dynamic_loader.h	648 B	-rw-r--r--
elog.h	12.56 KB	-rw-r--r--
errcodes.h	19.61 KB	-rw-r--r--
fmgroids.h	61.09 KB	-rw-r--r--
fmgrtab.h	1.15 KB	-rw-r--r--
formatting.h	1.41 KB	-rw-r--r--
geo_decls.h	15.86 KB	-rw-r--r--
guc.h	13.19 KB	-rw-r--r--
guc_tables.h	7.15 KB	-rw-r--r--
help_config.h	432 B	-rw-r--r--
hsearch.h	5.51 KB	-rw-r--r--
inet.h	2.66 KB	-rw-r--r--
int8.h	4.03 KB	-rw-r--r--
inval.h	1.81 KB	-rw-r--r--
json.h	916 B	-rw-r--r--
logtape.h	1.5 KB	-rw-r--r--
lsyscache.h	6.51 KB	-rw-r--r--
memutils.h	5.2 KB	-rw-r--r--
nabstime.h	5.79 KB	-rw-r--r--
numeric.h	1.88 KB	-rw-r--r--
palloc.h	3.92 KB	-rw-r--r--
pg_crc.h	4.36 KB	-rw-r--r--
pg_crc_tables.h	19.73 KB	-rw-r--r--
pg_locale.h	2.59 KB	-rw-r--r--
pg_lzcompress.h	2.97 KB	-rw-r--r--
pg_rusage.h	847 B	-rw-r--r--
plancache.h	8.02 KB	-rw-r--r--
portal.h	9.22 KB	-rw-r--r--
probes.h	37.93 KB	-rw-r--r--
ps_status.h	668 B	-rw-r--r--
rangetypes.h	7.4 KB	-rw-r--r--
rbtree.h	2.26 KB	-rw-r--r--
rel.h	12.27 KB	-rw-r--r--
relcache.h	3.17 KB	-rw-r--r--
relmapper.h	1.68 KB	-rw-r--r--
reltrigger.h	1.95 KB	-rw-r--r--
resowner.h	5.07 KB	-rw-r--r--
selfuncs.h	7.5 KB	-rw-r--r--
snapmgr.h	1.59 KB	-rw-r--r--
snapshot.h	2.59 KB	-rw-r--r--
sortsupport.h	5.3 KB	-rw-r--r--
spccache.h	556 B	-rw-r--r--
syscache.h	5.51 KB	-rw-r--r--
timestamp.h	9.5 KB	-rw-r--r--
tqual.h	3.5 KB	-rw-r--r--
tuplesort.h	4.62 KB	-rw-r--r--
tuplestore.h	3.14 KB	-rw-r--r--
typcache.h	4.26 KB	-rw-r--r--
tzparser.h	1.13 KB	-rw-r--r--
uuid.h	861 B	-rw-r--r--
varbit.h	4.27 KB	-rw-r--r--
xml.h	3.89 KB	-rw-r--r--

Code Editor : plancache.h

/*-------------------------------------------------------------------------
 *
 * plancache.h
 *	  Plan cache definitions.
 *
 * See plancache.c for comments.
 *
 * Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * src/include/utils/plancache.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef PLANCACHE_H
#define PLANCACHE_H

#include "access/tupdesc.h"
#include "nodes/params.h"

#define CACHEDPLANSOURCE_MAGIC		195726186
#define CACHEDPLAN_MAGIC			953717834

/*
 * CachedPlanSource (which might better have been called CachedQuery)
 * represents a SQL query that we expect to use multiple times.  It stores
 * the query source text, the raw parse tree, and the analyzed-and-rewritten
 * query tree, as well as adjunct data.  Cache invalidation can happen as a
 * result of DDL affecting objects used by the query.  In that case we discard
 * the analyzed-and-rewritten query tree, and rebuild it when next needed.
 *
 * An actual execution plan, represented by CachedPlan, is derived from the
 * CachedPlanSource when we need to execute the query.  The plan could be
 * either generic (usable with any set of plan parameters) or custom (for a
 * specific set of parameters).  plancache.c contains the logic that decides
 * which way to do it for any particular execution.  If we are using a generic
 * cached plan then it is meant to be re-used across multiple executions, so
 * callers must always treat CachedPlans as read-only.
 *
 * Once successfully built and "saved", CachedPlanSources typically live
 * for the life of the backend, although they can be dropped explicitly.
 * CachedPlans are reference-counted and go away automatically when the last
 * reference is dropped.  A CachedPlan can outlive the CachedPlanSource it
 * was created from.
 *
 * An "unsaved" CachedPlanSource can be used for generating plans, but it
 * lives in transient storage and will not be updated in response to sinval
 * events.
 *
 * CachedPlans made from saved CachedPlanSources are likewise in permanent
 * storage, so to avoid memory leaks, the reference-counted references to them
 * must be held in permanent data structures or ResourceOwners.  CachedPlans
 * made from unsaved CachedPlanSources are in children of the caller's
 * memory context, so references to them should not be longer-lived than
 * that context.  (Reference counting is somewhat pro forma in that case,
 * though it may be useful if the CachedPlan can be discarded early.)
 *
 * A CachedPlanSource has two associated memory contexts: one that holds the
 * struct itself, the query source text and the raw parse tree, and another
 * context that holds the rewritten query tree and associated data.  This
 * allows the query tree to be discarded easily when it is invalidated.
 *
 * Some callers wish to use the CachedPlan API even with one-shot queries
 * that have no reason to be saved at all.  We therefore support a "oneshot"
 * variant that does no data copying or invalidation checking.  In this case
 * there are no separate memory contexts: the CachedPlanSource struct and
 * all subsidiary data live in the caller's CurrentMemoryContext, and there
 * is no way to free memory short of clearing that entire context.  A oneshot
 * plan is always treated as unsaved.
 *
 * Note: the string referenced by commandTag is not subsidiary storage;
 * it is assumed to be a compile-time-constant string.  As with portals,
 * commandTag shall be NULL if and only if the original query string (before
 * rewriting) was an empty string.
 */
typedef struct CachedPlanSource
{
	int			magic;			/* should equal CACHEDPLANSOURCE_MAGIC */
	Node	   *raw_parse_tree; /* output of raw_parser(), or NULL */
	const char *query_string;	/* source text of query */
	const char *commandTag;		/* command tag (a constant!), or NULL */
	Oid		   *param_types;	/* array of parameter type OIDs, or NULL */
	int			num_params;		/* length of param_types array */
	ParserSetupHook parserSetup;	/* alternative parameter spec method */
	void	   *parserSetupArg;
	int			cursor_options; /* cursor options used for planning */
	bool		fixed_result;	/* disallow change in result tupdesc? */
	TupleDesc	resultDesc;		/* result type; NULL = doesn't return tuples */
	struct OverrideSearchPath *search_path;		/* saved search_path */
	MemoryContext context;		/* memory context holding all above */
	/* These fields describe the current analyzed-and-rewritten query tree: */
	List	   *query_list;		/* list of Query nodes, or NIL if not valid */
	List	   *relationOids;	/* OIDs of relations the queries depend on */
	List	   *invalItems;		/* other dependencies, as PlanInvalItems */
	MemoryContext query_context;	/* context holding the above, or NULL */
	/* If we have a generic plan, this is a reference-counted link to it: */
	struct CachedPlan *gplan;	/* generic plan, or NULL if not valid */
	/* Some state flags: */
	bool		is_complete;	/* has CompleteCachedPlan been done? */
	bool		is_saved;		/* has CachedPlanSource been "saved"? */
	bool		is_valid;		/* is the query_list currently valid? */
	bool		is_oneshot;		/* is it a "oneshot" plan? */
	int			generation;		/* increments each time we create a plan */
	/* If CachedPlanSource has been saved, it is a member of a global list */
	struct CachedPlanSource *next_saved;		/* list link, if so */
	/* State kept to help decide whether to use custom or generic plans: */
	double		generic_cost;	/* cost of generic plan, or -1 if not known */
	double		total_custom_cost;		/* total cost of custom plans so far */
	int			num_custom_plans;		/* number of plans included in total */
} CachedPlanSource;

/*
 * CachedPlan represents an execution plan derived from a CachedPlanSource.
 * The reference count includes both the link from the parent CachedPlanSource
 * (if any), and any active plan executions, so the plan can be discarded
 * exactly when refcount goes to zero.  Both the struct itself and the
 * subsidiary data live in the context denoted by the context field.
 * This makes it easy to free a no-longer-needed cached plan.  (However,
 * if is_oneshot is true, the context does not belong solely to the CachedPlan
 * so no freeing is possible.)
 */
typedef struct CachedPlan
{
	int			magic;			/* should equal CACHEDPLAN_MAGIC */
	List	   *stmt_list;		/* list of statement nodes (PlannedStmts and
								 * bare utility statements) */
	bool		is_saved;		/* is CachedPlan in a long-lived context? */
	bool		is_valid;		/* is the stmt_list currently valid? */
	bool		is_oneshot;		/* is it a "oneshot" plan? */
	TransactionId saved_xmin;	/* if valid, replan when TransactionXmin
								 * changes from this value */
	int			generation;		/* parent's generation number for this plan */
	int			refcount;		/* count of live references to this struct */
	MemoryContext context;		/* context containing this CachedPlan */
} CachedPlan;

extern void InitPlanCache(void);
extern void ResetPlanCache(void);

extern CachedPlanSource *CreateCachedPlan(Node *raw_parse_tree,
				 const char *query_string,
				 const char *commandTag);
extern CachedPlanSource *CreateOneShotCachedPlan(Node *raw_parse_tree,
				 const char *query_string,
				 const char *commandTag);
extern void CompleteCachedPlan(CachedPlanSource *plansource,
				   List *querytree_list,
				   MemoryContext querytree_context,
				   Oid *param_types,
				   int num_params,
				   ParserSetupHook parserSetup,
				   void *parserSetupArg,
				   int cursor_options,
				   bool fixed_result);

extern void SaveCachedPlan(CachedPlanSource *plansource);
extern void DropCachedPlan(CachedPlanSource *plansource);

extern void CachedPlanSetParentContext(CachedPlanSource *plansource,
						   MemoryContext newcontext);

extern CachedPlanSource *CopyCachedPlan(CachedPlanSource *plansource);

extern bool CachedPlanIsValid(CachedPlanSource *plansource);

extern List *CachedPlanGetTargetList(CachedPlanSource *plansource);

extern CachedPlan *GetCachedPlan(CachedPlanSource *plansource,
			  ParamListInfo boundParams,
			  bool useResOwner);
extern void ReleaseCachedPlan(CachedPlan *plan, bool useResOwner);

#endif   /* PLANCACHE_H */

${this.title}

Code Editor : plancache.h