blob: e9e998f81d55fcdc49cdc75c5151d56ea39f7519 [file] [log] [blame]
Shih-wei Liaoe264f622010-02-10 11:10:31 -08001//===-- TargetInstrInfoImpl.cpp - Target Instruction Information ----------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements the TargetInstrInfoImpl class, it just provides default
11// implementations of various methods.
12//
13//===----------------------------------------------------------------------===//
14
15#include "llvm/Target/TargetInstrInfo.h"
16#include "llvm/Target/TargetMachine.h"
17#include "llvm/Target/TargetRegisterInfo.h"
18#include "llvm/ADT/SmallVector.h"
19#include "llvm/CodeGen/MachineFrameInfo.h"
20#include "llvm/CodeGen/MachineInstr.h"
21#include "llvm/CodeGen/MachineInstrBuilder.h"
22#include "llvm/CodeGen/MachineMemOperand.h"
23#include "llvm/CodeGen/MachineRegisterInfo.h"
24#include "llvm/CodeGen/PseudoSourceValue.h"
25#include "llvm/Support/ErrorHandling.h"
26#include "llvm/Support/raw_ostream.h"
27using namespace llvm;
28
29// commuteInstruction - The default implementation of this method just exchanges
30// the two operands returned by findCommutedOpIndices.
31MachineInstr *TargetInstrInfoImpl::commuteInstruction(MachineInstr *MI,
32 bool NewMI) const {
33 const TargetInstrDesc &TID = MI->getDesc();
34 bool HasDef = TID.getNumDefs();
35 if (HasDef && !MI->getOperand(0).isReg())
36 // No idea how to commute this instruction. Target should implement its own.
37 return 0;
38 unsigned Idx1, Idx2;
39 if (!findCommutedOpIndices(MI, Idx1, Idx2)) {
40 std::string msg;
41 raw_string_ostream Msg(msg);
42 Msg << "Don't know how to commute: " << *MI;
43 llvm_report_error(Msg.str());
44 }
45
46 assert(MI->getOperand(Idx1).isReg() && MI->getOperand(Idx2).isReg() &&
47 "This only knows how to commute register operands so far");
48 unsigned Reg1 = MI->getOperand(Idx1).getReg();
49 unsigned Reg2 = MI->getOperand(Idx2).getReg();
50 bool Reg1IsKill = MI->getOperand(Idx1).isKill();
51 bool Reg2IsKill = MI->getOperand(Idx2).isKill();
52 bool ChangeReg0 = false;
53 if (HasDef && MI->getOperand(0).getReg() == Reg1) {
54 // Must be two address instruction!
55 assert(MI->getDesc().getOperandConstraint(0, TOI::TIED_TO) &&
56 "Expecting a two-address instruction!");
57 Reg2IsKill = false;
58 ChangeReg0 = true;
59 }
60
61 if (NewMI) {
62 // Create a new instruction.
63 unsigned Reg0 = HasDef
64 ? (ChangeReg0 ? Reg2 : MI->getOperand(0).getReg()) : 0;
65 bool Reg0IsDead = HasDef ? MI->getOperand(0).isDead() : false;
66 MachineFunction &MF = *MI->getParent()->getParent();
67 if (HasDef)
68 return BuildMI(MF, MI->getDebugLoc(), MI->getDesc())
69 .addReg(Reg0, RegState::Define | getDeadRegState(Reg0IsDead))
70 .addReg(Reg2, getKillRegState(Reg2IsKill))
71 .addReg(Reg1, getKillRegState(Reg2IsKill));
72 else
73 return BuildMI(MF, MI->getDebugLoc(), MI->getDesc())
74 .addReg(Reg2, getKillRegState(Reg2IsKill))
75 .addReg(Reg1, getKillRegState(Reg2IsKill));
76 }
77
78 if (ChangeReg0)
79 MI->getOperand(0).setReg(Reg2);
80 MI->getOperand(Idx2).setReg(Reg1);
81 MI->getOperand(Idx1).setReg(Reg2);
82 MI->getOperand(Idx2).setIsKill(Reg1IsKill);
83 MI->getOperand(Idx1).setIsKill(Reg2IsKill);
84 return MI;
85}
86
87/// findCommutedOpIndices - If specified MI is commutable, return the two
88/// operand indices that would swap value. Return true if the instruction
89/// is not in a form which this routine understands.
90bool TargetInstrInfoImpl::findCommutedOpIndices(MachineInstr *MI,
91 unsigned &SrcOpIdx1,
92 unsigned &SrcOpIdx2) const {
93 const TargetInstrDesc &TID = MI->getDesc();
94 if (!TID.isCommutable())
95 return false;
96 // This assumes v0 = op v1, v2 and commuting would swap v1 and v2. If this
97 // is not true, then the target must implement this.
98 SrcOpIdx1 = TID.getNumDefs();
99 SrcOpIdx2 = SrcOpIdx1 + 1;
100 if (!MI->getOperand(SrcOpIdx1).isReg() ||
101 !MI->getOperand(SrcOpIdx2).isReg())
102 // No idea.
103 return false;
104 return true;
105}
106
107
108bool TargetInstrInfoImpl::PredicateInstruction(MachineInstr *MI,
109 const SmallVectorImpl<MachineOperand> &Pred) const {
110 bool MadeChange = false;
111 const TargetInstrDesc &TID = MI->getDesc();
112 if (!TID.isPredicable())
113 return false;
114
115 for (unsigned j = 0, i = 0, e = MI->getNumOperands(); i != e; ++i) {
116 if (TID.OpInfo[i].isPredicate()) {
117 MachineOperand &MO = MI->getOperand(i);
118 if (MO.isReg()) {
119 MO.setReg(Pred[j].getReg());
120 MadeChange = true;
121 } else if (MO.isImm()) {
122 MO.setImm(Pred[j].getImm());
123 MadeChange = true;
124 } else if (MO.isMBB()) {
125 MO.setMBB(Pred[j].getMBB());
126 MadeChange = true;
127 }
128 ++j;
129 }
130 }
131 return MadeChange;
132}
133
134void TargetInstrInfoImpl::reMaterialize(MachineBasicBlock &MBB,
135 MachineBasicBlock::iterator I,
136 unsigned DestReg,
137 unsigned SubIdx,
138 const MachineInstr *Orig,
139 const TargetRegisterInfo *TRI) const {
140 MachineInstr *MI = MBB.getParent()->CloneMachineInstr(Orig);
141 MachineOperand &MO = MI->getOperand(0);
142 if (TargetRegisterInfo::isVirtualRegister(DestReg)) {
143 MO.setReg(DestReg);
144 MO.setSubReg(SubIdx);
145 } else if (SubIdx) {
146 MO.setReg(TRI->getSubReg(DestReg, SubIdx));
147 } else {
148 MO.setReg(DestReg);
149 }
150 MBB.insert(I, MI);
151}
152
Shih-wei Liaoe4454322010-04-07 12:21:42 -0700153bool TargetInstrInfoImpl::produceSameValue(const MachineInstr *MI0,
154 const MachineInstr *MI1) const {
155 return MI0->isIdenticalTo(MI1, MachineInstr::IgnoreVRegDefs);
156}
157
Shih-wei Liaoe264f622010-02-10 11:10:31 -0800158MachineInstr *TargetInstrInfoImpl::duplicate(MachineInstr *Orig,
159 MachineFunction &MF) const {
160 assert(!Orig->getDesc().isNotDuplicable() &&
161 "Instruction cannot be duplicated");
162 return MF.CloneMachineInstr(Orig);
163}
164
Shih-wei Liaoe264f622010-02-10 11:10:31 -0800165unsigned
166TargetInstrInfoImpl::GetFunctionSizeInBytes(const MachineFunction &MF) const {
167 unsigned FnSize = 0;
168 for (MachineFunction::const_iterator MBBI = MF.begin(), E = MF.end();
169 MBBI != E; ++MBBI) {
170 const MachineBasicBlock &MBB = *MBBI;
171 for (MachineBasicBlock::const_iterator I = MBB.begin(),E = MBB.end();
172 I != E; ++I)
173 FnSize += GetInstSizeInBytes(I);
174 }
175 return FnSize;
176}
177
178/// foldMemoryOperand - Attempt to fold a load or store of the specified stack
179/// slot into the specified machine instruction for the specified operand(s).
180/// If this is possible, a new instruction is returned with the specified
181/// operand folded, otherwise NULL is returned. The client is responsible for
182/// removing the old instruction and adding the new one in the instruction
183/// stream.
184MachineInstr*
185TargetInstrInfo::foldMemoryOperand(MachineFunction &MF,
186 MachineInstr* MI,
187 const SmallVectorImpl<unsigned> &Ops,
188 int FrameIndex) const {
189 unsigned Flags = 0;
190 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
191 if (MI->getOperand(Ops[i]).isDef())
192 Flags |= MachineMemOperand::MOStore;
193 else
194 Flags |= MachineMemOperand::MOLoad;
195
196 // Ask the target to do the actual folding.
197 MachineInstr *NewMI = foldMemoryOperandImpl(MF, MI, Ops, FrameIndex);
198 if (!NewMI) return 0;
199
200 assert((!(Flags & MachineMemOperand::MOStore) ||
201 NewMI->getDesc().mayStore()) &&
202 "Folded a def to a non-store!");
203 assert((!(Flags & MachineMemOperand::MOLoad) ||
204 NewMI->getDesc().mayLoad()) &&
205 "Folded a use to a non-load!");
206 const MachineFrameInfo &MFI = *MF.getFrameInfo();
207 assert(MFI.getObjectOffset(FrameIndex) != -1);
208 MachineMemOperand *MMO =
209 MF.getMachineMemOperand(PseudoSourceValue::getFixedStack(FrameIndex),
210 Flags, /*Offset=*/0,
211 MFI.getObjectSize(FrameIndex),
212 MFI.getObjectAlignment(FrameIndex));
213 NewMI->addMemOperand(MF, MMO);
214
215 return NewMI;
216}
217
218/// foldMemoryOperand - Same as the previous version except it allows folding
219/// of any load and store from / to any address, not just from a specific
220/// stack slot.
221MachineInstr*
222TargetInstrInfo::foldMemoryOperand(MachineFunction &MF,
223 MachineInstr* MI,
224 const SmallVectorImpl<unsigned> &Ops,
225 MachineInstr* LoadMI) const {
226 assert(LoadMI->getDesc().canFoldAsLoad() && "LoadMI isn't foldable!");
227#ifndef NDEBUG
228 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
229 assert(MI->getOperand(Ops[i]).isUse() && "Folding load into def!");
230#endif
231
232 // Ask the target to do the actual folding.
233 MachineInstr *NewMI = foldMemoryOperandImpl(MF, MI, Ops, LoadMI);
234 if (!NewMI) return 0;
235
236 // Copy the memoperands from the load to the folded instruction.
237 NewMI->setMemRefs(LoadMI->memoperands_begin(),
238 LoadMI->memoperands_end());
239
240 return NewMI;
241}
242
243bool
244TargetInstrInfo::isReallyTriviallyReMaterializableGeneric(const MachineInstr *
245 MI,
246 AliasAnalysis *
247 AA) const {
248 const MachineFunction &MF = *MI->getParent()->getParent();
249 const MachineRegisterInfo &MRI = MF.getRegInfo();
250 const TargetMachine &TM = MF.getTarget();
251 const TargetInstrInfo &TII = *TM.getInstrInfo();
252 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
253
254 // A load from a fixed stack slot can be rematerialized. This may be
255 // redundant with subsequent checks, but it's target-independent,
256 // simple, and a common case.
257 int FrameIdx = 0;
258 if (TII.isLoadFromStackSlot(MI, FrameIdx) &&
259 MF.getFrameInfo()->isImmutableObjectIndex(FrameIdx))
260 return true;
261
262 const TargetInstrDesc &TID = MI->getDesc();
263
264 // Avoid instructions obviously unsafe for remat.
265 if (TID.hasUnmodeledSideEffects() || TID.isNotDuplicable() ||
266 TID.mayStore())
267 return false;
268
269 // Avoid instructions which load from potentially varying memory.
270 if (TID.mayLoad() && !MI->isInvariantLoad(AA))
271 return false;
272
273 // If any of the registers accessed are non-constant, conservatively assume
274 // the instruction is not rematerializable.
275 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
276 const MachineOperand &MO = MI->getOperand(i);
277 if (!MO.isReg()) continue;
278 unsigned Reg = MO.getReg();
279 if (Reg == 0)
280 continue;
281
282 // Check for a well-behaved physical register.
283 if (TargetRegisterInfo::isPhysicalRegister(Reg)) {
284 if (MO.isUse()) {
285 // If the physreg has no defs anywhere, it's just an ambient register
286 // and we can freely move its uses. Alternatively, if it's allocatable,
287 // it could get allocated to something with a def during allocation.
288 if (!MRI.def_empty(Reg))
289 return false;
290 BitVector AllocatableRegs = TRI.getAllocatableSet(MF, 0);
291 if (AllocatableRegs.test(Reg))
292 return false;
293 // Check for a def among the register's aliases too.
294 for (const unsigned *Alias = TRI.getAliasSet(Reg); *Alias; ++Alias) {
295 unsigned AliasReg = *Alias;
296 if (!MRI.def_empty(AliasReg))
297 return false;
298 if (AllocatableRegs.test(AliasReg))
299 return false;
300 }
301 } else {
302 // A physreg def. We can't remat it.
303 return false;
304 }
305 continue;
306 }
307
308 // Only allow one virtual-register def, and that in the first operand.
309 if (MO.isDef() != (i == 0))
310 return false;
311
312 // For the def, it should be the only def of that register.
313 if (MO.isDef() && (llvm::next(MRI.def_begin(Reg)) != MRI.def_end() ||
314 MRI.isLiveIn(Reg)))
315 return false;
316
317 // Don't allow any virtual-register uses. Rematting an instruction with
318 // virtual register uses would length the live ranges of the uses, which
319 // is not necessarily a good idea, certainly not "trivial".
320 if (MO.isUse())
321 return false;
322 }
323
324 // Everything checked out.
325 return true;
326}