granicus.if.org Git - postgresql/blob - src/backend/executor/execMain.c

   1 /*-------------------------------------------------------------------------
   2  *
   3  * execMain.c
   4  *        top level executor interface routines
   5  *
   6  * INTERFACE ROUTINES
   7  *      ExecutorStart()
   8  *      ExecutorRun()
   9  *      ExecutorEnd()
  10  *
  11  *      The old ExecutorMain() has been replaced by ExecutorStart(),
  12  *      ExecutorRun() and ExecutorEnd()
  13  *
  14  *      These three procedures are the external interfaces to the executor.
  15  *      In each case, the query descriptor and the execution state is required
  16  *       as arguments
  17  *
  18  *      ExecutorStart() must be called at the beginning of any execution of any
  19  *      query plan and ExecutorEnd() should always be called at the end of
  20  *      execution of a plan.
  21  *
  22  *      ExecutorRun accepts 'feature' and 'count' arguments that specify whether
  23  *      the plan is to be executed forwards, backwards, and for how many tuples.
  24  *
  25  * Portions Copyright (c) 1996-2001, PostgreSQL Global Development Group
  26  * Portions Copyright (c) 1994, Regents of the University of California
  27  *
  28  *
  29  * IDENTIFICATION
  30  *        $Header: /cvsroot/pgsql/src/backend/executor/execMain.c,v 1.146 2001/09/08 16:15:28 inoue Exp $
  31  *
  32  *-------------------------------------------------------------------------
  33  */
  34 #include "postgres.h"
  35
  36 #include "access/heapam.h"
  37 #include "catalog/heap.h"
  38 #include "commands/command.h"
  39 #include "commands/trigger.h"
  40 #include "executor/execdebug.h"
  41 #include "executor/execdefs.h"
  42 #include "miscadmin.h"
  43 #include "optimizer/var.h"
  44 #include "parser/parsetree.h"
  45 #include "utils/acl.h"
  46
  47
  48 /* decls for local routines only used within this module */
  49 static TupleDesc InitPlan(CmdType operation,
  50                  Query *parseTree,
  51                  Plan *plan,
  52                  EState *estate);
  53 static void initResultRelInfo(ResultRelInfo *resultRelInfo,
  54                                   Index resultRelationIndex,
  55                                   List *rangeTable,
  56                                   CmdType operation);
  57 static void EndPlan(Plan *plan, EState *estate);
  58 static TupleTableSlot *ExecutePlan(EState *estate, Plan *plan,
  59                         CmdType operation,
  60                         long numberTuples,
  61                         ScanDirection direction,
  62                         DestReceiver *destfunc);
  63 static void ExecRetrieve(TupleTableSlot *slot,
  64                          DestReceiver *destfunc,
  65                          EState *estate);
  66 static void ExecAppend(TupleTableSlot *slot, ItemPointer tupleid,
  67                    EState *estate);
  68 static void ExecDelete(TupleTableSlot *slot, ItemPointer tupleid,
  69                    EState *estate);
  70 static void ExecReplace(TupleTableSlot *slot, ItemPointer tupleid,
  71                         EState *estate);
  72 static TupleTableSlot *EvalPlanQualNext(EState *estate);
  73 static void EndEvalPlanQual(EState *estate);
  74 static void ExecCheckQueryPerms(CmdType operation, Query *parseTree,
  75                                         Plan *plan);
  76 static void ExecCheckPlanPerms(Plan *plan, List *rangeTable,
  77                                    CmdType operation);
  78 static void ExecCheckRTPerms(List *rangeTable, CmdType operation);
  79 static void ExecCheckRTEPerms(RangeTblEntry *rte, CmdType operation);
  80
  81 /* end of local decls */
  82
  83
  84 /* ----------------------------------------------------------------
  85  *              ExecutorStart
  86  *
  87  *              This routine must be called at the beginning of any execution of any
  88  *              query plan
  89  *
  90  *              returns a TupleDesc which describes the attributes of the tuples to
  91  *              be returned by the query.
  92  *
  93  * NB: the CurrentMemoryContext when this is called must be the context
  94  * to be used as the per-query context for the query plan.      ExecutorRun()
  95  * and ExecutorEnd() must be called in this same memory context.
  96  * ----------------------------------------------------------------
  97  */
  98 TupleDesc
  99 ExecutorStart(QueryDesc *queryDesc, EState *estate)
 100 {
 101         TupleDesc       result;
 102
 103         /* sanity checks */
 104         Assert(queryDesc != NULL);
 105
 106         if (queryDesc->plantree->nParamExec > 0)
 107         {
 108                 estate->es_param_exec_vals = (ParamExecData *)
 109                         palloc(queryDesc->plantree->nParamExec * sizeof(ParamExecData));
 110                 MemSet(estate->es_param_exec_vals, 0,
 111                            queryDesc->plantree->nParamExec * sizeof(ParamExecData));
 112         }
 113
 114         /*
 115          * Make our own private copy of the current queries snapshot data
 116          */
 117         if (QuerySnapshot == NULL)
 118                 estate->es_snapshot = NULL;
 119         else
 120         {
 121                 estate->es_snapshot = (Snapshot) palloc(sizeof(SnapshotData));
 122                 memcpy(estate->es_snapshot, QuerySnapshot, sizeof(SnapshotData));
 123                 if (estate->es_snapshot->xcnt > 0)
 124                 {
 125                         estate->es_snapshot->xip = (TransactionId *)
 126                                 palloc(estate->es_snapshot->xcnt * sizeof(TransactionId));
 127                         memcpy(estate->es_snapshot->xip, QuerySnapshot->xip,
 128                                    estate->es_snapshot->xcnt * sizeof(TransactionId));
 129                 }
 130         }
 131
 132         /*
 133          * Initialize the plan
 134          */
 135         result = InitPlan(queryDesc->operation,
 136                                           queryDesc->parsetree,
 137                                           queryDesc->plantree,
 138                                           estate);
 139
 140         return result;
 141 }
 142
 143 /* ----------------------------------------------------------------
 144  *              ExecutorRun
 145  *
 146  *              This is the main routine of the executor module. It accepts
 147  *              the query descriptor from the traffic cop and executes the
 148  *              query plan.
 149  *
 150  *              ExecutorStart must have been called already.
 151  *
 152  *              the different features supported are:
 153  *                       EXEC_RUN:      retrieve all tuples in the forward direction
 154  *                       EXEC_FOR:      retrieve 'count' number of tuples in the forward dir
 155  *                       EXEC_BACK: retrieve 'count' number of tuples in the backward dir
 156  *                       EXEC_RETONE: return one tuple but don't 'retrieve' it
 157  *                                                 used in postquel function processing
 158  *
 159  *              Note: count = 0 is interpreted as "no limit".
 160  *
 161  * ----------------------------------------------------------------
 162  */
 163 TupleTableSlot *
 164 ExecutorRun(QueryDesc *queryDesc, EState *estate, int feature, long count)
 165 {
 166         CmdType         operation;
 167         Plan       *plan;
 168         TupleTableSlot *result;
 169         CommandDest dest;
 170         DestReceiver *destfunc;
 171
 172         /*
 173          * sanity checks
 174          */
 175         Assert(queryDesc != NULL);
 176
 177         /*
 178          * extract information from the query descriptor and the query
 179          * feature.
 180          */
 181         operation = queryDesc->operation;
 182         plan = queryDesc->plantree;
 183         dest = queryDesc->dest;
 184         destfunc = DestToFunction(dest);
 185         estate->es_processed = 0;
 186         estate->es_lastoid = InvalidOid;
 187
 188         /*
 189          * FIXME: the dest setup function ought to be handed the tuple desc
 190          * for the tuples to be output, but I'm not quite sure how to get that
 191          * info at this point.  For now, passing NULL is OK because no
 192          * existing dest setup function actually uses the pointer.
 193          */
 194         (*destfunc->setup) (destfunc, (TupleDesc) NULL);
 195
 196         switch (feature)
 197         {
 198                 case EXEC_RUN:
 199                         result = ExecutePlan(estate,
 200                                                                  plan,
 201                                                                  operation,
 202                                                                  count,
 203                                                                  ForwardScanDirection,
 204                                                                  destfunc);
 205                         break;
 206
 207                 case EXEC_FOR:
 208                         result = ExecutePlan(estate,
 209                                                                  plan,
 210                                                                  operation,
 211                                                                  count,
 212                                                                  ForwardScanDirection,
 213                                                                  destfunc);
 214                         break;
 215
 216                         /*
 217                          * retrieve next n "backward" tuples
 218                          */
 219                 case EXEC_BACK:
 220                         result = ExecutePlan(estate,
 221                                                                  plan,
 222                                                                  operation,
 223                                                                  count,
 224                                                                  BackwardScanDirection,
 225                                                                  destfunc);
 226                         break;
 227
 228                         /*
 229                          * return one tuple but don't "retrieve" it. (this is used by
 230                          * the rule manager..) -cim 9/14/89
 231                          */
 232                 case EXEC_RETONE:
 233                         result = ExecutePlan(estate,
 234                                                                  plan,
 235                                                                  operation,
 236                                                                  ONE_TUPLE,
 237                                                                  ForwardScanDirection,
 238                                                                  destfunc);
 239                         break;
 240
 241                 default:
 242                         elog(DEBUG, "ExecutorRun: Unknown feature %d", feature);
 243                         result = NULL;
 244                         break;
 245         }
 246
 247         (*destfunc->cleanup) (destfunc);
 248
 249         return result;
 250 }
 251
 252 /* ----------------------------------------------------------------
 253  *              ExecutorEnd
 254  *
 255  *              This routine must be called at the end of execution of any
 256  *              query plan
 257  * ----------------------------------------------------------------
 258  */
 259 void
 260 ExecutorEnd(QueryDesc *queryDesc, EState *estate)
 261 {
 262         /* sanity checks */
 263         Assert(queryDesc != NULL);
 264
 265         EndPlan(queryDesc->plantree, estate);
 266
 267         if (estate->es_snapshot != NULL)
 268         {
 269                 if (estate->es_snapshot->xcnt > 0)
 270                         pfree(estate->es_snapshot->xip);
 271                 pfree(estate->es_snapshot);
 272                 estate->es_snapshot = NULL;
 273         }
 274
 275         if (estate->es_param_exec_vals != NULL)
 276         {
 277                 pfree(estate->es_param_exec_vals);
 278                 estate->es_param_exec_vals = NULL;
 279         }
 280 }
 281
 282
 283 /*
 284  * ExecCheckQueryPerms
 285  *              Check access permissions for all relations referenced in a query.
 286  */
 287 static void
 288 ExecCheckQueryPerms(CmdType operation, Query *parseTree, Plan *plan)
 289 {
 290
 291         /*
 292          * Check RTEs in the query's primary rangetable.
 293          */
 294         ExecCheckRTPerms(parseTree->rtable, operation);
 295
 296         /*
 297          * Search for subplans and APPEND nodes to check their rangetables.
 298          */
 299         ExecCheckPlanPerms(plan, parseTree->rtable, operation);
 300 }
 301
 302 /*
 303  * ExecCheckPlanPerms
 304  *              Recursively scan the plan tree to check access permissions in
 305  *              subplans.
 306  */
 307 static void
 308 ExecCheckPlanPerms(Plan *plan, List *rangeTable, CmdType operation)
 309 {
 310         List       *subp;
 311
 312         if (plan == NULL)
 313                 return;
 314
 315         /* Check subplans, which we assume are plain SELECT queries */
 316
 317         foreach(subp, plan->initPlan)
 318         {
 319                 SubPlan    *subplan = (SubPlan *) lfirst(subp);
 320
 321                 ExecCheckRTPerms(subplan->rtable, CMD_SELECT);
 322                 ExecCheckPlanPerms(subplan->plan, subplan->rtable, CMD_SELECT);
 323         }
 324         foreach(subp, plan->subPlan)
 325         {
 326                 SubPlan    *subplan = (SubPlan *) lfirst(subp);
 327
 328                 ExecCheckRTPerms(subplan->rtable, CMD_SELECT);
 329                 ExecCheckPlanPerms(subplan->plan, subplan->rtable, CMD_SELECT);
 330         }
 331
 332         /* Check lower plan nodes */
 333
 334         ExecCheckPlanPerms(plan->lefttree, rangeTable, operation);
 335         ExecCheckPlanPerms(plan->righttree, rangeTable, operation);
 336
 337         /* Do node-type-specific checks */
 338
 339         switch (nodeTag(plan))
 340         {
 341                 case T_SubqueryScan:
 342                         {
 343                                 SubqueryScan *scan = (SubqueryScan *) plan;
 344                                 RangeTblEntry *rte;
 345
 346                                 /* Recursively check the subquery */
 347                                 rte = rt_fetch(scan->scan.scanrelid, rangeTable);
 348                                 Assert(rte->subquery != NULL);
 349                                 ExecCheckQueryPerms(operation, rte->subquery, scan->subplan);
 350                                 break;
 351                         }
 352                 case T_Append:
 353                         {
 354                                 Append     *app = (Append *) plan;
 355                                 List       *appendplans;
 356
 357                                 foreach(appendplans, app->appendplans)
 358                                 {
 359                                         ExecCheckPlanPerms((Plan *) lfirst(appendplans),
 360                                                                            rangeTable,
 361                                                                            operation);
 362                                 }
 363                                 break;
 364                         }
 365
 366                 default:
 367                         break;
 368         }
 369 }
 370
 371 /*
 372  * ExecCheckRTPerms
 373  *              Check access permissions for all relations listed in a range table.
 374  */
 375 static void
 376 ExecCheckRTPerms(List *rangeTable, CmdType operation)
 377 {
 378         List       *lp;
 379
 380         foreach(lp, rangeTable)
 381         {
 382                 RangeTblEntry *rte = lfirst(lp);
 383
 384                 ExecCheckRTEPerms(rte, operation);
 385         }
 386 }
 387
 388 /*
 389  * ExecCheckRTEPerms
 390  *              Check access permissions for a single RTE.
 391  */
 392 static void
 393 ExecCheckRTEPerms(RangeTblEntry *rte, CmdType operation)
 394 {
 395         char       *relName;
 396         Oid                     userid;
 397         int32           aclcheck_result;
 398
 399         /*
 400          * If it's a subquery RTE, ignore it --- it will be checked when
 401          * ExecCheckPlanPerms finds the SubqueryScan node for it.
 402          */
 403         if (rte->subquery)
 404                 return;
 405
 406         relName = rte->relname;
 407
 408         /*
 409          * userid to check as: current user unless we have a setuid
 410          * indication.
 411          *
 412          * Note: GetUserId() is presently fast enough that there's no harm in
 413          * calling it separately for each RTE.  If that stops being true, we
 414          * could call it once in ExecCheckQueryPerms and pass the userid down
 415          * from there.  But for now, no need for the extra clutter.
 416          */
 417         userid = rte->checkAsUser ? rte->checkAsUser : GetUserId();
 418
 419 #define CHECK(MODE)             pg_aclcheck(relName, userid, MODE)
 420
 421         if (rte->checkForRead)
 422         {
 423                 aclcheck_result = CHECK(ACL_SELECT);
 424                 if (aclcheck_result != ACLCHECK_OK)
 425                         elog(ERROR, "%s: %s",
 426                                  relName, aclcheck_error_strings[aclcheck_result]);
 427         }
 428
 429         if (rte->checkForWrite)
 430         {
 431
 432                 /*
 433                  * Note: write access in a SELECT context means SELECT FOR UPDATE.
 434                  * Right now we don't distinguish that from true update as far as
 435                  * permissions checks are concerned.
 436                  */
 437                 switch (operation)
 438                 {
 439                         case CMD_INSERT:
 440                                 aclcheck_result = CHECK(ACL_INSERT);
 441                                 break;
 442                         case CMD_SELECT:
 443                         case CMD_UPDATE:
 444                                 aclcheck_result = CHECK(ACL_UPDATE);
 445                                 break;
 446                         case CMD_DELETE:
 447                                 aclcheck_result = CHECK(ACL_DELETE);
 448                                 break;
 449                         default:
 450                                 elog(ERROR, "ExecCheckRTEPerms: bogus operation %d",
 451                                          operation);
 452                                 aclcheck_result = ACLCHECK_OK;  /* keep compiler quiet */
 453                                 break;
 454                 }
 455                 if (aclcheck_result != ACLCHECK_OK)
 456                         elog(ERROR, "%s: %s",
 457                                  relName, aclcheck_error_strings[aclcheck_result]);
 458         }
 459 }
 460
 461
 462 /* ===============================================================
 463  * ===============================================================
 464                                                  static routines follow
 465  * ===============================================================
 466  * ===============================================================
 467  */
 468
 469 typedef struct execRowMark
 470 {
 471         Relation        relation;
 472         Index           rti;
 473         char            resname[32];
 474 } execRowMark;
 475
 476 typedef struct evalPlanQual
 477 {
 478         Plan       *plan;
 479         Index           rti;
 480         EState          estate;
 481         struct evalPlanQual *free;
 482 } evalPlanQual;
 483
 484 /* ----------------------------------------------------------------
 485  *              InitPlan
 486  *
 487  *              Initializes the query plan: open files, allocate storage
 488  *              and start up the rule manager
 489  * ----------------------------------------------------------------
 490  */
 491 static TupleDesc
 492 InitPlan(CmdType operation, Query *parseTree, Plan *plan, EState *estate)
 493 {
 494         List       *rangeTable;
 495         Relation        intoRelationDesc;
 496         TupleDesc       tupType;
 497
 498         /*
 499          * Do permissions checks.
 500          */
 501         ExecCheckQueryPerms(operation, parseTree, plan);
 502
 503         /*
 504          * get information from query descriptor
 505          */
 506         rangeTable = parseTree->rtable;
 507
 508         /*
 509          * initialize the node's execution state
 510          */
 511         estate->es_range_table = rangeTable;
 512
 513         /*
 514          * if there is a result relation, initialize result relation stuff
 515          */
 516         if (parseTree->resultRelation != 0 && operation != CMD_SELECT)
 517         {
 518                 List       *resultRelations = parseTree->resultRelations;
 519                 int                     numResultRelations;
 520                 ResultRelInfo *resultRelInfos;
 521
 522                 if (resultRelations != NIL)
 523                 {
 524
 525                         /*
 526                          * Multiple result relations (due to inheritance)
 527                          * parseTree->resultRelations identifies them all
 528                          */
 529                         ResultRelInfo *resultRelInfo;
 530
 531                         numResultRelations = length(resultRelations);
 532                         resultRelInfos = (ResultRelInfo *)
 533                                 palloc(numResultRelations * sizeof(ResultRelInfo));
 534                         resultRelInfo = resultRelInfos;
 535                         while (resultRelations != NIL)
 536                         {
 537                                 initResultRelInfo(resultRelInfo,
 538                                                                   lfirsti(resultRelations),
 539                                                                   rangeTable,
 540                                                                   operation);
 541                                 resultRelInfo++;
 542                                 resultRelations = lnext(resultRelations);
 543                         }
 544                 }
 545                 else
 546                 {
 547
 548                         /*
 549                          * Single result relation identified by
 550                          * parseTree->resultRelation
 551                          */
 552                         numResultRelations = 1;
 553                         resultRelInfos = (ResultRelInfo *) palloc(sizeof(ResultRelInfo));
 554                         initResultRelInfo(resultRelInfos,
 555                                                           parseTree->resultRelation,
 556                                                           rangeTable,
 557                                                           operation);
 558                 }
 559
 560                 estate->es_result_relations = resultRelInfos;
 561                 estate->es_num_result_relations = numResultRelations;
 562                 /* Initialize to first or only result rel */
 563                 estate->es_result_relation_info = resultRelInfos;
 564         }
 565         else
 566         {
 567
 568                 /*
 569                  * if no result relation, then set state appropriately
 570                  */
 571                 estate->es_result_relations = NULL;
 572                 estate->es_num_result_relations = 0;
 573                 estate->es_result_relation_info = NULL;
 574         }
 575
 576         /*
 577          * Have to lock relations selected for update
 578          */
 579         estate->es_rowMark = NIL;
 580         if (parseTree->rowMarks != NIL)
 581         {
 582                 List       *l;
 583
 584                 foreach(l, parseTree->rowMarks)
 585                 {
 586                         Index           rti = lfirsti(l);
 587                         Oid                     relid = getrelid(rti, rangeTable);
 588                         Relation        relation;
 589                         execRowMark *erm;
 590
 591                         relation = heap_open(relid, RowShareLock);
 592                         erm = (execRowMark *) palloc(sizeof(execRowMark));
 593                         erm->relation = relation;
 594                         erm->rti = rti;
 595                         sprintf(erm->resname, "ctid%u", rti);
 596                         estate->es_rowMark = lappend(estate->es_rowMark, erm);
 597                 }
 598         }
 599
 600         /*
 601          * initialize the executor "tuple" table.  We need slots for all the
 602          * plan nodes, plus possibly output slots for the junkfilter(s).
 603          * At this point we aren't sure if we need junkfilters, so just add
 604          * slots for them unconditionally.
 605          */
 606         {
 607                 int                     nSlots = ExecCountSlotsNode(plan);
 608
 609                 if (parseTree->resultRelations != NIL)
 610                         nSlots += length(parseTree->resultRelations);
 611                 else
 612                         nSlots += 1;
 613                 estate->es_tupleTable = ExecCreateTupleTable(nSlots);
 614         }
 615
 616         /* mark EvalPlanQual not active */
 617         estate->es_origPlan = plan;
 618         estate->es_evalPlanQual = NULL;
 619         estate->es_evTuple = NULL;
 620         estate->es_evTupleNull = NULL;
 621         estate->es_useEvalPlan = false;
 622
 623         /*
 624          * initialize the private state information for all the nodes in the
 625          * query tree.  This opens files, allocates storage and leaves us
 626          * ready to start processing tuples.
 627          */
 628         ExecInitNode(plan, estate, NULL);
 629
 630         /*
 631          * Get the tuple descriptor describing the type of tuples to return.
 632          * (this is especially important if we are creating a relation with
 633          * "retrieve into")
 634          */
 635         tupType = ExecGetTupType(plan);         /* tuple descriptor */
 636
 637         /*
 638          * Initialize the junk filter if needed. SELECT and INSERT queries
 639          * need a filter if there are any junk attrs in the tlist.      UPDATE and
 640          * DELETE always need one, since there's always a junk 'ctid'
 641          * attribute present --- no need to look first.
 642          */
 643         {
 644                 bool            junk_filter_needed = false;
 645                 List       *tlist;
 646
 647                 switch (operation)
 648                 {
 649                         case CMD_SELECT:
 650                         case CMD_INSERT:
 651                                 foreach(tlist, plan->targetlist)
 652                                 {
 653                                         TargetEntry *tle = (TargetEntry *) lfirst(tlist);
 654
 655                                         if (tle->resdom->resjunk)
 656                                         {
 657                                                 junk_filter_needed = true;
 658                                                 break;
 659                                         }
 660                                 }
 661                                 break;
 662                         case CMD_UPDATE:
 663                         case CMD_DELETE:
 664                                 junk_filter_needed = true;
 665                                 break;
 666                         default:
 667                                 break;
 668                 }
 669
 670                 if (junk_filter_needed)
 671                 {
 672
 673                         /*
 674                          * If there are multiple result relations, each one needs its
 675                          * own junk filter.  Note this is only possible for
 676                          * UPDATE/DELETE, so we can't be fooled by some needing a
 677                          * filter and some not.
 678                          */
 679                         if (parseTree->resultRelations != NIL)
 680                         {
 681                                 List       *subplans;
 682                                 ResultRelInfo *resultRelInfo;
 683
 684                                 /* Top plan had better be an Append here. */
 685                                 Assert(IsA(plan, Append));
 686                                 Assert(((Append *) plan)->isTarget);
 687                                 subplans = ((Append *) plan)->appendplans;
 688                                 Assert(length(subplans) == estate->es_num_result_relations);
 689                                 resultRelInfo = estate->es_result_relations;
 690                                 while (subplans != NIL)
 691                                 {
 692                                         Plan       *subplan = (Plan *) lfirst(subplans);
 693                                         JunkFilter *j;
 694
 695                                         j = ExecInitJunkFilter(subplan->targetlist,
 696                                                                                    ExecGetTupType(subplan),
 697                                                                                    ExecAllocTableSlot(estate->es_tupleTable));
 698                                         resultRelInfo->ri_junkFilter = j;
 699                                         resultRelInfo++;
 700                                         subplans = lnext(subplans);
 701                                 }
 702
 703                                 /*
 704                                  * Set active junkfilter too; at this point ExecInitAppend
 705                                  * has already selected an active result relation...
 706                                  */
 707                                 estate->es_junkFilter =
 708                                         estate->es_result_relation_info->ri_junkFilter;
 709                         }
 710                         else
 711                         {
 712                                 /* Normal case with just one JunkFilter */
 713                                 JunkFilter *j;
 714
 715                                 j = ExecInitJunkFilter(plan->targetlist,
 716                                                                            tupType,
 717                                                                            ExecAllocTableSlot(estate->es_tupleTable));
 718                                 estate->es_junkFilter = j;
 719                                 if (estate->es_result_relation_info)
 720                                         estate->es_result_relation_info->ri_junkFilter = j;
 721
 722                                 /* For SELECT, want to return the cleaned tuple type */
 723                                 if (operation == CMD_SELECT)
 724                                         tupType = j->jf_cleanTupType;
 725                         }
 726                 }
 727                 else
 728                         estate->es_junkFilter = NULL;
 729         }
 730
 731         /*
 732          * initialize the "into" relation
 733          */
 734         intoRelationDesc = (Relation) NULL;
 735
 736         if (operation == CMD_SELECT)
 737         {
 738                 char       *intoName;
 739                 Oid                     intoRelationId;
 740                 TupleDesc       tupdesc;
 741
 742                 if (!parseTree->isPortal)
 743                 {
 744
 745                         /*
 746                          * a select into table
 747                          */
 748                         if (parseTree->into != NULL)
 749                         {
 750
 751                                 /*
 752                                  * create the "into" relation
 753                                  */
 754                                 intoName = parseTree->into;
 755
 756                                 /*
 757                                  * have to copy tupType to get rid of constraints
 758                                  */
 759                                 tupdesc = CreateTupleDescCopy(tupType);
 760
 761                                 intoRelationId =
 762                                         heap_create_with_catalog(intoName,
 763                                                                                          tupdesc,
 764                                                                                          RELKIND_RELATION, true,
 765                                                                                          parseTree->isTemp,
 766                                                                                          allowSystemTableMods);
 767
 768                                 FreeTupleDesc(tupdesc);
 769
 770                                 /*
 771                                  * Advance command counter so that the newly-created
 772                                  * relation's catalog tuples will be visible to heap_open.
 773                                  */
 774                                 CommandCounterIncrement();
 775
 776                                 /*
 777                                  * If necessary, create a TOAST table for the into
 778                                  * relation. Note that AlterTableCreateToastTable ends
 779                                  * with CommandCounterIncrement(), so that the TOAST table
 780                                  * will be visible for insertion.
 781                                  */
 782                                 AlterTableCreateToastTable(intoName, true);
 783
 784                                 intoRelationDesc = heap_open(intoRelationId,
 785                                                                                          AccessExclusiveLock);
 786                         }
 787                 }
 788         }
 789
 790         estate->es_into_relation_descriptor = intoRelationDesc;
 791
 792         return tupType;
 793 }
 794
 795 /*
 796  * Initialize ResultRelInfo data for one result relation
 797  */
 798 static void
 799 initResultRelInfo(ResultRelInfo *resultRelInfo,
 800                                   Index resultRelationIndex,
 801                                   List *rangeTable,
 802                                   CmdType operation)
 803 {
 804         Oid                     resultRelationOid;
 805         Relation        resultRelationDesc;
 806
 807         resultRelationOid = getrelid(resultRelationIndex, rangeTable);
 808         resultRelationDesc = heap_open(resultRelationOid, RowExclusiveLock);
 809
 810         switch (resultRelationDesc->rd_rel->relkind)
 811         {
 812                 case RELKIND_SEQUENCE:
 813                         elog(ERROR, "You can't change sequence relation %s",
 814                                  RelationGetRelationName(resultRelationDesc));
 815                         break;
 816                 case RELKIND_TOASTVALUE:
 817                         elog(ERROR, "You can't change toast relation %s",
 818                                  RelationGetRelationName(resultRelationDesc));
 819                         break;
 820                 case RELKIND_VIEW:
 821                         elog(ERROR, "You can't change view relation %s",
 822                                  RelationGetRelationName(resultRelationDesc));
 823                         break;
 824         }
 825
 826         MemSet(resultRelInfo, 0, sizeof(ResultRelInfo));
 827         resultRelInfo->type = T_ResultRelInfo;
 828         resultRelInfo->ri_RangeTableIndex = resultRelationIndex;
 829         resultRelInfo->ri_RelationDesc = resultRelationDesc;
 830         resultRelInfo->ri_NumIndices = 0;
 831         resultRelInfo->ri_IndexRelationDescs = NULL;
 832         resultRelInfo->ri_IndexRelationInfo = NULL;
 833         resultRelInfo->ri_TrigDesc = resultRelationDesc->trigdesc;
 834         resultRelInfo->ri_TrigFunctions = NULL;
 835         resultRelInfo->ri_ConstraintExprs = NULL;
 836         resultRelInfo->ri_junkFilter = NULL;
 837
 838         /*
 839          * If there are indices on the result relation, open them and save
 840          * descriptors in the result relation info, so that we can add new
 841          * index entries for the tuples we add/update.  We need not do this
 842          * for a DELETE, however, since deletion doesn't affect indexes.
 843          */
 844         if (resultRelationDesc->rd_rel->relhasindex &&
 845                 operation != CMD_DELETE)
 846                 ExecOpenIndices(resultRelInfo);
 847 }
 848
 849 /* ----------------------------------------------------------------
 850  *              EndPlan
 851  *
 852  *              Cleans up the query plan -- closes files and free up storages
 853  * ----------------------------------------------------------------
 854  */
 855 static void
 856 EndPlan(Plan *plan, EState *estate)
 857 {
 858         ResultRelInfo *resultRelInfo;
 859         int                     i;
 860         List       *l;
 861
 862         /*
 863          * shut down any PlanQual processing we were doing
 864          */
 865         if (estate->es_evalPlanQual != NULL)
 866                 EndEvalPlanQual(estate);
 867
 868         /*
 869          * shut down the node-type-specific query processing
 870          */
 871         ExecEndNode(plan, plan);
 872
 873         /*
 874          * destroy the executor "tuple" table.
 875          */
 876         ExecDropTupleTable(estate->es_tupleTable, true);
 877         estate->es_tupleTable = NULL;
 878
 879         /*
 880          * close the result relation(s) if any, but hold locks until xact
 881          * commit.      Also clean up junkfilters if present.
 882          */
 883         resultRelInfo = estate->es_result_relations;
 884         for (i = estate->es_num_result_relations; i > 0; i--)
 885         {
 886                 /* Close indices and then the relation itself */
 887                 ExecCloseIndices(resultRelInfo);
 888                 heap_close(resultRelInfo->ri_RelationDesc, NoLock);
 889                 /* Delete the junkfilter if any */
 890                 if (resultRelInfo->ri_junkFilter != NULL)
 891                         ExecFreeJunkFilter(resultRelInfo->ri_junkFilter);
 892                 resultRelInfo++;
 893         }
 894
 895         /*
 896          * close the "into" relation if necessary, again keeping lock
 897          */
 898         if (estate->es_into_relation_descriptor != NULL)
 899                 heap_close(estate->es_into_relation_descriptor, NoLock);
 900
 901         /*
 902          * There might be a junkfilter without a result relation.
 903          */
 904         if (estate->es_num_result_relations == 0 &&
 905                 estate->es_junkFilter != NULL)
 906         {
 907                 ExecFreeJunkFilter(estate->es_junkFilter);
 908                 estate->es_junkFilter = NULL;
 909         }
 910
 911         /*
 912          * close any relations selected FOR UPDATE, again keeping locks
 913          */
 914         foreach(l, estate->es_rowMark)
 915         {
 916                 execRowMark *erm = lfirst(l);
 917
 918                 heap_close(erm->relation, NoLock);
 919         }
 920 }
 921
 922 /* ----------------------------------------------------------------
 923  *              ExecutePlan
 924  *
 925  *              processes the query plan to retrieve 'numberTuples' tuples in the
 926  *              direction specified.
 927  *              Retrieves all tuples if tupleCount is 0
 928  *
 929  *              result is either a slot containing the last tuple in the case
 930  *              of a RETRIEVE or NULL otherwise.
 931  *
 932  * Note: the ctid attribute is a 'junk' attribute that is removed before the
 933  * user can see it
 934  * ----------------------------------------------------------------
 935  */
 936 static TupleTableSlot *
 937 ExecutePlan(EState *estate,
 938                         Plan *plan,
 939                         CmdType operation,
 940                         long numberTuples,
 941                         ScanDirection direction,
 942                         DestReceiver *destfunc)
 943 {
 944         JunkFilter *junkfilter;
 945         TupleTableSlot *slot;
 946         ItemPointer tupleid = NULL;
 947         ItemPointerData tuple_ctid;
 948         long            current_tuple_count;
 949         TupleTableSlot *result;
 950
 951         /*
 952          * initialize local variables
 953          */
 954         slot = NULL;
 955         current_tuple_count = 0;
 956         result = NULL;
 957
 958         /*
 959          * Set the direction.
 960          */
 961         estate->es_direction = direction;
 962
 963         /*
 964          * Loop until we've processed the proper number of tuples from the
 965          * plan.
 966          */
 967
 968         for (;;)
 969         {
 970                 /* Reset the per-output-tuple exprcontext */
 971                 ResetPerTupleExprContext(estate);
 972
 973                 /*
 974                  * Execute the plan and obtain a tuple
 975                  */
 976                 /* at the top level, the parent of a plan (2nd arg) is itself */
 977 lnext:  ;
 978                 if (estate->es_useEvalPlan)
 979                 {
 980                         slot = EvalPlanQualNext(estate);
 981                         if (TupIsNull(slot))
 982                                 slot = ExecProcNode(plan, plan);
 983                 }
 984                 else
 985                         slot = ExecProcNode(plan, plan);
 986
 987                 /*
 988                  * if the tuple is null, then we assume there is nothing more to
 989                  * process so we just return null...
 990                  */
 991                 if (TupIsNull(slot))
 992                 {
 993                         result = NULL;
 994                         break;
 995                 }
 996
 997                 /*
 998                  * if we have a junk filter, then project a new tuple with the
 999                  * junk removed.
1000                  *
1001                  * Store this new "clean" tuple in the junkfilter's resultSlot.
1002                  * (Formerly, we stored it back over the "dirty" tuple, which is
1003                  * WRONG because that tuple slot has the wrong descriptor.)
1004                  *
1005                  * Also, extract all the junk information we need.
1006                  */
1007                 if ((junkfilter = estate->es_junkFilter) != (JunkFilter *) NULL)
1008                 {
1009                         Datum           datum;
1010                         HeapTuple       newTuple;
1011                         bool            isNull;
1012
1013                         /*
1014                          * extract the 'ctid' junk attribute.
1015                          */
1016                         if (operation == CMD_UPDATE || operation == CMD_DELETE)
1017                         {
1018                                 if (!ExecGetJunkAttribute(junkfilter,
1019                                                                                   slot,
1020                                                                                   "ctid",
1021                                                                                   &datum,
1022                                                                                   &isNull))
1023                                         elog(ERROR, "ExecutePlan: NO (junk) `ctid' was found!");
1024
1025                                 /* shouldn't ever get a null result... */
1026                                 if (isNull)
1027                                         elog(ERROR, "ExecutePlan: (junk) `ctid' is NULL!");
1028
1029                                 tupleid = (ItemPointer) DatumGetPointer(datum);
1030                                 tuple_ctid = *tupleid;  /* make sure we don't free the
1031                                                                                  * ctid!! */
1032                                 tupleid = &tuple_ctid;
1033                         }
1034                         else if (estate->es_rowMark != NIL)
1035                         {
1036                                 List       *l;
1037
1038                 lmark:  ;
1039                                 foreach(l, estate->es_rowMark)
1040                                 {
1041                                         execRowMark *erm = lfirst(l);
1042                                         Buffer          buffer;
1043                                         HeapTupleData tuple;
1044                                         TupleTableSlot *newSlot;
1045                                         int                     test;
1046
1047                                         if (!ExecGetJunkAttribute(junkfilter,
1048                                                                                           slot,
1049                                                                                           erm->resname,
1050                                                                                           &datum,
1051                                                                                           &isNull))
1052                                                 elog(ERROR, "ExecutePlan: NO (junk) `%s' was found!",
1053                                                          erm->resname);
1054
1055                                         /* shouldn't ever get a null result... */
1056                                         if (isNull)
1057                                                 elog(ERROR, "ExecutePlan: (junk) `%s' is NULL!",
1058                                                          erm->resname);
1059
1060                                         tuple.t_self = *((ItemPointer) DatumGetPointer(datum));
1061                                         test = heap_mark4update(erm->relation, &tuple, &buffer);
1062                                         ReleaseBuffer(buffer);
1063                                         switch (test)
1064                                         {
1065                                                 case HeapTupleSelfUpdated:
1066                                                 case HeapTupleMayBeUpdated:
1067                                                         break;
1068
1069                                                 case HeapTupleUpdated:
1070                                                         if (XactIsoLevel == XACT_SERIALIZABLE)
1071                                                                 elog(ERROR, "Can't serialize access due to concurrent update");
1072                                                         if (!(ItemPointerEquals(&(tuple.t_self),
1073                                                                   (ItemPointer) DatumGetPointer(datum))))
1074                                                         {
1075                                                                 newSlot = EvalPlanQual(estate, erm->rti, &(tuple.t_self));
1076                                                                 if (!(TupIsNull(newSlot)))
1077                                                                 {
1078                                                                         slot = newSlot;
1079                                                                         estate->es_useEvalPlan = true;
1080                                                                         goto lmark;
1081                                                                 }
1082                                                         }
1083
1084                                                         /*
1085                                                          * if tuple was deleted or PlanQual failed for
1086                                                          * updated tuple - we must not return this
1087                                                          * tuple!
1088                                                          */
1089                                                         goto lnext;
1090
1091                                                 default:
1092                                                         elog(ERROR, "Unknown status %u from heap_mark4update", test);
1093                                                         return (NULL);
1094                                         }
1095                                 }
1096                         }
1097
1098                         /*
1099                          * Finally create a new "clean" tuple with all junk attributes
1100                          * removed
1101                          */
1102                         newTuple = ExecRemoveJunk(junkfilter, slot);
1103
1104                         slot = ExecStoreTuple(newTuple,         /* tuple to store */
1105                                                                   junkfilter->jf_resultSlot, /* dest slot */
1106                                                                   InvalidBuffer,                /* this tuple has no
1107                                                                                                                  * buffer */
1108                                                                   true);                /* tuple should be pfreed */
1109                 }                                               /* if (junkfilter... */
1110
1111                 /*
1112                  * now that we have a tuple, do the appropriate thing with it..
1113                  * either return it to the user, add it to a relation someplace,
1114                  * delete it from a relation, or modify some of its attributes.
1115                  */
1116
1117                 switch (operation)
1118                 {
1119                         case CMD_SELECT:
1120                                 ExecRetrieve(slot,              /* slot containing tuple */
1121                                                          destfunc,      /* destination's tuple-receiver
1122                                                                                  * obj */
1123                                                          estate);       /* */
1124                                 result = slot;
1125                                 break;
1126
1127                         case CMD_INSERT:
1128                                 ExecAppend(slot, tupleid, estate);
1129                                 result = NULL;
1130                                 break;
1131
1132                         case CMD_DELETE:
1133                                 ExecDelete(slot, tupleid, estate);
1134                                 result = NULL;
1135                                 break;
1136
1137                         case CMD_UPDATE:
1138                                 ExecReplace(slot, tupleid, estate);
1139                                 result = NULL;
1140                                 break;
1141
1142                         default:
1143                                 elog(DEBUG, "ExecutePlan: unknown operation in queryDesc");
1144                                 result = NULL;
1145                                 break;
1146                 }
1147
1148                 /*
1149                  * check our tuple count.. if we've processed the proper number
1150                  * then quit, else loop again and process more tuples..
1151                  */
1152                 current_tuple_count++;
1153                 if (numberTuples == current_tuple_count)
1154                         break;
1155         }
1156
1157         /*
1158          * here, result is either a slot containing a tuple in the case of a
1159          * RETRIEVE or NULL otherwise.
1160          */
1161         return result;
1162 }
1163
1164 /* ----------------------------------------------------------------
1165  *              ExecRetrieve
1166  *
1167  *              RETRIEVEs are easy.. we just pass the tuple to the appropriate
1168  *              print function.  The only complexity is when we do a
1169  *              "retrieve into", in which case we insert the tuple into
1170  *              the appropriate relation (note: this is a newly created relation
1171  *              so we don't need to worry about indices or locks.)
1172  * ----------------------------------------------------------------
1173  */
1174 static void
1175 ExecRetrieve(TupleTableSlot *slot,
1176                          DestReceiver *destfunc,
1177                          EState *estate)
1178 {
1179         HeapTuple       tuple;
1180         TupleDesc       attrtype;
1181
1182         /*
1183          * get the heap tuple out of the tuple table slot
1184          */
1185         tuple = slot->val;
1186         attrtype = slot->ttc_tupleDescriptor;
1187
1188         /*
1189          * insert the tuple into the "into relation"
1190          */
1191         if (estate->es_into_relation_descriptor != NULL)
1192         {
1193                 heap_insert(estate->es_into_relation_descriptor, tuple);
1194                 IncrAppended();
1195         }
1196
1197         /*
1198          * send the tuple to the front end (or the screen)
1199          */
1200         (*destfunc->receiveTuple) (tuple, attrtype, destfunc);
1201         IncrRetrieved();
1202         (estate->es_processed)++;
1203 }
1204
1205 /* ----------------------------------------------------------------
1206  *              ExecAppend
1207  *
1208  *              APPENDs are trickier.. we have to insert the tuple into
1209  *              the base relation and insert appropriate tuples into the
1210  *              index relations.
1211  * ----------------------------------------------------------------
1212  */
1213
1214 static void
1215 ExecAppend(TupleTableSlot *slot,
1216                    ItemPointer tupleid,
1217                    EState *estate)
1218 {
1219         HeapTuple       tuple;
1220         ResultRelInfo *resultRelInfo;
1221         Relation        resultRelationDesc;
1222         int                     numIndices;
1223         Oid                     newId;
1224
1225         /*
1226          * get the heap tuple out of the tuple table slot
1227          */
1228         tuple = slot->val;
1229
1230         /*
1231          * get information on the (current) result relation
1232          */
1233         resultRelInfo = estate->es_result_relation_info;
1234         resultRelationDesc = resultRelInfo->ri_RelationDesc;
1235
1236         /* BEFORE ROW INSERT Triggers */
1237         if (resultRelInfo->ri_TrigDesc &&
1238                 resultRelInfo->ri_TrigDesc->n_before_row[TRIGGER_EVENT_INSERT] > 0)
1239         {
1240                 HeapTuple       newtuple;
1241
1242                 newtuple = ExecBRInsertTriggers(estate, resultRelInfo, tuple);
1243
1244                 if (newtuple == NULL)   /* "do nothing" */
1245                         return;
1246
1247                 if (newtuple != tuple)  /* modified by Trigger(s) */
1248                 {
1249
1250                         /*
1251                          * Insert modified tuple into tuple table slot, replacing the
1252                          * original.  We assume that it was allocated in per-tuple
1253                          * memory context, and therefore will go away by itself. The
1254                          * tuple table slot should not try to clear it.
1255                          */
1256                         ExecStoreTuple(newtuple, slot, InvalidBuffer, false);
1257                         tuple = newtuple;
1258                 }
1259         }
1260
1261         /*
1262          * Check the constraints of the tuple
1263          */
1264         if (resultRelationDesc->rd_att->constr)
1265                 ExecConstraints("ExecAppend", resultRelInfo, slot, estate);
1266
1267         /*
1268          * insert the tuple
1269          */
1270         newId = heap_insert(resultRelationDesc, tuple);
1271         setLastTid(&(tuple->t_self));
1272
1273         IncrAppended();
1274         (estate->es_processed)++;
1275         estate->es_lastoid = newId;
1276
1277         /*
1278          * process indices
1279          *
1280          * Note: heap_insert adds a new tuple to a relation.  As a side effect,
1281          * the tupleid of the new tuple is placed in the new tuple's t_ctid
1282          * field.
1283          */
1284         numIndices = resultRelInfo->ri_NumIndices;
1285         if (numIndices > 0)
1286                 ExecInsertIndexTuples(slot, &(tuple->t_self), estate, false);
1287
1288         /* AFTER ROW INSERT Triggers */
1289         if (resultRelInfo->ri_TrigDesc)
1290                 ExecARInsertTriggers(estate, resultRelInfo, tuple);
1291 }
1292
1293 /* ----------------------------------------------------------------
1294  *              ExecDelete
1295  *
1296  *              DELETE is like append, we delete the tuple and its
1297  *              index tuples.
1298  * ----------------------------------------------------------------
1299  */
1300 static void
1301 ExecDelete(TupleTableSlot *slot,
1302                    ItemPointer tupleid,
1303                    EState *estate)
1304 {
1305         ResultRelInfo *resultRelInfo;
1306         Relation        resultRelationDesc;
1307         ItemPointerData ctid;
1308         int                     result;
1309
1310         /*
1311          * get information on the (current) result relation
1312          */
1313         resultRelInfo = estate->es_result_relation_info;
1314         resultRelationDesc = resultRelInfo->ri_RelationDesc;
1315
1316         /* BEFORE ROW DELETE Triggers */
1317         if (resultRelInfo->ri_TrigDesc &&
1318                 resultRelInfo->ri_TrigDesc->n_before_row[TRIGGER_EVENT_DELETE] > 0)
1319         {
1320                 bool            dodelete;
1321
1322                 dodelete = ExecBRDeleteTriggers(estate, resultRelInfo, tupleid);
1323
1324                 if (!dodelete)                  /* "do nothing" */
1325                         return;
1326         }
1327
1328         /*
1329          * delete the tuple
1330          */
1331 ldelete:;
1332         result = heap_delete(resultRelationDesc, tupleid, &ctid);
1333         switch (result)
1334         {
1335                 case HeapTupleSelfUpdated:
1336                         return;
1337
1338                 case HeapTupleMayBeUpdated:
1339                         break;
1340
1341                 case HeapTupleUpdated:
1342                         if (XactIsoLevel == XACT_SERIALIZABLE)
1343                                 elog(ERROR, "Can't serialize access due to concurrent update");
1344                         else if (!(ItemPointerEquals(tupleid, &ctid)))
1345                         {
1346                                 TupleTableSlot *epqslot = EvalPlanQual(estate,
1347                                                            resultRelInfo->ri_RangeTableIndex, &ctid);
1348
1349                                 if (!TupIsNull(epqslot))
1350                                 {
1351                                         *tupleid = ctid;
1352                                         goto ldelete;
1353                                 }
1354                         }
1355                         /* tuple already deleted; nothing to do */
1356                         return;
1357
1358                 default:
1359                         elog(ERROR, "Unknown status %u from heap_delete", result);
1360                         return;
1361         }
1362
1363         IncrDeleted();
1364         (estate->es_processed)++;
1365
1366         /*
1367          * Note: Normally one would think that we have to delete index tuples
1368          * associated with the heap tuple now..
1369          *
1370          * ... but in POSTGRES, we have no need to do this because the vacuum
1371          * daemon automatically opens an index scan and deletes index tuples
1372          * when it finds deleted heap tuples. -cim 9/27/89
1373          */
1374
1375         /* AFTER ROW DELETE Triggers */
1376         if (resultRelInfo->ri_TrigDesc)
1377                 ExecARDeleteTriggers(estate, resultRelInfo, tupleid);
1378 }
1379
1380 /* ----------------------------------------------------------------
1381  *              ExecReplace
1382  *
1383  *              note: we can't run replace queries with transactions
1384  *              off because replaces are actually appends and our
1385  *              scan will mistakenly loop forever, replacing the tuple
1386  *              it just appended..      This should be fixed but until it
1387  *              is, we don't want to get stuck in an infinite loop
1388  *              which corrupts your database..
1389  * ----------------------------------------------------------------
1390  */
1391 static void
1392 ExecReplace(TupleTableSlot *slot,
1393                         ItemPointer tupleid,
1394                         EState *estate)
1395 {
1396         HeapTuple       tuple;
1397         ResultRelInfo *resultRelInfo;
1398         Relation        resultRelationDesc;
1399         ItemPointerData ctid;
1400         int                     result;
1401         int                     numIndices;
1402
1403         /*
1404          * abort the operation if not running transactions
1405          */
1406         if (IsBootstrapProcessingMode())
1407         {
1408                 elog(NOTICE, "ExecReplace: replace can't run without transactions");
1409                 return;
1410         }
1411
1412         /*
1413          * get the heap tuple out of the tuple table slot
1414          */
1415         tuple = slot->val;
1416
1417         /*
1418          * get information on the (current) result relation
1419          */
1420         resultRelInfo = estate->es_result_relation_info;
1421         resultRelationDesc = resultRelInfo->ri_RelationDesc;
1422
1423         /* BEFORE ROW UPDATE Triggers */
1424         if (resultRelInfo->ri_TrigDesc &&
1425                 resultRelInfo->ri_TrigDesc->n_before_row[TRIGGER_EVENT_UPDATE] > 0)
1426         {
1427                 HeapTuple       newtuple;
1428
1429                 newtuple = ExecBRUpdateTriggers(estate, resultRelInfo,
1430                                                                                 tupleid, tuple);
1431
1432                 if (newtuple == NULL)   /* "do nothing" */
1433                         return;
1434
1435                 if (newtuple != tuple)  /* modified by Trigger(s) */
1436                 {
1437
1438                         /*
1439                          * Insert modified tuple into tuple table slot, replacing the
1440                          * original.  We assume that it was allocated in per-tuple
1441                          * memory context, and therefore will go away by itself. The
1442                          * tuple table slot should not try to clear it.
1443                          */
1444                         ExecStoreTuple(newtuple, slot, InvalidBuffer, false);
1445                         tuple = newtuple;
1446                 }
1447         }
1448
1449         /*
1450          * Check the constraints of the tuple
1451          *
1452          * If we generate a new candidate tuple after EvalPlanQual testing,
1453          * we must loop back here and recheck constraints.  (We don't need to
1454          * redo triggers, however.  If there are any BEFORE triggers then
1455          * trigger.c will have done mark4update to lock the correct tuple,
1456          * so there's no need to do them again.)
1457          */
1458 lreplace:;
1459         if (resultRelationDesc->rd_att->constr)
1460                 ExecConstraints("ExecReplace", resultRelInfo, slot, estate);
1461
1462         /*
1463          * replace the heap tuple
1464          */
1465         result = heap_update(resultRelationDesc, tupleid, tuple, &ctid);
1466         switch (result)
1467         {
1468                 case HeapTupleSelfUpdated:
1469                         return;
1470
1471                 case HeapTupleMayBeUpdated:
1472                         break;
1473
1474                 case HeapTupleUpdated:
1475                         if (XactIsoLevel == XACT_SERIALIZABLE)
1476                                 elog(ERROR, "Can't serialize access due to concurrent update");
1477                         else if (!(ItemPointerEquals(tupleid, &ctid)))
1478                         {
1479                                 TupleTableSlot *epqslot = EvalPlanQual(estate,
1480                                                            resultRelInfo->ri_RangeTableIndex, &ctid);
1481
1482                                 if (!TupIsNull(epqslot))
1483                                 {
1484                                         *tupleid = ctid;
1485                                         tuple = ExecRemoveJunk(estate->es_junkFilter, epqslot);
1486                                         slot = ExecStoreTuple(tuple,
1487                                                                                   estate->es_junkFilter->jf_resultSlot,
1488                                                                                   InvalidBuffer, true);
1489                                         goto lreplace;
1490                                 }
1491                         }
1492                         /* tuple already deleted; nothing to do */
1493                         return;
1494
1495                 default:
1496                         elog(ERROR, "Unknown status %u from heap_update", result);
1497                         return;
1498         }
1499
1500         IncrReplaced();
1501         (estate->es_processed)++;
1502
1503         /*
1504          * Note: instead of having to update the old index tuples associated
1505          * with the heap tuple, all we do is form and insert new index tuples.
1506          * This is because replaces are actually deletes and inserts and index
1507          * tuple deletion is done automagically by the vacuum daemon. All we
1508          * do is insert new index tuples.  -cim 9/27/89
1509          */
1510
1511         /*
1512          * process indices
1513          *
1514          * heap_update updates a tuple in the base relation by invalidating it
1515          * and then appending a new tuple to the relation.      As a side effect,
1516          * the tupleid of the new tuple is placed in the new tuple's t_ctid
1517          * field.  So we now insert index tuples using the new tupleid stored
1518          * there.
1519          */
1520
1521         numIndices = resultRelInfo->ri_NumIndices;
1522         if (numIndices > 0)
1523                 ExecInsertIndexTuples(slot, &(tuple->t_self), estate, true);
1524
1525         /* AFTER ROW UPDATE Triggers */
1526         if (resultRelInfo->ri_TrigDesc)
1527                 ExecARUpdateTriggers(estate, resultRelInfo, tupleid, tuple);
1528 }
1529
1530 static char *
1531 ExecRelCheck(ResultRelInfo *resultRelInfo,
1532                          TupleTableSlot *slot, EState *estate)
1533 {
1534         Relation        rel = resultRelInfo->ri_RelationDesc;
1535         int                     ncheck = rel->rd_att->constr->num_check;
1536         ConstrCheck *check = rel->rd_att->constr->check;
1537         ExprContext *econtext;
1538         MemoryContext oldContext;
1539         List       *qual;
1540         int                     i;
1541
1542         /*
1543          * If first time through for this result relation, build expression
1544          * nodetrees for rel's constraint expressions.  Keep them in the
1545          * per-query memory context so they'll survive throughout the query.
1546          */
1547         if (resultRelInfo->ri_ConstraintExprs == NULL)
1548         {
1549                 oldContext = MemoryContextSwitchTo(estate->es_query_cxt);
1550                 resultRelInfo->ri_ConstraintExprs =
1551                         (List **) palloc(ncheck * sizeof(List *));
1552                 for (i = 0; i < ncheck; i++)
1553                 {
1554                         qual = (List *) stringToNode(check[i].ccbin);
1555                         resultRelInfo->ri_ConstraintExprs[i] = qual;
1556                 }
1557                 MemoryContextSwitchTo(oldContext);
1558         }
1559
1560         /*
1561          * We will use the EState's per-tuple context for evaluating
1562          * constraint expressions (creating it if it's not already there).
1563          */
1564         econtext = GetPerTupleExprContext(estate);
1565
1566         /* Arrange for econtext's scan tuple to be the tuple under test */
1567         econtext->ecxt_scantuple = slot;
1568
1569         /* And evaluate the constraints */
1570         for (i = 0; i < ncheck; i++)
1571         {
1572                 qual = resultRelInfo->ri_ConstraintExprs[i];
1573
1574                 /*
1575                  * NOTE: SQL92 specifies that a NULL result from a constraint
1576                  * expression is not to be treated as a failure.  Therefore, tell
1577                  * ExecQual to return TRUE for NULL.
1578                  */
1579                 if (!ExecQual(qual, econtext, true))
1580                         return check[i].ccname;
1581         }
1582
1583         /* NULL result means no error */
1584         return (char *) NULL;
1585 }
1586
1587 void
1588 ExecConstraints(char *caller, ResultRelInfo *resultRelInfo,
1589                                 TupleTableSlot *slot, EState *estate)
1590 {
1591         Relation        rel = resultRelInfo->ri_RelationDesc;
1592         HeapTuple       tuple = slot->val;
1593         TupleConstr *constr = rel->rd_att->constr;
1594
1595         Assert(constr);
1596
1597         if (constr->has_not_null)
1598         {
1599                 int                     natts = rel->rd_att->natts;
1600                 int                     attrChk;
1601
1602                 for (attrChk = 1; attrChk <= natts; attrChk++)
1603                 {
1604                         if (rel->rd_att->attrs[attrChk - 1]->attnotnull &&
1605                                 heap_attisnull(tuple, attrChk))
1606                                 elog(ERROR, "%s: Fail to add null value in not null attribute %s",
1607                                          caller, NameStr(rel->rd_att->attrs[attrChk - 1]->attname));
1608                 }
1609         }
1610
1611         if (constr->num_check > 0)
1612         {
1613                 char       *failed;
1614
1615                 if ((failed = ExecRelCheck(resultRelInfo, slot, estate)) != NULL)
1616                         elog(ERROR, "%s: rejected due to CHECK constraint %s",
1617                                  caller, failed);
1618         }
1619 }
1620
1621 /*
1622  * Check a modified tuple to see if we want to process its updated version
1623  * under READ COMMITTED rules.
1624  *
1625  * See backend/executor/README for some info about how this works.
1626  */
1627 TupleTableSlot *
1628 EvalPlanQual(EState *estate, Index rti, ItemPointer tid)
1629 {
1630         evalPlanQual *epq;
1631         EState     *epqstate;
1632         Relation        relation;
1633         HeapTupleData tuple;
1634         HeapTuple       copyTuple = NULL;
1635         int                     rtsize;
1636         bool            endNode;
1637
1638         Assert(rti != 0);
1639
1640         /*
1641          * find relation containing target tuple
1642          */
1643         if (estate->es_result_relation_info != NULL &&
1644                 estate->es_result_relation_info->ri_RangeTableIndex == rti)
1645         {
1646                 relation = estate->es_result_relation_info->ri_RelationDesc;
1647         }
1648         else
1649         {
1650                 List       *l;
1651
1652                 relation = NULL;
1653                 foreach(l, estate->es_rowMark)
1654                 {
1655                         if (((execRowMark *) lfirst(l))->rti == rti)
1656                         {
1657                                 relation = ((execRowMark *) lfirst(l))->relation;
1658                                 break;
1659                         }
1660                 }
1661                 if (relation == NULL)
1662                         elog(ERROR, "EvalPlanQual: can't find RTE %d", (int) rti);
1663         }
1664
1665         /*
1666          * fetch tid tuple
1667          *
1668          * Loop here to deal with updated or busy tuples
1669          */
1670         tuple.t_self = *tid;
1671         for (;;)
1672         {
1673                 Buffer          buffer;
1674
1675                 heap_fetch(relation, SnapshotDirty, &tuple, &buffer, NULL);
1676                 if (tuple.t_data != NULL)
1677                 {
1678                         TransactionId xwait = SnapshotDirty->xmax;
1679
1680                         if (TransactionIdIsValid(SnapshotDirty->xmin))
1681                                 elog(ERROR, "EvalPlanQual: t_xmin is uncommitted ?!");
1682
1683                         /*
1684                          * If tuple is being updated by other transaction then we have
1685                          * to wait for its commit/abort.
1686                          */
1687                         if (TransactionIdIsValid(xwait))
1688                         {
1689                                 ReleaseBuffer(buffer);
1690                                 XactLockTableWait(xwait);
1691                                 continue;
1692                         }
1693
1694                         /*
1695                          * We got tuple - now copy it for use by recheck query.
1696                          */
1697                         copyTuple = heap_copytuple(&tuple);
1698                         ReleaseBuffer(buffer);
1699                         break;
1700                 }
1701
1702                 /*
1703                  * Oops! Invalid tuple. Have to check is it updated or deleted.
1704                  * Note that it's possible to get invalid SnapshotDirty->tid if
1705                  * tuple updated by this transaction. Have we to check this ?
1706                  */
1707                 if (ItemPointerIsValid(&(SnapshotDirty->tid)) &&
1708                         !(ItemPointerEquals(&(tuple.t_self), &(SnapshotDirty->tid))))
1709                 {
1710                         /* updated, so look at the updated copy */
1711                         tuple.t_self = SnapshotDirty->tid;
1712                         continue;
1713                 }
1714
1715                 /*
1716                  * Deleted or updated by this transaction; forget it.
1717                  */
1718                 return NULL;
1719         }
1720
1721         /*
1722          * For UPDATE/DELETE we have to return tid of actual row we're
1723          * executing PQ for.
1724          */
1725         *tid = tuple.t_self;
1726
1727         /*
1728          * Need to run a recheck subquery.  Find or create a PQ stack entry.
1729          */
1730         epq = (evalPlanQual *) estate->es_evalPlanQual;
1731         rtsize = length(estate->es_range_table);
1732         endNode = true;
1733
1734         if (epq != NULL && epq->rti == 0)
1735         {
1736                 /* Top PQ stack entry is idle, so re-use it */
1737                 Assert(!(estate->es_useEvalPlan) &&
1738                            epq->estate.es_evalPlanQual == NULL);
1739                 epq->rti = rti;
1740                 endNode = false;
1741         }
1742
1743         /*
1744          * If this is request for another RTE - Ra, - then we have to check
1745          * wasn't PlanQual requested for Ra already and if so then Ra' row was
1746          * updated again and we have to re-start old execution for Ra and
1747          * forget all what we done after Ra was suspended. Cool? -:))
1748          */
1749         if (epq != NULL && epq->rti != rti &&
1750                 epq->estate.es_evTuple[rti - 1] != NULL)
1751         {
1752                 do
1753                 {
1754                         evalPlanQual *oldepq;
1755
1756                         /* pop previous PlanQual from the stack */
1757                         epqstate = &(epq->estate);
1758                         oldepq = (evalPlanQual *) epqstate->es_evalPlanQual;
1759                         Assert(oldepq->rti != 0);
1760                         /* stop execution */
1761                         ExecEndNode(epq->plan, epq->plan);
1762                         ExecDropTupleTable(epqstate->es_tupleTable, true);
1763                         epqstate->es_tupleTable = NULL;
1764                         heap_freetuple(epqstate->es_evTuple[epq->rti - 1]);
1765                         epqstate->es_evTuple[epq->rti - 1] = NULL;
1766                         /* push current PQ to freePQ stack */
1767                         oldepq->free = epq;
1768                         epq = oldepq;
1769                         estate->es_evalPlanQual = (Pointer) epq;
1770                 } while (epq->rti != rti);
1771         }
1772
1773         /*
1774          * If we are requested for another RTE then we have to suspend
1775          * execution of current PlanQual and start execution for new one.
1776          */
1777         if (epq == NULL || epq->rti != rti)
1778         {
1779                 /* try to reuse plan used previously */
1780                 evalPlanQual *newepq = (epq != NULL) ? epq->free : NULL;
1781
1782                 if (newepq == NULL)             /* first call or freePQ stack is empty */
1783                 {
1784                         newepq = (evalPlanQual *) palloc(sizeof(evalPlanQual));
1785                         newepq->free = NULL;
1786                         /*
1787                          * Each stack level has its own copy of the plan tree.  This
1788                          * is wasteful, but necessary as long as plan nodes point to
1789                          * exec state nodes rather than vice versa.  Note that copyfuncs.c
1790                          * doesn't attempt to copy the exec state nodes, which is a good
1791                          * thing in this situation.
1792                          */
1793                         newepq->plan = copyObject(estate->es_origPlan);
1794                         /*
1795                          * Init stack level's EState.  We share top level's copy of
1796                          * es_result_relations array and other non-changing status.
1797                          * We need our own tupletable, es_param_exec_vals, and other
1798                          * changeable state.
1799                          */
1800                         epqstate = &(newepq->estate);
1801                         memcpy(epqstate, estate, sizeof(EState));
1802                         epqstate->es_direction = ForwardScanDirection;
1803                         if (estate->es_origPlan->nParamExec > 0)
1804                                 epqstate->es_param_exec_vals = (ParamExecData *)
1805                                         palloc(estate->es_origPlan->nParamExec *
1806                                                    sizeof(ParamExecData));
1807                         epqstate->es_tupleTable = NULL;
1808                         epqstate->es_per_tuple_exprcontext = NULL;
1809                         /*
1810                          * Each epqstate must have its own es_evTupleNull state,
1811                          * but all the stack entries share es_evTuple state.  This
1812                          * allows sub-rechecks to inherit the value being examined by
1813                          * an outer recheck.
1814                          */
1815                         epqstate->es_evTupleNull = (bool *) palloc(rtsize * sizeof(bool));
1816                         if (epq == NULL)
1817                         {
1818                                 /* first PQ stack entry */
1819                                 epqstate->es_evTuple = (HeapTuple *)
1820                                         palloc(rtsize * sizeof(HeapTuple));
1821                                 memset(epqstate->es_evTuple, 0, rtsize * sizeof(HeapTuple));
1822                         }
1823                         else
1824                         {
1825                                 /* later stack entries share the same storage */
1826                                 epqstate->es_evTuple = epq->estate.es_evTuple;
1827                         }
1828                 }
1829                 else
1830                 {
1831                         /* recycle previously used EState */
1832                         epqstate = &(newepq->estate);
1833                 }
1834                 /* push current PQ to the stack */
1835                 epqstate->es_evalPlanQual = (Pointer) epq;
1836                 epq = newepq;
1837                 estate->es_evalPlanQual = (Pointer) epq;
1838                 epq->rti = rti;
1839                 endNode = false;
1840         }
1841
1842         Assert(epq->rti == rti);
1843         epqstate = &(epq->estate);
1844
1845         /*
1846          * Ok - we're requested for the same RTE.  Unfortunately we still
1847          * have to end and restart execution of the plan, because ExecReScan
1848          * wouldn't ensure that upper plan nodes would reset themselves.  We
1849          * could make that work if insertion of the target tuple were integrated
1850          * with the Param mechanism somehow, so that the upper plan nodes know
1851          * that their children's outputs have changed.
1852          */
1853         if (endNode)
1854         {
1855                 /* stop execution */
1856                 ExecEndNode(epq->plan, epq->plan);
1857                 ExecDropTupleTable(epqstate->es_tupleTable, true);
1858                 epqstate->es_tupleTable = NULL;
1859         }
1860
1861         /*
1862          * free old RTE' tuple, if any, and store target tuple where relation's
1863          * scan node will see it
1864          */
1865         if (epqstate->es_evTuple[rti - 1] != NULL)
1866                 heap_freetuple(epqstate->es_evTuple[rti - 1]);
1867         epqstate->es_evTuple[rti - 1] = copyTuple;
1868
1869         /*
1870          * Initialize for new recheck query; be careful to copy down state
1871          * that might have changed in top EState.
1872          */
1873         epqstate->es_result_relation_info = estate->es_result_relation_info;
1874         epqstate->es_junkFilter = estate->es_junkFilter;
1875         if (estate->es_origPlan->nParamExec > 0)
1876                 memset(epqstate->es_param_exec_vals, 0,
1877                            estate->es_origPlan->nParamExec * sizeof(ParamExecData));
1878         memset(epqstate->es_evTupleNull, false, rtsize * sizeof(bool));
1879         epqstate->es_useEvalPlan = false;
1880         Assert(epqstate->es_tupleTable == NULL);
1881         epqstate->es_tupleTable =
1882                 ExecCreateTupleTable(estate->es_tupleTable->size);
1883
1884         ExecInitNode(epq->plan, epqstate, NULL);
1885
1886         return EvalPlanQualNext(estate);
1887 }
1888
1889 static TupleTableSlot *
1890 EvalPlanQualNext(EState *estate)
1891 {
1892         evalPlanQual *epq = (evalPlanQual *) estate->es_evalPlanQual;
1893         EState     *epqstate = &(epq->estate);
1894         evalPlanQual *oldepq;
1895         TupleTableSlot *slot;
1896
1897         Assert(epq->rti != 0);
1898
1899 lpqnext:;
1900         slot = ExecProcNode(epq->plan, epq->plan);
1901
1902         /*
1903          * No more tuples for this PQ. Continue previous one.
1904          */
1905         if (TupIsNull(slot))
1906         {
1907                 /* stop execution */
1908                 ExecEndNode(epq->plan, epq->plan);
1909                 ExecDropTupleTable(epqstate->es_tupleTable, true);
1910                 epqstate->es_tupleTable = NULL;
1911                 heap_freetuple(epqstate->es_evTuple[epq->rti - 1]);
1912                 epqstate->es_evTuple[epq->rti - 1] = NULL;
1913                 /* pop old PQ from the stack */
1914                 oldepq = (evalPlanQual *) epqstate->es_evalPlanQual;
1915                 if (oldepq == (evalPlanQual *) NULL)
1916                 {
1917                         epq->rti = 0;           /* this is the first (oldest) */
1918                         estate->es_useEvalPlan = false;         /* PQ - mark as free and          */
1919                         return (NULL);          /* continue Query execution   */
1920                 }
1921                 Assert(oldepq->rti != 0);
1922                 /* push current PQ to freePQ stack */
1923                 oldepq->free = epq;
1924                 epq = oldepq;
1925                 epqstate = &(epq->estate);
1926                 estate->es_evalPlanQual = (Pointer) epq;
1927                 goto lpqnext;
1928         }
1929
1930         return (slot);
1931 }
1932
1933 static void
1934 EndEvalPlanQual(EState *estate)
1935 {
1936         evalPlanQual *epq = (evalPlanQual *) estate->es_evalPlanQual;
1937         EState     *epqstate = &(epq->estate);
1938         evalPlanQual *oldepq;
1939
1940         if (epq->rti == 0)                      /* plans already shutdowned */
1941         {
1942                 Assert(epq->estate.es_evalPlanQual == NULL);
1943                 return;
1944         }
1945
1946         for (;;)
1947         {
1948                 /* stop execution */
1949                 ExecEndNode(epq->plan, epq->plan);
1950                 ExecDropTupleTable(epqstate->es_tupleTable, true);
1951                 epqstate->es_tupleTable = NULL;
1952                 if (epqstate->es_evTuple[epq->rti - 1] != NULL)
1953                 {
1954                         heap_freetuple(epqstate->es_evTuple[epq->rti - 1]);
1955                         epqstate->es_evTuple[epq->rti - 1] = NULL;
1956                 }
1957                 /* pop old PQ from the stack */
1958                 oldepq = (evalPlanQual *) epqstate->es_evalPlanQual;
1959                 if (oldepq == (evalPlanQual *) NULL)
1960                 {
1961                         epq->rti = 0;           /* this is the first (oldest) */
1962                         estate->es_useEvalPlan = false;         /* PQ - mark as free */
1963                         break;
1964                 }
1965                 Assert(oldepq->rti != 0);
1966                 /* push current PQ to freePQ stack */
1967                 oldepq->free = epq;
1968                 epq = oldepq;
1969                 epqstate = &(epq->estate);
1970                 estate->es_evalPlanQual = (Pointer) epq;
1971         }
1972 }