blob: d40b3c5c2e2d03a61750bbf380fa22209f4926e9 (
plain)
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
|
// Copyright 2022 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.
#ifndef V8_MAGLEV_MAGLEV_BASIC_BLOCK_H_
#define V8_MAGLEV_MAGLEV_BASIC_BLOCK_H_
#include <vector>
#include "src/base/small-vector.h"
#include "src/codegen/label.h"
#include "src/maglev/maglev-interpreter-frame-state.h"
#include "src/maglev/maglev-ir.h"
#include "src/zone/zone.h"
namespace v8 {
namespace internal {
namespace maglev {
using NodeIterator = Node::List::Iterator;
using NodeConstIterator = Node::List::Iterator;
class BasicBlock {
public:
explicit BasicBlock(MergePointInterpreterFrameState* state)
: control_node_(nullptr), state_(state) {}
uint32_t first_id() const {
if (has_phi()) return phis()->first()->id();
if (nodes_.is_empty()) {
return control_node()->id();
}
auto node = nodes_.first();
while (node && node->Is<Identity>()) {
node = node->NextNode();
}
return node ? node->id() : control_node()->id();
}
uint32_t FirstNonGapMoveId() const {
if (has_phi()) return phis()->first()->id();
if (!nodes_.is_empty()) {
for (const Node* node : nodes_) {
if (IsGapMoveNode(node->opcode())) continue;
if (node->Is<Identity>()) continue;
return node->id();
}
}
return control_node()->id();
}
Node::List& nodes() { return nodes_; }
ControlNode* control_node() const { return control_node_; }
void set_control_node(ControlNode* control_node) {
DCHECK_NULL(control_node_);
control_node_ = control_node;
}
bool has_phi() const { return has_state() && state_->has_phi(); }
bool is_edge_split_block() const { return is_edge_split_block_; }
bool is_loop() const { return has_state() && state()->is_loop(); }
MergePointRegisterState& edge_split_block_register_state() {
DCHECK(is_edge_split_block());
return *edge_split_block_register_state_;
}
bool contains_node_id(NodeIdT id) const {
return id >= first_id() && id <= control_node()->id();
}
void set_edge_split_block_register_state(
MergePointRegisterState* register_state) {
DCHECK(is_edge_split_block());
edge_split_block_register_state_ = register_state;
}
void set_edge_split_block() {
DCHECK_IMPLIES(!nodes_.is_empty(),
nodes_.LengthForTest() == 1 &&
nodes_.first()->Is<IncreaseInterruptBudget>());
DCHECK(control_node()->Is<Jump>());
DCHECK_NULL(state_);
is_edge_split_block_ = true;
edge_split_block_register_state_ = nullptr;
}
bool is_start_block_of_switch_case() const {
return is_start_block_of_switch_case_;
}
void set_start_block_of_switch_case(bool value) {
is_start_block_of_switch_case_ = value;
}
Phi::List* phis() const {
DCHECK(has_phi());
return state_->phis();
}
BasicBlock* predecessor_at(int i) const {
DCHECK_NOT_NULL(state_);
return state_->predecessor_at(i);
}
int predecessor_id() const {
return control_node()->Cast<UnconditionalControlNode>()->predecessor_id();
}
void set_predecessor_id(int id) {
control_node()->Cast<UnconditionalControlNode>()->set_predecessor_id(id);
}
base::SmallVector<BasicBlock*, 2> successors() const;
Label* label() { return &label_; }
MergePointInterpreterFrameState* state() const {
DCHECK(has_state());
return state_;
}
bool has_state() const { return !is_edge_split_block() && state_ != nullptr; }
bool is_exception_handler_block() const {
return has_state() && state_->is_exception_handler();
}
private:
bool is_edge_split_block_ = false;
bool is_start_block_of_switch_case_ = false;
Node::List nodes_;
ControlNode* control_node_;
union {
MergePointInterpreterFrameState* state_;
MergePointRegisterState* edge_split_block_register_state_;
};
Label label_;
};
inline base::SmallVector<BasicBlock*, 2> BasicBlock::successors() const {
ControlNode* control = control_node();
if (auto node = control->TryCast<UnconditionalControlNode>()) {
return {node->target()};
} else if (auto node = control->TryCast<BranchControlNode>()) {
return {node->if_true(), node->if_false()};
} else if (auto node = control->TryCast<Switch>()) {
base::SmallVector<BasicBlock*, 2> succs;
for (int i = 0; i < node->size(); i++) {
succs.push_back(node->targets()[i].block_ptr());
}
if (node->has_fallthrough()) {
succs.push_back(node->fallthrough());
}
return succs;
} else {
return base::SmallVector<BasicBlock*, 2>();
}
}
} // namespace maglev
} // namespace internal
} // namespace v8
#endif // V8_MAGLEV_MAGLEV_BASIC_BLOCK_H_
|
