Home
last modified time | relevance | path

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

/external/tensorflow/tensorflow/core/graph/
Dedgeset_test.cc26 EdgeSetTest() : edges_(nullptr) {} in EdgeSetTest()
27 ~EdgeSetTest() override { delete[] edges_; } in ~EdgeSetTest()
30 if (edges_) { in MakeEdgeSet()
31 delete[] edges_; in MakeEdgeSet()
33 edges_ = new Edge[n]; in MakeEdgeSet()
37 eset_.insert(&edges_[i]); in MakeEdgeSet()
38 model_.insert(&edges_[i]); in MakeEdgeSet()
57 Edge* edges_; member in tensorflow::EdgeSetTest
75 eset_.insert(&edges_[0]); in TEST_F()
76 model_.insert(&edges_[0]); in TEST_F()
[all …]
Dgraph.h392 const std::vector<Edge*>& edges_;
396 : edges_(edges) {} in GraphEdgesIterable()
443 return const_iterator(edges_.begin(), edges_.end()); in begin()
445 const_iterator end() { return const_iterator(edges_.end(), edges_.end()); } in end()
590 int num_edge_ids() const { return edges_.size(); } in num_edge_ids()
596 const Edge* FindEdgeId(int id) const { return edges_[id]; } in FindEdgeId()
600 GraphEdgesIterable edges() const { return GraphEdgesIterable(edges_); } in edges()
684 std::vector<Edge*> edges_; variable
Dgraph.cc478 e->id_ = edges_.size(); in AddEdge()
485 edges_.push_back(e); in AddEdge()
495 CHECK_EQ(e, edges_[e->id_]); in RemoveEdge()
498 edges_[e->id_] = nullptr; in RemoveEdge()
/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/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc135 std::vector<SimpleEdge*> edges_; member in tensorflow::tensorrt::segment::SimpleGraph
154 edges_.resize(n_edges, nullptr); in SimpleGraph()
173 edges_[i] = edge; in SimpleGraph()
184 int i = edges_.size(); in AddEdge()
190 edges_.push_back(nullptr); in AddEdge()
195 edges_[i] = edge; in AddEdge()
223 for (auto x : edges_) delete x; in ~SimpleGraph()
/external/v8/src/profiler/
Dheap-snapshot-generator.h184 std::deque<HeapGraphEdge>& edges() { return edges_; } in edges()
215 std::deque<HeapGraphEdge> edges_; variable
553 v8::HeapProfiler::RetainerEdges edges_; variable
Dheap-snapshot-generator.cc2043 edges_.push_back({from, to, name}); in AddEdge()
2047 const std::vector<Edge>& edges() { return edges_; } in edges()
2051 std::vector<Edge> edges_; member in v8::internal::EmbedderGraphImpl
2242 edges_ = std::move(infos.edges); in FillRetainedObjects()
2249 for (auto& pair : edges_) { in FillEdges()
2267 edges_.clear(); in FillEdges()
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_graph_dumper.cc412 std::vector<string> edges_; member in xla::__anon7102e5d00111::HloDotDumper
553 string HloDotDumper::Footer() { return StrCat(StrJoin(edges_, "\n"), "\n}"); } in Footer()
593 edges_.push_back(StrFormat( in DumpSubcomputation()
710 edges_.push_back(StrFormat(R"(%s -> %s [tooltip=" "];)", from_id, to_id)); in DumpRootTag()
1199 edges_.push_back(StrFormat(kEdgeFmt, InstructionId(from), InstructionId(to), in AddInstructionIncomingEdges()