mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-21 00:21:03 +08:00
Code Issues Packages Projects Releases Wiki Activity

tree-ssa-reassoc.c (fini_reassoc): Use the statistics infrastructure.

Browse Source 
2008-05-20  Richard Guenther  <rguenther@suse.de>

	* tree-ssa-reassoc.c (fini_reassoc): Use the statistics
	infrastructure.
	* tree-ssa-sccvn.c (process_scc): Likewise.
	* tree-ssa-sink.c (execute_sink_code): Likewise.
	* tree-ssa-threadupdate.c (thread_through_all_blocks): Likewise.
	* tree-vrp.c (process_assert_insertions): Likewise.
	* tree-ssa-dce.c (eliminate_unnecessary_stmts): Likewise.
	(perform_tree_ssa_dce): Likewise.
	* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
	(dump_dominator_optimization_stats): Likewise.
	* tree-vectorizer.c (vectorize_loops): Likewise.

	* gcc.dg/tree-ssa/ssa-sink-1.c: Adjust.
	* gcc.dg/tree-ssa/ssa-sink-2.c: Likewise.
	* gcc.dg/tree-ssa/ssa-sink-3.c: Likewise.
	* gcc.dg/tree-ssa/ssa-sink-4.c: Likewise.

From-SVN: r135611
This commit is contained in:
Richard Guenther 2008-05-20 12:34:06 +00:00 committed by Richard Biener
parent e13a4010af
commit 0190265374
14 changed files with 61 additions and 55 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
gcc/ChangeLog
View File

@ -1,3 +1,17 @@
2008-05-20 Richard Guenther <rguenther@suse.de>
* tree-ssa-reassoc.c (fini_reassoc): Use the statistics
infrastructure.
* tree-ssa-sccvn.c (process_scc): Likewise.
* tree-ssa-sink.c (execute_sink_code): Likewise.
* tree-ssa-threadupdate.c (thread_through_all_blocks): Likewise.
* tree-vrp.c (process_assert_insertions): Likewise.
* tree-ssa-dce.c (eliminate_unnecessary_stmts): Likewise.
(perform_tree_ssa_dce): Likewise.
* tree-ssa-dom.c (tree_ssa_dominator_optimize): Likewise.
(dump_dominator_optimization_stats): Likewise.
* tree-vectorizer.c (vectorize_loops): Likewise.
2008-05-20 Richard Guenther <rguenther@suse.de>
* tree-vn.c (vn_lookup_with_vuses): Do not use the alias oracle.

7
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,10 @@
2008-05-20 Richard Guenther <rguenther@suse.de>
* gcc.dg/tree-ssa/ssa-sink-1.c: Adjust.
* gcc.dg/tree-ssa/ssa-sink-2.c: Likewise.
* gcc.dg/tree-ssa/ssa-sink-3.c: Likewise.
* gcc.dg/tree-ssa/ssa-sink-4.c: Likewise.
2008-05-20 Sandra Loosemore <sandra@codesourcery.com>
* gcc.c-torture/compile/20061214-1.c: New test.

2
gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-1.c
View File

@ -7,5 +7,5 @@ foo (int a, int b, int c)
return c ? x : a;
}
/* We should sink the x = a * b calculation into the branch that returns x. */
/* { dg-final { scan-tree-dump-times "Sunk statements:1" 1 "sink" } } */
/* { dg-final { scan-tree-dump-times "Sunk statements: 1" 1 "sink" } } */
/* { dg-final { cleanup-tree-dump "sink" } } */

2
gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-2.c
View File

@ -9,5 +9,5 @@ bar (int a, int b, int c)
return y;
}
/* We should sink the x = a * b calculation into the else branch */
/* { dg-final { scan-tree-dump-times "Sunk statements:1" 1 "sink" } } */
/* { dg-final { scan-tree-dump-times "Sunk statements: 1" 1 "sink" } } */
/* { dg-final { cleanup-tree-dump "sink" } } */

2
gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-3.c
View File

@ -12,5 +12,5 @@ main (int argc)
}
}
/* We should sink the a = argc + 1 calculation into the if branch */
/* { dg-final { scan-tree-dump-times "Sunk statements:1" 1 "sink" } } */
/* { dg-final { scan-tree-dump-times "Sunk statements: 1" 1 "sink" } } */
/* { dg-final { cleanup-tree-dump "sink" } } */

2
gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-4.c
View File

@ -17,5 +17,5 @@ main (int argc)
foo2 (a);
}
/* We should sink the first a = b + c calculation into the else branch */
/* { dg-final { scan-tree-dump-times "Sunk statements:1" 1 "sink" } } */
/* { dg-final { scan-tree-dump-times "Sunk statements: 1" 1 "sink" } } */
/* { dg-final { cleanup-tree-dump "sink" } } */

28
gcc/tree-ssa-dce.c
View File

@ -735,22 +735,19 @@ eliminate_unnecessary_stmts (void)
static void
print_stats (void)
{
if (dump_file && (dump_flags & (TDF_STATS|TDF_DETAILS)))
{
float percg;
float percg;
percg = ((float) stats.removed / (float) stats.total) * 100;
fprintf (dump_file, "Removed %d of %d statements (%d%%)\n",
stats.removed, stats.total, (int) percg);
percg = ((float) stats.removed / (float) stats.total) * 100;
fprintf (dump_file, "Removed %d of %d statements (%d%%)\n",
stats.removed, stats.total, (int) percg);
if (stats.total_phis == 0)
percg = 0;
else
percg = ((float) stats.removed_phis / (float) stats.total_phis) * 100;
if (stats.total_phis == 0)
percg = 0;
else
percg = ((float) stats.removed_phis / (float) stats.total_phis) * 100;
fprintf (dump_file, "Removed %d of %d PHI nodes (%d%%)\n",
stats.removed_phis, stats.total_phis, (int) percg);
}
fprintf (dump_file, "Removed %d of %d PHI nodes (%d%%)\n",
stats.removed_phis, stats.total_phis, (int) percg);
}
/* Initialization for this pass. Set up the used data structures. */
@ -854,8 +851,11 @@ perform_tree_ssa_dce (bool aggressive)
if (cfg_altered)
free_dominance_info (CDI_DOMINATORS);
statistics_counter_event (cfun, "Statements deleted", stats.removed);
statistics_counter_event (cfun, "PHI nodes deleted", stats.removed_phis);
/* Debugging dumps. */
if (dump_file)
if (dump_file && (dump_flags & (TDF_STATS|TDF_DETAILS)))
print_stats ();
tree_dce_done (aggressive);

21
gcc/tree-ssa-dom.c
View File

@ -357,6 +357,13 @@ tree_ssa_dominator_optimize (void)
SSA_NAME_VALUE (name) = NULL;
}
statistics_counter_event (cfun, "Redundant expressions eliminated",
opt_stats.num_re);
statistics_counter_event (cfun, "Constants propagated",
opt_stats.num_const_prop);
statistics_counter_event (cfun, "Copies propagated",
opt_stats.num_copy_prop);
/* Debugging dumps. */
if (dump_file && (dump_flags & TDF_STATS))
dump_dominator_optimization_stats (dump_file);
@ -868,25 +875,11 @@ record_equivalences_from_incoming_edge (basic_block bb)
void
dump_dominator_optimization_stats (FILE *file)
{
long n_exprs;
fprintf (file, "Total number of statements: %6ld\n\n",
opt_stats.num_stmts);
fprintf (file, "Exprs considered for dominator optimizations: %6ld\n",
opt_stats.num_exprs_considered);
n_exprs = opt_stats.num_exprs_considered;
if (n_exprs == 0)
n_exprs = 1;
fprintf (file, " Redundant expressions eliminated: %6ld (%.0f%%)\n",
opt_stats.num_re, PERCENT (opt_stats.num_re,
n_exprs));
fprintf (file, " Constants propagated: %6ld\n",
opt_stats.num_const_prop);
fprintf (file, " Copies propagated: %6ld\n",
opt_stats.num_copy_prop);
fprintf (file, "\nHash table statistics:\n");
fprintf (file, " avail_exprs: ");

20
gcc/tree-ssa-reassoc.c
View File

@ -1487,18 +1487,14 @@ init_reassoc (void)
static void
fini_reassoc (void)
{
if (dump_file && (dump_flags & TDF_STATS))
{
fprintf (dump_file, "Reassociation stats:\n");
fprintf (dump_file, "Linearized: %d\n",
reassociate_stats.linearized);
fprintf (dump_file, "Constants eliminated: %d\n",
reassociate_stats.constants_eliminated);
fprintf (dump_file, "Ops eliminated: %d\n",
reassociate_stats.ops_eliminated);
fprintf (dump_file, "Statements rewritten: %d\n",
reassociate_stats.rewritten);
}
statistics_counter_event (cfun, "Linearized",
reassociate_stats.linearized);
statistics_counter_event (cfun, "Constants eliminated",
reassociate_stats.constants_eliminated);
statistics_counter_event (cfun, "Ops eliminated",
reassociate_stats.ops_eliminated);
statistics_counter_event (cfun, "Statements rewritten",
reassociate_stats.rewritten);
pointer_map_destroy (operand_rank);
free_alloc_pool (operand_entry_pool);

4
gcc/tree-ssa-sccvn.c
View File

@ -1947,9 +1947,7 @@ process_scc (VEC (tree, heap) *scc)
changed |= visit_use (var);
}
if (dump_file && (dump_flags & TDF_STATS))
fprintf (dump_file, "Processing SCC required %d iterations\n",
iterations);
statistics_histogram_event (cfun, "SCC iterations", iterations);
/* Finally, visit the SCC once using the valid table. */
current_info = valid_info;

3
gcc/tree-ssa-sink.c
View File

@ -546,8 +546,7 @@ execute_sink_code (void)
calculate_dominance_info (CDI_DOMINATORS);
calculate_dominance_info (CDI_POST_DOMINATORS);
sink_code_in_bb (EXIT_BLOCK_PTR);
if (dump_file && (dump_flags & TDF_STATS))
fprintf (dump_file, "Sunk statements:%d\n", sink_stats.sunk);
statistics_counter_event (cfun, "Sunk statements", sink_stats.sunk);
free_dominance_info (CDI_POST_DOMINATORS);
remove_fake_exit_edges ();
loop_optimizer_finalize ();

5
gcc/tree-ssa-threadupdate.c
View File

@ -1069,9 +1069,8 @@ thread_through_all_blocks (bool may_peel_loop_headers)
retval |= thread_through_loop_header (loop, may_peel_loop_headers);
}
if (dump_file && (dump_flags & TDF_STATS))
fprintf (dump_file, "\nJumps threaded: %lu\n",
thread_stats.num_threaded_edges);
statistics_counter_event (cfun, "Jumps threaded",
thread_stats.num_threaded_edges);
free_original_copy_tables ();

1
gcc/tree-vectorizer.c
View File

@ -2691,6 +2691,7 @@ vectorize_loops (void)
}
vect_loop_location = UNKNOWN_LOC;
statistics_counter_event (cfun, "Vectorized loops", num_vectorized_loops);
if (vect_print_dump_info (REPORT_UNVECTORIZED_LOOPS)
|| (vect_print_dump_info (REPORT_VECTORIZED_LOOPS)
&& num_vectorized_loops > 0))

5
gcc/tree-vrp.c
View File

@ -4540,9 +4540,8 @@ process_assert_insertions (void)
if (update_edges_p)
bsi_commit_edge_inserts ();
if (dump_file && (dump_flags & TDF_STATS))
fprintf (dump_file, "\nNumber of ASSERT_EXPR expressions inserted: %d\n\n",
num_asserts);
statistics_counter_event (cfun, "Number of ASSERT_EXPR expressions inserted",
num_asserts);
}