/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
H A D | IndVarSimplify.cpp | 79 DominatorTree *DT; member in class:__anon20219::IndVarSimplify 87 IndVarSimplify() : LoopPass(ID), IU(0), LI(0), SE(0), DT(0), TD(0), 201 DominatorTree *DT) { 216 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB); 221 DT->dominates(cast<Instruction>(Def), InsertPt)) && 496 assert(L->isLCSSAForm(*DT)); 680 Instruction *InsertPt = getInsertPointForUses(User, Op, DT); 805 DominatorTree *DT; member in class:__anon20221::WidenIV 826 DT(DTree), 855 static bool isLoopInvariant(Value *V, const Loop *L, const DominatorTree *DT) { argument 200 getInsertPointForUses(Instruction *User, Value *Def, DominatorTree *DT) argument 1333 getLoopPhiForCounter(Value *IncV, Loop *L, DominatorTree *DT) argument 1370 needsLFTR(Loop *L, DominatorTree *DT) argument 1438 FindLoopCounter(Loop *L, const SCEV *BECount, ScalarEvolution *SE, DominatorTree *DT, const TargetData *TD) argument [all...] |
H A D | LoopInstSimplify.cpp | 64 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); local 107 Value *V = SimplifyInstruction(I, TD, DT);
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/AsmPrinter/ |
H A D | DwarfCompileUnit.cpp | 378 DIDerivedType DT = DIDerivedType(Element); local 379 StringRef fieldName = DT.getName(); 1307 DIE *CompileUnit::createMemberDIE(DIDerivedType DT) { argument 1308 DIE *MemberDie = new DIE(DT.getTag()); 1309 StringRef Name = DT.getName(); 1313 addType(MemberDie, DT.getTypeDerivedFrom()); 1315 addSourceLine(MemberDie, DT); 1320 uint64_t Size = DT.getSizeInBits(); 1321 uint64_t FieldSize = DT.getOriginalTypeSize(); 1325 addUInt(MemberDie, dwarf::DW_AT_byte_size, 0, DT [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontierImpl.h | 153 ForwardDominanceFrontierBase<BlockT>::calculate(const DomTreeT &DT, argument 181 if (DT[*SI]->getIDom() != currentNode) 213 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
|
H A D | RegionInfo.h | 270 DomTreeT *DT; member in class:llvm::RegionBase 304 /// @param DT The dominator tree of the current function. 307 RegionBase(BlockT *Entry, BlockT *Exit, RegionInfoT *RI, DomTreeT *DT, 681 : DT(std::move(Arg.DT)), PDT(std::move(Arg.PDT)), DF(std::move(Arg.DF)), 687 DT = std::move(RHS.DT); 696 DomTreeT *DT; member in class:llvm::RegionInfoBase 712 DT = nullptr; 857 Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo *RI, DominatorTree *DT, [all...] |
H A D | MemoryDependenceAnalysis.h | 344 DominatorTree &DT; member in class:llvm::MemoryDependenceResults 350 DominatorTree &DT) 351 : AA(AA), AC(AC), TLI(TLI), DT(DT) {} 348 MemoryDependenceResults(AliasAnalysis &AA, AssumptionCache &AC, const TargetLibraryInfo &TLI, DominatorTree &DT) argument
|
/external/llvm/include/llvm/CodeGen/ |
H A D | StackProtector.h | 61 DominatorTree *DT; member in class:llvm::StackProtector
|
H A D | MachineRegionInfo.h | 69 MachineDominatorTree *DT, MachineRegion *Parent = nullptr); 87 MachineDominatorTree *DT,
|
/external/llvm/include/llvm/Transforms/Scalar/ |
H A D | GVN.h | 57 DominatorTree &getDominatorTree() const { return *DT; } 75 DominatorTree *DT; member in class:llvm::GVN::ValueTable 102 void setDomTree(DominatorTree *D) { DT = D; } 108 DominatorTree *DT; member in class:llvm::GVN
|
/external/llvm/lib/CodeGen/ |
H A D | InterleavedAccessPass.cpp | 69 : FunctionPass(ID), DT(nullptr), TM(TM), TLI(nullptr) { 83 DominatorTree *DT; member in class:__anon12675::InterleavedAccess 293 if (!DT->dominates(Shuffle, Extract)) 366 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
H A D | StackProtector.cpp | 91 DT = DTWP ? &DTWP->getDomTree() : nullptr; 412 if (DT && DT->isReachableFromEntry(BB)) { 413 DT->addNewBlock(NewBB, BB); 414 DT->addNewBlock(FailBB, BB);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64PromoteConstant.cpp | 363 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( local 369 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) || 370 // When IPI.first is a terminator instruction, DT may think that 374 DT.dominates(IPI.first->getParent(), NewPt->getParent()))) { 389 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( local 412 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB); 483 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>(F).getDomTree(); local 499 assert(DT.dominates(LoadedCst,
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | AlignmentFromAssumptions.cpp | 310 if (isValidAssumeForContext(ACall, K, DT)) 394 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT)) 408 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 410 return Impl.runImpl(F, AC, SE, DT); 417 DT = DT_; 435 DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); local 436 bool Changed = runImpl(F, AC, &SE, &DT);
|
H A D | RewriteStatepointsForGC.cpp | 206 static void computeLiveInValues(DominatorTree &DT, Function &F, 277 analyzeParsePointLiveness(DominatorTree &DT, argument 1025 DominatorTree *DT, DefiningValueMapTy &DVCache) { 1031 DT->dominates(cast<Instruction>(base)->getParent(), 1039 static void findBasePointers(DominatorTree &DT, DefiningValueMapTy &DVCache, argument 1043 findBasePointers(result.LiveSet, PointerToBase, &DT, DVCache); 1066 Function &F, DominatorTree &DT, ArrayRef<CallSite> toUpdate, 1071 computeLiveInValues(DT, F, RevisedLivenessData); 1086 DominatorTree &DT) { 1089 Ret = SplitBlockPredecessors(BB, InvokeParent, "", &DT); 1023 findBasePointers(const StatepointLiveSetTy &live, MapVector<Value *, Value *> &PointerToBase, DominatorTree *DT, DefiningValueMapTy &DVCache) argument 1065 recomputeLiveInValues( Function &F, DominatorTree &DT, ArrayRef<CallSite> toUpdate, MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) argument 1085 normalizeForInvokeSafepoint(BasicBlock *BB, BasicBlock *InvokeParent, DominatorTree &DT) argument 1462 makeStatepointExplicit(DominatorTree &DT, CallSite CS, PartiallyConstructedSafepointRecord &Result, std::vector<DeferredReplacement> &Replacements) argument 1549 relocationViaAlloca( Function &F, DominatorTree &DT, ArrayRef<Value *> Live, ArrayRef<PartiallyConstructedSafepointRecord> Records) argument 1775 findLiveReferences( Function &F, DominatorTree &DT, ArrayRef<CallSite> toUpdate, MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) argument 1977 insertParsePoints(Function &F, DominatorTree &DT, TargetTransformInfo &TTI, SmallVectorImpl<CallSite> &ToUpdate) argument 2443 checkBasicSSA(DominatorTree &DT, SetVector<Value *> &Live, TerminatorInst *TI, bool TermOkay = false) argument 2461 checkBasicSSA(DominatorTree &DT, GCPtrLivenessData &Data, BasicBlock &BB) argument 2469 computeLiveInValues(DominatorTree &DT, Function &F, GCPtrLivenessData &Data) argument [all...] |
H A D | DeadStoreElimination.cpp | 571 BasicBlock *BB, DominatorTree *DT) { 579 if (DT->isReachableFromEntry(Pred)) 587 MemoryDependenceResults *MD, DominatorTree *DT, 630 findUnconditionalPreds(Blocks, BB, DT); 867 MemoryDependenceResults *MD, DominatorTree *DT, 879 MadeChange |= handleFree(F, AA, MD, DT, TLI); 1024 MemoryDependenceResults *MD, DominatorTree *DT, 1030 if (DT->isReachableFromEntry(&BB)) 1031 MadeChange |= eliminateDeadStores(BB, AA, MD, DT, TLI); 1040 DominatorTree *DT local 570 findUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, BasicBlock *BB, DominatorTree *DT) argument 586 handleFree(CallInst *F, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument 866 eliminateDeadStores(BasicBlock &BB, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument 1023 eliminateDeadStores(Function &F, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument [all...] |
H A D | EarlyCSE.cpp | 252 DominatorTree &DT; member in class:__anon13465::EarlyCSE 315 DominatorTree &DT, AssumptionCache &AC) 316 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), CurrentGeneration(0) {} 527 replaceDominatedUsesWith(CondInst, ConditionalConstant, DT, 583 if (Value *V = SimplifyInstruction(Inst, DL, &TLI, &DT, &AC)) { 806 DT.getRootNode(), DT.getRootNode()->begin(), DT.getRootNode()->end())); 851 auto &DT local 314 EarlyCSE(const TargetLibraryInfo &TLI, const TargetTransformInfo &TTI, DominatorTree &DT, AssumptionCache &AC) argument 889 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable [all...] |
H A D | LoopInstSimplify.cpp | 73 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr; local 120 Value *V = SimplifyInstruction(I, DL, TLI, DT, &AC);
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | MachineSink.cpp | 49 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon19827::MachineSinking 204 if (!DT->dominates(MBB, UseBlock)) 218 DT = &getAnalysis<MachineDominatorTree>(); 248 if (!DT->isReachableFromEntry(&MBB)) return false; 373 if (!DT->dominates(ToBB, *PI)) 562 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
/external/llvm/lib/Analysis/ |
H A D | BasicAliasAnalysis.cpp | 185 AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) { 225 BOp, DT)) { 233 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 238 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 243 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 249 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 276 Depth + 1, AC, DT, NSW, NUW); 348 DominatorTree *DT) { 449 SExtBits, DL, 0, AC, DT, NSW, NUW); 1025 DecomposeGEPExpression(GEP1, DecompGEP1, DL, &AC, DT); 182 GetLinearExpression( const Value *V, APInt &Scale, APInt &Offset, unsigned &ZExtBits, unsigned &SExtBits, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) argument 346 DecomposeGEPExpression(const Value *V, DecomposedGEP &Decomposed, const DataLayout &DL, AssumptionCache *AC, DominatorTree *DT) argument 1188 0, &AC, nullptr, DT); local 1612 constantOffsetHeuristic( const SmallVectorImpl<VariableGEPIndex> &VarIndices, uint64_t V1Size, uint64_t V2Size, int64_t BaseOffset, AssumptionCache *AC, DominatorTree *DT) argument [all...] |
H A D | DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) { argument 73 static std::string getGraphName(PostDominatorTree *DT) { argument
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 180 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType> &DT, 254 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT, argument 277 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) && 278 DT.isReachableFromEntry(ND)) { 289 if (DT.isReachableFromEntry(PredBlocks[i])) { 301 if (DT.isReachableFromEntry(PredBlocks[i])) 302 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]); 306 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom); 311 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc); 312 DT [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | PromoteMemoryToRegister.cpp | 225 DominatorTree &DT; member in struct:__anon13565::PromoteMem2Reg 271 PromoteMem2Reg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT, argument 273 : Allocas(Allocas.begin(), Allocas.end()), DT(DT), 274 DIB(*DT.getRoot()->getParent()->getParent(), /*AllowUnresolved*/ false), 338 DominatorTree &DT, 375 !DT.dominates(StoreBB, LI->getParent())) { 518 Function &F = *DT.getRoot()->getParent(); 526 ForwardIDFCalculator IDF(DT); 556 if (rewriteSingleStoreAlloca(AI, Info, LBI, DT, AS 336 rewriteSingleStoreAlloca(AllocaInst *AI, AllocaInfo &Info, LargeBlockInfo &LBI, DominatorTree &DT, AliasSetTracker *AST) argument 987 PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT, AliasSetTracker *AST, AssumptionCache *AC) argument [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | ScalarEvolutionExpander.h | 113 const DominatorTree *DT); 117 unsigned replaceCongruentIVs(Loop *L, const DominatorTree *DT,
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) { argument 73 static std::string getGraphName(PostDominatorTree *DT) { argument
|
H A D | ScalarEvolutionExpander.cpp | 609 DominatorTree &DT) { 614 if (DT.dominates(A->getHeader(), B->getHeader())) return B; 615 if (DT.dominates(B->getHeader(), A->getHeader())) return A; 643 L = PickMostRelevantLoop(L, getRelevantLoop(*I), *SE.DT); 654 *SE.DT); 665 DominatorTree &DT; member in class:__anon19784::LoopCompare 667 explicit LoopCompare(DominatorTree &dt) : DT(dt) {} 678 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first; 710 std::stable_sort(OpsAndLoops.begin(), OpsAndLoops.end(), LoopCompare(*SE.DT)); 778 std::stable_sort(OpsAndLoops.begin(), OpsAndLoops.end(), LoopCompare(*SE.DT)); 608 PickMostRelevantLoop(const Loop *A, const Loop *B, DominatorTree &DT) argument 1495 hoistStep(Instruction *IncV, Instruction *InsertPos, const DominatorTree *DT) argument 1523 replaceCongruentIVs(Loop *L, const DominatorTree *DT, SmallVectorImpl<WeakVH> &DeadInsts) argument [all...] |