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