| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 60 DominatorTree *DT;
515 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
569 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| AlignmentFromAssumptions.cpp | 77 DominatorTree *DT;
321 if (isValidAssumeForContext(ACall, K, DT))
405 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT))
417 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
| GVN.cpp | 116 DominatorTree *DT;
139 void setDomTree(DominatorTree* D) { DT = D; }
356 if (NonLocalDepCall && DT->properlyDominates(I->getBB(), C->getParent())){
599 DominatorTree *DT;
642 DominatorTree &getDominatorTree() const { return *DT; }
[all...] |
| DeadStoreElimination.cpp | 52 DominatorTree *DT;
56 DSE() : FunctionPass(ID), AA(nullptr), MD(nullptr), DT(nullptr) {
66 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
73 if (DT->isReachableFromEntry(&I))
76 AA = nullptr; MD = nullptr; DT = nullptr;
722 BasicBlock *BB, DominatorTree *DT) {
730 if (DT->isReachableFromEntry(Pred))
780 FindUnconditionalPreds(Blocks, BB, DT);
[all...] |
| LoopStrengthReduce.cpp | 903 ScalarEvolution &SE, DominatorTree &DT,
914 ScalarEvolution &SE, DominatorTree &DT);
918 ScalarEvolution &SE, DominatorTree &DT,
[all...] |
| LoopRerollPass.cpp | 164 DominatorTree *DT;
357 TargetLibraryInfo *TLI, DominatorTree *DT, LoopInfo *LI,
360 : Parent(Parent), L(L), SE(SE), AA(AA), TLI(TLI), DT(DT), LI(LI),
407 DominatorTree *DT;
[all...] |
| StraightLineStrengthReduce.cpp | 128 : FunctionPass(ID), DL(nullptr), DT(nullptr), TTI(nullptr) {
200 DominatorTree *DT;
231 DT->dominates(Basis.Ins->getParent(), C.Ins->getParent()) &&
692 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
696 for (auto node = GraphTraits<DominatorTree *>::nodes_begin(DT);
697 node != GraphTraits<DominatorTree *>::nodes_end(DT); ++node) {
|
| /external/opencv3/modules/imgproc/src/ |
| filter.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 553 void llvm::MergeBasicBlockIntoOnlyPred(BasicBlock *DestBB, DominatorTree *DT) {
589 if (DT) {
590 BasicBlock *PredBBIDom = DT->getNode(PredBB)->getIDom()->getBlock();
591 DT->changeImmediateDominator(DestBB, PredBBIDom);
592 DT->eraseNode(PredBB);
[all...] |
| /external/clang/lib/AST/ |
| Mangle.cpp | 213 CXXDtorType DT, const BlockDecl *BD,
217 mangleCXXDtor(DD, DT, Out);
240 mangleDtorBlock(DD, /*DT*/ Dtor_Complete, BD, Out);
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 95 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
141 CodeExtractor Extractor(DT, *L);
|
| SampleProfile.cpp | 109 : ModulePass(ID), DT(nullptr), PDT(nullptr), LI(nullptr), Reader(),
180 std::unique_ptr<DominatorTree> DT;
385 DT = nullptr;
794 DT->getDescendants(BB1, DominatedBBs);
[all...] |
| /external/mksh/src/ |
| tree.c | 912 #define DT(x) case x: shf_puts(#x, shf); break;
917 DT(IOREAD)
918 DT(IOWRITE)
919 DT(IORDWR)
920 DT(IOHERE)
921 DT(IOCAT)
922 DT(IODUP)
954 #undef DT
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 179 bool Loop::isLCSSAForm(DominatorTree &DT) const {
201 DT.isReachableFromEntry(UserBB))
210 bool Loop::isRecursivelyLCSSAForm(DominatorTree &DT) const {
211 if (!isLCSSAForm(DT))
215 return L->isRecursivelyLCSSAForm(DT);
|
| MemoryDependenceAnalysis.cpp | 106 DT = DTWP ? &DTWP->getDomTree() : nullptr;
427 if (!U || U == LI || !DT->dominates(U, LI))
705 MR = AA->callCapturesBefore(Inst, MemLoc, DT, &OBB);
[all...] |
| AliasAnalysis.cpp | 312 DominatorTree *DT,
314 if (!DT)
328 /* StoreCaptures */ true, I, DT,
|
| /toolchain/binutils/binutils-2.25/gold/ |
| output.h | [all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCLoopPreIncPrep.cpp | 87 DominatorTree *DT;
150 DT = DTWP ? &DTWP->getDomTree() : nullptr;
248 LoopPredecessor = InsertPreheaderForLoop(L, DT, LI, PreserveLCSSA);
|
| PPCCTRLoops.cpp | 113 DominatorTree *DT;
174 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
503 if (!DT->dominates(*I, *PI)) {
542 Preheader = InsertPreheaderForLoop(L, DT, LI, PreserveLCSSA);
|
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | 314 LoopInfo *LI, DominatorTree *DT,
318 : OrigLoop(OrigLoop), PSE(PSE), LI(LI), DT(DT), TLI(TLI), TTI(TTI),
497 DominatorTree *DT;
562 LoopInfo *LI, DominatorTree *DT,
565 : InnerLoopVectorizer(OrigLoop, PSE, LI, DT, TLI, TTI, 1, UnrollFactor) {}
788 DominatorTree *DT)
789 : PSE(PSE), TheLoop(L), DT(DT) {}
825 DominatorTree *DT;
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| Cloning.h | 257 DominatorTree *DT,
|
| /external/llvm/unittests/Analysis/ |
| ScalarEvolutionTest.cpp | 37 std::unique_ptr<DominatorTree> DT;
44 DT.reset(new DominatorTree(F));
45 LI.reset(new LoopInfo(*DT));
46 return ScalarEvolution(F, TLI, *AC, *DT, *LI);
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfUnit.h | 332 DIE *getOrCreateStaticMemberDIE(const DIDerivedType *DT);
351 void constructMemberDIE(DIE &Buffer, const DIDerivedType *DT);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCalls.cpp | 64 unsigned DstAlign = getKnownAlignment(MI->getArgOperand(0), DL, MI, AC, DT);
65 unsigned SrcAlign = getKnownAlignment(MI->getArgOperand(1), DL, MI, AC, DT);
158 unsigned Alignment = getKnownAlignment(MI->getDest(), DL, MI, AC, DT);
683 TLI, DT, AC))
[all...] |
| InstCombineMulDivRem.cpp | 182 if (Value *V = SimplifyMulInst(Op0, Op1, DL, TLI, DT, AC))
545 SimplifyFMulInst(Op0, Op1, I.getFastMathFlags(), DL, TLI, DT, AC))
[all...] |
