Searched refs:DT (Results 226 - 250 of 302) sorted by relevance

1234567891011>>

/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLICM.cpp132 MachineDominatorTree *DT; // Machine dominator tree for the cur loop member in class:__anon4586::MachineLICMBase
373 DT = &getAnalysis<MachineDominatorTree>();
396 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader());
658 if (!DT->dominates(BB, CurrentLoopExitingBlock)) {
824 B = DT->findNearestCommonDominator(B, MI.getParent());
H A DMachineCopyPropagation.cpp277 DebugType DT);
311 DebugType DT) {
317 if (DT == RegularUse) {
310 ReadRegister(unsigned Reg, MachineInstr &Reader, DebugType DT) argument
H A DSafeStack.cpp878 // Compute DT and LI only for functions that have the attribute.
881 // In the backend pipeline, nothing preserves DT before SafeStack, so we
884 DominatorTree DT(F);
885 LoopInfo LI(DT);
887 ScalarEvolution SE(F, TLI, ACT, DT, LI);
H A DPeepholeOptimizer.cpp158 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon4612::PeepholeOptimizer
543 } else if (Aggressive && DT->dominates(&MBB, UseMBB)) {
1607 DT = Aggressive ? &getAnalysis<MachineDominatorTree>() : nullptr;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlan.h237 VPTransformState(unsigned VF, unsigned UF, LoopInfo *LI, DominatorTree *DT,
240 : VF(VF), UF(UF), Instance(), LI(LI), DT(DT), Builder(Builder),
319 DominatorTree *DT;
1462 static void updateDominatorTree(DominatorTree *DT, BasicBlock *LoopLatchBB,
H A DSLPVectorizer.cpp542 : F(Func), SE(Se), TTI(Tti), TLI(TLi), AA(Aa), LI(Li), DT(Dt), AC(AC),
2210 DominatorTree *DT; member in namespace:llvm::slpvectorizer
2514 if (!DT->isReachableFromEntry(BB)) {
4773 if (DomTreeNode *N = DT->getNode(BB)) {
4774 assert(DT->isReachableFromEntry(N));
4782 return DT->properlyDominates(A, B);
4790 assert((I == CSEWorkList.begin() || !DT->dominates(*I, *std::prev(I))) &&
4805 DT->dominates(v->getParent(), In->getParent())) {
5489 auto NumSignBits = ComputeNumSignBits(Scalar, *DL, 0, AC, nullptr, DT);
5560 auto *DT
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DWholeProgramDevirt.cpp1582 auto &DT = LookupDomTree(*CI->getFunction()); local
1583 findDevirtualizableCallsForTypeTest(DevirtCalls, Assumes, CI, DT);
1631 auto &DT = LookupDomTree(*CI->getFunction()); local
1633 HasNonCallUses, CI, DT);
1916 for (const auto &DT : DevirtTargets) {
1917 Function *F = DT.second;
1922 << NV("FunctionName", DT.first));
2012 for (const auto &DT : DevirtTargets)
2013 errs() << "Devirtualized call to " << DT << "\n";
H A DSampleProfile.cpp394 std::unique_ptr<DominatorTree> DT; member in class:__anon5569::SampleProfileLoader
642 DT = nullptr;
1211 DT->getDescendants(BB1, DominatedBBs);
1645 DT.reset(new DominatorTree);
1646 DT->recalculate(F);
1651 LI->analyze(*DT);
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/
H A DMangle.cpp221 CXXDtorType DT, const BlockDecl *BD,
225 mangleCXXDtor(DD, DT, Out);
248 mangleDtorBlock(DD, /*DT*/ Dtor_Complete, BD, Out);
220 mangleDtorBlock(const CXXDestructorDecl *DD, CXXDtorType DT, const BlockDecl *BD, raw_ostream &ResStream) argument
/freebsd-12-stable/tools/tools/sysbuild/
H A Dsysbuild.sh172 DT=`expr $TX - $1 || true`
175 printf " ### %5d ### %5d ### %s\n" $DT $DL "$a"
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/AST/
H A DMangle.h123 void mangleDtorBlock(const CXXDestructorDecl *CD, CXXDtorType DT,
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp393 if (!DT.isReachableFromEntry(&BB))
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DAliasAnalysis.h651 const MemoryLocation &MemLoc, DominatorTree *DT,
656 LocationSize Size, DominatorTree *DT,
658 return callCapturesBefore(I, MemoryLocation(P, Size), DT, OBB);
655 callCapturesBefore(const Instruction *I, const Value *P, LocationSize Size, DominatorTree *DT, OrderedBasicBlock *OBB = nullptr) argument
H A DLoopInfo.h775 bool isLCSSAForm(DominatorTree &DT) const;
778 bool isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const;
H A DMemorySSA.h823 renamePass(DT->getNode(BB), IncomingVal, Visited, true, true);
871 DominatorTree *DT; member in class:llvm::MemorySSA
H A DTargetTransformInfoImpl.h218 DominatorTree *DT,
248 DominatorTree *DT, AssumptionCache *AC,
216 preferPredicateOverEpilogue(Loop *L, LoopInfo *LI, ScalarEvolution &SE, AssumptionCache &AC, TargetLibraryInfo *TLI, DominatorTree *DT, const LoopAccessInfo *LAI) const argument
247 canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC, TargetLibraryInfo *LibInfo) argument
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DAliasAnalysis.cpp642 DominatorTree *DT,
644 if (!DT)
658 /* StoreCaptures */ true, I, DT,
640 callCapturesBefore(const Instruction *I, const MemoryLocation &MemLoc, DominatorTree *DT, OrderedBasicBlock *OBB) argument
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp175 DominatorTree *DT; member in class:__anon5309::PPCLoopInstrFormPrep
294 DT = DTWP ? &DTWP->getDomTree() : nullptr;
809 LoopPredecessor = InsertPreheaderForLoop(L, DT, LI, nullptr, PreserveLCSSA);
H A DPPCTargetTransformInfo.cpp969 LoopInfo *LI, DominatorTree *DT,
973 if (canSaveCmp(*I, BI, SE, LI, DT, AC, LibInfo))
984 if (!HWLoopInfo.isHardwareLoopCandidate(*SE, *LI, *DT))
968 canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC, TargetLibraryInfo *LibInfo) argument
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLowerEmscriptenEHSjLj.cpp602 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>(F).getDomTree(); local
603 DT.recalculate(F); // CFG has been changed
617 if (DT.dominates(&I, User))
/freebsd-12-stable/sys/contrib/ipfilter/netinet/
H A Dip_compat.h1226 # define DT(_n) DTRACE_PROBE(_n) macro
1234 # define DT(_n) macro
1241 # define DT(_n) macro
H A Dip_fil_freebsd.c1147 DT(ipf_checkv6sum_fi_nocksum);
1152 DT(ipf_checkv6sum_fi_short);
1157 DT(ipf_checkv6sum_fi_ck_needed);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp301 // Get DT analysis before LVI. When LVI is initialized it conditionally adds
302 // DT if it's available.
303 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local
306 DomTreeUpdater DTU(*DT, DomTreeUpdater::UpdateStrategy::Lazy);
319 LVI->printLVI(F, *DT, dbgs());
327 // Get DT analysis before LVI. When LVI is initialized it conditionally adds
328 // DT if it's available.
329 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
332 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
382 DominatorTree &DT local
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCalls.cpp117 unsigned DstAlign = getKnownAlignment(MI->getRawDest(), DL, MI, &AC, &DT);
124 unsigned SrcAlign = getKnownAlignment(MI->getRawSource(), DL, MI, &AC, &DT);
235 getKnownAlignment(MI->getDest(), DL, MI, &AC, &DT);
1067 // load/select idiom. TODO: use DT for context sensitive query
2370 &DT) >= 16) {
2387 &DT) >= 16) {
2404 &DT) >= 16) {
2416 &DT) >= 32) {
2425 &DT) >= 16) {
2437 &DT) >
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp936 DominatorTree DT;
937 DT.recalculate(const_cast<Function&>(*CalledFunc));
1100 /* StoreCaptures */ false, I, &DT)))
1149 // already in the caller. To do this, we might need a DT of the caller.
1150 DominatorTree DT; local
1158 DT.recalculate(*CS.getCaller());
1165 if (getKnownAlignment(ArgVal, DL, CS.getInstruction(), AC, &DT) >= Align)

Completed in 439 milliseconds

1234567891011>>