Home
last modified time | relevance | path

Searched refs:getDT (Results 1 – 6 of 6) sorted by relevance

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DRDFCopy.h28 CopyPropagation(DataFlowGraph &dfg) : MDT(dfg.getDT()), DFG(dfg), in CopyPropagation()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFLiveness.h63 : DFG(g), TRI(g.getTRI()), PRI(g.getPRI()), MDT(g.getDT()),
H A DRDFGraph.h698 const MachineDominatorTree &getDT() const { return MDT; } in getDT() function
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBasicAliasAnalysis.h50 DominatorTree *getDT(const AAQueryInfo &AAQI) const { in getDT() function
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DBasicAliasAnalysis.cpp1066 DominatorTree *DT = getDT(AAQI); in aliasGEP()
1560 DominatorTree *DT = getDT(AAQI); in aliasCheck()
1740 return isNotInCycle(Inst, getDT(AAQI), /*LI*/ nullptr); in isValueEqualInPotentialCycles()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp412 DominatorTree &getDT(Function &F) { in getDT() function in __anon01de4a8e0111::CodeGenPrepare
645 LI->analyze(getDT(F)); in _run()
698 LI->verify(getDT(F)); in _run()
1569 auto &DT = getDT(*BO->getParent()->getParent()); in replaceMathCmpWithIntrinsic()
5410 return this->getDT(*F); in optimizeMemoryInst()
6078 if (getDT(F).dominates(Inst, Pt)) { in mergeSExts()
6087 if (!getDT(F).dominates(Pt, Inst)) in mergeSExts()
8401 getDT(*BB.getParent()); in optimizeBlock()