Home
last modified time | relevance | path

Searched refs:probability (Results 1 – 25 of 129) sorted by relevance

123456

/openbsd-src/gnu/gcc/gcc/
H A Dpredict.c209 return probability_reliable_p (e->probability); in edge_probability_reliable_p()
221 predict_insn (rtx insn, enum br_predictor predictor, int probability) in predict_insn() argument
231 GEN_INT ((int) probability)), in predict_insn()
241 int probability = predictor_info[(int) predictor].hitrate; in predict_insn_def() local
244 probability = REG_BR_PROB_BASE - probability; in predict_insn_def()
246 predict_insn (insn, predictor, probability); in predict_insn_def()
252 rtl_predict_edge (edge e, enum br_predictor predictor, int probability) in rtl_predict_edge() argument
264 probability = REG_BR_PROB_BASE - probability; in rtl_predict_edge()
266 predict_insn (last_insn, predictor, probability); in rtl_predict_edge()
271 tree_predict_edge (edge e, enum br_predictor predictor, int probability) in tree_predict_edge() argument
[all …]
H A Dcfg.c338 e->probability = REG_BR_PROB_BASE; in make_single_succ_edge()
385 s->probability += e->probability; in redirect_edge_succ_nodup()
386 if (s->probability > REG_BR_PROB_BASE) in redirect_edge_succ_nodup()
387 s->probability = REG_BR_PROB_BASE; in redirect_edge_succ_nodup()
441 sum += e->probability; in check_bb_profile()
613 if (e->probability) in dump_edge_info()
614 fprintf (file, " [%.1f%%] ", e->probability * 100.0 / REG_BR_PROB_BASE); in dump_edge_info()
892 if (prob > taken_edge->probability) in update_bb_profile_for_threading()
898 taken_edge->probability, prob); in update_bb_profile_for_threading()
899 prob = taken_edge->probability; in update_bb_profile_for_threading()
[all …]
H A Dcfgbuild.c716 int probability; in compute_outgoing_frequencies() local
720 probability = INTVAL (XEXP (note, 0)); in compute_outgoing_frequencies()
722 e->probability = probability; in compute_outgoing_frequencies()
723 e->count = ((b->count * probability + REG_BR_PROB_BASE / 2) in compute_outgoing_frequencies()
726 f->probability = REG_BR_PROB_BASE - probability; in compute_outgoing_frequencies()
735 e->probability = REG_BR_PROB_BASE; in compute_outgoing_frequencies()
742 e->count = ((b->count * e->probability + REG_BR_PROB_BASE / 2) in compute_outgoing_frequencies()
H A Dvalue-prof.c239 e12->probability = prob; in tree_divmod_fixed_value()
243 e13->probability = REG_BR_PROB_BASE - prob; in tree_divmod_fixed_value()
249 e24->probability = REG_BR_PROB_BASE; in tree_divmod_fixed_value()
252 e34->probability = REG_BR_PROB_BASE; in tree_divmod_fixed_value()
406 e12->probability = prob; in tree_mod_pow2()
410 e13->probability = REG_BR_PROB_BASE - prob; in tree_mod_pow2()
416 e24->probability = REG_BR_PROB_BASE; in tree_mod_pow2()
419 e34->probability = REG_BR_PROB_BASE; in tree_mod_pow2()
582 e12->probability = REG_BR_PROB_BASE - prob1; in tree_mod_subtract()
586 e14->probability = prob1; in tree_mod_subtract()
[all …]
H A Dcfgexpand.c49 add_reg_br_prob_note (rtx last, int probability) in add_reg_br_prob_note() argument
70 GEN_INT (REG_BR_PROB_BASE - probability), in add_reg_br_prob_note()
79 GEN_INT (probability), REG_NOTES (last)); in add_reg_br_prob_note()
1221 add_reg_br_prob_note (last, true_edge->probability); in expand_gimple_cond_expr()
1230 add_reg_br_prob_note (last, false_edge->probability); in expand_gimple_cond_expr()
1240 add_reg_br_prob_note (last, true_edge->probability); in expand_gimple_cond_expr()
1256 new_edge->probability = REG_BR_PROB_BASE; in expand_gimple_cond_expr()
1286 int probability; in expand_gimple_tailcall() local
1314 probability = 0; in expand_gimple_tailcall()
1331 probability += e->probability; in expand_gimple_tailcall()
[all …]
H A Dtracer.c104 if (e1->src->frequency * e1->probability != in better_p()
105 e2->src->frequency * e2->probability) in better_p()
106 return (e1->src->frequency * e1->probability in better_p()
107 > e2->src->frequency * e2->probability); in better_p()
129 if (best->probability <= probability_cutoff) in find_best_successor()
H A Dbb-reorder.c511 prob = e->probability; in find_traces_1_round()
584 prob = e->probability; in find_traces_1_round()
971 || e->probability > best->probability in connect_traces()
972 || (e->probability == best->probability in connect_traces()
1017 || e->probability > best->probability in connect_traces()
1018 || (e->probability == best->probability in connect_traces()
1049 && (!best || e->probability > best->probability)) in connect_traces()
1080 || e2->probability > best2->probability in connect_traces()
1081 || (e2->probability == best2->probability in connect_traces()
H A Dcfghooks.c131 if (e->probability < 0 || e->probability > REG_BR_PROB_BASE) in verify_flow_info()
134 e->src->index, e->dest->index, e->probability); in verify_flow_info()
410 single_succ_edge (ret)->probability = REG_BR_PROB_BASE; in split_edge()
502 predict_edge (edge e, enum br_predictor predictor, int probability) in predict_edge() argument
507 cfg_hooks->predict_edge (e, predictor, probability); in predict_edge()
728 n->probability = s->probability; in duplicate_block()
H A Dloop-unswitch.c442 prob = true_edge->probability; in unswitch_loop()
449 e->probability = prob; in unswitch_loop()
452 e->probability = false_edge->probability; in unswitch_loop()
453 e->count = latch_edge->count * (false_edge->probability) / REG_BR_PROB_BASE; in unswitch_loop()
H A Dcfgcleanup.c536 int edge_probability = e->probability; in try_forward_edges()
1263 prob2 = b2->probability; in condjump_equiv_p()
1266 prob2 = REG_BR_PROB_BASE - b2->probability; in condjump_equiv_p()
1271 if (abs (b1->probability - prob2) > REG_BR_PROB_BASE / 2) in condjump_equiv_p()
1276 bb1->index, bb2->index, b1->probability, prob2); in condjump_equiv_p()
1399 prob2 = b2->probability; in outgoing_edges_match()
1402 prob2 = REG_BR_PROB_BASE - b2->probability; in outgoing_edges_match()
1407 if (abs (b1->probability - prob2) > REG_BR_PROB_BASE / 2) in outgoing_edges_match()
1412 bb1->index, bb2->index, b1->probability, prob2); in outgoing_edges_match()
1784 s->probability = (s->probability + s2->probability) / 2; in try_crossjump_to_edge()
[all …]
H A Dcfgrtl.c855 e->probability = REG_BR_PROB_BASE; in try_redirect_by_replacing_jump()
1020 b->probability = prob; in force_nonfallthru_and_redirect()
1022 e->probability -= e->probability; in force_nonfallthru_and_redirect()
1024 if (e->probability < 0) in force_nonfallthru_and_redirect()
1025 e->probability = 0; in force_nonfallthru_and_redirect()
1120 new_edge->probability = e->probability; in force_nonfallthru_and_redirect()
1125 e->probability = REG_BR_PROB_BASE; in force_nonfallthru_and_redirect()
1703 if (!note || INTVAL (XEXP (note, 0)) == BRANCH_EDGE (bb)->probability) in update_br_prob_note()
1705 XEXP (note, 0) = GEN_INT (BRANCH_EDGE (bb)->probability); in update_br_prob_note()
1824 if (INTVAL (XEXP (note, 0)) != BRANCH_EDGE (bb)->probability in rtl_verify_flow_info_1()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dpredict.c179 predict_insn (insn, predictor, probability) in predict_insn() argument
181 int probability;
193 GEN_INT ((int) probability)),
205 int probability = predictor_info[(int) predictor].hitrate; local
208 probability = REG_BR_PROB_BASE - probability;
210 predict_insn (insn, predictor, probability);
216 predict_edge (e, predictor, probability) in predict_edge() argument
218 int probability;
231 probability = REG_BR_PROB_BASE - probability;
233 predict_insn (last_insn, predictor, probability);
[all …]
H A Dcfgcleanup.c569 int edge_probability = e->probability;
622 if (prob > t->probability)
623 prob = t->probability;
624 t->probability -= prob;
628 first->succ->probability = REG_BR_PROB_BASE;
629 first->succ->succ_next->probability = 0;
633 e->probability = ((e->probability * REG_BR_PROB_BASE)
1254 prob2 = b2->probability;
1257 prob2 = REG_BR_PROB_BASE - b2->probability;
1262 if (abs (b1->probability - prob2) > REG_BR_PROB_BASE / 2)
[all …]
H A Dtracer.c102 if (e1->src->frequency * e1->probability !=
103 e2->src->frequency * e2->probability)
104 return (e1->src->frequency * e1->probability
105 > e2->src->frequency * e2->probability);
127 if (best->probability <= probability_cutoff)
H A Dcfgrtl.c808 e->probability = REG_BR_PROB_BASE;
991 b->probability = prob;
993 e->probability -= e->probability;
995 if (e->probability < 0)
996 e->probability = 0;
1073 new_edge->probability = e->probability;
1078 e->probability = REG_BR_PROB_BASE;
1755 if (!note || INTVAL (XEXP (note, 0)) == BRANCH_EDGE (bb)->probability)
1757 XEXP (note, 0) = GEN_INT (BRANCH_EDGE (bb)->probability);
1876 if (INTVAL (XEXP (note, 0)) != BRANCH_EDGE (bb)->probability) in verify_flow_info()
[all …]
H A Dcfgbuild.c746 int probability; local
751 probability = INTVAL (XEXP (find_reg_note (b->end,
755 e->probability = probability;
756 e->count = ((b->count * probability + REG_BR_PROB_BASE / 2)
759 f->probability = REG_BR_PROB_BASE - probability;
766 e->probability = REG_BR_PROB_BASE;
H A Dcfg.c394 e->probability = REG_BR_PROB_BASE;
472 s->probability += e->probability;
473 if (s->probability > REG_BR_PROB_BASE)
474 s->probability = REG_BR_PROB_BASE;
611 sum += e->probability;
660 if (e->probability)
661 fprintf (file, " [%.1f%%] ", e->probability * 100.0 / REG_BR_PROB_BASE);
H A Dbb-reorder.c221 int taken, probability; local
224 probability = INTVAL (XEXP (note, 0));
225 taken = probability > REG_BR_PROB_BASE / 2;
H A Dprofile.c631 e->probability = (e->count * REG_BR_PROB_BASE + total / 2) / total; in compute_branch_probabilities()
632 if (e->probability < 0 || e->probability > REG_BR_PROB_BASE) in compute_branch_probabilities()
635 e->src->index, e->dest->index, e->probability); in compute_branch_probabilities()
636 e->probability = REG_BR_PROB_BASE / 2; in compute_branch_probabilities()
653 prob = e->probability; in compute_branch_probabilities()
685 e->probability = REG_BR_PROB_BASE / total; in compute_branch_probabilities()
687 e->probability = 0; in compute_branch_probabilities()
694 e->probability = REG_BR_PROB_BASE / total; in compute_branch_probabilities()
/openbsd-src/regress/sbin/pfctl/
H A Dpf34.in1 #mixed af, probability
3 pass in probability 0.5
4 pass in probability 50%
5 pass in inet6 proto tcp from ::1 probability 0.8%
H A Dpf34.ok3 pass in all flags S/SA probability 50%
4 pass in all flags S/SA probability 50%
5 pass in inet6 proto tcp from ::1 to any flags S/SA probability 0.8%
H A Dpf34.loaded9 @2 pass in all flags S/SA probability 50%
13 @3 pass in all flags S/SA probability 50%
17 @4 pass in inet6 proto tcp from ::1 to any flags S/SA probability 0.8%
H A Dpf34.optimized9 @2 pass in all flags S/SA probability 50%
13 @3 pass in all flags S/SA probability 50%
17 @4 pass in inet6 proto tcp from ::1 to any flags S/SA probability 0.8%
/openbsd-src/gnu/llvm/llvm/docs/
H A DBranchWeightMetadata.rst149 Built-in ``expect.with.probability`` Instruction
152 ``__builtin_expect_with_probability(long exp, long c, double probability)`` has
154 probability that ``exp == c``. The last argument ``probability`` must be
161 If the expect comparison value ``c`` is equal to 1(true), and probability
162 value ``probability`` is set to 0.8, that means the probability of condition
168 // This block is likely to be taken with probability 80%.
175 The probability that ``exp`` is equal to the expect value is given in
176 the third argument ``probability``, while the probability of other value is
177 the average of remaining probability(``1.0 - probability``). For example:
182 default: break; // Take this case with probability 10%
[all …]
H A DBlockFrequencyTerminology.rst27 branch probability associated with a given edge is its own weight divided by
47 The probability of branching from block A to block B is 7/15, and the
48 probability of branching from block A to block C is 8/15.
122 * every branch weight is assumed to be 1 (i.e., every branch probability

123456