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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/backend/live-range-separator.h"
#include "src/compiler/backend/register-allocator.h"
namespace v8 {
namespace internal {
namespace compiler {
#define TRACE(...) \
do { \
if (FLAG_trace_alloc) PrintF(__VA_ARGS__); \
} while (false)
namespace {
void CreateSplinter(TopLevelLiveRange* range, RegisterAllocationData* data,
LifetimePosition first_cut, LifetimePosition last_cut) {
DCHECK(!range->IsSplinter());
// We can ignore ranges that live solely in deferred blocks.
// If a range ends right at the end of a deferred block, it is marked by
// the range builder as ending at gap start of the next block - since the
// end is a position where the variable isn't live. We need to take that
// into consideration.
LifetimePosition max_allowed_end = last_cut.NextFullStart();
if (first_cut <= range->Start() && max_allowed_end >= range->End()) {
return;
}
LifetimePosition start = Max(first_cut, range->Start());
LifetimePosition end = Min(last_cut, range->End());
if (start < end) {
// Ensure the original range has a spill range associated, before it gets
// splintered. Splinters will point to it. This way, when attempting to
// reuse spill slots of splinters, during allocation, we avoid clobbering
// such slots.
if (range->MayRequireSpillRange()) {
data->CreateSpillRangeForLiveRange(range);
}
if (range->splinter() == nullptr) {
TopLevelLiveRange* splinter =
data->NextLiveRange(range->representation());
DCHECK_NULL(data->live_ranges()[splinter->vreg()]);
data->live_ranges()[splinter->vreg()] = splinter;
range->SetSplinter(splinter);
}
Zone* zone = data->allocation_zone();
TRACE("creating splinter %d for range %d between %d and %d\n",
range->splinter()->vreg(), range->vreg(), start.ToInstructionIndex(),
end.ToInstructionIndex());
range->Splinter(start, end, zone);
}
}
void SetSlotUse(TopLevelLiveRange* range) {
range->reset_slot_use();
for (const UsePosition* pos = range->first_pos();
!range->has_slot_use() && pos != nullptr; pos = pos->next()) {
if (pos->type() == UsePositionType::kRequiresSlot) {
range->register_slot_use(TopLevelLiveRange::SlotUseKind::kGeneralSlotUse);
}
}
}
void SplinterLiveRange(TopLevelLiveRange* range, RegisterAllocationData* data) {
const InstructionSequence* code = data->code();
UseInterval* interval = range->first_interval();
LifetimePosition first_cut = LifetimePosition::Invalid();
LifetimePosition last_cut = LifetimePosition::Invalid();
while (interval != nullptr) {
// We have to cache these here, as splintering might destroy the original
// interval below.
UseInterval* next_interval = interval->next();
LifetimePosition interval_end = interval->end();
const InstructionBlock* first_block =
code->GetInstructionBlock(interval->FirstGapIndex());
const InstructionBlock* last_block =
code->GetInstructionBlock(interval->LastGapIndex());
int first_block_nr = first_block->rpo_number().ToInt();
int last_block_nr = last_block->rpo_number().ToInt();
for (int block_id = first_block_nr; block_id <= last_block_nr; ++block_id) {
const InstructionBlock* current_block =
code->InstructionBlockAt(RpoNumber::FromInt(block_id));
if (current_block->IsDeferred()) {
if (!first_cut.IsValid()) {
first_cut = LifetimePosition::GapFromInstructionIndex(
current_block->first_instruction_index());
}
// We splinter until the last gap in the block. I assume this is done to
// leave a little range to be allocated by normal register allocation
// and then use that range to connect when splinters are merged back.
// This might be done as control flow resolution does not insert moves
// if two consecutive blocks in rpo order are also consecutive in
// control flow.
last_cut = LifetimePosition::GapFromInstructionIndex(
current_block->last_instruction_index());
} else {
if (first_cut.IsValid()) {
CreateSplinter(range, data, first_cut, last_cut);
first_cut = LifetimePosition::Invalid();
last_cut = LifetimePosition::Invalid();
}
}
}
// If we reach the end of an interval with a first_cut and last_cut set, it
// means that we can splinter to the end of the interval, as the value dies
// in this control flow branch or is not live in the next block. In the
// former case, we won't need to reload the value, so we can splinter to the
// end of its lifetime. In the latter case, control flow resolution will
// have to connect blocks anyway, so we can also splinter to the end of the
// block, too.
if (first_cut.IsValid()) {
CreateSplinter(range, data, first_cut, interval_end);
first_cut = LifetimePosition::Invalid();
last_cut = LifetimePosition::Invalid();
}
interval = next_interval;
}
// Redo has_slot_use
if (range->has_slot_use() && range->splinter() != nullptr) {
SetSlotUse(range);
SetSlotUse(range->splinter());
}
}
} // namespace
void LiveRangeSeparator::Splinter() {
size_t virt_reg_count = data()->live_ranges().size();
for (size_t vreg = 0; vreg < virt_reg_count; ++vreg) {
TopLevelLiveRange* range = data()->live_ranges()[vreg];
if (range == nullptr || range->IsEmpty() || range->IsSplinter()) {
continue;
}
int first_instr = range->first_interval()->FirstGapIndex();
if (!data()->code()->GetInstructionBlock(first_instr)->IsDeferred()) {
SplinterLiveRange(range, data());
}
}
}
void LiveRangeMerger::MarkRangesSpilledInDeferredBlocks() {
const InstructionSequence* code = data()->code();
for (TopLevelLiveRange* top : data()->live_ranges()) {
if (top == nullptr || top->IsEmpty() || top->splinter() == nullptr ||
top->HasSpillOperand() || !top->splinter()->HasSpillRange()) {
continue;
}
LiveRange* child = top;
for (; child != nullptr; child = child->next()) {
if (child->spilled() ||
child->NextSlotPosition(child->Start()) != nullptr) {
break;
}
}
if (child == nullptr) {
DCHECK(!data()->is_turbo_control_flow_aware_allocation());
top->TreatAsSpilledInDeferredBlock(data()->allocation_zone(),
code->InstructionBlockCount());
}
}
}
void LiveRangeMerger::Merge() {
MarkRangesSpilledInDeferredBlocks();
int live_range_count = static_cast<int>(data()->live_ranges().size());
for (int i = 0; i < live_range_count; ++i) {
TopLevelLiveRange* range = data()->live_ranges()[i];
if (range == nullptr || range->IsEmpty() || !range->IsSplinter()) {
continue;
}
TopLevelLiveRange* splinter_parent = range->splintered_from();
int to_remove = range->vreg();
splinter_parent->Merge(range, data()->allocation_zone());
data()->live_ranges()[to_remove] = nullptr;
}
}
#undef TRACE
} // namespace compiler
} // namespace internal
} // namespace v8
|
