aboutsummaryrefslogtreecommitdiff
path: root/src/include/nodes/pathnodes.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/include/nodes/pathnodes.h')
-rw-r--r--src/include/nodes/pathnodes.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/include/nodes/pathnodes.h b/src/include/nodes/pathnodes.h
index 6bda383bead..09342d128d5 100644
--- a/src/include/nodes/pathnodes.h
+++ b/src/include/nodes/pathnodes.h
@@ -328,11 +328,11 @@ struct PlannerInfo
/*
* all_result_relids is empty for SELECT, otherwise it contains at least
- * parse->resultRelation. For UPDATE/DELETE across an inheritance or
- * partitioning tree, the result rel's child relids are added. When using
- * multi-level partitioning, intermediate partitioned rels are included.
- * leaf_result_relids is similar except that only actual result tables,
- * not partitioned tables, are included in it.
+ * parse->resultRelation. For UPDATE/DELETE/MERGE across an inheritance
+ * or partitioning tree, the result rel's child relids are added. When
+ * using multi-level partitioning, intermediate partitioned rels are
+ * included. leaf_result_relids is similar except that only actual result
+ * tables, not partitioned tables, are included in it.
*/
/* set of all result relids */
Relids all_result_relids;
@@ -2792,10 +2792,10 @@ typedef struct AppendRelInfo
} AppendRelInfo;
/*
- * Information about a row-identity "resjunk" column in UPDATE/DELETE.
+ * Information about a row-identity "resjunk" column in UPDATE/DELETE/MERGE.
*
- * In partitioned UPDATE/DELETE it's important for child partitions to share
- * row-identity columns whenever possible, so as not to chew up too many
+ * In partitioned UPDATE/DELETE/MERGE it's important for child partitions to
+ * share row-identity columns whenever possible, so as not to chew up too many
* targetlist columns. We use these structs to track which identity columns
* have been requested. In the finished plan, each of these will give rise
* to one resjunk entry in the targetlist of the ModifyTable's subplan node.