Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A 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()
/freebsd-12.1/contrib/llvm/lib/IR/
H A DDomTreeUpdater.cpp313 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() function in llvm::DomTreeUpdater
329 DT->insertEdge(From, To); in insertEdge()
331 PDT->insertEdge(From, To); in insertEdge()
350 DT->insertEdge(From, To); in insertEdgeRelaxed()
352 PDT->insertEdge(From, To); in insertEdgeRelaxed()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLoopIterator.h196 bool insertEdge(Optional<BasicBlock *> From, BasicBlock *To);
248 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge( in insertEdge() function
H A DLazyCallGraph.h1020 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1023 void insertEdge(Function &Source, Function &Target, Edge::Kind EK) { in insertEdge() function
1024 return insertEdge(get(Source), get(Target), EK); in insertEdge()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp326 DTU.insertEdge(NewPreheader, L.getHeader()); in handleDeadExits()
327 DTU.insertEdge(Preheader, NewPreheader); in handleDeadExits()
346 DTU.insertEdge(Preheader, BB); in handleDeadExits()
H A DTailRecursionElimination.cpp682 DTU.insertEdge(BB, OldEntry); in eliminateRecursiveTailCall()
H A DSimpleLoopUnswitch.cpp492 DT.insertEdge(OldPH, UnswitchedBB); in unswitchTrivialBranch()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DDomTreeUpdater.h107 void insertEdge(BasicBlock *From, BasicBlock *To);
/freebsd-12.1/contrib/llvm/lib/Target/X86/
H A DX86DomainReassignment.cpp336 bool insertEdge(unsigned Reg) { in insertEdge() function in __anon76e4914e0111::Closure
558 if (!C.insertEdge(CurReg)) in buildClosure()
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGenericDomTree.h534 void insertEdge(NodeT *From, NodeT *To) {
H A DGenericDomTreeConstruction.h1162 DT.insertEdge(Update.getFrom(), Update.getTo()); in ApplyUpdates()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp535 DTU.insertEdge(Preheader, ExitBlock); in deleteDeadLoop()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp452 bool insertEdge(Optional<const MachineBasicBlock *> From, in insertEdge() function in llvm::po_iterator_storage
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyCallGraph.cpp1463 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) { in insertEdge() function in LazyCallGraph