| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | op_level_cost_estimator_test.cc | 16 #include "tensorflow/core/grappler/costs/op_level_cost_estimator.h"
60 void ExpectZeroCost(const Costs& cost) { in ExpectZeroCost()
62 EXPECT_EQ(cost.compute_time, Costs::Duration::zero()); in ExpectZeroCost()
63 EXPECT_EQ(cost.execution_time, Costs::Duration::zero()); in ExpectZeroCost()
64 EXPECT_EQ(cost.memory_time, Costs::Duration::zero()); in ExpectZeroCost()
516 Costs PredictCosts(const OpContext& op_context) const { in PredictCosts()
675 EXPECT_EQ(Costs::Duration(0), cost.memory_time); in TEST_F()
676 EXPECT_EQ(Costs::Duration(1), cost.compute_time); in TEST_F()
677 EXPECT_EQ(Costs::Duration(1), cost.execution_time); in TEST_F()
694 // Huge first input shouldn't affect Gather execution and memory costs. in TEST_F()
[all …]
|
| D | cost_estimator_test.cc | 16 #include "tensorflow/core/grappler/costs/cost_estimator.h"
25 Costs c = Costs::ZeroCosts(); in TEST()
26 c.execution_time = Costs::NanoSeconds(1); in TEST()
27 c.compute_time = Costs::NanoSeconds(2); in TEST()
28 c.memory_time = Costs::NanoSeconds(3); in TEST()
29 c.intermediate_memory_time = Costs::NanoSeconds(4); in TEST()
30 c.intermediate_memory_read_time = Costs::NanoSeconds(5); in TEST()
31 c.intermediate_memory_write_time = Costs::NanoSeconds(6); in TEST()
39 Costs sum = CombineCosts(c, c); in TEST()
41 EXPECT_EQ(sum.execution_time, Costs::NanoSeconds(2)); in TEST()
[all …]
|
| D | cost_estimator.h | 75 struct Costs { struct
76 // Returns a Costs structure with default values for all of the fields.
77 inline Costs();
79 // Builds a Costs structure with all zero values, rather than unknowns.
80 static inline Costs ZeroCosts(bool inaccurate = false);
165 // Number of ops included in this Costs in total. argument
179 inline std::ostream& operator<<(std::ostream& os, const Costs::MilliSeconds d) { argument
183 inline std::ostream& operator<<(std::ostream& os, const Costs::MicroSeconds d) {
187 inline std::ostream& operator<<(std::ostream& os, const Costs::NanoSeconds d) {
192 Costs::Costs() { in Costs() function
[all …]
|
| D | cost_estimator.cc | 16 #include "tensorflow/core/grappler/costs/cost_estimator.h"
21 Costs CombineCosts(const Costs& left, const Costs& right) { in CombineCosts()
26 Costs result = left; in CombineCosts()
55 // Multiplies Costs by a scalar.
58 Costs MultiplyCosts(const Costs& costs, int multiplier) { in MultiplyCosts() argument
61 return Costs::ZeroCosts(); in MultiplyCosts()
64 return costs; in MultiplyCosts()
67 Costs result = costs; in MultiplyCosts()
|
| D | measuring_cost_estimator.cc | 16 #include "tensorflow/core/grappler/costs/measuring_cost_estimator.h"
23 #include "tensorflow/core/grappler/costs/robust_stats.h"
55 Costs* costs) const { in PredictCosts()
69 const Costs::MicroSeconds start = Env::Default()->NowMicros(); in PredictCosts()
89 const Costs::MicroSeconds finish = Env::Default()->NowMicros(); 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 | virtual_scheduler.h | 28 #include "tensorflow/core/grappler/costs/cost_estimator.h"
29 #include "tensorflow/core/grappler/costs/graph_properties.h"
30 #include "tensorflow/core/grappler/costs/op_context.h"
31 #include "tensorflow/core/grappler/costs/virtual_placer.h"
64 Costs::Duration time_ready;
65 Costs::Duration time_scheduled;
66 Costs::Duration time_finished;
69 std::unordered_map<int, Costs::Duration> time_no_references;
82 Costs node_costs; // Node costs per execution
83 Costs TotalNodeCosts() const { in TotalNodeCosts()
[all …]
|
| D | analytical_cost_estimator.cc | 16 #include "tensorflow/core/grappler/costs/analytical_cost_estimator.h"
24 #include "tensorflow/core/grappler/costs/graph_properties.h"
25 #include "tensorflow/core/grappler/costs/op_performance_data.pb.h"
26 #include "tensorflow/core/grappler/costs/utils.h"
27 #include "tensorflow/core/grappler/costs/virtual_placer.h"
28 #include "tensorflow/core/grappler/costs/virtual_scheduler.h"
41 int node_id, const Costs& node_costs, in AddCostNode()
159 Costs* costs) const { in PredictCosts()
175 if (costs) { in PredictCosts()
176 costs->execution_time = Costs::Duration::max(); in PredictCosts()
[all …]
|
| D | op_level_cost_estimator.h | 21 #include "tensorflow/core/grappler/costs/cost_estimator.h"
22 #include "tensorflow/core/grappler/costs/op_context.h"
23 #include "tensorflow/core/grappler/costs/op_performance_data.pb.h"
35 // Node costs; an intermediate structure used within op level cost estimator.
88 Costs costs; member
96 virtual Costs PredictCosts(const OpContext& op_context) const;
105 Costs PredictOpCountBasedCost(double operations, const OpInfo& op_info) const;
110 Costs PredictOpCountBasedCost(double operations, double input_io_bytes,
115 // NodeCosts, and then converts it to Costs). PredictNodeCosts() calls other
124 // This family of routines predicts the costs to
[all …]
|
| /external/google-cloud-java/java-recommendations-ai/proto-google-cloud-recommendations-ai-v1beta1/src/main/java/com/google/cloud/recommendationengine/v1beta1/ |
| D | PurchaseTransactionOrBuilder.java | 125 * Optional. All the costs associated with the product. These can be
126 * manufacturing costs, shipping expenses not borne by the end user, or any
127 * other costs.
129 * profit = revenue - (sum(taxes) + sum(costs))
131 * profit = revenue - tax - shipping - sum(CatalogItem.costs).
136 * <code>map<string, float> costs = 4 [(.google.api.field_behavior) = OPTIONAL];</code>
143 * Optional. All the costs associated with the product. These can be
144 * manufacturing costs, shipping expenses not borne by the end user, or any
145 * other costs.
147 * profit = revenue - (sum(taxes) + sum(costs))
[all …]
|
| D | ProductCatalogItemOrBuilder.java | 114 * Optional. A map to pass the costs associated with the product.
118 * * If 'exactPrice' is provided, profit = displayPrice - sum(costs)
119 * * If 'priceRange' is provided, profit = minPrice - sum(costs)
122 * <code>map<string, float> costs = 3 [(.google.api.field_behavior) = OPTIONAL];</code>
129 * Optional. A map to pass the costs associated with the product.
133 * * If 'exactPrice' is provided, profit = displayPrice - sum(costs)
134 * * If 'priceRange' is provided, profit = minPrice - sum(costs)
137 * <code>map<string, float> costs = 3 [(.google.api.field_behavior) = OPTIONAL];</code>
147 * Optional. A map to pass the costs associated with the product.
151 * * If 'exactPrice' is provided, profit = displayPrice - sum(costs)
[all …]
|
| D | PurchaseTransaction.java | 285 * Optional. All the costs associated with the product. These can be
286 * manufacturing costs, shipping expenses not borne by the end user, or any
287 * other costs.
289 * profit = revenue - (sum(taxes) + sum(costs))
291 * profit = revenue - tax - shipping - sum(CatalogItem.costs).
296 * <code>map<string, float> costs = 4 [(.google.api.field_behavior) = OPTIONAL];</code>
315 * Optional. All the costs associated with the product. These can be
316 * manufacturing costs, shipping expenses not borne by the end user, or any
317 * other costs.
319 * profit = revenue - (sum(taxes) + sum(costs))
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 68 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {} in NodeEntry() argument
94 VectorPtr Costs; variable
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
104 : Costs(std::move(Costs)) { in EdgeEntry()
152 MatrixPtr Costs; variable
371 /// Add a node with the given costs.
372 /// @param Costs Cost vector for the new node.
375 NodeId addNode(OtherVectorT Costs) { in addNode() argument
377 VectorPtr AllocatedCosts = CostAlloc.getVector(std::move(Costs)); in addNode()
385 /// @param Costs Cost vector ptr for the new node (must be convertible to
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 68 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {} in NodeEntry() argument
94 VectorPtr Costs; variable
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
104 : Costs(std::move(Costs)) { in EdgeEntry()
152 MatrixPtr Costs; variable
371 /// Add a node with the given costs.
372 /// @param Costs Cost vector for the new node.
375 NodeId addNode(OtherVectorT Costs) { in addNode() argument
377 VectorPtr AllocatedCosts = CostAlloc.getVector(std::move(Costs)); in addNode()
385 /// @param Costs Cost vector ptr for the new node (must be convertible to
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 74 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {} in NodeEntry() argument
96 VectorPtr Costs; variable
104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
105 : Costs(std::move(Costs)) { in EdgeEntry()
116 Costs = nullptr; in invalidate()
168 MatrixPtr Costs; variable
378 /// @brief Add a node with the given costs.
379 /// @param Costs Cost vector for the new node.
382 NodeId addNode(OtherVectorT Costs) { in addNode() argument
384 VectorPtr AllocatedCosts = CostAlloc.getVector(std::move(Costs)); in addNode()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | TargetTransformInfo.cpp | 53 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getOperationCost()
59 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getCallCost()
66 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getCallCost()
82 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntrinsicCost()
88 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getUserCost()
149 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getScalingFactorCost()
208 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getFPOpCost()
216 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCodeSizeCost()
222 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCost()
229 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCost()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | static_schedule_test.cc | 50 std::vector<Costs::NanoSeconds> GetOrderedTimes( in GetOrderedTimes()
51 const std::unordered_map<const NodeDef*, Costs::NanoSeconds> in GetOrderedTimes()
53 std::map<Costs::NanoSeconds, std::string> ordered_completion_times; in GetOrderedTimes()
59 std::vector<Costs::NanoSeconds> ordered_times; in GetOrderedTimes()
69 const std::unordered_map<const NodeDef*, Costs::NanoSeconds> in GetOrderedNodeNames()
71 std::map<Costs::NanoSeconds, std::string> ordered_completion_times; in GetOrderedNodeNames()
93 std::unordered_map<const NodeDef*, Costs::NanoSeconds> completion_times; in TEST_F()
101 std::vector<Costs::NanoSeconds> ordered_times = in TEST_F()
108 EXPECT_EQ(ordered_times[0], Costs::NanoSeconds(1)); in TEST_F()
138 std::unordered_map<const NodeDef*, Costs::NanoSeconds> completion_times; in TEST_F()
[all …]
|
| D | static_schedule.cc | 21 #include "tensorflow/core/grappler/costs/graph_properties.h"
22 #include "tensorflow/core/grappler/costs/op_level_cost_estimator.h"
23 #include "tensorflow/core/grappler/costs/virtual_placer.h"
32 static Costs::NanoSeconds PredictExecutionTime( in PredictExecutionTime()
54 Costs::NanoSeconds estimate = in PredictExecutionTime()
58 return std::max(estimate, Costs::NanoSeconds(1)); in PredictExecutionTime()
63 std::unordered_map<const NodeDef*, Costs::NanoSeconds>* completion_times) { in EstimateEarliestExecutionTimes()
108 Costs::NanoSeconds execution_time = in EstimateEarliestExecutionTimes()
110 Costs::NanoSeconds completion_time = in EstimateEarliestExecutionTimes()
124 Costs::NanoSeconds ready_time = in EstimateEarliestExecutionTimes()
[all …]
|
| /external/zopfli/src/zopfli/ |
| D | squeeze.c | 222 ZopfliHash* h, float* costs) { in GetBestLengths() argument
243 for (i = 1; i < blocksize + 1; i++) costs[i] = ZOPFLI_LARGE_FLOAT; in GetBestLengths()
244 costs[0] = 0; /* Because it's the start. */ in GetBestLengths()
248 size_t j = i - instart; /* Index in the costs array and length_array. */ in GetBestLengths()
264 costs[j + ZOPFLI_MAX_MATCH] = costs[j] + symbolcost; in GetBestLengths()
278 double newCost = costmodel(in[i], 0, costcontext) + costs[j]; in GetBestLengths()
280 if (newCost < costs[j + 1]) { in GetBestLengths()
281 costs[j + 1] = newCost; in GetBestLengths()
287 mincostaddcostj = mincost + costs[j]; in GetBestLengths()
293 if (costs[j + k] <= mincostaddcostj) continue; in GetBestLengths()
[all …]
|
| /external/tensorflow/tensorflow/core/profiler/utils/ |
| D | cost_utils.cc | 31 #include "tensorflow/core/grappler/costs/cost_estimator.h"
32 #include "tensorflow/core/grappler/costs/op_context.h"
33 #include "tensorflow/core/grappler/costs/op_performance_data.pb.h"
114 grappler::Costs costs = PredictCosts(op_context); in Predict() local
115 if (costs.inaccurate) unsupported_ops_.insert(std::string(tf_op.type)); in Predict()
118 << " flops:" << costs.compute_time.count() in Predict()
119 << " bytes:" << costs.memory_time.count(); in Predict()
124 return {/*flops=*/static_cast<uint64>(costs.compute_time.count()), in Predict()
125 /*bytes_accessed=*/static_cast<uint64>(costs.memory_time.count()), in Predict()
126 /*inaccurate=*/costs.inaccurate}; in Predict()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 184 // costs. in addIntraChainConstraint()
190 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
199 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
222 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
224 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
225 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
233 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
[all …]
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 185 // costs. in addIntraChainConstraint()
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()
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 184 // costs. in addIntraChainConstraint()
190 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
199 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
222 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
224 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
225 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
233 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
[all …]
|
| /external/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()
|
| /external/google-cloud-java/java-optimization/proto-google-cloud-optimization-v1/src/main/java/com/google/cloud/optimization/v1/ |
| D | AggregatedMetricsOrBuilder.java | 373 …* [OptimizeToursResponse.Metrics.costs][google.cloud.optimization.v1.OptimizeToursResponse.Metrics…
377 * <code>map<string, double> costs = 10 [deprecated = true];</code>
388 …* [OptimizeToursResponse.Metrics.costs][google.cloud.optimization.v1.OptimizeToursResponse.Metrics…
392 * <code>map<string, double> costs = 10 [deprecated = true];</code>
406 …* [OptimizeToursResponse.Metrics.costs][google.cloud.optimization.v1.OptimizeToursResponse.Metrics…
410 * <code>map<string, double> costs = 10 [deprecated = true];</code>
421 …* [OptimizeToursResponse.Metrics.costs][google.cloud.optimization.v1.OptimizeToursResponse.Metrics…
425 * <code>map<string, double> costs = 10 [deprecated = true];</code>
436 …* [OptimizeToursResponse.Metrics.costs][google.cloud.optimization.v1.OptimizeToursResponse.Metrics…
440 * <code>map<string, double> costs = 10 [deprecated = true];</code>
|
| /external/tensorflow/tensorflow/python/grappler/ |
| D | cluster_wrapper.cc | 36 #include "tensorflow/core/grappler/costs/cost_estimator.h"
37 #include "tensorflow/core/grappler/costs/graph_memory.h"
38 #include "tensorflow/core/grappler/costs/measuring_cost_estimator.h"
39 #include "tensorflow/core/grappler/costs/op_level_cost_estimator.h"
40 #include "tensorflow/core/grappler/costs/op_performance_data.pb.h"
41 #include "tensorflow/core/grappler/costs/utils.h"
56 tensorflow::grappler::Costs* costs) { in _GetOpPerformanceDataAndRunTime() argument
62 cost_measure->PredictCosts(item.graph, &run_metadata, costs)); in _GetOpPerformanceDataAndRunTime()
264 tensorflow::grappler::Costs costs; in PYBIND11_MODULE() local
266 *item, &cost_measure, &op_performance_data, &costs); in PYBIND11_MODULE()
[all …]
|