| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_cost.c | 38 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, in cost() argument
48 costs[-ii] = cc; in cost()
50 cost(costs, tree, probs, ii, cc); in cost()
54 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
55 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
58 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
61 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
62 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| D | vp9_cost.h | 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);
|
| /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/valgrind/callgrind/ |
| D | Makefile.am | 20 costs.h \
39 costs.c \
|
| /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 | quant.c | 528 const uint16_t* costs; // shortcut to cost tables member
556 const CostArray* const costs = enc->proba_.level_cost_[coeff_type]; in TrellisQuantizeBlock() local
593 ss_cur[m].costs = costs[VP8EncBands[first]][ctx0]; in TrellisQuantizeBlock()
627 ss_cur[m].costs = costs[band][ctx]; in TrellisQuantizeBlock()
653 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); in TrellisQuantizeBlock()
|
| /external/libpng/ |
| D | TODO | 18 (counting huffman bits/precompression? filter inertia? filter costs?).
|
| /external/llvm/test/Analysis/CostModel/X86/ |
| D | scalarize.ll | 4 ; Test vector scalarization costs.
|
| /external/llvm/test/Analysis/CostModel/ARM/ |
| D | select.ll | 66 ; odd vectors get legalized and should have similar costs
|
| D | cast.ll | 183 ; Floating point truncation costs.
195 ; Floating point extension costs.
|
| /external/junit/ |
| D | NOTICE | 58 …r Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Los…
66 …f rights under this Agreement, including but not limited to the risks and costs of program errors,…
|
| /external/emma/ |
| D | NOTICE | 83 every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collecti…
99 the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, …
|
| /external/jetty/ |
| D | MODULE_LICENSE_ECLIPSE1 | 48 …r Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Los…
54 … rights under this Agreement , including but not limited to the risks and costs of program errors,…
|
| /external/eclipse-windowbuilder/propertysheet/ |
| D | NOTICE | 128 costs (collectively "Losses") arising from claims, lawsuits and other
161 Agreement , including but not limited to the risks and costs of program
|
| /external/eclipse-basebuilder/ |
| D | NOTICE | 128 costs (collectively "Losses") arising from claims, lawsuits and other
161 Agreement , including but not limited to the risks and costs of program
|
| /external/valgrind/docs/internals/ |
| D | 3_7_BUGSTATUS.txt | 25 284904 Avoid cycles by disabling inclusive costs for cycles?
|
| D | tracking-fn-entry-exit.txt | 81 effect, costs of PLT functions are attributed to callers, and the call to
|
| /external/clang/docs/ |
| D | PTHInternals.rst | 112 copy-on-write costs. The read-only nature of PTH can greatly reduce
|
| /external/skia/gyp/ |
| D | common_conditions.gypi | 259 # For profiling; reveals some costs, exaggerates others (e.g. trivial setters & getters).
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | performance.buffer.data_upload.txt | 134 excluding ReadPixels' constant cost from the total constant costs in the other test
|
| /external/bison/data/m4sugar/ |
| D | foreach.m4 | 47 # costs additional time; therefore, in M4 1.6, where $@ recursion uses
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/about_files/ |
| D | mpl-v11.txt | 410 California, with the losing party responsible for costs, including
411 without limitation, court costs and reasonable attorneys' fees and
|