| /llvm-project/llvm/unittests/Analysis/ |
| H A D | DomTreeUpdaterTest.cpp | 56 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); TEST() local
167 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); TEST() local
241 DomTreeUpdater DTU(&DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
330 DomTreeUpdater DTU(&DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
454 DomTreeUpdater DTU(&DT, &PDT, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
537 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
626 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
713 DomTreeUpdater DTU(nullptr, nullptr, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
744 DomTreeUpdater DTU(&DT, nullptr, DomTreeUpdater::UpdateStrategy::Lazy); TEST() local
[all...] |
| /llvm-project/llvm/unittests/Transforms/Utils/ |
| H A D | LocalTest.cpp | 237 auto Test = [&](Function &F, DomTreeUpdater &DTU) { in TEST()
260 DomTreeUpdater DTU(*DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); in TEST() local
268 DomTreeUpdater DTU(*DT, DomTreeUpdater::UpdateStrategy::Eager); in TEST() local
277 DomTreeUpdater DTU(PDT, DomTreeUpdater::UpdateStrategy::Eager); in TEST() local
286 DomTreeUpdater DTU(*DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); in TEST() local
295 DomTreeUpdater DTU(PDT, DomTreeUpdater::UpdateStrategy::Lazy); in TEST() local
302 DomTreeUpdater DTU(*DT, DomTreeUpdater::UpdateStrategy::Lazy); in TEST() local
311 DomTreeUpdater DTU(*DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); in TEST() local
319 DomTreeUpdater DTU(*DT, DomTreeUpdater::UpdateStrategy::Eager); in TEST() local
328 DomTreeUpdater DTU(PDT, DomTreeUpdater::UpdateStrategy::Eager); in TEST() local
[all …]
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SCCP.cpp | 125 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in run() local
63 runSCCP(Function & F,const DataLayout & DL,const TargetLibraryInfo * TLI,DomTreeUpdater & DTU) runSCCP() argument
|
| H A D | ScalarizeMaskedMemIntrin.cpp | 144 scalarizeMaskedLoad(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedLoad() argument
282 scalarizeMaskedStore(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedStore() argument
406 scalarizeMaskedGather(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedGather() argument
536 scalarizeMaskedScatter(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedScatter() argument
626 scalarizeMaskedExpandLoad(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedExpandLoad() argument
758 scalarizeMaskedCompressStore(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedCompressStore() argument
866 scalarizeMaskedVectorHistogram(const DataLayout & DL,CallInst * CI,DomTreeUpdater * DTU,bool & ModifiedDT) scalarizeMaskedVectorHistogram() argument
930 std::optional<DomTreeUpdater> DTU; runImpl() local
976 optimizeBlock(BasicBlock & BB,bool & ModifiedDT,const TargetTransformInfo & TTI,const DataLayout & DL,DomTreeUpdater * DTU) optimizeBlock() argument
992 optimizeCallInst(CallInst * CI,bool & ModifiedDT,const TargetTransformInfo & TTI,const DataLayout & DL,DomTreeUpdater * DTU) optimizeCallInst() argument
[all...] |
| H A D | LowerConstantIntrinsics.cpp | 56 replaceConditionalBranchesOnConstant(Instruction * II,Value * NewValue,DomTreeUpdater * DTU) replaceConditionalBranchesOnConstant() argument
104 std::optional<DomTreeUpdater> DTU; lowerConstantIntrinsics() local
|
| H A D | SimplifyCFGPass.cpp | 159 tailMergeBlocksWithSimilarFunctionTerminators(Function & F,DomTreeUpdater * DTU) tailMergeBlocksWithSimilarFunctionTerminators() argument
225 iterativelySimplifyCFG(Function & F,const TargetTransformInfo & TTI,DomTreeUpdater * DTU,const SimplifyCFGOptions & Options) iterativelySimplifyCFG() argument
270 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); simplifyFunctionCFGImpl() local
[all...] |
| H A D | PartiallyInlineLibCalls.cpp | 36 optimizeSQRT(CallInst * Call,Function * CalledFunc,BasicBlock & CurrBB,Function::iterator & BB,const TargetTransformInfo * TTI,DomTreeUpdater * DTU) optimizeSQRT() argument
107 std::optional<DomTreeUpdater> DTU; runPartiallyInlineLibCalls() local
|
| H A D | CallSiteSplitting.cpp | 304 DomTreeUpdater &DTU) { in splitCallSite() argument
455 DomTreeUpdater &DTU) { in shouldSplitOnPredicatedArgument() argument
487 DomTreeUpdater &DTU) { in tryToSplitCallSite() argument
505 DomTreeUpdater DTU(&DT, DomTreeUpdater::UpdateStrategy::Lazy); doCallSiteSplitting() local
[all...] |
| H A D | JumpTableToSwitch.cpp | 94 DomTreeUpdater &DTU, in expandToSwitch() argument
151 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy); in run() local
|
| H A D | TailRecursionElimination.cpp | 405 DomTreeUpdater &DTU; global() member in __anon9cad05e30511::TailRecursionEliminator
435 TailRecursionEliminator(Function & F,const TargetTransformInfo * TTI,AliasAnalysis * AA,OptimizationRemarkEmitter * ORE,DomTreeUpdater & DTU) TailRecursionEliminator() argument
866 eliminate(Function & F,const TargetTransformInfo * TTI,AliasAnalysis * AA,OptimizationRemarkEmitter * ORE,DomTreeUpdater & DTU) eliminate() argument
919 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); runOnFunction() local
953 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); run() local
[all...] |
| /llvm-project/llvm/examples/IRTransforms/ |
| H A D | SimplifyCFG.cpp | 102 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in removeDeadBlocks_v2() local
174 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in eliminateCondBranches_v2() local
219 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in eliminateCondBranches_v3() local
306 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); mergeIntoSinglePredecessor_v2() local
[all...] |
| /llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | MatrixUtils.cpp | 25 IRBuilderBase &B, DomTreeUpdater &DTU, Loop *L, in CreateLoop()
71 IRBuilderBase &B, DomTreeUpdater &DTU, in CreateTiledLoops()
|
| H A D | BasicBlockUtils.cpp | 96 void llvm::DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU, in DeleteDeadBlock() argument
101 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU, in DeleteDeadBlocks() argument
125 bool llvm::EliminateUnreachableBlocks(Function &F, DomTreeUpdater *DTU, in EliminateUnreachableBlocks() argument
180 MergeBlockIntoPredecessor(BasicBlock * BB,DomTreeUpdater * DTU,LoopInfo * LI,MemorySSAUpdater * MSSAU,MemoryDependenceResults * MemDep,bool PredecessorWithTwoSuccessors,DominatorTree * DT) MergeBlockIntoPredecessor() argument
340 MergeBlockSuccessorsIntoGivenBlocks(SmallPtrSetImpl<BasicBlock * > & MergeBlocks,Loop * L,DomTreeUpdater * DTU,LoopInfo * LI) MergeBlockSuccessorsIntoGivenBlocks() argument
913 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); ehAwareSplitEdge() local
1028 SplitBlockImpl(BasicBlock * Old,BasicBlock::iterator SplitPt,DomTreeUpdater * DTU,DominatorTree * DT,LoopInfo * LI,MemorySSAUpdater * MSSAU,const Twine & BBName,bool Before) SplitBlockImpl() argument
1091 SplitBlock(BasicBlock * Old,BasicBlock::iterator SplitPt,DomTreeUpdater * DTU,LoopInfo * LI,MemorySSAUpdater * MSSAU,const Twine & BBName,bool Before) SplitBlock() argument
1099 splitBlockBefore(BasicBlock * Old,BasicBlock::iterator SplitPt,DomTreeUpdater * DTU,LoopInfo * LI,MemorySSAUpdater * MSSAU,const Twine & BBName) splitBlockBefore() argument
1147 UpdateAnalysisInformation(BasicBlock * OldBB,BasicBlock * NewBB,ArrayRef<BasicBlock * > Preds,DomTreeUpdater * DTU,DominatorTree * DT,LoopInfo * LI,MemorySSAUpdater * MSSAU,bool PreserveLCSSA,bool & HasLoopExit) UpdateAnalysisInformation() argument
1330 SplitBlockPredecessorsImpl(BasicBlock * BB,ArrayRef<BasicBlock * > Preds,const char * Suffix,DomTreeUpdater * DTU,DominatorTree * DT,LoopInfo * LI,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) SplitBlockPredecessorsImpl() argument
1429 SplitBlockPredecessors(BasicBlock * BB,ArrayRef<BasicBlock * > Preds,const char * Suffix,DomTreeUpdater * DTU,LoopInfo * LI,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) SplitBlockPredecessors() argument
1439 SplitLandingPadPredecessorsImpl(BasicBlock * OrigBB,ArrayRef<BasicBlock * > Preds,const char * Suffix1,const char * Suffix2,SmallVectorImpl<BasicBlock * > & NewBBs,DomTreeUpdater * DTU,DominatorTree * DT,LoopInfo * LI,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) SplitLandingPadPredecessorsImpl() argument
1542 SplitLandingPadPredecessors(BasicBlock * OrigBB,ArrayRef<BasicBlock * > Preds,const char * Suffix1,const char * Suffix2,SmallVectorImpl<BasicBlock * > & NewBBs,DomTreeUpdater * DTU,LoopInfo * LI,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) SplitLandingPadPredecessors() argument
1552 FoldReturnIntoUncondBranch(ReturnInst * RI,BasicBlock * BB,BasicBlock * Pred,DomTreeUpdater * DTU) FoldReturnIntoUncondBranch() argument
1612 SplitBlockAndInsertIfThen(Value * Cond,BasicBlock::iterator SplitBefore,bool Unreachable,MDNode * BranchWeights,DomTreeUpdater * DTU,LoopInfo * LI,BasicBlock * ThenBlock) SplitBlockAndInsertIfThen() argument
1625 SplitBlockAndInsertIfElse(Value * Cond,BasicBlock::iterator SplitBefore,bool Unreachable,MDNode * BranchWeights,DomTreeUpdater * DTU,LoopInfo * LI,BasicBlock * ElseBlock) SplitBlockAndInsertIfElse() argument
1638 SplitBlockAndInsertIfThenElse(Value * Cond,BasicBlock::iterator SplitBefore,Instruction ** ThenTerm,Instruction ** ElseTerm,MDNode * BranchWeights,DomTreeUpdater * DTU,LoopInfo * LI) SplitBlockAndInsertIfThenElse() argument
1652 SplitBlockAndInsertIfThenElse(Value * Cond,BasicBlock::iterator SplitBefore,BasicBlock ** ThenBlock,BasicBlock ** ElseBlock,bool UnreachableThen,bool UnreachableElse,MDNode * BranchWeights,DomTreeUpdater * DTU,LoopInfo * LI) SplitBlockAndInsertIfThenElse() argument
2147 CreateControlFlowHub(DomTreeUpdater * DTU,SmallVectorImpl<BasicBlock * > & GuardBlocks,const BBSetVector & Incoming,const BBSetVector & Outgoing,const StringRef Prefix,std::optional<unsigned> MaxControlFlowBooleans) CreateControlFlowHub() argument
[all...] |
| H A D | LibCallsShrinkWrap.cpp | 55 LibCallsShrinkWrap(const TargetLibraryInfo &TLI, DomTreeUpdater &DTU) in LibCallsShrinkWrap()
124 DomTreeUpdater &DTU; member in __anon0f1f2d100111::LibCallsShrinkWrap
503 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in runImpl() local
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | IndirectBrExpandPass.cpp | 80 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in run() local
102 bool runImpl(Function &F, const TargetLowering *TLI, DomTreeUpdater *DTU) { in runImpl()
291 std::optional<DomTreeUpdater> DTU; in runOnFunction() local
|
| H A D | ShadowStackGCLowering.cpp | 122 Changed |= Impl.runOnFunction(F, DT ? &DTU : nullptr); in run() local
101 std::optional<DomTreeUpdater> DTU; runOnFunction() local
333 runOnFunction(Function & F,DomTreeUpdater * DTU) runOnFunction() argument
|
| H A D | ExpandMemCmp.cpp | 88 DomTreeUpdater *DTU = nullptr; member in __anon79101d860111::MemCmpExpansion
264 DomTreeUpdater *DTU) in MemCmpExpansion() argument
833 expandMemCmp(CallInst * CI,const TargetTransformInfo * TTI,const TargetLowering * TLI,const DataLayout * DL,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,DomTreeUpdater * DTU,const bool IsBCmp) expandMemCmp() argument
949 runOnBlock(BasicBlock & BB,const TargetLibraryInfo * TLI,const TargetTransformInfo * TTI,const TargetLowering * TL,const DataLayout & DL,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,DomTreeUpdater * DTU) runOnBlock() argument
969 std::optional<DomTreeUpdater> DTU; runImpl() local
[all...] |
| H A D | SafeStack.cpp | 193 : F(F), TL(TL), DL(DL), DTU(DTU), SE(SE), in SafeStack() argument
917 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in runOnFunction() local
954 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); in run() local
116 DomTreeUpdater *DTU; global() member in __anon105c633c0111::SafeStack
|
| /llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | EscapeEnumerator.h | 38 DomTreeUpdater *DTU; variable
|
| /llvm-project/llvm/unittests/CodeGen/ |
| H A D | MachineDomTreeUpdaterTest.cpp | 159 MachineDomTreeUpdater DTU(DT, PDT, TEST_F() local
249 MachineDomTreeUpdater DTU(DT, PDT, TEST_F() local
[all...] |
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 141 unifyReturnBlockSet(Function & F,DomTreeUpdater & DTU,ArrayRef<BasicBlock * > ReturningBlocks,StringRef Name) unifyReturnBlockSet() argument
315 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); run() local
|
| H A D | AMDGPUAtomicOptimizer.cpp | 142 bool IsChanged = AMDGPUAtomicOptimizerImpl(F, UA, DTU, ST, ScanImpl).run(); in run() local
72 DomTreeUpdater &DTU; global() member in __anonacdd32840111::AMDGPUAtomicOptimizerImpl
95 AMDGPUAtomicOptimizerImpl(const UniformityInfo * UA,const DataLayout * DL,DomTreeUpdater & DTU,const GCNSubtarget * ST,bool IsPixelShader,ScanOptions ScanImpl) AMDGPUAtomicOptimizerImpl() argument
123 DomTreeUpdater DTU(DTW ? &DTW->getDomTree() : nullptr, runOnFunction() local
[all...] |
| /llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | StackProtector.h | 103 std::optional<DomTreeUpdater> DTU; variable
|
| /llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopIdiomVectorize.cpp | 377 IRBuilder<> &Builder, DomTreeUpdater &DTU, GetElementPtrInst *GEPA, in createMaskedFindMismatch() argument
483 createPredicatedFindMismatch(IRBuilder<> & Builder,DomTreeUpdater & DTU,GetElementPtrInst * GEPA,GetElementPtrInst * GEPB,Value * ExtStart,Value * ExtEnd) createPredicatedFindMismatch() argument
586 expandFindMismatch(IRBuilder<> & Builder,DomTreeUpdater & DTU,GetElementPtrInst * GEPA,GetElementPtrInst * GEPB,Instruction * Index,Value * Start,Value * MaxLen) expandFindMismatch() argument
850 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); transformByteCompare() local
[all...] |
| /llvm-project/llvm/include/llvm/Transforms/Scalar/ |
| H A D | JumpThreading.h | 86 std::unique_ptr<DomTreeUpdater> DTU; variable
|