blob: 3b04522ad59957b1d0d506a4257bfb50169b9bbf (
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
|
/*
* Copyright 2015 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 names from locations that are never branched to, and
// merge names when possible (by merging their blocks)
//
#include <pass.h>
#include <wasm.h>
namespace wasm {
struct RemoveUnusedNames : public WalkerPass<PostWalker<RemoveUnusedNames>> {
bool isFunctionParallel() override { return true; }
Pass* create() override { return new RemoveUnusedNames; }
// We maintain a list of branches that we saw in children, then when we reach
// a parent block, we know if it was branched to
std::map<Name, std::set<Expression*>> branchesSeen;
void visitBreak(Break* curr) { branchesSeen[curr->name].insert(curr); }
void visitSwitch(Switch* curr) {
for (auto name : curr->targets) {
branchesSeen[name].insert(curr);
}
branchesSeen[curr->default_].insert(curr);
}
void visitBrOnExn(BrOnExn* curr) { branchesSeen[curr->name].insert(curr); }
void handleBreakTarget(Name& name) {
if (name.is()) {
if (branchesSeen.find(name) == branchesSeen.end()) {
name = Name();
} else {
branchesSeen.erase(name);
}
}
}
void visitBlock(Block* curr) {
if (curr->name.is() && curr->list.size() == 1) {
auto* child = curr->list[0]->dynCast<Block>();
if (child && child->name.is() && child->type == curr->type) {
// we have just one child, this block, so breaking out of it goes to the
// same place as breaking out of us, we just need one name (and block)
auto& branches = branchesSeen[curr->name];
for (auto* branch : branches) {
if (Break* br = branch->dynCast<Break>()) {
if (br->name == curr->name) {
br->name = child->name;
}
} else if (Switch* sw = branch->dynCast<Switch>()) {
for (auto& target : sw->targets) {
if (target == curr->name) {
target = child->name;
}
}
if (sw->default_ == curr->name) {
sw->default_ = child->name;
}
} else if (BrOnExn* br = branch->dynCast<BrOnExn>()) {
if (br->name == curr->name) {
br->name = child->name;
}
} else {
WASM_UNREACHABLE();
}
}
child->finalize(child->type);
replaceCurrent(child);
}
}
handleBreakTarget(curr->name);
}
void visitLoop(Loop* curr) {
handleBreakTarget(curr->name);
if (!curr->name.is()) {
replaceCurrent(curr->body);
}
}
void visitFunction(Function* curr) { assert(branchesSeen.empty()); }
};
Pass* createRemoveUnusedNamesPass() { return new RemoveUnusedNames(); }
} // namespace wasm
|
