Home
last modified time | relevance | path

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

12

/external/llvm/unittests/ADT/
DPostOrderIteratorTest.cpp24 PIS.insertEdge(Null, Null); in TEST()
27 PIS.insertEdge(Null, Null); in TEST()
33 PI.insertEdge(NullBB, NullBB); in TEST()
35 PIExt.insertEdge(NullBB, NullBB); in TEST()
/external/llvm-project/llvm/unittests/ADT/
DPostOrderIteratorTest.cpp23 PIS.insertEdge(Optional<void *>(), Null); in TEST()
26 PIS.insertEdge(Optional<void *>(), Null); in TEST()
32 PI.insertEdge(Optional<BasicBlock *>(), NullBB); in TEST()
34 PIExt.insertEdge(Optional<BasicBlock *>(), NullBB); in TEST()
/external/llvm-project/llvm/unittests/IR/
DDominatorTreeTest.cpp730 DT.insertEdge(From, To); in TEST()
732 PDT.insertEdge(From, To); in TEST()
757 DT.insertEdge(From, To); in TEST()
759 PDT.insertEdge(From, To); in TEST()
784 DT.insertEdge(From, To); in TEST()
786 PDT.insertEdge(From, To); in TEST()
806 PDT.insertEdge(From, To); in TEST()
835 DT.insertEdge(From, To); in TEST()
837 PDT.insertEdge(From, To); in TEST()
865 DT.insertEdge(From, To); in TEST()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DPostOrderIterator.h63 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() function
83 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() function
107 this->insertEdge(Optional<NodeRef>(), BB); in po_iterator()
116 if (this->insertEdge(Optional<NodeRef>(), BB)) { in po_iterator()
129 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) { in traverseChild()
/external/llvm/include/llvm/ADT/
DPostOrderIterator.h60 bool insertEdge(NodeType *From, NodeType *To) { in insertEdge() function
80 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) { in insertEdge() function
108 if (this->insertEdge(VisitStack.back().first, BB)) { in traverseChild()
116 this->insertEdge((NodeType*)nullptr, BB); in po_iterator()
124 if (this->insertEdge((NodeType*)nullptr, BB)) { in po_iterator()
/external/llvm-project/llvm/include/llvm/ADT/
DPostOrderIterator.h64 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() function
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() function
108 this->insertEdge(Optional<NodeRef>(), BB); in po_iterator()
117 if (this->insertEdge(Optional<NodeRef>(), BB)) { in po_iterator()
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) { in traverseChild()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DDomTreeUpdater.cpp317 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() function in llvm::DomTreeUpdater
333 DT->insertEdge(From, To); in insertEdge()
335 PDT->insertEdge(From, To); in insertEdge()
354 DT->insertEdge(From, To); in insertEdgeRelaxed()
356 PDT->insertEdge(From, To); in insertEdgeRelaxed()
/external/llvm-project/llvm/lib/Analysis/
DDomTreeUpdater.cpp316 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() function in llvm::DomTreeUpdater
332 DT->insertEdge(From, To); in insertEdge()
334 PDT->insertEdge(From, To); in insertEdge()
353 DT->insertEdge(From, To); in insertEdgeRelaxed()
355 PDT->insertEdge(From, To); in insertEdgeRelaxed()
/external/llvm/include/llvm/Analysis/
DLoopIterator.h117 bool insertEdge(BasicBlock *From, BasicBlock *To);
170 insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() function
DLazyCallGraph.h816 void insertEdge(Node &Caller, Function &Callee, Edge::Kind EK);
819 void insertEdge(Function &Caller, Function &Callee, Edge::Kind EK) { in insertEdge() function
820 return insertEdge(get(Caller), Callee, EK); in insertEdge()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DLoopIterator.h195 bool insertEdge(Optional<BasicBlock *> From, BasicBlock *To);
247 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge( in insertEdge() function
DDomTreeUpdater.h157 LLVM_ATTRIBUTE_DEPRECATED(void insertEdge(BasicBlock *From, BasicBlock *To),
DLazyCallGraph.h1021 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1024 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) { in insertEdge() function
1025 return insertEdge(get(Source), get(Target), EK); in insertEdge()
/external/llvm-project/llvm/include/llvm/Analysis/
DLoopIterator.h195 bool insertEdge(Optional<BasicBlock *> From, BasicBlock *To);
247 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge( in insertEdge() function
DDomTreeUpdater.h159 LLVM_ATTRIBUTE_DEPRECATED(void insertEdge(BasicBlock *From, BasicBlock *To),
DLazyCallGraph.h1028 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1031 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) { in insertEdge() function
1032 return insertEdge(get(Source), get(Target), EK); in insertEdge()
/external/llvm-project/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp430 CG.insertEdge(B, C, LazyCallGraph::Edge::Call); in TEST()
434 CG.insertEdge(C, B, LazyCallGraph::Edge::Call); in TEST()
438 CG.insertEdge(C, C, LazyCallGraph::Edge::Call); in TEST()
465 CG.insertEdge(D1, A1, LazyCallGraph::Edge::Ref); in TEST()
2136 CG.insertEdge(AN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2137 CG.insertEdge(BN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2138 CG.insertEdge(CN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2139 CG.insertEdge(DN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
DX86DomainReassignment.cpp335 bool insertEdge(unsigned Reg) { in insertEdge() function in __anonaf35e3140111::Closure
555 if (!C.insertEdge(CurReg)) in buildClosure()
/external/llvm-project/llvm/lib/Target/X86/
DX86DomainReassignment.cpp333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; } in insertEdge() function in __anon0d7edfa00111::Closure
551 if (!C.insertEdge(CurReg)) in buildClosure()
/external/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp306 CG.insertEdge(B, lookupFunction(*M, "c"), LazyCallGraph::Edge::Call); in TEST()
311 CG.insertEdge(C, B.getFunction(), LazyCallGraph::Edge::Call); in TEST()
315 CG.insertEdge(C, C.getFunction(), LazyCallGraph::Edge::Call); in TEST()
338 CG.insertEdge(lookupFunction(*M, "d1"), lookupFunction(*M, "a1"), in TEST()
/external/llvm-project/llvm/lib/Target/AMDGPU/
DSIInsertSkips.cpp261 MDT->getBase().insertEdge(&MBB, EarlyExitBlock); in skipIfDead()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DGenericDomTree.h533 void insertEdge(NodeT *From, NodeT *To) {
/external/llvm-project/llvm/include/llvm/Support/
DGenericDomTree.h582 void insertEdge(NodeT *From, NodeT *To) {
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DMachineTraceMetrics.cpp452 bool insertEdge(Optional<const MachineBasicBlock *> From, in insertEdge() function in llvm::po_iterator_storage
/external/llvm/lib/CodeGen/
DMachineTraceMetrics.cpp433 bool insertEdge(const MachineBasicBlock *From, const MachineBasicBlock *To) { in insertEdge() function in llvm::po_iterator_storage

12