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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
/*
* Copyright 2016 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.
*/
//
// Removes obviously unneeded code
//
#include <wasm.h>
#include <pass.h>
#include <ast_utils.h>
#include <wasm-builder.h>
namespace wasm {
struct Vacuum : public WalkerPass<PostWalker<Vacuum, Visitor<Vacuum>>> {
bool isFunctionParallel() override { return true; }
Pass* create() override { return new Vacuum; }
std::vector<Expression*> expressionStack;
// returns nullptr if curr is dead, curr if it must stay as is, or another node if it can be replaced
Expression* optimize(Expression* curr, bool resultUsed) {
while (1) {
switch (curr->_id) {
case Expression::Id::NopId: return nullptr; // never needed
case Expression::Id::BlockId: return curr; // not always needed, but handled in visitBlock()
case Expression::Id::IfId: return curr; // not always needed, but handled in visitIf()
case Expression::Id::LoopId: return curr; // not always needed, but handled in visitLoop()
case Expression::Id::BreakId:
case Expression::Id::SwitchId:
case Expression::Id::CallId:
case Expression::Id::CallImportId:
case Expression::Id::CallIndirectId:
case Expression::Id::SetLocalId:
case Expression::Id::LoadId:
case Expression::Id::StoreId:
case Expression::Id::ReturnId:
case Expression::Id::HostId:
case Expression::Id::UnreachableId: return curr; // always needed
case Expression::Id::ConstId:
case Expression::Id::GetLocalId:
case Expression::Id::UnaryId:
case Expression::Id::BinaryId:
case Expression::Id::SelectId: {
if (resultUsed) {
return curr; // used, keep it
}
// result is not used, perhaps it is dead
if (curr->is<Const>() || curr->is<GetLocal>()) {
return nullptr;
}
// for unary, binary, and select, we need to check their arguments for side effects
if (auto* unary = curr->dynCast<Unary>()) {
if (EffectAnalyzer(unary->value).hasSideEffects()) {
curr = unary->value;
continue;
} else {
return nullptr;
}
} else if (auto* binary = curr->dynCast<Binary>()) {
if (EffectAnalyzer(binary->left).hasSideEffects()) {
if (EffectAnalyzer(binary->right).hasSideEffects()) {
return curr; // leave them
} else {
curr = binary->left;
continue;
}
} else {
if (EffectAnalyzer(binary->right).hasSideEffects()) {
curr = binary->right;
continue;
} else {
return nullptr;
}
}
} else {
// TODO: if two have side effects, we could replace the select with say an add?
auto* select = curr->cast<Select>();
if (EffectAnalyzer(select->ifTrue).hasSideEffects()) {
if (EffectAnalyzer(select->ifFalse).hasSideEffects()) {
return curr; // leave them
} else {
if (EffectAnalyzer(select->condition).hasSideEffects()) {
return curr; // leave them
} else {
curr = select->ifTrue;
continue;
}
}
} else {
if (EffectAnalyzer(select->ifFalse).hasSideEffects()) {
if (EffectAnalyzer(select->condition).hasSideEffects()) {
return curr; // leave them
} else {
curr = select->ifFalse;
continue;
}
} else {
if (EffectAnalyzer(select->condition).hasSideEffects()) {
curr = select->condition;
continue;
} else {
return nullptr;
}
}
}
}
}
default: WASM_UNREACHABLE();
}
}
}
void visitBlock(Block *curr) {
// compress out nops and other dead code
bool resultUsed = ExpressionAnalyzer::isResultUsed(expressionStack, getFunction());
int skip = 0;
auto& list = curr->list;
size_t size = list.size();
bool needResize = false;
for (size_t z = 0; z < size; z++) {
auto* optimized = optimize(list[z], z == size - 1 && resultUsed);
if (!optimized) {
skip++;
needResize = true;
} else {
if (optimized != list[z]) {
list[z] = optimized;
}
if (skip > 0) {
list[z - skip] = list[z];
}
// if this is an unconditional br, the rest is dead code
Break* br = list[z - skip]->dynCast<Break>();
Switch* sw = list[z - skip]->dynCast<Switch>();
if ((br && !br->condition) || sw) {
list.resize(z - skip + 1);
needResize = false;
break;
}
}
}
if (needResize) {
list.resize(size - skip);
}
if (!curr->name.is()) {
if (list.size() == 1) {
// just one element. replace the block, either with it or with a nop if it's not needed
if (resultUsed || EffectAnalyzer(list[0]).hasSideEffects()) {
replaceCurrent(list[0]);
} else {
ExpressionManipulator::nop(curr);
}
} else if (list.size() == 0) {
ExpressionManipulator::nop(curr);
}
}
}
void visitIf(If* curr) {
if (curr->ifFalse) {
if (curr->ifFalse->is<Nop>()) {
curr->ifFalse = nullptr;
} else if (curr->ifTrue->is<Nop>()) {
curr->ifTrue = curr->ifFalse;
curr->ifFalse = nullptr;
curr->condition = Builder(*getModule()).makeUnary(EqZInt32, curr->condition);
}
}
if (!curr->ifFalse) {
// no else
if (curr->ifTrue->is<Nop>()) {
// no nothing
replaceCurrent(curr->condition);
}
}
}
void visitLoop(Loop* curr) {
if (curr->body->is<Nop>()) ExpressionManipulator::nop(curr);
}
static void visitPre(Vacuum* self, Expression** currp) {
self->expressionStack.push_back(*currp);
}
static void visitPost(Vacuum* self, Expression** currp) {
self->expressionStack.pop_back();
}
// override scan to add a pre and a post check task to all nodes
static void scan(Vacuum* self, Expression** currp) {
self->pushTask(visitPost, currp);
WalkerPass<PostWalker<Vacuum, Visitor<Vacuum>>>::scan(self, currp);
self->pushTask(visitPre, currp);
}
void visitFunction(Function* curr) {
auto* optimized = optimize(curr->body, curr->result != none);
if (optimized) {
curr->body = optimized;
} else {
ExpressionManipulator::nop(curr->body);
}
if (curr->result == none && !EffectAnalyzer(curr->body).hasSideEffects()) {
ExpressionManipulator::nop(curr->body);
}
}
};
Pass *createVacuumPass() {
return new Vacuum();
}
} // namespace wasm
|