| /src/external/public-domain/xz/dist/src/liblzma/lzma/ |
| lzma_encoder_private.h | 39 probability choice;
40 probability choice2;
41 probability low[POS_STATES_MAX][LEN_LOW_SYMBOLS];
42 probability mid[POS_STATES_MAX][LEN_MID_SYMBOLS];
43 probability high[LEN_HIGH_SYMBOLS];
121 probability literal[LITERAL_CODERS_MAX * LITERAL_CODER_SIZE];
122 probability is_match[STATES][POS_STATES_MAX];
123 probability is_rep[STATES];
124 probability is_rep0[STATES];
125 probability is_rep1[STATES]
[all...] |
| lzma_decoder.c | 98 probability choice;
99 probability choice2;
100 probability low[POS_STATES_MAX][LEN_LOW_SYMBOLS];
101 probability mid[POS_STATES_MAX][LEN_MID_SYMBOLS];
102 probability high[LEN_HIGH_SYMBOLS];
112 probability literal[LITERAL_CODERS_MAX * LITERAL_CODER_SIZE];
115 probability is_match[STATES][POS_STATES_MAX];
118 probability is_rep[STATES];
122 probability is_rep0[STATES];
126 probability is_rep1[STATES]
[all...] |
| /src/external/public-domain/xz/dist/src/liblzma/rangecoder/ |
| price.h | 6 /// \brief Probability price calculation
29 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,
|
| range_common.h | 38 // 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
73 /// probability is assumed to be uint16_t. (In contrast, LZMA SDK 23.01
75 typedef uint16_t probability; typedef
|
| range_encoder.h | 51 probability *probs[RC_SYMBOLS_MAX];
79 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit)
88 rc_bittree(lzma_range_encoder *rc, probability *probs,
102 rc_bittree_reverse(lzma_range_encoder *rc, probability *probs,
208 probability prob = *rc->probs[rc->pos];
217 probability prob = *rc->probs[rc->pos];
297 probability prob = *rc->probs[pos];
304 probability prob = *rc->probs[pos];
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| predict.cc | 247 || e->probability == profile_probability::never ())
444 if (!e->probability.initialized_p ())
446 if ((e->probability.to_reg_br_prob_base ()
448 || (REG_BR_PROB_BASE - e->probability.to_reg_br_prob_base ()
538 int probability = predictor_info[(int) predictor].hitrate; local
541 probability = REG_BR_PROB_BASE - probability;
546 && i->ep_probability == probability)
555 return e->probability.probably_reliable_p ();
568 predict_insn (rtx_insn *insn, enum br_predictor predictor, int probability)
586 int probability = predictor_info[(int) predictor].hitrate; local
722 int probability = predictor_info[(int) predictor].hitrate; local
994 int probability = INTVAL (XEXP (XEXP (note, 0), 1)); local
1044 int probability = INTVAL (XEXP (XEXP (*pnote, 0), 1)); local
1318 int probability = pred->ep_probability; local
1397 int probability = pred->ep_probability; local
1724 int probability; local
1996 int probability; local
2145 int probability = ((REG_BR_PROB_BASE local
2676 HOST_WIDE_INT probability; local
4534 int probability; member in struct:selftest::branch_predictor
[all...] |
| tree-ssa-ifcombine.cc | 361 and probability of inner_not_taken updated. */
365 /* Handle special case where inner_taken probability is always. In this case
368 outer2->probability is inverse of outer_to_inner->probability. */
369 if (inner_taken->probability == profile_probability::always ())
372 inner_taken->probability = outer2->probability + outer_to_inner->probability
373 * inner_taken->probability;
374 inner_not_taken->probability = profile_probability::always (
[all...] |
| cfg.cc | 288 e->probability = profile_probability::uninitialized ();
349 /* Create an edge connecting SRC to DEST and set probability by knowing
357 e->probability = profile_probability::always ();
448 sum += e->probability;
449 if (e->probability.initialized_p ())
450 isum += e->probability.to_reg_br_prob_base ();
525 if (e->probability.initialized_p () && do_details)
528 e->probability.dump (file);
935 /* Compute the probability of TAKEN_EDGE being reached via threaded edge.
941 if (prob > taken_edge->probability)
[all...] |
| tree-ssa-loop-split.cc | 360 new_e->probability = profile_probability::likely ();
361 skip_e->probability = new_e->probability.invert ();
487 /* Fix the two loop's bb count after split based on the split edge probability,
505 = bbs1[j]->count.apply_probability (true_edge->probability);
516 = bbs2[j]->count.apply_probability (true_edge->probability.invert ());
623 true_edge->probability,
624 true_edge->probability.invert (),
649 /* Fix first loop's exit probability after scaling. */
655 exit_to_latch1->probability *= true_edge->probability
[all...] |
| value-prof.cc | 669 STMT and probability of taking the optimal path PROB, which is
731 e12->probability = prob;
734 e13->probability = prob.invert ();
739 e24->probability = profile_probability::always ();
741 e34->probability = profile_probability::always ();
852 /* Compute probability of taking the optimal path. */
882 probability of taking the optimal path PROB, which is equivalent to COUNT/ALL
946 e12->probability = prob;
949 e13->probability = prob.invert ();
954 e24->probability = profile_probability::always ()
[all...] |
| cfghooks.h | 42 predecessors doesn't match reasonably probability 1. */
48 doesn't match reasonably probability 1. */
121 /* Predict edge E using PREDICTOR to given PROBABILITY. */
122 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
243 extern void predict_edge (edge e, enum br_predictor predictor, int probability);
|
| tree-ssa-loop-unswitch.cc | 499 prob_true = edge_true->probability;
863 guard->probability.dump (buffer);
888 /* Determine the probability that we skip the loop. Assume that loop has
890 new_edge->probability = guard->probability;
894 : guard->count ().apply_probability (new_edge->probability);
904 new_edge->probability.dump (buffer);
907 "Estimated probability of skipping loop is %s\n",
915 e->probability = new_edge->probability.invert ()
[all...] |
| cfgbuild.cc | 659 int probability;
663 probability = XINT (note, 0);
665 e->probability
666 = profile_probability::from_reg_br_prob_note (probability);
668 f->probability = e->probability.invert ();
679 e->probability = profile_probability::always ();
655 int probability; local
|
| tree-profile.cc | 443 profile_probability probability; local
445 probability = profile_probability::very_likely ();
447 probability = profile_probability::unlikely ();
449 true_edge->probability = probability;
452 e->probability = true_edge->probability.invert ();
507 true_edge->probability = profile_probability::unlikely ();
510 e->probability = true_edge->probability.invert ()
[all...] |
| tree-ssa-loop-manip.cc | 1240 /* Probability in % that the unrolled loop is entered. Just a guess. */
1282 To make the profile correct, we would need to change the probability
1303 1 / (1 - exit->probability). */
1304 if (exit->probability.initialized_p ())
1307 probability does not fit. */
1311 (exit->probability));
1322 /* Set the probability of new exit to the same of the old one. Fix
1324 1 - exit->probability. */
1325 new_exit->probability = exit->probability;
[all...] |
| ipa-utils.cc | 643 if (srce->probability.initialized_p ())
644 dste->probability = srce->probability;
653 dste->probability =
654 dste->probability * dstbb->count.ipa ().probability_in
657 + srce->probability * srcbb->count.ipa ().probability_in
|
| cfgloopanal.cc | 488 || ex->probability <= profile_probability::very_unlikely ())
519 if ((!best || e->probability > best->probability)
|
| /src/external/gpl3/gcc/dist/gcc/ |
| predict.cc | 248 || e->probability == profile_probability::never ())
456 if (!e->probability.initialized_p ())
458 if ((e->probability.to_reg_br_prob_base ()
460 || (REG_BR_PROB_BASE - e->probability.to_reg_br_prob_base ()
550 int probability = predictor_info[(int) predictor].hitrate; local
553 probability = REG_BR_PROB_BASE - probability;
558 && i->ep_probability == probability)
567 return e->probability.probably_reliable_p ();
580 predict_insn (rtx_insn *insn, enum br_predictor predictor, int probability)
598 int probability = predictor_info[(int) predictor].hitrate; local
734 int probability = predictor_info[(int) predictor].hitrate; local
1006 int probability = INTVAL (XEXP (XEXP (note, 0), 1)); local
1056 int probability = INTVAL (XEXP (XEXP (*pnote, 0), 1)); local
1330 int probability = pred->ep_probability; local
1409 int probability = pred->ep_probability; local
1735 int probability; local
2002 int probability; local
2150 int probability = ((REG_BR_PROB_BASE local
2775 HOST_WIDE_INT probability; local
4712 int probability; member in struct:selftest::branch_predictor
[all...] |
| cfg.cc | 289 e->probability = profile_probability::uninitialized ();
350 /* Create an edge connecting SRC to DEST and set probability by knowing
358 e->probability = profile_probability::always ();
449 sum += e->probability;
450 if (e->probability.initialized_p ())
451 isum += e->probability.to_reg_br_prob_base ();
526 if (e->probability.initialized_p () && do_details)
529 e->probability.dump (file);
913 /* Set probability of E to NEW_PROB and rescale other edges
921 if (e->probability == new_prob
[all...] |
| tree-ssa-ifcombine.cc | 382 and probability of inner_not_taken updated. */
386 /* Handle special case where inner_taken probability is always. In this case
389 outer2->probability is inverse of outer_to_inner->probability. */
390 if (inner_taken->probability == profile_probability::always ())
393 inner_taken->probability = outer2->probability + outer_to_inner->probability
394 * inner_taken->probability;
395 inner_not_taken->probability = profile_probability::always (
[all...] |
| tree-ssa-loop-split.cc | 399 new_e->probability = profile_probability::very_likely ();
400 skip_e->probability = new_e->probability.invert ();
526 /* Fix the two loop's bb count after split based on the split edge probability,
544 = bbs1[j]->count.apply_probability (true_edge->probability);
557 = bbs2[j]->count.apply_probability (true_edge->probability.invert ());
691 : true_edge->probability;
693 entered. very_likely below is the probability that second loop will
706 /* Correct probability of edge cond_bb->preheader_of_loop2. */
708 (loop_preheader_edge (loop2)->src)->probability
[all...] |
| value-prof.cc | 657 STMT and probability of taking the optimal path PROB, which is
719 e12->probability = prob;
722 e13->probability = prob.invert ();
727 e24->probability = profile_probability::always ();
729 e34->probability = profile_probability::always ();
840 /* Compute probability of taking the optimal path. */
870 probability of taking the optimal path PROB, which is equivalent to COUNT/ALL
934 e12->probability = prob;
937 e13->probability = prob.invert ();
942 e24->probability = profile_probability::always ()
[all...] |
| cfghooks.h | 42 predecessors doesn't match reasonably probability 1. */
48 doesn't match reasonably probability 1. */
121 /* Predict edge E using PREDICTOR to given PROBABILITY. */
122 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
243 extern void predict_edge (edge e, enum br_predictor predictor, int probability);
|
| cfgbuild.cc | 659 int probability;
663 probability = XINT (note, 0);
665 e->probability
666 = profile_probability::from_reg_br_prob_note (probability);
668 f->probability = e->probability.invert ();
679 e->probability = profile_probability::always ();
655 int probability; local
|
| tree-ssa-loop-unswitch.cc | 1117 profile_probability prob_true = edge_true->probability;
1479 guard->probability.dump (buffer);
1504 /* Determine the probability that we skip the loop. Assume that loop has
1506 new_edge->probability = guard->probability;
1510 : guard->count ().apply_probability (new_edge->probability);
1520 new_edge->probability.dump (buffer);
1523 "Estimated probability of skipping loop is %s\n",
1531 e->probability = new_edge->probability.invert ()
[all...] |
