1 //===-------- SplitKit.h - Toolkit for splitting live ranges ----*- 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 contains the SplitAnalysis class as well as mutator functions for
11 // live range splitting.
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_CODEGEN_SPLITKIT_H
16 #define LLVM_CODEGEN_SPLITKIT_H
18 #include "llvm/ADT/ArrayRef.h"
19 #include "llvm/ADT/BitVector.h"
20 #include "llvm/ADT/DenseMap.h"
21 #include "llvm/ADT/IndexedMap.h"
22 #include "llvm/ADT/IntervalMap.h"
23 #include "llvm/ADT/SmallPtrSet.h"
24 #include "llvm/CodeGen/SlotIndexes.h"
28 class ConnectedVNInfoEqClasses
;
33 class MachineLoopInfo
;
34 class MachineRegisterInfo
;
35 class TargetInstrInfo
;
36 class TargetRegisterInfo
;
41 /// At some point we should just include MachineDominators.h:
42 class MachineDominatorTree
;
43 template <class NodeT
> class DomTreeNodeBase
;
44 typedef DomTreeNodeBase
<MachineBasicBlock
> MachineDomTreeNode
;
47 /// SplitAnalysis - Analyze a LiveInterval, looking for live range splitting
51 const MachineFunction
&MF
;
52 const VirtRegMap
&VRM
;
53 const LiveIntervals
&LIS
;
54 const MachineLoopInfo
&Loops
;
55 const TargetInstrInfo
&TII
;
57 // Sorted slot indexes of using instructions.
58 SmallVector
<SlotIndex
, 8> UseSlots
;
60 /// Additional information about basic blocks where the current variable is
61 /// live. Such a block will look like one of these templates:
63 /// 1. | o---x | Internal to block. Variable is only live in this block.
64 /// 2. |---x | Live-in, kill.
65 /// 3. | o---| Def, live-out.
66 /// 4. |---x o---| Live-in, kill, def, live-out. Counted by NumGapBlocks.
67 /// 5. |---o---o---| Live-through with uses or defs.
68 /// 6. |-----------| Live-through without uses. Counted by NumThroughBlocks.
70 /// Two BlockInfo entries are created for template 4. One for the live-in
71 /// segment, and one for the live-out segment. These entries look as if the
72 /// block were split in the middle where the live range isn't live.
74 /// Live-through blocks without any uses don't get BlockInfo entries. They
75 /// are simply listed in ThroughBlocks instead.
78 MachineBasicBlock
*MBB
;
79 SlotIndex FirstUse
; ///< First instr using current reg.
80 SlotIndex LastUse
; ///< Last instr using current reg.
81 bool LiveThrough
; ///< Live in whole block (Templ 5. above).
82 bool LiveIn
; ///< Current reg is live in.
83 bool LiveOut
; ///< Current reg is live out.
85 /// isOneInstr - Returns true when this BlockInfo describes a single
87 bool isOneInstr() const {
88 return SlotIndex::isSameInstr(FirstUse
, LastUse
);
93 // Current live interval.
94 const LiveInterval
*CurLI
;
96 /// LastSplitPoint - Last legal split point in each basic block in the current
97 /// function. The first entry is the first terminator, the second entry is the
98 /// last valid split point for a variable that is live in to a landing pad
100 SmallVector
<std::pair
<SlotIndex
, SlotIndex
>, 8> LastSplitPoint
;
102 /// UseBlocks - Blocks where CurLI has uses.
103 SmallVector
<BlockInfo
, 8> UseBlocks
;
105 /// NumGapBlocks - Number of duplicate entries in UseBlocks for blocks where
106 /// the live range has a gap.
107 unsigned NumGapBlocks
;
109 /// ThroughBlocks - Block numbers where CurLI is live through without uses.
110 BitVector ThroughBlocks
;
112 /// NumThroughBlocks - Number of live-through blocks.
113 unsigned NumThroughBlocks
;
115 /// DidRepairRange - analyze was forced to shrinkToUses().
118 SlotIndex
computeLastSplitPoint(unsigned Num
);
120 // Sumarize statistics by counting instructions using CurLI.
123 /// calcLiveBlockInfo - Compute per-block information about CurLI.
124 bool calcLiveBlockInfo();
127 SplitAnalysis(const VirtRegMap
&vrm
, const LiveIntervals
&lis
,
128 const MachineLoopInfo
&mli
);
130 /// analyze - set CurLI to the specified interval, and analyze how it may be
132 void analyze(const LiveInterval
*li
);
134 /// didRepairRange() - Returns true if CurLI was invalid and has been repaired
135 /// by analyze(). This really shouldn't happen, but sometimes the coalescer
136 /// can create live ranges that end in mid-air.
137 bool didRepairRange() const { return DidRepairRange
; }
139 /// clear - clear all data structures so SplitAnalysis is ready to analyze a
143 /// getParent - Return the last analyzed interval.
144 const LiveInterval
&getParent() const { return *CurLI
; }
146 /// getLastSplitPoint - Return that base index of the last valid split point
147 /// in the basic block numbered Num.
148 SlotIndex
getLastSplitPoint(unsigned Num
) {
149 // Inline the common simple case.
150 if (LastSplitPoint
[Num
].first
.isValid() &&
151 !LastSplitPoint
[Num
].second
.isValid())
152 return LastSplitPoint
[Num
].first
;
153 return computeLastSplitPoint(Num
);
156 /// isOriginalEndpoint - Return true if the original live range was killed or
157 /// (re-)defined at Idx. Idx should be the 'def' slot for a normal kill/def,
158 /// and 'use' for an early-clobber def.
159 /// This can be used to recognize code inserted by earlier live range
161 bool isOriginalEndpoint(SlotIndex Idx
) const;
163 /// getUseBlocks - Return an array of BlockInfo objects for the basic blocks
164 /// where CurLI has uses.
165 ArrayRef
<BlockInfo
> getUseBlocks() const { return UseBlocks
; }
167 /// getNumThroughBlocks - Return the number of through blocks.
168 unsigned getNumThroughBlocks() const { return NumThroughBlocks
; }
170 /// isThroughBlock - Return true if CurLI is live through MBB without uses.
171 bool isThroughBlock(unsigned MBB
) const { return ThroughBlocks
.test(MBB
); }
173 /// getThroughBlocks - Return the set of through blocks.
174 const BitVector
&getThroughBlocks() const { return ThroughBlocks
; }
176 /// getNumLiveBlocks - Return the number of blocks where CurLI is live.
177 unsigned getNumLiveBlocks() const {
178 return getUseBlocks().size() - NumGapBlocks
+ getNumThroughBlocks();
181 /// countLiveBlocks - Return the number of blocks where li is live. This is
182 /// guaranteed to return the same number as getNumLiveBlocks() after calling
184 unsigned countLiveBlocks(const LiveInterval
*li
) const;
186 typedef SmallPtrSet
<const MachineBasicBlock
*, 16> BlockPtrSet
;
188 /// getMultiUseBlocks - Add basic blocks to Blocks that may benefit from
189 /// having CurLI split to a new live interval. Return true if Blocks can be
190 /// passed to SplitEditor::splitSingleBlocks.
191 bool getMultiUseBlocks(BlockPtrSet
&Blocks
);
195 /// SplitEditor - Edit machine code and LiveIntervals for live range
198 /// - Create a SplitEditor from a SplitAnalysis.
199 /// - Start a new live interval with openIntv.
200 /// - Mark the places where the new interval is entered using enterIntv*
201 /// - Mark the ranges where the new interval is used with useIntv*
202 /// - Mark the places where the interval is exited with exitIntv*.
203 /// - Finish the current interval with closeIntv and repeat from 2.
204 /// - Rewrite instructions with finish().
210 MachineRegisterInfo
&MRI
;
211 MachineDominatorTree
&MDT
;
212 const TargetInstrInfo
&TII
;
213 const TargetRegisterInfo
&TRI
;
215 /// Edit - The current parent register and new intervals created.
218 /// Index into Edit of the currently open interval.
219 /// The index 0 is used for the complement, so the first interval started by
220 /// openIntv will be 1.
223 typedef IntervalMap
<SlotIndex
, unsigned> RegAssignMap
;
225 /// Allocator for the interval map. This will eventually be shared with
226 /// SlotIndexes and LiveIntervals.
227 RegAssignMap::Allocator Allocator
;
229 /// RegAssign - Map of the assigned register indexes.
230 /// Edit.get(RegAssign.lookup(Idx)) is the register that should be live at
232 RegAssignMap RegAssign
;
234 typedef DenseMap
<std::pair
<unsigned, unsigned>, VNInfo
*> ValueMap
;
236 /// Values - keep track of the mapping from parent values to values in the new
237 /// intervals. Given a pair (RegIdx, ParentVNI->id), Values contains:
239 /// 1. No entry - the value is not mapped to Edit.get(RegIdx).
240 /// 2. Null - the value is mapped to multiple values in Edit.get(RegIdx).
241 /// Each value is represented by a minimal live range at its def.
242 /// 3. A non-null VNInfo - the value is mapped to a single new value.
243 /// The new value has no live ranges anywhere.
246 typedef std::pair
<VNInfo
*, MachineDomTreeNode
*> LiveOutPair
;
247 typedef IndexedMap
<LiveOutPair
, MBB2NumberFunctor
> LiveOutMap
;
249 // LiveOutCache - Map each basic block where a new register is live out to the
250 // live-out value and its defining block.
251 // One of these conditions shall be true:
253 // 1. !LiveOutCache.count(MBB)
254 // 2. LiveOutCache[MBB].second.getNode() == MBB
255 // 3. forall P in preds(MBB): LiveOutCache[P] == LiveOutCache[MBB]
257 // This is only a cache, the values can be computed as:
259 // VNI = Edit.get(RegIdx)->getVNInfoAt(LIS.getMBBEndIdx(MBB))
260 // Node = mbt_[LIS.getMBBFromIndex(VNI->def)]
262 // The cache is also used as a visited set by extendRange(). It can be shared
263 // by all the new registers because at most one is live out of each block.
264 LiveOutMap LiveOutCache
;
266 // LiveOutSeen - Indexed by MBB->getNumber(), a bit is set for each valid
267 // entry in LiveOutCache.
268 BitVector LiveOutSeen
;
270 /// LiveInBlock - Info for updateSSA() about a block where a register is
272 /// The updateSSA caller provides DomNode and Kill inside MBB, updateSSA()
273 /// adds the computed live-in value.
275 // Dominator tree node for the block.
276 // Cleared by updateSSA when the final value has been determined.
277 MachineDomTreeNode
*DomNode
;
279 // Live-in value filled in by updateSSA once it is known.
282 // Position in block where the live-in range ends, or SlotIndex() if the
283 // range passes through the block.
286 LiveInBlock(MachineDomTreeNode
*node
) : DomNode(node
), Value(0) {}
289 /// LiveInBlocks - List of live-in blocks used by findReachingDefs() and
290 /// updateSSA(). This list is usually empty, it exists here to avoid frequent
292 SmallVector
<LiveInBlock
, 16> LiveInBlocks
;
294 /// defValue - define a value in RegIdx from ParentVNI at Idx.
295 /// Idx does not have to be ParentVNI->def, but it must be contained within
296 /// ParentVNI's live range in ParentLI. The new value is added to the value
298 /// Return the new LI value.
299 VNInfo
*defValue(unsigned RegIdx
, const VNInfo
*ParentVNI
, SlotIndex Idx
);
301 /// markComplexMapped - Mark ParentVNI as complex mapped in RegIdx regardless
302 /// of the number of defs.
303 void markComplexMapped(unsigned RegIdx
, const VNInfo
*ParentVNI
);
305 /// defFromParent - Define Reg from ParentVNI at UseIdx using either
306 /// rematerialization or a COPY from parent. Return the new value.
307 VNInfo
*defFromParent(unsigned RegIdx
,
310 MachineBasicBlock
&MBB
,
311 MachineBasicBlock::iterator I
);
313 /// extendRange - Extend the live range of Edit.get(RegIdx) so it reaches Idx.
314 /// Insert PHIDefs as needed to preserve SSA form.
315 void extendRange(unsigned RegIdx
, SlotIndex Idx
);
317 /// findReachingDefs - Starting from MBB, add blocks to LiveInBlocks until all
318 /// reaching defs for LI are found.
319 /// @param LI Live interval whose value is needed.
320 /// @param MBB Block where LI should be live-in.
321 /// @param Kill Kill point in MBB.
322 /// @return Unique value seen, or NULL.
323 VNInfo
*findReachingDefs(LiveInterval
*LI
, MachineBasicBlock
*MBB
,
326 /// updateSSA - Compute and insert PHIDefs such that all blocks in
327 // LiveInBlocks get a known live-in value. Add live ranges to the blocks.
330 /// transferValues - Transfer values to the new ranges.
331 /// Return true if any ranges were skipped.
332 bool transferValues();
334 /// extendPHIKillRanges - Extend the ranges of all values killed by original
336 void extendPHIKillRanges();
338 /// rewriteAssigned - Rewrite all uses of Edit.getReg() to assigned registers.
339 void rewriteAssigned(bool ExtendRanges
);
341 /// deleteRematVictims - Delete defs that are dead after rematerializing.
342 void deleteRematVictims();
345 /// Create a new SplitEditor for editing the LiveInterval analyzed by SA.
346 /// Newly created intervals will be appended to newIntervals.
347 SplitEditor(SplitAnalysis
&SA
, LiveIntervals
&, VirtRegMap
&,
348 MachineDominatorTree
&);
350 /// reset - Prepare for a new split.
351 void reset(LiveRangeEdit
&);
353 /// Create a new virtual register and live interval.
354 /// Return the interval index, starting from 1. Interval index 0 is the
355 /// implicit complement interval.
358 /// currentIntv - Return the current interval index.
359 unsigned currentIntv() const { return OpenIdx
; }
361 /// selectIntv - Select a previously opened interval index.
362 void selectIntv(unsigned Idx
);
364 /// enterIntvBefore - Enter the open interval before the instruction at Idx.
365 /// If the parent interval is not live before Idx, a COPY is not inserted.
366 /// Return the beginning of the new live range.
367 SlotIndex
enterIntvBefore(SlotIndex Idx
);
369 /// enterIntvAfter - Enter the open interval after the instruction at Idx.
370 /// Return the beginning of the new live range.
371 SlotIndex
enterIntvAfter(SlotIndex Idx
);
373 /// enterIntvAtEnd - Enter the open interval at the end of MBB.
374 /// Use the open interval from he inserted copy to the MBB end.
375 /// Return the beginning of the new live range.
376 SlotIndex
enterIntvAtEnd(MachineBasicBlock
&MBB
);
378 /// useIntv - indicate that all instructions in MBB should use OpenLI.
379 void useIntv(const MachineBasicBlock
&MBB
);
381 /// useIntv - indicate that all instructions in range should use OpenLI.
382 void useIntv(SlotIndex Start
, SlotIndex End
);
384 /// leaveIntvAfter - Leave the open interval after the instruction at Idx.
385 /// Return the end of the live range.
386 SlotIndex
leaveIntvAfter(SlotIndex Idx
);
388 /// leaveIntvBefore - Leave the open interval before the instruction at Idx.
389 /// Return the end of the live range.
390 SlotIndex
leaveIntvBefore(SlotIndex Idx
);
392 /// leaveIntvAtTop - Leave the interval at the top of MBB.
393 /// Add liveness from the MBB top to the copy.
394 /// Return the end of the live range.
395 SlotIndex
leaveIntvAtTop(MachineBasicBlock
&MBB
);
397 /// overlapIntv - Indicate that all instructions in range should use the open
398 /// interval, but also let the complement interval be live.
400 /// This doubles the register pressure, but is sometimes required to deal with
401 /// register uses after the last valid split point.
403 /// The Start index should be a return value from a leaveIntv* call, and End
404 /// should be in the same basic block. The parent interval must have the same
405 /// value across the range.
407 void overlapIntv(SlotIndex Start
, SlotIndex End
);
409 /// finish - after all the new live ranges have been created, compute the
410 /// remaining live range, and rewrite instructions to use the new registers.
411 /// @param LRMap When not null, this vector will map each live range in Edit
412 /// back to the indices returned by openIntv.
413 /// There may be extra indices created by dead code elimination.
414 void finish(SmallVectorImpl
<unsigned> *LRMap
= 0);
416 /// dump - print the current interval maping to dbgs().
419 // ===--- High level methods ---===
421 /// splitSingleBlock - Split CurLI into a separate live interval around the
422 /// uses in a single block. This is intended to be used as part of a larger
423 /// split, and doesn't call finish().
424 void splitSingleBlock(const SplitAnalysis::BlockInfo
&BI
);
426 /// splitSingleBlocks - Split CurLI into a separate live interval inside each
427 /// basic block in Blocks.
428 void splitSingleBlocks(const SplitAnalysis::BlockPtrSet
&Blocks
);