blob: 86ab2b6f27533fdac3d8189e458b35137c2d4bff [file] [log] [blame]
Lang Hamesa937f222009-12-14 06:49:42 +00001//===------------------------ CalcSpillWeights.cpp ------------------------===//
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#define DEBUG_TYPE "calcspillweights"
11
12#include "llvm/Function.h"
13#include "llvm/ADT/SmallSet.h"
14#include "llvm/CodeGen/CalcSpillWeights.h"
15#include "llvm/CodeGen/LiveIntervalAnalysis.h"
16#include "llvm/CodeGen/MachineFunction.h"
17#include "llvm/CodeGen/MachineLoopInfo.h"
18#include "llvm/CodeGen/MachineRegisterInfo.h"
19#include "llvm/CodeGen/SlotIndexes.h"
20#include "llvm/Support/Debug.h"
21#include "llvm/Support/raw_ostream.h"
22#include "llvm/Target/TargetInstrInfo.h"
Evan Cheng8112b532010-02-10 01:21:02 +000023#include "llvm/Target/TargetMachine.h"
Lang Hamesa937f222009-12-14 06:49:42 +000024#include "llvm/Target/TargetRegisterInfo.h"
Lang Hamesa937f222009-12-14 06:49:42 +000025using namespace llvm;
26
27char CalculateSpillWeights::ID = 0;
Owen Anderson2ab36d32010-10-12 19:48:12 +000028INITIALIZE_PASS_BEGIN(CalculateSpillWeights, "calcspillweights",
29 "Calculate spill weights", false, false)
30INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
31INITIALIZE_PASS_DEPENDENCY(MachineLoopInfo)
32INITIALIZE_PASS_END(CalculateSpillWeights, "calcspillweights",
Owen Andersonce665bd2010-10-07 22:25:06 +000033 "Calculate spill weights", false, false)
Lang Hamesa937f222009-12-14 06:49:42 +000034
35void CalculateSpillWeights::getAnalysisUsage(AnalysisUsage &au) const {
36 au.addRequired<LiveIntervals>();
37 au.addRequired<MachineLoopInfo>();
38 au.setPreservesAll();
39 MachineFunctionPass::getAnalysisUsage(au);
40}
41
42bool CalculateSpillWeights::runOnMachineFunction(MachineFunction &fn) {
43
David Greene7ed6dd62009-12-24 00:39:02 +000044 DEBUG(dbgs() << "********** Compute Spill Weights **********\n"
Lang Hamesa937f222009-12-14 06:49:42 +000045 << "********** Function: "
46 << fn.getFunction()->getName() << '\n');
47
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +000048 LiveIntervals &lis = getAnalysis<LiveIntervals>();
49 VirtRegAuxInfo vrai(fn, lis, getAnalysis<MachineLoopInfo>());
50 for (LiveIntervals::iterator I = lis.begin(), E = lis.end(); I != E; ++I) {
Lang Hamesa937f222009-12-14 06:49:42 +000051 LiveInterval &li = *I->second;
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +000052 if (TargetRegisterInfo::isVirtualRegister(li.reg))
53 vrai.CalculateWeightAndHint(li);
Lang Hamesa937f222009-12-14 06:49:42 +000054 }
Lang Hamesa937f222009-12-14 06:49:42 +000055 return false;
56}
57
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +000058// Return the preferred allocation register for reg, given a COPY instruction.
59static unsigned copyHint(const MachineInstr *mi, unsigned reg,
60 const TargetRegisterInfo &tri,
61 const MachineRegisterInfo &mri) {
62 unsigned sub, hreg, hsub;
63 if (mi->getOperand(0).getReg() == reg) {
64 sub = mi->getOperand(0).getSubReg();
65 hreg = mi->getOperand(1).getReg();
66 hsub = mi->getOperand(1).getSubReg();
67 } else {
68 sub = mi->getOperand(1).getSubReg();
69 hreg = mi->getOperand(0).getReg();
70 hsub = mi->getOperand(0).getSubReg();
71 }
72
73 if (!hreg)
74 return 0;
75
76 if (TargetRegisterInfo::isVirtualRegister(hreg))
77 return sub == hsub ? hreg : 0;
78
79 const TargetRegisterClass *rc = mri.getRegClass(reg);
80
81 // Only allow physreg hints in rc.
82 if (sub == 0)
83 return rc->contains(hreg) ? hreg : 0;
84
85 // reg:sub should match the physreg hreg.
86 return tri.getMatchingSuperReg(hreg, sub, rc);
Lang Hamesa937f222009-12-14 06:49:42 +000087}
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +000088
89void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
90 MachineRegisterInfo &mri = mf_.getRegInfo();
91 const TargetRegisterInfo &tri = *mf_.getTarget().getRegisterInfo();
92 MachineBasicBlock *mbb = 0;
93 MachineLoop *loop = 0;
94 unsigned loopDepth = 0;
95 bool isExiting = false;
96 float totalWeight = 0;
97 SmallPtrSet<MachineInstr*, 8> visited;
98
99 // Find the best physreg hist and the best virtreg hint.
100 float bestPhys = 0, bestVirt = 0;
101 unsigned hintPhys = 0, hintVirt = 0;
102
103 // Don't recompute a target specific hint.
104 bool noHint = mri.getRegAllocationHint(li.reg).first != 0;
105
Jakob Stoklund Olesen6094bd82011-03-29 21:20:19 +0000106 // Don't recompute spill weight for an unspillable register.
107 bool Spillable = li.isSpillable();
108
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000109 for (MachineRegisterInfo::reg_iterator I = mri.reg_begin(li.reg);
110 MachineInstr *mi = I.skipInstruction();) {
111 if (mi->isIdentityCopy() || mi->isImplicitDef() || mi->isDebugValue())
112 continue;
113 if (!visited.insert(mi))
114 continue;
115
Jakob Stoklund Olesen6094bd82011-03-29 21:20:19 +0000116 float weight = 1.0f;
117 if (Spillable) {
118 // Get loop info for mi.
119 if (mi->getParent() != mbb) {
120 mbb = mi->getParent();
121 loop = loops_.getLoopFor(mbb);
122 loopDepth = loop ? loop->getLoopDepth() : 0;
123 isExiting = loop ? loop->isLoopExiting(mbb) : false;
124 }
125
126 // Calculate instr weight.
127 bool reads, writes;
128 tie(reads, writes) = mi->readsWritesVirtualRegister(li.reg);
129 weight = LiveIntervals::getSpillWeight(writes, reads, loopDepth);
130
131 // Give extra weight to what looks like a loop induction variable update.
132 if (writes && isExiting && lis_.isLiveOutOfMBB(li, mbb))
133 weight *= 3;
134
135 totalWeight += weight;
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000136 }
137
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000138 // Get allocation hints from copies.
139 if (noHint || !mi->isCopy())
140 continue;
141 unsigned hint = copyHint(mi, li.reg, tri, mri);
142 if (!hint)
143 continue;
144 float hweight = hint_[hint] += weight;
145 if (TargetRegisterInfo::isPhysicalRegister(hint)) {
146 if (hweight > bestPhys && lis_.isAllocatable(hint))
147 bestPhys = hweight, hintPhys = hint;
148 } else {
149 if (hweight > bestVirt)
150 bestVirt = hweight, hintVirt = hint;
151 }
152 }
153
154 hint_.clear();
155
156 // Always prefer the physreg hint.
157 if (unsigned hint = hintPhys ? hintPhys : hintVirt) {
158 mri.setRegAllocationHint(li.reg, 0, hint);
Jakob Stoklund Olesen6094bd82011-03-29 21:20:19 +0000159 // Weakly boost the spill weight of hinted registers.
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000160 totalWeight *= 1.01F;
161 }
162
Jakob Stoklund Olesen6094bd82011-03-29 21:20:19 +0000163 // If the live interval was already unspillable, leave it that way.
164 if (!Spillable)
165 return;
166
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000167 // Mark li as unspillable if all live ranges are tiny.
168 if (li.isZeroLength()) {
169 li.markNotSpillable();
170 return;
171 }
172
173 // If all of the definitions of the interval are re-materializable,
174 // it is a preferred candidate for spilling. If none of the defs are
175 // loads, then it's potentially very cheap to re-materialize.
176 // FIXME: this gets much more complicated once we support non-trivial
177 // re-materialization.
178 bool isLoad = false;
Jakob Stoklund Olesen38f6bd02011-03-10 01:21:58 +0000179 if (lis_.isReMaterializable(li, 0, isLoad)) {
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000180 if (isLoad)
181 totalWeight *= 0.9F;
182 else
183 totalWeight *= 0.5F;
184 }
185
Jakob Stoklund Oleseneb9f0402011-02-14 23:15:38 +0000186 li.weight = normalizeSpillWeight(totalWeight, li.getSize());
Jakob Stoklund Olesendf30cf92010-08-10 00:02:26 +0000187}
188
Jakob Stoklund Olesen9db3ea42010-08-10 18:37:40 +0000189void VirtRegAuxInfo::CalculateRegClass(unsigned reg) {
190 MachineRegisterInfo &mri = mf_.getRegInfo();
191 const TargetRegisterInfo *tri = mf_.getTarget().getRegisterInfo();
192 const TargetRegisterClass *orc = mri.getRegClass(reg);
193 SmallPtrSet<const TargetRegisterClass*,8> rcs;
194
195 for (MachineRegisterInfo::reg_nodbg_iterator I = mri.reg_nodbg_begin(reg),
Jakob Stoklund Olesena516e942010-08-10 21:16:16 +0000196 E = mri.reg_nodbg_end(); I != E; ++I) {
197 // The targets don't have accurate enough regclass descriptions that we can
198 // handle subregs. We need something similar to
199 // TRI::getMatchingSuperRegClass, but returning a super class instead of a
200 // sub class.
201 if (I.getOperand().getSubReg()) {
202 DEBUG(dbgs() << "Cannot handle subregs: " << I.getOperand() << '\n');
203 return;
204 }
Jakob Stoklund Olesen9db3ea42010-08-10 18:37:40 +0000205 if (const TargetRegisterClass *rc =
206 I->getDesc().getRegClass(I.getOperandNo(), tri))
207 rcs.insert(rc);
Jakob Stoklund Olesena516e942010-08-10 21:16:16 +0000208 }
Jakob Stoklund Olesen9db3ea42010-08-10 18:37:40 +0000209
210 // If we found no regclass constraints, just leave reg as is.
211 // In theory, we could inflate to the largest superclass of reg's existing
212 // class, but that might not be legal for the current cpu setting.
213 // This could happen if reg is only used by COPY instructions, so we may need
214 // to improve on this.
215 if (rcs.empty()) {
Jakob Stoklund Olesen9db3ea42010-08-10 18:37:40 +0000216 return;
217 }
218
219 // Compute the intersection of all classes in rcs.
220 // This ought to be independent of iteration order, but if the target register
221 // classes don't form a proper algebra, it is possible to get different
222 // results. The solution is to make sure the intersection of any two register
223 // classes is also a register class or the null set.
224 const TargetRegisterClass *rc = 0;
225 for (SmallPtrSet<const TargetRegisterClass*,8>::iterator I = rcs.begin(),
226 E = rcs.end(); I != E; ++I) {
227 rc = rc ? getCommonSubClass(rc, *I) : *I;
228 assert(rc && "Incompatible regclass constraints found");
229 }
230
231 if (rc == orc)
232 return;
Jakob Stoklund Olesen43142682011-01-09 03:05:53 +0000233 DEBUG(dbgs() << "Inflating " << orc->getName() << ':' << PrintReg(reg)
234 << " to " << rc->getName() <<".\n");
Jakob Stoklund Olesen9db3ea42010-08-10 18:37:40 +0000235 mri.setRegClass(reg, rc);
236}