Home
last modified time | relevance | path

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

1234

/freebsd-12.1/contrib/xz/src/liblzma/lzma/
H A Dlzma_encoder_private.h41 probability choice;
42 probability choice2;
43 probability low[POS_STATES_MAX][LEN_LOW_SYMBOLS];
44 probability mid[POS_STATES_MAX][LEN_MID_SYMBOLS];
45 probability high[LEN_HIGH_SYMBOLS];
109 probability is_match[STATES][POS_STATES_MAX];
110 probability is_rep[STATES];
111 probability is_rep0[STATES];
112 probability is_rep1[STATES];
113 probability is_rep2[STATES];
[all …]
H A Dlzma_decoder.c162 probability choice;
163 probability choice2;
166 probability high[LEN_HIGH_SYMBOLS];
179 probability is_match[STATES][POS_STATES_MAX];
182 probability is_rep[STATES];
186 probability is_rep0[STATES];
190 probability is_rep1[STATES];
193 probability is_rep2[STATES];
210 probability pos_align[ALIGN_SIZE];
269 probability *probs;
[all …]
H A Dlzma_common.h129 literal_init(probability (*probs)[LITERAL_CODER_SIZE], in literal_init()
/freebsd-12.1/contrib/gcc/
H A Dpredict.c231 GEN_INT ((int) probability)), in predict_insn()
244 probability = REG_BR_PROB_BASE - probability; in predict_insn_def()
264 probability = REG_BR_PROB_BASE - probability; in rtl_predict_edge()
281 i->ep_probability = probability; in tree_predict_edge()
325 probability = REG_BR_PROB_BASE - probability; in predict_edge_def()
397 e->probability = 0; in set_even_probabilities()
501 FALLTHRU_EDGE (bb)->probability in combine_predictions_for_insn()
571 probability = REG_BR_PROB_BASE - probability; in combine_predictions_for_bb()
617 probability = REG_BR_PROB_BASE - probability; in combine_predictions_for_bb()
695 int probability; in predict_loops() local
[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()
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()
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()
903 taken_edge->probability -= prob; in update_bb_profile_for_threading()
918 c->probability = 0; 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()
586 e14->probability = prob1; in tree_mod_subtract()
597 e24->probability = prob2; 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()
1237 new_edge->probability = REG_BR_PROB_BASE; in expand_gimple_cond_expr()
1267 int probability; in expand_gimple_tailcall() local
1295 probability = 0; in expand_gimple_tailcall()
1312 probability += e->probability; in expand_gimple_tailcall()
1339 e->probability += probability; in expand_gimple_tailcall()
1517 e->probability = REG_BR_PROB_BASE; in construct_init_block()
[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()
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()
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()
1786 s->probability in try_crossjump_to_edge()
1787 = ((s->probability * redirect_to->frequency + 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()
2254 single_succ_edge (bb)->probability = REG_BR_PROB_BASE; in purge_dead_edges()
2265 b->probability = INTVAL (XEXP (note, 0)); in purge_dead_edges()
2266 f->probability = REG_BR_PROB_BASE - b->probability; in purge_dead_edges()
[all …]
H A Dcfghooks.h67 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
157 extern void predict_edge (edge e, enum br_predictor predictor, int probability);
H A Dtree-cfgcleanup.c125 taken_edge->probability += e->probability; in cleanup_control_expr_graph()
135 if (taken_edge->probability > REG_BR_PROB_BASE) in cleanup_control_expr_graph()
136 taken_edge->probability = REG_BR_PROB_BASE; in cleanup_control_expr_graph()
H A Dpredict.def33 HITRATE is the probability that edge predicted by predictor as taken
44 /* A combined heuristics using probability determined by first
56 probability. We don't want to use Dempster-Shaffer theory here,
H A Dtree-ssa-loop-manip.c875 nonexit->probability = REG_BR_PROB_BASE; in tree_unroll_loop()
876 exit->probability = 0; in tree_unroll_loop()
901 new_exit->probability = REG_BR_PROB_BASE / est_niter; in tree_unroll_loop()
905 new_nonexit->probability = REG_BR_PROB_BASE - new_exit->probability; in tree_unroll_loop()
H A Dparams.def138 "min-inline-recursive-probability",
139 "Inline recursively only when the probability of call being executed exceeds the parameter",
359 …"Stop reverse growth if the reverse probability of best edge is less than this threshold (in perce…
362 "tracer-min-branch-probability-feedback",
363 …"Stop forward growth if the probability of best edge is less than this threshold (in percent). Use…
366 "tracer-min-branch-probability",
367 …"Stop forward growth if the probability of best edge is less than this threshold (in percent). Use…
505 "The minimum probability of reaching a source block for interblock speculative scheduling",
520 …"The minimal probability of speculation success (in percents), so that speculative insn will be sc…
H A Dprofile.c525 e->probability = (e->count * REG_BR_PROB_BASE + bb->count / 2) / bb->count; in compute_branch_probabilities()
540 prob = e->probability; in compute_branch_probabilities()
566 e->probability = REG_BR_PROB_BASE / total; in compute_branch_probabilities()
568 e->probability = 0; in compute_branch_probabilities()
574 e->probability = REG_BR_PROB_BASE / total; in compute_branch_probabilities()
/freebsd-12.1/contrib/xz/src/liblzma/rangecoder/
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit) in rc_bit_price()
37 rc_bit_0_price(const probability prob) in rc_bit_0_price()
44 rc_bit_1_price(const probability prob) in rc_bit_1_price()
52 rc_bittree_price(const probability *const probs, in rc_bittree_price()
69 rc_bittree_reverse_price(const probability *const probs, in rc_bittree_reverse_price()
H A Drange_encoder.h49 probability *probs[RC_SYMBOLS_MAX];
67 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit) in rc_bit()
76 rc_bittree(lzma_range_encoder *rc, probability *probs, in rc_bittree()
90 rc_bittree_reverse(lzma_range_encoder *rc, probability *probs, in rc_bittree_reverse()
167 probability prob = *rc->probs[rc->pos]; in rc_encode()
176 probability prob = *rc->probs[rc->pos]; in rc_encode()
H A Drange_common.h69 typedef uint16_t probability; typedef
/freebsd-12.1/sbin/pfctl/tests/files/
H A Dpf0034.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 Dpf0034.ok3 pass in all flags S/SA keep state probability 50%
4 pass in all flags S/SA keep state probability 50%
5 pass in inet6 proto tcp from ::1 to any flags S/SA keep state probability 0.8%

1234