/external/dtc/ |
H A D | dtdiff | 11 DT="$1" 12 if [ -d "$DT" ]; then 14 elif [ -f "$DT" ]; then 15 case "$DT" in 26 echo "Unrecognized format for $DT" >&2 30 $DTC -I $IFORMAT -O dts -qq -f -s -o - "$DT"
|
/external/llvm/unittests/IR/ |
H A D | DominatorTreeTest.cpp | 30 DominatorTree *DT = variable 61 EXPECT_TRUE(DT->isReachableFromEntry(BB0)); 62 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); 63 EXPECT_TRUE(DT->isReachableFromEntry(BB2)); 64 EXPECT_FALSE(DT->isReachableFromEntry(BB3)); 65 EXPECT_TRUE(DT->isReachableFromEntry(BB4)); 68 EXPECT_TRUE(DT->dominates(BB0, BB0)); 69 EXPECT_TRUE(DT->dominates(BB0, BB1)); 70 EXPECT_TRUE(DT->dominates(BB0, BB2)); 71 EXPECT_TRUE(DT [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | PostDominators.cpp | 35 DT->recalculate(F); 40 delete DT; 44 DT->print(OS);
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, argument 39 InfoRec &VInfo = DT.Info[DT.Roots[i]]; 46 InfoRec &SuccVInfo = DT.Info[*SI]; 49 N = DTDFSPass(DT, *SI, N); 63 DT.Info[BB]; 70 DT.Vertex.push_back(BB); // Vertex[n] = V; 95 DT.Info[Succ]; 107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT, argument 110 DT 150 Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, FuncT& F) argument [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | DominatorInternals.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, argument 40 InfoRec &VInfo = DT.Info[DT.Roots[i]]; 47 InfoRec &SuccVInfo = DT.Info[*SI]; 50 N = DTDFSPass(DT, *SI, N); 64 DT.Info[BB]; 71 DT.Vertex.push_back(BB); // Vertex[n] = V; 96 DT.Info[Succ]; 108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, argument 111 DT 151 Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, FuncT& F) argument [all...] |
H A D | PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT; member in struct:llvm::PostDominatorTree 30 DT = new DominatorTreeBase<BasicBlock>(true); 42 return DT->getRoots(); 46 return DT->getRootNode(); 50 return DT->getNode(BB); 54 return DT->getNode(BB); 58 return DT->dominates(A, B); 62 return DT->dominates(A, B); 66 return DT->properlyDominates(A, B); 70 return DT 88 getEntryNode(PostDominatorTree *DT) argument [all...] |
H A D | InstructionSimplify.h | 33 const TargetData *TD = 0, const DominatorTree *DT = 0); 38 const TargetData *TD = 0, const DominatorTree *DT = 0); 43 const DominatorTree *DT = 0); 48 const DominatorTree *DT = 0); 53 const DominatorTree *DT = 0); 58 const DominatorTree *DT = 0); 63 const DominatorTree *DT = 0); 68 const DominatorTree *DT = 0); 73 const DominatorTree *DT = 0); 78 const TargetData *TD = 0, const DominatorTree *DT [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT; member in struct:llvm::MachinePostDominatorTree 41 return DT->getRoots(); 45 return DT->getRootNode(); 49 return DT->getNode(BB); 53 return DT->getNode(BB); 58 return DT->dominates(A, B); 62 return DT->dominates(A, B); 67 return DT->properlyDominates(A, B); 72 return DT->properlyDominates(A, B); 77 return DT [all...] |
H A D | MachineDominators.h | 62 /// \brief Apply all the recorded critical edges to the DT. 63 /// This updates the underlying DT information in a way that uses 64 /// the fast query path of DT as much as possible. 71 DominatorTreeBase<MachineBasicBlock>* DT; member in class:llvm::MachineDominatorTree 79 return *DT; 90 return DT->getRoots(); 95 return DT->getRoot(); 100 return DT->getRootNode(); 108 return DT->dominates(A, B); 114 return DT 299 getEntryNode(MachineDominatorTree *DT) argument [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachinePostDominators.cpp | 27 DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate 38 DT->recalculate(F); 43 delete DT; 54 DT->print(OS);
|
H A D | MachineDominators.cpp | 52 DT->recalculate(F); 60 DT = new DominatorTreeBase<MachineBasicBlock>(false); 64 delete DT; 68 DT->releaseMemory(); 77 DT->print(OS); 93 // the underlying DT. 97 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ); 113 // FromBB2 since Split2 is still unknown of the underlying DT structure. 120 if (!DT->dominates(SuccDTNode, DT [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
H A D | MachineDominators.h | 43 DominatorTreeBase<MachineBasicBlock>* DT; member in class:llvm::MachineDominatorTree 49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; } 58 return DT->getRoots(); 62 return DT->getRoot(); 66 return DT->getRootNode(); 72 return DT->dominates(A, B); 76 return DT->dominates(A, B); 83 if (BBA != BBB) return DT->dominates(BBA, BBB); 90 //if(!DT.IsPostDominators) { 101 return DT 196 getEntryNode(MachineDominatorTree *DT) argument [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 41 llvm::DominatorTreeBase<CFGBlock>* DT; member in class:clang::DominatorTree 44 DT = new llvm::DominatorTreeBase<CFGBlock>(false); 47 ~DominatorTree() override { delete DT; } 49 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; } 54 return DT->getRoot(); 60 return DT->getRootNode(); 74 if (DT->compare(Other.getBase())) 85 DT->recalculate(*cfg); 95 if(DT->getNode(*I)->getIDom()) 98 << DT 196 getEntryNode(::clang::DominatorTree *DT) argument [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SimplifyIndVar.h | 35 const DominatorTree *DT; member in class:llvm::IVVisitor 40 IVVisitor() : DT(nullptr) {} 43 const DominatorTree *getDomTree() const { return DT; } 49 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, 55 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | MachineDominators.cpp | 38 DT->recalculate(F); 46 DT = new DominatorTreeBase<MachineBasicBlock>(false); 50 delete DT; 54 DT->releaseMemory(); 58 DT->print(OS);
|
/external/llvm/include/llvm/Analysis/ |
H A D | IteratedDominanceFrontier.h | 49 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {} argument 87 DominatorTreeBase<BasicBlock> &DT; member in class:llvm::IDFCalculator
|
H A D | InstructionSimplify.h | 54 const DominatorTree *DT = nullptr, 63 const DominatorTree *DT = nullptr, 72 const DominatorTree *DT = nullptr, 81 const DominatorTree *DT = nullptr, 90 const DominatorTree *DT = nullptr, 98 const DominatorTree *DT = nullptr, 106 const DominatorTree *DT = nullptr, 114 const DominatorTree *DT = nullptr, 123 const DominatorTree *DT = nullptr, 131 const DominatorTree *DT [all...] |
H A D | CFG.h | 61 /// Using DT or LI allows us to answer more quickly. LI reduces the cost of 63 /// single block. DT reduces the cost by allowing the search to terminate when 64 /// we find a block that dominates the block containing 'To'. DT is most useful 68 const DominatorTree *DT = nullptr, 78 const DominatorTree *DT = nullptr, 90 const DominatorTree *DT = nullptr,
|
H A D | Loads.h | 32 const DominatorTree *DT = nullptr); 41 const DominatorTree *DT = nullptr); 46 /// If DT and ScanFrom are specified this method performs context-sensitive 55 const DominatorTree *DT = nullptr);
|
H A D | PostDominators.h | 66 PostDominatorTree DT; member in struct:llvm::PostDominatorTreeWrapperPass 72 PostDominatorTree &getPostDomTree() { return DT; } 73 const PostDominatorTree &getPostDomTree() const { return DT; } 82 DT.releaseMemory(); 92 static NodeType *getEntryNode(PostDominatorTree *DT) { argument 93 return DT->getRootNode();
|
/external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
H A D | FunctionUtils.h | 29 Function* ExtractCodeRegion(DominatorTree& DT, 35 Function* ExtractLoop(DominatorTree& DT, Loop *L,
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LCSSA.cpp | 63 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, argument 101 DomTreeNode *DomNode = DT.getNode(DomBB); 112 if (!DT.dominates(DomNode, DT.getNode(ExitBB))) 193 processInstruction(*OtherLoop, *I, DT, EBs, PredCache, LI); 208 DominatorTree &DT, 210 DomTreeNode *DomNode = DT.getNode(BB); 212 return DT.dominates(DomNode, DT.getNode(EB)); 216 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInf 207 blockDominatesAnExit(BasicBlock *BB, DominatorTree &DT, const SmallVectorImpl<BasicBlock *> &ExitBlocks) argument [all...] |
H A D | Mem2Reg.cpp | 30 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT, argument 49 PromoteMemToReg(Allocas, DT, nullptr, &AC); 57 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 59 if (!promoteMemoryToRegister(F, DT, AC)) 80 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 83 return promoteMemoryToRegister(F, DT, AC);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopSimplifyCFG.cpp | 39 static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI) { argument 60 MergeBasicBlockIntoOnlyPred(Succ, &DT); 73 auto *DT = FAM.getCachedResult<DominatorTreeAnalysis>(*F); local 74 assert((LI && DT) && "Analyses for LoopSimplifyCFG not available"); 76 if (!simplifyLoopCFG(L, *DT, *LI)) 93 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 95 return simplifyLoopCFG(*L, DT, LI);
|
H A D | Sink.cpp | 38 DominatorTree &DT) { 54 if (!DT.dominates(BB, UseBlock)) 96 DominatorTree &DT, LoopInfo &LI) { 122 if (!DT.dominates(Inst->getParent(), SuccToSinkTo)) 134 return AllUsesDominatedByBlock(Inst, SuccToSinkTo, DT); 141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { 168 DomTreeNode *DTN = DT.getNode(Inst->getParent()); 173 IsAcceptableTarget(Inst, Candidate, DT, LI)) 181 if (IsAcceptableTarget(Inst, *I, DT, LI)) 200 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInf argument 37 AllUsesDominatedByBlock(Instruction *Inst, BasicBlock *BB, DominatorTree &DT) argument 95 IsAcceptableTarget(Instruction *Inst, BasicBlock *SuccToSinkTo, DominatorTree &DT, LoopInfo &LI) argument 139 SinkInstruction(Instruction *Inst, SmallPtrSetImpl<Instruction *> &Stores, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument 240 iterativelySinkInstructions(Function &F, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument 258 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 280 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable [all...] |