diff options
Diffstat (limited to 'gcc/tracer.c')
| -rw-r--r-- | gcc/tracer.c | 41 |
1 files changed, 17 insertions, 24 deletions
diff --git a/gcc/tracer.c b/gcc/tracer.c index a0164ddfcfc..eb311b9c7ef 100644 --- a/gcc/tracer.c +++ b/gcc/tracer.c @@ -48,14 +48,14 @@ #include "params.h" #include "coverage.h" -static int count_insns PARAMS ((basic_block)); -static bool ignore_bb_p PARAMS ((basic_block)); -static bool better_p PARAMS ((edge, edge)); -static edge find_best_successor PARAMS ((basic_block)); -static edge find_best_predecessor PARAMS ((basic_block)); -static int find_trace PARAMS ((basic_block, basic_block *)); -static void tail_duplicate PARAMS ((void)); -static void layout_superblocks PARAMS ((void)); +static int count_insns (basic_block); +static bool ignore_bb_p (basic_block); +static bool better_p (edge, edge); +static edge find_best_successor (basic_block); +static edge find_best_predecessor (basic_block); +static int find_trace (basic_block, basic_block *); +static void tail_duplicate (void); +static void layout_superblocks (void); /* Minimal outgoing edge probability considered for superblock formation. */ static int probability_cutoff; @@ -68,8 +68,7 @@ static int branch_ratio_cutoff; /* Return true if we should ignore the basic block for purposes of tracing. */ static bool -ignore_bb_p (bb) - basic_block bb; +ignore_bb_p (basic_block bb) { if (bb->index < 0) return true; @@ -81,8 +80,7 @@ ignore_bb_p (bb) /* Return number of instructions in the block. */ static int -count_insns (bb) - basic_block bb; +count_insns (basic_block bb) { rtx insn; int n = 0; @@ -95,8 +93,7 @@ count_insns (bb) /* Return true if E1 is more frequent than E2. */ static bool -better_p (e1, e2) - edge e1, e2; +better_p (edge e1, edge e2) { if (e1->count != e2->count) return e1->count > e2->count; @@ -114,8 +111,7 @@ better_p (e1, e2) /* Return most frequent successor of basic block BB. */ static edge -find_best_successor (bb) - basic_block bb; +find_best_successor (basic_block bb) { edge e; edge best = NULL; @@ -133,8 +129,7 @@ find_best_successor (bb) /* Return most frequent predecessor of basic block BB. */ static edge -find_best_predecessor (bb) - basic_block bb; +find_best_predecessor (basic_block bb) { edge e; edge best = NULL; @@ -154,9 +149,7 @@ find_best_predecessor (bb) Return number of basic blocks recorded. */ static int -find_trace (bb, trace) - basic_block bb; - basic_block *trace; +find_trace (basic_block bb, basic_block *trace) { int i = 0; edge e; @@ -198,7 +191,7 @@ find_trace (bb, trace) if profitable. */ static void -tail_duplicate () +tail_duplicate (void) { fibnode_t *blocks = xcalloc (last_basic_block, sizeof (fibnode_t)); basic_block *trace = xmalloc (sizeof (basic_block) * n_basic_blocks); @@ -322,7 +315,7 @@ tail_duplicate () change though. */ static void -layout_superblocks () +layout_superblocks (void) { basic_block end = ENTRY_BLOCK_PTR->succ->dest; basic_block bb = ENTRY_BLOCK_PTR->succ->dest->next_bb; @@ -361,7 +354,7 @@ layout_superblocks () /* Main entry point to this file. */ void -tracer () +tracer (void) { if (n_basic_blocks <= 1) return; |