]> granicus.if.org Git - postgresql/blob - src/backend/nodes/copyfuncs.c
9838d98553176d1e6972603b5009c1d74b6b8d47
[postgresql] / 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.163 2002/02/26 22:47:05 tgl 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                  * passed by value so just copy the datum. Also, don't try to copy
787                  * struct when value is null!
788                  *
789                  */
790                 newnode->constvalue = from->constvalue;
791         }
792         else
793         {
794                 /*
795                  * not passed by value. datum contains a pointer.
796                  */
797                 int                     length = from->constlen;
798
799                 if (length == -1)               /* variable-length type? */
800                         length = VARSIZE(from->constvalue);
801                 newnode->constvalue = PointerGetDatum(palloc(length));
802                 memcpy(DatumGetPointer(newnode->constvalue),
803                            DatumGetPointer(from->constvalue),
804                            length);
805         }
806
807         newnode->constisnull = from->constisnull;
808         newnode->constbyval = from->constbyval;
809         newnode->constisset = from->constisset;
810         newnode->constiscast = from->constiscast;
811
812         return newnode;
813 }
814
815 /* ----------------
816  *              _copyParam
817  * ----------------
818  */
819 static Param *
820 _copyParam(Param *from)
821 {
822         Param      *newnode = makeNode(Param);
823
824         /*
825          * copy remainder of node
826          */
827         newnode->paramkind = from->paramkind;
828         newnode->paramid = from->paramid;
829
830         if (from->paramname != NULL)
831                 newnode->paramname = pstrdup(from->paramname);
832         newnode->paramtype = from->paramtype;
833
834         return newnode;
835 }
836
837 /* ----------------
838  *              _copyFunc
839  * ----------------
840  */
841 static Func *
842 _copyFunc(Func *from)
843 {
844         Func       *newnode = makeNode(Func);
845
846         /*
847          * copy remainder of node
848          */
849         newnode->funcid = from->funcid;
850         newnode->functype = from->functype;
851         /* Do not copy the run-time state, if any */
852         newnode->func_fcache = NULL;
853
854         return newnode;
855 }
856
857 /* ----------------
858  *              _copyAggref
859  * ----------------
860  */
861 static Aggref *
862 _copyAggref(Aggref *from)
863 {
864         Aggref     *newnode = makeNode(Aggref);
865
866         /*
867          * copy remainder of node
868          */
869         newnode->aggname = pstrdup(from->aggname);
870         newnode->basetype = from->basetype;
871         newnode->aggtype = from->aggtype;
872         Node_Copy(from, newnode, target);
873         newnode->aggstar = from->aggstar;
874         newnode->aggdistinct = from->aggdistinct;
875         newnode->aggno = from->aggno;           /* probably not needed */
876
877         return newnode;
878 }
879
880 /* ----------------
881  *              _copySubLink
882  * ----------------
883  */
884 static SubLink *
885 _copySubLink(SubLink *from)
886 {
887         SubLink    *newnode = makeNode(SubLink);
888
889         /*
890          * copy remainder of node
891          */
892         newnode->subLinkType = from->subLinkType;
893         newnode->useor = from->useor;
894         Node_Copy(from, newnode, lefthand);
895         Node_Copy(from, newnode, oper);
896         Node_Copy(from, newnode, subselect);
897
898         return newnode;
899 }
900
901 /* ----------------
902  *              _copyFieldSelect
903  * ----------------
904  */
905 static FieldSelect *
906 _copyFieldSelect(FieldSelect *from)
907 {
908         FieldSelect *newnode = makeNode(FieldSelect);
909
910         /*
911          * copy remainder of node
912          */
913         Node_Copy(from, newnode, arg);
914         newnode->fieldnum = from->fieldnum;
915         newnode->resulttype = from->resulttype;
916         newnode->resulttypmod = from->resulttypmod;
917
918         return newnode;
919 }
920
921 /* ----------------
922  *              _copyRelabelType
923  * ----------------
924  */
925 static RelabelType *
926 _copyRelabelType(RelabelType *from)
927 {
928         RelabelType *newnode = makeNode(RelabelType);
929
930         /*
931          * copy remainder of node
932          */
933         Node_Copy(from, newnode, arg);
934         newnode->resulttype = from->resulttype;
935         newnode->resulttypmod = from->resulttypmod;
936
937         return newnode;
938 }
939
940 static RangeTblRef *
941 _copyRangeTblRef(RangeTblRef *from)
942 {
943         RangeTblRef *newnode = makeNode(RangeTblRef);
944
945         newnode->rtindex = from->rtindex;
946
947         return newnode;
948 }
949
950 static FromExpr *
951 _copyFromExpr(FromExpr *from)
952 {
953         FromExpr   *newnode = makeNode(FromExpr);
954
955         Node_Copy(from, newnode, fromlist);
956         Node_Copy(from, newnode, quals);
957
958         return newnode;
959 }
960
961 static JoinExpr *
962 _copyJoinExpr(JoinExpr *from)
963 {
964         JoinExpr   *newnode = makeNode(JoinExpr);
965
966         newnode->jointype = from->jointype;
967         newnode->isNatural = from->isNatural;
968         Node_Copy(from, newnode, larg);
969         Node_Copy(from, newnode, rarg);
970         Node_Copy(from, newnode, using);
971         Node_Copy(from, newnode, quals);
972         Node_Copy(from, newnode, alias);
973         Node_Copy(from, newnode, colnames);
974         Node_Copy(from, newnode, colvars);
975
976         return newnode;
977 }
978
979 /* ----------------
980  *              _copyCaseExpr
981  * ----------------
982  */
983 static CaseExpr *
984 _copyCaseExpr(CaseExpr *from)
985 {
986         CaseExpr   *newnode = makeNode(CaseExpr);
987
988         /*
989          * copy remainder of node
990          */
991         newnode->casetype = from->casetype;
992
993         Node_Copy(from, newnode, arg);
994         Node_Copy(from, newnode, args);
995         Node_Copy(from, newnode, defresult);
996
997         return newnode;
998 }
999
1000 /* ----------------
1001  *              _copyCaseWhen
1002  * ----------------
1003  */
1004 static CaseWhen *
1005 _copyCaseWhen(CaseWhen *from)
1006 {
1007         CaseWhen   *newnode = makeNode(CaseWhen);
1008
1009         /*
1010          * copy remainder of node
1011          */
1012         Node_Copy(from, newnode, expr);
1013         Node_Copy(from, newnode, result);
1014
1015         return newnode;
1016 }
1017
1018 /* ----------------
1019  *              _copyNullTest
1020  * ----------------
1021  */
1022 static NullTest *
1023 _copyNullTest(NullTest *from)
1024 {
1025         NullTest   *newnode = makeNode(NullTest);
1026
1027         /*
1028          * copy remainder of node
1029          */
1030         Node_Copy(from, newnode, arg);
1031         newnode->nulltesttype = from->nulltesttype;
1032
1033         return newnode;
1034 }
1035
1036 /* ----------------
1037  *              _copyBooleanTest
1038  * ----------------
1039  */
1040 static BooleanTest *
1041 _copyBooleanTest(BooleanTest *from)
1042 {
1043         BooleanTest *newnode = makeNode(BooleanTest);
1044
1045         /*
1046          * copy remainder of node
1047          */
1048         Node_Copy(from, newnode, arg);
1049         newnode->booltesttype = from->booltesttype;
1050
1051         return newnode;
1052 }
1053
1054 static ArrayRef *
1055 _copyArrayRef(ArrayRef *from)
1056 {
1057         ArrayRef   *newnode = makeNode(ArrayRef);
1058
1059         /*
1060          * copy remainder of node
1061          */
1062         newnode->refattrlength = from->refattrlength;
1063         newnode->refelemlength = from->refelemlength;
1064         newnode->refelemtype = from->refelemtype;
1065         newnode->refelembyval = from->refelembyval;
1066
1067         Node_Copy(from, newnode, refupperindexpr);
1068         Node_Copy(from, newnode, reflowerindexpr);
1069         Node_Copy(from, newnode, refexpr);
1070         Node_Copy(from, newnode, refassgnexpr);
1071
1072         return newnode;
1073 }
1074
1075 /* ****************************************************************
1076  *                                              relation.h copy functions
1077  * ****************************************************************
1078  */
1079
1080 /* ----------------
1081  *              _copyRelOptInfo
1082  * ----------------
1083  */
1084 /*
1085  *      when you change this, also make sure to fix up xfunc_copyRelOptInfo in
1086  *      planner/path/xfunc.c accordingly!!!
1087  *              -- JMH, 8/2/93
1088  */
1089 static RelOptInfo *
1090 _copyRelOptInfo(RelOptInfo *from)
1091 {
1092         RelOptInfo *newnode = makeNode(RelOptInfo);
1093
1094         newnode->relids = listCopy(from->relids);
1095
1096         newnode->rows = from->rows;
1097         newnode->width = from->width;
1098
1099         Node_Copy(from, newnode, targetlist);
1100         Node_Copy(from, newnode, pathlist);
1101         /* XXX cheapest-path fields should point to members of pathlist? */
1102         Node_Copy(from, newnode, cheapest_startup_path);
1103         Node_Copy(from, newnode, cheapest_total_path);
1104         newnode->pruneable = from->pruneable;
1105
1106         newnode->issubquery = from->issubquery;
1107         Node_Copy(from, newnode, indexlist);
1108         newnode->pages = from->pages;
1109         newnode->tuples = from->tuples;
1110         Node_Copy(from, newnode, subplan);
1111
1112         Node_Copy(from, newnode, baserestrictinfo);
1113         newnode->baserestrictcost = from->baserestrictcost;
1114         newnode->outerjoinset = listCopy(from->outerjoinset);
1115         Node_Copy(from, newnode, joininfo);
1116         Node_Copy(from, newnode, innerjoin);
1117
1118         return newnode;
1119 }
1120
1121 /* ----------------
1122  *              _copyIndexOptInfo
1123  * ----------------
1124  */
1125 static IndexOptInfo *
1126 _copyIndexOptInfo(IndexOptInfo *from)
1127 {
1128         IndexOptInfo *newnode = makeNode(IndexOptInfo);
1129         Size            len;
1130
1131         newnode->indexoid = from->indexoid;
1132         newnode->pages = from->pages;
1133         newnode->tuples = from->tuples;
1134
1135         newnode->ncolumns = from->ncolumns;
1136         newnode->nkeys = from->nkeys;
1137
1138         if (from->classlist)
1139         {
1140                 /* copy the trailing zero too */
1141                 len = (from->ncolumns + 1) * sizeof(Oid);
1142                 newnode->classlist = (Oid *) palloc(len);
1143                 memcpy(newnode->classlist, from->classlist, len);
1144         }
1145
1146         if (from->indexkeys)
1147         {
1148                 /* copy the trailing zero too */
1149                 len = (from->nkeys + 1) * sizeof(int);
1150                 newnode->indexkeys = (int *) palloc(len);
1151                 memcpy(newnode->indexkeys, from->indexkeys, len);
1152         }
1153
1154         if (from->ordering)
1155         {
1156                 /* copy the trailing zero too */
1157                 len = (from->ncolumns + 1) * sizeof(Oid);
1158                 newnode->ordering = (Oid *) palloc(len);
1159                 memcpy(newnode->ordering, from->ordering, len);
1160         }
1161
1162         newnode->relam = from->relam;
1163         newnode->amcostestimate = from->amcostestimate;
1164         newnode->indproc = from->indproc;
1165         Node_Copy(from, newnode, indpred);
1166         newnode->unique = from->unique;
1167
1168         return newnode;
1169 }
1170
1171 /* ----------------
1172  *              CopyPathFields
1173  *
1174  *              This function copies the fields of the Path node.  It is used by
1175  *              all the copy functions for classes which inherit from Path.
1176  * ----------------
1177  */
1178 static void
1179 CopyPathFields(Path *from, Path *newnode)
1180 {
1181         /*
1182          * Modify the next line, since it causes the copying to cycle (i.e.
1183          * the parent points right back here! -- JMH, 7/7/92. Old version:
1184          * Node_Copy(from, newnode, parent);
1185          */
1186         newnode->parent = from->parent;
1187
1188         newnode->startup_cost = from->startup_cost;
1189         newnode->total_cost = from->total_cost;
1190
1191         newnode->pathtype = from->pathtype;
1192
1193         Node_Copy(from, newnode, pathkeys);
1194 }
1195
1196 /* ----------------
1197  *              _copyPath
1198  * ----------------
1199  */
1200 static Path *
1201 _copyPath(Path *from)
1202 {
1203         Path       *newnode = makeNode(Path);
1204
1205         CopyPathFields(from, newnode);
1206
1207         return newnode;
1208 }
1209
1210 /* ----------------
1211  *              _copyIndexPath
1212  * ----------------
1213  */
1214 static IndexPath *
1215 _copyIndexPath(IndexPath *from)
1216 {
1217         IndexPath  *newnode = makeNode(IndexPath);
1218
1219         /*
1220          * copy the node superclass fields
1221          */
1222         CopyPathFields((Path *) from, (Path *) newnode);
1223
1224         /*
1225          * copy remainder of node
1226          */
1227         Node_Copy(from, newnode, indexinfo);
1228         Node_Copy(from, newnode, indexqual);
1229         newnode->indexscandir = from->indexscandir;
1230         newnode->joinrelids = listCopy(from->joinrelids);
1231         newnode->alljoinquals = from->alljoinquals;
1232         newnode->rows = from->rows;
1233
1234         return newnode;
1235 }
1236
1237 /* ----------------
1238  *                              _copyTidPath
1239  * ----------------
1240  */
1241 static TidPath *
1242 _copyTidPath(TidPath *from)
1243 {
1244         TidPath    *newnode = makeNode(TidPath);
1245
1246         /*
1247          * copy the node superclass fields
1248          */
1249         CopyPathFields((Path *) from, (Path *) newnode);
1250
1251         /*
1252          * copy remainder of node
1253          */
1254         Node_Copy(from, newnode, tideval);
1255         newnode->unjoined_relids = listCopy(from->unjoined_relids);
1256
1257         return newnode;
1258 }
1259
1260 /* ----------------
1261  *                              _copyAppendPath
1262  * ----------------
1263  */
1264 static AppendPath *
1265 _copyAppendPath(AppendPath *from)
1266 {
1267         AppendPath *newnode = makeNode(AppendPath);
1268
1269         /*
1270          * copy the node superclass fields
1271          */
1272         CopyPathFields((Path *) from, (Path *) newnode);
1273
1274         /*
1275          * copy remainder of node
1276          */
1277         Node_Copy(from, newnode, subpaths);
1278
1279         return newnode;
1280 }
1281
1282 /* ----------------
1283  *              CopyJoinPathFields
1284  *
1285  *              This function copies the fields of the JoinPath node.  It is used by
1286  *              all the copy functions for classes which inherit from JoinPath.
1287  * ----------------
1288  */
1289 static void
1290 CopyJoinPathFields(JoinPath *from, JoinPath *newnode)
1291 {
1292         newnode->jointype = from->jointype;
1293         Node_Copy(from, newnode, outerjoinpath);
1294         Node_Copy(from, newnode, innerjoinpath);
1295         Node_Copy(from, newnode, joinrestrictinfo);
1296 }
1297
1298 /* ----------------
1299  *              _copyNestPath
1300  * ----------------
1301  */
1302 static NestPath *
1303 _copyNestPath(NestPath *from)
1304 {
1305         NestPath   *newnode = makeNode(NestPath);
1306
1307         /*
1308          * copy the node superclass fields
1309          */
1310         CopyPathFields((Path *) from, (Path *) newnode);
1311         CopyJoinPathFields((JoinPath *) from, (JoinPath *) newnode);
1312
1313         return newnode;
1314 }
1315
1316 /* ----------------
1317  *              _copyMergePath
1318  * ----------------
1319  */
1320 static MergePath *
1321 _copyMergePath(MergePath *from)
1322 {
1323         MergePath  *newnode = makeNode(MergePath);
1324
1325         /*
1326          * copy the node superclass fields
1327          */
1328         CopyPathFields((Path *) from, (Path *) newnode);
1329         CopyJoinPathFields((JoinPath *) from, (JoinPath *) newnode);
1330
1331         /*
1332          * copy the remainder of the node
1333          */
1334         Node_Copy(from, newnode, path_mergeclauses);
1335         Node_Copy(from, newnode, outersortkeys);
1336         Node_Copy(from, newnode, innersortkeys);
1337
1338         return newnode;
1339 }
1340
1341 /* ----------------
1342  *              _copyHashPath
1343  * ----------------
1344  */
1345 static HashPath *
1346 _copyHashPath(HashPath *from)
1347 {
1348         HashPath   *newnode = makeNode(HashPath);
1349
1350         /*
1351          * copy the node superclass fields
1352          */
1353         CopyPathFields((Path *) from, (Path *) newnode);
1354         CopyJoinPathFields((JoinPath *) from, (JoinPath *) newnode);
1355
1356         /*
1357          * copy remainder of node
1358          */
1359         Node_Copy(from, newnode, path_hashclauses);
1360
1361         return newnode;
1362 }
1363
1364 /* ----------------
1365  *              _copyPathKeyItem
1366  * ----------------
1367  */
1368 static PathKeyItem *
1369 _copyPathKeyItem(PathKeyItem *from)
1370 {
1371         PathKeyItem *newnode = makeNode(PathKeyItem);
1372
1373         /*
1374          * copy remainder of node
1375          */
1376         Node_Copy(from, newnode, key);
1377         newnode->sortop = from->sortop;
1378
1379         return newnode;
1380 }
1381
1382 /* ----------------
1383  *              _copyRestrictInfo
1384  * ----------------
1385  */
1386 static RestrictInfo *
1387 _copyRestrictInfo(RestrictInfo *from)
1388 {
1389         RestrictInfo *newnode = makeNode(RestrictInfo);
1390
1391         /*
1392          * copy remainder of node
1393          */
1394         Node_Copy(from, newnode, clause);
1395         newnode->ispusheddown = from->ispusheddown;
1396         Node_Copy(from, newnode, subclauseindices);
1397         newnode->eval_cost = from->eval_cost;
1398         newnode->this_selec = from->this_selec;
1399         newnode->mergejoinoperator = from->mergejoinoperator;
1400         newnode->left_sortop = from->left_sortop;
1401         newnode->right_sortop = from->right_sortop;
1402
1403         /*
1404          * Do not copy pathkeys, since they'd not be canonical in a copied
1405          * query
1406          */
1407         newnode->left_pathkey = NIL;
1408         newnode->right_pathkey = NIL;
1409         newnode->hashjoinoperator = from->hashjoinoperator;
1410         newnode->left_bucketsize = from->left_bucketsize;
1411         newnode->right_bucketsize = from->right_bucketsize;
1412
1413         return newnode;
1414 }
1415
1416 /* ----------------
1417  *              _copyJoinInfo
1418  * ----------------
1419  */
1420 static JoinInfo *
1421 _copyJoinInfo(JoinInfo *from)
1422 {
1423         JoinInfo   *newnode = makeNode(JoinInfo);
1424
1425         /*
1426          * copy remainder of node
1427          */
1428         newnode->unjoined_relids = listCopy(from->unjoined_relids);
1429         Node_Copy(from, newnode, jinfo_restrictinfo);
1430
1431         return newnode;
1432 }
1433
1434 static Iter *
1435 _copyIter(Iter *from)
1436 {
1437         Iter       *newnode = makeNode(Iter);
1438
1439         Node_Copy(from, newnode, iterexpr);
1440         newnode->itertype = from->itertype;
1441
1442         return newnode;
1443 }
1444
1445 static Stream *
1446 _copyStream(Stream *from)
1447 {
1448         Stream     *newnode = makeNode(Stream);
1449
1450         newnode->pathptr = from->pathptr;
1451         newnode->cinfo = from->cinfo;
1452         newnode->clausetype = from->clausetype;
1453
1454         newnode->upstream = (StreamPtr) NULL;           /* only copy nodes
1455                                                                                                  * downwards! */
1456         Node_Copy(from, newnode, downstream);
1457         if (newnode->downstream)
1458                 ((Stream *) newnode->downstream)->upstream = (Stream *) newnode;
1459
1460         newnode->groupup = from->groupup;
1461         newnode->groupcost = from->groupcost;
1462         newnode->groupsel = from->groupsel;
1463
1464         return newnode;
1465 }
1466
1467 /* ****************************************************************
1468  *                                      parsenodes.h copy functions
1469  * ****************************************************************
1470  */
1471
1472 static TargetEntry *
1473 _copyTargetEntry(TargetEntry *from)
1474 {
1475         TargetEntry *newnode = makeNode(TargetEntry);
1476
1477         Node_Copy(from, newnode, resdom);
1478         Node_Copy(from, newnode, fjoin);
1479         Node_Copy(from, newnode, expr);
1480         return newnode;
1481 }
1482
1483 static RangeTblEntry *
1484 _copyRangeTblEntry(RangeTblEntry *from)
1485 {
1486         RangeTblEntry *newnode = makeNode(RangeTblEntry);
1487
1488         if (from->relname)
1489                 newnode->relname = pstrdup(from->relname);
1490         newnode->relid = from->relid;
1491         Node_Copy(from, newnode, subquery);
1492         Node_Copy(from, newnode, alias);
1493         Node_Copy(from, newnode, eref);
1494         newnode->inh = from->inh;
1495         newnode->inFromCl = from->inFromCl;
1496         newnode->checkForRead = from->checkForRead;
1497         newnode->checkForWrite = from->checkForWrite;
1498         newnode->checkAsUser = from->checkAsUser;
1499
1500         return newnode;
1501 }
1502
1503 static FkConstraint *
1504 _copyFkConstraint(FkConstraint *from)
1505 {
1506         FkConstraint *newnode = makeNode(FkConstraint);
1507
1508         if (from->constr_name)
1509                 newnode->constr_name = pstrdup(from->constr_name);
1510         if (from->pktable_name)
1511                 newnode->pktable_name = pstrdup(from->pktable_name);
1512         Node_Copy(from, newnode, fk_attrs);
1513         Node_Copy(from, newnode, pk_attrs);
1514         if (from->match_type)
1515                 newnode->match_type = pstrdup(from->match_type);
1516         newnode->actions = from->actions;
1517         newnode->deferrable = from->deferrable;
1518         newnode->initdeferred = from->initdeferred;
1519
1520         return newnode;
1521 }
1522
1523 static SortClause *
1524 _copySortClause(SortClause *from)
1525 {
1526         SortClause *newnode = makeNode(SortClause);
1527
1528         newnode->tleSortGroupRef = from->tleSortGroupRef;
1529         newnode->sortop = from->sortop;
1530
1531         return newnode;
1532 }
1533
1534 static A_Expr *
1535 _copyAExpr(A_Expr *from)
1536 {
1537         A_Expr     *newnode = makeNode(A_Expr);
1538
1539         newnode->oper = from->oper;
1540         if (from->opname)
1541                 newnode->opname = pstrdup(from->opname);
1542         Node_Copy(from, newnode, lexpr);
1543         Node_Copy(from, newnode, rexpr);
1544
1545         return newnode;
1546 }
1547
1548 static A_Const *
1549 _copyAConst(A_Const *from)
1550 {
1551         A_Const    *newnode = makeNode(A_Const);
1552
1553         newnode->val = *((Value *) (copyObject(&(from->val))));
1554         Node_Copy(from, newnode, typename);
1555
1556         return newnode;
1557 }
1558
1559 static ParamNo *
1560 _copyParamNo(ParamNo *from)
1561 {
1562         ParamNo    *newnode = makeNode(ParamNo);
1563
1564         newnode->number = from->number;
1565         Node_Copy(from, newnode, typename);
1566         Node_Copy(from, newnode, indirection);
1567
1568         return newnode;
1569 }
1570
1571 static Ident *
1572 _copyIdent(Ident *from)
1573 {
1574         Ident      *newnode = makeNode(Ident);
1575
1576         if (from->name)
1577                 newnode->name = pstrdup(from->name);
1578         Node_Copy(from, newnode, indirection);
1579         newnode->isRel = from->isRel;
1580
1581         return newnode;
1582 }
1583
1584 static FuncCall *
1585 _copyFuncCall(FuncCall *from)
1586 {
1587         FuncCall   *newnode = makeNode(FuncCall);
1588
1589         if (from->funcname)
1590                 newnode->funcname = pstrdup(from->funcname);
1591         Node_Copy(from, newnode, args);
1592         newnode->agg_star = from->agg_star;
1593         newnode->agg_distinct = from->agg_distinct;
1594
1595         return newnode;
1596 }
1597
1598 static A_Indices *
1599 _copyAIndices(A_Indices *from)
1600 {
1601         A_Indices  *newnode = makeNode(A_Indices);
1602
1603         Node_Copy(from, newnode, lidx);
1604         Node_Copy(from, newnode, uidx);
1605
1606         return newnode;
1607 }
1608
1609 static ResTarget *
1610 _copyResTarget(ResTarget *from)
1611 {
1612         ResTarget  *newnode = makeNode(ResTarget);
1613
1614         if (from->name)
1615                 newnode->name = pstrdup(from->name);
1616         Node_Copy(from, newnode, indirection);
1617         Node_Copy(from, newnode, val);
1618
1619         return newnode;
1620 }
1621
1622 static TypeName *
1623 _copyTypeName(TypeName *from)
1624 {
1625         TypeName   *newnode = makeNode(TypeName);
1626
1627         if (from->name)
1628                 newnode->name = pstrdup(from->name);
1629         newnode->timezone = from->timezone;
1630         newnode->setof = from->setof;
1631         newnode->typmod = from->typmod;
1632         Node_Copy(from, newnode, arrayBounds);
1633
1634         return newnode;
1635 }
1636
1637 static SortGroupBy *
1638 _copySortGroupBy(SortGroupBy *from)
1639 {
1640         SortGroupBy *newnode = makeNode(SortGroupBy);
1641
1642         if (from->useOp)
1643                 newnode->useOp = pstrdup(from->useOp);
1644         Node_Copy(from, newnode, node);
1645
1646         return newnode;
1647 }
1648
1649 static RangeVar *
1650 _copyRangeVar(RangeVar *from)
1651 {
1652         RangeVar   *newnode = makeNode(RangeVar);
1653
1654         if (from->relname)
1655                 newnode->relname = pstrdup(from->relname);
1656         newnode->inhOpt = from->inhOpt;
1657         Node_Copy(from, newnode, name);
1658
1659         return newnode;
1660 }
1661
1662 static RangeSubselect *
1663 _copyRangeSubselect(RangeSubselect *from)
1664 {
1665         RangeSubselect *newnode = makeNode(RangeSubselect);
1666
1667         Node_Copy(from, newnode, subquery);
1668         Node_Copy(from, newnode, name);
1669
1670         return newnode;
1671 }
1672
1673 static TypeCast *
1674 _copyTypeCast(TypeCast *from)
1675 {
1676         TypeCast   *newnode = makeNode(TypeCast);
1677
1678         Node_Copy(from, newnode, arg);
1679         Node_Copy(from, newnode, typename);
1680
1681         return newnode;
1682 }
1683
1684 static IndexElem *
1685 _copyIndexElem(IndexElem *from)
1686 {
1687         IndexElem  *newnode = makeNode(IndexElem);
1688
1689         if (from->name)
1690                 newnode->name = pstrdup(from->name);
1691         Node_Copy(from, newnode, args);
1692         if (from->class)
1693                 newnode->class = pstrdup(from->class);
1694
1695         return newnode;
1696 }
1697
1698 static ColumnDef *
1699 _copyColumnDef(ColumnDef *from)
1700 {
1701         ColumnDef  *newnode = makeNode(ColumnDef);
1702
1703         if (from->colname)
1704                 newnode->colname = pstrdup(from->colname);
1705         Node_Copy(from, newnode, typename);
1706         newnode->is_not_null = from->is_not_null;
1707         Node_Copy(from, newnode, raw_default);
1708         if (from->cooked_default)
1709                 newnode->cooked_default = pstrdup(from->cooked_default);
1710         Node_Copy(from, newnode, constraints);
1711
1712         return newnode;
1713 }
1714
1715 static Constraint *
1716 _copyConstraint(Constraint *from)
1717 {
1718         Constraint *newnode = makeNode(Constraint);
1719
1720         newnode->contype = from->contype;
1721         if (from->name)
1722                 newnode->name = pstrdup(from->name);
1723         Node_Copy(from, newnode, raw_expr);
1724         if (from->cooked_expr)
1725                 newnode->cooked_expr = pstrdup(from->cooked_expr);
1726         Node_Copy(from, newnode, keys);
1727
1728         return newnode;
1729 }
1730
1731 static DefElem *
1732 _copyDefElem(DefElem *from)
1733 {
1734         DefElem    *newnode = makeNode(DefElem);
1735
1736         if (from->defname)
1737                 newnode->defname = pstrdup(from->defname);
1738         Node_Copy(from, newnode, arg);
1739
1740         return newnode;
1741 }
1742
1743 static Query *
1744 _copyQuery(Query *from)
1745 {
1746         Query      *newnode = makeNode(Query);
1747
1748         newnode->commandType = from->commandType;
1749         Node_Copy(from, newnode, utilityStmt);
1750         newnode->resultRelation = from->resultRelation;
1751         if (from->into)
1752                 newnode->into = pstrdup(from->into);
1753         newnode->isPortal = from->isPortal;
1754         newnode->isBinary = from->isBinary;
1755         newnode->isTemp = from->isTemp;
1756         newnode->hasAggs = from->hasAggs;
1757         newnode->hasSubLinks = from->hasSubLinks;
1758         newnode->originalQuery = from->originalQuery;
1759
1760         Node_Copy(from, newnode, rtable);
1761         Node_Copy(from, newnode, jointree);
1762
1763         newnode->rowMarks = listCopy(from->rowMarks);
1764
1765         Node_Copy(from, newnode, targetList);
1766
1767         Node_Copy(from, newnode, groupClause);
1768         Node_Copy(from, newnode, havingQual);
1769         Node_Copy(from, newnode, distinctClause);
1770         Node_Copy(from, newnode, sortClause);
1771
1772         Node_Copy(from, newnode, limitOffset);
1773         Node_Copy(from, newnode, limitCount);
1774
1775         Node_Copy(from, newnode, setOperations);
1776
1777         newnode->resultRelations = listCopy(from->resultRelations);
1778
1779         /*
1780          * We do not copy the planner internal fields: base_rel_list,
1781          * other_rel_list, join_rel_list, equi_key_list, query_pathkeys. Not
1782          * entirely clear if this is right?
1783          */
1784
1785         return newnode;
1786 }
1787
1788 static InsertStmt *
1789 _copyInsertStmt(InsertStmt *from)
1790 {
1791         InsertStmt *newnode = makeNode(InsertStmt);
1792
1793         if (from->relname)
1794                 newnode->relname = pstrdup(from->relname);
1795         Node_Copy(from, newnode, cols);
1796         Node_Copy(from, newnode, targetList);
1797         Node_Copy(from, newnode, selectStmt);
1798
1799         return newnode;
1800 }
1801
1802 static DeleteStmt *
1803 _copyDeleteStmt(DeleteStmt *from)
1804 {
1805         DeleteStmt *newnode = makeNode(DeleteStmt);
1806
1807         if (from->relname)
1808                 newnode->relname = pstrdup(from->relname);
1809         Node_Copy(from, newnode, whereClause);
1810         newnode->inhOpt = from->inhOpt;
1811
1812         return newnode;
1813 }
1814
1815 static UpdateStmt *
1816 _copyUpdateStmt(UpdateStmt *from)
1817 {
1818         UpdateStmt *newnode = makeNode(UpdateStmt);
1819
1820         if (from->relname)
1821                 newnode->relname = pstrdup(from->relname);
1822         Node_Copy(from, newnode, targetList);
1823         Node_Copy(from, newnode, whereClause);
1824         Node_Copy(from, newnode, fromClause);
1825         newnode->inhOpt = from->inhOpt;
1826
1827         return newnode;
1828 }
1829
1830 static SelectStmt *
1831 _copySelectStmt(SelectStmt *from)
1832 {
1833         SelectStmt *newnode = makeNode(SelectStmt);
1834
1835         Node_Copy(from, newnode, distinctClause);
1836         if (from->into)
1837                 newnode->into = pstrdup(from->into);
1838         newnode->istemp = from->istemp;
1839         Node_Copy(from, newnode, intoColNames);
1840         Node_Copy(from, newnode, targetList);
1841         Node_Copy(from, newnode, fromClause);
1842         Node_Copy(from, newnode, whereClause);
1843         Node_Copy(from, newnode, groupClause);
1844         Node_Copy(from, newnode, havingClause);
1845         Node_Copy(from, newnode, sortClause);
1846         if (from->portalname)
1847                 newnode->portalname = pstrdup(from->portalname);
1848         newnode->binary = from->binary;
1849         Node_Copy(from, newnode, limitOffset);
1850         Node_Copy(from, newnode, limitCount);
1851         Node_Copy(from, newnode, forUpdate);
1852         newnode->op = from->op;
1853         newnode->all = from->all;
1854         Node_Copy(from, newnode, larg);
1855         Node_Copy(from, newnode, rarg);
1856
1857         return newnode;
1858 }
1859
1860 static SetOperationStmt *
1861 _copySetOperationStmt(SetOperationStmt *from)
1862 {
1863         SetOperationStmt *newnode = makeNode(SetOperationStmt);
1864
1865         newnode->op = from->op;
1866         newnode->all = from->all;
1867         Node_Copy(from, newnode, larg);
1868         Node_Copy(from, newnode, rarg);
1869         newnode->colTypes = listCopy(from->colTypes);
1870
1871         return newnode;
1872 }
1873
1874 static AlterTableStmt *
1875 _copyAlterTableStmt(AlterTableStmt *from)
1876 {
1877         AlterTableStmt *newnode = makeNode(AlterTableStmt);
1878
1879         newnode->subtype = from->subtype;
1880         if (from->relname)
1881                 newnode->relname = pstrdup(from->relname);
1882         newnode->inhOpt = from->inhOpt;
1883         if (from->name)
1884                 newnode->name = pstrdup(from->name);
1885         Node_Copy(from, newnode, def);
1886         newnode->behavior = from->behavior;
1887
1888         return newnode;
1889 }
1890
1891 static GrantStmt *
1892 _copyGrantStmt(GrantStmt *from)
1893 {
1894         GrantStmt  *newnode = makeNode(GrantStmt);
1895
1896         newnode->is_grant = from->is_grant;
1897         newnode->objtype = from->objtype;
1898         Node_Copy(from, newnode, objects);
1899         Node_Copy(from, newnode, privileges);
1900         Node_Copy(from, newnode, grantees);
1901
1902         return newnode;
1903 }
1904
1905 static PrivGrantee *
1906 _copyPrivGrantee(PrivGrantee *from)
1907 {
1908         PrivGrantee *newnode = makeNode(PrivGrantee);
1909
1910         if (from->username)
1911                 newnode->username = pstrdup(from->username);
1912         if (from->groupname)
1913                 newnode->groupname = pstrdup(from->groupname);
1914
1915         return newnode;
1916 }
1917
1918 static FuncWithArgs *
1919 _copyFuncWithArgs(FuncWithArgs *from)
1920 {
1921         FuncWithArgs *newnode = makeNode(FuncWithArgs);
1922
1923         if (from->funcname)
1924                 newnode->funcname = pstrdup(from->funcname);
1925         else
1926                 newnode->funcname = NULL;
1927         Node_Copy(from, newnode, funcargs);
1928
1929         return newnode;
1930 }
1931
1932 static ClosePortalStmt *
1933 _copyClosePortalStmt(ClosePortalStmt *from)
1934 {
1935         ClosePortalStmt *newnode = makeNode(ClosePortalStmt);
1936
1937         if (from->portalname)
1938                 newnode->portalname = pstrdup(from->portalname);
1939
1940         return newnode;
1941 }
1942
1943 static ClusterStmt *
1944 _copyClusterStmt(ClusterStmt *from)
1945 {
1946         ClusterStmt *newnode = makeNode(ClusterStmt);
1947
1948         if (from->relname)
1949                 newnode->relname = pstrdup(from->relname);
1950         if (from->indexname)
1951                 newnode->indexname = pstrdup(from->indexname);
1952
1953         return newnode;
1954 }
1955
1956 static CopyStmt *
1957 _copyCopyStmt(CopyStmt *from)
1958 {
1959         CopyStmt   *newnode = makeNode(CopyStmt);
1960
1961         newnode->binary = from->binary;
1962         if (from->relname)
1963                 newnode->relname = pstrdup(from->relname);
1964         newnode->oids = from->oids;
1965         newnode->direction = from->direction;
1966         if (from->filename)
1967                 newnode->filename = pstrdup(from->filename);
1968         if (from->delimiter)
1969                 newnode->delimiter = pstrdup(from->delimiter);
1970         if (from->null_print)
1971                 newnode->null_print = pstrdup(from->null_print);
1972
1973         return newnode;
1974 }
1975
1976 static CreateStmt *
1977 _copyCreateStmt(CreateStmt *from)
1978 {
1979         CreateStmt *newnode = makeNode(CreateStmt);
1980
1981         newnode->relname = pstrdup(from->relname);
1982         Node_Copy(from, newnode, tableElts);
1983         Node_Copy(from, newnode, inhRelnames);
1984         Node_Copy(from, newnode, constraints);
1985         newnode->istemp = from->istemp;
1986         newnode->hasoids = from->hasoids;
1987
1988         return newnode;
1989 }
1990
1991 static VersionStmt *
1992 _copyVersionStmt(VersionStmt *from)
1993 {
1994         VersionStmt *newnode = makeNode(VersionStmt);
1995
1996         newnode->relname = pstrdup(from->relname);
1997         newnode->direction = from->direction;
1998         newnode->fromRelname = pstrdup(from->fromRelname);
1999         newnode->date = pstrdup(from->date);
2000
2001         return newnode;
2002 }
2003
2004 static DefineStmt *
2005 _copyDefineStmt(DefineStmt *from)
2006 {
2007         DefineStmt *newnode = makeNode(DefineStmt);
2008
2009         newnode->defType = from->defType;
2010         newnode->defname = pstrdup(from->defname);
2011         Node_Copy(from, newnode, definition);
2012
2013         return newnode;
2014 }
2015
2016 static DropStmt *
2017 _copyDropStmt(DropStmt *from)
2018 {
2019         DropStmt   *newnode = makeNode(DropStmt);
2020
2021         Node_Copy(from, newnode, names);
2022         newnode->removeType = from->removeType;
2023
2024         return newnode;
2025 }
2026
2027 static TruncateStmt *
2028 _copyTruncateStmt(TruncateStmt *from)
2029 {
2030         TruncateStmt *newnode = makeNode(TruncateStmt);
2031
2032         newnode->relName = pstrdup(from->relName);
2033
2034         return newnode;
2035 }
2036
2037 static CommentStmt *
2038 _copyCommentStmt(CommentStmt *from)
2039 {
2040         CommentStmt *newnode = makeNode(CommentStmt);
2041
2042         newnode->objtype = from->objtype;
2043         newnode->objname = pstrdup(from->objname);
2044         if (from->objproperty)
2045                 newnode->objproperty = pstrdup(from->objproperty);
2046         Node_Copy(from, newnode, objlist);
2047         newnode->comment = pstrdup(from->comment);
2048
2049         return newnode;
2050 }
2051
2052 static FetchStmt *
2053 _copyFetchStmt(FetchStmt *from)
2054 {
2055         FetchStmt  *newnode = makeNode(FetchStmt);
2056
2057         newnode->direction = from->direction;
2058         newnode->howMany = from->howMany;
2059         newnode->portalname = pstrdup(from->portalname);
2060         newnode->ismove = from->ismove;
2061
2062         return newnode;
2063 }
2064
2065 static IndexStmt *
2066 _copyIndexStmt(IndexStmt *from)
2067 {
2068         IndexStmt  *newnode = makeNode(IndexStmt);
2069
2070         newnode->idxname = pstrdup(from->idxname);
2071         newnode->relname = pstrdup(from->relname);
2072         newnode->accessMethod = pstrdup(from->accessMethod);
2073         Node_Copy(from, newnode, indexParams);
2074         Node_Copy(from, newnode, whereClause);
2075         Node_Copy(from, newnode, rangetable);
2076         newnode->unique = from->unique;
2077         newnode->primary = from->primary;
2078
2079         return newnode;
2080 }
2081
2082 static ProcedureStmt *
2083 _copyProcedureStmt(ProcedureStmt *from)
2084 {
2085         ProcedureStmt *newnode = makeNode(ProcedureStmt);
2086
2087         newnode->replace = from->replace;
2088         newnode->funcname = pstrdup(from->funcname);
2089         Node_Copy(from, newnode, argTypes);
2090         Node_Copy(from, newnode, returnType);
2091         Node_Copy(from, newnode, withClause);
2092         Node_Copy(from, newnode, as);
2093         newnode->language = pstrdup(from->language);
2094
2095         return newnode;
2096 }
2097
2098 static RemoveAggrStmt *
2099 _copyRemoveAggrStmt(RemoveAggrStmt *from)
2100 {
2101         RemoveAggrStmt *newnode = makeNode(RemoveAggrStmt);
2102
2103         newnode->aggname = pstrdup(from->aggname);
2104         Node_Copy(from, newnode, aggtype);
2105
2106         return newnode;
2107 }
2108
2109 static RemoveFuncStmt *
2110 _copyRemoveFuncStmt(RemoveFuncStmt *from)
2111 {
2112         RemoveFuncStmt *newnode = makeNode(RemoveFuncStmt);
2113
2114         newnode->funcname = pstrdup(from->funcname);
2115         Node_Copy(from, newnode, args);
2116
2117         return newnode;
2118 }
2119
2120 static RemoveOperStmt *
2121 _copyRemoveOperStmt(RemoveOperStmt *from)
2122 {
2123         RemoveOperStmt *newnode = makeNode(RemoveOperStmt);
2124
2125         newnode->opname = pstrdup(from->opname);
2126         Node_Copy(from, newnode, args);
2127
2128         return newnode;
2129 }
2130
2131 static RenameStmt *
2132 _copyRenameStmt(RenameStmt *from)
2133 {
2134         RenameStmt *newnode = makeNode(RenameStmt);
2135
2136         newnode->relname = pstrdup(from->relname);
2137         newnode->inhOpt = from->inhOpt;
2138         if (from->column)
2139                 newnode->column = pstrdup(from->column);
2140         if (from->newname)
2141                 newnode->newname = pstrdup(from->newname);
2142
2143         return newnode;
2144 }
2145
2146 static RuleStmt *
2147 _copyRuleStmt(RuleStmt *from)
2148 {
2149         RuleStmt   *newnode = makeNode(RuleStmt);
2150
2151         newnode->rulename = pstrdup(from->rulename);
2152         Node_Copy(from, newnode, whereClause);
2153         newnode->event = from->event;
2154         Node_Copy(from, newnode, object);
2155         newnode->instead = from->instead;
2156         Node_Copy(from, newnode, actions);
2157
2158         return newnode;
2159 }
2160
2161 static NotifyStmt *
2162 _copyNotifyStmt(NotifyStmt *from)
2163 {
2164         NotifyStmt *newnode = makeNode(NotifyStmt);
2165
2166         if (from->relname)
2167                 newnode->relname = pstrdup(from->relname);
2168
2169         return newnode;
2170 }
2171
2172 static ListenStmt *
2173 _copyListenStmt(ListenStmt *from)
2174 {
2175         ListenStmt *newnode = makeNode(ListenStmt);
2176
2177         if (from->relname)
2178                 newnode->relname = pstrdup(from->relname);
2179
2180         return newnode;
2181 }
2182
2183 static UnlistenStmt *
2184 _copyUnlistenStmt(UnlistenStmt *from)
2185 {
2186         UnlistenStmt *newnode = makeNode(UnlistenStmt);
2187
2188         if (from->relname)
2189                 newnode->relname = pstrdup(from->relname);
2190
2191         return newnode;
2192 }
2193
2194 static TransactionStmt *
2195 _copyTransactionStmt(TransactionStmt *from)
2196 {
2197         TransactionStmt *newnode = makeNode(TransactionStmt);
2198
2199         newnode->command = from->command;
2200
2201         return newnode;
2202 }
2203
2204 static ViewStmt *
2205 _copyViewStmt(ViewStmt *from)
2206 {
2207         ViewStmt   *newnode = makeNode(ViewStmt);
2208
2209         if (from->viewname)
2210                 newnode->viewname = pstrdup(from->viewname);
2211         Node_Copy(from, newnode, aliases);
2212         Node_Copy(from, newnode, query);
2213
2214         return newnode;
2215 }
2216
2217 static LoadStmt *
2218 _copyLoadStmt(LoadStmt *from)
2219 {
2220         LoadStmt   *newnode = makeNode(LoadStmt);
2221
2222         if (from->filename)
2223                 newnode->filename = pstrdup(from->filename);
2224
2225         return newnode;
2226 }
2227
2228 static CreatedbStmt *
2229 _copyCreatedbStmt(CreatedbStmt *from)
2230 {
2231         CreatedbStmt *newnode = makeNode(CreatedbStmt);
2232
2233         if (from->dbname)
2234                 newnode->dbname = pstrdup(from->dbname);
2235         if (from->dbowner)
2236                 newnode->dbowner = pstrdup(from->dbowner);
2237         if (from->dbpath)
2238                 newnode->dbpath = pstrdup(from->dbpath);
2239         if (from->dbtemplate)
2240                 newnode->dbtemplate = pstrdup(from->dbtemplate);
2241         newnode->encoding = from->encoding;
2242
2243         return newnode;
2244 }
2245
2246 static DropdbStmt *
2247 _copyDropdbStmt(DropdbStmt *from)
2248 {
2249         DropdbStmt *newnode = makeNode(DropdbStmt);
2250
2251         if (from->dbname)
2252                 newnode->dbname = pstrdup(from->dbname);
2253
2254         return newnode;
2255 }
2256
2257 static VacuumStmt *
2258 _copyVacuumStmt(VacuumStmt *from)
2259 {
2260         VacuumStmt *newnode = makeNode(VacuumStmt);
2261
2262         newnode->vacuum = from->vacuum;
2263         newnode->full = from->full;
2264         newnode->analyze = from->analyze;
2265         newnode->freeze = from->freeze;
2266         newnode->verbose = from->verbose;
2267         if (from->vacrel)
2268                 newnode->vacrel = pstrdup(from->vacrel);
2269         Node_Copy(from, newnode, va_cols);
2270
2271         return newnode;
2272 }
2273
2274 static ExplainStmt *
2275 _copyExplainStmt(ExplainStmt *from)
2276 {
2277         ExplainStmt *newnode = makeNode(ExplainStmt);
2278
2279         Node_Copy(from, newnode, query);
2280         newnode->verbose = from->verbose;
2281         newnode->analyze = from->analyze;
2282
2283         return newnode;
2284 }
2285
2286 static CreateSeqStmt *
2287 _copyCreateSeqStmt(CreateSeqStmt *from)
2288 {
2289         CreateSeqStmt *newnode = makeNode(CreateSeqStmt);
2290
2291         if (from->seqname)
2292                 newnode->seqname = pstrdup(from->seqname);
2293         Node_Copy(from, newnode, options);
2294
2295         return newnode;
2296 }
2297
2298 static VariableSetStmt *
2299 _copyVariableSetStmt(VariableSetStmt *from)
2300 {
2301         VariableSetStmt *newnode = makeNode(VariableSetStmt);
2302
2303         if (from->name)
2304                 newnode->name = pstrdup(from->name);
2305         Node_Copy(from, newnode, args);
2306
2307         return newnode;
2308 }
2309
2310 static VariableShowStmt *
2311 _copyVariableShowStmt(VariableShowStmt *from)
2312 {
2313         VariableShowStmt *newnode = makeNode(VariableShowStmt);
2314
2315         if (from->name)
2316                 newnode->name = pstrdup(from->name);
2317
2318         return newnode;
2319 }
2320
2321 static VariableResetStmt *
2322 _copyVariableResetStmt(VariableResetStmt *from)
2323 {
2324         VariableResetStmt *newnode = makeNode(VariableResetStmt);
2325
2326         if (from->name)
2327                 newnode->name = pstrdup(from->name);
2328
2329         return newnode;
2330 }
2331
2332 static CreateTrigStmt *
2333 _copyCreateTrigStmt(CreateTrigStmt *from)
2334 {
2335         CreateTrigStmt *newnode = makeNode(CreateTrigStmt);
2336
2337         if (from->trigname)
2338                 newnode->trigname = pstrdup(from->trigname);
2339         if (from->relname)
2340                 newnode->relname = pstrdup(from->relname);
2341         if (from->funcname)
2342                 newnode->funcname = pstrdup(from->funcname);
2343         Node_Copy(from, newnode, args);
2344         newnode->before = from->before;
2345         newnode->row = from->row;
2346         memcpy(newnode->actions, from->actions, sizeof(from->actions));
2347         if (from->lang)
2348                 newnode->lang = pstrdup(from->lang);
2349         if (from->text)
2350                 newnode->text = pstrdup(from->text);
2351
2352         Node_Copy(from, newnode, attr);
2353         if (from->when)
2354                 newnode->when = pstrdup(from->when);
2355         newnode->isconstraint = from->isconstraint;
2356         newnode->deferrable = from->deferrable;
2357         newnode->initdeferred = from->initdeferred;
2358         if (from->constrrelname)
2359                 newnode->constrrelname = pstrdup(from->constrrelname);
2360
2361         return newnode;
2362 }
2363
2364 static DropTrigStmt *
2365 _copyDropTrigStmt(DropTrigStmt *from)
2366 {
2367         DropTrigStmt *newnode = makeNode(DropTrigStmt);
2368
2369         if (from->trigname)
2370                 newnode->trigname = pstrdup(from->trigname);
2371         if (from->relname)
2372                 newnode->relname = pstrdup(from->relname);
2373
2374         return newnode;
2375 }
2376
2377 static CreatePLangStmt *
2378 _copyCreatePLangStmt(CreatePLangStmt *from)
2379 {
2380         CreatePLangStmt *newnode = makeNode(CreatePLangStmt);
2381
2382         if (from->plname)
2383                 newnode->plname = pstrdup(from->plname);
2384         if (from->plhandler)
2385                 newnode->plhandler = pstrdup(from->plhandler);
2386         if (from->plcompiler)
2387                 newnode->plcompiler = pstrdup(from->plcompiler);
2388         newnode->pltrusted = from->pltrusted;
2389
2390         return newnode;
2391 }
2392
2393 static DropPLangStmt *
2394 _copyDropPLangStmt(DropPLangStmt *from)
2395 {
2396         DropPLangStmt *newnode = makeNode(DropPLangStmt);
2397
2398         if (from->plname)
2399                 newnode->plname = pstrdup(from->plname);
2400
2401         return newnode;
2402 }
2403
2404 static CreateUserStmt *
2405 _copyCreateUserStmt(CreateUserStmt *from)
2406 {
2407         CreateUserStmt *newnode = makeNode(CreateUserStmt);
2408
2409         if (from->user)
2410                 newnode->user = pstrdup(from->user);
2411         Node_Copy(from, newnode, options);
2412
2413         return newnode;
2414 }
2415
2416 static AlterUserStmt *
2417 _copyAlterUserStmt(AlterUserStmt *from)
2418 {
2419         AlterUserStmt *newnode = makeNode(AlterUserStmt);
2420
2421         if (from->user)
2422                 newnode->user = pstrdup(from->user);
2423         Node_Copy(from, newnode, options);
2424
2425         return newnode;
2426 }
2427
2428 static DropUserStmt *
2429 _copyDropUserStmt(DropUserStmt *from)
2430 {
2431         DropUserStmt *newnode = makeNode(DropUserStmt);
2432
2433         Node_Copy(from, newnode, users);
2434
2435         return newnode;
2436 }
2437
2438 static LockStmt *
2439 _copyLockStmt(LockStmt *from)
2440 {
2441         LockStmt   *newnode = makeNode(LockStmt);
2442
2443         Node_Copy(from, newnode, rellist);
2444
2445         newnode->mode = from->mode;
2446
2447         return newnode;
2448 }
2449
2450 static ConstraintsSetStmt *
2451 _copyConstraintsSetStmt(ConstraintsSetStmt *from)
2452 {
2453         ConstraintsSetStmt *newnode = makeNode(ConstraintsSetStmt);
2454
2455         Node_Copy(from, newnode, constraints);
2456         newnode->deferred = from->deferred;
2457
2458         return newnode;
2459 }
2460
2461 static CreateGroupStmt *
2462 _copyCreateGroupStmt(CreateGroupStmt *from)
2463 {
2464         CreateGroupStmt *newnode = makeNode(CreateGroupStmt);
2465
2466         if (from->name)
2467                 newnode->name = pstrdup(from->name);
2468         Node_Copy(from, newnode, options);
2469
2470         return newnode;
2471 }
2472
2473 static AlterGroupStmt *
2474 _copyAlterGroupStmt(AlterGroupStmt *from)
2475 {
2476         AlterGroupStmt *newnode = makeNode(AlterGroupStmt);
2477
2478         if (from->name)
2479                 newnode->name = pstrdup(from->name);
2480         newnode->action = from->action;
2481         Node_Copy(from, newnode, listUsers);
2482
2483         return newnode;
2484 }
2485
2486 static DropGroupStmt *
2487 _copyDropGroupStmt(DropGroupStmt *from)
2488 {
2489         DropGroupStmt *newnode = makeNode(DropGroupStmt);
2490
2491         if (from->name)
2492                 newnode->name = pstrdup(from->name);
2493
2494         return newnode;
2495 }
2496
2497 static ReindexStmt *
2498 _copyReindexStmt(ReindexStmt *from)
2499 {
2500         ReindexStmt *newnode = makeNode(ReindexStmt);
2501
2502         newnode->reindexType = from->reindexType;
2503         if (from->name)
2504                 newnode->name = pstrdup(from->name);
2505         newnode->force = from->force;
2506         newnode->all = from->all;
2507
2508         return newnode;
2509 }
2510
2511
2512 /* ****************************************************************
2513  *                                      pg_list.h copy functions
2514  * ****************************************************************
2515  */
2516
2517 static Value *
2518 _copyValue(Value *from)
2519 {
2520         Value      *newnode = makeNode(Value);
2521
2522         newnode->type = from->type;
2523         switch (from->type)
2524         {
2525                 case T_Integer:
2526                         newnode->val.ival = from->val.ival;
2527                         break;
2528                 case T_Float:
2529                 case T_String:
2530                 case T_BitString:
2531                         newnode->val.str = pstrdup(from->val.str);
2532                         break;
2533                 default:
2534                         break;
2535         }
2536         return newnode;
2537 }
2538
2539 /* ----------------
2540  *              copyObject returns a copy of the node or list. If it is a list, it
2541  *              recursively copies its items.
2542  * ----------------
2543  */
2544 void *
2545 copyObject(void *from)
2546 {
2547         void       *retval;
2548
2549         if (from == NULL)
2550                 return NULL;
2551
2552         switch (nodeTag(from))
2553         {
2554                         /*
2555                          * PLAN NODES
2556                          */
2557                 case T_Plan:
2558                         retval = _copyPlan(from);
2559                         break;
2560                 case T_Result:
2561                         retval = _copyResult(from);
2562                         break;
2563                 case T_Append:
2564                         retval = _copyAppend(from);
2565                         break;
2566                 case T_Scan:
2567                         retval = _copyScan(from);
2568                         break;
2569                 case T_SeqScan:
2570                         retval = _copySeqScan(from);
2571                         break;
2572                 case T_IndexScan:
2573                         retval = _copyIndexScan(from);
2574                         break;
2575                 case T_TidScan:
2576                         retval = _copyTidScan(from);
2577                         break;
2578                 case T_SubqueryScan:
2579                         retval = _copySubqueryScan(from);
2580                         break;
2581                 case T_Join:
2582                         retval = _copyJoin(from);
2583                         break;
2584                 case T_NestLoop:
2585                         retval = _copyNestLoop(from);
2586                         break;
2587                 case T_MergeJoin:
2588                         retval = _copyMergeJoin(from);
2589                         break;
2590                 case T_HashJoin:
2591                         retval = _copyHashJoin(from);
2592                         break;
2593                 case T_Material:
2594                         retval = _copyMaterial(from);
2595                         break;
2596                 case T_Sort:
2597                         retval = _copySort(from);
2598                         break;
2599                 case T_Group:
2600                         retval = _copyGroup(from);
2601                         break;
2602                 case T_Agg:
2603                         retval = _copyAgg(from);
2604                         break;
2605                 case T_Unique:
2606                         retval = _copyUnique(from);
2607                         break;
2608                 case T_SetOp:
2609                         retval = _copySetOp(from);
2610                         break;
2611                 case T_Limit:
2612                         retval = _copyLimit(from);
2613                         break;
2614                 case T_Hash:
2615                         retval = _copyHash(from);
2616                         break;
2617                 case T_SubPlan:
2618                         retval = _copySubPlan(from);
2619                         break;
2620
2621                         /*
2622                          * PRIMITIVE NODES
2623                          */
2624                 case T_Resdom:
2625                         retval = _copyResdom(from);
2626                         break;
2627                 case T_Fjoin:
2628                         retval = _copyFjoin(from);
2629                         break;
2630                 case T_Expr:
2631                         retval = _copyExpr(from);
2632                         break;
2633                 case T_Var:
2634                         retval = _copyVar(from);
2635                         break;
2636                 case T_Oper:
2637                         retval = _copyOper(from);
2638                         break;
2639                 case T_Const:
2640                         retval = _copyConst(from);
2641                         break;
2642                 case T_Param:
2643                         retval = _copyParam(from);
2644                         break;
2645                 case T_Aggref:
2646                         retval = _copyAggref(from);
2647                         break;
2648                 case T_SubLink:
2649                         retval = _copySubLink(from);
2650                         break;
2651                 case T_Func:
2652                         retval = _copyFunc(from);
2653                         break;
2654                 case T_ArrayRef:
2655                         retval = _copyArrayRef(from);
2656                         break;
2657                 case T_Iter:
2658                         retval = _copyIter(from);
2659                         break;
2660                 case T_FieldSelect:
2661                         retval = _copyFieldSelect(from);
2662                         break;
2663                 case T_RelabelType:
2664                         retval = _copyRelabelType(from);
2665                         break;
2666                 case T_RangeTblRef:
2667                         retval = _copyRangeTblRef(from);
2668                         break;
2669                 case T_FromExpr:
2670                         retval = _copyFromExpr(from);
2671                         break;
2672                 case T_JoinExpr:
2673                         retval = _copyJoinExpr(from);
2674                         break;
2675
2676                         /*
2677                          * RELATION NODES
2678                          */
2679                 case T_RelOptInfo:
2680                         retval = _copyRelOptInfo(from);
2681                         break;
2682                 case T_Path:
2683                         retval = _copyPath(from);
2684                         break;
2685                 case T_IndexPath:
2686                         retval = _copyIndexPath(from);
2687                         break;
2688                 case T_TidPath:
2689                         retval = _copyTidPath(from);
2690                         break;
2691                 case T_AppendPath:
2692                         retval = _copyAppendPath(from);
2693                         break;
2694                 case T_NestPath:
2695                         retval = _copyNestPath(from);
2696                         break;
2697                 case T_MergePath:
2698                         retval = _copyMergePath(from);
2699                         break;
2700                 case T_HashPath:
2701                         retval = _copyHashPath(from);
2702                         break;
2703                 case T_PathKeyItem:
2704                         retval = _copyPathKeyItem(from);
2705                         break;
2706                 case T_RestrictInfo:
2707                         retval = _copyRestrictInfo(from);
2708                         break;
2709                 case T_JoinInfo:
2710                         retval = _copyJoinInfo(from);
2711                         break;
2712                 case T_Stream:
2713                         retval = _copyStream(from);
2714                         break;
2715                 case T_IndexOptInfo:
2716                         retval = _copyIndexOptInfo(from);
2717                         break;
2718
2719                         /*
2720                          * VALUE NODES
2721                          */
2722                 case T_Integer:
2723                 case T_Float:
2724                 case T_String:
2725                 case T_BitString:
2726                         retval = _copyValue(from);
2727                         break;
2728                 case T_List:
2729                         {
2730                                 List       *list = from,
2731                                                    *l,
2732                                                    *nl;
2733
2734                                 /* rather ugly coding for speed... */
2735                                 /* Note the input list cannot be NIL if we got here. */
2736                                 nl = makeList1(copyObject(lfirst(list)));
2737                                 retval = nl;
2738
2739                                 foreach(l, lnext(list))
2740                                 {
2741                                         lnext(nl) = makeList1(copyObject(lfirst(l)));
2742                                         nl = lnext(nl);
2743                                 }
2744                         }
2745                         break;
2746
2747                         /*
2748                          * PARSE NODES
2749                          */
2750                 case T_Query:
2751                         retval = _copyQuery(from);
2752                         break;
2753                 case T_InsertStmt:
2754                         retval = _copyInsertStmt(from);
2755                         break;
2756                 case T_DeleteStmt:
2757                         retval = _copyDeleteStmt(from);
2758                         break;
2759                 case T_UpdateStmt:
2760                         retval = _copyUpdateStmt(from);
2761                         break;
2762                 case T_SelectStmt:
2763                         retval = _copySelectStmt(from);
2764                         break;
2765                 case T_SetOperationStmt:
2766                         retval = _copySetOperationStmt(from);
2767                         break;
2768                 case T_AlterTableStmt:
2769                         retval = _copyAlterTableStmt(from);
2770                         break;
2771                 case T_GrantStmt:
2772                         retval = _copyGrantStmt(from);
2773                         break;
2774                 case T_ClosePortalStmt:
2775                         retval = _copyClosePortalStmt(from);
2776                         break;
2777                 case T_ClusterStmt:
2778                         retval = _copyClusterStmt(from);
2779                         break;
2780                 case T_CopyStmt:
2781                         retval = _copyCopyStmt(from);
2782                         break;
2783                 case T_CreateStmt:
2784                         retval = _copyCreateStmt(from);
2785                         break;
2786                 case T_VersionStmt:
2787                         retval = _copyVersionStmt(from);
2788                         break;
2789                 case T_DefineStmt:
2790                         retval = _copyDefineStmt(from);
2791                         break;
2792                 case T_DropStmt:
2793                         retval = _copyDropStmt(from);
2794                         break;
2795                 case T_TruncateStmt:
2796                         retval = _copyTruncateStmt(from);
2797                         break;
2798                 case T_CommentStmt:
2799                         retval = _copyCommentStmt(from);
2800                         break;
2801                 case T_FetchStmt:
2802                         retval = _copyFetchStmt(from);
2803                         break;
2804                 case T_IndexStmt:
2805                         retval = _copyIndexStmt(from);
2806                         break;
2807                 case T_ProcedureStmt:
2808                         retval = _copyProcedureStmt(from);
2809                         break;
2810                 case T_RemoveAggrStmt:
2811                         retval = _copyRemoveAggrStmt(from);
2812                         break;
2813                 case T_RemoveFuncStmt:
2814                         retval = _copyRemoveFuncStmt(from);
2815                         break;
2816                 case T_RemoveOperStmt:
2817                         retval = _copyRemoveOperStmt(from);
2818                         break;
2819                 case T_RenameStmt:
2820                         retval = _copyRenameStmt(from);
2821                         break;
2822                 case T_RuleStmt:
2823                         retval = _copyRuleStmt(from);
2824                         break;
2825                 case T_NotifyStmt:
2826                         retval = _copyNotifyStmt(from);
2827                         break;
2828                 case T_ListenStmt:
2829                         retval = _copyListenStmt(from);
2830                         break;
2831                 case T_UnlistenStmt:
2832                         retval = _copyUnlistenStmt(from);
2833                         break;
2834                 case T_TransactionStmt:
2835                         retval = _copyTransactionStmt(from);
2836                         break;
2837                 case T_ViewStmt:
2838                         retval = _copyViewStmt(from);
2839                         break;
2840                 case T_LoadStmt:
2841                         retval = _copyLoadStmt(from);
2842                         break;
2843                 case T_CreatedbStmt:
2844                         retval = _copyCreatedbStmt(from);
2845                         break;
2846                 case T_DropdbStmt:
2847                         retval = _copyDropdbStmt(from);
2848                         break;
2849                 case T_VacuumStmt:
2850                         retval = _copyVacuumStmt(from);
2851                         break;
2852                 case T_ExplainStmt:
2853                         retval = _copyExplainStmt(from);
2854                         break;
2855                 case T_CreateSeqStmt:
2856                         retval = _copyCreateSeqStmt(from);
2857                         break;
2858                 case T_VariableSetStmt:
2859                         retval = _copyVariableSetStmt(from);
2860                         break;
2861                 case T_VariableShowStmt:
2862                         retval = _copyVariableShowStmt(from);
2863                         break;
2864                 case T_VariableResetStmt:
2865                         retval = _copyVariableResetStmt(from);
2866                         break;
2867                 case T_CreateTrigStmt:
2868                         retval = _copyCreateTrigStmt(from);
2869                         break;
2870                 case T_DropTrigStmt:
2871                         retval = _copyDropTrigStmt(from);
2872                         break;
2873                 case T_CreatePLangStmt:
2874                         retval = _copyCreatePLangStmt(from);
2875                         break;
2876                 case T_DropPLangStmt:
2877                         retval = _copyDropPLangStmt(from);
2878                         break;
2879                 case T_CreateUserStmt:
2880                         retval = _copyCreateUserStmt(from);
2881                         break;
2882                 case T_AlterUserStmt:
2883                         retval = _copyAlterUserStmt(from);
2884                         break;
2885                 case T_DropUserStmt:
2886                         retval = _copyDropUserStmt(from);
2887                         break;
2888                 case T_LockStmt:
2889                         retval = _copyLockStmt(from);
2890                         break;
2891                 case T_ConstraintsSetStmt:
2892                         retval = _copyConstraintsSetStmt(from);
2893                         break;
2894                 case T_CreateGroupStmt:
2895                         retval = _copyCreateGroupStmt(from);
2896                         break;
2897                 case T_AlterGroupStmt:
2898                         retval = _copyAlterGroupStmt(from);
2899                         break;
2900                 case T_DropGroupStmt:
2901                         retval = _copyDropGroupStmt(from);
2902                         break;
2903                 case T_ReindexStmt:
2904                         retval = _copyReindexStmt(from);
2905                         break;
2906                 case T_CheckPointStmt:
2907                         retval = (void *) makeNode(CheckPointStmt);
2908                         break;
2909
2910                 case T_A_Expr:
2911                         retval = _copyAExpr(from);
2912                         break;
2913                 case T_Attr:
2914                         retval = _copyAttr(from);
2915                         break;
2916                 case T_A_Const:
2917                         retval = _copyAConst(from);
2918                         break;
2919                 case T_ParamNo:
2920                         retval = _copyParamNo(from);
2921                         break;
2922                 case T_Ident:
2923                         retval = _copyIdent(from);
2924                         break;
2925                 case T_FuncCall:
2926                         retval = _copyFuncCall(from);
2927                         break;
2928                 case T_A_Indices:
2929                         retval = _copyAIndices(from);
2930                         break;
2931                 case T_ResTarget:
2932                         retval = _copyResTarget(from);
2933                         break;
2934                 case T_TypeCast:
2935                         retval = _copyTypeCast(from);
2936                         break;
2937                 case T_SortGroupBy:
2938                         retval = _copySortGroupBy(from);
2939                         break;
2940                 case T_RangeVar:
2941                         retval = _copyRangeVar(from);
2942                         break;
2943                 case T_RangeSubselect:
2944                         retval = _copyRangeSubselect(from);
2945                         break;
2946                 case T_TypeName:
2947                         retval = _copyTypeName(from);
2948                         break;
2949                 case T_IndexElem:
2950                         retval = _copyIndexElem(from);
2951                         break;
2952                 case T_ColumnDef:
2953                         retval = _copyColumnDef(from);
2954                         break;
2955                 case T_Constraint:
2956                         retval = _copyConstraint(from);
2957                         break;
2958                 case T_DefElem:
2959                         retval = _copyDefElem(from);
2960                         break;
2961                 case T_TargetEntry:
2962                         retval = _copyTargetEntry(from);
2963                         break;
2964                 case T_RangeTblEntry:
2965                         retval = _copyRangeTblEntry(from);
2966                         break;
2967                 case T_SortClause:
2968                         retval = _copySortClause(from);
2969                         break;
2970                 case T_GroupClause:
2971                         retval = _copyGroupClause(from);
2972                         break;
2973                 case T_CaseExpr:
2974                         retval = _copyCaseExpr(from);
2975                         break;
2976                 case T_CaseWhen:
2977                         retval = _copyCaseWhen(from);
2978                         break;
2979                 case T_NullTest:
2980                         retval = _copyNullTest(from);
2981                         break;
2982                 case T_BooleanTest:
2983                         retval = _copyBooleanTest(from);
2984                         break;
2985                 case T_FkConstraint:
2986                         retval = _copyFkConstraint(from);
2987                         break;
2988                 case T_PrivGrantee:
2989                         retval = _copyPrivGrantee(from);
2990                         break;
2991                 case T_FuncWithArgs:
2992                         retval = _copyFuncWithArgs(from);
2993                         break;
2994
2995                 default:
2996                         elog(ERROR, "copyObject: don't know how to copy node type %d",
2997                                  nodeTag(from));
2998                         retval = from;          /* keep compiler quiet */
2999                         break;
3000         }
3001         return retval;
3002 }