Searched defs:costs (Results 1 - 10 of 10) 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
48 costs[-ii] = cc;
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);
/external/webp/src/enc/
H A Dcost.h36 CostArrayPtr costs; member in struct:VP8Residual
57 // Mode costs
H A Dquant.c549 const uint16_t* costs; // shortcut to cost tables member in struct:__anon20550
576 CostArrayPtr const costs = local
614 ss_cur[m].costs = costs[first][ctx0];
648 ss_cur[m].costs = costs[n + 1][ctx];
674 const score_t cost = VP8LevelCost(ss_prev[p].costs, level);
/external/webp/src/dsp/
H A Dcost.c50 // fixed costs for coding levels, deduce from the coding tree.
320 // Mode costs
326 CostArrayPtr const costs = res->costs; local
327 const uint16_t* t = costs[n][ctx0];
340 t = costs[n + 1][ctx];
H A Dcost_mips32.c24 CostArrayPtr const costs = res->costs; local
25 const uint16_t* t = costs[n][ctx0];
34 const uint16_t** p_costs = &costs[n][0];
H A Dcost_mips_dsp_r2.c24 CostArrayPtr const costs = res->costs; local
25 const uint16_t* t = costs[n][ctx0];
34 const uint16_t** p_costs = &costs[n][0];
H A Dcost_sse2.c51 CostArrayPtr const costs = res->costs; local
52 const uint16_t* t = costs[n][ctx0];
87 t = costs[n + 1][ctx];
/external/opencv3/modules/flann/include/opencv2/flann/
H A Dautotuned_index.h322 void optimizeKMeans(std::vector<CostData>& costs) argument
331 costs.reserve(costs.size() + kmeansParamSpaceSize);
343 costs.push_back(cost);
370 void optimizeKDTree(std::vector<CostData>& costs) argument
383 costs.push_back(cost);
413 std::vector<CostData> costs; local
446 costs.push_back(linear_cost);
451 optimizeKMeans(costs);
452 optimizeKDTree(costs);
[all...]
/external/zopfli/src/zopfli/
H A Dsqueeze.c215 float* costs; local
229 costs = (float*)malloc(sizeof(float) * (blocksize + 1));
230 if (!costs) exit(-1); /* Allocation failed. */
238 for (i = 1; i < blocksize + 1; i++) costs[i] = ZOPFLI_LARGE_FLOAT;
239 costs[0] = 0; /* Because it's the start. */
243 size_t j = i - instart; /* Index in the costs array and length_array. */
259 costs[j + ZOPFLI_MAX_MATCH] = costs[j] + symbolcost;
273 double newCost = costs[j] + costmodel(in[i], 0, costcontext);
275 if (newCost < costs[
[all...]
/external/opencv3/3rdparty/libwebp/enc/
H A Dquant.c493 CostArray* const costs = it->enc_->proba_.level_cost_[coeff_type]; local
574 const uint16_t* const tcost = costs[VP8EncBands[n]][prev_ctx];

Completed in 305 milliseconds