| /external/pigweed/pw_containers/public/pw_containers/internal/ |
| D | intrusive_list_impl.h | 34 constexpr explicit Iterator() : item_(nullptr) {} in Iterator()
37 item_ = static_cast<I*>(item_->next_);
42 Iterator previous_value(item_);
47 constexpr const T& operator*() const { return *static_cast<T*>(item_); }
48 constexpr T& operator*() { return *static_cast<T*>(item_); }
50 constexpr const T* operator->() const { return static_cast<T*>(item_); }
51 constexpr T* operator->() { return static_cast<T*>(item_); }
54 return item_ == rhs.item_;
57 return item_ != rhs.item_;
65 constexpr explicit Iterator(I* item) : item_{item} {} in Iterator()
[all …]
|
| /external/tensorflow/tensorflow/python/grappler/ |
| D | model_analyzer.cc | 27 ModelAnalyzer::ModelAnalyzer(const GrapplerItem& item) : item_(item) {} in ModelAnalyzer()
31 GraphProperties properties(item_); in GenerateReport()
34 for (const auto& node : item_.MainOpsFanin()) { in GenerateReport()
37 for (const auto& node : item_.EnqueueOpsFanin()) { in GenerateReport()
|
| D | cost_analyzer.cc | 28 : item_(&item), in CostAnalyzer()
45 TF_CHECK_OK(cost_estimator->Initialize(*item_)); in PredictCosts()
49 cost_estimator->PredictCosts(item_->graph, &run_metadata, &costs); in PredictCosts()
55 LOG(ERROR) << "Could not estimate the cost for item " << item_->id << ": " in PredictCosts()
65 VLOG(1) << "Graph size: " << item_->graph.node_size(); in GatherCosts()
98 cost_graph_analytical_filtered, item_->graph); in GatherCosts()
100 CostGraphToOpPerformanceData(cost_graph_measured_filtered, item_->graph); in GatherCosts()
|
| D | model_analyzer.h | 40 const GrapplerItem& item_; variable
|
| D | cost_analyzer.h | 66 const GrapplerItem* item_; variable
|
| /external/pigweed/pw_kvs/public/pw_kvs/ |
| D | key_value_store.h | 267 item_.ReadKey();
268 return item_;
276 return item_.iterator_ == rhs.item_.iterator_;
280 return item_.iterator_ != rhs.item_.iterator_;
289 : item_(kvs, item_iterator) {} in iterator()
291 Item item_; variable
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | auto_parallel.cc | 80 item_ = &item; in Initialize()
247 for (size_t i = 0; i < item_->fetch.size(); i++) { in BuildGraph()
250 string fetch = AddPrefixToNodeName(item_->fetch[i], prefix); in BuildGraph()
258 for (const auto& fetch : item_->fetch) { in BuildGraph()
261 *graph->mutable_library() = item_->graph.library(); in BuildGraph()
262 *graph->mutable_versions() = item_->graph.versions(); in BuildGraph()
|
| D | auto_parallel.h | 50 const GrapplerItem* item_; variable
|
| D | function_optimizer.cc | 259 : item_(&item), in FunctionOptimizerContext()
265 const GrapplerItem& item() const { return *item_; } in item()
267 const int graph_version() const { return item_->graph.versions().producer(); } in graph_version()
285 item_->feed, [&](const std::pair<std::string, Tensor>& feed) { in IsFeedNode()
291 return absl::c_any_of(item_->fetch, [&](const string& fetch) { in IsFetchNode()
357 const GrapplerItem* item_; // must outlive this object member in tensorflow::grappler::__anondd39c0ba0111::FunctionOptimizerContext
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | graph_memory.cc | 38 TF_RETURN_IF_ERROR(cluster.Initialize(item_)); in InferStatically()
40 Status s = cluster.Run(item_, &metadata); in InferStatically()
56 TF_RETURN_IF_ERROR(cluster->Initialize(item_)); in InferDynamically()
58 TF_RETURN_IF_ERROR(cluster->Run(item_, &metadata)); in InferDynamically()
77 for (const auto& node : item_.graph.node()) { in InferMemUsageForNodes()
170 for (const NodeDef& node : item_.graph.node()) { in InferFromTrace()
|
| D | analytical_cost_estimator.cc | 147 item_ = &item; in Initialize()
158 if (&optimized_graph == &item_->graph) { in PredictCosts()
159 item = item_; in PredictCosts()
163 item_->WithGraph(std::move(graph_copy))); in PredictCosts()
|
| D | graph_memory.h | 44 : item_(item), unknown_usage_({-1, {}}) {} in GraphMemory()
72 const GrapplerItem& item_; variable
|
| D | graph_properties.h | 84 explicit GraphProperties(const GrapplerItem& item) : item_(item) {} in GraphProperties()
203 const GrapplerItem& item_; variable
|
| D | graph_properties.cc | 2337 const int64 max_loop_length = item_.graph.node_size(); in PropagateShapes()
2476 item_.graph.library()); in InferStatically()
2479 for (const auto& feed : item_.feed) { in InferStatically()
2485 GraphView graph_view(&item_.graph); in InferStatically()
2497 for (const NodeDef& node : item_.graph.node()) { in InferStatically()
2546 Status s = ComputeTopologicalOrder(item_.graph, extra_deps, &topo_order); in InferStatically()
2555 TF_RETURN_IF_ERROR(ComputeTopologicalOrder(item_.graph, &topo_order)); in InferStatically()
2581 for (const NodeDef& node : item_.graph.node()) { in InferStatically()
2612 TF_RETURN_IF_ERROR(ValidateSymbolicShapeManager(item_.graph, refiner.get(), in InferStatically()
2615 for (const NodeDef& node : item_.graph.node()) { in InferStatically()
[all …]
|
| D | analytical_cost_estimator.h | 70 const GrapplerItem* item_;
|
| /external/libchrome/base/containers/ |
| D | small_map_unittest.cc | 459 : item_(item_to_add) {} in unordered_map_add_item_initializer()
460 unordered_map_add_item_initializer() : item_(0) {} in unordered_map_add_item_initializer()
462 new (map_ctor) unordered_map_add_item(std::make_pair(item_, item_)); in operator ()()
465 int item_; member in base::__anon966ea0ad0111::unordered_map_add_item_initializer
|
| /external/pigweed/pw_kvs/ |
| D | key_value_store.cc | 471 while (++item_.iterator_ != item_.kvs_.entry_cache_.end() && in operator ++()
472 item_.iterator_->state() != EntryState::kValid) { in operator ++()
|
| /external/protobuf/csharp/src/Google.Protobuf.Test/TestProtos/ |
| D | UnittestIssues.cs | 967 item_ = other.item_; in ItemField()
978 private int item_; field in UnitTest.Issues.TestProtos.ItemField
981 get { return item_; }
983 item_ = value;
|