Home
last modified time | relevance | path

Searched defs:DT (Results 1 – 25 of 351) sorted by relevance

12345678910>>...15

/llvm-project/clang/test/CodeGen/
H A Daarch64-sve-inline-asm-datatypes.c
/llvm-project/llvm/examples/IRTransforms/
H A DSimplifyCFG.cpp100 static bool removeDeadBlocks_v2(Function &F, DominatorTree &DT) { in removeDeadBlocks_v2() argument
171 static bool eliminateCondBranches_v2(Function &F, DominatorTree &DT) { in eliminateCondBranches_v2() argument
217 static bool eliminateCondBranches_v3(Function &F, DominatorTree &DT) { in eliminateCondBranches_v3() argument
304 mergeIntoSinglePredecessor_v2(Function & F,DominatorTree & DT) mergeIntoSinglePredecessor_v2() argument
359 doSimplify_v2(Function & F,DominatorTree & DT) doSimplify_v2() argument
364 doSimplify_v3(Function & F,DominatorTree & DT) doSimplify_v3() argument
377 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); run() local
382 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
/llvm-project/llvm/lib/CodeGen/
H A DCallBrPrepare.cpp84 auto &DT = FAM.getResult<DominatorTreeAnalysis>(Fn); in run() local
118 bool SplitCriticalEdges(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT) { in SplitCriticalEdges()
140 bool InsertIntrinsicCalls(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT) { in InsertIntrinsicCalls()
173 static void PrintDebugDomInfo(const DominatorTree &DT, const Use &U, in PrintDebugDomInfo()
185 void UpdateSSA(DominatorTree &DT, CallBrInst *CBR, CallInst *Intrinsic, in UpdateSSA()
236 DominatorTree *DT; in runOnFunction() local
/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() argument
104 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction() argument
175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock() argument
212 iterativelySinkInstructions(Function & F,DominatorTree & DT,LoopInfo & LI,AAResults & AA) iterativelySinkInstructions() argument
230 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
251 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
[all...]
H A DLoopSink.cpp118 DominatorTree &DT, BlockFrequencyInfo &BFI) { in findBBsToSinkInto() argument
173 sinkInstruction(Loop & L,Instruction & I,const SmallVectorImpl<BasicBlock * > & ColdLoopBBs,const SmallDenseMap<BasicBlock *,int,16> & LoopBlockNumber,LoopInfo & LI,DominatorTree & DT,BlockFrequencyInfo & BFI,MemorySSAUpdater * MSSAU) sinkInstruction() argument
282 sinkLoopInvariantInstructions(Loop & L,AAResults & AA,LoopInfo & LI,DominatorTree & DT,BlockFrequencyInfo & BFI,MemorySSA & MSSA,ScalarEvolution * SE) sinkLoopInvariantInstructions() argument
353 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp344 LI->verify(DT); in runOnFunction() local
164 createNaturalLoopInternal(LoopInfo & LI,DominatorTree & DT,Loop * ParentLoop,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoopInternal() argument
253 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Function * F,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
259 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Loop & L,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
267 makeReducible(LoopInfo & LI,DominatorTree & DT,Graph && G) makeReducible() argument
313 FixIrreducibleImpl(Function & F,LoopInfo & LI,DominatorTree & DT) FixIrreducibleImpl() argument
351 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DCodeMoverUtils.cpp95 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA, in domTreeLevelBefore() argument
110 const DominatorTree &DT, in collectControlConditions() argument
232 isControlFlowEquivalent(const Instruction & I0,const Instruction & I1,const DominatorTree & DT,const PostDominatorTree & PDT) isControlFlowEquivalent() argument
238 isControlFlowEquivalent(const BasicBlock & BB0,const BasicBlock & BB1,const DominatorTree & DT,const PostDominatorTree & PDT) isControlFlowEquivalent() argument
313 isSafeToMoveBefore(Instruction & I,Instruction & InsertPoint,DominatorTree & DT,const PostDominatorTree * PDT,DependenceInfo * DI,bool CheckForEntireBlock) isSafeToMoveBefore() argument
413 isSafeToMoveBefore(BasicBlock & BB,Instruction & InsertPoint,DominatorTree & DT,const PostDominatorTree * PDT,DependenceInfo * DI) isSafeToMoveBefore() argument
425 moveInstructionsToTheBeginning(BasicBlock & FromBB,BasicBlock & ToBB,DominatorTree & DT,const PostDominatorTree & PDT,DependenceInfo & DI) moveInstructionsToTheBeginning() argument
438 moveInstructionsToTheEnd(BasicBlock & FromBB,BasicBlock & ToBB,DominatorTree & DT,const PostDominatorTree & PDT,DependenceInfo & DI) moveInstructionsToTheEnd() argument
451 nonStrictlyPostDominate(const BasicBlock * ThisBlock,const BasicBlock * OtherBlock,const DominatorTree * DT,const PostDominatorTree * PDT) nonStrictlyPostDominate() argument
483 isReachedBefore(const Instruction * I0,const Instruction * I1,const DominatorTree * DT,const PostDominatorTree * PDT) isReachedBefore() argument
[all...]
H A DMem2Reg.cpp35 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
H A DLCSSA.cpp78 formLCSSAForInstructions(SmallVectorImpl<Instruction * > & Worklist,const DominatorTree & DT,const LoopInfo & LI,ScalarEvolution * SE,SmallVectorImpl<PHINode * > * PHIsToRemove,SmallVectorImpl<PHINode * > * InsertedPHIs) formLCSSAForInstructions() argument
322 computeBlocksDominatingExits(Loop & L,const DominatorTree & DT,SmallVector<BasicBlock *,8> & ExitBlocks,SmallSetVector<BasicBlock *,8> & BlocksDominatingExits) computeBlocksDominatingExits() argument
363 formLCSSA(Loop & L,const DominatorTree & DT,const LoopInfo * LI,ScalarEvolution * SE) formLCSSA() argument
425 formLCSSARecursively(Loop & L,const DominatorTree & DT,const LoopInfo * LI,ScalarEvolution * SE) formLCSSARecursively() argument
438 formLCSSAOnAllLoops(const LoopInfo * LI,const DominatorTree & DT,ScalarEvolution * SE) formLCSSAOnAllLoops() argument
454 DominatorTree *DT; global() member
521 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DUnifyLoopExits.cpp143 unifyLoopExits(DominatorTree & DT,LoopInfo & LI,Loop * L) unifyLoopExits() argument
216 runImpl(LoopInfo & LI,DominatorTree & DT) runImpl() argument
232 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
244 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DLoopSimplify.cpp118 InsertPreheaderForLoop(Loop * L,DominatorTree * DT,LoopInfo * LI,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) InsertPreheaderForLoop() argument
173 findPHIToPartitionLoops(Loop * L,DominatorTree * DT,AssumptionCache * AC) findPHIToPartitionLoops() argument
216 separateNestedLoop(Loop * L,BasicBlock * Preheader,DominatorTree * DT,LoopInfo * LI,ScalarEvolution * SE,bool PreserveLCSSA,AssumptionCache * AC,MemorySSAUpdater * MSSAU) separateNestedLoop() argument
359 insertUniqueBackedgeBlock(Loop * L,BasicBlock * Preheader,DominatorTree * DT,LoopInfo * LI,MemorySSAUpdater * MSSAU) insertUniqueBackedgeBlock() argument
479 simplifyOneLoop(Loop * L,SmallVectorImpl<Loop * > & Worklist,DominatorTree * DT,LoopInfo * LI,ScalarEvolution * SE,AssumptionCache * AC,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) simplifyOneLoop() argument
700 simplifyLoop(Loop * L,DominatorTree * DT,LoopInfo * LI,ScalarEvolution * SE,AssumptionCache * AC,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) simplifyLoop() argument
797 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
830 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
/llvm-project/llvm/unittests/Transforms/Utils/
H A DBasicBlockUtilsTest.cpp62 DominatorTree DT(*F); in TEST() local
88 DominatorTree DT(*F); in TEST() local
124 DominatorTree DT(*F); in TEST() local
178 DominatorTree DT(*F); in TEST() local
254 DominatorTree DT(*F); in TEST() local
323 DominatorTree DT(*F); in TEST() local
358 DominatorTree DT(*F); in TEST() local
385 DominatorTree DT(*F); in TEST() local
409 DominatorTree DT(*F); in TEST() local
432 DominatorTree DT(*F); in TEST() local
[all …]
H A DLoopUtilsTest.cpp31 function_ref<void(Function &F, DominatorTree &DT, in run() argument
35 DominatorTree DT(*F); in run() local
74 [&](Function &F, DominatorTree &DT, ScalarEvolution &SE, LoopInfo &LI) { in TEST() argument
112 [&](Function &F, DominatorTree &DT, ScalarEvolutio in TEST() argument
136 __anonf89b06080302(Function &F, DominatorTree &DT, ScalarEvolution &SE, LoopInfo &LI) TEST() argument
[all...]
H A DCodeMoverUtilsTest.cpp35 function_ref<void(Function &F, DominatorTree &DT, in run()
39 DominatorTree DT(*F); in run() local
99 DependenceInfo &DI) { in TEST()
190 DependenceInfo &DI) { in TEST()
250 DependenceInfo &DI) { in TEST()
320 DependenceInfo &DI) { in TEST()
374 DependenceInfo &DI) { in TEST()
424 DependenceInfo &DI) { in TEST()
488 DependenceInfo &DI) { in TEST()
580 DependenceInfo &DI) { in TEST()
[all …]
H A DLocalTest.cpp197 DominatorTree DT(*F); in runWithDomTree() local
258 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
267 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
275 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
284 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
293 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
301 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
309 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
318 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
326 runWithDomTree(*M, "f", [&](Function &F, DominatorTree *DT) { in TEST()
[all …]
/llvm-project/libcxx/test/std/utilities/meta/meta.rel/
H A Dis_invocable.pass.cpp139 using DT = std::reference_wrapper<DerFromTag>; main() typedef
151 using DT = DerFromTag*; main() typedef
177 using DT = std::reference_wrapper<DerFromTag>; main() typedef
188 using DT = DerFromTag*; main() typedef
/llvm-project/llvm/unittests/IR/
H A DDominatorTreeTest.cpp28 function_ref<void(Function &F, DominatorTree *DT, PostDominatorTree *PDT)> in runWithDomTree() argument
33 DominatorTree DT(*F); in runWithDomTree() local
63 [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST() argument
107 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST() argument
327 __anond216a0460302(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
411 __anond216a0460402(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
505 __anond216a0460502(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
594 __anond216a0460602(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
668 __anond216a0460702(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
720 DominatorTree DT(*Holder.F); TEST() local
746 DominatorTree DT(*Holder.F); TEST() local
774 DominatorTree DT(*Holder.F); TEST() local
825 DominatorTree DT(*Holder.F); TEST() local
855 DominatorTree DT(*Holder.F); TEST() local
882 DominatorTree DT(*Holder.F); TEST() local
908 DominatorTree DT(*Holder.F); TEST() local
938 DominatorTree DT(*Holder.F); TEST() local
976 DominatorTree DT(*Holder.F); TEST() local
1012 DominatorTree DT(*Holder.F); TEST() local
1040 __anond216a0460902(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
1087 __anond216a0460a02(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
1125 __anond216a0460b02(Function &F, DominatorTree *DT, PostDominatorTree *PDT) TEST() argument
[all...]
H A DDominatorTreeBatchUpdatesTest.cpp96 DominatorTree DT(*Holder.F); in TEST() local
118 DominatorTree DT(*Holder.F); in TEST() local
144 DominatorTree DT(*Holder.F); in TEST() local
177 DominatorTree DT(*Holder.F); in TEST() local
208 DominatorTree DT(*Holder.F); in TEST() local
241 DominatorTree DT(*Holder.F); in TEST() local
274 DominatorTree DT(*Holder.F); in TEST() local
307 DominatorTree DT(*Holder.F); in TEST() local
337 DominatorTree DT(*Holder.F); in TEST() local
/llvm-project/libcxx/test/std/iterators/iterator.primitives/iterator.traits/
H A Dempty.verify.cpp
/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp123 ConvergenceRegion(DominatorTree & DT,LoopInfo & LI,Function & F) ConvergenceRegion() argument
136 ConvergenceRegion(DominatorTree & DT,LoopInfo & LI,std::optional<IntrinsicInst * > ConvergenceToken,BasicBlock * Entry,SmallPtrSet<BasicBlock *,8> && Blocks,SmallPtrSet<BasicBlock *,2> && Exits) ConvergenceRegion() argument
201 ConvergenceRegionAnalyzer(Function & F,DominatorTree & DT,LoopInfo & LI) ConvergenceRegionAnalyzer() argument
311 DominatorTree &DT; global() member in llvm::SPIRV::ConvergenceRegionAnalyzer
316 getConvergenceRegions(Function & F,DominatorTree & DT,LoopInfo & LI) getConvergenceRegions() argument
331 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
342 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
/llvm-project/polly/include/polly/CodeGen/
H A DLoopGenerators.h132 ParallelLoopGenerator(PollyIRBuilder & Builder,LoopInfo & LI,DominatorTree & DT,const DataLayout & DL) ParallelLoopGenerator() argument
171 DominatorTree &DT; global() variable
/llvm-project/llvm/unittests/Analysis/
H A DDomTreeUpdaterTest.cpp54 DominatorTree DT(*F); TEST() local
165 DominatorTree DT(*F); TEST() local
239 DominatorTree DT(*F); TEST() local
328 DominatorTree DT(*F); TEST() local
452 DominatorTree DT(*F); TEST() local
535 DominatorTree DT(*F); TEST() local
624 DominatorTree DT(*F); TEST() local
743 DominatorTree DT(*F); TEST() local
[all...]
/llvm-project/llvm/lib/Analysis/
H A DCFG.cpp137 const DominatorTree *DT, const LoopInfo *LI) { in isReachableImpl()
241 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachableFromMany()
251 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isManyPotentiallyReachableFromMany()
259 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
283 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
/llvm-project/llvm/include/llvm/Analysis/
H A DDemandedBits.h42 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits()
90 DominatorTree &DT; variable
H A DAliasAnalysis.h179 DominatorTree &DT; global() variable
194 DT(DT) DT() argument
[all...]

12345678910>>...15