1 //===-- SimpleRegisterCoalescing.h - Register Coalescing --------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
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/LiveInterval.h"
19 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
20 #include "llvm/CodeGen/RegisterCoalescer.h"
21 #include "llvm/ADT/BitVector.h"
22 #include "llvm/ADT/IndexedMap.h"
26 class SimpleRegisterCoalescing;
28 class TargetRegisterInfo;
29 class TargetInstrInfo;
31 class MachineLoopInfo;
33 /// CopyRec - Representation for copy instructions in coalescer queue.
39 CopyRec(MachineInstr *mi, unsigned depth, bool be)
40 : MI(mi), LoopDepth(depth), isBackEdge(be) {};
43 template<class SF> class JoinPriorityQueue;
45 /// CopyRecSort - Sorting function for coalescer queue.
47 struct CopyRecSort : public std::binary_function<CopyRec,CopyRec,bool> {
48 JoinPriorityQueue<CopyRecSort> *JPQ;
49 explicit CopyRecSort(JoinPriorityQueue<CopyRecSort> *jpq) : JPQ(jpq) {}
50 CopyRecSort(const CopyRecSort &RHS) : JPQ(RHS.JPQ) {}
51 bool operator()(CopyRec left, CopyRec right) const;
54 /// JoinQueue - A priority queue of copy instructions the coalescer is
57 class JoinPriorityQueue {
58 SimpleRegisterCoalescing *Rc;
59 std::priority_queue<CopyRec, std::vector<CopyRec>, SF> Queue;
62 explicit JoinPriorityQueue(SimpleRegisterCoalescing *rc)
63 : Rc(rc), Queue(SF(this)) {}
65 bool empty() const { return Queue.empty(); }
66 void push(CopyRec R) { Queue.push(R); }
68 if (empty()) return CopyRec(0, 0, false);
69 CopyRec R = Queue.top();
74 // Callbacks to SimpleRegisterCoalescing.
75 unsigned getRepIntervalSize(unsigned Reg);
78 class SimpleRegisterCoalescing : public MachineFunctionPass,
79 public RegisterCoalescer {
81 MachineRegisterInfo* mri_;
82 const TargetMachine* tm_;
83 const TargetRegisterInfo* tri_;
84 const TargetInstrInfo* tii_;
87 const MachineLoopInfo* loopInfo;
89 BitVector allocatableRegs_;
90 DenseMap<const TargetRegisterClass*, BitVector> allocatableRCRegs_;
92 /// JoinQueue - A priority queue of copy instructions the coalescer is
94 JoinPriorityQueue<CopyRecSort> *JoinQueue;
96 /// JoinedCopies - Keep track of copies eliminated due to coalescing.
98 SmallPtrSet<MachineInstr*, 32> JoinedCopies;
101 static char ID; // Pass identifcation, replacement for typeid
102 SimpleRegisterCoalescing() : MachineFunctionPass((intptr_t)&ID) {}
114 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
115 virtual void releaseMemory();
117 /// runOnMachineFunction - pass entry point
118 virtual bool runOnMachineFunction(MachineFunction&);
120 bool coalesceFunction(MachineFunction &mf, RegallocQuery &) {
121 // This runs as an independent pass, so don't do anything.
125 /// getRepIntervalSize - Called from join priority queue sorting function.
126 /// It returns the size of the interval that represent the given register.
127 unsigned getRepIntervalSize(unsigned Reg) {
128 if (!li_->hasInterval(Reg))
130 return li_->getInterval(Reg).getSize();
133 /// print - Implement the dump method.
134 virtual void print(std::ostream &O, const Module* = 0) const;
135 void print(std::ostream *O, const Module* M = 0) const {
140 /// joinIntervals - join compatible live intervals
141 void joinIntervals();
143 /// CopyCoalesceInMBB - Coalesce copies in the specified MBB, putting
144 /// copies that cannot yet be coalesced into the "TryAgain" list.
145 void CopyCoalesceInMBB(MachineBasicBlock *MBB,
146 std::vector<CopyRec> &TryAgain);
148 /// JoinCopy - Attempt to join intervals corresponding to SrcReg/DstReg,
149 /// which are the src/dst of the copy instruction CopyMI. This returns true
150 /// if the copy was successfully coalesced away. If it is not currently
151 /// possible to coalesce this interval, but it may be possible if other
152 /// things get coalesced, then it returns true by reference in 'Again'.
153 bool JoinCopy(CopyRec &TheCopy, bool &Again);
155 /// JoinIntervals - Attempt to join these two intervals. On failure, this
156 /// returns false. Otherwise, if one of the intervals being joined is a
157 /// physreg, this method always canonicalizes DestInt to be it. The output
158 /// "SrcInt" will not have been modified, so we can use this information
159 /// below to update aliases.
160 bool JoinIntervals(LiveInterval &LHS, LiveInterval &RHS, bool &Swapped);
162 /// SimpleJoin - Attempt to join the specified interval into this one. The
163 /// caller of this method must guarantee that the RHS only contains a single
164 /// value number and that the RHS is not defined by a copy from this
165 /// interval. This returns false if the intervals are not joinable, or it
166 /// joins them and returns true.
167 bool SimpleJoin(LiveInterval &LHS, LiveInterval &RHS);
169 /// Return true if the two specified registers belong to different
170 /// register classes. The registers may be either phys or virt regs.
171 bool differingRegisterClasses(unsigned RegA, unsigned RegB) const;
174 /// AdjustCopiesBackFrom - We found a non-trivially-coalescable copy. If
175 /// the source value number is defined by a copy from the destination reg
176 /// see if we can merge these two destination reg valno# into a single
177 /// value number, eliminating a copy.
178 bool AdjustCopiesBackFrom(LiveInterval &IntA, LiveInterval &IntB,
179 MachineInstr *CopyMI);
181 /// HasOtherReachingDefs - Return true if there are definitions of IntB
182 /// other than BValNo val# that can reach uses of AValno val# of IntA.
183 bool HasOtherReachingDefs(LiveInterval &IntA, LiveInterval &IntB,
184 VNInfo *AValNo, VNInfo *BValNo);
186 /// RemoveCopyByCommutingDef - We found a non-trivially-coalescable copy.
187 /// If the source value number is defined by a commutable instruction and
188 /// its other operand is coalesced to the copy dest register, see if we
189 /// can transform the copy into a noop by commuting the definition.
190 bool RemoveCopyByCommutingDef(LiveInterval &IntA, LiveInterval &IntB,
191 MachineInstr *CopyMI);
193 /// TurnCopyIntoImpDef - If source of the specified copy is an implicit def,
194 /// turn the copy into an implicit def.
195 bool TurnCopyIntoImpDef(MachineBasicBlock::iterator &I,
196 MachineBasicBlock *MBB,
197 unsigned DstReg, unsigned SrcReg);
199 /// CanCoalesceWithImpDef - Returns true if the specified copy instruction
200 /// from an implicit def to another register can be coalesced away.
201 bool CanCoalesceWithImpDef(MachineInstr *CopyMI,
202 LiveInterval &li, LiveInterval &ImpLi) const;
204 /// RemoveCopiesFromValNo - The specified value# is defined by an implicit
205 /// def and it is being removed. Turn all copies from this value# into
206 /// identity copies so they will be removed.
207 void RemoveCopiesFromValNo(LiveInterval &li, VNInfo *VNI);
209 /// RangeIsDefinedByCopyFromReg - Return true if the specified live range of
210 /// the specified live interval is defined by a copy from the specified
212 bool RangeIsDefinedByCopyFromReg(LiveInterval &li, LiveRange *LR,
215 /// isBackEdgeCopy - Return true if CopyMI is a back edge copy.
217 bool isBackEdgeCopy(MachineInstr *CopyMI, unsigned DstReg) const;
219 /// UpdateRegDefsUses - Replace all defs and uses of SrcReg to DstReg and
220 /// update the subregister number if it is not zero. If DstReg is a
221 /// physical register and the existing subregister number of the def / use
222 /// being updated is not zero, make sure to set it to the correct physical
224 void UpdateRegDefsUses(unsigned SrcReg, unsigned DstReg, unsigned SubIdx);
226 /// RemoveDeadImpDef - Remove implicit_def instructions which are
227 /// "re-defining" registers due to insert_subreg coalescing. e.g.
228 void RemoveDeadImpDef(unsigned Reg, LiveInterval &LI);
230 /// RemoveUnnecessaryKills - Remove kill markers that are no longer accurate
231 /// due to live range lengthening as the result of coalescing.
232 void RemoveUnnecessaryKills(unsigned Reg, LiveInterval &LI);
234 /// ShortenDeadCopyLiveRange - Shorten a live range defined by a dead copy.
235 /// Return true if live interval is removed.
236 bool ShortenDeadCopyLiveRange(LiveInterval &li, MachineInstr *CopyMI);
238 /// ShortenDeadCopyLiveRange - Shorten a live range as it's artificially
239 /// extended by a dead copy. Mark the last use (if any) of the val# as kill
240 /// as ends the live range there. If there isn't another use, then this
241 /// live range is dead. Return true if live interval is removed.
242 bool ShortenDeadCopySrcLiveRange(LiveInterval &li, MachineInstr *CopyMI);
244 /// lastRegisterUse - Returns the last use of the specific register between
245 /// cycles Start and End or NULL if there are no uses.
246 MachineOperand *lastRegisterUse(unsigned Start, unsigned End, unsigned Reg,
247 unsigned &LastUseIdx) const;
249 void printRegName(unsigned reg) const;
252 } // End llvm namespace