HomeSort by relevance Sort by last modified time
    Searched full:probs (Results 1 - 25 of 69) sorted by null

1 2 3

  /external/lzma/Java/SevenZip/Compression/RangeCoder/
Decoder.java 54 public int DecodeBit(short []probs, int index) throws IOException
56 int prob = probs[index];
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
83 public static void InitBitModels(short []probs)
85 for (int i = 0; i < probs.length; i++)
86 probs[i] = (kBitModelTotal >>> 1);
Encoder.java 96 public static void InitBitModels(short []probs)
98 for (int i = 0; i < probs.length; i++)
99 probs[i] = (kBitModelTotal >>> 1);
102 public void Encode(short []probs, int index, int symbol) throws IOException
104 int prob = probs[index];
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
  /external/libvpx/libvpx/vp9/encoder/
vp9_cost.h 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
vp9_treewriter.h 32 const vp9_prob *probs, int bits, int len,
36 vp9_write(w, bit, probs[i >> 1]);
42 const vp9_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
vp9_cost.c 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
39 const vp9_prob prob = probs[i / 2];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
vp9_segmentation.c 73 static int cost_segmap(int *segcounts, vp9_prob *probs) {
82 int cost = c0123 * vp9_cost_zero(probs[0]) +
83 c4567 * vp9_cost_one(probs[0]);
87 cost += c01 * vp9_cost_zero(probs[1]) +
88 c23 * vp9_cost_one(probs[1]);
91 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
92 segcounts[1] * vp9_cost_one(probs[3]);
94 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
95 segcounts[3] * vp9_cost_one(probs[4]);
99 cost += c45 * vp9_cost_zero(probs[2])
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/
vp9_cost.h 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
vp9_treewriter.h 32 const vp9_prob *probs, int bits, int len,
36 vp9_write(w, bit, probs[i >> 1]);
42 const vp9_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
vp9_cost.c 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
39 const vp9_prob prob = probs[i / 2];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
vp9_segmentation.c 83 static int cost_segmap(int *segcounts, vp9_prob *probs) {
92 int cost = c0123 * vp9_cost_zero(probs[0]) +
93 c4567 * vp9_cost_one(probs[0]);
97 cost += c01 * vp9_cost_zero(probs[1]) +
98 c23 * vp9_cost_one(probs[1]);
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
102 segcounts[1] * vp9_cost_one(probs[3]);
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
105 segcounts[3] * vp9_cost_one(probs[4]);
109 cost += c45 * vp9_cost_zero(probs[2])
    [all...]
  /external/deqp/modules/gles2/stress/
es2sLongRunningTests.cpp 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
79 const Probs probs; member in struct:deqp::gles2::Stress::Case
80 Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles2::Stress::Case
208 const Probs probs; member in struct:deqp::gles2::Stress::Case
257 const Probs probs; member in struct:deqp::gles2::Stress::Case
    [all...]
  /external/deqp/modules/gles3/stress/
es3sLongRunningTests.cpp 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
79 const Probs probs; member in struct:deqp::gles3::Stress::Case
80 Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles3::Stress::Case
208 const Probs probs; member in struct:deqp::gles3::Stress::Case
257 const Probs probs; member in struct:deqp::gles3::Stress::Case
    [all...]
  /external/lzma/C/
LzmaDec.c 27 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
28 #define TREE_DECODE(probs, limit, i) \
29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
34 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
36 #define TREE_6_DECODE(probs, i) \
38 TREE_GET_BIT(probs, i); \
39 TREE_GET_BIT(probs, i); \
40 TREE_GET_BIT(probs, i); \
133 CLzmaProb *probs = p->probs; local
492 CLzmaProb *probs = p->probs; local
711 CLzmaProb *probs = p->probs; local
    [all...]
  /external/libvpx/libvpx/vp9/common/
vp9_prob.c 39 vp9_prob *probs) {
44 count_sat, max_update, probs);
49 count_sat, max_update, probs);
51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct,
58 unsigned int max_update_factor, vp9_prob *probs) {
60 max_update_factor, probs);
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_prob.c 39 vp9_prob *probs) {
44 count_sat, max_update, probs);
49 count_sat, max_update, probs);
51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct,
58 unsigned int max_update_factor, vp9_prob *probs) {
60 max_update_factor, probs);
  /external/libvpx/libvpx/vp8/common/
treecoder.c 113 vp8_prob probs [ /* n-1 */ ],
137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for now */
140 probs[t] = vp8_prob_half;
treecoder.h 74 vp8_prob probs [ /* n-1 */ ],
81 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
87 vp8_prob probs [ /* n-1 */ ],
entropymode.h 74 /* Key frame default mode probs */
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/
treecoder.c 113 vp8_prob probs [ /* n-1 */ ],
137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for now */
140 probs[t] = vp8_prob_half;
treecoder.h 74 vp8_prob probs [ /* n-1 */ ],
81 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
87 vp8_prob probs [ /* n-1 */ ],
entropymode.h 74 /* Key frame default mode probs */
  /external/libvpx/libvpx/vp9/decoder/
vp9_reader.h 106 const vp9_prob *probs) {
109 while ((i = tree[i + vp9_read(r, probs[i >> 1])]) > 0)
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/
vp9_reader.h 98 const vp9_prob *probs) {
101 while ((i = tree[i + vp9_read(r, probs[i >> 1])]) > 0)
  /external/lzma/xz-embedded/
xz_dec_lzma2.c 520 uint16_t *probs, uint32_t limit)
525 if (rc_bit(rc, &probs[symbol]))
536 uint16_t *probs,
543 if (rc_bit(rc, &probs[symbol])) {
583 uint16_t *probs; local
590 probs = lzma_literal_probs(s);
593 symbol = rc_bittree(&s->rc, probs, 0x100);
604 if (rc_bit(&s->rc, &probs[i])) {
622 uint16_t *probs; local
626 probs = l->low[pos_state]
648 uint16_t *probs; local
769 uint16_t *probs; local
    [all...]
  /external/opencv/ml/src/
mlem.cpp 74 means = weights = probs = inv_eigen_values = log_weight_div_det = 0;
81 means = weights = probs = inv_eigen_values = log_weight_div_det = 0;
100 cvReleaseMat( &probs );
138 if( !params.probs )
154 if( params.probs )
342 CV_CALL( probs = cvCreateMat( nsamples, nclusters, CV_64FC1 ));
376 prob.data.ptr = probs->data.ptr + probs->step*i;
415 cvGetRow( params.probs, &prob, i );
509 cvSetIdentity( probs );
    [all...]

Completed in 228 milliseconds

1 2 3