HomeSort by: relevance | last modified time | path
    Searched defs:MDT (Results 1 - 25 of 44) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LazyMachineBlockFrequencyInfo.cpp 66 auto *MDT = getAnalysisIfAvailable<MachineDominatorTree>();
73 LLVM_DEBUG(if (MDT) dbgs() << "DominatorTree is available\n");
75 if (!MDT) {
79 MDT = OwnedMDT.get();
84 OwnedMLI->getBase().analyze(MDT->getBase());
UnreachableBlockElim.cpp 107 MachineDominatorTree *MDT = getAnalysisIfAvailable<MachineDominatorTree>();
124 if (MDT && MDT->getNode(&BB)) MDT->eraseNode(&BB);
ShrinkWrap.cpp 113 MachineDominatorTree *MDT;
190 MDT = &getAnalysis<MachineDominatorTree>();
333 Save = MDT->findNearestCommonDominator(Save, &MBB);
381 (!(SaveDominatesRestore = MDT->dominates(Save, Restore)) ||
403 Save = MDT->findNearestCommonDominator(Save, Restore);
415 Save = FindIDom<>(*Save, Save->predecessors(), *MDT);
554 Save = FindIDom<>(*Save, Save->predecessors(), *MDT);
SplitKit.h 272 MachineDominatorTree &MDT;
463 VirtRegMap &VRM, MachineDominatorTree &MDT,
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
RDFCopy.h 28 CopyPropagation(DataFlowGraph &dfg) : MDT(dfg.getDT()), DFG(dfg),
43 const MachineDominatorTree &MDT;
HexagonBitSimplify.cpp 232 MachineDominatorTree *MDT = nullptr;
277 for (auto *DTN : children<MachineDomTreeNode*>(MDT->getNode(&B)))
954 DeadCodeElimination(MachineFunction &mf, MachineDominatorTree &mdt)
956 MDT(mdt), MRI(mf.getRegInfo()) {}
959 return runOnNode(MDT.getRootNode());
968 MachineDominatorTree &MDT;
1750 BitSimplification(BitTracker &bt, const MachineDominatorTree &mdt,
1753 : Transformation(true), MDT(mdt), HII(hii), HRI(hri), MRI(mri)
    [all...]
HexagonRDFOpt.cpp 81 MachineDominatorTree *MDT;
292 MDT = &getAnalysis<MachineDominatorTree>();
303 DataFlowGraph G(MF, HII, HRI, *MDT, MDF, TOI);
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCCTRLoops.cpp 67 MachineDominatorTree *MDT;
166 MDT = &getAnalysis<MachineDominatorTree>();
173 if (!MDT->isReachableFromEntry(MBB))
PPCBranchCoalescing.cpp 149 MachineDominatorTree *MDT;
218 MDT = &getAnalysis<MachineDominatorTree>();
497 else if (!MDT->dominates(TargetRegion.BranchBlock, SourceRegion.BranchBlock))
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/GISel/
AArch64O0PreLegalizerCombiner.cpp 55 MachineDominatorTree *MDT;
61 MachineDominatorTree *MDT)
64 KB(KB), MDT(MDT) {
76 CombinerHelper Helper(Observer, B, KB, MDT);
151 false, F.hasOptSize(), F.hasMinSize(), KB, nullptr /* MDT */);
AArch64PostLegalizerCombiner.cpp 282 MachineDominatorTree *MDT;
289 MachineDominatorTree *MDT)
292 KB(KB), MDT(MDT) {
306 CombinerHelper Helper(Observer, B, KB, MDT, LI);
365 MachineDominatorTree *MDT =
368 F.hasMinSize(), KB, MDT);
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SILateBranchLowering.cpp 31 MachineDominatorTree *MDT = nullptr;
88 MachineDominatorTree *MDT) {
99 MDT->getBase().applyUpdates(DTUpdates);
112 splitBlock(MBB, *BranchMI, MDT);
115 MDT->getBase().insertEdge(&MBB, EarlyExitBlock);
122 MDT = &getAnalysis<MachineDominatorTree>();
210 MDT->getBase().insertEdge(MBB, EmptyMBBAtEnd);
SIFixSGPRCopies.cpp 86 MachineDominatorTree *MDT;
365 MachineDominatorTree &MDT) {
366 if (MDT.dominates(From, To))
396 MachineDominatorTree &MDT,
437 assert(MDT.dominates(&*To, &*From));
439 auto interferes = [&MDT, From, To](MachineInstr* &Clobber) -> bool {
442 bool MayClobberFrom = isReachable(Clobber, &*From, MBBTo, MDT);
443 bool MayClobberTo = isReachable(Clobber, &*To, MBBTo, MDT);
454 MDT.dominates(Clobber, &*From) &&
455 MDT.dominates(Clobber, &*To)) |
    [all...]
AMDGPUPostLegalizerCombiner.cpp 281 MachineDominatorTree *MDT;
288 GISelKnownBits *KB, MachineDominatorTree *MDT)
291 KB(KB), MDT(MDT) {
303 CombinerHelper Helper(Observer, B, KB, MDT, LInfo);
381 MachineDominatorTree *MDT =
384 F.hasMinSize(), LI, KB, MDT);
AMDGPUPreLegalizerCombiner.cpp 178 MachineDominatorTree *MDT;
184 GISelKnownBits *KB, MachineDominatorTree *MDT)
187 KB(KB), MDT(MDT) {
199 CombinerHelper Helper(Observer, B, KB, MDT);
272 MachineDominatorTree *MDT =
275 F.hasMinSize(), KB, MDT);
AMDGPURegBankCombiner.cpp 164 MachineDominatorTree *MDT;
171 GISelKnownBits *KB, MachineDominatorTree *MDT)
174 KB(KB), MDT(MDT) {
186 CombinerHelper Helper(Observer, B, KB, MDT);
254 MachineDominatorTree *MDT =
257 F.hasMinSize(), LI, KB, MDT);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
CombinerHelper.h 95 MachineDominatorTree *MDT;
101 MachineDominatorTree *MDT = nullptr,
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
RDFLiveness.h 80 : DFG(g), TRI(g.getTRI()), PRI(g.getPRI()), MDT(g.getDT()),
128 const MachineDominatorTree &MDT;
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyCFGSort.cpp 189 const MachineDominatorTree &MDT) {
288 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) {
319 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) {
390 auto &MDT = getAnalysis<MachineDominatorTree>();
395 sortBlocks(MF, MLI, WEI, MDT);
WebAssemblyMemIntrinsicResults.cpp 87 MachineDominatorTree &MDT,
105 if (&MI == Where || !MDT.dominates(&MI, Where))
151 MachineDominatorTree &MDT, LiveIntervals &LIS,
174 return replaceDominatedUses(MBB, MI, FromReg, ToReg, MRI, MDT, LIS);
184 auto &MDT = getAnalysis<MachineDominatorTree>();
205 Changed |= optimizeCall(MBB, MI, MRI, MDT, LIS, TLI, LibInfo);
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARC/
ARCOptAddrMode.cpp 62 MachineDominatorTree *MDT = nullptr;
140 MachineDominatorTree *MDT,
154 if (!MDT->dominates(InstBB, MBB))
161 if (!MDT->dominates(MI, User))
185 return dominatesAllUsesOf(Ldst, R, MDT, MRI);
237 if (MDT->dominates(Last, First)) std::swap(First, Last);
271 if (MDT->dominates(Ldst, Add))
273 else if (!MDT->dominates(Add, Ldst))
308 if (&MI != Add && MDT->dominates(Ldst, &MI))
310 else if (!MDT->dominates(&MI, Ldst)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86FlagsCopyLowering.cpp 95 MachineDominatorTree *MDT = nullptr;
372 MDT = &getAnalysis<MachineDominatorTree>();
464 assert(MDT->dominates(BeginMBB, EndMBB) &&
493 return MDT->findNearestCommonDominator(LHS, RHS);
674 if (SuccMBB == TestMBB || !MDT->dominates(TestMBB, SuccMBB)) {
X86LoadValueInjectionLoadHardening.cpp 163 const MachineDominatorTree &MDT,
274 const auto &MDT = getAnalysis<MachineDominatorTree>();
276 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF);
328 const MachineDominatorTree &MDT,
334 DataFlowGraph DFG{MF, *TII, *TRI, MDT, MDF, TOI};
  /src/external/gpl3/gdb/dist/sim/testsuite/bfin/
se_loop_kill_dcr.S 601 LSETUP ( MDT , MDT ) LC1 = P3;
604 MDT:
se_loop_kill_dcr_01.S 601 LSETUP ( MDT , MDT ) LC1 = P3;
604 MDT:

Completed in 30 milliseconds

1 2