/external/llvm/include/llvm/Analysis/ |
H A D | LazyValueInfo.h | 33 DominatorTree *DT; member in class:llvm::LazyValueInfo
|
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 99 getEntryNode(PostDominatorTree *DT) argument [all...] |
H A D | IVUsers.h | 123 DominatorTree *DT; member in class:llvm::IVUsers
|
/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 | StackProtector.h | 61 DominatorTree *DT; member in class:llvm::StackProtector
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | CodeExtractor.h | 48 DominatorTree *const DT; member in class:llvm::CodeExtractor 69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr, 76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false); 82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
H A D | SimplifyIndVar.h | 36 const DominatorTree *DT; member in class:llvm::IVVisitor 42 IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {} 45 const DominatorTree *getDomTree() const { return DT; } 52 assert(DT && "Splitting overflow intrinsics requires a DomTree.");
|
H A D | BasicBlockUtils.h | 55 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr, 84 DominatorTree *DT; member in struct:llvm::CriticalEdgeSplittingOptions 91 : AA(nullptr), DT(nullptr), LI(nullptr), MergeIdenticalEdges(false), 95 CriticalEdgeSplittingOptions(AliasAnalysis *AA, DominatorTree *DT = nullptr, 97 : AA(AA), DT(DT), LI(LI), MergeIdenticalEdges(false), 102 CriticalEdgeSplittingOptions(DominatorTree *DT, LoopInfo *LI) argument 103 : AA(nullptr), DT(DT), LI(LI), MergeIdenticalEdges(false), 195 DominatorTree *DT [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | Mem2Reg.cpp | 68 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 84 PromoteMemToReg(Allocas, DT, nullptr, &AC);
|
H A D | SimplifyInstructions.cpp | 53 const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr; variable 75 if (Value *V = SimplifyInstruction(I, DL, TLI, DT, AC)) {
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64CleanupLocalDynamicTLSPass.cpp | 48 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>(); variable 49 return VisitNode(DT->getRootNode(), 0);
|
/external/clang/include/clang/Lex/ |
H A D | DirectoryLookup.h | 68 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, argument 70 : DirCharacteristic(DT), 78 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, argument 80 : DirCharacteristic(DT), LookupType(LT_HeaderMap),
|
/external/llvm/lib/Analysis/ |
H A D | CaptureTracking.cpp | 60 CapturesBefore(bool ReturnCaptures, const Instruction *I, DominatorTree *DT, argument 62 : BeforeHere(I), DT(DT), ReturnCaptures(ReturnCaptures), 75 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) 80 if (BeforeHere != I && DT->dominates(BeforeHere, I) && 81 !isPotentiallyReachable(I, BeforeHere, DT)) 96 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) 98 if (BeforeHere != I && DT->dominates(BeforeHere, I) && 99 !isPotentiallyReachable(I, BeforeHere, DT)) 106 DominatorTree *DT; member in struct:__anon10334::CapturesBefore 147 PointerMayBeCapturedBefore(const Value *V, bool ReturnCaptures, bool StoreCaptures, const Instruction *I, DominatorTree *DT, bool IncludeI) argument [all...] |
H A D | 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, L 129 isPotentiallyReachableInner(SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, const DominatorTree *DT, const LoopInfo *LI) argument 174 isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B, const DominatorTree *DT, const LoopInfo *LI) argument 186 isPotentiallyReachable(const Instruction *A, const Instruction *B, const DominatorTree *DT, const LoopInfo *LI) argument [all...] |
H A D | DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) { argument 73 static std::string getGraphName(PostDominatorTree *DT) { argument
|
H A D | 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, AC)) { 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, A 145 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument 319 PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument 343 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument 367 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument [all...] |
H A D | RegionInfo.cpp | 66 DominatorTree *DT, Region *Parent) : 67 RegionBase<RegionTraits<Function>>(Entry, Exit, RI, DT, Parent) { 96 DT = DT_; 101 this, DT, nullptr); 121 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 125 RI.recalculate(F, DT, PDT, DF); 64 Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo* RI, DominatorTree *DT, Region *Parent) argument
|
H A D | RegionPrinter.cpp | 64 static std::string getGraphName(RegionInfoPass *DT) { argument
|
H A D | 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; member in class:__anon10377::PostIncTransform 78 Kind(kind), Loops(loops), SE(se), DT(dt) {} 133 IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) { 251 DominatorTree &DT) { 252 PostIncTransform Transform(Kind, Loops, SE, DT); 29 IVUseShouldUsePostIncValue(Instruction *User, Value *Operand, const Loop *L, DominatorTree *DT) argument 245 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZLDCleanup.cpp | 76 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>(); local 77 return VisitNode(DT->getRootNode(), 0);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 209 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 215 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end()); 218 DT.changeImmediateDominator(*DI, DT[preheader]); 222 DT.eraseNode(*LI);
|
H A D | NaryReassociate.cpp | 130 DominatorTree *DT; member in class:__anon11059::NaryReassociate 163 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 180 for (auto Node = GraphTraits<DominatorTree *>::nodes_begin(DT); 181 Node != GraphTraits<DominatorTree *>::nodes_end(DT); ++Node) { 244 if (DT->dominates(LHS, I)) {
|
/external/llvm/unittests/Analysis/ |
H A D | CFGTest.cpp | 92 DominatorTree *DT = local 96 EXPECT_EQ(isPotentiallyReachable(A, B, DT, nullptr), ExpectedResult); 98 EXPECT_EQ(isPotentiallyReachable(A, B, DT, LI), ExpectedResult);
|
/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/Support/ |
H A D | GenericDomTreeConstruction.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...] |