execMain.c 46.6 KB
Newer Older
1 2
/*-------------------------------------------------------------------------
 *
3
 * execMain.c
4
 *	  top level executor interface routines
5 6
 *
 * INTERFACE ROUTINES
7 8 9
 *	ExecutorStart()
 *	ExecutorRun()
 *	ExecutorEnd()
10
 *
11 12 13 14 15 16 17 18 19 20 21 22 23
 *	The old ExecutorMain() has been replaced by ExecutorStart(),
 *	ExecutorRun() and ExecutorEnd()
 *
 *	These three procedures are the external interfaces to the executor.
 *	In each case, the query descriptor and the execution state is required
 *	 as arguments
 *
 *	ExecutorStart() must be called at the beginning of any execution of any
 *	query plan and ExecutorEnd() should always be called at the end of
 *	execution of a plan.
 *
 *	ExecutorRun accepts 'feature' and 'count' arguments that specify whether
 *	the plan is to be executed forwards, backwards, and for how many tuples.
24 25 26 27 28
 *
 * Copyright (c) 1994, Regents of the University of California
 *
 *
 * IDENTIFICATION
Bruce Momjian's avatar
Bruce Momjian committed
29
 *	  $Header: /cvsroot/pgsql/src/backend/executor/execMain.c,v 1.79 1999/02/22 19:40:09 momjian Exp $
30 31 32
 *
 *-------------------------------------------------------------------------
 */
33
#include <string.h>
34
#include "postgres.h"
35
#include "miscadmin.h"
36

37
#include "executor/executor.h"
38 39
#include "executor/execdefs.h"
#include "executor/execdebug.h"
40
#include "executor/nodeIndexscan.h"
41 42 43
#include "utils/builtins.h"
#include "utils/palloc.h"
#include "utils/acl.h"
44
#include "utils/syscache.h"
45
#include "utils/tqual.h"
46
#include "parser/parsetree.h"	/* rt_fetch() */
47
#include "storage/bufmgr.h"
Marc G. Fournier's avatar
Marc G. Fournier committed
48
#include "storage/lmgr.h"
49
#include "storage/smgr.h"
50 51 52
#include "commands/async.h"
/* #include "access/localam.h" */
#include "optimizer/var.h"
53
#include "access/heapam.h"
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
54
#include "access/xact.h"
55
#include "catalog/heap.h"
56
#include "commands/trigger.h"
57

58
void ExecCheckPerms(CmdType operation, int resultRelation, List *rangeTable,
59
			   Query *parseTree);
60 61 62


/* decls for local routines only used within this module */
63 64 65 66 67 68
static TupleDesc InitPlan(CmdType operation,
						Query *parseTree,
		 				Plan *plan,
						EState *estate);
static void EndPlan(Plan *plan,
						EState *estate);
69
static TupleTableSlot *ExecutePlan(EState *estate, Plan *plan,
70 71 72 73 74
						CmdType operation, 
						int offsetTuples,
						int numberTuples,
						ScanDirection direction,
						DestReceiver *destfunc);
75
static void ExecRetrieve(TupleTableSlot *slot,
76 77
						DestReceiver *destfunc,
						EState *estate);
78
static void ExecAppend(TupleTableSlot *slot, ItemPointer tupleid,
79
		   				EState *estate);
80
static void ExecDelete(TupleTableSlot *slot, ItemPointer tupleid,
81
		   				EState *estate);
82
static void ExecReplace(TupleTableSlot *slot, ItemPointer tupleid,
83
						EState *estate);
84 85 86 87

TupleTableSlot *EvalPlanQual(EState *estate, Index rti, ItemPointer tid);
static TupleTableSlot *EvalPlanQualNext(EState *estate);

88 89 90

/* end of local decls */

Marc G. Fournier's avatar
Marc G. Fournier committed
91
#ifdef QUERY_LIMIT
92
static int	queryLimit = ALL_TUPLES;
93

Marc G. Fournier's avatar
Marc G. Fournier committed
94 95 96 97 98 99
#undef ALL_TUPLES
#define ALL_TUPLES queryLimit

int
ExecutorLimit(int limit)
{
100
	return queryLimit = limit;
Marc G. Fournier's avatar
Marc G. Fournier committed
101
}
102

Bruce Momjian's avatar
Bruce Momjian committed
103 104 105 106 107 108
int
ExecutorGetLimit()
{
	return queryLimit;
}

109
#endif
Marc G. Fournier's avatar
Marc G. Fournier committed
110

111
/* ----------------------------------------------------------------
112 113 114 115 116 117 118
 *		ExecutorStart
 *
 *		This routine must be called at the beginning of any execution of any
 *		query plan
 *
 *		returns (AttrInfo*) which describes the attributes of the tuples to
 *		be returned by the query.
119 120 121 122
 *
 * ----------------------------------------------------------------
 */
TupleDesc
123
ExecutorStart(QueryDesc *queryDesc, EState *estate)
124
{
125
	TupleDesc	result;
126 127 128

	/* sanity checks */
	Assert(queryDesc != NULL);
129

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
130 131
	if (queryDesc->plantree->nParamExec > 0)
	{
132 133 134
		estate->es_param_exec_vals = (ParamExecData *)
			palloc(queryDesc->plantree->nParamExec * sizeof(ParamExecData));
		memset(estate->es_param_exec_vals, 0, queryDesc->plantree->nParamExec * sizeof(ParamExecData));
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
135
	}
136

137 138 139
	/*
	 * Make our own private copy of the current queries snapshot data
	 */
140
	if (QuerySnapshot == NULL)
141
		estate->es_snapshot = NULL;
142
	else
143
	{
144 145 146 147 148
		estate->es_snapshot = (Snapshot)palloc(sizeof(SnapshotData));
		memcpy(estate->es_snapshot, QuerySnapshot, sizeof(SnapshotData));
		if (estate->es_snapshot->xcnt > 0)
		{
			estate->es_snapshot->xip = (TransactionId *)
149
					palloc(estate->es_snapshot->xcnt * sizeof(TransactionId));
150
			memcpy(estate->es_snapshot->xip, QuerySnapshot->xip,
151
					estate->es_snapshot->xcnt * sizeof(TransactionId));
152
		}
153
	}
154

155 156 157
	/*
	 * Initialize the plan
	 */
158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173
	result = InitPlan(queryDesc->operation,
					  queryDesc->parsetree,
					  queryDesc->plantree,
					  estate);

	/*
	 * reset buffer refcount.  the current refcounts are saved and will be
	 * restored when ExecutorEnd is called
	 *
	 * this makes sure that when ExecutorRun's are called recursively as for
	 * postquel functions, the buffers pinned by one ExecutorRun will not
	 * be unpinned by another ExecutorRun.
	 */
	BufferRefCountReset(estate->es_refcount);

	return result;
174 175 176
}

/* ----------------------------------------------------------------
177 178 179 180 181 182 183
 *		ExecutorRun
 *
 *		This is the main routine of the executor module. It accepts
 *		the query descriptor from the traffic cop and executes the
 *		query plan.
 *
 *		ExecutorStart must have been called already.
184
 *
185 186 187 188 189 190
 *		the different features supported are:
 *			 EXEC_RUN:	retrieve all tuples in the forward direction
 *			 EXEC_FOR:	retrieve 'count' number of tuples in the forward dir
 *			 EXEC_BACK: retrieve 'count' number of tuples in the backward dir
 *			 EXEC_RETONE: return one tuple but don't 'retrieve' it
 *						   used in postquel function processing
191 192 193 194
 *
 *
 * ----------------------------------------------------------------
 */
195
TupleTableSlot *
196 197
ExecutorRun(QueryDesc *queryDesc, EState *estate, int feature, 
					Node *limoffset, Node *limcount)
198
{
199 200
	CmdType			operation;
	Plan		   *plan;
201
	TupleTableSlot *result;
202 203
	CommandDest		dest;
	DestReceiver   *destfunc;
204 205
	int				offset = 0;
	int				count = 0;
206

Bruce Momjian's avatar
Bruce Momjian committed
207
	/*
208
	 *	sanity checks
209
	 */
210 211
	Assert(queryDesc != NULL);

Bruce Momjian's avatar
Bruce Momjian committed
212
	/*
213 214
	 *	extract information from the query descriptor
	 *	and the query feature.
215
	 */
216 217 218
	operation = queryDesc->operation;
	plan = queryDesc->plantree;
	dest = queryDesc->dest;
219
	destfunc = DestToFunction(dest);
220 221 222
	estate->es_processed = 0;
	estate->es_lastoid = InvalidOid;

Bruce Momjian's avatar
Bruce Momjian committed
223
	/*
224 225 226 227 228 229 230
	 *	FIXME: the dest setup function ought to be handed the tuple desc
	 *  for the tuples to be output, but I'm not quite sure how to get that
	 *  info at this point.  For now, passing NULL is OK because no existing
	 *  dest setup function actually uses the pointer.
	 */
	(*destfunc->setup) (destfunc, (TupleDesc) NULL);

Bruce Momjian's avatar
Bruce Momjian committed
231
    /*
232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
     *  if given get the offset of the LIMIT clause
     */
    if (limoffset != NULL)
    {
        Const       *coffset;
        Param       *poffset;
        ParamListInfo   paramLI;
		int	 i;
 
		switch (nodeTag(limoffset))
		{
			case T_Const:
				coffset = (Const *)limoffset;
				offset = (int)(coffset->constvalue);
				break;
 
			case T_Param:
				poffset = (Param *)limoffset;
				paramLI = estate->es_param_list_info;
 
				if (paramLI == NULL)
					elog(ERROR, "parameter for limit offset not in executor state");
				for (i = 0; paramLI[i].kind != PARAM_INVALID; i++)
				{
					if (paramLI[i].kind == PARAM_NUM && paramLI[i].id == poffset->paramid)
						break;
				}
				if (paramLI[i].kind == PARAM_INVALID)
					elog(ERROR, "parameter for limit offset not in executor state");
				if (paramLI[i].isnull)
					elog(ERROR, "limit offset cannot be NULL value");
				offset = (int)(paramLI[i].value);
 
				break;
 
			default:
				elog(ERROR, "unexpected node type %d as limit offset", nodeTag(limoffset));
		}
 
		if (offset < 0)
			elog(ERROR, "limit offset cannot be negative");
	}
 
Bruce Momjian's avatar
Bruce Momjian committed
275
	/*
276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318
	 *  if given get the count of the LIMIT clause
	 */
	if (limcount != NULL)
	{
	    Const       *ccount;
	    Param       *pcount;
	    ParamListInfo   paramLI;
	    int     i;
 
	    switch (nodeTag(limcount))
	    {
	        case T_Const:
	            ccount = (Const *)limcount;
	            count = (int)(ccount->constvalue);
	            break;
 
	        case T_Param:
	            pcount = (Param *)limcount;
	            paramLI = estate->es_param_list_info;
 
	            if (paramLI == NULL)
	                elog(ERROR, "parameter for limit count not in executor state");
	            for (i = 0; paramLI[i].kind != PARAM_INVALID; i++)
	            {
	                if (paramLI[i].kind == PARAM_NUM && paramLI[i].id == pcount->paramid)
	                    break;
	            }
	            if (paramLI[i].kind == PARAM_INVALID)
	                elog(ERROR, "parameter for limit count not in executor state");
	            if (paramLI[i].isnull)
	                elog(ERROR, "limit count cannot be NULL value");
	            count = (int)(paramLI[i].value);
 
	            break;
 
	        default:
	            elog(ERROR, "unexpected node type %d as limit count", nodeTag(limcount));
	    }
 
	    if (count < 0)
	        elog(ERROR, "limit count cannot be negative");
	}

319 320 321
	switch (feature)
	{

322 323 324 325
		case EXEC_RUN:
			result = ExecutePlan(estate,
								 plan,
								 operation,
326 327
								 offset,
								 count,
328
								 ForwardScanDirection,
329
								 destfunc);
330 331 332 333 334
			break;
		case EXEC_FOR:
			result = ExecutePlan(estate,
								 plan,
								 operation,
335
								 offset,
336 337
								 count,
								 ForwardScanDirection,
338
								 destfunc);
339
			break;
340

Bruce Momjian's avatar
Bruce Momjian committed
341
			/*
342 343 344 345 346 347
			 *		retrieve next n "backward" tuples
			 */
		case EXEC_BACK:
			result = ExecutePlan(estate,
								 plan,
								 operation,
348
								 offset,
349 350
								 count,
								 BackwardScanDirection,
351
								 destfunc);
352
			break;
353

Bruce Momjian's avatar
Bruce Momjian committed
354
			/*
355 356 357 358 359 360 361
			 *		return one tuple but don't "retrieve" it.
			 *		(this is used by the rule manager..) -cim 9/14/89
			 */
		case EXEC_RETONE:
			result = ExecutePlan(estate,
								 plan,
								 operation,
362
								 0,
363 364
								 ONE_TUPLE,
								 ForwardScanDirection,
365
								 destfunc);
366 367 368 369 370
			break;
		default:
			result = NULL;
			elog(DEBUG, "ExecutorRun: Unknown feature %d", feature);
			break;
371 372
	}

373 374
	(*destfunc->cleanup) (destfunc);

375
	return result;
376 377 378
}

/* ----------------------------------------------------------------
379 380 381 382 383 384 385
 *		ExecutorEnd
 *
 *		This routine must be called at the end of any execution of any
 *		query plan
 *
 *		returns (AttrInfo*) which describes the attributes of the tuples to
 *		be returned by the query.
386 387 388 389
 *
 * ----------------------------------------------------------------
 */
void
390
ExecutorEnd(QueryDesc *queryDesc, EState *estate)
391
{
392 393
	/* sanity checks */
	Assert(queryDesc != NULL);
394

395
	EndPlan(queryDesc->plantree, estate);
396

397 398
	/* restore saved refcounts. */
	BufferRefCountRestore(estate->es_refcount);
399 400
}

401
void
402
ExecCheckPerms(CmdType operation,
403
			   int resultRelation,
404 405
			   List *rangeTable,
			   Query *parseTree)
406
{
407 408
	int			i = 1;
	Oid			relid;
409
	HeapTuple	htup;
410 411 412 413 414 415 416 417
	List	   *lp;
	List	   *qvars,
			   *tvars;
	int32		ok = 1,
				aclcheck_result = -1;
	char	   *opstr;
	NameData	rname;
	char	   *userName;
418 419 420 421 422 423 424

#define CHECK(MODE)		pg_aclcheck(rname.data, userName, MODE)

	userName = GetPgUserName();

	foreach(lp, rangeTable)
	{
425
		RangeTblEntry *rte = lfirst(lp);
426

Marc G. Fournier's avatar
Marc G. Fournier committed
427 428
		if (rte->skipAcl)
		{
429

Marc G. Fournier's avatar
Marc G. Fournier committed
430
			/*
431 432 433 434
			 * This happens if the access to this table is due to a view
			 * query rewriting - the rewrite handler checked the
			 * permissions against the view owner, so we just skip this
			 * entry.
Marc G. Fournier's avatar
Marc G. Fournier committed
435 436 437 438
			 */
			continue;
		}

439
		relid = rte->relid;
440
		htup = SearchSysCacheTuple(RELOID,
441 442
								   ObjectIdGetDatum(relid),
								   0, 0, 0);
443
		if (!HeapTupleIsValid(htup))
444
			elog(ERROR, "ExecCheckPerms: bogus RT relid: %d",
445
				 relid);
446
		StrNCpy(rname.data,
447
				((Form_pg_class) GETSTRUCT(htup))->relname.data,
448
				NAMEDATALEN);
449 450 451 452 453 454 455 456 457 458 459 460 461 462 463
		if (i == resultRelation)
		{						/* this is the result relation */
			qvars = pull_varnos(parseTree->qual);
			tvars = pull_varnos((Node *) parseTree->targetList);
			if (intMember(resultRelation, qvars) ||
				intMember(resultRelation, tvars))
			{
				/* result relation is scanned */
				ok = ((aclcheck_result = CHECK(ACL_RD)) == ACLCHECK_OK);
				opstr = "read";
				if (!ok)
					break;
			}
			switch (operation)
			{
464 465 466 467 468 469 470 471 472 473 474
				case CMD_INSERT:
					ok = ((aclcheck_result = CHECK(ACL_AP)) == ACLCHECK_OK) ||
						((aclcheck_result = CHECK(ACL_WR)) == ACLCHECK_OK);
					opstr = "append";
					break;
				case CMD_DELETE:
				case CMD_UPDATE:
					ok = ((aclcheck_result = CHECK(ACL_WR)) == ACLCHECK_OK);
					opstr = "write";
					break;
				default:
475
					elog(ERROR, "ExecCheckPerms: bogus operation %d",
476
						 operation);
477 478 479 480 481 482 483
			}
		}
		else
		{
			ok = ((aclcheck_result = CHECK(ACL_RD)) == ACLCHECK_OK);
			opstr = "read";
		}
484
		if (!ok)
485 486
			break;
		++i;
487 488
	}
	if (!ok)
489
		elog(ERROR, "%s: %s", rname.data, aclcheck_error_strings[aclcheck_result]);
490

491
	if (parseTree != NULL && parseTree->rowMark != NULL)
492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
	{
		foreach(lp, parseTree->rowMark)
		{
			RowMark	   *rm = lfirst(lp);

			if (!(rm->info & ROW_ACL_FOR_UPDATE))
				continue;

			relid = ((RangeTblEntry *)nth(rm->rti - 1, rangeTable))->relid;
			htup = SearchSysCacheTuple(RELOID,
								   ObjectIdGetDatum(relid),
								   0, 0, 0);
			if (!HeapTupleIsValid(htup))
				elog(ERROR, "ExecCheckPerms: bogus RT relid: %d",
					 relid);
			StrNCpy(rname.data,
					((Form_pg_class) GETSTRUCT(htup))->relname.data,
					NAMEDATALEN);
			ok = ((aclcheck_result = CHECK(ACL_WR)) == ACLCHECK_OK);
			opstr = "write";
			if (!ok)
				elog(ERROR, "%s: %s", rname.data, aclcheck_error_strings[aclcheck_result]);
		}
	}
516 517
}

518 519 520 521 522 523 524
/* ===============================================================
 * ===============================================================
						 static routines follow
 * ===============================================================
 * ===============================================================
 */

525 526 527
typedef struct execRowMark
{
	Relation	relation;
528
	Index		rti;
529 530
	char		resname[32];
} execRowMark;
531

532 533 534 535 536 537 538 539
typedef struct evalPlanQual
{
	Plan				   *plan;
	Index					rti;
	EState					estate;
	struct evalPlanQual	   *free;
} evalPlanQual;

540
/* ----------------------------------------------------------------
541 542 543 544
 *		InitPlan
 *
 *		Initializes the query plan: open files, allocate storage
 *		and start up the rule manager
545 546
 * ----------------------------------------------------------------
 */
547
static TupleDesc
548
InitPlan(CmdType operation, Query *parseTree, Plan *plan, EState *estate)
549
{
550 551 552 553 554 555
	List		   *rangeTable;
	int				resultRelation;
	Relation		intoRelationDesc;
	TupleDesc		tupType;
	List		   *targetList;
	int				len;
556

Bruce Momjian's avatar
Bruce Momjian committed
557
	/*
558
	 *	get information from query descriptor
559
	 */
560 561
	rangeTable = parseTree->rtable;
	resultRelation = parseTree->resultRelation;
562

563 564 565 566
#ifndef NO_SECURITY
	ExecCheckPerms(operation, resultRelation, rangeTable, parseTree);
#endif

Bruce Momjian's avatar
Bruce Momjian committed
567
	/*
568
	 *	initialize the node's execution state
569
	 */
570 571
	estate->es_range_table = rangeTable;

Bruce Momjian's avatar
Bruce Momjian committed
572
	/*
573 574 575 576
	 *	initialize the BaseId counter so node base_id's
	 *	are assigned correctly.  Someday baseid's will have to
	 *	be stored someplace other than estate because they
	 *	should be unique per query planned.
577
	 */
578
	estate->es_BaseId = 1;
579

Bruce Momjian's avatar
Bruce Momjian committed
580
	/*
581 582
	 *	initialize result relation stuff
	 */
583

584 585
	if (resultRelation != 0 && operation != CMD_SELECT)
	{
Bruce Momjian's avatar
Bruce Momjian committed
586
		/*
587 588
		 *	  if we have a result relation, open it and
		 *	  initialize the result relation info stuff.
589
		 */
590 591 592 593 594
		RelationInfo *resultRelationInfo;
		Index		resultRelationIndex;
		RangeTblEntry *rtentry;
		Oid			resultRelationOid;
		Relation	resultRelationDesc;
595 596 597 598 599 600 601

		resultRelationIndex = resultRelation;
		rtentry = rt_fetch(resultRelationIndex, rangeTable);
		resultRelationOid = rtentry->relid;
		resultRelationDesc = heap_open(resultRelationOid);

		if (resultRelationDesc->rd_rel->relkind == RELKIND_SEQUENCE)
602
			elog(ERROR, "You can't change sequence relation %s",
603 604
				 resultRelationDesc->rd_rel->relname.data);

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
605
		LockRelation(resultRelationDesc, RowExclusiveLock);
606 607 608 609 610 611 612

		resultRelationInfo = makeNode(RelationInfo);
		resultRelationInfo->ri_RangeTableIndex = resultRelationIndex;
		resultRelationInfo->ri_RelationDesc = resultRelationDesc;
		resultRelationInfo->ri_NumIndices = 0;
		resultRelationInfo->ri_IndexRelationDescs = NULL;
		resultRelationInfo->ri_IndexRelationInfo = NULL;
613

Bruce Momjian's avatar
Bruce Momjian committed
614
		/*
615 616
		 *	open indices on result relation and save descriptors
		 *	in the result relation information..
617
		 */
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
618 619
		if (operation != CMD_DELETE)
			ExecOpenIndices(resultRelationOid, resultRelationInfo);
620 621

		estate->es_result_relation_info = resultRelationInfo;
622
	}
623 624
	else
	{
Bruce Momjian's avatar
Bruce Momjian committed
625
		/*
626 627 628 629 630
		 *		if no result relation, then set state appropriately
		 */
		estate->es_result_relation_info = NULL;
	}

631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652
	/*
	 * Have to lock relations selected for update
	 */
	estate->es_rowMark = NULL;
	if (parseTree->rowMark != NULL)
	{
		Relation		relation;
		Oid				relid;
		RowMark		   *rm;
		List		   *l;
		execRowMark	   *erm;

		foreach(l, parseTree->rowMark)
		{
			rm = lfirst(l);
			relid = ((RangeTblEntry *)nth(rm->rti - 1, rangeTable))->relid;
			relation = heap_open(relid);
			LockRelation(relation, RowShareLock);
			if (!(rm->info & ROW_MARK_FOR_UPDATE))
				continue;
			erm = (execRowMark*) palloc(sizeof(execRowMark));
			erm->relation = relation;
653
			erm->rti = rm->rti;
654 655 656 657
			sprintf(erm->resname, "ctid%u", rm->rti);
			estate->es_rowMark = lappend(estate->es_rowMark, erm);
		}
	}
658

Bruce Momjian's avatar
Bruce Momjian committed
659
	/*
660 661 662
	 *	  initialize the executor "tuple" table.
	 */
	{
663 664
		int			nSlots = ExecCountSlotsNode(plan);
		TupleTable	tupleTable = ExecCreateTupleTable(nSlots + 10);		/* why add ten? - jolly */
665

666 667
		estate->es_tupleTable = tupleTable;
	}
668

Bruce Momjian's avatar
Bruce Momjian committed
669
	/*
670 671 672 673 674 675 676
	 *	   initialize the private state information for
	 *	   all the nodes in the query tree.  This opens
	 *	   files, allocates storage and leaves us ready
	 *	   to start processing tuples..
	 */
	ExecInitNode(plan, estate, NULL);

Bruce Momjian's avatar
Bruce Momjian committed
677
	/*
678 679 680 681 682 683 684 685
	 *	   get the tuple descriptor describing the type
	 *	   of tuples to return.. (this is especially important
	 *	   if we are creating a relation with "retrieve into")
	 */
	tupType = ExecGetTupType(plan);		/* tuple descriptor */
	targetList = plan->targetlist;
	len = ExecTargetListLength(targetList);		/* number of attributes */

Bruce Momjian's avatar
Bruce Momjian committed
686
	/*
687 688 689 690 691 692
	 *	  now that we have the target list, initialize the junk filter
	 *	  if this is a REPLACE or a DELETE query.
	 *	  We also init the junk filter if this is an append query
	 *	  (there might be some rule lock info there...)
	 *	  NOTE: in the future we might want to initialize the junk
	 *	  filter for all queries.
693 694
	 *		  SELECT added by daveh@insightdist.com  5/20/98 to allow
	 *		  ORDER/GROUP BY have an identifier missing from the target.
695 696
	 */
	{
697 698 699
		bool		junk_filter_needed = false;
		List	   *tlist;

700
		if (operation == CMD_SELECT)
701 702 703
		{
			foreach(tlist, targetList)
			{
704 705
				TargetEntry *tle = lfirst(tlist);

706 707 708 709 710 711 712 713 714 715 716 717 718
				if (tle->resdom->resjunk)
				{
					junk_filter_needed = true;
					break;
				}
			}
		}

		if (operation == CMD_UPDATE || operation == CMD_DELETE ||
			operation == CMD_INSERT ||
			(operation == CMD_SELECT && junk_filter_needed))
		{
			JunkFilter *j = (JunkFilter *) ExecInitJunkFilter(targetList);
719

720
			estate->es_junkFilter = j;
721

722 723 724 725 726 727
			if (operation == CMD_SELECT)
				tupType = j->jf_cleanTupType;
		}
		else
			estate->es_junkFilter = NULL;
	}
728

Bruce Momjian's avatar
Bruce Momjian committed
729
	/*
730 731 732 733 734 735
	 *	initialize the "into" relation
	 */
	intoRelationDesc = (Relation) NULL;

	if (operation == CMD_SELECT)
	{
736 737 738
		char	   *intoName;
		Oid			intoRelationId;
		TupleDesc	tupdesc;
739 740 741 742 743 744 745 746 747

		if (!parseTree->isPortal)
		{

			/*
			 * a select into table
			 */
			if (parseTree->into != NULL)
			{
Bruce Momjian's avatar
Bruce Momjian committed
748
				/*
749 750 751 752 753 754 755 756 757
				 *	create the "into" relation
				 */
				intoName = parseTree->into;

				/*
				 * have to copy tupType to get rid of constraints
				 */
				tupdesc = CreateTupleDescCopy(tupType);

758
				intoRelationId = heap_create_with_catalog(intoName,
759
								  tupdesc, RELKIND_RELATION,parseTree->isTemp);
760

761 762
				FreeTupleDesc(tupdesc);

Bruce Momjian's avatar
Bruce Momjian committed
763
				/*
764 765 766 767 768 769 770 771 772 773 774 775 776 777 778
				 *	XXX rather than having to call setheapoverride(true)
				 *		and then back to false, we should change the
				 *		arguments to heap_open() instead..
				 */
				setheapoverride(true);

				intoRelationDesc = heap_open(intoRelationId);

				setheapoverride(false);
			}
		}
	}

	estate->es_into_relation_descriptor = intoRelationDesc;

779 780 781 782 783
	estate->es_origPlan = plan;
	estate->es_evalPlanQual = NULL;
	estate->es_evTuple = NULL;
	estate->es_useEvalPlan = false;

784
	return tupType;
785 786 787
}

/* ----------------------------------------------------------------
788 789 790
 *		EndPlan
 *
 *		Cleans up the query plan -- closes files and free up storages
791 792 793
 * ----------------------------------------------------------------
 */
static void
794
EndPlan(Plan *plan, EState *estate)
795
{
796 797
	RelationInfo *resultRelationInfo;
	Relation	intoRelationDesc;
798

Bruce Momjian's avatar
Bruce Momjian committed
799
	/*
800
	 *	get information from state
801
	 */
802 803 804
	resultRelationInfo = estate->es_result_relation_info;
	intoRelationDesc = estate->es_into_relation_descriptor;

Bruce Momjian's avatar
Bruce Momjian committed
805
	/*
806 807 808 809
	 *	 shut down the query
	 */
	ExecEndNode(plan, plan);

Bruce Momjian's avatar
Bruce Momjian committed
810
	/*
811 812 813
	 *	  destroy the executor "tuple" table.
	 */
	{
814
		TupleTable	tupleTable = (TupleTable) estate->es_tupleTable;
815 816 817 818 819

		ExecDestroyTupleTable(tupleTable, true);		/* was missing last arg */
		estate->es_tupleTable = NULL;
	}

Bruce Momjian's avatar
Bruce Momjian committed
820
	/*
821 822 823 824
	 *	 close the result relations if necessary
	 */
	if (resultRelationInfo != NULL)
	{
825
		Relation	resultRelationDesc;
826 827 828 829

		resultRelationDesc = resultRelationInfo->ri_RelationDesc;
		heap_close(resultRelationDesc);

Bruce Momjian's avatar
Bruce Momjian committed
830
		/*
831 832 833 834 835
		 *	close indices on the result relation
		 */
		ExecCloseIndices(resultRelationInfo);
	}

Bruce Momjian's avatar
Bruce Momjian committed
836
	/*
837 838 839 840
	 *	 close the "into" relation if necessary
	 */
	if (intoRelationDesc != NULL)
		heap_close(intoRelationDesc);
841 842 843
}

/* ----------------------------------------------------------------
844 845 846 847 848 849 850 851
 *		ExecutePlan
 *
 *		processes the query plan to retrieve 'tupleCount' tuples in the
 *		direction specified.
 *		Retrieves all tuples if tupleCount is 0
 *
 *		result is either a slot containing a tuple in the case
 *		of a RETRIEVE or NULL otherwise.
852 853 854 855 856 857 858 859
 *
 * ----------------------------------------------------------------
 */

/* the ctid attribute is a 'junk' attribute that is removed before the
   user can see it*/

static TupleTableSlot *
860 861
ExecutePlan(EState *estate,
			Plan *plan,
862
			CmdType operation,
863
			int offsetTuples,
864 865
			int numberTuples,
			ScanDirection direction,
866
			DestReceiver* destfunc)
867
{
868
	JunkFilter *junkfilter;
869 870

	TupleTableSlot *slot;
871
	ItemPointer tupleid = NULL;
872
	ItemPointerData tuple_ctid;
873
	int			current_tuple_count;
874 875
	TupleTableSlot *result;

Bruce Momjian's avatar
Bruce Momjian committed
876
	/*
877
	 *	initialize local variables
878
	 */
879 880 881 882
	slot = NULL;
	current_tuple_count = 0;
	result = NULL;

Bruce Momjian's avatar
Bruce Momjian committed
883
	/*
884
	 *	Set the direction.
885
	 */
886 887
	estate->es_direction = direction;

Bruce Momjian's avatar
Bruce Momjian committed
888
	/*
889 890 891 892 893 894
	 *	Loop until we've processed the proper number
	 *	of tuples from the plan..
	 */

	for (;;)
	{
Bruce Momjian's avatar
Bruce Momjian committed
895
		/*
896 897 898
		 *	Execute the plan and obtain a tuple
		 */
		/* at the top level, the parent of a plan (2nd arg) is itself */
899 900 901 902 903 904 905 906 907
lnext:;
		if (estate->es_useEvalPlan)
		{
			slot = EvalPlanQualNext(estate);
			if (TupIsNull(slot))
				slot = ExecProcNode(plan, plan);
		}
		else
			slot = ExecProcNode(plan, plan);
908

Bruce Momjian's avatar
Bruce Momjian committed
909
		/*
910 911 912 913 914 915 916 917
		 *	if the tuple is null, then we assume
		 *	there is nothing more to process so
		 *	we just return null...
		 */
		if (TupIsNull(slot))
		{
			result = NULL;
			break;
918 919
		}

Bruce Momjian's avatar
Bruce Momjian committed
920
		/*
921 922 923 924 925 926 927 928 929 930 931 932
		 *  For now we completely execute the plan and skip
		 *  result tuples if requested by LIMIT offset.
		 *  Finally we should try to do it in deeper levels
		 *  if possible (during index scan)
		 *  - Jan
		 */
		if (offsetTuples > 0)
		{
			--offsetTuples;
			continue;
		}

Bruce Momjian's avatar
Bruce Momjian committed
933
		/*
934 935 936 937 938 939
		 *		if we have a junk filter, then project a new
		 *		tuple with the junk removed.
		 *
		 *		Store this new "clean" tuple in the place of the
		 *		original tuple.
		 *
940
		 *		Also, extract all the junk information we need.
941 942 943
		 */
		if ((junkfilter = estate->es_junkFilter) != (JunkFilter *) NULL)
		{
944 945 946
			Datum		datum;
			HeapTuple	newTuple;
			bool		isNull;
947

Bruce Momjian's avatar
Bruce Momjian committed
948
			/*
949 950 951 952 953 954 955 956 957
			 * extract the 'ctid' junk attribute.
			 */
			if (operation == CMD_UPDATE || operation == CMD_DELETE)
			{
				if (!ExecGetJunkAttribute(junkfilter,
										  slot,
										  "ctid",
										  &datum,
										  &isNull))
958
					elog(ERROR, "ExecutePlan: NO (junk) `ctid' was found!");
959 960

				if (isNull)
961
					elog(ERROR, "ExecutePlan: (junk) `ctid' is NULL!");
962 963 964 965 966 967

				tupleid = (ItemPointer) DatumGetPointer(datum);
				tuple_ctid = *tupleid;	/* make sure we don't free the
										 * ctid!! */
				tupleid = &tuple_ctid;
			}
968 969 970 971 972 973
			else if (estate->es_rowMark != NULL)
			{
				List		   *l;
				execRowMark	   *erm;
				Buffer			buffer;
				HeapTupleData	tuple;
974
				TupleTableSlot *newSlot;
975 976
				int				test;

977
lmark:;
978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001
				foreach (l, estate->es_rowMark)
				{
					erm = lfirst(l);
					if (!ExecGetJunkAttribute(junkfilter,
											  slot,
											  erm->resname,
											  &datum,
											  &isNull))
						elog(ERROR, "ExecutePlan: NO (junk) `%s' was found!", erm->resname);

					if (isNull)
						elog(ERROR, "ExecutePlan: (junk) `%s' is NULL!", erm->resname);

					tuple.t_self = *((ItemPointer) DatumGetPointer(datum));
					test = heap_mark4update(erm->relation, &tuple, &buffer);
					ReleaseBuffer(buffer);
					switch (test)
					{
						case HeapTupleSelfUpdated:
						case HeapTupleMayBeUpdated:
							break;

						case HeapTupleUpdated:
							if (XactIsoLevel == XACT_SERIALIZABLE)
1002
							{
1003
								elog(ERROR, "Can't serialize access due to concurrent update");
1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022
								return(NULL);
							}
							else if (!(ItemPointerEquals(&(tuple.t_self), 
										(ItemPointer)DatumGetPointer(datum))))
							{
 								newSlot = EvalPlanQual(estate, erm->rti, &(tuple.t_self));
								if (!(TupIsNull(newSlot)))
								{
									slot = newSlot;
									estate->es_useEvalPlan = true;
									goto lmark;
								}
							}
							/* 
							 * if tuple was deleted or PlanQual failed
							 * for updated tuple - we have not return
							 * this tuple!
							 */
							goto lnext;
1023 1024 1025 1026 1027 1028 1029

						default:
							elog(ERROR, "Unknown status %u from heap_mark4update", test);
							return(NULL);
					}
				}
			}
1030

Bruce Momjian's avatar
Bruce Momjian committed
1031
			/*
1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043
			 * Finally create a new "clean" tuple with all junk attributes
			 * removed
			 */
			newTuple = ExecRemoveJunk(junkfilter, slot);

			slot = ExecStoreTuple(newTuple,		/* tuple to store */
								  slot, /* destination slot */
								  InvalidBuffer,		/* this tuple has no
														 * buffer */
								  true);		/* tuple should be pfreed */
		}						/* if (junkfilter... */

Bruce Momjian's avatar
Bruce Momjian committed
1044
		/*
1045 1046 1047 1048 1049 1050 1051 1052
		 *		now that we have a tuple, do the appropriate thing
		 *		with it.. either return it to the user, add
		 *		it to a relation someplace, delete it from a
		 *		relation, or modify some of it's attributes.
		 */

		switch (operation)
		{
1053 1054
			case CMD_SELECT:
				ExecRetrieve(slot,		/* slot containing tuple */
1055
							 destfunc,	/* destination's tuple-receiver obj */
1056 1057 1058
							 estate);	/* */
				result = slot;
				break;
1059

1060 1061 1062 1063
			case CMD_INSERT:
				ExecAppend(slot, tupleid, estate);
				result = NULL;
				break;
1064

1065 1066 1067 1068
			case CMD_DELETE:
				ExecDelete(slot, tupleid, estate);
				result = NULL;
				break;
1069

1070
			case CMD_UPDATE:
1071
				ExecReplace(slot, tupleid, estate);
1072 1073
				result = NULL;
				break;
1074

1075 1076
			default:
				elog(DEBUG, "ExecutePlan: unknown operation in queryDesc");
1077
				result = NULL;
1078
				break;
1079
		}
Bruce Momjian's avatar
Bruce Momjian committed
1080
		/*
1081 1082 1083 1084 1085 1086 1087
		 *		check our tuple count.. if we've returned the
		 *		proper number then return, else loop again and
		 *		process more tuples..
		 */
		current_tuple_count += 1;
		if (numberTuples == current_tuple_count)
			break;
1088
	}
1089

Bruce Momjian's avatar
Bruce Momjian committed
1090
	/*
1091 1092
	 *	here, result is either a slot containing a tuple in the case
	 *	of a RETRIEVE or NULL otherwise.
1093
	 */
1094
	return result;
1095 1096 1097
}

/* ----------------------------------------------------------------
1098
 *		ExecRetrieve
1099
 *
1100 1101 1102 1103 1104
 *		RETRIEVEs are easy.. we just pass the tuple to the appropriate
 *		print function.  The only complexity is when we do a
 *		"retrieve into", in which case we insert the tuple into
 *		the appropriate relation (note: this is a newly created relation
 *		so we don't need to worry about indices or locks.)
1105 1106 1107
 * ----------------------------------------------------------------
 */
static void
1108
ExecRetrieve(TupleTableSlot *slot,
1109
			 DestReceiver *destfunc,
1110
			 EState *estate)
1111
{
1112 1113
	HeapTuple	tuple;
	TupleDesc	attrtype;
1114

Bruce Momjian's avatar
Bruce Momjian committed
1115
	/*
1116 1117 1118 1119 1120
	 *	get the heap tuple out of the tuple table slot
	 */
	tuple = slot->val;
	attrtype = slot->ttc_tupleDescriptor;

Bruce Momjian's avatar
Bruce Momjian committed
1121
	/*
1122 1123 1124 1125 1126 1127 1128 1129
	 *	insert the tuple into the "into relation"
	 */
	if (estate->es_into_relation_descriptor != NULL)
	{
		heap_insert(estate->es_into_relation_descriptor, tuple);
		IncrAppended();
	}

Bruce Momjian's avatar
Bruce Momjian committed
1130
	/*
1131 1132
	 *	send the tuple to the front end (or the screen)
	 */
1133
	(*destfunc->receiveTuple) (tuple, attrtype, destfunc);
1134 1135
	IncrRetrieved();
	(estate->es_processed)++;
1136 1137 1138
}

/* ----------------------------------------------------------------
1139
 *		ExecAppend
1140
 *
1141 1142 1143
 *		APPENDs are trickier.. we have to insert the tuple into
 *		the base relation and insert appropriate tuples into the
 *		index relations.
1144 1145 1146 1147
 * ----------------------------------------------------------------
 */

static void
1148
ExecAppend(TupleTableSlot *slot,
1149
		   ItemPointer tupleid,
1150
		   EState *estate)
1151
{
1152 1153 1154 1155 1156
	HeapTuple	tuple;
	RelationInfo *resultRelationInfo;
	Relation	resultRelationDesc;
	int			numIndices;
	Oid			newId;
1157

Bruce Momjian's avatar
Bruce Momjian committed
1158
	/*
1159 1160 1161 1162
	 *	get the heap tuple out of the tuple table slot
	 */
	tuple = slot->val;

Bruce Momjian's avatar
Bruce Momjian committed
1163
	/*
1164 1165 1166 1167 1168
	 *	get information on the result relation
	 */
	resultRelationInfo = estate->es_result_relation_info;
	resultRelationDesc = resultRelationInfo->ri_RelationDesc;

Bruce Momjian's avatar
Bruce Momjian committed
1169
	/*
1170 1171 1172 1173 1174 1175 1176 1177
	 *	have to add code to preform unique checking here.
	 *	cim -12/1/89
	 */

	/* BEFORE ROW INSERT Triggers */
	if (resultRelationDesc->trigdesc &&
	resultRelationDesc->trigdesc->n_before_row[TRIGGER_EVENT_INSERT] > 0)
	{
1178
		HeapTuple	newtuple;
1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192

		newtuple = ExecBRInsertTriggers(resultRelationDesc, tuple);

		if (newtuple == NULL)	/* "do nothing" */
			return;

		if (newtuple != tuple)	/* modified by Trigger(s) */
		{
			Assert(slot->ttc_shouldFree);
			pfree(tuple);
			slot->val = tuple = newtuple;
		}
	}

Bruce Momjian's avatar
Bruce Momjian committed
1193
	/*
1194 1195 1196 1197 1198
	 * Check the constraints of a tuple
	 */

	if (resultRelationDesc->rd_att->constr)
	{
1199
		ExecConstraints("ExecAppend", resultRelationDesc, tuple, estate);
1200 1201
	}

Bruce Momjian's avatar
Bruce Momjian committed
1202
	/*
1203 1204 1205 1206 1207 1208
	 *	insert the tuple
	 */
	newId = heap_insert(resultRelationDesc,		/* relation desc */
						tuple); /* heap tuple */
	IncrAppended();

Bruce Momjian's avatar
Bruce Momjian committed
1209
	/*
1210 1211 1212 1213 1214 1215 1216 1217
	 *	process indices
	 *
	 *	Note: heap_insert adds a new tuple to a relation.  As a side
	 *	effect, the tupleid of the new tuple is placed in the new
	 *	tuple's t_ctid field.
	 */
	numIndices = resultRelationInfo->ri_NumIndices;
	if (numIndices > 0)
1218
		ExecInsertIndexTuples(slot, &(tuple->t_self), estate, false);
1219 1220 1221 1222 1223 1224 1225
	(estate->es_processed)++;
	estate->es_lastoid = newId;

	/* AFTER ROW INSERT Triggers */
	if (resultRelationDesc->trigdesc &&
	 resultRelationDesc->trigdesc->n_after_row[TRIGGER_EVENT_INSERT] > 0)
		ExecARInsertTriggers(resultRelationDesc, tuple);
1226 1227 1228
}

/* ----------------------------------------------------------------
1229
 *		ExecDelete
1230
 *
1231 1232
 *		DELETE is like append, we delete the tuple and its
 *		index tuples.
1233 1234 1235
 * ----------------------------------------------------------------
 */
static void
1236
ExecDelete(TupleTableSlot *slot,
1237
		   ItemPointer tupleid,
1238
		   EState *estate)
1239
{
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1240 1241
	RelationInfo	   *resultRelationInfo;
	Relation			resultRelationDesc;
1242
	ItemPointerData		ctid;
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1243
	int					result;
1244

Bruce Momjian's avatar
Bruce Momjian committed
1245
	/*
1246 1247 1248 1249 1250 1251 1252 1253 1254
	 *	get the result relation information
	 */
	resultRelationInfo = estate->es_result_relation_info;
	resultRelationDesc = resultRelationInfo->ri_RelationDesc;

	/* BEFORE ROW DELETE Triggers */
	if (resultRelationDesc->trigdesc &&
	resultRelationDesc->trigdesc->n_before_row[TRIGGER_EVENT_DELETE] > 0)
	{
1255
		bool		dodelete;
1256

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1257
		dodelete = ExecBRDeleteTriggers(estate, tupleid);
1258 1259 1260 1261 1262

		if (!dodelete)			/* "do nothing" */
			return;
	}

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1263
	/*
1264 1265
	 *	delete the tuple
	 */
1266
ldelete:;
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1267 1268 1269 1270 1271 1272 1273 1274 1275 1276
	result = heap_delete(resultRelationDesc, tupleid, &ctid);
	switch (result)
	{
		case HeapTupleSelfUpdated:
			return;

		case HeapTupleMayBeUpdated:
			break;

		case HeapTupleUpdated:
1277 1278
			if (XactIsoLevel == XACT_SERIALIZABLE)
				elog(ERROR, "Can't serialize access due to concurrent update");
1279 1280
			else if (!(ItemPointerEquals(tupleid, &ctid)))
			{
1281
				TupleTableSlot *epqslot = EvalPlanQual(estate, 
1282 1283
						resultRelationInfo->ri_RangeTableIndex, &ctid);

1284
				if (!TupIsNull(epqslot))
1285 1286 1287 1288 1289
				{
					*tupleid = ctid;
					goto ldelete;
				}
			}
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1290 1291 1292 1293 1294 1295
			return;

		default:
			elog(ERROR, "Unknown status %u from heap_delete", result);
			return;
	}
1296 1297 1298 1299

	IncrDeleted();
	(estate->es_processed)++;

Bruce Momjian's avatar
Bruce Momjian committed
1300
	/*
1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313
	 *	Note: Normally one would think that we have to
	 *		  delete index tuples associated with the
	 *		  heap tuple now..
	 *
	 *		  ... but in POSTGRES, we have no need to do this
	 *		  because the vacuum daemon automatically
	 *		  opens an index scan and deletes index tuples
	 *		  when it finds deleted heap tuples. -cim 9/27/89
	 */

	/* AFTER ROW DELETE Triggers */
	if (resultRelationDesc->trigdesc &&
	 resultRelationDesc->trigdesc->n_after_row[TRIGGER_EVENT_DELETE] > 0)
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1314
		ExecARDeleteTriggers(estate, tupleid);
1315 1316 1317 1318

}

/* ----------------------------------------------------------------
1319
 *		ExecReplace
1320
 *
1321 1322 1323 1324 1325 1326
 *		note: we can't run replace queries with transactions
 *		off because replaces are actually appends and our
 *		scan will mistakenly loop forever, replacing the tuple
 *		it just appended..	This should be fixed but until it
 *		is, we don't want to get stuck in an infinite loop
 *		which corrupts your database..
1327 1328 1329
 * ----------------------------------------------------------------
 */
static void
1330
ExecReplace(TupleTableSlot *slot,
1331
			ItemPointer tupleid,
1332
			EState *estate)
1333
{
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1334 1335 1336
	HeapTuple			tuple;
	RelationInfo	   *resultRelationInfo;
	Relation			resultRelationDesc;
1337
	ItemPointerData		ctid;
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1338 1339
	int					result;
	int					numIndices;
1340

Bruce Momjian's avatar
Bruce Momjian committed
1341
	/*
1342 1343 1344 1345 1346 1347 1348 1349
	 *	abort the operation if not running transactions
	 */
	if (IsBootstrapProcessingMode())
	{
		elog(DEBUG, "ExecReplace: replace can't run without transactions");
		return;
	}

Bruce Momjian's avatar
Bruce Momjian committed
1350
	/*
1351 1352 1353 1354
	 *	get the heap tuple out of the tuple table slot
	 */
	tuple = slot->val;

Bruce Momjian's avatar
Bruce Momjian committed
1355
	/*
1356 1357 1358 1359 1360
	 *	get the result relation information
	 */
	resultRelationInfo = estate->es_result_relation_info;
	resultRelationDesc = resultRelationInfo->ri_RelationDesc;

Bruce Momjian's avatar
Bruce Momjian committed
1361
	/*
1362 1363 1364 1365 1366 1367 1368 1369 1370 1371
	 *	have to add code to preform unique checking here.
	 *	in the event of unique tuples, this becomes a deletion
	 *	of the original tuple affected by the replace.
	 *	cim -12/1/89
	 */

	/* BEFORE ROW UPDATE Triggers */
	if (resultRelationDesc->trigdesc &&
	resultRelationDesc->trigdesc->n_before_row[TRIGGER_EVENT_UPDATE] > 0)
	{
1372
		HeapTuple	newtuple;
1373

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1374
		newtuple = ExecBRUpdateTriggers(estate, tupleid, tuple);
1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386

		if (newtuple == NULL)	/* "do nothing" */
			return;

		if (newtuple != tuple)	/* modified by Trigger(s) */
		{
			Assert(slot->ttc_shouldFree);
			pfree(tuple);
			slot->val = tuple = newtuple;
		}
	}

Bruce Momjian's avatar
Bruce Momjian committed
1387
	/*
1388 1389 1390 1391 1392
	 * Check the constraints of a tuple
	 */

	if (resultRelationDesc->rd_att->constr)
	{
1393
		ExecConstraints("ExecReplace", resultRelationDesc, tuple, estate);
1394 1395
	}

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1396
	/*
1397 1398
	 *	replace the heap tuple
	 */
1399
lreplace:;
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1400 1401 1402 1403 1404 1405 1406 1407 1408 1409
	result = heap_replace(resultRelationDesc, tupleid, tuple, &ctid);
	switch (result)
	{
		case HeapTupleSelfUpdated:
			return;

		case HeapTupleMayBeUpdated:
			break;

		case HeapTupleUpdated:
1410 1411
			if (XactIsoLevel == XACT_SERIALIZABLE)
				elog(ERROR, "Can't serialize access due to concurrent update");
1412 1413
			else if (!(ItemPointerEquals(tupleid, &ctid)))
			{
1414
				TupleTableSlot *epqslot = EvalPlanQual(estate, 
1415 1416
						resultRelationInfo->ri_RangeTableIndex, &ctid);

1417
				if (!TupIsNull(epqslot))
1418 1419
				{
					*tupleid = ctid;
1420 1421
					tuple = ExecRemoveJunk(estate->es_junkFilter, epqslot);
					slot = ExecStoreTuple(tuple, slot, InvalidBuffer, true);
1422 1423 1424
					goto lreplace;
				}
			}
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1425 1426 1427 1428 1429
			return;

		default:
			elog(ERROR, "Unknown status %u from heap_replace", result);
			return;
1430 1431 1432 1433 1434
	}

	IncrReplaced();
	(estate->es_processed)++;

Bruce Momjian's avatar
Bruce Momjian committed
1435
	/*
1436 1437 1438 1439 1440 1441 1442 1443 1444
	 *	Note: instead of having to update the old index tuples
	 *		  associated with the heap tuple, all we do is form
	 *		  and insert new index tuples..  This is because
	 *		  replaces are actually deletes and inserts and
	 *		  index tuple deletion is done automagically by
	 *		  the vaccuum deamon.. All we do is insert new
	 *		  index tuples.  -cim 9/27/89
	 */

Bruce Momjian's avatar
Bruce Momjian committed
1445
	/*
1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456
	 *	process indices
	 *
	 *	heap_replace updates a tuple in the base relation by invalidating
	 *	it and then appending a new tuple to the relation.	As a side
	 *	effect, the tupleid of the new tuple is placed in the new
	 *	tuple's t_ctid field.  So we now insert index tuples using
	 *	the new tupleid stored there.
	 */

	numIndices = resultRelationInfo->ri_NumIndices;
	if (numIndices > 0)
1457
		ExecInsertIndexTuples(slot, &(tuple->t_self), estate, true);
1458 1459 1460 1461

	/* AFTER ROW UPDATE Triggers */
	if (resultRelationDesc->trigdesc &&
	 resultRelationDesc->trigdesc->n_after_row[TRIGGER_EVENT_UPDATE] > 0)
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1462
		ExecARUpdateTriggers(estate, tupleid, tuple);
1463
}
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1464

1465
#ifdef NOT_USED
1466
static HeapTuple
1467
ExecAttrDefault(Relation rel, HeapTuple tuple)
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1468
{
1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480
	int			ndef = rel->rd_att->constr->num_defval;
	AttrDefault *attrdef = rel->rd_att->constr->defval;
	ExprContext *econtext = makeNode(ExprContext);
	HeapTuple	newtuple;
	Node	   *expr;
	bool		isnull;
	bool		isdone;
	Datum		val;
	Datum	   *replValue = NULL;
	char	   *replNull = NULL;
	char	   *repl = NULL;
	int			i;
1481 1482 1483 1484 1485 1486

	econtext->ecxt_scantuple = NULL;	/* scan tuple slot */
	econtext->ecxt_innertuple = NULL;	/* inner tuple slot */
	econtext->ecxt_outertuple = NULL;	/* outer tuple slot */
	econtext->ecxt_relation = NULL;		/* relation */
	econtext->ecxt_relid = 0;	/* relid */
1487 1488
	econtext->ecxt_param_list_info = NULL;		/* param list info */
	econtext->ecxt_param_exec_vals = NULL;		/* exec param values */
1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
	econtext->ecxt_range_table = NULL;	/* range table */
	for (i = 0; i < ndef; i++)
	{
		if (!heap_attisnull(tuple, attrdef[i].adnum))
			continue;
		expr = (Node *) stringToNode(attrdef[i].adbin);

		val = ExecEvalExpr(expr, econtext, &isnull, &isdone);

		pfree(expr);

		if (isnull)
			continue;

		if (repl == NULL)
		{
			repl = (char *) palloc(rel->rd_att->natts * sizeof(char));
			replNull = (char *) palloc(rel->rd_att->natts * sizeof(char));
			replValue = (Datum *) palloc(rel->rd_att->natts * sizeof(Datum));
Bruce Momjian's avatar
Bruce Momjian committed
1508
			MemSet(repl, ' ', rel->rd_att->natts * sizeof(char));
1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519
		}

		repl[attrdef[i].adnum - 1] = 'r';
		replNull[attrdef[i].adnum - 1] = ' ';
		replValue[attrdef[i].adnum - 1] = val;

	}

	pfree(econtext);

	if (repl == NULL)
1520
		return tuple;
1521

1522
	newtuple = heap_modifytuple(tuple, rel, replValue, replNull, repl);
1523 1524

	pfree(repl);
1525
	pfree(tuple);
1526 1527 1528
	pfree(replNull);
	pfree(replValue);

1529
	return newtuple;
1530

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1531
}
1532

1533
#endif
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1534

1535
static char *
1536
ExecRelCheck(Relation rel, HeapTuple tuple, EState *estate)
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1537
{
1538 1539 1540
	int			ncheck = rel->rd_att->constr->num_check;
	ConstrCheck *check = rel->rd_att->constr->check;
	ExprContext *econtext = makeNode(ExprContext);
1541
	TupleTableSlot *slot = makeNode(TupleTableSlot);
1542 1543 1544 1545 1546
	RangeTblEntry *rte = makeNode(RangeTblEntry);
	List	   *rtlist;
	List	   *qual;
	bool		res;
	int			i;
1547 1548 1549 1550 1551 1552 1553 1554 1555

	slot->val = tuple;
	slot->ttc_shouldFree = false;
	slot->ttc_descIsNew = true;
	slot->ttc_tupleDescriptor = rel->rd_att;
	slot->ttc_buffer = InvalidBuffer;
	slot->ttc_whichplan = -1;
	rte->relname = nameout(&(rel->rd_rel->relname));
	rte->refname = rte->relname;
1556
	rte->relid = RelationGetRelid(rel);
1557 1558 1559 1560 1561 1562 1563 1564 1565
	rte->inh = false;
	rte->inFromCl = true;
	rtlist = lcons(rte, NIL);
	econtext->ecxt_scantuple = slot;	/* scan tuple slot */
	econtext->ecxt_innertuple = NULL;	/* inner tuple slot */
	econtext->ecxt_outertuple = NULL;	/* outer tuple slot */
	econtext->ecxt_relation = rel;		/* relation */
	econtext->ecxt_relid = 0;	/* relid */
	econtext->ecxt_param_list_info = NULL;		/* param list info */
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1566
	econtext->ecxt_param_exec_vals = NULL;		/* exec param values */
1567 1568
	econtext->ecxt_range_table = rtlist;		/* range table */

1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580
	if (estate->es_result_relation_constraints == NULL)
	{
		estate->es_result_relation_constraints =
				(List **)palloc(ncheck * sizeof(List *));

		for (i = 0; i < ncheck; i++)
		{
			qual = (List *) stringToNode(check[i].ccbin);
			estate->es_result_relation_constraints[i] = qual;
		}
	}

1581 1582
	for (i = 0; i < ncheck; i++)
	{
1583
		qual = estate->es_result_relation_constraints[i];
1584 1585 1586 1587

		res = ExecQual(qual, econtext);

		if (!res)
1588
			return check[i].ccname;
1589 1590 1591 1592 1593 1594 1595 1596
	}

	pfree(slot);
	pfree(rte->relname);
	pfree(rte);
	pfree(rtlist);
	pfree(econtext);

1597
	return (char *) NULL;
1598

Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1599 1600
}

1601
void
1602
ExecConstraints(char *caller, Relation rel, HeapTuple tuple, EState *estate)
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1603
{
1604 1605 1606 1607

	Assert(rel->rd_att->constr);

	if (rel->rd_att->constr->has_not_null)
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1608
	{
1609
		int			attrChk;
1610 1611 1612 1613

		for (attrChk = 1; attrChk <= rel->rd_att->natts; attrChk++)
		{
			if (rel->rd_att->attrs[attrChk - 1]->attnotnull && heap_attisnull(tuple, attrChk))
1614
				elog(ERROR, "%s: Fail to add null value in not null attribute %s",
1615 1616 1617 1618 1619 1620
				  caller, rel->rd_att->attrs[attrChk - 1]->attname.data);
		}
	}

	if (rel->rd_att->constr->num_check > 0)
	{
1621
		char	   *failed;
1622

1623
		if ((failed = ExecRelCheck(rel, tuple, estate)) != NULL)
1624
			elog(ERROR, "%s: rejected due to CHECK constraint %s", caller, failed);
1625 1626
	}

1627
	return;
Vadim B. Mikheev's avatar
Vadim B. Mikheev committed
1628
}
1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685

TupleTableSlot*
EvalPlanQual(EState *estate, Index rti, ItemPointer tid)
{
	evalPlanQual	   *epq = (evalPlanQual*) estate->es_evalPlanQual;
	evalPlanQual	   *oldepq;
	EState			   *epqstate = NULL;
	Relation			relation;
	Buffer				buffer;
	HeapTupleData		tuple;
	bool				endNode = true;

	Assert(rti != 0);

	if (epq != NULL && epq->rti == 0)
	{
		Assert(!(estate->es_useEvalPlan) && 
				epq->estate.es_evalPlanQual == NULL);
		epq->rti = rti;
		endNode = false;
	}

	/*
	 * If this is request for another RTE - Ra, - then we have to check
	 * wasn't PlanQual requested for Ra already and if so then Ra' row 
	 * was updated again and we have to re-start old execution for Ra 
	 * and forget all what we done after Ra was suspended. Cool? -:))
	 */
	if (epq != NULL && epq->rti != rti && 
		epq->estate.es_evTuple[rti - 1] != NULL)
	{
		do
		{
			/* pop previous PlanQual from the stack */
			epqstate = &(epq->estate);
			oldepq = (evalPlanQual*) epqstate->es_evalPlanQual;
			Assert(oldepq->rti != 0);
			/* stop execution */
			ExecEndNode(epq->plan, epq->plan);
			pfree(epqstate->es_evTuple[epq->rti - 1]);
			epqstate->es_evTuple[epq->rti - 1] = NULL;
			/* push current PQ to freePQ stack */
			oldepq->free = epq;
			epq = oldepq;
		} while (epq->rti != rti);
		estate->es_evalPlanQual = (Pointer) epq;
	}

	/* 
	 * If we are requested for another RTE then we have to suspend
	 * execution of current PlanQual and start execution for new one.
	 */
	if (epq == NULL || epq->rti != rti)
	{
		/* try to reuse plan used previously */
		evalPlanQual   *newepq = (epq != NULL) ? epq->free : NULL;

1686
		if (newepq == NULL)		/* first call or freePQ stack is empty */
1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706
		{
			newepq = (evalPlanQual*) palloc(sizeof(evalPlanQual));
			/* Init EState */
			epqstate = &(newepq->estate);
			memset(epqstate, 0, sizeof(EState));
			epqstate->type = T_EState; 
			epqstate->es_direction = ForwardScanDirection;
			epqstate->es_snapshot = estate->es_snapshot;
			epqstate->es_range_table = estate->es_range_table;
			epqstate->es_param_list_info = estate->es_param_list_info;
			if (estate->es_origPlan->nParamExec > 0)
				epqstate->es_param_exec_vals = (ParamExecData *)
							palloc(estate->es_origPlan->nParamExec * 
									sizeof(ParamExecData));
			epqstate->es_tupleTable = 
				ExecCreateTupleTable(estate->es_tupleTable->size);
			epqstate->es_refcount = estate->es_refcount;
			/* ... rest */
			newepq->plan = copyObject(estate->es_origPlan);
			newepq->free = NULL;
1707 1708 1709
			epqstate->es_evTupleNull = (bool*) 
				palloc(length(estate->es_range_table) * sizeof(bool));
			if (epq == NULL)	/* first call */
1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786
			{
				epqstate->es_evTuple = (HeapTuple*) 
					palloc(length(estate->es_range_table) * sizeof(HeapTuple));
				memset(epqstate->es_evTuple, 0, 
					length(estate->es_range_table) * sizeof(HeapTuple));
			}
			else
			{
				epqstate->es_evTuple = epq->estate.es_evTuple;
			}
		}
		else
		{
			epqstate = &(newepq->estate);
		}
		/* push current PQ to the stack */
		epqstate->es_evalPlanQual = (Pointer) epq;
		estate->es_evalPlanQual = (Pointer) epq = newepq;
		epq->rti = rti;
		endNode = false;
	}

	epqstate = &(epq->estate);

	/*
	 * Ok - we're requested for the same RTE (-:)).
	 * I'm not sure about ability to use ExecReScan instead of
	 * ExecInitNode, so...
	 */
	if (endNode)
		ExecEndNode(epq->plan, epq->plan);

	/* free old RTE' tuple */
	if (epqstate->es_evTuple[epq->rti - 1] != NULL)
	{
		pfree(epqstate->es_evTuple[epq->rti - 1]);
		epqstate->es_evTuple[epq->rti - 1] = NULL;
	}

	/* ** fetch tid tuple ** */
	if (estate->es_result_relation_info != NULL && 
		estate->es_result_relation_info->ri_RangeTableIndex == rti)
		relation = estate->es_result_relation_info->ri_RelationDesc;
	else
	{
		List   *l;

		foreach (l, estate->es_rowMark)
		{
			if (((execRowMark*) lfirst(l))->rti == rti)
				break;
		}
		relation = ((execRowMark*) lfirst(l))->relation;
	}
	tuple.t_self = *tid;
	for ( ; ; )
	{
		heap_fetch(relation, SnapshotDirty, &tuple, &buffer);
		if (tuple.t_data != NULL)
		{
			TransactionId xwait = SnapshotDirty->xmax;

			if (TransactionIdIsValid(SnapshotDirty->xmin))
				elog(ERROR, "EvalPlanQual: t_xmin is uncommitted ?!");
			/*
			 * If tuple is being updated by other transaction then 
			 * we have to wait for its commit/abort.
			 */
			if (TransactionIdIsValid(xwait))
			{
				ReleaseBuffer(buffer);
				XactLockTableWait(xwait);
				continue;
			}
			/*
			 * Nice! We got tuple - now copy it.
			 */
1787 1788
			if (epqstate->es_evTuple[epq->rti - 1] != NULL)
				pfree(epqstate->es_evTuple[epq->rti - 1]);
1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828
			epqstate->es_evTuple[epq->rti - 1] = heap_copytuple(&tuple);
			ReleaseBuffer(buffer);
			break;
		}
		/*
		 * Ops! Invalid tuple. Have to check is it updated or deleted.
		 * Note that it's possible to get invalid SnapshotDirty->tid
		 * if tuple updated by this transaction. Have we to check this ?
		 */
		if (ItemPointerIsValid(&(SnapshotDirty->tid)) && 
			!(ItemPointerEquals(&(tuple.t_self), &(SnapshotDirty->tid))))
		{
			tuple.t_self = SnapshotDirty->tid;	/* updated ... */
			continue;
		}
		/*
		 * Deleted or updated by this transaction. Do not
		 * (re-)start execution of this PQ. Continue previous PQ.
		 */
		oldepq = (evalPlanQual*) epqstate->es_evalPlanQual;
		if (oldepq != NULL)
		{
			Assert(oldepq->rti != 0);
			/* push current PQ to freePQ stack */
			oldepq->free = epq;
			epq = oldepq;
			epqstate = &(epq->estate);
			estate->es_evalPlanQual = (Pointer) epq;
		}
		else
		{									/* this is the first (oldest) PQ
			epq->rti = 0;					 * - mark as free and 
			estate->es_useEvalPlan = false;	 * continue Query execution
			return (NULL);					 */
		}
	}

	if (estate->es_origPlan->nParamExec > 0)
		memset(epqstate->es_param_exec_vals, 0, 
				estate->es_origPlan->nParamExec * sizeof(ParamExecData));
1829 1830
	memset(epqstate->es_evTupleNull, false, 
			length(estate->es_range_table) * sizeof(bool));
1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881
	ExecInitNode(epq->plan, epqstate, NULL);

	/*
	 * For UPDATE/DELETE we have to return tid of actual row
	 * we're executing PQ for.
	 */
	*tid = tuple.t_self;

	return (EvalPlanQualNext(estate));
}

static TupleTableSlot* 
EvalPlanQualNext(EState *estate)
{
	evalPlanQual	   *epq = (evalPlanQual*) estate->es_evalPlanQual;
	EState			   *epqstate = &(epq->estate);
	evalPlanQual	   *oldepq;
	TupleTableSlot	   *slot;

	Assert(epq->rti != 0);

lpqnext:;
	slot = ExecProcNode(epq->plan, epq->plan);

	/*
	 * No more tuples for this PQ. Continue previous one.
	 */
	if (TupIsNull(slot))
	{
		ExecEndNode(epq->plan, epq->plan);
		pfree(epqstate->es_evTuple[epq->rti - 1]);
		epqstate->es_evTuple[epq->rti - 1] = NULL;
		/* pop old PQ from the stack */
		oldepq = (evalPlanQual*) epqstate->es_evalPlanQual;
		if (oldepq == (evalPlanQual*) NULL)
		{									/* this is the first (oldest) */
			epq->rti = 0;					/* PQ - mark as free and      */
			estate->es_useEvalPlan = false;	/* continue Query execution   */
			return (NULL);
		}
		Assert(oldepq->rti != 0);
		/* push current PQ to freePQ stack */
		oldepq->free = epq;
		epq = oldepq;
		epqstate = &(epq->estate);
		estate->es_evalPlanQual = (Pointer) epq;
		goto lpqnext;
	}

	return (slot);
}