diff options
| author | Andres Freund <andres@anarazel.de> | 2017-01-26 16:47:03 -0800 |
|---|---|---|
| committer | Andres Freund <andres@anarazel.de> | 2017-01-26 16:47:03 -0800 |
| commit | 9ba8a9ce4548bb34b7136b7463a61b2c499979a3 (patch) | |
| tree | d11a07704ed51e833683b52131bcc4d5a37eaed3 /src/backend/commands/explain.c | |
| parent | 5bcab111426e5aae659a97a66d5de4ab9fe40edf (diff) | |
| download | postgresql-9ba8a9ce4548bb34b7136b7463a61b2c499979a3.tar.gz postgresql-9ba8a9ce4548bb34b7136b7463a61b2c499979a3.zip | |
Use the new castNode() macro in a number of places.
This is far from a pervasive conversion, but it's a good starting
point.
Author: Peter Eisentraut, with some minor changes by me
Reviewed-By: Tom Lane
Discussion: https://postgr.es/m/c5d387d9-3440-f5e0-f9d4-71d53b9fbe52@2ndquadrant.com
Diffstat (limited to 'src/backend/commands/explain.c')
| -rw-r--r-- | src/backend/commands/explain.c | 16 |
1 files changed, 7 insertions, 9 deletions
diff --git a/src/backend/commands/explain.c b/src/backend/commands/explain.c index f9fb27658f7..5d61a0195ed 100644 --- a/src/backend/commands/explain.c +++ b/src/backend/commands/explain.c @@ -1493,25 +1493,25 @@ ExplainNode(PlanState *planstate, List *ancestors, planstate, es); break; case T_Agg: - show_agg_keys((AggState *) planstate, ancestors, es); + show_agg_keys(castNode(AggState, planstate), ancestors, es); show_upper_qual(plan->qual, "Filter", planstate, ancestors, es); if (plan->qual) show_instrumentation_count("Rows Removed by Filter", 1, planstate, es); break; case T_Group: - show_group_keys((GroupState *) planstate, ancestors, es); + show_group_keys(castNode(GroupState, planstate), ancestors, es); show_upper_qual(plan->qual, "Filter", planstate, ancestors, es); if (plan->qual) show_instrumentation_count("Rows Removed by Filter", 1, planstate, es); break; case T_Sort: - show_sort_keys((SortState *) planstate, ancestors, es); - show_sort_info((SortState *) planstate, es); + show_sort_keys(castNode(SortState, planstate), ancestors, es); + show_sort_info(castNode(SortState, planstate), es); break; case T_MergeAppend: - show_merge_append_keys((MergeAppendState *) planstate, + show_merge_append_keys(castNode(MergeAppendState, planstate), ancestors, es); break; case T_Result: @@ -1523,11 +1523,11 @@ ExplainNode(PlanState *planstate, List *ancestors, planstate, es); break; case T_ModifyTable: - show_modifytable_info((ModifyTableState *) planstate, ancestors, + show_modifytable_info(castNode(ModifyTableState, planstate), ancestors, es); break; case T_Hash: - show_hash_info((HashState *) planstate, es); + show_hash_info(castNode(HashState, planstate), es); break; default: break; @@ -2183,7 +2183,6 @@ show_tablesample(TableSampleClause *tsc, PlanState *planstate, static void show_sort_info(SortState *sortstate, ExplainState *es) { - Assert(IsA(sortstate, SortState)); if (es->analyze && sortstate->sort_Done && sortstate->tuplesortstate != NULL) { @@ -2217,7 +2216,6 @@ show_hash_info(HashState *hashstate, ExplainState *es) { HashJoinTable hashtable; - Assert(IsA(hashstate, HashState)); hashtable = hashstate->hashtable; if (hashtable) |