HomeSort by relevance Sort by last modified time
    Searched defs:costs (Results 1 - 8 of 8) sorted by null

  /external/webp/src/enc/
cost_enc.h 36 CostArrayPtr costs; member in struct:VP8Residual
71 // Mode costs
quant_enc.c 566 const uint16_t* costs; // shortcut to cost tables member in struct:__anon38555
593 CostArrayPtr const costs = local
631 ss_cur[m].costs = costs[first][ctx0];
667 ss_cur[m].costs = costs[n + 1][ctx];
687 const score_t cost = VP8LevelCost(ss_prev[p].costs, level);
    [all...]
  /external/webp/src/dsp/
cost.c 50 // 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];
cost_mips32.c 24 CostArrayPtr const costs = res->costs; local
25 const uint16_t* t = costs[n][ctx0];
34 const uint16_t** p_costs = &costs[n][0];
cost_mips_dsp_r2.c 24 CostArrayPtr const costs = res->costs; local
25 const uint16_t* t = costs[n][ctx0];
34 const uint16_t** p_costs = &costs[n][0];
cost_sse2.c 51 CostArrayPtr const costs = res->costs; local
52 const uint16_t* t = costs[n][ctx0];
87 t = costs[n + 1][ctx];
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h 57 Vector costs; member in class:PBQP::Graph::NodeEntry
62 NodeEntry(const Vector &costs) : costs(costs), degree(0) {}
63 Vector& getCosts() { return costs; }
64 const Vector& getCosts() const { return costs; }
83 Matrix costs; member in class:PBQP::Graph::EdgeEntry
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
88 : node1(node1), node2(node2), costs(costs) {}
    [all...]
  /external/zopfli/src/zopfli/
squeeze.c 215 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[j + 1])
    [all...]

Completed in 1301 milliseconds