It's not legal to fold a load from a narrower stack slot into a wider instruction...
[llvm/avr.git] / lib / CodeGen / SimpleRegisterCoalescing.h
blobf618c40ee6eaace0e1de80b3777caa9499a3f4f0
1 //===-- SimpleRegisterCoalescing.h - Register Coalescing --------*- C++ -*-===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file implements a simple register copy coalescing phase.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_CODEGEN_SIMPLE_REGISTER_COALESCING_H
15 #define LLVM_CODEGEN_SIMPLE_REGISTER_COALESCING_H
17 #include "llvm/CodeGen/MachineFunctionPass.h"
18 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
19 #include "llvm/CodeGen/RegisterCoalescer.h"
20 #include "llvm/ADT/BitVector.h"
21 #include <queue>
23 namespace llvm {
24 class SimpleRegisterCoalescing;
25 class LiveVariables;
26 class TargetRegisterInfo;
27 class TargetInstrInfo;
28 class VirtRegMap;
29 class MachineLoopInfo;
31 /// CopyRec - Representation for copy instructions in coalescer queue.
32 ///
33 struct CopyRec {
34 MachineInstr *MI;
35 unsigned LoopDepth;
36 bool isBackEdge;
37 CopyRec(MachineInstr *mi, unsigned depth, bool be)
38 : MI(mi), LoopDepth(depth), isBackEdge(be) {};
41 template<class SF> class JoinPriorityQueue;
43 /// CopyRecSort - Sorting function for coalescer queue.
44 ///
45 struct CopyRecSort : public std::binary_function<CopyRec,CopyRec,bool> {
46 JoinPriorityQueue<CopyRecSort> *JPQ;
47 explicit CopyRecSort(JoinPriorityQueue<CopyRecSort> *jpq) : JPQ(jpq) {}
48 CopyRecSort(const CopyRecSort &RHS) : JPQ(RHS.JPQ) {}
49 bool operator()(CopyRec left, CopyRec right) const;
52 /// JoinQueue - A priority queue of copy instructions the coalescer is
53 /// going to process.
54 template<class SF>
55 class JoinPriorityQueue {
56 SimpleRegisterCoalescing *Rc;
57 std::priority_queue<CopyRec, std::vector<CopyRec>, SF> Queue;
59 public:
60 explicit JoinPriorityQueue(SimpleRegisterCoalescing *rc)
61 : Rc(rc), Queue(SF(this)) {}
63 bool empty() const { return Queue.empty(); }
64 void push(CopyRec R) { Queue.push(R); }
65 CopyRec pop() {
66 if (empty()) return CopyRec(0, 0, false);
67 CopyRec R = Queue.top();
68 Queue.pop();
69 return R;
72 // Callbacks to SimpleRegisterCoalescing.
73 unsigned getRepIntervalSize(unsigned Reg);
76 class SimpleRegisterCoalescing : public MachineFunctionPass,
77 public RegisterCoalescer {
78 MachineFunction* mf_;
79 MachineRegisterInfo* mri_;
80 const TargetMachine* tm_;
81 const TargetRegisterInfo* tri_;
82 const TargetInstrInfo* tii_;
83 LiveIntervals *li_;
84 const MachineLoopInfo* loopInfo;
86 BitVector allocatableRegs_;
87 DenseMap<const TargetRegisterClass*, BitVector> allocatableRCRegs_;
89 /// JoinQueue - A priority queue of copy instructions the coalescer is
90 /// going to process.
91 JoinPriorityQueue<CopyRecSort> *JoinQueue;
93 /// JoinedCopies - Keep track of copies eliminated due to coalescing.
94 ///
95 SmallPtrSet<MachineInstr*, 32> JoinedCopies;
97 /// ReMatCopies - Keep track of copies eliminated due to remat.
98 ///
99 SmallPtrSet<MachineInstr*, 32> ReMatCopies;
101 /// ReMatDefs - Keep track of definition instructions which have
102 /// been remat'ed.
103 SmallPtrSet<MachineInstr*, 8> ReMatDefs;
105 public:
106 static char ID; // Pass identifcation, replacement for typeid
107 SimpleRegisterCoalescing() : MachineFunctionPass(&ID) {}
109 struct InstrSlots {
110 enum {
111 LOAD = 0,
112 USE = 1,
113 DEF = 2,
114 STORE = 3,
115 NUM = 4
119 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
120 virtual void releaseMemory();
122 /// runOnMachineFunction - pass entry point
123 virtual bool runOnMachineFunction(MachineFunction&);
125 bool coalesceFunction(MachineFunction &mf, RegallocQuery &) {
126 // This runs as an independent pass, so don't do anything.
127 return false;
130 /// getRepIntervalSize - Called from join priority queue sorting function.
131 /// It returns the size of the interval that represent the given register.
132 unsigned getRepIntervalSize(unsigned Reg) {
133 if (!li_->hasInterval(Reg))
134 return 0;
135 return li_->getApproximateInstructionCount(li_->getInterval(Reg)) *
136 LiveInterval::InstrSlots::NUM;
139 /// print - Implement the dump method.
140 virtual void print(raw_ostream &O, const Module* = 0) const;
142 private:
143 /// joinIntervals - join compatible live intervals
144 void joinIntervals();
146 /// CopyCoalesceInMBB - Coalesce copies in the specified MBB, putting
147 /// copies that cannot yet be coalesced into the "TryAgain" list.
148 void CopyCoalesceInMBB(MachineBasicBlock *MBB,
149 std::vector<CopyRec> &TryAgain);
151 /// JoinCopy - Attempt to join intervals corresponding to SrcReg/DstReg,
152 /// which are the src/dst of the copy instruction CopyMI. This returns true
153 /// if the copy was successfully coalesced away. If it is not currently
154 /// possible to coalesce this interval, but it may be possible if other
155 /// things get coalesced, then it returns true by reference in 'Again'.
156 bool JoinCopy(CopyRec &TheCopy, bool &Again);
158 /// JoinIntervals - Attempt to join these two intervals. On failure, this
159 /// returns false. Otherwise, if one of the intervals being joined is a
160 /// physreg, this method always canonicalizes DestInt to be it. The output
161 /// "SrcInt" will not have been modified, so we can use this information
162 /// below to update aliases.
163 bool JoinIntervals(LiveInterval &LHS, LiveInterval &RHS, bool &Swapped);
165 /// SimpleJoin - Attempt to join the specified interval into this one. The
166 /// caller of this method must guarantee that the RHS only contains a single
167 /// value number and that the RHS is not defined by a copy from this
168 /// interval. This returns false if the intervals are not joinable, or it
169 /// joins them and returns true.
170 bool SimpleJoin(LiveInterval &LHS, LiveInterval &RHS);
172 /// Return true if the two specified registers belong to different register
173 /// classes. The registers may be either phys or virt regs.
174 bool differingRegisterClasses(unsigned RegA, unsigned RegB) const;
177 /// AdjustCopiesBackFrom - We found a non-trivially-coalescable copy. If
178 /// the source value number is defined by a copy from the destination reg
179 /// see if we can merge these two destination reg valno# into a single
180 /// value number, eliminating a copy.
181 bool AdjustCopiesBackFrom(LiveInterval &IntA, LiveInterval &IntB,
182 MachineInstr *CopyMI);
184 /// HasOtherReachingDefs - Return true if there are definitions of IntB
185 /// other than BValNo val# that can reach uses of AValno val# of IntA.
186 bool HasOtherReachingDefs(LiveInterval &IntA, LiveInterval &IntB,
187 VNInfo *AValNo, VNInfo *BValNo);
189 /// RemoveCopyByCommutingDef - We found a non-trivially-coalescable copy.
190 /// If the source value number is defined by a commutable instruction and
191 /// its other operand is coalesced to the copy dest register, see if we
192 /// can transform the copy into a noop by commuting the definition.
193 bool RemoveCopyByCommutingDef(LiveInterval &IntA, LiveInterval &IntB,
194 MachineInstr *CopyMI);
196 /// TrimLiveIntervalToLastUse - If there is a last use in the same basic
197 /// block as the copy instruction, trim the ive interval to the last use
198 /// and return true.
199 bool TrimLiveIntervalToLastUse(MachineInstrIndex CopyIdx,
200 MachineBasicBlock *CopyMBB,
201 LiveInterval &li, const LiveRange *LR);
203 /// ReMaterializeTrivialDef - If the source of a copy is defined by a trivial
204 /// computation, replace the copy by rematerialize the definition.
205 bool ReMaterializeTrivialDef(LiveInterval &SrcInt, unsigned DstReg,
206 unsigned DstSubIdx, MachineInstr *CopyMI);
208 /// CanCoalesceWithImpDef - Returns true if the specified copy instruction
209 /// from an implicit def to another register can be coalesced away.
210 bool CanCoalesceWithImpDef(MachineInstr *CopyMI,
211 LiveInterval &li, LiveInterval &ImpLi) const;
213 /// TurnCopiesFromValNoToImpDefs - The specified value# is defined by an
214 /// implicit_def and it is being removed. Turn all copies from this value#
215 /// into implicit_defs.
216 void TurnCopiesFromValNoToImpDefs(LiveInterval &li, VNInfo *VNI);
218 /// isWinToJoinVRWithSrcPhysReg - Return true if it's worth while to join a
219 /// a virtual destination register with physical source register.
220 bool isWinToJoinVRWithSrcPhysReg(MachineInstr *CopyMI,
221 MachineBasicBlock *CopyMBB,
222 LiveInterval &DstInt, LiveInterval &SrcInt);
224 /// isWinToJoinVRWithDstPhysReg - Return true if it's worth while to join a
225 /// copy from a virtual source register to a physical destination register.
226 bool isWinToJoinVRWithDstPhysReg(MachineInstr *CopyMI,
227 MachineBasicBlock *CopyMBB,
228 LiveInterval &DstInt, LiveInterval &SrcInt);
230 /// isWinToJoinCrossClass - Return true if it's profitable to coalesce
231 /// two virtual registers from different register classes.
232 bool isWinToJoinCrossClass(unsigned LargeReg, unsigned SmallReg,
233 unsigned Threshold);
235 /// HasIncompatibleSubRegDefUse - If we are trying to coalesce a virtual
236 /// register with a physical register, check if any of the virtual register
237 /// operand is a sub-register use or def. If so, make sure it won't result
238 /// in an illegal extract_subreg or insert_subreg instruction.
239 bool HasIncompatibleSubRegDefUse(MachineInstr *CopyMI,
240 unsigned VirtReg, unsigned PhysReg);
242 /// CanJoinExtractSubRegToPhysReg - Return true if it's possible to coalesce
243 /// an extract_subreg where dst is a physical register, e.g.
244 /// cl = EXTRACT_SUBREG reg1024, 1
245 bool CanJoinExtractSubRegToPhysReg(unsigned DstReg, unsigned SrcReg,
246 unsigned SubIdx, unsigned &RealDstReg);
248 /// CanJoinInsertSubRegToPhysReg - Return true if it's possible to coalesce
249 /// an insert_subreg where src is a physical register, e.g.
250 /// reg1024 = INSERT_SUBREG reg1024, c1, 0
251 bool CanJoinInsertSubRegToPhysReg(unsigned DstReg, unsigned SrcReg,
252 unsigned SubIdx, unsigned &RealDstReg);
254 /// RangeIsDefinedByCopyFromReg - Return true if the specified live range of
255 /// the specified live interval is defined by a copy from the specified
256 /// register.
257 bool RangeIsDefinedByCopyFromReg(LiveInterval &li, LiveRange *LR,
258 unsigned Reg);
260 /// isBackEdgeCopy - Return true if CopyMI is a back edge copy.
262 bool isBackEdgeCopy(MachineInstr *CopyMI, unsigned DstReg) const;
264 /// UpdateRegDefsUses - Replace all defs and uses of SrcReg to DstReg and
265 /// update the subregister number if it is not zero. If DstReg is a
266 /// physical register and the existing subregister number of the def / use
267 /// being updated is not zero, make sure to set it to the correct physical
268 /// subregister.
269 void UpdateRegDefsUses(unsigned SrcReg, unsigned DstReg, unsigned SubIdx);
271 /// RemoveUnnecessaryKills - Remove kill markers that are no longer accurate
272 /// due to live range lengthening as the result of coalescing.
273 void RemoveUnnecessaryKills(unsigned Reg, LiveInterval &LI);
275 /// ShortenDeadCopyLiveRange - Shorten a live range defined by a dead copy.
276 /// Return true if live interval is removed.
277 bool ShortenDeadCopyLiveRange(LiveInterval &li, MachineInstr *CopyMI);
279 /// ShortenDeadCopyLiveRange - Shorten a live range as it's artificially
280 /// extended by a dead copy. Mark the last use (if any) of the val# as kill
281 /// as ends the live range there. If there isn't another use, then this
282 /// live range is dead. Return true if live interval is removed.
283 bool ShortenDeadCopySrcLiveRange(LiveInterval &li, MachineInstr *CopyMI);
285 /// RemoveDeadDef - If a def of a live interval is now determined dead,
286 /// remove the val# it defines. If the live interval becomes empty, remove
287 /// it as well.
288 bool RemoveDeadDef(LiveInterval &li, MachineInstr *DefMI);
290 /// lastRegisterUse - Returns the last use of the specific register between
291 /// cycles Start and End or NULL if there are no uses.
292 MachineOperand *lastRegisterUse(MachineInstrIndex Start, MachineInstrIndex End,
293 unsigned Reg, MachineInstrIndex &LastUseIdx) const;
295 void printRegName(unsigned reg) const;
297 /// Returns true if the given live interval is zero length.
298 bool isZeroLengthInterval(LiveInterval *li) const;
301 } // End llvm namespace
303 #endif