|
121
|
1 //===- LiveInterval.cpp - Live Interval Representation --------------------===//
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // This file implements the LiveRange and LiveInterval classes. Given some
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 // numbering of each the machine instructions an interval [i, j) is said to be a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 // live range for register v if there is no instruction with number j' >= j
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13 // such that v is live at j' and there is no instruction with number i' < i such
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 // that v is live at i'. In this implementation ranges can have holes,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 // i.e. a range might look like [1,20), [50,65), [1000,1001). Each
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 // individual segment is represented as an instance of LiveRange::Segment,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 // and the whole range is represented as an instance of LiveRange.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
18 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
21 #include "llvm/CodeGen/LiveInterval.h"
|
|
120
|
22 #include "LiveRangeUtils.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 #include "RegisterCoalescer.h"
|
|
121
|
24 #include "llvm/ADT/ArrayRef.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 #include "llvm/ADT/STLExtras.h"
|
|
121
|
26 #include "llvm/ADT/SmallPtrSet.h"
|
|
|
27 #include "llvm/ADT/SmallVector.h"
|
|
|
28 #include "llvm/ADT/iterator_range.h"
|
|
134
|
29 #include "llvm/CodeGen/LiveIntervals.h"
|
|
121
|
30 #include "llvm/CodeGen/MachineBasicBlock.h"
|
|
|
31 #include "llvm/CodeGen/MachineInstr.h"
|
|
|
32 #include "llvm/CodeGen/MachineOperand.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
33 #include "llvm/CodeGen/MachineRegisterInfo.h"
|
|
121
|
34 #include "llvm/CodeGen/SlotIndexes.h"
|
|
134
|
35 #include "llvm/CodeGen/TargetRegisterInfo.h"
|
|
121
|
36 #include "llvm/MC/LaneBitmask.h"
|
|
|
37 #include "llvm/Support/Compiler.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
38 #include "llvm/Support/Debug.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
39 #include "llvm/Support/raw_ostream.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
40 #include <algorithm>
|
|
121
|
41 #include <cassert>
|
|
|
42 #include <cstddef>
|
|
|
43 #include <iterator>
|
|
|
44 #include <utility>
|
|
|
45
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
46 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
47
|
|
95
|
48 namespace {
|
|
121
|
49
|
|
83
|
50 //===----------------------------------------------------------------------===//
|
|
|
51 // Implementation of various methods necessary for calculation of live ranges.
|
|
|
52 // The implementation of the methods abstracts from the concrete type of the
|
|
|
53 // segment collection.
|
|
|
54 //
|
|
|
55 // Implementation of the class follows the Template design pattern. The base
|
|
|
56 // class contains generic algorithms that call collection-specific methods,
|
|
|
57 // which are provided in concrete subclasses. In order to avoid virtual calls
|
|
|
58 // these methods are provided by means of C++ template instantiation.
|
|
|
59 // The base class calls the methods of the subclass through method impl(),
|
|
|
60 // which casts 'this' pointer to the type of the subclass.
|
|
|
61 //
|
|
|
62 //===----------------------------------------------------------------------===//
|
|
|
63
|
|
|
64 template <typename ImplT, typename IteratorT, typename CollectionT>
|
|
|
65 class CalcLiveRangeUtilBase {
|
|
|
66 protected:
|
|
|
67 LiveRange *LR;
|
|
|
68
|
|
|
69 protected:
|
|
|
70 CalcLiveRangeUtilBase(LiveRange *LR) : LR(LR) {}
|
|
|
71
|
|
|
72 public:
|
|
121
|
73 using Segment = LiveRange::Segment;
|
|
|
74 using iterator = IteratorT;
|
|
83
|
75
|
|
120
|
76 /// A counterpart of LiveRange::createDeadDef: Make sure the range has a
|
|
|
77 /// value defined at @p Def.
|
|
|
78 /// If @p ForVNI is null, and there is no value defined at @p Def, a new
|
|
|
79 /// value will be allocated using @p VNInfoAllocator.
|
|
|
80 /// If @p ForVNI is null, the return value is the value defined at @p Def,
|
|
|
81 /// either a pre-existing one, or the one newly created.
|
|
|
82 /// If @p ForVNI is not null, then @p Def should be the location where
|
|
|
83 /// @p ForVNI is defined. If the range does not have a value defined at
|
|
|
84 /// @p Def, the value @p ForVNI will be used instead of allocating a new
|
|
|
85 /// one. If the range already has a value defined at @p Def, it must be
|
|
|
86 /// same as @p ForVNI. In either case, @p ForVNI will be the return value.
|
|
|
87 VNInfo *createDeadDef(SlotIndex Def, VNInfo::Allocator *VNInfoAllocator,
|
|
|
88 VNInfo *ForVNI) {
|
|
83
|
89 assert(!Def.isDead() && "Cannot define a value at the dead slot");
|
|
120
|
90 assert((!ForVNI || ForVNI->def == Def) &&
|
|
|
91 "If ForVNI is specified, it must match Def");
|
|
83
|
92 iterator I = impl().find(Def);
|
|
|
93 if (I == segments().end()) {
|
|
120
|
94 VNInfo *VNI = ForVNI ? ForVNI : LR->getNextValue(Def, *VNInfoAllocator);
|
|
83
|
95 impl().insertAtEnd(Segment(Def, Def.getDeadSlot(), VNI));
|
|
|
96 return VNI;
|
|
|
97 }
|
|
|
98
|
|
|
99 Segment *S = segmentAt(I);
|
|
|
100 if (SlotIndex::isSameInstr(Def, S->start)) {
|
|
120
|
101 assert((!ForVNI || ForVNI == S->valno) && "Value number mismatch");
|
|
83
|
102 assert(S->valno->def == S->start && "Inconsistent existing value def");
|
|
|
103
|
|
|
104 // It is possible to have both normal and early-clobber defs of the same
|
|
|
105 // register on an instruction. It doesn't make a lot of sense, but it is
|
|
|
106 // possible to specify in inline assembly.
|
|
|
107 //
|
|
|
108 // Just convert everything to early-clobber.
|
|
|
109 Def = std::min(Def, S->start);
|
|
|
110 if (Def != S->start)
|
|
|
111 S->start = S->valno->def = Def;
|
|
|
112 return S->valno;
|
|
|
113 }
|
|
|
114 assert(SlotIndex::isEarlierInstr(Def, S->start) && "Already live at def");
|
|
120
|
115 VNInfo *VNI = ForVNI ? ForVNI : LR->getNextValue(Def, *VNInfoAllocator);
|
|
83
|
116 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI));
|
|
|
117 return VNI;
|
|
|
118 }
|
|
|
119
|
|
|
120 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Use) {
|
|
|
121 if (segments().empty())
|
|
|
122 return nullptr;
|
|
|
123 iterator I =
|
|
120
|
124 impl().findInsertPos(Segment(Use.getPrevSlot(), Use, nullptr));
|
|
83
|
125 if (I == segments().begin())
|
|
|
126 return nullptr;
|
|
|
127 --I;
|
|
|
128 if (I->end <= StartIdx)
|
|
|
129 return nullptr;
|
|
|
130 if (I->end < Use)
|
|
|
131 extendSegmentEndTo(I, Use);
|
|
|
132 return I->valno;
|
|
|
133 }
|
|
|
134
|
|
120
|
135 std::pair<VNInfo*,bool> extendInBlock(ArrayRef<SlotIndex> Undefs,
|
|
|
136 SlotIndex StartIdx, SlotIndex Use) {
|
|
|
137 if (segments().empty())
|
|
|
138 return std::make_pair(nullptr, false);
|
|
|
139 SlotIndex BeforeUse = Use.getPrevSlot();
|
|
|
140 iterator I = impl().findInsertPos(Segment(BeforeUse, Use, nullptr));
|
|
|
141 if (I == segments().begin())
|
|
|
142 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse));
|
|
|
143 --I;
|
|
|
144 if (I->end <= StartIdx)
|
|
|
145 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse));
|
|
|
146 if (I->end < Use) {
|
|
|
147 if (LR->isUndefIn(Undefs, I->end, BeforeUse))
|
|
|
148 return std::make_pair(nullptr, true);
|
|
|
149 extendSegmentEndTo(I, Use);
|
|
|
150 }
|
|
|
151 return std::make_pair(I->valno, false);
|
|
|
152 }
|
|
|
153
|
|
83
|
154 /// This method is used when we want to extend the segment specified
|
|
|
155 /// by I to end at the specified endpoint. To do this, we should
|
|
|
156 /// merge and eliminate all segments that this will overlap
|
|
|
157 /// with. The iterator is not invalidated.
|
|
|
158 void extendSegmentEndTo(iterator I, SlotIndex NewEnd) {
|
|
|
159 assert(I != segments().end() && "Not a valid segment!");
|
|
|
160 Segment *S = segmentAt(I);
|
|
|
161 VNInfo *ValNo = I->valno;
|
|
|
162
|
|
|
163 // Search for the first segment that we can't merge with.
|
|
|
164 iterator MergeTo = std::next(I);
|
|
|
165 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo)
|
|
|
166 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
|
|
|
167
|
|
|
168 // If NewEnd was in the middle of a segment, make sure to get its endpoint.
|
|
|
169 S->end = std::max(NewEnd, std::prev(MergeTo)->end);
|
|
|
170
|
|
|
171 // If the newly formed segment now touches the segment after it and if they
|
|
|
172 // have the same value number, merge the two segments into one segment.
|
|
|
173 if (MergeTo != segments().end() && MergeTo->start <= I->end &&
|
|
|
174 MergeTo->valno == ValNo) {
|
|
|
175 S->end = MergeTo->end;
|
|
|
176 ++MergeTo;
|
|
|
177 }
|
|
|
178
|
|
|
179 // Erase any dead segments.
|
|
|
180 segments().erase(std::next(I), MergeTo);
|
|
|
181 }
|
|
|
182
|
|
|
183 /// This method is used when we want to extend the segment specified
|
|
|
184 /// by I to start at the specified endpoint. To do this, we should
|
|
|
185 /// merge and eliminate all segments that this will overlap with.
|
|
|
186 iterator extendSegmentStartTo(iterator I, SlotIndex NewStart) {
|
|
|
187 assert(I != segments().end() && "Not a valid segment!");
|
|
|
188 Segment *S = segmentAt(I);
|
|
|
189 VNInfo *ValNo = I->valno;
|
|
|
190
|
|
|
191 // Search for the first segment that we can't merge with.
|
|
|
192 iterator MergeTo = I;
|
|
|
193 do {
|
|
|
194 if (MergeTo == segments().begin()) {
|
|
|
195 S->start = NewStart;
|
|
|
196 segments().erase(MergeTo, I);
|
|
|
197 return I;
|
|
|
198 }
|
|
|
199 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
|
|
|
200 --MergeTo;
|
|
|
201 } while (NewStart <= MergeTo->start);
|
|
|
202
|
|
|
203 // If we start in the middle of another segment, just delete a range and
|
|
|
204 // extend that segment.
|
|
|
205 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {
|
|
|
206 segmentAt(MergeTo)->end = S->end;
|
|
|
207 } else {
|
|
|
208 // Otherwise, extend the segment right after.
|
|
|
209 ++MergeTo;
|
|
|
210 Segment *MergeToSeg = segmentAt(MergeTo);
|
|
|
211 MergeToSeg->start = NewStart;
|
|
|
212 MergeToSeg->end = S->end;
|
|
|
213 }
|
|
|
214
|
|
|
215 segments().erase(std::next(MergeTo), std::next(I));
|
|
|
216 return MergeTo;
|
|
|
217 }
|
|
|
218
|
|
|
219 iterator addSegment(Segment S) {
|
|
|
220 SlotIndex Start = S.start, End = S.end;
|
|
|
221 iterator I = impl().findInsertPos(S);
|
|
|
222
|
|
|
223 // If the inserted segment starts in the middle or right at the end of
|
|
|
224 // another segment, just extend that segment to contain the segment of S.
|
|
|
225 if (I != segments().begin()) {
|
|
|
226 iterator B = std::prev(I);
|
|
|
227 if (S.valno == B->valno) {
|
|
|
228 if (B->start <= Start && B->end >= Start) {
|
|
|
229 extendSegmentEndTo(B, End);
|
|
|
230 return B;
|
|
|
231 }
|
|
|
232 } else {
|
|
|
233 // Check to make sure that we are not overlapping two live segments with
|
|
|
234 // different valno's.
|
|
|
235 assert(B->end <= Start &&
|
|
|
236 "Cannot overlap two segments with differing ValID's"
|
|
|
237 " (did you def the same reg twice in a MachineInstr?)");
|
|
|
238 }
|
|
|
239 }
|
|
|
240
|
|
|
241 // Otherwise, if this segment ends in the middle of, or right next
|
|
|
242 // to, another segment, merge it into that segment.
|
|
|
243 if (I != segments().end()) {
|
|
|
244 if (S.valno == I->valno) {
|
|
|
245 if (I->start <= End) {
|
|
|
246 I = extendSegmentStartTo(I, Start);
|
|
|
247
|
|
|
248 // If S is a complete superset of a segment, we may need to grow its
|
|
|
249 // endpoint as well.
|
|
|
250 if (End > I->end)
|
|
|
251 extendSegmentEndTo(I, End);
|
|
|
252 return I;
|
|
|
253 }
|
|
|
254 } else {
|
|
|
255 // Check to make sure that we are not overlapping two live segments with
|
|
|
256 // different valno's.
|
|
|
257 assert(I->start >= End &&
|
|
|
258 "Cannot overlap two segments with differing ValID's");
|
|
|
259 }
|
|
|
260 }
|
|
|
261
|
|
|
262 // Otherwise, this is just a new segment that doesn't interact with
|
|
|
263 // anything.
|
|
|
264 // Insert it.
|
|
|
265 return segments().insert(I, S);
|
|
|
266 }
|
|
|
267
|
|
|
268 private:
|
|
|
269 ImplT &impl() { return *static_cast<ImplT *>(this); }
|
|
|
270
|
|
|
271 CollectionT &segments() { return impl().segmentsColl(); }
|
|
|
272
|
|
|
273 Segment *segmentAt(iterator I) { return const_cast<Segment *>(&(*I)); }
|
|
|
274 };
|
|
|
275
|
|
|
276 //===----------------------------------------------------------------------===//
|
|
|
277 // Instantiation of the methods for calculation of live ranges
|
|
|
278 // based on a segment vector.
|
|
|
279 //===----------------------------------------------------------------------===//
|
|
|
280
|
|
|
281 class CalcLiveRangeUtilVector;
|
|
121
|
282 using CalcLiveRangeUtilVectorBase =
|
|
|
283 CalcLiveRangeUtilBase<CalcLiveRangeUtilVector, LiveRange::iterator,
|
|
|
284 LiveRange::Segments>;
|
|
83
|
285
|
|
|
286 class CalcLiveRangeUtilVector : public CalcLiveRangeUtilVectorBase {
|
|
|
287 public:
|
|
|
288 CalcLiveRangeUtilVector(LiveRange *LR) : CalcLiveRangeUtilVectorBase(LR) {}
|
|
|
289
|
|
|
290 private:
|
|
|
291 friend CalcLiveRangeUtilVectorBase;
|
|
|
292
|
|
|
293 LiveRange::Segments &segmentsColl() { return LR->segments; }
|
|
|
294
|
|
|
295 void insertAtEnd(const Segment &S) { LR->segments.push_back(S); }
|
|
|
296
|
|
|
297 iterator find(SlotIndex Pos) { return LR->find(Pos); }
|
|
|
298
|
|
|
299 iterator findInsertPos(Segment S) {
|
|
|
300 return std::upper_bound(LR->begin(), LR->end(), S.start);
|
|
|
301 }
|
|
|
302 };
|
|
|
303
|
|
|
304 //===----------------------------------------------------------------------===//
|
|
|
305 // Instantiation of the methods for calculation of live ranges
|
|
|
306 // based on a segment set.
|
|
|
307 //===----------------------------------------------------------------------===//
|
|
|
308
|
|
|
309 class CalcLiveRangeUtilSet;
|
|
121
|
310 using CalcLiveRangeUtilSetBase =
|
|
|
311 CalcLiveRangeUtilBase<CalcLiveRangeUtilSet, LiveRange::SegmentSet::iterator,
|
|
|
312 LiveRange::SegmentSet>;
|
|
83
|
313
|
|
|
314 class CalcLiveRangeUtilSet : public CalcLiveRangeUtilSetBase {
|
|
|
315 public:
|
|
|
316 CalcLiveRangeUtilSet(LiveRange *LR) : CalcLiveRangeUtilSetBase(LR) {}
|
|
|
317
|
|
|
318 private:
|
|
|
319 friend CalcLiveRangeUtilSetBase;
|
|
|
320
|
|
|
321 LiveRange::SegmentSet &segmentsColl() { return *LR->segmentSet; }
|
|
|
322
|
|
|
323 void insertAtEnd(const Segment &S) {
|
|
|
324 LR->segmentSet->insert(LR->segmentSet->end(), S);
|
|
|
325 }
|
|
|
326
|
|
|
327 iterator find(SlotIndex Pos) {
|
|
|
328 iterator I =
|
|
|
329 LR->segmentSet->upper_bound(Segment(Pos, Pos.getNextSlot(), nullptr));
|
|
|
330 if (I == LR->segmentSet->begin())
|
|
|
331 return I;
|
|
|
332 iterator PrevI = std::prev(I);
|
|
|
333 if (Pos < (*PrevI).end)
|
|
|
334 return PrevI;
|
|
|
335 return I;
|
|
|
336 }
|
|
|
337
|
|
|
338 iterator findInsertPos(Segment S) {
|
|
|
339 iterator I = LR->segmentSet->upper_bound(S);
|
|
|
340 if (I != LR->segmentSet->end() && !(S.start < *I))
|
|
|
341 ++I;
|
|
|
342 return I;
|
|
|
343 }
|
|
|
344 };
|
|
121
|
345
|
|
|
346 } // end anonymous namespace
|
|
83
|
347
|
|
|
348 //===----------------------------------------------------------------------===//
|
|
|
349 // LiveRange methods
|
|
|
350 //===----------------------------------------------------------------------===//
|
|
|
351
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
352 LiveRange::iterator LiveRange::find(SlotIndex Pos) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
353 // This algorithm is basically std::upper_bound.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
354 // Unfortunately, std::upper_bound cannot be used with mixed types until we
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
355 // adopt C++0x. Many libraries can do it, but not all.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
356 if (empty() || Pos >= endIndex())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
357 return end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
358 iterator I = begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
359 size_t Len = size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
360 do {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
361 size_t Mid = Len >> 1;
|
|
120
|
362 if (Pos < I[Mid].end) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
363 Len = Mid;
|
|
120
|
364 } else {
|
|
|
365 I += Mid + 1;
|
|
|
366 Len -= Mid + 1;
|
|
|
367 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
368 } while (Len);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
369 return I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
370 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
371
|
|
120
|
372 VNInfo *LiveRange::createDeadDef(SlotIndex Def, VNInfo::Allocator &VNIAlloc) {
|
|
83
|
373 // Use the segment set, if it is available.
|
|
|
374 if (segmentSet != nullptr)
|
|
120
|
375 return CalcLiveRangeUtilSet(this).createDeadDef(Def, &VNIAlloc, nullptr);
|
|
83
|
376 // Otherwise use the segment vector.
|
|
120
|
377 return CalcLiveRangeUtilVector(this).createDeadDef(Def, &VNIAlloc, nullptr);
|
|
|
378 }
|
|
|
379
|
|
|
380 VNInfo *LiveRange::createDeadDef(VNInfo *VNI) {
|
|
|
381 // Use the segment set, if it is available.
|
|
|
382 if (segmentSet != nullptr)
|
|
|
383 return CalcLiveRangeUtilSet(this).createDeadDef(VNI->def, nullptr, VNI);
|
|
|
384 // Otherwise use the segment vector.
|
|
|
385 return CalcLiveRangeUtilVector(this).createDeadDef(VNI->def, nullptr, VNI);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
386 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
387
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
388 // overlaps - Return true if the intersection of the two live ranges is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
389 // not empty.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
390 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
391 // An example for overlaps():
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
392 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
393 // 0: A = ...
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
394 // 4: B = ...
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
395 // 8: C = A + B ;; last use of A
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
396 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
397 // The live ranges should look like:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
398 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
399 // A = [3, 11)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
400 // B = [7, x)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
401 // C = [11, y)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
402 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
403 // A->overlaps(C) should return false since we want to be able to join
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
404 // A and C.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
405 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
406 bool LiveRange::overlapsFrom(const LiveRange& other,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
407 const_iterator StartPos) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
408 assert(!empty() && "empty range");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
409 const_iterator i = begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
410 const_iterator ie = end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
411 const_iterator j = StartPos;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
412 const_iterator je = other.end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
413
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
414 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
415 StartPos != other.end() && "Bogus start position hint!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
416
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
417 if (i->start < j->start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
418 i = std::upper_bound(i, ie, j->start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
419 if (i != begin()) --i;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
420 } else if (j->start < i->start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
421 ++StartPos;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 if (StartPos != other.end() && StartPos->start <= i->start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
423 assert(StartPos < other.end() && i < end());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
424 j = std::upper_bound(j, je, i->start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
425 if (j != other.begin()) --j;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
426 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
427 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
428 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
429 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
430
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
431 if (j == je) return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
432
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
433 while (i != ie) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
434 if (i->start > j->start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
435 std::swap(i, j);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
436 std::swap(ie, je);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
437 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
438
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
439 if (i->end > j->start)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
440 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
441 ++i;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
442 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
443
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
444 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
445 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
446
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
447 bool LiveRange::overlaps(const LiveRange &Other, const CoalescerPair &CP,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
448 const SlotIndexes &Indexes) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
449 assert(!empty() && "empty range");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
450 if (Other.empty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
451 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
452
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
453 // Use binary searches to find initial positions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
454 const_iterator I = find(Other.beginIndex());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
455 const_iterator IE = end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
456 if (I == IE)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
457 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
458 const_iterator J = Other.find(I->start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
459 const_iterator JE = Other.end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
460 if (J == JE)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
461 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
462
|
|
121
|
463 while (true) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
464 // J has just been advanced to satisfy:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
465 assert(J->end >= I->start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
466 // Check for an overlap.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
467 if (J->start < I->end) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
468 // I and J are overlapping. Find the later start.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
469 SlotIndex Def = std::max(I->start, J->start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
470 // Allow the overlap if Def is a coalescable copy.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
471 if (Def.isBlock() ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
472 !CP.isCoalescable(Indexes.getInstructionFromIndex(Def)))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
473 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
474 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
475 // Advance the iterator that ends first to check for more overlaps.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
476 if (J->end > I->end) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
477 std::swap(I, J);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
478 std::swap(IE, JE);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
479 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
480 // Advance J until J->end >= I->start.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
481 do
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
482 if (++J == JE)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
483 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
484 while (J->end < I->start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
485 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
486 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
487
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
488 /// overlaps - Return true if the live range overlaps an interval specified
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
489 /// by [Start, End).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
490 bool LiveRange::overlaps(SlotIndex Start, SlotIndex End) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
491 assert(Start < End && "Invalid range");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
492 const_iterator I = std::lower_bound(begin(), end(), End);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
493 return I != begin() && (--I)->end > Start;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
494 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
495
|
|
83
|
496 bool LiveRange::covers(const LiveRange &Other) const {
|
|
|
497 if (empty())
|
|
|
498 return Other.empty();
|
|
|
499
|
|
|
500 const_iterator I = begin();
|
|
|
501 for (const Segment &O : Other.segments) {
|
|
|
502 I = advanceTo(I, O.start);
|
|
|
503 if (I == end() || I->start > O.start)
|
|
|
504 return false;
|
|
|
505
|
|
|
506 // Check adjacent live segments and see if we can get behind O.end.
|
|
|
507 while (I->end < O.end) {
|
|
|
508 const_iterator Last = I;
|
|
|
509 // Get next segment and abort if it was not adjacent.
|
|
|
510 ++I;
|
|
|
511 if (I == end() || Last->end != I->start)
|
|
|
512 return false;
|
|
|
513 }
|
|
|
514 }
|
|
|
515 return true;
|
|
|
516 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
517
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
518 /// ValNo is dead, remove it. If it is the largest value number, just nuke it
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
519 /// (and any other deleted values neighboring it), otherwise mark it as ~1U so
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
520 /// it can be nuked later.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
521 void LiveRange::markValNoForDeletion(VNInfo *ValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
522 if (ValNo->id == getNumValNums()-1) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
523 do {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
524 valnos.pop_back();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
525 } while (!valnos.empty() && valnos.back()->isUnused());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
526 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
527 ValNo->markUnused();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
528 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
529 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
530
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
531 /// RenumberValues - Renumber all values in order of appearance and delete the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
532 /// remaining unused values.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
533 void LiveRange::RenumberValues() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
534 SmallPtrSet<VNInfo*, 8> Seen;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
535 valnos.clear();
|
|
83
|
536 for (const Segment &S : segments) {
|
|
|
537 VNInfo *VNI = S.valno;
|
|
|
538 if (!Seen.insert(VNI).second)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
539 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
540 assert(!VNI->isUnused() && "Unused valno used by live segment");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
541 VNI->id = (unsigned)valnos.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
542 valnos.push_back(VNI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
543 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
544 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
545
|
|
83
|
546 void LiveRange::addSegmentToSet(Segment S) {
|
|
|
547 CalcLiveRangeUtilSet(this).addSegment(S);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
548 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
549
|
|
83
|
550 LiveRange::iterator LiveRange::addSegment(Segment S) {
|
|
|
551 // Use the segment set, if it is available.
|
|
|
552 if (segmentSet != nullptr) {
|
|
|
553 addSegmentToSet(S);
|
|
|
554 return end();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
555 }
|
|
83
|
556 // Otherwise use the segment vector.
|
|
|
557 return CalcLiveRangeUtilVector(this).addSegment(S);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
558 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
559
|
|
83
|
560 void LiveRange::append(const Segment S) {
|
|
|
561 // Check that the segment belongs to the back of the list.
|
|
|
562 assert(segments.empty() || segments.back().end <= S.start);
|
|
|
563 segments.push_back(S);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
564 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
565
|
|
120
|
566 std::pair<VNInfo*,bool> LiveRange::extendInBlock(ArrayRef<SlotIndex> Undefs,
|
|
|
567 SlotIndex StartIdx, SlotIndex Kill) {
|
|
|
568 // Use the segment set, if it is available.
|
|
|
569 if (segmentSet != nullptr)
|
|
|
570 return CalcLiveRangeUtilSet(this).extendInBlock(Undefs, StartIdx, Kill);
|
|
|
571 // Otherwise use the segment vector.
|
|
|
572 return CalcLiveRangeUtilVector(this).extendInBlock(Undefs, StartIdx, Kill);
|
|
|
573 }
|
|
|
574
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
575 VNInfo *LiveRange::extendInBlock(SlotIndex StartIdx, SlotIndex Kill) {
|
|
83
|
576 // Use the segment set, if it is available.
|
|
|
577 if (segmentSet != nullptr)
|
|
|
578 return CalcLiveRangeUtilSet(this).extendInBlock(StartIdx, Kill);
|
|
|
579 // Otherwise use the segment vector.
|
|
|
580 return CalcLiveRangeUtilVector(this).extendInBlock(StartIdx, Kill);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
581 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
582
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
583 /// Remove the specified segment from this range. Note that the segment must
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
584 /// be in a single Segment in its entirety.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
585 void LiveRange::removeSegment(SlotIndex Start, SlotIndex End,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
586 bool RemoveDeadValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
587 // Find the Segment containing this span.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
588 iterator I = find(Start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
589 assert(I != end() && "Segment is not in range!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
590 assert(I->containsInterval(Start, End)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
591 && "Segment is not entirely in range!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
592
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
593 // If the span we are removing is at the start of the Segment, adjust it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
594 VNInfo *ValNo = I->valno;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
595 if (I->start == Start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
596 if (I->end == End) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
597 if (RemoveDeadValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
598 // Check if val# is dead.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
599 bool isDead = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
600 for (const_iterator II = begin(), EE = end(); II != EE; ++II)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
601 if (II != I && II->valno == ValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
602 isDead = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
603 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
604 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
605 if (isDead) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
606 // Now that ValNo is dead, remove it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
607 markValNoForDeletion(ValNo);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
608 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
609 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
610
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
611 segments.erase(I); // Removed the whole Segment.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
612 } else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
613 I->start = End;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
614 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
615 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
616
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
617 // Otherwise if the span we are removing is at the end of the Segment,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
618 // adjust the other way.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
619 if (I->end == End) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
620 I->end = Start;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
621 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
622 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
623
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
624 // Otherwise, we are splitting the Segment into two pieces.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
625 SlotIndex OldEnd = I->end;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
626 I->end = Start; // Trim the old segment.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
627
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
628 // Insert the new one.
|
|
77
|
629 segments.insert(std::next(I), Segment(End, OldEnd, ValNo));
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
630 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
631
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
632 /// removeValNo - Remove all the segments defined by the specified value#.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
633 /// Also remove the value# from value# list.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
634 void LiveRange::removeValNo(VNInfo *ValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
635 if (empty()) return;
|
|
120
|
636 segments.erase(remove_if(*this, [ValNo](const Segment &S) {
|
|
95
|
637 return S.valno == ValNo;
|
|
|
638 }), end());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
639 // Now that ValNo is dead, remove it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
640 markValNoForDeletion(ValNo);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
641 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
642
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
643 void LiveRange::join(LiveRange &Other,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
644 const int *LHSValNoAssignments,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
645 const int *RHSValNoAssignments,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
646 SmallVectorImpl<VNInfo *> &NewVNInfo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
647 verify();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
648
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
649 // Determine if any of our values are mapped. This is uncommon, so we want
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
650 // to avoid the range scan if not.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
651 bool MustMapCurValNos = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
652 unsigned NumVals = getNumValNums();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
653 unsigned NumNewVals = NewVNInfo.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
654 for (unsigned i = 0; i != NumVals; ++i) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
655 unsigned LHSValID = LHSValNoAssignments[i];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
656 if (i != LHSValID ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
657 (NewVNInfo[LHSValID] && NewVNInfo[LHSValID] != getValNumInfo(i))) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
658 MustMapCurValNos = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
659 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
660 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
661 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
662
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
663 // If we have to apply a mapping to our base range assignment, rewrite it now.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
664 if (MustMapCurValNos && !empty()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
665 // Map the first live range.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
666
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
667 iterator OutIt = begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
668 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];
|
|
77
|
669 for (iterator I = std::next(OutIt), E = end(); I != E; ++I) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
670 VNInfo* nextValNo = NewVNInfo[LHSValNoAssignments[I->valno->id]];
|
|
77
|
671 assert(nextValNo && "Huh?");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
672
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
673 // If this live range has the same value # as its immediate predecessor,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
674 // and if they are neighbors, remove one Segment. This happens when we
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
675 // have [0,4:0)[4,7:1) and map 0/1 onto the same value #.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
676 if (OutIt->valno == nextValNo && OutIt->end == I->start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
677 OutIt->end = I->end;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
678 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
679 // Didn't merge. Move OutIt to the next segment,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
680 ++OutIt;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
681 OutIt->valno = nextValNo;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
682 if (OutIt != I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
683 OutIt->start = I->start;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
684 OutIt->end = I->end;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
685 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
686 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
687 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
688 // If we merge some segments, chop off the end.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
689 ++OutIt;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
690 segments.erase(OutIt, end());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
691 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
692
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
693 // Rewrite Other values before changing the VNInfo ids.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
694 // This can leave Other in an invalid state because we're not coalescing
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
695 // touching segments that now have identical values. That's OK since Other is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
696 // not supposed to be valid after calling join();
|
|
83
|
697 for (Segment &S : Other.segments)
|
|
|
698 S.valno = NewVNInfo[RHSValNoAssignments[S.valno->id]];
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
699
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
700 // Update val# info. Renumber them and make sure they all belong to this
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
701 // LiveRange now. Also remove dead val#'s.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
702 unsigned NumValNos = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
703 for (unsigned i = 0; i < NumNewVals; ++i) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
704 VNInfo *VNI = NewVNInfo[i];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
705 if (VNI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
706 if (NumValNos >= NumVals)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
707 valnos.push_back(VNI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
708 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
709 valnos[NumValNos] = VNI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
710 VNI->id = NumValNos++; // Renumber val#.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
711 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
712 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
713 if (NumNewVals < NumVals)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
714 valnos.resize(NumNewVals); // shrinkify
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
715
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
716 // Okay, now insert the RHS live segments into the LHS.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
717 LiveRangeUpdater Updater(this);
|
|
83
|
718 for (Segment &S : Other.segments)
|
|
|
719 Updater.add(S);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
720 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
721
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
722 /// Merge all of the segments in RHS into this live range as the specified
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
723 /// value number. The segments in RHS are allowed to overlap with segments in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
724 /// the current range, but only if the overlapping segments have the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
725 /// specified value number.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
726 void LiveRange::MergeSegmentsInAsValue(const LiveRange &RHS,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
727 VNInfo *LHSValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
728 LiveRangeUpdater Updater(this);
|
|
83
|
729 for (const Segment &S : RHS.segments)
|
|
|
730 Updater.add(S.start, S.end, LHSValNo);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
731 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
732
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
733 /// MergeValueInAsValue - Merge all of the live segments of a specific val#
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
734 /// in RHS into this live range as the specified value number.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
735 /// The segments in RHS are allowed to overlap with segments in the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
736 /// current range, it will replace the value numbers of the overlaped
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
737 /// segments with the specified value number.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
738 void LiveRange::MergeValueInAsValue(const LiveRange &RHS,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
739 const VNInfo *RHSValNo,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
740 VNInfo *LHSValNo) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
741 LiveRangeUpdater Updater(this);
|
|
83
|
742 for (const Segment &S : RHS.segments)
|
|
|
743 if (S.valno == RHSValNo)
|
|
|
744 Updater.add(S.start, S.end, LHSValNo);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
745 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
746
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
747 /// MergeValueNumberInto - This method is called when two value nubmers
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
748 /// are found to be equivalent. This eliminates V1, replacing all
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
749 /// segments with the V1 value number with the V2 value number. This can
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
750 /// cause merging of V1/V2 values numbers and compaction of the value space.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
751 VNInfo *LiveRange::MergeValueNumberInto(VNInfo *V1, VNInfo *V2) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
752 assert(V1 != V2 && "Identical value#'s are always equivalent!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
753
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
754 // This code actually merges the (numerically) larger value number into the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
755 // smaller value number, which is likely to allow us to compactify the value
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
756 // space. The only thing we have to be careful of is to preserve the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
757 // instruction that defines the result value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
758
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
759 // Make sure V2 is smaller than V1.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
760 if (V1->id < V2->id) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
761 V1->copyFrom(*V2);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
762 std::swap(V1, V2);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
763 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
764
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
765 // Merge V1 segments into V2.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
766 for (iterator I = begin(); I != end(); ) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
767 iterator S = I++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
768 if (S->valno != V1) continue; // Not a V1 Segment.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
769
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
770 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
771 // range, extend it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
772 if (S != begin()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
773 iterator Prev = S-1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
774 if (Prev->valno == V2 && Prev->end == S->start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
775 Prev->end = S->end;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
776
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
777 // Erase this live-range.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
778 segments.erase(S);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
779 I = Prev+1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
780 S = Prev;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
781 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
782 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
783
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
784 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
785 // Ensure that it is a V2 live-range.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
786 S->valno = V2;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
787
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
788 // If we can merge it into later V2 segments, do so now. We ignore any
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
789 // following V1 segments, as they will be merged in subsequent iterations
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
790 // of the loop.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
791 if (I != end()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
792 if (I->start == S->end && I->valno == V2) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
793 S->end = I->end;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
794 segments.erase(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
795 I = S+1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
796 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
797 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
798 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
799
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
800 // Now that V1 is dead, remove it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
801 markValNoForDeletion(V1);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
802
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
803 return V2;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
804 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
805
|
|
83
|
806 void LiveRange::flushSegmentSet() {
|
|
|
807 assert(segmentSet != nullptr && "segment set must have been created");
|
|
|
808 assert(
|
|
|
809 segments.empty() &&
|
|
|
810 "segment set can be used only initially before switching to the array");
|
|
|
811 segments.append(segmentSet->begin(), segmentSet->end());
|
|
|
812 segmentSet = nullptr;
|
|
|
813 verify();
|
|
|
814 }
|
|
|
815
|
|
120
|
816 bool LiveRange::isLiveAtIndexes(ArrayRef<SlotIndex> Slots) const {
|
|
|
817 ArrayRef<SlotIndex>::iterator SlotI = Slots.begin();
|
|
|
818 ArrayRef<SlotIndex>::iterator SlotE = Slots.end();
|
|
|
819
|
|
|
820 // If there are no regmask slots, we have nothing to search.
|
|
|
821 if (SlotI == SlotE)
|
|
|
822 return false;
|
|
|
823
|
|
|
824 // Start our search at the first segment that ends after the first slot.
|
|
|
825 const_iterator SegmentI = find(*SlotI);
|
|
|
826 const_iterator SegmentE = end();
|
|
|
827
|
|
|
828 // If there are no segments that end after the first slot, we're done.
|
|
|
829 if (SegmentI == SegmentE)
|
|
|
830 return false;
|
|
|
831
|
|
|
832 // Look for each slot in the live range.
|
|
|
833 for ( ; SlotI != SlotE; ++SlotI) {
|
|
|
834 // Go to the next segment that ends after the current slot.
|
|
|
835 // The slot may be within a hole in the range.
|
|
|
836 SegmentI = advanceTo(SegmentI, *SlotI);
|
|
|
837 if (SegmentI == SegmentE)
|
|
|
838 return false;
|
|
|
839
|
|
|
840 // If this segment contains the slot, we're done.
|
|
|
841 if (SegmentI->contains(*SlotI))
|
|
|
842 return true;
|
|
|
843 // Otherwise, look for the next slot.
|
|
|
844 }
|
|
|
845
|
|
|
846 // We didn't find a segment containing any of the slots.
|
|
|
847 return false;
|
|
|
848 }
|
|
|
849
|
|
83
|
850 void LiveInterval::freeSubRange(SubRange *S) {
|
|
|
851 S->~SubRange();
|
|
|
852 // Memory was allocated with BumpPtr allocator and is not freed here.
|
|
|
853 }
|
|
|
854
|
|
|
855 void LiveInterval::removeEmptySubRanges() {
|
|
|
856 SubRange **NextPtr = &SubRanges;
|
|
|
857 SubRange *I = *NextPtr;
|
|
|
858 while (I != nullptr) {
|
|
|
859 if (!I->empty()) {
|
|
|
860 NextPtr = &I->Next;
|
|
|
861 I = *NextPtr;
|
|
|
862 continue;
|
|
|
863 }
|
|
|
864 // Skip empty subranges until we find the first nonempty one.
|
|
|
865 do {
|
|
|
866 SubRange *Next = I->Next;
|
|
|
867 freeSubRange(I);
|
|
|
868 I = Next;
|
|
|
869 } while (I != nullptr && I->empty());
|
|
|
870 *NextPtr = I;
|
|
|
871 }
|
|
|
872 }
|
|
|
873
|
|
|
874 void LiveInterval::clearSubRanges() {
|
|
|
875 for (SubRange *I = SubRanges, *Next; I != nullptr; I = Next) {
|
|
|
876 Next = I->Next;
|
|
|
877 freeSubRange(I);
|
|
|
878 }
|
|
|
879 SubRanges = nullptr;
|
|
|
880 }
|
|
|
881
|
|
121
|
882 void LiveInterval::refineSubRanges(BumpPtrAllocator &Allocator,
|
|
|
883 LaneBitmask LaneMask, std::function<void(LiveInterval::SubRange&)> Apply) {
|
|
|
884 LaneBitmask ToApply = LaneMask;
|
|
|
885 for (SubRange &SR : subranges()) {
|
|
|
886 LaneBitmask SRMask = SR.LaneMask;
|
|
|
887 LaneBitmask Matching = SRMask & LaneMask;
|
|
|
888 if (Matching.none())
|
|
|
889 continue;
|
|
|
890
|
|
|
891 SubRange *MatchingRange;
|
|
|
892 if (SRMask == Matching) {
|
|
|
893 // The subrange fits (it does not cover bits outside \p LaneMask).
|
|
|
894 MatchingRange = &SR;
|
|
|
895 } else {
|
|
|
896 // We have to split the subrange into a matching and non-matching part.
|
|
|
897 // Reduce lanemask of existing lane to non-matching part.
|
|
|
898 SR.LaneMask = SRMask & ~Matching;
|
|
|
899 // Create a new subrange for the matching part
|
|
|
900 MatchingRange = createSubRangeFrom(Allocator, Matching, SR);
|
|
|
901 }
|
|
|
902 Apply(*MatchingRange);
|
|
|
903 ToApply &= ~Matching;
|
|
|
904 }
|
|
|
905 // Create a new subrange if there are uncovered bits left.
|
|
|
906 if (ToApply.any()) {
|
|
|
907 SubRange *NewRange = createSubRange(Allocator, ToApply);
|
|
|
908 Apply(*NewRange);
|
|
|
909 }
|
|
|
910 }
|
|
|
911
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
912 unsigned LiveInterval::getSize() const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
913 unsigned Sum = 0;
|
|
83
|
914 for (const Segment &S : segments)
|
|
|
915 Sum += S.start.distance(S.end);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
916 return Sum;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
917 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
918
|
|
120
|
919 void LiveInterval::computeSubRangeUndefs(SmallVectorImpl<SlotIndex> &Undefs,
|
|
|
920 LaneBitmask LaneMask,
|
|
|
921 const MachineRegisterInfo &MRI,
|
|
|
922 const SlotIndexes &Indexes) const {
|
|
|
923 assert(TargetRegisterInfo::isVirtualRegister(reg));
|
|
|
924 LaneBitmask VRegMask = MRI.getMaxLaneMaskForVReg(reg);
|
|
121
|
925 assert((VRegMask & LaneMask).any());
|
|
120
|
926 const TargetRegisterInfo &TRI = *MRI.getTargetRegisterInfo();
|
|
|
927 for (const MachineOperand &MO : MRI.def_operands(reg)) {
|
|
|
928 if (!MO.isUndef())
|
|
|
929 continue;
|
|
|
930 unsigned SubReg = MO.getSubReg();
|
|
|
931 assert(SubReg != 0 && "Undef should only be set on subreg defs");
|
|
|
932 LaneBitmask DefMask = TRI.getSubRegIndexLaneMask(SubReg);
|
|
|
933 LaneBitmask UndefMask = VRegMask & ~DefMask;
|
|
121
|
934 if ((UndefMask & LaneMask).any()) {
|
|
120
|
935 const MachineInstr &MI = *MO.getParent();
|
|
|
936 bool EarlyClobber = MO.isEarlyClobber();
|
|
|
937 SlotIndex Pos = Indexes.getInstructionIndex(MI).getRegSlot(EarlyClobber);
|
|
|
938 Undefs.push_back(Pos);
|
|
|
939 }
|
|
|
940 }
|
|
|
941 }
|
|
|
942
|
|
121
|
943 raw_ostream& llvm::operator<<(raw_ostream& OS, const LiveRange::Segment &S) {
|
|
|
944 return OS << '[' << S.start << ',' << S.end << ':' << S.valno->id << ')';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
945 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
946
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
947 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
|
120
|
948 LLVM_DUMP_METHOD void LiveRange::Segment::dump() const {
|
|
|
949 dbgs() << *this << '\n';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
950 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
951 #endif
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
952
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
953 void LiveRange::print(raw_ostream &OS) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
954 if (empty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
955 OS << "EMPTY";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
956 else {
|
|
83
|
957 for (const Segment &S : segments) {
|
|
|
958 OS << S;
|
|
|
959 assert(S.valno == getValNumInfo(S.valno->id) && "Bad VNInfo");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
960 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
961 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
962
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
963 // Print value number info.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
964 if (getNumValNums()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
965 OS << " ";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
966 unsigned vnum = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
967 for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
968 ++i, ++vnum) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
969 const VNInfo *vni = *i;
|
|
120
|
970 if (vnum) OS << ' ';
|
|
|
971 OS << vnum << '@';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
972 if (vni->isUnused()) {
|
|
120
|
973 OS << 'x';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
974 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
975 OS << vni->def;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
976 if (vni->isPHIDef())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
977 OS << "-phi";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
978 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
979 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
980 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
981 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
982
|
|
120
|
983 void LiveInterval::SubRange::print(raw_ostream &OS) const {
|
|
|
984 OS << " L" << PrintLaneMask(LaneMask) << ' '
|
|
|
985 << static_cast<const LiveRange&>(*this);
|
|
|
986 }
|
|
|
987
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
988 void LiveInterval::print(raw_ostream &OS) const {
|
|
134
|
989 OS << printReg(reg) << ' ';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
990 super::print(OS);
|
|
83
|
991 // Print subranges
|
|
120
|
992 for (const SubRange &SR : subranges())
|
|
|
993 OS << SR;
|
|
134
|
994 OS << " weight:" << weight;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
995 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
996
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
997 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
|
120
|
998 LLVM_DUMP_METHOD void LiveRange::dump() const {
|
|
|
999 dbgs() << *this << '\n';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1000 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1001
|
|
120
|
1002 LLVM_DUMP_METHOD void LiveInterval::SubRange::dump() const {
|
|
|
1003 dbgs() << *this << '\n';
|
|
|
1004 }
|
|
|
1005
|
|
|
1006 LLVM_DUMP_METHOD void LiveInterval::dump() const {
|
|
|
1007 dbgs() << *this << '\n';
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1008 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1009 #endif
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1010
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1011 #ifndef NDEBUG
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1012 void LiveRange::verify() const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1013 for (const_iterator I = begin(), E = end(); I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1014 assert(I->start.isValid());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1015 assert(I->end.isValid());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1016 assert(I->start < I->end);
|
|
77
|
1017 assert(I->valno != nullptr);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1018 assert(I->valno->id < valnos.size());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1019 assert(I->valno == valnos[I->valno->id]);
|
|
77
|
1020 if (std::next(I) != E) {
|
|
|
1021 assert(I->end <= std::next(I)->start);
|
|
|
1022 if (I->end == std::next(I)->start)
|
|
|
1023 assert(I->valno != std::next(I)->valno);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1024 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1025 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1026 }
|
|
83
|
1027
|
|
|
1028 void LiveInterval::verify(const MachineRegisterInfo *MRI) const {
|
|
|
1029 super::verify();
|
|
|
1030
|
|
|
1031 // Make sure SubRanges are fine and LaneMasks are disjunct.
|
|
121
|
1032 LaneBitmask Mask;
|
|
|
1033 LaneBitmask MaxMask = MRI != nullptr ? MRI->getMaxLaneMaskForVReg(reg)
|
|
|
1034 : LaneBitmask::getAll();
|
|
83
|
1035 for (const SubRange &SR : subranges()) {
|
|
|
1036 // Subrange lanemask should be disjunct to any previous subrange masks.
|
|
121
|
1037 assert((Mask & SR.LaneMask).none());
|
|
83
|
1038 Mask |= SR.LaneMask;
|
|
|
1039
|
|
|
1040 // subrange mask should not contained in maximum lane mask for the vreg.
|
|
121
|
1041 assert((Mask & ~MaxMask).none());
|
|
95
|
1042 // empty subranges must be removed.
|
|
|
1043 assert(!SR.empty());
|
|
83
|
1044
|
|
|
1045 SR.verify();
|
|
|
1046 // Main liverange should cover subrange.
|
|
|
1047 assert(covers(SR));
|
|
|
1048 }
|
|
|
1049 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1050 #endif
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1051
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1052 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1053 // LiveRangeUpdater class
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1054 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1055 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1056 // The LiveRangeUpdater class always maintains these invariants:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1057 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1058 // - When LastStart is invalid, Spills is empty and the iterators are invalid.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1059 // This is the initial state, and the state created by flush().
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1060 // In this state, isDirty() returns false.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1061 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1062 // Otherwise, segments are kept in three separate areas:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1063 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1064 // 1. [begin; WriteI) at the front of LR.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1065 // 2. [ReadI; end) at the back of LR.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1066 // 3. Spills.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1067 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1068 // - LR.begin() <= WriteI <= ReadI <= LR.end().
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1069 // - Segments in all three areas are fully ordered and coalesced.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1070 // - Segments in area 1 precede and can't coalesce with segments in area 2.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1071 // - Segments in Spills precede and can't coalesce with segments in area 2.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1072 // - No coalescing is possible between segments in Spills and segments in area
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1073 // 1, and there are no overlapping segments.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1074 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1075 // The segments in Spills are not ordered with respect to the segments in area
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1076 // 1. They need to be merged.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1077 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1078 // When they exist, Spills.back().start <= LastStart,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1079 // and WriteI[-1].start <= LastStart.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1080
|
|
121
|
1081 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1082 void LiveRangeUpdater::print(raw_ostream &OS) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1083 if (!isDirty()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1084 if (LR)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1085 OS << "Clean updater: " << *LR << '\n';
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1086 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1087 OS << "Null updater.\n";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1088 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1089 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1090 assert(LR && "Can't have null LR in dirty updater.");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1091 OS << " updater with gap = " << (ReadI - WriteI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1092 << ", last start = " << LastStart
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1093 << ":\n Area 1:";
|
|
83
|
1094 for (const auto &S : make_range(LR->begin(), WriteI))
|
|
|
1095 OS << ' ' << S;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1096 OS << "\n Spills:";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1097 for (unsigned I = 0, E = Spills.size(); I != E; ++I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1098 OS << ' ' << Spills[I];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1099 OS << "\n Area 2:";
|
|
83
|
1100 for (const auto &S : make_range(ReadI, LR->end()))
|
|
|
1101 OS << ' ' << S;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1102 OS << '\n';
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1103 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1104
|
|
120
|
1105 LLVM_DUMP_METHOD void LiveRangeUpdater::dump() const {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1106 print(errs());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1107 }
|
|
121
|
1108 #endif
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1109
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1110 // Determine if A and B should be coalesced.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1111 static inline bool coalescable(const LiveRange::Segment &A,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1112 const LiveRange::Segment &B) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1113 assert(A.start <= B.start && "Unordered live segments.");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1114 if (A.end == B.start)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1115 return A.valno == B.valno;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1116 if (A.end < B.start)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1117 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1118 assert(A.valno == B.valno && "Cannot overlap different values");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1119 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1120 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1121
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1122 void LiveRangeUpdater::add(LiveRange::Segment Seg) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1123 assert(LR && "Cannot add to a null destination");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1124
|
|
83
|
1125 // Fall back to the regular add method if the live range
|
|
|
1126 // is using the segment set instead of the segment vector.
|
|
|
1127 if (LR->segmentSet != nullptr) {
|
|
|
1128 LR->addSegmentToSet(Seg);
|
|
|
1129 return;
|
|
|
1130 }
|
|
|
1131
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1132 // Flush the state if Start moves backwards.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1133 if (!LastStart.isValid() || LastStart > Seg.start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1134 if (isDirty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1135 flush();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1136 // This brings us to an uninitialized state. Reinitialize.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1137 assert(Spills.empty() && "Leftover spilled segments");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1138 WriteI = ReadI = LR->begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1139 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1140
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1141 // Remember start for next time.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1142 LastStart = Seg.start;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1143
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1144 // Advance ReadI until it ends after Seg.start.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1145 LiveRange::iterator E = LR->end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1146 if (ReadI != E && ReadI->end <= Seg.start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1147 // First try to close the gap between WriteI and ReadI with spills.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1148 if (ReadI != WriteI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1149 mergeSpills();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1150 // Then advance ReadI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1151 if (ReadI == WriteI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1152 ReadI = WriteI = LR->find(Seg.start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1153 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1154 while (ReadI != E && ReadI->end <= Seg.start)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1155 *WriteI++ = *ReadI++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1156 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1157
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1158 assert(ReadI == E || ReadI->end > Seg.start);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1159
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1160 // Check if the ReadI segment begins early.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1161 if (ReadI != E && ReadI->start <= Seg.start) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1162 assert(ReadI->valno == Seg.valno && "Cannot overlap different values");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1163 // Bail if Seg is completely contained in ReadI.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1164 if (ReadI->end >= Seg.end)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1165 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1166 // Coalesce into Seg.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1167 Seg.start = ReadI->start;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1168 ++ReadI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1169 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1170
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1171 // Coalesce as much as possible from ReadI into Seg.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1172 while (ReadI != E && coalescable(Seg, *ReadI)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1173 Seg.end = std::max(Seg.end, ReadI->end);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1174 ++ReadI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1175 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1176
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1177 // Try coalescing Spills.back() into Seg.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1178 if (!Spills.empty() && coalescable(Spills.back(), Seg)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1179 Seg.start = Spills.back().start;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1180 Seg.end = std::max(Spills.back().end, Seg.end);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1181 Spills.pop_back();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1182 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1183
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1184 // Try coalescing Seg into WriteI[-1].
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1185 if (WriteI != LR->begin() && coalescable(WriteI[-1], Seg)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1186 WriteI[-1].end = std::max(WriteI[-1].end, Seg.end);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1187 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1188 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1189
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1190 // Seg doesn't coalesce with anything, and needs to be inserted somewhere.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1191 if (WriteI != ReadI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1192 *WriteI++ = Seg;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1193 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1194 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1195
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1196 // Finally, append to LR or Spills.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1197 if (WriteI == E) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1198 LR->segments.push_back(Seg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1199 WriteI = ReadI = LR->end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1200 } else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1201 Spills.push_back(Seg);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1202 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1203
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1204 // Merge as many spilled segments as possible into the gap between WriteI
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1205 // and ReadI. Advance WriteI to reflect the inserted instructions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1206 void LiveRangeUpdater::mergeSpills() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1207 // Perform a backwards merge of Spills and [SpillI;WriteI).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1208 size_t GapSize = ReadI - WriteI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1209 size_t NumMoved = std::min(Spills.size(), GapSize);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1210 LiveRange::iterator Src = WriteI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1211 LiveRange::iterator Dst = Src + NumMoved;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1212 LiveRange::iterator SpillSrc = Spills.end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1213 LiveRange::iterator B = LR->begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1214
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1215 // This is the new WriteI position after merging spills.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1216 WriteI = Dst;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1217
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1218 // Now merge Src and Spills backwards.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1219 while (Src != Dst) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1220 if (Src != B && Src[-1].start > SpillSrc[-1].start)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1221 *--Dst = *--Src;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1222 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1223 *--Dst = *--SpillSrc;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1224 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1225 assert(NumMoved == size_t(Spills.end() - SpillSrc));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1226 Spills.erase(SpillSrc, Spills.end());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1227 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1228
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1229 void LiveRangeUpdater::flush() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1230 if (!isDirty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1231 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1232 // Clear the dirty state.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1233 LastStart = SlotIndex();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1234
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1235 assert(LR && "Cannot add to a null destination");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1236
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1237 // Nothing to merge?
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1238 if (Spills.empty()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1239 LR->segments.erase(WriteI, ReadI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1240 LR->verify();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1241 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1242 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1243
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1244 // Resize the WriteI - ReadI gap to match Spills.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1245 size_t GapSize = ReadI - WriteI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1246 if (GapSize < Spills.size()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1247 // The gap is too small. Make some room.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1248 size_t WritePos = WriteI - LR->begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1249 LR->segments.insert(ReadI, Spills.size() - GapSize, LiveRange::Segment());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1250 // This also invalidated ReadI, but it is recomputed below.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1251 WriteI = LR->begin() + WritePos;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1252 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1253 // Shrink the gap if necessary.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1254 LR->segments.erase(WriteI + Spills.size(), ReadI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1255 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1256 ReadI = WriteI + Spills.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1257 mergeSpills();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1258 LR->verify();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1259 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1260
|
|
100
|
1261 unsigned ConnectedVNInfoEqClasses::Classify(const LiveRange &LR) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1262 // Create initial equivalence classes.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1263 EqClass.clear();
|
|
100
|
1264 EqClass.grow(LR.getNumValNums());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1265
|
|
77
|
1266 const VNInfo *used = nullptr, *unused = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1267
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1268 // Determine connections.
|
|
100
|
1269 for (const VNInfo *VNI : LR.valnos) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1270 // Group all unused values into one class.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1271 if (VNI->isUnused()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1272 if (unused)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1273 EqClass.join(unused->id, VNI->id);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1274 unused = VNI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1275 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1276 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1277 used = VNI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1278 if (VNI->isPHIDef()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1279 const MachineBasicBlock *MBB = LIS.getMBBFromIndex(VNI->def);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1280 assert(MBB && "Phi-def has no defining MBB");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1281 // Connect to values live out of predecessors.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1282 for (MachineBasicBlock::const_pred_iterator PI = MBB->pred_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1283 PE = MBB->pred_end(); PI != PE; ++PI)
|
|
100
|
1284 if (const VNInfo *PVNI = LR.getVNInfoBefore(LIS.getMBBEndIdx(*PI)))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1285 EqClass.join(VNI->id, PVNI->id);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1286 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1287 // Normal value defined by an instruction. Check for two-addr redef.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1288 // FIXME: This could be coincidental. Should we really check for a tied
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1289 // operand constraint?
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1290 // Note that VNI->def may be a use slot for an early clobber def.
|
|
100
|
1291 if (const VNInfo *UVNI = LR.getVNInfoBefore(VNI->def))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1292 EqClass.join(VNI->id, UVNI->id);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1293 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1294 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1295
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1296 // Lump all the unused values in with the last used value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1297 if (used && unused)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1298 EqClass.join(used->id, unused->id);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1299
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1300 EqClass.compress();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1301 return EqClass.getNumClasses();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1302 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1303
|
|
95
|
1304 void ConnectedVNInfoEqClasses::Distribute(LiveInterval &LI, LiveInterval *LIV[],
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1305 MachineRegisterInfo &MRI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1306 // Rewrite instructions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1307 for (MachineRegisterInfo::reg_iterator RI = MRI.reg_begin(LI.reg),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1308 RE = MRI.reg_end(); RI != RE;) {
|
|
77
|
1309 MachineOperand &MO = *RI;
|
|
|
1310 MachineInstr *MI = RI->getParent();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1311 ++RI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1312 // DBG_VALUE instructions don't have slot indexes, so get the index of the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1313 // instruction before them.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1314 // Normally, DBG_VALUE instructions are removed before this function is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1315 // called, but it is not a requirement.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1316 SlotIndex Idx;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1317 if (MI->isDebugValue())
|
|
120
|
1318 Idx = LIS.getSlotIndexes()->getIndexBefore(*MI);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1319 else
|
|
120
|
1320 Idx = LIS.getInstructionIndex(*MI);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1321 LiveQueryResult LRQ = LI.Query(Idx);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1322 const VNInfo *VNI = MO.readsReg() ? LRQ.valueIn() : LRQ.valueDefined();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1323 // In the case of an <undef> use that isn't tied to any def, VNI will be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1324 // NULL. If the use is tied to a def, VNI will be the defined value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1325 if (!VNI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1326 continue;
|
|
95
|
1327 if (unsigned EqClass = getEqClass(VNI))
|
|
|
1328 MO.setReg(LIV[EqClass-1]->reg);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1329 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1330
|
|
95
|
1331 // Distribute subregister liveranges.
|
|
|
1332 if (LI.hasSubRanges()) {
|
|
|
1333 unsigned NumComponents = EqClass.getNumClasses();
|
|
|
1334 SmallVector<unsigned, 8> VNIMapping;
|
|
|
1335 SmallVector<LiveInterval::SubRange*, 8> SubRanges;
|
|
|
1336 BumpPtrAllocator &Allocator = LIS.getVNInfoAllocator();
|
|
|
1337 for (LiveInterval::SubRange &SR : LI.subranges()) {
|
|
|
1338 // Create new subranges in the split intervals and construct a mapping
|
|
|
1339 // for the VNInfos in the subrange.
|
|
|
1340 unsigned NumValNos = SR.valnos.size();
|
|
|
1341 VNIMapping.clear();
|
|
|
1342 VNIMapping.reserve(NumValNos);
|
|
|
1343 SubRanges.clear();
|
|
|
1344 SubRanges.resize(NumComponents-1, nullptr);
|
|
|
1345 for (unsigned I = 0; I < NumValNos; ++I) {
|
|
|
1346 const VNInfo &VNI = *SR.valnos[I];
|
|
120
|
1347 unsigned ComponentNum;
|
|
|
1348 if (VNI.isUnused()) {
|
|
|
1349 ComponentNum = 0;
|
|
|
1350 } else {
|
|
|
1351 const VNInfo *MainRangeVNI = LI.getVNInfoAt(VNI.def);
|
|
|
1352 assert(MainRangeVNI != nullptr
|
|
|
1353 && "SubRange def must have corresponding main range def");
|
|
|
1354 ComponentNum = getEqClass(MainRangeVNI);
|
|
|
1355 if (ComponentNum > 0 && SubRanges[ComponentNum-1] == nullptr) {
|
|
|
1356 SubRanges[ComponentNum-1]
|
|
|
1357 = LIV[ComponentNum-1]->createSubRange(Allocator, SR.LaneMask);
|
|
|
1358 }
|
|
|
1359 }
|
|
95
|
1360 VNIMapping.push_back(ComponentNum);
|
|
|
1361 }
|
|
|
1362 DistributeRange(SR, SubRanges.data(), VNIMapping);
|
|
|
1363 }
|
|
|
1364 LI.removeEmptySubRanges();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1365 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1366
|
|
95
|
1367 // Distribute main liverange.
|
|
|
1368 DistributeRange(LI, LIV, EqClass);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1369 }
|
