diff options
author | Martin Liska <mliska@suse.cz> | 2022-01-25 19:16:06 +0100 |
---|---|---|
committer | Martin Liska <mliska@suse.cz> | 2022-06-20 11:11:38 +0200 |
commit | 9f55aee9dca759da84afd4563ff72d3ca8ab8a1c (patch) | |
tree | 7414224cafb6e6aed06e7664cfaa3528017aa8d3 /gcc/bb-reorder.cc | |
parent | 970b03c0037549a571ecea9afa41de78eb859b3a (diff) | |
download | gcc-9f55aee9dca759da84afd4563ff72d3ca8ab8a1c.zip gcc-9f55aee9dca759da84afd4563ff72d3ca8ab8a1c.tar.gz gcc-9f55aee9dca759da84afd4563ff72d3ca8ab8a1c.tar.bz2 |
Add operators / and * for profile_{count,probability}.
gcc/ChangeLog:
* bb-reorder.cc (find_traces_1_round): Add operators / and * and
use them.
(better_edge_p): Likewise.
* cfgloop.cc (find_subloop_latch_edge_by_profile): Likewise.
* cfgloopmanip.cc (scale_loop_profile): Likewise.
* cfgrtl.cc (force_nonfallthru_and_redirect): Likewise.
* cgraph.cc (cgraph_edge::maybe_hot_p): Likewise.
* config/sh/sh.cc (expand_cbranchdi4): Likewise.
* dojump.cc (do_compare_rtx_and_jump): Likewise.
* final.cc (compute_alignments): Likewise.
* ipa-cp.cc (update_counts_for_self_gen_clones): Likewise.
(decide_about_value): Likewise.
* ipa-inline-analysis.cc (do_estimate_edge_time): Likewise.
* loop-unroll.cc (unroll_loop_runtime_iterations): Likewise.
* modulo-sched.cc (sms_schedule): Likewise.
* omp-expand.cc (extract_omp_for_update_vars): Likewise.
(expand_omp_ordered_sink): Likewise.
(expand_omp_for_ordered_loops): Likewise.
(expand_omp_for_static_nochunk): Likewise.
* predict.cc (maybe_hot_count_p): Likewise.
(probably_never_executed): Likewise.
(set_even_probabilities): Likewise.
(handle_missing_profiles): Likewise.
(expensive_function_p): Likewise.
* profile-count.h: Likewise.
* profile.cc (compute_branch_probabilities): Likewise.
* stmt.cc (emit_case_dispatch_table): Likewise.
* symtab-thunks.cc (expand_thunk): Likewise.
* tree-ssa-loop-manip.cc (tree_transform_and_unroll_loop): Likewise.
* tree-ssa-sink.cc (select_best_block): Likewise.
* tree-switch-conversion.cc (switch_decision_tree::analyze_switch_statement): Likewise.
(switch_decision_tree::balance_case_nodes): Likewise.
(switch_decision_tree::emit_case_nodes): Likewise.
* tree-vect-loop.cc (scale_profile_for_vect_loop): Likewise.
Diffstat (limited to 'gcc/bb-reorder.cc')
-rw-r--r-- | gcc/bb-reorder.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/bb-reorder.cc b/gcc/bb-reorder.cc index d20ccb8..6600f44 100644 --- a/gcc/bb-reorder.cc +++ b/gcc/bb-reorder.cc @@ -761,7 +761,7 @@ find_traces_1_round (int branch_th, profile_count count_th, & EDGE_CAN_FALLTHRU) && !(single_succ_edge (e->dest)->flags & EDGE_COMPLEX) && single_succ (e->dest) == best_edge->dest - && (e->dest->count.apply_scale (2, 1) + && (e->dest->count * 2 >= best_edge->count () || for_size)) { best_edge = e; @@ -944,7 +944,7 @@ better_edge_p (const_basic_block bb, const_edge e, profile_probability prob, /* The BEST_* values do not have to be best, but can be a bit smaller than maximum values. */ - profile_probability diff_prob = best_prob.apply_scale (1, 10); + profile_probability diff_prob = best_prob / 10; /* The smaller one is better to keep the original order. */ if (optimize_function_for_size_p (cfun)) @@ -966,7 +966,7 @@ better_edge_p (const_basic_block bb, const_edge e, profile_probability prob, is_better_edge = false; else { - profile_count diff_count = best_count.apply_scale (1, 10); + profile_count diff_count = best_count / 10; if (count < best_count - diff_count || (!best_count.initialized_p () && count.nonzero_p ())) |