Files
wazero/internal/engine/compiler/engine.go
2023-06-26 12:41:51 +08:00

1571 lines
58 KiB
Go

package compiler
import (
"context"
"errors"
"fmt"
"reflect"
"runtime"
"sort"
"sync"
"unsafe"
"github.com/tetratelabs/wazero/api"
"github.com/tetratelabs/wazero/experimental"
"github.com/tetratelabs/wazero/internal/asm"
"github.com/tetratelabs/wazero/internal/bitpack"
"github.com/tetratelabs/wazero/internal/filecache"
"github.com/tetratelabs/wazero/internal/internalapi"
"github.com/tetratelabs/wazero/internal/platform"
"github.com/tetratelabs/wazero/internal/version"
"github.com/tetratelabs/wazero/internal/wasm"
"github.com/tetratelabs/wazero/internal/wasmdebug"
"github.com/tetratelabs/wazero/internal/wasmruntime"
"github.com/tetratelabs/wazero/internal/wazeroir"
)
// NOTE: The offset of many of the struct fields defined here are referenced from
// assembly using the constants below such as moduleEngineFunctionsOffset.
// If changing a struct, update the constant and associated tests as needed.
type (
// engine is a Compiler implementation of wasm.Engine
engine struct {
enabledFeatures api.CoreFeatures
codes map[wasm.ModuleID]*compiledModule // guarded by mutex.
fileCache filecache.Cache
mux sync.RWMutex
// setFinalizer defaults to runtime.SetFinalizer, but overridable for tests.
setFinalizer func(obj interface{}, finalizer interface{})
wazeroVersion string
}
// moduleEngine implements wasm.ModuleEngine
moduleEngine struct {
// See note at top of file before modifying this struct.
// functions are the functions in a module instances.
// The index is module instance-scoped. We intentionally avoid using map
// as the underlying memory region is accessed by assembly directly by using
// codesElement0Address.
functions []function
}
// callEngine holds context per moduleEngine.Call, and shared across all the
// function calls originating from the same moduleEngine.Call execution.
//
// This implements api.Function.
callEngine struct {
internalapi.WazeroOnlyType
// See note at top of file before modifying this struct.
// These contexts are read and written by compiled code.
// Note: structs are embedded to reduce the costs to access fields inside them. Also, this eases field offset
// calculation.
moduleContext
stackContext
exitContext
archContext
// The following fields are not accessed by compiled code directly.
// stack is the go-allocated stack for holding values and call frames.
// Note: We never edit len or cap in compiled code, so we won't get screwed when GC comes in.
//
// At any point of execution, say currently executing function F2 which was called by F1, then
// the stack should look like like:
//
// [..., arg0, arg1, ..., argN, _, _, _, v1, v2, v3, ....
// ^ { }
// | F1's callFrame
// |
// stackBasePointer
//
// where
// - callFrame is the F1's callFrame which called F2. It contains F1's return address, F1's base pointer, and F1's *function.
// - stackBasePointer is the stack base pointer stored at (callEngine stackContext.stackBasePointerInBytes)
// - arg0, ..., argN are the function parameters, and v1, v2, v3,... are the local variables
// including the non-function param locals as well as the temporary variable produced by instructions (e.g i32.const).
//
// If the F2 makes a function call to F3 which takes two arguments, then the stack will become:
//
// [..., arg0, arg1, ..., argN, _, _, _, v1, v2, v3, _, _, _
// { } ^ { }
// F1's callFrame | F2's callFrame
// |
// stackBasePointer
// where
// - F2's callFrame is pushed above the v2 and v3 (arguments for F3).
// - The previous stackBasePointer (pointed at arg0) was saved inside the F2's callFrame.
//
// Then, if F3 returns one result, say w1, then the result will look like:
//
// [..., arg0, arg1, ..., argN, _, _, _, v1, w1, ...
// ^ { }
// | F1's callFrame
// |
// stackBasePointer
//
// where
// - stackBasePointer was reverted to the position at arg0
// - The result from F3 was pushed above v1
//
// If the number of parameters is smaller than that of return values, then the empty slots are reserved
// below the callFrame to store the results on teh return.
// For example, if F3 takes no parameter but returns N(>0) results, then the stack
// after making a call against F3 will look like:
//
// [..., arg0, arg1, ..., argN, _, _, _, v1, v2, v3, res_1, _, res_N, _, _, _
// { } ^ { }
// F1's callFrame | F2's callFrame
// |
// stackBasePointer
// where res_1, ..., res_N are the reserved slots below the call frame. In general,
// the number of reserved slots equals max(0, len(results)-len(params).
//
// This reserved slots are necessary to save the result values onto the stack while not destroying
// the callFrame value on function returns.
stack []uint64
// initialFn is the initial function for this call engine.
initialFn *function
// stackIterator provides a way to iterate over the stack for Listeners.
// It is setup and valid only during a call to a Listener hook.
stackIterator stackIterator
ensureTermination bool
}
// moduleContext holds the per-function call specific module information.
// This is subject to be manipulated from compiled native code whenever we make function calls.
moduleContext struct {
// See note at top of file before modifying this struct.
// fn holds the currently executed *function.
fn *function
// moduleInstance is the address of module instance from which we initialize
// the following fields. This is set whenever we enter a function or return from function calls.
//
// On the entry to the native code, this must be initialized to zero to let native code preamble know
// that this is the initial function call (which leads to moduleContext initialization pass).
moduleInstance *wasm.ModuleInstance //lint:ignore U1000 This is only used by Compiler code.
// globalElement0Address is the address of the first element in the global slice,
// i.e. &ModuleInstance.Globals[0] as uintptr.
globalElement0Address uintptr
// memoryElement0Address is the address of the first element in the global slice,
// i.e. &ModuleInstance.Memory.Buffer[0] as uintptr.
memoryElement0Address uintptr
// memorySliceLen is the length of the memory buffer, i.e. len(ModuleInstance.Memory.Buffer).
memorySliceLen uint64
// memoryInstance holds the memory instance for this module instance.
memoryInstance *wasm.MemoryInstance
// tableElement0Address is the address of the first item in the tables slice,
// i.e. &ModuleInstance.Tables[0] as uintptr.
tablesElement0Address uintptr
// functionsElement0Address is &moduleContext.functions[0] as uintptr.
functionsElement0Address uintptr
// typeIDsElement0Address holds the &ModuleInstance.TypeIDs[0] as uintptr.
typeIDsElement0Address uintptr
// dataInstancesElement0Address holds the &ModuleInstance.DataInstances[0] as uintptr.
dataInstancesElement0Address uintptr
// elementInstancesElement0Address holds the &ModuleInstance.ElementInstances[0] as uintptr.
elementInstancesElement0Address uintptr
}
// stackContext stores the data to access engine.stack.
stackContext struct {
// See note at top of file before modifying this struct.
// stackPointer on .stack field which is accessed by stack[stackBasePointer+stackBasePointerInBytes*8].
//
// Note: stackPointer is not used in assembly since the native code knows exact position of
// each variable in the value stack from the info from compilation.
// Therefore, only updated when native code exit from the Compiler world and go back to the Go function.
stackPointer uint64
// stackBasePointerInBytes is updated whenever we make function calls.
// Background: Functions might be compiled as if they use the stack from the bottom.
// However, in reality, they have to use it from the middle of the stack depending on
// when these function calls are made. So instead of accessing stack via stackPointer alone,
// functions are compiled, so they access the stack via [stackBasePointer](fixed for entire function) + [stackPointer].
// More precisely, stackBasePointer is set to [callee's stack pointer] + [callee's stack base pointer] - [caller's params].
// This way, compiled functions can be independent of the timing of functions calls made against them.
stackBasePointerInBytes uint64
// stackElement0Address is &engine.stack[0] as uintptr.
// Note: this is updated when growing the stack in builtinFunctionGrowStack.
stackElement0Address uintptr
// stackLenInBytes is len(engine.stack[0]) * 8 (bytes).
// Note: this is updated when growing the stack in builtinFunctionGrowStack.
stackLenInBytes uint64
}
// exitContext will be manipulated whenever compiled native code returns into the Go function.
exitContext struct {
// See note at top of file before modifying this struct.
// Where we store the status code of Compiler execution.
statusCode nativeCallStatusCode
// Set when statusCode == compilerStatusCallBuiltInFunction
// Indicating the function call index.
builtinFunctionCallIndex wasm.Index
// returnAddress is the return address which the engine jumps into
// after executing a builtin function or host function.
returnAddress uintptr
// callerModuleInstance holds the caller's wasm.ModuleInstance, and is only valid if currently executing a host function.
callerModuleInstance *wasm.ModuleInstance
}
// callFrame holds the information to which the caller function can return.
// This is mixed in callEngine.stack with other Wasm values just like any other
// native program (where the stack is the system stack though), and we retrieve the struct
// with unsafe pointer casts.
callFrame struct {
// See note at top of file before modifying this struct.
// returnAddress is the return address to which the engine jumps when the callee function returns.
returnAddress uintptr
// returnStackBasePointerInBytes is the stack base pointer to set on stackContext.stackBasePointerInBytes
// when the callee function returns.
returnStackBasePointerInBytes uint64
// function is the caller *function, and is used to retrieve the stack trace.
// Note: should be possible to revive *function from returnAddress, but might be costly.
function *function
}
// Function corresponds to function instance in Wasm, and is created from `code`.
function struct {
// See note at top of file before modifying this struct.
// codeInitialAddress is the pre-calculated pointer pointing to the initial byte of .codeSegment slice.
// That mean codeInitialAddress always equals uintptr(unsafe.Pointer(&.codeSegment[0]))
// and we cache the value (uintptr(unsafe.Pointer(&.codeSegment[0]))) to this field,
// so we don't need to repeat the calculation on each function call.
codeInitialAddress uintptr
// moduleInstance holds the address of source.ModuleInstance.
moduleInstance *wasm.ModuleInstance
// typeID is the corresponding wasm.FunctionTypeID for funcType.
typeID wasm.FunctionTypeID
// funcType is the function type for this function. Created during compilation.
funcType *wasm.FunctionType
// parent holds code from which this is created.
parent *compiledFunction
}
compiledModule struct {
executable asm.CodeSegment
functions []compiledFunction
source *wasm.Module
ensureTermination bool
}
// compiledFunction corresponds to a function in a module (not instantiated one). This holds the machine code
// compiled by wazero compiler.
compiledFunction struct {
// codeSegment is holding the compiled native code as a byte slice.
executableOffset uintptr
// See the doc for codeStaticData type.
// stackPointerCeil is the max of the stack pointer this function can reach. Lazily applied via maybeGrowStack.
stackPointerCeil uint64
index wasm.Index
goFunc interface{}
listener experimental.FunctionListener
parent *compiledModule
sourceOffsetMap sourceOffsetMap
}
// sourceOffsetMap holds the information to retrieve the original offset in
// the Wasm binary from the offset in the native binary.
//
// The fields are implemented as bit-packed arrays of 64 bits integers to
// reduce the memory footprint. Indexing into such arrays is not as fast as
// indexing into a simple slice, but the source offset map is intended to be
// used for debugging, lookups into the arrays should not appear on code
// paths that are critical to the application performance.
//
// The bitpack.OffsetArray fields may be nil, use bitpack.OffsetArrayLen to
// determine whether they are empty prior to indexing into the arrays to
// avoid panics caused by accessing nil pointers.
sourceOffsetMap struct {
// See note at top of file before modifying this struct.
// irOperationOffsetsInNativeBinary is index-correlated with irOperationSourceOffsetsInWasmBinary,
// and maps each index (corresponding to each IR Operation) to the offset in the compiled native code.
irOperationOffsetsInNativeBinary bitpack.OffsetArray
// irOperationSourceOffsetsInWasmBinary is index-correlated with irOperationOffsetsInNativeBinary.
// See wazeroir.CompilationResult irOperationOffsetsInNativeBinary.
irOperationSourceOffsetsInWasmBinary bitpack.OffsetArray
}
// functionListenerInvocation captures arguments needed to perform function
// listener invocations when unwinding the call stack.
functionListenerInvocation struct {
experimental.FunctionListener
def api.FunctionDefinition
}
)
// Native code reads/writes Go's structs with the following constants.
// See TestVerifyOffsetValue for how to derive these values.
const (
// Offsets for moduleEngine.functions
moduleEngineFunctionsOffset = 0
// Offsets for callEngine moduleContext.
callEngineModuleContextFnOffset = 0
callEngineModuleContextModuleInstanceOffset = 8
callEngineModuleContextGlobalElement0AddressOffset = 16
callEngineModuleContextMemoryElement0AddressOffset = 24
callEngineModuleContextMemorySliceLenOffset = 32
callEngineModuleContextMemoryInstanceOffset = 40
callEngineModuleContextTablesElement0AddressOffset = 48
callEngineModuleContextFunctionsElement0AddressOffset = 56
callEngineModuleContextTypeIDsElement0AddressOffset = 64
callEngineModuleContextDataInstancesElement0AddressOffset = 72
callEngineModuleContextElementInstancesElement0AddressOffset = 80
// Offsets for callEngine stackContext.
callEngineStackContextStackPointerOffset = 88
callEngineStackContextStackBasePointerInBytesOffset = 96
callEngineStackContextStackElement0AddressOffset = 104
callEngineStackContextStackLenInBytesOffset = 112
// Offsets for callEngine exitContext.
callEngineExitContextNativeCallStatusCodeOffset = 120
callEngineExitContextBuiltinFunctionCallIndexOffset = 124
callEngineExitContextReturnAddressOffset = 128
callEngineExitContextCallerModuleInstanceOffset = 136
// Offsets for function.
functionCodeInitialAddressOffset = 0
functionModuleInstanceOffset = 8
functionTypeIDOffset = 16
functionSize = 40
// Offsets for wasm.ModuleInstance.
moduleInstanceGlobalsOffset = 32
moduleInstanceMemoryOffset = 56
moduleInstanceTablesOffset = 64
moduleInstanceEngineOffset = 88
moduleInstanceTypeIDsOffset = 104
moduleInstanceDataInstancesOffset = 128
moduleInstanceElementInstancesOffset = 152
// Offsets for wasm.TableInstance.
tableInstanceTableOffset = 0
tableInstanceTableLenOffset = 8
// Offsets for wasm.MemoryInstance.
memoryInstanceBufferOffset = 0
memoryInstanceBufferLenOffset = 8
// Offsets for wasm.GlobalInstance.
globalInstanceValueOffset = 8
// Offsets for Go's interface.
// https://research.swtch.com/interfaces
// https://github.com/golang/go/blob/release-branch.go1.20/src/runtime/runtime2.go#L207-L210
interfaceDataOffset = 8
// Consts for wasm.DataInstance.
dataInstanceStructSize = 24
// Consts for wasm.ElementInstance.
elementInstanceStructSize = 32
// pointerSizeLog2 satisfies: 1 << pointerSizeLog2 = sizeOf(uintptr)
pointerSizeLog2 = 3
// callFrameDataSizeInUint64 is the size of callFrame struct per 8 bytes (= size of uint64).
callFrameDataSizeInUint64 = 24 / 8
)
// nativeCallStatusCode represents the result of `nativecall`.
// This is set by the native code.
type nativeCallStatusCode uint32
const (
// nativeCallStatusCodeReturned means the nativecall reaches the end of function, and returns successfully.
nativeCallStatusCodeReturned nativeCallStatusCode = iota
// nativeCallStatusCodeCallGoHostFunction means the nativecall returns to make a host function call.
nativeCallStatusCodeCallGoHostFunction
// nativeCallStatusCodeCallBuiltInFunction means the nativecall returns to make a builtin function call.
nativeCallStatusCodeCallBuiltInFunction
// nativeCallStatusCodeUnreachable means the function invocation reaches "unreachable" instruction.
nativeCallStatusCodeUnreachable
// nativeCallStatusCodeInvalidFloatToIntConversion means an invalid conversion of integer to floats happened.
nativeCallStatusCodeInvalidFloatToIntConversion
// nativeCallStatusCodeMemoryOutOfBounds means an out-of-bounds memory access happened.
nativeCallStatusCodeMemoryOutOfBounds
// nativeCallStatusCodeInvalidTableAccess means either offset to the table was out of bounds of table, or
// the target element in the table was uninitialized during call_indirect instruction.
nativeCallStatusCodeInvalidTableAccess
// nativeCallStatusCodeTypeMismatchOnIndirectCall means the type check failed during call_indirect.
nativeCallStatusCodeTypeMismatchOnIndirectCall
nativeCallStatusIntegerOverflow
nativeCallStatusIntegerDivisionByZero
nativeCallStatusModuleClosed
)
// causePanic causes a panic with the corresponding error to the nativeCallStatusCode.
func (s nativeCallStatusCode) causePanic() {
var err error
switch s {
case nativeCallStatusIntegerOverflow:
err = wasmruntime.ErrRuntimeIntegerOverflow
case nativeCallStatusIntegerDivisionByZero:
err = wasmruntime.ErrRuntimeIntegerDivideByZero
case nativeCallStatusCodeInvalidFloatToIntConversion:
err = wasmruntime.ErrRuntimeInvalidConversionToInteger
case nativeCallStatusCodeUnreachable:
err = wasmruntime.ErrRuntimeUnreachable
case nativeCallStatusCodeMemoryOutOfBounds:
err = wasmruntime.ErrRuntimeOutOfBoundsMemoryAccess
case nativeCallStatusCodeInvalidTableAccess:
err = wasmruntime.ErrRuntimeInvalidTableAccess
case nativeCallStatusCodeTypeMismatchOnIndirectCall:
err = wasmruntime.ErrRuntimeIndirectCallTypeMismatch
}
panic(err)
}
func (s nativeCallStatusCode) String() (ret string) {
switch s {
case nativeCallStatusCodeReturned:
ret = "returned"
case nativeCallStatusCodeCallGoHostFunction:
ret = "call_host_function"
case nativeCallStatusCodeCallBuiltInFunction:
ret = "call_builtin_function"
case nativeCallStatusCodeUnreachable:
ret = "unreachable"
case nativeCallStatusCodeInvalidFloatToIntConversion:
ret = "invalid float to int conversion"
case nativeCallStatusCodeMemoryOutOfBounds:
ret = "memory out of bounds"
case nativeCallStatusCodeInvalidTableAccess:
ret = "invalid table access"
case nativeCallStatusCodeTypeMismatchOnIndirectCall:
ret = "type mismatch on indirect call"
case nativeCallStatusIntegerOverflow:
ret = "integer overflow"
case nativeCallStatusIntegerDivisionByZero:
ret = "integer division by zero"
case nativeCallStatusModuleClosed:
ret = "module closed"
default:
panic("BUG")
}
return
}
// releaseCompiledModule is a runtime.SetFinalizer function that munmaps the compiledModule.executable.
func releaseCompiledModule(cm *compiledModule) {
if err := cm.executable.Unmap(); err != nil {
// munmap failure cannot recover, and happen asynchronously on the
// finalizer thread. While finalizer functions can return errors,
// they are ignored.
panic(fmt.Errorf("compiler: failed to munmap code segment: %w", err))
}
}
// CompiledModuleCount implements the same method as documented on wasm.Engine.
func (e *engine) CompiledModuleCount() uint32 {
return uint32(len(e.codes))
}
// DeleteCompiledModule implements the same method as documented on wasm.Engine.
func (e *engine) DeleteCompiledModule(module *wasm.Module) {
e.deleteCompiledModule(module)
}
// Close implements the same method as documented on wasm.Engine.
func (e *engine) Close() (err error) {
e.mux.Lock()
defer e.mux.Unlock()
// Releasing the references to compiled codes including the memory-mapped machine codes.
for i := range e.codes {
for j := range e.codes[i].functions {
e.codes[i].functions[j].parent = nil
}
}
e.codes = nil
return
}
// CompileModule implements the same method as documented on wasm.Engine.
func (e *engine) CompileModule(_ context.Context, module *wasm.Module, listeners []experimental.FunctionListener, ensureTermination bool) error {
if _, ok, err := e.getCompiledModule(module, listeners); ok { // cache hit!
return nil
} else if err != nil {
return err
}
irCompiler, err := wazeroir.NewCompiler(e.enabledFeatures, callFrameDataSizeInUint64, module, ensureTermination)
if err != nil {
return err
}
var withGoFunc bool
localFuncs, importedFuncs := len(module.FunctionSection), module.ImportFunctionCount
cm := &compiledModule{
functions: make([]compiledFunction, localFuncs),
ensureTermination: ensureTermination,
source: module,
}
if localFuncs == 0 {
return e.addCompiledModule(module, cm, withGoFunc)
}
// As this uses mmap, we need to munmap on the compiled machine code when it's GCed.
e.setFinalizer(cm, releaseCompiledModule)
ln := len(listeners)
cmp := newCompiler()
asmNodes := new(asmNodes)
offsets := new(offsets)
// The executable code is allocated in memory mappings held by the
// CodeSegment, which gros on demand when it exhausts its capacity.
var executable asm.CodeSegment
defer func() {
// At the end of the function, the executable is set on the compiled
// module and the local variable cleared; until then, the function owns
// the memory mapping and is reponsible for clearing it if it returns
// due to an error. Note that an error at this stage is not recoverable
// so we panic if we fail to unmap the memory segment.
if err := executable.Unmap(); err != nil {
panic(fmt.Errorf("compiler: failed to munmap code segment: %w", err))
}
}()
for i := range module.CodeSection {
typ := &module.TypeSection[module.FunctionSection[i]]
buf := executable.NextCodeSection()
funcIndex := wasm.Index(i)
compiledFn := &cm.functions[i]
compiledFn.executableOffset = executable.Size()
compiledFn.parent = cm
compiledFn.index = importedFuncs + funcIndex
if i < ln {
compiledFn.listener = listeners[i]
}
if codeSeg := &module.CodeSection[i]; codeSeg.GoFunc != nil {
cmp.Init(typ, nil, compiledFn.listener != nil)
withGoFunc = true
if err = compileGoDefinedHostFunction(buf, cmp); err != nil {
def := module.FunctionDefinition(compiledFn.index)
return fmt.Errorf("error compiling host go func[%s]: %w", def.DebugName(), err)
}
compiledFn.goFunc = codeSeg.GoFunc
} else {
ir, err := irCompiler.Next()
if err != nil {
return fmt.Errorf("failed to lower func[%d]: %v", i, err)
}
cmp.Init(typ, ir, compiledFn.listener != nil)
compiledFn.stackPointerCeil, compiledFn.sourceOffsetMap, err = compileWasmFunction(buf, cmp, ir, asmNodes, offsets)
if err != nil {
def := module.FunctionDefinition(compiledFn.index)
return fmt.Errorf("error compiling wasm func[%s]: %w", def.DebugName(), err)
}
}
}
if runtime.GOARCH == "arm64" {
// On arm64, we cannot give all of rwx at the same time, so we change it to exec.
if err := platform.MprotectRX(executable.Bytes()); err != nil {
return err
}
}
cm.executable, executable = executable, asm.CodeSegment{}
return e.addCompiledModule(module, cm, withGoFunc)
}
// NewModuleEngine implements the same method as documented on wasm.Engine.
func (e *engine) NewModuleEngine(module *wasm.Module, instance *wasm.ModuleInstance) (wasm.ModuleEngine, error) {
me := &moduleEngine{
functions: make([]function, len(module.FunctionSection)+int(module.ImportFunctionCount)),
}
// Note: imported functions are resolved in moduleEngine.ResolveImportedFunction.
cm, ok, err := e.getCompiledModule(module,
// listeners arg is not needed here since NewModuleEngine is called after CompileModule which
// ensures the association of listener with *code.
nil)
if !ok {
return nil, errors.New("source module must be compiled before instantiation")
} else if err != nil {
return nil, err
}
for i := range cm.functions {
c := &cm.functions[i]
offset := int(module.ImportFunctionCount) + i
typeIndex := module.FunctionSection[i]
me.functions[offset] = function{
codeInitialAddress: cm.executable.Addr() + c.executableOffset,
moduleInstance: instance,
typeID: instance.TypeIDs[typeIndex],
funcType: &module.TypeSection[typeIndex],
parent: c,
}
}
return me, nil
}
// ResolveImportedFunction implements wasm.ModuleEngine.
func (e *moduleEngine) ResolveImportedFunction(index, indexInImportedModule wasm.Index, importedModuleEngine wasm.ModuleEngine) {
imported := importedModuleEngine.(*moduleEngine)
// Copies the content from the import target moduleEngine.
e.functions[index] = imported.functions[indexInImportedModule]
}
// FunctionInstanceReference implements the same method as documented on wasm.ModuleEngine.
func (e *moduleEngine) FunctionInstanceReference(funcIndex wasm.Index) wasm.Reference {
return uintptr(unsafe.Pointer(&e.functions[funcIndex]))
}
// NewFunction implements wasm.ModuleEngine.
func (e *moduleEngine) NewFunction(index wasm.Index) api.Function {
return e.newFunction(&e.functions[index])
}
func (e *moduleEngine) newFunction(f *function) api.Function {
initStackSize := initialStackSize
if initialStackSize < f.parent.stackPointerCeil {
initStackSize = f.parent.stackPointerCeil * 2
}
return e.newCallEngine(initStackSize, f)
}
// LookupFunction implements the same method as documented on wasm.ModuleEngine.
func (e *moduleEngine) LookupFunction(t *wasm.TableInstance, typeId wasm.FunctionTypeID, tableOffset wasm.Index) (f api.Function, err error) {
if tableOffset >= uint32(len(t.References)) || t.Type != wasm.RefTypeFuncref {
err = wasmruntime.ErrRuntimeInvalidTableAccess
return
}
rawPtr := t.References[tableOffset]
if rawPtr == 0 {
err = wasmruntime.ErrRuntimeInvalidTableAccess
return
}
tf := functionFromUintptr(rawPtr)
if tf.typeID != typeId {
err = wasmruntime.ErrRuntimeIndirectCallTypeMismatch
return
}
f = e.newFunction(tf)
return
}
// functionFromUintptr resurrects the original *function from the given uintptr
// which comes from either funcref table or OpcodeRefFunc instruction.
func functionFromUintptr(ptr uintptr) *function {
// Wraps ptrs as the double pointer in order to avoid the unsafe access as detected by race detector.
//
// For example, if we have (*function)(unsafe.Pointer(ptr)) instead, then the race detector's "checkptr"
// subroutine wanrs as "checkptr: pointer arithmetic result points to invalid allocation"
// https://github.com/golang/go/blob/1ce7fcf139417d618c2730010ede2afb41664211/src/runtime/checkptr.go#L69
var wrapped *uintptr = &ptr
return *(**function)(unsafe.Pointer(wrapped))
}
// Definition implements the same method as documented on wasm.ModuleEngine.
func (ce *callEngine) Definition() api.FunctionDefinition {
return ce.initialFn.definition()
}
func (f *function) definition() api.FunctionDefinition {
compiled := f.parent
return compiled.parent.source.FunctionDefinition(compiled.index)
}
// Call implements the same method as documented on wasm.ModuleEngine.
func (ce *callEngine) Call(ctx context.Context, params ...uint64) (results []uint64, err error) {
ft := ce.initialFn.funcType
if n := ft.ParamNumInUint64; n != len(params) {
return nil, fmt.Errorf("expected %d params, but passed %d", n, len(params))
}
return ce.call(ctx, params, nil)
}
// CallWithStack implements the same method as documented on wasm.ModuleEngine.
func (ce *callEngine) CallWithStack(ctx context.Context, stack []uint64) error {
params, results, err := wasm.SplitCallStack(ce.initialFn.funcType, stack)
if err != nil {
return err
}
_, err = ce.call(ctx, params, results)
return err
}
func (ce *callEngine) call(ctx context.Context, params, results []uint64) (_ []uint64, err error) {
m := ce.initialFn.moduleInstance
if ce.ensureTermination {
select {
case <-ctx.Done():
// If the provided context is already done, close the call context
// and return the error.
m.CloseWithCtxErr(ctx)
return nil, m.FailIfClosed()
default:
}
}
// We ensure that this Call method never panics as
// this Call method is indirectly invoked by embedders via store.CallFunction,
// and we have to make sure that all the runtime errors, including the one happening inside
// host functions, will be captured as errors, not panics.
defer func() {
err = ce.deferredOnCall(ctx, m, recover())
if err == nil {
// If the module closed during the call, and the call didn't err for another reason, set an ExitError.
err = m.FailIfClosed()
}
}()
ft := ce.initialFn.funcType
ce.initializeStack(ft, params)
if ce.ensureTermination {
done := m.CloseModuleOnCanceledOrTimeout(ctx)
defer done()
}
ce.execWasmFunction(ctx, m)
// This returns a safe copy of the results, instead of a slice view. If we
// returned a re-slice, the caller could accidentally or purposefully
// corrupt the stack of subsequent calls.
if results == nil && ft.ResultNumInUint64 > 0 {
results = make([]uint64, ft.ResultNumInUint64)
}
copy(results, ce.stack)
return results, nil
}
// initializeStack initializes callEngine.stack before entering native code.
//
// The stack must look like, if len(params) < len(results):
//
// [arg0, arg1, ..., argN, 0, 0, 0, ...
// { } ^
// callFrame |
// |
// stackPointer
//
// else:
//
// [arg0, arg1, ..., argN, _, _, _, 0, 0, 0, ...
// | | { } ^
// |reserved| callFrame |
// | | |
// |--------> stackPointer
// len(results)-len(params)
//
// where we reserve the slots below the callframe with the length len(results)-len(params).
//
// Note: callFrame { } is zeroed to indicate that the initial "caller" is this callEngine, not the Wasm function.
//
// See callEngine.stack as well.
func (ce *callEngine) initializeStack(tp *wasm.FunctionType, args []uint64) {
for _, v := range args {
ce.pushValue(v)
}
ce.stackPointer = uint64(callFrameOffset(tp))
for i := 0; i < callFrameDataSizeInUint64; i++ {
ce.stack[ce.stackPointer] = 0
ce.stackPointer++
}
}
// callFrameOffset returns the offset of the call frame from the stack base pointer.
//
// See the diagram in callEngine.stack.
func callFrameOffset(funcType *wasm.FunctionType) (ret int) {
ret = funcType.ResultNumInUint64
if ret < funcType.ParamNumInUint64 {
ret = funcType.ParamNumInUint64
}
return
}
// deferredOnCall takes the recovered value `recovered`, and wraps it
// with the call frame stack traces when not nil. This also resets
// the state of callEngine so that it can be used for the subsequent calls.
//
// This is defined for testability.
func (ce *callEngine) deferredOnCall(ctx context.Context, m *wasm.ModuleInstance, recovered interface{}) (err error) {
if recovered != nil {
builder := wasmdebug.NewErrorBuilder()
// Unwinds call frames from the values stack, starting from the
// current function `ce.fn`, and the current stack base pointer `ce.stackBasePointerInBytes`.
fn := ce.fn
pc := uint64(ce.returnAddress)
stackBasePointer := int(ce.stackBasePointerInBytes >> 3)
functionListeners := make([]functionListenerInvocation, 0, 16)
for {
def := fn.definition()
// sourceInfo holds the source code information corresponding to the frame.
// It is not empty only when the DWARF is enabled.
var sources []string
if p := fn.parent; p.parent.executable.Bytes() != nil {
if fn.parent.sourceOffsetMap.irOperationSourceOffsetsInWasmBinary != nil {
offset := fn.getSourceOffsetInWasmBinary(pc)
sources = p.parent.source.DWARFLines.Line(offset)
}
}
builder.AddFrame(def.DebugName(), def.ParamTypes(), def.ResultTypes(), sources)
if fn.parent.listener != nil {
functionListeners = append(functionListeners, functionListenerInvocation{
FunctionListener: fn.parent.listener,
def: fn.definition(),
})
}
callFrameOffset := callFrameOffset(fn.funcType)
if stackBasePointer != 0 {
frame := *(*callFrame)(unsafe.Pointer(&ce.stack[stackBasePointer+callFrameOffset]))
fn = frame.function
pc = uint64(frame.returnAddress)
stackBasePointer = int(frame.returnStackBasePointerInBytes >> 3)
} else { // base == 0 means that this was the last call frame stacked.
break
}
}
err = builder.FromRecovered(recovered)
for i := range functionListeners {
functionListeners[i].Abort(ctx, m, functionListeners[i].def, err)
}
}
// Allows the reuse of CallEngine.
ce.stackBasePointerInBytes, ce.stackPointer, ce.moduleInstance = 0, 0, nil
ce.moduleContext.fn = ce.initialFn
return
}
// getSourceOffsetInWasmBinary returns the corresponding offset in the original Wasm binary's code section
// for the given pc (which is an absolute address in the memory).
// If needPreviousInstr equals true, this returns the previous instruction's offset for the given pc.
func (f *function) getSourceOffsetInWasmBinary(pc uint64) uint64 {
srcMap := &f.parent.sourceOffsetMap
n := bitpack.OffsetArrayLen(srcMap.irOperationOffsetsInNativeBinary) + 1
// Calculate the offset in the compiled native binary.
pcOffsetInNativeBinary := pc - uint64(f.codeInitialAddress)
// Then, do the binary search on the list of offsets in the native binary
// for all the IR operations. This returns the index of the *next* IR
// operation of the one corresponding to the origin of this pc.
// See sort.Search.
//
// TODO: the underlying implementation of irOperationOffsetsInNativeBinary
// uses uses delta encoding an calls to the Index method might require a
// O(N) scan of the underlying array, turning binary search into a
// O(N*log(N)) operation. If this code path ends up being a bottleneck,
// we could add a Search method on the bitpack.OffsetArray types to delegate
// the lookup to the underlying data structure, allowing for the selection
// of a more optimized version of the algorithm. If you do so, please add a
// benchmark to verify the impact on compute time.
index := sort.Search(n, func(i int) bool {
if i == n-1 {
return true
}
return srcMap.irOperationOffsetsInNativeBinary.Index(i) >= pcOffsetInNativeBinary
})
if index == 0 && bitpack.OffsetArrayLen(srcMap.irOperationSourceOffsetsInWasmBinary) > 0 {
// When pc is the beginning of the function, the next IR
// operation (returned by sort.Search) is the first of the
// offset map.
return srcMap.irOperationSourceOffsetsInWasmBinary.Index(0)
}
if index == n || index == 0 { // This case, somehow pc is not found in the source offset map.
return 0
} else {
return srcMap.irOperationSourceOffsetsInWasmBinary.Index(index - 1)
}
}
func NewEngine(_ context.Context, enabledFeatures api.CoreFeatures, fileCache filecache.Cache) wasm.Engine {
return newEngine(enabledFeatures, fileCache)
}
func newEngine(enabledFeatures api.CoreFeatures, fileCache filecache.Cache) *engine {
return &engine{
enabledFeatures: enabledFeatures,
codes: map[wasm.ModuleID]*compiledModule{},
setFinalizer: runtime.SetFinalizer,
fileCache: fileCache,
wazeroVersion: version.GetWazeroVersion(),
}
}
// Do not make this variable as constant, otherwise there would be
// dangerous memory access from native code.
//
// Background: Go has a mechanism called "goroutine stack-shrink" where Go
// runtime shrinks Goroutine's stack when it is GCing. Shrinking means that
// all the contents on the goroutine stack will be relocated by runtime,
// Therefore, the memory address of these contents change undeterministically.
// Not only shrinks, but also Go runtime grows the goroutine stack at any point
// of function call entries, which also might end up relocating contents.
//
// On the other hand, we hold pointers to the data region of value stack and
// call-frame stack slices and use these raw pointers from native code.
// Therefore, it is dangerous if these two stacks are allocated on stack
// as these stack's address might be changed by Goroutine which we cannot
// detect.
//
// By declaring these values as `var`, slices created via `make([]..., var)`
// will never be allocated on stack [1]. This means accessing these slices via
// raw pointers is safe: As of version 1.18, Go's garbage collector never relocates
// heap-allocated objects (aka no compaction of memory [2]).
//
// On Go upgrades, re-validate heap-allocation via `go build -gcflags='-m' ./internal/engine/compiler/...`.
//
// [1] https://github.com/golang/go/blob/68ecdc2c70544c303aa923139a5f16caf107d955/src/cmd/compile/internal/escape/utils.go#L206-L208
// [2] https://github.com/golang/go/blob/68ecdc2c70544c303aa923139a5f16caf107d955/src/runtime/mgc.go#L9
// [3] https://mayurwadekar2.medium.com/escape-analysis-in-golang-ee40a1c064c1
// [4] https://medium.com/@yulang.chu/go-stack-or-heap-2-slices-which-keep-in-stack-have-limitation-of-size-b3f3adfd6190
var initialStackSize uint64 = 512
func (e *moduleEngine) newCallEngine(stackSize uint64, fn *function) *callEngine {
ce := &callEngine{
stack: make([]uint64, stackSize),
archContext: newArchContext(),
initialFn: fn,
moduleContext: moduleContext{fn: fn},
ensureTermination: fn.parent.parent.ensureTermination,
}
stackHeader := (*reflect.SliceHeader)(unsafe.Pointer(&ce.stack))
ce.stackContext = stackContext{
stackElement0Address: stackHeader.Data,
stackLenInBytes: uint64(stackHeader.Len) << 3,
}
return ce
}
func (ce *callEngine) popValue() (ret uint64) {
ce.stackContext.stackPointer--
ret = ce.stack[ce.stackTopIndex()]
return
}
func (ce *callEngine) pushValue(v uint64) {
ce.stack[ce.stackTopIndex()] = v
ce.stackContext.stackPointer++
}
func (ce *callEngine) stackTopIndex() uint64 {
return ce.stackContext.stackPointer + (ce.stackContext.stackBasePointerInBytes >> 3)
}
const (
builtinFunctionIndexMemoryGrow wasm.Index = iota
builtinFunctionIndexGrowStack
builtinFunctionIndexTableGrow
builtinFunctionIndexFunctionListenerBefore
builtinFunctionIndexFunctionListenerAfter
builtinFunctionIndexCheckExitCode
// builtinFunctionIndexBreakPoint is internal (only for wazero developers). Disabled by default.
builtinFunctionIndexBreakPoint
)
func (ce *callEngine) execWasmFunction(ctx context.Context, m *wasm.ModuleInstance) {
codeAddr := ce.initialFn.codeInitialAddress
modAddr := ce.initialFn.moduleInstance
entry:
{
// Call into the native code.
nativecall(codeAddr, ce, modAddr)
// Check the status code from Compiler code.
switch status := ce.exitContext.statusCode; status {
case nativeCallStatusCodeReturned:
case nativeCallStatusCodeCallGoHostFunction:
calleeHostFunction := ce.moduleContext.fn
base := int(ce.stackBasePointerInBytes >> 3)
// In the compiler engine, ce.stack has enough capacity for the
// max of param or result length, so we don't need to grow when
// there are more results than parameters.
stackLen := calleeHostFunction.funcType.ParamNumInUint64
if resultLen := calleeHostFunction.funcType.ResultNumInUint64; resultLen > stackLen {
stackLen = resultLen
}
stack := ce.stack[base : base+stackLen]
fn := calleeHostFunction.parent.goFunc
switch fn := fn.(type) {
case api.GoModuleFunction:
fn.Call(ctx, ce.callerModuleInstance, stack)
case api.GoFunction:
fn.Call(ctx, stack)
}
codeAddr, modAddr = ce.returnAddress, ce.moduleInstance
goto entry
case nativeCallStatusCodeCallBuiltInFunction:
caller := ce.moduleContext.fn
switch ce.exitContext.builtinFunctionCallIndex {
case builtinFunctionIndexMemoryGrow:
ce.builtinFunctionMemoryGrow(caller.moduleInstance.MemoryInstance)
case builtinFunctionIndexGrowStack:
ce.builtinFunctionGrowStack(caller.parent.stackPointerCeil)
case builtinFunctionIndexTableGrow:
ce.builtinFunctionTableGrow(caller.moduleInstance.Tables)
case builtinFunctionIndexFunctionListenerBefore:
ce.builtinFunctionFunctionListenerBefore(ctx, m, caller)
case builtinFunctionIndexFunctionListenerAfter:
ce.builtinFunctionFunctionListenerAfter(ctx, m, caller)
case builtinFunctionIndexCheckExitCode:
// Note: this operation must be done in Go, not native code. The reason is that
// native code cannot be preempted and that means it can block forever if there are not
// enough OS threads (which we don't have control over).
if err := m.FailIfClosed(); err != nil {
panic(err)
}
}
if false {
if ce.exitContext.builtinFunctionCallIndex == builtinFunctionIndexBreakPoint {
runtime.Breakpoint()
}
}
codeAddr, modAddr = ce.returnAddress, ce.moduleInstance
goto entry
default:
status.causePanic()
}
}
}
// callStackCeiling is the maximum WebAssembly call frame stack height. This allows wazero to raise
// wasm.ErrCallStackOverflow instead of overflowing the Go runtime.
//
// The default value should suffice for most use cases. Those wishing to change this can via `go build -ldflags`.
//
// TODO: allows to configure this via context?
var callStackCeiling = uint64(5000000) // in uint64 (8 bytes) == 40000000 bytes in total == 40mb.
func (ce *callEngine) builtinFunctionGrowStack(stackPointerCeil uint64) {
oldLen := uint64(len(ce.stack))
if callStackCeiling < oldLen {
panic(wasmruntime.ErrRuntimeStackOverflow)
}
// Extends the stack's length to oldLen*2+stackPointerCeil.
newLen := oldLen<<1 + (stackPointerCeil)
newStack := make([]uint64, newLen)
top := ce.stackTopIndex()
copy(newStack[:top], ce.stack[:top])
ce.stack = newStack
stackHeader := (*reflect.SliceHeader)(unsafe.Pointer(&ce.stack))
ce.stackContext.stackElement0Address = stackHeader.Data
ce.stackContext.stackLenInBytes = newLen << 3
}
func (ce *callEngine) builtinFunctionMemoryGrow(mem *wasm.MemoryInstance) {
newPages := ce.popValue()
if res, ok := mem.Grow(uint32(newPages)); !ok {
ce.pushValue(uint64(0xffffffff)) // = -1 in signed 32-bit integer.
} else {
ce.pushValue(uint64(res))
}
// Update the moduleContext fields as they become stale after the update ^^.
bufSliceHeader := (*reflect.SliceHeader)(unsafe.Pointer(&mem.Buffer))
ce.moduleContext.memorySliceLen = uint64(bufSliceHeader.Len)
ce.moduleContext.memoryElement0Address = bufSliceHeader.Data
}
func (ce *callEngine) builtinFunctionTableGrow(tables []*wasm.TableInstance) {
tableIndex := uint32(ce.popValue())
table := tables[tableIndex] // verified not to be out of range by the func validation at compilation phase.
num := ce.popValue()
ref := ce.popValue()
res := table.Grow(uint32(num), uintptr(ref))
ce.pushValue(uint64(res))
}
// stackIterator implements experimental.StackIterator.
type stackIterator struct {
stack []uint64
fn *function
base int
pc uint64
started bool
}
func (si *stackIterator) reset(stack []uint64, fn *function, base int, pc uint64) {
si.stack = stack
si.fn = fn
si.base = base
si.pc = pc
si.started = false
}
func (si *stackIterator) clear() {
si.stack = nil
si.fn = nil
si.base = 0
si.started = false
}
// Next implements the same method as documented on experimental.StackIterator.
func (si *stackIterator) Next() bool {
if !si.started {
si.started = true
return true
}
if si.fn == nil || si.base == 0 {
return false
}
frame := si.base + callFrameOffset(si.fn.funcType)
si.pc = si.stack[frame+0]
si.base = int(si.stack[frame+1] >> 3)
// *function lives in the third field of callFrame struct. This must be
// aligned with the definition of callFrame struct.
si.fn = *(**function)(unsafe.Pointer(&si.stack[frame+2]))
return si.fn != nil
}
// ProgramCounter implements the same method as documented on experimental.StackIterator.
func (si *stackIterator) ProgramCounter() experimental.ProgramCounter {
return experimental.ProgramCounter(si.pc)
}
// Function implements the same method as documented on experimental.StackIterator.
func (si *stackIterator) Function() experimental.InternalFunction {
return internalFunction{si.fn}
}
// Parameters implements the same method as documented on experimental.StackIterator.
func (si *stackIterator) Parameters() []uint64 {
return si.stack[si.base : si.base+si.fn.funcType.ParamNumInUint64]
}
// internalFunction implements experimental.InternalFunction.
type internalFunction struct{ *function }
// Definition implements the same method as documented on experimental.InternalFunction.
func (f internalFunction) Definition() api.FunctionDefinition {
return f.definition()
}
// SourceOffsetForPC implements the same method as documented on experimental.InternalFunction.
func (f internalFunction) SourceOffsetForPC(pc experimental.ProgramCounter) uint64 {
p := f.parent
if bitpack.OffsetArrayLen(p.sourceOffsetMap.irOperationSourceOffsetsInWasmBinary) == 0 {
return 0 // source not available
}
return f.getSourceOffsetInWasmBinary(uint64(pc))
}
func (ce *callEngine) builtinFunctionFunctionListenerBefore(ctx context.Context, mod api.Module, fn *function) {
base := int(ce.stackBasePointerInBytes >> 3)
pc := uint64(ce.returnAddress)
ce.stackIterator.reset(ce.stack, fn, base, pc)
params := ce.stack[base : base+fn.funcType.ParamNumInUint64]
fn.parent.listener.Before(ctx, mod, fn.definition(), params, &ce.stackIterator)
ce.stackIterator.clear()
}
func (ce *callEngine) builtinFunctionFunctionListenerAfter(ctx context.Context, mod api.Module, fn *function) {
base := int(ce.stackBasePointerInBytes >> 3)
fn.parent.listener.After(ctx, mod, fn.definition(), ce.stack[base:base+fn.funcType.ResultNumInUint64])
}
func compileGoDefinedHostFunction(buf asm.Buffer, cmp compiler) error {
if err := cmp.compileGoDefinedHostFunction(); err != nil {
return err
}
_, err := cmp.compile(buf)
return err
}
type asmNodes struct {
nodes []asm.Node
}
type offsets struct {
values []uint64
}
func compileWasmFunction(buf asm.Buffer, cmp compiler, ir *wazeroir.CompilationResult, asmNodes *asmNodes, offsets *offsets) (spCeil uint64, sm sourceOffsetMap, err error) {
if err = cmp.compilePreamble(); err != nil {
err = fmt.Errorf("failed to emit preamble: %w", err)
return
}
needSourceOffsets := len(ir.IROperationSourceOffsetsInWasmBinary) > 0
var irOpBegins []asm.Node
if needSourceOffsets {
irOpBegins = append(asmNodes.nodes[:0], make([]asm.Node, len(ir.Operations))...)
defer func() { asmNodes.nodes = irOpBegins }()
}
var skip bool
for i := range ir.Operations {
op := &ir.Operations[i]
if needSourceOffsets {
// If this compilation requires source offsets for DWARF based back trace,
// we emit a NOP node at the beginning of each IR operation to get the
// binary offset of the beginning of the corresponding compiled native code.
irOpBegins[i] = cmp.compileNOP()
}
// Compiler determines whether skip the entire label.
// For example, if the label doesn't have any caller,
// we don't need to generate native code at all as we never reach the region.
if op.Kind == wazeroir.OperationKindLabel {
skip = cmp.compileLabel(op)
}
if skip {
continue
}
if false {
fmt.Printf("compiling op=%s: %s\n", op.Kind, cmp)
}
switch op.Kind {
case wazeroir.OperationKindUnreachable:
err = cmp.compileUnreachable()
case wazeroir.OperationKindLabel:
// label op is already handled ^^.
case wazeroir.OperationKindBr:
err = cmp.compileBr(op)
case wazeroir.OperationKindBrIf:
err = cmp.compileBrIf(op)
case wazeroir.OperationKindBrTable:
err = cmp.compileBrTable(op)
case wazeroir.OperationKindCall:
err = cmp.compileCall(op)
case wazeroir.OperationKindCallIndirect:
err = cmp.compileCallIndirect(op)
case wazeroir.OperationKindDrop:
err = cmp.compileDrop(op)
case wazeroir.OperationKindSelect:
err = cmp.compileSelect(op)
case wazeroir.OperationKindPick:
err = cmp.compilePick(op)
case wazeroir.OperationKindSet:
err = cmp.compileSet(op)
case wazeroir.OperationKindGlobalGet:
err = cmp.compileGlobalGet(op)
case wazeroir.OperationKindGlobalSet:
err = cmp.compileGlobalSet(op)
case wazeroir.OperationKindLoad:
err = cmp.compileLoad(op)
case wazeroir.OperationKindLoad8:
err = cmp.compileLoad8(op)
case wazeroir.OperationKindLoad16:
err = cmp.compileLoad16(op)
case wazeroir.OperationKindLoad32:
err = cmp.compileLoad32(op)
case wazeroir.OperationKindStore:
err = cmp.compileStore(op)
case wazeroir.OperationKindStore8:
err = cmp.compileStore8(op)
case wazeroir.OperationKindStore16:
err = cmp.compileStore16(op)
case wazeroir.OperationKindStore32:
err = cmp.compileStore32(op)
case wazeroir.OperationKindMemorySize:
err = cmp.compileMemorySize()
case wazeroir.OperationKindMemoryGrow:
err = cmp.compileMemoryGrow()
case wazeroir.OperationKindConstI32:
err = cmp.compileConstI32(op)
case wazeroir.OperationKindConstI64:
err = cmp.compileConstI64(op)
case wazeroir.OperationKindConstF32:
err = cmp.compileConstF32(op)
case wazeroir.OperationKindConstF64:
err = cmp.compileConstF64(op)
case wazeroir.OperationKindEq:
err = cmp.compileEq(op)
case wazeroir.OperationKindNe:
err = cmp.compileNe(op)
case wazeroir.OperationKindEqz:
err = cmp.compileEqz(op)
case wazeroir.OperationKindLt:
err = cmp.compileLt(op)
case wazeroir.OperationKindGt:
err = cmp.compileGt(op)
case wazeroir.OperationKindLe:
err = cmp.compileLe(op)
case wazeroir.OperationKindGe:
err = cmp.compileGe(op)
case wazeroir.OperationKindAdd:
err = cmp.compileAdd(op)
case wazeroir.OperationKindSub:
err = cmp.compileSub(op)
case wazeroir.OperationKindMul:
err = cmp.compileMul(op)
case wazeroir.OperationKindClz:
err = cmp.compileClz(op)
case wazeroir.OperationKindCtz:
err = cmp.compileCtz(op)
case wazeroir.OperationKindPopcnt:
err = cmp.compilePopcnt(op)
case wazeroir.OperationKindDiv:
err = cmp.compileDiv(op)
case wazeroir.OperationKindRem:
err = cmp.compileRem(op)
case wazeroir.OperationKindAnd:
err = cmp.compileAnd(op)
case wazeroir.OperationKindOr:
err = cmp.compileOr(op)
case wazeroir.OperationKindXor:
err = cmp.compileXor(op)
case wazeroir.OperationKindShl:
err = cmp.compileShl(op)
case wazeroir.OperationKindShr:
err = cmp.compileShr(op)
case wazeroir.OperationKindRotl:
err = cmp.compileRotl(op)
case wazeroir.OperationKindRotr:
err = cmp.compileRotr(op)
case wazeroir.OperationKindAbs:
err = cmp.compileAbs(op)
case wazeroir.OperationKindNeg:
err = cmp.compileNeg(op)
case wazeroir.OperationKindCeil:
err = cmp.compileCeil(op)
case wazeroir.OperationKindFloor:
err = cmp.compileFloor(op)
case wazeroir.OperationKindTrunc:
err = cmp.compileTrunc(op)
case wazeroir.OperationKindNearest:
err = cmp.compileNearest(op)
case wazeroir.OperationKindSqrt:
err = cmp.compileSqrt(op)
case wazeroir.OperationKindMin:
err = cmp.compileMin(op)
case wazeroir.OperationKindMax:
err = cmp.compileMax(op)
case wazeroir.OperationKindCopysign:
err = cmp.compileCopysign(op)
case wazeroir.OperationKindI32WrapFromI64:
err = cmp.compileI32WrapFromI64()
case wazeroir.OperationKindITruncFromF:
err = cmp.compileITruncFromF(op)
case wazeroir.OperationKindFConvertFromI:
err = cmp.compileFConvertFromI(op)
case wazeroir.OperationKindF32DemoteFromF64:
err = cmp.compileF32DemoteFromF64()
case wazeroir.OperationKindF64PromoteFromF32:
err = cmp.compileF64PromoteFromF32()
case wazeroir.OperationKindI32ReinterpretFromF32:
err = cmp.compileI32ReinterpretFromF32()
case wazeroir.OperationKindI64ReinterpretFromF64:
err = cmp.compileI64ReinterpretFromF64()
case wazeroir.OperationKindF32ReinterpretFromI32:
err = cmp.compileF32ReinterpretFromI32()
case wazeroir.OperationKindF64ReinterpretFromI64:
err = cmp.compileF64ReinterpretFromI64()
case wazeroir.OperationKindExtend:
err = cmp.compileExtend(op)
case wazeroir.OperationKindSignExtend32From8:
err = cmp.compileSignExtend32From8()
case wazeroir.OperationKindSignExtend32From16:
err = cmp.compileSignExtend32From16()
case wazeroir.OperationKindSignExtend64From8:
err = cmp.compileSignExtend64From8()
case wazeroir.OperationKindSignExtend64From16:
err = cmp.compileSignExtend64From16()
case wazeroir.OperationKindSignExtend64From32:
err = cmp.compileSignExtend64From32()
case wazeroir.OperationKindMemoryInit:
err = cmp.compileMemoryInit(op)
case wazeroir.OperationKindDataDrop:
err = cmp.compileDataDrop(op)
case wazeroir.OperationKindMemoryCopy:
err = cmp.compileMemoryCopy()
case wazeroir.OperationKindMemoryFill:
err = cmp.compileMemoryFill()
case wazeroir.OperationKindTableInit:
err = cmp.compileTableInit(op)
case wazeroir.OperationKindElemDrop:
err = cmp.compileElemDrop(op)
case wazeroir.OperationKindTableCopy:
err = cmp.compileTableCopy(op)
case wazeroir.OperationKindRefFunc:
err = cmp.compileRefFunc(op)
case wazeroir.OperationKindTableGet:
err = cmp.compileTableGet(op)
case wazeroir.OperationKindTableSet:
err = cmp.compileTableSet(op)
case wazeroir.OperationKindTableGrow:
err = cmp.compileTableGrow(op)
case wazeroir.OperationKindTableSize:
err = cmp.compileTableSize(op)
case wazeroir.OperationKindTableFill:
err = cmp.compileTableFill(op)
case wazeroir.OperationKindV128Const:
err = cmp.compileV128Const(op)
case wazeroir.OperationKindV128Add:
err = cmp.compileV128Add(op)
case wazeroir.OperationKindV128Sub:
err = cmp.compileV128Sub(op)
case wazeroir.OperationKindV128Load:
err = cmp.compileV128Load(op)
case wazeroir.OperationKindV128LoadLane:
err = cmp.compileV128LoadLane(op)
case wazeroir.OperationKindV128Store:
err = cmp.compileV128Store(op)
case wazeroir.OperationKindV128StoreLane:
err = cmp.compileV128StoreLane(op)
case wazeroir.OperationKindV128ExtractLane:
err = cmp.compileV128ExtractLane(op)
case wazeroir.OperationKindV128ReplaceLane:
err = cmp.compileV128ReplaceLane(op)
case wazeroir.OperationKindV128Splat:
err = cmp.compileV128Splat(op)
case wazeroir.OperationKindV128Shuffle:
err = cmp.compileV128Shuffle(op)
case wazeroir.OperationKindV128Swizzle:
err = cmp.compileV128Swizzle(op)
case wazeroir.OperationKindV128AnyTrue:
err = cmp.compileV128AnyTrue(op)
case wazeroir.OperationKindV128AllTrue:
err = cmp.compileV128AllTrue(op)
case wazeroir.OperationKindV128BitMask:
err = cmp.compileV128BitMask(op)
case wazeroir.OperationKindV128And:
err = cmp.compileV128And(op)
case wazeroir.OperationKindV128Not:
err = cmp.compileV128Not(op)
case wazeroir.OperationKindV128Or:
err = cmp.compileV128Or(op)
case wazeroir.OperationKindV128Xor:
err = cmp.compileV128Xor(op)
case wazeroir.OperationKindV128Bitselect:
err = cmp.compileV128Bitselect(op)
case wazeroir.OperationKindV128AndNot:
err = cmp.compileV128AndNot(op)
case wazeroir.OperationKindV128Shl:
err = cmp.compileV128Shl(op)
case wazeroir.OperationKindV128Shr:
err = cmp.compileV128Shr(op)
case wazeroir.OperationKindV128Cmp:
err = cmp.compileV128Cmp(op)
case wazeroir.OperationKindV128AddSat:
err = cmp.compileV128AddSat(op)
case wazeroir.OperationKindV128SubSat:
err = cmp.compileV128SubSat(op)
case wazeroir.OperationKindV128Mul:
err = cmp.compileV128Mul(op)
case wazeroir.OperationKindV128Div:
err = cmp.compileV128Div(op)
case wazeroir.OperationKindV128Neg:
err = cmp.compileV128Neg(op)
case wazeroir.OperationKindV128Sqrt:
err = cmp.compileV128Sqrt(op)
case wazeroir.OperationKindV128Abs:
err = cmp.compileV128Abs(op)
case wazeroir.OperationKindV128Popcnt:
err = cmp.compileV128Popcnt(op)
case wazeroir.OperationKindV128Min:
err = cmp.compileV128Min(op)
case wazeroir.OperationKindV128Max:
err = cmp.compileV128Max(op)
case wazeroir.OperationKindV128AvgrU:
err = cmp.compileV128AvgrU(op)
case wazeroir.OperationKindV128Pmin:
err = cmp.compileV128Pmin(op)
case wazeroir.OperationKindV128Pmax:
err = cmp.compileV128Pmax(op)
case wazeroir.OperationKindV128Ceil:
err = cmp.compileV128Ceil(op)
case wazeroir.OperationKindV128Floor:
err = cmp.compileV128Floor(op)
case wazeroir.OperationKindV128Trunc:
err = cmp.compileV128Trunc(op)
case wazeroir.OperationKindV128Nearest:
err = cmp.compileV128Nearest(op)
case wazeroir.OperationKindV128Extend:
err = cmp.compileV128Extend(op)
case wazeroir.OperationKindV128ExtMul:
err = cmp.compileV128ExtMul(op)
case wazeroir.OperationKindV128Q15mulrSatS:
err = cmp.compileV128Q15mulrSatS(op)
case wazeroir.OperationKindV128ExtAddPairwise:
err = cmp.compileV128ExtAddPairwise(op)
case wazeroir.OperationKindV128FloatPromote:
err = cmp.compileV128FloatPromote(op)
case wazeroir.OperationKindV128FloatDemote:
err = cmp.compileV128FloatDemote(op)
case wazeroir.OperationKindV128FConvertFromI:
err = cmp.compileV128FConvertFromI(op)
case wazeroir.OperationKindV128Dot:
err = cmp.compileV128Dot(op)
case wazeroir.OperationKindV128Narrow:
err = cmp.compileV128Narrow(op)
case wazeroir.OperationKindV128ITruncSatFromF:
err = cmp.compileV128ITruncSatFromF(op)
case wazeroir.OperationKindBuiltinFunctionCheckExitCode:
err = cmp.compileBuiltinFunctionCheckExitCode()
default:
err = errors.New("unsupported")
}
if err != nil {
err = fmt.Errorf("operation %s: %w", op.Kind.String(), err)
return
}
}
spCeil, err = cmp.compile(buf)
if err != nil {
err = fmt.Errorf("failed to compile: %w", err)
return
}
if needSourceOffsets {
offsetInNativeBin := append(offsets.values[:0], make([]uint64, len(irOpBegins))...)
offsets.values = offsetInNativeBin
for i, nop := range irOpBegins {
offsetInNativeBin[i] = nop.OffsetInBinary()
}
sm.irOperationOffsetsInNativeBinary = bitpack.NewOffsetArray(offsetInNativeBin)
sm.irOperationSourceOffsetsInWasmBinary = bitpack.NewOffsetArray(ir.IROperationSourceOffsetsInWasmBinary)
}
return
}