| /src/external/public-domain/xz/dist/src/liblzma/rangecoder/ |
| range_decoder.h | 103 /// rc_if_0(prob, seq) {
104 /// rc_update_0(prob);
107 /// rc_update_1(prob);
111 #define rc_if_0(prob, seq) \
113 rc_bound = (rc.range >> RC_BIT_MODEL_TOTAL_BITS) * (prob); \
119 #define rc_update_0(prob) \
122 prob += (RC_BIT_MODEL_TOTAL - (prob)) >> RC_MOVE_BITS; \
128 #define rc_update_1(prob) \
132 prob -= (prob) >> RC_MOVE_BITS;
[all...] |
| range_common.h | 37 #define bit_reset(prob) \
38 prob = RC_BIT_MODEL_TOTAL >> 1
|
| price.h | 29 rc_bit_price(const probability prob, const uint32_t bit)
31 return lzma_rc_prices[(prob ^ ((UINT32_C(0) - bit)
37 rc_bit_0_price(const probability prob)
39 return lzma_rc_prices[prob >> RC_MOVE_REDUCING_BITS];
44 rc_bit_1_price(const probability prob)
46 return lzma_rc_prices[(prob ^ (RC_BIT_MODEL_TOTAL - 1))
|
| range_encoder.h | 67 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit)
70 rc->probs[rc->count] = prob;
167 probability prob = *rc->probs[rc->pos]; local
169 * prob;
170 prob += (RC_BIT_MODEL_TOTAL - prob) >> RC_MOVE_BITS;
171 *rc->probs[rc->pos] = prob;
176 probability prob = *rc->probs[rc->pos]; local
177 const uint32_t bound = prob * (rc->range
181 prob -= prob >> RC_MOVE_BITS
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| dojump.cc | 169 PROB is probability of jump to if_true_label. */
174 profile_probability prob)
193 prob.invert ());
197 if_true_label, prob);
200 prob);
214 do_jump (op0, if_false_label, if_true_label, prob);
218 if_false_label, prob.invert ());
221 prob);
230 if_true_label, prob);
233 prob);
443 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label, prob); local
466 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label, prob); local
468 do_jump (TREE_OPERAND (exp, 2), if_false_label, if_true_label, prob); local
572 prob); local
770 if_false_label, NULL, prob); local
814 if_false_label, NULL, prob); local
[all...] |
| dojump.h | 64 extern void jumpif (tree exp, rtx_code_label *label, profile_probability prob);
70 profile_probability prob);
|
| tree-switch-conversion.h | 52 profile_probability prob, profile_probability subtree_prob);
115 profile_probability prob, profile_probability subtree_prob):
116 m_case_label_expr (case_label_expr), m_case_bb (case_bb), m_prob (prob),
130 basic_block case_bb, profile_probability prob,
209 basic_block case_bb, profile_probability prob,
211 cluster (case_label_expr, case_bb, prob, prob),
439 profile_probability prob,
553 profile_probability prob; member in class:tree_switch_conversion::case_bit_test
630 PROB is the probability of jumping to LABEL_BB. *
[all...] |
| value-prof.cc | 657 STMT and probability of taking the optimal path PROB, which is
663 gimple_divmod_fixed_value (gassign *stmt, tree value, profile_probability prob,
719 e12->probability = prob;
722 e13->probability = prob.invert ();
807 profile_probability prob; local
842 prob = profile_probability::probability_in_gcov_type (count, all);
844 prob = profile_probability::never ();
857 result = gimple_divmod_fixed_value (stmt, tree_val, prob, count, all);
870 probability of taking the optimal path PROB, which is equivalent to COUNT/ALL
875 gimple_mod_pow2 (gassign *stmt, profile_probability prob, gcov_type count, gcov_type all
958 profile_probability prob; local
1638 profile_probability prob; local
[all...] |
| basic-block.h | 562 check_probability (int prob)
564 gcc_checking_assert (prob >= 0 && prob <= REG_BR_PROB_BASE);
588 /* Apply probability PROB on frequency or count FREQ. */
591 apply_probability (gcov_type freq, int prob)
593 check_probability (prob);
594 return apply_scale (freq, prob);
597 /* Return inverse probability for PROB. */
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| dojump.cc | 169 PROB is probability of jump to if_true_label. */
174 profile_probability prob)
193 prob.invert ());
197 if_true_label, prob);
200 prob);
214 do_jump (op0, if_false_label, if_true_label, prob);
218 if_false_label, prob.invert ());
221 prob);
230 if_true_label, prob);
233 prob);
445 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label, prob); local
468 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label, prob); local
470 do_jump (TREE_OPERAND (exp, 2), if_false_label, if_true_label, prob); local
574 prob); local
772 if_false_label, NULL, prob); local
816 if_false_label, NULL, prob); local
[all...] |
| dojump.h | 64 extern void jumpif (tree exp, rtx_code_label *label, profile_probability prob);
70 profile_probability prob);
|
| tree-switch-conversion.h | 52 profile_probability prob, profile_probability subtree_prob);
111 profile_probability prob, profile_probability subtree_prob):
112 m_case_label_expr (case_label_expr), m_case_bb (case_bb), m_prob (prob),
125 basic_block case_bb, profile_probability prob,
204 basic_block case_bb, profile_probability prob,
206 cluster (case_label_expr, case_bb, prob, prob),
432 profile_probability prob,
622 PROB is the probability of jumping to LABEL_BB. */
626 profile_probability prob,
[all...] |
| value-prof.cc | 669 STMT and probability of taking the optimal path PROB, which is
675 gimple_divmod_fixed_value (gassign *stmt, tree value, profile_probability prob,
731 e12->probability = prob;
734 e13->probability = prob.invert ();
819 profile_probability prob; local
854 prob = profile_probability::probability_in_gcov_type (count, all);
856 prob = profile_probability::never ();
869 result = gimple_divmod_fixed_value (stmt, tree_val, prob, count, all);
882 probability of taking the optimal path PROB, which is equivalent to COUNT/ALL
887 gimple_mod_pow2 (gassign *stmt, profile_probability prob, gcov_type count, gcov_type all
970 profile_probability prob; local
1646 profile_probability prob; local
[all...] |
| basic-block.h | 570 check_probability (int prob)
572 gcc_checking_assert (prob >= 0 && prob <= REG_BR_PROB_BASE);
596 /* Apply probability PROB on frequency or count FREQ. */
599 apply_probability (gcov_type freq, int prob)
601 check_probability (prob);
602 return apply_scale (freq, prob);
605 /* Return inverse probability for PROB. */
|
| /src/games/warp/ |
| them.c | 48 int prob; local
89 prob = 3;
91 prob = massacre?10:20;
107 prob = 2; /* our work here is done */
116 prob = 10000; /* stay here */
119 prob = 10000;
122 prob = 4;
129 prob = 10000;
132 prob = 4;
153 prob = 10000; /* stay here *
[all...] |
| weapon.c | 107 int prob; local
133 for (prob = scandist;prob;prob--) {
141 if (rand_mod(2+scandist-prob) <
145 if (rand_mod(51 - sm50) <= prob) {
164 rand_mod(prob<5&&smarts>70?4:3)-1;
179 (scandist-prob > 5
198 scandist-prob > 5 &&
210 if (rand_mod(2+scandist-prob) <
[all...] |
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_ppmd_private.h | 95 #define PPMD_UPDATE_PROB_0(prob) ((prob) + (1 << PPMD_INT_BITS) - PPMD_GET_MEAN(prob))
96 #define PPMD_UPDATE_PROB_1(prob) ((prob) - PPMD_GET_MEAN(prob))
|
| /src/games/hack/ |
| def.objects.h | 77 #define FOOD(name,prob,delay,weight,nutrition) { name, NULL, NULL, 1, 1,\
78 FOOD_SYM, prob, delay, weight, 0, 0, nutrition }
162 #define WEAPON(name,prob,wt,ldam,sdam) { name, NULL, NULL, 1, 0 /*%%*/,\
163 WEAPON_SYM, prob, 0, wt, ldam, sdam, 0 }
203 #define ARMOR(name,prob,delay,ac,can) { name, NULL, NULL, 1, 0,\
204 ARMOR_SYM, prob, delay, 8, ac, can, 0 }
243 #define SCROLL(name,text,prob) { name, text, NULL, 0, 1,\
244 SCROLL_SYM, prob, 0, 3, 0, 0, 0 }
271 #define WAND(name,metal,prob,flags) { name, metal, NULL, 0, 0,\
272 WAND_SYM, prob, 0, 3, flags, 0, 0
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| probe.c | 105 sal.prob = p.get ();
247 result.prob = NULL;
262 result.prob = p.get ();
336 v = a.prob->get_provider ().compare (b.prob->get_provider ());
340 v = a.prob->get_name ().compare (b.prob->get_name ());
344 if (a.prob->get_address () != b.prob->get_address ())
345 return a.prob->get_address () < b.prob->get_address ()
[all...] |
| break-catch-throw.c | 135 if (pc_probe.prob == NULL)
138 if (pc_probe.prob->get_provider () != "libstdcxx"
139 || (pc_probe.prob->get_name () != "catch"
140 && pc_probe.prob->get_name () != "throw"
141 && pc_probe.prob->get_name () != "rethrow"))
144 n_args = pc_probe.prob->get_argument_count (get_frame_arch (frame));
149 *arg0 = pc_probe.prob->evaluate_argument (0, frame);
150 *arg1 = pc_probe.prob->evaluate_argument (1, frame);
|
| probe.h | 251 : prob (probe_), objfile (objfile_)
255 probe *prob = NULL; member in struct:bound_probe
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| probe.c | 105 sal.prob = p.get ();
247 result.prob = NULL;
262 result.prob = p.get ();
336 v = a.prob->get_provider ().compare (b.prob->get_provider ());
340 v = a.prob->get_name ().compare (b.prob->get_name ());
344 if (a.prob->get_address () != b.prob->get_address ())
345 return a.prob->get_address () < b.prob->get_address ()
[all...] |
| break-catch-throw.c | 135 if (pc_probe.prob == NULL)
138 if (pc_probe.prob->get_provider () != "libstdcxx"
139 || (pc_probe.prob->get_name () != "catch"
140 && pc_probe.prob->get_name () != "throw"
141 && pc_probe.prob->get_name () != "rethrow"))
144 n_args = pc_probe.prob->get_argument_count (get_frame_arch (frame));
149 *arg0 = pc_probe.prob->evaluate_argument (0, frame);
150 *arg1 = pc_probe.prob->evaluate_argument (1, frame);
|
| probe.h | 251 : prob (probe_), objfile (objfile_)
255 probe *prob = NULL; member in struct:bound_probe
|
| /src/external/bsd/zstd/dist/contrib/pzstd/test/ |
| RoundTripTest.cpp | 44 std::uniform_real_distribution<> prob{0, 1};
45 return writeData(size(gen), prob(gen), prob(gen), gen());
|
