Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h48 // edges can be pruned by returning false in the insertEdge() function. This
52 // the post-order. The insertEdge() function is called in a pre-order, while
64 bool insertEdge(std::optional<NodeRef> From, NodeRef To) {
85 bool insertEdge(std::optional<NodeRef> From, NodeRef To) {
114 this->insertEdge(std::optional<NodeRef>(), BB); in po_iterator()
123 if (this->insertEdge(std::optional<NodeRef>(), BB)) { in po_iterator()
139 if (this->insertEdge(std::optional<NodeRef>(std::get<0>(Entry)), BB)) { in traverseChild()
65 bool insertEdge(std::optional<NodeRef> From, NodeRef To) { insertEdge() function
86 bool insertEdge(std::optional<NodeRef> From, NodeRef To) { insertEdge() function
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopIterator.h39 // LoopBodyTraits, so that insertEdge doesn't have to be specialized.
195 bool insertEdge(std::optional<BasicBlock *> From, BasicBlock *To);
247 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge( in insertEdge() function
H A DLazyCallGraph.h1035 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1038 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) { in insertEdge() function
1039 return insertEdge(get(Source), get(Target), EK); in insertEdge()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSILateBranchLowering.cpp145 MDT->getBase().insertEdge(&MBB, EarlyExitBlock); in earlyTerm()
241 MDT->getBase().insertEdge(MBB, EmptyMBBAtEnd); in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86DomainReassignment.cpp333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; } in insertEdge() function in __anond9661d290111::Closure
551 if (!C.insertEdge(CurReg)) in buildClosure()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h599 void insertEdge(NodeT *From, NodeT *To) {
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp470 bool insertEdge(std::optional<const MachineBasicBlock *> From, in insertEdge() function in llvm::po_iterator_storage
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1482 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) { in insertEdge() function in LazyCallGraph
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DIROutliner.cpp1849 DT.insertEdge(&DominatingFunction->getEntryBlock(), BB); in replaceArgumentUses()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp657 DT.insertEdge(OldPH, UnswitchedBB); in unswitchTrivialBranch()