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 348 349 350 351 352
|
/*
* Copyright (C) 2019 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "WasmEntryPlan.h"
#include "LLIntData.h"
#include "WasmBinding.h"
#include "WasmToJS.h"
#include <wtf/DataLog.h>
#include <wtf/Locker.h>
#include <wtf/MonotonicTime.h>
#include <wtf/StdLibExtras.h>
#include <wtf/SystemTracing.h>
#include <wtf/text/MakeString.h>
#if ENABLE(WEBASSEMBLY)
namespace JSC { namespace Wasm {
namespace WasmEntryPlanInternal {
static constexpr bool verbose = false;
}
EntryPlan::EntryPlan(VM& vm, Ref<ModuleInformation> info, CompilerMode compilerMode, CompletionTask&& task)
: Base(vm, WTFMove(info), WTFMove(task))
, m_streamingParser(m_moduleInformation.get(), *this)
, m_state(State::Validated)
, m_compilerMode(compilerMode)
{
}
EntryPlan::EntryPlan(VM& vm, Vector<uint8_t>&& source, CompilerMode compilerMode, CompletionTask&& task)
: Base(vm, WTFMove(task))
, m_source(WTFMove(source))
, m_streamingParser(m_moduleInformation.get(), *this)
, m_state(State::Initial)
, m_compilerMode(compilerMode)
{
}
const char* EntryPlan::stateString(State state)
{
switch (state) {
case State::Initial: return "Initial";
case State::Validated: return "Validated";
case State::Prepared: return "Prepared";
case State::Compiled: return "Compiled";
case State::Completed: return "Completed";
}
RELEASE_ASSERT_NOT_REACHED();
}
void EntryPlan::moveToState(State state)
{
ASSERT(state >= m_state);
dataLogLnIf(WasmEntryPlanInternal::verbose && state != m_state, "moving to state: ", stateString(state), " from state: ", stateString(m_state));
m_state = state;
}
bool EntryPlan::parseAndValidateModule(std::span<const uint8_t> source)
{
if (m_state != State::Initial)
return true;
dataLogLnIf(WasmEntryPlanInternal::verbose, "starting validation");
MonotonicTime startTime;
if (WasmEntryPlanInternal::verbose || Options::reportCompileTimes())
startTime = MonotonicTime::now();
m_streamingParser.addBytes(source);
{
Locker locker { m_lock };
if (failed())
return false;
}
if (m_streamingParser.finalize() != StreamingParser::State::Finished) {
Locker locker { m_lock };
fail(m_streamingParser.errorMessage());
return false;
}
if (WasmEntryPlanInternal::verbose || Options::reportCompileTimes())
dataLogLn("Took ", (MonotonicTime::now() - startTime).microseconds(), " us to validate module");
moveToState(State::Validated);
return true;
}
void EntryPlan::prepare()
{
ASSERT(m_state == State::Validated);
dataLogLnIf(WasmEntryPlanInternal::verbose, "Starting preparation"_s);
const auto& functions = m_moduleInformation->functions;
m_numberOfFunctions = functions.size();
if (!tryReserveCapacity(m_wasmToWasmExitStubs, m_moduleInformation->importFunctionTypeIndices.size(), " WebAssembly to WebAssembly stubs"_s))
return;
if (!tryReserveCapacity(m_wasmToJSExitStubs, m_moduleInformation->importFunctionTypeIndices.size(), " WebAssembly to JavaScript stubs"_s))
return;
if (!tryReserveCapacity(m_unlinkedWasmToWasmCalls, functions.size(), " unlinked WebAssembly to WebAssembly calls"_s))
return;
m_unlinkedWasmToWasmCalls.resize(functions.size());
const uint32_t importFunctionCount = m_moduleInformation->importFunctionCount();
for (const auto& exp : m_moduleInformation->exports) {
if (exp.kindIndex >= importFunctionCount)
m_exportedFunctionIndices.add(exp.kindIndex - importFunctionCount);
}
for (const auto& element : m_moduleInformation->elements) {
for (uint32_t i = 0; i < element.length(); i++) {
if (element.initTypes[i] == Element::InitializationType::FromRefFunc && element.initialBitsOrIndices[i] >= importFunctionCount)
m_exportedFunctionIndices.add(element.initialBitsOrIndices[i] - importFunctionCount);
}
}
if (m_moduleInformation->startFunctionIndexSpace && m_moduleInformation->startFunctionIndexSpace >= importFunctionCount)
m_exportedFunctionIndices.add(*m_moduleInformation->startFunctionIndexSpace - importFunctionCount);
if (!prepareImpl())
return;
moveToState(State::Prepared);
}
// We don't have a semaphore class... and this does kinda interesting things.
class EntryPlan::ThreadCountHolder {
public:
ThreadCountHolder(EntryPlan& plan)
: m_plan(plan)
{
Locker locker { m_plan.m_lock };
m_plan.m_numberOfActiveThreads++;
}
~ThreadCountHolder()
{
Locker locker { m_plan.m_lock };
m_plan.m_numberOfActiveThreads--;
if (!m_plan.m_numberOfActiveThreads && !m_plan.hasWork())
m_plan.complete();
}
EntryPlan& m_plan;
};
void EntryPlan::compileFunctions()
{
ASSERT(m_state >= State::Prepared);
dataLogLnIf(WasmEntryPlanInternal::verbose, "Starting compilation");
if (!hasWork())
return;
std::optional<TraceScope> traceScope;
if (Options::useTracePoints())
traceScope.emplace(WebAssemblyCompileStart, WebAssemblyCompileEnd);
ThreadCountHolder holder(*this);
uint32_t functionIndex;
uint32_t functionIndexEnd;
bool areWasmToWasmStubsCompiled = false;
bool areWasmToJSStubsCompiled = false;
{
Locker locker { m_lock };
if (m_currentIndex >= m_numberOfFunctions) {
if (hasWork())
moveToState(State::Compiled);
return;
}
size_t compileLimit = Options::wasmSmallPartialCompileLimit();
if (Options::useConcurrentJIT()) {
// When the size of wasm binary requires 3 loops, use large limit.
if (m_moduleInformation->totalFunctionSize() > (3 * compileLimit * Options::numberOfWasmCompilerThreads()))
compileLimit = Options::wasmLargePartialCompileLimit();
}
dataLogLnIf(WasmEntryPlanInternal::verbose, "Compile Size Limit ", compileLimit);
functionIndex = m_currentIndex;
functionIndexEnd = m_numberOfFunctions;
size_t bytesCompiled = 0;
for (uint32_t index = functionIndex; index < m_numberOfFunctions; ++index) {
size_t byteSize = m_moduleInformation->functions[index].data.size();
// If One function's size is larger than the limit itself, we compile it separately from the current sequence,
// so that we can distribute compilation tasks more uniformly.
if (bytesCompiled && byteSize >= compileLimit) {
functionIndexEnd = index;
break;
}
bytesCompiled += byteSize;
if (bytesCompiled >= compileLimit) {
functionIndexEnd = index + 1;
break;
}
}
m_currentIndex = functionIndexEnd;
areWasmToWasmStubsCompiled = std::exchange(m_areWasmToWasmStubsCompiled, true);
areWasmToJSStubsCompiled = std::exchange(m_areWasmToJSStubsCompiled, true);
}
for (uint32_t index = functionIndex; index < functionIndexEnd; ++index)
compileFunction(FunctionCodeIndex(index));
if (!areWasmToWasmStubsCompiled) {
if (UNLIKELY(!generateWasmToWasmStubs())) {
Locker locker { m_lock };
fail(makeString("Out of executable memory at stub generation"_s));
return;
}
}
if (!areWasmToJSStubsCompiled) {
if (UNLIKELY(!generateWasmToJSStubs())) {
Locker locker { m_lock };
fail(makeString("Out of executable memory at stub generation"_s));
return;
}
}
}
void EntryPlan::complete()
{
ASSERT(m_state != State::Compiled || m_currentIndex >= m_moduleInformation->functions.size());
dataLogLnIf(WasmEntryPlanInternal::verbose, "Starting Completion");
if (!failed() && m_state == State::Compiled)
didCompleteCompilation();
if (!isComplete()) {
generateStubsIfNecessary();
moveToState(State::Completed);
runCompletionTasks();
}
}
bool EntryPlan::completeSyncIfPossible()
{
Locker locker { m_lock };
if (m_currentIndex >= m_numberOfFunctions) {
if (hasWork())
moveToState(State::Compiled);
if (!m_numberOfActiveThreads) {
complete();
return true;
}
}
return false;
}
void EntryPlan::generateStubsIfNecessary()
{
if (!std::exchange(m_areWasmToWasmStubsCompiled, true)) {
if (UNLIKELY(!generateWasmToWasmStubs())) {
fail(makeString("Out of executable memory at stub generation"_s));
return;
}
}
if (!std::exchange(m_areWasmToJSStubsCompiled, true)) {
if (UNLIKELY(!generateWasmToJSStubs())) {
fail(makeString("Out of executable memory at stub generation"_s));
return;
}
}
}
bool EntryPlan::generateWasmToWasmStubs()
{
m_wasmToWasmExitStubs.resize(m_moduleInformation->importFunctionTypeIndices.size());
unsigned importFunctionIndex = 0;
for (unsigned importIndex = 0; importIndex < m_moduleInformation->imports.size(); ++importIndex) {
Import* import = &m_moduleInformation->imports[importIndex];
if (import->kind != ExternalKind::Function)
continue;
dataLogLnIf(WasmEntryPlanInternal::verbose, "Processing import function number "_s, importFunctionIndex, ": "_s, makeString(import->module), ": "_s, makeString(import->field));
#if ENABLE(JIT)
if (Options::useWasmJIT()) {
auto binding = wasmToWasm(importFunctionIndex);
if (UNLIKELY(!binding))
return false;
m_wasmToWasmExitStubs[importFunctionIndex++] = binding.value();
}
#else
if (false);
#endif // ENABLE(JIT)
else {
if (Options::useWasmIPInt())
m_wasmToWasmExitStubs[importFunctionIndex++] = LLInt::getCodeRef<WasmEntryPtrTag>(wasm_to_wasm_ipint_wrapper_entry);
else
m_wasmToWasmExitStubs[importFunctionIndex++] = LLInt::getCodeRef<WasmEntryPtrTag>(wasm_to_wasm_wrapper_entry);
}
}
ASSERT(importFunctionIndex == m_wasmToWasmExitStubs.size());
return true;
}
bool EntryPlan::generateWasmToJSStubs()
{
m_wasmToJSExitStubs.resize(m_moduleInformation->importFunctionCount());
for (unsigned importIndex = 0; importIndex < m_moduleInformation->importFunctionCount(); ++importIndex) {
#if ENABLE(JIT)
Wasm::TypeIndex typeIndex = m_moduleInformation->importFunctionTypeIndices.at(importIndex);
if (Options::useWasmJIT()) {
auto binding = wasmToJS(typeIndex, importIndex);
if (UNLIKELY(!binding))
return false;
m_wasmToJSExitStubs[importIndex] = binding.value();
}
#else
if (false);
#endif // ENABLE(JIT)
else
m_wasmToJSExitStubs[importIndex] = LLInt::getCodeRef<WasmEntryPtrTag>(wasm_to_js_wrapper_entry);
}
return true;
}
} } // namespace JSC::Wasm
#endif // ENABLE(WEBASSEMBLY)
|