@@ -1644,6 +1644,7 @@ create_unique_plan(PlannerInfo *root, UniquePath *best_path, int flags)
1644
1644
NIL ,
1645
1645
NIL ,
1646
1646
best_path -> path .rows ,
1647
+ 0 ,
1647
1648
subplan );
1648
1649
}
1649
1650
else
@@ -2096,6 +2097,7 @@ create_agg_plan(PlannerInfo *root, AggPath *best_path)
2096
2097
NIL ,
2097
2098
NIL ,
2098
2099
best_path -> numGroups ,
2100
+ best_path -> transitionSpace ,
2099
2101
subplan );
2100
2102
2101
2103
copy_generic_path_info (& plan -> plan , (Path * ) best_path );
@@ -2257,6 +2259,7 @@ create_groupingsets_plan(PlannerInfo *root, GroupingSetsPath *best_path)
2257
2259
rollup -> gsets ,
2258
2260
NIL ,
2259
2261
rollup -> numGroups ,
2262
+ best_path -> transitionSpace ,
2260
2263
sort_plan );
2261
2264
2262
2265
/*
@@ -2295,6 +2298,7 @@ create_groupingsets_plan(PlannerInfo *root, GroupingSetsPath *best_path)
2295
2298
rollup -> gsets ,
2296
2299
chain ,
2297
2300
rollup -> numGroups ,
2301
+ best_path -> transitionSpace ,
2298
2302
subplan );
2299
2303
2300
2304
/* Copy cost data from Path to Plan */
@@ -6192,8 +6196,8 @@ Agg *
6192
6196
make_agg (List * tlist , List * qual ,
6193
6197
AggStrategy aggstrategy , AggSplit aggsplit ,
6194
6198
int numGroupCols , AttrNumber * grpColIdx , Oid * grpOperators , Oid * grpCollations ,
6195
- List * groupingSets , List * chain ,
6196
- double dNumGroups , Plan * lefttree )
6199
+ List * groupingSets , List * chain , double dNumGroups ,
6200
+ Size transitionSpace , Plan * lefttree )
6197
6201
{
6198
6202
Agg * node = makeNode (Agg );
6199
6203
Plan * plan = & node -> plan ;
@@ -6209,6 +6213,7 @@ make_agg(List *tlist, List *qual,
6209
6213
node -> grpOperators = grpOperators ;
6210
6214
node -> grpCollations = grpCollations ;
6211
6215
node -> numGroups = numGroups ;
6216
+ node -> transitionSpace = transitionSpace ;
6212
6217
node -> aggParams = NULL ; /* SS_finalize_plan() will fill this */
6213
6218
node -> groupingSets = groupingSets ;
6214
6219
node -> chain = chain ;
0 commit comments