/external/llvm/unittests/IR/ |
DominatorTreeTest.cpp | 29 DominatorTree *DT = 59 EXPECT_TRUE(DT->isReachableFromEntry(BB0)); 60 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); 61 EXPECT_TRUE(DT->isReachableFromEntry(BB2)); 62 EXPECT_FALSE(DT->isReachableFromEntry(BB3)); 63 EXPECT_TRUE(DT->isReachableFromEntry(BB4)); 66 EXPECT_TRUE(DT->dominates(BB0, BB0)); 67 EXPECT_TRUE(DT->dominates(BB0, BB1)); 68 EXPECT_TRUE(DT->dominates(BB0, BB2)); 69 EXPECT_TRUE(DT->dominates(BB0, BB3)) [all...] |
/external/llvm/include/llvm/Analysis/ |
PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT; 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->properlyDominates(A, B) [all...] |
InstructionSimplify.h | 53 const DominatorTree *DT = nullptr); 60 const DominatorTree *DT = nullptr); 67 const DominatorTree *DT = nullptr); 74 const DominatorTree *DT = nullptr); 82 const DominatorTree *DT = nullptr); 88 const DominatorTree *DT = nullptr); 95 const DominatorTree *DT = nullptr); 102 const DominatorTree *DT = nullptr); 109 const DominatorTree *DT = nullptr); 116 const DominatorTree *DT = nullptr) [all...] |
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,
|
PHITransAddr.h | 75 /// dominator tree DT is non-null, the translated value must dominate 78 const DominatorTree *DT); 88 const DominatorTree &DT, 99 const DominatorTree *DT); 107 BasicBlock *PredBB, const DominatorTree &DT,
|
ScalarEvolutionNormalization.h | 74 DominatorTree &DT);
|
/external/llvm/lib/Analysis/ |
PostDominators.cpp | 34 DT->recalculate(F); 39 delete DT; 43 DT->print(OS);
|
PHITransAddr.cpp | 147 const DominatorTree *DT) { 191 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT); 209 (!DT || DT->dominates(CastI->getParent(), PredBB))) 220 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT); 231 if (Value *V = SimplifyGEPInst(GEPOps, DL, TLI, DT)) { 245 (!DT || DT->dominates(GEPI->getParent(), PredBB))) { 267 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT); 286 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, DL, TLI, DT)) { [all...] |
CFG.cpp | 131 const DominatorTree *DT, 135 if (DT && !DT->isReachableFromEntry(StopBB)) 136 DT = nullptr; 148 if (DT && DT->dominates(BB, StopBB)) 175 const DominatorTree *DT, const LoopInfo *LI) { 183 DT, LI); 187 const DominatorTree *DT, const LoopInfo *LI) { 235 DT, LI) [all...] |
/external/llvm/include/llvm/Support/ |
GenericDomTreeConstruction.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, 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, 111 DT.Info[VIn] [all...] |
/external/llvm/include/llvm/CodeGen/ |
MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT; 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->findNearestCommonDominator(A, B) [all...] |
MachineDominators.h | 43 DominatorTreeBase<MachineBasicBlock>* DT; 49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; } 58 return DT->getRoots(); 62 return DT->getRoot(); 66 return DT->getRootNode(); 73 return DT->dominates(A, B); 78 return DT->dominates(A, B); 85 if (BBA != BBB) return DT->dominates(BBA, BBB); 92 //if(!DT.IsPostDominators) { 103 return DT->properlyDominates(A, B) [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
SimplifyIndVar.h | 36 const DominatorTree *DT; 42 IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {} 45 const DominatorTree *getDomTree() const { return DT; } 52 assert(DT && "Splitting overflow intrinsics requires a DomTree.");
|
LoopUtils.h | 35 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, Pass *PP, 50 bool formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE = nullptr); 61 bool formLCSSARecursively(Loop &L, DominatorTree &DT,
|
PromoteMemToReg.h | 43 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
CodeExtractor.h | 48 DominatorTree *const DT; 69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr, 76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false); 82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
/external/llvm/lib/CodeGen/ |
MachinePostDominators.cpp | 27 DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate 38 DT->recalculate(F); 43 delete DT; 54 DT->print(OS);
|
MachineDominators.cpp | 38 DT->recalculate(F); 46 DT = new DominatorTreeBase<MachineBasicBlock>(false); 50 delete DT; 54 DT->releaseMemory(); 58 DT->print(OS);
|
/external/clang/include/clang/Analysis/Analyses/ |
Dominators.h | 41 llvm::DominatorTreeBase<CFGBlock>* DT; 44 DT = new llvm::DominatorTreeBase<CFGBlock>(false); 48 delete DT; 51 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; } 56 return DT->getRoot(); 62 return DT->getRootNode(); 76 if (DT->compare(Other.getBase())) 87 DT->recalculate(*cfg); 97 if(DT->getNode(*I)->getIDom()) 100 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID( [all...] |
/frameworks/compile/slang/ |
slang_rs_object_ref_count.h | 64 DataType DT, 92 DataType *DT, 95 // Return a zero-initializer expr of the type DT. This processes both 98 DataType DT, 115 static clang::FunctionDecl *GetRSSetObjectFD(DataType DT) { 116 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT)); 117 if (DT >= 0 && DT < DataTypeMax) { 118 return RSSetObjectFD[DT]; 129 static clang::FunctionDecl *GetRSClearObjectFD(DataType DT) { [all...] |
/external/llvm/lib/Transforms/Utils/ |
LCSSA.cpp | 62 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, 94 DomTreeNode *DomNode = DT.getNode(DomBB); 107 if (!DT.dominates(DomNode, DT.getNode(ExitBB))) 173 DominatorTree &DT, 175 DomTreeNode *DomNode = DT.getNode(BB); 177 if (DT.dominates(DomNode, DT.getNode(ExitBlocks[i]))) 183 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE) { 204 if (!blockDominatesAnExit(BB, DT, ExitBlocks) [all...] |
/external/llvm/include/llvm/IR/ |
Dominators.h | 39 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA 43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT 144 static NodeType *getEntryNode(DominatorTree *DT) { 145 return DT->getRootNode(); 159 DominatorTree DT; 168 DominatorTree &getDomTree() { return DT; } 169 const DominatorTree &getDomTree() const { return DT; } 179 void releaseMemory() override { DT.releaseMemory(); }
|
/external/clang/include/clang/Lex/ |
DirectoryLookup.h | 68 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, 70 : DirCharacteristic(DT), 78 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, 80 : DirCharacteristic(DT), LookupType(LT_HeaderMap),
|
/ndk/tests/device/test-stlport_shared-exception/jni/ |
unroll1.cpp | 20 template<class DT> 24 typedef typename DT::Domain_t Domain_t; 25 typedef typename DT::Storage_t Storage_t; 30 return *static_cast<Domain_t *>(const_cast<DomainBase<DT> *>(this)); 37 template<class DT> 38 class Domain : public DomainBase<DT> 40 typedef DomainBase<DT> Base_t; 43 typedef typename DT::Size_t Size_t; 44 typedef typename DT::Element_t Element_t; 54 DT::setDomain(this->domain_m, newdom) [all...] |
/ndk/tests/device/test-stlport_static-exception/jni/ |
unroll1.cpp | 20 template<class DT> 24 typedef typename DT::Domain_t Domain_t; 25 typedef typename DT::Storage_t Storage_t; 30 return *static_cast<Domain_t *>(const_cast<DomainBase<DT> *>(this)); 37 template<class DT> 38 class Domain : public DomainBase<DT> 40 typedef DomainBase<DT> Base_t; 43 typedef typename DT::Size_t Size_t; 44 typedef typename DT::Element_t Element_t; 54 DT::setDomain(this->domain_m, newdom) [all...] |