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