Home
last modified time | relevance | path

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

12345678910>>...12

/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DCallBrPrepare.cpp84 auto &DT = FAM.getResult<DominatorTreeAnalysis>(Fn); in run() local
116 SplitCriticalEdges(ArrayRef<CallBrInst * > CBRs,DominatorTree & DT) SplitCriticalEdges() argument
138 InsertIntrinsicCalls(ArrayRef<CallBrInst * > CBRs,DominatorTree & DT) InsertIntrinsicCalls() argument
171 PrintDebugDomInfo(const DominatorTree & DT,const Use & U,const BasicBlock * BB,bool IsDefaultDest) PrintDebugDomInfo() argument
183 UpdateSSA(DominatorTree & DT,CallBrInst * CBR,CallInst * Intrinsic,SSAUpdater & SSAUpdate) UpdateSSA() argument
234 DominatorTree *DT; runOnFunction() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
104 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
212 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions()
230 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
251 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
H A DLoopSink.cpp118 DominatorTree &DT, BlockFrequencyInfo &BFI) { in findBBsToSinkInto()
173 DominatorTree &DT, BlockFrequencyInfo &BFI, MemorySSAUpdater *MSSAU) { in sinkInstruction()
282 DominatorTree &DT, in sinkLoopInvariantInstructions()
353 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
H A DPartiallyInlineLibCalls.cpp106 DominatorTree *DT) { in runPartiallyInlineLibCalls()
162 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
195 DominatorTree *DT = nullptr; in runOnFunction() local
H A DSimplifyCFGPass.cpp266 simplifyFunctionCFGImpl(Function & F,const TargetTransformInfo & TTI,DominatorTree * DT,const SimplifyCFGOptions & Options) simplifyFunctionCFGImpl() argument
295 simplifyFunctionCFG(Function & F,const TargetTransformInfo & TTI,DominatorTree * DT,const SimplifyCFGOptions & Options) simplifyFunctionCFG() argument
360 DominatorTree *DT = nullptr; run() local
392 DominatorTree *DT = nullptr; runOnFunction() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp164 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, in createNaturalLoopInternal()
253 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, in createNaturalLoop()
259 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, in createNaturalLoop()
267 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G) { in makeReducible()
313 static bool FixIrreducibleImpl(Function &F, LoopInfo &LI, DominatorTree &DT) { in FixIrreducibleImpl()
344 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
351 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
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
400 isSafeToMoveBefore(BasicBlock & BB,Instruction & InsertPoint,DominatorTree & DT,const PostDominatorTree * PDT,DependenceInfo * DI) isSafeToMoveBefore() argument
412 moveInstructionsToTheBeginning(BasicBlock & FromBB,BasicBlock & ToBB,DominatorTree & DT,const PostDominatorTree & PDT,DependenceInfo & DI) moveInstructionsToTheBeginning() argument
425 moveInstructionsToTheEnd(BasicBlock & FromBB,BasicBlock & ToBB,DominatorTree & DT,const PostDominatorTree & PDT,DependenceInfo & DI) moveInstructionsToTheEnd() argument
438 nonStrictlyPostDominate(const BasicBlock * ThisBlock,const BasicBlock * OtherBlock,const DominatorTree * DT,const PostDominatorTree * PDT) nonStrictlyPostDominate() argument
470 isReachedBefore(const Instruction * I0,const Instruction * I1,const DominatorTree * DT,const PostDominatorTree * PDT) isReachedBefore() argument
[all...]
H A DLCSSA.cpp78 const DominatorTree &DT, const LoopInfo &LI, in formLCSSAForInstructions() argument
322 Loop &L, const DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits() argument
363 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, in 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 static bool unifyLoopExits(DominatorTree &DT, LoopInfo &LI, Loop *L) { in unifyLoopExits() argument
216 static bool runImpl(LoopInfo &LI, DominatorTree &DT) { in runImpl() argument
232 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
244 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DMem2Reg.cpp35 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT, in promoteMemoryToRegister() argument
62 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
92 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
H A DLoopSimplify.cpp118 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, in InsertPreheaderForLoop() argument
173 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, in findPHIToPartitionLoops() argument
216 DominatorTree *DT, LoopInfo *LI, in 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
701 simplifyLoop(Loop * L,DominatorTree * DT,LoopInfo * LI,ScalarEvolution * SE,AssumptionCache * AC,MemorySSAUpdater * MSSAU,bool PreserveLCSSA) simplifyLoop() argument
798 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
831 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DMoveAutoInit.cpp64 DominatorTree &DT, MemorySSA &MSSA) { in usersDominator()
106 static bool runMoveAutoInit(Function &F, DominatorTree &DT, MemorySSA &MSSA) { in runMoveAutoInit()
224 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
H A DMemoryTaggingSupport.cpp27 maybeReachableFromEachOther(const SmallVectorImpl<IntrinsicInst * > & Insts,const DominatorTree * DT,const LoopInfo * LI,size_t MaxLifetimes) maybeReachableFromEachOther() argument
44 forAllReachableExits(const DominatorTree & DT,const PostDominatorTree & PDT,const LoopInfo & LI,const Instruction * Start,const SmallVectorImpl<IntrinsicInst * > & Ends,const SmallVectorImpl<Instruction * > & RetVec,llvm::function_ref<void (Instruction *)> Callback) forAllReachableExits() argument
89 isStandardLifetime(const SmallVectorImpl<IntrinsicInst * > & LifetimeStart,const SmallVectorImpl<IntrinsicInst * > & LifetimeEnd,const DominatorTree * DT,const LoopInfo * LI,size_t MaxLifetimes) isStandardLifetime() argument
H A DAssumeBundleBuilder.cpp110 DominatorTree* DT = nullptr; member
293 DominatorTree *DT) { in salvageKnowledge() argument
311 DominatorTree *DT) { in buildAssumeFromKnowledge() argument
321 simplifyRetainedKnowledge(AssumeInst * Assume,RetainedKnowledge RK,AssumptionCache * AC,DominatorTree * DT) simplifyRetainedKnowledge() argument
338 DominatorTree *DT; global() member
544 simplifyAssumes(Function & F,AssumptionCache * AC,DominatorTree * DT) simplifyAssumes() argument
579 DominatorTree* DT = AM.getCachedResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DLoopVersioning.cpp43 LoopInfo *LI, DominatorTree *DT, in LoopVersioning() argument
260 bool runImpl(LoopInfo *LI, LoopAccessInfoManager &LAIs, DominatorTree *DT, in runImpl() argument
301 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DTypeMetadataUtils.cpp27 const CallInst *CI, DominatorTree &DT) { in findCallsAtConstantOffset() argument
54 int64_t Offset, const CallInst *CI, DominatorTree &DT) { in findLoadCallsAtConstantOffset() argument
77 findDevirtualizableCallsForTypeTest(SmallVectorImpl<DevirtCallSite> & DevirtCalls,SmallVectorImpl<CallInst * > & Assumes,const CallInst * CI,DominatorTree & DT) findDevirtualizableCallsForTypeTest() argument
100 findDevirtualizableCallsForTypeCheckedLoad(SmallVectorImpl<DevirtCallSite> & DevirtCalls,SmallVectorImpl<Instruction * > & LoadedPtrs,SmallVectorImpl<Instruction * > & Preds,bool & HasNonCallUses,const CallInst * CI,DominatorTree & DT) findDevirtualizableCallsForTypeCheckedLoad() argument
[all...]
H A DPHITransAddr.cpp131 translateSubExpr(Value * V,BasicBlock * CurBB,BasicBlock * PredBB,const DominatorTree * DT) translateSubExpr() argument
299 translateValue(BasicBlock * CurBB,BasicBlock * PredBB,const DominatorTree * DT,bool MustDominate) translateValue() argument
327 translateWithInsertion(BasicBlock * CurBB,BasicBlock * PredBB,const DominatorTree & DT,SmallVectorImpl<Instruction * > & NewInsts) translateWithInsertion() argument
350 insertTranslatedSubExpr(Value * InVal,BasicBlock * CurBB,BasicBlock * PredBB,const DominatorTree & DT,SmallVectorImpl<Instruction * > & NewInsts) insertTranslatedSubExpr() argument
[all...]
H A DRegionInfo.cpp64 DominatorTree *DT, Region *Parent) : in Region()
127 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
190 auto *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
H A DMustExecute.cpp118 const DominatorTree *DT, in CanProveNotTakenFirstIteration() argument
259 const DominatorTree *DT, in isGuaranteedToExecute() argument
278 const DominatorTree *DT, in isGuaranteedToExecute() argument
312 static bool isMustExecuteIn(const Instruction &I, Loop *L, DominatorTree *DT) { in isMustExecuteIn() argument
330 MustExecuteAnnotatedWriter(const Function & F,DominatorTree & DT,LoopInfo & LI) MustExecuteAnnotatedWriter() argument
342 MustExecuteAnnotatedWriter(const Module & M,DominatorTree & DT,LoopInfo & LI) MustExecuteAnnotatedWriter() argument
543 const DominatorTree *DT = DTGetter(*InitBB->getParent()); findBackwardJoinPoint() local
744 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...]
H A DCFG.cpp135 isPotentiallyReachableFromMany(SmallVectorImpl<BasicBlock * > & Worklist,const BasicBlock * StopBB,const SmallPtrSetImpl<BasicBlock * > * ExclusionSet,const DominatorTree * DT,const LoopInfo * LI) isPotentiallyReachableFromMany() argument
209 isPotentiallyReachable(const BasicBlock * A,const BasicBlock * B,const SmallPtrSetImpl<BasicBlock * > * ExclusionSet,const DominatorTree * DT,const LoopInfo * LI) isPotentiallyReachable() argument
233 isPotentiallyReachable(const Instruction * A,const Instruction * B,const SmallPtrSetImpl<BasicBlock * > * ExclusionSet,const DominatorTree * DT,const LoopInfo * LI) isPotentiallyReachable() argument
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DAliasAnalysis.h193 EarliestEscapeInfo(DominatorTree &DT, const LoopInfo *LI = nullptr) in DT() argument
178 DominatorTree &DT; global() variable
[all...]
H A DDemandedBits.h40 DemandedBits(Function & F,AssumptionCache & AC,DominatorTree & DT) DemandedBits() argument
88 DominatorTree &DT; global() variable
/freebsd-src/contrib/llvm-project/clang/lib/Lex/
H A DPPExpressions.cpp102 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateDefined() argument
233 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateValue() argument
632 DefinedTracker DT; EvaluateDirectiveSubExpr() local
827 DefinedTracker DT; EvaluateDirectiveSubExpr() local
892 DefinedTracker DT; EvaluateDirectiveExpression() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp188 bool AMDGPUUnifyDivergentExitNodesImpl::run(Function &F, DominatorTree *DT, in run() argument
332 DominatorTree *DT = nullptr; in runOnFunction() local
346 DominatorTree *DT = nullptr; in run() local
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombineInternal.h58 const DominatorTree &DT; variable
83 const DataLayout &DL, const DominatorTree &DT) in TruncInstCombine()

12345678910>>...12