OptimizePHIs.cpp 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206
  1. //===- OptimizePHIs.cpp - Optimize machine instruction PHIs ---------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. //
  9. // This pass optimizes machine instruction PHIs to take advantage of
  10. // opportunities created during DAG legalization.
  11. //
  12. //===----------------------------------------------------------------------===//
  13. #include "llvm/ADT/SmallPtrSet.h"
  14. #include "llvm/ADT/Statistic.h"
  15. #include "llvm/CodeGen/MachineBasicBlock.h"
  16. #include "llvm/CodeGen/MachineFunction.h"
  17. #include "llvm/CodeGen/MachineFunctionPass.h"
  18. #include "llvm/CodeGen/MachineInstr.h"
  19. #include "llvm/CodeGen/MachineOperand.h"
  20. #include "llvm/CodeGen/MachineRegisterInfo.h"
  21. #include "llvm/CodeGen/TargetSubtargetInfo.h"
  22. #include "llvm/InitializePasses.h"
  23. #include "llvm/Pass.h"
  24. #include <cassert>
  25. using namespace llvm;
  26. #define DEBUG_TYPE "opt-phis"
  27. STATISTIC(NumPHICycles, "Number of PHI cycles replaced");
  28. STATISTIC(NumDeadPHICycles, "Number of dead PHI cycles");
  29. namespace {
  30. class OptimizePHIs : public MachineFunctionPass {
  31. MachineRegisterInfo *MRI;
  32. const TargetInstrInfo *TII;
  33. public:
  34. static char ID; // Pass identification
  35. OptimizePHIs() : MachineFunctionPass(ID) {
  36. initializeOptimizePHIsPass(*PassRegistry::getPassRegistry());
  37. }
  38. bool runOnMachineFunction(MachineFunction &Fn) override;
  39. void getAnalysisUsage(AnalysisUsage &AU) const override {
  40. AU.setPreservesCFG();
  41. MachineFunctionPass::getAnalysisUsage(AU);
  42. }
  43. private:
  44. using InstrSet = SmallPtrSet<MachineInstr *, 16>;
  45. using InstrSetIterator = SmallPtrSetIterator<MachineInstr *>;
  46. bool IsSingleValuePHICycle(MachineInstr *MI, unsigned &SingleValReg,
  47. InstrSet &PHIsInCycle);
  48. bool IsDeadPHICycle(MachineInstr *MI, InstrSet &PHIsInCycle);
  49. bool OptimizeBB(MachineBasicBlock &MBB);
  50. };
  51. } // end anonymous namespace
  52. char OptimizePHIs::ID = 0;
  53. char &llvm::OptimizePHIsID = OptimizePHIs::ID;
  54. INITIALIZE_PASS(OptimizePHIs, DEBUG_TYPE,
  55. "Optimize machine instruction PHIs", false, false)
  56. bool OptimizePHIs::runOnMachineFunction(MachineFunction &Fn) {
  57. if (skipFunction(Fn.getFunction()))
  58. return false;
  59. MRI = &Fn.getRegInfo();
  60. TII = Fn.getSubtarget().getInstrInfo();
  61. // Find dead PHI cycles and PHI cycles that can be replaced by a single
  62. // value. InstCombine does these optimizations, but DAG legalization may
  63. // introduce new opportunities, e.g., when i64 values are split up for
  64. // 32-bit targets.
  65. bool Changed = false;
  66. for (MachineBasicBlock &MBB : Fn)
  67. Changed |= OptimizeBB(MBB);
  68. return Changed;
  69. }
  70. /// IsSingleValuePHICycle - Check if MI is a PHI where all the source operands
  71. /// are copies of SingleValReg, possibly via copies through other PHIs. If
  72. /// SingleValReg is zero on entry, it is set to the register with the single
  73. /// non-copy value. PHIsInCycle is a set used to keep track of the PHIs that
  74. /// have been scanned. PHIs may be grouped by cycle, several cycles or chains.
  75. bool OptimizePHIs::IsSingleValuePHICycle(MachineInstr *MI,
  76. unsigned &SingleValReg,
  77. InstrSet &PHIsInCycle) {
  78. assert(MI->isPHI() && "IsSingleValuePHICycle expects a PHI instruction");
  79. Register DstReg = MI->getOperand(0).getReg();
  80. // See if we already saw this register.
  81. if (!PHIsInCycle.insert(MI).second)
  82. return true;
  83. // Don't scan crazily complex things.
  84. if (PHIsInCycle.size() == 16)
  85. return false;
  86. // Scan the PHI operands.
  87. for (unsigned i = 1; i != MI->getNumOperands(); i += 2) {
  88. Register SrcReg = MI->getOperand(i).getReg();
  89. if (SrcReg == DstReg)
  90. continue;
  91. MachineInstr *SrcMI = MRI->getVRegDef(SrcReg);
  92. // Skip over register-to-register moves.
  93. if (SrcMI && SrcMI->isCopy() && !SrcMI->getOperand(0).getSubReg() &&
  94. !SrcMI->getOperand(1).getSubReg() &&
  95. SrcMI->getOperand(1).getReg().isVirtual()) {
  96. SrcReg = SrcMI->getOperand(1).getReg();
  97. SrcMI = MRI->getVRegDef(SrcReg);
  98. }
  99. if (!SrcMI)
  100. return false;
  101. if (SrcMI->isPHI()) {
  102. if (!IsSingleValuePHICycle(SrcMI, SingleValReg, PHIsInCycle))
  103. return false;
  104. } else {
  105. // Fail if there is more than one non-phi/non-move register.
  106. if (SingleValReg != 0 && SingleValReg != SrcReg)
  107. return false;
  108. SingleValReg = SrcReg;
  109. }
  110. }
  111. return true;
  112. }
  113. /// IsDeadPHICycle - Check if the register defined by a PHI is only used by
  114. /// other PHIs in a cycle.
  115. bool OptimizePHIs::IsDeadPHICycle(MachineInstr *MI, InstrSet &PHIsInCycle) {
  116. assert(MI->isPHI() && "IsDeadPHICycle expects a PHI instruction");
  117. Register DstReg = MI->getOperand(0).getReg();
  118. assert(DstReg.isVirtual() && "PHI destination is not a virtual register");
  119. // See if we already saw this register.
  120. if (!PHIsInCycle.insert(MI).second)
  121. return true;
  122. // Don't scan crazily complex things.
  123. if (PHIsInCycle.size() == 16)
  124. return false;
  125. for (MachineInstr &UseMI : MRI->use_nodbg_instructions(DstReg)) {
  126. if (!UseMI.isPHI() || !IsDeadPHICycle(&UseMI, PHIsInCycle))
  127. return false;
  128. }
  129. return true;
  130. }
  131. /// OptimizeBB - Remove dead PHI cycles and PHI cycles that can be replaced by
  132. /// a single value.
  133. bool OptimizePHIs::OptimizeBB(MachineBasicBlock &MBB) {
  134. bool Changed = false;
  135. for (MachineBasicBlock::iterator
  136. MII = MBB.begin(), E = MBB.end(); MII != E; ) {
  137. MachineInstr *MI = &*MII++;
  138. if (!MI->isPHI())
  139. break;
  140. // Check for single-value PHI cycles.
  141. unsigned SingleValReg = 0;
  142. InstrSet PHIsInCycle;
  143. if (IsSingleValuePHICycle(MI, SingleValReg, PHIsInCycle) &&
  144. SingleValReg != 0) {
  145. Register OldReg = MI->getOperand(0).getReg();
  146. if (!MRI->constrainRegClass(SingleValReg, MRI->getRegClass(OldReg)))
  147. continue;
  148. MRI->replaceRegWith(OldReg, SingleValReg);
  149. MI->eraseFromParent();
  150. // The kill flags on OldReg and SingleValReg may no longer be correct.
  151. MRI->clearKillFlags(SingleValReg);
  152. ++NumPHICycles;
  153. Changed = true;
  154. continue;
  155. }
  156. // Check for dead PHI cycles.
  157. PHIsInCycle.clear();
  158. if (IsDeadPHICycle(MI, PHIsInCycle)) {
  159. for (MachineInstr *PhiMI : PHIsInCycle) {
  160. if (MII == PhiMI)
  161. ++MII;
  162. PhiMI->eraseFromParent();
  163. }
  164. ++NumDeadPHICycles;
  165. Changed = true;
  166. }
  167. }
  168. return Changed;
  169. }