Home
last modified time | relevance | path

Searched refs:probability (Results 1 – 25 of 42) sorted by relevance

12

/src/contrib/xz/src/liblzma/lzma/
H A Dlzma_encoder_private.h39 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 …]
H A Dlzma_decoder.c98 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 …]
H A Dlzma_common.h147 literal_init(probability *probs, uint32_t lc, uint32_t lp) in literal_init()
H A Dlzma_encoder.c23 literal_matched(lzma_range_encoder *rc, probability *subcoder, in literal_matched()
50 probability *subcoder = literal_subcoder(coder->literal, in literal()
H A Dlzma_encoder_optimum_normal.c25 const probability *const subcoder = literal_subcoder(coder->literal, in get_literal_price()
/src/sbin/pfctl/tests/files/
H A Dpf0034.in1 #mixed af, probability
3 pass in probability 0.5
4 pass in probability 50%
5 pass in inet6 proto tcp from ::1 probability 0.8%
H A Dpf0034.ok3 pass in all flags S/SA keep state probability 50%
4 pass in all flags S/SA keep state probability 50%
5 pass in inet6 proto tcp from ::1 to any flags S/SA keep state probability 0.8%
/src/contrib/xz/src/liblzma/rangecoder/
H A Dprice.h29 rc_bit_price(const probability prob, const uint32_t bit) in rc_bit_price()
37 rc_bit_0_price(const probability prob) in rc_bit_0_price()
44 rc_bit_1_price(const probability prob) in rc_bit_1_price()
52 rc_bittree_price(const probability *const probs, in rc_bittree_price()
69 rc_bittree_reverse_price(const probability *const probs, in rc_bittree_reverse_price()
H A Drange_encoder.h51 probability *probs[RC_SYMBOLS_MAX];
79 rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit) in rc_bit()
88 rc_bittree(lzma_range_encoder *rc, probability *probs, in rc_bittree()
102 rc_bittree_reverse(lzma_range_encoder *rc, probability *probs, in rc_bittree_reverse()
208 probability prob = *rc->probs[rc->pos]; in rc_encode()
217 probability prob = *rc->probs[rc->pos]; in rc_encode()
297 probability prob = *rc->probs[pos]; in rc_encode_dummy()
304 probability prob = *rc->probs[pos]; in rc_encode_dummy()
H A Drange_common.h75 typedef uint16_t probability; typedef
H A Drange_decoder.h398 probability *p = &(prob); \
/src/crypto/openssl/doc/man3/
H A DBN_num_bytes.pod45 more probability).
H A DSSL_CTX_set_generate_session_id.pod60 Without the callback a random number is used, so that the probability
H A DBN_generate_prime.pod200 1 if it is prime with an error probability of less than 0.25^B<nchecks>, and
/src/contrib/llvm-project/compiler-rt/lib/gwp_asan/
H A Doptions.inc31 "The probability (1 / SampleRate) that an allocation is "
/src/contrib/jemalloc/doc_internal/
H A DPROFILING_INTERNALS.md22 - Each allocation has a non-zero probability of being sampled.
36 …ions more frequently than odd-indexed ones (so long as no allocation has zero sampling probability)
105 …ds only on its size). Our job is then: for each size class $Z$, pick a probability $p_Z$ that an a…
/src/sys/contrib/zstd/doc/
H A Dzstd_compression_format.md610 followed by optional probability tables for each symbol type,
1043 Note that there must be two or more symbols with nonzero probability.
1085 It means value `0` becomes negative probability `-1`.
1086 `-1` is a special probability, which means "less than 1".
1088 For the purpose of calculating total allocated probability points, it counts as one.
1120 Symbols with this probability are being attributed a single cell,
1126 each symbol gets allocated as many cells as its probability.
1135 A position is skipped if already occupied by a "less than 1" probability symbol.
1149 Presuming a symbol has a probability of 5,
/src/contrib/bzip2/
H A DREADME126 probability make it impossible to rule out the possibility of bugs
/src/sbin/pfctl/tests/
H A Dpfctl_test_list.inc65 PFCTL_TEST(0034, "Pass with probability")
/src/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerFlags.def32 "uniform probability distribution when choosing inputs to cross over with. "
/src/crypto/openssl/
H A DNOTES-NONSTOP.md65 is done, there is a high probability of encountering a SIGSEGV condition
/src/sys/contrib/zlib/doc/
H A Dalgorithm.txt184 entry table). Assuming that the code ideally represents the probability of
H A Drfc1950.txt482 still provides an extremely low probability of undetected errors.
/src/sbin/pfctl/
H A Dparse.y504 double probability; member
616 %type <v.probability> probability
3339 | PROBABILITY probability {
3559 probability : STRING {
/src/contrib/gdtoa/
H A DREADME225 a small probability of wasting memory, but would otherwise be harmless.)

12