Searched refs:probability (Results 1 - 25 of 46) sorted by relevance

12

/freebsd-9.3-release/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];
108 probability literal[LITERAL_CODERS_MAX][LITERAL_CODER_SIZE];
109 probability is_match[STATES][POS_STATES_MAX];
110 probability is_rep[STATES];
111 probability is_rep0[STATES];
112 probability is_rep
[all...]
H A Dlzma_decoder.c156 probability choice;
157 probability choice2;
158 probability low[POS_STATES_MAX][LEN_LOW_SYMBOLS];
159 probability mid[POS_STATES_MAX][LEN_MID_SYMBOLS];
160 probability high[LEN_HIGH_SYMBOLS];
170 probability literal[LITERAL_CODERS_MAX][LITERAL_CODER_SIZE];
173 probability is_match[STATES][POS_STATES_MAX];
176 probability is_rep[STATES];
180 probability is_rep0[STATES];
184 probability is_rep
[all...]
H A Dlzma_common.h129 literal_init(probability (*probs)[LITERAL_CODER_SIZE],
180 // Macro to get the index of the appropriate probability array.
/freebsd-9.3-release/contrib/xz/src/liblzma/rangecoder/
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit)
37 rc_bit_0_price(const probability prob)
44 rc_bit_1_price(const probability prob)
52 rc_bittree_price(const probability *const probs,
69 rc_bittree_reverse_price(const probability *const probs,
H A Drange_common.h38 // Resets the probability so that both 0 and 1 have probability of 50 %
57 /// may give better speed, because the probability variables are accessed
58 /// a lot. On the other hand, bigger probability type increases cache
59 /// footprint, since there are 2 to 14 thousand probability variables in
64 /// become important. In that case, smaller probability variables mean that
66 /// With big probability type, the initialization can become so slow that it
71 typedef uint16_t probability; typedef
H A Drange_encoder.h49 probability *probs[RC_SYMBOLS_MAX];
67 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit)
76 rc_bittree(lzma_range_encoder *rc, probability *probs,
90 rc_bittree_reverse(lzma_range_encoder *rc, probability *probs,
167 probability prob = *rc->probs[rc->pos];
176 probability prob = *rc->probs[rc->pos];
/freebsd-9.3-release/contrib/gcc/
H A Dpredict.c181 /* Return true when the probability of edge is reliable.
185 It is however notoriously poor on predicting the probability itself.
194 noreturn heuristic that is only one giving probability over 99% or bellow
209 return probability_reliable_p (e->probability);
221 predict_insn (rtx insn, enum br_predictor predictor, int probability) argument
231 GEN_INT ((int) probability)),
241 int probability = predictor_info[(int) predictor].hitrate; local
244 probability = REG_BR_PROB_BASE - probability;
246 predict_insn (insn, predictor, probability);
252 rtl_predict_edge(edge e, enum br_predictor predictor, int probability) argument
271 tree_predict_edge(edge e, enum br_predictor predictor, int probability) argument
322 int probability = predictor_info[(int) predictor].hitrate; local
349 dump_prediction(FILE *file, enum br_predictor predictor, int probability, basic_block bb, int used) argument
434 int probability = INTVAL (XEXP (XEXP (note, 0), 1)); local
480 int probability = INTVAL (XEXP (XEXP (*pnote, 0), 1)); local
568 int probability = pred->ep_probability; local
614 int probability = pred->ep_probability; local
695 int probability; local
763 int probability = ((REG_BR_PROB_BASE local
[all...]
H A Dcfg.c335 /* Create an edge connecting SRC to DEST and set probability by knowing
343 e->probability = REG_BR_PROB_BASE;
390 s->probability += e->probability;
391 if (s->probability > REG_BR_PROB_BASE)
392 s->probability = REG_BR_PROB_BASE;
447 sum += e->probability;
620 if (e->probability)
621 fprintf (file, " [%.1f%%] ", e->probability * 100.0 / REG_BR_PROB_BASE);
894 /* Compute the probability o
[all...]
H A Dtracer.c62 /* Minimal outgoing edge probability considered for superblock formation. */
104 if (e1->src->frequency * e1->probability !=
105 e2->src->frequency * e2->probability)
106 return (e1->src->frequency * e1->probability
107 > e2->src->frequency * e2->probability);
129 if (best->probability <= probability_cutoff)
H A Dcfgbuild.c721 int probability;
725 probability = INTVAL (XEXP (note, 0));
727 e->probability = probability;
728 e->count = ((b->count * probability + REG_BR_PROB_BASE / 2)
731 f->probability = REG_BR_PROB_BASE - probability;
740 e->probability = REG_BR_PROB_BASE;
747 e->count = ((b->count * e->probability + REG_BR_PROB_BASE / 2)
716 int probability; local
H A Dvalue-prof.c171 probability of taking the optimal path PROB, which is equivalent to COUNT/ALL
239 e12->probability = prob;
243 e13->probability = REG_BR_PROB_BASE - prob;
249 e24->probability = REG_BR_PROB_BASE;
252 e34->probability = REG_BR_PROB_BASE;
310 /* Compute probability of taking the optimal path. */
334 and OP2, parent modify-expr STMT and probability of taking the optimal
406 e12->probability = prob;
410 e13->probability = REG_BR_PROB_BASE - prob;
416 e24->probability
[all...]
H A Dcfghooks.c131 if (e->probability < 0 || e->probability > REG_BR_PROB_BASE)
133 error ("verify_flow_info: Wrong probability of edge %i->%i %i",
134 e->src->index, e->dest->index, e->probability);
410 single_succ_edge (ret)->probability = REG_BR_PROB_BASE;
502 predict_edge (edge e, enum br_predictor predictor, int probability) argument
507 cfg_hooks->predict_edge (e, predictor, probability);
728 n->probability = s->probability;
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 Dcfgexpand.c44 REG_BR_PROB note specifying probability.
45 ??? We really ought to pass the probability down to RTL expanders and let it
49 add_reg_br_prob_note (rtx last, int probability) argument
70 GEN_INT (REG_BR_PROB_BASE - probability),
79 GEN_INT (probability), REG_NOTES (last));
83 fprintf (dump_file, "Failed to add probability note\n");
1134 add_reg_br_prob_note (last, true_edge->probability);
1143 add_reg_br_prob_note (last, false_edge->probability);
1153 add_reg_br_prob_note (last, true_edge->probability);
1169 new_edge->probability
1199 int probability; local
[all...]
H A Dloop-unswitch.c88 true, with probability PROB. If CINSN is not NULL, it is the insn to copy
442 prob = true_edge->probability;
449 e->probability = prob;
452 e->probability = false_edge->probability;
453 e->count = latch_edge->count * (false_edge->probability) / REG_BR_PROB_BASE;
H A Dbb-reorder.c421 not include basic blocks their probability is lower than BRANCH_TH or their
483 /* The probability and frequency of the best edge. */
512 prob = e->probability;
585 prob = e->probability;
843 best edge (details are in function). The probability of edge E is PROB. The
844 frequency of the successor is FREQ. The current best probability is
861 /* The edge has higher probability than the temporary best edge. */
864 /* The edge has lower probability than the temporary best edge. */
972 || e->probability > best->probability
[all...]
H A Dtree-cfgcleanup.c125 taken_edge->probability += e->probability;
135 if (taken_edge->probability > REG_BR_PROB_BASE)
136 taken_edge->probability = REG_BR_PROB_BASE;
H A Dcfgcleanup.c540 int edge_probability = e->probability;
1270 prob2 = b2->probability;
1272 /* Do not use f2 probability as f2 may be forwarded. */
1273 prob2 = REG_BR_PROB_BASE - b2->probability;
1278 if (abs (b1->probability - prob2) > REG_BR_PROB_BASE / 2)
1283 bb1->index, bb2->index, b1->probability, prob2);
1406 prob2 = b2->probability;
1408 /* Do not use f2 probability as f2 may be forwarded. */
1409 prob2 = REG_BR_PROB_BASE - b2->probability;
1414 if (abs (b1->probability
[all...]
H A Dcfgrtl.c862 e->probability = REG_BR_PROB_BASE;
1027 b->probability = prob;
1029 e->probability -= e->probability;
1031 if (e->probability < 0)
1032 e->probability = 0;
1127 new_edge->probability = e->probability;
1132 e->probability = REG_BR_PROB_BASE;
1715 if (!note || INTVAL (XEXP (note, 0)) == BRANCH_EDGE (bb)->probability)
[all...]
H A Dtree-ssa-loop-ivcanon.c516 exit->probability = REG_BR_PROB_BASE;
517 non_exit->probability = 0;
H A Dprofile.c483 /* For every edge, calculate its branch probability and add a reg_note
528 e->probability = (e->count * REG_BR_PROB_BASE + bb->count / 2) / bb->count;
543 prob = e->probability;
569 e->probability = REG_BR_PROB_BASE / total;
571 e->probability = 0;
577 e->probability = REG_BR_PROB_BASE / total;
H A Dtree-ssa-loop-manip.c875 nonexit->probability = REG_BR_PROB_BASE;
876 exit->probability = 0;
901 new_exit->probability = REG_BR_PROB_BASE / est_niter;
905 new_nonexit->probability = REG_BR_PROB_BASE - new_exit->probability;
H A Dtree-ssa-phiopt.c339 EDGE_SUCC (cond_block, 0)->probability = REG_BR_PROB_BASE;
349 EDGE_SUCC (cond_block, 1)->probability = REG_BR_PROB_BASE;
/freebsd-9.3-release/sys/boot/i386/boot2/
H A DMakefile43 CFLAGS.gcc+= -fno-guess-branch-probability \
/freebsd-9.3-release/sys/boot/pc98/boot2/
H A DMakefile27 -fno-guess-branch-probability \

Completed in 317 milliseconds

12