/* ---------------------------------------------------------------- * node file generated from /usr/local/src/postgres/src/backend/nodes/plannodes.h * * this file has been generated by the Gen_accessors.sh * and Gen_creator.sh scripts as part of the initial node * generation process. * ---------------------------------------------------------------- */ #ifdef NO_NODE_CHECKING #define NODEAssertArg(x) #else #define NODEAssertArg(x) AssertArg(x) #endif NO_NODE_CHECKING # define get_cost(node) ((node)->cost) # define set_cost(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->cost = (value); } # define get_plan_size(node) ((node)->plan_size) # define set_plan_size(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->plan_size = (value); } # define get_plan_width(node) ((node)->plan_width) # define set_plan_width(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->plan_width = (value); } # define get_plan_tupperpage(node) ((node)->plan_tupperpage) # define set_plan_tupperpage(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->plan_tupperpage = (value); } # define get_fragment(node) ((node)->fragment) # define set_fragment(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->fragment = (value); } # define get_parallel(node) ((node)->parallel) # define set_parallel(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->parallel = (value); } # define get_state(node) ((node)->state) # define set_state(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->state = (value); } # define get_qptargetlist(node) ((node)->qptargetlist) # define set_qptargetlist(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->qptargetlist = (value); } # define get_qpqual(node) ((node)->qpqual) # define set_qpqual(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->qpqual = (value); } # define get_lefttree(node) ((node)->lefttree) # define set_lefttree(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->lefttree = (value); } # define get_righttree(node) ((node)->righttree) # define set_righttree(node, value) { NODEAssertArg(IsA(node,Plan)); (node)->righttree = (value); } # define get_frag_root(node) ((node)->frag_root) # define set_frag_root(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_root = (value); } # define get_frag_parent_op(node) ((node)->frag_parent_op) # define set_frag_parent_op(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_parent_op = (value); } # define get_frag_parallel(node) ((node)->frag_parallel) # define set_frag_parallel(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_parallel = (value); } # define get_frag_subtrees(node) ((node)->frag_subtrees) # define set_frag_subtrees(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_subtrees = (value); } # define get_frag_parent_frag(node) ((node)->frag_parent_frag) # define set_frag_parent_frag(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_parent_frag = (value); } # define get_frag_parsetree(node) ((node)->frag_parsetree) # define set_frag_parsetree(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_parsetree = (value); } # define get_frag_is_inprocess(node) ((node)->frag_is_inprocess) # define set_frag_is_inprocess(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_is_inprocess = (value); } # define get_frag_iorate(node) ((node)->frag_iorate) # define set_frag_iorate(node, value) { NODEAssertArg(IsA(node,Fragment)); (node)->frag_iorate = (value); } # define get_resrellevelqual(node) ((node)->resrellevelqual) # define set_resrellevelqual(node, value) { NODEAssertArg(IsA(node,Result)); (node)->resrellevelqual = (value); } # define get_resconstantqual(node) ((node)->resconstantqual) # define set_resconstantqual(node, value) { NODEAssertArg(IsA(node,Result)); (node)->resconstantqual = (value); } # define get_resstate(node) ((node)->resstate) # define set_resstate(node, value) { NODEAssertArg(IsA(node,Result)); (node)->resstate = (value); } # define get_unionplans(node) ((node)->unionplans) # define set_unionplans(node, value) { NODEAssertArg(IsA(node,Append)); (node)->unionplans = (value); } # define get_unionrelid(node) ((node)->unionrelid) # define set_unionrelid(node, value) { NODEAssertArg(IsA(node,Append)); (node)->unionrelid = (value); } # define get_unionrtentries(node) ((node)->unionrtentries) # define set_unionrtentries(node, value) { NODEAssertArg(IsA(node,Append)); (node)->unionrtentries = (value); } # define get_unionstate(node) ((node)->unionstate) # define set_unionstate(node, value) { NODEAssertArg(IsA(node,Append)); (node)->unionstate = (value); } # define get_scanrelid(node) ((node)->scanrelid) # define set_scanrelid(node, value) { NODEAssertArg(IsA(node,Scan)); (node)->scanrelid = (value); } # define get_scanstate(node) ((node)->scanstate) # define set_scanstate(node, value) { NODEAssertArg(IsA(node,Scan)); (node)->scanstate = (value); } # define get_temprelDescs(node) ((node)->temprelDescs) # define set_temprelDescs(node, value) { NODEAssertArg(IsA(node,ScanTemps)); (node)->temprelDescs = (value); } # define get_scantempState(node) ((node)->scantempState) # define set_scantempState(node, value) { NODEAssertArg(IsA(node,ScanTemps)); (node)->scantempState = (value); } # define get_indxid(node) ((node)->indxid) # define set_indxid(node, value) { NODEAssertArg(IsA(node,IndexScan)); (node)->indxid = (value); } # define get_indxqual(node) ((node)->indxqual) # define set_indxqual(node, value) { NODEAssertArg(IsA(node,IndexScan)); (node)->indxqual = (value); } # define get_indxstate(node) ((node)->indxstate) # define set_indxstate(node, value) { NODEAssertArg(IsA(node,IndexScan)); (node)->indxstate = (value); } # define get_jri_operator(node) ((node)->jri_operator) # define set_jri_operator(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_operator = (value); } # define get_jri_inattrno(node) ((node)->jri_inattrno) # define set_jri_inattrno(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_inattrno = (value); } # define get_jri_outattrno(node) ((node)->jri_outattrno) # define set_jri_outattrno(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_outattrno = (value); } # define get_jri_lock(node) ((node)->jri_lock) # define set_jri_lock(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_lock = (value); } # define get_jri_ruleid(node) ((node)->jri_ruleid) # define set_jri_ruleid(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_ruleid = (value); } # define get_jri_stubid(node) ((node)->jri_stubid) # define set_jri_stubid(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_stubid = (value); } # define get_jri_stub(node) ((node)->jri_stub) # define set_jri_stub(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_stub = (value); } # define get_jri_stats(node) ((node)->jri_stats) # define set_jri_stats(node, value) { NODEAssertArg(IsA(node,JoinRuleInfo)); (node)->jri_stats = (value); } # define get_ruleinfo(node) ((node)->ruleinfo) # define set_ruleinfo(node, value) { NODEAssertArg(IsA(node,Join)); (node)->ruleinfo = (value); } # define get_nlstate(node) ((node)->nlstate) # define set_nlstate(node, value) { NODEAssertArg(IsA(node,NestLoop)); (node)->nlstate = (value); } # define get_nlRuleInfo(node) ((node)->nlRuleInfo) # define set_nlRuleInfo(node, value) { NODEAssertArg(IsA(node,NestLoop)); (node)->nlRuleInfo = (value); } # define get_mergeclauses(node) ((node)->mergeclauses) # define set_mergeclauses(node, value) { NODEAssertArg(IsA(node,MergeJoin)); (node)->mergeclauses = (value); } # define get_mergesortop(node) ((node)->mergesortop) # define set_mergesortop(node, value) { NODEAssertArg(IsA(node,MergeJoin)); (node)->mergesortop = (value); } # define get_mergerightorder(node) ((node)->mergerightorder) # define set_mergerightorder(node, value) { NODEAssertArg(IsA(node,MergeJoin)); (node)->mergerightorder = (value); } # define get_mergeleftorder(node) ((node)->mergeleftorder) # define set_mergeleftorder(node, value) { NODEAssertArg(IsA(node,MergeJoin)); (node)->mergeleftorder = (value); } # define get_mergestate(node) ((node)->mergestate) # define set_mergestate(node, value) { NODEAssertArg(IsA(node,MergeJoin)); (node)->mergestate = (value); } # define get_hashclauses(node) ((node)->hashclauses) # define set_hashclauses(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashclauses = (value); } # define get_hashjoinop(node) ((node)->hashjoinop) # define set_hashjoinop(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashjoinop = (value); } # define get_hashjoinstate(node) ((node)->hashjoinstate) # define set_hashjoinstate(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashjoinstate = (value); } # define get_hashjointable(node) ((node)->hashjointable) # define set_hashjointable(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashjointable = (value); } # define get_hashjointablekey(node) ((node)->hashjointablekey) # define set_hashjointablekey(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashjointablekey = (value); } # define get_hashjointablesize(node) ((node)->hashjointablesize) # define set_hashjointablesize(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashjointablesize = (value); } # define get_hashdone(node) ((node)->hashdone) # define set_hashdone(node, value) { NODEAssertArg(IsA(node,HashJoin)); (node)->hashdone = (value); } # define get_tempid(node) ((node)->tempid) # define set_tempid(node, value) { NODEAssertArg(IsA(node,Temp)); (node)->tempid = (value); } # define get_keycount(node) ((node)->keycount) # define set_keycount(node, value) { NODEAssertArg(IsA(node,Temp)); (node)->keycount = (value); } # define get_matstate(node) ((node)->matstate) # define set_matstate(node, value) { NODEAssertArg(IsA(node,Material)); (node)->matstate = (value); } # define get_sortstate(node) ((node)->sortstate) # define set_sortstate(node, value) { NODEAssertArg(IsA(node,Sort)); (node)->sortstate = (value); } # define get_aggname(node) ((node)->aggname) # define set_aggname(node, value) { NODEAssertArg(IsA(node,Agg)); (node)->aggname = (value); } # define get_aggstate(node) ((node)->aggstate) # define set_aggstate(node, value) { NODEAssertArg(IsA(node,Agg)); (node)->aggstate = (value); } # define get_uniquestate(node) ((node)->uniquestate) # define set_uniquestate(node, value) { NODEAssertArg(IsA(node,Unique)); (node)->uniquestate = (value); } # define get_hashkey(node) ((node)->hashkey) # define set_hashkey(node, value) { NODEAssertArg(IsA(node,Hash)); (node)->hashkey = (value); } # define get_hashstate(node) ((node)->hashstate) # define set_hashstate(node, value) { NODEAssertArg(IsA(node,Hash)); (node)->hashstate = (value); } # define get_hashtable(node) ((node)->hashtable) # define set_hashtable(node, value) { NODEAssertArg(IsA(node,Hash)); (node)->hashtable = (value); } # define get_hashtablekey(node) ((node)->hashtablekey) # define set_hashtablekey(node, value) { NODEAssertArg(IsA(node,Hash)); (node)->hashtablekey = (value); } # define get_hashtablesize(node) ((node)->hashtablesize) # define set_hashtablesize(node, value) { NODEAssertArg(IsA(node,Hash)); (node)->hashtablesize = (value); } # define get_chooseplanlist(node) ((node)->chooseplanlist) # define set_chooseplanlist(node, value) { NODEAssertArg(IsA(node,Choose)); (node)->chooseplanlist = (value); }