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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
/*
* Copyright 2017 WebAssembly Community Group participants
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef wasm_ir_branch_h
#define wasm_ir_branch_h
#include "wasm.h"
#include "wasm-traversal.h"
namespace wasm {
namespace BranchUtils {
// Some branches are obviously not actually reachable (e.g. (br $out (unreachable)))
inline bool isBranchReachable(Break* br) {
return !(br->value && br->value->type == unreachable) &&
!(br->condition && br->condition->type == unreachable);
}
inline bool isBranchReachable(Switch* sw) {
return !(sw->value && sw->value->type == unreachable) &&
sw->condition->type != unreachable;
}
inline bool isBranchReachable(Expression* expr) {
if (auto* br = expr->dynCast<Break>()) {
return isBranchReachable(br);
} else if (auto* sw = expr->dynCast<Switch>()) {
return isBranchReachable(sw);
}
WASM_UNREACHABLE();
}
inline std::set<Name> getUniqueTargets(Switch* sw) {
std::set<Name> ret;
for (auto target : sw->targets) {
ret.insert(target);
}
ret.insert(sw->default_);
return ret;
}
// If we branch to 'from', change that to 'to' instead.
inline bool replacePossibleTarget(Expression* branch, Name from, Name to) {
bool worked = false;
if (auto* br = branch->dynCast<Break>()) {
if (br->name == from) {
br->name = to;
worked = true;
}
} else if (auto* sw = branch->dynCast<Switch>()) {
for (auto& target : sw->targets) {
if (target == from) {
target = to;
worked = true;
}
}
if (sw->default_ == from) {
sw->default_ = to;
worked = true;
}
} else {
WASM_UNREACHABLE();
}
return worked;
}
// returns the set of targets to which we branch that are
// outside of a node
inline std::set<Name> getExitingBranches(Expression* ast) {
struct Scanner : public PostWalker<Scanner> {
std::set<Name> targets;
void visitBreak(Break* curr) {
targets.insert(curr->name);
}
void visitSwitch(Switch* curr) {
for (auto target : targets) {
targets.insert(target);
}
targets.insert(curr->default_);
}
void visitBlock(Block* curr) {
if (curr->name.is()) {
targets.erase(curr->name);
}
}
void visitLoop(Loop* curr) {
if (curr->name.is()) {
targets.erase(curr->name);
}
}
};
Scanner scanner;
scanner.walk(ast);
// anything not erased is a branch out
return scanner.targets;
}
// returns the list of all branch targets in a node
inline std::set<Name> getBranchTargets(Expression* ast) {
struct Scanner : public PostWalker<Scanner> {
std::set<Name> targets;
void visitBlock(Block* curr) {
if (curr->name.is()) {
targets.insert(curr->name);
}
}
void visitLoop(Loop* curr) {
if (curr->name.is()) {
targets.insert(curr->name);
}
}
};
Scanner scanner;
scanner.walk(ast);
return scanner.targets;
}
// Finds if there are branches targeting a name. Note that since names are
// unique in our IR, we just need to look for the name, and do not need
// to analyze scoping.
// By default we consider all branches, so any place there is a branch that
// names the target. You can unset 'named' to only note branches that appear
// reachable (i.e., are not obviously unreachable).
struct BranchSeeker : public PostWalker<BranchSeeker> {
Name target;
bool named = true;
Index found;
Type valueType;
BranchSeeker(Name target) : target(target), found(0) {}
void noteFound(Expression* value) {
found++;
if (found == 1) valueType = unreachable;
if (!value) valueType = none;
else if (value->type != unreachable) valueType = value->type;
}
void visitBreak(Break *curr) {
if (!named) {
// ignore an unreachable break
if (curr->condition && curr->condition->type == unreachable) return;
if (curr->value && curr->value->type == unreachable) return;
}
// check the break
if (curr->name == target) noteFound(curr->value);
}
void visitSwitch(Switch *curr) {
if (!named) {
// ignore an unreachable switch
if (curr->condition->type == unreachable) return;
if (curr->value && curr->value->type == unreachable) return;
}
// check the switch
for (auto name : curr->targets) {
if (name == target) noteFound(curr->value);
}
if (curr->default_ == target) noteFound(curr->value);
}
static bool hasReachable(Expression* tree, Name target) {
if (!target.is()) return false;
BranchSeeker seeker(target);
seeker.named = false;
seeker.walk(tree);
return seeker.found > 0;
}
static Index countReachable(Expression* tree, Name target) {
if (!target.is()) return 0;
BranchSeeker seeker(target);
seeker.named = false;
seeker.walk(tree);
return seeker.found;
}
static bool hasNamed(Expression* tree, Name target) {
if (!target.is()) return false;
BranchSeeker seeker(target);
seeker.walk(tree);
return seeker.found > 0;
}
static Index countNamed(Expression* tree, Name target) {
if (!target.is()) return 0;
BranchSeeker seeker(target);
seeker.walk(tree);
return seeker.found;
}
};
} // namespace BranchUtils
} // namespace wasm
#endif // wasm_ir_branch_h
|
