/external/tensorflow/tensorflow/core/grappler/costs/ |
D | op_level_cost_estimator_test.cc | 1020 auto costs = predict_max_pool(10, 20, 384, 3, 2, "SAME"); in TEST_F() local 1021 EXPECT_EQ(Costs::Duration(1075200), costs.execution_time); in TEST_F() 1022 EXPECT_EQ(Costs::Duration(307200), costs.compute_time); in TEST_F() 1023 EXPECT_EQ(Costs::Duration(768000), costs.memory_time); in TEST_F() 1024 EXPECT_EQ(1, costs.num_ops_total); in TEST_F() 1025 EXPECT_FALSE(costs.inaccurate); in TEST_F() 1026 EXPECT_EQ(0, costs.num_ops_with_unknown_shapes); in TEST_F() 1030 auto costs = predict_max_pool(10, 20, 384, 1, 2, "SAME"); in TEST_F() local 1031 EXPECT_EQ(Costs::Duration(499200), costs.execution_time); in TEST_F() 1032 EXPECT_EQ(Costs::Duration(38400), costs.compute_time); in TEST_F() [all …]
|
D | op_level_cost_estimator.cc | 378 Costs costs = estimator(op_context); in PredictCosts() local 380 << costs.execution_time.count() << " ns."; in PredictCosts() 381 return costs; in PredictCosts() 480 Costs costs = PredictOpCountBasedCost(op_count * op_cost, op_info); in PredictCwiseOp() local 482 costs.inaccurate = true; in PredictCwiseOp() 484 costs.num_ops_with_unknown_shapes = found_unknown_shapes; in PredictCwiseOp() 485 return costs; in PredictCwiseOp() 492 auto costs = PredictOpCountBasedCost(0, op_context.op_info); in PredictCostOfAnUnknownOp() local 493 costs.inaccurate = true; in PredictCostOfAnUnknownOp() 494 return costs; in PredictCostOfAnUnknownOp() [all …]
|
D | cost_estimator.h | 192 Costs costs; in ZeroCosts() local 193 costs.execution_time = Duration::zero(); in ZeroCosts() 194 costs.compute_time = Duration::zero(); in ZeroCosts() 195 costs.memory_time = Duration::zero(); in ZeroCosts() 196 costs.intermediate_memory_time = Duration::zero(); in ZeroCosts() 197 costs.max_memory = kZeroMemory; in ZeroCosts() 198 costs.persistent_memory = kZeroMemory; in ZeroCosts() 199 costs.temporary_memory = kZeroMemory; in ZeroCosts() 200 costs.max_per_op_buffers = kZeroMemory; in ZeroCosts() 201 costs.max_per_op_streaming = kZeroMemory; in ZeroCosts() [all …]
|
D | measuring_cost_estimator.cc | 55 Costs* costs) const { in PredictCosts() 120 costs->execution_time = Costs::Duration::max(); in PredictCosts() 140 costs->execution_time = Costs::Duration::max(); in PredictCosts() 147 costs->execution_time = Costs::Duration(stats.mean()); in PredictCosts()
|
D | cost_estimator.cc | 58 Costs MultiplyCosts(const Costs& costs, int multiplier) { in MultiplyCosts() argument 64 return costs; in MultiplyCosts() 67 Costs result = costs; in MultiplyCosts()
|
D | analytical_cost_estimator.cc | 137 Costs* costs) const { in PredictCosts() 143 costs->execution_time = Costs::Duration::max(); in PredictCosts() 192 *costs = scheduler_->Summary(run_metadata); in PredictCosts()
|
/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/swiftshader/third_party/llvm-7.0/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/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/fonttools/Lib/fontTools/varLib/ |
D | iup.py | 184 costs = {-1:0} 187 best_cost = costs[i-1] + 1 189 costs[i] = best_cost 197 cost = costs[j] + 1 200 costs[i] = best_cost = cost 206 return chain, costs 257 chain, costs = _iup_contour_optimize_dp(delta, coords, forced, tolerance) 273 chain, costs = _iup_contour_optimize_dp(delta+delta, coords+coords, forced, tolerance, n) 284 cost = costs[start] - costs[start - n]
|
/external/webp/src/dsp/ |
D | cost_mips_dsp_r2.c | 24 CostArrayPtr const costs = res->costs; in GetResidualCost_MIPSdspR2() local 25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_MIPSdspR2() 34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost_MIPSdspR2()
|
D | cost.c | 326 CostArrayPtr const costs = res->costs; in GetResidualCost_C() local 327 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_C() 340 t = costs[n + 1][ctx]; in GetResidualCost_C()
|
D | cost_mips32.c | 24 CostArrayPtr const costs = res->costs; in GetResidualCost_MIPS32() local 25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_MIPS32() 34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost_MIPS32()
|
D | cost_sse2.c | 51 CostArrayPtr const costs = res->costs; in GetResidualCost_SSE2() local 52 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_SSE2() 87 t = costs[n + 1][ctx]; in GetResidualCost_SSE2()
|
D | cost_neon.c | 57 CostArrayPtr const costs = res->costs; in GetResidualCost_NEON() local 58 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_NEON() 90 t = costs[n + 1][ctx]; in GetResidualCost_NEON()
|
/external/libaom/libaom/av1/encoder/ |
D | cost.c | 29 void av1_cost_tokens_from_cdf(int *costs, const aom_cdf_prob *cdf, in av1_cost_tokens_from_cdf() argument 39 costs[inv_map[i]] = av1_cost_symbol(p15); in av1_cost_tokens_from_cdf() 41 costs[i] = av1_cost_symbol(p15); in av1_cost_tokens_from_cdf()
|
D | cost.h | 44 void av1_cost_tokens_from_cdf(int *costs, const aom_cdf_prob *cdf,
|
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
D | BUILD | 27 "//tensorflow/core/grappler/costs:cost_estimator", 28 "//tensorflow/core/grappler/costs:graph_properties", 29 "//tensorflow/core/grappler/costs:op_level_cost_estimator", 30 "//tensorflow/core/grappler/costs:virtual_placer", 102 "//tensorflow/core/grappler/costs:graph_properties", 216 "//tensorflow/core/grappler/costs:graph_properties", 234 "//tensorflow/core/grappler/costs:graph_properties", 271 "//tensorflow/core/grappler/costs:graph_properties", 337 "//tensorflow/core/grappler/costs:graph_properties", 450 "//tensorflow/core/grappler/costs:graph_memory", [all …]
|
/external/tensorflow/tensorflow/core/grappler/clusters/ |
D | BUILD | 84 "//tensorflow/core/grappler/costs:analytical_cost_estimator", 85 "//tensorflow/core/grappler/costs:op_level_cost_estimator", 86 "//tensorflow/core/grappler/costs:virtual_scheduler",
|
/external/tensorflow/tensorflow/python/grappler/ |
D | cluster.i | 175 tensorflow::grappler::Costs* costs) { in _GetOpPerformanceDataAndRunTime() argument 181 cost_measure->PredictCosts(item.graph, &run_metadata, costs)); in _GetOpPerformanceDataAndRunTime() 326 tensorflow::grappler::Costs costs; in TF_MeasureCosts() local 328 *item, &cost_measure, &op_performance_data, &costs); in TF_MeasureCosts() 331 run_time = static_cast<double>(costs.execution_time.count()) / 1e9; in TF_MeasureCosts()
|
D | cost_analyzer.cc | 47 Costs costs; in PredictCosts() local 49 cost_estimator->PredictCosts(item_->graph, &run_metadata, &costs); in PredictCosts() 53 *total_time = costs.execution_time.count(); in PredictCosts()
|
/external/libxml2/optim/ |
D | hash_dict.txt | 2 costs. Not worth it unless validating big DTDs
|