| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i,
50 costs[-ii] = cc;
52 cost(costs, tree, probs, ii, cc);
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) {
57 cost(costs, tree, probs, 0, 0);
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) {
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
64 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 51 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
52 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree);
|
| /device/linaro/bootloader/OpenPlatformPkg/Platforms/Hisilicon/HiKey/DeviceTree/ |
| hi6220-sched-energy.dtsi | 37 energy-costs {
|
| hi6220.dtsi | 94 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
106 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
117 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
128 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
139 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
150 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
161 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
172 sched-energy-costs = <&CPU_COST &CLUSTER_COST>;
|
| /external/webp/src/dsp/ |
| 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.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_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/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 185 // costs.
191 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1,
198 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity();
200 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0;
203 G.addEdge(node1, node2, std::move(costs));
213 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
223 if (costs[i + 1][j + 1] !=
225 costs[i + 1][j + 1] > sameParityMax)
226 sameParityMax = costs[i + 1][j + 1];
234 if (sameParityMax > costs[i + 1][j + 1]
[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...] |
| /external/toolchain-utils/bestflags/ |
| generation_test.py | 40 for all the tasks. After the costs of all the tasks are set, the Done method
|
| /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:__anon36796
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...] |
| cost_enc.c | 58 // Pre-calc level costs once for all
211 res->costs = enc->proba_.remapped_costs_[coeff_type];
216 // Mode costs
|
| /external/googletest/googletest/src/ |
| gtest.cc | [all...] |
| /external/libvpx/libvpx/third_party/googletest/src/src/ |
| gtest.cc | [all...] |
| /external/v8/testing/gtest/src/ |
| gtest.cc | [all...] |
| /external/valgrind/ |
| Android.mk | 410 callgrind/costs.c \
|
| /external/valgrind/callgrind/ |
| callgrind_annotate.in | 214 --inclusive=yes|no add subroutine costs to functions calls [no]
565 # inclusive costs
[all...] |
| /prebuilts/go/darwin-x86/src/compress/flate/ |
| huffman_bit_writer.go | 453 // We only bother calculating the costs of the extra bits required by
|
| /prebuilts/go/linux-x86/src/compress/flate/ |
| huffman_bit_writer.go | 453 // We only bother calculating the costs of the extra bits required by
|
| /prebuilts/go/darwin-x86/src/cmd/dist/ |
| test.go | [all...] |
| /prebuilts/go/linux-x86/src/cmd/dist/ |
| test.go | [all...] |
| /external/libvpx/libvpx/vpx_dsp/x86/ |
| subpel_variance_sse2.asm | 1092 ; a byte costs 1 pack and 2 unpacks, but saves a register.
[all...] |
