/external/llvm/unittests/IR/ |
DominatorTreeTest.cpp | 28 DominatorTree *DT = &getAnalysis<DominatorTree>(); 56 EXPECT_TRUE(DT->isReachableFromEntry(BB0)); 57 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); 58 EXPECT_TRUE(DT->isReachableFromEntry(BB2)); 59 EXPECT_FALSE(DT->isReachableFromEntry(BB3)); 60 EXPECT_TRUE(DT->isReachableFromEntry(BB4)); 63 EXPECT_TRUE(DT->dominates(BB0, BB0)); 64 EXPECT_TRUE(DT->dominates(BB0, BB1)); 65 EXPECT_TRUE(DT->dominates(BB0, BB2)); 66 EXPECT_TRUE(DT->dominates(BB0, BB3)) [all...] |
/external/llvm/lib/Analysis/ |
PostDominators.cpp | 35 DT->recalculate(F); 40 delete DT; 44 DT->print(OS);
|
PHITransAddr.cpp | 147 const DominatorTree *DT) { 191 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT); 210 (!DT || DT->dominates(CastI->getParent(), PredBB))) 221 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT); 232 if (Value *V = SimplifyGEPInst(GEPOps, TD, TLI, DT)) { 247 (!DT || DT->dominates(GEPI->getParent(), PredBB))) { 269 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT); 288 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT)) { [all...] |
ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) { 40 if (DT->dominates(LatchBlock, User->getParent())) 55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i))) 71 DominatorTree &DT; 77 ScalarEvolution &se, DominatorTree &dt): 78 Kind(kind), Loops(loops), SE(se), DT(dt) {} 122 if (IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) { 220 DominatorTree &DT) { 221 PostIncTransform Transform(Kind, Loops, SE, DT); [all...] |
/external/llvm/include/llvm/Analysis/ |
DominatorInternals.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...] |
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 = 0); 60 const DominatorTree *DT = 0); 67 const DominatorTree *DT = 0); 74 const DominatorTree *DT = 0); 82 const DominatorTree *DT = 0); 88 const DominatorTree *DT = 0); 94 const DominatorTree *DT = 0); 100 const DominatorTree *DT = 0); 106 const DominatorTree *DT = 0); 112 const DominatorTree *DT = 0) [all...] |
PHITransAddr.h | 74 /// dominator tree DT is non-null, the translated value must dominate 77 const DominatorTree *DT); 87 const DominatorTree &DT, 98 const DominatorTree *DT); 106 BasicBlock *PredBB, const DominatorTree &DT,
|
ScalarEvolutionNormalization.h | 74 DominatorTree &DT);
|
Dominators.h | 183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT, 239 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, 260 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) && 261 DT.isReachableFromEntry(ND)) { 272 if (DT.isReachableFromEntry(PredBlocks[i])) { 284 if (DT.isReachableFromEntry(PredBlocks[i])) 285 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]); 289 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom); 294 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc); 295 DT.changeImmediateDominator(NewBBSuccNode, NewBBNode) [all...] |
/external/llvm/include/llvm/CodeGen/ |
MachinePostDominators.h | 30 DominatorTreeBase<MachineBasicBlock> *DT; 42 return DT->getRoots(); 46 return DT->getRootNode(); 50 return DT->getNode(BB); 54 return DT->getNode(BB); 59 return DT->dominates(A, B); 63 return DT->dominates(A, B); 68 return DT->properlyDominates(A, B); 73 return DT->properlyDominates(A, B); 78 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/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);
|
StackProtector.cpp | 49 DominatorTree *DT; 110 DT = getAnalysisIfAvailable<DominatorTree>(); 330 if (DT && DT->isReachableFromEntry(BB)) { 331 DT->addNewBlock(NewBB, BB); 332 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB; 353 if (DT && FailBBDom) 354 DT->addNewBlock(FailBB, FailBBDom);
|
/external/clang/include/clang/Analysis/Analyses/ |
Dominators.h | 35 llvm::DominatorTreeBase<CFGBlock>* DT; 38 DT = new llvm::DominatorTreeBase<CFGBlock>(false); 42 delete DT; 45 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; } 50 return DT->getRoot(); 56 return DT->getRootNode(); 70 if (DT->compare(Other.getBase())) 81 DT->recalculate(*cfg); 91 if(DT->getNode(*I)->getIDom()) 94 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID( [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
PromoteMemToReg.h | 40 DominatorTree &DT, AliasSetTracker *AST = 0);
|
CodeExtractor.h | 48 DominatorTree *const DT; 69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = 0, 76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false); 82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
/frameworks/compile/slang/ |
slang_rs_object_ref_count.h | 66 RSExportPrimitiveType::DataType DT, 94 RSExportPrimitiveType::DataType *DT, 97 // Return a zero-initializer expr of the type DT. This processes both 100 RSExportPrimitiveType::DataType DT, 120 RSExportPrimitiveType::DataType DT) { 121 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT)); 122 return RSSetObjectFD[(DT - RSExportPrimitiveType::FirstRSObjectType)]; 130 RSExportPrimitiveType::DataType DT) { 131 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT)); 132 return RSClearObjectFD[(DT - RSExportPrimitiveType::FirstRSObjectType)] [all...] |
/external/clang/include/clang/Lex/ |
DirectoryLookup.h | 63 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, 65 : DirCharacteristic(DT), 73 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, 75 : DirCharacteristic(DT), LookupType(LT_HeaderMap),
|
/external/llvm/lib/Transforms/Utils/ |
LCSSA.cpp | 55 DominatorTree *DT; 83 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!"); 107 DominatorTree *DT) { 108 DomTreeNode *DomNode = DT->getNode(BB); 110 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i]))) 121 DT = &getAnalysis<DominatorTree>(); 148 if (!BlockDominatesAnExit(BB, ExitBlocks, DT)) 170 assert(L->isLCSSAForm(*DT)); 218 DomTreeNode *DomNode = DT->getNode(DomBB) [all...] |
Mem2Reg.cpp | 64 DominatorTree &DT = getAnalysis<DominatorTree>(); 78 PromoteMemToReg(Allocas, DT);
|
/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...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopRotation.cpp | 253 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) 254 DT->eraseNode(Latch); 420 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) { 425 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader); 428 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader); 430 DT->changeImmediateDominator(HeaderChildren[I], OrigPreheaderNode); 432 assert(DT->getNode(Exit)->getIDom() == OrigPreheaderNode); 433 assert(DT->getNode(NewHeader)->getIDom() == OrigPreheaderNode); 436 DT->changeImmediateDominator(OrigHeader, OrigLatch); 458 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) [all...] |