Searched defs:probs (Results 1 - 24 of 24) sorted by relevance

/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_cost.c38 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, argument
40 const vpx_prob prob = probs[i / 2];
50 cost(costs, tree, probs, ii, cc);
54 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { argument
55 cost(costs, tree, probs, 0, 0);
58 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { argument
61 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
62 cost(costs, tree, probs, 2, 0);
H A Dvp9_cost.h34 static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs, argument
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree);
H A Dvp9_treewriter.h32 const vpx_prob *probs, int bits, int len,
36 vpx_write(w, bit, probs[i >> 1]);
42 const vpx_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
31 vp9_write_tree(vpx_writer *w, const vpx_tree_index *tree, const vpx_prob *probs, int bits, int len, vpx_tree_index i) argument
41 vp9_write_token(vpx_writer *w, const vpx_tree_index *tree, const vpx_prob *probs, const struct vp9_token *token) argument
H A Dvp9_segmentation.c69 static int cost_segmap(int *segcounts, vpx_prob *probs) { argument
78 int cost = c0123 * vp9_cost_zero(probs[0]) +
79 c4567 * vp9_cost_one(probs[0]);
83 cost += c01 * vp9_cost_zero(probs[1]) +
84 c23 * vp9_cost_one(probs[1]);
87 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
88 segcounts[1] * vp9_cost_one(probs[3]);
90 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
91 segcounts[3] * vp9_cost_one(probs[4]);
95 cost += c45 * vp9_cost_zero(probs[
[all...]
H A Dvp9_rd.c97 vpx_prob probs[ENTROPY_NODES]; local
98 vp9_model_to_full_probs(p[t][i][j][k][l], probs);
99 vp9_cost_tokens((int *)c[t][i][j][k][0][l], probs,
101 vp9_cost_tokens_skip((int *)c[t][i][j][k][1][l], probs,
H A Dvp9_bitstream.c48 const vpx_prob *probs) {
49 vp9_write_token(w, vp9_intra_mode_tree, probs, &intra_mode_encodings[mode]);
53 const vpx_prob *probs) {
55 vp9_write_token(w, vp9_inter_mode_tree, probs,
65 vpx_prob probs[/*n - 1*/],
76 vp9_cond_prob_diff_update(w, &probs[i], branch_ct[i]);
410 const vpx_prob *const probs = xd->partition_probs[ctx]; local
415 vp9_write_token(w, vp9_partition_tree, probs, &partition_encodings[p]);
418 vpx_write(w, p == PARTITION_SPLIT, probs[1]);
421 vpx_write(w, p == PARTITION_SPLIT, probs[
47 write_intra_mode(vpx_writer *w, PREDICTION_MODE mode, const vpx_prob *probs) argument
52 write_inter_mode(vpx_writer *w, PREDICTION_MODE mode, const vpx_prob *probs) argument
[all...]
/external/libvpx/libvpx/vpx_dsp/
H A Dprob.c36 vpx_prob *probs) {
40 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs);
44 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs);
46 probs[i >> 1] = mode_mv_merge_probs(pre_probs[i >> 1], ct);
51 const unsigned int *counts, vpx_prob *probs) {
52 tree_merge_probs_impl(0, tree, pre_probs, counts, probs);
32 tree_merge_probs_impl(unsigned int i, const vpx_tree_index *tree, const vpx_prob *pre_probs, const unsigned int *counts, vpx_prob *probs) argument
50 vpx_tree_merge_probs(const vpx_tree_index *tree, const vpx_prob *pre_probs, const unsigned int *counts, vpx_prob *probs) argument
H A Dbitreader.h127 const vpx_prob *probs) {
130 while ((i = tree[i + vpx_read(r, probs[i >> 1])]) > 0)
126 vpx_read_tree(vpx_reader *r, const vpx_tree_index *tree, const vpx_prob *probs) argument
/external/lzma/Java/SevenZip/Compression/RangeCoder/
H A DDecoder.java54 public int DecodeBit(short []probs, int index) throws IOException argument
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) argument
85 for (int i = 0; i < probs.length; i++)
86 probs[i] = (kBitModelTotal >>> 1);
H A DEncoder.java96 public static void InitBitModels(short []probs) argument
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 argument
104 int prob = probs[index];
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
/external/lzma/C/
H A DLzmaDec.h15 but memory usage for CLzmaDec::probs will be doubled in that case */
53 CLzmaProb *probs; member in struct:__anon11522
71 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
H A DLzmaDec.c27 #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,
133 CLzmaProb *probs = p->probs; local
492 CLzmaProb *probs = p->probs; local
711 CLzmaProb *probs = p->probs; local
[all...]
H A DLzmaEnc.c575 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol) argument
580 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1);
586 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte) argument
593 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1);
636 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices) argument
642 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);
649 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt32 *ProbPrices) argument
657 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);
666 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol) argument
675 RangeEnc_EncodeBit(rc, probs
680 RcTree_ReverseEncode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol) argument
693 RcTree_GetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices) argument
705 RcTree_ReverseGetPrice(const CLzmaProb *probs, int numBitLevels, UInt32 symbol, UInt32 *ProbPrices) argument
1012 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1225 const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); local
1782 CLzmaProb *probs; local
1980 CLzmaProb *probs = p->posSlotEncoder[i]; local
[all...]
/external/deqp/modules/gles2/stress/
H A Des2sLongRunningTests.cpp79 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_) {}
123 contexts, cases[caseNdx].probs,
151 const Probs probs; member in struct:deqp::gles2::Stress::Case
152 Case (const char* const name_, const char* const desc_, int numTextures_, const Probs& probs_ = Probs()) : name(name_), desc(desc_), numTextures(numTextures_), probs(probs_) {}
191 contexts, cases[caseNdx].probs,
208 const Probs probs; member in struct:deqp::gles2::Stress::Case
210 : name(name_), desc(desc_), drawCallsPerIteration(calls), numTrisPerDrawCall(tris), probs(probs_) {}
241 contexts, cases[caseNdx].probs,
257 const Probs probs; member in struct:deqp::gles2::Stress::Case
[all...]
/external/deqp/modules/gles3/stress/
H A Des3sLongRunningTests.cpp79 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_) {}
123 contexts, cases[caseNdx].probs,
151 const Probs probs; member in struct:deqp::gles3::Stress::Case
152 Case (const char* const name_, const char* const desc_, int numTextures_, const Probs& probs_ = Probs()) : name(name_), desc(desc_), numTextures(numTextures_), probs(probs_) {}
191 contexts, cases[caseNdx].probs,
208 const Probs probs; member in struct:deqp::gles3::Stress::Case
210 : name(name_), desc(desc_), drawCallsPerIteration(calls), numTrisPerDrawCall(tris), probs(probs_) {}
241 contexts, cases[caseNdx].probs,
257 const Probs probs; member in struct:deqp::gles3::Stress::Case
[all...]
/external/libvpx/libvpx/vp9/common/
H A Dvp9_entropy.c745 static void extend_to_full_distribution(vpx_prob *probs, vpx_prob p) { argument
746 memcpy(probs, vp9_pareto8_full[p = 0 ? 0 : p - 1],
774 vp9_coeff_probs_model *const probs = cm->fc->coef_probs[tx_size]; local
795 probs[i][j][k][l][m] = merge_probs(pre_probs[i][j][k][l][m],
/external/libvpx/libvpx/vp9/decoder/
H A Dvp9_detokenize.c41 static INLINE int read_coeff(const vpx_prob *probs, int n, vpx_reader *r) { argument
44 val = (val << 1) | vpx_read(r, probs[i]);
H A Dvp9_decodeframe.c930 const vpx_prob *const probs = get_partition_probs(xd, ctx); local
935 p = (PARTITION_TYPE)vpx_read_tree(r, vp9_partition_tree, probs);
937 p = vpx_read(r, probs[1]) ? PARTITION_SPLIT : PARTITION_HORZ;
939 p = vpx_read(r, probs[2]) ? PARTITION_SPLIT : PARTITION_VERT;
/external/webrtc/src/common_audio/vad/
H A Dvad_core.c349 WebRtc_Word32 probn[NUM_MODELS], probs[NUM_MODELS]; local
412 probs[0] = (WebRtc_Word32)(kSpeechDataWeights[n] * tmp32_1);
415 probs[1] = (WebRtc_Word32)(kSpeechDataWeights[n + NUM_CHANNELS] * tmp32_1);
416 h1test = probs[0] + probs[1]; // Q27
462 tmp32_1 = probs[0] & 0xFFFFF000;
/external/libvpx/libvpx/vp8/encoder/
H A Dbitstream.c822 const unsigned int probs[PREV_COEF_CONTEXTS][MAX_ENTROPY_TOKENS],
831 out[i] += probs[j][i];
864 const unsigned int (*probs)[MAX_ENTROPY_TOKENS];
869 probs = (const unsigned int (*)[MAX_ENTROPY_TOKENS])
874 probs = default_coef_counts[i][j];
876 sum_probs_over_prev_coef_context(probs, prev_coef_count_sum);
882 /* calc probs and branch cts for this frame only */
942 /* calc probs and branch cts for this frame only */
1122 /* calc probs and branch cts for this frame only */
1381 /* Write the probs use
821 sum_probs_over_prev_coef_context( const unsigned int probs[PREV_COEF_CONTEXTS][MAX_ENTROPY_TOKENS], unsigned int* out) argument
[all...]
/external/lzma/xz-embedded/
H A Dxz_dec_lzma2.c520 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
519 rc_bittree(struct rc_dec *rc, uint16_t *probs, uint32_t limit) argument
535 rc_bittree_reverse(struct rc_dec *rc, uint16_t *probs, uint32_t *dest, uint32_t limit) argument
648 uint16_t *probs; local
769 uint16_t *probs; local
[all...]
/external/opencv/ml/src/
H A Dml_inner_functions.cpp184 where Pr{xi = k} == probs[k], 0 < k < len - 1. */
185 CV_IMPL void cvRandSeries( float probs[], int len, int sample[], int amount ) argument
195 knots[0] = probs[0];
197 knots[i] = knots[i - 1] + probs[i];
1415 const CvMat* probs, CvMat* dst_probs,
1492 if( dst_probs && (!probs || probs->data.ptr != dst_probs->data.ptr) )
1494 if( !probs )
1495 CV_ERROR( CV_StsNullPtr, "NULL probs" );
1497 if( probs
1413 cvWritebackLabels( const CvMat* labels, CvMat* dst_labels, const CvMat* centers, CvMat* dst_centers, const CvMat* probs, CvMat* dst_probs, const CvMat* sample_idx, int samples_all, const CvMat* comp_idx, int dims_all ) argument
1888 icvFindClusterLabels( const CvMat* probs, float outlier_thresh, float r, const CvMat* labels ) argument
[all...]
/external/opencv/ml/include/
H A Dml.h562 start_step(0/*CvEM::START_AUTO_STEP*/), probs(0), weights(0), means(0), covs(0)
572 probs(_probs), weights(_weights), means(_means), covs(_covs), term_crit(_term_crit)
578 const CvMat* probs; member in struct:CvEMParams
604 virtual float predict( const CvMat* sample, CvMat* probs ) const;
631 CvMat* probs; member in class:CvEM
/external/toybox/toys/pending/
H A Dxzcat.c1668 uint16_t *probs, uint32_t limit)
1673 if (rc_bit(rc, &probs[symbol]))
1684 uint16_t *probs,
1691 if (rc_bit(rc, &probs[symbol])) {
1731 uint16_t *probs; local
1738 probs = lzma_literal_probs(s);
1741 symbol = rc_bittree(&s->rc, probs, 0x100);
1752 if (rc_bit(&s->rc, &probs[i])) {
1770 uint16_t *probs; local
1774 probs
1667 rc_bittree(struct rc_dec *rc, uint16_t *probs, uint32_t limit) argument
1683 rc_bittree_reverse(struct rc_dec *rc, uint16_t *probs, uint32_t *dest, uint32_t limit) argument
1796 uint16_t *probs; local
1917 uint16_t *probs; local
[all...]

Completed in 520 milliseconds