diff options
| author | Trevor Saunders <tbsaunde+gcc@tbsaunde.org> | 2015-10-01 15:12:31 +0000 |
|---|---|---|
| committer | Trevor Saunders <tbsaunde@gcc.gnu.org> | 2015-10-01 15:12:31 +0000 |
| commit | 526ceb68361419fd9be6d629ac9838c4e88e8425 (patch) | |
| tree | 642d211297defb60131bfbbe916e43ab1da041fc /gcc/cfganal.c | |
| parent | f6f69fb09c5f81dff3b9edcd03f5107d96e10a55 (diff) | |
remove many typedefs
gcc/ChangeLog:
2015-10-01 Trevor Saunders <tbsaunde+gcc@tbsaunde.org>
* cfganal.c, compare-elim.c, coverage.c, cprop.c, df-scan.c,
function.c, read-rtl.c, statistics.c, trans-mem.c, tree-if-conv.c,
tree-into-ssa.c, tree-loop-distribution.c, tree-ssa-coalesce.c,
tree-ssa-loop-ivopts.c, tree-ssa-reassoc.c, tree-ssa-strlen.c,
tree-ssa-tail-merge.c, tree-vrp.c, var-tracking.c: Remove
unneeded typedefs.
From-SVN: r228344
Diffstat (limited to 'gcc/cfganal.c')
| -rw-r--r-- | gcc/cfganal.c | 21 |
1 files changed, 10 insertions, 11 deletions
diff --git a/gcc/cfganal.c b/gcc/cfganal.c index 3a9174c60bb..279c3b54995 100644 --- a/gcc/cfganal.c +++ b/gcc/cfganal.c @@ -29,7 +29,7 @@ along with GCC; see the file COPYING3. If not see #include "timevar.h" /* Store the data structures necessary for depth-first search. */ -struct depth_first_search_dsS { +struct depth_first_search_ds { /* stack for backtracking during the algorithm */ basic_block *stack; @@ -40,14 +40,13 @@ struct depth_first_search_dsS { /* record of basic blocks already seen by depth-first search */ sbitmap visited_blocks; }; -typedef struct depth_first_search_dsS *depth_first_search_ds; -static void flow_dfs_compute_reverse_init (depth_first_search_ds); -static void flow_dfs_compute_reverse_add_bb (depth_first_search_ds, +static void flow_dfs_compute_reverse_init (depth_first_search_ds *); +static void flow_dfs_compute_reverse_add_bb (depth_first_search_ds *, basic_block); -static basic_block flow_dfs_compute_reverse_execute (depth_first_search_ds, +static basic_block flow_dfs_compute_reverse_execute (depth_first_search_ds *, basic_block); -static void flow_dfs_compute_reverse_finish (depth_first_search_ds); +static void flow_dfs_compute_reverse_finish (depth_first_search_ds *); /* Mark the back edges in DFS traversal. Return nonzero if a loop (natural or otherwise) is present. @@ -575,7 +574,7 @@ connect_infinite_loops_to_exit (void) { basic_block unvisited_block = EXIT_BLOCK_PTR_FOR_FN (cfun); basic_block deadend_block; - struct depth_first_search_dsS dfs_ds; + depth_first_search_ds dfs_ds; /* Perform depth-first search in the reverse graph to find nodes reachable from the exit block. */ @@ -1055,7 +1054,7 @@ pre_and_rev_post_order_compute (int *pre_order, int *rev_post_order, element on the stack. */ static void -flow_dfs_compute_reverse_init (depth_first_search_ds data) +flow_dfs_compute_reverse_init (depth_first_search_ds *data) { /* Allocate stack for back-tracking up CFG. */ data->stack = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); @@ -1075,7 +1074,7 @@ flow_dfs_compute_reverse_init (depth_first_search_ds data) block. */ static void -flow_dfs_compute_reverse_add_bb (depth_first_search_ds data, basic_block bb) +flow_dfs_compute_reverse_add_bb (depth_first_search_ds *data, basic_block bb) { data->stack[data->sp++] = bb; bitmap_set_bit (data->visited_blocks, bb->index); @@ -1087,7 +1086,7 @@ flow_dfs_compute_reverse_add_bb (depth_first_search_ds data, basic_block bb) available. */ static basic_block -flow_dfs_compute_reverse_execute (depth_first_search_ds data, +flow_dfs_compute_reverse_execute (depth_first_search_ds *data, basic_block last_unvisited) { basic_block bb; @@ -1116,7 +1115,7 @@ flow_dfs_compute_reverse_execute (depth_first_search_ds data, reverse graph. */ static void -flow_dfs_compute_reverse_finish (depth_first_search_ds data) +flow_dfs_compute_reverse_finish (depth_first_search_ds *data) { free (data->stack); sbitmap_free (data->visited_blocks); |