Home
last modified time | relevance | path

Searched refs:item_ (Results 1 – 25 of 25) sorted by relevance

/external/pigweed/pw_containers/public/pw_containers/internal/
Dintrusive_list_impl.h36 constexpr explicit Iterator() : item_(nullptr) {} in Iterator()
39 item_ = static_cast<I*>(item_->next_);
44 Iterator previous_value(item_);
49 constexpr const T& operator*() const { return *static_cast<T*>(item_); }
50 constexpr T& operator*() { return *static_cast<T*>(item_); }
52 constexpr const T* operator->() const { return static_cast<T*>(item_); }
53 constexpr T* operator->() { return static_cast<T*>(item_); }
57 return item_ == rhs.item_;
62 return item_ != rhs.item_;
73 constexpr explicit Iterator(I* item) : item_{item} {} in Iterator()
[all …]
/external/pigweed/pw_kvs/public/pw_kvs/
Dkey_value_store.h265 const iterator original(item_.kvs_, item_.iterator_);
272 item_.ReadKey();
273 return item_;
281 return item_.iterator_ == rhs.item_.iterator_;
285 return item_.iterator_ != rhs.item_.iterator_;
294 : item_(kvs, item_iterator) {} in iterator()
296 Item item_; variable
/external/tensorflow/tensorflow/python/grappler/
Dmodel_analyzer.cc27 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()
Dcost_analyzer.cc28 : 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()
Dmodel_analyzer.h40 const GrapplerItem& item_; variable
Dcost_analyzer.h66 const GrapplerItem* item_; variable
/external/webrtc/modules/desktop_capture/win/
Dwgc_capture_source.cc45 if (!item_) in GetSize()
49 HRESULT hr = item_->get_Size(&item_size); in GetSize()
59 if (!item_) in GetCaptureItem()
60 hr = CreateCaptureItem(&item_); in GetCaptureItem()
62 *result = item_; in GetCaptureItem()
Dwgc_capture_session.cc102 item_(std::move(item)), in WgcCaptureSession()
119 RTC_DCHECK(item_); in StartCapture()
130 item_->add_Closed(closed_handler.Get(), item_closed_token_.get()); in StartCapture()
184 hr = frame_pool_->CreateCaptureSession(item_.Get(), &session_); in StartCapture()
408 item_ = nullptr; in OnItemClosed()
424 if (item_ && item_closed_token_) { in RemoveEventHandlers()
425 hr = item_->remove_Closed(*item_closed_token_); in RemoveEventHandlers()
Dwgc_capture_session.h99 item_; variable
Dwgc_capture_source.h51 item_;
/external/tensorflow/tensorflow/core/grappler/costs/
Dgraph_memory.cc38 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()
Danalytical_cost_estimator.cc153 item_ = &item; in Initialize()
164 if (&optimized_graph == &item_->graph) { in PredictCosts()
165 item = item_; in PredictCosts()
169 item_->WithGraph(std::move(graph_copy))); in PredictCosts()
Dgraph_memory.h44 : item_(item), unknown_usage_({-1, {}}) {} in GraphMemory()
72 const GrapplerItem& item_; variable
Dgraph_properties.h84 explicit GraphProperties(const GrapplerItem& item) : item_(item) {} in GraphProperties()
204 const GrapplerItem& item_; variable
Dgraph_properties.cc2381 const int64_t max_loop_length = item_.graph.node_size(); in PropagateShapes()
2520 item_.graph.library()); in InferStatically()
2523 for (const auto& feed : item_.feed) { in InferStatically()
2529 GraphView graph_view(&item_.graph); in InferStatically()
2541 for (const NodeDef& node : item_.graph.node()) { in InferStatically()
2590 Status s = ComputeTopologicalOrder(item_.graph, extra_deps, &topo_order); in InferStatically()
2599 TF_RETURN_IF_ERROR(ComputeTopologicalOrder(item_.graph, &topo_order)); in InferStatically()
2625 for (const NodeDef& node : item_.graph.node()) { in InferStatically()
2656 TF_RETURN_IF_ERROR(ValidateSymbolicShapeManager(item_.graph, refiner.get(), in InferStatically()
2659 for (const NodeDef& node : item_.graph.node()) { in InferStatically()
[all …]
Danalytical_cost_estimator.h70 const GrapplerItem* item_;
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dauto_parallel.cc80 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()
Dauto_parallel.h47 const GrapplerItem* item_; variable
Dfunction_optimizer.cc262 : item_(&item), in FunctionOptimizerContext()
268 const GrapplerItem& item() const { return *item_; } in item()
270 const int graph_version() const { return item_->graph.versions().producer(); } in graph_version()
288 item_->feed, [&](const std::pair<std::string, Tensor>& feed) { in IsFeedNode()
294 return absl::c_any_of(item_->fetch, [&](const string& fetch) { in IsFetchNode()
360 const GrapplerItem* item_; // must outlive this object member in tensorflow::grappler::__anon36c8eb5f0111::FunctionOptimizerContext
/external/pigweed/pw_containers/public/pw_containers/
Dintrusive_list.h111 list_.insert_after(pos.item_, item); in insert_after()
120 list_.erase_after(pos.item_); in erase_after()
/external/cronet/base/containers/
Dsmall_map_unittest.cc459 : 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::__anonc1b4be880111::unordered_map_add_item_initializer
/external/libchrome/base/containers/
Dsmall_map_unittest.cc459 : 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::__anon7cfde6320111::unordered_map_add_item_initializer
/external/pigweed/pw_kvs/
Dkey_value_store.cc507 while (++item_.iterator_ != item_.kvs_.entry_cache_.end() && in operator ++()
508 item_.iterator_->state() != EntryState::kValid) { in operator ++()
/external/cronet/third_party/protobuf/csharp/src/Google.Protobuf.Test.TestProtos/
DUnittestIssues.cs1367 item_ = other.item_; in ItemField()
1379 private int item_; field in UnitTest.Issues.TestProtos.ItemField
1383 get { return item_; }
1385 item_ = value;
/external/protobuf/csharp/src/Google.Protobuf.Test.TestProtos/
DUnittestIssues.cs1371 item_ = other.item_; in ItemField()
1383 private int item_; field in UnitTest.Issues.TestProtos.ItemField
1387 get { return item_; }
1389 item_ = value;