Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
//===-- LiveInterval.cpp - Live Interval Representation -------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file implements the LiveRange and LiveInterval classes. Given some
// numbering of each the machine instructions an interval [i, j) is said to be a
// live interval for register v if there is no instruction with number j' > j
// such that v is live at j' abd there is no instruction with number i' < i such
// that v is live at i'. In this implementation intervals can have holes,
// i.e. an interval might look like [1,20), [50,65), [1000,1001). Each
// individual range is represented as an instance of LiveRange, and the whole
// interval is represented as an instance of LiveInterval.
//
//===----------------------------------------------------------------------===//
#include "LiveInterval.h"
#include "Support/STLExtras.h"
#include <ostream>
using namespace llvm;
// An example for liveAt():
//
// this = [1,4), liveAt(0) will return false. The instruction defining
// this spans slots [0,3]. The interval belongs to an spilled
// definition of the variable it represents. This is because slot 1 is
// used (def slot) and spans up to slot 3 (store slot).
//
bool LiveInterval::liveAt(unsigned index) const {
LiveRange dummy(index, index+1);
Ranges::const_iterator r = std::upper_bound(ranges.begin(),
ranges.end(),
dummy);
if (r == ranges.begin())
return false;
--r;
return index >= r->start && index < r->end;
}
// An example for overlaps():
//
// 0: A = ...
// 4: B = ...
// 8: C = A + B ;; last use of A
//
// The live intervals should look like:
//
// A = [3, 11)
// B = [7, x)
// C = [11, y)
//
// A->overlaps(C) should return false since we want to be able to join
// A and C.
bool LiveInterval::overlaps(const LiveInterval& other) const {
Ranges::const_iterator i = ranges.begin();
Ranges::const_iterator ie = ranges.end();
Ranges::const_iterator j = other.ranges.begin();
Ranges::const_iterator je = other.ranges.end();
if (i->start < j->start) {
i = std::upper_bound(i, ie, *j);
if (i != ranges.begin()) --i;
}
else if (j->start < i->start) {
j = std::upper_bound(j, je, *i);
if (j != other.ranges.begin()) --j;
}
while (i != ie && j != je) {
if (i->start == j->start)
return true;
if (i->start > j->start) {
swap(i, j);
swap(ie, je);
}
assert(i->start < j->start);
if (i->end > j->start)
return true;
++i;
}
return false;
}
void LiveInterval::addRange(LiveRange LR) {
Ranges::iterator it =
ranges.insert(std::upper_bound(ranges.begin(), ranges.end(), LR), LR);
mergeRangesBackward(mergeRangesForward(it));
}
void LiveInterval::join(const LiveInterval& other) {
Ranges::iterator cur = ranges.begin();
isDefinedOnce &= other.isDefinedOnce;
for (Ranges::const_iterator i = other.ranges.begin(),
e = other.ranges.end(); i != e; ++i) {
cur = ranges.insert(std::upper_bound(cur, ranges.end(), *i), *i);
cur = mergeRangesBackward(mergeRangesForward(cur));
}
weight += other.weight;
}
LiveInterval::Ranges::iterator
LiveInterval::mergeRangesForward(Ranges::iterator it) {
Ranges::iterator n;
while ((n = next(it)) != ranges.end()) {
if (n->start > it->end)
break;
it->end = std::max(it->end, n->end);
n = ranges.erase(n);
}
return it;
}
LiveInterval::Ranges::iterator
LiveInterval::mergeRangesBackward(Ranges::iterator it) {
while (it != ranges.begin()) {
Ranges::iterator p = prior(it);
if (it->start > p->end)
break;
it->start = std::min(it->start, p->start);
it->end = std::max(it->end, p->end);
it = ranges.erase(p);
}
return it;
}
std::ostream& llvm::operator<<(std::ostream& os, const LiveRange &LR) {
return os << "[" << LR.start << "," << LR.end << ")";
}
std::ostream& llvm::operator<<(std::ostream& os, const LiveInterval& li) {
os << "%reg" << li.reg << ',' << li.weight;
if (li.empty())
return os << "EMPTY";
os << " = ";
for (LiveInterval::Ranges::const_iterator i = li.ranges.begin(),
e = li.ranges.end(); i != e; ++i)
os << *i;
return os;
}