MachineRegisterInfo.cpp 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666
  1. //===- lib/Codegen/MachineRegisterInfo.cpp --------------------------------===//
  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. // Implementation of the MachineRegisterInfo class.
  10. //
  11. //===----------------------------------------------------------------------===//
  12. #include "llvm/CodeGen/MachineRegisterInfo.h"
  13. #include "llvm/ADT/iterator_range.h"
  14. #include "llvm/CodeGen/LowLevelType.h"
  15. #include "llvm/CodeGen/MachineBasicBlock.h"
  16. #include "llvm/CodeGen/MachineFunction.h"
  17. #include "llvm/CodeGen/MachineInstr.h"
  18. #include "llvm/CodeGen/MachineInstrBuilder.h"
  19. #include "llvm/CodeGen/MachineOperand.h"
  20. #include "llvm/CodeGen/TargetInstrInfo.h"
  21. #include "llvm/CodeGen/TargetRegisterInfo.h"
  22. #include "llvm/CodeGen/TargetSubtargetInfo.h"
  23. #include "llvm/Config/llvm-config.h"
  24. #include "llvm/IR/Attributes.h"
  25. #include "llvm/IR/DebugLoc.h"
  26. #include "llvm/IR/Function.h"
  27. #include "llvm/MC/MCRegisterInfo.h"
  28. #include "llvm/Support/Casting.h"
  29. #include "llvm/Support/CommandLine.h"
  30. #include "llvm/Support/Compiler.h"
  31. #include "llvm/Support/ErrorHandling.h"
  32. #include "llvm/Support/raw_ostream.h"
  33. #include <cassert>
  34. using namespace llvm;
  35. static cl::opt<bool> EnableSubRegLiveness("enable-subreg-liveness", cl::Hidden,
  36. cl::init(true), cl::desc("Enable subregister liveness tracking."));
  37. // Pin the vtable to this file.
  38. void MachineRegisterInfo::Delegate::anchor() {}
  39. MachineRegisterInfo::MachineRegisterInfo(MachineFunction *MF)
  40. : MF(MF), TracksSubRegLiveness(MF->getSubtarget().enableSubRegLiveness() &&
  41. EnableSubRegLiveness),
  42. IsUpdatedCSRsInitialized(false) {
  43. unsigned NumRegs = getTargetRegisterInfo()->getNumRegs();
  44. VRegInfo.reserve(256);
  45. RegAllocHints.reserve(256);
  46. UsedPhysRegMask.resize(NumRegs);
  47. PhysRegUseDefLists.reset(new MachineOperand*[NumRegs]());
  48. }
  49. /// setRegClass - Set the register class of the specified virtual register.
  50. ///
  51. void
  52. MachineRegisterInfo::setRegClass(unsigned Reg, const TargetRegisterClass *RC) {
  53. assert(RC && RC->isAllocatable() && "Invalid RC for virtual register");
  54. VRegInfo[Reg].first = RC;
  55. }
  56. void MachineRegisterInfo::setRegBank(unsigned Reg,
  57. const RegisterBank &RegBank) {
  58. VRegInfo[Reg].first = &RegBank;
  59. }
  60. static const TargetRegisterClass *
  61. constrainRegClass(MachineRegisterInfo &MRI, unsigned Reg,
  62. const TargetRegisterClass *OldRC,
  63. const TargetRegisterClass *RC, unsigned MinNumRegs) {
  64. if (OldRC == RC)
  65. return RC;
  66. const TargetRegisterClass *NewRC =
  67. MRI.getTargetRegisterInfo()->getCommonSubClass(OldRC, RC);
  68. if (!NewRC || NewRC == OldRC)
  69. return NewRC;
  70. if (NewRC->getNumRegs() < MinNumRegs)
  71. return nullptr;
  72. MRI.setRegClass(Reg, NewRC);
  73. return NewRC;
  74. }
  75. const TargetRegisterClass *
  76. MachineRegisterInfo::constrainRegClass(unsigned Reg,
  77. const TargetRegisterClass *RC,
  78. unsigned MinNumRegs) {
  79. return ::constrainRegClass(*this, Reg, getRegClass(Reg), RC, MinNumRegs);
  80. }
  81. bool
  82. MachineRegisterInfo::constrainRegAttrs(unsigned Reg,
  83. unsigned ConstrainingReg,
  84. unsigned MinNumRegs) {
  85. const LLT RegTy = getType(Reg);
  86. const LLT ConstrainingRegTy = getType(ConstrainingReg);
  87. if (RegTy.isValid() && ConstrainingRegTy.isValid() &&
  88. RegTy != ConstrainingRegTy)
  89. return false;
  90. const auto ConstrainingRegCB = getRegClassOrRegBank(ConstrainingReg);
  91. if (!ConstrainingRegCB.isNull()) {
  92. const auto RegCB = getRegClassOrRegBank(Reg);
  93. if (RegCB.isNull())
  94. setRegClassOrRegBank(Reg, ConstrainingRegCB);
  95. else if (RegCB.is<const TargetRegisterClass *>() !=
  96. ConstrainingRegCB.is<const TargetRegisterClass *>())
  97. return false;
  98. else if (RegCB.is<const TargetRegisterClass *>()) {
  99. if (!::constrainRegClass(
  100. *this, Reg, RegCB.get<const TargetRegisterClass *>(),
  101. ConstrainingRegCB.get<const TargetRegisterClass *>(), MinNumRegs))
  102. return false;
  103. } else if (RegCB != ConstrainingRegCB)
  104. return false;
  105. }
  106. if (ConstrainingRegTy.isValid())
  107. setType(Reg, ConstrainingRegTy);
  108. return true;
  109. }
  110. bool
  111. MachineRegisterInfo::recomputeRegClass(unsigned Reg) {
  112. const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
  113. const TargetRegisterClass *OldRC = getRegClass(Reg);
  114. const TargetRegisterClass *NewRC =
  115. getTargetRegisterInfo()->getLargestLegalSuperClass(OldRC, *MF);
  116. // Stop early if there is no room to grow.
  117. if (NewRC == OldRC)
  118. return false;
  119. // Accumulate constraints from all uses.
  120. for (MachineOperand &MO : reg_nodbg_operands(Reg)) {
  121. // Apply the effect of the given operand to NewRC.
  122. MachineInstr *MI = MO.getParent();
  123. unsigned OpNo = &MO - &MI->getOperand(0);
  124. NewRC = MI->getRegClassConstraintEffect(OpNo, NewRC, TII,
  125. getTargetRegisterInfo());
  126. if (!NewRC || NewRC == OldRC)
  127. return false;
  128. }
  129. setRegClass(Reg, NewRC);
  130. return true;
  131. }
  132. unsigned MachineRegisterInfo::createIncompleteVirtualRegister(StringRef Name) {
  133. unsigned Reg = TargetRegisterInfo::index2VirtReg(getNumVirtRegs());
  134. VRegInfo.grow(Reg);
  135. RegAllocHints.grow(Reg);
  136. insertVRegByName(Name, Reg);
  137. return Reg;
  138. }
  139. /// createVirtualRegister - Create and return a new virtual register in the
  140. /// function with the specified register class.
  141. ///
  142. Register
  143. MachineRegisterInfo::createVirtualRegister(const TargetRegisterClass *RegClass,
  144. StringRef Name) {
  145. assert(RegClass && "Cannot create register without RegClass!");
  146. assert(RegClass->isAllocatable() &&
  147. "Virtual register RegClass must be allocatable.");
  148. // New virtual register number.
  149. unsigned Reg = createIncompleteVirtualRegister(Name);
  150. VRegInfo[Reg].first = RegClass;
  151. if (TheDelegate)
  152. TheDelegate->MRI_NoteNewVirtualRegister(Reg);
  153. return Reg;
  154. }
  155. Register MachineRegisterInfo::cloneVirtualRegister(Register VReg,
  156. StringRef Name) {
  157. unsigned Reg = createIncompleteVirtualRegister(Name);
  158. VRegInfo[Reg].first = VRegInfo[VReg].first;
  159. setType(Reg, getType(VReg));
  160. if (TheDelegate)
  161. TheDelegate->MRI_NoteNewVirtualRegister(Reg);
  162. return Reg;
  163. }
  164. void MachineRegisterInfo::setType(unsigned VReg, LLT Ty) {
  165. VRegToType.grow(VReg);
  166. VRegToType[VReg] = Ty;
  167. }
  168. Register
  169. MachineRegisterInfo::createGenericVirtualRegister(LLT Ty, StringRef Name) {
  170. // New virtual register number.
  171. unsigned Reg = createIncompleteVirtualRegister(Name);
  172. // FIXME: Should we use a dummy register class?
  173. VRegInfo[Reg].first = static_cast<RegisterBank *>(nullptr);
  174. setType(Reg, Ty);
  175. if (TheDelegate)
  176. TheDelegate->MRI_NoteNewVirtualRegister(Reg);
  177. return Reg;
  178. }
  179. void MachineRegisterInfo::clearVirtRegTypes() { VRegToType.clear(); }
  180. /// clearVirtRegs - Remove all virtual registers (after physreg assignment).
  181. void MachineRegisterInfo::clearVirtRegs() {
  182. #ifndef NDEBUG
  183. for (unsigned i = 0, e = getNumVirtRegs(); i != e; ++i) {
  184. unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
  185. if (!VRegInfo[Reg].second)
  186. continue;
  187. verifyUseList(Reg);
  188. llvm_unreachable("Remaining virtual register operands");
  189. }
  190. #endif
  191. VRegInfo.clear();
  192. for (auto &I : LiveIns)
  193. I.second = 0;
  194. }
  195. void MachineRegisterInfo::verifyUseList(unsigned Reg) const {
  196. #ifndef NDEBUG
  197. bool Valid = true;
  198. for (MachineOperand &M : reg_operands(Reg)) {
  199. MachineOperand *MO = &M;
  200. MachineInstr *MI = MO->getParent();
  201. if (!MI) {
  202. errs() << printReg(Reg, getTargetRegisterInfo())
  203. << " use list MachineOperand " << MO
  204. << " has no parent instruction.\n";
  205. Valid = false;
  206. continue;
  207. }
  208. MachineOperand *MO0 = &MI->getOperand(0);
  209. unsigned NumOps = MI->getNumOperands();
  210. if (!(MO >= MO0 && MO < MO0+NumOps)) {
  211. errs() << printReg(Reg, getTargetRegisterInfo())
  212. << " use list MachineOperand " << MO
  213. << " doesn't belong to parent MI: " << *MI;
  214. Valid = false;
  215. }
  216. if (!MO->isReg()) {
  217. errs() << printReg(Reg, getTargetRegisterInfo())
  218. << " MachineOperand " << MO << ": " << *MO
  219. << " is not a register\n";
  220. Valid = false;
  221. }
  222. if (MO->getReg() != Reg) {
  223. errs() << printReg(Reg, getTargetRegisterInfo())
  224. << " use-list MachineOperand " << MO << ": "
  225. << *MO << " is the wrong register\n";
  226. Valid = false;
  227. }
  228. }
  229. assert(Valid && "Invalid use list");
  230. #endif
  231. }
  232. void MachineRegisterInfo::verifyUseLists() const {
  233. #ifndef NDEBUG
  234. for (unsigned i = 0, e = getNumVirtRegs(); i != e; ++i)
  235. verifyUseList(TargetRegisterInfo::index2VirtReg(i));
  236. for (unsigned i = 1, e = getTargetRegisterInfo()->getNumRegs(); i != e; ++i)
  237. verifyUseList(i);
  238. #endif
  239. }
  240. /// Add MO to the linked list of operands for its register.
  241. void MachineRegisterInfo::addRegOperandToUseList(MachineOperand *MO) {
  242. assert(!MO->isOnRegUseList() && "Already on list");
  243. MachineOperand *&HeadRef = getRegUseDefListHead(MO->getReg());
  244. MachineOperand *const Head = HeadRef;
  245. // Head points to the first list element.
  246. // Next is NULL on the last list element.
  247. // Prev pointers are circular, so Head->Prev == Last.
  248. // Head is NULL for an empty list.
  249. if (!Head) {
  250. MO->Contents.Reg.Prev = MO;
  251. MO->Contents.Reg.Next = nullptr;
  252. HeadRef = MO;
  253. return;
  254. }
  255. assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
  256. // Insert MO between Last and Head in the circular Prev chain.
  257. MachineOperand *Last = Head->Contents.Reg.Prev;
  258. assert(Last && "Inconsistent use list");
  259. assert(MO->getReg() == Last->getReg() && "Different regs on the same list!");
  260. Head->Contents.Reg.Prev = MO;
  261. MO->Contents.Reg.Prev = Last;
  262. // Def operands always precede uses. This allows def_iterator to stop early.
  263. // Insert def operands at the front, and use operands at the back.
  264. if (MO->isDef()) {
  265. // Insert def at the front.
  266. MO->Contents.Reg.Next = Head;
  267. HeadRef = MO;
  268. } else {
  269. // Insert use at the end.
  270. MO->Contents.Reg.Next = nullptr;
  271. Last->Contents.Reg.Next = MO;
  272. }
  273. }
  274. /// Remove MO from its use-def list.
  275. void MachineRegisterInfo::removeRegOperandFromUseList(MachineOperand *MO) {
  276. assert(MO->isOnRegUseList() && "Operand not on use list");
  277. MachineOperand *&HeadRef = getRegUseDefListHead(MO->getReg());
  278. MachineOperand *const Head = HeadRef;
  279. assert(Head && "List already empty");
  280. // Unlink this from the doubly linked list of operands.
  281. MachineOperand *Next = MO->Contents.Reg.Next;
  282. MachineOperand *Prev = MO->Contents.Reg.Prev;
  283. // Prev links are circular, next link is NULL instead of looping back to Head.
  284. if (MO == Head)
  285. HeadRef = Next;
  286. else
  287. Prev->Contents.Reg.Next = Next;
  288. (Next ? Next : Head)->Contents.Reg.Prev = Prev;
  289. MO->Contents.Reg.Prev = nullptr;
  290. MO->Contents.Reg.Next = nullptr;
  291. }
  292. /// Move NumOps operands from Src to Dst, updating use-def lists as needed.
  293. ///
  294. /// The Dst range is assumed to be uninitialized memory. (Or it may contain
  295. /// operands that won't be destroyed, which is OK because the MO destructor is
  296. /// trivial anyway).
  297. ///
  298. /// The Src and Dst ranges may overlap.
  299. void MachineRegisterInfo::moveOperands(MachineOperand *Dst,
  300. MachineOperand *Src,
  301. unsigned NumOps) {
  302. assert(Src != Dst && NumOps && "Noop moveOperands");
  303. // Copy backwards if Dst is within the Src range.
  304. int Stride = 1;
  305. if (Dst >= Src && Dst < Src + NumOps) {
  306. Stride = -1;
  307. Dst += NumOps - 1;
  308. Src += NumOps - 1;
  309. }
  310. // Copy one operand at a time.
  311. do {
  312. new (Dst) MachineOperand(*Src);
  313. // Dst takes Src's place in the use-def chain.
  314. if (Src->isReg()) {
  315. MachineOperand *&Head = getRegUseDefListHead(Src->getReg());
  316. MachineOperand *Prev = Src->Contents.Reg.Prev;
  317. MachineOperand *Next = Src->Contents.Reg.Next;
  318. assert(Head && "List empty, but operand is chained");
  319. assert(Prev && "Operand was not on use-def list");
  320. // Prev links are circular, next link is NULL instead of looping back to
  321. // Head.
  322. if (Src == Head)
  323. Head = Dst;
  324. else
  325. Prev->Contents.Reg.Next = Dst;
  326. // Update Prev pointer. This also works when Src was pointing to itself
  327. // in a 1-element list. In that case Head == Dst.
  328. (Next ? Next : Head)->Contents.Reg.Prev = Dst;
  329. }
  330. Dst += Stride;
  331. Src += Stride;
  332. } while (--NumOps);
  333. }
  334. /// replaceRegWith - Replace all instances of FromReg with ToReg in the
  335. /// machine function. This is like llvm-level X->replaceAllUsesWith(Y),
  336. /// except that it also changes any definitions of the register as well.
  337. /// If ToReg is a physical register we apply the sub register to obtain the
  338. /// final/proper physical register.
  339. void MachineRegisterInfo::replaceRegWith(unsigned FromReg, unsigned ToReg) {
  340. assert(FromReg != ToReg && "Cannot replace a reg with itself");
  341. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  342. // TODO: This could be more efficient by bulk changing the operands.
  343. for (reg_iterator I = reg_begin(FromReg), E = reg_end(); I != E; ) {
  344. MachineOperand &O = *I;
  345. ++I;
  346. if (TargetRegisterInfo::isPhysicalRegister(ToReg)) {
  347. O.substPhysReg(ToReg, *TRI);
  348. } else {
  349. O.setReg(ToReg);
  350. }
  351. }
  352. }
  353. /// getVRegDef - Return the machine instr that defines the specified virtual
  354. /// register or null if none is found. This assumes that the code is in SSA
  355. /// form, so there should only be one definition.
  356. MachineInstr *MachineRegisterInfo::getVRegDef(unsigned Reg) const {
  357. // Since we are in SSA form, we can use the first definition.
  358. def_instr_iterator I = def_instr_begin(Reg);
  359. assert((I.atEnd() || std::next(I) == def_instr_end()) &&
  360. "getVRegDef assumes a single definition or no definition");
  361. return !I.atEnd() ? &*I : nullptr;
  362. }
  363. /// getUniqueVRegDef - Return the unique machine instr that defines the
  364. /// specified virtual register or null if none is found. If there are
  365. /// multiple definitions or no definition, return null.
  366. MachineInstr *MachineRegisterInfo::getUniqueVRegDef(unsigned Reg) const {
  367. if (def_empty(Reg)) return nullptr;
  368. def_instr_iterator I = def_instr_begin(Reg);
  369. if (std::next(I) != def_instr_end())
  370. return nullptr;
  371. return &*I;
  372. }
  373. bool MachineRegisterInfo::hasOneNonDBGUse(unsigned RegNo) const {
  374. use_nodbg_iterator UI = use_nodbg_begin(RegNo);
  375. if (UI == use_nodbg_end())
  376. return false;
  377. return ++UI == use_nodbg_end();
  378. }
  379. /// clearKillFlags - Iterate over all the uses of the given register and
  380. /// clear the kill flag from the MachineOperand. This function is used by
  381. /// optimization passes which extend register lifetimes and need only
  382. /// preserve conservative kill flag information.
  383. void MachineRegisterInfo::clearKillFlags(unsigned Reg) const {
  384. for (MachineOperand &MO : use_operands(Reg))
  385. MO.setIsKill(false);
  386. }
  387. bool MachineRegisterInfo::isLiveIn(unsigned Reg) const {
  388. for (livein_iterator I = livein_begin(), E = livein_end(); I != E; ++I)
  389. if (I->first == Reg || I->second == Reg)
  390. return true;
  391. return false;
  392. }
  393. /// getLiveInPhysReg - If VReg is a live-in virtual register, return the
  394. /// corresponding live-in physical register.
  395. unsigned MachineRegisterInfo::getLiveInPhysReg(unsigned VReg) const {
  396. for (livein_iterator I = livein_begin(), E = livein_end(); I != E; ++I)
  397. if (I->second == VReg)
  398. return I->first;
  399. return 0;
  400. }
  401. /// getLiveInVirtReg - If PReg is a live-in physical register, return the
  402. /// corresponding live-in physical register.
  403. unsigned MachineRegisterInfo::getLiveInVirtReg(unsigned PReg) const {
  404. for (livein_iterator I = livein_begin(), E = livein_end(); I != E; ++I)
  405. if (I->first == PReg)
  406. return I->second;
  407. return 0;
  408. }
  409. /// EmitLiveInCopies - Emit copies to initialize livein virtual registers
  410. /// into the given entry block.
  411. void
  412. MachineRegisterInfo::EmitLiveInCopies(MachineBasicBlock *EntryMBB,
  413. const TargetRegisterInfo &TRI,
  414. const TargetInstrInfo &TII) {
  415. // Emit the copies into the top of the block.
  416. for (unsigned i = 0, e = LiveIns.size(); i != e; ++i)
  417. if (LiveIns[i].second) {
  418. if (use_nodbg_empty(LiveIns[i].second)) {
  419. // The livein has no non-dbg uses. Drop it.
  420. //
  421. // It would be preferable to have isel avoid creating live-in
  422. // records for unused arguments in the first place, but it's
  423. // complicated by the debug info code for arguments.
  424. LiveIns.erase(LiveIns.begin() + i);
  425. --i; --e;
  426. } else {
  427. // Emit a copy.
  428. BuildMI(*EntryMBB, EntryMBB->begin(), DebugLoc(),
  429. TII.get(TargetOpcode::COPY), LiveIns[i].second)
  430. .addReg(LiveIns[i].first);
  431. // Add the register to the entry block live-in set.
  432. EntryMBB->addLiveIn(LiveIns[i].first);
  433. }
  434. } else {
  435. // Add the register to the entry block live-in set.
  436. EntryMBB->addLiveIn(LiveIns[i].first);
  437. }
  438. }
  439. LaneBitmask MachineRegisterInfo::getMaxLaneMaskForVReg(unsigned Reg) const {
  440. // Lane masks are only defined for vregs.
  441. assert(TargetRegisterInfo::isVirtualRegister(Reg));
  442. const TargetRegisterClass &TRC = *getRegClass(Reg);
  443. return TRC.getLaneMask();
  444. }
  445. #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
  446. LLVM_DUMP_METHOD void MachineRegisterInfo::dumpUses(unsigned Reg) const {
  447. for (MachineInstr &I : use_instructions(Reg))
  448. I.dump();
  449. }
  450. #endif
  451. void MachineRegisterInfo::freezeReservedRegs(const MachineFunction &MF) {
  452. ReservedRegs = getTargetRegisterInfo()->getReservedRegs(MF);
  453. assert(ReservedRegs.size() == getTargetRegisterInfo()->getNumRegs() &&
  454. "Invalid ReservedRegs vector from target");
  455. }
  456. bool MachineRegisterInfo::isConstantPhysReg(unsigned PhysReg) const {
  457. assert(TargetRegisterInfo::isPhysicalRegister(PhysReg));
  458. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  459. if (TRI->isConstantPhysReg(PhysReg))
  460. return true;
  461. // Check if any overlapping register is modified, or allocatable so it may be
  462. // used later.
  463. for (MCRegAliasIterator AI(PhysReg, TRI, true);
  464. AI.isValid(); ++AI)
  465. if (!def_empty(*AI) || isAllocatable(*AI))
  466. return false;
  467. return true;
  468. }
  469. bool
  470. MachineRegisterInfo::isCallerPreservedOrConstPhysReg(unsigned PhysReg) const {
  471. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  472. return isConstantPhysReg(PhysReg) ||
  473. TRI->isCallerPreservedPhysReg(PhysReg, *MF);
  474. }
  475. /// markUsesInDebugValueAsUndef - Mark every DBG_VALUE referencing the
  476. /// specified register as undefined which causes the DBG_VALUE to be
  477. /// deleted during LiveDebugVariables analysis.
  478. void MachineRegisterInfo::markUsesInDebugValueAsUndef(unsigned Reg) const {
  479. // Mark any DBG_VALUE that uses Reg as undef (but don't delete it.)
  480. MachineRegisterInfo::use_instr_iterator nextI;
  481. for (use_instr_iterator I = use_instr_begin(Reg), E = use_instr_end();
  482. I != E; I = nextI) {
  483. nextI = std::next(I); // I is invalidated by the setReg
  484. MachineInstr *UseMI = &*I;
  485. if (UseMI->isDebugValue())
  486. UseMI->getOperand(0).setReg(0U);
  487. }
  488. }
  489. static const Function *getCalledFunction(const MachineInstr &MI) {
  490. for (const MachineOperand &MO : MI.operands()) {
  491. if (!MO.isGlobal())
  492. continue;
  493. const Function *Func = dyn_cast<Function>(MO.getGlobal());
  494. if (Func != nullptr)
  495. return Func;
  496. }
  497. return nullptr;
  498. }
  499. static bool isNoReturnDef(const MachineOperand &MO) {
  500. // Anything which is not a noreturn function is a real def.
  501. const MachineInstr &MI = *MO.getParent();
  502. if (!MI.isCall())
  503. return false;
  504. const MachineBasicBlock &MBB = *MI.getParent();
  505. if (!MBB.succ_empty())
  506. return false;
  507. const MachineFunction &MF = *MBB.getParent();
  508. // We need to keep correct unwind information even if the function will
  509. // not return, since the runtime may need it.
  510. if (MF.getFunction().hasFnAttribute(Attribute::UWTable))
  511. return false;
  512. const Function *Called = getCalledFunction(MI);
  513. return !(Called == nullptr || !Called->hasFnAttribute(Attribute::NoReturn) ||
  514. !Called->hasFnAttribute(Attribute::NoUnwind));
  515. }
  516. bool MachineRegisterInfo::isPhysRegModified(unsigned PhysReg,
  517. bool SkipNoReturnDef) const {
  518. if (UsedPhysRegMask.test(PhysReg))
  519. return true;
  520. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  521. for (MCRegAliasIterator AI(PhysReg, TRI, true); AI.isValid(); ++AI) {
  522. for (const MachineOperand &MO : make_range(def_begin(*AI), def_end())) {
  523. if (!SkipNoReturnDef && isNoReturnDef(MO))
  524. continue;
  525. return true;
  526. }
  527. }
  528. return false;
  529. }
  530. bool MachineRegisterInfo::isPhysRegUsed(unsigned PhysReg) const {
  531. if (UsedPhysRegMask.test(PhysReg))
  532. return true;
  533. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  534. for (MCRegAliasIterator AliasReg(PhysReg, TRI, true); AliasReg.isValid();
  535. ++AliasReg) {
  536. if (!reg_nodbg_empty(*AliasReg))
  537. return true;
  538. }
  539. return false;
  540. }
  541. void MachineRegisterInfo::disableCalleeSavedRegister(unsigned Reg) {
  542. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  543. assert(Reg && (Reg < TRI->getNumRegs()) &&
  544. "Trying to disable an invalid register");
  545. if (!IsUpdatedCSRsInitialized) {
  546. const MCPhysReg *CSR = TRI->getCalleeSavedRegs(MF);
  547. for (const MCPhysReg *I = CSR; *I; ++I)
  548. UpdatedCSRs.push_back(*I);
  549. // Zero value represents the end of the register list
  550. // (no more registers should be pushed).
  551. UpdatedCSRs.push_back(0);
  552. IsUpdatedCSRsInitialized = true;
  553. }
  554. // Remove the register (and its aliases from the list).
  555. for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI)
  556. UpdatedCSRs.erase(std::remove(UpdatedCSRs.begin(), UpdatedCSRs.end(), *AI),
  557. UpdatedCSRs.end());
  558. }
  559. const MCPhysReg *MachineRegisterInfo::getCalleeSavedRegs() const {
  560. if (IsUpdatedCSRsInitialized)
  561. return UpdatedCSRs.data();
  562. return getTargetRegisterInfo()->getCalleeSavedRegs(MF);
  563. }
  564. void MachineRegisterInfo::setCalleeSavedRegs(ArrayRef<MCPhysReg> CSRs) {
  565. if (IsUpdatedCSRsInitialized)
  566. UpdatedCSRs.clear();
  567. for (MCPhysReg Reg : CSRs)
  568. UpdatedCSRs.push_back(Reg);
  569. // Zero value represents the end of the register list
  570. // (no more registers should be pushed).
  571. UpdatedCSRs.push_back(0);
  572. IsUpdatedCSRsInitialized = true;
  573. }
  574. bool MachineRegisterInfo::isReservedRegUnit(unsigned Unit) const {
  575. const TargetRegisterInfo *TRI = getTargetRegisterInfo();
  576. for (MCRegUnitRootIterator Root(Unit, TRI); Root.isValid(); ++Root) {
  577. bool IsRootReserved = true;
  578. for (MCSuperRegIterator Super(*Root, TRI, /*IncludeSelf=*/true);
  579. Super.isValid(); ++Super) {
  580. unsigned Reg = *Super;
  581. if (!isReserved(Reg)) {
  582. IsRootReserved = false;
  583. break;
  584. }
  585. }
  586. if (IsRootReserved)
  587. return true;
  588. }
  589. return false;
  590. }