blob: ef89e50f3710d086363f77888e6b452e8f803b37 (
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
|
/*
* Copyright 2021 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.
*/
#include "table-utils.h"
#include "find_all.h"
#include "module-utils.h"
namespace wasm {
namespace TableUtils {
std::set<Name> getFunctionsNeedingElemDeclare(Module& wasm) {
// Without reference types there are no ref.funcs or elem declare.
if (!wasm.features.hasReferenceTypes()) {
return {};
}
// Find all the names in the tables.
std::unordered_set<Name> tableNames;
for (auto& table : wasm.tables) {
for (auto& segment : table->segments) {
for (auto name : segment.data) {
tableNames.insert(name);
}
}
}
// Find all the names in ref.funcs.
using Names = std::unordered_set<Name>;
ModuleUtils::ParallelFunctionAnalysis<Names> analysis(
wasm, [&](Function* func, Names& names) {
if (func->imported()) {
return;
}
for (auto* refFunc : FindAll<RefFunc>(func->body).list) {
names.insert(refFunc->func);
}
});
// Find the names that need to be declared.
std::set<Name> ret;
for (auto& kv : analysis.map) {
auto& names = kv.second;
for (auto name : names) {
if (!tableNames.count(name)) {
ret.insert(name);
}
}
}
return ret;
}
} // namespace TableUtils
} // namespace wasm
|
