Home
last modified time | relevance | path

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

/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()