MachineSSAUpdater.cpp 13 KB

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