MachineCopyPropagation.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366
  1. //===- MachineCopyPropagation.cpp - Machine Copy Propagation Pass ---------===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is distributed under the University of Illinois Open Source
  6. // License. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. //
  10. // This is an extremely simple MachineInstr-level copy propagation pass.
  11. //
  12. //===----------------------------------------------------------------------===//
  13. #include "llvm/CodeGen/Passes.h"
  14. #include "llvm/ADT/DenseMap.h"
  15. #include "llvm/ADT/SetVector.h"
  16. #include "llvm/ADT/SmallVector.h"
  17. #include "llvm/ADT/Statistic.h"
  18. #include "llvm/CodeGen/MachineFunction.h"
  19. #include "llvm/CodeGen/MachineFunctionPass.h"
  20. #include "llvm/CodeGen/MachineRegisterInfo.h"
  21. #include "llvm/Pass.h"
  22. #include "llvm/Support/Debug.h"
  23. #include "llvm/Support/raw_ostream.h"
  24. #include "llvm/Target/TargetInstrInfo.h"
  25. #include "llvm/Target/TargetRegisterInfo.h"
  26. #include "llvm/Target/TargetSubtargetInfo.h"
  27. using namespace llvm;
  28. #define DEBUG_TYPE "codegen-cp"
  29. STATISTIC(NumDeletes, "Number of dead copies deleted");
  30. namespace {
  31. typedef SmallVector<unsigned, 4> RegList;
  32. typedef DenseMap<unsigned, RegList> SourceMap;
  33. typedef DenseMap<unsigned, MachineInstr*> Reg2MIMap;
  34. class MachineCopyPropagation : public MachineFunctionPass {
  35. const TargetRegisterInfo *TRI;
  36. const TargetInstrInfo *TII;
  37. const MachineRegisterInfo *MRI;
  38. public:
  39. static char ID; // Pass identification, replacement for typeid
  40. MachineCopyPropagation() : MachineFunctionPass(ID) {
  41. initializeMachineCopyPropagationPass(*PassRegistry::getPassRegistry());
  42. }
  43. bool runOnMachineFunction(MachineFunction &MF) override;
  44. MachineFunctionProperties getRequiredProperties() const override {
  45. return MachineFunctionProperties().set(
  46. MachineFunctionProperties::Property::AllVRegsAllocated);
  47. }
  48. private:
  49. void ClobberRegister(unsigned Reg);
  50. void CopyPropagateBlock(MachineBasicBlock &MBB);
  51. bool eraseIfRedundant(MachineInstr &Copy, unsigned Src, unsigned Def);
  52. /// Candidates for deletion.
  53. SmallSetVector<MachineInstr*, 8> MaybeDeadCopies;
  54. /// Def -> available copies map.
  55. Reg2MIMap AvailCopyMap;
  56. /// Def -> copies map.
  57. Reg2MIMap CopyMap;
  58. /// Src -> Def map
  59. SourceMap SrcMap;
  60. bool Changed;
  61. };
  62. }
  63. char MachineCopyPropagation::ID = 0;
  64. char &llvm::MachineCopyPropagationID = MachineCopyPropagation::ID;
  65. INITIALIZE_PASS(MachineCopyPropagation, "machine-cp",
  66. "Machine Copy Propagation Pass", false, false)
  67. /// Remove any entry in \p Map where the register is a subregister or equal to
  68. /// a register contained in \p Regs.
  69. static void removeRegsFromMap(Reg2MIMap &Map, const RegList &Regs,
  70. const TargetRegisterInfo &TRI) {
  71. for (unsigned Reg : Regs) {
  72. // Source of copy is no longer available for propagation.
  73. for (MCSubRegIterator SR(Reg, &TRI, true); SR.isValid(); ++SR)
  74. Map.erase(*SR);
  75. }
  76. }
  77. /// Remove any entry in \p Map that is marked clobbered in \p RegMask.
  78. /// The map will typically have a lot fewer entries than the regmask clobbers,
  79. /// so this is more efficient than iterating the clobbered registers and calling
  80. /// ClobberRegister() on them.
  81. static void removeClobberedRegsFromMap(Reg2MIMap &Map,
  82. const MachineOperand &RegMask) {
  83. for (Reg2MIMap::iterator I = Map.begin(), E = Map.end(), Next; I != E;
  84. I = Next) {
  85. Next = std::next(I);
  86. unsigned Reg = I->first;
  87. if (RegMask.clobbersPhysReg(Reg))
  88. Map.erase(I);
  89. }
  90. }
  91. void MachineCopyPropagation::ClobberRegister(unsigned Reg) {
  92. for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
  93. CopyMap.erase(*AI);
  94. AvailCopyMap.erase(*AI);
  95. SourceMap::iterator SI = SrcMap.find(*AI);
  96. if (SI != SrcMap.end()) {
  97. removeRegsFromMap(AvailCopyMap, SI->second, *TRI);
  98. SrcMap.erase(SI);
  99. }
  100. }
  101. }
  102. /// Return true if \p PreviousCopy did copy register \p Src to register \p Def.
  103. /// This fact may have been obscured by sub register usage or may not be true at
  104. /// all even though Src and Def are subregisters of the registers used in
  105. /// PreviousCopy. e.g.
  106. /// isNopCopy("ecx = COPY eax", AX, CX) == true
  107. /// isNopCopy("ecx = COPY eax", AH, CL) == false
  108. static bool isNopCopy(const MachineInstr &PreviousCopy, unsigned Src,
  109. unsigned Def, const TargetRegisterInfo *TRI) {
  110. unsigned PreviousSrc = PreviousCopy.getOperand(1).getReg();
  111. unsigned PreviousDef = PreviousCopy.getOperand(0).getReg();
  112. if (Src == PreviousSrc) {
  113. assert(Def == PreviousDef);
  114. return true;
  115. }
  116. if (!TRI->isSubRegister(PreviousSrc, Src))
  117. return false;
  118. unsigned SubIdx = TRI->getSubRegIndex(PreviousSrc, Src);
  119. return SubIdx == TRI->getSubRegIndex(PreviousDef, Def);
  120. }
  121. /// Remove instruction \p Copy if there exists a previous copy that copies the
  122. /// register \p Src to the register \p Def; This may happen indirectly by
  123. /// copying the super registers.
  124. bool MachineCopyPropagation::eraseIfRedundant(MachineInstr &Copy, unsigned Src,
  125. unsigned Def) {
  126. // Avoid eliminating a copy from/to a reserved registers as we cannot predict
  127. // the value (Example: The sparc zero register is writable but stays zero).
  128. if (MRI->isReserved(Src) || MRI->isReserved(Def))
  129. return false;
  130. // Search for an existing copy.
  131. Reg2MIMap::iterator CI = AvailCopyMap.find(Def);
  132. if (CI == AvailCopyMap.end())
  133. return false;
  134. // Check that the existing copy uses the correct sub registers.
  135. MachineInstr &PrevCopy = *CI->second;
  136. if (!isNopCopy(PrevCopy, Src, Def, TRI))
  137. return false;
  138. DEBUG(dbgs() << "MCP: copy is a NOP, removing: "; Copy.dump());
  139. // Copy was redundantly redefining either Src or Def. Remove earlier kill
  140. // flags between Copy and PrevCopy because the value will be reused now.
  141. assert(Copy.isCopy());
  142. unsigned CopyDef = Copy.getOperand(0).getReg();
  143. assert(CopyDef == Src || CopyDef == Def);
  144. for (MachineInstr &MI :
  145. make_range(PrevCopy.getIterator(), Copy.getIterator()))
  146. MI.clearRegisterKills(CopyDef, TRI);
  147. Copy.eraseFromParent();
  148. Changed = true;
  149. ++NumDeletes;
  150. return true;
  151. }
  152. void MachineCopyPropagation::CopyPropagateBlock(MachineBasicBlock &MBB) {
  153. DEBUG(dbgs() << "MCP: CopyPropagateBlock " << MBB.getName() << "\n");
  154. for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ) {
  155. MachineInstr *MI = &*I;
  156. ++I;
  157. if (MI->isCopy()) {
  158. unsigned Def = MI->getOperand(0).getReg();
  159. unsigned Src = MI->getOperand(1).getReg();
  160. assert(!TargetRegisterInfo::isVirtualRegister(Def) &&
  161. !TargetRegisterInfo::isVirtualRegister(Src) &&
  162. "MachineCopyPropagation should be run after register allocation!");
  163. // The two copies cancel out and the source of the first copy
  164. // hasn't been overridden, eliminate the second one. e.g.
  165. // %ECX<def> = COPY %EAX
  166. // ... nothing clobbered EAX.
  167. // %EAX<def> = COPY %ECX
  168. // =>
  169. // %ECX<def> = COPY %EAX
  170. //
  171. // or
  172. //
  173. // %ECX<def> = COPY %EAX
  174. // ... nothing clobbered EAX.
  175. // %ECX<def> = COPY %EAX
  176. // =>
  177. // %ECX<def> = COPY %EAX
  178. if (eraseIfRedundant(*MI, Def, Src) || eraseIfRedundant(*MI, Src, Def))
  179. continue;
  180. // If Src is defined by a previous copy, the previous copy cannot be
  181. // eliminated.
  182. for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI) {
  183. Reg2MIMap::iterator CI = CopyMap.find(*AI);
  184. if (CI != CopyMap.end()) {
  185. DEBUG(dbgs() << "MCP: Copy is no longer dead: "; CI->second->dump());
  186. MaybeDeadCopies.remove(CI->second);
  187. }
  188. }
  189. DEBUG(dbgs() << "MCP: Copy is a deletion candidate: "; MI->dump());
  190. // Copy is now a candidate for deletion.
  191. if (!MRI->isReserved(Def))
  192. MaybeDeadCopies.insert(MI);
  193. // If 'Def' is previously source of another copy, then this earlier copy's
  194. // source is no longer available. e.g.
  195. // %xmm9<def> = copy %xmm2
  196. // ...
  197. // %xmm2<def> = copy %xmm0
  198. // ...
  199. // %xmm2<def> = copy %xmm9
  200. ClobberRegister(Def);
  201. // Remember Def is defined by the copy.
  202. for (MCSubRegIterator SR(Def, TRI, /*IncludeSelf=*/true); SR.isValid();
  203. ++SR) {
  204. CopyMap[*SR] = MI;
  205. AvailCopyMap[*SR] = MI;
  206. }
  207. // Remember source that's copied to Def. Once it's clobbered, then
  208. // it's no longer available for copy propagation.
  209. RegList &DestList = SrcMap[Src];
  210. if (std::find(DestList.begin(), DestList.end(), Def) == DestList.end())
  211. DestList.push_back(Def);
  212. continue;
  213. }
  214. // Not a copy.
  215. SmallVector<unsigned, 2> Defs;
  216. const MachineOperand *RegMask = nullptr;
  217. for (const MachineOperand &MO : MI->operands()) {
  218. if (MO.isRegMask())
  219. RegMask = &MO;
  220. if (!MO.isReg())
  221. continue;
  222. unsigned Reg = MO.getReg();
  223. if (!Reg)
  224. continue;
  225. assert(!TargetRegisterInfo::isVirtualRegister(Reg) &&
  226. "MachineCopyPropagation should be run after register allocation!");
  227. if (MO.isDef()) {
  228. Defs.push_back(Reg);
  229. continue;
  230. }
  231. // If 'Reg' is defined by a copy, the copy is no longer a candidate
  232. // for elimination.
  233. for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI) {
  234. Reg2MIMap::iterator CI = CopyMap.find(*AI);
  235. if (CI != CopyMap.end()) {
  236. DEBUG(dbgs() << "MCP: Copy is used - not dead: "; CI->second->dump());
  237. MaybeDeadCopies.remove(CI->second);
  238. }
  239. }
  240. // Treat undef use like defs for copy propagation but not for
  241. // dead copy. We would need to do a liveness check to be sure the copy
  242. // is dead for undef uses.
  243. // The backends are allowed to do whatever they want with undef value
  244. // and we cannot be sure this register will not be rewritten to break
  245. // some false dependencies for the hardware for instance.
  246. if (MO.isUndef())
  247. Defs.push_back(Reg);
  248. }
  249. // The instruction has a register mask operand which means that it clobbers
  250. // a large set of registers. Treat clobbered registers the same way as
  251. // defined registers.
  252. if (RegMask) {
  253. // Erase any MaybeDeadCopies whose destination register is clobbered.
  254. for (SmallSetVector<MachineInstr *, 8>::iterator DI =
  255. MaybeDeadCopies.begin();
  256. DI != MaybeDeadCopies.end();) {
  257. MachineInstr *MaybeDead = *DI;
  258. unsigned Reg = MaybeDead->getOperand(0).getReg();
  259. assert(!MRI->isReserved(Reg));
  260. if (!RegMask->clobbersPhysReg(Reg)) {
  261. ++DI;
  262. continue;
  263. }
  264. DEBUG(dbgs() << "MCP: Removing copy due to regmask clobbering: ";
  265. MaybeDead->dump());
  266. // erase() will return the next valid iterator pointing to the next
  267. // element after the erased one.
  268. DI = MaybeDeadCopies.erase(DI);
  269. MaybeDead->eraseFromParent();
  270. Changed = true;
  271. ++NumDeletes;
  272. }
  273. removeClobberedRegsFromMap(AvailCopyMap, *RegMask);
  274. removeClobberedRegsFromMap(CopyMap, *RegMask);
  275. for (SourceMap::iterator I = SrcMap.begin(), E = SrcMap.end(), Next;
  276. I != E; I = Next) {
  277. Next = std::next(I);
  278. if (RegMask->clobbersPhysReg(I->first)) {
  279. removeRegsFromMap(AvailCopyMap, I->second, *TRI);
  280. SrcMap.erase(I);
  281. }
  282. }
  283. }
  284. // Any previous copy definition or reading the Defs is no longer available.
  285. for (unsigned Reg : Defs)
  286. ClobberRegister(Reg);
  287. }
  288. // If MBB doesn't have successors, delete the copies whose defs are not used.
  289. // If MBB does have successors, then conservative assume the defs are live-out
  290. // since we don't want to trust live-in lists.
  291. if (MBB.succ_empty()) {
  292. for (MachineInstr *MaybeDead : MaybeDeadCopies) {
  293. assert(!MRI->isReserved(MaybeDead->getOperand(0).getReg()));
  294. MaybeDead->eraseFromParent();
  295. Changed = true;
  296. ++NumDeletes;
  297. }
  298. }
  299. MaybeDeadCopies.clear();
  300. AvailCopyMap.clear();
  301. CopyMap.clear();
  302. SrcMap.clear();
  303. }
  304. bool MachineCopyPropagation::runOnMachineFunction(MachineFunction &MF) {
  305. if (skipFunction(*MF.getFunction()))
  306. return false;
  307. Changed = false;
  308. TRI = MF.getSubtarget().getRegisterInfo();
  309. TII = MF.getSubtarget().getInstrInfo();
  310. MRI = &MF.getRegInfo();
  311. for (MachineBasicBlock &MBB : MF)
  312. CopyPropagateBlock(MBB);
  313. return Changed;
  314. }