@@ -5014,7 +5014,7 @@ create_ordered_paths(PlannerInfo *root,
5014
5014
* presorted the path is. Additionally incremental sort may enable
5015
5015
* a cheaper startup path to win out despite higher total cost.
5016
5016
*/
5017
- if (!enable_incrementalsort )
5017
+ if (!enable_incremental_sort )
5018
5018
continue ;
5019
5019
5020
5020
/* Likewise, if the path can't be used for incremental sort. */
@@ -5095,7 +5095,7 @@ create_ordered_paths(PlannerInfo *root,
5095
5095
* sort_pathkeys because then we can't possibly have a presorted
5096
5096
* prefix of the list without having the list be fully sorted.
5097
5097
*/
5098
- if (enable_incrementalsort && list_length (root -> sort_pathkeys )> 1 )
5098
+ if (enable_incremental_sort && list_length (root -> sort_pathkeys )> 1 )
5099
5099
{
5100
5100
ListCell * lc ;
5101
5101
@@ -6572,7 +6572,7 @@ add_paths_to_grouping_rel(PlannerInfo *root, RelOptInfo *input_rel,
6572
6572
* when the path is not already sorted and when incremental sort
6573
6573
* is enabled.
6574
6574
*/
6575
- if (is_sorted || !enable_incrementalsort )
6575
+ if (is_sorted || !enable_incremental_sort )
6576
6576
continue ;
6577
6577
6578
6578
/* Restore the input path (we might have added Sort on top). */
@@ -6699,7 +6699,7 @@ add_paths_to_grouping_rel(PlannerInfo *root, RelOptInfo *input_rel,
6699
6699
* when the path is not already sorted and when incremental
6700
6700
* sort is enabled.
6701
6701
*/
6702
- if (is_sorted || !enable_incrementalsort )
6702
+ if (is_sorted || !enable_incremental_sort )
6703
6703
continue ;
6704
6704
6705
6705
/* Restore the input path (we might have added Sort on top). */
@@ -7022,7 +7022,7 @@ create_partial_grouping_paths(PlannerInfo *root,
7022
7022
* group_pathkeys because then we can't possibly have a presorted
7023
7023
* prefix of the list without having the list be fully sorted.
7024
7024
*/
7025
- if (enable_incrementalsort && list_length (root -> group_pathkeys )> 1 )
7025
+ if (enable_incremental_sort && list_length (root -> group_pathkeys )> 1 )
7026
7026
{
7027
7027
foreach (lc ,input_rel -> pathlist )
7028
7028
{
@@ -7125,7 +7125,7 @@ create_partial_grouping_paths(PlannerInfo *root,
7125
7125
* when the path is not already sorted and when incremental sort
7126
7126
* is enabled.
7127
7127
*/
7128
- if (is_sorted || !enable_incrementalsort )
7128
+ if (is_sorted || !enable_incremental_sort )
7129
7129
continue ;
7130
7130
7131
7131
/* Restore the input path (we might have added Sort on top). */
@@ -7304,7 +7304,7 @@ gather_grouping_paths(PlannerInfo *root, RelOptInfo *rel)
7304
7304
* group_pathkeys because then we can't possibly have a presorted prefix
7305
7305
* of the list without having the list be fully sorted.
7306
7306
*/
7307
- if (!enable_incrementalsort || list_length (root -> group_pathkeys )== 1 )
7307
+ if (!enable_incremental_sort || list_length (root -> group_pathkeys )== 1 )
7308
7308
return ;
7309
7309
7310
7310
/* also consider incremental sort on partial paths, if enabled */