Home
last modified time | relevance | path

Searched refs:REG_BR_PROB_BASE (Results 1 – 25 of 92) sorted by relevance

1234

/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-optimize.c252 * REG_BR_PROB_BASE + ENTRY_BLOCK_PTR->count / 2) in execute_fixup_cfg()
255 count_scale = REG_BR_PROB_BASE; in execute_fixup_cfg()
259 + REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE; in execute_fixup_cfg()
263 + REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE; in execute_fixup_cfg()
268 + REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE; in execute_fixup_cfg()
302 + REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE; in execute_fixup_cfg()
304 if (count_scale != REG_BR_PROB_BASE) in execute_fixup_cfg()
H A Dcfgloopmanip.c669 prob = REG_BR_PROB_BASE / 2; in create_empty_loop_on_edge()
671 scale_loop_frequencies (loop, REG_BR_PROB_BASE - prob, REG_BR_PROB_BASE); in create_empty_loop_on_edge()
1064 && REG_BR_PROB_BASE - orig->probability != 0) in duplicate_loop_to_header_edge()
1068 scale_after_exit = RDIV (REG_BR_PROB_BASE * REG_BR_PROB_BASE, in duplicate_loop_to_header_edge()
1069 REG_BR_PROB_BASE - orig->probability); in duplicate_loop_to_header_edge()
1113 scale_main = REG_BR_PROB_BASE; in duplicate_loop_to_header_edge()
1119 scale_main = RDIV (REG_BR_PROB_BASE * REG_BR_PROB_BASE, scale_main); in duplicate_loop_to_header_edge()
1124 scale_main = REG_BR_PROB_BASE; in duplicate_loop_to_header_edge()
1230 REG_BR_PROB_BASE); in duplicate_loop_to_header_edge()
1266 REG_BR_PROB_BASE); in duplicate_loop_to_header_edge()
[all …]
H A Dpredict.c73 #define PROB_EVEN (REG_BR_PROB_BASE / 2)
75 #define PROB_ALWAYS (REG_BR_PROB_BASE)
357 || (REG_BR_PROB_BASE - e->probability in predictable_edge_p()
728 * (REG_BR_PROB_BASE - probability)); in combine_predictions_for_insn()
733 combined_probability = REG_BR_PROB_BASE / 2; in combine_predictions_for_insn()
736 * REG_BR_PROB_BASE / d + 0.5); in combine_predictions_for_insn()
787 = REG_BR_PROB_BASE - combined_probability; in combine_predictions_for_insn()
879 (probability2 < REG_BR_PROB_BASE / 2)) in combine_predictions_for_bb()
893 * (REG_BR_PROB_BASE - probability)); in combine_predictions_for_bb()
902 * REG_BR_PROB_BASE / d + 0.5); in combine_predictions_for_bb()
[all …]
H A Dcfg.c351 e->probability = REG_BR_PROB_BASE; in make_single_succ_edge()
402 if (s->probability > REG_BR_PROB_BASE) in redirect_edge_succ_nodup()
403 s->probability = REG_BR_PROB_BASE; in redirect_edge_succ_nodup()
462 sum * 100.0 / REG_BR_PROB_BASE); in check_bb_profile()
1002 prob = REG_BR_PROB_BASE - prob; in update_bb_profile_for_threading()
1012 EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE; in update_bb_profile_for_threading()
1018 else if (prob != REG_BR_PROB_BASE) in update_bb_profile_for_threading()
1020 int scale = RDIV (65536 * REG_BR_PROB_BASE, prob); in update_bb_profile_for_threading()
1026 c->probability = REG_BR_PROB_BASE; in update_bb_profile_for_threading()
1030 if (c->probability > REG_BR_PROB_BASE) in update_bb_profile_for_threading()
[all …]
H A Dvalue-prof.c623 e13->probability = REG_BR_PROB_BASE - prob; in gimple_divmod_fixed_value()
629 e24->probability = REG_BR_PROB_BASE; in gimple_divmod_fixed_value()
632 e34->probability = REG_BR_PROB_BASE; in gimple_divmod_fixed_value()
788 e24->probability = REG_BR_PROB_BASE; in gimple_mod_pow2()
791 e34->probability = REG_BR_PROB_BASE; in gimple_mod_pow2()
960 e34->probability = REG_BR_PROB_BASE; in gimple_mod_subtract()
1203 e_ij->probability = REG_BR_PROB_BASE; in gimple_ic()
1231 e_dj->probability = REG_BR_PROB_BASE; in gimple_ic()
1236 e_ij->probability = REG_BR_PROB_BASE; in gimple_ic()
1465 e_ij->probability = REG_BR_PROB_BASE; in gimple_stringop_fixed_value()
[all …]
H A Dcfgbuild.c556 e->count = ((b->count * probability + REG_BR_PROB_BASE / 2) in compute_outgoing_frequencies()
557 / REG_BR_PROB_BASE); in compute_outgoing_frequencies()
559 f->probability = REG_BR_PROB_BASE - probability; in compute_outgoing_frequencies()
568 e->probability = REG_BR_PROB_BASE; in compute_outgoing_frequencies()
575 e->count = ((b->count * e->probability + REG_BR_PROB_BASE / 2) in compute_outgoing_frequencies()
576 / REG_BR_PROB_BASE); in compute_outgoing_frequencies()
H A Dipa-inline-analysis.c456 return REG_BR_PROB_BASE; in predicate_probability()
474 return REG_BR_PROB_BASE; in predicate_probability()
497 this_prob = REG_BR_PROB_BASE; in predicate_probability()
1798 return REG_BR_PROB_BASE; in param_change_prob()
1811 return REG_BR_PROB_BASE; in param_change_prob()
1826 return REG_BR_PROB_BASE; in param_change_prob()
1835 return REG_BR_PROB_BASE; in param_change_prob()
1854 return REG_BR_PROB_BASE; in param_change_prob()
1856 return REG_BR_PROB_BASE; in param_change_prob()
2528 / REG_BR_PROB_BASE); in remap_edge_change_prob()
[all …]
H A Dtree-ssa-loop-manip.c910 prob_entry = REG_BR_PROB_BASE; in tree_transform_and_unroll_loop()
912 prob_entry = PROB_UNROLLED_LOOP_ENTERED * REG_BR_PROB_BASE / 100; in tree_transform_and_unroll_loop()
927 scale_rest = REG_BR_PROB_BASE; in tree_transform_and_unroll_loop()
961 REG_BR_PROB_BASE, in tree_transform_and_unroll_loop()
962 REG_BR_PROB_BASE - exit->probability); in tree_transform_and_unroll_loop()
979 new_nonexit->probability = REG_BR_PROB_BASE - exit->probability; in tree_transform_and_unroll_loop()
985 REG_BR_PROB_BASE); in tree_transform_and_unroll_loop()
1071 new_exit->probability = REG_BR_PROB_BASE / (new_est_niter + 1); in tree_transform_and_unroll_loop()
1078 new_nonexit->probability = REG_BR_PROB_BASE - new_exit->probability; in tree_transform_and_unroll_loop()
H A Dtracer.c176 if (EDGE_FREQUENCY (best) * REG_BR_PROB_BASE in find_best_predecessor()
250 probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff; in tail_duplicate()
253 (REG_BR_PROB_BASE / 100 * PARAM_VALUE (TRACER_MIN_BRANCH_RATIO)); in tail_duplicate()
H A Dloop-unswitch.c433 e->count = latch_edge->count * prob / REG_BR_PROB_BASE; in unswitch_loop()
436 e->count = latch_edge->count * (false_edge->probability) / REG_BR_PROB_BASE; in unswitch_loop()
455 prob, REG_BR_PROB_BASE - prob); in unswitch_loop()
H A Dlto-cgraph.c1380 if (max_runs > INT_MAX / REG_BR_PROB_BASE) in merge_profile_summaries()
1383 INT_MAX / REG_BR_PROB_BASE); in merge_profile_summaries()
1397 int scale = ((REG_BR_PROB_BASE * max_runs in merge_profile_summaries()
1403 + REG_BR_PROB_BASE / 2) in merge_profile_summaries()
1404 / REG_BR_PROB_BASE); in merge_profile_summaries()
1433 if (scale == REG_BR_PROB_BASE) in merge_profile_summaries()
1436 edge->count = ((edge->count * scale + REG_BR_PROB_BASE / 2) in merge_profile_summaries()
1437 / REG_BR_PROB_BASE); in merge_profile_summaries()
1438 node->count = ((node->count * scale + REG_BR_PROB_BASE / 2) in merge_profile_summaries()
1439 / REG_BR_PROB_BASE); in merge_profile_summaries()
H A Dtree-call-cdce.c782 bi_call_in_edge0->probability = REG_BR_PROB_BASE * ERR_PROB; in shrink_wrap_one_built_in_call()
784 REG_BR_PROB_BASE - bi_call_in_edge0->probability; in shrink_wrap_one_built_in_call()
813 bi_call_in_edge->probability = REG_BR_PROB_BASE * ERR_PROB; in shrink_wrap_one_built_in_call()
815 REG_BR_PROB_BASE - bi_call_in_edge->probability; in shrink_wrap_one_built_in_call()
H A Dgimple-streamer-in.c299 + REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE; in input_bb()
H A Dcfgloopanal.c285 return (expected > REG_BR_PROB_BASE ? REG_BR_PROB_BASE : expected); in expected_loop_iterations()
H A Dmcf.c1237 e->probability = REG_BR_PROB_BASE * e->count / bb->count; in adjust_cfg_counts()
1240 e->count, e->probability * 100.0 / REG_BR_PROB_BASE); in adjust_cfg_counts()
1253 e->probability = REG_BR_PROB_BASE * e->count / bb->count; in adjust_cfg_counts()
1266 e->probability = REG_BR_PROB_BASE / total; in adjust_cfg_counts()
1275 e->probability = REG_BR_PROB_BASE / total; in adjust_cfg_counts()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dpredict.h28 #define PROB_VERY_UNLIKELY (REG_BR_PROB_BASE / 2000 - 1)
29 #define PROB_EVEN (REG_BR_PROB_BASE / 2)
30 #define PROB_VERY_LIKELY (REG_BR_PROB_BASE - PROB_VERY_UNLIKELY)
31 #define PROB_ALWAYS (REG_BR_PROB_BASE)
32 #define PROB_UNLIKELY (REG_BR_PROB_BASE / 5 - 1)
33 #define PROB_LIKELY (REG_BR_PROB_BASE - PROB_UNLIKELY)
H A Dpredict.c740 probability * 100.0 / REG_BR_PROB_BASE);
929 * (REG_BR_PROB_BASE - probability)); in combine_predictions_for_insn()
937 * REG_BR_PROB_BASE / d + 0.5); in combine_predictions_for_insn()
1027 if (prob > REG_BR_PROB_BASE / 2) in hash()
1028 prob = REG_BR_PROB_BASE - prob; in hash()
1272 * REG_BR_PROB_BASE / d + 0.5); in combine_predictions_for_bb()
1676 probability = REG_BR_PROB_BASE; in predict_iv_comparison()
1679 tem = compare_count * REG_BR_PROB_BASE; in predict_iv_comparison()
1966 RDIV (REG_BR_PROB_BASE, in predict_loops()
1967 REG_BR_PROB_BASE in predict_loops()
[all …]
H A Dbasic-block.h306 ((den) ? RDIV ((num) * REG_BR_PROB_BASE, (den)) : REG_BR_PROB_BASE)
568 gcc_checking_assert (prob >= 0 && prob <= REG_BR_PROB_BASE); in check_probability()
579 return RDIV (prob1 * prob2, REG_BR_PROB_BASE); in combine_probabilities()
589 return RDIV (freq * scale, REG_BR_PROB_BASE); in apply_scale()
607 return REG_BR_PROB_BASE - prob1; in inverse_probability()
H A Dipa-predicate.c233 int combined_prob = REG_BR_PROB_BASE; in probability()
237 return REG_BR_PROB_BASE; in probability()
255 return REG_BR_PROB_BASE; in probability()
272 this_prob = REG_BR_PROB_BASE; in probability()
275 this_prob = REG_BR_PROB_BASE; in probability()
H A Dprofile-count.h63 #define REG_BR_PROB_BASE 10000 macro
235 gcc_checking_assert (v >= 0 && v <= REG_BR_PROB_BASE); in class()
236 ret.m_val = RDIV (v * (uint64_t) max_probability, REG_BR_PROB_BASE); in class()
243 return RDIV (m_val * (uint64_t) REG_BR_PROB_BASE, max_probability); in class()
946 gcc_checking_assert (prob >= 0 && prob <= REG_BR_PROB_BASE); in class()
952 ret.m_val = RDIV (m_val * prob, REG_BR_PROB_BASE); in class()
H A Dtracer.c187 && (best->count ().to_frequency (cfun) * REG_BR_PROB_BASE in find_best_predecessor()
282 probability_cutoff = REG_BR_PROB_BASE / 100 * probability_cutoff; in tail_duplicate()
285 (REG_BR_PROB_BASE / 100 * PARAM_VALUE (TRACER_MIN_BRANCH_RATIO)); in tail_duplicate()
H A Dipa-fnsummary.c846 else if (prob != REG_BR_PROB_BASE) in dump_ipa_call_summary()
1681 return REG_BR_PROB_BASE; in param_change_prob()
1692 * REG_BR_PROB_BASE).to_int (), 1); in param_change_prob()
1693 return REG_BR_PROB_BASE; in param_change_prob()
1705 return REG_BR_PROB_BASE; in param_change_prob()
1723 return REG_BR_PROB_BASE; in param_change_prob()
1746 return REG_BR_PROB_BASE; in param_change_prob()
2607 if (prob == REG_BR_PROB_BASE) in estimate_edge_size_and_time()
2648 time, REG_BR_PROB_BASE, in estimate_calls_size_and_time()
2667 time, REG_BR_PROB_BASE, in estimate_calls_size_and_time()
[all …]
H A Dipa-profile.c212 if (e->indirect_info->common_target_probability > REG_BR_PROB_BASE) in ipa_profile_generate_summary()
216 e->indirect_info->common_target_probability = REG_BR_PROB_BASE; in ipa_profile_generate_summary()
599 / (float)REG_BR_PROB_BASE); in ipa_profile()
602 < REG_BR_PROB_BASE / 2) in ipa_profile()
H A Dprofile-count.c235 gcc_assert (REG_BR_PROB_BASE == BB_FREQ_MAX in to_frequency()
239 return REG_BR_PROB_BASE; in to_frequency()
H A Dgimple-streamer-in.c268 if (count_materialization_scale != REG_BR_PROB_BASE in input_bb()
271 = bb->count.apply_scale (count_materialization_scale, REG_BR_PROB_BASE); in input_bb()

1234