MachineSSAUpdater.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. //===- MachineSSAUpdater.cpp - Unstructured SSA Update Tool ---------------===//
  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 file implements the MachineSSAUpdater class. It's based on SSAUpdater
  10. // class in lib/Transforms/Utils.
  11. //
  12. //===----------------------------------------------------------------------===//
  13. #include "llvm/CodeGen/MachineSSAUpdater.h"
  14. #include "llvm/ADT/DenseMap.h"
  15. #include "llvm/ADT/SmallVector.h"
  16. #include "llvm/CodeGen/MachineBasicBlock.h"
  17. #include "llvm/CodeGen/MachineFunction.h"
  18. #include "llvm/CodeGen/MachineInstr.h"
  19. #include "llvm/CodeGen/MachineInstrBuilder.h"
  20. #include "llvm/CodeGen/MachineOperand.h"
  21. #include "llvm/CodeGen/MachineRegisterInfo.h"
  22. #include "llvm/CodeGen/TargetInstrInfo.h"
  23. #include "llvm/CodeGen/TargetOpcodes.h"
  24. #include "llvm/CodeGen/TargetSubtargetInfo.h"
  25. #include "llvm/IR/DebugLoc.h"
  26. #include "llvm/Support/Debug.h"
  27. #include "llvm/Support/ErrorHandling.h"
  28. #include "llvm/Support/raw_ostream.h"
  29. #include "llvm/Transforms/Utils/SSAUpdaterImpl.h"
  30. #include <utility>
  31. using namespace llvm;
  32. #define DEBUG_TYPE "machine-ssaupdater"
  33. using AvailableValsTy = DenseMap<MachineBasicBlock *, Register>;
  34. static AvailableValsTy &getAvailableVals(void *AV) {
  35. return *static_cast<AvailableValsTy*>(AV);
  36. }
  37. MachineSSAUpdater::MachineSSAUpdater(MachineFunction &MF,
  38. SmallVectorImpl<MachineInstr*> *NewPHI)
  39. : InsertedPHIs(NewPHI), TII(MF.getSubtarget().getInstrInfo()),
  40. MRI(&MF.getRegInfo()) {}
  41. MachineSSAUpdater::~MachineSSAUpdater() {
  42. delete static_cast<AvailableValsTy*>(AV);
  43. }
  44. /// Initialize - Reset this object to get ready for a new set of SSA
  45. /// updates.
  46. void MachineSSAUpdater::Initialize(const TargetRegisterClass *RC) {
  47. if (!AV)
  48. AV = new AvailableValsTy();
  49. else
  50. getAvailableVals(AV).clear();
  51. VRC = RC;
  52. }
  53. void MachineSSAUpdater::Initialize(Register V) {
  54. Initialize(MRI->getRegClass(V));
  55. }
  56. /// HasValueForBlock - Return true if the MachineSSAUpdater already has a value for
  57. /// the specified block.
  58. bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const {
  59. return getAvailableVals(AV).count(BB);
  60. }
  61. /// AddAvailableValue - Indicate that a rewritten value is available in the
  62. /// specified block with the specified value.
  63. void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, Register V) {
  64. getAvailableVals(AV)[BB] = V;
  65. }
  66. /// GetValueAtEndOfBlock - Construct SSA form, materializing a value that is
  67. /// live at the end of the specified block.
  68. Register MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) {
  69. return GetValueAtEndOfBlockInternal(BB);
  70. }
  71. static
  72. Register LookForIdenticalPHI(MachineBasicBlock *BB,
  73. SmallVectorImpl<std::pair<MachineBasicBlock *, Register>> &PredValues) {
  74. if (BB->empty())
  75. return Register();
  76. MachineBasicBlock::iterator I = BB->begin();
  77. if (!I->isPHI())
  78. return Register();
  79. AvailableValsTy AVals;
  80. for (unsigned i = 0, e = PredValues.size(); i != e; ++i)
  81. AVals[PredValues[i].first] = PredValues[i].second;
  82. while (I != BB->end() && I->isPHI()) {
  83. bool Same = true;
  84. for (unsigned i = 1, e = I->getNumOperands(); i != e; i += 2) {
  85. Register SrcReg = I->getOperand(i).getReg();
  86. MachineBasicBlock *SrcBB = I->getOperand(i+1).getMBB();
  87. if (AVals[SrcBB] != SrcReg) {
  88. Same = false;
  89. break;
  90. }
  91. }
  92. if (Same)
  93. return I->getOperand(0).getReg();
  94. ++I;
  95. }
  96. return Register();
  97. }
  98. /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define
  99. /// a value of the given register class at the start of the specified basic
  100. /// block. It returns the virtual register defined by the instruction.
  101. static
  102. MachineInstrBuilder InsertNewDef(unsigned Opcode,
  103. MachineBasicBlock *BB, MachineBasicBlock::iterator I,
  104. const TargetRegisterClass *RC,
  105. MachineRegisterInfo *MRI,
  106. const TargetInstrInfo *TII) {
  107. Register NewVR = MRI->createVirtualRegister(RC);
  108. return BuildMI(*BB, I, DebugLoc(), TII->get(Opcode), NewVR);
  109. }
  110. /// GetValueInMiddleOfBlock - Construct SSA form, materializing a value that
  111. /// is live in the middle of the specified block.
  112. ///
  113. /// GetValueInMiddleOfBlock is the same as GetValueAtEndOfBlock except in one
  114. /// important case: if there is a definition of the rewritten value after the
  115. /// 'use' in BB. Consider code like this:
  116. ///
  117. /// X1 = ...
  118. /// SomeBB:
  119. /// use(X)
  120. /// X2 = ...
  121. /// br Cond, SomeBB, OutBB
  122. ///
  123. /// In this case, there are two values (X1 and X2) added to the AvailableVals
  124. /// set by the client of the rewriter, and those values are both live out of
  125. /// their respective blocks. However, the use of X happens in the *middle* of
  126. /// a block. Because of this, we need to insert a new PHI node in SomeBB to
  127. /// merge the appropriate values, and this value isn't live out of the block.
  128. Register MachineSSAUpdater::GetValueInMiddleOfBlock(MachineBasicBlock *BB) {
  129. // If there is no definition of the renamed variable in this block, just use
  130. // GetValueAtEndOfBlock to do our work.
  131. if (!HasValueForBlock(BB))
  132. return GetValueAtEndOfBlockInternal(BB);
  133. // If there are no predecessors, just return undef.
  134. if (BB->pred_empty()) {
  135. // Insert an implicit_def to represent an undef value.
  136. MachineInstr *NewDef = InsertNewDef(TargetOpcode::IMPLICIT_DEF,
  137. BB, BB->getFirstTerminator(),
  138. VRC, MRI, TII);
  139. return NewDef->getOperand(0).getReg();
  140. }
  141. // Otherwise, we have the hard case. Get the live-in values for each
  142. // predecessor.
  143. SmallVector<std::pair<MachineBasicBlock*, Register>, 8> PredValues;
  144. Register SingularValue;
  145. bool isFirstPred = true;
  146. for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(),
  147. E = BB->pred_end(); PI != E; ++PI) {
  148. MachineBasicBlock *PredBB = *PI;
  149. Register PredVal = GetValueAtEndOfBlockInternal(PredBB);
  150. PredValues.push_back(std::make_pair(PredBB, PredVal));
  151. // Compute SingularValue.
  152. if (isFirstPred) {
  153. SingularValue = PredVal;
  154. isFirstPred = false;
  155. } else if (PredVal != SingularValue)
  156. SingularValue = Register();
  157. }
  158. // Otherwise, if all the merged values are the same, just use it.
  159. if (SingularValue)
  160. return SingularValue;
  161. // If an identical PHI is already in BB, just reuse it.
  162. Register DupPHI = LookForIdenticalPHI(BB, PredValues);
  163. if (DupPHI)
  164. return DupPHI;
  165. // Otherwise, we do need a PHI: insert one now.
  166. MachineBasicBlock::iterator Loc = BB->empty() ? BB->end() : BB->begin();
  167. MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB,
  168. Loc, VRC, MRI, TII);
  169. // Fill in all the predecessors of the PHI.
  170. for (unsigned i = 0, e = PredValues.size(); i != e; ++i)
  171. InsertedPHI.addReg(PredValues[i].second).addMBB(PredValues[i].first);
  172. // See if the PHI node can be merged to a single value. This can happen in
  173. // loop cases when we get a PHI of itself and one other value.
  174. if (unsigned ConstVal = InsertedPHI->isConstantValuePHI()) {
  175. InsertedPHI->eraseFromParent();
  176. return ConstVal;
  177. }
  178. // If the client wants to know about all new instructions, tell it.
  179. if (InsertedPHIs) InsertedPHIs->push_back(InsertedPHI);
  180. LLVM_DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n");
  181. return InsertedPHI.getReg(0);
  182. }
  183. static
  184. MachineBasicBlock *findCorrespondingPred(const MachineInstr *MI,
  185. MachineOperand *U) {
  186. for (unsigned i = 1, e = MI->getNumOperands(); i != e; i += 2) {
  187. if (&MI->getOperand(i) == U)
  188. return MI->getOperand(i+1).getMBB();
  189. }
  190. llvm_unreachable("MachineOperand::getParent() failure?");
  191. }
  192. /// RewriteUse - Rewrite a use of the symbolic value. This handles PHI nodes,
  193. /// which use their value in the corresponding predecessor.
  194. void MachineSSAUpdater::RewriteUse(MachineOperand &U) {
  195. MachineInstr *UseMI = U.getParent();
  196. Register NewVR;
  197. if (UseMI->isPHI()) {
  198. MachineBasicBlock *SourceBB = findCorrespondingPred(UseMI, &U);
  199. NewVR = GetValueAtEndOfBlockInternal(SourceBB);
  200. } else {
  201. NewVR = GetValueInMiddleOfBlock(UseMI->getParent());
  202. }
  203. U.setReg(NewVR);
  204. }
  205. /// SSAUpdaterTraits<MachineSSAUpdater> - Traits for the SSAUpdaterImpl
  206. /// template, specialized for MachineSSAUpdater.
  207. namespace llvm {
  208. template<>
  209. class SSAUpdaterTraits<MachineSSAUpdater> {
  210. public:
  211. using BlkT = MachineBasicBlock;
  212. using ValT = Register;
  213. using PhiT = MachineInstr;
  214. using BlkSucc_iterator = MachineBasicBlock::succ_iterator;
  215. static BlkSucc_iterator BlkSucc_begin(BlkT *BB) { return BB->succ_begin(); }
  216. static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return BB->succ_end(); }
  217. /// Iterator for PHI operands.
  218. class PHI_iterator {
  219. private:
  220. MachineInstr *PHI;
  221. unsigned idx;
  222. public:
  223. explicit PHI_iterator(MachineInstr *P) // begin iterator
  224. : PHI(P), idx(1) {}
  225. PHI_iterator(MachineInstr *P, bool) // end iterator
  226. : PHI(P), idx(PHI->getNumOperands()) {}
  227. PHI_iterator &operator++() { idx += 2; return *this; }
  228. bool operator==(const PHI_iterator& x) const { return idx == x.idx; }
  229. bool operator!=(const PHI_iterator& x) const { return !operator==(x); }
  230. unsigned getIncomingValue() { return PHI->getOperand(idx).getReg(); }
  231. MachineBasicBlock *getIncomingBlock() {
  232. return PHI->getOperand(idx+1).getMBB();
  233. }
  234. };
  235. static inline PHI_iterator PHI_begin(PhiT *PHI) { return PHI_iterator(PHI); }
  236. static inline PHI_iterator PHI_end(PhiT *PHI) {
  237. return PHI_iterator(PHI, true);
  238. }
  239. /// FindPredecessorBlocks - Put the predecessors of BB into the Preds
  240. /// vector.
  241. static void FindPredecessorBlocks(MachineBasicBlock *BB,
  242. SmallVectorImpl<MachineBasicBlock*> *Preds){
  243. for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(),
  244. E = BB->pred_end(); PI != E; ++PI)
  245. Preds->push_back(*PI);
  246. }
  247. /// GetUndefVal - Create an IMPLICIT_DEF instruction with a new register.
  248. /// Add it into the specified block and return the register.
  249. static Register GetUndefVal(MachineBasicBlock *BB,
  250. MachineSSAUpdater *Updater) {
  251. // Insert an implicit_def to represent an undef value.
  252. MachineInstr *NewDef = InsertNewDef(TargetOpcode::IMPLICIT_DEF,
  253. BB, BB->getFirstNonPHI(),
  254. Updater->VRC, Updater->MRI,
  255. Updater->TII);
  256. return NewDef->getOperand(0).getReg();
  257. }
  258. /// CreateEmptyPHI - Create a PHI instruction that defines a new register.
  259. /// Add it into the specified block and return the register.
  260. static Register CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds,
  261. MachineSSAUpdater *Updater) {
  262. MachineBasicBlock::iterator Loc = BB->empty() ? BB->end() : BB->begin();
  263. MachineInstr *PHI = InsertNewDef(TargetOpcode::PHI, BB, Loc,
  264. Updater->VRC, Updater->MRI,
  265. Updater->TII);
  266. return PHI->getOperand(0).getReg();
  267. }
  268. /// AddPHIOperand - Add the specified value as an operand of the PHI for
  269. /// the specified predecessor block.
  270. static void AddPHIOperand(MachineInstr *PHI, Register Val,
  271. MachineBasicBlock *Pred) {
  272. MachineInstrBuilder(*Pred->getParent(), PHI).addReg(Val).addMBB(Pred);
  273. }
  274. /// InstrIsPHI - Check if an instruction is a PHI.
  275. static MachineInstr *InstrIsPHI(MachineInstr *I) {
  276. if (I && I->isPHI())
  277. return I;
  278. return nullptr;
  279. }
  280. /// ValueIsPHI - Check if the instruction that defines the specified register
  281. /// is a PHI instruction.
  282. static MachineInstr *ValueIsPHI(Register Val, MachineSSAUpdater *Updater) {
  283. return InstrIsPHI(Updater->MRI->getVRegDef(Val));
  284. }
  285. /// ValueIsNewPHI - Like ValueIsPHI but also check if the PHI has no source
  286. /// operands, i.e., it was just added.
  287. static MachineInstr *ValueIsNewPHI(Register Val, MachineSSAUpdater *Updater) {
  288. MachineInstr *PHI = ValueIsPHI(Val, Updater);
  289. if (PHI && PHI->getNumOperands() <= 1)
  290. return PHI;
  291. return nullptr;
  292. }
  293. /// GetPHIValue - For the specified PHI instruction, return the register
  294. /// that it defines.
  295. static Register GetPHIValue(MachineInstr *PHI) {
  296. return PHI->getOperand(0).getReg();
  297. }
  298. };
  299. } // end namespace llvm
  300. /// GetValueAtEndOfBlockInternal - Check to see if AvailableVals has an entry
  301. /// for the specified BB and if so, return it. If not, construct SSA form by
  302. /// first calculating the required placement of PHIs and then inserting new
  303. /// PHIs where needed.
  304. Register MachineSSAUpdater::GetValueAtEndOfBlockInternal(MachineBasicBlock *BB){
  305. AvailableValsTy &AvailableVals = getAvailableVals(AV);
  306. if (Register V = AvailableVals[BB])
  307. return V;
  308. SSAUpdaterImpl<MachineSSAUpdater> Impl(this, &AvailableVals, InsertedPHIs);
  309. return Impl.GetValue(BB);
  310. }