diff options
Diffstat (limited to 'src/backend/optimizer/path/pathkeys.c')
| -rw-r--r-- | src/backend/optimizer/path/pathkeys.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/src/backend/optimizer/path/pathkeys.c b/src/backend/optimizer/path/pathkeys.c index 02e46a6eaaf..0a25b6384bb 100644 --- a/src/backend/optimizer/path/pathkeys.c +++ b/src/backend/optimizer/path/pathkeys.c @@ -450,7 +450,7 @@ group_keys_reorder_by_pathkeys(List *pathkeys, List **group_pathkeys, /* * pathkeys_are_duplicate * Check if give pathkeys are already contained the list of - * PathKeyInfo's. + * GroupByOrdering's. */ static bool pathkeys_are_duplicate(List *infos, List *pathkeys) @@ -459,7 +459,7 @@ pathkeys_are_duplicate(List *infos, List *pathkeys) foreach(lc, infos) { - PathKeyInfo *info = lfirst_node(PathKeyInfo, lc); + GroupByOrdering *info = lfirst_node(GroupByOrdering, lc); if (compare_pathkeys(pathkeys, info->pathkeys) == PATHKEYS_EQUAL) return true; @@ -471,7 +471,7 @@ pathkeys_are_duplicate(List *infos, List *pathkeys) * get_useful_group_keys_orderings * Determine which orderings of GROUP BY keys are potentially interesting. * - * Returns a list of PathKeyInfo items, each representing an interesting + * Returns a list of GroupByOrdering items, each representing an interesting * ordering of GROUP BY keys. Each item stores pathkeys and clauses in the * matching order. * @@ -486,13 +486,13 @@ get_useful_group_keys_orderings(PlannerInfo *root, Path *path) { Query *parse = root->parse; List *infos = NIL; - PathKeyInfo *info; + GroupByOrdering *info; List *pathkeys = root->group_pathkeys; List *clauses = root->processed_groupClause; /* always return at least the original pathkeys/clauses */ - info = makeNode(PathKeyInfo); + info = makeNode(GroupByOrdering); info->pathkeys = pathkeys; info->clauses = clauses; infos = lappend(infos, info); @@ -528,7 +528,7 @@ get_useful_group_keys_orderings(PlannerInfo *root, Path *path) (enable_incremental_sort || n == root->num_groupby_pathkeys) && !pathkeys_are_duplicate(infos, pathkeys)) { - info = makeNode(PathKeyInfo); + info = makeNode(GroupByOrdering); info->pathkeys = pathkeys; info->clauses = clauses; @@ -553,7 +553,7 @@ get_useful_group_keys_orderings(PlannerInfo *root, Path *path) (enable_incremental_sort || n == list_length(root->sort_pathkeys)) && !pathkeys_are_duplicate(infos, pathkeys)) { - info = makeNode(PathKeyInfo); + info = makeNode(GroupByOrdering); info->pathkeys = pathkeys; info->clauses = clauses; @@ -563,7 +563,7 @@ get_useful_group_keys_orderings(PlannerInfo *root, Path *path) #ifdef USE_ASSERT_CHECKING { - PathKeyInfo *pinfo = linitial_node(PathKeyInfo, infos); + GroupByOrdering *pinfo = linitial_node(GroupByOrdering, infos); ListCell *lc; /* Test consistency of info structures */ @@ -572,7 +572,7 @@ get_useful_group_keys_orderings(PlannerInfo *root, Path *path) ListCell *lc1, *lc2; - info = lfirst_node(PathKeyInfo, lc); + info = lfirst_node(GroupByOrdering, lc); Assert(list_length(info->clauses) == list_length(pinfo->clauses)); Assert(list_length(info->pathkeys) == list_length(pinfo->pathkeys)); |