/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 38 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 D | vp9_cost.h | 34 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 D | vp9_treewriter.h | 32 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 D | vp9_segmentation.c | 69 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...] |
/external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/ |
H A D | RangeDecoder.java | 22 public int decodeBit(short[] probs, int index) throws IOException { argument 25 int prob = probs[index]; 32 probs[index] = (short)( 38 probs[index] = (short)(prob - (prob >>> MOVE_BITS)); 45 public int decodeBitTree(short[] probs) throws IOException { argument 49 symbol = (symbol << 1) | decodeBit(probs, symbol); 50 } while (symbol < probs.length); 52 return symbol - probs.length; 55 public int decodeReverseBitTree(short[] probs) throws IOException { argument 61 int bit = decodeBit(probs, symbo [all...] |
H A D | RangeCoder.java | 23 public static final void initProbs(short[] probs) { argument 24 Arrays.fill(probs, PROB_INIT);
|
H A D | RangeEncoder.java | 104 public void encodeBit(short[] probs, int index, int bit) { argument 105 int prob = probs[index]; 111 probs[index] = (short)( 116 probs[index] = (short)(prob - (prob >>> MOVE_BITS)); 132 public void encodeBitTree(short[] probs, int symbol) { argument 134 int mask = probs.length; 139 encodeBit(probs, index, bit); 148 public static int getBitTreePrice(short[] probs, int symbol) { argument 150 symbol |= probs.length; 155 price += getBitPrice(probs[symbo 161 encodeReverseBitTree(short[] probs, int symbol) argument 173 getReverseBitTreePrice(short[] probs, int symbol) argument [all...] |
/external/libvpx/libvpx/vpx_dsp/ |
H A D | prob.c | 36 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 D | bitreader.h | 127 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
|
H A D | prob.h | 94 const unsigned int *counts, vpx_prob *probs);
|
/external/lzma/Java/SevenZip/Compression/RangeCoder/ |
H A D | Decoder.java | 54 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 D | Encoder.java | 96 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 D | LzmaDec.c | 29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
30 #define TREE_DECODE(probs, limit, i) \
31 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
36 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
38 #define TREE_6_DECODE(probs, i) \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs, 142 CLzmaProb *probs = p->probs; local 525 CLzmaProb *probs = p->probs; local 744 CLzmaProb *probs = p->probs; local [all...] |
H A D | LzmaDec.h | 13 but memory usage for CLzmaDec::probs will be doubled in that case */
51 CLzmaProb *probs;
member in struct:__anon13034 69 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
/external/libvpx/libvpx/vp8/common/ |
H A D | 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 */ ],
|
H A D | 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;
|
/external/opencv3/modules/java/src/ |
H A D | ml+EM.java | 142 // C++: Vec2d predict2(Mat sample, Mat& probs) 145 //javadoc: EM::predict2(sample, probs) 146 public double[] predict2(Mat sample, Mat probs) argument 149 double[] retVal = predict2_0(nativeObj, sample.nativeObj, probs.nativeObj); 156 // C++: bool trainEM(Mat samples, Mat& logLikelihoods = Mat(), Mat& labels = Mat(), Mat& probs = Mat()) 159 //javadoc: EM::trainEM(samples, logLikelihoods, labels, probs) 160 public boolean trainEM(Mat samples, Mat logLikelihoods, Mat labels, Mat probs) argument 163 boolean retVal = trainEM_0(nativeObj, samples.nativeObj, logLikelihoods.nativeObj, labels.nativeObj, probs.nativeObj); 179 // C++: bool trainE(Mat samples, Mat means0, Mat covs0 = Mat(), Mat weights0 = Mat(), Mat& logLikelihoods = Mat(), Mat& labels = Mat(), Mat& probs = Mat()) 182 //javadoc: EM::trainE(samples, means0, covs0, weights0, logLikelihoods, labels, probs) 183 trainE(Mat samples, Mat means0, Mat covs0, Mat weights0, Mat logLikelihoods, Mat labels, Mat probs) argument 206 trainM(Mat samples, Mat probs0, Mat logLikelihoods, Mat labels, Mat probs) argument [all...] |
/external/deqp/modules/gles2/stress/ |
H A D | es2sLongRunningTests.cpp | 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_) {} 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 D | es3sLongRunningTests.cpp | 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_) {} 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/opencv3/modules/ml/src/ |
H A D | em.cpp | 121 OutputArray probs) 125 return doTrain(START_AUTO_STEP, logLikelihoods, labels, probs); 134 OutputArray probs) 144 return doTrain(START_E_STEP, logLikelihoods, labels, probs); 151 OutputArray probs) 157 return doTrain(START_M_STEP, logLikelihoods, labels, probs); 163 Mat samples = _inputs.getMat(), probs, probsrow; local 180 probsrow = probs.row(i); 203 Mat probs; local 209 probs 118 trainEM(InputArray samples, OutputArray logLikelihoods, OutputArray labels, OutputArray probs) argument 128 trainE(InputArray samples, InputArray _means0, InputArray _covs0, InputArray _weights0, OutputArray logLikelihoods, OutputArray labels, OutputArray probs) argument 147 trainM(InputArray samples, InputArray _probs0, OutputArray logLikelihoods, OutputArray labels, OutputArray probs) argument 235 checkTrainData(int startStep, const Mat& samples, int nclusters, int covMatType, const Mat* probs, const Mat* means, const std::vector<Mat>* covs, const Mat* weights) argument 302 preprocessProbability(Mat& probs) argument 475 doTrain(int startStep, OutputArray logLikelihoods, OutputArray labels, OutputArray probs) argument 557 computeProbabilities(const Mat& sample, Mat* probs, int ptype) const argument [all...] |
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_entropy.c | 745 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/lzma/xz-embedded/ |
H A D | 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 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/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
H A D | LZMACoder.java | 109 final short[] probs = new short[0x300]; field in class:LZMACoder.LiteralCoder.LiteralSubcoder 112 RangeCoder.initProbs(probs);
|
/external/opencv/ml/src/ |
H A D | ml_inner_functions.cpp | 184 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/opencv3/apps/traincascade/ |
H A D | old_ml_inner_functions.cpp | 184 where Pr{xi = k} == probs[k], 0 < k < len - 1. */ 185 static void cvRandSeries( float probs[], int len, int sample[], int amount ) argument 195 knots[0] = probs[0]; 197 knots[i] = knots[i - 1] + probs[i]; 1341 const CvMat* probs, CvMat* dst_probs, 1418 if( dst_probs && (!probs || probs->data.ptr != dst_probs->data.ptr) ) 1420 if( !probs ) 1421 CV_ERROR( CV_StsNullPtr, "NULL probs" ); 1423 if( probs 1339 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 1814 icvFindClusterLabels( const CvMat* probs, float outlier_thresh, float r, const CvMat* labels ) argument [all...] |