HomeSort by relevance Sort by last modified time
    Searched refs:insertEdge (Results 1 - 25 of 25) sorted by null

  /external/llvm/unittests/ADT/
PostOrderIteratorTest.cpp 24 PIS.insertEdge(Null, Null);
27 PIS.insertEdge(Null, Null);
33 PI.insertEdge(NullBB, NullBB);
35 PIExt.insertEdge(NullBB, NullBB);
  /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
PostOrderIteratorTest.cpp 24 PIS.insertEdge(Optional<void *>(), Null);
27 PIS.insertEdge(Optional<void *>(), Null);
33 PI.insertEdge(Optional<BasicBlock *>(), NullBB);
35 PIExt.insertEdge(Optional<BasicBlock *>(), NullBB);
  /external/llvm/include/llvm/ADT/
PostOrderIterator.h 45 // edges can be pruned by returning false in the insertEdge() function. This
49 // the post-order. The insertEdge() function is called in a pre-order, while
60 bool insertEdge(NodeType *From, NodeType *To) {
80 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) {
108 if (this->insertEdge(VisitStack.back().first, BB)) {
116 this->insertEdge((NodeType*)nullptr, BB);
124 if (this->insertEdge((NodeType*)nullptr, BB)) {
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
PostOrderIterator.h 48 // 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(Optional<NodeRef> From, NodeRef To) {
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) {
108 this->insertEdge(Optional<NodeRef>(), BB);
117 if (this->insertEdge(Optional<NodeRef>(), BB)) {
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 117 bool insertEdge(BasicBlock *From, BasicBlock *To);
170 insertEdge(BasicBlock *From, BasicBlock *To) {
LazyCallGraph.h 816 void insertEdge(Node &Caller, Function &Callee, Edge::Kind EK);
819 void insertEdge(Function &Caller, Function &Callee, Edge::Kind EK) {
820 return insertEdge(get(Caller), Callee, EK);
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/
DominatorTreeTest.cpp 700 DT.insertEdge(From, To);
702 PDT.insertEdge(From, To);
727 DT.insertEdge(From, To);
729 PDT.insertEdge(From, To);
754 DT.insertEdge(From, To);
756 PDT.insertEdge(From, To);
776 PDT.insertEdge(From, To);
805 DT.insertEdge(From, To);
807 PDT.insertEdge(From, To);
835 DT.insertEdge(From, To)
    [all...]
DeferredDominanceTest.cpp 67 DDT.insertEdge(BB1, BB1);
160 DDT.insertEdge(BB0, BB2);
206 DDT.insertEdge(NewEntry, BB0);
292 // DDT are not. In the first case we must have DDT.insertEdge(Pred1, Succ)
293 // while in the latter case we must *NOT* have DDT.insertEdge(Pred1, Succ).
335 // Update the DDT. In this case we don't call DDT.insertEdge(BB0, BB3) because
DomTreeUpdaterTest.cpp 362 // DTU are not. In the first case we must have DTU.insertEdge(Pred1, Succ)
363 // while in the latter case we must *NOT* have DTU.insertEdge(Pred1, Succ).
416 // Update the DTU. In this case we don't call DTU.insertEdge(BB0, BB3) because
562 DTU.insertEdge(NewEntry, BB0);
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/
DomTreeUpdater.cpp 39 // 2. When called by insertEdge*()/deleteEdge*(), this update is invalid.
318 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) {
334 DT->insertEdge(From, To);
336 PDT->insertEdge(From, To);
355 DT->insertEdge(From, To);
357 PDT->insertEdge(From, To);
Dominators.cpp 77 template void llvm::DomTreeBuilder::InsertEdge<DomTreeBuilder::BBDomTree>(
79 template void llvm::DomTreeBuilder::InsertEdge<DomTreeBuilder::BBPostDomTree>(
401 void DeferredDominance::insertEdge(BasicBlock *From, BasicBlock *To) {
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
LoopIterator.h 40 // LoopBodyTraits, so that insertEdge doesn't have to be specialized.
196 bool insertEdge(Optional<BasicBlock *> From, BasicBlock *To);
248 inline bool po_iterator_storage<LoopBlocksTraversal, true>::insertEdge(
LazyCallGraph.h     [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DomTreeUpdater.h 107 void insertEdge(BasicBlock *From, BasicBlock *To);
251 /// insertEdge/deleteEdge or is unnecessary in the batch update.
Dominators.h 51 extern template void InsertEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
53 extern template void InsertEdge<BBPostDomTree>(BBPostDomTree &DT,
318 void insertEdge(BasicBlock *From, BasicBlock *To);
  /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/
LazyCallGraphTest.cpp 428 CG.insertEdge(B, C, LazyCallGraph::Edge::Call);
432 CG.insertEdge(C, B, LazyCallGraph::Edge::Call);
436 CG.insertEdge(C, C, LazyCallGraph::Edge::Call);
463 CG.insertEdge(D1, A1, LazyCallGraph::Edge::Ref);
    [all...]
  /external/llvm/unittests/Analysis/
LazyCallGraphTest.cpp 306 CG.insertEdge(B, lookupFunction(*M, "c"), LazyCallGraph::Edge::Call);
311 CG.insertEdge(C, B.getFunction(), LazyCallGraph::Edge::Call);
315 CG.insertEdge(C, C.getFunction(), LazyCallGraph::Edge::Call);
338 CG.insertEdge(lookupFunction(*M, "d1"), lookupFunction(*M, "a1"),
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/X86/
X86DomainReassignment.cpp 340 bool insertEdge(unsigned Reg) {
562 if (!C.insertEdge(CurReg))
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/
GenericDomTree.h 195 void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
559 void insertEdge(NodeT *From, NodeT *To) {
564 DomTreeBuilder::InsertEdge(*this, From, To);
GenericDomTreeConstruction.h 639 static void InsertEdge(DomTreeT &DT, const BatchUpdatePtr BUI,
    [all...]
  /external/llvm/lib/Analysis/
LazyCallGraph.cpp     [all...]
  /external/llvm/lib/CodeGen/
MachineTraceMetrics.cpp 433 bool insertEdge(const MachineBasicBlock *From, const MachineBasicBlock *To) {
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
MachineTraceMetrics.cpp 453 bool insertEdge(Optional<const MachineBasicBlock *> From,
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
LazyCallGraph.cpp     [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/
LoopUtils.cpp     [all...]

Completed in 988 milliseconds