| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | PostOrderIteratorTest.cpp | 25 PIS.insertEdge(Optional<void *>(), Null); in TEST()
28 PIS.insertEdge(Optional<void *>(), Null); in TEST()
34 PI.insertEdge(Optional<BasicBlock *>(), NullBB); in TEST()
36 PIExt.insertEdge(Optional<BasicBlock *>(), NullBB); in TEST()
|
| /llvm-project-15.0.7/llvm/unittests/IR/ |
| H A D | DominatorTreeTest.cpp | 730 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 …]
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | PostOrderIterator.h | 65 bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() function
85 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) { in insertEdge() function
113 this->insertEdge(Optional<NodeRef>(), BB); in po_iterator()
122 if (this->insertEdge(Optional<NodeRef>(), BB)) { in po_iterator()
135 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) { in traverseChild()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LoopIterator.h | 195 bool insertEdge(Optional<BasicBlock *> From, BasicBlock *To);
247 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge( in insertEdge() function
|
| H A D | LazyCallGraph.h | 1022 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1025 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) { in insertEdge() function
1026 return insertEdge(get(Source), get(Target), EK); in insertEdge()
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | SILateBranchLowering.cpp | 132 MDT->getBase().insertEdge(&MBB, EarlyExitBlock); in earlyTerm()
222 MDT->getBase().insertEdge(MBB, EmptyMBBAtEnd); in runOnMachineFunction()
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/ |
| H A D | LRGraph.cpp | 195 void insertEdge(StateID Src, StateID Dst, SymbolID Label) { in buildLR0() function in clang::pseudo::LRGraph::buildLR0::Builder
255 Builder.insertEdge(StateID, Insert.first, Next.first); in buildLR0()
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/ |
| H A D | X86DomainReassignment.cpp | 334 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; } in insertEdge() function in __anonc7e7f4590111::Closure
552 if (!C.insertEdge(CurReg)) in buildClosure()
|
| /llvm-project-15.0.7/llvm/unittests/Analysis/ |
| H A D | LazyCallGraphTest.cpp | 431 CG.insertEdge(B, C, LazyCallGraph::Edge::Call); in TEST()
435 CG.insertEdge(C, B, LazyCallGraph::Edge::Call); in TEST()
439 CG.insertEdge(C, C, LazyCallGraph::Edge::Call); in TEST()
466 CG.insertEdge(D1, A1, LazyCallGraph::Edge::Ref); in TEST()
2138 CG.insertEdge(AN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2139 CG.insertEdge(BN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2140 CG.insertEdge(CN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2141 CG.insertEdge(DN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 584 void insertEdge(NodeT *From, NodeT *To) {
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | MachineTraceMetrics.cpp | 452 bool insertEdge(Optional<const MachineBasicBlock *> From, in insertEdge() function in llvm::po_iterator_storage
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 1489 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) { in insertEdge() function in LazyCallGraph
|
| /llvm-project-15.0.7/llvm/lib/Transforms/IPO/ |
| H A D | IROutliner.cpp | 1840 DT.insertEdge(&DominatingFunction->getEntryBlock(), BB); in replaceArgumentUses()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | SimpleLoopUnswitch.cpp | 596 DT.insertEdge(OldPH, UnswitchedBB); in unswitchTrivialBranch()
|