/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
*
* Copyright 2016 Mozilla Foundation
*
* 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 "wasm/WasmValidate.h"
#include "mozilla/CheckedInt.h"
#include "mozilla/Span.h"
#include "mozilla/Utf8.h"
#include "js/Printf.h"
#include "js/String.h" // JS::MaxStringLength
#include "vm/JSContext.h"
#include "vm/Realm.h"
#include "wasm/WasmDump.h"
#include "wasm/WasmInitExpr.h"
#include "wasm/WasmOpIter.h"
#include "wasm/WasmTypeDecls.h"
using namespace js;
using namespace js::jit;
using namespace js::wasm;
using mozilla::AsChars;
using mozilla::CheckedInt;
using mozilla::IsUtf8;
using mozilla::Maybe;
using mozilla::Nothing;
using mozilla::Some;
using mozilla::Span;
// Misc helpers.
bool wasm::EncodeLocalEntries(Encoder& e,
const ValTypeVector& locals) {
if (locals.length() > MaxLocals) {
return false;
}
uint32_t numLocalEntries = 0;
if (locals.length()) {
ValType prev = locals[0];
numLocalEntries++;
for (ValType t : locals) {
if (t != prev) {
numLocalEntries++;
prev = t;
}
}
}
if (!e.writeVarU32(numLocalEntries)) {
return false;
}
if (numLocalEntries) {
ValType prev = locals[0];
uint32_t count = 1;
for (uint32_t i = 1; i < locals.length(); i++, count++) {
if (prev != locals[i]) {
if (!e.writeVarU32(count)) {
return false;
}
if (!e.writeValType(prev)) {
return false;
}
prev = locals[i];
count = 0;
}
}
if (!e.writeVarU32(count)) {
return false;
}
if (!e.writeValType(prev)) {
return false;
}
}
return true;
}
bool wasm::DecodeLocalEntriesWithParams(Decoder& d,
const CodeMetadata& codeMeta,
uint32_t funcIndex,
ValTypeVector* locals) {
uint32_t numLocalEntries;
if (!d.readVarU32(&numLocalEntries)) {
return d.fail(
"failed to read number of local entries");
}
if (!locals->appendAll(codeMeta.getFuncType(funcIndex).args())) {
return false;
}
for (uint32_t i = 0; i < numLocalEntries; i++) {
uint32_t count;
if (!d.readVarU32(&count)) {
return d.fail(
"failed to read local entry count");
}
if (MaxLocals - locals->length() < count) {
return d.fail(
"too many locals");
}
ValType type;
if (!d.readValType(*codeMeta.types, codeMeta.features(), &type)) {
return false;
}
if (!locals->appendN(type, count)) {
return false;
}
}
return true;
}
bool wasm::DecodeValidatedLocalEntries(
const TypeContext& types, Decoder& d,
ValTypeVector* locals) {
uint32_t numLocalEntries;
MOZ_ALWAYS_TRUE(d.readVarU32(&numLocalEntries));
for (uint32_t i = 0; i < numLocalEntries; i++) {
uint32_t count = d.uncheckedReadVarU32();
MOZ_ASSERT(MaxLocals - locals->length() >= count);
if (!locals->appendN(d.uncheckedReadValType(types), count)) {
return false;
}
}
return true;
}
bool wasm::CheckIsSubtypeOf(Decoder& d,
const CodeMetadata& codeMeta,
size_t opcodeOffset, ResultType subType,
ResultType superType) {
if (subType.length() != superType.length()) {
UniqueChars error(
JS_smprintf(
"type mismatch: expected %zu values, got %zu values",
superType.length(), subType.length()));
if (!error) {
return false;
}
MOZ_ASSERT(!ResultType::isSubTypeOf(subType, superType));
return d.fail(opcodeOffset, error.get());
}
for (uint32_t i = 0; i < subType.length(); i++) {
StorageType sub = subType[i].storageType();
StorageType super = superType[i].storageType();
if (!CheckIsSubtypeOf(d, codeMeta, opcodeOffset, sub, super)) {
MOZ_ASSERT(!ResultType::isSubTypeOf(subType, superType));
return false;
}
}
MOZ_ASSERT(ResultType::isSubTypeOf(subType, superType));
return true;
}
bool wasm::CheckIsSubtypeOf(Decoder& d,
const CodeMetadata& codeMeta,
size_t opcodeOffset, StorageType subType,
StorageType superType) {
if (StorageType::isSubTypeOf(subType, superType)) {
return true;
}
UniqueChars subText = ToString(subType, codeMeta.types);
if (!subText) {
return false;
}
UniqueChars superText = ToString(superType, codeMeta.types);
if (!superText) {
return false;
}
UniqueChars error(
JS_smprintf(
"type mismatch: expression has type %s but expected %s",
subText.get(), superText.get()));
if (!error) {
return false;
}
return d.fail(opcodeOffset, error.get());
}
// Function body validation.
struct NopOpDumper {
void dumpOpBegin(OpBytes op) {}
void dumpOpEnd() {}
void dumpTypeIndex(uint32_t typeIndex) {}
void dumpFuncIndex(uint32_t funcIndex) {}
void dumpTableIndex(uint32_t tableIndex) {}
void dumpGlobalIndex(uint32_t globalIndex) {}
void dumpMemoryIndex(uint32_t memoryIndex) {}
void dumpElemIndex(uint32_t elemIndex) {}
void dumpDataIndex(uint32_t dataIndex) {}
void dumpTagIndex(uint32_t tagIndex) {}
void dumpLocalIndex(uint32_t localIndex) {}
void dumpResultType(ResultType type) {}
void dumpI32Const(int32_t constant) {}
void dumpI64Const(int64_t constant) {}
void dumpF32Const(
float constant) {}
void dumpF64Const(
double constant) {}
void dumpV128Const(V128 constant) {}
void dumpVectorMask(V128 mask) {}
void dumpRefType(RefType type) {}
void dumpValType(ValType type) {}
void dumpTryTableCatches(
const TryTableCatchVector& catches) {}
void dumpLinearMemoryAddress(LinearMemoryAddress<Nothing> addr) {}
void dumpBlockDepth(uint32_t relativeDepth) {}
void dumpBlockDepths(
const Uint32Vector& relativeDepths) {}
void dumpFieldIndex(uint32_t fieldIndex) {}
void dumpNumElements(uint32_t numElements) {}
void dumpLaneIndex(uint32_t laneIndex) {}
};
#ifdef DEBUG
struct OpDumper {
IndentedPrinter& out;
explicit OpDumper(IndentedPrinter& out) : out(out) {}
void dumpOpBegin(OpBytes op) { out.put(op.toString()); }
void dumpOpEnd() { out.put(
"\n"); }
void dumpTypeIndex(uint32_t typeIndex) { out.printf(
" %" PRIu32, typeIndex); }
void dumpFuncIndex(uint32_t funcIndex) { out.printf(
" %" PRIu32, funcIndex); }
void dumpTableIndex(uint32_t tableIndex) {
out.printf(
" %" PRIu32, tableIndex);
}
void dumpGlobalIndex(uint32_t globalIndex) {
out.printf(
" %" PRIu32, globalIndex);
}
void dumpMemoryIndex(uint32_t memoryIndex) {
out.printf(
" %" PRIu32, memoryIndex);
}
void dumpElemIndex(uint32_t elemIndex) { out.printf(
" %" PRIu32, elemIndex); }
void dumpDataIndex(uint32_t dataIndex) { out.printf(
" %" PRIu32, dataIndex); }
void dumpTagIndex(uint32_t tagIndex) { out.printf(
" %" PRIu32, tagIndex); }
void dumpLocalIndex(uint32_t localIndex) {
out.printf(
" %" PRIu32, localIndex);
}
void dumpResultType(ResultType type) {
for (uint32_t i = 0; i < type.length(); i++) {
dumpValType(type[i]);
}
}
void dumpI32Const(int32_t constant) { out.printf(
" %" PRId32, constant); }
void dumpI64Const(int64_t constant) { out.printf(
" %" PRId64, constant); }
void dumpF32Const(
float constant) { out.printf(
" %f", constant); }
void dumpF64Const(
double constant) { out.printf(
" %lf", constant); }
void dumpV128Const(V128 constant) {
out.printf(
"i8x16 %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d",
constant.bytes[0], constant.bytes[1], constant.bytes[2],
constant.bytes[3], constant.bytes[4], constant.bytes[5],
constant.bytes[6], constant.bytes[7], constant.bytes[8],
constant.bytes[9], constant.bytes[10], constant.bytes[11],
constant.bytes[12], constant.bytes[13], constant.bytes[14],
constant.bytes[15]);
}
void dumpVectorMask(V128 mask) {
out.printf(
"%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d", mask.bytes[0],
mask.bytes[1], mask.bytes[2], mask.bytes[3], mask.bytes[4],
mask.bytes[5], mask.bytes[6], mask.bytes[7], mask.bytes[8],
mask.bytes[9], mask.bytes[10], mask.bytes[11], mask.bytes[12],
mask.bytes[13], mask.bytes[14], mask.bytes[15]);
}
void dumpRefType(RefType type) {
out.put(
" ");
wasm::Dump(type, out);
}
void dumpValType(ValType type) {
out.put(
" ");
wasm::Dump(type, out);
}
void dumpTryTableCatches(
const TryTableCatchVector& catches) {
for (uint32_t i = 0; i < catches.length(); i++) {
const TryTableCatch& tryCatch = catches[i];
if (tryCatch.tagIndex == CatchAllIndex) {
if (tryCatch.captureExnRef) {
out.put(
" (catch_all_ref ");
}
else {
out.put(
" (catch_all ");
}
}
else {
if (tryCatch.captureExnRef) {
out.printf(
" (catch_ref %d ", tryCatch.tagIndex);
}
else {
out.printf(
" (catch %d ", tryCatch.tagIndex);
}
}
dumpBlockDepth(tryCatch.labelRelativeDepth);
out.put(
")");
}
}
void dumpLinearMemoryAddress(LinearMemoryAddress<Nothing> addr) {
if (addr.memoryIndex != 0) {
out.printf(
" (memory %d)", addr.memoryIndex);
}
if (addr.offset != 0) {
out.printf(
" offset=%" PRIu64, addr.offset);
}
if (addr.align != 0) {
out.printf(
" align=%d", addr.align);
}
}
void dumpBlockDepth(uint32_t relativeDepth) {
out.printf(
" %d", relativeDepth);
}
void dumpBlockDepths(
const Uint32Vector& relativeDepths) {
for (uint32_t i = 0; i < relativeDepths.length(); i++) {
out.printf(
" %d", relativeDepths[i]);
}
}
void dumpFieldIndex(uint32_t fieldIndex) { out.printf(
" %d", fieldIndex); }
void dumpNumElements(uint32_t numElements) { out.printf(
" %d", numElements); }
void dumpLaneIndex(uint32_t laneIndex) { out.printf(
" %d", laneIndex); }
};
#endif
template <
typename DumpT>
static bool ValidateOps(ValidatingOpIter& iter, DumpT& dumper,
const CodeMetadata& codeMeta,
const uint8_t* bodyEnd) {
while (
true) {
OpBytes op;
if (!iter.readOp(&op)) {
return false;
}
dumper.dumpOpBegin(op);
Nothing nothing;
NothingVector nothings{};
ResultType unusedType;
switch (op.b0) {
case uint16_t(Op::End): {
LabelKind unusedKind;
if (!iter.readEnd(&unusedKind, &unusedType, ¬hings, ¬hings)) {
return false;
}
iter.popEnd();
if (iter.controlStackEmpty()) {
return true;
}
break;
}
case uint16_t(Op::Nop): {
if (!iter.readNop()) {
return false;
}
break;
}
case uint16_t(Op::Drop): {
if (!iter.readDrop()) {
return false;
}
break;
}
case uint16_t(Op::Call): {
uint32_t funcIndex;
NothingVector unusedArgs{};
if (!iter.readCall(&funcIndex, &unusedArgs)) {
return false;
}
dumper.dumpFuncIndex(funcIndex);
break;
}
case uint16_t(Op::CallIndirect): {
uint32_t funcTypeIndex, tableIndex;
NothingVector unusedArgs{};
if (!iter.readCallIndirect(&funcTypeIndex, &tableIndex, ¬hing,
&unusedArgs)) {
return false;
}
dumper.dumpTypeIndex(funcTypeIndex);
dumper.dumpTableIndex(tableIndex);
break;
}
case uint16_t(Op::ReturnCall): {
uint32_t funcIndex;
NothingVector unusedArgs{};
if (!iter.readReturnCall(&funcIndex, &unusedArgs)) {
return false;
}
dumper.dumpFuncIndex(funcIndex);
break;
}
case uint16_t(Op::ReturnCallIndirect): {
uint32_t funcTypeIndex, tableIndex;
NothingVector unusedArgs{};
if (!iter.readReturnCallIndirect(&funcTypeIndex, &tableIndex, ¬hing,
&unusedArgs)) {
return false;
}
dumper.dumpTypeIndex(funcTypeIndex);
dumper.dumpTableIndex(tableIndex);
break;
}
case uint16_t(Op::CallRef): {
uint32_t funcTypeIndex;
NothingVector unusedArgs{};
if (!iter.readCallRef(&funcTypeIndex, ¬hing, &unusedArgs)) {
return false;
}
dumper.dumpTypeIndex(funcTypeIndex);
break;
}
case uint16_t(Op::ReturnCallRef): {
uint32_t funcTypeIndex;
NothingVector unusedArgs{};
if (!iter.readReturnCallRef(&funcTypeIndex, ¬hing, &unusedArgs)) {
return false;
}
dumper.dumpTypeIndex(funcTypeIndex);
break;
}
case uint16_t(Op::I32Const): {
int32_t constant;
if (!iter.readI32Const(&constant)) {
return false;
}
dumper.dumpI32Const(constant);
break;
}
case uint16_t(Op::I64Const): {
int64_t constant;
if (!iter.readI64Const(&constant)) {
return false;
}
dumper.dumpI64Const(constant);
break;
}
case uint16_t(Op::F32Const): {
float constant;
if (!iter.readF32Const(&constant)) {
return false;
}
dumper.dumpF32Const(constant);
break;
}
case uint16_t(Op::F64Const): {
double constant;
if (!iter.readF64Const(&constant)) {
return false;
}
dumper.dumpF64Const(constant);
break;
}
case uint16_t(Op::LocalGet): {
uint32_t localIndex;
if (!iter.readGetLocal(&localIndex)) {
return false;
}
dumper.dumpLocalIndex(localIndex);
break;
}
case uint16_t(Op::LocalSet): {
uint32_t localIndex;
if (!iter.readSetLocal(&localIndex, ¬hing)) {
return false;
}
dumper.dumpLocalIndex(localIndex);
break;
}
case uint16_t(Op::LocalTee): {
uint32_t localIndex;
if (!iter.readTeeLocal(&localIndex, ¬hing)) {
return false;
}
dumper.dumpLocalIndex(localIndex);
break;
}
case uint16_t(Op::GlobalGet): {
uint32_t globalIndex;
if (!iter.readGetGlobal(&globalIndex)) {
return false;
}
dumper.dumpGlobalIndex(globalIndex);
break;
}
case uint16_t(Op::GlobalSet): {
uint32_t globalIndex;
if (!iter.readSetGlobal(&globalIndex, ¬hing)) {
return false;
}
dumper.dumpGlobalIndex(globalIndex);
break;
}
case uint16_t(Op::TableGet): {
uint32_t tableIndex;
if (!iter.readTableGet(&tableIndex, ¬hing)) {
return false;
}
dumper.dumpTableIndex(tableIndex);
break;
}
case uint16_t(Op::TableSet): {
uint32_t tableIndex;
if (!iter.readTableSet(&tableIndex, ¬hing, ¬hing)) {
return false;
}
dumper.dumpTableIndex(tableIndex);
break;
}
case uint16_t(Op::SelectNumeric): {
StackType unused;
if (!iter.readSelect(
/*typed*/ false, &unused, ¬hing, ¬hing,
¬hing)) {
return false;
}
break;
}
case uint16_t(Op::SelectTyped): {
StackType type;
if (!iter.readSelect(
/*typed*/ true, &type, ¬hing, ¬hing,
¬hing)) {
return false;
}
dumper.dumpValType(type.valType());
break;
}
case uint16_t(Op::Block): {
if (!iter.readBlock(&unusedType)) {
return false;
}
dumper.dumpResultType(unusedType);
break;
}
case uint16_t(Op::Loop): {
if (!iter.readLoop(&unusedType)) {
return false;
}
dumper.dumpResultType(unusedType);
break;
}
case uint16_t(Op::
If): {
if (!iter.readIf(&unusedType, ¬hing)) {
return false;
}
dumper.dumpResultType(unusedType);
break;
}
case uint16_t(Op::
Else): {
if (!iter.readElse(&unusedType, &unusedType, ¬hings)) {
return false;
}
break;
}
case uint16_t(Op::I32Clz):
case uint16_t(Op::I32Ctz):
case uint16_t(Op::I32Popcnt): {
if (!iter.readUnary(ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64Clz):
case uint16_t(Op::I64Ctz):
case uint16_t(Op::I64Popcnt): {
if (!iter.readUnary(ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F32Abs):
case uint16_t(Op::F32Neg):
case uint16_t(Op::F32Ceil):
case uint16_t(Op::F32Floor):
case uint16_t(Op::F32Sqrt):
case uint16_t(Op::F32Trunc):
case uint16_t(Op::F32Nearest): {
if (!iter.readUnary(ValType::F32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F64Abs):
case uint16_t(Op::F64Neg):
case uint16_t(Op::F64Ceil):
case uint16_t(Op::F64Floor):
case uint16_t(Op::F64Sqrt):
case uint16_t(Op::F64Trunc):
case uint16_t(Op::F64Nearest): {
if (!iter.readUnary(ValType::F64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32Add):
case uint16_t(Op::I32Sub):
case uint16_t(Op::I32Mul):
case uint16_t(Op::I32DivS):
case uint16_t(Op::I32DivU):
case uint16_t(Op::I32RemS):
case uint16_t(Op::I32RemU):
case uint16_t(Op::I32And):
case uint16_t(Op::I32Or):
case uint16_t(Op::I32Xor):
case uint16_t(Op::I32Shl):
case uint16_t(Op::I32ShrS):
case uint16_t(Op::I32ShrU):
case uint16_t(Op::I32Rotl):
case uint16_t(Op::I32Rotr): {
if (!iter.readBinary(ValType::I32, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64Add):
case uint16_t(Op::I64Sub):
case uint16_t(Op::I64Mul):
case uint16_t(Op::I64DivS):
case uint16_t(Op::I64DivU):
case uint16_t(Op::I64RemS):
case uint16_t(Op::I64RemU):
case uint16_t(Op::I64And):
case uint16_t(Op::I64Or):
case uint16_t(Op::I64Xor):
case uint16_t(Op::I64Shl):
case uint16_t(Op::I64ShrS):
case uint16_t(Op::I64ShrU):
case uint16_t(Op::I64Rotl):
case uint16_t(Op::I64Rotr): {
if (!iter.readBinary(ValType::I64, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F32Add):
case uint16_t(Op::F32Sub):
case uint16_t(Op::F32Mul):
case uint16_t(Op::F32Div):
case uint16_t(Op::F32Min):
case uint16_t(Op::F32Max):
case uint16_t(Op::F32CopySign): {
if (!iter.readBinary(ValType::F32, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F64Add):
case uint16_t(Op::F64Sub):
case uint16_t(Op::F64Mul):
case uint16_t(Op::F64Div):
case uint16_t(Op::F64Min):
case uint16_t(Op::F64Max):
case uint16_t(Op::F64CopySign): {
if (!iter.readBinary(ValType::F64, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32Eq):
case uint16_t(Op::I32Ne):
case uint16_t(Op::I32LtS):
case uint16_t(Op::I32LtU):
case uint16_t(Op::I32LeS):
case uint16_t(Op::I32LeU):
case uint16_t(Op::I32GtS):
case uint16_t(Op::I32GtU):
case uint16_t(Op::I32GeS):
case uint16_t(Op::I32GeU): {
if (!iter.readComparison(ValType::I32, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64Eq):
case uint16_t(Op::I64Ne):
case uint16_t(Op::I64LtS):
case uint16_t(Op::I64LtU):
case uint16_t(Op::I64LeS):
case uint16_t(Op::I64LeU):
case uint16_t(Op::I64GtS):
case uint16_t(Op::I64GtU):
case uint16_t(Op::I64GeS):
case uint16_t(Op::I64GeU): {
if (!iter.readComparison(ValType::I64, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F32Eq):
case uint16_t(Op::F32Ne):
case uint16_t(Op::F32Lt):
case uint16_t(Op::F32Le):
case uint16_t(Op::F32Gt):
case uint16_t(Op::F32Ge): {
if (!iter.readComparison(ValType::F32, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F64Eq):
case uint16_t(Op::F64Ne):
case uint16_t(Op::F64Lt):
case uint16_t(Op::F64Le):
case uint16_t(Op::F64Gt):
case uint16_t(Op::F64Ge): {
if (!iter.readComparison(ValType::F64, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32Eqz): {
if (!iter.readConversion(ValType::I32, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64Eqz):
case uint16_t(Op::I32WrapI64): {
if (!iter.readConversion(ValType::I64, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32TruncF32S):
case uint16_t(Op::I32TruncF32U):
case uint16_t(Op::I32ReinterpretF32): {
if (!iter.readConversion(ValType::F32, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32TruncF64S):
case uint16_t(Op::I32TruncF64U): {
if (!iter.readConversion(ValType::F64, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64ExtendI32S):
case uint16_t(Op::I64ExtendI32U): {
if (!iter.readConversion(ValType::I32, ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64TruncF32S):
case uint16_t(Op::I64TruncF32U): {
if (!iter.readConversion(ValType::F32, ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64TruncF64S):
case uint16_t(Op::I64TruncF64U):
case uint16_t(Op::I64ReinterpretF64): {
if (!iter.readConversion(ValType::F64, ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F32ConvertI32S):
case uint16_t(Op::F32ConvertI32U):
case uint16_t(Op::F32ReinterpretI32): {
if (!iter.readConversion(ValType::I32, ValType::F32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F32ConvertI64S):
case uint16_t(Op::F32ConvertI64U): {
if (!iter.readConversion(ValType::I64, ValType::F32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F32DemoteF64): {
if (!iter.readConversion(ValType::F64, ValType::F32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F64ConvertI32S):
case uint16_t(Op::F64ConvertI32U): {
if (!iter.readConversion(ValType::I32, ValType::F64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F64ConvertI64S):
case uint16_t(Op::F64ConvertI64U):
case uint16_t(Op::F64ReinterpretI64): {
if (!iter.readConversion(ValType::I64, ValType::F64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::F64PromoteF32): {
if (!iter.readConversion(ValType::F32, ValType::F64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32Extend8S):
case uint16_t(Op::I32Extend16S): {
if (!iter.readConversion(ValType::I32, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I64Extend8S):
case uint16_t(Op::I64Extend16S):
case uint16_t(Op::I64Extend32S): {
if (!iter.readConversion(ValType::I64, ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::I32Load8S):
case uint16_t(Op::I32Load8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I32, 1, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I32Load16S):
case uint16_t(Op::I32Load16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I32, 2, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I32Load): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I32, 4, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Load8S):
case uint16_t(Op::I64Load8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I64, 1, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Load16S):
case uint16_t(Op::I64Load16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I64, 2, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Load32S):
case uint16_t(Op::I64Load32U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I64, 4, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Load): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::I64, 8, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::F32Load): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::F32, 4, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::F64Load): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::F64, 8, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I32Store8): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I32, 1, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I32Store16): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I32, 2, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I32Store): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I32, 4, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Store8): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I64, 1, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Store16): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I64, 2, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Store32): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I64, 4, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::I64Store): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::I64, 8, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::F32Store): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::F32, 4, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::F64Store): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::F64, 8, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint16_t(Op::MemoryGrow): {
uint32_t memoryIndex;
if (!iter.readMemoryGrow(&memoryIndex, ¬hing)) {
return false;
}
dumper.dumpMemoryIndex(memoryIndex);
break;
}
case uint16_t(Op::MemorySize): {
uint32_t memoryIndex;
if (!iter.readMemorySize(&memoryIndex)) {
return false;
}
dumper.dumpMemoryIndex(memoryIndex);
break;
}
case uint16_t(Op::Br): {
uint32_t depth;
if (!iter.readBr(&depth, &unusedType, ¬hings)) {
return false;
}
dumper.dumpBlockDepth(depth);
break;
}
case uint16_t(Op::BrIf): {
uint32_t depth;
if (!iter.readBrIf(&depth, &unusedType, ¬hings, ¬hing)) {
return false;
}
dumper.dumpBlockDepth(depth);
break;
}
case uint16_t(Op::BrTable): {
Uint32Vector depths;
uint32_t defaultDepth;
if (!iter.readBrTable(&depths, &defaultDepth, &unusedType, ¬hings,
¬hing)) {
return false;
}
dumper.dumpBlockDepths(depths);
dumper.dumpBlockDepth(defaultDepth);
break;
}
case uint16_t(Op::
Return): {
if (!iter.readReturn(¬hings)) {
return false;
}
break;
}
case uint16_t(Op::Unreachable): {
if (!iter.readUnreachable()) {
return false;
}
break;
}
case uint16_t(Op::GcPrefix): {
switch (op.b1) {
case uint32_t(GcOp::StructNew): {
uint32_t typeIndex;
NothingVector unusedArgs{};
if (!iter.readStructNew(&typeIndex, &unusedArgs)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::StructNewDefault): {
uint32_t typeIndex;
if (!iter.readStructNewDefault(&typeIndex)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::StructGet): {
uint32_t typeIndex, fieldIndex;
if (!iter.readStructGet(&typeIndex, &fieldIndex,
FieldWideningOp::None, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpFieldIndex(fieldIndex);
break;
}
case uint32_t(GcOp::StructGetS): {
uint32_t typeIndex, fieldIndex;
if (!iter.readStructGet(&typeIndex, &fieldIndex,
FieldWideningOp::
Signed, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpFieldIndex(fieldIndex);
break;
}
case uint32_t(GcOp::StructGetU): {
uint32_t typeIndex, fieldIndex;
if (!iter.readStructGet(&typeIndex, &fieldIndex,
FieldWideningOp::
Unsigned, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpFieldIndex(fieldIndex);
break;
}
case uint32_t(GcOp::StructSet): {
uint32_t typeIndex, fieldIndex;
if (!iter.readStructSet(&typeIndex, &fieldIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpFieldIndex(fieldIndex);
break;
}
case uint32_t(GcOp::ArrayNew): {
uint32_t typeIndex;
if (!iter.readArrayNew(&typeIndex, ¬hing, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::ArrayNewFixed): {
uint32_t typeIndex, numElements;
if (!iter.readArrayNewFixed(&typeIndex, &numElements, ¬hings)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpNumElements(numElements);
break;
}
case uint32_t(GcOp::ArrayNewDefault): {
uint32_t typeIndex;
if (!iter.readArrayNewDefault(&typeIndex, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::ArrayNewData): {
uint32_t typeIndex, dataIndex;
if (!iter.readArrayNewData(&typeIndex, &dataIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpDataIndex(dataIndex);
break;
}
case uint32_t(GcOp::ArrayNewElem): {
uint32_t typeIndex, elemIndex;
if (!iter.readArrayNewElem(&typeIndex, &elemIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpElemIndex(elemIndex);
break;
}
case uint32_t(GcOp::ArrayInitData): {
uint32_t typeIndex, dataIndex;
if (!iter.readArrayInitData(&typeIndex, &dataIndex, ¬hing,
¬hing, ¬hing, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpDataIndex(dataIndex);
break;
}
case uint32_t(GcOp::ArrayInitElem): {
uint32_t typeIndex, elemIndex;
if (!iter.readArrayInitElem(&typeIndex, &elemIndex, ¬hing,
¬hing, ¬hing, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
dumper.dumpElemIndex(elemIndex);
break;
}
case uint32_t(GcOp::ArrayGet): {
uint32_t typeIndex;
if (!iter.readArrayGet(&typeIndex, FieldWideningOp::None, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::ArrayGetS): {
uint32_t typeIndex;
if (!iter.readArrayGet(&typeIndex, FieldWideningOp::
Signed,
¬hing, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::ArrayGetU): {
uint32_t typeIndex;
if (!iter.readArrayGet(&typeIndex, FieldWideningOp::
Unsigned,
¬hing, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::ArraySet): {
uint32_t typeIndex;
if (!iter.readArraySet(&typeIndex, ¬hing, ¬hing, ¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::ArrayLen): {
if (!iter.readArrayLen(¬hing)) {
return false;
}
break;
}
case uint32_t(GcOp::ArrayCopy): {
uint32_t dstArrayTypeIndex;
uint32_t srcArrayTypeIndex;
if (!iter.readArrayCopy(&dstArrayTypeIndex, &srcArrayTypeIndex,
¬hing, ¬hing, ¬hing, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTypeIndex(dstArrayTypeIndex);
dumper.dumpTypeIndex(srcArrayTypeIndex);
break;
}
case uint32_t(GcOp::ArrayFill): {
uint32_t typeIndex;
if (!iter.readArrayFill(&typeIndex, ¬hing, ¬hing, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTypeIndex(typeIndex);
break;
}
case uint32_t(GcOp::RefI31): {
if (!iter.readConversion(ValType::I32,
ValType(RefType::i31().asNonNullable()),
¬hing)) {
return false;
}
break;
}
case uint32_t(GcOp::I31GetS): {
if (!iter.readConversion(ValType(RefType::i31()), ValType::I32,
¬hing)) {
return false;
}
break;
}
case uint32_t(GcOp::I31GetU): {
if (!iter.readConversion(ValType(RefType::i31()), ValType::I32,
¬hing)) {
return false;
}
break;
}
case uint16_t(GcOp::RefTest): {
RefType srcType;
RefType destType;
if (!iter.readRefTest(
false, &srcType, &destType, ¬hing)) {
return false;
}
dumper.dumpRefType(destType);
break;
}
case uint16_t(GcOp::RefTestNull): {
RefType srcType;
RefType destType;
if (!iter.readRefTest(
true, &srcType, &destType, ¬hing)) {
return false;
}
dumper.dumpRefType(srcType);
dumper.dumpRefType(destType);
break;
}
case uint16_t(GcOp::RefCast): {
RefType srcType;
RefType destType;
if (!iter.readRefCast(
false, &srcType, &destType, ¬hing)) {
return false;
}
dumper.dumpRefType(srcType);
dumper.dumpRefType(destType);
break;
}
case uint16_t(GcOp::RefCastNull): {
RefType srcType;
RefType destType;
if (!iter.readRefCast(
true, &srcType, &destType, ¬hing)) {
return false;
}
dumper.dumpRefType(srcType);
dumper.dumpRefType(destType);
break;
}
case uint16_t(GcOp::BrOnCast): {
uint32_t relativeDepth;
RefType srcType;
RefType destType;
if (!iter.readBrOnCast(
true, &relativeDepth, &srcType, &destType,
&unusedType, ¬hings)) {
return false;
}
dumper.dumpBlockDepth(relativeDepth);
dumper.dumpRefType(srcType);
dumper.dumpRefType(destType);
break;
}
case uint16_t(GcOp::BrOnCastFail): {
uint32_t relativeDepth;
RefType srcType;
RefType destType;
if (!iter.readBrOnCast(
false, &relativeDepth, &srcType, &destType,
&unusedType, ¬hings)) {
return false;
}
dumper.dumpBlockDepth(relativeDepth);
dumper.dumpRefType(srcType);
dumper.dumpRefType(destType);
break;
}
case uint16_t(GcOp::AnyConvertExtern): {
if (!iter.readRefConversion(RefType::extern_(), RefType::any(),
¬hing)) {
return false;
}
break;
}
case uint16_t(GcOp::ExternConvertAny): {
if (!iter.readRefConversion(RefType::any(), RefType::extern_(),
¬hing)) {
return false;
}
break;
}
default:
return iter.unrecognizedOpcode(&op);
}
break;
}
#ifdef ENABLE_WASM_SIMD
case uint16_t(Op::SimdPrefix): {
if (!codeMeta.simdAvailable()) {
return iter.unrecognizedOpcode(&op);
}
uint32_t laneIndex;
switch (op.b1) {
case uint32_t(SimdOp::I8x16ExtractLaneS):
case uint32_t(SimdOp::I8x16ExtractLaneU): {
if (!iter.readExtractLane(ValType::I32, 16, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I16x8ExtractLaneS):
case uint32_t(SimdOp::I16x8ExtractLaneU): {
if (!iter.readExtractLane(ValType::I32, 8, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I32x4ExtractLane): {
if (!iter.readExtractLane(ValType::I32, 4, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I64x2ExtractLane): {
if (!iter.readExtractLane(ValType::I64, 2, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::F32x4ExtractLane): {
if (!iter.readExtractLane(ValType::F32, 4, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::F64x2ExtractLane): {
if (!iter.readExtractLane(ValType::F64, 2, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I8x16Splat):
case uint32_t(SimdOp::I16x8Splat):
case uint32_t(SimdOp::I32x4Splat): {
if (!iter.readConversion(ValType::I32, ValType::V128, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I64x2Splat): {
if (!iter.readConversion(ValType::I64, ValType::V128, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::F32x4Splat): {
if (!iter.readConversion(ValType::F32, ValType::V128, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::F64x2Splat): {
if (!iter.readConversion(ValType::F64, ValType::V128, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::V128AnyTrue):
case uint32_t(SimdOp::I8x16AllTrue):
case uint32_t(SimdOp::I16x8AllTrue):
case uint32_t(SimdOp::I32x4AllTrue):
case uint32_t(SimdOp::I64x2AllTrue):
case uint32_t(SimdOp::I8x16Bitmask):
case uint32_t(SimdOp::I16x8Bitmask):
case uint32_t(SimdOp::I32x4Bitmask):
case uint32_t(SimdOp::I64x2Bitmask): {
if (!iter.readConversion(ValType::V128, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I8x16ReplaceLane): {
if (!iter.readReplaceLane(ValType::I32, 16, &laneIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I16x8ReplaceLane): {
if (!iter.readReplaceLane(ValType::I32, 8, &laneIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I32x4ReplaceLane): {
if (!iter.readReplaceLane(ValType::I32, 4, &laneIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I64x2ReplaceLane): {
if (!iter.readReplaceLane(ValType::I64, 2, &laneIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::F32x4ReplaceLane): {
if (!iter.readReplaceLane(ValType::F32, 4, &laneIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::F64x2ReplaceLane): {
if (!iter.readReplaceLane(ValType::F64, 2, &laneIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
break;
}
case uint32_t(SimdOp::I8x16Eq):
case uint32_t(SimdOp::I8x16Ne):
case uint32_t(SimdOp::I8x16LtS):
case uint32_t(SimdOp::I8x16LtU):
case uint32_t(SimdOp::I8x16GtS):
case uint32_t(SimdOp::I8x16GtU):
case uint32_t(SimdOp::I8x16LeS):
case uint32_t(SimdOp::I8x16LeU):
case uint32_t(SimdOp::I8x16GeS):
case uint32_t(SimdOp::I8x16GeU):
case uint32_t(SimdOp::I16x8Eq):
case uint32_t(SimdOp::I16x8Ne):
case uint32_t(SimdOp::I16x8LtS):
case uint32_t(SimdOp::I16x8LtU):
case uint32_t(SimdOp::I16x8GtS):
case uint32_t(SimdOp::I16x8GtU):
case uint32_t(SimdOp::I16x8LeS):
case uint32_t(SimdOp::I16x8LeU):
case uint32_t(SimdOp::I16x8GeS):
case uint32_t(SimdOp::I16x8GeU):
case uint32_t(SimdOp::I32x4Eq):
case uint32_t(SimdOp::I32x4Ne):
case uint32_t(SimdOp::I32x4LtS):
case uint32_t(SimdOp::I32x4LtU):
case uint32_t(SimdOp::I32x4GtS):
case uint32_t(SimdOp::I32x4GtU):
case uint32_t(SimdOp::I32x4LeS):
case uint32_t(SimdOp::I32x4LeU):
case uint32_t(SimdOp::I32x4GeS):
case uint32_t(SimdOp::I32x4GeU):
case uint32_t(SimdOp::I64x2Eq):
case uint32_t(SimdOp::I64x2Ne):
case uint32_t(SimdOp::I64x2LtS):
case uint32_t(SimdOp::I64x2GtS):
case uint32_t(SimdOp::I64x2LeS):
case uint32_t(SimdOp::I64x2GeS):
case uint32_t(SimdOp::F32x4Eq):
case uint32_t(SimdOp::F32x4Ne):
case uint32_t(SimdOp::F32x4Lt):
case uint32_t(SimdOp::F32x4Gt):
case uint32_t(SimdOp::F32x4Le):
case uint32_t(SimdOp::F32x4Ge):
case uint32_t(SimdOp::F64x2Eq):
case uint32_t(SimdOp::F64x2Ne):
case uint32_t(SimdOp::F64x2Lt):
case uint32_t(SimdOp::F64x2Gt):
case uint32_t(SimdOp::F64x2Le):
case uint32_t(SimdOp::F64x2Ge):
case uint32_t(SimdOp::V128And):
case uint32_t(SimdOp::V128Or):
case uint32_t(SimdOp::V128Xor):
case uint32_t(SimdOp::V128AndNot):
case uint32_t(SimdOp::I8x16AvgrU):
case uint32_t(SimdOp::I16x8AvgrU):
case uint32_t(SimdOp::I8x16Add):
case uint32_t(SimdOp::I8x16AddSatS):
case uint32_t(SimdOp::I8x16AddSatU):
case uint32_t(SimdOp::I8x16Sub):
case uint32_t(SimdOp::I8x16SubSatS):
case uint32_t(SimdOp::I8x16SubSatU):
case uint32_t(SimdOp::I8x16MinS):
case uint32_t(SimdOp::I8x16MinU):
case uint32_t(SimdOp::I8x16MaxS):
case uint32_t(SimdOp::I8x16MaxU):
case uint32_t(SimdOp::I16x8Add):
case uint32_t(SimdOp::I16x8AddSatS):
case uint32_t(SimdOp::I16x8AddSatU):
case uint32_t(SimdOp::I16x8Sub):
case uint32_t(SimdOp::I16x8SubSatS):
case uint32_t(SimdOp::I16x8SubSatU):
case uint32_t(SimdOp::I16x8Mul):
case uint32_t(SimdOp::I16x8MinS):
case uint32_t(SimdOp::I16x8MinU):
case uint32_t(SimdOp::I16x8MaxS):
case uint32_t(SimdOp::I16x8MaxU):
case uint32_t(SimdOp::I32x4Add):
case uint32_t(SimdOp::I32x4Sub):
case uint32_t(SimdOp::I32x4Mul):
case uint32_t(SimdOp::I32x4MinS):
case uint32_t(SimdOp::I32x4MinU):
case uint32_t(SimdOp::I32x4MaxS):
case uint32_t(SimdOp::I32x4MaxU):
case uint32_t(SimdOp::I64x2Add):
case uint32_t(SimdOp::I64x2Sub):
case uint32_t(SimdOp::I64x2Mul):
case uint32_t(SimdOp::F32x4Add):
case uint32_t(SimdOp::F32x4Sub):
case uint32_t(SimdOp::F32x4Mul):
case uint32_t(SimdOp::F32x4Div):
case uint32_t(SimdOp::F32x4Min):
case uint32_t(SimdOp::F32x4Max):
case uint32_t(SimdOp::F64x2Add):
case uint32_t(SimdOp::F64x2Sub):
case uint32_t(SimdOp::F64x2Mul):
case uint32_t(SimdOp::F64x2Div):
case uint32_t(SimdOp::F64x2Min):
case uint32_t(SimdOp::F64x2Max):
case uint32_t(SimdOp::I8x16NarrowI16x8S):
case uint32_t(SimdOp::I8x16NarrowI16x8U):
case uint32_t(SimdOp::I16x8NarrowI32x4S):
case uint32_t(SimdOp::I16x8NarrowI32x4U):
case uint32_t(SimdOp::I8x16Swizzle):
case uint32_t(SimdOp::F32x4PMax):
case uint32_t(SimdOp::F32x4PMin):
case uint32_t(SimdOp::F64x2PMax):
case uint32_t(SimdOp::F64x2PMin):
case uint32_t(SimdOp::I32x4DotI16x8S):
case uint32_t(SimdOp::I16x8ExtmulLowI8x16S):
case uint32_t(SimdOp::I16x8ExtmulHighI8x16S):
case uint32_t(SimdOp::I16x8ExtmulLowI8x16U):
case uint32_t(SimdOp::I16x8ExtmulHighI8x16U):
case uint32_t(SimdOp::I32x4ExtmulLowI16x8S):
case uint32_t(SimdOp::I32x4ExtmulHighI16x8S):
case uint32_t(SimdOp::I32x4ExtmulLowI16x8U):
case uint32_t(SimdOp::I32x4ExtmulHighI16x8U):
case uint32_t(SimdOp::I64x2ExtmulLowI32x4S):
case uint32_t(SimdOp::I64x2ExtmulHighI32x4S):
case uint32_t(SimdOp::I64x2ExtmulLowI32x4U):
case uint32_t(SimdOp::I64x2ExtmulHighI32x4U):
case uint32_t(SimdOp::I16x8Q15MulrSatS): {
if (!iter.readBinary(ValType::V128, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I8x16Neg):
case uint32_t(SimdOp::I16x8Neg):
case uint32_t(SimdOp::I16x8ExtendLowI8x16S):
case uint32_t(SimdOp::I16x8ExtendHighI8x16S):
case uint32_t(SimdOp::I16x8ExtendLowI8x16U):
case uint32_t(SimdOp::I16x8ExtendHighI8x16U):
case uint32_t(SimdOp::I32x4Neg):
case uint32_t(SimdOp::I32x4ExtendLowI16x8S):
case uint32_t(SimdOp::I32x4ExtendHighI16x8S):
case uint32_t(SimdOp::I32x4ExtendLowI16x8U):
case uint32_t(SimdOp::I32x4ExtendHighI16x8U):
case uint32_t(SimdOp::I32x4TruncSatF32x4S):
case uint32_t(SimdOp::I32x4TruncSatF32x4U):
case uint32_t(SimdOp::I64x2Neg):
case uint32_t(SimdOp::I64x2ExtendLowI32x4S):
case uint32_t(SimdOp::I64x2ExtendHighI32x4S):
case uint32_t(SimdOp::I64x2ExtendLowI32x4U):
case uint32_t(SimdOp::I64x2ExtendHighI32x4U):
case uint32_t(SimdOp::F32x4Abs):
case uint32_t(SimdOp::F32x4Neg):
case uint32_t(SimdOp::F32x4Sqrt):
case uint32_t(SimdOp::F32x4ConvertI32x4S):
case uint32_t(SimdOp::F32x4ConvertI32x4U):
case uint32_t(SimdOp::F64x2Abs):
case uint32_t(SimdOp::F64x2Neg):
case uint32_t(SimdOp::F64x2Sqrt):
case uint32_t(SimdOp::V128Not):
case uint32_t(SimdOp::I8x16Popcnt):
case uint32_t(SimdOp::I8x16Abs):
case uint32_t(SimdOp::I16x8Abs):
case uint32_t(SimdOp::I32x4Abs):
case uint32_t(SimdOp::I64x2Abs):
case uint32_t(SimdOp::F32x4Ceil):
case uint32_t(SimdOp::F32x4Floor):
case uint32_t(SimdOp::F32x4Trunc):
case uint32_t(SimdOp::F32x4Nearest):
case uint32_t(SimdOp::F64x2Ceil):
case uint32_t(SimdOp::F64x2Floor):
case uint32_t(SimdOp::F64x2Trunc):
case uint32_t(SimdOp::F64x2Nearest):
case uint32_t(SimdOp::F32x4DemoteF64x2Zero):
case uint32_t(SimdOp::F64x2PromoteLowF32x4):
case uint32_t(SimdOp::F64x2ConvertLowI32x4S):
case uint32_t(SimdOp::F64x2ConvertLowI32x4U):
case uint32_t(SimdOp::I32x4TruncSatF64x2SZero):
case uint32_t(SimdOp::I32x4TruncSatF64x2UZero):
case uint32_t(SimdOp::I16x8ExtaddPairwiseI8x16S):
case uint32_t(SimdOp::I16x8ExtaddPairwiseI8x16U):
case uint32_t(SimdOp::I32x4ExtaddPairwiseI16x8S):
case uint32_t(SimdOp::I32x4ExtaddPairwiseI16x8U): {
if (!iter.readUnary(ValType::V128, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I8x16Shl):
case uint32_t(SimdOp::I8x16ShrS):
case uint32_t(SimdOp::I8x16ShrU):
case uint32_t(SimdOp::I16x8Shl):
case uint32_t(SimdOp::I16x8ShrS):
case uint32_t(SimdOp::I16x8ShrU):
case uint32_t(SimdOp::I32x4Shl):
case uint32_t(SimdOp::I32x4ShrS):
case uint32_t(SimdOp::I32x4ShrU):
case uint32_t(SimdOp::I64x2Shl):
case uint32_t(SimdOp::I64x2ShrS):
case uint32_t(SimdOp::I64x2ShrU): {
if (!iter.readVectorShift(¬hing, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::V128Bitselect): {
if (!iter.readTernary(ValType::V128, ¬hing, ¬hing,
¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I8x16Shuffle): {
V128 mask;
if (!iter.readVectorShuffle(¬hing, ¬hing, &mask)) {
return false;
}
dumper.dumpVectorMask(mask);
break;
}
case uint32_t(SimdOp::V128Const): {
V128 constant;
if (!iter.readV128Const(&constant)) {
return false;
}
dumper.dumpV128Const(constant);
break;
}
case uint32_t(SimdOp::V128Load): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoad(ValType::V128, 16, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load8Splat): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadSplat(1, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load16Splat): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadSplat(2, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load32Splat): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadSplat(4, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load64Splat): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadSplat(8, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load8x8S):
case uint32_t(SimdOp::V128Load8x8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadExtend(&addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load16x4S):
case uint32_t(SimdOp::V128Load16x4U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadExtend(&addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load32x2S):
case uint32_t(SimdOp::V128Load32x2U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadExtend(&addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Store): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStore(ValType::V128, 16, &addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load32Zero): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadSplat(4, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load64Zero): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadSplat(8, &addr)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load8Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadLane(1, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load16Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadLane(2, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load32Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadLane(4, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Load64Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readLoadLane(8, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Store8Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStoreLane(1, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Store16Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStoreLane(2, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Store32Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStoreLane(4, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(SimdOp::V128Store64Lane): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readStoreLane(8, &addr, &laneIndex, ¬hing)) {
return false;
}
dumper.dumpLaneIndex(laneIndex);
dumper.dumpLinearMemoryAddress(addr);
break;
}
# ifdef ENABLE_WASM_RELAXED_SIMD
case uint32_t(SimdOp::F32x4RelaxedMadd):
case uint32_t(SimdOp::F32x4RelaxedNmadd):
case uint32_t(SimdOp::F64x2RelaxedMadd):
case uint32_t(SimdOp::F64x2RelaxedNmadd):
case uint32_t(SimdOp::I8x16RelaxedLaneSelect):
case uint32_t(SimdOp::I16x8RelaxedLaneSelect):
case uint32_t(SimdOp::I32x4RelaxedLaneSelect):
case uint32_t(SimdOp::I64x2RelaxedLaneSelect):
case uint32_t(SimdOp::I32x4DotI8x16I7x16AddS): {
if (!codeMeta.v128RelaxedEnabled()) {
return iter.unrecognizedOpcode(&op);
}
if (!iter.readTernary(ValType::V128, ¬hing, ¬hing,
¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::F32x4RelaxedMin):
case uint32_t(SimdOp::F32x4RelaxedMax):
case uint32_t(SimdOp::F64x2RelaxedMin):
case uint32_t(SimdOp::F64x2RelaxedMax):
case uint32_t(SimdOp::I16x8RelaxedQ15MulrS):
case uint32_t(SimdOp::I16x8DotI8x16I7x16S): {
if (!codeMeta.v128RelaxedEnabled()) {
return iter.unrecognizedOpcode(&op);
}
if (!iter.readBinary(ValType::V128, ¬hing, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I32x4RelaxedTruncF32x4S):
case uint32_t(SimdOp::I32x4RelaxedTruncF32x4U):
case uint32_t(SimdOp::I32x4RelaxedTruncF64x2SZero):
case uint32_t(SimdOp::I32x4RelaxedTruncF64x2UZero): {
if (!codeMeta.v128RelaxedEnabled()) {
return iter.unrecognizedOpcode(&op);
}
if (!iter.readUnary(ValType::V128, ¬hing)) {
return false;
}
break;
}
case uint32_t(SimdOp::I8x16RelaxedSwizzle): {
if (!codeMeta.v128RelaxedEnabled()) {
return iter.unrecognizedOpcode(&op);
}
if (!iter.readBinary(ValType::V128, ¬hing, ¬hing)) {
return false;
}
break;
}
# endif
default:
return iter.unrecognizedOpcode(&op);
}
break;
}
#endif // ENABLE_WASM_SIMD
case uint16_t(Op::MiscPrefix): {
switch (op.b1) {
case uint32_t(MiscOp::I32TruncSatF32S):
case uint32_t(MiscOp::I32TruncSatF32U): {
if (!iter.readConversion(ValType::F32, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint32_t(MiscOp::I32TruncSatF64S):
case uint32_t(MiscOp::I32TruncSatF64U): {
if (!iter.readConversion(ValType::F64, ValType::I32, ¬hing)) {
return false;
}
break;
}
case uint32_t(MiscOp::I64TruncSatF32S):
case uint32_t(MiscOp::I64TruncSatF32U): {
if (!iter.readConversion(ValType::F32, ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint32_t(MiscOp::I64TruncSatF64S):
case uint32_t(MiscOp::I64TruncSatF64U): {
if (!iter.readConversion(ValType::F64, ValType::I64, ¬hing)) {
return false;
}
break;
}
case uint32_t(MiscOp::MemoryCopy): {
uint32_t destMemIndex;
uint32_t srcMemIndex;
if (!iter.readMemOrTableCopy(
/*isMem=*/true, &destMemIndex,
¬hing, &srcMemIndex, ¬hing,
¬hing)) {
return false;
}
dumper.dumpMemoryIndex(destMemIndex);
dumper.dumpMemoryIndex(srcMemIndex);
break;
}
case uint32_t(MiscOp::DataDrop): {
uint32_t dataIndex;
if (!iter.readDataOrElemDrop(
/*isData=*/true, &dataIndex)) {
return false;
}
dumper.dumpDataIndex(dataIndex);
break;
}
case uint32_t(MiscOp::MemoryFill): {
uint32_t memoryIndex;
if (!iter.readMemFill(&memoryIndex, ¬hing, ¬hing, ¬hing)) {
return false;
}
dumper.dumpMemoryIndex(memoryIndex);
break;
}
case uint32_t(MiscOp::MemoryInit): {
uint32_t dataIndex;
uint32_t memoryIndex;
if (!iter.readMemOrTableInit(
/*isMem=*/true, &dataIndex,
&memoryIndex, ¬hing, ¬hing,
¬hing)) {
return false;
}
dumper.dumpMemoryIndex(memoryIndex);
dumper.dumpDataIndex(dataIndex);
break;
}
case uint32_t(MiscOp::TableCopy): {
uint32_t destTableIndex;
uint32_t srcTableIndex;
if (!iter.readMemOrTableCopy(
/*isMem=*/false, &destTableIndex, ¬hing, &srcTableIndex,
¬hing, ¬hing)) {
return false;
}
dumper.dumpTableIndex(destTableIndex);
dumper.dumpTableIndex(srcTableIndex);
break;
}
case uint32_t(MiscOp::ElemDrop): {
uint32_t elemIndex;
if (!iter.readDataOrElemDrop(
/*isData=*/false, &elemIndex)) {
return false;
}
dumper.dumpElemIndex(elemIndex);
break;
}
case uint32_t(MiscOp::TableInit): {
uint32_t elemIndex;
uint32_t tableIndex;
if (!iter.readMemOrTableInit(
/*isMem=*/false, &elemIndex,
&tableIndex, ¬hing, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTableIndex(tableIndex);
dumper.dumpElemIndex(elemIndex);
break;
}
case uint32_t(MiscOp::TableFill): {
uint32_t tableIndex;
if (!iter.readTableFill(&tableIndex, ¬hing, ¬hing,
¬hing)) {
return false;
}
dumper.dumpTableIndex(tableIndex);
break;
}
#ifdef ENABLE_WASM_MEMORY_CONTROL
case uint32_t(MiscOp::MemoryDiscard): {
if (!codeMeta.memoryControlEnabled()) {
return iter.unrecognizedOpcode(&op);
}
uint32_t memoryIndex;
if (!iter.readMemDiscard(&memoryIndex, ¬hing, ¬hing)) {
return false;
}
dumper.dumpMemoryIndex(memoryIndex);
break;
}
#endif
case uint32_t(MiscOp::TableGrow): {
uint32_t tableIndex;
if (!iter.readTableGrow(&tableIndex, ¬hing, ¬hing)) {
return false;
}
dumper.dumpTableIndex(tableIndex);
break;
}
case uint32_t(MiscOp::TableSize): {
uint32_t tableIndex;
if (!iter.readTableSize(&tableIndex)) {
return false;
}
dumper.dumpTableIndex(tableIndex);
break;
}
default:
return iter.unrecognizedOpcode(&op);
}
break;
}
case uint16_t(Op::RefAsNonNull): {
if (!iter.readRefAsNonNull(¬hing)) {
return false;
}
break;
}
case uint16_t(Op::BrOnNull): {
uint32_t depth;
if (!iter.readBrOnNull(&depth, &unusedType, ¬hings, ¬hing)) {
return false;
}
dumper.dumpBlockDepth(depth);
break;
}
case uint16_t(Op::BrOnNonNull): {
uint32_t depth;
if (!iter.readBrOnNonNull(&depth, &unusedType, ¬hings, ¬hing)) {
return false;
}
dumper.dumpBlockDepth(depth);
break;
}
case uint16_t(Op::RefEq): {
if (!iter.readComparison(RefType::eq(), ¬hing, ¬hing)) {
return false;
}
break;
}
case uint16_t(Op::RefFunc): {
uint32_t funcIndex;
if (!iter.readRefFunc(&funcIndex)) {
return false;
}
dumper.dumpFuncIndex(funcIndex);
break;
}
case uint16_t(Op::RefNull): {
RefType type;
if (!iter.readRefNull(&type)) {
return false;
}
dumper.dumpRefType(type);
break;
}
case uint16_t(Op::RefIsNull): {
Nothing nothing;
if (!iter.readRefIsNull(¬hing)) {
return false;
}
break;
}
case uint16_t(Op::
Try): {
if (!iter.readTry(&unusedType)) {
return false;
}
dumper.dumpResultType(unusedType);
break;
}
case uint16_t(Op::
Catch): {
LabelKind unusedKind;
uint32_t tagIndex;
if (!iter.readCatch(&unusedKind, &tagIndex, &unusedType, &unusedType,
¬hings)) {
return false;
}
dumper.dumpTagIndex(tagIndex);
break;
}
case uint16_t(Op::CatchAll): {
LabelKind unusedKind;
if (!iter.readCatchAll(&unusedKind, &unusedType, &unusedType,
¬hings)) {
return false;
}
break;
}
case uint16_t(Op::Delegate): {
uint32_t depth;
if (!iter.readDelegate(&depth, &unusedType, ¬hings)) {
return false;
}
iter.popDelegate();
dumper.dumpBlockDepth(depth);
break;
}
case uint16_t(Op::
Throw): {
uint32_t tagIndex;
if (!iter.readThrow(&tagIndex, ¬hings)) {
return false;
}
dumper.dumpTagIndex(tagIndex);
break;
}
case uint16_t(Op::Rethrow): {
uint32_t depth;
if (!iter.readRethrow(&depth)) {
return false;
}
dumper.dumpBlockDepth(depth);
break;
}
case uint16_t(Op::ThrowRef): {
if (!codeMeta.exnrefEnabled()) {
return iter.unrecognizedOpcode(&op);
}
if (!iter.readThrowRef(¬hing)) {
return false;
}
break;
}
case uint16_t(Op::TryTable): {
if (!codeMeta.exnrefEnabled()) {
return iter.unrecognizedOpcode(&op);
}
TryTableCatchVector catches;
if (!iter.readTryTable(&unusedType, &catches)) {
return false;
}
dumper.dumpTryTableCatches(catches);
break;
}
case uint16_t(Op::ThreadPrefix): {
// Though thread ops can be used on nonshared memories, we make them
// unavailable if shared memory has been disabled in the prefs, for
// maximum predictability and safety and consistency with JS.
if (codeMeta.sharedMemoryEnabled() == Shareable::
False) {
return iter.unrecognizedOpcode(&op);
}
switch (op.b1) {
case uint32_t(ThreadOp::Notify): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readNotify(&addr, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32Wait): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readWait(&addr, ValType::I32, 4, ¬hing, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64Wait): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readWait(&addr, ValType::I64, 8, ¬hing, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::Fence): {
if (!iter.readFence()) {
return false;
}
break;
}
case uint32_t(ThreadOp::I32AtomicLoad): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I32, 4)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicLoad): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I64, 8)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicLoad8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I32, 1)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicLoad16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I32, 2)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicLoad8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I64, 1)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicLoad16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I64, 2)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicLoad32U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicLoad(&addr, ValType::I64, 4)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicStore): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I32, 4, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicStore): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I64, 8, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicStore8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I32, 1, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicStore16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I32, 2, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicStore8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I64, 1, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicStore16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I64, 2, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicStore32U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicStore(&addr, ValType::I64, 4, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicAdd):
case uint32_t(ThreadOp::I32AtomicSub):
case uint32_t(ThreadOp::I32AtomicAnd):
case uint32_t(ThreadOp::I32AtomicOr):
case uint32_t(ThreadOp::I32AtomicXor):
case uint32_t(ThreadOp::I32AtomicXchg): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I32, 4, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicAdd):
case uint32_t(ThreadOp::I64AtomicSub):
case uint32_t(ThreadOp::I64AtomicAnd):
case uint32_t(ThreadOp::I64AtomicOr):
case uint32_t(ThreadOp::I64AtomicXor):
case uint32_t(ThreadOp::I64AtomicXchg): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I64, 8, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicAdd8U):
case uint32_t(ThreadOp::I32AtomicSub8U):
case uint32_t(ThreadOp::I32AtomicAnd8U):
case uint32_t(ThreadOp::I32AtomicOr8U):
case uint32_t(ThreadOp::I32AtomicXor8U):
case uint32_t(ThreadOp::I32AtomicXchg8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I32, 1, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicAdd16U):
case uint32_t(ThreadOp::I32AtomicSub16U):
case uint32_t(ThreadOp::I32AtomicAnd16U):
case uint32_t(ThreadOp::I32AtomicOr16U):
case uint32_t(ThreadOp::I32AtomicXor16U):
case uint32_t(ThreadOp::I32AtomicXchg16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I32, 2, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicAdd8U):
case uint32_t(ThreadOp::I64AtomicSub8U):
case uint32_t(ThreadOp::I64AtomicAnd8U):
case uint32_t(ThreadOp::I64AtomicOr8U):
case uint32_t(ThreadOp::I64AtomicXor8U):
case uint32_t(ThreadOp::I64AtomicXchg8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I64, 1, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicAdd16U):
case uint32_t(ThreadOp::I64AtomicSub16U):
case uint32_t(ThreadOp::I64AtomicAnd16U):
case uint32_t(ThreadOp::I64AtomicOr16U):
case uint32_t(ThreadOp::I64AtomicXor16U):
case uint32_t(ThreadOp::I64AtomicXchg16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I64, 2, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicAdd32U):
case uint32_t(ThreadOp::I64AtomicSub32U):
case uint32_t(ThreadOp::I64AtomicAnd32U):
case uint32_t(ThreadOp::I64AtomicOr32U):
case uint32_t(ThreadOp::I64AtomicXor32U):
case uint32_t(ThreadOp::I64AtomicXchg32U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicRMW(&addr, ValType::I64, 4, ¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicCmpXchg): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I32, 4, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicCmpXchg): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I64, 8, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicCmpXchg8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I32, 1, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I32AtomicCmpXchg16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I32, 2, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicCmpXchg8U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I64, 1, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicCmpXchg16U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I64, 2, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
case uint32_t(ThreadOp::I64AtomicCmpXchg32U): {
LinearMemoryAddress<Nothing> addr;
if (!iter.readAtomicCmpXchg(&addr, ValType::I64, 4, ¬hing,
¬hing)) {
return false;
}
dumper.dumpLinearMemoryAddress(addr);
break;
}
default:
return iter.unrecognizedOpcode(&op);
}
break;
}
case uint16_t(Op::MozPrefix):
return iter.unrecognizedOpcode(&op);
default:
return iter.unrecognizedOpcode(&op);
}
dumper.dumpOpEnd();
}
MOZ_CRASH(
"unreachable");
}
bool wasm::ValidateFunctionBody(
const CodeMetadata& codeMeta,
uint32_t funcIndex, uint32_t bodySize,
Decoder& d) {
const uint8_t* bodyBegin = d.currentPosition();
const uint8_t* bodyEnd = bodyBegin + bodySize;
ValTypeVector locals;
if (!DecodeLocalEntriesWithParams(d, codeMeta, funcIndex, &locals)) {
return false;
}
ValidatingOpIter iter(codeMeta, d, locals);
NopOpDumper visitor;
if (!iter.startFunction(funcIndex)) {
return false;
}
if (!ValidateOps(iter, visitor, codeMeta, bodyEnd)) {
return false;
}
return iter.endFunction(bodyEnd);
}
#ifdef DEBUG
bool wasm::DumpFunctionBody(
const CodeMetadata& codeMeta, uint32_t funcIndex,
const uint8_t* bodyBegin, uint32_t bodySize,
IndentedPrinter& out, UniqueChars* error) {
const uint8_t* bodyEnd = bodyBegin + bodySize;
Decoder d(bodyBegin, bodyEnd, 0, error);
ValTypeVector locals;
if (!DecodeLocalEntriesWithParams(d, codeMeta, funcIndex, &locals)) {
return false;
}
ValidatingOpIter iter(codeMeta, d, locals);
if (!iter.startFunction(funcIndex)) {
return false;
}
OpDumper visitor(out);
if (!ValidateOps(iter, visitor, codeMeta, bodyEnd)) {
return false;
}
return iter.endFunction(bodyEnd);
}
#endif
// Section macros.
static bool DecodePreamble(Decoder& d) {
if (d.bytesRemain() > MaxModuleBytes) {
return d.fail(
"module too big");
}
uint32_t u32;
if (!d.readFixedU32(&u32) || u32 != MagicNumber) {
return d.fail(
"failed to match magic number");
}
if (!d.readFixedU32(&u32) || u32 != EncodingVersion) {
return d.failf(
"binary version 0x%" PRIx32
" does not match expected version 0x%" PRIx32,
u32, EncodingVersion);
}
return true;
}
static bool DecodeValTypeVector(Decoder& d, CodeMetadata* codeMeta,
uint32_t count, ValTypeVector* valTypes) {
if (!valTypes->resize(count)) {
return false;
}
for (uint32_t i = 0; i < count; i++) {
if (!d.readValType(*codeMeta->types, codeMeta->features(),
&(*valTypes)[i])) {
return false;
}
}
return true;
}
static bool DecodeFuncType(Decoder& d, CodeMetadata* codeMeta,
FuncType* funcType) {
uint32_t numArgs;
if (!d.readVarU32(&numArgs)) {
return d.fail(
"bad number of function args");
}
if (numArgs > MaxParams) {
return d.fail(
"too many arguments in signature");
}
ValTypeVector args;
if (!DecodeValTypeVector(d, codeMeta, numArgs, &args)) {
return false;
}
uint32_t numResults;
if (!d.readVarU32(&numResults)) {
return d.fail(
"bad number of function returns");
}
if (numResults > MaxResults) {
return d.fail(
"too many returns in signature");
}
ValTypeVector results;
if (!DecodeValTypeVector(d, codeMeta, numResults, &results)) {
return false;
}
*funcType = FuncType(std::move(args), std::move(results));
return true;
}
static bool DecodeStructType(Decoder& d, CodeMetadata* codeMeta,
StructType* structType) {
uint32_t numFields;
if (!d.readVarU32(&numFields)) {
return d.fail(
"Bad number of fields");
}
if (numFields > MaxStructFields) {
return d.fail(
"too many fields in struct");
}
FieldTypeVector fields;
if (!fields.resize(numFields)) {
return false;
}
for (uint32_t i = 0; i < numFields; i++) {
if (!d.readStorageType(*codeMeta->types, codeMeta->features(),
&fields[i].type)) {
return false;
}
uint8_t flags;
if (!d.readFixedU8(&flags)) {
return d.fail(
"expected flag");
}
if ((flags & ~uint8_t(FieldFlags::AllowedMask)) != 0) {
return d.fail(
"garbage flag bits");
}
fields[i].isMutable = flags & uint8_t(FieldFlags::
Mutable);
}
*structType = StructType(std::move(fields));
// Compute the struct layout, and fail if the struct is too large
if (!structType->init()) {
return d.fail(
"too many fields in struct");
}
return true;
}
static bool DecodeArrayType(Decoder& d, CodeMetadata* codeMeta,
ArrayType* arrayType) {
StorageType elementType;
if (!d.readStorageType(*codeMeta->types, codeMeta->features(),
&elementType)) {
return false;
}
uint8_t flags;
if (!d.readFixedU8(&flags)) {
return d.fail(
"expected flag");
}
if ((flags & ~uint8_t(FieldFlags::AllowedMask)) != 0) {
return d.fail(
"garbage flag bits");
}
bool isMutable = flags & uint8_t(FieldFlags::
Mutable);
*arrayType = ArrayType(elementType, isMutable);
return true;
}
static bool DecodeTypeSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Type, codeMeta, &range,
"type")) {
return false;
}
if (!range) {
return true;
}
uint32_t numRecGroups;
if (!d.readVarU32(&numRecGroups)) {
return d.fail(
"expected number of types");
}
// Check if we've reached our implementation defined limit of recursion
// groups.
if (numRecGroups > MaxRecGroups) {
return d.fail(
"too many types");
}
for (uint32_t recGroupIndex = 0; recGroupIndex < numRecGroups;
recGroupIndex++) {
uint32_t recGroupLength = 1;
uint8_t firstTypeCode;
if (!d.peekByte(&firstTypeCode)) {
return d.fail(
"expected type form");
}
if (firstTypeCode == (uint8_t)TypeCode::RecGroup) {
// Skip over the prefix byte that was peeked.
d.uncheckedReadFixedU8();
// Read the number of types in this recursion group
if (!d.readVarU32(&recGroupLength)) {
return d.fail(
"expected recursion group length");
}
}
// Check if we've reached our implementation defined limit of type
// definitions.
mozilla::CheckedUint32 newNumTypes(codeMeta->types->length());
newNumTypes += recGroupLength;
if (!newNumTypes.isValid() || newNumTypes.value() > MaxTypes) {
return d.fail(
"too many types");
}
// Start a recursion group. This will extend the type context with empty
// type definitions to be filled.
MutableRecGroup recGroup = codeMeta->types->startRecGroup(recGroupLength);
if (!recGroup) {
return false;
}
// First, iterate over the types, validate them and set super types.
// Subtyping relationship will be checked in a second iteration.
for (uint32_t recGroupTypeIndex = 0; recGroupTypeIndex < recGroupLength;
recGroupTypeIndex++) {
uint32_t typeIndex =
codeMeta->types->length() - recGroupLength + recGroupTypeIndex;
// This is ensured by above
MOZ_ASSERT(typeIndex < MaxTypes);
uint8_t form;
const TypeDef* superTypeDef = nullptr;
// By default, all types are final unless the sub keyword is specified.
bool finalTypeFlag =
true;
// Decode an optional declared super type index.
if (d.peekByte(&form) && (form == (uint8_t)TypeCode::SubNoFinalType ||
form == (uint8_t)TypeCode::SubFinalType)) {
if (form == (uint8_t)TypeCode::SubNoFinalType) {
finalTypeFlag =
false;
}
// Skip over the `sub` or `final` prefix byte we peeked.
d.uncheckedReadFixedU8();
// Decode the number of super types, which is currently limited to at
// most one.
uint32_t numSuperTypes;
if (!d.readVarU32(&numSuperTypes)) {
return d.fail(
"expected number of super types");
}
if (numSuperTypes > 1) {
return d.fail(
"too many super types");
}
// Decode the super type, if any.
if (numSuperTypes == 1) {
uint32_t superTypeDefIndex;
if (!d.readVarU32(&superTypeDefIndex)) {
return d.fail(
"expected super type index");
}
// A super type index must be strictly less than the current type
// index in order to avoid cycles.
if (superTypeDefIndex >= typeIndex) {
return d.fail(
"invalid super type index");
}
superTypeDef = &codeMeta->types->type(superTypeDefIndex);
}
}
// Decode the kind of type definition
if (!d.readFixedU8(&form)) {
return d.fail(
"expected type form");
}
TypeDef*
typeDef = &recGroup->type(recGroupTypeIndex);
switch (form) {
case uint8_t(TypeCode::Func): {
FuncType funcType;
if (!DecodeFuncType(d, codeMeta, &funcType)) {
return false;
}
*
typeDef = std::move(funcType);
break;
}
case uint8_t(TypeCode::
Struct): {
StructType structType;
if (!DecodeStructType(d, codeMeta, &structType)) {
return false;
}
*
typeDef = std::move(structType);
break;
}
case uint8_t(TypeCode::Array): {
ArrayType arrayType;
if (!DecodeArrayType(d, codeMeta, &arrayType)) {
return false;
}
*
typeDef = std::move(arrayType);
break;
}
default:
return d.fail(
"expected type form");
}
typeDef->setFinal(finalTypeFlag);
if (superTypeDef) {
// Check that we aren't creating too deep of a subtyping chain
if (superTypeDef->subTypingDepth() >= MaxSubTypingDepth) {
return d.fail(
"type is too deep");
}
typeDef->setSuperTypeDef(superTypeDef);
}
if (typeDef->isFuncType()) {
typeDef->funcType().initImmediateTypeId(typeDef->isFinal(),
superTypeDef, recGroupLength);
}
}
// Check the super types to make sure they are compatible with their
// subtypes. This is done in a second iteration to avoid dealing with not
// yet loaded types.
for (uint32_t recGroupTypeIndex = 0; recGroupTypeIndex < recGroupLength;
recGroupTypeIndex++) {
TypeDef*
typeDef = &recGroup->type(recGroupTypeIndex);
if (typeDef->superTypeDef()) {
// Check that the super type is compatible with this type
if (!
TypeDef::canBeSubTypeOf(
typeDef, typeDef->superTypeDef())) {
return d.fail(
"incompatible super type");
}
}
}
// Finish the recursion group, which will canonicalize the types.
if (!codeMeta->types->endRecGroup()) {
return false;
}
}
return d.finishSection(*range,
"type");
}
[[nodiscard]]
static bool DecodeName(Decoder& d, CacheableName* name) {
uint32_t numBytes;
if (!d.readVarU32(&numBytes)) {
return false;
}
if (numBytes > MaxStringBytes) {
return false;
}
const uint8_t* bytes;
if (!d.readBytes(numBytes, &bytes)) {
return false;
}
if (!IsUtf8(AsChars(Span(bytes, numBytes)))) {
return false;
}
UTF8Bytes utf8Bytes;
if (!utf8Bytes.resizeUninitialized(numBytes)) {
return false;
}
memcpy(utf8Bytes.begin(), bytes, numBytes);
*name = CacheableName(std::move(utf8Bytes));
return true;
}
static bool DecodeFuncTypeIndex(Decoder& d,
const SharedTypeContext& types,
uint32_t* funcTypeIndex) {
if (!d.readVarU32(funcTypeIndex)) {
return d.fail(
"expected signature index");
}
if (*funcTypeIndex >= types->length()) {
return d.fail(
"signature index out of range");
}
const TypeDef& def = (*types)[*funcTypeIndex];
if (!def.isFuncType()) {
return d.fail(
"signature index references non-signature");
}
return true;
}
static bool DecodeLimitBound(Decoder& d, AddressType addressType,
uint64_t* bound) {
if (addressType == AddressType::I64) {
return d.readVarU64(bound);
}
// Spec tests assert that we only decode a LEB32 when address type is I32.
uint32_t bound32;
if (!d.readVarU32(&bound32)) {
return false;
}
*bound = bound32;
return true;
}
static bool DecodeLimits(Decoder& d, LimitsKind kind, Limits* limits) {
uint8_t flags;
if (!d.readFixedU8(&flags)) {
return d.fail(
"expected flags");
}
uint8_t mask = kind == LimitsKind::Memory ? uint8_t(LimitsMask::Memory)
: uint8_t(LimitsMask::Table);
if (flags & ~uint8_t(mask)) {
return d.failf(
"unexpected bits set in flags: %" PRIu32,
uint32_t(flags & ~uint8_t(mask)));
}
// Memory limits may be shared
if (kind == LimitsKind::Memory) {
if ((flags & uint8_t(LimitsFlags::IsShared)) &&
!(flags & uint8_t(LimitsFlags::HasMaximum))) {
return d.fail(
"maximum length required for shared memory");
}
limits->shared = (flags & uint8_t(LimitsFlags::IsShared))
? Shareable::
True
: Shareable::
False;
}
else {
limits->shared = Shareable::
False;
}
#ifdef ENABLE_WASM_MEMORY64
limits->addressType = (flags & uint8_t(LimitsFlags::IsI64))
? AddressType::I64
: AddressType::I32;
#else
limits->addressType = AddressType::I32;
if (flags & uint8_t(LimitsFlags::IsI64)) {
return d.fail(
"i64 is not supported for memory or table limits");
}
#endif
uint64_t initial;
if (!DecodeLimitBound(d, limits->addressType, &initial)) {
return d.fail(
"expected initial length");
}
limits->initial = initial;
if (flags & uint8_t(LimitsFlags::HasMaximum)) {
uint64_t maximum;
if (!DecodeLimitBound(d, limits->addressType, &maximum)) {
return d.fail(
"expected maximum length");
}
if (limits->initial > maximum) {
return d.failf(
"%s size minimum must not be greater than maximum; "
"maximum length %" PRIu64
" is less than initial length %" PRIu64,
kind == LimitsKind::Memory ?
"memory" :
"table", maximum,
limits->initial);
}
limits->maximum.emplace(maximum);
}
return true;
}
static bool DecodeTableTypeAndLimits(Decoder& d, CodeMetadata* codeMeta) {
bool initExprPresent =
false;
uint8_t typeCode;
if (!d.peekByte(&typeCode)) {
return d.fail(
"expected type code");
}
if (typeCode == (uint8_t)TypeCode::TableHasInitExpr) {
d.uncheckedReadFixedU8();
uint8_t flags;
if (!d.readFixedU8(&flags) || flags != 0) {
return d.fail(
"expected reserved byte to be 0");
}
initExprPresent =
true;
}
RefType tableElemType;
if (!d.readRefType(*codeMeta->types, codeMeta->features(), &tableElemType)) {
return false;
}
Limits limits;
if (!DecodeLimits(d, LimitsKind::Table, &limits)) {
return false;
}
if (limits.addressType == AddressType::I64 && !codeMeta->memory64Enabled()) {
return d.fail(
"memory64 is disabled");
}
// If there's a maximum, check it is in range. The check to exclude
// initial > maximum is carried out by the DecodeLimits call above, so
// we don't repeat it here.
if (limits.initial > MaxTableElemsValidation(limits.addressType) ||
((limits.maximum.isSome() &&
limits.maximum.value() >
MaxTableElemsValidation(limits.addressType)))) {
return d.fail(
"too many table elements");
}
if (codeMeta->tables.length() >= MaxTables) {
return d.fail(
"too many tables");
}
Maybe<InitExpr> initExpr;
if (initExprPresent) {
InitExpr initializer;
if (!InitExpr::decodeAndValidate(d, codeMeta, tableElemType,
&initializer)) {
return false;
}
initExpr = Some(std::move(initializer));
}
else {
if (!tableElemType.isNullable()) {
return d.fail(
"table with non-nullable references requires initializer");
}
}
return codeMeta->tables.emplaceBack(limits, tableElemType,
std::move(initExpr),
/* isAsmJS */ false);
}
static bool DecodeGlobalType(Decoder& d,
const SharedTypeContext& types,
const FeatureArgs& features, ValType* type,
bool* isMutable) {
if (!d.readValType(*types, features, type)) {
return d.fail(
"expected global type");
}
uint8_t flags;
if (!d.readFixedU8(&flags)) {
return d.fail(
"expected global flags");
}
if (flags & ~uint8_t(GlobalTypeImmediate::AllowedMask)) {
return d.fail(
"unexpected bits set in global flags");
}
*isMutable = flags & uint8_t(GlobalTypeImmediate::IsMutable);
return true;
}
static bool DecodeMemoryTypeAndLimits(Decoder& d, CodeMetadata* codeMeta,
MemoryDescVector* memories) {
if (!codeMeta->features().multiMemory && codeMeta->numMemories() == 1) {
return d.fail(
"already have default memory");
}
if (codeMeta->numMemories() >= MaxMemories) {
return d.fail(
"too many memories");
}
Limits limits;
if (!DecodeLimits(d, LimitsKind::Memory, &limits)) {
return false;
}
uint64_t maxField = MaxMemoryPagesValidation(limits.addressType);
if (limits.initial > maxField) {
return d.fail(
"initial memory size too big");
}
if (limits.maximum && *limits.maximum > maxField) {
return d.fail(
"maximum memory size too big");
}
if (limits.shared == Shareable::
True &&
codeMeta->sharedMemoryEnabled() == Shareable::
False) {
return d.fail(
"shared memory is disabled");
}
if (limits.addressType == AddressType::I64 && !codeMeta->memory64Enabled()) {
return d.fail(
"memory64 is disabled");
}
return memories->emplaceBack(MemoryDesc(limits));
}
static bool DecodeTag(Decoder& d, CodeMetadata* codeMeta, TagKind* tagKind,
uint32_t* funcTypeIndex) {
uint32_t tagCode;
if (!d.readVarU32(&tagCode)) {
return d.fail(
"expected tag kind");
}
if (TagKind(tagCode) != TagKind::Exception) {
return d.fail(
"illegal tag kind");
}
*tagKind = TagKind(tagCode);
if (!d.readVarU32(funcTypeIndex)) {
return d.fail(
"expected function index in tag");
}
if (*funcTypeIndex >= codeMeta->numTypes()) {
return d.fail(
"function type index in tag out of bounds");
}
if (!(*codeMeta->types)[*funcTypeIndex].isFuncType()) {
return d.fail(
"function type index must index a function type");
}
if ((*codeMeta->types)[*funcTypeIndex].funcType().results().length() != 0) {
return d.fail(
"tag function types must not return anything");
}
return true;
}
static bool DecodeImport(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
CacheableName moduleName;
if (!DecodeName(d, &moduleName)) {
return d.fail(
"expected valid import module name");
}
CacheableName fieldName;
if (!DecodeName(d, &fieldName)) {
return d.fail(
"expected valid import field name");
}
uint8_t rawImportKind;
if (!d.readFixedU8(&rawImportKind)) {
return d.fail(
"failed to read import kind");
}
DefinitionKind importKind = DefinitionKind(rawImportKind);
switch (importKind) {
case DefinitionKind::Function: {
uint32_t funcTypeIndex;
if (!DecodeFuncTypeIndex(d, codeMeta->types, &funcTypeIndex)) {
return false;
}
if (!codeMeta->funcs.append(FuncDesc(funcTypeIndex))) {
return false;
}
if (codeMeta->funcs.length() > MaxFuncs) {
return d.fail(
"too many functions");
}
break;
}
case DefinitionKind::Table: {
if (!DecodeTableTypeAndLimits(d, codeMeta)) {
return false;
}
codeMeta->tables.back().isImported =
true;
break;
}
case DefinitionKind::Memory: {
if (!DecodeMemoryTypeAndLimits(d, codeMeta, &codeMeta->memories)) {
return false;
}
break;
}
case DefinitionKind::Global: {
ValType type;
bool isMutable;
if (!DecodeGlobalType(d, codeMeta->types, codeMeta->features(), &type,
&isMutable)) {
return false;
}
if (!codeMeta->globals.append(
GlobalDesc(type, isMutable, codeMeta->globals.length()))) {
return false;
}
if (codeMeta->globals.length() > MaxGlobals) {
return d.fail(
"too many globals");
}
break;
}
case DefinitionKind::Tag: {
TagKind tagKind;
uint32_t funcTypeIndex;
if (!DecodeTag(d, codeMeta, &tagKind, &funcTypeIndex)) {
return false;
}
MutableTagType tagType = js_new<TagType>();
if (!tagType ||
!tagType->initialize(&(*codeMeta->types)[funcTypeIndex])) {
return false;
}
if (!codeMeta->tags.emplaceBack(tagKind, tagType)) {
return false;
}
if (codeMeta->tags.length() > MaxTags) {
return d.fail(
"too many tags");
}
break;
}
default:
return d.fail(
"unsupported import kind");
}
return moduleMeta->imports.emplaceBack(std::move(moduleName),
std::move(fieldName), importKind);
}
static bool CheckImportsAgainstBuiltinModules(Decoder& d,
CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
const BuiltinModuleIds& builtinModules = codeMeta->features().builtinModules;
// Skip this pass if there are no builtin modules enabled
if (builtinModules.hasNone()) {
return true;
}
uint32_t importFuncIndex = 0;
uint32_t importGlobalIndex = 0;
for (
auto& import : moduleMeta->imports) {
Maybe<BuiltinModuleId> builtinModule =
ImportMatchesBuiltinModule(import.module.utf8Bytes(), builtinModules);
switch (import.kind) {
case DefinitionKind::Function: {
const FuncDesc& func = codeMeta->funcs[importFuncIndex];
uint32_t funcIndex = importFuncIndex;
importFuncIndex += 1;
// Skip this import if it doesn't refer to a builtin module. We do have
// to increment the import function index regardless though.
if (!builtinModule) {
continue;
}
// Check if this import refers to a builtin module function
const BuiltinModuleFunc* builtinFunc = nullptr;
BuiltinModuleFuncId builtinFuncId;
if (!ImportMatchesBuiltinModuleFunc(import.field.utf8Bytes(),
*builtinModule, &builtinFunc,
&builtinFuncId)) {
return d.fail(
"unrecognized builtin module field");
}
const TypeDef& importTypeDef = (*codeMeta->types)[func.typeIndex];
if (!
TypeDef::isSubTypeOf(builtinFunc->
typeDef(), &importTypeDef)) {
return d.failf(
"type mismatch in %s", builtinFunc->exportName());
}
codeMeta->knownFuncImports[funcIndex] = builtinFuncId;
break;
}
case DefinitionKind::Global: {
const GlobalDesc& global = codeMeta->globals[importGlobalIndex];
importGlobalIndex += 1;
// Skip this import if it doesn't refer to a builtin module. We do have
// to increment the import global index regardless though.
if (!builtinModule) {
continue;
}
// Only the imported string constants module has globals defined.
if (*builtinModule != BuiltinModuleId::JSStringConstants) {
return d.fail(
"unrecognized builtin module field");
}
// All imported globals must match a provided global type of
// `(global (ref extern))`.
if (global.isMutable() ||
!ValType::isSubTypeOf(ValType(RefType::extern_().asNonNullable()),
global.type())) {
return d.failf(
"type mismatch");
}
break;
}
default: {
if (!builtinModule) {
continue;
}
return d.fail(
"unrecognized builtin import");
}
}
}
return true;
}
static bool DecodeImportSection(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Import, codeMeta, &range,
"import")) {
return false;
}
if (!range) {
return true;
}
uint32_t numImports;
if (!d.readVarU32(&numImports)) {
return d.fail(
"failed to read number of imports");
}
if (numImports > MaxImports) {
return d.fail(
"too many imports");
}
for (uint32_t i = 0; i < numImports; i++) {
if (!DecodeImport(d, codeMeta, moduleMeta)) {
return false;
}
}
if (!d.finishSection(*range,
"import")) {
return false;
}
codeMeta->numFuncImports = codeMeta->funcs.length();
if (!codeMeta->knownFuncImports.resize(codeMeta->numFuncImports)) {
return false;
}
codeMeta->numGlobalImports = codeMeta->globals.length();
return true;
}
static bool DecodeFunctionSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Function, codeMeta, &range,
"function")) {
return false;
}
if (!range) {
return true;
}
uint32_t numDefs;
if (!d.readVarU32(&numDefs)) {
return d.fail(
"expected number of function definitions");
}
CheckedInt<uint32_t> numFuncs = codeMeta->funcs.length();
numFuncs += numDefs;
if (!numFuncs.isValid() || numFuncs.value() > MaxFuncs) {
return d.fail(
"too many functions");
}
if (!codeMeta->funcs.reserve(numFuncs.value())) {
return false;
}
for (uint32_t i = 0; i < numDefs; i++) {
uint32_t funcTypeIndex;
if (!DecodeFuncTypeIndex(d, codeMeta->types, &funcTypeIndex)) {
return false;
}
codeMeta->funcs.infallibleAppend(funcTypeIndex);
}
return d.finishSection(*range,
"function");
}
static bool DecodeTableSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Table, codeMeta, &range,
"table")) {
return false;
}
if (!range) {
return true;
}
uint32_t numTables;
if (!d.readVarU32(&numTables)) {
return d.fail(
"failed to read number of tables");
}
for (uint32_t i = 0; i < numTables; ++i) {
if (!DecodeTableTypeAndLimits(d, codeMeta)) {
return false;
}
}
return d.finishSection(*range,
"table");
}
static bool DecodeMemorySection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Memory, codeMeta, &range,
"memory")) {
return false;
}
if (!range) {
return true;
}
uint32_t numMemories;
if (!d.readVarU32(&numMemories)) {
return d.fail(
"failed to read number of memories");
}
if (!codeMeta->features().multiMemory && numMemories > 1) {
return d.fail(
"the number of memories must be at most one");
}
for (uint32_t i = 0; i < numMemories; ++i) {
if (!DecodeMemoryTypeAndLimits(d, codeMeta, &codeMeta->memories)) {
return false;
}
}
return d.finishSection(*range,
"memory");
}
static bool DecodeGlobalSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Global, codeMeta, &range,
"global")) {
return false;
}
if (!range) {
return true;
}
uint32_t numDefs;
if (!d.readVarU32(&numDefs)) {
return d.fail(
"expected number of globals");
}
CheckedInt<uint32_t> numGlobals = codeMeta->globals.length();
numGlobals += numDefs;
if (!numGlobals.isValid() || numGlobals.value() > MaxGlobals) {
return d.fail(
"too many globals");
}
if (!codeMeta->globals.reserve(numGlobals.value())) {
return false;
}
for (uint32_t i = 0; i < numDefs; i++) {
ValType type;
bool isMutable;
if (!DecodeGlobalType(d, codeMeta->types, codeMeta->features(), &type,
&isMutable)) {
return false;
}
InitExpr initializer;
if (!InitExpr::decodeAndValidate(d, codeMeta, type, &initializer)) {
return false;
}
codeMeta->globals.infallibleAppend(
GlobalDesc(std::move(initializer), isMutable));
}
return d.finishSection(*range,
"global");
}
static bool DecodeTagSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Tag, codeMeta, &range,
"tag")) {
return false;
}
if (!range) {
return true;
}
uint32_t numDefs;
if (!d.readVarU32(&numDefs)) {
return d.fail(
"expected number of tags");
}
CheckedInt<uint32_t> numTags = codeMeta->tags.length();
numTags += numDefs;
if (!numTags.isValid() || numTags.value() > MaxTags) {
return d.fail(
"too many tags");
}
if (!codeMeta->tags.reserve(numTags.value())) {
return false;
}
for (uint32_t i = 0; i < numDefs; i++) {
TagKind tagKind;
uint32_t funcTypeIndex;
if (!DecodeTag(d, codeMeta, &tagKind, &funcTypeIndex)) {
return false;
}
MutableTagType tagType = js_new<TagType>();
if (!tagType || !tagType->initialize(&(*codeMeta->types)[funcTypeIndex])) {
return false;
}
codeMeta->tags.infallibleEmplaceBack(tagKind, tagType);
}
return d.finishSection(*range,
"tag");
}
using NameSet = HashSet<Span<
char>, NameHasher, SystemAllocPolicy>;
[[nodiscard]]
static bool DecodeExportName(Decoder& d, NameSet* dupSet,
CacheableName* exportName) {
if (!DecodeName(d, exportName)) {
d.fail(
"expected valid export name");
return false;
}
NameSet::AddPtr p = dupSet->lookupForAdd(exportName->utf8Bytes());
if (p) {
d.fail(
"duplicate export");
return false;
}
return dupSet->add(p, exportName->utf8Bytes());
}
static bool DecodeExport(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta, NameSet* dupSet) {
CacheableName fieldName;
if (!DecodeExportName(d, dupSet, &fieldName)) {
return false;
}
uint8_t exportKind;
if (!d.readFixedU8(&exportKind)) {
return d.fail(
"failed to read export kind");
}
switch (DefinitionKind(exportKind)) {
case DefinitionKind::Function: {
uint32_t funcIndex;
if (!d.readVarU32(&funcIndex)) {
return d.fail(
"expected function index");
}
if (funcIndex >= codeMeta->numFuncs()) {
return d.fail(
"exported function index out of bounds");
}
codeMeta->funcs[funcIndex].declareFuncExported(
/* eager */ true,
/* canRefFunc */ true);
return moduleMeta->exports.emplaceBack(std::move(fieldName), funcIndex,
DefinitionKind::Function);
}
case DefinitionKind::Table: {
uint32_t tableIndex;
if (!d.readVarU32(&tableIndex)) {
return d.fail(
"expected table index");
}
if (tableIndex >= codeMeta->tables.length()) {
return d.fail(
"exported table index out of bounds");
}
codeMeta->tables[tableIndex].isExported =
true;
return moduleMeta->exports.emplaceBack(std::move(fieldName), tableIndex,
DefinitionKind::Table);
}
case DefinitionKind::Memory: {
uint32_t memoryIndex;
if (!d.readVarU32(&memoryIndex)) {
return d.fail(
"expected memory index");
}
if (memoryIndex >= codeMeta->numMemories()) {
return d.fail(
"exported memory index out of bounds");
}
return moduleMeta->exports.emplaceBack(std::move(fieldName), memoryIndex,
DefinitionKind::Memory);
}
case DefinitionKind::Global: {
uint32_t globalIndex;
if (!d.readVarU32(&globalIndex)) {
return d.fail(
"expected global index");
}
if (globalIndex >= codeMeta->globals.length()) {
return d.fail(
"exported global index out of bounds");
}
GlobalDesc* global = &codeMeta->globals[globalIndex];
global->setIsExport();
return moduleMeta->exports.emplaceBack(std::move(fieldName), globalIndex,
DefinitionKind::Global);
}
case DefinitionKind::Tag: {
uint32_t tagIndex;
if (!d.readVarU32(&tagIndex)) {
return d.fail(
"expected tag index");
}
if (tagIndex >= codeMeta->tags.length()) {
return d.fail(
"exported tag index out of bounds");
}
codeMeta->tags[tagIndex].isExport =
true;
return moduleMeta->exports.emplaceBack(std::move(fieldName), tagIndex,
DefinitionKind::Tag);
}
default:
return d.fail(
"unexpected export kind");
}
MOZ_CRASH(
"unreachable");
}
static bool DecodeExportSection(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Export, codeMeta, &range,
"export")) {
return false;
}
if (!range) {
return true;
}
NameSet dupSet;
uint32_t numExports;
if (!d.readVarU32(&numExports)) {
return d.fail(
"failed to read number of exports");
}
if (numExports > MaxExports) {
return d.fail(
"too many exports");
}
for (uint32_t i = 0; i < numExports; i++) {
if (!DecodeExport(d, codeMeta, moduleMeta, &dupSet)) {
return false;
}
}
return d.finishSection(*range,
"export");
}
static bool DecodeStartSection(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Start, codeMeta, &range,
"start")) {
return false;
}
if (!range) {
return true;
}
uint32_t funcIndex;
if (!d.readVarU32(&funcIndex)) {
return d.fail(
"failed to read start func index");
}
if (funcIndex >= codeMeta->numFuncs()) {
return d.fail(
"unknown start function");
}
const FuncType& funcType = codeMeta->getFuncType(funcIndex);
if (funcType.results().length() > 0) {
return d.fail(
"start function must not return anything");
}
if (funcType.args().length()) {
return d.fail(
"start function must be nullary");
}
codeMeta->funcs[funcIndex].declareFuncExported(
/* eager */ true,
/* canFuncRef */ false);
codeMeta->startFuncIndex = Some(funcIndex);
return d.finishSection(*range,
"start");
}
static inline ModuleElemSegment::Kind NormalizeElemSegmentKind(
ElemSegmentKind decodedKind) {
switch (decodedKind) {
case ElemSegmentKind::Active:
case ElemSegmentKind::ActiveWithTableIndex: {
return ModuleElemSegment::Kind::Active;
}
case ElemSegmentKind::Passive: {
return ModuleElemSegment::Kind::Passive;
}
case ElemSegmentKind::Declared: {
return ModuleElemSegment::Kind::Declared;
}
}
MOZ_CRASH(
"unexpected elem segment kind");
}
static bool DecodeElemSegment(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
uint32_t segmentFlags;
if (!d.readVarU32(&segmentFlags)) {
return d.fail(
"expected elem segment flags field");
}
Maybe<ElemSegmentFlags> flags = ElemSegmentFlags::construct(segmentFlags);
if (!flags) {
return d.fail(
"invalid elem segment flags field");
}
ModuleElemSegment seg = ModuleElemSegment();
ElemSegmentKind segmentKind = flags->kind();
seg.kind = NormalizeElemSegmentKind(segmentKind);
if (segmentKind == ElemSegmentKind::Active ||
segmentKind == ElemSegmentKind::ActiveWithTableIndex) {
if (codeMeta->tables.length() == 0) {
return d.fail(
"active elem segment requires a table");
}
uint32_t tableIndex = 0;
if (segmentKind == ElemSegmentKind::ActiveWithTableIndex &&
!d.readVarU32(&tableIndex)) {
return d.fail(
"expected table index");
}
if (tableIndex >= codeMeta->tables.length()) {
return d.fail(
"table index out of range for element segment");
}
seg.tableIndex = tableIndex;
InitExpr offset;
if (!InitExpr::decodeAndValidate(
d, codeMeta, ToValType(codeMeta->tables[tableIndex].addressType()),
&offset)) {
return false;
}
seg.offsetIfActive.emplace(std::move(offset));
}
else {
// Too many bugs result from keeping this value zero. For passive
// or declared segments, there really is no table index, and we should
// never touch the field.
MOZ_ASSERT(segmentKind == ElemSegmentKind::Passive ||
segmentKind == ElemSegmentKind::Declared);
seg.tableIndex = (uint32_t)-1;
}
ElemSegmentPayload payload = flags->payload();
RefType elemType;
// `ActiveWithTableIndex`, `Declared`, and `Passive` element segments encode
// the type or definition kind of the payload. `Active` element segments are
// restricted to MVP behavior, which assumes only function indices.
if (segmentKind == ElemSegmentKind::Active) {
// Bizarrely, the spec prescribes that the default type is (ref func) when
// encoding function indices, and (ref null func) when encoding expressions.
elemType = payload == ElemSegmentPayload::Expressions
? RefType::func()
: RefType::func().asNonNullable();
}
else {
switch (payload) {
case ElemSegmentPayload::Expressions: {
if (!d.readRefType(*codeMeta->types, codeMeta->features(), &elemType)) {
return false;
}
}
break;
case ElemSegmentPayload::Indices: {
uint8_t elemKind;
if (!d.readFixedU8(&elemKind)) {
return d.fail(
"expected element kind");
}
if (elemKind != uint8_t(DefinitionKind::Function)) {
return d.fail(
"invalid element kind");
}
elemType = RefType::func().asNonNullable();
}
break;
}
}
// For active segments, check if the element type is compatible with the
// destination table type.
if (seg.active()) {
RefType tblElemType = codeMeta->tables[seg.tableIndex].elemType;
if (!CheckIsSubtypeOf(d, *codeMeta, d.currentOffset(),
ValType(elemType).storageType(),
ValType(tblElemType).storageType())) {
return false;
}
}
seg.elemType = elemType;
uint32_t numElems;
if (!d.readVarU32(&numElems)) {
return d.fail(
"expected element segment size");
}
if (numElems > MaxElemSegmentLength) {
return d.fail(
"too many elements in element segment");
}
bool isAsmJS = seg.active() && codeMeta->tables[seg.tableIndex].isAsmJS;
switch (payload) {
case ElemSegmentPayload::Indices: {
seg.encoding = ModuleElemSegment::Encoding::Indices;
if (!seg.elemIndices.reserve(numElems)) {
return false;
}
for (uint32_t i = 0; i < numElems; i++) {
uint32_t elemIndex;
if (!d.readVarU32(&elemIndex)) {
return d.fail(
"failed to read element index");
}
// The only valid type of index right now is a function index.
if (elemIndex >= codeMeta->numFuncs()) {
return d.fail(
"element index out of range");
}
seg.elemIndices.infallibleAppend(elemIndex);
if (!isAsmJS) {
codeMeta->funcs[elemIndex].declareFuncExported(
/*eager=*/false,
/*canRefFunc=*/true);
}
}
}
break;
case ElemSegmentPayload::Expressions: {
seg.encoding = ModuleElemSegment::Encoding::Expressions;
const uint8_t* exprsStart = d.currentPosition();
seg.elemExpressions.count = numElems;
for (uint32_t i = 0; i < numElems; i++) {
Maybe<LitVal> unusedLiteral;
if (!DecodeConstantExpression(d, codeMeta, elemType, &unusedLiteral)) {
return false;
}
}
const uint8_t* exprsEnd = d.currentPosition();
if (!seg.elemExpressions.exprBytes.append(exprsStart, exprsEnd)) {
return false;
}
}
break;
}
codeMeta->elemSegmentTypes.infallibleAppend(seg.elemType);
moduleMeta->elemSegments.infallibleAppend(std::move(seg));
return true;
}
static bool DecodeElemSection(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Elem, codeMeta, &range,
"elem")) {
return false;
}
if (!range) {
return true;
}
uint32_t numSegments;
if (!d.readVarU32(&numSegments)) {
return d.fail(
"failed to read number of elem segments");
}
if (numSegments > MaxElemSegments) {
return d.fail(
"too many elem segments");
}
if (!moduleMeta->elemSegments.reserve(numSegments) ||
!codeMeta->elemSegmentTypes.reserve(numSegments)) {
return false;
}
for (uint32_t i = 0; i < numSegments; i++) {
if (!DecodeElemSegment(d, codeMeta, moduleMeta)) {
return false;
}
}
return d.finishSection(*range,
"elem");
}
static bool DecodeDataCountSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::DataCount, codeMeta, &range,
"datacount")) {
return false;
}
if (!range) {
return true;
}
uint32_t dataCount;
if (!d.readVarU32(&dataCount)) {
return d.fail(
"expected data segment count");
}
codeMeta->dataCount.emplace(dataCount);
return d.finishSection(*range,
"datacount");
}
bool wasm::StartsCodeSection(
const uint8_t* begin,
const uint8_t* end,
BytecodeRange* codeSection) {
UniqueChars unused;
Decoder d(begin, end, 0, &unused);
if (!DecodePreamble(d)) {
return false;
}
while (!d.done()) {
uint8_t id;
BytecodeRange range;
if (!d.readSectionHeader(&id, &range)) {
return false;
}
if (id == uint8_t(SectionId::Code)) {
*codeSection = range;
return true;
}
if (!d.readBytes(range.size)) {
return false;
}
}
return false;
}
#ifdef ENABLE_WASM_BRANCH_HINTING
static bool ParseBranchHintingSection(Decoder& d, CodeMetadata* codeMeta) {
uint32_t functionCount;
if (!d.readVarU32(&functionCount)) {
return d.fail(
"failed to read function count");
}
for (uint32_t i = 0; i < functionCount; i++) {
uint32_t functionIndex;
if (!d.readVarU32(&functionIndex)) {
return d.fail(
"failed to read function index");
}
// Disallow branch hints on imported functions.
if ((functionIndex >= codeMeta->funcs.length()) ||
(functionIndex < codeMeta->numFuncImports)) {
return d.fail(
"invalid function index in branch hint");
}
uint32_t hintCount;
if (!d.readVarU32(&hintCount)) {
return d.fail(
"failed to read hint count");
}
BranchHintVector hintVector;
if (!hintVector.reserve(hintCount)) {
return false;
}
// Branch hint offsets must appear in increasing byte offset order, at most
// once for each offset.
uint32_t prevOffsetPlus1 = 0;
for (uint32_t hintIndex = 0; hintIndex < hintCount; hintIndex++) {
uint32_t branchOffset;
if (!d.readVarU32(&branchOffset)) {
return d.fail(
"failed to read branch offset");
}
if (branchOffset <= prevOffsetPlus1) {
return d.fail(
"Invalid offset in code hint");
}
uint32_t reserved;
if (!d.readVarU32(&reserved) || (reserved != 1)) {
return d.fail(
"Invalid reserved value for code hint");
}
uint32_t branchHintValue;
if (!d.readVarU32(&branchHintValue) ||
(branchHintValue >= MaxBranchHintValue)) {
return d.fail(
"Invalid branch hint value");
}
BranchHint branchHint =
static_cast<BranchHint>(branchHintValue);
BranchHintEntry entry(branchOffset, branchHint);
hintVector.infallibleAppend(entry);
prevOffsetPlus1 = branchOffset;
}
// Save this collection in the module
if (!codeMeta->branchHints.addHintsForFunc(functionIndex,
std::move(hintVector))) {
return false;
}
}
return true;
}
static bool DecodeBranchHintingSection(Decoder& d, CodeMetadata* codeMeta) {
MaybeBytecodeRange range;
if (!d.startCustomSection(BranchHintingSectionName, codeMeta, &range)) {
return false;
}
if (!range) {
return true;
}
// Skip this custom section if errors are encountered during parsing.
if (!ParseBranchHintingSection(d, codeMeta)) {
codeMeta->branchHints.setFailedAndClear();
}
d.finishCustomSection(BranchHintingSectionName, *range);
return true;
}
#endif
bool wasm::DecodeModuleEnvironment(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
if (!DecodePreamble(d)) {
return false;
}
if (!DecodeTypeSection(d, codeMeta)) {
return false;
}
if (!DecodeImportSection(d, codeMeta, moduleMeta)) {
return false;
}
// Eagerly check imports for future link errors against any known builtin
// module.
if (!CheckImportsAgainstBuiltinModules(d, codeMeta, moduleMeta)) {
return false;
}
if (!DecodeFunctionSection(d, codeMeta)) {
return false;
}
if (!DecodeTableSection(d, codeMeta)) {
return false;
}
if (!DecodeMemorySection(d, codeMeta)) {
return false;
}
if (!DecodeTagSection(d, codeMeta)) {
return false;
}
if (!DecodeGlobalSection(d, codeMeta)) {
return false;
}
if (!DecodeExportSection(d, codeMeta, moduleMeta)) {
return false;
}
if (!DecodeStartSection(d, codeMeta, moduleMeta)) {
return false;
}
if (!DecodeElemSection(d, codeMeta, moduleMeta)) {
return false;
}
if (!DecodeDataCountSection(d, codeMeta)) {
return false;
}
#ifdef ENABLE_WASM_BRANCH_HINTING
if (codeMeta->branchHintingEnabled() &&
!DecodeBranchHintingSection(d, codeMeta)) {
return false;
}
#endif
if (!d.startSection(SectionId::Code, codeMeta, &codeMeta->codeSectionRange,
"code")) {
return false;
}
if (codeMeta->codeSectionRange &&
codeMeta->codeSectionRange->size > MaxCodeSectionBytes) {
return d.fail(
"code section too big");
}
return true;
}
static bool DecodeFunctionBody(Decoder& d,
const CodeMetadata& codeMeta,
uint32_t funcIndex) {
uint32_t bodySize;
if (!d.readVarU32(&bodySize)) {
return d.fail(
"expected number of function body bytes");
}
if (bodySize > MaxFunctionBytes) {
return d.fail(
"function body too big");
}
if (d.bytesRemain() < bodySize) {
return d.fail(
"function body length too big");
}
return ValidateFunctionBody(codeMeta, funcIndex, bodySize, d);
}
static bool DecodeCodeSection(Decoder& d, CodeMetadata* codeMeta) {
if (!codeMeta->codeSectionRange) {
if (codeMeta->numFuncDefs() != 0) {
return d.fail(
"expected code section");
}
return true;
}
uint32_t numFuncDefs;
if (!d.readVarU32(&numFuncDefs)) {
return d.fail(
"expected function body count");
}
if (numFuncDefs != codeMeta->numFuncDefs()) {
return d.fail(
"function body count does not match function signature count");
}
for (uint32_t funcDefIndex = 0; funcDefIndex < numFuncDefs; funcDefIndex++) {
if (!DecodeFunctionBody(d, *codeMeta,
codeMeta->numFuncImports + funcDefIndex)) {
return false;
}
}
return d.finishSection(*codeMeta->codeSectionRange,
"code");
}
static bool DecodeDataSection(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
MaybeBytecodeRange range;
if (!d.startSection(SectionId::Data, codeMeta, &range,
"data")) {
return false;
}
if (!range) {
if (codeMeta->dataCount.isSome() && *codeMeta->dataCount > 0) {
return d.fail(
"number of data segments does not match declared count");
}
return true;
}
uint32_t numSegments;
if (!d.readVarU32(&numSegments)) {
return d.fail(
"failed to read number of data segments");
}
if (numSegments > MaxDataSegments) {
return d.fail(
"too many data segments");
}
if (codeMeta->dataCount.isSome() && numSegments != *codeMeta->dataCount) {
return d.fail(
"number of data segments does not match declared count");
}
for (uint32_t i = 0; i < numSegments; i++) {
uint32_t initializerKindVal;
if (!d.readVarU32(&initializerKindVal)) {
return d.fail(
"expected data initializer-kind field");
}
switch (initializerKindVal) {
case uint32_t(DataSegmentKind::Active):
case uint32_t(DataSegmentKind::Passive):
case uint32_t(DataSegmentKind::ActiveWithMemoryIndex):
break;
default:
return d.fail(
"invalid data initializer-kind field");
}
DataSegmentKind initializerKind = DataSegmentKind(initializerKindVal);
if (initializerKind != DataSegmentKind::Passive &&
codeMeta->numMemories() == 0) {
return d.fail(
"active data segment requires a memory section");
}
DataSegmentRange segRange;
if (initializerKind == DataSegmentKind::ActiveWithMemoryIndex) {
if (!d.readVarU32(&segRange.memoryIndex)) {
return d.fail(
"expected memory index");
}
}
else if (initializerKind == DataSegmentKind::Active) {
segRange.memoryIndex = 0;
}
else {
segRange.memoryIndex = InvalidMemoryIndex;
}
if (initializerKind == DataSegmentKind::Active ||
initializerKind == DataSegmentKind::ActiveWithMemoryIndex) {
if (segRange.memoryIndex >= codeMeta->numMemories()) {
return d.fail(
"invalid memory index");
}
InitExpr segOffset;
ValType exprType =
ToValType(codeMeta->memories[segRange.memoryIndex].addressType());
if (!InitExpr::decodeAndValidate(d, codeMeta, exprType, &segOffset)) {
return false;
}
segRange.offsetIfActive.emplace(std::move(segOffset));
}
if (!d.readVarU32(&segRange.length)) {
return d.fail(
"expected segment size");
}
if (segRange.length > MaxDataSegmentLengthPages * PageSize) {
return d.fail(
"segment size too big");
}
segRange.bytecodeOffset = d.currentOffset();
if (!d.readBytes(segRange.length)) {
return d.fail(
"data segment shorter than declared");
}
if (!moduleMeta->dataSegmentRanges.append(std::move(segRange))) {
return false;
}
}
return d.finishSection(*range,
"data");
}
static bool DecodeModuleNameSubsection(Decoder& d,
const CustomSectionRange& nameSection,
CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
Maybe<uint32_t> endOffset;
if (!d.startNameSubsection(NameType::Module, &endOffset)) {
return false;
}
if (!endOffset) {
return true;
}
Name moduleName;
if (!d.readVarU32(&moduleName.length)) {
return d.fail(
"failed to read module name length");
}
MOZ_ASSERT(d.currentOffset() >= nameSection.payloadOffset);
moduleName.offsetInNamePayload =
d.currentOffset() - nameSection.payloadOffset;
const uint8_t* bytes;
if (!d.readBytes(moduleName.length, &bytes)) {
return d.fail(
"failed to read module name bytes");
}
if (!d.finishNameSubsection(*endOffset)) {
return false;
}
// Only save the module name if the whole subsection validates.
codeMeta->moduleName.emplace(moduleName);
return true;
}
static bool DecodeFunctionNameSubsection(Decoder& d,
const CustomSectionRange& nameSection,
CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
Maybe<uint32_t> endOffset;
if (!d.startNameSubsection(NameType::Function, &endOffset)) {
return false;
}
if (!endOffset) {
return true;
}
uint32_t nameCount = 0;
if (!d.readVarU32(&nameCount) || nameCount > MaxFuncs) {
return d.fail(
"bad function name count");
}
NameVector funcNames;
for (uint32_t i = 0; i < nameCount; ++i) {
uint32_t funcIndex = 0;
if (!d.readVarU32(&funcIndex)) {
return d.fail(
"unable to read function index");
}
// Names must refer to real functions and be given in ascending order.
if (funcIndex >= codeMeta->numFuncs() || funcIndex < funcNames.length()) {
return d.fail(
"invalid function index");
}
Name funcName;
if (!d.readVarU32(&funcName.length) ||
funcName.length > JS::MaxStringLength) {
return d.fail(
"unable to read function name length");
}
if (!funcName.length) {
continue;
}
if (!funcNames.resize(funcIndex + 1)) {
return false;
}
MOZ_ASSERT(d.currentOffset() >= nameSection.payloadOffset);
funcName.offsetInNamePayload =
d.currentOffset() - nameSection.payloadOffset;
if (!d.readBytes(funcName.length)) {
return d.fail(
"unable to read function name bytes");
}
funcNames[funcIndex] = funcName;
}
if (!d.finishNameSubsection(*endOffset)) {
return false;
}
// To encourage fully valid function names subsections; only save names if
// the entire subsection decoded correctly.
codeMeta->funcNames = std::move(funcNames);
return true;
}
static bool DecodeNameSection(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
MaybeBytecodeRange range;
if (!d.startCustomSection(NameSectionName, codeMeta, &range)) {
return false;
}
if (!range) {
return true;
}
codeMeta->nameCustomSectionIndex =
Some(codeMeta->customSectionRanges.length() - 1);
const CustomSectionRange& nameSection = codeMeta->customSectionRanges.back();
// Once started, custom sections do not report validation errors.
if (!DecodeModuleNameSubsection(d, nameSection, codeMeta, moduleMeta)) {
goto finish;
}
if (!DecodeFunctionNameSubsection(d, nameSection, codeMeta, moduleMeta)) {
goto finish;
}
while (d.currentOffset() < range->end()) {
if (!d.skipNameSubsection()) {
goto finish;
}
}
finish:
d.finishCustomSection(NameSectionName, *range);
return true;
}
bool wasm::DecodeModuleTail(Decoder& d, CodeMetadata* codeMeta,
ModuleMetadata* moduleMeta) {
if (!DecodeDataSection(d, codeMeta, moduleMeta)) {
return false;
}
if (!DecodeNameSection(d, codeMeta, moduleMeta)) {
return false;
}
while (!d.done()) {
if (!d.skipCustomSection(codeMeta)) {
if (d.resilientMode()) {
d.clearError();
return true;
}
return false;
}
}
return true;
}
// Validate algorithm.
bool wasm::Validate(JSContext* cx,
const ShareableBytes& bytecode,
const FeatureOptions& options, UniqueChars* error) {
Decoder d(bytecode.vector, 0, error);
FeatureArgs features = FeatureArgs::build(cx, options);
SharedCompileArgs compileArgs = CompileArgs::buildForValidation(features);
if (!compileArgs) {
return false;
}
MutableModuleMetadata moduleMeta = js_new<ModuleMetadata>();
if (!moduleMeta || !moduleMeta->init(*compileArgs)) {
return false;
}
MutableCodeMetadata codeMeta = moduleMeta->codeMeta;
if (!DecodeModuleEnvironment(d, codeMeta, moduleMeta)) {
return false;
}
if (!DecodeCodeSection(d, codeMeta)) {
return false;
}
if (!DecodeModuleTail(d, codeMeta, moduleMeta)) {
return false;
}
MOZ_ASSERT(!*error,
"unreported error in decoding");
return true;
}
