src/backend/nodes/copyfuncs.c

   1 /*-------------------------------------------------------------------------
   2  *
   3  * copyfuncs.c
   4  *        Copy functions for Postgres tree nodes.
   5  *
   6  * NOTE: a general convention when copying or comparing plan nodes is
   7  * that we ignore the executor state subnode.  We do not need to look
   8  * at it because no current uses of copyObject() or equal() need to
   9  * deal with already-executing plan trees.      By leaving the state subnodes
  10  * out, we avoid needing to write copy/compare routines for all the
  11  * different executor state node types.
  12  *
  13  *
  14  * Portions Copyright (c) 1996-2001, PostgreSQL Global Development Group
  15  * Portions Copyright (c) 1994, Regents of the University of California
  16  *
  17  * IDENTIFICATION
  18  *        $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.151 2001/08/10 14:30:14 momjian Exp $
  19  *
  20  *-------------------------------------------------------------------------
  21  */
  22
  23 #include "postgres.h"
  24
  25 #include "optimizer/clauses.h"
  26 #include "optimizer/planmain.h"
  27
  28
  29 /*
  30  * Node_Copy
  31  *        a macro to simplify calling of copyObject on the specified field
  32  */
  33 #define Node_Copy(from, newnode, field) \
  34         ((newnode)->field = copyObject((from)->field))
  35
  36
  37 /*
  38  * listCopy
  39  *        This copy function only copies the "cons-cells" of the list, not the
  40  *        pointed-to objects.  (Use copyObject if you want a "deep" copy.)
  41  *
  42  *        We also use this function for copying lists of integers, which is
  43  *        grotty but unlikely to break --- it could fail if sizeof(pointer)
  44  *        is less than sizeof(int), but I don't know any such machines...
  45  *
  46  *        Note that copyObject will surely coredump if applied to a list
  47  *        of integers!
  48  */
  49 List *
  50 listCopy(List *list)
  51 {
  52         List       *newlist,
  53                            *l,
  54                            *nl;
  55
  56         /* rather ugly coding for speed... */
  57         if (list == NIL)
  58                 return NIL;
  59
  60         newlist = nl = makeList1(lfirst(list));
  61
  62         foreach(l, lnext(list))
  63         {
  64                 lnext(nl) = makeList1(lfirst(l));
  65                 nl = lnext(nl);
  66         }
  67         return newlist;
  68 }
  69
  70 /* ****************************************************************
  71  *                                       plannodes.h copy functions
  72  * ****************************************************************
  73  */
  74
  75 /* ----------------
  76  *              CopyPlanFields
  77  *
  78  *              This function copies the fields of the Plan node.  It is used by
  79  *              all the copy functions for classes which inherit from Plan.
  80  * ----------------
  81  */
  82 static void
  83 CopyPlanFields(Plan *from, Plan *newnode)
  84 {
  85         newnode->startup_cost = from->startup_cost;
  86         newnode->total_cost = from->total_cost;
  87         newnode->plan_rows = from->plan_rows;
  88         newnode->plan_width = from->plan_width;
  89         /* state is NOT copied */
  90         Node_Copy(from, newnode, targetlist);
  91         Node_Copy(from, newnode, qual);
  92         Node_Copy(from, newnode, lefttree);
  93         Node_Copy(from, newnode, righttree);
  94         newnode->extParam = listCopy(from->extParam);
  95         newnode->locParam = listCopy(from->locParam);
  96         newnode->chgParam = listCopy(from->chgParam);
  97         Node_Copy(from, newnode, initPlan);
  98         /* subPlan list must point to subplans in the new subtree, not the old */
  99         if (from->subPlan != NIL)
 100                 newnode->subPlan = nconc(pull_subplans((Node *) newnode->targetlist),
 101                                                                  pull_subplans((Node *) newnode->qual));
 102         else
 103                 newnode->subPlan = NIL;
 104         newnode->nParamExec = from->nParamExec;
 105 }
 106
 107 /* ----------------
 108  *              _copyPlan
 109  * ----------------
 110  */
 111 static Plan *
 112 _copyPlan(Plan *from)
 113 {
 114         Plan       *newnode = makeNode(Plan);
 115
 116         /*
 117          * copy the node superclass fields
 118          */
 119         CopyPlanFields(from, newnode);
 120
 121         return newnode;
 122 }
 123
 124
 125 /* ----------------
 126  *              _copyResult
 127  * ----------------
 128  */
 129 static Result *
 130 _copyResult(Result *from)
 131 {
 132         Result     *newnode = makeNode(Result);
 133
 134         /*
 135          * copy node superclass fields
 136          */
 137         CopyPlanFields((Plan *) from, (Plan *) newnode);
 138
 139         /*
 140          * copy remainder of node
 141          */
 142         Node_Copy(from, newnode, resconstantqual);
 143
 144         /*
 145          * We must add subplans in resconstantqual to the new plan's subPlan
 146          * list
 147          */
 148         if (from->plan.subPlan != NIL)
 149                 newnode->plan.subPlan = nconc(newnode->plan.subPlan,
 150                                                                 pull_subplans(newnode->resconstantqual));
 151
 152         return newnode;
 153 }
 154
 155 /* ----------------
 156  *              _copyAppend
 157  * ----------------
 158  */
 159 static Append *
 160 _copyAppend(Append *from)
 161 {
 162         Append     *newnode = makeNode(Append);
 163
 164         /*
 165          * copy node superclass fields
 166          */
 167         CopyPlanFields((Plan *) from, (Plan *) newnode);
 168
 169         /*
 170          * copy remainder of node
 171          */
 172         Node_Copy(from, newnode, appendplans);
 173         newnode->isTarget = from->isTarget;
 174
 175         return newnode;
 176 }
 177
 178
 179 /* ----------------
 180  *              CopyScanFields
 181  *
 182  *              This function copies the fields of the Scan node.  It is used by
 183  *              all the copy functions for classes which inherit from Scan.
 184  * ----------------
 185  */
 186 static void
 187 CopyScanFields(Scan *from, Scan *newnode)
 188 {
 189         newnode->scanrelid = from->scanrelid;
 190         return;
 191 }
 192
 193 /* ----------------
 194  *              _copyScan
 195  * ----------------
 196  */
 197 static Scan *
 198 _copyScan(Scan *from)
 199 {
 200         Scan       *newnode = makeNode(Scan);
 201
 202         /*
 203          * copy node superclass fields
 204          */
 205         CopyPlanFields((Plan *) from, (Plan *) newnode);
 206         CopyScanFields((Scan *) from, (Scan *) newnode);
 207
 208         return newnode;
 209 }
 210
 211 /* ----------------
 212  *              _copySeqScan
 213  * ----------------
 214  */
 215 static SeqScan *
 216 _copySeqScan(SeqScan *from)
 217 {
 218         SeqScan    *newnode = makeNode(SeqScan);
 219
 220         /*
 221          * copy node superclass fields
 222          */
 223         CopyPlanFields((Plan *) from, (Plan *) newnode);
 224         CopyScanFields((Scan *) from, (Scan *) newnode);
 225
 226         return newnode;
 227 }
 228
 229 /* ----------------
 230  *              _copyIndexScan
 231  * ----------------
 232  */
 233 static IndexScan *
 234 _copyIndexScan(IndexScan *from)
 235 {
 236         IndexScan  *newnode = makeNode(IndexScan);
 237
 238         /*
 239          * copy node superclass fields
 240          */
 241         CopyPlanFields((Plan *) from, (Plan *) newnode);
 242         CopyScanFields((Scan *) from, (Scan *) newnode);
 243
 244         /*
 245          * copy remainder of node
 246          */
 247         newnode->indxid = listCopy(from->indxid);
 248         Node_Copy(from, newnode, indxqual);
 249         Node_Copy(from, newnode, indxqualorig);
 250         newnode->indxorderdir = from->indxorderdir;
 251
 252         /*
 253          * We must add subplans in index quals to the new plan's subPlan list
 254          */
 255         if (from->scan.plan.subPlan != NIL)
 256         {
 257                 newnode->scan.plan.subPlan = nconc(newnode->scan.plan.subPlan,
 258                                                           pull_subplans((Node *) newnode->indxqual));
 259                 newnode->scan.plan.subPlan = nconc(newnode->scan.plan.subPlan,
 260                                                   pull_subplans((Node *) newnode->indxqualorig));
 261         }
 262
 263         return newnode;
 264 }
 265
 266 /* ----------------
 267  *                              _copyTidScan
 268  * ----------------
 269  */
 270 static TidScan *
 271 _copyTidScan(TidScan *from)
 272 {
 273         TidScan    *newnode = makeNode(TidScan);
 274
 275         /*
 276          * copy node superclass fields
 277          */
 278         CopyPlanFields((Plan *) from, (Plan *) newnode);
 279         CopyScanFields((Scan *) from, (Scan *) newnode);
 280
 281         /*
 282          * copy remainder of node
 283          */
 284         newnode->needRescan = from->needRescan;
 285         Node_Copy(from, newnode, tideval);
 286
 287         return newnode;
 288 }
 289
 290 /* ----------------
 291  *              _copySubqueryScan
 292  * ----------------
 293  */
 294 static SubqueryScan *
 295 _copySubqueryScan(SubqueryScan *from)
 296 {
 297         SubqueryScan *newnode = makeNode(SubqueryScan);
 298
 299         /*
 300          * copy node superclass fields
 301          */
 302         CopyPlanFields((Plan *) from, (Plan *) newnode);
 303         CopyScanFields((Scan *) from, (Scan *) newnode);
 304
 305         /*
 306          * copy remainder of node
 307          */
 308         Node_Copy(from, newnode, subplan);
 309
 310         return newnode;
 311 }
 312
 313
 314 /* ----------------
 315  *              CopyJoinFields
 316  *
 317  *              This function copies the fields of the Join node.  It is used by
 318  *              all the copy functions for classes which inherit from Join.
 319  * ----------------
 320  */
 321 static void
 322 CopyJoinFields(Join *from, Join *newnode)
 323 {
 324         newnode->jointype = from->jointype;
 325         Node_Copy(from, newnode, joinqual);
 326         /* subPlan list must point to subplans in the new subtree, not the old */
 327         if (from->plan.subPlan != NIL)
 328                 newnode->plan.subPlan = nconc(newnode->plan.subPlan,
 329                                                           pull_subplans((Node *) newnode->joinqual));
 330 }
 331
 332
 333 /* ----------------
 334  *              _copyJoin
 335  * ----------------
 336  */
 337 static Join *
 338 _copyJoin(Join *from)
 339 {
 340         Join       *newnode = makeNode(Join);
 341
 342         /*
 343          * copy node superclass fields
 344          */
 345         CopyPlanFields((Plan *) from, (Plan *) newnode);
 346         CopyJoinFields(from, newnode);
 347
 348         return newnode;
 349 }
 350
 351
 352 /* ----------------
 353  *              _copyNestLoop
 354  * ----------------
 355  */
 356 static NestLoop *
 357 _copyNestLoop(NestLoop *from)
 358 {
 359         NestLoop   *newnode = makeNode(NestLoop);
 360
 361         /*
 362          * copy node superclass fields
 363          */
 364         CopyPlanFields((Plan *) from, (Plan *) newnode);
 365         CopyJoinFields((Join *) from, (Join *) newnode);
 366
 367         return newnode;
 368 }
 369
 370
 371 /* ----------------
 372  *              _copyMergeJoin
 373  * ----------------
 374  */
 375 static MergeJoin *
 376 _copyMergeJoin(MergeJoin *from)
 377 {
 378         MergeJoin  *newnode = makeNode(MergeJoin);
 379
 380         /*
 381          * copy node superclass fields
 382          */
 383         CopyPlanFields((Plan *) from, (Plan *) newnode);
 384         CopyJoinFields((Join *) from, (Join *) newnode);
 385
 386         /*
 387          * copy remainder of node
 388          */
 389         Node_Copy(from, newnode, mergeclauses);
 390
 391         /*
 392          * We must add subplans in mergeclauses to the new plan's subPlan list
 393          */
 394         if (from->join.plan.subPlan != NIL)
 395                 newnode->join.plan.subPlan = nconc(newnode->join.plan.subPlan,
 396                                                   pull_subplans((Node *) newnode->mergeclauses));
 397
 398         return newnode;
 399 }
 400
 401 /* ----------------
 402  *              _copyHashJoin
 403  * ----------------
 404  */
 405 static HashJoin *
 406 _copyHashJoin(HashJoin *from)
 407 {
 408         HashJoin   *newnode = makeNode(HashJoin);
 409
 410         /*
 411          * copy node superclass fields
 412          */
 413         CopyPlanFields((Plan *) from, (Plan *) newnode);
 414         CopyJoinFields((Join *) from, (Join *) newnode);
 415
 416         /*
 417          * copy remainder of node
 418          */
 419         Node_Copy(from, newnode, hashclauses);
 420         newnode->hashjoinop = from->hashjoinop;
 421
 422         /*
 423          * We must add subplans in hashclauses to the new plan's subPlan list
 424          */
 425         if (from->join.plan.subPlan != NIL)
 426                 newnode->join.plan.subPlan = nconc(newnode->join.plan.subPlan,
 427                                                    pull_subplans((Node *) newnode->hashclauses));
 428
 429         return newnode;
 430 }
 431
 432
 433 /* ----------------
 434  *              _copyMaterial
 435  * ----------------
 436  */
 437 static Material *
 438 _copyMaterial(Material *from)
 439 {
 440         Material   *newnode = makeNode(Material);
 441
 442         /*
 443          * copy node superclass fields
 444          */
 445         CopyPlanFields((Plan *) from, (Plan *) newnode);
 446
 447         return newnode;
 448 }
 449
 450
 451 /* ----------------
 452  *              _copySort
 453  * ----------------
 454  */
 455 static Sort *
 456 _copySort(Sort *from)
 457 {
 458         Sort       *newnode = makeNode(Sort);
 459
 460         /*
 461          * copy node superclass fields
 462          */
 463         CopyPlanFields((Plan *) from, (Plan *) newnode);
 464
 465         newnode->keycount = from->keycount;
 466
 467         return newnode;
 468 }
 469
 470
 471 /* ----------------
 472  *              _copyGroup
 473  * ----------------
 474  */
 475 static Group *
 476 _copyGroup(Group *from)
 477 {
 478         Group      *newnode = makeNode(Group);
 479
 480         CopyPlanFields((Plan *) from, (Plan *) newnode);
 481
 482         newnode->tuplePerGroup = from->tuplePerGroup;
 483         newnode->numCols = from->numCols;
 484         newnode->grpColIdx = palloc(from->numCols * sizeof(AttrNumber));
 485         memcpy(newnode->grpColIdx, from->grpColIdx, from->numCols * sizeof(AttrNumber));
 486
 487         return newnode;
 488 }
 489
 490 /* ---------------
 491  *      _copyAgg
 492  * --------------
 493  */
 494 static Agg *
 495 _copyAgg(Agg *from)
 496 {
 497         Agg                *newnode = makeNode(Agg);
 498
 499         CopyPlanFields((Plan *) from, (Plan *) newnode);
 500
 501         return newnode;
 502 }
 503
 504 /* ---------------
 505  *      _copyGroupClause
 506  * --------------
 507  */
 508 static GroupClause *
 509 _copyGroupClause(GroupClause *from)
 510 {
 511         GroupClause *newnode = makeNode(GroupClause);
 512
 513         newnode->tleSortGroupRef = from->tleSortGroupRef;
 514         newnode->sortop = from->sortop;
 515
 516         return newnode;
 517 }
 518
 519 /* ----------------
 520  *              _copyUnique
 521  * ----------------
 522  */
 523 static Unique *
 524 _copyUnique(Unique *from)
 525 {
 526         Unique     *newnode = makeNode(Unique);
 527
 528         /*
 529          * copy node superclass fields
 530          */
 531         CopyPlanFields((Plan *) from, (Plan *) newnode);
 532
 533         /*
 534          * copy remainder of node
 535          */
 536         newnode->numCols = from->numCols;
 537         newnode->uniqColIdx = palloc(from->numCols * sizeof(AttrNumber));
 538         memcpy(newnode->uniqColIdx, from->uniqColIdx, from->numCols * sizeof(AttrNumber));
 539
 540         return newnode;
 541 }
 542
 543 /* ----------------
 544  *              _copySetOp
 545  * ----------------
 546  */
 547 static SetOp *
 548 _copySetOp(SetOp *from)
 549 {
 550         SetOp      *newnode = makeNode(SetOp);
 551
 552         /*
 553          * copy node superclass fields
 554          */
 555         CopyPlanFields((Plan *) from, (Plan *) newnode);
 556
 557         /*
 558          * copy remainder of node
 559          */
 560         newnode->cmd = from->cmd;
 561         newnode->numCols = from->numCols;
 562         newnode->dupColIdx = palloc(from->numCols * sizeof(AttrNumber));
 563         memcpy(newnode->dupColIdx, from->dupColIdx, from->numCols * sizeof(AttrNumber));
 564         newnode->flagColIdx = from->flagColIdx;
 565
 566         return newnode;
 567 }
 568
 569 /* ----------------
 570  *              _copyLimit
 571  * ----------------
 572  */
 573 static Limit *
 574 _copyLimit(Limit *from)
 575 {
 576         Limit      *newnode = makeNode(Limit);
 577
 578         /*
 579          * copy node superclass fields
 580          */
 581         CopyPlanFields((Plan *) from, (Plan *) newnode);
 582
 583         /*
 584          * copy remainder of node
 585          */
 586         Node_Copy(from, newnode, limitOffset);
 587         Node_Copy(from, newnode, limitCount);
 588
 589         return newnode;
 590 }
 591
 592 /* ----------------
 593  *              _copyHash
 594  * ----------------
 595  */
 596 static Hash *
 597 _copyHash(Hash *from)
 598 {
 599         Hash       *newnode = makeNode(Hash);
 600
 601         /*
 602          * copy node superclass fields
 603          */
 604         CopyPlanFields((Plan *) from, (Plan *) newnode);
 605
 606         /*
 607          * copy remainder of node
 608          */
 609         Node_Copy(from, newnode, hashkey);
 610
 611         return newnode;
 612 }
 613
 614 static SubPlan *
 615 _copySubPlan(SubPlan *from)
 616 {
 617         SubPlan    *newnode = makeNode(SubPlan);
 618
 619         Node_Copy(from, newnode, plan);
 620         newnode->plan_id = from->plan_id;
 621         Node_Copy(from, newnode, rtable);
 622         newnode->setParam = listCopy(from->setParam);
 623         newnode->parParam = listCopy(from->parParam);
 624         Node_Copy(from, newnode, sublink);
 625
 626         /* do not copy execution state */
 627         newnode->needShutdown = false;
 628         newnode->curTuple = NULL;
 629
 630         return newnode;
 631 }
 632
 633 /* ****************************************************************
 634  *                                         primnodes.h copy functions
 635  * ****************************************************************
 636  */
 637
 638 /* ----------------
 639  *              _copyResdom
 640  * ----------------
 641  */
 642 static Resdom *
 643 _copyResdom(Resdom *from)
 644 {
 645         Resdom     *newnode = makeNode(Resdom);
 646
 647         newnode->resno = from->resno;
 648         newnode->restype = from->restype;
 649         newnode->restypmod = from->restypmod;
 650         if (from->resname != NULL)
 651                 newnode->resname = pstrdup(from->resname);
 652         newnode->ressortgroupref = from->ressortgroupref;
 653         newnode->reskey = from->reskey;
 654         newnode->reskeyop = from->reskeyop;
 655         newnode->resjunk = from->resjunk;
 656
 657         return newnode;
 658 }
 659
 660 static Fjoin *
 661 _copyFjoin(Fjoin *from)
 662 {
 663         Fjoin      *newnode = makeNode(Fjoin);
 664
 665         /*
 666          * copy node superclass fields
 667          */
 668
 669         newnode->fj_initialized = from->fj_initialized;
 670         newnode->fj_nNodes = from->fj_nNodes;
 671
 672         Node_Copy(from, newnode, fj_innerNode);
 673
 674         newnode->fj_results = (DatumPtr)
 675                 palloc((from->fj_nNodes) * sizeof(Datum));
 676         memmove(from->fj_results,
 677                         newnode->fj_results,
 678                         (from->fj_nNodes) * sizeof(Datum));
 679
 680         newnode->fj_alwaysDone = (BoolPtr)
 681                 palloc((from->fj_nNodes) * sizeof(bool));
 682         memmove(from->fj_alwaysDone,
 683                         newnode->fj_alwaysDone,
 684                         (from->fj_nNodes) * sizeof(bool));
 685
 686
 687         return newnode;
 688 }
 689
 690 /* ----------------
 691  *              _copyExpr
 692  * ----------------
 693  */
 694 static Expr *
 695 _copyExpr(Expr *from)
 696 {
 697         Expr       *newnode = makeNode(Expr);
 698
 699         /*
 700          * copy node superclass fields
 701          */
 702         newnode->typeOid = from->typeOid;
 703         newnode->opType = from->opType;
 704
 705         Node_Copy(from, newnode, oper);
 706         Node_Copy(from, newnode, args);
 707
 708         return newnode;
 709 }
 710
 711 /* ----------------
 712  *              _copyVar
 713  * ----------------
 714  */
 715 static Var *
 716 _copyVar(Var *from)
 717 {
 718         Var                *newnode = makeNode(Var);
 719
 720         /*
 721          * copy remainder of node
 722          */
 723         newnode->varno = from->varno;
 724         newnode->varattno = from->varattno;
 725         newnode->vartype = from->vartype;
 726         newnode->vartypmod = from->vartypmod;
 727         newnode->varlevelsup = from->varlevelsup;
 728
 729         newnode->varnoold = from->varnoold;
 730         newnode->varoattno = from->varoattno;
 731
 732         return newnode;
 733 }
 734
 735 static Attr *
 736 _copyAttr(Attr *from)
 737 {
 738         Attr       *newnode = makeNode(Attr);
 739
 740         if (from->relname)
 741                 newnode->relname = pstrdup(from->relname);
 742         Node_Copy(from, newnode, attrs);
 743
 744         return newnode;
 745 }
 746
 747 /* ----------------
 748  *              _copyOper
 749  * ----------------
 750  */
 751 static Oper *
 752 _copyOper(Oper *from)
 753 {
 754         Oper       *newnode = makeNode(Oper);
 755
 756         /*
 757          * copy remainder of node
 758          */
 759         newnode->opno = from->opno;
 760         newnode->opid = from->opid;
 761         newnode->opresulttype = from->opresulttype;
 762         /* Do not copy the run-time state, if any */
 763         newnode->op_fcache = NULL;
 764
 765         return newnode;
 766 }
 767
 768 /* ----------------
 769  *              _copyConst
 770  * ----------------
 771  */
 772 static Const *
 773 _copyConst(Const *from)
 774 {
 775         Const      *newnode = makeNode(Const);
 776
 777         /*
 778          * copy remainder of node
 779          */
 780         newnode->consttype = from->consttype;
 781         newnode->constlen = from->constlen;
 782
 783         if (from->constbyval || from->constisnull)
 784         {
 785
 786                 /*
 787                  * passed by value so just copy the datum. Also, don't try to copy
 788                  * struct when value is null!
 789                  *
 790                  */
 791                 newnode->constvalue = from->constvalue;
 792         }
 793         else
 794         {
 795
 796                 /*
 797                  * not passed by value. datum contains a pointer.
 798                  */
 799                 int                     length = from->constlen;
 800
 801                 if (length == -1)               /* variable-length type? */
 802                         length = VARSIZE(from->constvalue);
 803                 newnode->constvalue = PointerGetDatum(palloc(length));
 804                 memcpy(DatumGetPointer(newnode->constvalue),
 805                            DatumGetPointer(from->constvalue),
 806                            length);
 807         }
 808
 809         newnode->constisnull = from->constisnull;
 810         newnode->constbyval = from->constbyval;
 811         newnode->constisset = from->constisset;
 812         newnode->constiscast = from->constiscast;
 813
 814         return newnode;
 815 }
 816
 817 /* ----------------
 818  *              _copyParam
 819  * ----------------
 820  */
 821 static Param *
 822 _copyParam(Param *from)
 823 {
 824         Param      *newnode = makeNode(Param);
 825
 826         /*
 827          * copy remainder of node
 828          */
 829         newnode->paramkind = from->paramkind;
 830         newnode->paramid = from->paramid;
 831
 832         if (from->paramname != NULL)
 833                 newnode->paramname = pstrdup(from->paramname);
 834         newnode->paramtype = from->paramtype;
 835
 836         return newnode;
 837 }
 838
 839 /* ----------------
 840  *              _copyFunc
 841  * ----------------
 842  */
 843 static Func *
 844 _copyFunc(Func *from)
 845 {
 846         Func       *newnode = makeNode(Func);
 847
 848         /*
 849          * copy remainder of node
 850          */
 851         newnode->funcid = from->funcid;
 852         newnode->functype = from->functype;
 853         /* Do not copy the run-time state, if any */
 854         newnode->func_fcache = NULL;
 855
 856         return newnode;
 857 }
 858
 859 /* ----------------
 860  *              _copyAggref
 861  * ----------------
 862  */
 863 static Aggref *
 864 _copyAggref(Aggref *from)
 865 {
 866         Aggref     *newnode = makeNode(Aggref);
 867
 868         /*
 869          * copy remainder of node
 870          */
 871         newnode->aggname = pstrdup(from->aggname);
 872         newnode->basetype = from->basetype;
 873         newnode->aggtype = from->aggtype;
 874         Node_Copy(from, newnode, target);
 875         newnode->aggstar = from->aggstar;
 876         newnode->aggdistinct = from->aggdistinct;
 877         newnode->aggno = from->aggno;           /* probably not needed */
 878
 879         return newnode;
 880 }
 881
 882 /* ----------------
 883  *              _copySubLink
 884  * ----------------
 885  */
 886 static SubLink *
 887 _copySubLink(SubLink *from)
 888 {
 889         SubLink    *newnode = makeNode(SubLink);
 890
 891         /*
 892          * copy remainder of node
 893          */
 894         newnode->subLinkType = from->subLinkType;
 895         newnode->useor = from->useor;
 896         Node_Copy(from, newnode, lefthand);
 897         Node_Copy(from, newnode, oper);
 898         Node_Copy(from, newnode, subselect);
 899
 900         return newnode;
 901 }
 902
 903 /* ----------------
 904  *              _copyFieldSelect
 905  * ----------------
 906  */
 907 static FieldSelect *
 908 _copyFieldSelect(FieldSelect *from)
 909 {
 910         FieldSelect *newnode = makeNode(FieldSelect);
 911
 912         /*
 913          * copy remainder of node
 914          */
 915         Node_Copy(from, newnode, arg);
 916         newnode->fieldnum = from->fieldnum;
 917         newnode->resulttype = from->resulttype;
 918         newnode->resulttypmod = from->resulttypmod;
 919
 920         return newnode;
 921 }
 922
 923 /* ----------------
 924  *              _copyRelabelType
 925  * ----------------
 926  */
 927 static RelabelType *
 928 _copyRelabelType(RelabelType *from)
 929 {
 930         RelabelType *newnode = makeNode(RelabelType);
 931
 932         /*
 933          * copy remainder of node
 934          */
 935         Node_Copy(from, newnode, arg);
 936         newnode->resulttype = from->resulttype;
 937         newnode->resulttypmod = from->resulttypmod;
 938
 939         return newnode;
 940 }
 941
 942 static RangeTblRef *
 943 _copyRangeTblRef(RangeTblRef *from)
 944 {
 945         RangeTblRef *newnode = makeNode(RangeTblRef);
 946
 947         newnode->rtindex = from->rtindex;
 948
 949         return newnode;
 950 }
 951
 952 static FromExpr *
 953 _copyFromExpr(FromExpr *from)
 954 {
 955         FromExpr   *newnode = makeNode(FromExpr);
 956
 957         Node_Copy(from, newnode, fromlist);
 958         Node_Copy(from, newnode, quals);
 959
 960         return newnode;
 961 }
 962
 963 static JoinExpr *
 964 _copyJoinExpr(JoinExpr *from)
 965 {
 966         JoinExpr   *newnode = makeNode(JoinExpr);
 967
 968         newnode->jointype = from->jointype;
 969         newnode->isNatural = from->isNatural;
 970         Node_Copy(from, newnode, larg);
 971         Node_Copy(from, newnode, rarg);
 972         Node_Copy(from, newnode, using);
 973         Node_Copy(from, newnode, quals);
 974         Node_Copy(from, newnode, alias);
 975         Node_Copy(from, newnode, colnames);
 976         Node_Copy(from, newnode, colvars);
 977
 978         return newnode;
 979 }
 980
 981 /* ----------------
 982  *              _copyCaseExpr
 983  * ----------------
 984  */
 985 static CaseExpr *
 986 _copyCaseExpr(CaseExpr *from)
 987 {
 988         CaseExpr   *newnode = makeNode(CaseExpr);
 989
 990         /*
 991          * copy remainder of node
 992          */
 993         newnode->casetype = from->casetype;
 994
 995         Node_Copy(from, newnode, arg);
 996         Node_Copy(from, newnode, args);
 997         Node_Copy(from, newnode, defresult);
 998
 999         return newnode;
1000 }
1001
1002 /* ----------------
1003  *              _copyCaseWhen
1004  * ----------------
1005  */
1006 static CaseWhen *
1007 _copyCaseWhen(CaseWhen *from)
1008 {
1009         CaseWhen   *newnode = makeNode(CaseWhen);
1010
1011         /*
1012          * copy remainder of node
1013          */
1014         Node_Copy(from, newnode, expr);
1015         Node_Copy(from, newnode, result);
1016
1017         return newnode;
1018 }
1019
1020 /* ----------------
1021  *              _copyNullTest
1022  * ----------------
1023  */
1024 static NullTest *
1025 _copyNullTest(NullTest *from)
1026 {
1027         NullTest *newnode = makeNode(NullTest);
1028
1029         /*
1030          * copy remainder of node
1031          */
1032         Node_Copy(from, newnode, arg);
1033         newnode->nulltesttype = from->nulltesttype;
1034
1035         return newnode;
1036 }
1037
1038 /* ----------------
1039  *              _copyBooleanTest
1040  * ----------------
1041  */
1042 static BooleanTest *
1043 _copyBooleanTest(BooleanTest *from)
1044 {
1045         BooleanTest *newnode = makeNode(BooleanTest);
1046
1047         /*
1048          * copy remainder of node
1049          */
1050         Node_Copy(from, newnode, arg);
1051         newnode->booltesttype = from->booltesttype;
1052
1053         return newnode;
1054 }
1055
1056 static ArrayRef *
1057 _copyArrayRef(ArrayRef *from)
1058 {
1059         ArrayRef   *newnode = makeNode(ArrayRef);
1060
1061         /*
1062          * copy remainder of node
1063          */
1064         newnode->refattrlength = from->refattrlength;
1065         newnode->refelemlength = from->refelemlength;
1066         newnode->refelemtype = from->refelemtype;
1067         newnode->refelembyval = from->refelembyval;
1068
1069         Node_Copy(from, newnode, refupperindexpr);
1070         Node_Copy(from, newnode, reflowerindexpr);
1071         Node_Copy(from, newnode, refexpr);
1072         Node_Copy(from, newnode, refassgnexpr);
1073
1074         return newnode;
1075 }
1076
1077 /* ****************************************************************
1078  *                                              relation.h copy functions
1079  * ****************************************************************
1080  */
1081
1082 /* ----------------
1083  *              _copyRelOptInfo
1084  * ----------------
1085  */
1086 /*
1087  *      when you change this, also make sure to fix up xfunc_copyRelOptInfo in
1088  *      planner/path/xfunc.c accordingly!!!
1089  *              -- JMH, 8/2/93
1090  */
1091 static RelOptInfo *
1092 _copyRelOptInfo(RelOptInfo *from)
1093 {
1094         RelOptInfo *newnode = makeNode(RelOptInfo);
1095
1096         newnode->relids = listCopy(from->relids);
1097
1098         newnode->rows = from->rows;
1099         newnode->width = from->width;
1100
1101         Node_Copy(from, newnode, targetlist);
1102         Node_Copy(from, newnode, pathlist);
1103         /* XXX cheapest-path fields should point to members of pathlist? */
1104         Node_Copy(from, newnode, cheapest_startup_path);
1105         Node_Copy(from, newnode, cheapest_total_path);
1106         newnode->pruneable = from->pruneable;
1107
1108         newnode->issubquery = from->issubquery;
1109         Node_Copy(from, newnode, indexlist);
1110         newnode->pages = from->pages;
1111         newnode->tuples = from->tuples;
1112         Node_Copy(from, newnode, subplan);
1113
1114         Node_Copy(from, newnode, baserestrictinfo);
1115         newnode->baserestrictcost = from->baserestrictcost;
1116         newnode->outerjoinset = listCopy(from->outerjoinset);
1117         Node_Copy(from, newnode, joininfo);
1118         Node_Copy(from, newnode, innerjoin);
1119
1120         return newnode;
1121 }
1122
1123 /* ----------------
1124  *              _copyIndexOptInfo
1125  * ----------------
1126  */
1127 static IndexOptInfo *
1128 _copyIndexOptInfo(IndexOptInfo *from)
1129 {
1130         IndexOptInfo *newnode = makeNode(IndexOptInfo);
1131         Size            len;
1132
1133         newnode->indexoid = from->indexoid;
1134         newnode->pages = from->pages;
1135         newnode->tuples = from->tuples;
1136
1137         newnode->ncolumns = from->ncolumns;
1138         newnode->nkeys = from->nkeys;
1139
1140         if (from->classlist)
1141         {
1142                 /* copy the trailing zero too */
1143                 len = (from->ncolumns + 1) * sizeof(Oid);
1144                 newnode->classlist = (Oid *) palloc(len);
1145                 memcpy(newnode->classlist, from->classlist, len);
1146         }
1147
1148         if (from->indexkeys)
1149         {
1150                 /* copy the trailing zero too */
1151                 len = (from->nkeys + 1) * sizeof(int);
1152                 newnode->indexkeys = (int *) palloc(len);
1153                 memcpy(newnode->indexkeys, from->indexkeys, len);
1154         }
1155
1156         if (from->ordering)
1157         {
1158                 /* copy the trailing zero too */
1159                 len = (from->ncolumns + 1) * sizeof(Oid);
1160                 newnode->ordering = (Oid *) palloc(len);
1161                 memcpy(newnode->ordering, from->ordering, len);
1162         }
1163
1164         newnode->relam = from->relam;
1165         newnode->amcostestimate = from->amcostestimate;
1166         newnode->indproc = from->indproc;
1167         Node_Copy(from, newnode, indpred);
1168         newnode->unique = from->unique;
1169         newnode->lossy = from->lossy;
1170
1171         return newnode;
1172 }
1173
1174 /* ----------------
1175  *              CopyPathFields
1176  *
1177  *              This function copies the fields of the Path node.  It is used by
1178  *              all the copy functions for classes which inherit from Path.
1179  * ----------------
1180  */
1181 static void
1182 CopyPathFields(Path *from, Path *newnode)
1183 {
1184
1185         /*
1186          * Modify the next line, since it causes the copying to cycle (i.e.
1187          * the parent points right back here! -- JMH, 7/7/92. Old version:
1188          * Node_Copy(from, newnode, parent);
1189          */
1190         newnode->parent = from->parent;
1191
1192         newnode->startup_cost = from->startup_cost;
1193         newnode->total_cost = from->total_cost;
1194
1195         newnode->pathtype = from->pathtype;
1196
1197         Node_Copy(from, newnode, pathkeys);
1198 }
1199
1200 /* ----------------
1201  *              _copyPath
1202  * ----------------
1203  */
1204 static Path *
1205 _copyPath(Path *from)
1206 {
1207         Path       *newnode = makeNode(Path);
1208
1209         CopyPathFields(from, newnode);
1210
1211         return newnode;
1212 }
1213
1214 /* ----------------
1215  *              _copyIndexPath
1216  * ----------------
1217  */
1218 static IndexPath *
1219 _copyIndexPath(IndexPath *from)
1220 {
1221         IndexPath  *newnode = makeNode(IndexPath);
1222
1223         /*
1224          * copy the node superclass fields
1225          */
1226         CopyPathFields((Path *) from, (Path *) newnode);
1227
1228         /*
1229          * copy remainder of node
1230          */
1231         Node_Copy(from, newnode, indexinfo);
1232         Node_Copy(from, newnode, indexqual);
1233         newnode->indexscandir = from->indexscandir;
1234         newnode->joinrelids = listCopy(from->joinrelids);
1235         newnode->alljoinquals = from->alljoinquals;
1236         newnode->rows = from->rows;
1237
1238         return newnode;
1239 }
1240
1241 /* ----------------
1242  *                              _copyTidPath
1243  * ----------------
1244  */
1245 static TidPath *
1246 _copyTidPath(TidPath *from)
1247 {
1248         TidPath    *newnode = makeNode(TidPath);
1249
1250         /*
1251          * copy the node superclass fields
1252          */
1253         CopyPathFields((Path *) from, (Path *) newnode);
1254
1255         /*
1256          * copy remainder of node
1257          */
1258         Node_Copy(from, newnode, tideval);
1259         newnode->unjoined_relids = listCopy(from->unjoined_relids);
1260
1261         return newnode;
1262 }
1263
1264 /* ----------------
1265  *                              _copyAppendPath
1266  * ----------------
1267  */
1268 static AppendPath *
1269 _copyAppendPath(AppendPath *from)
1270 {
1271         AppendPath *newnode = makeNode(AppendPath);
1272
1273         /*
1274          * copy the node superclass fields
1275          */
1276         CopyPathFields((Path *) from, (Path *) newnode);
1277
1278         /*
1279          * copy remainder of node
1280          */
1281         Node_Copy(from, newnode, subpaths);
1282
1283         return newnode;
1284 }
1285
1286 /* ----------------
1287  *              CopyJoinPathFields
1288  *
1289  *              This function copies the fields of the JoinPath node.  It is used by
1290  *              all the copy functions for classes which inherit from JoinPath.
1291  * ----------------
1292  */
1293 static void
1294 CopyJoinPathFields(JoinPath *from, JoinPath *newnode)
1295 {
1296         newnode->jointype = from->jointype;
1297         Node_Copy(from, newnode, outerjoinpath);
1298         Node_Copy(from, newnode, innerjoinpath);
1299         Node_Copy(from, newnode, joinrestrictinfo);
1300 }
1301
1302 /* ----------------
1303  *              _copyNestPath
1304  * ----------------
1305  */
1306 static NestPath *
1307 _copyNestPath(NestPath *from)
1308 {
1309         NestPath   *newnode = makeNode(NestPath);
1310
1311         /*
1312          * copy the node superclass fields
1313          */
1314         CopyPathFields((Path *) from, (Path *) newnode);
1315         CopyJoinPathFields((JoinPath *) from, (JoinPath *) newnode);
1316
1317         return newnode;
1318 }
1319
1320 /* ----------------
1321  *              _copyMergePath
1322  * ----------------
1323  */
1324 static MergePath *
1325 _copyMergePath(MergePath *from)
1326 {
1327         MergePath  *newnode = makeNode(MergePath);
1328
1329         /*
1330          * copy the node superclass fields
1331          */
1332         CopyPathFields((Path *) from, (Path *) newnode);
1333         CopyJoinPathFields((JoinPath *) from, (JoinPath *) newnode);
1334
1335         /*
1336          * copy the remainder of the node
1337          */
1338         Node_Copy(from, newnode, path_mergeclauses);
1339         Node_Copy(from, newnode, outersortkeys);
1340         Node_Copy(from, newnode, innersortkeys);
1341
1342         return newnode;
1343 }
1344
1345 /* ----------------
1346  *              _copyHashPath
1347  * ----------------
1348  */
1349 static HashPath *
1350 _copyHashPath(HashPath *from)
1351 {
1352         HashPath   *newnode = makeNode(HashPath);
1353
1354         /*
1355          * copy the node superclass fields
1356          */
1357         CopyPathFields((Path *) from, (Path *) newnode);
1358         CopyJoinPathFields((JoinPath *) from, (JoinPath *) newnode);
1359
1360         /*
1361          * copy remainder of node
1362          */
1363         Node_Copy(from, newnode, path_hashclauses);
1364
1365         return newnode;
1366 }
1367
1368 /* ----------------
1369  *              _copyPathKeyItem
1370  * ----------------
1371  */
1372 static PathKeyItem *
1373 _copyPathKeyItem(PathKeyItem *from)
1374 {
1375         PathKeyItem *newnode = makeNode(PathKeyItem);
1376
1377         /*
1378          * copy remainder of node
1379          */
1380         Node_Copy(from, newnode, key);
1381         newnode->sortop = from->sortop;
1382
1383         return newnode;
1384 }
1385
1386 /* ----------------
1387  *              _copyRestrictInfo
1388  * ----------------
1389  */
1390 static RestrictInfo *
1391 _copyRestrictInfo(RestrictInfo *from)
1392 {
1393         RestrictInfo *newnode = makeNode(RestrictInfo);
1394
1395         /*
1396          * copy remainder of node
1397          */
1398         Node_Copy(from, newnode, clause);
1399         newnode->ispusheddown = from->ispusheddown;
1400         Node_Copy(from, newnode, subclauseindices);
1401         newnode->eval_cost = from->eval_cost;
1402         newnode->this_selec = from->this_selec;
1403         newnode->mergejoinoperator = from->mergejoinoperator;
1404         newnode->left_sortop = from->left_sortop;
1405         newnode->right_sortop = from->right_sortop;
1406
1407         /*
1408          * Do not copy pathkeys, since they'd not be canonical in a copied
1409          * query
1410          */
1411         newnode->left_pathkey = NIL;
1412         newnode->right_pathkey = NIL;
1413         newnode->hashjoinoperator = from->hashjoinoperator;
1414         newnode->left_bucketsize = from->left_bucketsize;
1415         newnode->right_bucketsize = from->right_bucketsize;
1416
1417         return newnode;
1418 }
1419
1420 /* ----------------
1421  *              _copyJoinInfo
1422  * ----------------
1423  */
1424 static JoinInfo *
1425 _copyJoinInfo(JoinInfo *from)
1426 {
1427         JoinInfo   *newnode = makeNode(JoinInfo);
1428
1429         /*
1430          * copy remainder of node
1431          */
1432         newnode->unjoined_relids = listCopy(from->unjoined_relids);
1433         Node_Copy(from, newnode, jinfo_restrictinfo);
1434
1435         return newnode;
1436 }
1437
1438 static Iter *
1439 _copyIter(Iter *from)
1440 {
1441         Iter       *newnode = makeNode(Iter);
1442
1443         Node_Copy(from, newnode, iterexpr);
1444         newnode->itertype = from->itertype;
1445
1446         return newnode;
1447 }
1448
1449 static Stream *
1450 _copyStream(Stream *from)
1451 {
1452         Stream     *newnode = makeNode(Stream);
1453
1454         newnode->pathptr = from->pathptr;
1455         newnode->cinfo = from->cinfo;
1456         newnode->clausetype = from->clausetype;
1457
1458         newnode->upstream = (StreamPtr) NULL;           /* only copy nodes
1459                                                                                                  * downwards! */
1460         Node_Copy(from, newnode, downstream);
1461         if (newnode->downstream)
1462                 ((Stream *) newnode->downstream)->upstream = (Stream *) newnode;
1463
1464         newnode->groupup = from->groupup;
1465         newnode->groupcost = from->groupcost;
1466         newnode->groupsel = from->groupsel;
1467
1468         return newnode;
1469 }
1470
1471 /* ****************************************************************
1472  *                                      parsenodes.h copy functions
1473  * ****************************************************************
1474  */
1475
1476 static TargetEntry *
1477 _copyTargetEntry(TargetEntry *from)
1478 {
1479         TargetEntry *newnode = makeNode(TargetEntry);
1480
1481         Node_Copy(from, newnode, resdom);
1482         Node_Copy(from, newnode, fjoin);
1483         Node_Copy(from, newnode, expr);
1484         return newnode;
1485 }
1486
1487 static RangeTblEntry *
1488 _copyRangeTblEntry(RangeTblEntry *from)
1489 {
1490         RangeTblEntry *newnode = makeNode(RangeTblEntry);
1491
1492         if (from->relname)
1493                 newnode->relname = pstrdup(from->relname);
1494         newnode->relid = from->relid;
1495         Node_Copy(from, newnode, subquery);
1496         Node_Copy(from, newnode, alias);
1497         Node_Copy(from, newnode, eref);
1498         newnode->inh = from->inh;
1499         newnode->inFromCl = from->inFromCl;
1500         newnode->checkForRead = from->checkForRead;
1501         newnode->checkForWrite = from->checkForWrite;
1502         newnode->checkAsUser = from->checkAsUser;
1503
1504         return newnode;
1505 }
1506
1507 static FkConstraint *
1508 _copyFkConstraint(FkConstraint *from)
1509 {
1510         FkConstraint *newnode = makeNode(FkConstraint);
1511
1512         if (from->constr_name)
1513                 newnode->constr_name = pstrdup(from->constr_name);
1514         if (from->pktable_name)
1515                 newnode->pktable_name = pstrdup(from->pktable_name);
1516         Node_Copy(from, newnode, fk_attrs);
1517         Node_Copy(from, newnode, pk_attrs);
1518         if (from->match_type)
1519                 newnode->match_type = pstrdup(from->match_type);
1520         newnode->actions = from->actions;
1521         newnode->deferrable = from->deferrable;
1522         newnode->initdeferred = from->initdeferred;
1523
1524         return newnode;
1525 }
1526
1527 static SortClause *
1528 _copySortClause(SortClause *from)
1529 {
1530         SortClause *newnode = makeNode(SortClause);
1531
1532         newnode->tleSortGroupRef = from->tleSortGroupRef;
1533         newnode->sortop = from->sortop;
1534
1535         return newnode;
1536 }
1537
1538 static A_Expr *
1539 _copyAExpr(A_Expr *from)
1540 {
1541         A_Expr     *newnode = makeNode(A_Expr);
1542
1543         newnode->oper = from->oper;
1544         if (from->opname)
1545                 newnode->opname = pstrdup(from->opname);
1546         Node_Copy(from, newnode, lexpr);
1547         Node_Copy(from, newnode, rexpr);
1548
1549         return newnode;
1550 }
1551
1552 static A_Const *
1553 _copyAConst(A_Const *from)
1554 {
1555         A_Const    *newnode = makeNode(A_Const);
1556
1557         newnode->val = *((Value *) (copyObject(&(from->val))));
1558         Node_Copy(from, newnode, typename);
1559
1560         return newnode;
1561 }
1562
1563 static ParamNo *
1564 _copyParamNo(ParamNo *from)
1565 {
1566         ParamNo    *newnode = makeNode(ParamNo);
1567
1568         newnode->number = from->number;
1569         Node_Copy(from, newnode, typename);
1570         Node_Copy(from, newnode, indirection);
1571
1572         return newnode;
1573 }
1574
1575 static Ident *
1576 _copyIdent(Ident *from)
1577 {
1578         Ident      *newnode = makeNode(Ident);
1579
1580         if (from->name)
1581                 newnode->name = pstrdup(from->name);
1582         Node_Copy(from, newnode, indirection);
1583         newnode->isRel = from->isRel;
1584
1585         return newnode;
1586 }
1587
1588 static FuncCall *
1589 _copyFuncCall(FuncCall *from)
1590 {
1591         FuncCall   *newnode = makeNode(FuncCall);
1592
1593         if (from->funcname)
1594                 newnode->funcname = pstrdup(from->funcname);
1595         Node_Copy(from, newnode, args);
1596         newnode->agg_star = from->agg_star;
1597         newnode->agg_distinct = from->agg_distinct;
1598
1599         return newnode;
1600 }
1601
1602 static A_Indices *
1603 _copyAIndices(A_Indices *from)
1604 {
1605         A_Indices  *newnode = makeNode(A_Indices);
1606
1607         Node_Copy(from, newnode, lidx);
1608         Node_Copy(from, newnode, uidx);
1609
1610         return newnode;
1611 }
1612
1613 static ResTarget *
1614 _copyResTarget(ResTarget *from)
1615 {
1616         ResTarget  *newnode = makeNode(ResTarget);
1617
1618         if (from->name)
1619                 newnode->name = pstrdup(from->name);
1620         Node_Copy(from, newnode, indirection);
1621         Node_Copy(from, newnode, val);
1622
1623         return newnode;
1624 }
1625
1626 static TypeName *
1627 _copyTypeName(TypeName *from)
1628 {
1629         TypeName   *newnode = makeNode(TypeName);
1630
1631         if (from->name)
1632                 newnode->name = pstrdup(from->name);
1633         newnode->timezone = from->timezone;
1634         newnode->setof = from->setof;
1635         newnode->typmod = from->typmod;
1636         Node_Copy(from, newnode, arrayBounds);
1637
1638         return newnode;
1639 }
1640
1641 static SortGroupBy *
1642 _copySortGroupBy(SortGroupBy *from)
1643 {
1644         SortGroupBy *newnode = makeNode(SortGroupBy);
1645
1646         if (from->useOp)
1647                 newnode->useOp = pstrdup(from->useOp);
1648         Node_Copy(from, newnode, node);
1649
1650         return newnode;
1651 }
1652
1653 static RangeVar *
1654 _copyRangeVar(RangeVar *from)
1655 {
1656         RangeVar   *newnode = makeNode(RangeVar);
1657
1658         if (from->relname)
1659                 newnode->relname = pstrdup(from->relname);
1660         newnode->inhOpt = from->inhOpt;
1661         Node_Copy(from, newnode, name);
1662
1663         return newnode;
1664 }
1665
1666 static RangeSubselect *
1667 _copyRangeSubselect(RangeSubselect *from)
1668 {
1669         RangeSubselect *newnode = makeNode(RangeSubselect);
1670
1671         Node_Copy(from, newnode, subquery);
1672         Node_Copy(from, newnode, name);
1673
1674         return newnode;
1675 }
1676
1677 static TypeCast *
1678 _copyTypeCast(TypeCast *from)
1679 {
1680         TypeCast   *newnode = makeNode(TypeCast);
1681
1682         Node_Copy(from, newnode, arg);
1683         Node_Copy(from, newnode, typename);
1684
1685         return newnode;
1686 }
1687
1688 static IndexElem *
1689 _copyIndexElem(IndexElem *from)
1690 {
1691         IndexElem  *newnode = makeNode(IndexElem);
1692
1693         if (from->name)
1694                 newnode->name = pstrdup(from->name);
1695         Node_Copy(from, newnode, args);
1696         if (from->class)
1697                 newnode->class = pstrdup(from->class);
1698
1699         return newnode;
1700 }
1701
1702 static ColumnDef *
1703 _copyColumnDef(ColumnDef *from)
1704 {
1705         ColumnDef  *newnode = makeNode(ColumnDef);
1706
1707         if (from->colname)
1708                 newnode->colname = pstrdup(from->colname);
1709         Node_Copy(from, newnode, typename);
1710         newnode->is_not_null = from->is_not_null;
1711         newnode->is_sequence = from->is_sequence;
1712         Node_Copy(from, newnode, raw_default);
1713         if (from->cooked_default)
1714                 newnode->cooked_default = pstrdup(from->cooked_default);
1715         Node_Copy(from, newnode, constraints);
1716
1717         return newnode;
1718 }
1719
1720 static Constraint *
1721 _copyConstraint(Constraint *from)
1722 {
1723         Constraint *newnode = makeNode(Constraint);
1724
1725         newnode->contype = from->contype;
1726         if (from->name)
1727                 newnode->name = pstrdup(from->name);
1728         Node_Copy(from, newnode, raw_expr);
1729         if (from->cooked_expr)
1730                 newnode->cooked_expr = pstrdup(from->cooked_expr);
1731         Node_Copy(from, newnode, keys);
1732
1733         return newnode;
1734 }
1735
1736 static DefElem *
1737 _copyDefElem(DefElem *from)
1738 {
1739         DefElem    *newnode = makeNode(DefElem);
1740
1741         if (from->defname)
1742                 newnode->defname = pstrdup(from->defname);
1743         Node_Copy(from, newnode, arg);
1744
1745         return newnode;
1746 }
1747
1748 static Query *
1749 _copyQuery(Query *from)
1750 {
1751         Query      *newnode = makeNode(Query);
1752
1753         newnode->commandType = from->commandType;
1754         Node_Copy(from, newnode, utilityStmt);
1755         newnode->resultRelation = from->resultRelation;
1756         if (from->into)
1757                 newnode->into = pstrdup(from->into);
1758         newnode->isPortal = from->isPortal;
1759         newnode->isBinary = from->isBinary;
1760         newnode->isTemp = from->isTemp;
1761         newnode->hasAggs = from->hasAggs;
1762         newnode->hasSubLinks = from->hasSubLinks;
1763
1764         Node_Copy(from, newnode, rtable);
1765         Node_Copy(from, newnode, jointree);
1766
1767         newnode->rowMarks = listCopy(from->rowMarks);
1768
1769         Node_Copy(from, newnode, targetList);
1770
1771         Node_Copy(from, newnode, groupClause);
1772         Node_Copy(from, newnode, havingQual);
1773         Node_Copy(from, newnode, distinctClause);
1774         Node_Copy(from, newnode, sortClause);
1775
1776         Node_Copy(from, newnode, limitOffset);
1777         Node_Copy(from, newnode, limitCount);
1778
1779         Node_Copy(from, newnode, setOperations);
1780
1781         newnode->resultRelations = listCopy(from->resultRelations);
1782
1783         /*
1784          * We do not copy the planner internal fields: base_rel_list,
1785          * other_rel_list, join_rel_list, equi_key_list, query_pathkeys.
1786          * Not entirely clear if this is right?
1787          */
1788
1789         return newnode;
1790 }
1791
1792 static InsertStmt *
1793 _copyInsertStmt(InsertStmt *from)
1794 {
1795         InsertStmt *newnode = makeNode(InsertStmt);
1796
1797         if (from->relname)
1798                 newnode->relname = pstrdup(from->relname);
1799         Node_Copy(from, newnode, cols);
1800         Node_Copy(from, newnode, targetList);
1801         Node_Copy(from, newnode, selectStmt);
1802
1803         return newnode;
1804 }
1805
1806 static DeleteStmt *
1807 _copyDeleteStmt(DeleteStmt *from)
1808 {
1809         DeleteStmt *newnode = makeNode(DeleteStmt);
1810
1811         if (from->relname)
1812                 newnode->relname = pstrdup(from->relname);
1813         Node_Copy(from, newnode, whereClause);
1814         newnode->inhOpt = from->inhOpt;
1815
1816         return newnode;
1817 }
1818
1819 static UpdateStmt *
1820 _copyUpdateStmt(UpdateStmt *from)
1821 {
1822         UpdateStmt *newnode = makeNode(UpdateStmt);
1823
1824         if (from->relname)
1825                 newnode->relname = pstrdup(from->relname);
1826         Node_Copy(from, newnode, targetList);
1827         Node_Copy(from, newnode, whereClause);
1828         Node_Copy(from, newnode, fromClause);
1829         newnode->inhOpt = from->inhOpt;
1830
1831         return newnode;
1832 }
1833
1834 static SelectStmt *
1835 _copySelectStmt(SelectStmt *from)
1836 {
1837         SelectStmt *newnode = makeNode(SelectStmt);
1838
1839         Node_Copy(from, newnode, distinctClause);
1840         if (from->into)
1841                 newnode->into = pstrdup(from->into);
1842         newnode->istemp = from->istemp;
1843         Node_Copy(from, newnode, targetList);
1844         Node_Copy(from, newnode, fromClause);
1845         Node_Copy(from, newnode, whereClause);
1846         Node_Copy(from, newnode, groupClause);
1847         Node_Copy(from, newnode, havingClause);
1848         Node_Copy(from, newnode, sortClause);
1849         if (from->portalname)
1850                 newnode->portalname = pstrdup(from->portalname);
1851         newnode->binary = from->binary;
1852         Node_Copy(from, newnode, limitOffset);
1853         Node_Copy(from, newnode, limitCount);
1854         Node_Copy(from, newnode, forUpdate);
1855         newnode->op = from->op;
1856         newnode->all = from->all;
1857         Node_Copy(from, newnode, larg);
1858         Node_Copy(from, newnode, rarg);
1859
1860         return newnode;
1861 }
1862
1863 static SetOperationStmt *
1864 _copySetOperationStmt(SetOperationStmt *from)
1865 {
1866         SetOperationStmt *newnode = makeNode(SetOperationStmt);
1867
1868         newnode->op = from->op;
1869         newnode->all = from->all;
1870         Node_Copy(from, newnode, larg);
1871         Node_Copy(from, newnode, rarg);
1872         newnode->colTypes = listCopy(from->colTypes);
1873
1874         return newnode;
1875 }
1876
1877 static AlterTableStmt *
1878 _copyAlterTableStmt(AlterTableStmt *from)
1879 {
1880         AlterTableStmt *newnode = makeNode(AlterTableStmt);
1881
1882         newnode->subtype = from->subtype;
1883         if (from->relname)
1884                 newnode->relname = pstrdup(from->relname);
1885         newnode->inhOpt = from->inhOpt;
1886         if (from->name)
1887                 newnode->name = pstrdup(from->name);
1888         Node_Copy(from, newnode, def);
1889         newnode->behavior = from->behavior;
1890
1891         return newnode;
1892 }
1893
1894 static GrantStmt *
1895 _copyGrantStmt(GrantStmt *from)
1896 {
1897         GrantStmt *newnode = makeNode(GrantStmt);
1898
1899         newnode->is_grant = from->is_grant;
1900         Node_Copy(from, newnode, relnames);
1901         if (from->privileges)
1902                 newnode->privileges = pstrdup(from->privileges);
1903         Node_Copy(from, newnode, grantees);
1904
1905         return newnode;
1906 }
1907
1908 static PrivGrantee *
1909 _copyPrivGrantee(PrivGrantee *from)
1910 {
1911         PrivGrantee *newnode = makeNode(PrivGrantee);
1912
1913         if (from->username)
1914                 newnode->username = pstrdup(from->username);
1915         if (from->groupname)
1916                 newnode->groupname = pstrdup(from->groupname);
1917
1918         return newnode;
1919 }
1920
1921 static ClosePortalStmt *
1922 _copyClosePortalStmt(ClosePortalStmt *from)
1923 {
1924         ClosePortalStmt *newnode = makeNode(ClosePortalStmt);
1925
1926         if (from->portalname)
1927                 newnode->portalname = pstrdup(from->portalname);
1928
1929         return newnode;
1930 }
1931
1932 static ClusterStmt *
1933 _copyClusterStmt(ClusterStmt *from)
1934 {
1935         ClusterStmt *newnode = makeNode(ClusterStmt);
1936
1937         if (from->relname)
1938                 newnode->relname = pstrdup(from->relname);
1939         if (from->indexname)
1940                 newnode->indexname = pstrdup(from->indexname);
1941
1942         return newnode;
1943 }
1944
1945 static CopyStmt *
1946 _copyCopyStmt(CopyStmt *from)
1947 {
1948         CopyStmt   *newnode = makeNode(CopyStmt);
1949
1950         newnode->binary = from->binary;
1951         if (from->relname)
1952                 newnode->relname = pstrdup(from->relname);
1953         newnode->oids = from->oids;
1954         newnode->direction = from->direction;
1955         if (from->filename)
1956                 newnode->filename = pstrdup(from->filename);
1957         if (from->delimiter)
1958                 newnode->delimiter = pstrdup(from->delimiter);
1959         if (from->null_print)
1960                 newnode->null_print = pstrdup(from->null_print);
1961
1962         return newnode;
1963 }
1964
1965 static CreateStmt *
1966 _copyCreateStmt(CreateStmt *from)
1967 {
1968         CreateStmt *newnode = makeNode(CreateStmt);
1969
1970         newnode->istemp = from->istemp;
1971         newnode->relname = pstrdup(from->relname);
1972         Node_Copy(from, newnode, tableElts);
1973         Node_Copy(from, newnode, inhRelnames);
1974         Node_Copy(from, newnode, constraints);
1975
1976         return newnode;
1977 }
1978
1979 static VersionStmt *
1980 _copyVersionStmt(VersionStmt *from)
1981 {
1982         VersionStmt *newnode = makeNode(VersionStmt);
1983
1984         newnode->relname = pstrdup(from->relname);
1985         newnode->direction = from->direction;
1986         newnode->fromRelname = pstrdup(from->fromRelname);
1987         newnode->date = pstrdup(from->date);
1988
1989         return newnode;
1990 }
1991
1992 static DefineStmt *
1993 _copyDefineStmt(DefineStmt *from)
1994 {
1995         DefineStmt *newnode = makeNode(DefineStmt);
1996
1997         newnode->defType = from->defType;
1998         newnode->defname = pstrdup(from->defname);
1999         Node_Copy(from, newnode, definition);
2000
2001         return newnode;
2002 }
2003
2004 static DropStmt *
2005 _copyDropStmt(DropStmt *from)
2006 {
2007         DropStmt   *newnode = makeNode(DropStmt);
2008
2009         Node_Copy(from, newnode, names);
2010         newnode->removeType = from->removeType;
2011
2012         return newnode;
2013 }
2014
2015 static TruncateStmt *
2016 _copyTruncateStmt(TruncateStmt *from)
2017 {
2018         TruncateStmt *newnode = makeNode(TruncateStmt);
2019
2020         newnode->relName = pstrdup(from->relName);
2021
2022         return newnode;
2023 }
2024
2025 static CommentStmt *
2026 _copyCommentStmt(CommentStmt *from)
2027 {
2028         CommentStmt *newnode = makeNode(CommentStmt);
2029
2030         newnode->objtype = from->objtype;
2031         newnode->objname = pstrdup(from->objname);
2032         if (from->objproperty)
2033                 newnode->objproperty = pstrdup(from->objproperty);
2034         Node_Copy(from, newnode, objlist);
2035         newnode->comment = pstrdup(from->comment);
2036
2037         return newnode;
2038 }
2039
2040 static FetchStmt *
2041 _copyFetchStmt(FetchStmt *from)
2042 {
2043         FetchStmt  *newnode = makeNode(FetchStmt);
2044
2045         newnode->direction = from->direction;
2046         newnode->howMany = from->howMany;
2047         newnode->portalname = pstrdup(from->portalname);
2048         newnode->ismove = from->ismove;
2049
2050         return newnode;
2051 }
2052
2053 static IndexStmt *
2054 _copyIndexStmt(IndexStmt *from)
2055 {
2056         IndexStmt  *newnode = makeNode(IndexStmt);
2057
2058         newnode->idxname = pstrdup(from->idxname);
2059         newnode->relname = pstrdup(from->relname);
2060         newnode->accessMethod = pstrdup(from->accessMethod);
2061         Node_Copy(from, newnode, indexParams);
2062         Node_Copy(from, newnode, withClause);
2063         Node_Copy(from, newnode, whereClause);
2064         Node_Copy(from, newnode, rangetable);
2065         newnode->unique = from->unique;
2066         newnode->primary = from->primary;
2067
2068         return newnode;
2069 }
2070
2071 static ProcedureStmt *
2072 _copyProcedureStmt(ProcedureStmt *from)
2073 {
2074         ProcedureStmt *newnode = makeNode(ProcedureStmt);
2075
2076         newnode->funcname = pstrdup(from->funcname);
2077         Node_Copy(from, newnode, argTypes);
2078         Node_Copy(from, newnode, returnType);
2079         Node_Copy(from, newnode, withClause);
2080         Node_Copy(from, newnode, as);
2081         newnode->language = pstrdup(from->language);
2082
2083         return newnode;
2084 }
2085
2086 static RemoveAggrStmt *
2087 _copyRemoveAggrStmt(RemoveAggrStmt *from)
2088 {
2089         RemoveAggrStmt *newnode = makeNode(RemoveAggrStmt);
2090
2091         newnode->aggname = pstrdup(from->aggname);
2092         Node_Copy(from, newnode, aggtype);
2093
2094         return newnode;
2095 }
2096
2097 static RemoveFuncStmt *
2098 _copyRemoveFuncStmt(RemoveFuncStmt *from)
2099 {
2100         RemoveFuncStmt *newnode = makeNode(RemoveFuncStmt);
2101
2102         newnode->funcname = pstrdup(from->funcname);
2103         Node_Copy(from, newnode, args);
2104
2105         return newnode;
2106 }
2107
2108 static RemoveOperStmt *
2109 _copyRemoveOperStmt(RemoveOperStmt *from)
2110 {
2111         RemoveOperStmt *newnode = makeNode(RemoveOperStmt);
2112
2113         newnode->opname = pstrdup(from->opname);
2114         Node_Copy(from, newnode, args);
2115
2116         return newnode;
2117 }
2118
2119 static RenameStmt *
2120 _copyRenameStmt(RenameStmt *from)
2121 {
2122         RenameStmt *newnode = makeNode(RenameStmt);
2123
2124         newnode->relname = pstrdup(from->relname);
2125         newnode->inhOpt = from->inhOpt;
2126         if (from->column)
2127                 newnode->column = pstrdup(from->column);
2128         if (from->newname)
2129                 newnode->newname = pstrdup(from->newname);
2130
2131         return newnode;
2132 }
2133
2134 static RuleStmt *
2135 _copyRuleStmt(RuleStmt *from)
2136 {
2137         RuleStmt   *newnode = makeNode(RuleStmt);
2138
2139         newnode->rulename = pstrdup(from->rulename);
2140         Node_Copy(from, newnode, whereClause);
2141         newnode->event = from->event;
2142         Node_Copy(from, newnode, object);
2143         newnode->instead = from->instead;
2144         Node_Copy(from, newnode, actions);
2145
2146         return newnode;
2147 }
2148
2149 static NotifyStmt *
2150 _copyNotifyStmt(NotifyStmt *from)
2151 {
2152         NotifyStmt *newnode = makeNode(NotifyStmt);
2153
2154         if (from->relname)
2155                 newnode->relname = pstrdup(from->relname);
2156
2157         return newnode;
2158 }
2159
2160 static ListenStmt *
2161 _copyListenStmt(ListenStmt *from)
2162 {
2163         ListenStmt *newnode = makeNode(ListenStmt);
2164
2165         if (from->relname)
2166                 newnode->relname = pstrdup(from->relname);
2167
2168         return newnode;
2169 }
2170
2171 static UnlistenStmt *
2172 _copyUnlistenStmt(UnlistenStmt *from)
2173 {
2174         UnlistenStmt *newnode = makeNode(UnlistenStmt);
2175
2176         if (from->relname)
2177                 newnode->relname = pstrdup(from->relname);
2178
2179         return newnode;
2180 }
2181
2182 static TransactionStmt *
2183 _copyTransactionStmt(TransactionStmt *from)
2184 {
2185         TransactionStmt *newnode = makeNode(TransactionStmt);
2186
2187         newnode->command = from->command;
2188
2189         return newnode;
2190 }
2191
2192 static ViewStmt *
2193 _copyViewStmt(ViewStmt *from)
2194 {
2195         ViewStmt   *newnode = makeNode(ViewStmt);
2196
2197         if (from->viewname)
2198                 newnode->viewname = pstrdup(from->viewname);
2199         Node_Copy(from, newnode, aliases);
2200         Node_Copy(from, newnode, query);
2201
2202         return newnode;
2203 }
2204
2205 static LoadStmt *
2206 _copyLoadStmt(LoadStmt *from)
2207 {
2208         LoadStmt   *newnode = makeNode(LoadStmt);
2209
2210         if (from->filename)
2211                 newnode->filename = pstrdup(from->filename);
2212
2213         return newnode;
2214 }
2215
2216 static CreatedbStmt *
2217 _copyCreatedbStmt(CreatedbStmt *from)
2218 {
2219         CreatedbStmt *newnode = makeNode(CreatedbStmt);
2220
2221         if (from->dbname)
2222                 newnode->dbname = pstrdup(from->dbname);
2223         if (from->dbpath)
2224                 newnode->dbpath = pstrdup(from->dbpath);
2225         if (from->dbtemplate)
2226                 newnode->dbtemplate = pstrdup(from->dbtemplate);
2227         newnode->encoding = from->encoding;
2228
2229         return newnode;
2230 }
2231
2232 static DropdbStmt *
2233 _copyDropdbStmt(DropdbStmt *from)
2234 {
2235         DropdbStmt *newnode = makeNode(DropdbStmt);
2236
2237         if (from->dbname)
2238                 newnode->dbname = pstrdup(from->dbname);
2239
2240         return newnode;
2241 }
2242
2243 static VacuumStmt *
2244 _copyVacuumStmt(VacuumStmt *from)
2245 {
2246         VacuumStmt *newnode = makeNode(VacuumStmt);
2247
2248         newnode->vacuum = from->vacuum;
2249         newnode->full = from->full;
2250         newnode->analyze = from->analyze;
2251         newnode->verbose = from->verbose;
2252         if (from->vacrel)
2253                 newnode->vacrel = pstrdup(from->vacrel);
2254         Node_Copy(from, newnode, va_cols);
2255
2256         return newnode;
2257 }
2258
2259 static ExplainStmt *
2260 _copyExplainStmt(ExplainStmt *from)
2261 {
2262         ExplainStmt *newnode = makeNode(ExplainStmt);
2263
2264         Node_Copy(from, newnode, query);
2265         newnode->verbose = from->verbose;
2266
2267         return newnode;
2268 }
2269
2270 static CreateSeqStmt *
2271 _copyCreateSeqStmt(CreateSeqStmt *from)
2272 {
2273         CreateSeqStmt *newnode = makeNode(CreateSeqStmt);
2274
2275         if (from->seqname)
2276                 newnode->seqname = pstrdup(from->seqname);
2277         Node_Copy(from, newnode, options);
2278
2279         return newnode;
2280 }
2281
2282 static VariableSetStmt *
2283 _copyVariableSetStmt(VariableSetStmt *from)
2284 {
2285         VariableSetStmt *newnode = makeNode(VariableSetStmt);
2286
2287         if (from->name)
2288                 newnode->name = pstrdup(from->name);
2289         if (from->value)
2290                 newnode->value = pstrdup(from->value);
2291
2292         return newnode;
2293 }
2294
2295 static VariableShowStmt *
2296 _copyVariableShowStmt(VariableShowStmt *from)
2297 {
2298         VariableShowStmt *newnode = makeNode(VariableShowStmt);
2299
2300         if (from->name)
2301                 newnode->name = pstrdup(from->name);
2302
2303         return newnode;
2304 }
2305
2306 static VariableResetStmt *
2307 _copyVariableResetStmt(VariableResetStmt *from)
2308 {
2309         VariableResetStmt *newnode = makeNode(VariableResetStmt);
2310
2311         if (from->name)
2312                 newnode->name = pstrdup(from->name);
2313
2314         return newnode;
2315 }
2316
2317 static CreateTrigStmt *
2318 _copyCreateTrigStmt(CreateTrigStmt *from)
2319 {
2320         CreateTrigStmt *newnode = makeNode(CreateTrigStmt);
2321
2322         if (from->trigname)
2323                 newnode->trigname = pstrdup(from->trigname);
2324         if (from->relname)
2325                 newnode->relname = pstrdup(from->relname);
2326         if (from->funcname)
2327                 newnode->funcname = pstrdup(from->funcname);
2328         Node_Copy(from, newnode, args);
2329         newnode->before = from->before;
2330         newnode->row = from->row;
2331         memcpy(newnode->actions, from->actions, sizeof(from->actions));
2332         if (from->lang)
2333                 newnode->lang = pstrdup(from->lang);
2334         if (from->text)
2335                 newnode->text = pstrdup(from->text);
2336
2337         Node_Copy(from, newnode, attr);
2338         if (from->when)
2339                 newnode->when = pstrdup(from->when);
2340         newnode->isconstraint = from->isconstraint;
2341         newnode->deferrable = from->deferrable;
2342         newnode->initdeferred = from->initdeferred;
2343         if (from->constrrelname)
2344                 newnode->constrrelname = pstrdup(from->constrrelname);
2345
2346         return newnode;
2347 }
2348
2349 static DropTrigStmt *
2350 _copyDropTrigStmt(DropTrigStmt *from)
2351 {
2352         DropTrigStmt *newnode = makeNode(DropTrigStmt);
2353
2354         if (from->trigname)
2355                 newnode->trigname = pstrdup(from->trigname);
2356         if (from->relname)
2357                 newnode->relname = pstrdup(from->relname);
2358
2359         return newnode;
2360 }
2361
2362 static CreatePLangStmt *
2363 _copyCreatePLangStmt(CreatePLangStmt *from)
2364 {
2365         CreatePLangStmt *newnode = makeNode(CreatePLangStmt);
2366
2367         if (from->plname)
2368                 newnode->plname = pstrdup(from->plname);
2369         if (from->plhandler)
2370                 newnode->plhandler = pstrdup(from->plhandler);
2371         if (from->plcompiler)
2372                 newnode->plcompiler = pstrdup(from->plcompiler);
2373         newnode->pltrusted = from->pltrusted;
2374
2375         return newnode;
2376 }
2377
2378 static DropPLangStmt *
2379 _copyDropPLangStmt(DropPLangStmt *from)
2380 {
2381         DropPLangStmt *newnode = makeNode(DropPLangStmt);
2382
2383         if (from->plname)
2384                 newnode->plname = pstrdup(from->plname);
2385
2386         return newnode;
2387 }
2388
2389 static CreateUserStmt *
2390 _copyCreateUserStmt(CreateUserStmt *from)
2391 {
2392         CreateUserStmt *newnode = makeNode(CreateUserStmt);
2393
2394         if (from->user)
2395                 newnode->user = pstrdup(from->user);
2396         Node_Copy(from, newnode, options);
2397
2398         return newnode;
2399 }
2400
2401 static AlterUserStmt *
2402 _copyAlterUserStmt(AlterUserStmt *from)
2403 {
2404         AlterUserStmt *newnode = makeNode(AlterUserStmt);
2405
2406         if (from->user)
2407                 newnode->user = pstrdup(from->user);
2408         Node_Copy(from, newnode, options);
2409
2410         return newnode;
2411 }
2412
2413 static DropUserStmt *
2414 _copyDropUserStmt(DropUserStmt *from)
2415 {
2416         DropUserStmt *newnode = makeNode(DropUserStmt);
2417
2418         Node_Copy(from, newnode, users);
2419
2420         return newnode;
2421 }
2422
2423 static LockStmt *
2424 _copyLockStmt(LockStmt *from)
2425 {
2426         LockStmt   *newnode = makeNode(LockStmt);
2427
2428         Node_Copy(from, newnode, rellist);
2429
2430         newnode->mode = from->mode;
2431
2432         return newnode;
2433 }
2434
2435 static ConstraintsSetStmt *
2436 _copyConstraintsSetStmt(ConstraintsSetStmt *from)
2437 {
2438         ConstraintsSetStmt *newnode = makeNode(ConstraintsSetStmt);
2439
2440         Node_Copy(from, newnode, constraints);
2441         newnode->deferred = from->deferred;
2442
2443         return newnode;
2444 }
2445
2446 static CreateGroupStmt *
2447 _copyCreateGroupStmt(CreateGroupStmt *from)
2448 {
2449         CreateGroupStmt *newnode = makeNode(CreateGroupStmt);
2450
2451         if (from->name)
2452                 newnode->name = pstrdup(from->name);
2453         Node_Copy(from, newnode, options);
2454
2455         return newnode;
2456 }
2457
2458 static AlterGroupStmt *
2459 _copyAlterGroupStmt(AlterGroupStmt *from)
2460 {
2461         AlterGroupStmt *newnode = makeNode(AlterGroupStmt);
2462
2463         if (from->name)
2464                 newnode->name = pstrdup(from->name);
2465         newnode->action = from->action;
2466         Node_Copy(from, newnode, listUsers);
2467
2468         return newnode;
2469 }
2470
2471 static DropGroupStmt *
2472 _copyDropGroupStmt(DropGroupStmt *from)
2473 {
2474         DropGroupStmt *newnode = makeNode(DropGroupStmt);
2475
2476         if (from->name)
2477                 newnode->name = pstrdup(from->name);
2478
2479         return newnode;
2480 }
2481
2482 static ReindexStmt *
2483 _copyReindexStmt(ReindexStmt *from)
2484 {
2485         ReindexStmt *newnode = makeNode(ReindexStmt);
2486
2487         newnode->reindexType = from->reindexType;
2488         if (from->name)
2489                 newnode->name = pstrdup(from->name);
2490         newnode->force = from->force;
2491         newnode->all = from->all;
2492
2493         return newnode;
2494 }
2495
2496
2497 /* ****************************************************************
2498  *                                      pg_list.h copy functions
2499  * ****************************************************************
2500  */
2501
2502 static Value *
2503 _copyValue(Value *from)
2504 {
2505         Value      *newnode = makeNode(Value);
2506
2507         newnode->type = from->type;
2508         switch (from->type)
2509         {
2510                 case T_Integer:
2511                         newnode->val.ival = from->val.ival;
2512                         break;
2513                 case T_Float:
2514                 case T_String:
2515                 case T_BitString:
2516                         newnode->val.str = pstrdup(from->val.str);
2517                         break;
2518                 default:
2519                         break;
2520         }
2521         return newnode;
2522 }
2523
2524 /* ----------------
2525  *              copyObject returns a copy of the node or list. If it is a list, it
2526  *              recursively copies its items.
2527  * ----------------
2528  */
2529 void *
2530 copyObject(void *from)
2531 {
2532         void       *retval;
2533
2534         if (from == NULL)
2535                 return NULL;
2536
2537         switch (nodeTag(from))
2538         {
2539
2540                         /*
2541                          * PLAN NODES
2542                          */
2543                 case T_Plan:
2544                         retval = _copyPlan(from);
2545                         break;
2546                 case T_Result:
2547                         retval = _copyResult(from);
2548                         break;
2549                 case T_Append:
2550                         retval = _copyAppend(from);
2551                         break;
2552                 case T_Scan:
2553                         retval = _copyScan(from);
2554                         break;
2555                 case T_SeqScan:
2556                         retval = _copySeqScan(from);
2557                         break;
2558                 case T_IndexScan:
2559                         retval = _copyIndexScan(from);
2560                         break;
2561                 case T_TidScan:
2562                         retval = _copyTidScan(from);
2563                         break;
2564                 case T_SubqueryScan:
2565                         retval = _copySubqueryScan(from);
2566                         break;
2567                 case T_Join:
2568                         retval = _copyJoin(from);
2569                         break;
2570                 case T_NestLoop:
2571                         retval = _copyNestLoop(from);
2572                         break;
2573                 case T_MergeJoin:
2574                         retval = _copyMergeJoin(from);
2575                         break;
2576                 case T_HashJoin:
2577                         retval = _copyHashJoin(from);
2578                         break;
2579                 case T_Material:
2580                         retval = _copyMaterial(from);
2581                         break;
2582                 case T_Sort:
2583                         retval = _copySort(from);
2584                         break;
2585                 case T_Group:
2586                         retval = _copyGroup(from);
2587                         break;
2588                 case T_Agg:
2589                         retval = _copyAgg(from);
2590                         break;
2591                 case T_Unique:
2592                         retval = _copyUnique(from);
2593                         break;
2594                 case T_SetOp:
2595                         retval = _copySetOp(from);
2596                         break;
2597                 case T_Limit:
2598                         retval = _copyLimit(from);
2599                         break;
2600                 case T_Hash:
2601                         retval = _copyHash(from);
2602                         break;
2603                 case T_SubPlan:
2604                         retval = _copySubPlan(from);
2605                         break;
2606
2607                         /*
2608                          * PRIMITIVE NODES
2609                          */
2610                 case T_Resdom:
2611                         retval = _copyResdom(from);
2612                         break;
2613                 case T_Fjoin:
2614                         retval = _copyFjoin(from);
2615                         break;
2616                 case T_Expr:
2617                         retval = _copyExpr(from);
2618                         break;
2619                 case T_Var:
2620                         retval = _copyVar(from);
2621                         break;
2622                 case T_Oper:
2623                         retval = _copyOper(from);
2624                         break;
2625                 case T_Const:
2626                         retval = _copyConst(from);
2627                         break;
2628                 case T_Param:
2629                         retval = _copyParam(from);
2630                         break;
2631                 case T_Aggref:
2632                         retval = _copyAggref(from);
2633                         break;
2634                 case T_SubLink:
2635                         retval = _copySubLink(from);
2636                         break;
2637                 case T_Func:
2638                         retval = _copyFunc(from);
2639                         break;
2640                 case T_ArrayRef:
2641                         retval = _copyArrayRef(from);
2642                         break;
2643                 case T_Iter:
2644                         retval = _copyIter(from);
2645                         break;
2646                 case T_FieldSelect:
2647                         retval = _copyFieldSelect(from);
2648                         break;
2649                 case T_RelabelType:
2650                         retval = _copyRelabelType(from);
2651                         break;
2652                 case T_RangeTblRef:
2653                         retval = _copyRangeTblRef(from);
2654                         break;
2655                 case T_FromExpr:
2656                         retval = _copyFromExpr(from);
2657                         break;
2658                 case T_JoinExpr:
2659                         retval = _copyJoinExpr(from);
2660                         break;
2661
2662                         /*
2663                          * RELATION NODES
2664                          */
2665                 case T_RelOptInfo:
2666                         retval = _copyRelOptInfo(from);
2667                         break;
2668                 case T_Path:
2669                         retval = _copyPath(from);
2670                         break;
2671                 case T_IndexPath:
2672                         retval = _copyIndexPath(from);
2673                         break;
2674                 case T_TidPath:
2675                         retval = _copyTidPath(from);
2676                         break;
2677                 case T_AppendPath:
2678                         retval = _copyAppendPath(from);
2679                         break;
2680                 case T_NestPath:
2681                         retval = _copyNestPath(from);
2682                         break;
2683                 case T_MergePath:
2684                         retval = _copyMergePath(from);
2685                         break;
2686                 case T_HashPath:
2687                         retval = _copyHashPath(from);
2688                         break;
2689                 case T_PathKeyItem:
2690                         retval = _copyPathKeyItem(from);
2691                         break;
2692                 case T_RestrictInfo:
2693                         retval = _copyRestrictInfo(from);
2694                         break;
2695                 case T_JoinInfo:
2696                         retval = _copyJoinInfo(from);
2697                         break;
2698                 case T_Stream:
2699                         retval = _copyStream(from);
2700                         break;
2701                 case T_IndexOptInfo:
2702                         retval = _copyIndexOptInfo(from);
2703                         break;
2704
2705                         /*
2706                          * VALUE NODES
2707                          */
2708                 case T_Integer:
2709                 case T_Float:
2710                 case T_String:
2711                 case T_BitString:
2712                         retval = _copyValue(from);
2713                         break;
2714                 case T_List:
2715                         {
2716                                 List       *list = from,
2717                                                    *l,
2718                                                    *nl;
2719
2720                                 /* rather ugly coding for speed... */
2721                                 /* Note the input list cannot be NIL if we got here. */
2722                                 nl = makeList1(copyObject(lfirst(list)));
2723                                 retval = nl;
2724
2725                                 foreach(l, lnext(list))
2726                                 {
2727                                         lnext(nl) = makeList1(copyObject(lfirst(l)));
2728                                         nl = lnext(nl);
2729                                 }
2730                         }
2731                         break;
2732
2733                         /*
2734                          * PARSE NODES
2735                          */
2736                 case T_Query:
2737                         retval = _copyQuery(from);
2738                         break;
2739                 case T_InsertStmt:
2740                         retval = _copyInsertStmt(from);
2741                         break;
2742                 case T_DeleteStmt:
2743                         retval = _copyDeleteStmt(from);
2744                         break;
2745                 case T_UpdateStmt:
2746                         retval = _copyUpdateStmt(from);
2747                         break;
2748                 case T_SelectStmt:
2749                         retval = _copySelectStmt(from);
2750                         break;
2751                 case T_SetOperationStmt:
2752                         retval = _copySetOperationStmt(from);
2753                         break;
2754                 case T_AlterTableStmt:
2755                         retval = _copyAlterTableStmt(from);
2756                         break;
2757                 case T_GrantStmt:
2758                         retval = _copyGrantStmt(from);
2759                         break;
2760                 case T_ClosePortalStmt:
2761                         retval = _copyClosePortalStmt(from);
2762                         break;
2763                 case T_ClusterStmt:
2764                         retval = _copyClusterStmt(from);
2765                         break;
2766                 case T_CopyStmt:
2767                         retval = _copyCopyStmt(from);
2768                         break;
2769                 case T_CreateStmt:
2770                         retval = _copyCreateStmt(from);
2771                         break;
2772                 case T_VersionStmt:
2773                         retval = _copyVersionStmt(from);
2774                         break;
2775                 case T_DefineStmt:
2776                         retval = _copyDefineStmt(from);
2777                         break;
2778                 case T_DropStmt:
2779                         retval = _copyDropStmt(from);
2780                         break;
2781                 case T_TruncateStmt:
2782                         retval = _copyTruncateStmt(from);
2783                         break;
2784                 case T_CommentStmt:
2785                         retval = _copyCommentStmt(from);
2786                         break;
2787                 case T_FetchStmt:
2788                         retval = _copyFetchStmt(from);
2789                         break;
2790                 case T_IndexStmt:
2791                         retval = _copyIndexStmt(from);
2792                         break;
2793                 case T_ProcedureStmt:
2794                         retval = _copyProcedureStmt(from);
2795                         break;
2796                 case T_RemoveAggrStmt:
2797                         retval = _copyRemoveAggrStmt(from);
2798                         break;
2799                 case T_RemoveFuncStmt:
2800                         retval = _copyRemoveFuncStmt(from);
2801                         break;
2802                 case T_RemoveOperStmt:
2803                         retval = _copyRemoveOperStmt(from);
2804                         break;
2805                 case T_RenameStmt:
2806                         retval = _copyRenameStmt(from);
2807                         break;
2808                 case T_RuleStmt:
2809                         retval = _copyRuleStmt(from);
2810                         break;
2811                 case T_NotifyStmt:
2812                         retval = _copyNotifyStmt(from);
2813                         break;
2814                 case T_ListenStmt:
2815                         retval = _copyListenStmt(from);
2816                         break;
2817                 case T_UnlistenStmt:
2818                         retval = _copyUnlistenStmt(from);
2819                         break;
2820                 case T_TransactionStmt:
2821                         retval = _copyTransactionStmt(from);
2822                         break;
2823                 case T_ViewStmt:
2824                         retval = _copyViewStmt(from);
2825                         break;
2826                 case T_LoadStmt:
2827                         retval = _copyLoadStmt(from);
2828                         break;
2829                 case T_CreatedbStmt:
2830                         retval = _copyCreatedbStmt(from);
2831                         break;
2832                 case T_DropdbStmt:
2833                         retval = _copyDropdbStmt(from);
2834                         break;
2835                 case T_VacuumStmt:
2836                         retval = _copyVacuumStmt(from);
2837                         break;
2838                 case T_ExplainStmt:
2839                         retval = _copyExplainStmt(from);
2840                         break;
2841                 case T_CreateSeqStmt:
2842                         retval = _copyCreateSeqStmt(from);
2843                         break;
2844                 case T_VariableSetStmt:
2845                         retval = _copyVariableSetStmt(from);
2846                         break;
2847                 case T_VariableShowStmt:
2848                         retval = _copyVariableShowStmt(from);
2849                         break;
2850                 case T_VariableResetStmt:
2851                         retval = _copyVariableResetStmt(from);
2852                         break;
2853                 case T_CreateTrigStmt:
2854                         retval = _copyCreateTrigStmt(from);
2855                         break;
2856                 case T_DropTrigStmt:
2857                         retval = _copyDropTrigStmt(from);
2858                         break;
2859                 case T_CreatePLangStmt:
2860                         retval = _copyCreatePLangStmt(from);
2861                         break;
2862                 case T_DropPLangStmt:
2863                         retval = _copyDropPLangStmt(from);
2864                         break;
2865                 case T_CreateUserStmt:
2866                         retval = _copyCreateUserStmt(from);
2867                         break;
2868                 case T_AlterUserStmt:
2869                         retval = _copyAlterUserStmt(from);
2870                         break;
2871                 case T_DropUserStmt:
2872                         retval = _copyDropUserStmt(from);
2873                         break;
2874                 case T_LockStmt:
2875                         retval = _copyLockStmt(from);
2876                         break;
2877                 case T_ConstraintsSetStmt:
2878                         retval = _copyConstraintsSetStmt(from);
2879                         break;
2880                 case T_CreateGroupStmt:
2881                         retval = _copyCreateGroupStmt(from);
2882                         break;
2883                 case T_AlterGroupStmt:
2884                         retval = _copyAlterGroupStmt(from);
2885                         break;
2886                 case T_DropGroupStmt:
2887                         retval = _copyDropGroupStmt(from);
2888                         break;
2889                 case T_ReindexStmt:
2890                         retval = _copyReindexStmt(from);
2891                         break;
2892                 case T_CheckPointStmt:
2893                         retval = (void *) makeNode(CheckPointStmt);
2894                         break;
2895
2896                 case T_A_Expr:
2897                         retval = _copyAExpr(from);
2898                         break;
2899                 case T_Attr:
2900                         retval = _copyAttr(from);
2901                         break;
2902                 case T_A_Const:
2903                         retval = _copyAConst(from);
2904                         break;
2905                 case T_ParamNo:
2906                         retval = _copyParamNo(from);
2907                         break;
2908                 case T_Ident:
2909                         retval = _copyIdent(from);
2910                         break;
2911                 case T_FuncCall:
2912                         retval = _copyFuncCall(from);
2913                         break;
2914                 case T_A_Indices:
2915                         retval = _copyAIndices(from);
2916                         break;
2917                 case T_ResTarget:
2918                         retval = _copyResTarget(from);
2919                         break;
2920                 case T_TypeCast:
2921                         retval = _copyTypeCast(from);
2922                         break;
2923                 case T_SortGroupBy:
2924                         retval = _copySortGroupBy(from);
2925                         break;
2926                 case T_RangeVar:
2927                         retval = _copyRangeVar(from);
2928                         break;
2929                 case T_RangeSubselect:
2930                         retval = _copyRangeSubselect(from);
2931                         break;
2932                 case T_TypeName:
2933                         retval = _copyTypeName(from);
2934                         break;
2935                 case T_IndexElem:
2936                         retval = _copyIndexElem(from);
2937                         break;
2938                 case T_ColumnDef:
2939                         retval = _copyColumnDef(from);
2940                         break;
2941                 case T_Constraint:
2942                         retval = _copyConstraint(from);
2943                         break;
2944                 case T_DefElem:
2945                         retval = _copyDefElem(from);
2946                         break;
2947                 case T_TargetEntry:
2948                         retval = _copyTargetEntry(from);
2949                         break;
2950                 case T_RangeTblEntry:
2951                         retval = _copyRangeTblEntry(from);
2952                         break;
2953                 case T_SortClause:
2954                         retval = _copySortClause(from);
2955                         break;
2956                 case T_GroupClause:
2957                         retval = _copyGroupClause(from);
2958                         break;
2959                 case T_CaseExpr:
2960                         retval = _copyCaseExpr(from);
2961                         break;
2962                 case T_CaseWhen:
2963                         retval = _copyCaseWhen(from);
2964                         break;
2965                 case T_NullTest:
2966                         retval = _copyNullTest(from);
2967                         break;
2968                 case T_BooleanTest:
2969                         retval = _copyBooleanTest(from);
2970                         break;
2971                 case T_FkConstraint:
2972                         retval = _copyFkConstraint(from);
2973                         break;
2974                 case T_PrivGrantee:
2975                         retval = _copyPrivGrantee(from);
2976                         break;
2977
2978                 default:
2979                         elog(ERROR, "copyObject: don't know how to copy node type %d",
2980                                  nodeTag(from));
2981                         retval = from;          /* keep compiler quiet */
2982                         break;
2983         }
2984         return retval;
2985 }