Home
last modified time | relevance | path

Searched refs:prob (Results 1 – 25 of 35) sorted by relevance

12

/src/contrib/xz/src/liblzma/rangecoder/
H A Drange_decoder.h181 #define rc_if_0(prob) \ argument
183 rc_bound = (rc.range >> RC_BIT_MODEL_TOTAL_BITS) * (prob); \
187 #define rc_if_0_safe(prob, seq) \ argument
189 rc_bound = (rc.range >> RC_BIT_MODEL_TOTAL_BITS) * (prob); \
198 #define rc_update_0(prob) \ argument
201 prob += (RC_BIT_MODEL_TOTAL - (prob)) >> RC_MOVE_BITS; \
208 #define rc_update_1(prob) \ argument
212 prob -= (prob) >> RC_MOVE_BITS; \
220 #define rc_bit_last(prob, action0, action1) \ argument
222 rc_if_0(prob) { \
[all …]
H A Drange_encoder.h79 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit) in rc_bit() argument
82 rc->probs[rc->count] = prob; in rc_bit()
208 probability prob = *rc->probs[rc->pos]; in rc_encode() local
210 * prob; in rc_encode()
211 prob += (RC_BIT_MODEL_TOTAL - prob) >> RC_MOVE_BITS; in rc_encode()
212 *rc->probs[rc->pos] = prob; in rc_encode()
217 probability prob = *rc->probs[rc->pos]; in rc_encode() local
218 const uint32_t bound = prob * (rc->range in rc_encode()
222 prob -= prob >> RC_MOVE_BITS; in rc_encode()
223 *rc->probs[rc->pos] = prob; in rc_encode()
[all …]
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit) in rc_bit_price() argument
31 return lzma_rc_prices[(prob ^ ((UINT32_C(0) - bit) in rc_bit_price()
37 rc_bit_0_price(const probability prob) in rc_bit_0_price() argument
39 return lzma_rc_prices[prob >> RC_MOVE_REDUCING_BITS]; in rc_bit_0_price()
44 rc_bit_1_price(const probability prob) in rc_bit_1_price() argument
46 return lzma_rc_prices[(prob ^ (RC_BIT_MODEL_TOTAL - 1)) in rc_bit_1_price()
H A Drange_common.h39 #define bit_reset(prob) \ argument
40 prob = RC_BIT_MODEL_TOTAL >> 1
/src/sys/netpfil/ipfw/
H A Ddn_aqm_pie.c204 int64_t p, prob, oldprob; in calculate_drop_prob() local
210 prob = pst->drop_prob; in calculate_drop_prob()
239 if (prob < (PIE_MAX_PROB / 1000000)) /* 0.000001 */ in calculate_drop_prob()
241 else if (prob < (PIE_MAX_PROB / 100000)) /* 0.00001 */ in calculate_drop_prob()
243 else if (prob < (PIE_MAX_PROB / 10000)) /* 0.0001 */ in calculate_drop_prob()
245 else if (prob < (PIE_MAX_PROB / 1000)) /* 0.001 */ in calculate_drop_prob()
247 else if (prob < (PIE_MAX_PROB / 100)) /* 0.01 */ in calculate_drop_prob()
249 else if (prob < (PIE_MAX_PROB / 10)) /* 0.1 */ in calculate_drop_prob()
254 oldprob = prob; in calculate_drop_prob()
257 prob = prob - p; in calculate_drop_prob()
[all …]
H A Ddn_sched_fq_pie.c382 int64_t p, prob, oldprob; in fq_calculate_drop_prob() local
386 prob = pst->drop_prob; in fq_calculate_drop_prob()
415 if (prob < (PIE_MAX_PROB / 1000000)) /* 0.000001 */ in fq_calculate_drop_prob()
417 else if (prob < (PIE_MAX_PROB / 100000)) /* 0.00001 */ in fq_calculate_drop_prob()
419 else if (prob < (PIE_MAX_PROB / 10000)) /* 0.0001 */ in fq_calculate_drop_prob()
421 else if (prob < (PIE_MAX_PROB / 1000)) /* 0.001 */ in fq_calculate_drop_prob()
423 else if (prob < (PIE_MAX_PROB / 100)) /* 0.01 */ in fq_calculate_drop_prob()
425 else if (prob < (PIE_MAX_PROB / 10)) /* 0.1 */ in fq_calculate_drop_prob()
430 oldprob = prob; in fq_calculate_drop_prob()
433 prob = prob - p; in fq_calculate_drop_prob()
[all …]
/src/contrib/libarchive/libarchive/
H A Darchive_ppmd_private.h95 #define PPMD_UPDATE_PROB_0(prob) ((prob) + (1 << PPMD_INT_BITS) - PPMD_GET_MEAN(prob)) argument
96 #define PPMD_UPDATE_PROB_1(prob) ((prob) - PPMD_GET_MEAN(prob)) argument
H A Darchive_ppmd7.c910 UInt16 *prob = Ppmd7_GetBinSumm(p); in Ppmd7_DecodeSymbol() local
911 if (rc->DecodeBit(rc, *prob) == 0) in Ppmd7_DecodeSymbol()
914 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob); in Ppmd7_DecodeSymbol()
919 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob); in Ppmd7_DecodeSymbol()
920 p->InitEsc = PPMD7_kExpEscape[*prob >> 10]; in Ppmd7_DecodeSymbol()
1089 UInt16 *prob = Ppmd7_GetBinSumm(p); in Ppmd7_EncodeSymbol() local
1093 RangeEnc_EncodeBit_0(rc, *prob); in Ppmd7_EncodeSymbol()
1094 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob); in Ppmd7_EncodeSymbol()
1101 RangeEnc_EncodeBit_1(rc, *prob); in Ppmd7_EncodeSymbol()
1102 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob); in Ppmd7_EncodeSymbol()
[all …]
H A Darchive_ppmd8.c1206 UInt16 *prob = Ppmd8_GetBinSumm(p); in Ppmd8_DecodeSymbol() local
1207 if (((p->Code / (p->Range >>= 14)) < *prob)) in Ppmd8_DecodeSymbol()
1210 RangeDec_Decode(p, 0, *prob); in Ppmd8_DecodeSymbol()
1211 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob); in Ppmd8_DecodeSymbol()
1216 RangeDec_Decode(p, *prob, (1 << 14) - *prob); in Ppmd8_DecodeSymbol()
1217 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob); in Ppmd8_DecodeSymbol()
1218 p->InitEsc = PPMD8_kExpEscape[*prob >> 10]; in Ppmd8_DecodeSymbol()
H A Darchive_read_support_format_7zip.c4442 CProb *prob; in Bcj2_Decode() local
4471 prob = zip->bcj2_p + zip->bcj2_prevByte; in Bcj2_Decode()
4473 prob = zip->bcj2_p + 256; in Bcj2_Decode()
4475 prob = zip->bcj2_p + 257; in Bcj2_Decode()
4477 IF_BIT_0(prob) { in Bcj2_Decode()
4478 UPDATE_0(prob) in Bcj2_Decode()
4485 UPDATE_1(prob) in Bcj2_Decode()
/src/tests/atf_python/sys/netpfil/ipfw/
H A Dinsns.py338 prob=0.0, argument
341 self.prob = prob
344 def prob(self): member in InsnProb
347 @prob.setter
348 def prob(self, prob: float): member in InsnProb
349 self.u32 = int(prob * 0x7FFFFFFF)
352 return " prob={}".format(round(self.prob, 5))
/src/sys/contrib/xz-embedded/linux/lib/xz/
H A Dxz_dec_lzma2.c529 static __always_inline int rc_bit(struct rc_dec *rc, uint16_t *prob) in rc_bit() argument
535 bound = (rc->range >> RC_BIT_MODEL_TOTAL_BITS) * *prob; in rc_bit()
538 *prob += (RC_BIT_MODEL_TOTAL - *prob) >> RC_MOVE_BITS; in rc_bit()
543 *prob -= *prob >> RC_MOVE_BITS; in rc_bit()
/src/sbin/ipfw/
H A Ddummynet.c849 double prob; member
860 res = p1->prob - p2->prob; in compare_points()
964 points[points_no].prob = atof(arg); in load_extra_delays()
967 points[points_no].prob = atof(name); in load_extra_delays()
969 if (points[points_no].prob > 1.0) in load_extra_delays()
998 double y1 = points[i].prob * samples; in load_extra_delays()
1000 double y2 = points[i+1].prob * samples; in load_extra_delays()
/src/contrib/libfido2/fuzz/
H A Dwrap.c36 #define WRAP(type, name, args, retval, param, prob) \ argument
40 if (prng_up && uniform_random(400) < (prob)) { \
/src/contrib/llvm-project/llvm/include/llvm/Passes/
H A DMachinePassRegistry.def100 MACHINE_FUNCTION_ANALYSIS("machine-branch-prob",
141 MACHINE_FUNCTION_PASS("print<machine-branch-prob>",
/src/contrib/sendmail/src/
H A Dmap.c1739 char *prob = "unsafe"; local
1743 prob = "missing";
1745 sm_dprintf("\t%s map file: %d\n", prob, ret);
1748 map->map_mname, prob, map->map_file);
2313 char *prob = "unsafe"; variable
2317 prob = "missing";
2319 sm_dprintf("\t%s map file %s: %s\n", prob, buf, sm_errstring(i));
2323 mapclassname, map->map_mname, prob, buf);
2927 char *prob = "unsafe"; local
2931 prob = "missing";
[all …]
/src/sys/netpfil/pf/
H A Dpf.h563 u_int32_t prob; member
H A Dpf_nv.c581 PFNV_CHK(pf_nvuint32(nvl, "prob", &rule->prob)); in pf_nvrule_to_krule()
758 nvlist_add_number(nvl, "prob", rule->prob); in pf_krule_to_nvrule()
/src/contrib/llvm-project/llvm/lib/Passes/
H A DPassRegistry.def266 FUNCTION_ANALYSIS("branch-prob", BranchProbabilityAnalysis())
421 FUNCTION_PASS("print<branch-prob>", BranchProbabilityPrinterPass(dbgs()))
/src/sbin/ipfw/tests/
H A Dtest_add_rule.py639 "out": InsnProb(prob=0.7),
/src/lib/libpfctl/
H A Dlibpfctl.h232 uint32_t prob; member
/src/sbin/pfctl/
H A Dpfctl_parser.c1100 if (r->prob) { in print_rule()
1103 snprintf(buf, sizeof(buf), "%f", r->prob*100.0/(UINT_MAX+1.0)); in print_rule()
H A Dparse.y293 u_int32_t prob; member
3347 filter_opts.prob = (u_int32_t)p;
3348 if (filter_opts.prob == 0)
3349 filter_opts.prob = 1;
8244 r->prob = opts->prob; in filteropts_to_rule()
H A Dpfctl_optimize.c110 PF_RULE_FIELD(prob, BARRIER),
/src/tools/tools/netmap/
H A Dnmreplay.c1464 so actual loss prob. depends on size.

12