| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | InstructionSimplify.cpp | 72 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { in ValueDominatesPHI()
98 const DominatorTree *DT, unsigned MaxRecurse) { in ExpandBinOp()
161 const DominatorTree *DT, unsigned MaxRecurse) { in FactorizeBinOp()
231 const DominatorTree *DT, in SimplifyAssociativeBinOp()
332 const DominatorTree *DT, in ThreadBinOpOverSelect()
406 const DominatorTree *DT, in ThreadCmpOverSelect()
461 const TargetData *TD, const DominatorTree *DT, in ThreadBinOpOverPHI()
505 const TargetData *TD, const DominatorTree *DT, in ThreadCmpOverPHI()
543 const TargetData *TD, const DominatorTree *DT, in SimplifyAddInst()
605 const TargetData *TD, const DominatorTree *DT) { in SimplifyAddInst()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 38 DominatorTree &DT) { in AllUsesDominatedByBlock()
96 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
200 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
240 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions()
258 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
280 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| D | LoopSimplifyCFG.cpp | 39 static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI) { in simplifyLoopCFG()
73 auto *DT = FAM.getCachedResult<DominatorTreeAnalysis>(*F); in run() local
93 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnLoop() local
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 38 DominatorTree &DT) { in AllUsesDominatedByBlock()
96 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
199 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
239 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions()
257 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
278 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| D | DivRemPairs.cpp | 48 const DominatorTree &DT) { in optimizeDivRem()
182 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
203 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| /external/libcxx/test/std/utilities/meta/meta.rel/ |
| D | is_invocable.pass.cpp | 59 using DT = std::reference_wrapper<DerFromTag>; in main() typedef
71 using DT = DerFromTag*; in main() typedef
97 using DT = std::reference_wrapper<DerFromTag>; in main() typedef
108 using DT = DerFromTag*; in main() typedef
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Utils/ |
| D | OrderedInstructions.h | 36 DominatorTree *DT; variable
45 OrderedInstructions(DominatorTree *DT) : DT(DT) {} in OrderedInstructions()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 63 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, in processInstruction()
208 DominatorTree &DT, in blockDominatesAnExit()
216 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
262 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
275 static bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT, in formLCSSAOnAllLoops()
291 DominatorTree *DT; member
338 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| D | Mem2Reg.cpp | 30 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT, in promoteMemoryToRegister()
57 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
80 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| D | SimplifyInstructions.cpp | 37 static bool runImpl(Function &F, const DominatorTree *DT, const TargetLibraryInfo *TLI, in runImpl()
104 const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnFunction() local
130 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
|
| D | LoopSimplify.cpp | 118 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, in InsertPreheaderForLoop()
160 DominatorTree *DT, LoopInfo *LI, in rewriteLoopExitBlock()
207 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, in findPHIToPartitionLoops()
250 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop()
353 DominatorTree *DT, LoopInfo *LI) { in insertUniqueBackedgeBlock()
465 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop()
698 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop()
775 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
810 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| D | MustExecute.cpp | 63 const DominatorTree *DT, in CanProveNotTakenFirstIteration()
105 const DominatorTree *DT, const Loop *CurLoop, in isGuaranteedToExecute()
194 static bool isMustExecuteIn(const Instruction &I, Loop *L, DominatorTree *DT) { in isMustExecuteIn()
212 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
224 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
263 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| D | Loads.cpp | 56 const Instruction *CtxI, const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
123 const DominatorTree *DT) { in isDereferenceableAndAlignedPointer()
132 const DominatorTree *DT) { in isDereferenceableAndAlignedPointer()
155 const DominatorTree *DT) { in isDereferenceablePointer()
204 const DominatorTree *DT) { in isSafeToLoadUnconditionally()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/ |
| D | DominatorTreeTest.cpp | 29 function_ref<void(Function &F, DominatorTree *DT, PostDominatorTree *PDT)> in runWithDomTree()
34 DominatorTree DT(*F); in runWithDomTree() local
77 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
297 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
381 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
475 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
564 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
638 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
690 DominatorTree DT(*Holder.F); in TEST() local
716 DominatorTree DT(*Holder.F); in TEST() local
[all …]
|
| D | DominatorTreeBatchUpdatesTest.cpp | 98 DominatorTree DT(*Holder.F); in TEST() local
120 DominatorTree DT(*Holder.F); in TEST() local
146 DominatorTree DT(*Holder.F); in TEST() local
179 DominatorTree DT(*Holder.F); in TEST() local
210 DominatorTree DT(*Holder.F); in TEST() local
243 DominatorTree DT(*Holder.F); in TEST() local
276 DominatorTree DT(*Holder.F); in TEST() local
309 DominatorTree DT(*Holder.F); in TEST() local
339 DominatorTree DT(*Holder.F); in TEST() local
|
| D | DeferredDominanceTest.cpp | 54 DominatorTree DT(*F); in TEST() local
129 DominatorTree DT(*F); in TEST() local
188 DominatorTree DT(*F); in TEST() local
263 DominatorTree DT(*F); in TEST() local
|
| D | DomTreeUpdaterTest.cpp | 55 DominatorTree DT(*F); in TEST() local
165 DominatorTree DT(*F); in TEST() local
239 DominatorTree DT(*F); in TEST() local
328 DominatorTree DT(*F); in TEST() local
455 DominatorTree DT(*F); in TEST() local
538 DominatorTree DT(*F); in TEST() local
627 DominatorTree DT(*F); in TEST() local
|
| /external/libcxx/test/std/iterators/iterator.primitives/iterator.traits/ |
| D | empty.fail.cpp | 71 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std::_… in main() typedef
80 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std::_… in main() typedef
89 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std::_… in main() typedef
98 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std::_… in main() typedef
107 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std::_… in main() typedef
116 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std::_… in main() typedef
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 76 DominatorTree &DT, LoopInfo &LI) { in formLCSSAForInstructions()
261 Loop &L, DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits()
305 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
360 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
373 static bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT, in formLCSSAOnAllLoops()
389 DominatorTree *DT; member
454 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| D | Mem2Reg.cpp | 35 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT, in promoteMemoryToRegister()
62 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
88 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/AggressiveInstCombine/ |
| D | AggressiveInstCombine.cpp | 165 static bool foldUnusualPatterns(Function &F, DominatorTree &DT) { in foldUnusualPatterns()
191 static bool runImpl(Function &F, TargetLibraryInfo &TLI, DominatorTree &DT) { in runImpl()
213 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
220 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| D | AggressiveInstCombineInternal.h | 53 const DominatorTree &DT; variable
78 const DominatorTree &DT) in TruncInstCombine()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| D | DemandedBits.h | 43 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits()
63 DominatorTree &DT; variable
|
| /external/llvm/include/llvm/Analysis/ |
| D | DemandedBits.h | 41 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits()
55 DominatorTree &DT; variable
|
| /external/clang/lib/Lex/ |
| D | PPExpressions.cpp | 88 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateDefined() argument
214 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateValue()
563 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
756 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
819 DefinedTracker DT; in EvaluateDirectiveExpression() local
|