MachineVerifier.cpp 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696
  1. //===-- MachineVerifier.cpp - Machine Code Verifier -------------*- C++ -*-===//
  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. // Pass to verify generated machine code. The following is checked:
  11. //
  12. // Operand counts: All explicit operands must be present.
  13. //
  14. // Register classes: All physical and virtual register operands must be
  15. // compatible with the register class required by the instruction descriptor.
  16. //
  17. // Register live intervals: Registers must be defined only once, and must be
  18. // defined before use.
  19. //
  20. // The machine code verifier is enabled from LLVMTargetMachine.cpp with the
  21. // command-line option -verify-machineinstrs, or by defining the environment
  22. // variable LLVM_VERIFY_MACHINEINSTRS to the name of a file that will receive
  23. // the verifier errors.
  24. //===----------------------------------------------------------------------===//
  25. #include "llvm/ADT/DenseSet.h"
  26. #include "llvm/ADT/SetOperations.h"
  27. #include "llvm/ADT/SmallVector.h"
  28. #include "llvm/Function.h"
  29. #include "llvm/CodeGen/LiveVariables.h"
  30. #include "llvm/CodeGen/MachineFunctionPass.h"
  31. #include "llvm/CodeGen/MachineRegisterInfo.h"
  32. #include "llvm/CodeGen/Passes.h"
  33. #include "llvm/Target/TargetMachine.h"
  34. #include "llvm/Target/TargetRegisterInfo.h"
  35. #include "llvm/Target/TargetInstrInfo.h"
  36. #include "llvm/Support/Compiler.h"
  37. #include "llvm/Support/Debug.h"
  38. #include "llvm/Support/ErrorHandling.h"
  39. #include "llvm/Support/raw_ostream.h"
  40. #include <fstream>
  41. using namespace llvm;
  42. namespace {
  43. struct VISIBILITY_HIDDEN MachineVerifier : public MachineFunctionPass {
  44. static char ID; // Pass ID, replacement for typeid
  45. MachineVerifier(bool allowDoubleDefs = false) :
  46. MachineFunctionPass(&ID),
  47. allowVirtDoubleDefs(allowDoubleDefs),
  48. allowPhysDoubleDefs(allowDoubleDefs),
  49. OutFileName(getenv("LLVM_VERIFY_MACHINEINSTRS"))
  50. {}
  51. void getAnalysisUsage(AnalysisUsage &AU) const {
  52. AU.setPreservesAll();
  53. MachineFunctionPass::getAnalysisUsage(AU);
  54. }
  55. bool runOnMachineFunction(MachineFunction &MF);
  56. const bool allowVirtDoubleDefs;
  57. const bool allowPhysDoubleDefs;
  58. const char *const OutFileName;
  59. std::ostream *OS;
  60. const MachineFunction *MF;
  61. const TargetMachine *TM;
  62. const TargetRegisterInfo *TRI;
  63. const MachineRegisterInfo *MRI;
  64. unsigned foundErrors;
  65. typedef SmallVector<unsigned, 16> RegVector;
  66. typedef DenseSet<unsigned> RegSet;
  67. typedef DenseMap<unsigned, const MachineInstr*> RegMap;
  68. BitVector regsReserved;
  69. RegSet regsLive;
  70. RegVector regsDefined, regsImpDefined, regsDead, regsKilled;
  71. // Add Reg and any sub-registers to RV
  72. void addRegWithSubRegs(RegVector &RV, unsigned Reg) {
  73. RV.push_back(Reg);
  74. if (TargetRegisterInfo::isPhysicalRegister(Reg))
  75. for (const unsigned *R = TRI->getSubRegisters(Reg); *R; R++)
  76. RV.push_back(*R);
  77. }
  78. // Does RS contain any super-registers of Reg?
  79. bool anySuperRegisters(const RegSet &RS, unsigned Reg) {
  80. for (const unsigned *R = TRI->getSuperRegisters(Reg); *R; R++)
  81. if (RS.count(*R))
  82. return true;
  83. return false;
  84. }
  85. struct BBInfo {
  86. // Is this MBB reachable from the MF entry point?
  87. bool reachable;
  88. // Vregs that must be live in because they are used without being
  89. // defined. Map value is the user.
  90. RegMap vregsLiveIn;
  91. // Vregs that must be dead in because they are defined without being
  92. // killed first. Map value is the defining instruction.
  93. RegMap vregsDeadIn;
  94. // Regs killed in MBB. They may be defined again, and will then be in both
  95. // regsKilled and regsLiveOut.
  96. RegSet regsKilled;
  97. // Regs defined in MBB and live out. Note that vregs passing through may
  98. // be live out without being mentioned here.
  99. RegSet regsLiveOut;
  100. // Vregs that pass through MBB untouched. This set is disjoint from
  101. // regsKilled and regsLiveOut.
  102. RegSet vregsPassed;
  103. BBInfo() : reachable(false) {}
  104. // Add register to vregsPassed if it belongs there. Return true if
  105. // anything changed.
  106. bool addPassed(unsigned Reg) {
  107. if (!TargetRegisterInfo::isVirtualRegister(Reg))
  108. return false;
  109. if (regsKilled.count(Reg) || regsLiveOut.count(Reg))
  110. return false;
  111. return vregsPassed.insert(Reg).second;
  112. }
  113. // Same for a full set.
  114. bool addPassed(const RegSet &RS) {
  115. bool changed = false;
  116. for (RegSet::const_iterator I = RS.begin(), E = RS.end(); I != E; ++I)
  117. if (addPassed(*I))
  118. changed = true;
  119. return changed;
  120. }
  121. // Live-out registers are either in regsLiveOut or vregsPassed.
  122. bool isLiveOut(unsigned Reg) const {
  123. return regsLiveOut.count(Reg) || vregsPassed.count(Reg);
  124. }
  125. };
  126. // Extra register info per MBB.
  127. DenseMap<const MachineBasicBlock*, BBInfo> MBBInfoMap;
  128. bool isReserved(unsigned Reg) {
  129. return Reg < regsReserved.size() && regsReserved[Reg];
  130. }
  131. void visitMachineFunctionBefore();
  132. void visitMachineBasicBlockBefore(const MachineBasicBlock *MBB);
  133. void visitMachineInstrBefore(const MachineInstr *MI);
  134. void visitMachineOperand(const MachineOperand *MO, unsigned MONum);
  135. void visitMachineInstrAfter(const MachineInstr *MI);
  136. void visitMachineBasicBlockAfter(const MachineBasicBlock *MBB);
  137. void visitMachineFunctionAfter();
  138. void report(const char *msg, const MachineFunction *MF);
  139. void report(const char *msg, const MachineBasicBlock *MBB);
  140. void report(const char *msg, const MachineInstr *MI);
  141. void report(const char *msg, const MachineOperand *MO, unsigned MONum);
  142. void markReachable(const MachineBasicBlock *MBB);
  143. void calcMaxRegsPassed();
  144. void calcMinRegsPassed();
  145. void checkPHIOps(const MachineBasicBlock *MBB);
  146. };
  147. }
  148. char MachineVerifier::ID = 0;
  149. static RegisterPass<MachineVerifier>
  150. MachineVer("machineverifier", "Verify generated machine code");
  151. static const PassInfo *const MachineVerifyID = &MachineVer;
  152. FunctionPass *
  153. llvm::createMachineVerifierPass(bool allowPhysDoubleDefs)
  154. {
  155. return new MachineVerifier(allowPhysDoubleDefs);
  156. }
  157. bool
  158. MachineVerifier::runOnMachineFunction(MachineFunction &MF)
  159. {
  160. std::ofstream OutFile;
  161. if (OutFileName) {
  162. OutFile.open(OutFileName, std::ios::out | std::ios::app);
  163. OS = &OutFile;
  164. } else {
  165. OS = cerr.stream();
  166. }
  167. foundErrors = 0;
  168. this->MF = &MF;
  169. TM = &MF.getTarget();
  170. TRI = TM->getRegisterInfo();
  171. MRI = &MF.getRegInfo();
  172. visitMachineFunctionBefore();
  173. for (MachineFunction::const_iterator MFI = MF.begin(), MFE = MF.end();
  174. MFI!=MFE; ++MFI) {
  175. visitMachineBasicBlockBefore(MFI);
  176. for (MachineBasicBlock::const_iterator MBBI = MFI->begin(),
  177. MBBE = MFI->end(); MBBI != MBBE; ++MBBI) {
  178. visitMachineInstrBefore(MBBI);
  179. for (unsigned I = 0, E = MBBI->getNumOperands(); I != E; ++I)
  180. visitMachineOperand(&MBBI->getOperand(I), I);
  181. visitMachineInstrAfter(MBBI);
  182. }
  183. visitMachineBasicBlockAfter(MFI);
  184. }
  185. visitMachineFunctionAfter();
  186. if (OutFileName)
  187. OutFile.close();
  188. else if (foundErrors) {
  189. std::string msg;
  190. raw_string_ostream Msg(msg);
  191. Msg << "Found " << foundErrors << " machine code errors.";
  192. llvm_report_error(Msg.str());
  193. }
  194. return false; // no changes
  195. }
  196. void
  197. MachineVerifier::report(const char *msg, const MachineFunction *MF)
  198. {
  199. assert(MF);
  200. *OS << "\n";
  201. if (!foundErrors++)
  202. MF->print(OS);
  203. *OS << "*** Bad machine code: " << msg << " ***\n"
  204. << "- function: " << MF->getFunction()->getNameStr() << "\n";
  205. }
  206. void
  207. MachineVerifier::report(const char *msg, const MachineBasicBlock *MBB)
  208. {
  209. assert(MBB);
  210. report(msg, MBB->getParent());
  211. *OS << "- basic block: " << MBB->getBasicBlock()->getNameStr()
  212. << " " << (void*)MBB
  213. << " (#" << MBB->getNumber() << ")\n";
  214. }
  215. void
  216. MachineVerifier::report(const char *msg, const MachineInstr *MI)
  217. {
  218. assert(MI);
  219. report(msg, MI->getParent());
  220. *OS << "- instruction: ";
  221. MI->print(OS, TM);
  222. }
  223. void
  224. MachineVerifier::report(const char *msg,
  225. const MachineOperand *MO, unsigned MONum)
  226. {
  227. assert(MO);
  228. report(msg, MO->getParent());
  229. *OS << "- operand " << MONum << ": ";
  230. MO->print(*OS, TM);
  231. *OS << "\n";
  232. }
  233. void
  234. MachineVerifier::markReachable(const MachineBasicBlock *MBB)
  235. {
  236. BBInfo &MInfo = MBBInfoMap[MBB];
  237. if (!MInfo.reachable) {
  238. MInfo.reachable = true;
  239. for (MachineBasicBlock::const_succ_iterator SuI = MBB->succ_begin(),
  240. SuE = MBB->succ_end(); SuI != SuE; ++SuI)
  241. markReachable(*SuI);
  242. }
  243. }
  244. void
  245. MachineVerifier::visitMachineFunctionBefore()
  246. {
  247. regsReserved = TRI->getReservedRegs(*MF);
  248. markReachable(&MF->front());
  249. }
  250. void
  251. MachineVerifier::visitMachineBasicBlockBefore(const MachineBasicBlock *MBB)
  252. {
  253. regsLive.clear();
  254. for (MachineBasicBlock::const_livein_iterator I = MBB->livein_begin(),
  255. E = MBB->livein_end(); I != E; ++I) {
  256. if (!TargetRegisterInfo::isPhysicalRegister(*I)) {
  257. report("MBB live-in list contains non-physical register", MBB);
  258. continue;
  259. }
  260. regsLive.insert(*I);
  261. for (const unsigned *R = TRI->getSubRegisters(*I); *R; R++)
  262. regsLive.insert(*R);
  263. }
  264. regsKilled.clear();
  265. regsDefined.clear();
  266. regsImpDefined.clear();
  267. }
  268. void
  269. MachineVerifier::visitMachineInstrBefore(const MachineInstr *MI)
  270. {
  271. const TargetInstrDesc &TI = MI->getDesc();
  272. if (MI->getNumExplicitOperands() < TI.getNumOperands()) {
  273. report("Too few operands", MI);
  274. *OS << TI.getNumOperands() << " operands expected, but "
  275. << MI->getNumExplicitOperands() << " given.\n";
  276. }
  277. if (!TI.isVariadic()) {
  278. if (MI->getNumExplicitOperands() > TI.getNumOperands()) {
  279. report("Too many operands", MI);
  280. *OS << TI.getNumOperands() << " operands expected, but "
  281. << MI->getNumExplicitOperands() << " given.\n";
  282. }
  283. }
  284. }
  285. void
  286. MachineVerifier::visitMachineOperand(const MachineOperand *MO, unsigned MONum)
  287. {
  288. const MachineInstr *MI = MO->getParent();
  289. const TargetInstrDesc &TI = MI->getDesc();
  290. // The first TI.NumDefs operands must be explicit register defines
  291. if (MONum < TI.getNumDefs()) {
  292. if (!MO->isReg())
  293. report("Explicit definition must be a register", MO, MONum);
  294. else if (!MO->isDef())
  295. report("Explicit definition marked as use", MO, MONum);
  296. else if (MO->isImplicit())
  297. report("Explicit definition marked as implicit", MO, MONum);
  298. }
  299. switch (MO->getType()) {
  300. case MachineOperand::MO_Register: {
  301. const unsigned Reg = MO->getReg();
  302. if (!Reg)
  303. return;
  304. // Check Live Variables.
  305. if (MO->isUse()) {
  306. if (MO->isKill()) {
  307. addRegWithSubRegs(regsKilled, Reg);
  308. // Tied operands on two-address instuctions MUST NOT have a <kill> flag.
  309. if (MI->isRegTiedToDefOperand(MONum))
  310. report("Illegal kill flag on two-address instruction operand",
  311. MO, MONum);
  312. } else {
  313. // TwoAddress instr modifying a reg is treated as kill+def.
  314. unsigned defIdx;
  315. if (MI->isRegTiedToDefOperand(MONum, &defIdx) &&
  316. MI->getOperand(defIdx).getReg() == Reg)
  317. addRegWithSubRegs(regsKilled, Reg);
  318. }
  319. // Explicit use of a dead register.
  320. if (!MO->isImplicit() && !regsLive.count(Reg)) {
  321. if (TargetRegisterInfo::isPhysicalRegister(Reg)) {
  322. // Reserved registers may be used even when 'dead'.
  323. if (!isReserved(Reg))
  324. report("Using an undefined physical register", MO, MONum);
  325. } else {
  326. BBInfo &MInfo = MBBInfoMap[MI->getParent()];
  327. // We don't know which virtual registers are live in, so only complain
  328. // if vreg was killed in this MBB. Otherwise keep track of vregs that
  329. // must be live in. PHI instructions are handled separately.
  330. if (MInfo.regsKilled.count(Reg))
  331. report("Using a killed virtual register", MO, MONum);
  332. else if (MI->getOpcode() != TargetInstrInfo::PHI)
  333. MInfo.vregsLiveIn.insert(std::make_pair(Reg, MI));
  334. }
  335. }
  336. } else {
  337. // Register defined.
  338. // TODO: verify that earlyclobber ops are not used.
  339. if (MO->isImplicit())
  340. addRegWithSubRegs(regsImpDefined, Reg);
  341. else
  342. addRegWithSubRegs(regsDefined, Reg);
  343. if (MO->isDead())
  344. addRegWithSubRegs(regsDead, Reg);
  345. }
  346. // Check register classes.
  347. if (MONum < TI.getNumOperands() && !MO->isImplicit()) {
  348. const TargetOperandInfo &TOI = TI.OpInfo[MONum];
  349. unsigned SubIdx = MO->getSubReg();
  350. if (TargetRegisterInfo::isPhysicalRegister(Reg)) {
  351. unsigned sr = Reg;
  352. if (SubIdx) {
  353. unsigned s = TRI->getSubReg(Reg, SubIdx);
  354. if (!s) {
  355. report("Invalid subregister index for physical register",
  356. MO, MONum);
  357. return;
  358. }
  359. sr = s;
  360. }
  361. if (const TargetRegisterClass *DRC = TOI.getRegClass(TRI)) {
  362. if (!DRC->contains(sr)) {
  363. report("Illegal physical register for instruction", MO, MONum);
  364. *OS << TRI->getName(sr) << " is not a "
  365. << DRC->getName() << " register.\n";
  366. }
  367. }
  368. } else {
  369. // Virtual register.
  370. const TargetRegisterClass *RC = MRI->getRegClass(Reg);
  371. if (SubIdx) {
  372. if (RC->subregclasses_begin()+SubIdx >= RC->subregclasses_end()) {
  373. report("Invalid subregister index for virtual register", MO, MONum);
  374. return;
  375. }
  376. RC = *(RC->subregclasses_begin()+SubIdx);
  377. }
  378. if (const TargetRegisterClass *DRC = TOI.getRegClass(TRI)) {
  379. if (RC != DRC && !RC->hasSuperClass(DRC)) {
  380. report("Illegal virtual register for instruction", MO, MONum);
  381. *OS << "Expected a " << DRC->getName() << " register, but got a "
  382. << RC->getName() << " register\n";
  383. }
  384. }
  385. }
  386. }
  387. break;
  388. }
  389. // Can PHI instrs refer to MBBs not in the CFG? X86 and ARM do.
  390. // case MachineOperand::MO_MachineBasicBlock:
  391. // if (MI->getOpcode() == TargetInstrInfo::PHI) {
  392. // if (!MO->getMBB()->isSuccessor(MI->getParent()))
  393. // report("PHI operand is not in the CFG", MO, MONum);
  394. // }
  395. // break;
  396. default:
  397. break;
  398. }
  399. }
  400. void
  401. MachineVerifier::visitMachineInstrAfter(const MachineInstr *MI)
  402. {
  403. BBInfo &MInfo = MBBInfoMap[MI->getParent()];
  404. set_union(MInfo.regsKilled, regsKilled);
  405. set_subtract(regsLive, regsKilled);
  406. regsKilled.clear();
  407. for (RegVector::const_iterator I = regsDefined.begin(),
  408. E = regsDefined.end(); I != E; ++I) {
  409. if (regsLive.count(*I)) {
  410. if (TargetRegisterInfo::isPhysicalRegister(*I)) {
  411. // We allow double defines to physical registers with live
  412. // super-registers.
  413. if (!allowPhysDoubleDefs && !isReserved(*I) &&
  414. !anySuperRegisters(regsLive, *I)) {
  415. report("Redefining a live physical register", MI);
  416. *OS << "Register " << TRI->getName(*I)
  417. << " was defined but already live.\n";
  418. }
  419. } else {
  420. if (!allowVirtDoubleDefs) {
  421. report("Redefining a live virtual register", MI);
  422. *OS << "Virtual register %reg" << *I
  423. << " was defined but already live.\n";
  424. }
  425. }
  426. } else if (TargetRegisterInfo::isVirtualRegister(*I) &&
  427. !MInfo.regsKilled.count(*I)) {
  428. // Virtual register defined without being killed first must be dead on
  429. // entry.
  430. MInfo.vregsDeadIn.insert(std::make_pair(*I, MI));
  431. }
  432. }
  433. set_union(regsLive, regsDefined); regsDefined.clear();
  434. set_union(regsLive, regsImpDefined); regsImpDefined.clear();
  435. set_subtract(regsLive, regsDead); regsDead.clear();
  436. }
  437. void
  438. MachineVerifier::visitMachineBasicBlockAfter(const MachineBasicBlock *MBB)
  439. {
  440. MBBInfoMap[MBB].regsLiveOut = regsLive;
  441. regsLive.clear();
  442. }
  443. // Calculate the largest possible vregsPassed sets. These are the registers that
  444. // can pass through an MBB live, but may not be live every time. It is assumed
  445. // that all vregsPassed sets are empty before the call.
  446. void
  447. MachineVerifier::calcMaxRegsPassed()
  448. {
  449. // First push live-out regs to successors' vregsPassed. Remember the MBBs that
  450. // have any vregsPassed.
  451. DenseSet<const MachineBasicBlock*> todo;
  452. for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
  453. MFI != MFE; ++MFI) {
  454. const MachineBasicBlock &MBB(*MFI);
  455. BBInfo &MInfo = MBBInfoMap[&MBB];
  456. if (!MInfo.reachable)
  457. continue;
  458. for (MachineBasicBlock::const_succ_iterator SuI = MBB.succ_begin(),
  459. SuE = MBB.succ_end(); SuI != SuE; ++SuI) {
  460. BBInfo &SInfo = MBBInfoMap[*SuI];
  461. if (SInfo.addPassed(MInfo.regsLiveOut))
  462. todo.insert(*SuI);
  463. }
  464. }
  465. // Iteratively push vregsPassed to successors. This will converge to the same
  466. // final state regardless of DenseSet iteration order.
  467. while (!todo.empty()) {
  468. const MachineBasicBlock *MBB = *todo.begin();
  469. todo.erase(MBB);
  470. BBInfo &MInfo = MBBInfoMap[MBB];
  471. for (MachineBasicBlock::const_succ_iterator SuI = MBB->succ_begin(),
  472. SuE = MBB->succ_end(); SuI != SuE; ++SuI) {
  473. if (*SuI == MBB)
  474. continue;
  475. BBInfo &SInfo = MBBInfoMap[*SuI];
  476. if (SInfo.addPassed(MInfo.vregsPassed))
  477. todo.insert(*SuI);
  478. }
  479. }
  480. }
  481. // Calculate the minimum vregsPassed set. These are the registers that always
  482. // pass live through an MBB. The calculation assumes that calcMaxRegsPassed has
  483. // been called earlier.
  484. void
  485. MachineVerifier::calcMinRegsPassed()
  486. {
  487. DenseSet<const MachineBasicBlock*> todo;
  488. for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
  489. MFI != MFE; ++MFI)
  490. todo.insert(MFI);
  491. while (!todo.empty()) {
  492. const MachineBasicBlock *MBB = *todo.begin();
  493. todo.erase(MBB);
  494. BBInfo &MInfo = MBBInfoMap[MBB];
  495. // Remove entries from vRegsPassed that are not live out from all
  496. // reachable predecessors.
  497. RegSet dead;
  498. for (RegSet::iterator I = MInfo.vregsPassed.begin(),
  499. E = MInfo.vregsPassed.end(); I != E; ++I) {
  500. for (MachineBasicBlock::const_pred_iterator PrI = MBB->pred_begin(),
  501. PrE = MBB->pred_end(); PrI != PrE; ++PrI) {
  502. BBInfo &PrInfo = MBBInfoMap[*PrI];
  503. if (PrInfo.reachable && !PrInfo.isLiveOut(*I)) {
  504. dead.insert(*I);
  505. break;
  506. }
  507. }
  508. }
  509. // If any regs removed, we need to recheck successors.
  510. if (!dead.empty()) {
  511. set_subtract(MInfo.vregsPassed, dead);
  512. todo.insert(MBB->succ_begin(), MBB->succ_end());
  513. }
  514. }
  515. }
  516. // Check PHI instructions at the beginning of MBB. It is assumed that
  517. // calcMinRegsPassed has been run so BBInfo::isLiveOut is valid.
  518. void
  519. MachineVerifier::checkPHIOps(const MachineBasicBlock *MBB)
  520. {
  521. for (MachineBasicBlock::const_iterator BBI = MBB->begin(), BBE = MBB->end();
  522. BBI != BBE && BBI->getOpcode() == TargetInstrInfo::PHI; ++BBI) {
  523. DenseSet<const MachineBasicBlock*> seen;
  524. for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) {
  525. unsigned Reg = BBI->getOperand(i).getReg();
  526. const MachineBasicBlock *Pre = BBI->getOperand(i + 1).getMBB();
  527. if (!Pre->isSuccessor(MBB))
  528. continue;
  529. seen.insert(Pre);
  530. BBInfo &PrInfo = MBBInfoMap[Pre];
  531. if (PrInfo.reachable && !PrInfo.isLiveOut(Reg))
  532. report("PHI operand is not live-out from predecessor",
  533. &BBI->getOperand(i), i);
  534. }
  535. // Did we see all predecessors?
  536. for (MachineBasicBlock::const_pred_iterator PrI = MBB->pred_begin(),
  537. PrE = MBB->pred_end(); PrI != PrE; ++PrI) {
  538. if (!seen.count(*PrI)) {
  539. report("Missing PHI operand", BBI);
  540. *OS << "MBB #" << (*PrI)->getNumber()
  541. << " is a predecessor according to the CFG.\n";
  542. }
  543. }
  544. }
  545. }
  546. void
  547. MachineVerifier::visitMachineFunctionAfter()
  548. {
  549. calcMaxRegsPassed();
  550. // With the maximal set of vregsPassed we can verify dead-in registers.
  551. for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
  552. MFI != MFE; ++MFI) {
  553. BBInfo &MInfo = MBBInfoMap[MFI];
  554. // Skip unreachable MBBs.
  555. if (!MInfo.reachable)
  556. continue;
  557. for (MachineBasicBlock::const_pred_iterator PrI = MFI->pred_begin(),
  558. PrE = MFI->pred_end(); PrI != PrE; ++PrI) {
  559. BBInfo &PrInfo = MBBInfoMap[*PrI];
  560. if (!PrInfo.reachable)
  561. continue;
  562. // Verify physical live-ins. EH landing pads have magic live-ins so we
  563. // ignore them.
  564. if (!MFI->isLandingPad()) {
  565. for (MachineBasicBlock::const_livein_iterator I = MFI->livein_begin(),
  566. E = MFI->livein_end(); I != E; ++I) {
  567. if (TargetRegisterInfo::isPhysicalRegister(*I) &&
  568. !isReserved (*I) && !PrInfo.isLiveOut(*I)) {
  569. report("Live-in physical register is not live-out from predecessor",
  570. MFI);
  571. *OS << "Register " << TRI->getName(*I)
  572. << " is not live-out from MBB #" << (*PrI)->getNumber()
  573. << ".\n";
  574. }
  575. }
  576. }
  577. // Verify dead-in virtual registers.
  578. if (!allowVirtDoubleDefs) {
  579. for (RegMap::iterator I = MInfo.vregsDeadIn.begin(),
  580. E = MInfo.vregsDeadIn.end(); I != E; ++I) {
  581. // DeadIn register must be in neither regsLiveOut or vregsPassed of
  582. // any predecessor.
  583. if (PrInfo.isLiveOut(I->first)) {
  584. report("Live-in virtual register redefined", I->second);
  585. *OS << "Register %reg" << I->first
  586. << " was live-out from predecessor MBB #"
  587. << (*PrI)->getNumber() << ".\n";
  588. }
  589. }
  590. }
  591. }
  592. }
  593. calcMinRegsPassed();
  594. // With the minimal set of vregsPassed we can verify live-in virtual
  595. // registers, including PHI instructions.
  596. for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
  597. MFI != MFE; ++MFI) {
  598. BBInfo &MInfo = MBBInfoMap[MFI];
  599. // Skip unreachable MBBs.
  600. if (!MInfo.reachable)
  601. continue;
  602. checkPHIOps(MFI);
  603. for (MachineBasicBlock::const_pred_iterator PrI = MFI->pred_begin(),
  604. PrE = MFI->pred_end(); PrI != PrE; ++PrI) {
  605. BBInfo &PrInfo = MBBInfoMap[*PrI];
  606. if (!PrInfo.reachable)
  607. continue;
  608. for (RegMap::iterator I = MInfo.vregsLiveIn.begin(),
  609. E = MInfo.vregsLiveIn.end(); I != E; ++I) {
  610. if (!PrInfo.isLiveOut(I->first)) {
  611. report("Used virtual register is not live-in", I->second);
  612. *OS << "Register %reg" << I->first
  613. << " is not live-out from predecessor MBB #"
  614. << (*PrI)->getNumber()
  615. << ".\n";
  616. }
  617. }
  618. }
  619. }
  620. }