2017-09-16 05:22:38 +00:00
|
|
|
// Copyright 2017 the V8 project authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
|
|
|
|
2018-02-02 12:05:19 +00:00
|
|
|
#ifndef V8_WASM_WASM_CODE_MANAGER_H_
|
|
|
|
#define V8_WASM_WASM_CODE_MANAGER_H_
|
2017-09-16 05:22:38 +00:00
|
|
|
|
2019-03-11 12:18:46 +00:00
|
|
|
#include <atomic>
|
2017-09-16 05:22:38 +00:00
|
|
|
#include <list>
|
2017-11-20 21:34:04 +00:00
|
|
|
#include <map>
|
2019-03-11 12:18:46 +00:00
|
|
|
#include <memory>
|
2019-03-25 12:23:37 +00:00
|
|
|
#include <unordered_set>
|
2019-03-11 12:18:46 +00:00
|
|
|
#include <utility>
|
|
|
|
#include <vector>
|
2017-09-16 05:22:38 +00:00
|
|
|
|
2019-05-16 13:17:28 +00:00
|
|
|
#include "src/base/address-region.h"
|
2020-04-06 12:30:15 +00:00
|
|
|
#include "src/base/bit-field.h"
|
2017-09-16 05:22:38 +00:00
|
|
|
#include "src/base/macros.h"
|
2019-04-02 09:23:45 +00:00
|
|
|
#include "src/base/optional.h"
|
2018-08-22 09:14:23 +00:00
|
|
|
#include "src/builtins/builtins-definitions.h"
|
2019-05-22 12:44:24 +00:00
|
|
|
#include "src/handles/handles.h"
|
2017-11-20 21:34:04 +00:00
|
|
|
#include "src/trap-handler/trap-handler.h"
|
2019-05-23 13:27:57 +00:00
|
|
|
#include "src/utils/vector.h"
|
2018-10-23 11:37:58 +00:00
|
|
|
#include "src/wasm/compilation-environment.h"
|
2018-08-08 14:54:44 +00:00
|
|
|
#include "src/wasm/wasm-features.h"
|
2018-09-25 16:07:22 +00:00
|
|
|
#include "src/wasm/wasm-limits.h"
|
2019-08-24 06:44:39 +00:00
|
|
|
#include "src/wasm/wasm-module-sourcemap.h"
|
2019-04-03 15:37:47 +00:00
|
|
|
#include "src/wasm/wasm-tier.h"
|
2018-03-19 09:22:23 +00:00
|
|
|
|
2017-09-16 05:22:38 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2017-11-20 21:34:04 +00:00
|
|
|
|
|
|
|
class Code;
|
2019-02-05 12:54:32 +00:00
|
|
|
class CodeDesc;
|
|
|
|
class Isolate;
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2017-09-16 05:22:38 +00:00
|
|
|
namespace wasm {
|
|
|
|
|
2019-12-27 15:17:44 +00:00
|
|
|
class DebugInfo;
|
2017-11-20 21:34:04 +00:00
|
|
|
class NativeModule;
|
2018-04-05 14:14:24 +00:00
|
|
|
class WasmCodeManager;
|
2019-03-19 12:52:04 +00:00
|
|
|
struct WasmCompilationResult;
|
2019-01-25 10:35:37 +00:00
|
|
|
class WasmEngine;
|
2018-10-10 12:22:19 +00:00
|
|
|
class WasmImportWrapperCache;
|
2017-11-20 21:34:04 +00:00
|
|
|
struct WasmModule;
|
|
|
|
|
2019-11-28 11:59:27 +00:00
|
|
|
// Convenience macro listing all wasm runtime stubs. Note that the first few
|
|
|
|
// elements of the list coincide with {compiler::TrapId}, order matters.
|
|
|
|
#define WASM_RUNTIME_STUB_LIST(V, VTRAP) \
|
|
|
|
FOREACH_WASM_TRAPREASON(VTRAP) \
|
|
|
|
V(WasmCompileLazy) \
|
2020-02-04 17:17:06 +00:00
|
|
|
V(WasmDebugBreak) \
|
2020-04-21 18:39:11 +00:00
|
|
|
V(WasmInt32ToHeapNumber) \
|
|
|
|
V(WasmTaggedNonSmiToInt32) \
|
|
|
|
V(WasmFloat64ToNumber) \
|
|
|
|
V(WasmTaggedToFloat64) \
|
2019-11-28 11:59:27 +00:00
|
|
|
V(WasmAtomicNotify) \
|
2020-02-28 13:59:12 +00:00
|
|
|
V(WasmI32AtomicWait32) \
|
|
|
|
V(WasmI32AtomicWait64) \
|
|
|
|
V(WasmI64AtomicWait32) \
|
|
|
|
V(WasmI64AtomicWait64) \
|
2019-11-28 11:59:27 +00:00
|
|
|
V(WasmMemoryGrow) \
|
2020-03-19 13:49:52 +00:00
|
|
|
V(WasmTableInit) \
|
2020-03-19 14:14:48 +00:00
|
|
|
V(WasmTableCopy) \
|
2019-11-28 11:59:27 +00:00
|
|
|
V(WasmTableGet) \
|
|
|
|
V(WasmTableSet) \
|
|
|
|
V(WasmStackGuard) \
|
|
|
|
V(WasmStackOverflow) \
|
|
|
|
V(WasmThrow) \
|
|
|
|
V(WasmRethrow) \
|
|
|
|
V(WasmTraceMemory) \
|
|
|
|
V(AllocateHeapNumber) \
|
|
|
|
V(ArgumentsAdaptorTrampoline) \
|
|
|
|
V(BigIntToI32Pair) \
|
|
|
|
V(BigIntToI64) \
|
|
|
|
V(DoubleToI) \
|
|
|
|
V(I32PairToBigInt) \
|
|
|
|
V(I64ToBigInt) \
|
|
|
|
V(RecordWrite) \
|
|
|
|
V(ToNumber)
|
|
|
|
|
2018-09-25 14:21:11 +00:00
|
|
|
// Sorted, disjoint and non-overlapping memory regions. A region is of the
|
2017-09-16 05:22:38 +00:00
|
|
|
// form [start, end). So there's no [start, end), [end, other_end),
|
|
|
|
// because that should have been reduced to [start, other_end).
|
|
|
|
class V8_EXPORT_PRIVATE DisjointAllocationPool final {
|
|
|
|
public:
|
2019-05-08 11:15:14 +00:00
|
|
|
MOVE_ONLY_WITH_DEFAULT_CONSTRUCTORS(DisjointAllocationPool);
|
2018-09-25 14:21:11 +00:00
|
|
|
explicit DisjointAllocationPool(base::AddressRegion region)
|
|
|
|
: regions_({region}) {}
|
2017-09-16 05:22:38 +00:00
|
|
|
|
2018-09-25 14:21:11 +00:00
|
|
|
// Merge the parameter region into this object while preserving ordering of
|
|
|
|
// the regions. The assumption is that the passed parameter is not
|
|
|
|
// intersecting this object - for example, it was obtained from a previous
|
2019-05-06 13:55:03 +00:00
|
|
|
// Allocate. Returns the merged region.
|
|
|
|
base::AddressRegion Merge(base::AddressRegion);
|
2017-09-16 05:22:38 +00:00
|
|
|
|
2018-09-25 14:21:11 +00:00
|
|
|
// Allocate a contiguous region of size {size}. Return an empty pool on
|
2017-09-16 05:22:38 +00:00
|
|
|
// failure.
|
2018-09-25 14:21:11 +00:00
|
|
|
base::AddressRegion Allocate(size_t size);
|
2017-09-16 05:22:38 +00:00
|
|
|
|
2019-08-02 09:21:21 +00:00
|
|
|
// Allocate a contiguous region of size {size} within {region}. Return an
|
|
|
|
// empty pool on failure.
|
|
|
|
base::AddressRegion AllocateInRegion(size_t size, base::AddressRegion);
|
|
|
|
|
2018-09-25 14:21:11 +00:00
|
|
|
bool IsEmpty() const { return regions_.empty(); }
|
|
|
|
const std::list<base::AddressRegion>& regions() const { return regions_; }
|
2017-09-16 05:22:38 +00:00
|
|
|
|
|
|
|
private:
|
2018-09-25 14:21:11 +00:00
|
|
|
std::list<base::AddressRegion> regions_;
|
2017-09-16 05:22:38 +00:00
|
|
|
};
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
class V8_EXPORT_PRIVATE WasmCode final {
|
|
|
|
public:
|
|
|
|
enum Kind {
|
2017-11-29 20:23:19 +00:00
|
|
|
kFunction,
|
2019-05-08 11:29:40 +00:00
|
|
|
kWasmToCapiWrapper,
|
2017-11-29 20:23:19 +00:00
|
|
|
kWasmToJsWrapper,
|
2018-05-15 07:18:34 +00:00
|
|
|
kInterpreterEntry,
|
2018-06-19 09:47:17 +00:00
|
|
|
kJumpTable
|
2017-11-20 21:34:04 +00:00
|
|
|
};
|
|
|
|
|
2018-06-04 10:12:54 +00:00
|
|
|
// Each runtime stub is identified by an id. This id is used to reference the
|
|
|
|
// stub via {RelocInfo::WASM_STUB_CALL} and gets resolved during relocation.
|
|
|
|
enum RuntimeStubId {
|
2018-06-06 13:22:09 +00:00
|
|
|
#define DEF_ENUM(Name) k##Name,
|
|
|
|
#define DEF_ENUM_TRAP(Name) kThrowWasm##Name,
|
|
|
|
WASM_RUNTIME_STUB_LIST(DEF_ENUM, DEF_ENUM_TRAP)
|
|
|
|
#undef DEF_ENUM_TRAP
|
2018-06-04 10:12:54 +00:00
|
|
|
#undef DEF_ENUM
|
|
|
|
kRuntimeStubCount
|
|
|
|
};
|
|
|
|
|
2020-04-06 12:30:15 +00:00
|
|
|
Vector<byte> instructions() const {
|
|
|
|
return VectorOf(instructions_, static_cast<size_t>(instructions_size_));
|
|
|
|
}
|
2018-04-13 22:28:05 +00:00
|
|
|
Address instruction_start() const {
|
2020-04-06 12:30:15 +00:00
|
|
|
return reinterpret_cast<Address>(instructions_);
|
2018-04-13 22:28:05 +00:00
|
|
|
}
|
2020-03-05 15:35:20 +00:00
|
|
|
Vector<const byte> reloc_info() const {
|
|
|
|
return {protected_instructions_data().end(),
|
|
|
|
static_cast<size_t>(reloc_info_size_)};
|
|
|
|
}
|
2018-03-23 11:30:26 +00:00
|
|
|
Vector<const byte> source_positions() const {
|
2020-03-05 15:35:20 +00:00
|
|
|
return {reloc_info().end(), static_cast<size_t>(source_positions_size_)};
|
2018-03-23 11:30:26 +00:00
|
|
|
}
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2020-02-26 12:39:41 +00:00
|
|
|
// TODO(clemensb): Make this return int.
|
2018-09-25 16:07:22 +00:00
|
|
|
uint32_t index() const {
|
2020-02-26 12:39:41 +00:00
|
|
|
DCHECK_LE(0, index_);
|
2018-09-25 16:07:22 +00:00
|
|
|
return index_;
|
|
|
|
}
|
2018-06-19 15:48:38 +00:00
|
|
|
// Anonymous functions are functions that don't carry an index.
|
2018-09-25 16:07:22 +00:00
|
|
|
bool IsAnonymous() const { return index_ == kAnonymousFuncIndex; }
|
2020-04-06 12:30:15 +00:00
|
|
|
Kind kind() const { return KindField::decode(flags_); }
|
2018-03-15 12:53:10 +00:00
|
|
|
NativeModule* native_module() const { return native_module_; }
|
2020-04-06 12:30:15 +00:00
|
|
|
ExecutionTier tier() const { return ExecutionTierField::decode(flags_); }
|
2017-11-20 21:34:04 +00:00
|
|
|
Address constant_pool() const;
|
2019-04-17 13:18:17 +00:00
|
|
|
Address handler_table() const;
|
2020-02-26 12:39:41 +00:00
|
|
|
int handler_table_size() const;
|
2018-12-13 19:30:56 +00:00
|
|
|
Address code_comments() const;
|
2020-02-26 12:39:41 +00:00
|
|
|
int code_comments_size() const;
|
|
|
|
int constant_pool_offset() const { return constant_pool_offset_; }
|
|
|
|
int safepoint_table_offset() const { return safepoint_table_offset_; }
|
|
|
|
int handler_table_offset() const { return handler_table_offset_; }
|
|
|
|
int code_comments_offset() const { return code_comments_offset_; }
|
|
|
|
int unpadded_binary_size() const { return unpadded_binary_size_; }
|
|
|
|
int stack_slots() const { return stack_slots_; }
|
|
|
|
int tagged_parameter_slots() const { return tagged_parameter_slots_; }
|
2020-04-06 12:30:15 +00:00
|
|
|
bool is_liftoff() const { return tier() == ExecutionTier::kLiftoff; }
|
2018-05-07 13:37:03 +00:00
|
|
|
bool contains(Address pc) const {
|
2020-04-06 12:30:15 +00:00
|
|
|
return reinterpret_cast<Address>(instructions_) <= pc &&
|
|
|
|
pc < reinterpret_cast<Address>(instructions_ + instructions_size_);
|
2018-05-07 13:37:03 +00:00
|
|
|
}
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2020-03-05 15:35:20 +00:00
|
|
|
Vector<const uint8_t> protected_instructions_data() const {
|
|
|
|
return {meta_data_.get(),
|
|
|
|
static_cast<size_t>(protected_instructions_size_)};
|
|
|
|
}
|
|
|
|
|
|
|
|
Vector<const trap_handler::ProtectedInstructionData> protected_instructions()
|
2018-06-27 10:26:30 +00:00
|
|
|
const {
|
2020-03-05 15:35:20 +00:00
|
|
|
return Vector<const trap_handler::ProtectedInstructionData>::cast(
|
|
|
|
protected_instructions_data());
|
2017-11-20 21:34:04 +00:00
|
|
|
}
|
|
|
|
|
2018-05-24 10:49:13 +00:00
|
|
|
void Validate() const;
|
2018-06-22 11:41:06 +00:00
|
|
|
void Print(const char* name = nullptr) const;
|
2019-01-16 15:29:52 +00:00
|
|
|
void MaybePrint(const char* name = nullptr) const;
|
2018-06-22 11:41:06 +00:00
|
|
|
void Disassemble(const char* name, std::ostream& os,
|
2018-04-23 07:21:06 +00:00
|
|
|
Address current_pc = kNullAddress) const;
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2018-03-22 12:24:51 +00:00
|
|
|
static bool ShouldBeLogged(Isolate* isolate);
|
|
|
|
void LogCode(Isolate* isolate) const;
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
~WasmCode();
|
|
|
|
|
2019-03-25 12:23:37 +00:00
|
|
|
void IncRef() {
|
2019-05-03 09:52:20 +00:00
|
|
|
int old_val = ref_count_.fetch_add(1, std::memory_order_acq_rel);
|
2019-03-25 12:23:37 +00:00
|
|
|
DCHECK_LE(1, old_val);
|
|
|
|
DCHECK_GT(kMaxInt, old_val);
|
|
|
|
USE(old_val);
|
|
|
|
}
|
|
|
|
|
2019-04-09 14:00:09 +00:00
|
|
|
// Decrement the ref count. Returns whether this code becomes dead and needs
|
|
|
|
// to be freed.
|
2019-03-25 12:23:37 +00:00
|
|
|
V8_WARN_UNUSED_RESULT bool DecRef() {
|
2019-05-03 09:52:20 +00:00
|
|
|
int old_count = ref_count_.load(std::memory_order_acquire);
|
2019-04-09 14:00:09 +00:00
|
|
|
while (true) {
|
|
|
|
DCHECK_LE(1, old_count);
|
|
|
|
if (V8_UNLIKELY(old_count == 1)) return DecRefOnPotentiallyDeadCode();
|
|
|
|
if (ref_count_.compare_exchange_weak(old_count, old_count - 1,
|
2019-05-03 09:52:20 +00:00
|
|
|
std::memory_order_acq_rel)) {
|
2019-04-09 14:00:09 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2019-03-25 12:23:37 +00:00
|
|
|
}
|
|
|
|
|
2019-05-03 08:50:51 +00:00
|
|
|
// Decrement the ref count on code that is known to be dead, even though there
|
|
|
|
// might still be C++ references. Returns whether this drops the last
|
|
|
|
// reference and the code needs to be freed.
|
|
|
|
V8_WARN_UNUSED_RESULT bool DecRefOnDeadCode() {
|
2019-05-03 09:52:20 +00:00
|
|
|
return ref_count_.fetch_sub(1, std::memory_order_acq_rel) == 1;
|
2019-05-03 08:50:51 +00:00
|
|
|
}
|
|
|
|
|
2019-04-09 14:00:09 +00:00
|
|
|
// Decrement the ref count on a set of {WasmCode} objects, potentially
|
|
|
|
// belonging to different {NativeModule}s. Dead code will be deleted.
|
2019-04-29 08:24:11 +00:00
|
|
|
static void DecrementRefCount(Vector<WasmCode* const>);
|
2019-04-01 15:28:09 +00:00
|
|
|
|
2020-04-03 13:11:39 +00:00
|
|
|
// Returns the last source position before {offset}.
|
|
|
|
int GetSourcePositionBefore(int offset);
|
|
|
|
|
2020-04-14 10:47:00 +00:00
|
|
|
// Returns whether this code was generated for debugging. If this returns
|
2020-04-16 16:31:46 +00:00
|
|
|
// {kForDebugging}, but {tier()} is not {kLiftoff}, then Liftoff compilation
|
|
|
|
// bailed out.
|
|
|
|
ForDebugging for_debugging() const {
|
|
|
|
return ForDebuggingField::decode(flags_);
|
|
|
|
}
|
2020-04-14 10:47:00 +00:00
|
|
|
|
2018-03-22 11:20:00 +00:00
|
|
|
enum FlushICache : bool { kFlushICache = true, kNoFlushICache = false };
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
private:
|
|
|
|
friend class NativeModule;
|
|
|
|
|
2020-02-26 12:39:41 +00:00
|
|
|
WasmCode(NativeModule* native_module, int index, Vector<byte> instructions,
|
|
|
|
int stack_slots, int tagged_parameter_slots,
|
|
|
|
int safepoint_table_offset, int handler_table_offset,
|
|
|
|
int constant_pool_offset, int code_comments_offset,
|
|
|
|
int unpadded_binary_size,
|
2020-03-05 15:35:20 +00:00
|
|
|
Vector<const byte> protected_instructions_data,
|
|
|
|
Vector<const byte> reloc_info,
|
|
|
|
Vector<const byte> source_position_table, Kind kind,
|
2020-04-14 10:47:00 +00:00
|
|
|
ExecutionTier tier, ForDebugging for_debugging)
|
2020-04-06 12:30:15 +00:00
|
|
|
: native_module_(native_module),
|
|
|
|
instructions_(instructions.begin()),
|
2020-04-14 10:47:00 +00:00
|
|
|
flags_(KindField::encode(kind) | ExecutionTierField::encode(tier) |
|
|
|
|
ForDebuggingField::encode(for_debugging)),
|
2020-03-05 15:35:20 +00:00
|
|
|
meta_data_(ConcatenateBytes(
|
|
|
|
{protected_instructions_data, reloc_info, source_position_table})),
|
2020-04-06 12:30:15 +00:00
|
|
|
instructions_size_(instructions.length()),
|
2020-03-05 15:35:20 +00:00
|
|
|
reloc_info_size_(reloc_info.length()),
|
|
|
|
source_positions_size_(source_position_table.length()),
|
|
|
|
protected_instructions_size_(protected_instructions_data.length()),
|
2017-11-20 21:34:04 +00:00
|
|
|
index_(index),
|
|
|
|
constant_pool_offset_(constant_pool_offset),
|
|
|
|
stack_slots_(stack_slots),
|
2019-01-21 16:38:01 +00:00
|
|
|
tagged_parameter_slots_(tagged_parameter_slots),
|
2017-11-20 21:34:04 +00:00
|
|
|
safepoint_table_offset_(safepoint_table_offset),
|
2018-02-27 09:23:48 +00:00
|
|
|
handler_table_offset_(handler_table_offset),
|
2018-12-13 19:30:56 +00:00
|
|
|
code_comments_offset_(code_comments_offset),
|
2020-04-06 12:30:15 +00:00
|
|
|
unpadded_binary_size_(unpadded_binary_size) {
|
2018-12-13 19:30:56 +00:00
|
|
|
DCHECK_LE(safepoint_table_offset, unpadded_binary_size);
|
|
|
|
DCHECK_LE(handler_table_offset, unpadded_binary_size);
|
|
|
|
DCHECK_LE(code_comments_offset, unpadded_binary_size);
|
|
|
|
DCHECK_LE(constant_pool_offset, unpadded_binary_size);
|
2018-03-20 16:14:55 +00:00
|
|
|
}
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2020-03-05 15:35:20 +00:00
|
|
|
std::unique_ptr<const byte[]> ConcatenateBytes(
|
|
|
|
std::initializer_list<Vector<const byte>>);
|
|
|
|
|
2018-04-06 13:27:34 +00:00
|
|
|
// Code objects that have been registered with the global trap handler within
|
|
|
|
// this process, will have a {trap_handler_index} associated with them.
|
2019-04-30 17:40:11 +00:00
|
|
|
int trap_handler_index() const {
|
|
|
|
CHECK(has_trap_handler_index());
|
|
|
|
return trap_handler_index_;
|
|
|
|
}
|
|
|
|
void set_trap_handler_index(int value) {
|
|
|
|
CHECK(!has_trap_handler_index());
|
|
|
|
trap_handler_index_ = value;
|
|
|
|
}
|
|
|
|
bool has_trap_handler_index() const { return trap_handler_index_ >= 0; }
|
2018-06-18 11:34:41 +00:00
|
|
|
|
|
|
|
// Register protected instruction information with the trap handler. Sets
|
|
|
|
// trap_handler_index.
|
|
|
|
void RegisterTrapHandlerData();
|
2018-04-06 13:27:34 +00:00
|
|
|
|
2019-04-09 14:00:09 +00:00
|
|
|
// Slow path for {DecRef}: The code becomes potentially dead.
|
|
|
|
// Returns whether this code becomes dead and needs to be freed.
|
2019-05-03 08:50:51 +00:00
|
|
|
V8_NOINLINE bool DecRefOnPotentiallyDeadCode();
|
2019-04-09 14:00:09 +00:00
|
|
|
|
2020-04-06 12:30:15 +00:00
|
|
|
NativeModule* const native_module_ = nullptr;
|
|
|
|
byte* const instructions_;
|
|
|
|
const uint8_t flags_; // Bit field, see below.
|
2020-03-05 15:35:20 +00:00
|
|
|
// {meta_data_} contains several byte vectors concatenated into one:
|
|
|
|
// - protected instructions data of size {protected_instructions_size_}
|
|
|
|
// - relocation info of size {reloc_info_size_}
|
|
|
|
// - source positions of size {source_positions_size_}
|
|
|
|
// Note that the protected instructions come first to ensure alignment.
|
|
|
|
std::unique_ptr<const byte[]> meta_data_;
|
2020-04-06 12:30:15 +00:00
|
|
|
const int instructions_size_;
|
2020-03-05 15:35:20 +00:00
|
|
|
const int reloc_info_size_;
|
|
|
|
const int source_positions_size_;
|
|
|
|
const int protected_instructions_size_;
|
2020-04-06 12:30:15 +00:00
|
|
|
const int index_;
|
|
|
|
const int constant_pool_offset_;
|
|
|
|
const int stack_slots_;
|
2019-01-21 16:38:01 +00:00
|
|
|
// Number of tagged parameters passed to this function via the stack. This
|
|
|
|
// value is used by the stack walker (e.g. GC) to find references.
|
2020-04-06 12:30:15 +00:00
|
|
|
const int tagged_parameter_slots_;
|
2020-02-26 12:39:41 +00:00
|
|
|
// We care about safepoint data for wasm-to-js functions, since there may be
|
|
|
|
// stack/register tagged values for large number conversions.
|
2020-04-06 12:30:15 +00:00
|
|
|
const int safepoint_table_offset_;
|
|
|
|
const int handler_table_offset_;
|
|
|
|
const int code_comments_offset_;
|
|
|
|
const int unpadded_binary_size_;
|
2019-04-30 17:40:11 +00:00
|
|
|
int trap_handler_index_ = -1;
|
2020-04-06 12:30:15 +00:00
|
|
|
|
|
|
|
// Bits encoded in {flags_}:
|
|
|
|
using KindField = base::BitField8<Kind, 0, 3>;
|
|
|
|
using ExecutionTierField = KindField::Next<ExecutionTier, 2>;
|
2020-04-16 16:31:46 +00:00
|
|
|
using ForDebuggingField = ExecutionTierField::Next<ForDebugging, 2>;
|
2018-03-21 13:00:04 +00:00
|
|
|
|
2019-03-25 12:23:37 +00:00
|
|
|
// WasmCode is ref counted. Counters are held by:
|
2019-04-18 18:54:23 +00:00
|
|
|
// 1) The jump table / code table.
|
|
|
|
// 2) {WasmCodeRefScope}s.
|
|
|
|
// 3) The set of potentially dead code in the {WasmEngine}.
|
|
|
|
// If a decrement of (1) would drop the ref count to 0, that code becomes a
|
|
|
|
// candidate for garbage collection. At that point, we add a ref count for (3)
|
|
|
|
// *before* decrementing the counter to ensure the code stays alive as long as
|
|
|
|
// it's being used. Once the ref count drops to zero (i.e. after being removed
|
|
|
|
// from (3) and all (2)), the code object is deleted and the memory for the
|
|
|
|
// machine code is freed.
|
2019-03-25 12:23:37 +00:00
|
|
|
std::atomic<int> ref_count_{1};
|
|
|
|
|
2018-03-21 13:00:04 +00:00
|
|
|
DISALLOW_COPY_AND_ASSIGN(WasmCode);
|
2017-11-20 21:34:04 +00:00
|
|
|
};
|
|
|
|
|
2020-02-26 12:39:41 +00:00
|
|
|
// Check that {WasmCode} objects are sufficiently small. We create many of them,
|
|
|
|
// often for rather small functions.
|
|
|
|
// Increase the limit if needed, but first check if the size increase is
|
|
|
|
// justified.
|
2020-04-06 12:30:15 +00:00
|
|
|
STATIC_ASSERT(sizeof(WasmCode) <= 88);
|
2020-02-26 12:39:41 +00:00
|
|
|
|
2019-06-05 08:53:37 +00:00
|
|
|
WasmCode::Kind GetCodeKind(const WasmCompilationResult& result);
|
|
|
|
|
2017-11-29 17:53:43 +00:00
|
|
|
// Return a textual description of the kind.
|
|
|
|
const char* GetWasmCodeKindAsString(WasmCode::Kind);
|
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
// Manages the code reservations and allocations of a single {NativeModule}.
|
|
|
|
class WasmCodeAllocator {
|
|
|
|
public:
|
2019-10-07 13:37:10 +00:00
|
|
|
// {OptionalLock} is passed between {WasmCodeAllocator} and {NativeModule} to
|
|
|
|
// indicate that the lock on the {WasmCodeAllocator} is already taken. It's
|
|
|
|
// optional to allow to also call methods without holding the lock.
|
|
|
|
class OptionalLock {
|
|
|
|
public:
|
|
|
|
// External users can only instantiate a non-locked {OptionalLock}.
|
|
|
|
OptionalLock() = default;
|
|
|
|
~OptionalLock();
|
|
|
|
bool is_locked() const { return allocator_ != nullptr; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
friend class WasmCodeAllocator;
|
|
|
|
// {Lock} is called from the {WasmCodeAllocator} if no locked {OptionalLock}
|
|
|
|
// is passed.
|
|
|
|
void Lock(WasmCodeAllocator*);
|
|
|
|
|
|
|
|
WasmCodeAllocator* allocator_ = nullptr;
|
|
|
|
};
|
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
WasmCodeAllocator(WasmCodeManager*, VirtualMemory code_space,
|
2019-07-17 12:38:43 +00:00
|
|
|
std::shared_ptr<Counters> async_counters);
|
2019-05-13 12:27:48 +00:00
|
|
|
~WasmCodeAllocator();
|
|
|
|
|
2019-10-07 13:37:10 +00:00
|
|
|
// Call before use, after the {NativeModule} is set up completely.
|
|
|
|
void Init(NativeModule*);
|
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
size_t committed_code_space() const {
|
|
|
|
return committed_code_space_.load(std::memory_order_acquire);
|
|
|
|
}
|
|
|
|
size_t generated_code_size() const {
|
|
|
|
return generated_code_size_.load(std::memory_order_acquire);
|
|
|
|
}
|
|
|
|
size_t freed_code_size() const {
|
|
|
|
return freed_code_size_.load(std::memory_order_acquire);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Allocate code space. Returns a valid buffer or fails with OOM (crash).
|
|
|
|
Vector<byte> AllocateForCode(NativeModule*, size_t size);
|
|
|
|
|
2019-08-02 09:21:21 +00:00
|
|
|
// Allocate code space within a specific region. Returns a valid buffer or
|
|
|
|
// fails with OOM (crash).
|
|
|
|
Vector<byte> AllocateForCodeInRegion(NativeModule*, size_t size,
|
2019-10-07 13:37:10 +00:00
|
|
|
base::AddressRegion,
|
|
|
|
const WasmCodeAllocator::OptionalLock&);
|
2019-08-02 09:21:21 +00:00
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
// Sets permissions of all owned code space to executable, or read-write (if
|
|
|
|
// {executable} is false). Returns true on success.
|
|
|
|
V8_EXPORT_PRIVATE bool SetExecutable(bool executable);
|
|
|
|
|
|
|
|
// Free memory pages of all given code objects. Used for wasm code GC.
|
|
|
|
void FreeCode(Vector<WasmCode* const>);
|
|
|
|
|
2019-09-16 12:21:11 +00:00
|
|
|
// Retrieve the number of separately reserved code spaces.
|
|
|
|
size_t GetNumCodeSpaces() const;
|
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
private:
|
|
|
|
// The engine-wide wasm code manager.
|
|
|
|
WasmCodeManager* const code_manager_;
|
|
|
|
|
2019-10-07 13:37:10 +00:00
|
|
|
mutable base::Mutex mutex_;
|
2019-05-13 12:27:48 +00:00
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Protected by {mutex_}:
|
|
|
|
|
|
|
|
// Code space that was reserved and is available for allocations (subset of
|
|
|
|
// {owned_code_space_}).
|
|
|
|
DisjointAllocationPool free_code_space_;
|
|
|
|
// Code space that was allocated for code (subset of {owned_code_space_}).
|
|
|
|
DisjointAllocationPool allocated_code_space_;
|
|
|
|
// Code space that was allocated before but is dead now. Full pages within
|
2019-07-17 12:38:43 +00:00
|
|
|
// this region are discarded. It's still a subset of {owned_code_space_}.
|
2019-05-13 12:27:48 +00:00
|
|
|
DisjointAllocationPool freed_code_space_;
|
|
|
|
std::vector<VirtualMemory> owned_code_space_;
|
|
|
|
|
|
|
|
// End of fields protected by {mutex_}.
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
std::atomic<size_t> committed_code_space_{0};
|
|
|
|
std::atomic<size_t> generated_code_size_{0};
|
|
|
|
std::atomic<size_t> freed_code_size_{0};
|
|
|
|
|
|
|
|
bool is_executable_ = false;
|
|
|
|
|
2019-07-17 12:38:43 +00:00
|
|
|
std::shared_ptr<Counters> async_counters_;
|
2019-05-13 12:27:48 +00:00
|
|
|
};
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
class V8_EXPORT_PRIVATE NativeModule final {
|
|
|
|
public:
|
2018-06-28 13:23:24 +00:00
|
|
|
#if V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_S390X || V8_TARGET_ARCH_ARM64
|
2019-09-11 10:32:51 +00:00
|
|
|
static constexpr bool kNeedsFarJumpsBetweenCodeSpaces = true;
|
2018-06-28 13:23:24 +00:00
|
|
|
#else
|
2019-09-11 10:32:51 +00:00
|
|
|
static constexpr bool kNeedsFarJumpsBetweenCodeSpaces = false;
|
2018-06-28 13:23:24 +00:00
|
|
|
#endif
|
|
|
|
|
2018-09-21 12:00:23 +00:00
|
|
|
// {AddCode} is thread safe w.r.t. other calls to {AddCode} or methods adding
|
|
|
|
// code below, i.e. it can be called concurrently from background threads.
|
[wasm] Split adding code from publishing it
This prepares a refactoring to add and publish compilation results in
batches. For this, we need to separate the two phases, so that we can
lock the module, allocate all the code space, release the lock, copy
the code, lock the module, publish the code, and release the lock
again.
In particular, this CL does the following:
1) It removes the {AddOwnedCode} method. The functionality of creating
the {WasmCode} and memcpy'ing the instruction into that is done in
the other {Add*Code} methods. Adding to {owned_code_} is done in
{PublishCode}.
2) {PublishInterpreterEntry} is now functionally equivalent to
{PublishCode}, so it's removed.
3) After {AddCode}, the caller has to call {PublishCode}. In a
follow-up CL, this will be called in batches (first {AddCode} them
all, then {PublishCode} them all).
4) {AddCompiledCode} now assumes that the {WasmCompilationResult}
succeeded. Otherwise, the caller should directly call {SetError} on
the {CompilationState}.
5) {PublishCode} is now the chokepoint for installing code to the code
table, the owned code vector, the jump table, and setting interpreter
redirections. It replaces previous direct calls to {InstallCode} or
explicitly adding to {owned_code_}.
6) Increasing the {generated_code_size_} counter is now done in
{AllocateForCode}, which is the chokepoint for allocating space for
generated code. This way, we will only increase this counter once
once we allocate in batches.
R=titzer@chromium.org
Bug: v8:8916
Change-Id: I71e02e3a838f21797915cee3ebd373804fb12237
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1530817
Commit-Queue: Clemens Hammacher <clemensh@chromium.org>
Reviewed-by: Ben Titzer <titzer@chromium.org>
Cr-Commit-Position: refs/heads/master@{#60369}
2019-03-20 13:04:33 +00:00
|
|
|
// The returned code still needs to be published via {PublishCode}.
|
2020-03-05 15:35:20 +00:00
|
|
|
std::unique_ptr<WasmCode> AddCode(int index, const CodeDesc& desc,
|
|
|
|
int stack_slots, int tagged_parameter_slots,
|
|
|
|
Vector<const byte> protected_instructions,
|
|
|
|
Vector<const byte> source_position_table,
|
2020-04-14 10:47:00 +00:00
|
|
|
WasmCode::Kind kind, ExecutionTier tier,
|
|
|
|
ForDebugging for_debugging);
|
[wasm] Split adding code from publishing it
This prepares a refactoring to add and publish compilation results in
batches. For this, we need to separate the two phases, so that we can
lock the module, allocate all the code space, release the lock, copy
the code, lock the module, publish the code, and release the lock
again.
In particular, this CL does the following:
1) It removes the {AddOwnedCode} method. The functionality of creating
the {WasmCode} and memcpy'ing the instruction into that is done in
the other {Add*Code} methods. Adding to {owned_code_} is done in
{PublishCode}.
2) {PublishInterpreterEntry} is now functionally equivalent to
{PublishCode}, so it's removed.
3) After {AddCode}, the caller has to call {PublishCode}. In a
follow-up CL, this will be called in batches (first {AddCode} them
all, then {PublishCode} them all).
4) {AddCompiledCode} now assumes that the {WasmCompilationResult}
succeeded. Otherwise, the caller should directly call {SetError} on
the {CompilationState}.
5) {PublishCode} is now the chokepoint for installing code to the code
table, the owned code vector, the jump table, and setting interpreter
redirections. It replaces previous direct calls to {InstallCode} or
explicitly adding to {owned_code_}.
6) Increasing the {generated_code_size_} counter is now done in
{AllocateForCode}, which is the chokepoint for allocating space for
generated code. This way, we will only increase this counter once
once we allocate in batches.
R=titzer@chromium.org
Bug: v8:8916
Change-Id: I71e02e3a838f21797915cee3ebd373804fb12237
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1530817
Commit-Queue: Clemens Hammacher <clemensh@chromium.org>
Reviewed-by: Ben Titzer <titzer@chromium.org>
Cr-Commit-Position: refs/heads/master@{#60369}
2019-03-20 13:04:33 +00:00
|
|
|
|
|
|
|
// {PublishCode} makes the code available to the system by entering it into
|
|
|
|
// the code table and patching the jump table. It returns a raw pointer to the
|
2020-04-03 09:35:33 +00:00
|
|
|
// given {WasmCode} object. Ownership is transferred to the {NativeModule}.
|
2019-04-05 10:36:06 +00:00
|
|
|
WasmCode* PublishCode(std::unique_ptr<WasmCode>);
|
2020-04-03 09:35:33 +00:00
|
|
|
std::vector<WasmCode*> PublishCode(Vector<std::unique_ptr<WasmCode>>);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2018-06-28 09:45:22 +00:00
|
|
|
WasmCode* AddDeserializedCode(
|
2020-02-26 12:39:41 +00:00
|
|
|
int index, Vector<const byte> instructions, int stack_slots,
|
|
|
|
int tagged_parameter_slots, int safepoint_table_offset,
|
|
|
|
int handler_table_offset, int constant_pool_offset,
|
|
|
|
int code_comments_offset, int unpadded_binary_size,
|
2020-03-05 15:35:20 +00:00
|
|
|
Vector<const byte> protected_instructions_data,
|
|
|
|
Vector<const byte> reloc_info, Vector<const byte> source_position_table,
|
|
|
|
WasmCode::Kind kind, ExecutionTier tier);
|
2018-06-28 09:45:22 +00:00
|
|
|
|
2018-09-21 12:00:23 +00:00
|
|
|
// Adds anonymous code for testing purposes.
|
|
|
|
WasmCode* AddCodeForTesting(Handle<Code> code);
|
|
|
|
|
2019-04-30 14:29:56 +00:00
|
|
|
// Use {UseLazyStub} to setup lazy compilation per function. It will use the
|
|
|
|
// existing {WasmCode::kWasmCompileLazy} runtime stub and populate the jump
|
|
|
|
// table with trampolines accordingly.
|
2019-04-02 09:23:45 +00:00
|
|
|
void UseLazyStub(uint32_t func_index);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2018-08-01 11:04:55 +00:00
|
|
|
// Creates a snapshot of the current state of the code table. This is useful
|
|
|
|
// to get a consistent view of the table (e.g. used by the serializer).
|
|
|
|
std::vector<WasmCode*> SnapshotCodeTable() const;
|
|
|
|
|
2019-04-15 11:27:57 +00:00
|
|
|
WasmCode* GetCode(uint32_t index) const;
|
|
|
|
bool HasCode(uint32_t index) const;
|
2020-02-05 17:32:47 +00:00
|
|
|
bool HasCodeWithTier(uint32_t index, ExecutionTier tier) const;
|
2018-05-15 17:08:44 +00:00
|
|
|
|
2019-08-24 06:44:39 +00:00
|
|
|
void SetWasmSourceMap(std::unique_ptr<WasmModuleSourceMap> source_map);
|
|
|
|
WasmModuleSourceMap* GetWasmSourceMap() const;
|
|
|
|
|
2018-07-06 14:27:20 +00:00
|
|
|
Address jump_table_start() const {
|
2019-08-05 16:05:37 +00:00
|
|
|
return main_jump_table_ ? main_jump_table_->instruction_start()
|
|
|
|
: kNullAddress;
|
2018-07-06 14:27:20 +00:00
|
|
|
}
|
|
|
|
|
2019-07-19 13:20:25 +00:00
|
|
|
uint32_t GetJumpTableOffset(uint32_t func_index) const;
|
2018-08-07 10:33:50 +00:00
|
|
|
|
2019-08-05 16:05:37 +00:00
|
|
|
// Returns the canonical target to call for the given function (the slot in
|
|
|
|
// the first jump table).
|
2018-06-19 09:47:17 +00:00
|
|
|
Address GetCallTargetForFunction(uint32_t func_index) const;
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-10-04 12:52:31 +00:00
|
|
|
struct JumpTablesRef {
|
2020-02-17 15:12:56 +00:00
|
|
|
const Address jump_table_start = kNullAddress;
|
|
|
|
const Address far_jump_table_start = kNullAddress;
|
|
|
|
|
|
|
|
bool is_valid() const { return far_jump_table_start != kNullAddress; }
|
2019-10-04 12:52:31 +00:00
|
|
|
};
|
|
|
|
|
2020-02-17 15:12:56 +00:00
|
|
|
// Finds the jump tables that should be used for given code region. This
|
2019-10-04 12:52:31 +00:00
|
|
|
// information is then passed to {GetNearCallTargetForFunction} and
|
|
|
|
// {GetNearRuntimeStubEntry} to avoid the overhead of looking this information
|
2020-02-17 15:12:56 +00:00
|
|
|
// up there. Return an empty struct if no suitable jump tables exist.
|
|
|
|
JumpTablesRef FindJumpTablesForRegion(base::AddressRegion) const;
|
2019-10-04 12:52:31 +00:00
|
|
|
|
|
|
|
// Similarly to {GetCallTargetForFunction}, but uses the jump table previously
|
2020-02-17 15:12:56 +00:00
|
|
|
// looked up via {FindJumpTablesForRegion}.
|
2019-09-13 13:14:37 +00:00
|
|
|
Address GetNearCallTargetForFunction(uint32_t func_index,
|
2019-10-04 12:52:31 +00:00
|
|
|
const JumpTablesRef&) const;
|
2019-09-13 13:14:37 +00:00
|
|
|
|
2019-10-04 12:52:31 +00:00
|
|
|
// Get a runtime stub entry (which is a far jump table slot) in the jump table
|
2020-02-17 15:12:56 +00:00
|
|
|
// previously looked up via {FindJumpTablesForRegion}.
|
2019-09-11 14:31:23 +00:00
|
|
|
Address GetNearRuntimeStubEntry(WasmCode::RuntimeStubId index,
|
2019-10-04 12:52:31 +00:00
|
|
|
const JumpTablesRef&) const;
|
2019-09-11 14:31:23 +00:00
|
|
|
|
2019-09-13 13:14:37 +00:00
|
|
|
// Reverse lookup from a given call target (which must be a jump table slot)
|
|
|
|
// to a function index.
|
2018-08-17 12:35:29 +00:00
|
|
|
uint32_t GetFunctionIndexFromJumpTableSlot(Address slot_address) const;
|
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
bool SetExecutable(bool executable) {
|
|
|
|
return code_allocator_.SetExecutable(executable);
|
|
|
|
}
|
2017-12-04 16:41:22 +00:00
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
// For cctests, where we build both WasmModule and the runtime objects
|
|
|
|
// on the fly, and bypass the instance builder pipeline.
|
2018-06-04 12:01:49 +00:00
|
|
|
void ReserveCodeTableForTesting(uint32_t max_functions);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2018-06-15 12:00:30 +00:00
|
|
|
void LogWasmCodes(Isolate* isolate);
|
|
|
|
|
2018-03-19 09:22:23 +00:00
|
|
|
CompilationState* compilation_state() { return compilation_state_.get(); }
|
|
|
|
|
2019-01-23 11:49:36 +00:00
|
|
|
// Create a {CompilationEnv} object for compilation. The caller has to ensure
|
|
|
|
// that the {WasmModule} pointer stays valid while the {CompilationEnv} is
|
|
|
|
// being used.
|
2018-10-23 11:56:12 +00:00
|
|
|
CompilationEnv CreateCompilationEnv() const;
|
2018-10-23 11:43:07 +00:00
|
|
|
|
2018-06-28 13:23:24 +00:00
|
|
|
uint32_t num_functions() const {
|
|
|
|
return module_->num_declared_functions + module_->num_imported_functions;
|
|
|
|
}
|
|
|
|
uint32_t num_imported_functions() const {
|
|
|
|
return module_->num_imported_functions;
|
|
|
|
}
|
2018-10-23 11:39:15 +00:00
|
|
|
UseTrapHandler use_trap_handler() const { return use_trap_handler_; }
|
2018-04-30 14:47:44 +00:00
|
|
|
void set_lazy_compile_frozen(bool frozen) { lazy_compile_frozen_ = frozen; }
|
|
|
|
bool lazy_compile_frozen() const { return lazy_compile_frozen_; }
|
2019-01-21 13:52:01 +00:00
|
|
|
Vector<const uint8_t> wire_bytes() const { return wire_bytes_->as_vector(); }
|
2018-06-28 16:31:31 +00:00
|
|
|
const WasmModule* module() const { return module_.get(); }
|
2019-01-23 11:49:36 +00:00
|
|
|
std::shared_ptr<const WasmModule> shared_module() const { return module_; }
|
2019-05-13 12:27:48 +00:00
|
|
|
size_t committed_code_space() const {
|
|
|
|
return code_allocator_.committed_code_space();
|
|
|
|
}
|
2019-02-05 12:54:32 +00:00
|
|
|
WasmEngine* engine() const { return engine_; }
|
2018-04-30 14:47:44 +00:00
|
|
|
|
2019-01-21 13:52:01 +00:00
|
|
|
void SetWireBytes(OwnedVector<const uint8_t> wire_bytes);
|
2018-11-07 10:27:10 +00:00
|
|
|
|
2018-06-19 09:47:17 +00:00
|
|
|
WasmCode* Lookup(Address) const;
|
|
|
|
|
2018-10-10 12:22:19 +00:00
|
|
|
WasmImportWrapperCache* import_wrapper_cache() const {
|
|
|
|
return import_wrapper_cache_.get();
|
|
|
|
}
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
~NativeModule();
|
|
|
|
|
2018-08-08 14:54:44 +00:00
|
|
|
const WasmFeatures& enabled_features() const { return enabled_features_; }
|
|
|
|
|
2019-09-11 14:31:23 +00:00
|
|
|
// Returns the runtime stub id that corresponds to the given address (which
|
|
|
|
// must be a far jump table slot). Returns {kRuntimeStubCount} on failure.
|
|
|
|
WasmCode::RuntimeStubId GetRuntimeStubId(Address runtime_stub_target) const;
|
|
|
|
|
2019-03-11 12:08:14 +00:00
|
|
|
// Sample the current code size of this modules to the given counters.
|
2019-03-11 14:51:56 +00:00
|
|
|
enum CodeSamplingTime : int8_t { kAfterBaseline, kAfterTopTier, kSampling };
|
2019-03-11 12:08:14 +00:00
|
|
|
void SampleCodeSize(Counters*, CodeSamplingTime) const;
|
|
|
|
|
2020-04-03 09:35:33 +00:00
|
|
|
V8_WARN_UNUSED_RESULT std::unique_ptr<WasmCode> AddCompiledCode(
|
|
|
|
WasmCompilationResult);
|
|
|
|
V8_WARN_UNUSED_RESULT std::vector<std::unique_ptr<WasmCode>> AddCompiledCode(
|
|
|
|
Vector<WasmCompilationResult>);
|
2019-03-19 12:52:04 +00:00
|
|
|
|
2019-04-26 13:17:37 +00:00
|
|
|
// Allows to check whether a function has been redirected to the interpreter
|
|
|
|
// by publishing an entry stub with the {Kind::kInterpreterEntry} code kind.
|
|
|
|
bool IsRedirectedToInterpreter(uint32_t func_index);
|
|
|
|
|
2020-04-16 11:16:24 +00:00
|
|
|
// Set to tiered down state. Returns {true} if this caused a change, {false}
|
|
|
|
// otherwise.
|
2020-02-18 18:14:00 +00:00
|
|
|
bool SetTieredDown();
|
|
|
|
bool IsTieredDown();
|
|
|
|
|
2020-01-07 17:42:18 +00:00
|
|
|
// Sets the flag, triggers recompilation of all methods to tier down or up,
|
|
|
|
// waits for that to complete.
|
|
|
|
void TierDown(Isolate* isolate);
|
|
|
|
void TierUp(Isolate* isolate);
|
|
|
|
|
2019-03-25 12:23:37 +00:00
|
|
|
// Free a set of functions of this module. Uncommits whole pages if possible.
|
|
|
|
// The given vector must be ordered by the instruction start address, and all
|
|
|
|
// {WasmCode} objects must not be used any more.
|
2019-04-29 08:24:11 +00:00
|
|
|
// Should only be called via {WasmEngine::FreeDeadCode}, so the engine can do
|
|
|
|
// its accounting.
|
2019-03-25 12:23:37 +00:00
|
|
|
void FreeCode(Vector<WasmCode* const>);
|
|
|
|
|
2019-09-16 12:21:11 +00:00
|
|
|
// Retrieve the number of separately reserved code spaces for this module.
|
|
|
|
size_t GetNumberOfCodeSpacesForTesting() const;
|
|
|
|
|
2019-12-27 15:17:44 +00:00
|
|
|
// Get or create the debug info for this NativeModule.
|
|
|
|
DebugInfo* GetDebugInfo();
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
private:
|
2018-06-13 13:28:41 +00:00
|
|
|
friend class WasmCode;
|
2019-08-05 16:05:37 +00:00
|
|
|
friend class WasmCodeAllocator;
|
2017-11-20 21:34:04 +00:00
|
|
|
friend class WasmCodeManager;
|
2018-02-21 11:42:57 +00:00
|
|
|
friend class NativeModuleModificationScope;
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-08-05 16:05:37 +00:00
|
|
|
struct CodeSpaceData {
|
|
|
|
base::AddressRegion region;
|
|
|
|
WasmCode* jump_table;
|
2019-09-11 14:31:23 +00:00
|
|
|
WasmCode* far_jump_table;
|
2019-08-05 16:05:37 +00:00
|
|
|
};
|
|
|
|
|
2019-03-12 16:10:58 +00:00
|
|
|
// Private constructor, called via {WasmCodeManager::NewNativeModule()}.
|
2019-02-05 12:54:32 +00:00
|
|
|
NativeModule(WasmEngine* engine, const WasmFeatures& enabled_features,
|
2020-01-30 15:16:13 +00:00
|
|
|
VirtualMemory code_space,
|
2019-02-04 13:37:05 +00:00
|
|
|
std::shared_ptr<const WasmModule> module,
|
2019-03-12 16:10:58 +00:00
|
|
|
std::shared_ptr<Counters> async_counters,
|
|
|
|
std::shared_ptr<NativeModule>* shared_this);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-03-20 13:05:25 +00:00
|
|
|
std::unique_ptr<WasmCode> AddCodeWithCodeSpace(
|
2020-02-26 12:39:41 +00:00
|
|
|
int index, const CodeDesc& desc, int stack_slots,
|
|
|
|
int tagged_parameter_slots,
|
2020-03-05 15:35:20 +00:00
|
|
|
Vector<const byte> protected_instructions_data,
|
|
|
|
Vector<const byte> source_position_table, WasmCode::Kind kind,
|
2020-04-14 10:47:00 +00:00
|
|
|
ExecutionTier tier, ForDebugging for_debugging,
|
|
|
|
Vector<uint8_t> code_space, const JumpTablesRef& jump_tables_ref);
|
2019-03-20 13:05:25 +00:00
|
|
|
|
2019-10-07 13:37:10 +00:00
|
|
|
WasmCode* CreateEmptyJumpTableInRegion(
|
2020-02-26 12:39:41 +00:00
|
|
|
int jump_table_size, base::AddressRegion,
|
2019-10-07 13:37:10 +00:00
|
|
|
const WasmCodeAllocator::OptionalLock&);
|
2018-06-19 09:47:17 +00:00
|
|
|
|
2019-09-16 12:16:34 +00:00
|
|
|
// Hold the {allocation_mutex_} when calling one of these methods.
|
2019-09-19 15:13:45 +00:00
|
|
|
// {slot_index} is the index in the declared functions, i.e. function index
|
|
|
|
// minus the number of imported functions.
|
|
|
|
void PatchJumpTablesLocked(uint32_t slot_index, Address target);
|
|
|
|
void PatchJumpTableLocked(const CodeSpaceData&, uint32_t slot_index,
|
2019-09-16 12:16:34 +00:00
|
|
|
Address target);
|
2019-09-11 13:49:04 +00:00
|
|
|
|
2019-08-05 16:05:37 +00:00
|
|
|
// Called by the {WasmCodeAllocator} to register a new code space.
|
2019-10-07 13:37:10 +00:00
|
|
|
void AddCodeSpace(base::AddressRegion,
|
|
|
|
const WasmCodeAllocator::OptionalLock&);
|
2019-08-05 16:05:37 +00:00
|
|
|
|
2020-04-03 09:35:33 +00:00
|
|
|
// Hold the {allocation_mutex_} when calling {PublishCodeLocked}.
|
|
|
|
WasmCode* PublishCodeLocked(std::unique_ptr<WasmCode>);
|
|
|
|
|
2019-04-26 13:17:37 +00:00
|
|
|
// Hold the {allocation_mutex_} when calling this method.
|
2018-10-15 14:07:47 +00:00
|
|
|
bool has_interpreter_redirection(uint32_t func_index) {
|
|
|
|
DCHECK_LT(func_index, num_functions());
|
|
|
|
DCHECK_LE(module_->num_imported_functions, func_index);
|
|
|
|
if (!interpreter_redirections_) return false;
|
2020-01-27 09:06:48 +00:00
|
|
|
uint32_t bitset_idx = declared_function_index(module(), func_index);
|
2018-10-15 14:07:47 +00:00
|
|
|
uint8_t byte = interpreter_redirections_[bitset_idx / kBitsPerByte];
|
|
|
|
return byte & (1 << (bitset_idx % kBitsPerByte));
|
|
|
|
}
|
|
|
|
|
2019-04-26 13:17:37 +00:00
|
|
|
// Hold the {allocation_mutex_} when calling this method.
|
2018-10-15 14:07:47 +00:00
|
|
|
void SetInterpreterRedirection(uint32_t func_index) {
|
|
|
|
DCHECK_LT(func_index, num_functions());
|
|
|
|
DCHECK_LE(module_->num_imported_functions, func_index);
|
|
|
|
if (!interpreter_redirections_) {
|
|
|
|
interpreter_redirections_.reset(
|
|
|
|
new uint8_t[RoundUp<kBitsPerByte>(module_->num_declared_functions) /
|
2019-03-20 09:40:09 +00:00
|
|
|
kBitsPerByte]{});
|
2018-10-15 14:07:47 +00:00
|
|
|
}
|
2020-01-27 09:06:48 +00:00
|
|
|
uint32_t bitset_idx = declared_function_index(module(), func_index);
|
2018-10-15 14:07:47 +00:00
|
|
|
uint8_t& byte = interpreter_redirections_[bitset_idx / kBitsPerByte];
|
|
|
|
byte |= 1 << (bitset_idx % kBitsPerByte);
|
|
|
|
}
|
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
// {WasmCodeAllocator} manages all code reservations and allocations for this
|
|
|
|
// {NativeModule}.
|
|
|
|
WasmCodeAllocator code_allocator_;
|
|
|
|
|
2018-08-08 14:54:44 +00:00
|
|
|
// Features enabled for this module. We keep a copy of the features that
|
|
|
|
// were enabled at the time of the creation of this native module,
|
|
|
|
// to be consistent across asynchronous compilations later.
|
|
|
|
const WasmFeatures enabled_features_;
|
|
|
|
|
2019-01-23 11:49:36 +00:00
|
|
|
// The decoded module, stored in a shared_ptr such that background compile
|
|
|
|
// tasks can keep this alive.
|
2018-06-28 13:23:24 +00:00
|
|
|
std::shared_ptr<const WasmModule> module_;
|
|
|
|
|
2019-08-24 06:44:39 +00:00
|
|
|
std::unique_ptr<WasmModuleSourceMap> source_map_;
|
|
|
|
|
2019-01-21 13:52:01 +00:00
|
|
|
// Wire bytes, held in a shared_ptr so they can be kept alive by the
|
|
|
|
// {WireBytesStorage}, held by background compile tasks.
|
|
|
|
std::shared_ptr<OwnedVector<const uint8_t>> wire_bytes_;
|
2018-06-22 14:34:47 +00:00
|
|
|
|
2020-03-16 13:04:46 +00:00
|
|
|
// The first allocated jump table. Always used by external calls (from JS).
|
|
|
|
// Wasm calls might use one of the other jump tables stored in
|
|
|
|
// {code_space_data_}.
|
2019-08-05 16:05:37 +00:00
|
|
|
WasmCode* main_jump_table_ = nullptr;
|
2018-06-19 09:47:17 +00:00
|
|
|
|
2020-03-16 13:04:46 +00:00
|
|
|
// The first allocated far jump table.
|
|
|
|
WasmCode* main_far_jump_table_ = nullptr;
|
|
|
|
|
2019-07-12 12:05:34 +00:00
|
|
|
// Lazy compile stub table, containing entries to jump to the
|
|
|
|
// {WasmCompileLazy} builtin, passing the function index.
|
|
|
|
WasmCode* lazy_compile_table_ = nullptr;
|
|
|
|
|
2018-07-10 12:30:26 +00:00
|
|
|
// The compilation state keeps track of compilation tasks for this module.
|
|
|
|
// Note that its destructor blocks until all tasks are finished/aborted and
|
|
|
|
// hence needs to be destructed first when this native module dies.
|
2018-10-25 14:24:50 +00:00
|
|
|
std::unique_ptr<CompilationState> compilation_state_;
|
2018-03-19 09:22:23 +00:00
|
|
|
|
2018-10-10 12:22:19 +00:00
|
|
|
// A cache of the import wrappers, keyed on the kind and signature.
|
|
|
|
std::unique_ptr<WasmImportWrapperCache> import_wrapper_cache_;
|
|
|
|
|
2018-09-21 12:00:23 +00:00
|
|
|
// This mutex protects concurrent calls to {AddCode} and friends.
|
2018-07-10 12:30:26 +00:00
|
|
|
mutable base::Mutex allocation_mutex_;
|
|
|
|
|
2018-09-21 12:00:23 +00:00
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Protected by {allocation_mutex_}:
|
|
|
|
|
2019-05-03 10:41:55 +00:00
|
|
|
// Holds all allocated code objects. For lookup based on pc, the key is the
|
|
|
|
// instruction start address of the value.
|
|
|
|
std::map<Address, std::unique_ptr<WasmCode>> owned_code_;
|
2018-09-21 12:00:23 +00:00
|
|
|
|
2019-09-16 12:16:34 +00:00
|
|
|
// Table of the latest code object per function, updated on initial
|
2019-09-19 15:13:45 +00:00
|
|
|
// compilation and tier up. The number of entries is
|
|
|
|
// {WasmModule::num_declared_functions}, i.e. there are no entries for
|
|
|
|
// imported functions.
|
2019-09-16 12:16:34 +00:00
|
|
|
std::unique_ptr<WasmCode*[]> code_table_;
|
2018-09-21 12:00:23 +00:00
|
|
|
|
2018-10-15 14:07:47 +00:00
|
|
|
// Null if no redirections exist, otherwise a bitset over all functions in
|
|
|
|
// this module marking those functions that have been redirected.
|
|
|
|
std::unique_ptr<uint8_t[]> interpreter_redirections_;
|
|
|
|
|
2019-08-05 16:05:37 +00:00
|
|
|
// Data (especially jump table) per code space.
|
|
|
|
std::vector<CodeSpaceData> code_space_data_;
|
|
|
|
|
2019-12-27 15:17:44 +00:00
|
|
|
// Debug information for this module. You only need to hold the allocation
|
|
|
|
// mutex while getting the {DebugInfo} pointer, or initializing this field.
|
|
|
|
// Further accesses to the {DebugInfo} do not need to be protected by the
|
|
|
|
// mutex.
|
|
|
|
std::unique_ptr<DebugInfo> debug_info_;
|
|
|
|
|
2020-04-16 11:16:24 +00:00
|
|
|
TieringState tiering_state_ = kTieredUp;
|
|
|
|
|
2018-09-21 12:00:23 +00:00
|
|
|
// End of fields protected by {allocation_mutex_}.
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2019-01-25 10:35:37 +00:00
|
|
|
WasmEngine* const engine_;
|
2018-04-30 14:47:44 +00:00
|
|
|
int modification_scope_depth_ = 0;
|
2018-10-23 11:39:15 +00:00
|
|
|
UseTrapHandler use_trap_handler_ = kNoTrapHandler;
|
2018-04-30 14:47:44 +00:00
|
|
|
bool lazy_compile_frozen_ = false;
|
2018-03-21 13:00:04 +00:00
|
|
|
|
|
|
|
DISALLOW_COPY_AND_ASSIGN(NativeModule);
|
2017-11-20 21:34:04 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
class V8_EXPORT_PRIVATE WasmCodeManager final {
|
|
|
|
public:
|
2019-09-09 10:19:34 +00:00
|
|
|
explicit WasmCodeManager(size_t max_committed);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-04-09 10:52:48 +00:00
|
|
|
#ifdef DEBUG
|
|
|
|
~WasmCodeManager() {
|
|
|
|
// No more committed code space.
|
|
|
|
DCHECK_EQ(0, total_committed_code_space_.load());
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
Unwind V8 frames correctly on Windows ARM64
On Windows ARM64, OS stack walking does not work because the V8 ARM64 backend
doesn't emit unwinding info and also because it doesn't emit ABI compliant
stack frames. This was fixed for Windows X64 (https://crrev.com/c/1469329) and
documented below:
https://docs.google.com/document/d/1-wf50jFlii0c_Pr52lm2ZU-49m220nhYMrHDi3vXnh0
This problem can be fixed similarly for Windows ARM64 by observing that V8
frames usually all have the same prolog which maintains a chain via frame
pointer (fp or x29 register).
stp fp, lr, [sp, ...]
One exception is JSEntry which stops fp pointer chain and needs to be handled
specially.
So it is possible to define XDATA with UNWIND_CODE which specify how Windows
should walk through V8 dynamic frames. The same as X64, since V8 Code objects
are all allocated in the same code-range for an Isolate, it is possible to
register at most 2 XDATA and a group of PDATA entries to cover stack walking
for all the code generated inside that code-range. This is more than 1
PDATA/XDATA because according to the Windows ARM64 exeption handling document,
1 PDATA can cover less than 1MB code range (see below doc).
https://docs.microsoft.com/en-us/cpp/build/arm64-exception-handling
This PR implements stackwalk for Windows ARM64 to be on par with X64, including
embedded builtins, jitted code and wasm jitted code, but not including register
handler for handling exception only, because there is no backward compatibility
to maintain for Windows ARM64 which was released since 1709 windows build.
Bug: chromium:893460
Change-Id: Ic74cbdad8af5cf342185030a4c53796f12ea5429
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1701133
Reviewed-by: Michael Starzinger <mstarzinger@chromium.org>
Reviewed-by: Jakob Gruber <jgruber@chromium.org>
Commit-Queue: Jakob Gruber <jgruber@chromium.org>
Cr-Commit-Position: refs/heads/master@{#63002}
2019-07-27 06:36:52 +00:00
|
|
|
#if defined(V8_OS_WIN64)
|
2019-04-24 22:01:00 +00:00
|
|
|
bool CanRegisterUnwindInfoForNonABICompliantCodeRange() const;
|
Unwind V8 frames correctly on Windows ARM64
On Windows ARM64, OS stack walking does not work because the V8 ARM64 backend
doesn't emit unwinding info and also because it doesn't emit ABI compliant
stack frames. This was fixed for Windows X64 (https://crrev.com/c/1469329) and
documented below:
https://docs.google.com/document/d/1-wf50jFlii0c_Pr52lm2ZU-49m220nhYMrHDi3vXnh0
This problem can be fixed similarly for Windows ARM64 by observing that V8
frames usually all have the same prolog which maintains a chain via frame
pointer (fp or x29 register).
stp fp, lr, [sp, ...]
One exception is JSEntry which stops fp pointer chain and needs to be handled
specially.
So it is possible to define XDATA with UNWIND_CODE which specify how Windows
should walk through V8 dynamic frames. The same as X64, since V8 Code objects
are all allocated in the same code-range for an Isolate, it is possible to
register at most 2 XDATA and a group of PDATA entries to cover stack walking
for all the code generated inside that code-range. This is more than 1
PDATA/XDATA because according to the Windows ARM64 exeption handling document,
1 PDATA can cover less than 1MB code range (see below doc).
https://docs.microsoft.com/en-us/cpp/build/arm64-exception-handling
This PR implements stackwalk for Windows ARM64 to be on par with X64, including
embedded builtins, jitted code and wasm jitted code, but not including register
handler for handling exception only, because there is no backward compatibility
to maintain for Windows ARM64 which was released since 1709 windows build.
Bug: chromium:893460
Change-Id: Ic74cbdad8af5cf342185030a4c53796f12ea5429
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1701133
Reviewed-by: Michael Starzinger <mstarzinger@chromium.org>
Reviewed-by: Jakob Gruber <jgruber@chromium.org>
Commit-Queue: Jakob Gruber <jgruber@chromium.org>
Cr-Commit-Position: refs/heads/master@{#63002}
2019-07-27 06:36:52 +00:00
|
|
|
#endif // V8_OS_WIN64
|
2019-04-24 22:01:00 +00:00
|
|
|
|
2018-06-19 09:47:17 +00:00
|
|
|
NativeModule* LookupNativeModule(Address pc) const;
|
2017-11-20 21:34:04 +00:00
|
|
|
WasmCode* LookupCode(Address pc) const;
|
2019-04-09 10:52:48 +00:00
|
|
|
size_t committed_code_space() const {
|
|
|
|
return total_committed_code_space_.load();
|
|
|
|
}
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-11-13 14:29:16 +00:00
|
|
|
// Estimate the needed code space for a Liftoff function based on the size of
|
|
|
|
// the function body (wasm byte code).
|
|
|
|
static size_t EstimateLiftoffCodeSize(int body_size);
|
2019-11-07 17:16:45 +00:00
|
|
|
// Estimate the needed code space from a completely decoded module.
|
2019-11-12 11:57:59 +00:00
|
|
|
static size_t EstimateNativeModuleCodeSize(const WasmModule* module,
|
|
|
|
bool include_liftoff);
|
2019-11-07 18:46:58 +00:00
|
|
|
// Estimate the needed code space from the number of functions and total code
|
|
|
|
// section length.
|
|
|
|
static size_t EstimateNativeModuleCodeSize(int num_functions,
|
|
|
|
int num_imported_functions,
|
2019-11-12 11:57:59 +00:00
|
|
|
int code_section_length,
|
|
|
|
bool include_liftoff);
|
2019-11-07 17:16:45 +00:00
|
|
|
// Estimate the size of meta data needed for the NativeModule, excluding
|
|
|
|
// generated code. This data still be stored on the C++ heap.
|
|
|
|
static size_t EstimateNativeModuleMetaDataSize(const WasmModule* module);
|
2018-05-16 12:39:18 +00:00
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
private:
|
2019-05-13 12:27:48 +00:00
|
|
|
friend class WasmCodeAllocator;
|
2019-01-25 10:35:37 +00:00
|
|
|
friend class WasmEngine;
|
|
|
|
|
2019-03-12 16:10:58 +00:00
|
|
|
std::shared_ptr<NativeModule> NewNativeModule(
|
2019-01-25 10:35:37 +00:00
|
|
|
WasmEngine* engine, Isolate* isolate,
|
|
|
|
const WasmFeatures& enabled_features, size_t code_size_estimate,
|
2020-01-30 15:16:13 +00:00
|
|
|
std::shared_ptr<const WasmModule> module);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2018-09-17 08:49:40 +00:00
|
|
|
V8_WARN_UNUSED_RESULT VirtualMemory TryAllocate(size_t size,
|
|
|
|
void* hint = nullptr);
|
2019-05-16 13:17:28 +00:00
|
|
|
bool Commit(base::AddressRegion);
|
|
|
|
void Decommit(base::AddressRegion);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-05-13 12:27:48 +00:00
|
|
|
void FreeNativeModule(Vector<VirtualMemory> owned_code,
|
|
|
|
size_t committed_size);
|
2019-01-25 10:35:37 +00:00
|
|
|
|
2019-05-16 13:17:28 +00:00
|
|
|
void AssignRange(base::AddressRegion, NativeModule*);
|
2017-11-20 21:34:04 +00:00
|
|
|
|
2019-09-23 13:12:40 +00:00
|
|
|
const size_t max_committed_code_space_;
|
2019-04-24 22:01:00 +00:00
|
|
|
|
2019-08-01 09:08:07 +00:00
|
|
|
std::atomic<size_t> total_committed_code_space_{0};
|
2019-04-09 10:52:48 +00:00
|
|
|
// If the committed code space exceeds {critical_committed_code_space_}, then
|
|
|
|
// we trigger a GC before creating the next module. This value is set to the
|
|
|
|
// currently committed space plus 50% of the available code space on creation
|
|
|
|
// and updated after each GC.
|
|
|
|
std::atomic<size_t> critical_committed_code_space_;
|
|
|
|
|
2018-07-24 15:58:31 +00:00
|
|
|
mutable base::Mutex native_modules_mutex_;
|
2018-09-21 09:23:31 +00:00
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
// Protected by {native_modules_mutex_}:
|
|
|
|
|
2017-11-20 21:34:04 +00:00
|
|
|
std::map<Address, std::pair<Address, NativeModule*>> lookup_map_;
|
2018-09-21 09:23:31 +00:00
|
|
|
|
|
|
|
// End of fields protected by {native_modules_mutex_}.
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
2017-12-01 16:13:36 +00:00
|
|
|
|
2018-03-21 13:00:04 +00:00
|
|
|
DISALLOW_COPY_AND_ASSIGN(WasmCodeManager);
|
2017-11-20 21:34:04 +00:00
|
|
|
};
|
|
|
|
|
2017-12-04 16:41:22 +00:00
|
|
|
// Within the scope, the native_module is writable and not executable.
|
|
|
|
// At the scope's destruction, the native_module is executable and not writable.
|
|
|
|
// The states inside the scope and at the scope termination are irrespective of
|
|
|
|
// native_module's state when entering the scope.
|
|
|
|
// We currently mark the entire module's memory W^X:
|
|
|
|
// - for AOT, that's as efficient as it can be.
|
|
|
|
// - for Lazy, we don't have a heuristic for functions that may need patching,
|
|
|
|
// and even if we did, the resulting set of pages may be fragmented.
|
|
|
|
// Currently, we try and keep the number of syscalls low.
|
|
|
|
// - similar argument for debug time.
|
|
|
|
class NativeModuleModificationScope final {
|
|
|
|
public:
|
|
|
|
explicit NativeModuleModificationScope(NativeModule* native_module);
|
|
|
|
~NativeModuleModificationScope();
|
|
|
|
|
|
|
|
private:
|
|
|
|
NativeModule* native_module_;
|
|
|
|
};
|
|
|
|
|
2019-03-25 12:23:37 +00:00
|
|
|
// {WasmCodeRefScope}s form a perfect stack. New {WasmCode} pointers generated
|
|
|
|
// by e.g. creating new code or looking up code by its address are added to the
|
|
|
|
// top-most {WasmCodeRefScope}.
|
|
|
|
class V8_EXPORT_PRIVATE WasmCodeRefScope {
|
|
|
|
public:
|
|
|
|
WasmCodeRefScope();
|
|
|
|
~WasmCodeRefScope();
|
|
|
|
|
|
|
|
// Register a {WasmCode} reference in the current {WasmCodeRefScope}. Fails if
|
|
|
|
// there is no current scope.
|
|
|
|
static void AddRef(WasmCode*);
|
|
|
|
|
|
|
|
private:
|
|
|
|
WasmCodeRefScope* const previous_scope_;
|
|
|
|
std::unordered_set<WasmCode*> code_ptrs_;
|
|
|
|
|
|
|
|
DISALLOW_COPY_AND_ASSIGN(WasmCodeRefScope);
|
|
|
|
};
|
|
|
|
|
2019-03-25 12:24:27 +00:00
|
|
|
// Similarly to a global handle, a {GlobalWasmCodeRef} stores a single
|
|
|
|
// ref-counted pointer to a {WasmCode} object.
|
|
|
|
class GlobalWasmCodeRef {
|
|
|
|
public:
|
|
|
|
explicit GlobalWasmCodeRef(WasmCode* code,
|
|
|
|
std::shared_ptr<NativeModule> native_module)
|
|
|
|
: code_(code), native_module_(std::move(native_module)) {
|
|
|
|
code_->IncRef();
|
|
|
|
}
|
|
|
|
|
2019-04-29 08:24:11 +00:00
|
|
|
~GlobalWasmCodeRef() { WasmCode::DecrementRefCount({&code_, 1}); }
|
2019-03-25 12:24:27 +00:00
|
|
|
|
|
|
|
// Get a pointer to the contained {WasmCode} object. This is only guaranteed
|
|
|
|
// to exist as long as this {GlobalWasmCodeRef} exists.
|
|
|
|
WasmCode* code() const { return code_; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
WasmCode* const code_;
|
|
|
|
// Also keep the {NativeModule} alive.
|
|
|
|
const std::shared_ptr<NativeModule> native_module_;
|
|
|
|
DISALLOW_COPY_AND_ASSIGN(GlobalWasmCodeRef);
|
|
|
|
};
|
|
|
|
|
2020-04-02 16:12:03 +00:00
|
|
|
const char* GetRuntimeStubName(WasmCode::RuntimeStubId);
|
|
|
|
|
2017-09-16 05:22:38 +00:00
|
|
|
} // namespace wasm
|
|
|
|
} // namespace internal
|
|
|
|
} // namespace v8
|
2018-02-02 12:05:19 +00:00
|
|
|
|
|
|
|
#endif // V8_WASM_WASM_CODE_MANAGER_H_
|