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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
|
#include "ir/local-graph.h"
#include "parser/wat-parser.h"
#include "wasm.h"
#include "gtest/gtest.h"
using LocalGraphTest = ::testing::Test;
using namespace wasm;
TEST_F(LocalGraphTest, ObstacleBasics) {
auto moduleText = R"wasm(
(module
(func $foo (result i32)
;; A local with a set and a get, and some nops in between.
(local $x i32)
(nop)
(local.set $x
(i32.const 10)
)
(nop)
(local.get $x)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
// Get access to the contents of the wasm.
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* nopA = block->list[0]->cast<Nop>();
auto* set = block->list[1]->cast<LocalSet>();
auto* nopB = block->list[2]->cast<Nop>();
auto* get = block->list[3]->cast<LocalGet>();
{
LazyLocalGraph graph(func, &wasm);
// The set has one get.
EXPECT_EQ(graph.getSetInfluences(set).size(), 1U);
}
{
// Construct the graph with an obstacle class, Nop.
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// The set has one get, like before.
EXPECT_EQ(graph.getSetInfluences(set).size(), 1U);
// If the first nop is an obstacle, nothing changes: the path between the
// set and get does not include it.
EXPECT_EQ(graph.canMoveSet(set, nopA).size(), 1U);
EXPECT_EQ(*graph.canMoveSet(set, nopA).begin(), get);
// But if the second one is an obstacle, it severs the connection.
EXPECT_EQ(graph.canMoveSet(set, nopB).size(), 0U);
}
}
TEST_F(LocalGraphTest, ObstacleMultiblock) {
auto moduleText = R"wasm(
(module
(func $foo (result i32)
;; An if between the set and get.
(local $x i32)
(local.set $x
(i32.const 10)
)
(if
(i32.const 42)
(then
(nop)
)
(else
(nop)
)
)
(nop)
(local.get $x)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* set = block->list[0]->cast<LocalSet>();
auto* iff = block->list[1]->cast<If>();
auto* nopA = iff->ifTrue->cast<Nop>();
auto* nopB = iff->ifTrue->cast<Nop>();
auto* nopC = block->list[2]->cast<Nop>();
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// No matter which if arm is an obstacle, we still connect.
EXPECT_EQ(graph.canMoveSet(set, nopA).size(), 1U);
EXPECT_EQ(graph.canMoveSet(set, nopB).size(), 1U);
// But the nop after the if stops us.
EXPECT_EQ(graph.canMoveSet(set, nopC).size(), 0U);
}
TEST_F(LocalGraphTest, ObstacleUnreachable) {
auto moduleText = R"wasm(
(module
(func $foo (result i32)
;; An unreachable between the set and get.
(local $x i32)
(local.set $x
(i32.const 10)
)
(nop)
(unreachable)
(nop)
(local.get $x)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* set = block->list[0]->cast<LocalSet>();
auto* nopA = block->list[1]->cast<Nop>();
auto* nopB = block->list[3]->cast<Nop>();
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// The get is unreachable, and the set has no gets.
EXPECT_EQ(graph.getSetInfluences(set).size(), 0U);
EXPECT_EQ(graph.canMoveSet(set, nopA).size(), 0U);
EXPECT_EQ(graph.canMoveSet(set, nopB).size(), 0U);
}
TEST_F(LocalGraphTest, ObstacleMultiGet) {
auto moduleText = R"wasm(
(module
(func $foo
;; A set with multiple gets.
(local $x i32)
(local.set $x
(i32.const 10)
)
(nop)
(drop
(local.get $x)
)
(nop)
(drop
(local.get $x)
)
(nop)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* set = block->list[0]->cast<LocalSet>();
auto* nopA = block->list[1]->cast<Nop>();
auto* nopB = block->list[3]->cast<Nop>();
auto* nopC = block->list[5]->cast<Nop>();
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// The first nop blocks them both, but not the second, and the third blocks
// nothing.
EXPECT_EQ(graph.canMoveSet(set, nopA).size(), 0U);
EXPECT_EQ(graph.canMoveSet(set, nopB).size(), 1U);
EXPECT_EQ(graph.canMoveSet(set, nopC).size(), 2U);
}
TEST_F(LocalGraphTest, ObstacleMultiSet) {
auto moduleText = R"wasm(
(module
(func $foo
;; Two sets.
(local $x i32)
(local.set $x
(i32.const 10)
)
(local.set $x
(i32.const 20)
)
(nop)
(drop
(local.get $x)
)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* setA = block->list[0]->cast<LocalSet>();
auto* setB = block->list[1]->cast<LocalSet>();
auto* nop = block->list[2]->cast<Nop>();
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// The first set has no gets, the second has one.
EXPECT_EQ(graph.getSetInfluences(setA).size(), 0U);
EXPECT_EQ(graph.getSetInfluences(setB).size(), 1U);
// The nop blocks on the second (and the first, but it had none anyhow).
EXPECT_EQ(graph.canMoveSet(setA, nop).size(), 0U);
EXPECT_EQ(graph.canMoveSet(setB, nop).size(), 0U);
}
TEST_F(LocalGraphTest, ObstacleMultiSetIndexes) {
auto moduleText = R"wasm(
(module
(func $foo
;; Two sets of different indexes.
(local $x i32)
(local $y i32)
(local.set $x
(i32.const 10)
)
(local.set $y
(i32.const 20)
)
(nop)
(drop
(local.get $x)
)
(nop)
(drop
(local.get $y)
)
(nop)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* setA = block->list[0]->cast<LocalSet>();
auto* setB = block->list[1]->cast<LocalSet>();
auto* nopA = block->list[2]->cast<Nop>();
auto* nopB = block->list[4]->cast<Nop>();
auto* nopC = block->list[6]->cast<Nop>();
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// The first nop blocks them both.
EXPECT_EQ(graph.canMoveSet(setA, nopA).size(), 0U);
EXPECT_EQ(graph.canMoveSet(setB, nopA).size(), 0U);
// The second nop only blocks one.
EXPECT_EQ(graph.canMoveSet(setA, nopB).size(), 1U);
EXPECT_EQ(graph.canMoveSet(setB, nopB).size(), 0U);
// The last nop blocks nothing.
EXPECT_EQ(graph.canMoveSet(setA, nopC).size(), 1U);
EXPECT_EQ(graph.canMoveSet(setB, nopC).size(), 1U);
}
TEST_F(LocalGraphTest, ObstacleMultiSetIf) {
auto moduleText = R"wasm(
(module
(func $foo
;; Two sets in an if.
(local $x i32)
(if
(i32.const 42)
(then
(local.set $x
(i32.const 10)
)
)
(else
(local.set $x
(i32.const 20)
)
)
)
(nop)
(drop
(local.get $x)
)
(nop)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* block = func->body->cast<Block>();
auto* iff = block->list[0]->cast<If>();
auto* setA = iff->ifTrue->cast<LocalSet>();
auto* setB = iff->ifFalse->cast<LocalSet>();
auto* nopA = block->list[1]->cast<Nop>();
auto* nopB = block->list[3]->cast<Nop>();
LazyLocalGraph graph(func, &wasm, Nop::SpecificId);
// Both sets have a get.
EXPECT_EQ(graph.getSetInfluences(setA).size(), 1U);
EXPECT_EQ(graph.getSetInfluences(setB).size(), 1U);
// The first nop blocks both.
EXPECT_EQ(graph.canMoveSet(setA, nopA).size(), 0U);
EXPECT_EQ(graph.canMoveSet(setB, nopA).size(), 0U);
// The first nop blocks neither.
EXPECT_EQ(graph.canMoveSet(setA, nopB).size(), 1U);
EXPECT_EQ(graph.canMoveSet(setB, nopB).size(), 1U);
}
TEST_F(LocalGraphTest, ObstacleStructSet) {
// Use something other than a nop to obstruct. Here we show a realistic
// situation using GC.
auto moduleText = R"wasm(
(module
(type $struct (struct (field (mut i32))))
(func $test
(local $struct (ref null $struct))
(block $label
;; A struct.set that may be skipped by the br in the if.
(struct.set $struct 0
(local.tee $struct
(struct.new_default $struct)
)
(if (result i32)
(i32.const 1)
(then
(br $label)
)
(else
(i32.const 0)
)
)
)
)
(drop
(struct.get $struct 0
(local.get $struct)
)
)
)
)
)wasm";
Module wasm;
ASSERT_FALSE(WATParser::parseModule(wasm, moduleText).getErr());
auto* func = wasm.functions[0].get();
auto* outerBlock = func->body->cast<Block>();
auto* block = outerBlock->list[0]->cast<Block>();
auto* structSet = block->list[0]->cast<StructSet>();
auto* tee = structSet->ref->cast<LocalSet>();
LazyLocalGraph graph(func, &wasm, StructSet::SpecificId);
// The tee has one get.
EXPECT_EQ(graph.getSetInfluences(tee).size(), 1U);
// The struct.set blocks one path, but not the path that skips it via the br.
EXPECT_EQ(graph.canMoveSet(tee, structSet).size(), 1U);
}
|
