aboutsummaryrefslogtreecommitdiff
path: root/src/backend
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2019-02-22 12:23:00 -0500
committerTom Lane <tgl@sss.pgh.pa.us>2019-02-22 12:23:00 -0500
commit0fe3f6dd45c95f82bf6dcd98b4f9e029ce433ce0 (patch)
tree2377cab6689b69e9f2fde8f95f6178a79ec594d1 /src/backend
parent545928bbbf9c8c2bfa748702d40a43d6a560216b (diff)
downloadpostgresql-0fe3f6dd45c95f82bf6dcd98b4f9e029ce433ce0.tar.gz
postgresql-0fe3f6dd45c95f82bf6dcd98b4f9e029ce433ce0.zip
Fix plan created for inherited UPDATE/DELETE with all tables excluded.
In the case where inheritance_planner() finds that every table has been excluded by constraints, it thought it could get away with making a plan consisting of just a dummy Result node. While certainly there's no updating or deleting to be done, this had two user-visible problems: the plan did not report the correct set of output columns when a RETURNING clause was present, and if there were any statement-level triggers that should be fired, it didn't fire them. Hence, rather than only generating the dummy Result, we need to stick a valid ModifyTable node on top, which requires a tad more effort here. It's been broken this way for as long as inheritance_planner() has known about deleting excluded subplans at all (cf commit 635d42e9c), so back-patch to all supported branches. Amit Langote and Tom Lane, per a report from Petr Fedorov. Discussion: https://postgr.es/m/5da6f0f0-1364-1876-6978-907678f89a3e@phystech.edu
Diffstat (limited to 'src/backend')
-rw-r--r--src/backend/optimizer/plan/planner.c52
1 files changed, 35 insertions, 17 deletions
diff --git a/src/backend/optimizer/plan/planner.c b/src/backend/optimizer/plan/planner.c
index 615f1cbc01d..879220c63e4 100644
--- a/src/backend/optimizer/plan/planner.c
+++ b/src/backend/optimizer/plan/planner.c
@@ -1191,29 +1191,47 @@ inheritance_planner(PlannerInfo *root)
/* Mark result as unordered (probably unnecessary) */
root->query_pathkeys = NIL;
- /*
- * If we managed to exclude every child rel, return a dummy plan; it
- * doesn't even need a ModifyTable node.
- */
if (subplans == NIL)
{
- /* although dummy, it must have a valid tlist for executor */
+ /*
+ * We managed to exclude every child rel, so generate a dummy path
+ * representing the empty set. Although it's clear that no data will
+ * be updated or deleted, we will still need to have a ModifyTable
+ * node so that any statement triggers are executed. (This could be
+ * cleaner if we fixed nodeModifyTable.c to support zero child nodes,
+ * but that probably wouldn't be a net win.)
+ */
List *tlist;
+ Plan *subplan;
+ /* tlist processing never got done, either */
tlist = preprocess_targetlist(root);
- return (Plan *) make_result(root,
- tlist,
- (Node *) list_make1(makeBoolConst(false,
- false)),
- NULL);
- }
- /*
- * Put back the final adjusted rtable into the master copy of the Query.
- */
- parse->rtable = final_rtable;
- root->simple_rel_array_size = save_rel_array_size;
- root->simple_rel_array = save_rel_array;
+ subplan = (Plan *) make_result(root,
+ tlist,
+ (Node *) list_make1(makeBoolConst(false,
+ false)),
+ NULL);
+
+ /* These lists must be nonempty to make a valid ModifyTable node */
+ subplans = list_make1(subplan);
+ resultRelations = list_make1_int(parse->resultRelation);
+ if (parse->withCheckOptions)
+ withCheckOptionLists = list_make1(parse->withCheckOptions);
+ if (parse->returningList)
+ returningLists = list_make1(parse->returningList);
+ }
+ else
+ {
+ /*
+ * Put back the final adjusted rtable into the master copy of the
+ * Query. (We mustn't do this if we found no non-excluded children,
+ * since we never saved an adjusted rtable at all.)
+ */
+ parse->rtable = final_rtable;
+ root->simple_rel_array_size = save_rel_array_size;
+ root->simple_rel_array = save_rel_array;
+ }
/*
* If there was a FOR [KEY] UPDATE/SHARE clause, the LockRows node will