blob: 98993b2146e41e157f18245b8e93effc5980c370 [file] [log] [blame]
Eugene Zelenko4e9736b2017-05-31 01:10:10 +00001//===- lib/CodeGen/MachineInstr.cpp ---------------------------------------===//
Misha Brukman835702a2005-04-21 22:36:52 +00002//
John Criswell482202a2003-10-20 19:43:21 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattnerf3ebc3f2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukman835702a2005-04-21 22:36:52 +00007//
John Criswell482202a2003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
Brian Gaekee8f7c2f2004-02-13 04:39:32 +00009//
10// Methods common to all machine instructions.
11//
Chris Lattner959a5fb2002-08-09 20:08:06 +000012//===----------------------------------------------------------------------===//
Vikram S. Adveab9e5572001-07-21 12:41:50 +000013
Chandler Carruth6bda14b2017-06-06 11:49:48 +000014#include "llvm/CodeGen/MachineInstr.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000015#include "llvm/ADT/APFloat.h"
16#include "llvm/ADT/ArrayRef.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000017#include "llvm/ADT/FoldingSet.h"
18#include "llvm/ADT/Hashing.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000019#include "llvm/ADT/None.h"
Chandler Carruth6bda14b2017-06-06 11:49:48 +000020#include "llvm/ADT/STLExtras.h"
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +000021#include "llvm/ADT/SmallBitVector.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000022#include "llvm/ADT/SmallString.h"
23#include "llvm/ADT/SmallVector.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000024#include "llvm/Analysis/AliasAnalysis.h"
Hiroshi Inoue95f24dc2017-06-24 15:17:38 +000025#include "llvm/Analysis/Loads.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000026#include "llvm/Analysis/MemoryLocation.h"
27#include "llvm/CodeGen/GlobalISel/RegisterBank.h"
28#include "llvm/CodeGen/MachineBasicBlock.h"
Chris Lattner63f41ab2004-02-19 16:17:08 +000029#include "llvm/CodeGen/MachineFunction.h"
Reid Kleckner28865802016-04-14 18:29:59 +000030#include "llvm/CodeGen/MachineInstrBuilder.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000031#include "llvm/CodeGen/MachineInstrBundle.h"
Dan Gohman48b185d2009-09-25 20:36:54 +000032#include "llvm/CodeGen/MachineMemOperand.h"
Jakob Stoklund Olesen25a404e2011-07-02 03:53:34 +000033#include "llvm/CodeGen/MachineModuleInfo.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000034#include "llvm/CodeGen/MachineOperand.h"
Chris Lattner961e7422008-01-01 01:12:31 +000035#include "llvm/CodeGen/MachineRegisterInfo.h"
Dan Gohman2d489b52008-02-06 22:27:42 +000036#include "llvm/CodeGen/PseudoSourceValue.h"
David Blaikie3f833ed2017-11-08 01:01:31 +000037#include "llvm/CodeGen/TargetInstrInfo.h"
David Blaikieb3bde2e2017-11-17 01:07:10 +000038#include "llvm/CodeGen/TargetRegisterInfo.h"
39#include "llvm/CodeGen/TargetSubtargetInfo.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000040#include "llvm/IR/Constants.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000041#include "llvm/IR/DebugInfoMetadata.h"
42#include "llvm/IR/DebugLoc.h"
43#include "llvm/IR/DerivedTypes.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000044#include "llvm/IR/Function.h"
45#include "llvm/IR/InlineAsm.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000046#include "llvm/IR/InstrTypes.h"
Tim Northover6b3bd612016-07-29 20:32:59 +000047#include "llvm/IR/Intrinsics.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000048#include "llvm/IR/LLVMContext.h"
49#include "llvm/IR/Metadata.h"
50#include "llvm/IR/Module.h"
Duncan P. N. Exon Smithf48e9822015-06-26 22:06:47 +000051#include "llvm/IR/ModuleSlotTracker.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000052#include "llvm/IR/Type.h"
53#include "llvm/IR/Value.h"
Evan Cheng6cc775f2011-06-28 19:10:37 +000054#include "llvm/MC/MCInstrDesc.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000055#include "llvm/MC/MCRegisterInfo.h"
Chandler Carruth6bda14b2017-06-06 11:49:48 +000056#include "llvm/MC/MCSymbol.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000057#include "llvm/Support/Casting.h"
Daniel Sanders1e97a0b2015-08-19 12:03:04 +000058#include "llvm/Support/CommandLine.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000059#include "llvm/Support/Compiler.h"
David Greene29388d62010-01-04 23:48:20 +000060#include "llvm/Support/Debug.h"
Torok Edwin56d06592009-07-11 20:10:48 +000061#include "llvm/Support/ErrorHandling.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000062#include "llvm/Support/LowLevelTypeImpl.h"
Dan Gohmanaedb4a62008-07-07 20:32:02 +000063#include "llvm/Support/MathExtras.h"
Chris Lattnera078d832008-08-24 20:37:32 +000064#include "llvm/Support/raw_ostream.h"
Tim Northover6b3bd612016-07-29 20:32:59 +000065#include "llvm/Target/TargetIntrinsicInfo.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000066#include "llvm/Target/TargetMachine.h"
Eugene Zelenko4e9736b2017-05-31 01:10:10 +000067#include <algorithm>
68#include <cassert>
69#include <cstddef>
70#include <cstdint>
71#include <cstring>
72#include <iterator>
73#include <utility>
74
Chris Lattner43df6c22004-02-23 18:38:20 +000075using namespace llvm;
Brian Gaeke960707c2003-11-11 22:41:34 +000076
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +000077static const MachineFunction *getMFIfAvailable(const MachineInstr &MI) {
78 if (const MachineBasicBlock *MBB = MI.getParent())
79 if (const MachineFunction *MF = MBB->getParent())
80 return MF;
81 return nullptr;
82}
83
84// Try to crawl up to the machine function and get TRI and IntrinsicInfo from
85// it.
86static void tryToGetTargetInfo(const MachineInstr &MI,
87 const TargetRegisterInfo *&TRI,
88 const MachineRegisterInfo *&MRI,
89 const TargetIntrinsicInfo *&IntrinsicInfo,
90 const TargetInstrInfo *&TII) {
91
92 if (const MachineFunction *MF = getMFIfAvailable(MI)) {
93 TRI = MF->getSubtarget().getRegisterInfo();
94 MRI = &MF->getRegInfo();
95 IntrinsicInfo = MF->getTarget().getIntrinsicInfo();
96 TII = MF->getSubtarget().getInstrInfo();
97 }
98}
99
Jakob Stoklund Olesenac4210e2012-12-20 22:53:58 +0000100void MachineInstr::addImplicitDefUseOperands(MachineFunction &MF) {
Evan Cheng6cc775f2011-06-28 19:10:37 +0000101 if (MCID->ImplicitDefs)
Craig Toppere5e035a32015-12-05 07:13:35 +0000102 for (const MCPhysReg *ImpDefs = MCID->getImplicitDefs(); *ImpDefs;
103 ++ImpDefs)
Jakob Stoklund Olesenac4210e2012-12-20 22:53:58 +0000104 addOperand(MF, MachineOperand::CreateReg(*ImpDefs, true, true));
Evan Cheng6cc775f2011-06-28 19:10:37 +0000105 if (MCID->ImplicitUses)
Craig Toppere5e035a32015-12-05 07:13:35 +0000106 for (const MCPhysReg *ImpUses = MCID->getImplicitUses(); *ImpUses;
107 ++ImpUses)
Jakob Stoklund Olesenac4210e2012-12-20 22:53:58 +0000108 addOperand(MF, MachineOperand::CreateReg(*ImpUses, false, true));
Evan Cheng77af6ac2006-11-13 23:34:06 +0000109}
110
Bob Wilson406f2702010-04-09 04:34:03 +0000111/// MachineInstr ctor - This constructor creates a MachineInstr and adds the
112/// implicit operands. It reserves space for the number of operands specified by
Evan Cheng6cc775f2011-06-28 19:10:37 +0000113/// the MCInstrDesc.
Jakob Stoklund Olesenac4210e2012-12-20 22:53:58 +0000114MachineInstr::MachineInstr(MachineFunction &MF, const MCInstrDesc &tid,
Benjamin Kramera9591b52015-02-07 12:28:15 +0000115 DebugLoc dl, bool NoImp)
Eugene Zelenko4e9736b2017-05-31 01:10:10 +0000116 : MCID(&tid), debugLoc(std::move(dl)) {
Duncan P. N. Exon Smith5bf8fef2014-12-09 18:38:53 +0000117 assert(debugLoc.hasTrivialDestructor() && "Expected trivial destructor");
118
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000119 // Reserve space for the expected number of operands.
120 if (unsigned NumOps = MCID->getNumOperands() +
121 MCID->getNumImplicitDefs() + MCID->getNumImplicitUses()) {
122 CapOperands = OperandCapacity::get(NumOps);
123 Operands = MF.allocateOperandArray(CapOperands);
124 }
125
Dale Johannesen4e04ef32009-01-27 23:20:29 +0000126 if (!NoImp)
Jakob Stoklund Olesenac4210e2012-12-20 22:53:58 +0000127 addImplicitDefUseOperands(MF);
Dale Johannesen4e04ef32009-01-27 23:20:29 +0000128}
129
Misha Brukmanb47ab7a2004-07-09 14:45:17 +0000130/// MachineInstr ctor - Copies MachineInstr arg exactly
131///
Evan Chenga7a20c42008-07-19 00:37:25 +0000132MachineInstr::MachineInstr(MachineFunction &MF, const MachineInstr &MI)
Eugene Zelenko4e9736b2017-05-31 01:10:10 +0000133 : MCID(&MI.getDesc()), NumMemRefs(MI.NumMemRefs), MemRefs(MI.MemRefs),
134 debugLoc(MI.getDebugLoc()) {
Duncan P. N. Exon Smith5bf8fef2014-12-09 18:38:53 +0000135 assert(debugLoc.hasTrivialDestructor() && "Expected trivial destructor");
136
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000137 CapOperands = OperandCapacity::get(MI.getNumOperands());
138 Operands = MF.allocateOperandArray(CapOperands);
Tanya Lattner9953d862004-05-23 20:58:02 +0000139
Jakob Stoklund Olesendc5285f2013-01-05 05:05:51 +0000140 // Copy operands.
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000141 for (const MachineOperand &MO : MI.operands())
142 addOperand(MF, MO);
Tanya Lattnerbcee21b2004-05-24 03:14:18 +0000143
Jakob Stoklund Olesena33f5042012-12-18 21:36:05 +0000144 // Copy all the sensible flags.
145 setFlags(MI.Flags);
Alkis Evlogimenos14f3fe82004-02-16 07:17:43 +0000146}
147
Chris Lattner961e7422008-01-01 01:12:31 +0000148/// getRegInfo - If this instruction is embedded into a MachineFunction,
149/// return the MachineRegisterInfo object for the current function, otherwise
150/// return null.
151MachineRegisterInfo *MachineInstr::getRegInfo() {
152 if (MachineBasicBlock *MBB = getParent())
Dan Gohmanf188fa42008-07-08 23:59:09 +0000153 return &MBB->getParent()->getRegInfo();
Craig Topperc0196b12014-04-14 00:51:57 +0000154 return nullptr;
Chris Lattner961e7422008-01-01 01:12:31 +0000155}
156
157/// RemoveRegOperandsFromUseLists - Unlink all of the register operands in
158/// this instruction from their respective use lists. This requires that the
159/// operands already be on their use lists.
Jakob Stoklund Olesenc4102d42012-08-09 22:49:37 +0000160void MachineInstr::RemoveRegOperandsFromUseLists(MachineRegisterInfo &MRI) {
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000161 for (MachineOperand &MO : operands())
162 if (MO.isReg())
163 MRI.removeRegOperandFromUseList(&MO);
Chris Lattner961e7422008-01-01 01:12:31 +0000164}
165
166/// AddRegOperandsToUseLists - Add all of the register operands in
167/// this instruction from their respective use lists. This requires that the
168/// operands not be on their use lists yet.
Jakob Stoklund Olesenc4102d42012-08-09 22:49:37 +0000169void MachineInstr::AddRegOperandsToUseLists(MachineRegisterInfo &MRI) {
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000170 for (MachineOperand &MO : operands())
171 if (MO.isReg())
172 MRI.addRegOperandToUseList(&MO);
Chris Lattner961e7422008-01-01 01:12:31 +0000173}
174
Jakob Stoklund Olesen2455b5852012-12-20 22:54:05 +0000175void MachineInstr::addOperand(const MachineOperand &Op) {
176 MachineBasicBlock *MBB = getParent();
177 assert(MBB && "Use MachineInstrBuilder to add operands to dangling instrs");
178 MachineFunction *MF = MBB->getParent();
179 assert(MF && "Use MachineInstrBuilder to add operands to dangling instrs");
180 addOperand(*MF, Op);
181}
182
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000183/// Move NumOps MachineOperands from Src to Dst, with support for overlapping
184/// ranges. If MRI is non-null also update use-def chains.
185static void moveOperands(MachineOperand *Dst, MachineOperand *Src,
186 unsigned NumOps, MachineRegisterInfo *MRI) {
187 if (MRI)
188 return MRI->moveOperands(Dst, Src, NumOps);
189
JF Bastiena874d1a2016-03-26 18:20:02 +0000190 // MachineOperand is a trivially copyable type so we can just use memmove.
Benjamin Kramer5c0e64f2015-02-21 16:22:48 +0000191 std::memmove(Dst, Src, NumOps * sizeof(MachineOperand));
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000192}
193
Chris Lattner961e7422008-01-01 01:12:31 +0000194/// addOperand - Add the specified operand to the instruction. If it is an
195/// implicit operand, it is added to the end of the operand list. If it is
196/// an explicit operand it is added at the end of the explicit operand list
Jim Grosbachdee9e8a2011-08-24 16:44:17 +0000197/// (before the first implicit operand).
Jakob Stoklund Olesen2455b5852012-12-20 22:54:05 +0000198void MachineInstr::addOperand(MachineFunction &MF, const MachineOperand &Op) {
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +0000199 assert(MCID && "Cannot add operands before providing an instr descriptor");
Dan Gohman9356d8f2008-12-09 22:45:08 +0000200
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000201 // Check if we're adding one of our existing operands.
202 if (&Op >= Operands && &Op < Operands + NumOperands) {
203 // This is unusual: MI->addOperand(MI->getOperand(i)).
204 // If adding Op requires reallocating or moving existing operands around,
205 // the Op reference could go stale. Support it by copying Op.
206 MachineOperand CopyOp(Op);
207 return addOperand(MF, CopyOp);
208 }
Jim Grosbachdee9e8a2011-08-24 16:44:17 +0000209
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +0000210 // Find the insert location for the new operand. Implicit registers go at
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000211 // the end, everything else goes before the implicit regs.
212 //
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +0000213 // FIXME: Allow mixed explicit and implicit operands on inline asm.
214 // InstrEmitter::EmitSpecialNode() is marking inline asm clobbers as
215 // implicit-defs, but they must not be moved around. See the FIXME in
216 // InstrEmitter.cpp.
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000217 unsigned OpNo = getNumOperands();
218 bool isImpReg = Op.isReg() && Op.isImplicit();
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +0000219 if (!isImpReg && !isInlineAsm()) {
220 while (OpNo && Operands[OpNo-1].isReg() && Operands[OpNo-1].isImplicit()) {
221 --OpNo;
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000222 assert(!Operands[OpNo].isTied() && "Cannot move tied operands");
Chris Lattner961e7422008-01-01 01:12:31 +0000223 }
224 }
Jim Grosbachdee9e8a2011-08-24 16:44:17 +0000225
Pekka Jaaskelaineneb4a6e72013-10-15 14:40:46 +0000226#ifndef NDEBUG
Pekka Jaaskelaineneb08e2e2013-10-15 14:18:10 +0000227 bool isMetaDataOp = Op.getType() == MachineOperand::MO_Metadata;
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +0000228 // OpNo now points as the desired insertion point. Unless this is a variadic
229 // instruction, only implicit regs are allowed beyond MCID->getNumOperands().
Jakob Stoklund Olesenc300ef02012-07-04 23:53:23 +0000230 // RegMask operands go between the explicit and implicit operands.
231 assert((isImpReg || Op.isRegMask() || MCID->isVariadic() ||
Pekka Jaaskelaineneb08e2e2013-10-15 14:18:10 +0000232 OpNo < MCID->getNumOperands() || isMetaDataOp) &&
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +0000233 "Trying to add an operand to a machine instr that is already done!");
Pekka Jaaskelaineneb4a6e72013-10-15 14:40:46 +0000234#endif
Chris Lattner961e7422008-01-01 01:12:31 +0000235
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000236 MachineRegisterInfo *MRI = getRegInfo();
Chris Lattner961e7422008-01-01 01:12:31 +0000237
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000238 // Determine if the Operands array needs to be reallocated.
239 // Save the old capacity and operand array.
240 OperandCapacity OldCap = CapOperands;
241 MachineOperand *OldOperands = Operands;
242 if (!OldOperands || OldCap.getSize() == getNumOperands()) {
243 CapOperands = OldOperands ? OldCap.getNext() : OldCap.get(1);
244 Operands = MF.allocateOperandArray(CapOperands);
245 // Move the operands before the insertion point.
246 if (OpNo)
247 moveOperands(Operands, OldOperands, OpNo, MRI);
248 }
Chris Lattner961e7422008-01-01 01:12:31 +0000249
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000250 // Move the operands following the insertion point.
251 if (OpNo != NumOperands)
252 moveOperands(Operands + OpNo + 1, OldOperands + OpNo, NumOperands - OpNo,
253 MRI);
254 ++NumOperands;
Jim Grosbachdee9e8a2011-08-24 16:44:17 +0000255
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000256 // Deallocate the old operand array.
257 if (OldOperands != Operands && OldOperands)
258 MF.deallocateOperandArray(OldCap, OldOperands);
259
260 // Copy Op into place. It still needs to be inserted into the MRI use lists.
261 MachineOperand *NewMO = new (Operands + OpNo) MachineOperand(Op);
262 NewMO->ParentMI = this;
263
264 // When adding a register operand, tell MRI about it.
265 if (NewMO->isReg()) {
Jakob Stoklund Olesenc4102d42012-08-09 22:49:37 +0000266 // Ensure isOnRegUseList() returns false, regardless of Op's status.
Craig Topperc0196b12014-04-14 00:51:57 +0000267 NewMO->Contents.Reg.Prev = nullptr;
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000268 // Ignore existing ties. This is not a property that can be copied.
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000269 NewMO->TiedTo = 0;
270 // Add the new operand to MRI, but only for instructions in an MBB.
271 if (MRI)
272 MRI->addRegOperandToUseList(NewMO);
Jakob Stoklund Olesen0eecbbe2012-08-30 14:39:06 +0000273 // The MCID operand information isn't accurate until we start adding
274 // explicit operands. The implicit operands are added first, then the
275 // explicits are inserted before them.
276 if (!isImpReg) {
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000277 // Tie uses to defs as indicated in MCInstrDesc.
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000278 if (NewMO->isUse()) {
Jakob Stoklund Olesen0eecbbe2012-08-30 14:39:06 +0000279 int DefIdx = MCID->getOperandConstraint(OpNo, MCOI::TIED_TO);
Jakob Stoklund Olesen5c8eda02012-08-31 20:50:53 +0000280 if (DefIdx != -1)
281 tieOperands(DefIdx, OpNo);
Jakob Stoklund Olesene56c60c2012-08-28 18:34:41 +0000282 }
Jakob Stoklund Olesen0eecbbe2012-08-30 14:39:06 +0000283 // If the register operand is flagged as early, mark the operand as such.
284 if (MCID->getOperandConstraint(OpNo, MCOI::EARLY_CLOBBER) != -1)
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000285 NewMO->setIsEarlyClobber(true);
Chris Lattner961e7422008-01-01 01:12:31 +0000286 }
Chris Lattner961e7422008-01-01 01:12:31 +0000287 }
288}
289
290/// RemoveOperand - Erase an operand from an instruction, leaving it with one
291/// fewer operand than it started with.
292///
293void MachineInstr::RemoveOperand(unsigned OpNo) {
Jakob Stoklund Olesenb0894832012-12-22 17:13:06 +0000294 assert(OpNo < getNumOperands() && "Invalid operand number");
Jakob Stoklund Olesen2b166642012-08-29 00:37:58 +0000295 untieRegOperand(OpNo);
Jim Grosbachdee9e8a2011-08-24 16:44:17 +0000296
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000297#ifndef NDEBUG
298 // Moving tied operands would break the ties.
Jakob Stoklund Olesenb0894832012-12-22 17:13:06 +0000299 for (unsigned i = OpNo + 1, e = getNumOperands(); i != e; ++i)
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000300 if (Operands[i].isReg())
301 assert(!Operands[i].isTied() && "Cannot move tied operands");
302#endif
303
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000304 MachineRegisterInfo *MRI = getRegInfo();
305 if (MRI && Operands[OpNo].isReg())
306 MRI->removeRegOperandFromUseList(Operands + OpNo);
Chris Lattner961e7422008-01-01 01:12:31 +0000307
Jakob Stoklund Olesen1bfeecb2013-01-05 05:00:09 +0000308 // Don't call the MachineOperand destructor. A lot of this code depends on
309 // MachineOperand having a trivial destructor anyway, and adding a call here
310 // wouldn't make it 'destructor-correct'.
311
312 if (unsigned N = NumOperands - 1 - OpNo)
313 moveOperands(Operands + OpNo, Operands + OpNo + 1, N, MRI);
314 --NumOperands;
Chris Lattner961e7422008-01-01 01:12:31 +0000315}
316
Dan Gohman48b185d2009-09-25 20:36:54 +0000317/// addMemOperand - Add a MachineMemOperand to the machine instruction.
318/// This function should be used only occasionally. The setMemRefs function
319/// is the primary method for setting up a MachineInstr's MemRefs list.
Dan Gohman3b460302008-07-07 23:14:23 +0000320void MachineInstr::addMemOperand(MachineFunction &MF,
Dan Gohman48b185d2009-09-25 20:36:54 +0000321 MachineMemOperand *MO) {
322 mmo_iterator OldMemRefs = MemRefs;
Jakob Stoklund Olesen5adc4a12013-01-07 23:21:41 +0000323 unsigned OldNumMemRefs = NumMemRefs;
Dan Gohman3b460302008-07-07 23:14:23 +0000324
Jakob Stoklund Olesen5adc4a12013-01-07 23:21:41 +0000325 unsigned NewNum = NumMemRefs + 1;
Dan Gohman48b185d2009-09-25 20:36:54 +0000326 mmo_iterator NewMemRefs = MF.allocateMemRefsArray(NewNum);
Dan Gohman3b460302008-07-07 23:14:23 +0000327
Benjamin Kramerd03878b2012-03-16 16:39:27 +0000328 std::copy(OldMemRefs, OldMemRefs + OldNumMemRefs, NewMemRefs);
Dan Gohman48b185d2009-09-25 20:36:54 +0000329 NewMemRefs[NewNum - 1] = MO;
Jakob Stoklund Olesen5adc4a12013-01-07 23:21:41 +0000330 setMemRefs(NewMemRefs, NewMemRefs + NewNum);
Dan Gohman48b185d2009-09-25 20:36:54 +0000331}
Chris Lattner961e7422008-01-01 01:12:31 +0000332
Philip Reames5eb90a72016-01-06 19:33:12 +0000333/// Check to see if the MMOs pointed to by the two MemRefs arrays are
Junmo Park820e3922016-02-26 02:07:36 +0000334/// identical.
Philip Reames5eb90a72016-01-06 19:33:12 +0000335static bool hasIdenticalMMOs(const MachineInstr &MI1, const MachineInstr &MI2) {
336 auto I1 = MI1.memoperands_begin(), E1 = MI1.memoperands_end();
337 auto I2 = MI2.memoperands_begin(), E2 = MI2.memoperands_end();
338 if ((E1 - I1) != (E2 - I2))
339 return false;
340 for (; I1 != E1; ++I1, ++I2) {
341 if (**I1 != **I2)
342 return false;
343 }
344 return true;
345}
346
Philip Reamesc86ed002016-01-06 04:39:03 +0000347std::pair<MachineInstr::mmo_iterator, unsigned>
348MachineInstr::mergeMemRefsWith(const MachineInstr& Other) {
Philip Reames5eb90a72016-01-06 19:33:12 +0000349
350 // If either of the incoming memrefs are empty, we must be conservative and
351 // treat this as if we've exhausted our space for memrefs and dropped them.
352 if (memoperands_empty() || Other.memoperands_empty())
353 return std::make_pair(nullptr, 0);
354
355 // If both instructions have identical memrefs, we don't need to merge them.
356 // Since many instructions have a single memref, and we tend to merge things
357 // like pairs of loads from the same location, this catches a large number of
358 // cases in practice.
359 if (hasIdenticalMMOs(*this, Other))
360 return std::make_pair(MemRefs, NumMemRefs);
Junmo Park820e3922016-02-26 02:07:36 +0000361
Philip Reamesc86ed002016-01-06 04:39:03 +0000362 // TODO: consider uniquing elements within the operand lists to reduce
363 // space usage and fall back to conservative information less often.
Philip Reames5eb90a72016-01-06 19:33:12 +0000364 size_t CombinedNumMemRefs = NumMemRefs + Other.NumMemRefs;
365
366 // If we don't have enough room to store this many memrefs, be conservative
367 // and drop them. Otherwise, we'd fail asserts when trying to add them to
368 // the new instruction.
369 if (CombinedNumMemRefs != uint8_t(CombinedNumMemRefs))
370 return std::make_pair(nullptr, 0);
Philip Reamesc86ed002016-01-06 04:39:03 +0000371
Justin Bognerfdf9bf42017-10-10 23:50:49 +0000372 MachineFunction *MF = getMF();
Philip Reamesc86ed002016-01-06 04:39:03 +0000373 mmo_iterator MemBegin = MF->allocateMemRefsArray(CombinedNumMemRefs);
374 mmo_iterator MemEnd = std::copy(memoperands_begin(), memoperands_end(),
375 MemBegin);
376 MemEnd = std::copy(Other.memoperands_begin(), Other.memoperands_end(),
377 MemEnd);
Philip Reames2d2fc4a2016-01-06 05:53:09 +0000378 assert(MemEnd - MemBegin == (ptrdiff_t)CombinedNumMemRefs &&
379 "missing memrefs");
Junmo Park820e3922016-02-26 02:07:36 +0000380
Philip Reamesc86ed002016-01-06 04:39:03 +0000381 return std::make_pair(MemBegin, CombinedNumMemRefs);
382}
383
Benjamin Kramer97f889f2012-03-17 17:03:45 +0000384bool MachineInstr::hasPropertyInBundle(unsigned Mask, QueryType Type) const {
Jakob Stoklund Olesenf0615c72013-01-10 18:42:44 +0000385 assert(!isBundledWithPred() && "Must be called on bundle header");
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000386 for (MachineBasicBlock::const_instr_iterator MII = getIterator();; ++MII) {
Benjamin Kramer97f889f2012-03-17 17:03:45 +0000387 if (MII->getDesc().getFlags() & Mask) {
Evan Chengcdf89fd2011-12-08 19:23:10 +0000388 if (Type == AnyInBundle)
Evan Cheng7f8e5632011-12-07 07:15:52 +0000389 return true;
390 } else {
Jakob Stoklund Olesen55a7be22013-01-10 01:29:42 +0000391 if (Type == AllInBundle && !MII->isBundle())
Evan Cheng7f8e5632011-12-07 07:15:52 +0000392 return false;
393 }
Jakob Stoklund Olesen55a7be22013-01-10 01:29:42 +0000394 // This was the last instruction in the bundle.
395 if (!MII->isBundledWithSucc())
396 return Type == AllInBundle;
Evan Cheng2a81dd42011-12-06 22:12:01 +0000397 }
Evan Cheng2a81dd42011-12-06 22:12:01 +0000398}
399
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +0000400bool MachineInstr::isIdenticalTo(const MachineInstr &Other,
Evan Chenge9c46c22010-03-03 01:44:33 +0000401 MICheckType Check) const {
Evan Cheng0f260e12010-03-03 21:54:14 +0000402 // If opcodes or number of operands are not the same then the two
403 // instructions are obviously not identical.
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +0000404 if (Other.getOpcode() != getOpcode() ||
405 Other.getNumOperands() != getNumOperands())
Evan Cheng0f260e12010-03-03 21:54:14 +0000406 return false;
407
Evan Cheng7fae11b2011-12-14 02:11:42 +0000408 if (isBundle()) {
Bjorn Petterssonb29a15e2016-12-19 11:20:57 +0000409 // We have passed the test above that both instructions have the same
410 // opcode, so we know that both instructions are bundles here. Let's compare
411 // MIs inside the bundle.
412 assert(Other.isBundle() && "Expected that both instructions are bundles.");
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000413 MachineBasicBlock::const_instr_iterator I1 = getIterator();
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +0000414 MachineBasicBlock::const_instr_iterator I2 = Other.getIterator();
Bjorn Petterssonb29a15e2016-12-19 11:20:57 +0000415 // Loop until we analysed the last intruction inside at least one of the
416 // bundles.
417 while (I1->isBundledWithSucc() && I2->isBundledWithSucc()) {
418 ++I1;
Evan Cheng7fae11b2011-12-14 02:11:42 +0000419 ++I2;
Bjorn Petterssonb29a15e2016-12-19 11:20:57 +0000420 if (!I1->isIdenticalTo(*I2, Check))
Evan Cheng7fae11b2011-12-14 02:11:42 +0000421 return false;
422 }
Bjorn Petterssonb29a15e2016-12-19 11:20:57 +0000423 // If we've reached the end of just one of the two bundles, but not both,
424 // the instructions are not identical.
425 if (I1->isBundledWithSucc() || I2->isBundledWithSucc())
426 return false;
Evan Cheng7fae11b2011-12-14 02:11:42 +0000427 }
428
Evan Cheng0f260e12010-03-03 21:54:14 +0000429 // Check operands to make sure they match.
430 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
431 const MachineOperand &MO = getOperand(i);
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +0000432 const MachineOperand &OMO = Other.getOperand(i);
Evan Chengcfdf3392011-05-12 00:56:58 +0000433 if (!MO.isReg()) {
434 if (!MO.isIdenticalTo(OMO))
435 return false;
436 continue;
437 }
438
Evan Cheng0f260e12010-03-03 21:54:14 +0000439 // Clients may or may not want to ignore defs when testing for equality.
440 // For example, machine CSE pass only cares about finding common
441 // subexpressions, so it's safe to ignore virtual register defs.
Evan Chengcfdf3392011-05-12 00:56:58 +0000442 if (MO.isDef()) {
Evan Cheng0f260e12010-03-03 21:54:14 +0000443 if (Check == IgnoreDefs)
444 continue;
Evan Chengcfdf3392011-05-12 00:56:58 +0000445 else if (Check == IgnoreVRegDefs) {
Diana Picus4a5f5222017-10-12 13:59:51 +0000446 if (!TargetRegisterInfo::isVirtualRegister(MO.getReg()) ||
447 !TargetRegisterInfo::isVirtualRegister(OMO.getReg()))
448 if (!MO.isIdenticalTo(OMO))
Evan Chengcfdf3392011-05-12 00:56:58 +0000449 return false;
450 } else {
451 if (!MO.isIdenticalTo(OMO))
Evan Cheng0f260e12010-03-03 21:54:14 +0000452 return false;
Evan Chengcfdf3392011-05-12 00:56:58 +0000453 if (Check == CheckKillDead && MO.isDead() != OMO.isDead())
454 return false;
455 }
456 } else {
457 if (!MO.isIdenticalTo(OMO))
458 return false;
459 if (Check == CheckKillDead && MO.isKill() != OMO.isKill())
460 return false;
461 }
Evan Cheng0f260e12010-03-03 21:54:14 +0000462 }
Devang Patelbf8cc602011-07-07 17:45:33 +0000463 // If DebugLoc does not match then two dbg.values are not identical.
464 if (isDebugValue())
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +0000465 if (getDebugLoc() && Other.getDebugLoc() &&
466 getDebugLoc() != Other.getDebugLoc())
Devang Patelbf8cc602011-07-07 17:45:33 +0000467 return false;
Evan Cheng0f260e12010-03-03 21:54:14 +0000468 return true;
Evan Chenge9c46c22010-03-03 01:44:33 +0000469}
470
Justin Bognerec7cba52017-10-10 23:34:01 +0000471const MachineFunction *MachineInstr::getMF() const {
472 return getParent()->getParent();
473}
474
Chris Lattnerbec79b42006-04-17 21:35:41 +0000475MachineInstr *MachineInstr::removeFromParent() {
476 assert(getParent() && "Not embedded in a basic block!");
Jakob Stoklund Olesenccfb5fb2012-12-17 23:55:38 +0000477 return getParent()->remove(this);
Chris Lattnerbec79b42006-04-17 21:35:41 +0000478}
479
Jakob Stoklund Olesenccfb5fb2012-12-17 23:55:38 +0000480MachineInstr *MachineInstr::removeFromBundle() {
481 assert(getParent() && "Not embedded in a basic block!");
482 return getParent()->remove_instr(this);
483}
Chris Lattnerbec79b42006-04-17 21:35:41 +0000484
Dan Gohman3b460302008-07-07 23:14:23 +0000485void MachineInstr::eraseFromParent() {
486 assert(getParent() && "Not embedded in a basic block!");
Jakob Stoklund Olesenccfb5fb2012-12-17 23:55:38 +0000487 getParent()->erase(this);
Dan Gohman3b460302008-07-07 23:14:23 +0000488}
489
Gerolf Hoflehnercaa8bfd2014-08-13 21:15:23 +0000490void MachineInstr::eraseFromParentAndMarkDBGValuesForRemoval() {
491 assert(getParent() && "Not embedded in a basic block!");
492 MachineBasicBlock *MBB = getParent();
493 MachineFunction *MF = MBB->getParent();
494 assert(MF && "Not embedded in a function!");
495
496 MachineInstr *MI = (MachineInstr *)this;
497 MachineRegisterInfo &MRI = MF->getRegInfo();
498
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000499 for (const MachineOperand &MO : MI->operands()) {
Gerolf Hoflehnercaa8bfd2014-08-13 21:15:23 +0000500 if (!MO.isReg() || !MO.isDef())
501 continue;
502 unsigned Reg = MO.getReg();
503 if (!TargetRegisterInfo::isVirtualRegister(Reg))
504 continue;
505 MRI.markUsesInDebugValueAsUndef(Reg);
506 }
507 MI->eraseFromParent();
508}
509
Jakob Stoklund Olesenccfb5fb2012-12-17 23:55:38 +0000510void MachineInstr::eraseFromBundle() {
511 assert(getParent() && "Not embedded in a basic block!");
512 getParent()->erase_instr(this);
513}
Dan Gohman3b460302008-07-07 23:14:23 +0000514
Evan Cheng4d728b02007-05-15 01:26:09 +0000515/// getNumExplicitOperands - Returns the number of non-implicit operands.
516///
517unsigned MachineInstr::getNumExplicitOperands() const {
Evan Cheng6cc775f2011-06-28 19:10:37 +0000518 unsigned NumOperands = MCID->getNumOperands();
519 if (!MCID->isVariadic())
Evan Cheng4d728b02007-05-15 01:26:09 +0000520 return NumOperands;
521
Dan Gohman37608532009-04-15 17:59:11 +0000522 for (unsigned i = NumOperands, e = getNumOperands(); i != e; ++i) {
523 const MachineOperand &MO = getOperand(i);
Dan Gohman0d1e9a82008-10-03 15:45:36 +0000524 if (!MO.isReg() || !MO.isImplicit())
Evan Cheng4d728b02007-05-15 01:26:09 +0000525 NumOperands++;
526 }
527 return NumOperands;
528}
529
Jakob Stoklund Olesenfead62d2012-12-07 04:23:29 +0000530void MachineInstr::bundleWithPred() {
531 assert(!isBundledWithPred() && "MI is already bundled with its predecessor");
532 setFlag(BundledPred);
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000533 MachineBasicBlock::instr_iterator Pred = getIterator();
534 --Pred;
Jakob Stoklund Olesen00f6c772012-12-18 23:00:28 +0000535 assert(!Pred->isBundledWithSucc() && "Inconsistent bundle flags");
Jakob Stoklund Olesenfead62d2012-12-07 04:23:29 +0000536 Pred->setFlag(BundledSucc);
537}
538
539void MachineInstr::bundleWithSucc() {
540 assert(!isBundledWithSucc() && "MI is already bundled with its successor");
541 setFlag(BundledSucc);
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000542 MachineBasicBlock::instr_iterator Succ = getIterator();
543 ++Succ;
Jakob Stoklund Olesen00f6c772012-12-18 23:00:28 +0000544 assert(!Succ->isBundledWithPred() && "Inconsistent bundle flags");
Jakob Stoklund Olesenfead62d2012-12-07 04:23:29 +0000545 Succ->setFlag(BundledPred);
546}
547
548void MachineInstr::unbundleFromPred() {
549 assert(isBundledWithPred() && "MI isn't bundled with its predecessor");
550 clearFlag(BundledPred);
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000551 MachineBasicBlock::instr_iterator Pred = getIterator();
552 --Pred;
Jakob Stoklund Olesen00f6c772012-12-18 23:00:28 +0000553 assert(Pred->isBundledWithSucc() && "Inconsistent bundle flags");
Jakob Stoklund Olesenfead62d2012-12-07 04:23:29 +0000554 Pred->clearFlag(BundledSucc);
555}
556
557void MachineInstr::unbundleFromSucc() {
558 assert(isBundledWithSucc() && "MI isn't bundled with its successor");
559 clearFlag(BundledSucc);
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000560 MachineBasicBlock::instr_iterator Succ = getIterator();
561 ++Succ;
Jakob Stoklund Olesen00f6c772012-12-18 23:00:28 +0000562 assert(Succ->isBundledWithPred() && "Inconsistent bundle flags");
Jakob Stoklund Olesenfead62d2012-12-07 04:23:29 +0000563 Succ->clearFlag(BundledPred);
564}
565
Evan Cheng6eb516d2011-01-07 23:50:32 +0000566bool MachineInstr::isStackAligningInlineAsm() const {
567 if (isInlineAsm()) {
568 unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
569 if (ExtraInfo & InlineAsm::Extra_IsAlignStack)
570 return true;
571 }
572 return false;
573}
Chris Lattner33f5af02006-10-20 22:39:59 +0000574
Chad Rosier994f4042012-09-05 21:00:58 +0000575InlineAsm::AsmDialect MachineInstr::getInlineAsmDialect() const {
576 assert(isInlineAsm() && "getInlineAsmDialect() only works for inline asms!");
577 unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
Chad Rosiere53314f2012-09-05 22:40:13 +0000578 return InlineAsm::AsmDialect((ExtraInfo & InlineAsm::Extra_AsmDialect) != 0);
Chad Rosier994f4042012-09-05 21:00:58 +0000579}
580
Jakob Stoklund Olesen1e737162011-10-12 23:37:33 +0000581int MachineInstr::findInlineAsmFlagIdx(unsigned OpIdx,
582 unsigned *GroupNo) const {
583 assert(isInlineAsm() && "Expected an inline asm instruction");
584 assert(OpIdx < getNumOperands() && "OpIdx out of range");
585
586 // Ignore queries about the initial operands.
587 if (OpIdx < InlineAsm::MIOp_FirstOperand)
588 return -1;
589
590 unsigned Group = 0;
591 unsigned NumOps;
592 for (unsigned i = InlineAsm::MIOp_FirstOperand, e = getNumOperands(); i < e;
593 i += NumOps) {
594 const MachineOperand &FlagMO = getOperand(i);
595 // If we reach the implicit register operands, stop looking.
596 if (!FlagMO.isImm())
597 return -1;
598 NumOps = 1 + InlineAsm::getNumOperandRegisters(FlagMO.getImm());
599 if (i + NumOps > OpIdx) {
600 if (GroupNo)
601 *GroupNo = Group;
602 return i;
603 }
604 ++Group;
605 }
606 return -1;
607}
608
Reid Kleckner28865802016-04-14 18:29:59 +0000609const DILocalVariable *MachineInstr::getDebugVariable() const {
610 assert(isDebugValue() && "not a DBG_VALUE");
611 return cast<DILocalVariable>(getOperand(2).getMetadata());
612}
613
614const DIExpression *MachineInstr::getDebugExpression() const {
615 assert(isDebugValue() && "not a DBG_VALUE");
616 return cast<DIExpression>(getOperand(3).getMetadata());
617}
618
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000619const TargetRegisterClass*
620MachineInstr::getRegClassConstraint(unsigned OpIdx,
621 const TargetInstrInfo *TII,
622 const TargetRegisterInfo *TRI) const {
Jakob Stoklund Olesen3c52f022012-05-07 22:10:26 +0000623 assert(getParent() && "Can't have an MBB reference here!");
Justin Bognerfdf9bf42017-10-10 23:50:49 +0000624 assert(getMF() && "Can't have an MF reference here!");
625 const MachineFunction &MF = *getMF();
Jakob Stoklund Olesen3c52f022012-05-07 22:10:26 +0000626
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000627 // Most opcodes have fixed constraints in their MCInstrDesc.
628 if (!isInlineAsm())
Jakob Stoklund Olesen3c52f022012-05-07 22:10:26 +0000629 return TII->getRegClass(getDesc(), OpIdx, TRI, MF);
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000630
631 if (!getOperand(OpIdx).isReg())
Craig Topperc0196b12014-04-14 00:51:57 +0000632 return nullptr;
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000633
634 // For tied uses on inline asm, get the constraint from the def.
635 unsigned DefIdx;
636 if (getOperand(OpIdx).isUse() && isRegTiedToDefOperand(OpIdx, &DefIdx))
637 OpIdx = DefIdx;
638
639 // Inline asm stores register class constraints in the flag word.
640 int FlagIdx = findInlineAsmFlagIdx(OpIdx);
641 if (FlagIdx < 0)
Craig Topperc0196b12014-04-14 00:51:57 +0000642 return nullptr;
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000643
644 unsigned Flag = getOperand(FlagIdx).getImm();
645 unsigned RCID;
Simon Dardisd32a2d32016-07-18 13:17:31 +0000646 if ((InlineAsm::getKind(Flag) == InlineAsm::Kind_RegUse ||
647 InlineAsm::getKind(Flag) == InlineAsm::Kind_RegDef ||
648 InlineAsm::getKind(Flag) == InlineAsm::Kind_RegDefEarlyClobber) &&
649 InlineAsm::hasRegClassConstraint(Flag, RCID))
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000650 return TRI->getRegClass(RCID);
651
652 // Assume that all registers in a memory operand are pointers.
653 if (InlineAsm::getKind(Flag) == InlineAsm::Kind_Mem)
Jakob Stoklund Olesen3c52f022012-05-07 22:10:26 +0000654 return TRI->getPointerRegClass(MF);
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000655
Craig Topperc0196b12014-04-14 00:51:57 +0000656 return nullptr;
Jakob Stoklund Olesen35b362f2011-10-12 23:37:36 +0000657}
658
Quentin Colombet1fb3362a2014-01-02 22:47:22 +0000659const TargetRegisterClass *MachineInstr::getRegClassConstraintEffectForVReg(
660 unsigned Reg, const TargetRegisterClass *CurRC, const TargetInstrInfo *TII,
661 const TargetRegisterInfo *TRI, bool ExploreBundle) const {
662 // Check every operands inside the bundle if we have
663 // been asked to.
664 if (ExploreBundle)
Duncan P. N. Exon Smithf9ab4162016-02-27 17:05:33 +0000665 for (ConstMIBundleOperands OpndIt(*this); OpndIt.isValid() && CurRC;
Quentin Colombet1fb3362a2014-01-02 22:47:22 +0000666 ++OpndIt)
667 CurRC = OpndIt->getParent()->getRegClassConstraintEffectForVRegImpl(
668 OpndIt.getOperandNo(), Reg, CurRC, TII, TRI);
669 else
670 // Otherwise, just check the current operands.
Matthias Braune41e1462015-05-29 02:56:46 +0000671 for (unsigned i = 0, e = NumOperands; i < e && CurRC; ++i)
672 CurRC = getRegClassConstraintEffectForVRegImpl(i, Reg, CurRC, TII, TRI);
Quentin Colombet1fb3362a2014-01-02 22:47:22 +0000673 return CurRC;
674}
675
676const TargetRegisterClass *MachineInstr::getRegClassConstraintEffectForVRegImpl(
677 unsigned OpIdx, unsigned Reg, const TargetRegisterClass *CurRC,
678 const TargetInstrInfo *TII, const TargetRegisterInfo *TRI) const {
679 assert(CurRC && "Invalid initial register class");
680 // Check if Reg is constrained by some of its use/def from MI.
681 const MachineOperand &MO = getOperand(OpIdx);
682 if (!MO.isReg() || MO.getReg() != Reg)
683 return CurRC;
684 // If yes, accumulate the constraints through the operand.
685 return getRegClassConstraintEffect(OpIdx, CurRC, TII, TRI);
686}
687
688const TargetRegisterClass *MachineInstr::getRegClassConstraintEffect(
689 unsigned OpIdx, const TargetRegisterClass *CurRC,
690 const TargetInstrInfo *TII, const TargetRegisterInfo *TRI) const {
691 const TargetRegisterClass *OpRC = getRegClassConstraint(OpIdx, TII, TRI);
692 const MachineOperand &MO = getOperand(OpIdx);
693 assert(MO.isReg() &&
694 "Cannot get register constraints for non-register operand");
695 assert(CurRC && "Invalid initial register class");
696 if (unsigned SubIdx = MO.getSubReg()) {
697 if (OpRC)
698 CurRC = TRI->getMatchingSuperRegClass(CurRC, OpRC, SubIdx);
699 else
700 CurRC = TRI->getSubClassWithSubReg(CurRC, SubIdx);
701 } else if (OpRC)
702 CurRC = TRI->getCommonSubClass(CurRC, OpRC);
703 return CurRC;
704}
705
Jakob Stoklund Olesen68d752b2013-01-09 18:28:16 +0000706/// Return the number of instructions inside the MI bundle, not counting the
707/// header instruction.
Evan Cheng7fae11b2011-12-14 02:11:42 +0000708unsigned MachineInstr::getBundleSize() const {
Duncan P. N. Exon Smithc5b668d2016-02-22 20:49:58 +0000709 MachineBasicBlock::const_instr_iterator I = getIterator();
Evan Cheng7fae11b2011-12-14 02:11:42 +0000710 unsigned Size = 0;
Richard Trieu7a083812016-02-18 22:09:30 +0000711 while (I->isBundledWithSucc()) {
712 ++Size;
713 ++I;
714 }
Evan Cheng7fae11b2011-12-14 02:11:42 +0000715 return Size;
716}
717
Nicolai Haehnleb0c97482016-04-22 04:04:08 +0000718/// Returns true if the MachineInstr has an implicit-use operand of exactly
719/// the given register (not considering sub/super-registers).
720bool MachineInstr::hasRegisterImplicitUseOperand(unsigned Reg) const {
721 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
722 const MachineOperand &MO = getOperand(i);
723 if (MO.isReg() && MO.isUse() && MO.isImplicit() && MO.getReg() == Reg)
724 return true;
725 }
726 return false;
727}
728
Evan Cheng910c8082007-04-26 19:00:32 +0000729/// findRegisterUseOperandIdx() - Returns the MachineOperand that is a use of
Jim Grosbach9632c142009-09-17 17:57:26 +0000730/// the specific register or -1 if it is not found. It further tightens
Evan Cheng9965aeb2007-02-23 01:04:26 +0000731/// the search criteria to a use that kills the register if isKill is true.
Fraser Cormack48d9fdc2016-10-11 09:09:21 +0000732int MachineInstr::findRegisterUseOperandIdx(
733 unsigned Reg, bool isKill, const TargetRegisterInfo *TRI) const {
Evan Cheng75c21942006-12-06 08:27:42 +0000734 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
Evan Cheng5983bdb2007-05-29 18:35:22 +0000735 const MachineOperand &MO = getOperand(i);
Dan Gohman0d1e9a82008-10-03 15:45:36 +0000736 if (!MO.isReg() || !MO.isUse())
Evan Cheng63254462008-03-05 00:59:57 +0000737 continue;
738 unsigned MOReg = MO.getReg();
739 if (!MOReg)
740 continue;
Fraser Cormack48d9fdc2016-10-11 09:09:21 +0000741 if (MOReg == Reg || (TRI && TargetRegisterInfo::isPhysicalRegister(MOReg) &&
742 TargetRegisterInfo::isPhysicalRegister(Reg) &&
743 TRI->isSubRegister(MOReg, Reg)))
Evan Cheng9965aeb2007-02-23 01:04:26 +0000744 if (!isKill || MO.isKill())
Evan Chengec3ac312007-03-26 22:37:45 +0000745 return i;
Evan Cheng75c21942006-12-06 08:27:42 +0000746 }
Evan Chengec3ac312007-03-26 22:37:45 +0000747 return -1;
Evan Cheng75c21942006-12-06 08:27:42 +0000748}
Jakob Stoklund Olesen5d4c1342010-05-19 20:36:22 +0000749
Jakob Stoklund Olesen7d7f6042010-05-21 20:02:01 +0000750/// readsWritesVirtualRegister - Return a pair of bools (reads, writes)
751/// indicating if this instruction reads or writes Reg. This also considers
752/// partial defines.
753std::pair<bool,bool>
754MachineInstr::readsWritesVirtualRegister(unsigned Reg,
755 SmallVectorImpl<unsigned> *Ops) const {
756 bool PartDef = false; // Partial redefine.
757 bool FullDef = false; // Full define.
758 bool Use = false;
Jakob Stoklund Olesen5d4c1342010-05-19 20:36:22 +0000759
760 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
761 const MachineOperand &MO = getOperand(i);
762 if (!MO.isReg() || MO.getReg() != Reg)
763 continue;
Jakob Stoklund Olesen7d7f6042010-05-21 20:02:01 +0000764 if (Ops)
765 Ops->push_back(i);
Jakob Stoklund Olesen5d4c1342010-05-19 20:36:22 +0000766 if (MO.isUse())
Jakob Stoklund Olesen7d7f6042010-05-21 20:02:01 +0000767 Use |= !MO.isUndef();
Jakob Stoklund Olesen9eb77bf2011-08-19 00:30:17 +0000768 else if (MO.getSubReg() && !MO.isUndef())
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +0000769 // A partial def undef doesn't count as reading the register.
Jakob Stoklund Olesen5d4c1342010-05-19 20:36:22 +0000770 PartDef = true;
771 else
772 FullDef = true;
773 }
Jakob Stoklund Olesen7d7f6042010-05-21 20:02:01 +0000774 // A partial redefine uses Reg unless there is also a full define.
775 return std::make_pair(Use || (PartDef && !FullDef), PartDef || FullDef);
Jakob Stoklund Olesen5d4c1342010-05-19 20:36:22 +0000776}
777
Evan Cheng63254462008-03-05 00:59:57 +0000778/// findRegisterDefOperandIdx() - Returns the operand index that is a def of
Dan Gohman72a0bc12008-05-06 00:20:10 +0000779/// the specified register or -1 if it is not found. If isDead is true, defs
780/// that are not dead are skipped. If TargetRegisterInfo is non-null, then it
781/// also checks if there is a def of a super-register.
Evan Cheng38584512010-05-21 20:53:24 +0000782int
783MachineInstr::findRegisterDefOperandIdx(unsigned Reg, bool isDead, bool Overlap,
784 const TargetRegisterInfo *TRI) const {
785 bool isPhys = TargetRegisterInfo::isPhysicalRegister(Reg);
Evan Chengf7ed82d2007-02-19 21:49:54 +0000786 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
Evan Cheng63254462008-03-05 00:59:57 +0000787 const MachineOperand &MO = getOperand(i);
Jakob Stoklund Olesene7d3f442012-02-14 23:49:37 +0000788 // Accept regmask operands when Overlap is set.
789 // Ignore them when looking for a specific def operand (Overlap == false).
790 if (isPhys && Overlap && MO.isRegMask() && MO.clobbersPhysReg(Reg))
791 return i;
Dan Gohman0d1e9a82008-10-03 15:45:36 +0000792 if (!MO.isReg() || !MO.isDef())
Evan Cheng63254462008-03-05 00:59:57 +0000793 continue;
794 unsigned MOReg = MO.getReg();
Evan Cheng38584512010-05-21 20:53:24 +0000795 bool Found = (MOReg == Reg);
796 if (!Found && TRI && isPhys &&
797 TargetRegisterInfo::isPhysicalRegister(MOReg)) {
798 if (Overlap)
799 Found = TRI->regsOverlap(MOReg, Reg);
800 else
801 Found = TRI->isSubRegister(MOReg, Reg);
802 }
803 if (Found && (!isDead || MO.isDead()))
804 return i;
Evan Chengf7ed82d2007-02-19 21:49:54 +0000805 }
Evan Cheng63254462008-03-05 00:59:57 +0000806 return -1;
Evan Chengf7ed82d2007-02-19 21:49:54 +0000807}
Evan Cheng4d728b02007-05-15 01:26:09 +0000808
Evan Cheng5983bdb2007-05-29 18:35:22 +0000809/// findFirstPredOperandIdx() - Find the index of the first operand in the
810/// operand list that is used to represent the predicate. It returns -1 if
811/// none is found.
812int MachineInstr::findFirstPredOperandIdx() const {
Jim Grosbached16ec42011-08-29 22:24:09 +0000813 // Don't call MCID.findFirstPredOperandIdx() because this variant
814 // is sometimes called on an instruction that's not yet complete, and
815 // so the number of operands is less than the MCID indicates. In
816 // particular, the PTX target does this.
Evan Cheng6cc775f2011-06-28 19:10:37 +0000817 const MCInstrDesc &MCID = getDesc();
818 if (MCID.isPredicable()) {
Evan Cheng4d728b02007-05-15 01:26:09 +0000819 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
Evan Cheng6cc775f2011-06-28 19:10:37 +0000820 if (MCID.OpInfo[i].isPredicate())
Evan Cheng5983bdb2007-05-29 18:35:22 +0000821 return i;
Evan Cheng4d728b02007-05-15 01:26:09 +0000822 }
823
Evan Cheng5983bdb2007-05-29 18:35:22 +0000824 return -1;
Evan Cheng4d728b02007-05-15 01:26:09 +0000825}
Jim Grosbachdee9e8a2011-08-24 16:44:17 +0000826
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000827// MachineOperand::TiedTo is 4 bits wide.
828const unsigned TiedMax = 15;
829
830/// tieOperands - Mark operands at DefIdx and UseIdx as tied to each other.
831///
832/// Use and def operands can be tied together, indicated by a non-zero TiedTo
833/// field. TiedTo can have these values:
834///
835/// 0: Operand is not tied to anything.
836/// 1 to TiedMax-1: Tied to getOperand(TiedTo-1).
837/// TiedMax: Tied to an operand >= TiedMax-1.
838///
839/// The tied def must be one of the first TiedMax operands on a normal
840/// instruction. INLINEASM instructions allow more tied defs.
841///
Jakob Stoklund Olesen5c8eda02012-08-31 20:50:53 +0000842void MachineInstr::tieOperands(unsigned DefIdx, unsigned UseIdx) {
Jakob Stoklund Olesen5c8eda02012-08-31 20:50:53 +0000843 MachineOperand &DefMO = getOperand(DefIdx);
844 MachineOperand &UseMO = getOperand(UseIdx);
845 assert(DefMO.isDef() && "DefIdx must be a def operand");
846 assert(UseMO.isUse() && "UseIdx must be a use operand");
847 assert(!DefMO.isTied() && "Def is already tied to another use");
848 assert(!UseMO.isTied() && "Use is already tied to another def");
849
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000850 if (DefIdx < TiedMax)
851 UseMO.TiedTo = DefIdx + 1;
852 else {
853 // Inline asm can use the group descriptors to find tied operands, but on
854 // normal instruction, the tied def must be within the first TiedMax
855 // operands.
856 assert(isInlineAsm() && "DefIdx out of range");
857 UseMO.TiedTo = TiedMax;
858 }
859
860 // UseIdx can be out of range, we'll search for it in findTiedOperandIdx().
861 DefMO.TiedTo = std::min(UseIdx + 1, TiedMax);
Jakob Stoklund Olesen5c8eda02012-08-31 20:50:53 +0000862}
863
Jakob Stoklund Olesen2b166642012-08-29 00:37:58 +0000864/// Given the index of a tied register operand, find the operand it is tied to.
865/// Defs are tied to uses and vice versa. Returns the index of the tied operand
866/// which must exist.
867unsigned MachineInstr::findTiedOperandIdx(unsigned OpIdx) const {
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000868 const MachineOperand &MO = getOperand(OpIdx);
869 assert(MO.isTied() && "Operand isn't tied");
Jakob Stoklund Olesen2b166642012-08-29 00:37:58 +0000870
Jakob Stoklund Olesen0a09da82012-09-04 18:36:28 +0000871 // Normally TiedTo is in range.
872 if (MO.TiedTo < TiedMax)
873 return MO.TiedTo - 1;
874
875 // Uses on normal instructions can be out of range.
876 if (!isInlineAsm()) {
877 // Normal tied defs must be in the 0..TiedMax-1 range.
878 if (MO.isUse())
879 return TiedMax - 1;
880 // MO is a def. Search for the tied use.
881 for (unsigned i = TiedMax - 1, e = getNumOperands(); i != e; ++i) {
882 const MachineOperand &UseMO = getOperand(i);
883 if (UseMO.isReg() && UseMO.isUse() && UseMO.TiedTo == OpIdx + 1)
884 return i;
885 }
886 llvm_unreachable("Can't find tied use");
887 }
888
889 // Now deal with inline asm by parsing the operand group descriptor flags.
890 // Find the beginning of each operand group.
891 SmallVector<unsigned, 8> GroupIdx;
892 unsigned OpIdxGroup = ~0u;
893 unsigned NumOps;
894 for (unsigned i = InlineAsm::MIOp_FirstOperand, e = getNumOperands(); i < e;
895 i += NumOps) {
896 const MachineOperand &FlagMO = getOperand(i);
897 assert(FlagMO.isImm() && "Invalid tied operand on inline asm");
898 unsigned CurGroup = GroupIdx.size();
899 GroupIdx.push_back(i);
900 NumOps = 1 + InlineAsm::getNumOperandRegisters(FlagMO.getImm());
901 // OpIdx belongs to this operand group.
902 if (OpIdx > i && OpIdx < i + NumOps)
903 OpIdxGroup = CurGroup;
904 unsigned TiedGroup;
905 if (!InlineAsm::isUseOperandTiedToDef(FlagMO.getImm(), TiedGroup))
906 continue;
907 // Operands in this group are tied to operands in TiedGroup which must be
908 // earlier. Find the number of operands between the two groups.
909 unsigned Delta = i - GroupIdx[TiedGroup];
910
911 // OpIdx is a use tied to TiedGroup.
912 if (OpIdxGroup == CurGroup)
913 return OpIdx - Delta;
914
915 // OpIdx is a def tied to this use group.
916 if (OpIdxGroup == TiedGroup)
917 return OpIdx + Delta;
918 }
919 llvm_unreachable("Invalid tied operand on inline asm");
Jakob Stoklund Olesen2b166642012-08-29 00:37:58 +0000920}
921
Dan Gohmanc90f51c2010-05-13 20:34:42 +0000922/// clearKillInfo - Clears kill flags on all operands.
923///
924void MachineInstr::clearKillInfo() {
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000925 for (MachineOperand &MO : operands()) {
Dan Gohmanc90f51c2010-05-13 20:34:42 +0000926 if (MO.isReg() && MO.isUse())
927 MO.setIsKill(false);
928 }
929}
930
Geoff Berryd37dc772018-01-29 18:47:48 +0000931void MachineInstr::substituteRegister(unsigned FromReg, unsigned ToReg,
Jakob Stoklund Olesena8ad9772010-06-02 22:47:25 +0000932 unsigned SubIdx,
Geoff Berryf8bf2ec2018-02-23 18:25:08 +0000933 const TargetRegisterInfo &RegInfo) {
Jakob Stoklund Olesena8ad9772010-06-02 22:47:25 +0000934 if (TargetRegisterInfo::isPhysicalRegister(ToReg)) {
935 if (SubIdx)
936 ToReg = RegInfo.getSubReg(ToReg, SubIdx);
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000937 for (MachineOperand &MO : operands()) {
Jakob Stoklund Olesena8ad9772010-06-02 22:47:25 +0000938 if (!MO.isReg() || MO.getReg() != FromReg)
939 continue;
940 MO.substPhysReg(ToReg, RegInfo);
941 }
942 } else {
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +0000943 for (MachineOperand &MO : operands()) {
Jakob Stoklund Olesena8ad9772010-06-02 22:47:25 +0000944 if (!MO.isReg() || MO.getReg() != FromReg)
945 continue;
946 MO.substVirtReg(ToReg, SubIdx, RegInfo);
947 }
948 }
949}
950
Evan Cheng7d98a482008-07-03 09:09:37 +0000951/// isSafeToMove - Return true if it is safe to move this instruction. If
952/// SawStore is set to true, it means that there is a store (or call) between
953/// the instruction's location and its intended destination.
Matthias Braun07066cc2015-05-19 21:22:20 +0000954bool MachineInstr::isSafeToMove(AliasAnalysis *AA, bool &SawStore) const {
Evan Cheng399e1102008-03-13 00:44:09 +0000955 // Ignore stuff that we obviously can't move.
Jakob Stoklund Olesen813a1092012-08-29 20:48:45 +0000956 //
957 // Treat volatile loads as stores. This is not strictly necessary for
Jakob Stoklund Olesend92e2bc2012-09-04 18:44:43 +0000958 // volatiles, but it is required for atomic loads. It is not allowed to move
Jakob Stoklund Olesen813a1092012-08-29 20:48:45 +0000959 // a load across an atomic load with Ordering > Monotonic.
Alex Bradburyfa18b9e2017-11-08 20:19:16 +0000960 if (mayStore() || isCall() || isPHI() ||
Jakob Stoklund Olesencea3e772012-08-29 21:19:21 +0000961 (mayLoad() && hasOrderedMemoryRef())) {
Evan Cheng399e1102008-03-13 00:44:09 +0000962 SawStore = true;
963 return false;
964 }
Evan Cheng0638c202011-01-07 21:08:26 +0000965
Rafael Espindolab1f25f12014-03-07 06:08:31 +0000966 if (isPosition() || isDebugValue() || isTerminator() ||
967 hasUnmodeledSideEffects())
Evan Cheng399e1102008-03-13 00:44:09 +0000968 return false;
969
970 // See if this instruction does a load. If so, we have to guarantee that the
971 // loaded value doesn't change between the load and the its intended
972 // destination. The check for isInvariantLoad gives the targe the chance to
973 // classify the load as always returning a constant, e.g. a constant pool
974 // load.
Justin Lebard98cf002016-09-10 01:03:20 +0000975 if (mayLoad() && !isDereferenceableInvariantLoad(AA))
Evan Cheng399e1102008-03-13 00:44:09 +0000976 // Otherwise, this is a real load. If there is a store between the load and
Jakob Stoklund Olesen813a1092012-08-29 20:48:45 +0000977 // end of block, we can't move it.
978 return !SawStore;
Dan Gohman7c59ed62008-09-24 00:06:15 +0000979
Evan Cheng399e1102008-03-13 00:44:09 +0000980 return true;
981}
982
Eli Friedman93f47e52017-03-09 23:33:36 +0000983bool MachineInstr::mayAlias(AliasAnalysis *AA, MachineInstr &Other,
984 bool UseTBAA) {
Justin Bognerfdf9bf42017-10-10 23:50:49 +0000985 const MachineFunction *MF = getMF();
Eli Friedman93f47e52017-03-09 23:33:36 +0000986 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
Balaram Makam42adadf2017-08-30 14:57:12 +0000987 const MachineFrameInfo &MFI = MF->getFrameInfo();
Eli Friedman93f47e52017-03-09 23:33:36 +0000988
989 // If neither instruction stores to memory, they can't alias in any
990 // meaningful way, even if they read from the same address.
991 if (!mayStore() && !Other.mayStore())
992 return false;
993
994 // Let the target decide if memory accesses cannot possibly overlap.
995 if (TII->areMemAccessesTriviallyDisjoint(*this, Other, AA))
996 return false;
997
Eli Friedman93f47e52017-03-09 23:33:36 +0000998 // FIXME: Need to handle multiple memory operands to support all targets.
999 if (!hasOneMemOperand() || !Other.hasOneMemOperand())
1000 return true;
1001
1002 MachineMemOperand *MMOa = *memoperands_begin();
1003 MachineMemOperand *MMOb = *Other.memoperands_begin();
1004
Eli Friedman93f47e52017-03-09 23:33:36 +00001005 // The following interface to AA is fashioned after DAGCombiner::isAlias
1006 // and operates with MachineMemOperand offset with some important
1007 // assumptions:
1008 // - LLVM fundamentally assumes flat address spaces.
1009 // - MachineOperand offset can *only* result from legalization and
1010 // cannot affect queries other than the trivial case of overlap
1011 // checking.
1012 // - These offsets never wrap and never step outside
1013 // of allocated objects.
1014 // - There should never be any negative offsets here.
1015 //
1016 // FIXME: Modify API to hide this math from "user"
Balaram Makam42adadf2017-08-30 14:57:12 +00001017 // Even before we go to AA we can reason locally about some
Eli Friedman93f47e52017-03-09 23:33:36 +00001018 // memory objects. It can save compile time, and possibly catch some
1019 // corner cases not currently covered.
1020
Balaram Makam42adadf2017-08-30 14:57:12 +00001021 int64_t OffsetA = MMOa->getOffset();
1022 int64_t OffsetB = MMOb->getOffset();
Eli Friedman93f47e52017-03-09 23:33:36 +00001023
Balaram Makam42adadf2017-08-30 14:57:12 +00001024 int64_t MinOffset = std::min(OffsetA, OffsetB);
1025 int64_t WidthA = MMOa->getSize();
1026 int64_t WidthB = MMOb->getSize();
1027 const Value *ValA = MMOa->getValue();
1028 const Value *ValB = MMOb->getValue();
1029 bool SameVal = (ValA && ValB && (ValA == ValB));
1030 if (!SameVal) {
1031 const PseudoSourceValue *PSVa = MMOa->getPseudoValue();
1032 const PseudoSourceValue *PSVb = MMOb->getPseudoValue();
1033 if (PSVa && ValB && !PSVa->mayAlias(&MFI))
1034 return false;
1035 if (PSVb && ValA && !PSVb->mayAlias(&MFI))
1036 return false;
1037 if (PSVa && PSVb && (PSVa == PSVb))
1038 SameVal = true;
1039 }
Eli Friedman93f47e52017-03-09 23:33:36 +00001040
Balaram Makam42adadf2017-08-30 14:57:12 +00001041 if (SameVal) {
1042 int64_t MaxOffset = std::max(OffsetA, OffsetB);
1043 int64_t LowWidth = (MinOffset == OffsetA) ? WidthA : WidthB;
1044 return (MinOffset + LowWidth > MaxOffset);
1045 }
1046
1047 if (!AA)
1048 return true;
1049
1050 if (!ValA || !ValB)
1051 return true;
1052
1053 assert((OffsetA >= 0) && "Negative MachineMemOperand offset");
1054 assert((OffsetB >= 0) && "Negative MachineMemOperand offset");
1055
1056 int64_t Overlapa = WidthA + OffsetA - MinOffset;
1057 int64_t Overlapb = WidthB + OffsetB - MinOffset;
1058
1059 AliasResult AAResult = AA->alias(
1060 MemoryLocation(ValA, Overlapa,
1061 UseTBAA ? MMOa->getAAInfo() : AAMDNodes()),
1062 MemoryLocation(ValB, Overlapb,
1063 UseTBAA ? MMOb->getAAInfo() : AAMDNodes()));
Eli Friedman93f47e52017-03-09 23:33:36 +00001064
1065 return (AAResult != NoAlias);
1066}
1067
Jakob Stoklund Olesencea3e772012-08-29 21:19:21 +00001068/// hasOrderedMemoryRef - Return true if this instruction may have an ordered
1069/// or volatile memory reference, or if the information describing the memory
1070/// reference is not available. Return false if it is known to have no ordered
1071/// memory references.
1072bool MachineInstr::hasOrderedMemoryRef() const {
Dan Gohman7c59ed62008-09-24 00:06:15 +00001073 // An instruction known never to access memory won't have a volatile access.
Evan Cheng7f8e5632011-12-07 07:15:52 +00001074 if (!mayStore() &&
1075 !mayLoad() &&
1076 !isCall() &&
Evan Cheng6eb516d2011-01-07 23:50:32 +00001077 !hasUnmodeledSideEffects())
Dan Gohman7c59ed62008-09-24 00:06:15 +00001078 return false;
1079
1080 // Otherwise, if the instruction has no memory reference information,
1081 // conservatively assume it wasn't preserved.
1082 if (memoperands_empty())
1083 return true;
Jim Grosbachdee9e8a2011-08-24 16:44:17 +00001084
Justin Lebardede81e2016-07-13 22:35:19 +00001085 // Check if any of our memory operands are ordered.
Eugene Zelenko4e9736b2017-05-31 01:10:10 +00001086 return llvm::any_of(memoperands(), [](const MachineMemOperand *MMO) {
Justin Lebardede81e2016-07-13 22:35:19 +00001087 return !MMO->isUnordered();
1088 });
Dan Gohman7c59ed62008-09-24 00:06:15 +00001089}
1090
Justin Lebard98cf002016-09-10 01:03:20 +00001091/// isDereferenceableInvariantLoad - Return true if this instruction will never
1092/// trap and is loading from a location whose value is invariant across a run of
1093/// this function.
1094bool MachineInstr::isDereferenceableInvariantLoad(AliasAnalysis *AA) const {
Dan Gohmanbe8137b2009-10-07 17:38:06 +00001095 // If the instruction doesn't load at all, it isn't an invariant load.
Evan Cheng7f8e5632011-12-07 07:15:52 +00001096 if (!mayLoad())
Dan Gohmanbe8137b2009-10-07 17:38:06 +00001097 return false;
1098
1099 // If the instruction has lost its memoperands, conservatively assume that
1100 // it may not be an invariant load.
1101 if (memoperands_empty())
1102 return false;
1103
Matthias Braun941a7052016-07-28 18:40:00 +00001104 const MachineFrameInfo &MFI = getParent()->getParent()->getFrameInfo();
Dan Gohmanbe8137b2009-10-07 17:38:06 +00001105
Justin Lebardede81e2016-07-13 22:35:19 +00001106 for (MachineMemOperand *MMO : memoperands()) {
1107 if (MMO->isVolatile()) return false;
1108 if (MMO->isStore()) return false;
Justin Lebaradbf09e2016-09-11 01:38:58 +00001109 if (MMO->isInvariant() && MMO->isDereferenceable())
1110 continue;
Nick Lewyckyaad475b2014-04-15 07:22:52 +00001111
1112 // A load from a constant PseudoSourceValue is invariant.
Justin Lebardede81e2016-07-13 22:35:19 +00001113 if (const PseudoSourceValue *PSV = MMO->getPseudoValue())
Matthias Braun941a7052016-07-28 18:40:00 +00001114 if (PSV->isConstant(&MFI))
Nick Lewyckyaad475b2014-04-15 07:22:52 +00001115 continue;
1116
Justin Lebardede81e2016-07-13 22:35:19 +00001117 if (const Value *V = MMO->getValue()) {
Dan Gohmanbe8137b2009-10-07 17:38:06 +00001118 // If we have an AliasAnalysis, ask it whether the memory is constant.
Chandler Carruthac80dc72015-06-17 07:18:54 +00001119 if (AA &&
1120 AA->pointsToConstantMemory(
Justin Lebardede81e2016-07-13 22:35:19 +00001121 MemoryLocation(V, MMO->getSize(), MMO->getAAInfo())))
Dan Gohmanbe8137b2009-10-07 17:38:06 +00001122 continue;
1123 }
1124
1125 // Otherwise assume conservatively.
1126 return false;
1127 }
1128
1129 // Everything checks out.
1130 return true;
1131}
1132
Evan Cheng71453822009-12-03 02:31:43 +00001133/// isConstantValuePHI - If the specified instruction is a PHI that always
1134/// merges together the same virtual register, return the register, otherwise
1135/// return 0.
1136unsigned MachineInstr::isConstantValuePHI() const {
Chris Lattnerb06015a2010-02-09 19:54:29 +00001137 if (!isPHI())
Evan Cheng71453822009-12-03 02:31:43 +00001138 return 0;
Evan Cheng5c668a22009-12-07 23:10:34 +00001139 assert(getNumOperands() >= 3 &&
1140 "It's illegal to have a PHI without source operands");
Evan Cheng71453822009-12-03 02:31:43 +00001141
1142 unsigned Reg = getOperand(1).getReg();
1143 for (unsigned i = 3, e = getNumOperands(); i < e; i += 2)
1144 if (getOperand(i).getReg() != Reg)
1145 return 0;
1146 return Reg;
1147}
1148
Evan Cheng6eb516d2011-01-07 23:50:32 +00001149bool MachineInstr::hasUnmodeledSideEffects() const {
Evan Cheng7f8e5632011-12-07 07:15:52 +00001150 if (hasProperty(MCID::UnmodeledSideEffects))
Evan Cheng6eb516d2011-01-07 23:50:32 +00001151 return true;
1152 if (isInlineAsm()) {
1153 unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
1154 if (ExtraInfo & InlineAsm::Extra_HasSideEffects)
1155 return true;
1156 }
1157
1158 return false;
1159}
1160
Michael Kupersteinbc7f99a2015-08-12 10:14:58 +00001161bool MachineInstr::isLoadFoldBarrier() const {
1162 return mayStore() || isCall() || hasUnmodeledSideEffects();
1163}
1164
Evan Chengb083c472010-04-08 20:02:37 +00001165/// allDefsAreDead - Return true if all the defs of this instruction are dead.
1166///
1167bool MachineInstr::allDefsAreDead() const {
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +00001168 for (const MachineOperand &MO : operands()) {
Evan Chengb083c472010-04-08 20:02:37 +00001169 if (!MO.isReg() || MO.isUse())
1170 continue;
1171 if (!MO.isDead())
1172 return false;
1173 }
1174 return true;
1175}
1176
Evan Cheng21eedfb2010-10-22 21:49:09 +00001177/// copyImplicitOps - Copy implicit register operands from specified
1178/// instruction to this instruction.
Jakob Stoklund Olesen33f5d142012-12-20 22:54:02 +00001179void MachineInstr::copyImplicitOps(MachineFunction &MF,
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +00001180 const MachineInstr &MI) {
1181 for (unsigned i = MI.getDesc().getNumOperands(), e = MI.getNumOperands();
Evan Cheng21eedfb2010-10-22 21:49:09 +00001182 i != e; ++i) {
Duncan P. N. Exon Smithfd8cc232016-02-27 20:01:33 +00001183 const MachineOperand &MO = MI.getOperand(i);
Lang Hames7c8189c2014-03-17 01:22:54 +00001184 if ((MO.isReg() && MO.isImplicit()) || MO.isRegMask())
Jakob Stoklund Olesen33f5d142012-12-20 22:54:02 +00001185 addOperand(MF, MO);
Evan Cheng21eedfb2010-10-22 21:49:09 +00001186 }
1187}
1188
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001189bool MachineInstr::hasComplexRegisterTies() const {
1190 const MCInstrDesc &MCID = getDesc();
1191 for (unsigned I = 0, E = getNumOperands(); I < E; ++I) {
1192 const auto &Operand = getOperand(I);
1193 if (!Operand.isReg() || Operand.isDef())
1194 // Ignore the defined registers as MCID marks only the uses as tied.
1195 continue;
1196 int ExpectedTiedIdx = MCID.getOperandConstraint(I, MCOI::TIED_TO);
1197 int TiedIdx = Operand.isTied() ? int(findTiedOperandIdx(I)) : -1;
1198 if (ExpectedTiedIdx != TiedIdx)
1199 return true;
1200 }
1201 return false;
1202}
1203
1204LLT MachineInstr::getTypeToPrint(unsigned OpIdx, SmallBitVector &PrintedTypes,
1205 const MachineRegisterInfo &MRI) const {
1206 const MachineOperand &Op = getOperand(OpIdx);
1207 if (!Op.isReg())
1208 return LLT{};
1209
1210 if (isVariadic() || OpIdx >= getNumExplicitOperands())
1211 return MRI.getType(Op.getReg());
1212
1213 auto &OpInfo = getDesc().OpInfo[OpIdx];
1214 if (!OpInfo.isGenericType())
1215 return MRI.getType(Op.getReg());
1216
1217 if (PrintedTypes[OpInfo.getGenericTypeIndex()])
1218 return LLT{};
1219
1220 PrintedTypes.set(OpInfo.getGenericTypeIndex());
1221 return MRI.getType(Op.getReg());
1222}
1223
Aaron Ballman615eb472017-10-15 14:32:27 +00001224#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
Matthias Brauna4976c62017-01-29 18:20:42 +00001225LLVM_DUMP_METHOD void MachineInstr::dump() const {
Sebastian Pop77794842016-12-21 01:41:12 +00001226 dbgs() << " ";
Matthias Brauna4976c62017-01-29 18:20:42 +00001227 print(dbgs());
Mon P Wangdfcc1ff2008-10-10 01:43:55 +00001228}
Matthias Braun8c209aa2017-01-28 02:02:38 +00001229#endif
Mon P Wangdfcc1ff2008-10-10 01:43:55 +00001230
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001231void MachineInstr::print(raw_ostream &OS, bool IsStandalone, bool SkipOpers,
Francis Visoiu Mistrih378b5f32018-01-18 17:59:06 +00001232 bool SkipDebugLoc, const TargetInstrInfo *TII) const {
Duncan P. N. Exon Smithc0374522015-06-26 23:18:44 +00001233 const Module *M = nullptr;
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001234 const Function *F = nullptr;
1235 if (const MachineFunction *MF = getMFIfAvailable(*this)) {
1236 F = &MF->getFunction();
1237 M = F->getParent();
1238 }
Duncan P. N. Exon Smithc0374522015-06-26 23:18:44 +00001239
1240 ModuleSlotTracker MST(M);
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001241 if (F)
1242 MST.incorporateFunction(*F);
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001243 print(OS, MST, IsStandalone, SkipOpers, SkipDebugLoc, TII);
Duncan P. N. Exon Smithf48e9822015-06-26 22:06:47 +00001244}
1245
1246void MachineInstr::print(raw_ostream &OS, ModuleSlotTracker &MST,
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001247 bool IsStandalone, bool SkipOpers, bool SkipDebugLoc,
Ahmed Bougacha43192242017-02-23 19:17:31 +00001248 const TargetInstrInfo *TII) const {
Eric Christopher1cdefae2015-02-27 00:11:34 +00001249 // We can be a bit tidier if we know the MachineFunction.
Craig Topperc0196b12014-04-14 00:51:57 +00001250 const MachineFunction *MF = nullptr;
Eric Christopher1cdefae2015-02-27 00:11:34 +00001251 const TargetRegisterInfo *TRI = nullptr;
Craig Topperc0196b12014-04-14 00:51:57 +00001252 const MachineRegisterInfo *MRI = nullptr;
Tim Northover6b3bd612016-07-29 20:32:59 +00001253 const TargetIntrinsicInfo *IntrinsicInfo = nullptr;
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001254 tryToGetTargetInfo(*this, TRI, MRI, IntrinsicInfo, TII);
Tim Northover6b3bd612016-07-29 20:32:59 +00001255
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001256 if (isCFIInstruction())
1257 assert(getNumOperands() == 1 && "Expected 1 operand in CFI instruction");
Jakob Stoklund Olesen0ff2c112010-07-28 18:35:46 +00001258
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001259 SmallBitVector PrintedTypes(8);
1260 bool ShouldPrintRegisterTies = hasComplexRegisterTies();
1261 auto getTiedOperandIdx = [&](unsigned OpIdx) {
1262 if (!ShouldPrintRegisterTies)
1263 return 0U;
1264 const MachineOperand &MO = getOperand(OpIdx);
1265 if (MO.isReg() && MO.isTied() && !MO.isDef())
1266 return findTiedOperandIdx(OpIdx);
1267 return 0U;
1268 };
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001269 unsigned StartOp = 0;
1270 unsigned e = getNumOperands();
1271
Dan Gohman34341e62009-10-31 20:19:03 +00001272 // Print explicitly defined operands on the left of an assignment syntax.
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001273 while (StartOp < e) {
1274 const MachineOperand &MO = getOperand(StartOp);
1275 if (!MO.isReg() || !MO.isDef() || MO.isImplicit())
1276 break;
1277
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001278 if (StartOp != 0)
1279 OS << ", ";
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001280
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001281 LLT TypeToPrint = MRI ? getTypeToPrint(StartOp, PrintedTypes, *MRI) : LLT{};
1282 unsigned TiedOperandIdx = getTiedOperandIdx(StartOp);
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001283 MO.print(OS, MST, TypeToPrint, /*PrintDef=*/false, IsStandalone,
Francis Visoiu Mistrih378b5f32018-01-18 17:59:06 +00001284 ShouldPrintRegisterTies, TiedOperandIdx, TRI, IntrinsicInfo);
Francis Visoiu Mistrih586444e2018-01-18 14:52:14 +00001285 ++StartOp;
Chris Lattnerac6e9742002-10-30 01:55:38 +00001286 }
Tanya Lattner23dbc812004-06-25 00:13:11 +00001287
Dan Gohman34341e62009-10-31 20:19:03 +00001288 if (StartOp != 0)
1289 OS << " = ";
1290
Francis Visoiu Mistrih72cc21e2018-01-09 16:11:51 +00001291 if (getFlag(MachineInstr::FrameSetup))
1292 OS << "frame-setup ";
1293 else if (getFlag(MachineInstr::FrameDestroy))
1294 OS << "frame-destroy ";
1295
Dan Gohman34341e62009-10-31 20:19:03 +00001296 // Print the opcode name.
Eric Christopher1cdefae2015-02-27 00:11:34 +00001297 if (TII)
1298 OS << TII->getName(getOpcode());
Benjamin Kramerbf152d52012-02-10 13:18:44 +00001299 else
1300 OS << "UNKNOWN";
Misha Brukman835702a2005-04-21 22:36:52 +00001301
Andrew Trickb36388a2013-01-25 07:45:25 +00001302 if (SkipOpers)
1303 return;
1304
Dan Gohman34341e62009-10-31 20:19:03 +00001305 // Print the rest of the operands.
Dan Gohman2745d192009-11-09 19:38:45 +00001306 bool FirstOp = true;
Jakob Stoklund Olesen6b356b12011-06-27 04:08:29 +00001307 unsigned AsmDescOp = ~0u;
1308 unsigned AsmOpCount = 0;
Evan Cheng6eb516d2011-01-07 23:50:32 +00001309
Jakob Stoklund Olesen2318d1e2011-09-29 00:40:51 +00001310 if (isInlineAsm() && e >= InlineAsm::MIOp_FirstOperand) {
Evan Cheng6eb516d2011-01-07 23:50:32 +00001311 // Print asm string.
1312 OS << " ";
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001313 const unsigned OpIdx = InlineAsm::MIOp_AsmString;
1314 LLT TypeToPrint = MRI ? getTypeToPrint(OpIdx, PrintedTypes, *MRI) : LLT{};
Francis Visoiu Mistrihe6fc3ce2017-12-07 17:12:30 +00001315 unsigned TiedOperandIdx = getTiedOperandIdx(OpIdx);
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001316 getOperand(OpIdx).print(OS, MST, TypeToPrint, /*PrintDef=*/true, IsStandalone,
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001317 ShouldPrintRegisterTies, TiedOperandIdx, TRI,
1318 IntrinsicInfo);
Evan Cheng6eb516d2011-01-07 23:50:32 +00001319
Eric Christopher0cb6fd92013-01-11 18:12:39 +00001320 // Print HasSideEffects, MayLoad, MayStore, IsAlignStack
Evan Cheng6eb516d2011-01-07 23:50:32 +00001321 unsigned ExtraInfo = getOperand(InlineAsm::MIOp_ExtraInfo).getImm();
1322 if (ExtraInfo & InlineAsm::Extra_HasSideEffects)
1323 OS << " [sideeffect]";
Eric Christopher0cb6fd92013-01-11 18:12:39 +00001324 if (ExtraInfo & InlineAsm::Extra_MayLoad)
1325 OS << " [mayload]";
1326 if (ExtraInfo & InlineAsm::Extra_MayStore)
1327 OS << " [maystore]";
Wei Ding0526e7f2016-06-22 18:51:08 +00001328 if (ExtraInfo & InlineAsm::Extra_IsConvergent)
1329 OS << " [isconvergent]";
Evan Cheng6eb516d2011-01-07 23:50:32 +00001330 if (ExtraInfo & InlineAsm::Extra_IsAlignStack)
1331 OS << " [alignstack]";
Chad Rosiercbd2a192012-09-05 22:17:43 +00001332 if (getInlineAsmDialect() == InlineAsm::AD_ATT)
Chad Rosier994f4042012-09-05 21:00:58 +00001333 OS << " [attdialect]";
Chad Rosiercbd2a192012-09-05 22:17:43 +00001334 if (getInlineAsmDialect() == InlineAsm::AD_Intel)
Chad Rosier994f4042012-09-05 21:00:58 +00001335 OS << " [inteldialect]";
Evan Cheng6eb516d2011-01-07 23:50:32 +00001336
Jakob Stoklund Olesen6b356b12011-06-27 04:08:29 +00001337 StartOp = AsmDescOp = InlineAsm::MIOp_FirstOperand;
Evan Cheng6eb516d2011-01-07 23:50:32 +00001338 FirstOp = false;
1339 }
1340
Chris Lattnerac6e9742002-10-30 01:55:38 +00001341 for (unsigned i = StartOp, e = getNumOperands(); i != e; ++i) {
Dan Gohman2745d192009-11-09 19:38:45 +00001342 const MachineOperand &MO = getOperand(i);
1343
Dan Gohman2745d192009-11-09 19:38:45 +00001344 if (FirstOp) FirstOp = false; else OS << ",";
Chris Lattnerac6e9742002-10-30 01:55:38 +00001345 OS << " ";
Francis Visoiu Mistrih7d9bef82018-01-09 17:31:07 +00001346
Evan Chengd4d1a512010-04-28 20:03:13 +00001347 if (isDebugValue() && MO.isMetadata()) {
1348 // Pretty print DBG_VALUE instructions.
Duncan P. N. Exon Smitha9308c42015-04-29 16:38:44 +00001349 auto *DIV = dyn_cast<DILocalVariable>(MO.getMetadata());
Duncan P. N. Exon Smith7348dda2015-04-14 02:22:36 +00001350 if (DIV && !DIV->getName().empty())
1351 OS << "!\"" << DIV->getName() << '\"';
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001352 else {
1353 LLT TypeToPrint = MRI ? getTypeToPrint(i, PrintedTypes, *MRI) : LLT{};
Francis Visoiu Mistrihe6fc3ce2017-12-07 17:12:30 +00001354 unsigned TiedOperandIdx = getTiedOperandIdx(i);
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001355 MO.print(OS, MST, TypeToPrint, /*PrintDef=*/true, IsStandalone,
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001356 ShouldPrintRegisterTies, TiedOperandIdx, TRI, IntrinsicInfo);
1357 }
Jakob Stoklund Olesen6b356b12011-06-27 04:08:29 +00001358 } else if (i == AsmDescOp && MO.isImm()) {
1359 // Pretty print the inline asm operand descriptor.
1360 OS << '$' << AsmOpCount++;
1361 unsigned Flag = MO.getImm();
1362 switch (InlineAsm::getKind(Flag)) {
Jakob Stoklund Olesen24abd9d2011-10-12 23:37:29 +00001363 case InlineAsm::Kind_RegUse: OS << ":[reguse"; break;
1364 case InlineAsm::Kind_RegDef: OS << ":[regdef"; break;
1365 case InlineAsm::Kind_RegDefEarlyClobber: OS << ":[regdef-ec"; break;
1366 case InlineAsm::Kind_Clobber: OS << ":[clobber"; break;
1367 case InlineAsm::Kind_Imm: OS << ":[imm"; break;
1368 case InlineAsm::Kind_Mem: OS << ":[mem"; break;
1369 default: OS << ":[??" << InlineAsm::getKind(Flag); break;
Jakob Stoklund Olesen6b356b12011-06-27 04:08:29 +00001370 }
1371
Jakob Stoklund Olesen24abd9d2011-10-12 23:37:29 +00001372 unsigned RCID = 0;
Simon Dardisd32a2d32016-07-18 13:17:31 +00001373 if (!InlineAsm::isImmKind(Flag) && !InlineAsm::isMemKind(Flag) &&
1374 InlineAsm::hasRegClassConstraint(Flag, RCID)) {
Eric Christopher1cdefae2015-02-27 00:11:34 +00001375 if (TRI) {
1376 OS << ':' << TRI->getRegClassName(TRI->getRegClass(RCID));
Craig Toppercf0444b2014-11-17 05:50:14 +00001377 } else
Jakob Stoklund Olesen24abd9d2011-10-12 23:37:29 +00001378 OS << ":RC" << RCID;
Nick Lewycky84882252011-10-13 00:54:59 +00001379 }
Jakob Stoklund Olesen24abd9d2011-10-12 23:37:29 +00001380
Simon Dardisd32a2d32016-07-18 13:17:31 +00001381 if (InlineAsm::isMemKind(Flag)) {
1382 unsigned MCID = InlineAsm::getMemoryConstraintID(Flag);
1383 switch (MCID) {
1384 case InlineAsm::Constraint_es: OS << ":es"; break;
1385 case InlineAsm::Constraint_i: OS << ":i"; break;
1386 case InlineAsm::Constraint_m: OS << ":m"; break;
1387 case InlineAsm::Constraint_o: OS << ":o"; break;
1388 case InlineAsm::Constraint_v: OS << ":v"; break;
1389 case InlineAsm::Constraint_Q: OS << ":Q"; break;
1390 case InlineAsm::Constraint_R: OS << ":R"; break;
1391 case InlineAsm::Constraint_S: OS << ":S"; break;
1392 case InlineAsm::Constraint_T: OS << ":T"; break;
1393 case InlineAsm::Constraint_Um: OS << ":Um"; break;
1394 case InlineAsm::Constraint_Un: OS << ":Un"; break;
1395 case InlineAsm::Constraint_Uq: OS << ":Uq"; break;
1396 case InlineAsm::Constraint_Us: OS << ":Us"; break;
1397 case InlineAsm::Constraint_Ut: OS << ":Ut"; break;
1398 case InlineAsm::Constraint_Uv: OS << ":Uv"; break;
1399 case InlineAsm::Constraint_Uy: OS << ":Uy"; break;
1400 case InlineAsm::Constraint_X: OS << ":X"; break;
1401 case InlineAsm::Constraint_Z: OS << ":Z"; break;
1402 case InlineAsm::Constraint_ZC: OS << ":ZC"; break;
1403 case InlineAsm::Constraint_Zy: OS << ":Zy"; break;
1404 default: OS << ":?"; break;
1405 }
1406 }
1407
Jakob Stoklund Olesen6b356b12011-06-27 04:08:29 +00001408 unsigned TiedTo = 0;
1409 if (InlineAsm::isUseOperandTiedToDef(Flag, TiedTo))
Jakob Stoklund Olesen24abd9d2011-10-12 23:37:29 +00001410 OS << " tiedto:$" << TiedTo;
1411
1412 OS << ']';
Jakob Stoklund Olesen6b356b12011-06-27 04:08:29 +00001413
1414 // Compute the index of the next operand descriptor.
1415 AsmDescOp += 1 + InlineAsm::getNumOperandRegisters(Flag);
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001416 } else {
1417 LLT TypeToPrint = MRI ? getTypeToPrint(i, PrintedTypes, *MRI) : LLT{};
Francis Visoiu Mistrihe6fc3ce2017-12-07 17:12:30 +00001418 unsigned TiedOperandIdx = getTiedOperandIdx(i);
Francis Visoiu Mistrih440f69c2017-12-08 22:53:21 +00001419 if (MO.isImm() && isOperandSubregIdx(i))
Francis Visoiu Mistrihecd0b832018-01-16 10:53:11 +00001420 MachineOperand::printSubRegIdx(OS, MO.getImm(), TRI);
Francis Visoiu Mistrih440f69c2017-12-08 22:53:21 +00001421 else
Francis Visoiu Mistriheb3f76f2018-01-18 18:05:15 +00001422 MO.print(OS, MST, TypeToPrint, /*PrintDef=*/true, IsStandalone,
Francis Visoiu Mistrih440f69c2017-12-08 22:53:21 +00001423 ShouldPrintRegisterTies, TiedOperandIdx, TRI, IntrinsicInfo);
Francis Visoiu Mistriha8a83d12017-12-07 10:40:31 +00001424 }
Dan Gohman2745d192009-11-09 19:38:45 +00001425 }
1426
Francis Visoiu Mistrih548add92018-01-19 11:44:42 +00001427 if (!SkipDebugLoc) {
1428 if (const DebugLoc &DL = getDebugLoc()) {
1429 if (!FirstOp)
1430 OS << ',';
1431 OS << " debug-location ";
1432 DL->printAsOperand(OS, MST);
1433 }
1434 }
1435
Dan Gohman34341e62009-10-31 20:19:03 +00001436 bool HaveSemi = false;
Dan Gohman3b460302008-07-07 23:14:23 +00001437 if (!memoperands_empty()) {
Yaron Kerenc47c6ac2016-01-02 13:40:36 +00001438 if (!HaveSemi) {
1439 OS << ";";
1440 HaveSemi = true;
1441 }
Dan Gohman34341e62009-10-31 20:19:03 +00001442
1443 OS << " mem:";
Dan Gohman48b185d2009-09-25 20:36:54 +00001444 for (mmo_iterator i = memoperands_begin(), e = memoperands_end();
1445 i != e; ++i) {
Duncan P. N. Exon Smithf48e9822015-06-26 22:06:47 +00001446 (*i)->print(OS, MST);
Benjamin Kramerb6d0bd42014-03-02 12:27:27 +00001447 if (std::next(i) != e)
Dan Gohmanc0353bf2009-09-23 01:33:16 +00001448 OS << " ";
Dan Gohman2d489b52008-02-06 22:27:42 +00001449 }
1450 }
1451
Francis Visoiu Mistrih548add92018-01-19 11:44:42 +00001452 if (SkipDebugLoc)
1453 return;
1454
Anton Korobeynikov65cff4142011-03-05 18:43:04 +00001455 // Print debug location information.
Duncan P. N. Exon Smithc5bd3e02015-04-03 16:23:04 +00001456 if (isDebugValue() && getOperand(e - 2).isMetadata()) {
Yaron Kerenc47c6ac2016-01-02 13:40:36 +00001457 if (!HaveSemi)
1458 OS << ";";
Duncan P. N. Exon Smitha9308c42015-04-29 16:38:44 +00001459 auto *DV = cast<DILocalVariable>(getOperand(e - 2).getMetadata());
Duncan P. N. Exon Smith7348dda2015-04-14 02:22:36 +00001460 OS << " line no:" << DV->getLine();
Duncan P. N. Exon Smith62e0f452015-04-15 22:29:27 +00001461 if (auto *InlinedAt = debugLoc->getInlinedAt()) {
Duncan P. N. Exon Smith9dffcd02015-03-30 19:14:47 +00001462 DebugLoc InlinedAtDL(InlinedAt);
1463 if (InlinedAtDL && MF) {
Devang Pateld61b1d52011-08-04 20:44:26 +00001464 OS << " inlined @[ ";
NAKAMURA Takumi0a7d0ad2015-09-22 11:15:07 +00001465 InlinedAtDL.print(OS);
Devang Pateld61b1d52011-08-04 20:44:26 +00001466 OS << " ]";
1467 }
1468 }
Adrian Prantl87b7eb92014-10-01 18:55:02 +00001469 if (isIndirectDebugValue())
1470 OS << " indirect";
Bill Wendling1a0a3d02009-02-19 21:44:55 +00001471 }
Francis Visoiu Mistrih68ced402018-02-19 15:08:49 +00001472
1473 OS << '\n';
Chris Lattner214808f2002-10-30 00:48:05 +00001474}
1475
Owen Anderson2a8a4852008-01-24 01:10:07 +00001476bool MachineInstr::addRegisterKilled(unsigned IncomingReg,
Dan Gohman3a4be0f2008-02-10 18:45:23 +00001477 const TargetRegisterInfo *RegInfo,
Owen Anderson2a8a4852008-01-24 01:10:07 +00001478 bool AddIfNotFound) {
Evan Cheng6c177732008-04-16 09:41:59 +00001479 bool isPhysReg = TargetRegisterInfo::isPhysicalRegister(IncomingReg);
Jakob Stoklund Olesen54038d72012-06-01 23:28:30 +00001480 bool hasAliases = isPhysReg &&
1481 MCRegAliasIterator(IncomingReg, RegInfo, false).isValid();
Dan Gohmanc7367b42008-09-03 15:56:16 +00001482 bool Found = false;
Evan Cheng6c177732008-04-16 09:41:59 +00001483 SmallVector<unsigned,4> DeadOps;
Bill Wendling7921ad02008-03-03 22:14:33 +00001484 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1485 MachineOperand &MO = getOperand(i);
Jakob Stoklund Olesenf465f062009-08-04 20:09:25 +00001486 if (!MO.isReg() || !MO.isUse() || MO.isUndef())
Evan Cheng6c177732008-04-16 09:41:59 +00001487 continue;
Mandeep Singh Grange5a2f112016-05-10 17:57:27 +00001488
1489 // DEBUG_VALUE nodes do not contribute to code generation and should
1490 // always be ignored. Failure to do so may result in trying to modify
1491 // KILL flags on DEBUG_VALUE nodes.
1492 if (MO.isDebug())
1493 continue;
1494
Evan Cheng6c177732008-04-16 09:41:59 +00001495 unsigned Reg = MO.getReg();
1496 if (!Reg)
1497 continue;
Bill Wendling7921ad02008-03-03 22:14:33 +00001498
Evan Cheng6c177732008-04-16 09:41:59 +00001499 if (Reg == IncomingReg) {
Dan Gohmanc7367b42008-09-03 15:56:16 +00001500 if (!Found) {
1501 if (MO.isKill())
1502 // The register is already marked kill.
1503 return true;
Jakob Stoklund Olesenc59cd9b2009-08-02 19:13:03 +00001504 if (isPhysReg && isRegTiedToDefOperand(i))
1505 // Two-address uses of physregs must not be marked kill.
1506 return true;
Dan Gohmanc7367b42008-09-03 15:56:16 +00001507 MO.setIsKill();
1508 Found = true;
1509 }
1510 } else if (hasAliases && MO.isKill() &&
1511 TargetRegisterInfo::isPhysicalRegister(Reg)) {
Evan Cheng6c177732008-04-16 09:41:59 +00001512 // A super-register kill already exists.
1513 if (RegInfo->isSuperRegister(IncomingReg, Reg))
Dan Gohmanb2612922008-07-03 01:18:51 +00001514 return true;
1515 if (RegInfo->isSubRegister(IncomingReg, Reg))
Evan Cheng6c177732008-04-16 09:41:59 +00001516 DeadOps.push_back(i);
Bill Wendling7921ad02008-03-03 22:14:33 +00001517 }
1518 }
1519
Evan Cheng6c177732008-04-16 09:41:59 +00001520 // Trim unneeded kill operands.
1521 while (!DeadOps.empty()) {
1522 unsigned OpIdx = DeadOps.back();
1523 if (getOperand(OpIdx).isImplicit())
1524 RemoveOperand(OpIdx);
1525 else
1526 getOperand(OpIdx).setIsKill(false);
1527 DeadOps.pop_back();
1528 }
1529
Bill Wendling7921ad02008-03-03 22:14:33 +00001530 // If not found, this means an alias of one of the operands is killed. Add a
Owen Anderson2a8a4852008-01-24 01:10:07 +00001531 // new implicit operand if required.
Dan Gohmanc7367b42008-09-03 15:56:16 +00001532 if (!Found && AddIfNotFound) {
Bill Wendling7921ad02008-03-03 22:14:33 +00001533 addOperand(MachineOperand::CreateReg(IncomingReg,
1534 false /*IsDef*/,
1535 true /*IsImp*/,
1536 true /*IsKill*/));
Owen Anderson2a8a4852008-01-24 01:10:07 +00001537 return true;
1538 }
Dan Gohmanc7367b42008-09-03 15:56:16 +00001539 return Found;
Owen Anderson2a8a4852008-01-24 01:10:07 +00001540}
1541
Jakob Stoklund Olesen8c139a52012-01-26 17:52:15 +00001542void MachineInstr::clearRegisterKills(unsigned Reg,
1543 const TargetRegisterInfo *RegInfo) {
1544 if (!TargetRegisterInfo::isPhysicalRegister(Reg))
Craig Topperc0196b12014-04-14 00:51:57 +00001545 RegInfo = nullptr;
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +00001546 for (MachineOperand &MO : operands()) {
Jakob Stoklund Olesen8c139a52012-01-26 17:52:15 +00001547 if (!MO.isReg() || !MO.isUse() || !MO.isKill())
1548 continue;
1549 unsigned OpReg = MO.getReg();
Matthias Braunaca625a2016-02-24 19:21:48 +00001550 if ((RegInfo && RegInfo->regsOverlap(Reg, OpReg)) || Reg == OpReg)
Jakob Stoklund Olesen8c139a52012-01-26 17:52:15 +00001551 MO.setIsKill(false);
1552 }
1553}
1554
Matthias Braun1965bfa2013-10-10 21:28:38 +00001555bool MachineInstr::addRegisterDead(unsigned Reg,
Dan Gohman3a4be0f2008-02-10 18:45:23 +00001556 const TargetRegisterInfo *RegInfo,
Owen Anderson2a8a4852008-01-24 01:10:07 +00001557 bool AddIfNotFound) {
Matthias Braun1965bfa2013-10-10 21:28:38 +00001558 bool isPhysReg = TargetRegisterInfo::isPhysicalRegister(Reg);
Jakob Stoklund Olesen54038d72012-06-01 23:28:30 +00001559 bool hasAliases = isPhysReg &&
Matthias Braun1965bfa2013-10-10 21:28:38 +00001560 MCRegAliasIterator(Reg, RegInfo, false).isValid();
Dan Gohmanc7367b42008-09-03 15:56:16 +00001561 bool Found = false;
Evan Cheng6c177732008-04-16 09:41:59 +00001562 SmallVector<unsigned,4> DeadOps;
Owen Anderson2a8a4852008-01-24 01:10:07 +00001563 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1564 MachineOperand &MO = getOperand(i);
Dan Gohman0d1e9a82008-10-03 15:45:36 +00001565 if (!MO.isReg() || !MO.isDef())
Evan Cheng6c177732008-04-16 09:41:59 +00001566 continue;
Matthias Braun1965bfa2013-10-10 21:28:38 +00001567 unsigned MOReg = MO.getReg();
1568 if (!MOReg)
Dan Gohmanc7367b42008-09-03 15:56:16 +00001569 continue;
1570
Matthias Braun1965bfa2013-10-10 21:28:38 +00001571 if (MOReg == Reg) {
Jakob Stoklund Olesen76ad3de2011-04-05 16:53:50 +00001572 MO.setIsDead();
1573 Found = true;
Dan Gohmanc7367b42008-09-03 15:56:16 +00001574 } else if (hasAliases && MO.isDead() &&
Matthias Braun1965bfa2013-10-10 21:28:38 +00001575 TargetRegisterInfo::isPhysicalRegister(MOReg)) {
Evan Cheng6c177732008-04-16 09:41:59 +00001576 // There exists a super-register that's marked dead.
Matthias Braun1965bfa2013-10-10 21:28:38 +00001577 if (RegInfo->isSuperRegister(Reg, MOReg))
Dan Gohmanb2612922008-07-03 01:18:51 +00001578 return true;
Matthias Braun1965bfa2013-10-10 21:28:38 +00001579 if (RegInfo->isSubRegister(Reg, MOReg))
Evan Cheng6c177732008-04-16 09:41:59 +00001580 DeadOps.push_back(i);
Owen Anderson2a8a4852008-01-24 01:10:07 +00001581 }
1582 }
1583
Evan Cheng6c177732008-04-16 09:41:59 +00001584 // Trim unneeded dead operands.
1585 while (!DeadOps.empty()) {
1586 unsigned OpIdx = DeadOps.back();
1587 if (getOperand(OpIdx).isImplicit())
1588 RemoveOperand(OpIdx);
1589 else
1590 getOperand(OpIdx).setIsDead(false);
1591 DeadOps.pop_back();
1592 }
1593
Dan Gohmanc7367b42008-09-03 15:56:16 +00001594 // If not found, this means an alias of one of the operands is dead. Add a
1595 // new implicit operand if required.
Chris Lattnerfd682802009-06-24 17:54:48 +00001596 if (Found || !AddIfNotFound)
1597 return Found;
Jim Grosbachdee9e8a2011-08-24 16:44:17 +00001598
Matthias Braun1965bfa2013-10-10 21:28:38 +00001599 addOperand(MachineOperand::CreateReg(Reg,
Chris Lattnerfd682802009-06-24 17:54:48 +00001600 true /*IsDef*/,
1601 true /*IsImp*/,
1602 false /*IsKill*/,
1603 true /*IsDead*/));
1604 return true;
Owen Anderson2a8a4852008-01-24 01:10:07 +00001605}
Jakob Stoklund Olesen77255262010-01-06 00:29:28 +00001606
Matthias Braun26e7ea62015-02-04 19:35:16 +00001607void MachineInstr::clearRegisterDeads(unsigned Reg) {
1608 for (MachineOperand &MO : operands()) {
1609 if (!MO.isReg() || !MO.isDef() || MO.getReg() != Reg)
1610 continue;
1611 MO.setIsDead(false);
1612 }
1613}
1614
Matthias Braun2c98d0f2015-11-11 00:41:58 +00001615void MachineInstr::setRegisterDefReadUndef(unsigned Reg, bool IsUndef) {
Matthias Braunc1988f32015-01-21 22:55:13 +00001616 for (MachineOperand &MO : operands()) {
1617 if (!MO.isReg() || !MO.isDef() || MO.getReg() != Reg || MO.getSubReg() == 0)
1618 continue;
Matthias Braun2c98d0f2015-11-11 00:41:58 +00001619 MO.setIsUndef(IsUndef);
Matthias Braunc1988f32015-01-21 22:55:13 +00001620 }
1621}
1622
Matthias Braun1965bfa2013-10-10 21:28:38 +00001623void MachineInstr::addRegisterDefined(unsigned Reg,
Jakob Stoklund Olesen77255262010-01-06 00:29:28 +00001624 const TargetRegisterInfo *RegInfo) {
Matthias Braun1965bfa2013-10-10 21:28:38 +00001625 if (TargetRegisterInfo::isPhysicalRegister(Reg)) {
1626 MachineOperand *MO = findRegisterDefOperand(Reg, false, RegInfo);
Jakob Stoklund Olesen1f380102010-05-21 16:32:16 +00001627 if (MO)
1628 return;
1629 } else {
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +00001630 for (const MachineOperand &MO : operands()) {
Matthias Braun1965bfa2013-10-10 21:28:38 +00001631 if (MO.isReg() && MO.getReg() == Reg && MO.isDef() &&
Jakob Stoklund Olesen1f380102010-05-21 16:32:16 +00001632 MO.getSubReg() == 0)
1633 return;
1634 }
1635 }
Matthias Braun1965bfa2013-10-10 21:28:38 +00001636 addOperand(MachineOperand::CreateReg(Reg,
Jakob Stoklund Olesen1f380102010-05-21 16:32:16 +00001637 true /*IsDef*/,
1638 true /*IsImp*/));
Jakob Stoklund Olesen77255262010-01-06 00:29:28 +00001639}
Evan Cheng59d27fe2010-03-03 23:37:30 +00001640
Jakob Stoklund Olesen4290be42012-02-03 20:43:39 +00001641void MachineInstr::setPhysRegsDeadExcept(ArrayRef<unsigned> UsedRegs,
Dan Gohman86936502010-06-18 23:28:01 +00001642 const TargetRegisterInfo &TRI) {
Jakob Stoklund Olesen56fe2ed2012-02-03 21:23:14 +00001643 bool HasRegMask = false;
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +00001644 for (MachineOperand &MO : operands()) {
Jakob Stoklund Olesen56fe2ed2012-02-03 21:23:14 +00001645 if (MO.isRegMask()) {
1646 HasRegMask = true;
1647 continue;
1648 }
Dan Gohman86936502010-06-18 23:28:01 +00001649 if (!MO.isReg() || !MO.isDef()) continue;
1650 unsigned Reg = MO.getReg();
Jakob Stoklund Olesenf6507322012-02-03 20:43:35 +00001651 if (!TargetRegisterInfo::isPhysicalRegister(Reg)) continue;
Dan Gohman86936502010-06-18 23:28:01 +00001652 // If there are no uses, including partial uses, the def is dead.
Eugene Zelenko4e9736b2017-05-31 01:10:10 +00001653 if (llvm::none_of(UsedRegs,
1654 [&](unsigned Use) { return TRI.regsOverlap(Use, Reg); }))
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +00001655 MO.setIsDead();
Dan Gohman86936502010-06-18 23:28:01 +00001656 }
Jakob Stoklund Olesen56fe2ed2012-02-03 21:23:14 +00001657
1658 // This is a call with a register mask operand.
1659 // Mask clobbers are always dead, so add defs for the non-dead defines.
1660 if (HasRegMask)
1661 for (ArrayRef<unsigned>::iterator I = UsedRegs.begin(), E = UsedRegs.end();
1662 I != E; ++I)
1663 addRegisterDefined(*I, &TRI);
Dan Gohman86936502010-06-18 23:28:01 +00001664}
1665
Evan Cheng59d27fe2010-03-03 23:37:30 +00001666unsigned
1667MachineInstrExpressionTrait::getHashValue(const MachineInstr* const &MI) {
Chandler Carruth962152c2012-03-07 09:39:46 +00001668 // Build up a buffer of hash code components.
Chandler Carruth962152c2012-03-07 09:39:46 +00001669 SmallVector<size_t, 8> HashComponents;
1670 HashComponents.reserve(MI->getNumOperands() + 1);
1671 HashComponents.push_back(MI->getOpcode());
Benjamin Kramer60c5bbf2015-02-21 17:08:08 +00001672 for (const MachineOperand &MO : MI->operands()) {
Chandler Carruth264854f2012-07-05 11:06:22 +00001673 if (MO.isReg() && MO.isDef() &&
1674 TargetRegisterInfo::isVirtualRegister(MO.getReg()))
1675 continue; // Skip virtual register defs.
1676
1677 HashComponents.push_back(hash_value(MO));
Evan Cheng59d27fe2010-03-03 23:37:30 +00001678 }
Chandler Carruth962152c2012-03-07 09:39:46 +00001679 return hash_combine_range(HashComponents.begin(), HashComponents.end());
Evan Cheng59d27fe2010-03-03 23:37:30 +00001680}
Jakob Stoklund Olesen25a404e2011-07-02 03:53:34 +00001681
1682void MachineInstr::emitError(StringRef Msg) const {
1683 // Find the source location cookie.
1684 unsigned LocCookie = 0;
Craig Topperc0196b12014-04-14 00:51:57 +00001685 const MDNode *LocMD = nullptr;
Jakob Stoklund Olesen25a404e2011-07-02 03:53:34 +00001686 for (unsigned i = getNumOperands(); i != 0; --i) {
1687 if (getOperand(i-1).isMetadata() &&
1688 (LocMD = getOperand(i-1).getMetadata()) &&
1689 LocMD->getNumOperands() != 0) {
Duncan P. N. Exon Smith5bf8fef2014-12-09 18:38:53 +00001690 if (const ConstantInt *CI =
1691 mdconst::dyn_extract<ConstantInt>(LocMD->getOperand(0))) {
Jakob Stoklund Olesen25a404e2011-07-02 03:53:34 +00001692 LocCookie = CI->getZExtValue();
1693 break;
1694 }
1695 }
1696 }
1697
1698 if (const MachineBasicBlock *MBB = getParent())
1699 if (const MachineFunction *MF = MBB->getParent())
1700 return MF->getMMI().getModule()->getContext().emitError(LocCookie, Msg);
1701 report_fatal_error(Msg);
1702}
Reid Kleckner28865802016-04-14 18:29:59 +00001703
Benjamin Kramerbdc49562016-06-12 15:39:02 +00001704MachineInstrBuilder llvm::BuildMI(MachineFunction &MF, const DebugLoc &DL,
Reid Kleckner28865802016-04-14 18:29:59 +00001705 const MCInstrDesc &MCID, bool IsIndirect,
Adrian Prantl8b9bb532017-07-28 23:00:45 +00001706 unsigned Reg, const MDNode *Variable,
1707 const MDNode *Expr) {
Reid Kleckner28865802016-04-14 18:29:59 +00001708 assert(isa<DILocalVariable>(Variable) && "not a variable");
1709 assert(cast<DIExpression>(Expr)->isValid() && "not an expression");
1710 assert(cast<DILocalVariable>(Variable)->isValidLocationForIntrinsic(DL) &&
1711 "Expected inlined-at fields to agree");
1712 if (IsIndirect)
1713 return BuildMI(MF, DL, MCID)
1714 .addReg(Reg, RegState::Debug)
Adrian Prantl8b9bb532017-07-28 23:00:45 +00001715 .addImm(0U)
Reid Kleckner28865802016-04-14 18:29:59 +00001716 .addMetadata(Variable)
1717 .addMetadata(Expr);
Adrian Prantl8b9bb532017-07-28 23:00:45 +00001718 else
Reid Kleckner28865802016-04-14 18:29:59 +00001719 return BuildMI(MF, DL, MCID)
1720 .addReg(Reg, RegState::Debug)
1721 .addReg(0U, RegState::Debug)
1722 .addMetadata(Variable)
1723 .addMetadata(Expr);
Reid Kleckner28865802016-04-14 18:29:59 +00001724}
1725
1726MachineInstrBuilder llvm::BuildMI(MachineBasicBlock &BB,
Benjamin Kramerbdc49562016-06-12 15:39:02 +00001727 MachineBasicBlock::iterator I,
1728 const DebugLoc &DL, const MCInstrDesc &MCID,
1729 bool IsIndirect, unsigned Reg,
Adrian Prantl8b9bb532017-07-28 23:00:45 +00001730 const MDNode *Variable, const MDNode *Expr) {
Reid Kleckner28865802016-04-14 18:29:59 +00001731 assert(isa<DILocalVariable>(Variable) && "not a variable");
1732 assert(cast<DIExpression>(Expr)->isValid() && "not an expression");
1733 MachineFunction &MF = *BB.getParent();
Adrian Prantl8b9bb532017-07-28 23:00:45 +00001734 MachineInstr *MI = BuildMI(MF, DL, MCID, IsIndirect, Reg, Variable, Expr);
Reid Kleckner28865802016-04-14 18:29:59 +00001735 BB.insert(I, MI);
1736 return MachineInstrBuilder(MF, MI);
1737}
Adrian Prantl6825fb62017-04-18 01:21:53 +00001738
Reid Kleckner9e6c3092017-09-15 21:49:56 +00001739/// Compute the new DIExpression to use with a DBG_VALUE for a spill slot.
1740/// This prepends DW_OP_deref when spilling an indirect DBG_VALUE.
1741static const DIExpression *computeExprForSpill(const MachineInstr &MI) {
1742 assert(MI.getOperand(0).isReg() && "can't spill non-register");
1743 assert(MI.getDebugVariable()->isValidLocationForIntrinsic(MI.getDebugLoc()) &&
1744 "Expected inlined-at fields to agree");
1745
1746 const DIExpression *Expr = MI.getDebugExpression();
1747 if (MI.isIndirectDebugValue()) {
1748 assert(MI.getOperand(1).getImm() == 0 && "DBG_VALUE with nonzero offset");
1749 Expr = DIExpression::prepend(Expr, DIExpression::WithDeref);
1750 }
1751 return Expr;
1752}
1753
Adrian Prantl6825fb62017-04-18 01:21:53 +00001754MachineInstr *llvm::buildDbgValueForSpill(MachineBasicBlock &BB,
1755 MachineBasicBlock::iterator I,
1756 const MachineInstr &Orig,
1757 int FrameIndex) {
Reid Kleckner9e6c3092017-09-15 21:49:56 +00001758 const DIExpression *Expr = computeExprForSpill(Orig);
1759 return BuildMI(BB, I, Orig.getDebugLoc(), Orig.getDesc())
Adrian Prantl6825fb62017-04-18 01:21:53 +00001760 .addFrameIndex(FrameIndex)
Adrian Prantl8b9bb532017-07-28 23:00:45 +00001761 .addImm(0U)
Reid Kleckner9e6c3092017-09-15 21:49:56 +00001762 .addMetadata(Orig.getDebugVariable())
Adrian Prantl6825fb62017-04-18 01:21:53 +00001763 .addMetadata(Expr);
1764}
Reid Kleckner9e6c3092017-09-15 21:49:56 +00001765
1766void llvm::updateDbgValueForSpill(MachineInstr &Orig, int FrameIndex) {
1767 const DIExpression *Expr = computeExprForSpill(Orig);
1768 Orig.getOperand(0).ChangeToFrameIndex(FrameIndex);
1769 Orig.getOperand(1).ChangeToImmediate(0U);
1770 Orig.getOperand(3).setMetadata(Expr);
1771}