| /external/llvm-project/clang/test/CodeGen/ |
| D | aarch64-sve-inline-asm-datatypes.c | 7 #define SVINT_TEST(DT, KIND)\ argument
148 #define SVBOOL_TEST_UPL(DT, KIND)\ argument
171 #define SVFLOAT_TEST(DT,KIND)\ argument
199 #define SVFLOAT_TEST_Y(DT, KIND)\ argument
|
| /external/llvm-project/llvm/examples/IRTransforms/ |
| D | SimplifyCFG.cpp | 102 static bool removeDeadBlocks_v2(Function &F, DominatorTree &DT) { in removeDeadBlocks_v2()
173 static bool eliminateCondBranches_v2(Function &F, DominatorTree &DT) { in eliminateCondBranches_v2()
219 static bool eliminateCondBranches_v3(Function &F, DominatorTree &DT) { in eliminateCondBranches_v3()
306 static bool mergeIntoSinglePredecessor_v2(Function &F, DominatorTree &DT) { in mergeIntoSinglePredecessor_v2()
361 static bool doSimplify_v2(Function &F, DominatorTree &DT) { in doSimplify_v2()
366 static bool doSimplify_v3(Function &F, DominatorTree &DT) { in doSimplify_v3()
395 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
399 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| /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-10.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
|
| /external/llvm-project/llvm/unittests/Transforms/Utils/ |
| D | LocalTest.cpp | 174 DominatorTree DT(*F); in runWithDomTree() local
235 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
244 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
252 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
261 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
270 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
278 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
286 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
295 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
303 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
[all …]
|
| D | BasicBlockUtilsTest.cpp | 51 DominatorTree DT(*F); in TEST() local
79 DominatorTree DT(*F); in TEST() local
107 DominatorTree DT(*F); in TEST() local
134 DominatorTree DT(*F); in TEST() local
162 DominatorTree DT(*F); in TEST() local
260 DominatorTree DT(*F); in TEST() local
|
| D | CodeMoverUtilsTest.cpp | 34 function_ref<void(Function &F, DominatorTree &DT, in run()
38 DominatorTree DT(*F); in run() local
98 DependenceInfo &DI) { in TEST()
189 DependenceInfo &DI) { in TEST()
249 DependenceInfo &DI) { in TEST()
319 DependenceInfo &DI) { in TEST()
373 DependenceInfo &DI) { in TEST()
423 DependenceInfo &DI) { in TEST()
487 DependenceInfo &DI) { in TEST()
579 DependenceInfo &DI) { in TEST()
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 71 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
109 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
179 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
219 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions()
237 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
258 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| /external/llvm-project/llvm/unittests/IR/ |
| D | DominatorTreeTest.cpp | 28 function_ref<void(Function &F, DominatorTree *DT, PostDominatorTree *PDT)> in runWithDomTree()
33 DominatorTree DT(*F); in runWithDomTree() local
63 [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
107 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
327 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
411 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
505 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
594 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
668 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
720 DominatorTree DT(*Holder.F); in TEST() local
[all …]
|
| D | DominatorTreeBatchUpdatesTest.cpp | 97 DominatorTree DT(*Holder.F); in TEST() local
119 DominatorTree DT(*Holder.F); in TEST() local
145 DominatorTree DT(*Holder.F); in TEST() local
178 DominatorTree DT(*Holder.F); in TEST() local
209 DominatorTree DT(*Holder.F); in TEST() local
242 DominatorTree DT(*Holder.F); in TEST() local
275 DominatorTree DT(*Holder.F); in TEST() local
308 DominatorTree DT(*Holder.F); in TEST() local
338 DominatorTree DT(*Holder.F); in TEST() 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/llvm-project/llvm/lib/Transforms/Utils/ |
| D | FixIrreducible.cpp | 159 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, in createNaturalLoopInternal()
248 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, in createNaturalLoop()
254 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, in createNaturalLoop()
262 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G) { in makeReducible()
308 static bool FixIrreducibleImpl(Function &F, LoopInfo &LI, DominatorTree &DT) { in FixIrreducibleImpl()
340 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
347 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| D | CodeMoverUtils.cpp | 96 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA, in domTreeLevelBefore()
109 const BasicBlock &BB, const BasicBlock &Dominator, const DominatorTree &DT, in collectControlConditions()
230 const DominatorTree &DT, in isControlFlowEquivalent()
236 const DominatorTree &DT, in isControlFlowEquivalent()
311 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
393 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
404 DominatorTree &DT, in moveInstructionsToTheBeginning()
419 DominatorTree &DT, in moveInstructionsToTheEnd()
|
| D | LCSSA.cpp | 80 const DominatorTree &DT, const LoopInfo &LI, in formLCSSAForInstructions()
300 Loop &L, const DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits()
344 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, in formLCSSA()
411 bool llvm::formLCSSARecursively(Loop &L, const DominatorTree &DT, in formLCSSARecursively()
424 static bool formLCSSAOnAllLoops(const LoopInfo *LI, const DominatorTree &DT, in formLCSSAOnAllLoops()
440 DominatorTree *DT; member
507 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/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
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | InstructionPrecedenceTracking.h | 52 InstructionPrecedenceTracking(DominatorTree *DT) in InstructionPrecedenceTracking()
99 ImplicitControlFlowTracking(DominatorTree *DT) in ImplicitControlFlowTracking()
124 MemoryWriteTracking(DominatorTree *DT) : InstructionPrecedenceTracking(DT) {} in MemoryWriteTracking()
|
| D | OrderedInstructions.h | 35 DominatorTree *DT; variable
44 OrderedInstructions(DominatorTree *DT) : DT(DT) {} in OrderedInstructions()
|
| /external/llvm-project/libcxx/test/std/utilities/meta/meta.rel/ |
| D | is_invocable.pass.cpp | 139 using DT = std::reference_wrapper<DerFromTag>; in main() typedef
151 using DT = DerFromTag*; in main() typedef
177 using DT = std::reference_wrapper<DerFromTag>; in main() typedef
188 using DT = DerFromTag*; in main() typedef
|
| /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/llvm-project/libcxx/test/std/iterators/iterator.primitives/iterator.traits/ |
| D | empty.fail.cpp | 70 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std:{{… in main() typedef
79 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std:{{… in main() typedef
88 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std:{{… in main() typedef
97 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std:{{… in main() typedef
106 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std:{{… in main() typedef
115 …typedef T::difference_type DT; // expected-error-re {{no type named 'difference_type' in 'std:{{… in main() typedef
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 79 DominatorTree &DT, LoopInfo &LI, in formLCSSAForInstructions()
277 Loop &L, DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits()
321 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
386 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
399 static bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT, in formLCSSAOnAllLoops()
415 DominatorTree *DT; member
482 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
|