77ed861857
See long block comment in codegen.rs. In brief, I think we actually want to compile to a trie with priority-intervals, a sort of hybrid of a priority tree and a trie representing decisions keyed on match-ops (PatternInsts). The reasons are: 1. The lexicographic ordering that is fundamental to the FSM-building in the Peepmatic view of the problem is sort of fundamentally limited w.r.t. our notion of rule priorities. See the example in the block comment. 2. While the FSM is nice for interpreter-based execution, when compiling to a language with structured control flow, what we really want is a tree; otherwise, if we want to form DAGs to share substructure, we need something like a "diamond-recovery" algorithm that finds common suffixes of *input match-op sequences*, and then we need to incorporate something like phi-nodes in order to allow captures from either side of the diamond to be used. 3. One of the main advantages of the automaton/transducer approach, namely sharing suffixes of the *output* sequence (emitting partial output at each state transition), is unfortunately not applicable if we allow the overall function to be partial. Otherwise, there is always the possibility that we fail at the last match op, so we cannot allow any external constructors to be called until we reach the final state anyway. 4. Pragmatically, I found I was having to significantly edit the peepmatic_automata implementation to adapt to this use-case (compilation to Rust), and it seemed more practical to design the data structure we want than to try to shoehorn the existing thing into the new problem. WIP, hopefully working soon.
wasmtime
A standalone runtime for WebAssembly
A Bytecode Alliance project
Guide | Contributing | Website | Chat
Installation
The Wasmtime CLI can be installed on Linux and macOS with a small install script:
$ curl https://wasmtime.dev/install.sh -sSf | bash
Windows or otherwise interested users can download installers and binaries directly from the GitHub Releases page.
Example
If you've got the Rust compiler installed then you can take some Rust source code:
fn main() {
println!("Hello, world!");
}
and compile/run it with:
$ rustup target add wasm32-wasi
$ rustc hello.rs --target wasm32-wasi
$ wasmtime hello.wasm
Hello, world!
Features
-
Lightweight. Wasmtime is a standalone runtime for WebAssembly that scales with your needs. It fits on tiny chips as well as makes use of huge servers. Wasmtime can be embedded into almost any application too.
-
Fast. Wasmtime is built on the optimizing Cranelift code generator to quickly generate high-quality machine code at runtime.
-
Configurable. Whether you need to precompile your wasm ahead of time, or interpret it at runtime, Wasmtime has you covered for all your wasm-executing needs.
-
WASI. Wasmtime supports a rich set of APIs for interacting with the host environment through the WASI standard.
-
Standards Compliant. Wasmtime passes the official WebAssembly test suite, implements the official C API of wasm, and implements future proposals to WebAssembly as well. Wasmtime developers are intimately engaged with the WebAssembly standards process all along the way too.
Language Support
You can use Wasmtime from a variety of different languages through embeddings of the implementation:
- Rust - the
wasmtimecrate - C - the
wasm.h,wasi.h, andwasmtime.hheaders or usewasmtimeConan package - [C++] - the
wasmtime-cpprepository or usewasmtime-cppConan package - Python - the
wasmtimePyPI package - .NET - the
WasmtimeNuGet package - Go - the
wasmtime-gorepository
Documentation
📚 Read the Wasmtime guide here! 📚
The wasmtime guide is the best starting point to learn about what Wasmtime can do for you or help answer your questions about Wasmtime. If you're curious in contributing to Wasmtime, it can also help you do that!
It's Wasmtime.