mirror of
https://github.com/postgres/postgres.git
synced 2025-11-12 05:01:15 +03:00
Massive commit to run PGINDENT on all *.c and *.h files.
This commit is contained in:
Bruce Momjian
@@ -1,13 +1,13 @@
|
||||
/*-------------------------------------------------------------------------
|
||||
*
|
||||
* pquery.c--
|
||||
* POSTGRES process query command code
|
||||
* POSTGRES process query command code
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/tcop/pquery.c,v 1.7 1997/08/27 09:03:15 vadim Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/tcop/pquery.c,v 1.8 1997/09/07 04:49:35 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@@ -38,332 +38,341 @@
|
||||
|
||||
#include "commands/command.h"
|
||||
|
||||
static char* CreateOperationTag(int operationType);
|
||||
static void ProcessQueryDesc(QueryDesc *queryDesc);
|
||||
static char *CreateOperationTag(int operationType);
|
||||
static void ProcessQueryDesc(QueryDesc * queryDesc);
|
||||
|
||||
|
||||
/* ----------------------------------------------------------------
|
||||
* CreateQueryDesc
|
||||
* CreateQueryDesc
|
||||
* ----------------------------------------------------------------
|
||||
*/
|
||||
QueryDesc *
|
||||
CreateQueryDesc(Query *parsetree,
|
||||
Plan *plantree,
|
||||
CommandDest dest)
|
||||
QueryDesc *
|
||||
CreateQueryDesc(Query * parsetree,
|
||||
Plan * plantree,
|
||||
CommandDest dest)
|
||||
{
|
||||
QueryDesc *qd = (QueryDesc *)palloc(sizeof(QueryDesc));
|
||||
|
||||
qd->operation = parsetree->commandType; /* operation */
|
||||
qd->parsetree = parsetree; /* parse tree */
|
||||
qd->plantree = plantree; /* plan */
|
||||
qd->dest = dest; /* output dest */
|
||||
return qd;
|
||||
QueryDesc *qd = (QueryDesc *) palloc(sizeof(QueryDesc));
|
||||
|
||||
qd->operation = parsetree->commandType; /* operation */
|
||||
qd->parsetree = parsetree; /* parse tree */
|
||||
qd->plantree = plantree; /* plan */
|
||||
qd->dest = dest; /* output dest */
|
||||
return qd;
|
||||
}
|
||||
|
||||
/* ----------------------------------------------------------------
|
||||
* CreateExecutorState
|
||||
* CreateExecutorState
|
||||
*
|
||||
* Note: this may someday take parameters -cim 9/18/89
|
||||
* Note: this may someday take parameters -cim 9/18/89
|
||||
* ----------------------------------------------------------------
|
||||
*/
|
||||
EState *
|
||||
EState *
|
||||
CreateExecutorState(void)
|
||||
{
|
||||
EState *state;
|
||||
extern int NBuffers;
|
||||
long *refcount;
|
||||
|
||||
/* ----------------
|
||||
* create a new executor state
|
||||
* ----------------
|
||||
*/
|
||||
state = makeNode(EState);
|
||||
|
||||
/* ----------------
|
||||
* initialize the Executor State structure
|
||||
* ----------------
|
||||
*/
|
||||
state->es_direction = ForwardScanDirection;
|
||||
state->es_range_table = NIL;
|
||||
EState *state;
|
||||
extern int NBuffers;
|
||||
long *refcount;
|
||||
|
||||
state->es_into_relation_descriptor = NULL;
|
||||
state->es_result_relation_info = NULL;
|
||||
|
||||
state->es_param_list_info = NULL;
|
||||
|
||||
state->es_BaseId = 0;
|
||||
state->es_tupleTable = NULL;
|
||||
|
||||
state->es_junkFilter = NULL;
|
||||
|
||||
refcount = (long *) palloc(NBuffers * sizeof(long));
|
||||
memset((char *) refcount, 0, NBuffers * sizeof(long));
|
||||
state->es_refcount = (int *) refcount;
|
||||
|
||||
/* ----------------
|
||||
* return the executor state structure
|
||||
* ----------------
|
||||
*/
|
||||
return state;
|
||||
/* ----------------
|
||||
* create a new executor state
|
||||
* ----------------
|
||||
*/
|
||||
state = makeNode(EState);
|
||||
|
||||
/* ----------------
|
||||
* initialize the Executor State structure
|
||||
* ----------------
|
||||
*/
|
||||
state->es_direction = ForwardScanDirection;
|
||||
state->es_range_table = NIL;
|
||||
|
||||
state->es_into_relation_descriptor = NULL;
|
||||
state->es_result_relation_info = NULL;
|
||||
|
||||
state->es_param_list_info = NULL;
|
||||
|
||||
state->es_BaseId = 0;
|
||||
state->es_tupleTable = NULL;
|
||||
|
||||
state->es_junkFilter = NULL;
|
||||
|
||||
refcount = (long *) palloc(NBuffers * sizeof(long));
|
||||
memset((char *) refcount, 0, NBuffers * sizeof(long));
|
||||
state->es_refcount = (int *) refcount;
|
||||
|
||||
/* ----------------
|
||||
* return the executor state structure
|
||||
* ----------------
|
||||
*/
|
||||
return state;
|
||||
}
|
||||
|
||||
/* ----------------------------------------------------------------
|
||||
* CreateOperationTag
|
||||
* CreateOperationTag
|
||||
*
|
||||
* utility to get a string representation of the
|
||||
* query operation.
|
||||
* utility to get a string representation of the
|
||||
* query operation.
|
||||
* ----------------------------------------------------------------
|
||||
*/
|
||||
static char*
|
||||
static char *
|
||||
CreateOperationTag(int operationType)
|
||||
{
|
||||
char* tag;
|
||||
|
||||
switch (operationType) {
|
||||
case CMD_SELECT:
|
||||
tag = "SELECT";
|
||||
break;
|
||||
case CMD_INSERT:
|
||||
tag = "INSERT";
|
||||
break;
|
||||
case CMD_DELETE:
|
||||
tag = "DELETE";
|
||||
break;
|
||||
case CMD_UPDATE:
|
||||
tag = "UPDATE";
|
||||
break;
|
||||
default:
|
||||
elog(DEBUG, "CreateOperationTag: unknown operation type %d",
|
||||
operationType);
|
||||
tag = NULL;
|
||||
break;
|
||||
}
|
||||
|
||||
return tag;
|
||||
char *tag;
|
||||
|
||||
switch (operationType)
|
||||
{
|
||||
case CMD_SELECT:
|
||||
tag = "SELECT";
|
||||
break;
|
||||
case CMD_INSERT:
|
||||
tag = "INSERT";
|
||||
break;
|
||||
case CMD_DELETE:
|
||||
tag = "DELETE";
|
||||
break;
|
||||
case CMD_UPDATE:
|
||||
tag = "UPDATE";
|
||||
break;
|
||||
default:
|
||||
elog(DEBUG, "CreateOperationTag: unknown operation type %d",
|
||||
operationType);
|
||||
tag = NULL;
|
||||
break;
|
||||
}
|
||||
|
||||
return tag;
|
||||
}
|
||||
|
||||
/* ----------------
|
||||
* ProcessPortal
|
||||
* ProcessPortal
|
||||
* ----------------
|
||||
*/
|
||||
|
||||
void
|
||||
ProcessPortal(char* portalName,
|
||||
Query *parseTree,
|
||||
Plan *plan,
|
||||
EState *state,
|
||||
TupleDesc attinfo,
|
||||
CommandDest dest)
|
||||
ProcessPortal(char *portalName,
|
||||
Query * parseTree,
|
||||
Plan * plan,
|
||||
EState * state,
|
||||
TupleDesc attinfo,
|
||||
CommandDest dest)
|
||||
{
|
||||
Portal portal;
|
||||
MemoryContext portalContext;
|
||||
|
||||
/* ----------------
|
||||
* convert the current blank portal into the user-specified
|
||||
* portal and initialize the state and query descriptor.
|
||||
* ----------------
|
||||
*/
|
||||
|
||||
if (PortalNameIsSpecial(portalName))
|
||||
elog(WARN,
|
||||
"The portal name %s is reserved for internal use",
|
||||
portalName);
|
||||
|
||||
portal = BlankPortalAssignName(portalName);
|
||||
|
||||
PortalSetQuery(portal,
|
||||
CreateQueryDesc(parseTree, plan, dest),
|
||||
attinfo,
|
||||
state,
|
||||
PortalCleanup);
|
||||
|
||||
/* ----------------
|
||||
* now create a new blank portal and switch to it.
|
||||
* Otherwise, the new named portal will be cleaned.
|
||||
*
|
||||
* Note: portals will only be supported within a BEGIN...END
|
||||
* block in the near future. Later, someone will fix it to
|
||||
* do what is possible across transaction boundries. -hirohama
|
||||
* ----------------
|
||||
*/
|
||||
portalContext = (MemoryContext)
|
||||
PortalGetHeapMemory(GetPortalByName(NULL));
|
||||
|
||||
MemoryContextSwitchTo(portalContext);
|
||||
|
||||
StartPortalAllocMode(DefaultAllocMode, 0);
|
||||
Portal portal;
|
||||
MemoryContext portalContext;
|
||||
|
||||
/* ----------------
|
||||
* convert the current blank portal into the user-specified
|
||||
* portal and initialize the state and query descriptor.
|
||||
* ----------------
|
||||
*/
|
||||
|
||||
if (PortalNameIsSpecial(portalName))
|
||||
elog(WARN,
|
||||
"The portal name %s is reserved for internal use",
|
||||
portalName);
|
||||
|
||||
portal = BlankPortalAssignName(portalName);
|
||||
|
||||
PortalSetQuery(portal,
|
||||
CreateQueryDesc(parseTree, plan, dest),
|
||||
attinfo,
|
||||
state,
|
||||
PortalCleanup);
|
||||
|
||||
/* ----------------
|
||||
* now create a new blank portal and switch to it.
|
||||
* Otherwise, the new named portal will be cleaned.
|
||||
*
|
||||
* Note: portals will only be supported within a BEGIN...END
|
||||
* block in the near future. Later, someone will fix it to
|
||||
* do what is possible across transaction boundries. -hirohama
|
||||
* ----------------
|
||||
*/
|
||||
portalContext = (MemoryContext)
|
||||
PortalGetHeapMemory(GetPortalByName(NULL));
|
||||
|
||||
MemoryContextSwitchTo(portalContext);
|
||||
|
||||
StartPortalAllocMode(DefaultAllocMode, 0);
|
||||
}
|
||||
|
||||
|
||||
/* ----------------------------------------------------------------
|
||||
* ProcessQueryDesc
|
||||
* ProcessQueryDesc
|
||||
*
|
||||
* Read the comments for ProcessQuery() below...
|
||||
* Read the comments for ProcessQuery() below...
|
||||
* ----------------------------------------------------------------
|
||||
*/
|
||||
static void
|
||||
ProcessQueryDesc(QueryDesc *queryDesc)
|
||||
ProcessQueryDesc(QueryDesc * queryDesc)
|
||||
{
|
||||
Query *parseTree;
|
||||
Plan *plan;
|
||||
int operation;
|
||||
char* tag;
|
||||
EState *state;
|
||||
TupleDesc attinfo;
|
||||
|
||||
bool isRetrieveIntoPortal;
|
||||
bool isRetrieveIntoRelation;
|
||||
char* intoName = NULL;
|
||||
CommandDest dest;
|
||||
|
||||
/* ----------------
|
||||
* get info from the query desc
|
||||
* ----------------
|
||||
*/
|
||||
parseTree = queryDesc->parsetree;
|
||||
plan = queryDesc->plantree;
|
||||
|
||||
operation = queryDesc->operation;
|
||||
tag = CreateOperationTag(operation);
|
||||
dest = queryDesc->dest;
|
||||
|
||||
/* ----------------
|
||||
* initialize portal/into relation status
|
||||
* ----------------
|
||||
*/
|
||||
isRetrieveIntoPortal = false;
|
||||
isRetrieveIntoRelation = false;
|
||||
|
||||
if (operation == CMD_SELECT) {
|
||||
if (parseTree->isPortal) {
|
||||
isRetrieveIntoPortal = true;
|
||||
intoName = parseTree->into;
|
||||
if (parseTree->isBinary) {
|
||||
/*
|
||||
* For internal format portals, we change Remote
|
||||
* (externalized form) to RemoteInternal (internalized
|
||||
* form)
|
||||
*/
|
||||
dest = queryDesc->dest = RemoteInternal;
|
||||
}
|
||||
} else if (parseTree->into != NULL) {
|
||||
/* select into table */
|
||||
isRetrieveIntoRelation = true;
|
||||
Query *parseTree;
|
||||
Plan *plan;
|
||||
int operation;
|
||||
char *tag;
|
||||
EState *state;
|
||||
TupleDesc attinfo;
|
||||
|
||||
bool isRetrieveIntoPortal;
|
||||
bool isRetrieveIntoRelation;
|
||||
char *intoName = NULL;
|
||||
CommandDest dest;
|
||||
|
||||
/* ----------------
|
||||
* get info from the query desc
|
||||
* ----------------
|
||||
*/
|
||||
parseTree = queryDesc->parsetree;
|
||||
plan = queryDesc->plantree;
|
||||
|
||||
operation = queryDesc->operation;
|
||||
tag = CreateOperationTag(operation);
|
||||
dest = queryDesc->dest;
|
||||
|
||||
/* ----------------
|
||||
* initialize portal/into relation status
|
||||
* ----------------
|
||||
*/
|
||||
isRetrieveIntoPortal = false;
|
||||
isRetrieveIntoRelation = false;
|
||||
|
||||
if (operation == CMD_SELECT)
|
||||
{
|
||||
if (parseTree->isPortal)
|
||||
{
|
||||
isRetrieveIntoPortal = true;
|
||||
intoName = parseTree->into;
|
||||
if (parseTree->isBinary)
|
||||
{
|
||||
|
||||
/*
|
||||
* For internal format portals, we change Remote
|
||||
* (externalized form) to RemoteInternal (internalized
|
||||
* form)
|
||||
*/
|
||||
dest = queryDesc->dest = RemoteInternal;
|
||||
}
|
||||
}
|
||||
else if (parseTree->into != NULL)
|
||||
{
|
||||
/* select into table */
|
||||
isRetrieveIntoRelation = true;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/* ----------------
|
||||
* when performing a retrieve into, we override the normal
|
||||
* communication destination during the processing of the
|
||||
* the query. This only affects the tuple-output function
|
||||
* - the correct destination will still see BeginCommand()
|
||||
* and EndCommand() messages.
|
||||
* ----------------
|
||||
*/
|
||||
if (isRetrieveIntoRelation)
|
||||
queryDesc->dest = (int) None;
|
||||
|
||||
/* ----------------
|
||||
* create a default executor state..
|
||||
* ----------------
|
||||
*/
|
||||
state = CreateExecutorState();
|
||||
|
||||
/* ----------------
|
||||
* call ExecStart to prepare the plan for execution
|
||||
* ----------------
|
||||
*/
|
||||
attinfo = ExecutorStart(queryDesc, state);
|
||||
|
||||
/* ----------------
|
||||
* report the query's result type information
|
||||
* back to the front end or to whatever destination
|
||||
* we're dealing with.
|
||||
* ----------------
|
||||
*/
|
||||
BeginCommand(NULL,
|
||||
operation,
|
||||
attinfo,
|
||||
isRetrieveIntoRelation,
|
||||
isRetrieveIntoPortal,
|
||||
tag,
|
||||
dest);
|
||||
|
||||
/* ----------------
|
||||
* Named portals do not do a "fetch all" initially, so now
|
||||
* we return since ExecMain has been called with EXEC_START
|
||||
* to initialize the query plan.
|
||||
*
|
||||
* Note: ProcessPortal transforms the current "blank" portal
|
||||
* into a named portal and creates a new blank portal so
|
||||
* everything we allocated in the current "blank" memory
|
||||
* context will be preserved across queries. -cim 2/22/91
|
||||
* ----------------
|
||||
*/
|
||||
if (isRetrieveIntoPortal) {
|
||||
PortalExecutorHeapMemory = NULL;
|
||||
|
||||
ProcessPortal(intoName,
|
||||
parseTree,
|
||||
plan,
|
||||
state,
|
||||
attinfo,
|
||||
dest);
|
||||
|
||||
/* ----------------
|
||||
* when performing a retrieve into, we override the normal
|
||||
* communication destination during the processing of the
|
||||
* the query. This only affects the tuple-output function
|
||||
* - the correct destination will still see BeginCommand()
|
||||
* and EndCommand() messages.
|
||||
* ----------------
|
||||
*/
|
||||
if (isRetrieveIntoRelation)
|
||||
queryDesc->dest = (int) None;
|
||||
|
||||
/* ----------------
|
||||
* create a default executor state..
|
||||
* ----------------
|
||||
*/
|
||||
state = CreateExecutorState();
|
||||
|
||||
/* ----------------
|
||||
* call ExecStart to prepare the plan for execution
|
||||
* ----------------
|
||||
*/
|
||||
attinfo = ExecutorStart(queryDesc, state);
|
||||
|
||||
/* ----------------
|
||||
* report the query's result type information
|
||||
* back to the front end or to whatever destination
|
||||
* we're dealing with.
|
||||
* ----------------
|
||||
*/
|
||||
BeginCommand(NULL,
|
||||
operation,
|
||||
attinfo,
|
||||
isRetrieveIntoRelation,
|
||||
isRetrieveIntoPortal,
|
||||
tag,
|
||||
dest);
|
||||
|
||||
/* ----------------
|
||||
* Named portals do not do a "fetch all" initially, so now
|
||||
* we return since ExecMain has been called with EXEC_START
|
||||
* to initialize the query plan.
|
||||
*
|
||||
* Note: ProcessPortal transforms the current "blank" portal
|
||||
* into a named portal and creates a new blank portal so
|
||||
* everything we allocated in the current "blank" memory
|
||||
* context will be preserved across queries. -cim 2/22/91
|
||||
* ----------------
|
||||
*/
|
||||
if (isRetrieveIntoPortal)
|
||||
{
|
||||
PortalExecutorHeapMemory = NULL;
|
||||
|
||||
ProcessPortal(intoName,
|
||||
parseTree,
|
||||
plan,
|
||||
state,
|
||||
attinfo,
|
||||
dest);
|
||||
|
||||
EndCommand(tag, dest);
|
||||
return;
|
||||
}
|
||||
|
||||
/* ----------------
|
||||
* Now we get to the important call to ExecutorRun() where we
|
||||
* actually run the plan..
|
||||
* ----------------
|
||||
*/
|
||||
ExecutorRun(queryDesc, state, EXEC_RUN, 0);
|
||||
|
||||
/* save infos for EndCommand */
|
||||
UpdateCommandInfo(operation, state->es_lastoid, state->es_processed);
|
||||
|
||||
/* ----------------
|
||||
* now, we close down all the scans and free allocated resources...
|
||||
* with ExecutorEnd()
|
||||
* ----------------
|
||||
*/
|
||||
ExecutorEnd(queryDesc, state);
|
||||
|
||||
/* ----------------
|
||||
* Notify the destination of end of processing.
|
||||
* ----------------
|
||||
*/
|
||||
EndCommand(tag, dest);
|
||||
return;
|
||||
}
|
||||
|
||||
/* ----------------
|
||||
* Now we get to the important call to ExecutorRun() where we
|
||||
* actually run the plan..
|
||||
* ----------------
|
||||
*/
|
||||
ExecutorRun(queryDesc, state, EXEC_RUN, 0);
|
||||
|
||||
/* save infos for EndCommand */
|
||||
UpdateCommandInfo (operation, state->es_lastoid, state->es_processed);
|
||||
|
||||
/* ----------------
|
||||
* now, we close down all the scans and free allocated resources...
|
||||
* with ExecutorEnd()
|
||||
* ----------------
|
||||
*/
|
||||
ExecutorEnd(queryDesc, state);
|
||||
|
||||
/* ----------------
|
||||
* Notify the destination of end of processing.
|
||||
* ----------------
|
||||
*/
|
||||
EndCommand(tag, dest);
|
||||
}
|
||||
|
||||
/* ----------------------------------------------------------------
|
||||
* ProcessQuery
|
||||
* ProcessQuery
|
||||
*
|
||||
* Execute a plan, the non-parallel version
|
||||
* Execute a plan, the non-parallel version
|
||||
* ----------------------------------------------------------------
|
||||
*/
|
||||
|
||||
void
|
||||
ProcessQuery(Query *parsetree,
|
||||
Plan *plan,
|
||||
char *argv[],
|
||||
Oid *typev,
|
||||
int nargs,
|
||||
CommandDest dest)
|
||||
ProcessQuery(Query * parsetree,
|
||||
Plan * plan,
|
||||
char *argv[],
|
||||
Oid * typev,
|
||||
int nargs,
|
||||
CommandDest dest)
|
||||
{
|
||||
QueryDesc *queryDesc;
|
||||
extern int dontExecute; /* from postgres.c */
|
||||
extern void print_plan (Plan* p, Query* parsetree); /* from print.c */
|
||||
QueryDesc *queryDesc;
|
||||
extern int dontExecute;/* from postgres.c */
|
||||
extern void print_plan(Plan * p, Query * parsetree); /* from print.c */
|
||||
|
||||
queryDesc = CreateQueryDesc(parsetree, plan, dest);
|
||||
queryDesc = CreateQueryDesc(parsetree, plan, dest);
|
||||
|
||||
if (dontExecute) {
|
||||
/* don't execute it, just show the query plan */
|
||||
print_plan(plan, parsetree);
|
||||
} else
|
||||
ProcessQueryDesc(queryDesc);
|
||||
if (dontExecute)
|
||||
{
|
||||
/* don't execute it, just show the query plan */
|
||||
print_plan(plan, parsetree);
|
||||
}
|
||||
else
|
||||
ProcessQueryDesc(queryDesc);
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user