Home
last modified time | relevance | path

Searched refs:edges_ (Results 1 – 7 of 7) sorted by relevance

/external/tensorflow/tensorflow/core/graph/
Dedgeset_test.cc25 EdgeSetTest() : edges_(nullptr), eset_(nullptr) {} in EdgeSetTest()
29 delete[] edges_; in ~EdgeSetTest()
34 delete[] edges_; in MakeEdgeSet()
35 edges_ = new Edge[n]; in MakeEdgeSet()
39 eset_->insert(&edges_[i]); in MakeEdgeSet()
40 model_.insert(&edges_[i]); in MakeEdgeSet()
58 Edge* edges_; member in tensorflow::EdgeSetTest
76 eset_->insert(&edges_[0]); in TEST_F()
77 model_.insert(&edges_[0]); in TEST_F()
88 auto p = eset_->insert(&edges_[pos]); in TEST_F()
[all …]
Dgraph.h333 const std::vector<Edge*>& edges_;
337 : edges_(edges) {} in GraphEdgesIterable()
384 return const_iterator(edges_.begin(), edges_.end()); in begin()
386 const_iterator end() { return const_iterator(edges_.end(), edges_.end()); } in end()
525 int num_edge_ids() const { return edges_.size(); } in num_edge_ids()
531 const Edge* FindEdgeId(int id) const { return edges_[id]; } in FindEdgeId()
535 GraphEdgesIterable edges() const { return GraphEdgesIterable(edges_); } in edges()
616 std::vector<Edge*> edges_; variable
Dgraph.cc395 e->id_ = edges_.size(); in AddEdge()
402 edges_.push_back(e); in AddEdge()
412 CHECK_EQ(e, edges_[e->id_]); in RemoveEdge()
415 edges_[e->id_] = nullptr; in RemoveEdge()
489 for (const Edge* e : edges_) { in FindEdge()
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h163 if (recycled_nodes_.getBit(edges_[i].from) || in newNode()
164 recycled_nodes_.getBit(edges_[i].to)) { in newNode()
165 Swap(edges_[i], edges_[n_edges_ - 1]); in newNode()
252 if (n_edges_ < ARRAY_SIZE(edges_)) { in addEdges()
256 edges_[n_edges_++] = e; in addEdges()
269 if (edges_[i].from == from_idx && edges_[i].to == to_idx) { in findEdge()
270 *stk_from = edges_[i].stk_from; in findEdge()
271 *stk_to = edges_[i].stk_to; in findEdge()
272 *unique_tid = edges_[i].unique_tid; in findEdge()
410 Edge edges_[BV::kSize * 32]; variable
/external/v8/src/profiler/
Dheap-snapshot-generator.h166 std::deque<HeapGraphEdge>& edges() { return edges_; } in edges()
195 std::deque<HeapGraphEdge> edges_; variable
533 v8::HeapProfiler::RetainerEdges edges_; variable
Dheap-snapshot-generator.cc344 edges_.size() * sizeof(decltype(edges_)::value_type) + in RawSnapshotSize()
2310 edges_ = std::move(infos.edges); in FillRetainedObjects()
2317 for (auto& pair : edges_) { in FillEdges()
2334 edges_.clear(); in FillEdges()
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_graph_dumper.cc417 std::vector<string> edges_; member in xla::hlo_graph_dumper::__anon1f36c7c40111::HloDotDumper
553 string HloDotDumper::Footer() { return StrCat(Join(edges_, "\n"), "\n}"); } in Footer()
634 edges_.push_back(Printf( in DumpSubcomputation()
693 edges_.push_back(Printf(R"(%s -> %s [tooltip=" "];)", from_id, to_id)); in DumpRootTag()
1129 edges_.push_back(Printf(kEdgeFmt, InstructionId(from), InstructionId(to), in AddInstructionIncomingEdges()