| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
50 costs[-ii] = cc; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| D | 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);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 57 Vector costs;
62 NodeEntry(const Vector &costs) : costs(costs), degree(0) {} in NodeEntry() argument
63 Vector& getCosts() { return costs; } in getCosts()
64 const Vector& getCosts() const { return costs; } in getCosts()
83 Matrix costs; variable
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) in EdgeEntry() argument
88 : node1(node1), node2(node2), costs(costs) {} in EdgeEntry()
91 Matrix& getCosts() { return costs; } in getCosts()
92 const Matrix& getCosts() const { return costs; } in getCosts()
168 NodeItr addNode(const Vector &costs) { in addNode() argument
[all …]
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 191 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
198 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
200 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
213 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
223 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
225 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
226 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
234 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
235 costs[i + 1][j + 1] = sameParityMax + 1.0; in addIntraChainConstraint()
[all …]
|
| /external/zopfli/src/zopfli/ |
| D | squeeze.c | 215 float* costs; in GetBestLengths() local
229 costs = (float*)malloc(sizeof(float) * (blocksize + 1)); in GetBestLengths()
230 if (!costs) exit(-1); /* Allocation failed. */ in GetBestLengths()
238 for (i = 1; i < blocksize + 1; i++) costs[i] = ZOPFLI_LARGE_FLOAT; in GetBestLengths()
239 costs[0] = 0; /* Because it's the start. */ in GetBestLengths()
259 costs[j + ZOPFLI_MAX_MATCH] = costs[j] + symbolcost; in GetBestLengths()
273 double newCost = costs[j] + costmodel(in[i], 0, costcontext); in GetBestLengths()
275 if (newCost < costs[j + 1]) { in GetBestLengths()
276 costs[j + 1] = newCost; in GetBestLengths()
286 if (costs[j + k] - costs[j] <= mincost) continue; in GetBestLengths()
[all …]
|
| /external/webp/src/dsp/ |
| D | cost_mips_dsp_r2.c | 24 CostArrayPtr const costs = res->costs; in GetResidualCost() local
25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost()
34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost()
|
| D | cost.c | 326 CostArrayPtr const costs = res->costs; in GetResidualCost() local
327 const uint16_t* t = costs[n][ctx0]; in GetResidualCost()
340 t = costs[n + 1][ctx]; in GetResidualCost()
|
| D | cost_mips32.c | 24 CostArrayPtr const costs = res->costs; in GetResidualCost() local
25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost()
34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost()
|
| D | cost_sse2.c | 51 CostArrayPtr const costs = res->costs; in GetResidualCostSSE2() local
52 const uint16_t* t = costs[n][ctx0]; in GetResidualCostSSE2()
87 t = costs[n + 1][ctx]; in GetResidualCostSSE2()
|
| /external/valgrind/callgrind/ |
| D | Makefile.am | 20 costs.h \
39 costs.c \
|
| D | Makefile.in | 134 callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.$(OBJEXT) \
147 callstack.c clo.c context.c costs.c debug.c dump.c events.c \
154 callgrind_@VGCONF_ARCH_SEC@_@VGCONF_OS@-costs.$(OBJEXT) \
869 costs.h \
879 costs.c \
1038 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.Po@a…
1052 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/callgrind_@VGCONF_ARCH_SEC@_@VGCONF_OS@-costs.Po@a…
1148 callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.o: costs.c
1149 …costs.o -MD -MP -MF $(DEPDIR)/callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.Tpo -c -o callgrind_@V…
1150 …IR)/callgrind_@VGCONF_ARCH_PRI@_@VGCONF_OS@-costs.Tpo $(DEPDIR)/callgrind_@VGCONF_ARCH_PRI@_@VGCON…
[all …]
|
| /external/libxml2/optim/ |
| D | hash_dict.txt | 2 costs. Not worth it unless validating big DTDs
|
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| D | vect.omp.force.ll | 25 ; This loop will be vectorized, although the scalar cost is lower than any of vector costs, but vec…
55 ; This method will not be vectorized, as scalar cost is lower than any of vector costs.
|
| D | vector-scalar-select-cost.ll | 3 ; Make sure we use the right select kind when querying select costs.
|
| /external/webp/src/enc/ |
| D | cost_enc.h | 36 CostArrayPtr costs; member
|
| D | quant_enc.c | 566 const uint16_t* costs; // shortcut to cost tables member
593 CostArrayPtr const costs = in TrellisQuantizeBlock() local
631 ss_cur[m].costs = costs[first][ctx0]; in TrellisQuantizeBlock()
667 ss_cur[m].costs = costs[n + 1][ctx]; in TrellisQuantizeBlock()
687 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); in TrellisQuantizeBlock()
|
| D | cost_enc.c | 211 res->costs = enc->proba_.remapped_costs_[coeff_type]; in VP8InitResidual()
|
| /external/autotest/test_suites/ |
| D | control.sanity | 20 restricted because of the potential performance costs.
|
| /external/libpng/ |
| D | TODO | 19 (counting huffman bits/precompression? filter inertia? filter costs?).
|
| /external/llvm/test/Analysis/CostModel/X86/ |
| D | scalarize.ll | 4 ; Test vector scalarization costs.
|
| /external/syslinux/com32/lib/libpng/ |
| D | TODO | 17 (counting huffman bits/precompression? filter inertia? filter costs?).
|
| /external/v8/testing/gtest/src/ |
| D | gtest.cc | 1030 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1036 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1037 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1041 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1042 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1050 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1055 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1056 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1057 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1059 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
|
| /external/libvpx/libvpx/third_party/googletest/src/src/ |
| D | gtest.cc | 1030 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1036 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1037 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1041 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1042 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1050 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1055 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1056 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1057 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1059 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
|
| /external/googletest/googletest/src/ |
| D | gtest.cc | 1027 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1033 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1034 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1038 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1039 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1047 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1052 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1053 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1054 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1056 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
|
| /external/dagger2/ |
| D | CHANGELOG.md | 74 * Cache class loading at the root injector to reduce costs of loading adapters.
|