blob: 205341c19c800ec95931f94b30c8109b2b44a690 [file] [log] [blame]
Jakob Stoklund Olesen8dd070e2011-01-04 21:10:05 +00001//===-------- SplitKit.h - Toolkit for splitting live ranges ----*- C++ -*-===//
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +00002//
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 contains the SplitAnalysis class as well as mutator functions for
11// live range splitting.
12//
13//===----------------------------------------------------------------------===//
14
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000015#include "llvm/ADT/DenseMap.h"
Eric Christopher0f438112011-02-03 06:18:29 +000016#include "llvm/ADT/IntervalMap.h"
Jakob Stoklund Olesen8d0963f2010-12-21 01:50:21 +000017#include "llvm/ADT/SmallPtrSet.h"
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +000018#include "llvm/CodeGen/SlotIndexes.h"
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000019
20namespace llvm {
21
Eric Christopher0f438112011-02-03 06:18:29 +000022class ConnectedVNInfoEqClasses;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000023class LiveInterval;
24class LiveIntervals;
Jakob Stoklund Olesena17768f2010-10-14 23:49:52 +000025class LiveRangeEdit;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000026class MachineInstr;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000027class MachineLoop;
28class MachineLoopInfo;
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +000029class MachineRegisterInfo;
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +000030class TargetInstrInfo;
Jakob Stoklund Olesencfa71342010-11-10 19:31:50 +000031class TargetRegisterInfo;
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +000032class VirtRegMap;
33class VNInfo;
Jakob Stoklund Olesen532de3d2010-10-22 20:28:21 +000034class raw_ostream;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000035
Jakob Stoklund Olesene1dde7b2010-10-28 20:34:52 +000036/// At some point we should just include MachineDominators.h:
37class MachineDominatorTree;
38template <class NodeT> class DomTreeNodeBase;
39typedef DomTreeNodeBase<MachineBasicBlock> MachineDomTreeNode;
40
Jakob Stoklund Olesen8d0963f2010-12-21 01:50:21 +000041
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +000042/// SplitAnalysis - Analyze a LiveInterval, looking for live range splitting
43/// opportunities.
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000044class SplitAnalysis {
Jakob Stoklund Olesen08e93b12010-08-10 17:07:22 +000045public:
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000046 const MachineFunction &MF;
47 const LiveIntervals &LIS;
48 const MachineLoopInfo &Loops;
49 const TargetInstrInfo &TII;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000050
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000051 // Instructions using the the current register.
52 typedef SmallPtrSet<const MachineInstr*, 16> InstrPtrSet;
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000053 InstrPtrSet UsingInstrs;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000054
Jakob Stoklund Olesenb5fa9332011-01-18 21:13:27 +000055 // Sorted slot indexes of using instructions.
56 SmallVector<SlotIndex, 8> UseSlots;
57
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000058 // The number of instructions using CurLI in each basic block.
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000059 typedef DenseMap<const MachineBasicBlock*, unsigned> BlockCountMap;
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000060 BlockCountMap UsingBlocks;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000061
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000062 // The number of basic block using CurLI in each loop.
Jakob Stoklund Olesen2dee7a52010-08-12 23:02:55 +000063 typedef DenseMap<const MachineLoop*, unsigned> LoopCountMap;
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000064 LoopCountMap UsingLoops;
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000065
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +000066private:
67 // Current live interval.
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000068 const LiveInterval *CurLI;
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +000069
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000070 // Sumarize statistics by counting instructions using CurLI.
Jakob Stoklund Olesenabff2802010-07-20 16:12:37 +000071 void analyzeUses();
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000072
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +000073 /// canAnalyzeBranch - Return true if MBB ends in a branch that can be
74 /// analyzed.
75 bool canAnalyzeBranch(const MachineBasicBlock *MBB);
76
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000077public:
Jakob Stoklund Olesenf2c6e362010-07-20 23:50:15 +000078 SplitAnalysis(const MachineFunction &mf, const LiveIntervals &lis,
79 const MachineLoopInfo &mli);
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000080
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000081 /// analyze - set CurLI to the specified interval, and analyze how it may be
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +000082 /// split.
83 void analyze(const LiveInterval *li);
84
85 /// clear - clear all data structures so SplitAnalysis is ready to analyze a
86 /// new interval.
87 void clear();
88
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000089 /// hasUses - Return true if MBB has any uses of CurLI.
Jakob Stoklund Olesenb5fa9332011-01-18 21:13:27 +000090 bool hasUses(const MachineBasicBlock *MBB) const {
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +000091 return UsingBlocks.lookup(MBB);
Jakob Stoklund Olesenb5fa9332011-01-18 21:13:27 +000092 }
93
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +000094 typedef SmallPtrSet<const MachineBasicBlock*, 16> BlockPtrSet;
Jakob Stoklund Olesen2dee7a52010-08-12 23:02:55 +000095 typedef SmallPtrSet<const MachineLoop*, 16> LoopPtrSet;
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +000096
Jakob Stoklund Olesen532de3d2010-10-22 20:28:21 +000097 // Print a set of blocks with use counts.
98 void print(const BlockPtrSet&, raw_ostream&) const;
99
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +0000100 // Sets of basic blocks surrounding a machine loop.
101 struct LoopBlocks {
102 BlockPtrSet Loop; // Blocks in the loop.
103 BlockPtrSet Preds; // Loop predecessor blocks.
104 BlockPtrSet Exits; // Loop exit blocks.
105
106 void clear() {
107 Loop.clear();
108 Preds.clear();
109 Exits.clear();
110 }
111 };
112
Jakob Stoklund Olesen532de3d2010-10-22 20:28:21 +0000113 // Print loop blocks with use counts.
114 void print(const LoopBlocks&, raw_ostream&) const;
115
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +0000116 // Calculate the block sets surrounding the loop.
117 void getLoopBlocks(const MachineLoop *Loop, LoopBlocks &Blocks);
118
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +0000119 /// LoopPeripheralUse - how is a variable used in and around a loop?
120 /// Peripheral blocks are the loop predecessors and exit blocks.
121 enum LoopPeripheralUse {
122 ContainedInLoop, // All uses are inside the loop.
123 SinglePeripheral, // At most one instruction per peripheral block.
124 MultiPeripheral, // Multiple instructions in some peripheral blocks.
125 OutsideLoop // Uses outside loop periphery.
126 };
127
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000128 /// analyzeLoopPeripheralUse - Return an enum describing how CurLI is used in
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +0000129 /// and around the Loop.
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +0000130 LoopPeripheralUse analyzeLoopPeripheralUse(const LoopBlocks&);
131
132 /// getCriticalExits - It may be necessary to partially break critical edges
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000133 /// leaving the loop if an exit block has phi uses of CurLI. Collect the exit
Jakob Stoklund Olesen6a0dc072010-07-20 21:46:58 +0000134 /// blocks that need special treatment into CriticalExits.
135 void getCriticalExits(const LoopBlocks &Blocks, BlockPtrSet &CriticalExits);
136
137 /// canSplitCriticalExits - Return true if it is possible to insert new exit
138 /// blocks before the blocks in CriticalExits.
139 bool canSplitCriticalExits(const LoopBlocks &Blocks,
140 BlockPtrSet &CriticalExits);
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +0000141
Jakob Stoklund Olesen0960a652010-10-27 00:39:05 +0000142 /// getCriticalPreds - Get the set of loop predecessors with critical edges to
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000143 /// blocks outside the loop that have CurLI live in. We don't have to break
Jakob Stoklund Olesen0960a652010-10-27 00:39:05 +0000144 /// these edges, but they do require special treatment.
145 void getCriticalPreds(const LoopBlocks &Blocks, BlockPtrSet &CriticalPreds);
146
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000147 /// getSplitLoops - Get the set of loops that have CurLI uses and would be
Jakob Stoklund Olesen521a4532010-12-15 17:41:19 +0000148 /// profitable to split.
149 void getSplitLoops(LoopPtrSet&);
150
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000151 /// getBestSplitLoop - Return the loop where CurLI may best be split to a
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +0000152 /// separate register, or NULL.
153 const MachineLoop *getBestSplitLoop();
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +0000154
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000155 /// isBypassLoop - Return true if CurLI is live through Loop and has no uses
Jakob Stoklund Olesen697483a2010-12-15 17:49:52 +0000156 /// inside the loop. Bypass loops are candidates for splitting because it can
157 /// prevent interference inside the loop.
158 bool isBypassLoop(const MachineLoop *Loop);
159
160 /// getBypassLoops - Get all the maximal bypass loops. These are the bypass
161 /// loops whose parent is not a bypass loop.
162 void getBypassLoops(LoopPtrSet&);
163
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +0000164 /// getMultiUseBlocks - Add basic blocks to Blocks that may benefit from
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000165 /// having CurLI split to a new live interval. Return true if Blocks can be
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +0000166 /// passed to SplitEditor::splitSingleBlocks.
167 bool getMultiUseBlocks(BlockPtrSet &Blocks);
Jakob Stoklund Olesenfc412d82010-08-13 21:18:48 +0000168
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000169 /// getBlockForInsideSplit - If CurLI is contained inside a single basic
170 /// block, and it would pay to subdivide the interval inside that block,
171 /// return it. Otherwise return NULL. The returned block can be passed to
Jakob Stoklund Olesenfc412d82010-08-13 21:18:48 +0000172 /// SplitEditor::splitInsideBlock.
173 const MachineBasicBlock *getBlockForInsideSplit();
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +0000174};
175
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000176
177/// LiveIntervalMap - Map values from a large LiveInterval into a small
178/// interval that is a subset. Insert phi-def values as needed. This class is
179/// used by SplitEditor to create new smaller LiveIntervals.
180///
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000181/// ParentLI is the larger interval, LI is the subset interval. Every value
182/// in LI corresponds to exactly one value in ParentLI, and the live range
183/// of the value is contained within the live range of the ParentLI value.
184/// Values in ParentLI may map to any number of OpenLI values, including 0.
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000185class LiveIntervalMap {
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000186 LiveIntervals &LIS;
187 MachineDominatorTree &MDT;
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000188
189 // The parent interval is never changed.
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000190 const LiveInterval &ParentLI;
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000191
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000192 // The child interval's values are fully contained inside ParentLI values.
193 LiveInterval *LI;
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000194
195 typedef DenseMap<const VNInfo*, VNInfo*> ValueMap;
196
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000197 // Map ParentLI values to simple values in LI that are defined at the same
198 // SlotIndex, or NULL for ParentLI values that have complex LI defs.
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000199 // Note there is a difference between values mapping to NULL (complex), and
200 // values not present (unknown/unmapped).
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000201 ValueMap Values;
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000202
Jakob Stoklund Olesene1dde7b2010-10-28 20:34:52 +0000203 typedef std::pair<VNInfo*, MachineDomTreeNode*> LiveOutPair;
204 typedef DenseMap<MachineBasicBlock*,LiveOutPair> LiveOutMap;
205
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000206 // LiveOutCache - Map each basic block where LI is live out to the live-out
Jakob Stoklund Olesene1dde7b2010-10-28 20:34:52 +0000207 // value and its defining block. One of these conditions shall be true:
208 //
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000209 // 1. !LiveOutCache.count(MBB)
210 // 2. LiveOutCache[MBB].second.getNode() == MBB
211 // 3. forall P in preds(MBB): LiveOutCache[P] == LiveOutCache[MBB]
Jakob Stoklund Olesene1dde7b2010-10-28 20:34:52 +0000212 //
213 // This is only a cache, the values can be computed as:
214 //
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000215 // VNI = LI->getVNInfoAt(LIS.getMBBEndIdx(MBB))
216 // Node = mbt_[LIS.getMBBFromIndex(VNI->def)]
Jakob Stoklund Olesene1dde7b2010-10-28 20:34:52 +0000217 //
218 // The cache is also used as a visiteed set by mapValue().
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000219 LiveOutMap LiveOutCache;
Jakob Stoklund Olesene1dde7b2010-10-28 20:34:52 +0000220
Jakob Stoklund Olesend7ca5772011-01-20 17:45:20 +0000221 // Dump the live-out cache to dbgs().
222 void dumpCache();
223
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000224public:
225 LiveIntervalMap(LiveIntervals &lis,
Jakob Stoklund Olesend68f4582010-10-28 20:34:50 +0000226 MachineDominatorTree &mdt,
Jakob Stoklund Olesen9ca2aeb2010-09-13 23:29:09 +0000227 const LiveInterval &parentli)
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000228 : LIS(lis), MDT(mdt), ParentLI(parentli), LI(0) {}
Jakob Stoklund Olesen9ca2aeb2010-09-13 23:29:09 +0000229
230 /// reset - clear all data structures and start a new live interval.
231 void reset(LiveInterval *);
232
233 /// getLI - return the current live interval.
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000234 LiveInterval *getLI() const { return LI; }
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000235
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000236 /// defValue - define a value in LI from the ParentLI value VNI and Idx.
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000237 /// Idx does not have to be ParentVNI->def, but it must be contained within
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000238 /// ParentVNI's live range in ParentLI.
239 /// Return the new LI value.
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000240 VNInfo *defValue(const VNInfo *ParentVNI, SlotIndex Idx);
241
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000242 /// mapValue - map ParentVNI to the corresponding LI value at Idx. It is
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000243 /// assumed that ParentVNI is live at Idx.
244 /// If ParentVNI has not been defined by defValue, it is assumed that
245 /// ParentVNI->def dominates Idx.
246 /// If ParentVNI has been defined by defValue one or more times, a value that
247 /// dominates Idx will be returned. This may require creating extra phi-def
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000248 /// values and adding live ranges to LI.
Jakob Stoklund Olesen5fa42a42010-09-21 22:32:21 +0000249 /// If simple is not NULL, *simple will indicate if ParentVNI is a simply
250 /// mapped value.
251 VNInfo *mapValue(const VNInfo *ParentVNI, SlotIndex Idx, bool *simple = 0);
252
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000253 // extendTo - Find the last LI value defined in MBB at or before Idx. The
Jakob Stoklund Olesenfc60d772010-10-05 20:36:25 +0000254 // parentli is assumed to be live at Idx. Extend the live range to include
255 // Idx. Return the found VNInfo, or NULL.
Jakob Stoklund Olesenc95c1462010-10-27 00:39:07 +0000256 VNInfo *extendTo(const MachineBasicBlock *MBB, SlotIndex Idx);
Jakob Stoklund Olesenfc60d772010-10-05 20:36:25 +0000257
Jakob Stoklund Olesen5fa42a42010-09-21 22:32:21 +0000258 /// isMapped - Return true is ParentVNI is a known mapped value. It may be a
259 /// simple 1-1 mapping or a complex mapping to later defs.
260 bool isMapped(const VNInfo *ParentVNI) const {
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000261 return Values.count(ParentVNI);
Jakob Stoklund Olesen5fa42a42010-09-21 22:32:21 +0000262 }
263
264 /// isComplexMapped - Return true if ParentVNI has received new definitions
265 /// with defValue.
266 bool isComplexMapped(const VNInfo *ParentVNI) const;
267
Eric Christopher0f438112011-02-03 06:18:29 +0000268 /// markComplexMapped - Mark ParentVNI as complex mapped regardless of the
269 /// number of definitions.
270 void markComplexMapped(const VNInfo *ParentVNI) { Values[ParentVNI] = 0; }
271
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000272 // addSimpleRange - Add a simple range from ParentLI to LI.
Jakob Stoklund Olesen5fa42a42010-09-21 22:32:21 +0000273 // ParentVNI must be live in the [Start;End) interval.
274 void addSimpleRange(SlotIndex Start, SlotIndex End, const VNInfo *ParentVNI);
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000275
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000276 /// addRange - Add live ranges to LI where [Start;End) intersects ParentLI.
Jakob Stoklund Olesen1407c842010-08-18 19:00:08 +0000277 /// All needed values whose def is not inside [Start;End) must be defined
278 /// beforehand so mapValue will work.
279 void addRange(SlotIndex Start, SlotIndex End);
280};
281
282
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000283/// SplitEditor - Edit machine code and LiveIntervals for live range
284/// splitting.
285///
Jakob Stoklund Olesen5eb308b2010-08-06 22:17:33 +0000286/// - Create a SplitEditor from a SplitAnalysis.
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000287/// - Start a new live interval with openIntv.
288/// - Mark the places where the new interval is entered using enterIntv*
289/// - Mark the ranges where the new interval is used with useIntv*
290/// - Mark the places where the interval is exited with exitIntv*.
291/// - Finish the current interval with closeIntv and repeat from 2.
Jakob Stoklund Olesen74669272010-10-08 23:42:21 +0000292/// - Rewrite instructions with finish().
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000293///
294class SplitEditor {
295 SplitAnalysis &sa_;
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000296 LiveIntervals &LIS;
297 VirtRegMap &VRM;
298 MachineRegisterInfo &MRI;
Eric Christopher0f438112011-02-03 06:18:29 +0000299 MachineDominatorTree &MDT;
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000300 const TargetInstrInfo &TII;
301 const TargetRegisterInfo &TRI;
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000302
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000303 /// Edit - The current parent register and new intervals created.
304 LiveRangeEdit &Edit;
Jakob Stoklund Olesena17768f2010-10-14 23:49:52 +0000305
Eric Christopher0f438112011-02-03 06:18:29 +0000306 /// Index into Edit of the currently open interval.
307 /// The index 0 is used for the complement, so the first interval started by
308 /// openIntv will be 1.
309 unsigned OpenIdx;
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000310
Eric Christopher0f438112011-02-03 06:18:29 +0000311 typedef IntervalMap<SlotIndex, unsigned> RegAssignMap;
312
313 /// Allocator for the interval map. This will eventually be shared with
314 /// SlotIndexes and LiveIntervals.
315 RegAssignMap::Allocator Allocator;
316
317 /// RegAssign - Map of the assigned register indexes.
318 /// Edit.get(RegAssign.lookup(Idx)) is the register that should be live at
319 /// Idx.
320 RegAssignMap RegAssign;
321
322 /// LIMappers - One LiveIntervalMap or each interval in Edit.
323 SmallVector<LiveIntervalMap, 4> LIMappers;
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000324
Jakob Stoklund Olesencfa71342010-11-10 19:31:50 +0000325 /// defFromParent - Define Reg from ParentVNI at UseIdx using either
326 /// rematerialization or a COPY from parent. Return the new value.
Eric Christopher0f438112011-02-03 06:18:29 +0000327 VNInfo *defFromParent(unsigned RegIdx,
Jakob Stoklund Olesencfa71342010-11-10 19:31:50 +0000328 VNInfo *ParentVNI,
329 SlotIndex UseIdx,
330 MachineBasicBlock &MBB,
331 MachineBasicBlock::iterator I);
332
Eric Christopher0f438112011-02-03 06:18:29 +0000333 /// rewriteAssigned - Rewrite all uses of Edit.getReg() to assigned registers.
334 void rewriteAssigned();
Jakob Stoklund Olesen5fa42a42010-09-21 22:32:21 +0000335
Eric Christopher0f438112011-02-03 06:18:29 +0000336 /// rewriteComponents - Rewrite all uses of Intv[0] according to the eq
337 /// classes in ConEQ.
338 /// This must be done when Intvs[0] is styill live at all uses, before calling
339 /// ConEq.Distribute().
340 void rewriteComponents(const SmallVectorImpl<LiveInterval*> &Intvs,
341 const ConnectedVNInfoEqClasses &ConEq);
Jakob Stoklund Olesen74669272010-10-08 23:42:21 +0000342
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000343public:
344 /// Create a new SplitEditor for editing the LiveInterval analyzed by SA.
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000345 /// Newly created intervals will be appended to newIntervals.
Jakob Stoklund Olesend68f4582010-10-28 20:34:50 +0000346 SplitEditor(SplitAnalysis &SA, LiveIntervals&, VirtRegMap&,
347 MachineDominatorTree&, LiveRangeEdit&);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000348
Jakob Stoklund Olesen5eb308b2010-08-06 22:17:33 +0000349 /// getAnalysis - Get the corresponding analysis.
350 SplitAnalysis &getAnalysis() { return sa_; }
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000351
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000352 /// Create a new virtual register and live interval.
353 void openIntv();
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000354
Jakob Stoklund Olesen207c8682011-02-03 17:04:16 +0000355 /// enterIntvBefore - Enter the open interval before the instruction at Idx.
356 /// If the parent interval is not live before Idx, a COPY is not inserted.
357 /// Return the beginning of the new live range.
358 SlotIndex enterIntvBefore(SlotIndex Idx);
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +0000359
Jakob Stoklund Olesen207c8682011-02-03 17:04:16 +0000360 /// enterIntvAtEnd - Enter the open interval at the end of MBB.
361 /// Use the open interval from he inserted copy to the MBB end.
362 /// Return the beginning of the new live range.
363 SlotIndex enterIntvAtEnd(MachineBasicBlock &MBB);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000364
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000365 /// useIntv - indicate that all instructions in MBB should use OpenLI.
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000366 void useIntv(const MachineBasicBlock &MBB);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000367
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000368 /// useIntv - indicate that all instructions in range should use OpenLI.
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000369 void useIntv(SlotIndex Start, SlotIndex End);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000370
Jakob Stoklund Olesen207c8682011-02-03 17:04:16 +0000371 /// leaveIntvAfter - Leave the open interval after the instruction at Idx.
372 /// Return the end of the live range.
373 SlotIndex leaveIntvAfter(SlotIndex Idx);
Jakob Stoklund Olesenf1b05f22010-08-12 17:07:14 +0000374
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000375 /// leaveIntvAtTop - Leave the interval at the top of MBB.
Jakob Stoklund Olesen207c8682011-02-03 17:04:16 +0000376 /// Add liveness from the MBB top to the copy.
377 /// Return the end of the live range.
378 SlotIndex leaveIntvAtTop(MachineBasicBlock &MBB);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000379
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000380 /// closeIntv - Indicate that we are done editing the currently open
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000381 /// LiveInterval, and ranges can be trimmed.
Jakob Stoklund Olesen7536f722010-08-04 22:08:39 +0000382 void closeIntv();
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000383
Jakob Stoklund Olesen74669272010-10-08 23:42:21 +0000384 /// finish - after all the new live ranges have been created, compute the
385 /// remaining live range, and rewrite instructions to use the new registers.
386 void finish();
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000387
Eric Christopher0f438112011-02-03 06:18:29 +0000388 /// dump - print the current interval maping to dbgs().
389 void dump() const;
390
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000391 // ===--- High level methods ---===
392
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000393 /// splitAroundLoop - Split CurLI into a separate live interval inside
Jakob Stoklund Olesen57d0f2d2010-10-05 22:19:33 +0000394 /// the loop.
395 void splitAroundLoop(const MachineLoop*);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000396
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000397 /// splitSingleBlocks - Split CurLI into a separate live interval inside each
Jakob Stoklund Olesen57d0f2d2010-10-05 22:19:33 +0000398 /// basic block in Blocks.
399 void splitSingleBlocks(const SplitAnalysis::BlockPtrSet &Blocks);
Jakob Stoklund Olesenf0179002010-07-26 23:44:11 +0000400
Jakob Stoklund Olesen07862842011-01-26 00:50:53 +0000401 /// splitInsideBlock - Split CurLI into multiple intervals inside MBB.
Jakob Stoklund Olesen57d0f2d2010-10-05 22:19:33 +0000402 void splitInsideBlock(const MachineBasicBlock *);
Jakob Stoklund Olesenfc412d82010-08-13 21:18:48 +0000403};
Jakob Stoklund Olesen8ae02632010-07-20 15:41:07 +0000404
405}