Searched refs:prob (Results 1 - 24 of 24) sorted by relevance

/freebsd-9.3-release/contrib/xz/src/liblzma/rangecoder/
H A Drange_decoder.h97 /// rc_if_0(prob, seq) {
98 /// rc_update_0(prob);
101 /// rc_update_1(prob);
105 #define rc_if_0(prob, seq) \
107 rc_bound = (rc.range >> RC_BIT_MODEL_TOTAL_BITS) * (prob); \
113 #define rc_update_0(prob) \
116 prob += (RC_BIT_MODEL_TOTAL - (prob)) >> RC_MOVE_BITS; \
122 #define rc_update_1(prob) \
126 prob
[all...]
H A Drange_common.h39 #define bit_reset(prob) \
40 prob = RC_BIT_MODEL_TOTAL >> 1
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit) argument
31 return lzma_rc_prices[(prob ^ ((UINT32_C(0) - bit)
37 rc_bit_0_price(const probability prob) argument
39 return lzma_rc_prices[prob >> RC_MOVE_REDUCING_BITS];
44 rc_bit_1_price(const probability prob) argument
46 return lzma_rc_prices[(prob ^ (RC_BIT_MODEL_TOTAL - 1))
H A Drange_encoder.h67 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit) argument
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
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Dloop-unswitch.c92 compare_and_jump_seq (rtx op0, rtx op1, enum rtx_code comp, rtx label, int prob, argument
130 REG_NOTES (jump) = gen_rtx_EXPR_LIST (REG_BR_PROB, GEN_INT (prob),
408 int irred_flag, prob; local
442 prob = true_edge->probability;
446 prob, cinsn);
449 e->probability = prob;
450 e->count = latch_edge->count * prob / REG_BR_PROB_BASE;
H A Dcfg.c882 int prob;
897 prob = edge_frequency * REG_BR_PROB_BASE / bb->frequency;
899 prob = 0;
900 if (prob > taken_edge->probability)
906 taken_edge->probability, prob);
907 prob = taken_edge->probability;
911 taken_edge->probability -= prob;
912 prob = REG_BR_PROB_BASE - prob;
916 if (prob <
874 int prob; local
[all...]
H A Dvalue-prof.c176 tree op1, tree op2, tree value, int prob, gcov_type count,
239 e12->probability = prob;
243 e13->probability = REG_BR_PROB_BASE - prob;
267 int prob; local
311 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
316 result = tree_divmod_fixed_value (stmt, op, op1, op2, tree_val, prob, count, all);
339 tree_mod_pow2 (tree stmt, tree operation, tree op1, tree op2, int prob, argument
406 e12->probability = prob;
410 e13->probability = REG_BR_PROB_BASE - prob;
434 int prob; local
175 tree_divmod_fixed_value(tree stmt, tree operation, tree op1, tree op2, tree value, int prob, gcov_type count, gcov_type all) argument
[all...]
H A Dpredict.c198 probability_reliable_p (int prob) argument
202 && (prob <= HITRATE (1) || prob >= HITRATE (99))));
507 int prob = INTVAL (XEXP (prob_note, 0)); local
509 BRANCH_EDGE (bb)->probability = prob;
510 FALLTHRU_EDGE (bb)->probability = REG_BR_PROB_BASE - prob;
662 int prob; local
670 prob = (REG_BR_PROB_BASE
674 if (prob == REG_BR_PROB_BASE)
675 prob
[all...]
H A Dbb-reorder.c480 int prob, freq;
512 prob = e->probability;
522 best_prob = prob;
531 || prob < branch_th || EDGE_FREQUENCY (e) < exec_th
538 if (better_edge_p (bb, e, prob, freq, best_prob, best_freq,
542 best_prob = prob;
585 prob = e->probability;
590 || prob < branch_th || freq < exec_th
850 better_edge_p (basic_block bb, edge e, int prob, int freq, int best_prob,
860 if (prob > best_pro
479 int prob, freq; local
849 better_edge_p(basic_block bb, edge e, int prob, int freq, int best_prob, int best_freq, edge cur_best_edge) argument
[all...]
H A Dsched-rgn.c238 static int *prob;
1295 prob[bb] = REG_BR_PROB_BASE;
1299 prob[bb] = 0;
1325 prob[bb] += ((prob[pred_bb] * in_edge->probability) / REG_BR_PROB_BASE);
1333 (100 * prob[bb]) / REG_BR_PROB_BASE);
1382 int tf = prob[trg], cf = prob[i];
2723 prob = XNEWVEC (int, current_nr_blocks);
2862 free (prob);
237 static int *prob; variable
[all...]
H A Dcfgloopmanip.c422 int freq, prob, tot_prob; local
432 prob = EDGE_SUCC (switch_bb, 0)->probability;
433 tot_prob = prob + EDGE_SUCC (switch_bb, 1)->probability;
467 scale_loop_frequencies (loop, prob, tot_prob);
468 scale_loop_frequencies (succ_bb->loop_father, tot_prob - prob, tot_prob);
H A Dprofile.c533 int prob;
543 prob = e->probability;
544 index = prob * 20 / REG_BR_PROB_BASE;
1172 /* Perform file-level initialization for branch-prob processing. */
1192 /* Performs file-level cleanup after branch-prob processing
530 int prob; local
H A Dreorg.c983 int prob = INTVAL (XEXP (note, 0));
985 if (prob >= REG_BR_PROB_BASE * 9 / 10)
987 else if (prob >= REG_BR_PROB_BASE / 2)
989 else if (prob >= REG_BR_PROB_BASE / 10)
974 int prob = INTVAL (XEXP (note, 0)); local
H A Dcfgrtl.c1025 int prob = INTVAL (XEXP (note, 0));
1027 b->probability = prob;
1028 b->count = e->count * prob / REG_BR_PROB_BASE;
1018 int prob = INTVAL (XEXP (note, 0)); local
/freebsd-9.3-release/sbin/ipfw/
H A Ddummynet.c460 * "delay prob" | "prob delay"
479 prob delay
498 #define ED_TOK_PROB "prob"
567 double prob; member in struct:point
578 res = p1->prob - p2->prob;
683 points[points_no].prob = atof(arg);
686 points[points_no].prob = atof(name);
688 if (points[points_no].prob > 1.
[all...]
/freebsd-9.3-release/sys/contrib/xz-embedded/linux/lib/xz/
H A Dxz_dec_lzma2.c497 static __always_inline int rc_bit(struct rc_dec *rc, uint16_t *prob) argument
503 bound = (rc->range >> RC_BIT_MODEL_TOTAL_BITS) * *prob;
506 *prob += (RC_BIT_MODEL_TOTAL - *prob) >> RC_MOVE_BITS;
511 *prob -= *prob >> RC_MOVE_BITS;
/freebsd-9.3-release/contrib/pf/pfctl/
H A Dparse.y229 u_int32_t prob;
826 r.prob = $9.prob;
1879 r.prob = $9.prob;
2363 filter_opts.prob = (u_int32_t)p;
2364 if (filter_opts.prob == 0)
2365 filter_opts.prob = 1;
H A Dpfctl_parser.c860 if (r->prob) {
863 snprintf(buf, sizeof(buf), "%f", r->prob*100.0/(UINT_MAX+1.0));
H A Dpfctl_optimize.c112 PF_RULE_FIELD(prob, BARRIER),
/freebsd-9.3-release/contrib/sendmail/src/
H A Dmap.c1462 char *prob = "unsafe"; local
1466 prob = "missing";
1468 sm_dprintf("\t%s map file: %d\n", prob, ret);
1471 map->map_mname, prob, map->map_file);
2056 char *prob = "unsafe"; variable
2060 prob = "missing";
2062 sm_dprintf("\t%s map file: %s\n", prob, sm_errstring(i));
2066 mapclassname, map->map_mname, prob, buf);
/freebsd-9.3-release/sys/contrib/pf/net/
H A Dpf.c3622 else if (r->prob &&
3624 r->prob <= arc4random())
3626 r->prob <= arc4random_uniform(UINT_MAX - 1) + 1)
4136 else if (r->prob && r->prob <=
H A Dpfvar.h646 u_int32_t prob; member in struct:pf_rule
H A Dpf_ioctl.c1296 PF_MD5_UPD_HTONL(rule, prob, y);
/freebsd-9.3-release/contrib/gcc/config/rs6000/
H A Drs6000.c11614 int prob = INTVAL (XEXP (note, 0)) - REG_BR_PROB_BASE / 2;
11623 || (abs (prob) > REG_BR_PROB_BASE / 100 * 48
11626 if (abs (prob) > REG_BR_PROB_BASE / 20
11627 && ((prob > 0) ^ need_longbranch))
11585 int prob = INTVAL (XEXP (note, 0)) - REG_BR_PROB_BASE / 2; local

Completed in 896 milliseconds