| /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/opencv3/modules/flann/include/opencv2/flann/ |
| D | autotuned_index.h | 322 void optimizeKMeans(std::vector<CostData>& costs) in optimizeKMeans() argument
331 costs.reserve(costs.size() + kmeansParamSpaceSize); in optimizeKMeans()
343 costs.push_back(cost); in optimizeKMeans()
370 void optimizeKDTree(std::vector<CostData>& costs) in optimizeKDTree() argument
383 costs.push_back(cost); in optimizeKDTree()
413 std::vector<CostData> costs; in estimateBuildParams() local
446 costs.push_back(linear_cost); in estimateBuildParams()
451 optimizeKMeans(costs); in estimateBuildParams()
452 optimizeKDTree(costs); in estimateBuildParams()
454 float bestTimeCost = costs[0].searchTimeCost; in estimateBuildParams()
[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 \
|
| /external/libxml2/optim/ |
| D | hash_dict.txt | 2 costs. Not worth it unless validating big DTDs
|
| /external/webp/src/enc/ |
| D | cost.h | 36 CostArrayPtr costs; member
|
| D | quant.c | 549 const uint16_t* costs; // shortcut to cost tables member
576 CostArrayPtr const costs = in TrellisQuantizeBlock() local
614 ss_cur[m].costs = costs[first][ctx0]; in TrellisQuantizeBlock()
648 ss_cur[m].costs = costs[n + 1][ctx]; in TrellisQuantizeBlock()
674 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); in TrellisQuantizeBlock()
|
| D | cost.c | 211 res->costs = enc->proba_.remapped_costs_[coeff_type]; in VP8InitResidual()
|
| /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/autotest/test_suites/ |
| D | control.sanity | 21 restricted because of the potential performance costs.
|
| /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/dagger2/ |
| D | CHANGELOG.md | 74 * Cache class loading at the root injector to reduce costs of loading adapters.
|
| /external/caliper/caliper/src/main/resources/com/google/caliper/config/ |
| D | global-config.properties | 49 # Higher values take longer, but are more precise (less vulnerable to fixed costs)
|
| /external/llvm/test/Analysis/CostModel/ARM/ |
| D | select.ll | 66 ; odd vectors get legalized and should have similar costs
|
| /external/autotest/client/profilers/powertop/src/po/ |
| D | nl.po | 197 "Wake-on-Lan keeps the phy active, this costs power."
269 "not very efficient and costs a significant amount of battery life."
|
| /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/ |
| D | NOTICE | 133 against any losses, damages and costs (collectively "Losses")
168 the risks and costs of program errors, compliance with applicable laws,
|