Home
last modified time | relevance | path

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

/external/compiler-rt/lib/sanitizer_common/tests/
Dsanitizer_bvgraph_test.cc313 EXPECT_EQ(0U, g.addEdges(from, 0, added_edges, kMaxEdges)); in RunAddEdgesTest()
314 EXPECT_EQ(0U, g.addEdges(from, 1, added_edges, kMaxEdges)); in RunAddEdgesTest()
316 EXPECT_EQ(1U, g.addEdges(from, 1, added_edges, kMaxEdges)); in RunAddEdgesTest()
318 EXPECT_EQ(0U, g.addEdges(from, 1, added_edges, kMaxEdges)); in RunAddEdgesTest()
322 EXPECT_EQ(1U, g.addEdges(from, 4, added_edges, kMaxEdges)); in RunAddEdgesTest()
328 EXPECT_EQ(2U, g.addEdges(from, 4, added_edges, kMaxEdges)); in RunAddEdgesTest()
/external/skqp/tests/
DIncrTopoSortTest.cpp107 this->addEdges(&tmp, dependent); in addEdge()
125 void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) { in addEdges() function in Graph
430 g.addEdges(&dependedOn, nodeD); // nodes B and C must come before node D in test_diamond()
/external/skia/tests/
DIncrTopoSortTest.cpp107 this->addEdges(&tmp, dependent); in addEdge()
125 void addEdges(SkTDArray<Node*>* dependedOn, Node* dependent) { in addEdges() function in Graph
430 g.addEdges(&dependedOn, nodeD); // nodes B and C must come before node D in test_diamond()
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h244 uptr addEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk, in addEdges() function
249 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx, in addEdges()
284 addEdges(dtls, cur_node, stk, 0);
Dsanitizer_deadlock_detector1.cc115 dd.addEdges(&lt->dd, m->id, cb->Unwind(), cb->UniqueTid()); in MutexBeforeLock()
169 dd.addEdges(&lt->dd, m->id, stk ? stk : cb->Unwind(), cb->UniqueTid()); in MutexAfterLock()
Dsanitizer_bvgraph.h50 uptr addEdges(const BV &from, uptr to, uptr added_edges[], in addEdges() function
/external/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h604 void addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop,
615 addEdges(N, OuterLoop, addBlockEdges);
619 addEdges(Index, OuterLoop, addBlockEdges);
624 void IrreducibleGraph::addEdges(const BlockNode &Node,
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h650 void addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop,
662 addEdges(N, OuterLoop, addBlockEdges);
666 addEdges(Index, OuterLoop, addBlockEdges);
672 void IrreducibleGraph::addEdges(const BlockNode &Node,