[ { "path": ".gitattributes", "content": "*.rst linguist-documentation=false\ndocument/* linguist-documentation=false\ndocument/*.rst linguist-documentation=false\ndocument/*/*.rst linguist-documentation=false\ntest/harness/wast.js linguist-vendored\ntest/harness/testharness* linguist-vendored\n\n" }, { "path": ".gitignore", "content": "**/*~\n**/*.tmproj\n**/*.pyc\n**/_build\n**/_output\n" }, { "path": ".gitmodules", "content": "[submodule \"document/core/util/katex\"]\n\tpath = document/core/util/katex\n\turl = https://github.com/KaTeX/KaTeX.git\n" }, { "path": ".travis.yml", "content": "language: python\npython:\n - \"3.7\"\ndist: bionic\n\naddons:\n apt:\n sources:\n - sourceline: 'ppa:avsm/ppa'\n - sourceline: 'deb https://dl.yarnpkg.com/debian/ stable main'\n key_url: 'https://dl.yarnpkg.com/debian/pubkey.gpg'\n update: true\n packages:\n - opam\n - texlive-full\n - yarn\n\ninstall:\n - opam init --auto-setup --compiler=4.07.1\n - eval $(opam env)\n - opam --version\n - ocaml --version\n - opam install --yes ocamlbuild.0.14.0\n - pip install Sphinx==2.4.4\n - git clone https://github.com/tabatkins/bikeshed.git\n - pip install --editable $PWD/bikeshed\n - bikeshed update\n\nscript:\n - ./interpreter/meta/travis/build-test.sh\n - bash ./document/travis-deploy.sh\n\nos: linux\n\nenv:\n global:\n - ENCRYPTION_LABEL: \"5d9ec396f41d\"\n - COMMIT_AUTHOR_EMAIL: \"noreply@webassembly.org\"\n" }, { "path": "Contributing.md", "content": "# Contributing to WebAssembly\n\nInterested in participating? Please follow\n[the same contributing guidelines as the design repository][].\n\n [the same contributing guidelines as the design repository]: https://github.com/WebAssembly/design/blob/master/Contributing.md\n\nAlso, please be sure to read [the README.md](README.md) for this repository.\n" }, { "path": "LICENSE", "content": "Please see the LICENSE file in each top-level directory for the terms applicable to that directory and its relative sub-directories.\n\nThe relevant directories and licenses are:\n\ndocument/ - W3C Software and Document Notice and License\ninterpreter/ - Apache License 2.0\ntest/ - Apache License 2.0\npapers/ - Creative Commons Attribution 4.0 International License\n" }, { "path": "README.md", "content": "[![Build Status](https://travis-ci.org/WebAssembly/reference-types.svg?branch=master)](https://travis-ci.org/WebAssembly/reference-types)\n\n# Reference Types Proposal for WebAssembly\n\nThis repository is a clone of [github.com/WebAssembly/spec/](https://github.com/WebAssembly/spec/).\nIt is meant for discussion, prototype specification and implementation of a proposal to add support for basic reference types to WebAssembly.\n\n* See the [overview](proposals/reference-types/Overview.md) for a summary of the proposal.\n\n* See the [modified spec](https://webassembly.github.io/reference-types/core/) for details.\n\nThe repository is now based on the [bulk operations proposal](proposals/bulk-memory-operations/Overview.md) and includes all respective changes.\n\nOriginal README from upstream repository follows...\n\n# spec\n\nThis repository holds a prototypical reference implementation for WebAssembly,\nwhich is currently serving as the official specification. Eventually, we expect\nto produce a specification either written in human-readable prose or in a formal\nspecification language.\n\nIt also holds the WebAssembly testsuite, which tests numerous aspects of\nconformance to the spec.\n\nView the work-in-progress spec at [webassembly.github.io/spec](https://webassembly.github.io/spec/).\n\nAt this time, the contents of this repository are under development and known\nto be \"incomplet and inkorrect\".\n\nParticipation is welcome. Discussions about new features, significant semantic\nchanges, or any specification change likely to generate substantial discussion\nshould take place in\n[the WebAssembly design repository](https://github.com/WebAssembly/design)\nfirst, so that this spec repository can remain focused. And please follow the\n[guidelines for contributing](Contributing.md).\n\n# citing\n\nFor citing WebAssembly in LaTeX, use [this bibtex file](wasm-specs.bib).\n" }, { "path": "document/Makefile", "content": "DIRS = core js-api web-api\nFILES = index.html\nBUILDDIR = _build\n\n# Global targets.\n\n.PHONY: all\nall: $(BUILDDIR) root $(DIRS)\n\n$(BUILDDIR):\n\tmkdir -p $@\n\n.PHONY: deploy\ndeploy:\n\tGIT_DEPLOY_DIR=$(BUILDDIR) bash deploy.sh\n\n.PHONY: publish\npublish: all deploy\n\n.PHONY: clean\nclean: $(DIRS:%=clean-%)\n\trm -rf $(BUILDDIR)\n\n.PHONY: diff\ndiff: $(DIRS:%=diff-%)\n\n\n# Directory-specific targets.\n\n.PHONY: root\nroot: $(BUILDDIR)\n\ttouch $(BUILDDIR)/.nojekyll\n\tcp -f $(FILES) $(BUILDDIR)/\n\n.PHONY: $(DIRS)\n$(DIRS): %: $(BUILDDIR) $(DIRS:%=build-%) $(DIRS:%=dir-%)\n\n.PHONY: $(DIRS:%=build-%)\n$(DIRS:%=build-%): build-%:\n\t(cd $(@:build-%=%); make BUILDDIR=$(BUILDDIR) all)\n\n.PHONY: $(DIRS:%=dir-%)\n$(DIRS:%=dir-%): dir-%:\n\tmkdir -p $(BUILDDIR)/$(@:dir-%=%)\n\trm -rf $(BUILDDIR)/$(@:dir-%=%)/*\n\tcp -R $(@:dir-%=%)/$(BUILDDIR)/html/* $(BUILDDIR)/$(@:dir-%=%)/\n\n.PHONY: $(DIRS:%=deploy-%)\n$(DIRS:%=deploy-%): deploy-%:\n\tGIT_DEPLOY_DIR=$(BUILDDIR) GIT_DEPLOY_SUBDIR=$(@:deploy-%=%) bash deploy.sh\n\n.PHONY: $(DIRS:%=publish-%)\n$(DIRS:%=publish-%): publish-%: % deploy-%\n\n.PHONY: $(DIRS:%=clean-%)\n$(DIRS:%=clean-%): clean-%:\n\t(cd $(@:clean-%=%); make BUILDDIR=$(BUILDDIR) clean)\n\trm -rf $(BUILDDIR)/$(@:clean-%=%)\n\n.PHONY: $(DIRS:%=diff-%)\n$(DIRS:%=diff-%): diff-%:\n\t(cd $(@:diff-%=%); make BUILDDIR=$(BUILDDIR) diff)\n\n\n# Help.\n\n.PHONY: help\nhelp:\n\t@echo \"Please use \\`make ' where is one of\"\n\t@echo \" all to build all documents\"\n\t@echo \" publish to make all and push to gh-pages\"\n\t@echo \" to build a specific subdirectory\"\n\t@echo \" publish- to build and push a specific subdirectory\"\n\n.PHONY: usage\nusage: help\n" }, { "path": "document/README.md", "content": "# WebAssembly Specifications\n\nThis directory contains the source code for the WebAssembly spec documents, as served from the [webassembly.github.io/spec](https://webassembly.github.io/spec) pages.\nIt uses [Sphinx](http://www.sphinx-doc.org/) and [Bikeshed](https://github.com/tabatkins/bikeshed).\n\nTo install Sphinx:\n```\npip install sphinx\n```\n\nTo install Bikeshed, see the instructions [here](https://tabatkins.github.io/bikeshed/#installing).\n\n\nTo build everything locally (result appears in `_build/`):\n```\nmake all\n```\n\nTo build everything and update [webassembly.github.io/spec](https://webassembly.github.io/spec) with it:\n```\nmake publish\n```\nPlease make sure to only use that once a change has approval.\n\n## Step by step guide to building the spec\n\n### Prerequisites\n\nYou will need `python3.7`, and `pip`. `pip` should come with Python, if not follow [these installation instructions for `pip`](https://pip.pypa.io/en/stable/installing/), or check your system package manager for `pip3`.\n\n> Important: you will need the version of pip that works with `python3.7`.\n\n\nUse something like [`pipenv`](https://pipenv.pypa.io/) to keep your system installation of Python clean.\n\n```\npip install pipenv\npipenv --python 3.7\npipenv shell\n```\n\nInstall Python dependencies:\n\n```\npip install Sphinx==2.4.4\n```\n\n### Checking out the repository\n\nMake sure this repository was cloned with `--recursive`:\n\n```\ngit clone --recursive https://github.com/WebAssembly/spec\n```\n\nIf you have already cloned but without `--recursive`, you can delete and re-clone, or `cd` into `spec` and run:\n\n```\ngit submodule update --init --recursive\n```\n\nThe rest of these instructions assume you are in the directory where is README is:\n\n```\ncd spec/document\n```\n\n### Building the multi-page HTML document\n\nYou can now build the [multi-page html document](https://webassembly.github.io/spec/core/):\n\n```\nmake -C core html\n```\n\n### Building the single-page HTML document\n\nTo build the [single-page W3C version](https://webassembly.github.io/spec/core/bikeshed/), there are more dependencies to install. First, get [Bikeshed](https://github.com/tabatkins/bikeshed):\n\n```\n# cd back to root of git directory\ngit clone https://github.com/tabatkins/bikeshed.git\npip install --editable bikeshed\nbikeshed update\n```\n\nYou will also need `npm` and `yarn` for all the LaTeX goodness. `npm` might already be available on your system, you can also use something like [`nvm`](https://github.com/nvm-sh/nvm) to prevent messing with system packages:\n\n```\nnpm install -g yarn\ncd document\nmake -C core bikeshed\n```\n\n### Building the PDF\n\nTo build the [PDF](https://webassembly.github.io/spec/core/_download/WebAssembly.pdf), you will need `texlive-full`, install it using your system package manager:\n\n```\napt install texlive-full\nmake -C core pdf\n```\n\n### Building the JavaScript Embedding API\n\nTo build the [JavaScript Embedding API](https://webassembly.github.io/spec/js-api/index.html), you will need `bikeshed` as describe in the section [Building the single-page HTML document](#building-the-single-page-html-document):\n\n```\nmake -C js-api\n```\n\n### Building the Web Embedding API\n\nTo build the [Web Embedding API](https://webassembly.github.io/spec/web-api/index.html), you will need `bikeshed` as describe in the section [Building the single-page HTML document](#building-the-single-page-html-document):\n\n```\nmake -C web-api\n```\n" }, { "path": "document/core/.gitignore", "content": "_build\n_static\ndocument/*.pyc\n" }, { "path": "document/core/LICENSE", "content": "W3C SOFTWARE AND DOCUMENT NOTICE AND LICENSE\n\nThis work is being provided by the copyright holders under the following\nlicense.\n\n\nLICENSE\n\nBy obtaining and/or copying this work, you (the licensee) agree that you have\nread, understood, and will comply with the following terms and conditions.\n\nPermission to copy, modify, and distribute this work, with or without\nmodification, for any purpose and without fee or royalty is hereby granted,\nprovided that you include the following on ALL copies of the work or portions\nthereof, including modifications:\n\n* The full text of this NOTICE in a location viewable to users of the\n redistributed or derivative work.\n\n* Any pre-existing intellectual property disclaimers, notices, or terms and\n conditions. If none exist, the W3C Software and Document Short Notice\n (https://www.w3.org/Consortium/Legal/copyright-software-short-notice) should\n be included.\n\n* Notice of any changes or modifications, through a copyright statement on the\n new code or document such as \"This software or document includes material\n copied from or derived from [title and URI of the W3C document]. Copyright © [YEAR] W3C® (MIT, ERCIM, Keio, Beihang).\"\n\n\nDISCLAIMERS\n\nTHIS WORK IS PROVIDED \"AS IS,\" AND COPYRIGHT HOLDERS MAKE NO REPRESENTATIONS\nOR WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO, WARRANTIES OF\nMERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE\nSOFTWARE OR DOCUMENT WILL NOT INFRINGE ANY THIRD PARTY PATENTS, COPYRIGHTS,\nTRADEMARKS OR OTHER RIGHTS.\n\nCOPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL OR\nCONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE OR DOCUMENT.\n\nThe name and trademarks of copyright holders may NOT be used in advertising or\npublicity pertaining to the work without specific, written prior permission.\nTitle to copyright in this work will at all times remain with copyright\nholders.\n\n\nNOTES\n\nThis version:\nhttp://www.w3.org/Consortium/Legal/2015/copyright-software-and-document\n" }, { "path": "document/core/Makefile", "content": "# Makefile for Sphinx documentation\n#\n\n# You can set these variables from the command line.\nSPHINXOPTS =\nSPHINXBUILD = sphinx-build\nPAPER = a4\nBUILDDIR = _build\nSTATICDIR = _static\nDOWNLOADDIR = _download\nNAME = WebAssembly\n\n# Internal variables.\nPAPEROPT_a4 = -D latex_paper_size=a4\nPAPEROPT_letter = -D latex_paper_size=letter\nALLSPHINXOPTS = -d $(BUILDDIR)/doctrees $(SPHINXOPTS) .\n# the i18n builder cannot share the environment and doctrees with the others\nI18NSPHINXOPTS = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .\n\n.PHONY: usage\nusage:\n\t@echo \"Please use \\`make ' where is one of\"\n\t@echo \" html to make standalone HTML files\"\n\t@echo \" pdf to make standalone PDF file\"\n\t@echo \" bikeshed to make a bikeshed wrapped single large HTML file\"\n\t@echo \" diff to make a diff of the bikeshed HTML file with the latest TR\"\n\t@echo \" WD-tar generate tar file for updating the Working Draft\"\n\t@echo \" WD-echidna publish the Working Draft tar file via Echidna\"\n\t@echo \" all to make all 3\"\n\t@echo \" publish to make all and push to gh-pages\"\n\t@echo \" help to see more options\"\n\n.PHONY: help\nhelp:\n\t@echo \"Usage: \\`make ' where is one of\"\n\t@echo \" html to make standalone HTML files\"\n\t@echo \" pdf to make standalone PDF file\"\n\t@echo \" bikeshed to make a bikeshed wrapped single large HTML file\"\n\t@echo \" all to make all 3\"\n\t@echo \" publish to make all and push to gh-pages\"\n\t@echo \" dirhtml to make HTML files named index.html in directories\"\n\t@echo \" singlehtml to make a single large HTML file\"\n\t@echo \" pickle to make pickle files\"\n\t@echo \" json to make JSON files\"\n\t@echo \" htmlhelp to make HTML files and a HTML help project\"\n\t@echo \" qthelp to make HTML files and a qthelp project\"\n\t@echo \" applehelp to make an Apple Help Book\"\n\t@echo \" devhelp to make HTML files and a Devhelp project\"\n\t@echo \" epub to make an epub\"\n\t@echo \" epub3 to make an epub3\"\n\t@echo \" latex to make LaTeX files, you can set PAPER=a4 or PAPER=letter\"\n\t@echo \" latexpdf to make LaTeX files and run them through pdflatex\"\n\t@echo \" latexpdfja to make LaTeX files and run them through platex/dvipdfmx\"\n\t@echo \" text to make text files\"\n\t@echo \" man to make manual pages\"\n\t@echo \" texinfo to make Texinfo files\"\n\t@echo \" info to make Texinfo files and run them through makeinfo\"\n\t@echo \" gettext to make PO message catalogs\"\n\t@echo \" changes to make an overview of all changed/added/deprecated items\"\n\t@echo \" xml to make Docutils-native XML files\"\n\t@echo \" pseudoxml to make pseudoxml-XML files for display purposes\"\n\t@echo \" linkcheck to check all external links for integrity\"\n\t@echo \" doctest to run all doctests embedded in the documentation (if enabled)\"\n\t@echo \" coverage to run coverage check of the documentation (if enabled)\"\n\t@echo \" dummy to check syntax errors of document sources\"\n\n.PHONY: deploy\ndeploy:\n\t(cd ..; make dir-core deploy-core)\n\n.PHONY: publish\npublish: clean all deploy\n\n.PHONY: publish-main\npublish-main: clean main bikeshed-keep deploy\n\n.PHONY: all\nall:\tpdf html bikeshed\n\n.PHONY: main\nmain:\tpdf html\n\n# Dirty hack to avoid rebuilding the Bikeshed version for every push.\n.PHONY: bikeshed-keep\nbikeshed-keep:\n\ttest -e $(BUILDDIR)/html/bikeshed || \\\n\t wget -r -nH --cut-dirs=2 -P $(BUILDDIR)/html --no-check-certificate \\\n\t https://webassembly.github.io/spec/core/bikeshed || \\\n\t echo Downloaded Bikeshed.\n\n\n.PHONY: index\nindex:\n\t(cd appendix; ./gen-index-instructions.py)\n\n.PHONY: pdf\npdf:\tindex latexpdf\n\tmkdir -p $(BUILDDIR)/html/$(DOWNLOADDIR)\n\tln -f $(BUILDDIR)/latex/$(NAME).pdf $(BUILDDIR)/html/$(DOWNLOADDIR)/$(NAME).pdf\n\n\n.PHONY: clean\nclean:\n\trm -rf $(BUILDDIR)\n\trm -rf $(STATICDIR)\n\n.PHONY: html\nhtml: index\n\t$(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html\n\tfor file in `ls $(BUILDDIR)/html/*.html`; \\\n\tdo \\\n\t sed s:BASEDIR:.:g <$$file >$$file.out; \\\n\t mv -f $$file.out $$file; \\\n\tdone\n\tfor file in `ls $(BUILDDIR)/html/*/*.html`; \\\n\tdo \\\n\t sed s:BASEDIR:..:g <$$file >$$file.out; \\\n\t mv -f $$file.out $$file; \\\n\tdone\n\t@echo\n\t@echo \"Build finished. The HTML pages are in `pwd`/$(BUILDDIR)/html/.\"\n\n.PHONY: dirhtml\ndirhtml:\n\t$(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml\n\t@echo\n\t@echo \"Build finished. The HTML pages are in $(BUILDDIR)/dirhtml.\"\n\n.PHONY: singlehtml\nsinglehtml:\n\t$(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml\n\t@echo\n\t@echo \"Build finished. The HTML page is in $(BUILDDIR)/singlehtml.\"\n\n.PHONY: bikeshed\nbikeshed:\n\t$(SPHINXBUILD) -b singlehtml -c util/bikeshed \\\n\t\t$(ALLSPHINXOPTS) $(BUILDDIR)/bikeshed_singlehtml\n\tpython util/bikeshed_fixup.py $(BUILDDIR)/bikeshed_singlehtml/index.html \\\n\t\t>$(BUILDDIR)/bikeshed_singlehtml/index_fixed.html\n\tmkdir -p $(BUILDDIR)/bikeshed_mathjax/\n\tbikeshed spec index.bs $(BUILDDIR)/bikeshed_mathjax/index.html\n\tmkdir -p $(BUILDDIR)/html/bikeshed/\n\t(cd util/katex/ && yarn && yarn build && npm install --only=prod)\n\tpython util/mathjax2katex.py $(BUILDDIR)/bikeshed_mathjax/index.html \\\n\t\t>$(BUILDDIR)/html/bikeshed/index.html\n\tmkdir -p $(BUILDDIR)/html/bikeshed/katex/dist/\n\tcp -r util/katex/dist/* $(BUILDDIR)/html/bikeshed/katex/dist/\n\tpatch -p0 $(BUILDDIR)/html/bikeshed/katex/dist/katex.css \\\n\t\t< util/katex_fix.patch\n\tcp $(BUILDDIR)/bikeshed_singlehtml/_static/pygments.css \\\n\t\t$(BUILDDIR)/html/bikeshed/\n\t@echo\n\t@echo \"Build finished. The HTML page is in $(BUILDDIR)/html/bikeshed/.\"\n\n.PHONY: WD-tar\nWD-tar: bikeshed\n\t@echo \"Building tar file...\"\n\ttar cvf \\\n\t\t$(BUILDDIR)/WD.tar \\\n\t\t--transform='s|$(BUILDDIR)/html/bikeshed/||' \\\n\t\t--transform='s|index.html|Overview.html|' \\\n\t\t$(BUILDDIR)/html/bikeshed/index.html \\\n\t\t$(BUILDDIR)/html/bikeshed/pygments.css \\\n\t\t$(BUILDDIR)/html/bikeshed/katex/dist/katex.css \\\n\t\t$(BUILDDIR)/html/bikeshed/katex/dist/fonts\n\t@echo \"Built $(BUILDDIR)/WD.tar.\"\n\n.PHONY: WD-echidna\nWD-echidna: WD-tar\n\t@if [ -z $(W3C_USERNAME) ] || \\\n\t [ -z $(W3C_PASSWORD) ] || \\\n\t\t\t[ -z $(DECISION_URL) ] ; then \\\n\t\techo \"Must provide W3C_USERNAME, W3C_PASSWORD, and DECISION_URL environment variables\"; \\\n\t\texit 1; \\\n\tfi\n\tcurl 'https://labs.w3.org/echidna/api/request' \\\n\t\t--user '$(W3C_USERNAME):$(W3C_PASSWORD)' \\\n\t\t-F \"tar=@$(BUILDDIR)/WD.tar\" \\\n\t\t-F \"decision=$(DECISION_URL)\" | tee $(BUILDDIR)/WD-echidna-id.txt\n\t@echo\n\t@echo \"Published working draft. Check its status at https://labs.w3.org/echidna/api/status?id=`cat $(BUILDDIR)/WD-echidna-id.txt`\"\n\n.PHONY: diff\ndiff: bikeshed\n\t@echo \"Downloading the old single-file html spec...\"\n\tcurl `grep \"^TR\" index.bs | cut -d' ' -f2` -o $(BUILDDIR)/html/bikeshed/old.html\n\t@echo \"Done.\"\n\t@echo \"Diffing new against old (go get a coffee)...\"\n\tperl ../util/htmldiff.pl $(BUILDDIR)/html/bikeshed/old.html $(BUILDDIR)/html/bikeshed/index.html $(BUILDDIR)/html/bikeshed/diff.html\n\t@echo \"Done. The diff is at $(BUILDDIR)/html/bikeshed/diff.html\"\n\n.PHONY: pickle\npickle:\n\t$(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle\n\t@echo\n\t@echo \"Build finished; now you can process the pickle files.\"\n\n.PHONY: json\njson:\n\t$(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json\n\t@echo\n\t@echo \"Build finished; now you can process the JSON files.\"\n\n.PHONY: htmlhelp\nhtmlhelp:\n\t$(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp\n\t@echo\n\t@echo \"Build finished; now you can run HTML Help Workshop with the\" \\\n\t \".hhp project file in $(BUILDDIR)/htmlhelp.\"\n\n.PHONY: qthelp\nqthelp:\n\t$(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp\n\t@echo\n\t@echo \"Build finished; now you can run \"qcollectiongenerator\" with the\" \\\n\t \".qhcp project file in $(BUILDDIR)/qthelp, like this:\"\n\t@echo \"# qcollectiongenerator $(BUILDDIR)/qthelp/WebAssembly.qhcp\"\n\t@echo \"To view the help file:\"\n\t@echo \"# assistant -collectionFile $(BUILDDIR)/qthelp/WebAssembly.qhc\"\n\n.PHONY: applehelp\napplehelp:\n\t$(SPHINXBUILD) -b applehelp $(ALLSPHINXOPTS) $(BUILDDIR)/applehelp\n\t@echo\n\t@echo \"Build finished. The help book is in $(BUILDDIR)/applehelp.\"\n\t@echo \"N.B. You won't be able to view it unless you put it in\" \\\n\t \"~/Library/Documentation/Help or install it in your application\" \\\n\t \"bundle.\"\n\n.PHONY: devhelp\ndevhelp:\n\t$(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp\n\t@echo\n\t@echo \"Build finished.\"\n\t@echo \"To view the help file:\"\n\t@echo \"# mkdir -p $$HOME/.local/share/devhelp/WebAssembly\"\n\t@echo \"# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/WebAssembly\"\n\t@echo \"# devhelp\"\n\n.PHONY: epub\nepub:\n\t$(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub\n\t@echo\n\t@echo \"Build finished. The epub file is in $(BUILDDIR)/epub.\"\n\n.PHONY: epub3\nepub3:\n\t$(SPHINXBUILD) -b epub3 $(ALLSPHINXOPTS) $(BUILDDIR)/epub3\n\t@echo\n\t@echo \"Build finished. The epub3 file is in $(BUILDDIR)/epub3.\"\n\n.PHONY: latex\nlatex:\n\t$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex\n\t@echo\n\t@echo \"Build finished; the LaTeX files are in $(BUILDDIR)/latex.\"\n\t@echo \"Run \\`make' in that directory to run these through (pdf)latex\" \\\n\t \"(use \\`make latexpdf' here to do that automatically).\"\n\n.PHONY: latexpdf\nlatexpdf:\n\t$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex\n\t@echo \"Running LaTeX files through pdflatex...\"\n\t$(MAKE) -C $(BUILDDIR)/latex LATEXMKOPTS=\" $(BUILDDIR)/latex/LOG 2>&1 || cat $(BUILDDIR)/latex/LOG\n\t@echo \"pdflatex finished; the PDF files are in $(BUILDDIR)/latex.\"\n\n.PHONY: latexpdfja\nlatexpdfja:\n\t$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex\n\t@echo \"Running LaTeX files through platex and dvipdfmx...\"\n\t$(MAKE) -C $(BUILDDIR)/latex all-pdf-ja\n\t@echo \"pdflatex finished; the PDF files are in $(BUILDDIR)/latex.\"\n\n.PHONY: text\ntext:\n\t$(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text\n\t@echo\n\t@echo \"Build finished. The text files are in $(BUILDDIR)/text.\"\n\n.PHONY: man\nman:\n\t$(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man\n\t@echo\n\t@echo \"Build finished. The manual pages are in $(BUILDDIR)/man.\"\n\n.PHONY: texinfo\ntexinfo:\n\t$(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo\n\t@echo\n\t@echo \"Build finished. The Texinfo files are in $(BUILDDIR)/texinfo.\"\n\t@echo \"Run \\`make' in that directory to run these through makeinfo\" \\\n\t \"(use \\`make info' here to do that automatically).\"\n\n.PHONY: info\ninfo:\n\t$(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo\n\t@echo \"Running Texinfo files through makeinfo...\"\n\tmake -C $(BUILDDIR)/texinfo info\n\t@echo \"makeinfo finished; the Info files are in $(BUILDDIR)/texinfo.\"\n\n.PHONY: gettext\ngettext:\n\t$(SPHINXBUILD) -b gettext $(I18NSPHINXOPTS) $(BUILDDIR)/locale\n\t@echo\n\t@echo \"Build finished. The message catalogs are in $(BUILDDIR)/locale.\"\n\n.PHONY: changes\nchanges:\n\t$(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes\n\t@echo\n\t@echo \"The overview file is in $(BUILDDIR)/changes.\"\n\n.PHONY: linkcheck\nlinkcheck:\n\t$(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck\n\t@echo\n\t@echo \"Link check complete; look for any errors in the above output \" \\\n\t \"or in $(BUILDDIR)/linkcheck/output.txt.\"\n\n.PHONY: doctest\ndoctest:\n\t$(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest\n\t@echo \"Testing of doctests in the sources finished, look at the \" \\\n\t \"results in $(BUILDDIR)/doctest/output.txt.\"\n\n.PHONY: coverage\ncoverage:\n\t$(SPHINXBUILD) -b coverage $(ALLSPHINXOPTS) $(BUILDDIR)/coverage\n\t@echo \"Testing of coverage in the sources finished, look at the \" \\\n\t \"results in $(BUILDDIR)/coverage/python.txt.\"\n\n.PHONY: xml\nxml:\n\t$(SPHINXBUILD) -b xml $(ALLSPHINXOPTS) $(BUILDDIR)/xml\n\t@echo\n\t@echo \"Build finished. The XML files are in $(BUILDDIR)/xml.\"\n\n.PHONY: pseudoxml\npseudoxml:\n\t$(SPHINXBUILD) -b pseudoxml $(ALLSPHINXOPTS) $(BUILDDIR)/pseudoxml\n\t@echo\n\t@echo \"Build finished. The pseudo-XML files are in $(BUILDDIR)/pseudoxml.\"\n\n.PHONY: dummy\ndummy:\n\t$(SPHINXBUILD) -b dummy $(ALLSPHINXOPTS) $(BUILDDIR)/dummy\n\t@echo\n\t@echo \"Build finished. Dummy builder generates no files.\"\n" }, { "path": "document/core/README.md", "content": "# WebAssembly Core Specification\n\nThis is the official WebAssembly \"language\" specification.\n\nIt uses [Sphinx](http://www.sphinx-doc.org/). To install that:\n```\npip install sphinx\n```\nTo make HTML (result in `_build/html`):\n```\nmake html\n```\nTo make PDF (result in `_build/latex`, requires LaTeX):\n```\nmake pdf\n```\nTo make all:\n```\nmake all\n```\nFinally, to make all and update webassembly.github.io/spec with it:\n```\nmake publish\n```\nPlease make sure to only use that once a change has approval.\n" }, { "path": "document/core/appendix/algorithm.rst", "content": ".. index:: validation, algorithm, instruction, module, binary format, opcode\n.. _algo-valid:\n\nValidation Algorithm\n--------------------\n\nThe specification of WebAssembly :ref:`validation ` is purely *declarative*.\nIt describes the constraints that must be met by a :ref:`module ` or :ref:`instruction ` sequence to be valid.\n\nThis section sketches the skeleton of a sound and complete *algorithm* for effectively validating code, i.e., sequences of :ref:`instructions `.\n(Other aspects of validation are straightforward to implement.)\n\nIn fact, the algorithm is expressed over the flat sequence of opcodes as occurring in the :ref:`binary format `, and performs only a single pass over it.\nConsequently, it can be integrated directly into a decoder.\n\nThe algorithm is expressed in typed pseudo code whose semantics is intended to be self-explanatory.\n\n\n.. index:: value type, stack, label, frame, instruction\n\nData Structures\n~~~~~~~~~~~~~~~\n\nTypes are representable as an enumeration.\n\n.. code-block:: pseudo\n\n type val_type = I32 | I64 | F32 | F64 | Funcref | Externref\n\n func is_num(t : val_type | Unknown) : bool =\n return t = I32 || t = I64 || t = F32 || t = F64 || t = Unknown\n\n func is_ref(t : val_type | Unknown) : bool =\n return t = Funcref || t = Externref || t = Unknown\n\nThe algorithm uses two separate stacks: the *value stack* and the *control stack*.\nThe former tracks the :ref:`types ` of operand values on the :ref:`stack `,\nthe latter surrounding :ref:`structured control instructions ` and their associated :ref:`blocks `.\n\n.. code-block:: pseudo\n\n type val_stack = stack(val_type | Unknown)\n\n type ctrl_stack = stack(ctrl_frame)\n type ctrl_frame = {\n opcode : opcode\n start_types : list(val_type)\n end_types : list(val_type)\n height : nat\n unreachable : bool\n }\n\nFor each value, the value stack records its :ref:`value type `, or :code:`Unknown` when the type is not known.\n\nFor each entered block, the control stack records a *control frame* with the originating opcode, the types on the top of the operand stack at the start and end of the block (used to check its result as well as branches), the height of the operand stack at the start of the block (used to check that operands do not underflow the current block), and a flag recording whether the remainder of the block is unreachable (used to handle :ref:`stack-polymorphic ` typing after branches).\n\nFor the purpose of presenting the algorithm, the operand and control stacks are simply maintained as global variables:\n\n.. code-block:: pseudo\n\n var vals : val_stack\n var ctrls : ctrl_stack\n\nHowever, these variables are not manipulated directly by the main checking function, but through a set of auxiliary functions:\n\n.. code-block:: pseudo\n\n func push_val(type : val_type | Unknown) =\n vals.push(type)\n\n func pop_val() : val_type | Unknown =\n if (vals.size() = ctrls[0].height && ctrls[0].unreachable) return Unknown\n error_if(vals.size() = ctrls[0].height)\n return vals.pop()\n\n func pop_val(expect : val_type | Unknown) : val_type | Unknown =\n let actual = pop_val()\n if (actual = Unknown) return expect\n if (expect = Unknown) return actual\n error_if(actual =/= expect)\n return actual\n\n func push_vals(types : list(val_type)) = foreach (t in types) push_val(t)\n func pop_vals(types : list(val_type)) : list(val_type) =\n var popped := []\n foreach (t in reverse(types)) popped.append(pop_val(t))\n return popped\n\nPushing an operand value simply pushes the respective type to the value stack.\n\nPopping an operand value checks that the value stack does not underflow the current block and then removes one type.\nBut first, a special case is handled where the block contains no known values, but has been marked as unreachable.\nThat can occur after an unconditional branch, when the stack is typed :ref:`polymorphically `.\nIn that case, an unknown type is returned.\n\nA second function for popping an operand value takes an expected type, which the actual operand type is checked against.\nThe types may differ in case one of them is Unknown.\nThe function returns the actual type popped from the stack.\n\nFinally, there are accumulative functions for pushing or popping multiple operand types.\n\n.. note::\n The notation :code:`stack[i]` is meant to index the stack from the top,\n so that, e.g., :code:`ctrls[0]` accesses the element pushed last.\n\n\nThe control stack is likewise manipulated through auxiliary functions:\n\n.. code-block:: pseudo\n\n func push_ctrl(opcode : opcode, in : list(val_type), out : list(val_type)) =\n  let frame = ctrl_frame(opcode, in, out, vals.size(), false)\n   ctrls.push(frame)\n push_vals(in)\n\n func pop_ctrl() : ctrl_frame =\n  error_if(ctrls.is_empty())\n  let frame = ctrls[0]\n   pop_vals(frame.end_types)\n   error_if(vals.size() =/= frame.height)\n ctrls.pop()\n   return frame\n\n func label_types(frame : ctrl_frame) : list(val_types) =\n return (if frame.opcode == loop then frame.start_types else frame.end_types)\n\n func unreachable() =\n   vals.resize(ctrls[0].height)\n   ctrls[0].unreachable := true\n\nPushing a control frame takes the types of the label and result values.\nIt allocates a new frame record recording them along with the current height of the operand stack and marks the block as reachable.\n\nPopping a frame first checks that the control stack is not empty.\nIt then verifies that the operand stack contains the right types of values expected at the end of the exited block and pops them off the operand stack.\nAfterwards, it checks that the stack has shrunk back to its initial height.\n\nThe type of the :ref:`label ` associated with a control frame is either that of the stack at the start or the end of the frame, determined by the opcode that it originates from.\n\nFinally, the current frame can be marked as unreachable.\nIn that case, all existing operand types are purged from the value stack, in order to allow for the :ref:`stack-polymorphism ` logic in :code:`pop_val` to take effect.\n\n.. note::\n Even with the unreachable flag set, consecutive operands are still pushed to and popped from the operand stack.\n That is necessary to detect invalid :ref:`examples ` like :math:`(\\UNREACHABLE~(\\I32.\\CONST)~\\I64.\\ADD)`.\n However, a polymorphic stack cannot underflow, but instead generates :code:`Unknown` types as needed.\n\n\n.. index:: opcode\n\nValidation of Opcode Sequences\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nThe following function shows the validation of a number of representative instructions that manipulate the stack.\nOther instructions are checked in a similar manner.\n\n.. note::\n Various instructions not shown here will additionally require the presence of a validation :ref:`context ` for checking uses of :ref:`indices `.\n That is an easy addition and therefore omitted from this presentation.\n\n.. code-block:: pseudo\n\n func validate(opcode) =\n switch (opcode)\n case (i32.add)\n pop_val(I32)\n pop_val(I32)\n push_val(I32)\n\n case (drop)\n pop_val()\n\n case (select)\n pop_val(I32)\n let t1 = pop_val()\n let t2 = pop_val()\n error_if(not (is_num(t1) && is_num(t2)))\n error_if(t1 =/= t2 && t1 =/= Unknown && t2 =/= Unknown)\n push_val(if (t1 = Unknown) t2 else t1)\n\n case (select t)\n pop_val(I32)\n pop_val(t)\n pop_val(t)\n push_val(t)\n\n    case (unreachable)\n       unreachable()\n\n case (block t1*->t2*)\n pop_vals([t1*])\n push_ctrl(block, [t1*], [t2*])\n\n case (loop t1*->t2*)\n pop_vals([t1*])\n push_ctrl(loop, [t1*], [t2*])\n\n case (if t1*->t2*)\n pop_val(I32)\n pop_vals([t1*])\n push_ctrl(if, [t1*], [t2*])\n\n case (end)\n let frame = pop_ctrl()\n push_vals(frame.end_types)\n\n case (else)\n let frame = pop_ctrl()\n error_if(frame.opcode =/= if)\n push_ctrl(else, frame.start_types, frame.end_types)\n\n case (br n)\n      error_if(ctrls.size() < n)\n       pop_vals(label_types(ctrls[n]))\n       unreachable()\n\n case (br_if n)\n      error_if(ctrls.size() < n)\n pop_val(I32)\n       pop_vals(label_types(ctrls[n]))\n       push_vals(label_types(ctrls[n]))\n\n    case (br_table n* m)\n pop_val(I32)\n       error_if(ctrls.size() < m)\n let arity = label_types(ctrls[m]).size()\n       foreach (n in n*)\n         error_if(ctrls.size() < n)\n         error_if(label_types(ctrls[n]).size() =/= arity)\n push_vals(pop_vals(label_types(ctrls[n])))\n pop_vals(label_types(ctrls[m]))\n       unreachable()\n\n\n.. note::\n It is an invariant under the current WebAssembly instruction set that an operand of :code:`Unknown` type is never duplicated on the stack.\n This would change if the language were extended with stack instructions like :code:`dup`.\n Under such an extension, the above algorithm would need to be refined by replacing the :code:`Unknown` type with proper *type variables* to ensure that all uses are consistent.\n" }, { "path": "document/core/appendix/custom.rst", "content": ".. index:: custom section, section, binary format\n\nCustom Sections\n---------------\n\nThis appendix defines dedicated :ref:`custom sections ` for WebAssembly's :ref:`binary format `.\nSuch sections do not contribute to, or otherwise affect, the WebAssembly semantics, and like any custom section they may be ignored by an implementation.\nHowever, they provide useful meta data that implementations can make use of to improve user experience or take compilation hints.\n\nCurrently, only one dedicated custom section is defined, the :ref:`name section`.\n\n\n.. index:: ! name section, name, Unicode UTF-8\n.. _binary-namesec:\n\nName Section\n~~~~~~~~~~~~\n\nThe *name section* is a :ref:`custom section ` whose name string is itself :math:`\\text{name}`.\nThe name section should appear only once in a module, and only after the :ref:`data section `.\n\nThe purpose of this section is to attach printable names to definitions in a module, which e.g. can be used by a debugger or when parts of the module are to be rendered in :ref:`text form `.\n\n.. note::\n All :ref:`names ` are represented in |Unicode|_ encoded in UTF-8.\n Names need not be unique.\n\n\n.. _binary-namesubsection:\n\nSubsections\n...........\n\nThe :ref:`data ` of a name section consists of a sequence of *subsections*.\nEach subsection consists of a\n\n* a one-byte subsection *id*,\n* the |U32| *size* of the contents, in bytes,\n* the actual *contents*, whose structure is depended on the subsection id.\n\n.. math::\n \\begin{array}{llcll}\n \\production{name section} & \\Bnamesec &::=&\n \\Bsection_0(\\Bnamedata) \\\\\n \\production{name data} & \\Bnamedata &::=&\n n{:}\\Bname & (\\iff n = \\text{name}) \\\\ &&&\n \\Bmodulenamesubsec^? \\\\ &&&\n \\Bfuncnamesubsec^? \\\\ &&&\n \\Blocalnamesubsec^? \\\\\n \\production{name subsection} & \\Bnamesubsection_N(\\B{B}) &::=&\n N{:}\\Bbyte~~\\X{size}{:}\\Bu32~~\\B{B}\n & (\\iff \\X{size} = ||\\B{B}||) \\\\\n \\end{array}\n\nThe following subsection ids are used:\n\n== ===========================================\nId Subsection \n== ===========================================\n 0 :ref:`module name `\n 1 :ref:`function names ` \n 2 :ref:`local names `\n== ===========================================\n\nEach subsection may occur at most once, and in order of increasing id.\n\n\n.. index:: ! name map, index, index space\n.. _binary-indirectnamemap:\n.. _binary-namemap:\n\nName Maps\n.........\n\nA *name map* assigns :ref:`names ` to :ref:`indices ` in a given :ref:`index space `.\nIt consists of a :ref:`vector ` of index/name pairs in order of increasing index value.\nEach index must be unique, but the assigned names need not be.\n\n.. math::\n \\begin{array}{llclll}\n \\production{name map} & \\Bnamemap &::=&\n \\Bvec(\\Bnameassoc) \\\\\n \\production{name association} & \\Bnameassoc &::=&\n \\Bidx~\\Bname \\\\\n \\end{array}\n\nAn *indirect name map* assigns :ref:`names ` to a two-dimensional :ref:`index space `, where secondary indices are *grouped* by primary indices.\nIt consists of a vector of primary index/name map pairs in order of increasing index value, where each name map in turn maps secondary indices to names.\nEach primary index must be unique, and likewise each secondary index per individual name map.\n\n.. math::\n \\begin{array}{llclll}\n \\production{indirect name map} & \\Bindirectnamemap &::=&\n \\Bvec(\\Bindirectnameassoc) \\\\\n \\production{indirect name association} & \\Bindirectnameassoc &::=&\n \\Bidx~\\Bnamemap \\\\\n \\end{array}\n\n\n.. index:: module\n.. _binary-modulenamesec:\n\nModule Names\n............\n\nThe *module name subsection* has the id 0.\nIt simply consists of a single :ref:`name ` that is assigned to the module itself.\n\n.. math::\n \\begin{array}{llclll}\n \\production{module name subsection} & \\Bmodulenamesubsec &::=&\n \\Bnamesubsection_0(\\Bname) \\\\\n \\end{array}\n\n\n.. index:: function, function index\n.. _binary-funcnamesec:\n\nFunction Names\n..............\n\nThe *function name subsection* has the id 1.\nIt consists of a :ref:`name map ` assigning function names to :ref:`function indices `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{function name subsection} & \\Bfuncnamesubsec &::=&\n \\Bnamesubsection_1(\\Bnamemap) \\\\\n \\end{array}\n\n\n.. index:: function, local, function index, local index\n.. _binary-localnamesec:\n\nLocal Names\n...........\n\nThe *local name subsection* has the id 2.\nIt consists of an :ref:`indirect name map ` assigning local names to :ref:`local indices ` grouped by :ref:`function indices `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{local name subsection} & \\Blocalnamesubsec &::=&\n \\Bnamesubsection_2(\\Bindirectnamemap) \\\\\n \\end{array}\n" }, { "path": "document/core/appendix/embedding.rst", "content": ".. index:: ! embedding, embedder, implementation, host\n.. _embed:\n\nEmbedding\n---------\n\nA WebAssembly implementation will typically be *embedded* into a *host* environment.\nAn *embedder* implements the connection between such a host environment and the WebAssembly semantics as defined in the main body of this specification.\nAn embedder is expected to interact with the semantics in well-defined ways.\n\nThis section defines a suitable interface to the WebAssembly semantics in the form of entry points through which an embedder can access it.\nThe interface is intended to be complete, in the sense that an embedder does not need to reference other functional parts of the WebAssembly specification directly.\n\n.. note::\n On the other hand, an embedder does not need to provide the host environment with access to all functionality defined in this interface.\n For example, an implementation may not support :ref:`parsing ` of the :ref:`text format `.\n\nTypes\n~~~~~\n\nIn the description of the embedder interface, syntactic classes from the :ref:`abstract syntax ` and the :ref:`runtime's abstract machine ` are used as names for variables that range over the possible objects from that class.\nHence, these syntactic classes can also be interpreted as types.\n\nFor numeric parameters, notation like :math:`n:\\u32` is used to specify a symbolic name in addition to the respective value range.\n\n\n.. _embed-error:\n\nErrors\n~~~~~~\n\nFailure of an interface operation is indicated by an auxiliary syntactic class:\n\n.. math::\n \\begin{array}{llll}\n \\production{(error)} & \\error &::=& \\ERROR \\\\\n \\end{array}\n\nIn addition to the error conditions specified explicitly in this section, implementations may also return errors when specific :ref:`implementation limitations ` are reached.\n\n.. note::\n Errors are abstract and unspecific with this definition.\n Implementations can refine it to carry suitable classifications and diagnostic messages.\n\n\nPre- and Post-Conditions\n~~~~~~~~~~~~~~~~~~~~~~~~\n\nSome operations state *pre-conditions* about their arguments or *post-conditions* about their results.\nIt is the embedder's responsibility to meet the pre-conditions.\nIf it does, the post conditions are guaranteed by the semantics.\n\nIn addition to pre- and post-conditions explicitly stated with each operation, the specification adopts the following conventions for :ref:`runtime objects ` (:math:`store`, :math:`\\moduleinst`, :math:`\\externval`, :ref:`addresses `):\n\n* Every runtime object passed as a parameter must be :ref:`valid ` per an implicit pre-condition.\n\n* Every runtime object returned as a result is :ref:`valid ` per an implicit post-condition.\n\n.. note::\n As long as an embedder treats runtime objects as abstract and only creates and manipulates them through the interface defined here, all implicit pre-conditions are automatically met.\n\n\n\n.. index:: allocation, store\n.. _embed-store:\n\nStore\n~~~~~\n\n.. _embed-store-init:\n\n:math:`\\F{store\\_init}() : \\store`\n..................................\n\n1. Return the empty :ref:`store `.\n\n.. math::\n \\begin{array}{lclll}\n \\F{store\\_init}() &=& \\{ \\SFUNCS~\\epsilon,~ \\SMEMS~\\epsilon,~ \\STABLES~\\epsilon,~ \\SGLOBALS~\\epsilon \\} \\\\\n \\end{array}\n\n\n\n.. index:: module\n.. _embed-module:\n\nModules\n~~~~~~~\n\n.. index:: binary format\n.. _embed-module-decode:\n\n:math:`\\F{module\\_decode}(\\byte^\\ast) : \\module ~|~ \\error`\n...........................................................\n\n1. If there exists a derivation for the :ref:`byte ` sequence :math:`\\byte^\\ast` as a :math:`\\Bmodule` according to the :ref:`binary grammar for modules `, yielding a :ref:`module ` :math:`m`, then return :math:`m`.\n\n2. Else, return :math:`\\ERROR`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{module\\_decode}(b^\\ast) &=& m && (\\iff \\Bmodule \\stackrel\\ast\\Longrightarrow m{:}b^\\ast) \\\\\n \\F{module\\_decode}(b^\\ast) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. index:: text format\n.. _embed-module-parse:\n\n:math:`\\F{module\\_parse}(\\char^\\ast) : \\module ~|~ \\error`\n..........................................................\n\n1. If there exists a derivation for the :ref:`source ` :math:`\\char^\\ast` as a :math:`\\Tmodule` according to the :ref:`text grammar for modules `, yielding a :ref:`module ` :math:`m`, then return :math:`m`.\n\n2. Else, return :math:`\\ERROR`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{module\\_parse}(c^\\ast) &=& m && (\\iff \\Tmodule \\stackrel\\ast\\Longrightarrow m{:}c^\\ast) \\\\\n \\F{module\\_parse}(c^\\ast) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. index:: validation\n.. _embed-module-validate:\n\n:math:`\\F{module\\_validate}(\\module) : \\error^?`\n................................................\n\n1. If :math:`\\module` is :ref:`valid `, then return nothing.\n\n2. Else, return :math:`\\ERROR`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{module\\_validate}(m) &=& \\epsilon && (\\iff {} \\vdashmodule m : \\externtype^\\ast \\to {\\externtype'}^\\ast) \\\\\n \\F{module\\_validate}(m) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. index:: instantiation, module instance\n.. _embed-module-instantiate:\n\n:math:`\\F{module\\_instantiate}(\\store, \\module, \\externval^\\ast) : (\\store, \\moduleinst ~|~ \\error)`\n....................................................................................................\n\n1. Try :ref:`instantiating ` :math:`\\module` in :math:`\\store` with :ref:`external values ` :math:`\\externval^\\ast` as imports:\n\n a. If it succeeds with a :ref:`module instance ` :math:`\\moduleinst`, then let :math:`\\X{result}` be :math:`\\moduleinst`.\n\n b. Else, let :math:`\\X{result}` be :math:`\\ERROR`.\n\n2. Return the new store paired with :math:`\\X{result}`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{module\\_instantiate}(S, m, \\X{ev}^\\ast) &=& (S', F.\\AMODULE) && (\\iff \\instantiate(S, m, \\X{ev}^\\ast) \\stepto^\\ast S'; F; \\epsilon) \\\\\n \\F{module\\_instantiate}(S, m, \\X{ev}^\\ast) &=& (S', \\ERROR) && (\\iff \\instantiate(S, m, \\X{ev}^\\ast) \\stepto^\\ast S'; F; \\TRAP) \\\\\n \\end{array}\n\n.. note::\n The store may be modified even in case of an error.\n\n\n.. index:: import\n.. _embed-module-imports:\n\n:math:`\\F{module\\_imports}(\\module) : (\\name, \\name, \\externtype)^\\ast`\n.......................................................................\n\n1. Pre-condition: :math:`\\module` is :ref:`valid ` with external import types :math:`\\externtype^\\ast` and external export types :math:`{\\externtype'}^\\ast`.\n\n2. Let :math:`\\import^\\ast` be the :ref:`imports ` :math:`\\module.\\MIMPORTS`.\n\n3. Assert: the length of :math:`\\import^\\ast` equals the length of :math:`\\externtype^\\ast`.\n\n4. For each :math:`\\import_i` in :math:`\\import^\\ast` and corresponding :math:`\\externtype_i` in :math:`\\externtype^\\ast`, do:\n\n a. Let :math:`\\X{result}_i` be the triple :math:`(\\import_i.\\IMODULE, \\import_i.\\INAME, \\externtype_i)`.\n\n5. Return the concatenation of all :math:`\\X{result}_i`, in index order.\n\n6. Post-condition: each :math:`\\externtype_i` is :ref:`valid `.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{module\\_imports}(m) &=& (\\X{im}.\\IMODULE, \\X{im}.\\INAME, \\externtype)^\\ast \\\\\n && \\qquad (\\iff \\X{im}^\\ast = m.\\MIMPORTS \\wedge {} \\vdashmodule m : \\externtype^\\ast \\to {\\externtype'}^\\ast) \\\\\n \\end{array}\n\n\n.. index:: export\n.. _embed-module-exports:\n\n:math:`\\F{module\\_exports}(\\module) : (\\name, \\externtype)^\\ast`\n................................................................\n\n1. Pre-condition: :math:`\\module` is :ref:`valid ` with external import types :math:`\\externtype^\\ast` and external export types :math:`{\\externtype'}^\\ast`.\n\n2. Let :math:`\\export^\\ast` be the :ref:`exports ` :math:`\\module.\\MEXPORTS`.\n\n3. Assert: the length of :math:`\\export^\\ast` equals the length of :math:`{\\externtype'}^\\ast`.\n\n4. For each :math:`\\export_i` in :math:`\\export^\\ast` and corresponding :math:`\\externtype'_i` in :math:`{\\externtype'}^\\ast`, do:\n\n a. Let :math:`\\X{result}_i` be the pair :math:`(\\export_i.\\ENAME, \\externtype'_i)`.\n\n5. Return the concatenation of all :math:`\\X{result}_i`, in index order.\n\n6. Post-condition: each :math:`\\externtype'_i` is :ref:`valid `.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{module\\_exports}(m) &=& (\\X{ex}.\\ENAME, \\externtype')^\\ast \\\\\n && \\qquad (\\iff \\X{ex}^\\ast = m.\\MEXPORTS \\wedge {} \\vdashmodule m : \\externtype^\\ast \\to {\\externtype'}^\\ast) \\\\\n \\end{array}\n\n\n.. index:: module, module instance\n.. _embed-instance:\n\nModule Instances\n~~~~~~~~~~~~~~~~\n\n.. index:: export, export instance\n\n.. _embed-instance-export:\n\n:math:`\\F{instance\\_export}(\\moduleinst, \\name) : \\externval ~|~ \\error`\n........................................................................\n\n1. Assert: due to :ref:`validity ` of the :ref:`module instance ` :math:`\\moduleinst`, all its :ref:`export names ` are different.\n\n2. If there exists an :math:`\\exportinst_i` in :math:`\\moduleinst.\\MIEXPORTS` such that :ref:`name ` :math:`\\exportinst_i.\\EINAME` equals :math:`\\name`, then:\n\n a. Return the :ref:`external value ` :math:`\\exportinst_i.\\EIVALUE`.\n\n3. Else, return :math:`\\ERROR`.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{instance\\_export}(m, \\name) &=& m.\\MIEXPORTS[i].\\EIVALUE && (\\iff m.\\MEXPORTS[i].\\EINAME = \\name) \\\\\n \\F{instance\\_export}(m, \\name) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. index:: function, host function, function address, function instance, function type, store\n.. _embed-func:\n\nFunctions\n~~~~~~~~~\n\n.. _embed-func-alloc:\n\n:math:`\\F{func\\_alloc}(\\store, \\functype, \\hostfunc) : (\\store, \\funcaddr)`\n...........................................................................\n\n1. Pre-condition: :math:`\\functype` is :math:`valid `.\n\n2. Let :math:`\\funcaddr` be the result of :ref:`allocating a host function ` in :math:`\\store` with :ref:`function type ` :math:`\\functype` and host function code :math:`\\hostfunc`.\n\n3. Return the new store paired with :math:`\\funcaddr`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{func\\_alloc}(S, \\X{ft}, \\X{code}) &=& (S', \\X{a}) && (\\iff \\allochostfunc(S, \\X{ft}, \\X{code}) = S', \\X{a}) \\\\\n \\end{array}\n\n.. note::\n This operation assumes that :math:`\\hostfunc` satisfies the :ref:`pre- and post-conditions ` required for a function instance with type :math:`\\functype`.\n\n Regular (non-host) function instances can only be created indirectly through :ref:`module instantiation `.\n\n\n.. _embed-func-type:\n\n:math:`\\F{func\\_type}(\\store, \\funcaddr) : \\functype`\n.....................................................\n\n1. Return :math:`S.\\SFUNCS[a].\\FITYPE`.\n\n2. Post-condition: the returned :ref:`function type ` is :ref:`valid `.\n\n.. math::\n \\begin{array}{lclll}\n \\F{func\\_type}(S, a) &=& S.\\SFUNCS[a].\\FITYPE \\\\\n \\end{array}\n\n\n.. index:: invocation, value, result\n.. _embed-func-invoke:\n\n:math:`\\F{func\\_invoke}(\\store, \\funcaddr, \\val^\\ast) : (\\store, \\val^\\ast ~|~ \\error)`\n........................................................................................\n\n1. Try :ref:`invoking ` the function :math:`\\funcaddr` in :math:`\\store` with :ref:`values ` :math:`\\val^\\ast` as arguments:\n\n a. If it succeeds with :ref:`values ` :math:`{\\val'}^\\ast` as results, then let :math:`\\X{result}` be :math:`{\\val'}^\\ast`.\n\n b. Else it has trapped, hence let :math:`\\X{result}` be :math:`\\ERROR`.\n\n2. Return the new store paired with :math:`\\X{result}`.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{func\\_invoke}(S, a, v^\\ast) &=& (S', {v'}^\\ast) && (\\iff \\invoke(S, a, v^\\ast) \\stepto^\\ast S'; F; {v'}^\\ast) \\\\\n \\F{func\\_invoke}(S, a, v^\\ast) &=& (S', \\ERROR) && (\\iff \\invoke(S, a, v^\\ast) \\stepto^\\ast S'; F; \\TRAP) \\\\\n \\end{array}\n\n.. note::\n The store may be modified even in case of an error.\n\n\n.. index:: table, table address, store, table instance, table type, element, function address\n.. _embed-table:\n\nTables\n~~~~~~\n\n.. _embed-table-alloc:\n\n:math:`\\F{table\\_alloc}(\\store, \\tabletype) : (\\store, \\tableaddr, \\reff)`\n..........................................................................\n\n1. Pre-condition: :math:`\\tabletype` is :math:`valid `.\n\n2. Let :math:`\\tableaddr` be the result of :ref:`allocating a table ` in :math:`\\store` with :ref:`table type ` :math:`\\tabletype` and initialization value :math:`\\reff`.\n\n3. Return the new store paired with :math:`\\tableaddr`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{table\\_alloc}(S, \\X{tt}, r) &=& (S', \\X{a}) && (\\iff \\alloctable(S, \\X{tt}, r) = S', \\X{a}) \\\\\n \\end{array}\n\n\n.. _embed-table-type:\n\n:math:`\\F{table\\_type}(\\store, \\tableaddr) : \\tabletype`\n........................................................\n\n1. Return :math:`S.\\STABLES[a].\\TITYPE`.\n\n2. Post-condition: the returned :ref:`table type ` is :math:`valid `.\n\n.. math::\n \\begin{array}{lclll}\n \\F{table\\_type}(S, a) &=& S.\\STABLES[a].\\TITYPE \\\\\n \\end{array}\n\n\n.. _embed-table-read:\n\n:math:`\\F{table\\_read}(\\store, \\tableaddr, i:\\u32) : \\reff ~|~ \\error`\n......................................................................\n\n1. Let :math:`\\X{ti}` be the :ref:`table instance ` :math:`\\store.\\STABLES[\\tableaddr]`.\n\n2. If :math:`i` is larger than or equal to the length of :math:`\\X{ti}.\\TIELEM`, then return :math:`\\ERROR`.\n\n3. Else, return the :ref:`reference value ` :math:`\\X{ti}.\\TIELEM[i]`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{table\\_read}(S, a, i) &=& r && (\\iff S.\\STABLES[a].\\TIELEM[i] = r) \\\\\n \\F{table\\_read}(S, a, i) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. _embed-table-write:\n\n:math:`\\F{table\\_write}(\\store, \\tableaddr, i:\\u32, \\reff) : \\store ~|~ \\error`\n...............................................................................\n\n1. Let :math:`\\X{ti}` be the :ref:`table instance ` :math:`\\store.\\STABLES[\\tableaddr]`.\n\n2. If :math:`i` is larger than or equal to the length of :math:`\\X{ti}.\\TIELEM`, then return :math:`\\ERROR`.\n\n3. Replace :math:`\\X{ti}.\\TIELEM[i]` with the :ref:`reference value ` :math:`\\reff`.\n\n4. Return the updated store.\n\n.. math::\n \\begin{array}{lclll}\n \\F{table\\_write}(S, a, i, r) &=& S' && (\\iff S' = S \\with \\STABLES[a].\\TIELEM[i] = r) \\\\\n \\F{table\\_write}(S, a, i, r) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. _embed-table-size:\n\n:math:`\\F{table\\_size}(\\store, \\tableaddr) : \\u32`\n..................................................\n\n1. Return the length of :math:`\\store.\\STABLES[\\tableaddr].\\TIELEM`.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{table\\_size}(S, a) &=& n &&\n (\\iff |S.\\STABLES[a].\\TIELEM| = n) \\\\\n \\end{array}\n\n\n\n.. _embed-table-grow:\n\n:math:`\\F{table\\_grow}(\\store, \\tableaddr, n:\\u32, \\reff) : \\store ~|~ \\error`\n..............................................................................\n\n1. Try :ref:`growing ` the :ref:`table instance ` :math:`\\store.\\STABLES[\\tableaddr]` by :math:`n` elements with initialization value :math:`\\reff`:\n\n a. If it succeeds, return the updated store.\n\n b. Else, return :math:`\\ERROR`.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{table\\_grow}(S, a, n, r) &=& S' &&\n (\\iff S' = S \\with \\STABLES[a] = \\growtable(S.\\STABLES[a], n, r)) \\\\\n \\F{table\\_grow}(S, a, n, r) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. index:: memory, memory address, store, memory instance, memory type, byte\n.. _embed-mem:\n\nMemories\n~~~~~~~~\n\n.. _embed-mem-alloc:\n\n:math:`\\F{mem\\_alloc}(\\store, \\memtype) : (\\store, \\memaddr)`\n................................................................\n\n1. Pre-condition: :math:`\\memtype` is :math:`valid `.\n\n2. Let :math:`\\memaddr` be the result of :ref:`allocating a memory ` in :math:`\\store` with :ref:`memory type ` :math:`\\memtype`.\n\n3. Return the new store paired with :math:`\\memaddr`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{mem\\_alloc}(S, \\X{mt}) &=& (S', \\X{a}) && (\\iff \\allocmem(S, \\X{mt}) = S', \\X{a}) \\\\\n \\end{array}\n\n\n.. _embed-mem-type:\n\n:math:`\\F{mem\\_type}(\\store, \\memaddr) : \\memtype`\n..................................................\n\n1. Return :math:`S.\\SMEMS[a].\\MITYPE`.\n\n2. Post-condition: the returned :ref:`memory type ` is :math:`valid `.\n\n.. math::\n \\begin{array}{lclll}\n \\F{mem\\_type}(S, a) &=& S.\\SMEMS[a].\\MITYPE \\\\\n \\end{array}\n\n\n.. _embed-mem-read:\n\n:math:`\\F{mem\\_read}(\\store, \\memaddr, i:\\u32) : \\byte ~|~ \\error`\n..................................................................\n\n1. Let :math:`\\X{mi}` be the :ref:`memory instance ` :math:`\\store.\\SMEMS[\\memaddr]`.\n\n2. If :math:`i` is larger than or equal to the length of :math:`\\X{mi}.\\MIDATA`, then return :math:`\\ERROR`.\n\n3. Else, return the :ref:`byte ` :math:`\\X{mi}.\\MIDATA[i]`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{mem\\_read}(S, a, i) &=& b && (\\iff S.\\SMEMS[a].\\MIDATA[i] = b) \\\\\n \\F{mem\\_read}(S, a, i) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. _embed-mem-write:\n\n:math:`\\F{mem\\_write}(\\store, \\memaddr, i:\\u32, \\byte) : \\store ~|~ \\error`\n...........................................................................\n\n1. Let :math:`\\X{mi}` be the :ref:`memory instance ` :math:`\\store.\\SMEMS[\\memaddr]`.\n\n2. If :math:`\\u32` is larger than or equal to the length of :math:`\\X{mi}.\\MIDATA`, then return :math:`\\ERROR`.\n\n3. Replace :math:`\\X{mi}.\\MIDATA[i]` with :math:`\\byte`.\n\n4. Return the updated store.\n\n.. math::\n \\begin{array}{lclll}\n \\F{mem\\_write}(S, a, i, b) &=& S' && (\\iff S' = S \\with \\SMEMS[a].\\MIDATA[i] = b) \\\\\n \\F{mem\\_write}(S, a, i, b) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n.. _embed-mem-size:\n\n:math:`\\F{mem\\_size}(\\store, \\memaddr) : \\u32`\n..............................................\n\n1. Return the length of :math:`\\store.\\SMEMS[\\memaddr].\\MIDATA` divided by the :ref:`page size `.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{mem\\_size}(S, a) &=& n &&\n (\\iff |S.\\SMEMS[a].\\MIDATA| = n \\cdot 64\\,\\F{Ki}) \\\\\n \\end{array}\n\n\n\n.. _embed-mem-grow:\n\n:math:`\\F{mem\\_grow}(\\store, \\memaddr, n:\\u32) : \\store ~|~ \\error`\n...................................................................\n\n1. Try :ref:`growing ` the :ref:`memory instance ` :math:`\\store.\\SMEMS[\\memaddr]` by :math:`n` :ref:`pages `:\n\n a. If it succeeds, return the updated store.\n\n b. Else, return :math:`\\ERROR`.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{mem\\_grow}(S, a, n) &=& S' &&\n (\\iff S' = S \\with \\SMEMS[a] = \\growmem(S.\\SMEMS[a], n)) \\\\\n \\F{mem\\_grow}(S, a, n) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n\n\n\n.. index:: global, global address, store, global instance, global type, value\n.. _embed-global:\n\nGlobals\n~~~~~~~\n\n.. _embed-global-alloc:\n\n:math:`\\F{global\\_alloc}(\\store, \\globaltype, \\val) : (\\store, \\globaladdr)`\n............................................................................\n\n1. Pre-condition: :math:`\\globaltype` is :math:`valid `.\n\n2. Let :math:`\\globaladdr` be the result of :ref:`allocating a global ` in :math:`\\store` with :ref:`global type ` :math:`\\globaltype` and initialization value :math:`\\val`.\n\n3. Return the new store paired with :math:`\\globaladdr`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{global\\_alloc}(S, \\X{gt}, v) &=& (S', \\X{a}) && (\\iff \\allocglobal(S, \\X{gt}, v) = S', \\X{a}) \\\\\n \\end{array}\n\n\n.. _embed-global-type:\n\n:math:`\\F{global\\_type}(\\store, \\globaladdr) : \\globaltype`\n...........................................................\n\n1. Return :math:`S.\\SGLOBALS[a].\\GITYPE`.\n\n2. Post-condition: the returned :ref:`global type ` is :math:`valid `.\n\n.. math::\n \\begin{array}{lclll}\n \\F{global\\_type}(S, a) &=& S.\\SGLOBALS[a].\\GITYPE \\\\\n \\end{array}\n\n\n.. _embed-global-read:\n\n:math:`\\F{global\\_read}(\\store, \\globaladdr) : \\val`\n....................................................\n\n1. Let :math:`\\X{gi}` be the :ref:`global instance ` :math:`\\store.\\SGLOBALS[\\globaladdr]`.\n\n2. Return the :ref:`value ` :math:`\\X{gi}.\\GIVALUE`.\n\n.. math::\n \\begin{array}{lclll}\n \\F{global\\_read}(S, a) &=& v && (\\iff S.\\SGLOBALS[a].\\GIVALUE = v) \\\\\n \\end{array}\n\n\n.. _embed-global-write:\n\n:math:`\\F{global\\_write}(\\store, \\globaladdr, \\val) : \\store ~|~ \\error`\n........................................................................\n\n1. Let :math:`\\X{gi}` be the :ref:`global instance ` :math:`\\store.\\SGLOBALS[\\globaladdr]`.\n\n2. Let :math:`\\mut~t` be the structure of the :ref:`global type ` :math:`\\X{gi}.\\GITYPE`.\n\n3. If :math:`\\mut` is not :math:`\\MVAR`, then return :math:`\\ERROR`.\n\n4. Replace :math:`\\X{gi}.\\GIVALUE` with the :ref:`value ` :math:`\\val`.\n\n5. Return the updated store.\n\n.. math::\n ~ \\\\\n \\begin{array}{lclll}\n \\F{global\\_write}(S, a, v) &=& S' && (\\iff S.\\SGLOBALS[a].\\GITYPE = \\MVAR~t \\wedge S' = S \\with \\SGLOBALS[a].\\GIVALUE = v) \\\\\n \\F{global\\_write}(S, a, v) &=& \\ERROR && (\\otherwise) \\\\\n \\end{array}\n" }, { "path": "document/core/appendix/gen-index-instructions.py", "content": "#!/usr/bin/env python3\n\n# This script generates the `index-instructions.rst` file. The table in that\n# file is particularly annoying to update by hand, since the Restructured Text\n# format requires the header and columns to line up properly. This is\n# especially tedious when merging changes from the upstream spec, or merging a\n# proposal back to the spec when it is standardized.\n\nimport os\n\nSCRIPT_DIR = os.path.dirname(os.path.abspath(__file__))\nINDEX_INSTRUCTIONS_RST = os.path.join(SCRIPT_DIR, 'index-instructions.rst')\n\nHEADER = \"\"\"\\\n.. DO NOT EDIT: This file is auto-generated by the gen-index-instructions.py script.\n\n.. index:: instruction\n.. _index-instr:\n\nIndex of Instructions\n---------------------\n\"\"\"\n\nCOLUMNS = [\n 'Instruction',\n 'Binary Opcode',\n 'Type',\n 'Validation',\n 'Execution',\n]\n\n\ndef MathWrap(s, default=''):\n if s is None:\n return default\n else:\n return f':math:`{s}`'\n\n\ndef RefWrap(s, kind):\n if s is None:\n return ''\n else:\n return f':ref:`{kind} <{s}>`'\n\n\ndef Instruction(name, opcode, type=None, validation=None, execution=None, operator=None):\n if operator:\n execution_str = ', '.join([RefWrap(execution, 'execution'),\n RefWrap(operator, 'operator')])\n else:\n execution_str = RefWrap(execution, 'execution')\n\n return (\n MathWrap(name, '(reserved)'),\n MathWrap(opcode),\n MathWrap(type),\n RefWrap(validation, 'validation'),\n execution_str\n )\n\n\nINSTRUCTIONS = [\n Instruction(r'\\UNREACHABLE', r'\\hex{00}', r'[t_1^\\ast] \\to [t_2^\\ast]', r'valid-unreachable', r'exec-unreachable'),\n Instruction(r'\\NOP', r'\\hex{01}', r'[] \\to []', r'valid-nop', r'exec-nop'),\n Instruction(r'\\BLOCK~\\X{bt}', r'\\hex{02}', r'[t_1^\\ast] \\to [t_2^\\ast]', r'valid-block', r'exec-block'),\n Instruction(r'\\LOOP~\\X{bt}', r'\\hex{03}', r'[t_1^\\ast] \\to [t_2^\\ast]', r'valid-loop', r'exec-loop'),\n Instruction(r'\\IF~\\X{bt}', r'\\hex{04}', r'[t_1^\\ast] \\to [t_2^\\ast]', r'valid-if', r'exec-if'),\n Instruction(r'\\ELSE', r'\\hex{05}'),\n Instruction(None, r'\\hex{06}'),\n Instruction(None, r'\\hex{07}'),\n Instruction(None, r'\\hex{08}'),\n Instruction(None, r'\\hex{09}'),\n Instruction(None, r'\\hex{0A}'),\n Instruction(r'\\END', r'\\hex{0B}'),\n Instruction(r'\\BR~l', r'\\hex{0C}', r'[t_1^\\ast~t^\\ast] \\to [t_2^\\ast]', r'valid-br', r'exec-br'),\n Instruction(r'\\BRIF~l', r'\\hex{0D}', r'[t^\\ast~\\I32] \\to [t^\\ast]', r'valid-br_if', r'exec-br_if'),\n Instruction(r'\\BRTABLE~l^\\ast~l', r'\\hex{0E}', r'[t_1^\\ast~t^\\ast~\\I32] \\to [t_2^\\ast]', r'valid-br_table', r'exec-br_table'),\n Instruction(r'\\RETURN', r'\\hex{0F}', r'[t_1^\\ast~t^\\ast] \\to [t_2^\\ast]', r'valid-return', r'exec-return'),\n Instruction(r'\\CALL~x', r'\\hex{10}', r'[t_1^\\ast] \\to [t_2^\\ast]', r'valid-call', r'exec-call'),\n Instruction(r'\\CALLINDIRECT~x~y', r'\\hex{11}', r'[t_1^\\ast~\\I32] \\to [t_2^\\ast]', r'valid-call_indirect', r'exec-call_indirect'),\n Instruction(None, r'\\hex{12}'),\n Instruction(None, r'\\hex{13}'),\n Instruction(None, r'\\hex{14}'),\n Instruction(None, r'\\hex{15}'),\n Instruction(None, r'\\hex{16}'),\n Instruction(None, r'\\hex{17}'),\n Instruction(None, r'\\hex{18}'),\n Instruction(None, r'\\hex{19}'),\n Instruction(r'\\DROP', r'\\hex{1A}', r'[t] \\to []', r'valid-drop', r'exec-drop'),\n Instruction(r'\\SELECT', r'\\hex{1B}', r'[t~t~\\I32] \\to [t]', r'valid-select', r'exec-select'),\n Instruction(r'\\SELECT~t', r'\\hex{1C}', r'[t~t~\\I32] \\to [t]', r'valid-select', r'exec-select'),\n Instruction(None, r'\\hex{1D}'),\n Instruction(None, r'\\hex{1E}'),\n Instruction(None, r'\\hex{1F}'),\n Instruction(r'\\LOCALGET~x', r'\\hex{20}', r'[] \\to [t]', r'valid-local.get', r'exec-local.get'),\n Instruction(r'\\LOCALSET~x', r'\\hex{21}', r'[t] \\to []', r'valid-local.set', r'exec-local.set'),\n Instruction(r'\\LOCALTEE~x', r'\\hex{22}', r'[t] \\to [t]', r'valid-local.tee', r'exec-local.tee'),\n Instruction(r'\\GLOBALGET~x', r'\\hex{23}', r'[] \\to [t]', r'valid-global.get', r'exec-global.get'),\n Instruction(r'\\GLOBALSET~x', r'\\hex{24}', r'[t] \\to []', r'valid-global.set', r'exec-global.set'),\n Instruction(r'\\TABLEGET~x', r'\\hex{25}', r'[\\I32] \\to [t]', r'valid-table.get', r'exec-table.get'),\n Instruction(r'\\TABLESET~x', r'\\hex{26}', r'[\\I32~t] \\to []', r'valid-table.set', r'exec-table.set'),\n Instruction(None, r'\\hex{27}'),\n Instruction(r'\\I32.\\LOAD~\\memarg', r'\\hex{28}', r'[\\I32] \\to [\\I32]', r'valid-load', r'exec-load'),\n Instruction(r'\\I64.\\LOAD~\\memarg', r'\\hex{29}', r'[\\I32] \\to [\\I64]', r'valid-load', r'exec-load'),\n Instruction(r'\\F32.\\LOAD~\\memarg', r'\\hex{2A}', r'[\\I32] \\to [\\F32]', r'valid-load', r'exec-load'),\n Instruction(r'\\F64.\\LOAD~\\memarg', r'\\hex{2B}', r'[\\I32] \\to [\\F64]', r'valid-load', r'exec-load'),\n Instruction(r'\\I32.\\LOAD\\K{8\\_s}~\\memarg', r'\\hex{2C}', r'[\\I32] \\to [\\I32]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I32.\\LOAD\\K{8\\_u}~\\memarg', r'\\hex{2D}', r'[\\I32] \\to [\\I32]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I32.\\LOAD\\K{16\\_s}~\\memarg', r'\\hex{2E}', r'[\\I32] \\to [\\I32]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I32.\\LOAD\\K{16\\_u}~\\memarg', r'\\hex{2F}', r'[\\I32] \\to [\\I32]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I64.\\LOAD\\K{8\\_s}~\\memarg', r'\\hex{30}', r'[\\I32] \\to [\\I64]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I64.\\LOAD\\K{8\\_u}~\\memarg', r'\\hex{31}', r'[\\I32] \\to [\\I64]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I64.\\LOAD\\K{16\\_s}~\\memarg', r'\\hex{32}', r'[\\I32] \\to [\\I64]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I64.\\LOAD\\K{16\\_u}~\\memarg', r'\\hex{33}', r'[\\I32] \\to [\\I64]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I64.\\LOAD\\K{32\\_s}~\\memarg', r'\\hex{34}', r'[\\I32] \\to [\\I64]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I64.\\LOAD\\K{32\\_u}~\\memarg', r'\\hex{35}', r'[\\I32] \\to [\\I64]', r'valid-loadn', r'exec-loadn'),\n Instruction(r'\\I32.\\STORE~\\memarg', r'\\hex{36}', r'[\\I32~\\I32] \\to []', r'valid-store', r'exec-store'),\n Instruction(r'\\I64.\\STORE~\\memarg', r'\\hex{37}', r'[\\I32~\\I64] \\to []', r'valid-store', r'exec-store'),\n Instruction(r'\\F32.\\STORE~\\memarg', r'\\hex{38}', r'[\\I32~\\F32] \\to []', r'valid-store', r'exec-store'),\n Instruction(r'\\F64.\\STORE~\\memarg', r'\\hex{39}', r'[\\I32~\\F64] \\to []', r'valid-store', r'exec-store'),\n Instruction(r'\\I32.\\STORE\\K{8}~\\memarg', r'\\hex{3A}', r'[\\I32~\\I32] \\to []', r'valid-storen', r'exec-storen'),\n Instruction(r'\\I32.\\STORE\\K{16}~\\memarg', r'\\hex{3B}', r'[\\I32~\\I32] \\to []', r'valid-storen', r'exec-storen'),\n Instruction(r'\\I64.\\STORE\\K{8}~\\memarg', r'\\hex{3C}', r'[\\I32~\\I64] \\to []', r'valid-storen', r'exec-storen'),\n Instruction(r'\\I64.\\STORE\\K{16}~\\memarg', r'\\hex{3D}', r'[\\I32~\\I64] \\to []', r'valid-storen', r'exec-storen'),\n Instruction(r'\\I64.\\STORE\\K{32}~\\memarg', r'\\hex{3E}', r'[\\I32~\\I64] \\to []', r'valid-storen', r'exec-storen'),\n Instruction(r'\\MEMORYSIZE', r'\\hex{3F}', r'[] \\to [\\I32]', r'valid-memory.size', r'exec-memory.size'),\n Instruction(r'\\MEMORYGROW', r'\\hex{40}', r'[\\I32] \\to [\\I32]', r'valid-memory.grow', r'exec-memory.grow'),\n Instruction(r'\\I32.\\CONST~\\i32', r'\\hex{41}', r'[] \\to [\\I32]', r'valid-const', r'exec-const'),\n Instruction(r'\\I64.\\CONST~\\i64', r'\\hex{42}', r'[] \\to [\\I64]', r'valid-const', r'exec-const'),\n Instruction(r'\\F32.\\CONST~\\f32', r'\\hex{43}', r'[] \\to [\\F32]', r'valid-const', r'exec-const'),\n Instruction(r'\\F64.\\CONST~\\f64', r'\\hex{44}', r'[] \\to [\\F64]', r'valid-const', r'exec-const'),\n Instruction(r'\\I32.\\EQZ', r'\\hex{45}', r'[\\I32] \\to [\\I32]', r'valid-testop', r'exec-testop', r'op-ieqz'),\n Instruction(r'\\I32.\\EQ', r'\\hex{46}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ieq'),\n Instruction(r'\\I32.\\NE', r'\\hex{47}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ine'),\n Instruction(r'\\I32.\\LT\\K{\\_s}', r'\\hex{48}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ilt_s'),\n Instruction(r'\\I32.\\LT\\K{\\_u}', r'\\hex{49}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ilt_u'),\n Instruction(r'\\I32.\\GT\\K{\\_s}', r'\\hex{4A}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-igt_s'),\n Instruction(r'\\I32.\\GT\\K{\\_u}', r'\\hex{4B}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-igt_u'),\n Instruction(r'\\I32.\\LE\\K{\\_s}', r'\\hex{4C}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ile_s'),\n Instruction(r'\\I32.\\LE\\K{\\_u}', r'\\hex{4D}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ile_u'),\n Instruction(r'\\I32.\\GE\\K{\\_s}', r'\\hex{4E}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ige_s'),\n Instruction(r'\\I32.\\GE\\K{\\_u}', r'\\hex{4F}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ige_u'),\n Instruction(r'\\I64.\\EQZ', r'\\hex{50}', r'[\\I64] \\to [\\I32]', r'valid-testop', r'exec-testop', r'op-ieqz'),\n Instruction(r'\\I64.\\EQ', r'\\hex{51}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ieq'),\n Instruction(r'\\I64.\\NE', r'\\hex{52}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ine'),\n Instruction(r'\\I64.\\LT\\K{\\_s}', r'\\hex{53}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ilt_s'),\n Instruction(r'\\I64.\\LT\\K{\\_u}', r'\\hex{54}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ilt_u'),\n Instruction(r'\\I64.\\GT\\K{\\_s}', r'\\hex{55}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-igt_s'),\n Instruction(r'\\I64.\\GT\\K{\\_u}', r'\\hex{56}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-igt_u'),\n Instruction(r'\\I64.\\LE\\K{\\_s}', r'\\hex{57}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ile_s'),\n Instruction(r'\\I64.\\LE\\K{\\_u}', r'\\hex{58}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ile_u'),\n Instruction(r'\\I64.\\GE\\K{\\_s}', r'\\hex{59}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ige_s'),\n Instruction(r'\\I64.\\GE\\K{\\_u}', r'\\hex{5A}', r'[\\I64~\\I64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-ige_u'),\n Instruction(r'\\F32.\\EQ', r'\\hex{5B}', r'[\\F32~\\F32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-feq'),\n Instruction(r'\\F32.\\NE', r'\\hex{5C}', r'[\\F32~\\F32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fne'),\n Instruction(r'\\F32.\\LT', r'\\hex{5D}', r'[\\F32~\\F32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-flt'),\n Instruction(r'\\F32.\\GT', r'\\hex{5E}', r'[\\F32~\\F32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fgt'),\n Instruction(r'\\F32.\\LE', r'\\hex{5F}', r'[\\F32~\\F32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fle'),\n Instruction(r'\\F32.\\GE', r'\\hex{60}', r'[\\F32~\\F32] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fge'),\n Instruction(r'\\F64.\\EQ', r'\\hex{61}', r'[\\F64~\\F64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-feq'),\n Instruction(r'\\F64.\\NE', r'\\hex{62}', r'[\\F64~\\F64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fne'),\n Instruction(r'\\F64.\\LT', r'\\hex{63}', r'[\\F64~\\F64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-flt'),\n Instruction(r'\\F64.\\GT', r'\\hex{64}', r'[\\F64~\\F64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fgt'),\n Instruction(r'\\F64.\\LE', r'\\hex{65}', r'[\\F64~\\F64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fle'),\n Instruction(r'\\F64.\\GE', r'\\hex{66}', r'[\\F64~\\F64] \\to [\\I32]', r'valid-relop', r'exec-relop', r'op-fge'),\n Instruction(r'\\I32.\\CLZ', r'\\hex{67}', r'[\\I32] \\to [\\I32]', r'valid-unop', r'exec-unop', r'op-iclz'),\n Instruction(r'\\I32.\\CTZ', r'\\hex{68}', r'[\\I32] \\to [\\I32]', r'valid-unop', r'exec-unop', r'op-ictz'),\n Instruction(r'\\I32.\\POPCNT', r'\\hex{69}', r'[\\I32] \\to [\\I32]', r'valid-unop', r'exec-unop', r'op-ipopcnt'),\n Instruction(r'\\I32.\\ADD', r'\\hex{6A}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-iadd'),\n Instruction(r'\\I32.\\SUB', r'\\hex{6B}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-isub'),\n Instruction(r'\\I32.\\MUL', r'\\hex{6C}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-imul'),\n Instruction(r'\\I32.\\DIV\\K{\\_s}', r'\\hex{6D}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-idiv_s'),\n Instruction(r'\\I32.\\DIV\\K{\\_u}', r'\\hex{6E}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-idiv_u'),\n Instruction(r'\\I32.\\REM\\K{\\_s}', r'\\hex{6F}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-irem_s'),\n Instruction(r'\\I32.\\REM\\K{\\_u}', r'\\hex{70}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-irem_u'),\n Instruction(r'\\I32.\\AND', r'\\hex{71}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-iand'),\n Instruction(r'\\I32.\\OR', r'\\hex{72}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-ior'),\n Instruction(r'\\I32.\\XOR', r'\\hex{73}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-ixor'),\n Instruction(r'\\I32.\\SHL', r'\\hex{74}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-ishl'),\n Instruction(r'\\I32.\\SHR\\K{\\_s}', r'\\hex{75}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-ishr_s'),\n Instruction(r'\\I32.\\SHR\\K{\\_u}', r'\\hex{76}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-ishr_u'),\n Instruction(r'\\I32.\\ROTL', r'\\hex{77}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-irotl'),\n Instruction(r'\\I32.\\ROTR', r'\\hex{78}', r'[\\I32~\\I32] \\to [\\I32]', r'valid-binop', r'exec-binop', r'op-irotr'),\n Instruction(r'\\I64.\\CLZ', r'\\hex{79}', r'[\\I64] \\to [\\I64]', r'valid-unop', r'exec-unop', r'op-iclz'),\n Instruction(r'\\I64.\\CTZ', r'\\hex{7A}', r'[\\I64] \\to [\\I64]', r'valid-unop', r'exec-unop', r'op-ictz'),\n Instruction(r'\\I64.\\POPCNT', r'\\hex{7B}', r'[\\I64] \\to [\\I64]', r'valid-unop', r'exec-unop', r'op-ipopcnt'),\n Instruction(r'\\I64.\\ADD', r'\\hex{7C}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-iadd'),\n Instruction(r'\\I64.\\SUB', r'\\hex{7D}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-isub'),\n Instruction(r'\\I64.\\MUL', r'\\hex{7E}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-imul'),\n Instruction(r'\\I64.\\DIV\\K{\\_s}', r'\\hex{7F}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-idiv_s'),\n Instruction(r'\\I64.\\DIV\\K{\\_u}', r'\\hex{80}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-idiv_u'),\n Instruction(r'\\I64.\\REM\\K{\\_s}', r'\\hex{81}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-irem_s'),\n Instruction(r'\\I64.\\REM\\K{\\_u}', r'\\hex{82}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-irem_u'),\n Instruction(r'\\I64.\\AND', r'\\hex{83}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-iand'),\n Instruction(r'\\I64.\\OR', r'\\hex{84}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-ior'),\n Instruction(r'\\I64.\\XOR', r'\\hex{85}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-ixor'),\n Instruction(r'\\I64.\\SHL', r'\\hex{86}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-ishl'),\n Instruction(r'\\I64.\\SHR\\K{\\_s}', r'\\hex{87}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-ishr_s'),\n Instruction(r'\\I64.\\SHR\\K{\\_u}', r'\\hex{88}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-ishr_u'),\n Instruction(r'\\I64.\\ROTL', r'\\hex{89}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-irotl'),\n Instruction(r'\\I64.\\ROTR', r'\\hex{8A}', r'[\\I64~\\I64] \\to [\\I64]', r'valid-binop', r'exec-binop', r'op-irotr'),\n Instruction(r'\\F32.\\ABS', r'\\hex{8B}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-fabs'),\n Instruction(r'\\F32.\\NEG', r'\\hex{8C}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-fneg'),\n Instruction(r'\\F32.\\CEIL', r'\\hex{8D}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-fceil'),\n Instruction(r'\\F32.\\FLOOR', r'\\hex{8E}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-ffloor'),\n Instruction(r'\\F32.\\TRUNC', r'\\hex{8F}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-ftrunc'),\n Instruction(r'\\F32.\\NEAREST', r'\\hex{90}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-fnearest'),\n Instruction(r'\\F32.\\SQRT', r'\\hex{91}', r'[\\F32] \\to [\\F32]', r'valid-unop', r'exec-unop', r'op-fsqrt'),\n Instruction(r'\\F32.\\ADD', r'\\hex{92}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fadd'),\n Instruction(r'\\F32.\\SUB', r'\\hex{93}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fsub'),\n Instruction(r'\\F32.\\MUL', r'\\hex{94}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fmul'),\n Instruction(r'\\F32.\\DIV', r'\\hex{95}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fdiv'),\n Instruction(r'\\F32.\\FMIN', r'\\hex{96}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fmin'),\n Instruction(r'\\F32.\\FMAX', r'\\hex{97}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fmax'),\n Instruction(r'\\F32.\\COPYSIGN', r'\\hex{98}', r'[\\F32~\\F32] \\to [\\F32]', r'valid-binop', r'exec-binop', r'op-fcopysign'),\n Instruction(r'\\F64.\\ABS', r'\\hex{99}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-fabs'),\n Instruction(r'\\F64.\\NEG', r'\\hex{9A}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-fneg'),\n Instruction(r'\\F64.\\CEIL', r'\\hex{9B}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-fceil'),\n Instruction(r'\\F64.\\FLOOR', r'\\hex{9C}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-ffloor'),\n Instruction(r'\\F64.\\TRUNC', r'\\hex{9D}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-ftrunc'),\n Instruction(r'\\F64.\\NEAREST', r'\\hex{9E}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-fnearest'),\n Instruction(r'\\F64.\\SQRT', r'\\hex{9F}', r'[\\F64] \\to [\\F64]', r'valid-unop', r'exec-unop', r'op-fsqrt'),\n Instruction(r'\\F64.\\ADD', r'\\hex{A0}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fadd'),\n Instruction(r'\\F64.\\SUB', r'\\hex{A1}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fsub'),\n Instruction(r'\\F64.\\MUL', r'\\hex{A2}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fmul'),\n Instruction(r'\\F64.\\DIV', r'\\hex{A3}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fdiv'),\n Instruction(r'\\F64.\\FMIN', r'\\hex{A4}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fmin'),\n Instruction(r'\\F64.\\FMAX', r'\\hex{A5}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fmax'),\n Instruction(r'\\F64.\\COPYSIGN', r'\\hex{A6}', r'[\\F64~\\F64] \\to [\\F64]', r'valid-binop', r'exec-binop', r'op-fcopysign'),\n Instruction(r'\\I32.\\WRAP\\K{\\_}\\I64', r'\\hex{A7}', r'[\\I64] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-wrap'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_}\\F32\\K{\\_s}', r'\\hex{A8}', r'[\\F32] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_s'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_}\\F32\\K{\\_u}', r'\\hex{A9}', r'[\\F32] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_u'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_}\\F64\\K{\\_s}', r'\\hex{AA}', r'[\\F64] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_s'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_}\\F64\\K{\\_u}', r'\\hex{AB}', r'[\\F64] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_u'),\n Instruction(r'\\I64.\\EXTEND\\K{\\_}\\I32\\K{\\_s}', r'\\hex{AC}', r'[\\I32] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-extend_s'),\n Instruction(r'\\I64.\\EXTEND\\K{\\_}\\I32\\K{\\_u}', r'\\hex{AD}', r'[\\I32] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-extend_u'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_}\\F32\\K{\\_s}', r'\\hex{AE}', r'[\\F32] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_s'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_}\\F32\\K{\\_u}', r'\\hex{AF}', r'[\\F32] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_u'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_}\\F64\\K{\\_s}', r'\\hex{B0}', r'[\\F64] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_s'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_}\\F64\\K{\\_u}', r'\\hex{B1}', r'[\\F64] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_u'),\n Instruction(r'\\F32.\\CONVERT\\K{\\_}\\I32\\K{\\_s}', r'\\hex{B2}', r'[\\I32] \\to [\\F32]', r'valid-cvtop', r'exec-cvtop', r'op-convert_s'),\n Instruction(r'\\F32.\\CONVERT\\K{\\_}\\I32\\K{\\_u}', r'\\hex{B3}', r'[\\I32] \\to [\\F32]', r'valid-cvtop', r'exec-cvtop', r'op-convert_u'),\n Instruction(r'\\F32.\\CONVERT\\K{\\_}\\I64\\K{\\_s}', r'\\hex{B4}', r'[\\I64] \\to [\\F32]', r'valid-cvtop', r'exec-cvtop', r'op-convert_s'),\n Instruction(r'\\F32.\\CONVERT\\K{\\_}\\I64\\K{\\_u}', r'\\hex{B5}', r'[\\I64] \\to [\\F32]', r'valid-cvtop', r'exec-cvtop', r'op-convert_u'),\n Instruction(r'\\F32.\\DEMOTE\\K{\\_}\\F64', r'\\hex{B6}', r'[\\F64] \\to [\\F32]', r'valid-cvtop', r'exec-cvtop', r'op-demote'),\n Instruction(r'\\F64.\\CONVERT\\K{\\_}\\I32\\K{\\_s}', r'\\hex{B7}', r'[\\I32] \\to [\\F64]', r'valid-cvtop', r'exec-cvtop', r'op-convert_s'),\n Instruction(r'\\F64.\\CONVERT\\K{\\_}\\I32\\K{\\_u}', r'\\hex{B8}', r'[\\I32] \\to [\\F64]', r'valid-cvtop', r'exec-cvtop', r'op-convert_u'),\n Instruction(r'\\F64.\\CONVERT\\K{\\_}\\I64\\K{\\_s}', r'\\hex{B9}', r'[\\I64] \\to [\\F64]', r'valid-cvtop', r'exec-cvtop', r'op-convert_s'),\n Instruction(r'\\F64.\\CONVERT\\K{\\_}\\I64\\K{\\_u}', r'\\hex{BA}', r'[\\I64] \\to [\\F64]', r'valid-cvtop', r'exec-cvtop', r'op-convert_u'),\n Instruction(r'\\F64.\\PROMOTE\\K{\\_}\\F32', r'\\hex{BB}', r'[\\F32] \\to [\\F64]', r'valid-cvtop', r'exec-cvtop', r'op-promote'),\n Instruction(r'\\I32.\\REINTERPRET\\K{\\_}\\F32', r'\\hex{BC}', r'[\\F32] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-reinterpret'),\n Instruction(r'\\I64.\\REINTERPRET\\K{\\_}\\F64', r'\\hex{BD}', r'[\\F64] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-reinterpret'),\n Instruction(r'\\F32.\\REINTERPRET\\K{\\_}\\I32', r'\\hex{BE}', r'[\\I32] \\to [\\F32]', r'valid-cvtop', r'exec-cvtop', r'op-reinterpret'),\n Instruction(r'\\F64.\\REINTERPRET\\K{\\_}\\I64', r'\\hex{BF}', r'[\\I64] \\to [\\F64]', r'valid-cvtop', r'exec-cvtop', r'op-reinterpret'),\n Instruction(r'\\I32.\\EXTEND\\K{8\\_s}', r'\\hex{C0}', r'[\\I32] \\to [\\I32]', r'valid-unop', r'exec-unop', r'op-iextendn_s'),\n Instruction(r'\\I32.\\EXTEND\\K{16\\_s}', r'\\hex{C1}', r'[\\I32] \\to [\\I32]', r'valid-unop', r'exec-unop', r'op-iextendn_s'),\n Instruction(r'\\I64.\\EXTEND\\K{8\\_s}', r'\\hex{C2}', r'[\\I64] \\to [\\I64]', r'valid-unop', r'exec-unop', r'op-iextendn_s'),\n Instruction(r'\\I64.\\EXTEND\\K{16\\_s}', r'\\hex{C3}', r'[\\I64] \\to [\\I64]', r'valid-unop', r'exec-unop', r'op-iextendn_s'),\n Instruction(r'\\I64.\\EXTEND\\K{32\\_s}', r'\\hex{C4}', r'[\\I64] \\to [\\I64]', r'valid-unop', r'exec-unop', r'op-iextendn_s'),\n Instruction(None, r'\\hex{C5}'),\n Instruction(None, r'\\hex{C6}'),\n Instruction(None, r'\\hex{C7}'),\n Instruction(None, r'\\hex{C8}'),\n Instruction(None, r'\\hex{C9}'),\n Instruction(None, r'\\hex{CA}'),\n Instruction(None, r'\\hex{CB}'),\n Instruction(None, r'\\hex{CC}'),\n Instruction(None, r'\\hex{CD}'),\n Instruction(None, r'\\hex{CE}'),\n Instruction(None, r'\\hex{CF}'),\n Instruction(r'\\REFNULL~t', r'\\hex{D0}', r'[] \\to [t]', r'valid-ref.null', r'exec-ref.null'),\n Instruction(r'\\REFISNULL', r'\\hex{D1}', r'[t] \\to [\\I32]', r'valid-ref.is_null', r'exec-ref.is_null'),\n Instruction(r'\\REFFUNC~x', r'\\hex{D2}', r'[] \\to [\\FUNCREF]', r'valid-ref.func', r'exec-ref.func'),\n Instruction(None, r'\\hex{D3}'),\n Instruction(None, r'\\hex{D4}'),\n Instruction(None, r'\\hex{D5}'),\n Instruction(None, r'\\hex{D6}'),\n Instruction(None, r'\\hex{D7}'),\n Instruction(None, r'\\hex{D8}'),\n Instruction(None, r'\\hex{D9}'),\n Instruction(None, r'\\hex{DA}'),\n Instruction(None, r'\\hex{DB}'),\n Instruction(None, r'\\hex{DC}'),\n Instruction(None, r'\\hex{DD}'),\n Instruction(None, r'\\hex{DE}'),\n Instruction(None, r'\\hex{DF}'),\n Instruction(None, r'\\hex{E0}'),\n Instruction(None, r'\\hex{E1}'),\n Instruction(None, r'\\hex{E2}'),\n Instruction(None, r'\\hex{E3}'),\n Instruction(None, r'\\hex{E4}'),\n Instruction(None, r'\\hex{E5}'),\n Instruction(None, r'\\hex{E6}'),\n Instruction(None, r'\\hex{E7}'),\n Instruction(None, r'\\hex{E8}'),\n Instruction(None, r'\\hex{E9}'),\n Instruction(None, r'\\hex{EA}'),\n Instruction(None, r'\\hex{EB}'),\n Instruction(None, r'\\hex{EC}'),\n Instruction(None, r'\\hex{ED}'),\n Instruction(None, r'\\hex{EE}'),\n Instruction(None, r'\\hex{EF}'),\n Instruction(None, r'\\hex{F0}'),\n Instruction(None, r'\\hex{F1}'),\n Instruction(None, r'\\hex{F2}'),\n Instruction(None, r'\\hex{F3}'),\n Instruction(None, r'\\hex{F4}'),\n Instruction(None, r'\\hex{F5}'),\n Instruction(None, r'\\hex{F6}'),\n Instruction(None, r'\\hex{F7}'),\n Instruction(None, r'\\hex{F8}'),\n Instruction(None, r'\\hex{F9}'),\n Instruction(None, r'\\hex{FA}'),\n Instruction(None, r'\\hex{FB}'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_s}', r'\\hex{FC}~\\hex{00}', r'[\\F32] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_s'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_u}', r'\\hex{FC}~\\hex{01}', r'[\\F32] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_u'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_s}', r'\\hex{FC}~\\hex{02}', r'[\\F64] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_s'),\n Instruction(r'\\I32.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_u}', r'\\hex{FC}~\\hex{03}', r'[\\F64] \\to [\\I32]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_u'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_s}', r'\\hex{FC}~\\hex{04}', r'[\\F32] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_s'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_u}', r'\\hex{FC}~\\hex{05}', r'[\\F32] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_u'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_s}', r'\\hex{FC}~\\hex{06}', r'[\\F64] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_s'),\n Instruction(r'\\I64.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_u}', r'\\hex{FC}~\\hex{07}', r'[\\F64] \\to [\\I64]', r'valid-cvtop', r'exec-cvtop', r'op-trunc_sat_u'),\n Instruction(r'\\MEMORYINIT', r'\\hex{FC}~\\hex{08}', r'[\\I32~\\I32~\\I32] \\to []', r'valid-memory.init', r'exec-memory.init'),\n Instruction(r'\\DATADROP', r'\\hex{FC}~\\hex{09}', r'[] \\to []', r'valid-data.drop', r'exec-data.drop'),\n Instruction(r'\\MEMORYCOPY', r'\\hex{FC}~\\hex{0A}', r'[\\I32~\\I32~\\I32] \\to []', r'valid-memory.copy', r'exec-memory.copy'),\n Instruction(r'\\MEMORYFILL', r'\\hex{FC}~\\hex{0B}', r'[\\I32~\\I32~\\I32] \\to []', r'valid-memory.fill', r'exec-memory.fill'),\n Instruction(r'\\TABLEINIT', r'\\hex{FC}~\\hex{0C}', r'[\\I32~\\I32~\\I32] \\to []', r'valid-table.init', r'exec-table.init'),\n Instruction(r'\\ELEMDROP', r'\\hex{FC}~\\hex{0D}', r'[] \\to []', r'valid-elem.drop', r'exec-elem.drop'),\n Instruction(r'\\TABLECOPY', r'\\hex{FC}~\\hex{0E}', r'[\\I32~\\I32~\\I32] \\to []', r'valid-table.copy', r'exec-table.copy'),\n Instruction(r'\\TABLEGROW', r'\\hex{FC}~\\hex{0F}', r'[t~\\I32] \\to []', r'valid-table.grow', r'exec-table.grow'),\n Instruction(r'\\TABLESIZE', r'\\hex{FC}~\\hex{10}', r'[] \\to []', r'valid-table.size', r'exec-table.size'),\n Instruction(r'\\TABLEFILL', r'\\hex{FC}~\\hex{11}', r'[\\I32~t~\\I32] \\to []', r'valid-table.fill', r'exec-table.fill'),\n]\n\ndef ColumnWidth(n):\n return max([len(instr[n]) for instr in INSTRUCTIONS])\n\nCOLUMN_WIDTHS = [ColumnWidth(i) for i in range(len(COLUMNS))]\nDIVIDER = ' '.join('=' * width for width in COLUMN_WIDTHS)\n\ndef Row(columns):\n return ' '.join(('{:%d}' % COLUMN_WIDTHS[i]).format(column)\n for i, column in enumerate(columns))\n\nif __name__ == '__main__':\n with open(INDEX_INSTRUCTIONS_RST, 'w') as f:\n print(HEADER, file=f)\n print(DIVIDER, file=f)\n print(Row(COLUMNS), file=f)\n print(DIVIDER, file=f)\n\n for instr in INSTRUCTIONS:\n print(Row(instr), file=f)\n\n print(DIVIDER, file=f)\n" }, { "path": "document/core/appendix/implementation.rst", "content": ".. index:: ! implementation limitations, implementation\n.. _impl:\n\nImplementation Limitations\n--------------------------\n\nImplementations typically impose additional restrictions on a number of aspects of a WebAssembly module or execution.\nThese may stem from:\n\n* physical resource limits,\n* constraints imposed by the embedder or its environment,\n* limitations of selected implementation strategies.\n\nThis section lists allowed limitations.\nWhere restrictions take the form of numeric limits, no minimum requirements are given,\nnor are the limits assumed to be concrete, fixed numbers.\nHowever, it is expected that all implementations have \"reasonably\" large limits to enable common applications.\n\n.. note::\n A conforming implementation is not allowed to leave out individual *features*.\n However, designated subsets of WebAssembly may be specified in the future.\n\n\nSyntactic Limits\n~~~~~~~~~~~~~~~~\n\n.. index:: abstract syntax, module, type, function, table, memory, global, element, data, import, export, parameter, result, local, structured control instruction, instruction, name, Unicode, character\n.. _impl-syntax:\n\nStructure\n.........\n\nAn implementation may impose restrictions on the following dimensions of a module:\n\n* the number of :ref:`types ` in a :ref:`module `\n* the number of :ref:`functions ` in a :ref:`module `, including imports\n* the number of :ref:`tables ` in a :ref:`module `, including imports\n* the number of :ref:`memories ` in a :ref:`module `, including imports\n* the number of :ref:`globals ` in a :ref:`module `, including imports\n* the number of :ref:`element segments ` in a :ref:`module `\n* the number of :ref:`data segments ` in a :ref:`module `\n* the number of :ref:`imports ` to a :ref:`module `\n* the number of :ref:`exports ` from a :ref:`module `\n* the number of parameters in a :ref:`function type `\n* the number of results in a :ref:`function type `\n* the number of parameters in a :ref:`block type `\n* the number of results in a :ref:`block type `\n* the number of :ref:`locals ` in a :ref:`function `\n* the size of a :ref:`function ` body\n* the size of a :ref:`structured control instruction `\n* the number of :ref:`structured control instructions ` in a :ref:`function `\n* the nesting depth of :ref:`structured control instructions `\n* the number of :ref:`label indices ` in a |brtable| instruction\n* the length of an :ref:`element segment `\n* the length of a :ref:`data segment `\n* the length of a :ref:`name `\n* the range of :ref:`characters ` in a :ref:`name `\n\nIf the limits of an implementation are exceeded for a given module,\nthen the implementation may reject the :ref:`validation `, compilation, or :ref:`instantiation ` of that module with an embedder-specific error.\n\n.. note::\n The last item allows :ref:`embedders ` that operate in limited environments without support for\n |Unicode|_ to limit the\n names of :ref:`imports ` and :ref:`exports `\n to common subsets like |ASCII|_.\n\n\n.. index:: binary format, module, section, function, code\n.. _impl-binary:\n\nBinary Format\n.............\n\nFor a module given in :ref:`binary format `, additional limitations may be imposed on the following dimensions:\n\n* the size of a :ref:`module `\n* the size of any :ref:`section `\n* the size of an individual function's :ref:`code `\n* the number of :ref:`sections `\n\n\n.. index:: text format, source text, token, identifier, character, unicode\n.. _impl-text:\n\nText Format\n...........\n\nFor a module given in :ref:`text format `, additional limitations may be imposed on the following dimensions:\n\n* the size of the :ref:`source text `\n* the size of any syntactic element\n* the size of an individual :ref:`token `\n* the nesting depth of :ref:`folded instructions `\n* the length of symbolic :ref:`identifiers `\n* the range of literal :ref:`characters ` allowed in the :ref:`source text `\n\n\n.. index:: validation, function\n.. _impl-valid:\n\nValidation\n~~~~~~~~~~\n\nAn implementation may defer :ref:`validation ` of individual :ref:`functions ` until they are first :ref:`invoked `.\n\nIf a function turns out to be invalid, then the invocation, and every consecutive call to the same function, results in a :ref:`trap `.\n\n.. note::\n This is to allow implementations to use interpretation or just-in-time compilation for functions.\n The function must still be fully validated before execution of its body begins.\n\n\n.. index:: execution, module instance, function instance, table instance, memory instance, global instance, allocation, frame, label, value\n.. _impl-exec:\n\nExecution\n~~~~~~~~~\n\nRestrictions on the following dimensions may be imposed during :ref:`execution ` of a WebAssembly program:\n\n* the number of allocated :ref:`module instances `\n* the number of allocated :ref:`function instances `\n* the number of allocated :ref:`table instances `\n* the number of allocated :ref:`memory instances `\n* the number of allocated :ref:`global instances `\n* the size of a :ref:`table instance `\n* the size of a :ref:`memory instance `\n* the number of :ref:`frames ` on the :ref:`stack `\n* the number of :ref:`labels ` on the :ref:`stack `\n* the number of :ref:`values ` on the :ref:`stack `\n\nIf the runtime limits of an implementation are exceeded during execution of a computation,\nthen it may terminate that computation and report an embedder-specific error to the invoking code.\n\nSome of the above limits may already be verified during instantiation, in which case an implementation may report exceedance in the same manner as for :ref:`syntactic limits `.\n\n.. note::\n Concrete limits are usually not fixed but may be dependent on specifics, interdependent, vary over time, or depend on other implementation- or embedder-specific situations or events.\n" }, { "path": "document/core/appendix/index-instructions.rst", "content": ".. DO NOT EDIT: This file is auto-generated by the gen-index-instructions.py script.\n\n.. index:: instruction\n.. _index-instr:\n\nIndex of Instructions\n---------------------\n\n========================================= ========================= ============================================= ======================================= ===============================================================\nInstruction Binary Opcode Type Validation Execution \n========================================= ========================= ============================================= ======================================= ===============================================================\n:math:`\\UNREACHABLE` :math:`\\hex{00}` :math:`[t_1^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\NOP` :math:`\\hex{01}` :math:`[] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\BLOCK~\\X{bt}` :math:`\\hex{02}` :math:`[t_1^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\LOOP~\\X{bt}` :math:`\\hex{03}` :math:`[t_1^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\IF~\\X{bt}` :math:`\\hex{04}` :math:`[t_1^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\ELSE` :math:`\\hex{05}` \n(reserved) :math:`\\hex{06}` \n(reserved) :math:`\\hex{07}` \n(reserved) :math:`\\hex{08}` \n(reserved) :math:`\\hex{09}` \n(reserved) :math:`\\hex{0A}` \n:math:`\\END` :math:`\\hex{0B}` \n:math:`\\BR~l` :math:`\\hex{0C}` :math:`[t_1^\\ast~t^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\BRIF~l` :math:`\\hex{0D}` :math:`[t^\\ast~\\I32] \\to [t^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\BRTABLE~l^\\ast~l` :math:`\\hex{0E}` :math:`[t_1^\\ast~t^\\ast~\\I32] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\RETURN` :math:`\\hex{0F}` :math:`[t_1^\\ast~t^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\CALL~x` :math:`\\hex{10}` :math:`[t_1^\\ast] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n:math:`\\CALLINDIRECT~x~y` :math:`\\hex{11}` :math:`[t_1^\\ast~\\I32] \\to [t_2^\\ast]` :ref:`validation ` :ref:`execution ` \n(reserved) :math:`\\hex{12}` \n(reserved) :math:`\\hex{13}` \n(reserved) :math:`\\hex{14}` \n(reserved) :math:`\\hex{15}` \n(reserved) :math:`\\hex{16}` \n(reserved) :math:`\\hex{17}` \n(reserved) :math:`\\hex{18}` \n(reserved) :math:`\\hex{19}` \n:math:`\\DROP` :math:`\\hex{1A}` :math:`[t] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\SELECT` :math:`\\hex{1B}` :math:`[t~t~\\I32] \\to [t]` :ref:`validation ` :ref:`execution ` \n:math:`\\SELECT~t` :math:`\\hex{1C}` :math:`[t~t~\\I32] \\to [t]` :ref:`validation ` :ref:`execution ` \n(reserved) :math:`\\hex{1D}` \n(reserved) :math:`\\hex{1E}` \n(reserved) :math:`\\hex{1F}` \n:math:`\\LOCALGET~x` :math:`\\hex{20}` :math:`[] \\to [t]` :ref:`validation ` :ref:`execution ` \n:math:`\\LOCALSET~x` :math:`\\hex{21}` :math:`[t] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\LOCALTEE~x` :math:`\\hex{22}` :math:`[t] \\to [t]` :ref:`validation ` :ref:`execution ` \n:math:`\\GLOBALGET~x` :math:`\\hex{23}` :math:`[] \\to [t]` :ref:`validation ` :ref:`execution ` \n:math:`\\GLOBALSET~x` :math:`\\hex{24}` :math:`[t] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLEGET~x` :math:`\\hex{25}` :math:`[\\I32] \\to [t]` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLESET~x` :math:`\\hex{26}` :math:`[\\I32~t] \\to []` :ref:`validation ` :ref:`execution ` \n(reserved) :math:`\\hex{27}` \n:math:`\\I32.\\LOAD~\\memarg` :math:`\\hex{28}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD~\\memarg` :math:`\\hex{29}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\F32.\\LOAD~\\memarg` :math:`\\hex{2A}` :math:`[\\I32] \\to [\\F32]` :ref:`validation ` :ref:`execution ` \n:math:`\\F64.\\LOAD~\\memarg` :math:`\\hex{2B}` :math:`[\\I32] \\to [\\F64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\LOAD\\K{8\\_s}~\\memarg` :math:`\\hex{2C}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\LOAD\\K{8\\_u}~\\memarg` :math:`\\hex{2D}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\LOAD\\K{16\\_s}~\\memarg` :math:`\\hex{2E}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\LOAD\\K{16\\_u}~\\memarg` :math:`\\hex{2F}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD\\K{8\\_s}~\\memarg` :math:`\\hex{30}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD\\K{8\\_u}~\\memarg` :math:`\\hex{31}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD\\K{16\\_s}~\\memarg` :math:`\\hex{32}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD\\K{16\\_u}~\\memarg` :math:`\\hex{33}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD\\K{32\\_s}~\\memarg` :math:`\\hex{34}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\LOAD\\K{32\\_u}~\\memarg` :math:`\\hex{35}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\STORE~\\memarg` :math:`\\hex{36}` :math:`[\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\STORE~\\memarg` :math:`\\hex{37}` :math:`[\\I32~\\I64] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\F32.\\STORE~\\memarg` :math:`\\hex{38}` :math:`[\\I32~\\F32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\F64.\\STORE~\\memarg` :math:`\\hex{39}` :math:`[\\I32~\\F64] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\STORE\\K{8}~\\memarg` :math:`\\hex{3A}` :math:`[\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\STORE\\K{16}~\\memarg` :math:`\\hex{3B}` :math:`[\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\STORE\\K{8}~\\memarg` :math:`\\hex{3C}` :math:`[\\I32~\\I64] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\STORE\\K{16}~\\memarg` :math:`\\hex{3D}` :math:`[\\I32~\\I64] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\STORE\\K{32}~\\memarg` :math:`\\hex{3E}` :math:`[\\I32~\\I64] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\MEMORYSIZE` :math:`\\hex{3F}` :math:`[] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\MEMORYGROW` :math:`\\hex{40}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\CONST~\\i32` :math:`\\hex{41}` :math:`[] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\I64.\\CONST~\\i64` :math:`\\hex{42}` :math:`[] \\to [\\I64]` :ref:`validation ` :ref:`execution ` \n:math:`\\F32.\\CONST~\\f32` :math:`\\hex{43}` :math:`[] \\to [\\F32]` :ref:`validation ` :ref:`execution ` \n:math:`\\F64.\\CONST~\\f64` :math:`\\hex{44}` :math:`[] \\to [\\F64]` :ref:`validation ` :ref:`execution ` \n:math:`\\I32.\\EQZ` :math:`\\hex{45}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\EQ` :math:`\\hex{46}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\NE` :math:`\\hex{47}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\LT\\K{\\_s}` :math:`\\hex{48}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\LT\\K{\\_u}` :math:`\\hex{49}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\GT\\K{\\_s}` :math:`\\hex{4A}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\GT\\K{\\_u}` :math:`\\hex{4B}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\LE\\K{\\_s}` :math:`\\hex{4C}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\LE\\K{\\_u}` :math:`\\hex{4D}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\GE\\K{\\_s}` :math:`\\hex{4E}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\GE\\K{\\_u}` :math:`\\hex{4F}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EQZ` :math:`\\hex{50}` :math:`[\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EQ` :math:`\\hex{51}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\NE` :math:`\\hex{52}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\LT\\K{\\_s}` :math:`\\hex{53}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\LT\\K{\\_u}` :math:`\\hex{54}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\GT\\K{\\_s}` :math:`\\hex{55}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\GT\\K{\\_u}` :math:`\\hex{56}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\LE\\K{\\_s}` :math:`\\hex{57}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\LE\\K{\\_u}` :math:`\\hex{58}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\GE\\K{\\_s}` :math:`\\hex{59}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\GE\\K{\\_u}` :math:`\\hex{5A}` :math:`[\\I64~\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\EQ` :math:`\\hex{5B}` :math:`[\\F32~\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\NE` :math:`\\hex{5C}` :math:`[\\F32~\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\LT` :math:`\\hex{5D}` :math:`[\\F32~\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\GT` :math:`\\hex{5E}` :math:`[\\F32~\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\LE` :math:`\\hex{5F}` :math:`[\\F32~\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\GE` :math:`\\hex{60}` :math:`[\\F32~\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\EQ` :math:`\\hex{61}` :math:`[\\F64~\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\NE` :math:`\\hex{62}` :math:`[\\F64~\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\LT` :math:`\\hex{63}` :math:`[\\F64~\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\GT` :math:`\\hex{64}` :math:`[\\F64~\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\LE` :math:`\\hex{65}` :math:`[\\F64~\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\GE` :math:`\\hex{66}` :math:`[\\F64~\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\CLZ` :math:`\\hex{67}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\CTZ` :math:`\\hex{68}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\POPCNT` :math:`\\hex{69}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\ADD` :math:`\\hex{6A}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\SUB` :math:`\\hex{6B}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\MUL` :math:`\\hex{6C}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\DIV\\K{\\_s}` :math:`\\hex{6D}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\DIV\\K{\\_u}` :math:`\\hex{6E}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\REM\\K{\\_s}` :math:`\\hex{6F}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\REM\\K{\\_u}` :math:`\\hex{70}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\AND` :math:`\\hex{71}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\OR` :math:`\\hex{72}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\XOR` :math:`\\hex{73}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\SHL` :math:`\\hex{74}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\SHR\\K{\\_s}` :math:`\\hex{75}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\SHR\\K{\\_u}` :math:`\\hex{76}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\ROTL` :math:`\\hex{77}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\ROTR` :math:`\\hex{78}` :math:`[\\I32~\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\CLZ` :math:`\\hex{79}` :math:`[\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\CTZ` :math:`\\hex{7A}` :math:`[\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\POPCNT` :math:`\\hex{7B}` :math:`[\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\ADD` :math:`\\hex{7C}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\SUB` :math:`\\hex{7D}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\MUL` :math:`\\hex{7E}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\DIV\\K{\\_s}` :math:`\\hex{7F}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\DIV\\K{\\_u}` :math:`\\hex{80}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\REM\\K{\\_s}` :math:`\\hex{81}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\REM\\K{\\_u}` :math:`\\hex{82}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\AND` :math:`\\hex{83}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\OR` :math:`\\hex{84}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\XOR` :math:`\\hex{85}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\SHL` :math:`\\hex{86}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\SHR\\K{\\_s}` :math:`\\hex{87}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\SHR\\K{\\_u}` :math:`\\hex{88}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\ROTL` :math:`\\hex{89}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\ROTR` :math:`\\hex{8A}` :math:`[\\I64~\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\ABS` :math:`\\hex{8B}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\NEG` :math:`\\hex{8C}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\CEIL` :math:`\\hex{8D}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\FLOOR` :math:`\\hex{8E}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\TRUNC` :math:`\\hex{8F}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\NEAREST` :math:`\\hex{90}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\SQRT` :math:`\\hex{91}` :math:`[\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\ADD` :math:`\\hex{92}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\SUB` :math:`\\hex{93}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\MUL` :math:`\\hex{94}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\DIV` :math:`\\hex{95}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\FMIN` :math:`\\hex{96}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\FMAX` :math:`\\hex{97}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\COPYSIGN` :math:`\\hex{98}` :math:`[\\F32~\\F32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\ABS` :math:`\\hex{99}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\NEG` :math:`\\hex{9A}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\CEIL` :math:`\\hex{9B}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\FLOOR` :math:`\\hex{9C}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\TRUNC` :math:`\\hex{9D}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\NEAREST` :math:`\\hex{9E}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\SQRT` :math:`\\hex{9F}` :math:`[\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\ADD` :math:`\\hex{A0}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\SUB` :math:`\\hex{A1}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\MUL` :math:`\\hex{A2}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\DIV` :math:`\\hex{A3}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\FMIN` :math:`\\hex{A4}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\FMAX` :math:`\\hex{A5}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\COPYSIGN` :math:`\\hex{A6}` :math:`[\\F64~\\F64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\WRAP\\K{\\_}\\I64` :math:`\\hex{A7}` :math:`[\\I64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\TRUNC\\K{\\_}\\F32\\K{\\_s}` :math:`\\hex{A8}` :math:`[\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\TRUNC\\K{\\_}\\F32\\K{\\_u}` :math:`\\hex{A9}` :math:`[\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\TRUNC\\K{\\_}\\F64\\K{\\_s}` :math:`\\hex{AA}` :math:`[\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\TRUNC\\K{\\_}\\F64\\K{\\_u}` :math:`\\hex{AB}` :math:`[\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EXTEND\\K{\\_}\\I32\\K{\\_s}` :math:`\\hex{AC}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EXTEND\\K{\\_}\\I32\\K{\\_u}` :math:`\\hex{AD}` :math:`[\\I32] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\TRUNC\\K{\\_}\\F32\\K{\\_s}` :math:`\\hex{AE}` :math:`[\\F32] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\TRUNC\\K{\\_}\\F32\\K{\\_u}` :math:`\\hex{AF}` :math:`[\\F32] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\TRUNC\\K{\\_}\\F64\\K{\\_s}` :math:`\\hex{B0}` :math:`[\\F64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\TRUNC\\K{\\_}\\F64\\K{\\_u}` :math:`\\hex{B1}` :math:`[\\F64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\CONVERT\\K{\\_}\\I32\\K{\\_s}` :math:`\\hex{B2}` :math:`[\\I32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\CONVERT\\K{\\_}\\I32\\K{\\_u}` :math:`\\hex{B3}` :math:`[\\I32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\CONVERT\\K{\\_}\\I64\\K{\\_s}` :math:`\\hex{B4}` :math:`[\\I64] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\CONVERT\\K{\\_}\\I64\\K{\\_u}` :math:`\\hex{B5}` :math:`[\\I64] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F32.\\DEMOTE\\K{\\_}\\F64` :math:`\\hex{B6}` :math:`[\\F64] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\CONVERT\\K{\\_}\\I32\\K{\\_s}` :math:`\\hex{B7}` :math:`[\\I32] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\CONVERT\\K{\\_}\\I32\\K{\\_u}` :math:`\\hex{B8}` :math:`[\\I32] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\CONVERT\\K{\\_}\\I64\\K{\\_s}` :math:`\\hex{B9}` :math:`[\\I64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\CONVERT\\K{\\_}\\I64\\K{\\_u}` :math:`\\hex{BA}` :math:`[\\I64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\F64.\\PROMOTE\\K{\\_}\\F32` :math:`\\hex{BB}` :math:`[\\F32] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\REINTERPRET\\K{\\_}\\F32` :math:`\\hex{BC}` :math:`[\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I64.\\REINTERPRET\\K{\\_}\\F64` :math:`\\hex{BD}` :math:`[\\F64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\F32.\\REINTERPRET\\K{\\_}\\I32` :math:`\\hex{BE}` :math:`[\\I32] \\to [\\F32]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\F64.\\REINTERPRET\\K{\\_}\\I64` :math:`\\hex{BF}` :math:`[\\I64] \\to [\\F64]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I32.\\EXTEND\\K{8\\_s}` :math:`\\hex{C0}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I32.\\EXTEND\\K{16\\_s}` :math:`\\hex{C1}` :math:`[\\I32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EXTEND\\K{8\\_s}` :math:`\\hex{C2}` :math:`[\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EXTEND\\K{16\\_s}` :math:`\\hex{C3}` :math:`[\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n:math:`\\I64.\\EXTEND\\K{32\\_s}` :math:`\\hex{C4}` :math:`[\\I64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator ` \n(reserved) :math:`\\hex{C5}` \n(reserved) :math:`\\hex{C6}` \n(reserved) :math:`\\hex{C7}` \n(reserved) :math:`\\hex{C8}` \n(reserved) :math:`\\hex{C9}` \n(reserved) :math:`\\hex{CA}` \n(reserved) :math:`\\hex{CB}` \n(reserved) :math:`\\hex{CC}` \n(reserved) :math:`\\hex{CD}` \n(reserved) :math:`\\hex{CE}` \n(reserved) :math:`\\hex{CF}` \n:math:`\\REFNULL~t` :math:`\\hex{D0}` :math:`[] \\to [t]` :ref:`validation ` :ref:`execution ` \n:math:`\\REFISNULL` :math:`\\hex{D1}` :math:`[t] \\to [\\I32]` :ref:`validation ` :ref:`execution ` \n:math:`\\REFFUNC~x` :math:`\\hex{D2}` :math:`[] \\to [\\FUNCREF]` :ref:`validation ` :ref:`execution ` \n(reserved) :math:`\\hex{D3}` \n(reserved) :math:`\\hex{D4}` \n(reserved) :math:`\\hex{D5}` \n(reserved) :math:`\\hex{D6}` \n(reserved) :math:`\\hex{D7}` \n(reserved) :math:`\\hex{D8}` \n(reserved) :math:`\\hex{D9}` \n(reserved) :math:`\\hex{DA}` \n(reserved) :math:`\\hex{DB}` \n(reserved) :math:`\\hex{DC}` \n(reserved) :math:`\\hex{DD}` \n(reserved) :math:`\\hex{DE}` \n(reserved) :math:`\\hex{DF}` \n(reserved) :math:`\\hex{E0}` \n(reserved) :math:`\\hex{E1}` \n(reserved) :math:`\\hex{E2}` \n(reserved) :math:`\\hex{E3}` \n(reserved) :math:`\\hex{E4}` \n(reserved) :math:`\\hex{E5}` \n(reserved) :math:`\\hex{E6}` \n(reserved) :math:`\\hex{E7}` \n(reserved) :math:`\\hex{E8}` \n(reserved) :math:`\\hex{E9}` \n(reserved) :math:`\\hex{EA}` \n(reserved) :math:`\\hex{EB}` \n(reserved) :math:`\\hex{EC}` \n(reserved) :math:`\\hex{ED}` \n(reserved) :math:`\\hex{EE}` \n(reserved) :math:`\\hex{EF}` \n(reserved) :math:`\\hex{F0}` \n(reserved) :math:`\\hex{F1}` \n(reserved) :math:`\\hex{F2}` \n(reserved) :math:`\\hex{F3}` \n(reserved) :math:`\\hex{F4}` \n(reserved) :math:`\\hex{F5}` \n(reserved) :math:`\\hex{F6}` \n(reserved) :math:`\\hex{F7}` \n(reserved) :math:`\\hex{F8}` \n(reserved) :math:`\\hex{F9}` \n(reserved) :math:`\\hex{FA}` \n(reserved) :math:`\\hex{FB}` \n:math:`\\I32.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_s}` :math:`\\hex{FC}~\\hex{00}` :math:`[\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I32.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_u}` :math:`\\hex{FC}~\\hex{01}` :math:`[\\F32] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I32.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_s}` :math:`\\hex{FC}~\\hex{02}` :math:`[\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I32.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_u}` :math:`\\hex{FC}~\\hex{03}` :math:`[\\F64] \\to [\\I32]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I64.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_s}` :math:`\\hex{FC}~\\hex{04}` :math:`[\\F32] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I64.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_u}` :math:`\\hex{FC}~\\hex{05}` :math:`[\\F32] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I64.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_s}` :math:`\\hex{FC}~\\hex{06}` :math:`[\\F64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\I64.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_u}` :math:`\\hex{FC}~\\hex{07}` :math:`[\\F64] \\to [\\I64]` :ref:`validation ` :ref:`execution `, :ref:`operator `\n:math:`\\MEMORYINIT` :math:`\\hex{FC}~\\hex{08}` :math:`[\\I32~\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\DATADROP` :math:`\\hex{FC}~\\hex{09}` :math:`[] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\MEMORYCOPY` :math:`\\hex{FC}~\\hex{0A}` :math:`[\\I32~\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\MEMORYFILL` :math:`\\hex{FC}~\\hex{0B}` :math:`[\\I32~\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLEINIT` :math:`\\hex{FC}~\\hex{0C}` :math:`[\\I32~\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\ELEMDROP` :math:`\\hex{FC}~\\hex{0D}` :math:`[] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLECOPY` :math:`\\hex{FC}~\\hex{0E}` :math:`[\\I32~\\I32~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLEGROW` :math:`\\hex{FC}~\\hex{0F}` :math:`[t~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLESIZE` :math:`\\hex{FC}~\\hex{10}` :math:`[] \\to []` :ref:`validation ` :ref:`execution ` \n:math:`\\TABLEFILL` :math:`\\hex{FC}~\\hex{11}` :math:`[\\I32~t~\\I32] \\to []` :ref:`validation ` :ref:`execution ` \n========================================= ========================= ============================================= ======================================= ===============================================================\n" }, { "path": "document/core/appendix/index-rules.rst", "content": ".. _index-rules:\n\nIndex of Semantic Rules\n-----------------------\n\n\n.. index:: validation\n.. _index-valid:\n\nTyping of Static Constructs\n~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\n=============================================== ===============================================================================\nConstruct Judgement\n=============================================== ===============================================================================\n:ref:`Limits ` :math:`\\vdashlimits \\limits : k`\n:ref:`Function type ` :math:`\\vdashfunctype \\functype \\ok`\n:ref:`Block type ` :math:`\\vdashblocktype \\blocktype \\ok`\n:ref:`Table type ` :math:`\\vdashtabletype \\tabletype \\ok`\n:ref:`Memory type ` :math:`\\vdashmemtype \\memtype \\ok`\n:ref:`Global type ` :math:`\\vdashglobaltype \\globaltype \\ok`\n:ref:`External type ` :math:`\\vdashexterntype \\externtype \\ok`\n:ref:`Instruction ` :math:`S;C \\vdashinstr \\instr : \\stacktype`\n:ref:`Instruction sequence ` :math:`S;C \\vdashinstrseq \\instr^\\ast : \\stacktype`\n:ref:`Expression ` :math:`C \\vdashexpr \\expr : \\resulttype`\n:ref:`Function ` :math:`C \\vdashfunc \\func : \\functype`\n:ref:`Table ` :math:`C \\vdashtable \\table : \\tabletype`\n:ref:`Memory ` :math:`C \\vdashmem \\mem : \\memtype`\n:ref:`Global ` :math:`C \\vdashglobal \\global : \\globaltype`\n:ref:`Element segment ` :math:`C \\vdashelem \\elem : \\reftype`\n:ref:`Element mode ` :math:`C \\vdashelemmode \\elemmode : \\reftype`\n:ref:`Data segment ` :math:`C \\vdashdata \\data \\ok`\n:ref:`Data mode ` :math:`C \\vdashdatamode \\datamode \\ok`\n:ref:`Start function ` :math:`C \\vdashstart \\start \\ok`\n:ref:`Export ` :math:`C \\vdashexport \\export : \\externtype`\n:ref:`Export description ` :math:`C \\vdashexportdesc \\exportdesc : \\externtype`\n:ref:`Import ` :math:`C \\vdashimport \\import : \\externtype`\n:ref:`Import description ` :math:`C \\vdashimportdesc \\importdesc : \\externtype`\n:ref:`Module ` :math:`\\vdashmodule \\module : \\externtype^\\ast \\to \\externtype^\\ast`\n=============================================== ===============================================================================\n\n\n.. index:: runtime\n\nTyping of Runtime Constructs\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\n=============================================== ===============================================================================\nConstruct Judgement\n=============================================== ===============================================================================\n:ref:`Value ` :math:`S \\vdashval \\val : \\valtype`\n:ref:`Result ` :math:`S \\vdashresult \\result : \\resulttype`\n:ref:`External value ` :math:`S \\vdashexternval \\externval : \\externtype`\n:ref:`Function instance ` :math:`S \\vdashfuncinst \\funcinst : \\functype`\n:ref:`Table instance ` :math:`S \\vdashtableinst \\tableinst : \\tabletype`\n:ref:`Memory instance ` :math:`S \\vdashmeminst \\meminst : \\memtype`\n:ref:`Global instance ` :math:`S \\vdashglobalinst \\globalinst : \\globaltype`\n:ref:`Element instance ` :math:`S \\vdasheleminst \\eleminst \\ok`\n:ref:`Data instance ` :math:`S \\vdashdatainst \\datainst \\ok`\n:ref:`Export instance ` :math:`S \\vdashexportinst \\exportinst \\ok`\n:ref:`Module instance ` :math:`S \\vdashmoduleinst \\moduleinst : C`\n:ref:`Store ` :math:`\\vdashstore \\store \\ok`\n:ref:`Configuration ` :math:`\\vdashconfig \\config \\ok`\n:ref:`Thread ` :math:`S;\\resulttype^? \\vdashthread \\thread : \\resulttype`\n:ref:`Frame ` :math:`S \\vdashframe \\frame : C`\n=============================================== ===============================================================================\n\n\nConstantness\n~~~~~~~~~~~~\n\n=============================================== ===============================================================================\nConstruct Judgement\n=============================================== ===============================================================================\n:ref:`Constant expression ` :math:`C \\vdashexprconst \\expr \\const`\n:ref:`Constant instruction ` :math:`C \\vdashinstrconst \\instr \\const`\n=============================================== ===============================================================================\n\n\nMatching\n~~~~~~~~\n\n=============================================== ===============================================================================\nConstruct Judgement\n=============================================== ===============================================================================\n:ref:`External type ` :math:`\\vdashexterntypematch \\externtype_1 \\matchesexterntype \\externtype_2`\n:ref:`Limits ` :math:`\\vdashlimitsmatch \\limits_1 \\matcheslimits \\limits_2`\n=============================================== ===============================================================================\n\n\nStore Extension\n~~~~~~~~~~~~~~~\n\n=============================================== ===============================================================================\nConstruct Judgement\n=============================================== ===============================================================================\n:ref:`Function instance ` :math:`\\vdashfuncinstextends \\funcinst_1 \\extendsto \\funcinst_2`\n:ref:`Table instance ` :math:`\\vdashtableinstextends \\tableinst_1 \\extendsto \\tableinst_2`\n:ref:`Memory instance ` :math:`\\vdashmeminstextends \\meminst_1 \\extendsto \\meminst_2`\n:ref:`Global instance ` :math:`\\vdashglobalinstextends \\globalinst_1 \\extendsto \\globalinst_2`\n:ref:`Element instance ` :math:`\\vdasheleminstextends \\eleminst_1 \\extendsto \\eleminst_2`\n:ref:`Data instance ` :math:`\\vdashdatainstextends \\datainst_1 \\extendsto \\datainst_2`\n:ref:`Store ` :math:`\\vdashstoreextends \\store_1 \\extendsto \\store_2`\n=============================================== ===============================================================================\n\n\nExecution\n~~~~~~~~~\n\n=============================================== ===============================================================================\nConstruct Judgement\n=============================================== ===============================================================================\n:ref:`Instruction ` :math:`S;F;\\instr^\\ast \\stepto S';F';{\\instr'}^\\ast`\n:ref:`Expression ` :math:`S;F;\\expr \\stepto S';F';\\expr'`\n=============================================== ===============================================================================\n" }, { "path": "document/core/appendix/index-types.rst", "content": ".. index:: type\n.. _index-type:\n\nIndex of Types\n--------------\n\n======================================== =========================================== ===============================================================================\nCategory Constructor Binary Opcode\n======================================== =========================================== ===============================================================================\n:ref:`Type index ` :math:`x` (positive number as |Bs32| or |Bu32|)\n:ref:`Number type ` |I32| :math:`\\hex{7F}` (-1 as |Bs7|)\n:ref:`Number type ` |I64| :math:`\\hex{7E}` (-2 as |Bs7|)\n:ref:`Number type ` |F32| :math:`\\hex{7D}` (-3 as |Bs7|)\n:ref:`Number type ` |F64| :math:`\\hex{7C}` (-4 as |Bs7|)\n(reserved) :math:`\\hex{7B}` .. :math:`\\hex{71}`\n:ref:`Reference type ` |FUNCREF| :math:`\\hex{70}` (-16 as |Bs7|)\n:ref:`Reference type ` |EXTERNREF| :math:`\\hex{6F}` (-17 as |Bs7|)\n(reserved) :math:`\\hex{6E}` .. :math:`\\hex{61}`\n:ref:`Function type ` :math:`[\\valtype^\\ast] \\to [\\valtype^\\ast]` :math:`\\hex{60}` (-32 as |Bs7|)\n(reserved) :math:`\\hex{5F}` .. :math:`\\hex{41}`\n:ref:`Result type ` :math:`[\\epsilon]` :math:`\\hex{40}` (-64 as |Bs7|)\n:ref:`Table type ` :math:`\\limits~\\reftype` (none)\n:ref:`Memory type ` :math:`\\limits` (none)\n:ref:`Global type ` :math:`\\mut~\\valtype` (none)\n======================================== =========================================== ===============================================================================\n" }, { "path": "document/core/appendix/index.rst", "content": ".. _appendix:\n\nAppendix\n========\n\n.. toctree::\n :maxdepth: 2\n\n embedding\n implementation\n algorithm\n custom\n properties\n\n.. only:: singlehtml\n\n .. toctree::\n\n index-types\n index-instructions\n index-rules\n\n" }, { "path": "document/core/appendix/properties.rst", "content": ".. index:: ! soundness, type system\n.. _soundness:\n\nSoundness\n---------\n\nThe :ref:`type system ` of WebAssembly is *sound*, implying both *type safety* and *memory safety* with respect to the WebAssembly semantics. For example:\n\n* All types declared and derived during validation are respected at run time;\n e.g., every :ref:`local ` or :ref:`global ` variable will only contain type-correct values, every :ref:`instruction ` will only be applied to operands of the expected type, and every :ref:`function ` :ref:`invocation ` always evaluates to a result of the right type (if it does not :ref:`trap ` or diverge).\n\n* No memory location will be read or written except those explicitly defined by the program, i.e., as a :ref:`local `, a :ref:`global `, an element in a :ref:`table `, or a location within a linear :ref:`memory `.\n\n* There is no undefined behavior,\n i.e., the :ref:`execution rules ` cover all possible cases that can occur in a :ref:`valid ` program, and the rules are mutually consistent.\n\nSoundness also is instrumental in ensuring additional properties, most notably, *encapsulation* of function and module scopes: no :ref:`locals ` can be accessed outside their own function and no :ref:`module ` components can be accessed outside their own module unless they are explicitly :ref:`exported ` or :ref:`imported `.\n\nThe typing rules defining WebAssembly :ref:`validation ` only cover the *static* components of a WebAssembly program.\nIn order to state and prove soundness precisely, the typing rules must be extended to the *dynamic* components of the abstract :ref:`runtime `, that is, the :ref:`store `, :ref:`configurations `, and :ref:`administrative instructions `. [#cite-pldi2017]_\n\n\n.. index:: value, value type, result, result type, trap\n.. _valid-result:\n\nResults\n~~~~~~~\n\n:ref:`Results ` can be classified by :ref:`result types ` as follows.\n\n:ref:`Results ` :math:`\\val^\\ast`\n................................................\n\n* For each :ref:`value ` :math:`\\val_i` in :math:`\\val^\\ast`:\n\n * The value :math:`\\val_i` is :ref:`valid ` with some :ref:`value type ` :math:`t_i`.\n\n* Let :math:`t^\\ast` be the concatenation of all :math:`t_i`.\n\n* Then the result is valid with :ref:`result type ` :math:`[t^\\ast]`.\n\n.. math::\n \\frac{\n (S \\vdashval \\val : t)^\\ast\n }{\n S \\vdashresult \\val^\\ast : [t^\\ast]\n }\n\n\n:ref:`Results ` :math:`\\TRAP`\n............................................\n\n* The result is valid with :ref:`result type ` :math:`[t^\\ast]`, for any sequence :math:`t^\\ast` of :ref:`value types `.\n\n.. math::\n \\frac{\n }{\n S \\vdashresult \\TRAP : [t^\\ast]\n }\n\n\n.. _module-context:\n.. _valid-store:\n\nStore Validity\n~~~~~~~~~~~~~~\n\nThe following typing rules specify when a runtime :ref:`store ` :math:`S` is *valid*.\nA valid store must consist of\n:ref:`function `, :ref:`table `, :ref:`memory `, :ref:`global `, and :ref:`module ` instances that are themselves valid, relative to :math:`S`.\n\nTo that end, each kind of instance is classified by a respective :ref:`function `, :ref:`table `, :ref:`memory `, or :ref:`global ` type.\nModule instances are classified by *module contexts*, which are regular :ref:`contexts ` repurposed as module types describing the :ref:`index spaces ` defined by a module.\n\n\n\n.. index:: store, function instance, table instance, memory instance, global instance, function type, table type, memory type, global type\n\n:ref:`Store ` :math:`S`\n.....................................\n\n* Each :ref:`function instance ` :math:`\\funcinst_i` in :math:`S.\\SFUNCS` must be :ref:`valid ` with some :ref:`function type ` :math:`\\functype_i`.\n\n* Each :ref:`table instance ` :math:`\\tableinst_i` in :math:`S.\\STABLES` must be :ref:`valid ` with some :ref:`table type ` :math:`\\tabletype_i`.\n\n* Each :ref:`memory instance ` :math:`\\meminst_i` in :math:`S.\\SMEMS` must be :ref:`valid ` with some :ref:`memory type ` :math:`\\memtype_i`.\n\n* Each :ref:`global instance ` :math:`\\globalinst_i` in :math:`S.\\SGLOBALS` must be :ref:`valid ` with some :ref:`global type ` :math:`\\globaltype_i`.\n\n* Each :ref:`element instance ` :math:`\\eleminst_i` in :math:`S.\\SELEMS` must be :ref:`valid `.\n\n* Each :ref:`data instance ` :math:`\\datainst_i` in :math:`S.\\SDATAS` must be :ref:`valid `.\n\n* Then the store is valid.\n\n.. math::\n ~\\\\[-1ex]\n \\frac{\n \\begin{array}{@{}c@{}}\n (S \\vdashfuncinst \\funcinst : \\functype)^\\ast\n \\qquad\n (S \\vdashtableinst \\tableinst : \\tabletype)^\\ast\n \\\\\n (S \\vdashmeminst \\meminst : \\memtype)^\\ast\n \\qquad\n (S \\vdashglobalinst \\globalinst : \\globaltype)^\\ast\n \\\\\n (S \\vdasheleminst \\eleminst \\ok)^\\ast\n \\qquad\n (S \\vdashdatainst \\datainst \\ok)^\\ast\n \\\\\n S = \\{\n \\SFUNCS~\\funcinst^\\ast,\n \\STABLES~\\tableinst^\\ast,\n \\SMEMS~\\meminst^\\ast,\n \\SGLOBALS~\\globalinst^\\ast,\n \\SELEMS~\\eleminst^\\ast,\n \\SDATAS~\\datainst^\\ast \\}\n \\end{array}\n }{\n \\vdashstore S \\ok\n }\n\n\n.. index:: function type, function instance\n.. _valid-funcinst:\n\n:ref:`Function Instances ` :math:`\\{\\FITYPE~\\functype, \\FIMODULE~\\moduleinst, \\FICODE~\\func\\}`\n.......................................................................................................................\n\n* The :ref:`function type ` :math:`\\functype` must be :ref:`valid `.\n\n* The :ref:`module instance ` :math:`\\moduleinst` must be :ref:`valid ` with some :ref:`context ` :math:`C`.\n\n* Under :ref:`context ` :math:`C`, the :ref:`function ` :math:`\\func` must be :ref:`valid ` with :ref:`function type ` :math:`\\functype`.\n\n* Then the function instance is valid with :ref:`function type ` :math:`\\functype`.\n\n.. math::\n \\frac{\n \\vdashfunctype \\functype \\ok\n \\qquad\n S \\vdashmoduleinst \\moduleinst : C\n \\qquad\n C \\vdashfunc \\func : \\functype\n }{\n S \\vdashfuncinst \\{\\FITYPE~\\functype, \\FIMODULE~\\moduleinst, \\FICODE~\\func\\} : \\functype\n }\n\n\n.. index:: function type, function instance, host function\n.. _valid-hostfuncinst:\n\n:ref:`Host Function Instances ` :math:`\\{\\FITYPE~\\functype, \\FIHOSTCODE~\\X{hf}\\}`\n..................................................................................................\n\n* The :ref:`function type ` :math:`\\functype` must be :ref:`valid `.\n\n* Let :math:`[t_1^\\ast] \\to [t_2^\\ast]` be the :ref:`function type ` :math:`\\functype`.\n\n* For every :ref:`valid ` :ref:`store ` :math:`S_1` :ref:`extending ` :math:`S` and every sequence :math:`\\val^\\ast` of :ref:`values ` whose :ref:`types ` coincide with :math:`t_1^\\ast`:\n\n * :ref:`Executing ` :math:`\\X{hf}` in store :math:`S_1` with arguments :math:`\\val^\\ast` has a non-empty set of possible outcomes.\n\n * For every element :math:`R` of this set:\n\n * Either :math:`R` must be :math:`\\bot` (i.e., divergence).\n\n * Or :math:`R` consists of a :ref:`valid ` :ref:`store ` :math:`S_2` :ref:`extending ` :math:`S_1` and a :ref:`result ` :math:`\\result` whose :ref:`type ` coincides with :math:`[t_2^\\ast]`.\n\n* Then the function instance is valid with :ref:`function type ` :math:`\\functype`.\n\n.. math::\n \\frac{\n \\begin{array}[b]{@{}l@{}}\n \\vdashfunctype [t_1^\\ast] \\to [t_2^\\ast] \\ok \\\\\n \\end{array}\n \\quad\n \\begin{array}[b]{@{}l@{}}\n \\forall S_1, \\val^\\ast,~\n {\\vdashstore S_1 \\ok} \\wedge\n {\\vdashstoreextends S \\extendsto S_1} \\wedge\n {S_1 \\vdashresult \\val^\\ast : [t_1^\\ast]}\n \\Longrightarrow {} \\\\ \\qquad\n \\X{hf}(S_1; \\val^\\ast) \\supset \\emptyset \\wedge {} \\\\ \\qquad\n \\forall R \\in \\X{hf}(S_1; \\val^\\ast),~\n R = \\bot \\vee {} \\\\ \\qquad\\qquad\n \\exists S_2, \\result,~\n {\\vdashstore S_2 \\ok} \\wedge\n {\\vdashstoreextends S_1 \\extendsto S_2} \\wedge\n {S_2 \\vdashresult \\result : [t_2^\\ast]} \\wedge\n R = (S_2; \\result)\n \\end{array}\n }{\n S \\vdashfuncinst \\{\\FITYPE~[t_1^\\ast] \\to [t_2^\\ast], \\FIHOSTCODE~\\X{hf}\\} : [t_1^\\ast] \\to [t_2^\\ast]\n }\n\n.. note::\n This rule states that, if appropriate pre-conditions about store and arguments are satisfied, then executing the host function must satisfy appropriate post-conditions about store and results.\n The post-conditions match the ones in the :ref:`execution rule ` for invoking host functions.\n\n Any store under which the function is invoked is assumed to be an extension of the current store.\n That way, the function itself is able to make sufficient assumptions about future stores.\n\n\n.. index:: table type, table instance, limits, function address\n.. _valid-tableinst:\n\n:ref:`Table Instances ` :math:`\\{ \\TITYPE~(\\limits~t), \\TIELEM~\\reff^\\ast \\}`\n...............................................................................................\n\n* The :ref:`table type ` :math:`\\limits~t` must be :ref:`valid `.\n\n* The length of :math:`\\reff^\\ast` must equal :math:`\\limits.\\LMIN`.\n\n* For each :ref:`reference ` :math:`\\reff_i` in the table's elements :math:`\\reff^n`:\n\n * The :ref:`reference ` :math:`\\reff_i` must be :ref:`valid ` with :ref:`reference type ` :math:`t`.\n\n* Then the table instance is valid with :ref:`table type ` :math:`\\limits~t`.\n\n.. math::\n \\frac{\n \\vdashtabletype \\limits~t \\ok\n \\qquad\n n = \\limits.\\LMIN\n \\qquad\n (S \\vdash \\reff : t)^n\n }{\n S \\vdashtableinst \\{ \\TITYPE~(\\limits~t), \\TIELEM~\\reff^n \\} : \\limits~t\n }\n\n\n.. index:: memory type, memory instance, limits, byte\n.. _valid-meminst:\n\n:ref:`Memory Instances ` :math:`\\{ \\MITYPE~\\limits, \\MIDATA~b^\\ast \\}`\n......................................................................................\n\n* The :ref:`memory type ` :math:`\\{\\LMIN~n, \\LMAX~m^?\\}` must be :ref:`valid `.\n\n* The length of :math:`b^\\ast` must equal :math:`\\limits.\\LMIN` multiplied by the :ref:`page size ` :math:`64\\,\\F{Ki}`.\n\n* Then the memory instance is valid with :ref:`memory type ` :math:`\\limits`.\n\n.. math::\n \\frac{\n \\vdashmemtype \\limits \\ok\n \\qquad\n n = \\limits.\\LMIN \\cdot 64\\,\\F{Ki}\n }{\n S \\vdashmeminst \\{ \\MITYPE~\\limits, \\MIDATA~b^n \\} : \\limits\n }\n\n\n.. index:: global type, global instance, value, mutability\n.. _valid-globalinst:\n\n:ref:`Global Instances ` :math:`\\{ \\GITYPE~(\\mut~t), \\GIVALUE~\\val \\}`\n.........................................................................................\n\n* The :ref:`global type ` :math:`\\mut~t` must be :ref:`valid `.\n\n* The :ref:`value ` :math:`\\val` must be :ref:`valid ` with :ref:`value type ` :math:`t`.\n\n* Then the global instance is valid with :ref:`global type ` :math:`\\mut~t`.\n\n.. math::\n \\frac{\n \\vdashglobaltype \\mut~t \\ok\n \\qquad\n S \\vdashval \\val : t\n }{\n S \\vdashglobalinst \\{ \\GITYPE~(\\mut~t), \\GIVALUE~\\val \\} : \\mut~t\n }\n\n\n.. index:: element instance, reference\n.. _valid-eleminst:\n\n:ref:`Element Instances ` :math:`\\{ \\EIELEM~\\X{fa}^\\ast \\}`\n............................................................................\n\n* For each :ref:`reference ` :math:`\\reff_i` in the elements :math:`\\reff^n`:\n\n * The :ref:`reference ` :math:`\\reff_i` must be :ref:`valid ` with :ref:`reference type ` :math:`t`.\n\n* Then the table instance is valid.\n\n.. math::\n \\frac{\n (S \\vdash \\reff : t)^\\ast\n }{\n S \\vdasheleminst \\{ \\EITYPE~t, \\EIELEM~\\reff^\\ast \\} \\ok\n }\n\n\n.. index:: data instance, byte\n.. _valid-datainst:\n\n:ref:`Data Instances ` :math:`\\{ \\DIDATA~b^\\ast \\}`\n....................................................................\n\n* The data instance is valid.\n\n.. math::\n \\frac{\n }{\n S \\vdashdatainst \\{ \\DIDATA~b^\\ast \\} \\ok\n }\n\n\n.. index:: external type, export instance, name, external value\n.. _valid-exportinst:\n\n:ref:`Export Instances ` :math:`\\{ \\EINAME~\\name, \\EIVALUE~\\externval \\}`\n.......................................................................................................\n\n* The :ref:`external value ` :math:`\\externval` must be :ref:`valid ` with some :ref:`external type ` :math:`\\externtype`.\n\n* Then the export instance is valid.\n\n.. math::\n \\frac{\n S \\vdashexternval \\externval : \\externtype\n }{\n S \\vdashexportinst \\{ \\EINAME~\\name, \\EIVALUE~\\externval \\} \\ok\n }\n\n\n.. index:: module instance, context\n.. _valid-moduleinst:\n\n:ref:`Module Instances ` :math:`\\moduleinst`\n...............................................................\n\n* Each :ref:`function type ` :math:`\\functype_i` in :math:`\\moduleinst.\\MITYPES` must be :ref:`valid `.\n\n* For each :ref:`function address ` :math:`\\funcaddr_i` in :math:`\\moduleinst.\\MIFUNCS`, the :ref:`external value ` :math:`\\EVFUNC~\\funcaddr_i` must be :ref:`valid ` with some :ref:`external type ` :math:`\\ETFUNC~\\functype'_i`.\n\n* For each :ref:`table address ` :math:`\\tableaddr_i` in :math:`\\moduleinst.\\MITABLES`, the :ref:`external value ` :math:`\\EVTABLE~\\tableaddr_i` must be :ref:`valid ` with some :ref:`external type ` :math:`\\ETTABLE~\\tabletype_i`.\n\n* For each :ref:`memory address ` :math:`\\memaddr_i` in :math:`\\moduleinst.\\MIMEMS`, the :ref:`external value ` :math:`\\EVMEM~\\memaddr_i` must be :ref:`valid ` with some :ref:`external type ` :math:`\\ETMEM~\\memtype_i`.\n\n* For each :ref:`global address ` :math:`\\globaladdr_i` in :math:`\\moduleinst.\\MIGLOBALS`, the :ref:`external value ` :math:`\\EVGLOBAL~\\globaladdr_i` must be :ref:`valid ` with some :ref:`external type ` :math:`\\ETGLOBAL~\\globaltype_i`.\n\n* For each :ref:`element address ` :math:`\\elemaddr_i` in :math:`\\moduleinst.\\MIELEMS`, the :ref:`element instance ` :math:`S.\\SELEMS[\\elemaddr_i]` must be :ref:`valid `.\n\n* For each :ref:`data address ` :math:`\\dataaddr_i` in :math:`\\moduleinst.\\MIDATAS`, the :ref:`data instance ` :math:`S.\\SDATAS[\\dataaddr_i]` must be :ref:`valid `.\n\n* Each :ref:`export instance ` :math:`\\exportinst_i` in :math:`\\moduleinst.\\MIEXPORTS` must be :ref:`valid `.\n\n* For each :ref:`export instance ` :math:`\\exportinst_i` in :math:`\\moduleinst.\\MIEXPORTS`, the :ref:`name ` :math:`\\exportinst_i.\\EINAME` must be different from any other name occurring in :math:`\\moduleinst.\\MIEXPORTS`.\n\n* Let :math:`{\\functype'}^\\ast` be the concatenation of all :math:`\\functype'_i` in order.\n\n* Let :math:`\\tabletype^\\ast` be the concatenation of all :math:`\\tabletype_i` in order.\n\n* Let :math:`\\memtype^\\ast` be the concatenation of all :math:`\\memtype_i` in order.\n\n* Let :math:`\\globaltype^\\ast` be the concatenation of all :math:`\\globaltype_i` in order.\n\n* Then the module instance is valid with :ref:`context ` :math:`\\{\\CTYPES~\\functype^\\ast, \\CFUNCS~{\\functype'}^\\ast, \\CTABLES~\\tabletype^\\ast, \\CMEMS~\\memtype^\\ast, \\CGLOBALS~\\globaltype^\\ast\\}`.\n\n.. math::\n ~\\\\[-1ex]\n \\frac{\n \\begin{array}{@{}c@{}}\n (\\vdashfunctype \\functype \\ok)^\\ast\n \\\\\n (S \\vdashexternval \\EVFUNC~\\funcaddr : \\ETFUNC~\\functype')^\\ast\n \\qquad\n (S \\vdashexternval \\EVTABLE~\\tableaddr : \\ETTABLE~\\tabletype)^\\ast\n \\\\\n (S \\vdashexternval \\EVMEM~\\memaddr : \\ETMEM~\\memtype)^\\ast\n \\qquad\n (S \\vdashexternval \\EVGLOBAL~\\globaladdr : \\ETGLOBAL~\\globaltype)^\\ast\n \\\\\n (S \\vdasheleminst S.\\SELEMS[\\elemaddr] \\ok)^\\ast\n \\qquad\n (S \\vdashdatainst S.\\SDATAS[\\dataaddr] \\ok)^\\ast\n \\\\\n (S \\vdashexportinst \\exportinst \\ok)^\\ast\n \\qquad\n (\\exportinst.\\EINAME)^\\ast ~\\mbox{disjoint}\n \\end{array}\n }{\n S \\vdashmoduleinst \\{\n \\begin{array}[t]{@{}l@{~}l@{}}\n \\MITYPES & \\functype^\\ast, \\\\\n \\MIFUNCS & \\funcaddr^\\ast, \\\\\n \\MITABLES & \\tableaddr^\\ast, \\\\\n \\MIMEMS & \\memaddr^\\ast, \\\\\n \\MIGLOBALS & \\globaladdr^\\ast, \\\\\n \\MIELEMS & \\elemaddr^\\ast, \\\\\n \\MIDATAS & \\dataaddr^\\ast, \\\\\n \\MIEXPORTS & \\exportinst^\\ast ~\\} : \\{\n \\begin{array}[t]{@{}l@{~}l@{}}\n \\CTYPES & \\functype^\\ast, \\\\\n \\CFUNCS & {\\functype'}^\\ast, \\\\\n \\CTABLES & \\tabletype^\\ast, \\\\\n \\CMEMS & \\memtype^\\ast, \\\\\n \\CGLOBALS & \\globaltype^\\ast ~\\}\n \\end{array}\n \\end{array}\n }\n\n\n.. index:: configuration, administrative instruction, store, frame\n.. _frame-context:\n.. _valid-config:\n\nConfiguration Validity\n~~~~~~~~~~~~~~~~~~~~~~\n\nTo relate the WebAssembly :ref:`type system ` to its :ref:`execution semantics `, the :ref:`typing rules for instructions ` must be extended to :ref:`configurations ` :math:`S;T`,\nwhich relates the :ref:`store ` to execution :ref:`threads `.\n\nConfigurations and threads are classified by their :ref:`result type `.\nIn addition to the store :math:`S`, threads are typed under a *return type* :math:`\\resulttype^?`, which controls whether and with which type a |return| instruction is allowed.\nThis type is absent (:math:`\\epsilon`) except for instruction sequences inside an administrative |FRAME| instruction.\n\nFinally, :ref:`frames ` are classified with *frame contexts*, which extend the :ref:`module contexts ` of a frame's associated :ref:`module instance ` with the :ref:`locals ` that the frame contains.\n\n\n.. index:: result type, thread\n\n:ref:`Configurations ` :math:`S;T`\n.................................................\n\n* The :ref:`store ` :math:`S` must be :ref:`valid `.\n\n* Under no allowed return type,\n the :ref:`thread ` :math:`T` must be :ref:`valid ` with some :ref:`result type ` :math:`[t^\\ast]`.\n\n* Then the configuration is valid with the :ref:`result type ` :math:`[t^\\ast]`.\n\n.. math::\n \\frac{\n \\vdashstore S \\ok\n \\qquad\n S; \\epsilon \\vdashthread T : [t^\\ast]\n }{\n \\vdashconfig S; T : [t^\\ast]\n }\n\n\n.. index:: thread, frame, instruction, result type, context\n.. _valid-thread:\n\n:ref:`Threads ` :math:`F;\\instr^\\ast`\n....................................................\n\n* Let :math:`\\resulttype^?` be the current allowed return type.\n\n* The :ref:`frame ` :math:`F` must be :ref:`valid ` with a :ref:`context ` :math:`C`.\n\n* Let :math:`C'` be the same :ref:`context ` as :math:`C`, but with |CRETURN| set to :math:`\\resulttype^?`.\n\n* Under context :math:`C'`,\n the instruction sequence :math:`\\instr^\\ast` must be :ref:`valid ` with some type :math:`[] \\to [t^\\ast]`.\n\n* Then the thread is valid with the :ref:`result type ` :math:`[t^\\ast]`.\n\n.. math::\n \\frac{\n S \\vdashframe F : C\n \\qquad\n S; C,\\CRETURN~\\resulttype^? \\vdashinstrseq \\instr^\\ast : [] \\to [t^\\ast]\n }{\n S; \\resulttype^? \\vdashthread F; \\instr^\\ast : [t^\\ast]\n }\n\n\n.. index:: frame, local, module instance, value, value type, context\n.. _valid-frame:\n\n:ref:`Frames ` :math:`\\{\\ALOCALS~\\val^\\ast, \\AMODULE~\\moduleinst\\}`\n.................................................................................\n\n* The :ref:`module instance ` :math:`\\moduleinst` must be :ref:`valid ` with some :ref:`module context ` :math:`C`.\n\n* Each :ref:`value ` :math:`\\val_i` in :math:`\\val^\\ast` must be :ref:`valid ` with some :ref:`value type ` :math:`t_i`.\n\n* Let :math:`t^\\ast` the concatenation of all :math:`t_i` in order.\n\n* Let :math:`C'` be the same :ref:`context ` as :math:`C`, but with the :ref:`value types ` :math:`t^\\ast` prepended to the |CLOCALS| vector.\n\n* Then the frame is valid with :ref:`frame context ` :math:`C'`.\n\n.. math::\n \\frac{\n S \\vdashmoduleinst \\moduleinst : C\n \\qquad\n (S \\vdashval \\val : t)^\\ast\n }{\n S \\vdashframe \\{\\ALOCALS~\\val^\\ast, \\AMODULE~\\moduleinst\\} : (C, \\CLOCALS~t^\\ast)\n }\n\n\n.. index:: administrative instruction, value type, context, store\n.. _valid-instr-admin:\n\nAdministrative Instructions\n~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\nTyping rules for :ref:`administrative instructions ` are specified as follows.\nIn addition to the :ref:`context ` :math:`C`, typing of these instructions is defined under a given :ref:`store ` :math:`S`.\nTo that end, all previous typing judgements :math:`C \\vdash \\X{prop}` are generalized to include the store, as in :math:`S; C \\vdash \\X{prop}`, by implicitly adding :math:`S` to all rules -- :math:`S` is never modified by the pre-existing rules, but it is accessed in the extra rules for :ref:`administrative instructions ` given below.\n\n\n.. index:: trap\n\n:math:`\\TRAP`\n.............\n\n* The instruction is valid with type :math:`[t_1^\\ast] \\to [t_2^\\ast]`, for any sequences of :ref:`value types ` :math:`t_1^\\ast` and :math:`t_2^\\ast`.\n\n.. math::\n \\frac{\n }{\n S; C \\vdashadmininstr \\TRAP : [t_1^\\ast] \\to [t_2^\\ast]\n }\n\n\n.. index:: extern address\n\n:math:`\\REFEXTERNADDR~\\externaddr`\n..................................\n\n* The instruction is valid with type :math:`[] \\to [\\EXTERNREF]`.\n\n.. math::\n \\frac{\n }{\n S; C \\vdashadmininstr \\REFEXTERNADDR~\\externaddr : [] \\to [\\EXTERNREF]\n }\n\n\n.. index:: function address, extern value, extern type, function type\n\n:math:`\\REFFUNCADDR~\\funcaddr`\n..............................\n\n* The :ref:`external function value ` :math:`\\EVFUNC~\\funcaddr` must be :ref:`valid ` with :ref:`external function type ` :math:`\\ETFUNC \\functype`.\n\n* Then the instruction is valid with type :math:`[] \\to [\\FUNCREF]`.\n\n.. math::\n \\frac{\n S \\vdashexternval \\EVFUNC~\\funcaddr : \\ETFUNC~\\functype\n }{\n S; C \\vdashadmininstr \\REFFUNCADDR~\\funcaddr : [] \\to [\\FUNCREF]\n }\n\n\n.. index:: function address, extern value, extern type, function type\n\n:math:`\\INVOKE~\\funcaddr`\n.........................\n\n* The :ref:`external function value ` :math:`\\EVFUNC~\\funcaddr` must be :ref:`valid ` with :ref:`external function type ` :math:`\\ETFUNC ([t_1^\\ast] \\to [t_2^\\ast])`.\n\n* Then the instruction is valid with type :math:`[t_1^\\ast] \\to [t_2^\\ast]`.\n\n.. math::\n \\frac{\n S \\vdashexternval \\EVFUNC~\\funcaddr : \\ETFUNC~[t_1^\\ast] \\to [t_2^\\ast]\n }{\n S; C \\vdashadmininstr \\INVOKE~\\funcaddr : [t_1^\\ast] \\to [t_2^\\ast]\n }\n\n\n.. index:: label, instruction, result type\n\n:math:`\\LABEL_n\\{\\instr_0^\\ast\\}~\\instr^\\ast~\\END`\n..................................................\n\n* The instruction sequence :math:`\\instr_0^\\ast` must be :ref:`valid ` with some type :math:`[t_1^n] \\to [t_2^*]`.\n\n* Let :math:`C'` be the same :ref:`context ` as :math:`C`, but with the :ref:`result type ` :math:`[t_1^n]` prepended to the |CLABELS| vector.\n\n* Under context :math:`C'`,\n the instruction sequence :math:`\\instr^\\ast` must be :ref:`valid ` with type :math:`[] \\to [t_2^*]`.\n\n* Then the compound instruction is valid with type :math:`[] \\to [t_2^*]`.\n\n.. math::\n \\frac{\n S; C \\vdashinstrseq \\instr_0^\\ast : [t_1^n] \\to [t_2^*]\n \\qquad\n S; C,\\CLABELS\\,[t_1^n] \\vdashinstrseq \\instr^\\ast : [] \\to [t_2^*]\n }{\n S; C \\vdashadmininstr \\LABEL_n\\{\\instr_0^\\ast\\}~\\instr^\\ast~\\END : [] \\to [t_2^*]\n }\n\n\n.. index:: frame, instruction, result type\n\n:math:`\\FRAME_n\\{F\\}~\\instr^\\ast~\\END`\n...........................................\n\n* Under the return type :math:`[t^n]`,\n the :ref:`thread ` :math:`F; \\instr^\\ast` must be :ref:`valid ` with :ref:`result type ` :math:`[t^n]`.\n\n* Then the compound instruction is valid with type :math:`[] \\to [t^n]`.\n\n.. math::\n \\frac{\n S; [t^n] \\vdashinstrseq F; \\instr^\\ast : [t^n]\n }{\n S; C \\vdashadmininstr \\FRAME_n\\{F\\}~\\instr^\\ast~\\END : [] \\to [t^n]\n }\n\n\n.. index:: ! store extension, store\n.. _extend:\n\nStore Extension\n~~~~~~~~~~~~~~~\n\nPrograms can mutate the :ref:`store ` and its contained instances.\nAny such modification must respect certain invariants, such as not removing allocated instances or changing immutable definitions.\nWhile these invariants are inherent to the execution semantics of WebAssembly :ref:`instructions ` and :ref:`modules `,\n:ref:`host functions ` do not automatically adhere to them. Consequently, the required invariants must be stated as explicit constraints on the :ref:`invocation ` of host functions.\nSoundness only holds when the :ref:`embedder ` ensures these constraints.\n\nThe necessary constraints are codified by the notion of store *extension*:\na store state :math:`S'` extends state :math:`S`, written :math:`S \\extendsto S'`, when the following rules hold.\n\n.. note::\n Extension does not imply that the new store is valid, which is defined separately :ref:`above `.\n\n\n.. index:: store, function instance, table instance, memory instance, global instance\n.. _extend-store:\n\n:ref:`Store ` :math:`S`\n.....................................\n\n* The length of :math:`S.\\SFUNCS` must not shrink.\n\n* The length of :math:`S.\\STABLES` must not shrink.\n\n* The length of :math:`S.\\SMEMS` must not shrink.\n\n* The length of :math:`S.\\SGLOBALS` must not shrink.\n\n* The length of :math:`S.\\SELEMS` must not shrink.\n\n* The length of :math:`S.\\SDATAS` must not shrink.\n\n* For each :ref:`function instance ` :math:`\\funcinst_i` in the original :math:`S.\\SFUNCS`, the new function instance must be an :ref:`extension ` of the old.\n\n* For each :ref:`table instance ` :math:`\\tableinst_i` in the original :math:`S.\\STABLES`, the new table instance must be an :ref:`extension ` of the old.\n\n* For each :ref:`memory instance ` :math:`\\meminst_i` in the original :math:`S.\\SMEMS`, the new memory instance must be an :ref:`extension ` of the old.\n\n* For each :ref:`global instance ` :math:`\\globalinst_i` in the original :math:`S.\\SGLOBALS`, the new global instance must be an :ref:`extension ` of the old.\n\n* For each :ref:`element instance ` :math:`\\eleminst_i` in the original :math:`S.\\SELEMS`, the new global instance must be an :ref:`extension ` of the old.\n\n* For each :ref:`data instance ` :math:`\\datainst_i` in the original :math:`S.\\SDATAS`, the new global instance must be an :ref:`extension ` of the old.\n\n.. math::\n \\frac{\n \\begin{array}{@{}ccc@{}}\n S_1.\\SFUNCS = \\funcinst_1^\\ast &\n S_2.\\SFUNCS = {\\funcinst'_1}^\\ast~\\funcinst_2^\\ast &\n (\\vdashfuncinstextends \\funcinst_1 \\extendsto \\funcinst'_1)^\\ast \\\\\n S_1.\\STABLES = \\tableinst_1^\\ast &\n S_2.\\STABLES = {\\tableinst'_1}^\\ast~\\tableinst_2^\\ast &\n (\\vdashtableinstextends \\tableinst_1 \\extendsto \\tableinst'_1)^\\ast \\\\\n S_1.\\SMEMS = \\meminst_1^\\ast &\n S_2.\\SMEMS = {\\meminst'_1}^\\ast~\\meminst_2^\\ast &\n (\\vdashmeminstextends \\meminst_1 \\extendsto \\meminst'_1)^\\ast \\\\\n S_1.\\SGLOBALS = \\globalinst_1^\\ast &\n S_2.\\SGLOBALS = {\\globalinst'_1}^\\ast~\\globalinst_2^\\ast &\n (\\vdashglobalinstextends \\globalinst_1 \\extendsto \\globalinst'_1)^\\ast \\\\\n S_1.\\SELEMS = \\eleminst_1^\\ast &\n S_2.\\SELEMS = {\\eleminst'_1}^\\ast~\\eleminst_2^\\ast &\n (\\vdasheleminstextends \\eleminst_1 \\extendsto \\eleminst'_1)^\\ast \\\\\n S_1.\\SDATAS = \\datainst_1^\\ast &\n S_2.\\SDATAS = {\\datainst'_1}^\\ast~\\datainst_2^\\ast &\n (\\vdashdatainstextends \\datainst_1 \\extendsto \\datainst'_1)^\\ast \\\\\n \\end{array}\n }{\n \\vdashstoreextends S_1 \\extendsto S_2\n }\n\n\n.. index:: function instance\n.. _extend-funcinst:\n\n:ref:`Function Instance ` :math:`\\funcinst`\n............................................................\n\n* A function instance must remain unchanged.\n\n.. math::\n \\frac{\n }{\n \\vdashfuncinstextends \\funcinst \\extendsto \\funcinst\n }\n\n\n.. index:: table instance\n.. _extend-tableinst:\n\n:ref:`Table Instance ` :math:`\\tableinst`\n...........................................................\n\n* The :ref:`table type ` :math:`\\tableinst.\\TITYPE` must remain unchanged.\n\n* The length of :math:`\\tableinst.\\TIELEM` must not shrink.\n\n.. math::\n \\frac{\n n_1 \\leq n_2\n }{\n \\vdashtableinstextends \\{\\TITYPE~\\X{tt}, \\TIELEM~(\\X{fa}_1^?)^{n_1}\\} \\extendsto \\{\\TITYPE~\\X{tt}, \\TIELEM~(\\X{fa}_2^?)^{n_2}\\}\n }\n\n\n.. index:: memory instance\n.. _extend-meminst:\n\n:ref:`Memory Instance ` :math:`\\meminst`\n........................................................\n\n* The :ref:`memory type ` :math:`\\meminst.\\MITYPE` must remain unchanged.\n\n* The length of :math:`\\meminst.\\MIDATA` must not shrink.\n\n.. math::\n \\frac{\n n_1 \\leq n_2\n }{\n \\vdashmeminstextends \\{\\MITYPE~\\X{mt}, \\MIDATA~b_1^{n_1}\\} \\extendsto \\{\\MITYPE~\\X{mt}, \\MIDATA~b_2^{n_2}\\}\n }\n\n\n.. index:: global instance, value, mutability\n.. _extend-globalinst:\n\n:ref:`Global Instance ` :math:`\\globalinst`\n..............................................................\n\n* The :ref:`global type ` :math:`\\globalinst.\\GITYPE` must remain unchanged.\n\n* Let :math:`\\mut~t` be the structure of :math:`\\globalinst.\\GITYPE`.\n\n* If :math:`\\mut` is |MCONST|, then the :ref:`value ` :math:`\\globalinst.\\GIVALUE` must remain unchanged.\n\n.. math::\n \\frac{\n \\mut = \\MVAR \\vee \\val_1 = \\val_2\n }{\n \\vdashglobalinstextends \\{\\GITYPE~(\\mut~t), \\GIVALUE~\\val_1\\} \\extendsto \\{\\GITYPE~(\\mut~t), \\GIVALUE~\\val_2\\}\n }\n\n\n.. index:: element instance\n.. _extend-eleminst:\n\n:ref:`Element Instance ` :math:`\\eleminst`\n...........................................................\n\n* The vector :math:`\\eleminst.\\EIELEM` must either remain unchanged or shrink to length :math:`0`.\n\n.. math::\n \\frac{\n \\X{fa}_1^\\ast = \\X{fa}_2^\\ast \\vee \\X{fa}_2^\\ast = \\epsilon\n }{\n \\vdasheleminstextends \\{\\EIELEM~\\X{fa}_1^\\ast\\} \\extendsto \\{\\EIELEM~\\X{fa}_2^\\ast\\}\n }\n\n\n.. index:: data instance\n.. _extend-datainst:\n\n:ref:`Data Instance ` :math:`\\datainst`\n........................................................\n\n* The vector :math:`\\datainst.\\DIDATA` must either remain unchanged or shrink to length :math:`0`.\n\n.. math::\n \\frac{\n b_1^\\ast = b_2^\\ast \\vee b_2^\\ast = \\epsilon\n }{\n \\vdashdatainstextends \\{\\DIDATA~b_1^\\ast\\} \\extendsto \\{\\DIDATA~b_2^\\ast\\}\n }\n\n\n\n.. index:: ! preservation, ! progress, soundness, configuration, thread, terminal configuration, instantiation, invocation, validity, module\n.. _soundness-statement:\n\nTheorems\n~~~~~~~~\n\nGiven the definition of :ref:`valid configurations `,\nthe standard soundness theorems hold. [#cite-cpp2018]_\n\n**Theorem (Preservation).**\nIf a :ref:`configuration ` :math:`S;T` is :ref:`valid ` with :ref:`result type ` :math:`[t^\\ast]` (i.e., :math:`\\vdashconfig S;T : [t^\\ast]`),\nand steps to :math:`S';T'` (i.e., :math:`S;T \\stepto S';T'`),\nthen :math:`S';T'` is a valid configuration with the same result type (i.e., :math:`\\vdashconfig S';T' : [t^\\ast]`).\nFurthermore, :math:`S'` is an :ref:`extension ` of :math:`S` (i.e., :math:`\\vdashstoreextends S \\extendsto S'`).\n\nA *terminal* :ref:`thread ` is one whose sequence of :ref:`instructions ` is a :ref:`result `.\nA terminal configuration is a configuration whose thread is terminal.\n\n**Theorem (Progress).**\nIf a :ref:`configuration ` :math:`S;T` is :ref:`valid ` (i.e., :math:`\\vdashconfig S;T : [t^\\ast]` for some :ref:`result type ` :math:`[t^\\ast]`),\nthen either it is terminal,\nor it can step to some configuration :math:`S';T'` (i.e., :math:`S;T \\stepto S';T'`).\n\nFrom Preservation and Progress the soundness of the WebAssembly type system follows directly.\n\n**Corollary (Soundness).**\nIf a :ref:`configuration ` :math:`S;T` is :ref:`valid ` (i.e., :math:`\\vdashconfig S;T : [t^\\ast]` for some :ref:`result type ` :math:`[t^\\ast]`),\nthen it either diverges or takes a finite number of steps to reach a terminal configuration :math:`S';T'` (i.e., :math:`S;T \\stepto^\\ast S';T'`) that is valid with the same result type (i.e., :math:`\\vdashconfig S';T' : [t^\\ast]`)\nand where :math:`S'` is an :ref:`extension ` of :math:`S` (i.e., :math:`\\vdashstoreextends S \\extendsto S'`).\n\nIn other words, every thread in a valid configuration either runs forever, traps, or terminates with a result that has the expected type.\nConsequently, given a :ref:`valid store `, no computation defined by :ref:`instantiation ` or :ref:`invocation ` of a valid module can \"crash\" or otherwise (mis)behave in ways not covered by the :ref:`execution ` semantics given in this specification.\n\n\n.. [#cite-pldi2017]\n The formalization and theorems are derived from the following article:\n Andreas Haas, Andreas Rossberg, Derek Schuff, Ben Titzer, Dan Gohman, Luke Wagner, Alon Zakai, JF Bastien, Michael Holman. |PLDI2017|_. Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2017). ACM 2017.\n\n.. [#cite-cpp2018]\n A machine-verified version of the formalization and soundness proof is described in the following article:\n Conrad Watt. |CPP2018|_. Proceedings of the 7th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2018). ACM 2018.\n" }, { "path": "document/core/binary/conventions.rst", "content": ".. index:: ! binary format, module, byte, file extension, abstract syntax\n\nConventions\n-----------\n\nThe binary format for WebAssembly :ref:`modules ` is a dense linear *encoding* of their :ref:`abstract syntax `.\n[#compression]_\n\nThe format is defined by an *attribute grammar* whose only terminal symbols are :ref:`bytes `.\nA byte sequence is a well-formed encoding of a module if and only if it is generated by the grammar.\n\nEach production of this grammar has exactly one synthesized attribute: the abstract syntax that the respective byte sequence encodes.\nThus, the attribute grammar implicitly defines a *decoding* function\n(i.e., a parsing function for the binary format).\n\nExcept for a few exceptions, the binary grammar closely mirrors the grammar of the abstract syntax.\n\n.. note::\n Some phrases of abstract syntax have multiple possible encodings in the binary format.\n For example, numbers may be encoded as if they had optional leading zeros.\n Implementations of decoders must support all possible alternatives;\n implementations of encoders can pick any allowed encoding.\n\nThe recommended extension for files containing WebAssembly modules in binary format is \":math:`\\T{.wasm}`\"\nand the recommended |MediaType|_ is \":math:`\\T{application/wasm}`\".\n\n.. [#compression]\n Additional encoding layers -- for example, introducing compression -- may be defined on top of the basic representation defined here.\n However, such layers are outside the scope of the current specification.\n\n\n.. index:: grammar notation, notation, byte\n single: binary format; grammar\n pair: binary format; notation\n.. _binary-grammar:\n\nGrammar\n~~~~~~~\n\nThe following conventions are adopted in defining grammar rules for the binary format.\nThey mirror the conventions used for :ref:`abstract syntax `.\nIn order to distinguish symbols of the binary syntax from symbols of the abstract syntax, :math:`\\mathtt{typewriter}` font is adopted for the former.\n\n* Terminal symbols are :ref:`bytes ` expressed in hexadecimal notation: :math:`\\hex{0F}`.\n\n* Nonterminal symbols are written in typewriter font: :math:`\\B{valtype}, \\B{instr}`.\n\n* :math:`B^n` is a sequence of :math:`n\\geq 0` iterations of :math:`B`.\n\n* :math:`B^\\ast` is a possibly empty sequence of iterations of :math:`B`.\n (This is a shorthand for :math:`B^n` used where :math:`n` is not relevant.)\n\n* :math:`B^?` is an optional occurrence of :math:`B`.\n (This is a shorthand for :math:`B^n` where :math:`n \\leq 1`.)\n\n* :math:`x{:}B` denotes the same language as the nonterminal :math:`B`, but also binds the variable :math:`x` to the attribute synthesized for :math:`B`.\n\n* Productions are written :math:`\\B{sym} ::= B_1 \\Rightarrow A_1 ~|~ \\dots ~|~ B_n \\Rightarrow A_n`, where each :math:`A_i` is the attribute that is synthesized for :math:`\\B{sym}` in the given case, usually from attribute variables bound in :math:`B_i`.\n\n* Some productions are augmented by side conditions in parentheses, which restrict the applicability of the production. They provide a shorthand for a combinatorial expansion of the production into many separate cases.\n\n* If the same meta variable or non-terminal symbol appears multiple times in a production (in the syntax or in an attribute), then all those occurrences must have the same instantiation.\n (This is a shorthand for a side condition requiring multiple different variables to be equal.)\n\n.. note::\n For example, the :ref:`binary grammar ` for :ref:`value types ` is given as follows:\n\n .. math::\n \\begin{array}{llcll@{\\qquad\\qquad}l}\n \\production{value types} & \\Bvaltype &::=&\n \\hex{7F} &\\Rightarrow& \\I32 \\\\ &&|&\n \\hex{7E} &\\Rightarrow& \\I64 \\\\ &&|&\n \\hex{7D} &\\Rightarrow& \\F32 \\\\ &&|&\n \\hex{7C} &\\Rightarrow& \\F64 \\\\\n \\end{array}\n\n Consequently, the byte :math:`\\hex{7F}` encodes the type |I32|,\n :math:`\\hex{7E}` encodes the type |I64|, and so forth.\n No other byte value is allowed as the encoding of a value type.\n\n The :ref:`binary grammar ` for :ref:`limits ` is defined as follows: \n\n .. math::\n \\begin{array}{llclll}\n \\production{limits} & \\Blimits &::=&\n \\hex{00}~~n{:}\\Bu32 &\\Rightarrow& \\{ \\LMIN~n, \\LMAX~\\epsilon \\} \\\\ &&|&\n \\hex{01}~~n{:}\\Bu32~~m{:}\\Bu32 &\\Rightarrow& \\{ \\LMIN~n, \\LMAX~m \\} \\\\\n \\end{array}\n\n That is, a limits pair is encoded as either the byte :math:`\\hex{00}` followed by the encoding of a |U32| value,\n or the byte :math:`\\hex{01}` followed by two such encodings. \n The variables :math:`n` and :math:`m` name the attributes of the respective |Bu32| nonterminals, which in this case are the actual :ref:`unsigned integers ` those decode into.\n The attribute of the complete production then is the abstract syntax for the limit, expressed in terms of the former values.\n\n\n.. _binary-notation:\n\nAuxiliary Notation\n~~~~~~~~~~~~~~~~~~\n\nWhen dealing with binary encodings the following notation is also used:\n\n* :math:`\\epsilon` denotes the empty byte sequence.\n\n* :math:`||B||` is the length of the byte sequence generated from the production :math:`B` in a derivation.\n\n\n.. index:: vector\n pair: binary format; vector\n.. _binary-vec:\n\nVectors\n~~~~~~~\n\n:ref:`Vectors ` are encoded with their |Bu32| length followed by the encoding of their element sequence.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{vector} & \\Bvec(\\B{B}) &::=&\n n{:}\\Bu32~~(x{:}\\B{B})^n &\\Rightarrow& x^n \\\\\n \\end{array}\n" }, { "path": "document/core/binary/index.rst", "content": ".. _binary:\n\nBinary Format\n=============\n\n.. toctree::\n :maxdepth: 2\n\n conventions\n values\n types\n instructions\n modules\n" }, { "path": "document/core/binary/instructions.rst", "content": ".. index:: instruction, ! opcode\n.. _binary-instr:\n\nInstructions\n------------\n\n:ref:`Instructions ` are encoded by *opcodes*.\nEach opcode is represented by a single byte,\nand is followed by the instruction's immediate arguments, where present.\nThe only exception are :ref:`structured control instructions `, which consist of several opcodes bracketing their nested instruction sequences.\n\n.. note::\n Gaps in the byte code ranges for encoding instructions are reserved for future extensions.\n\n\n.. index:: control instructions, structured control, label, block, branch, result type, value type, block type, label index, function index, type index, vector, polymorphism, LEB128\n pair: binary format; instruction\n pair: binary format; block type\n.. _binary-instr-control:\n\nControl Instructions\n~~~~~~~~~~~~~~~~~~~~\n\n:ref:`Control instructions ` have varying encodings. For structured instructions, the instruction sequences forming nested blocks are terminated with explicit opcodes for |END| and |ELSE|.\n\n:ref:`Block types ` are encoded in special compressed form, by either the byte :math:`\\hex{40}` indicating the empty type, as a single :ref:`value type `, or as a :ref:`type index ` encoded as a positive :ref:`signed integer `.\n\n.. _binary-blocktype:\n.. _binary-nop:\n.. _binary-unreachable:\n.. _binary-block:\n.. _binary-loop:\n.. _binary-if:\n.. _binary-br:\n.. _binary-br_if:\n.. _binary-br_table:\n.. _binary-return:\n.. _binary-call:\n.. _binary-call_indirect:\n\n.. math::\n \\begin{array}{llcllll}\n \\production{block type} & \\Bblocktype &::=&\n \\hex{40} &\\Rightarrow& \\epsilon \\\\ &&|&\n t{:}\\Bvaltype &\\Rightarrow& t \\\\ &&|&\n x{:}\\Bs33 &\\Rightarrow& x & (\\iff x \\geq 0) \\\\\n \\production{instruction} & \\Binstr &::=&\n \\hex{00} &\\Rightarrow& \\UNREACHABLE \\\\ &&|&\n \\hex{01} &\\Rightarrow& \\NOP \\\\ &&|&\n \\hex{02}~~\\X{bt}{:}\\Bblocktype~~(\\X{in}{:}\\Binstr)^\\ast~~\\hex{0B}\n &\\Rightarrow& \\BLOCK~\\X{bt}~\\X{in}^\\ast~\\END \\\\ &&|&\n \\hex{03}~~\\X{bt}{:}\\Bblocktype~~(\\X{in}{:}\\Binstr)^\\ast~~\\hex{0B}\n &\\Rightarrow& \\LOOP~\\X{bt}~\\X{in}^\\ast~\\END \\\\ &&|&\n \\hex{04}~~\\X{bt}{:}\\Bblocktype~~(\\X{in}{:}\\Binstr)^\\ast~~\\hex{0B}\n &\\Rightarrow& \\IF~\\X{bt}~\\X{in}^\\ast~\\ELSE~\\epsilon~\\END \\\\ &&|&\n \\hex{04}~~\\X{bt}{:}\\Bblocktype~~(\\X{in}_1{:}\\Binstr)^\\ast~~\n \\hex{05}~~(\\X{in}_2{:}\\Binstr)^\\ast~~\\hex{0B}\n &\\Rightarrow& \\IF~\\X{bt}~\\X{in}_1^\\ast~\\ELSE~\\X{in}_2^\\ast~\\END \\\\ &&|&\n \\hex{0C}~~l{:}\\Blabelidx &\\Rightarrow& \\BR~l \\\\ &&|&\n \\hex{0D}~~l{:}\\Blabelidx &\\Rightarrow& \\BRIF~l \\\\ &&|&\n \\hex{0E}~~l^\\ast{:}\\Bvec(\\Blabelidx)~~l_N{:}\\Blabelidx\n &\\Rightarrow& \\BRTABLE~l^\\ast~l_N \\\\ &&|&\n \\hex{0F} &\\Rightarrow& \\RETURN \\\\ &&|&\n \\hex{10}~~x{:}\\Bfuncidx &\\Rightarrow& \\CALL~x \\\\ &&|&\n \\hex{11}~~y{:}\\Btypeidx~~x{:}\\Btableidx &\\Rightarrow& \\CALLINDIRECT~x~y \\\\\n \\end{array}\n\n.. note::\n The |ELSE| opcode :math:`\\hex{05}` in the encoding of an |IF| instruction can be omitted if the following instruction sequence is empty.\n\n Unlike any :ref:`other occurrence `, the :ref:`type index ` in a :ref:`block type ` is encoded as a positive :ref:`signed integer `, so that its |SignedLEB128| bit pattern cannot collide with the encoding of :ref:`value types ` or the special code :math:`\\hex{40}`, which correspond to the LEB128 encoding of negative integers.\n To avoid any loss in the range of allowed indices, it is treated as a 33 bit signed integer. \n\n In future versions of WebAssembly, the zero byte occurring in the encoding\n of the |CALLINDIRECT| instruction may be used to index additional tables.\n\n\n.. index:: reference instruction\n pair: binary format; instruction\n.. _binary-instr-ref:\n\nReference Instructions\n~~~~~~~~~~~~~~~~~~~~~~\n\n:ref:`Reference instructions ` are represented by single byte codes.\n\n.. _binary-ref.null:\n.. _binary-ref.isnull:\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots \\\\ &&|&\n \\hex{D0}~~t{:}\\Breftype &\\Rightarrow& \\REFNULL~t \\\\ &&|&\n \\hex{D1} &\\Rightarrow& \\REFISNULL \\\\ &&|&\n \\hex{D2}~~x{:}\\Bfuncidx &\\Rightarrow& \\REFFUNC~x \\\\\n \\end{array}\n\n.. note::\n These opcode assignments are preliminary.\n\n\n.. index:: parametric instruction, value type, polymorphism\n pair: binary format; instruction\n.. _binary-instr-parametric:\n\nParametric Instructions\n~~~~~~~~~~~~~~~~~~~~~~~\n\n:ref:`Parametric instructions ` are represented by single byte codes, possibly followed by a type annotation.\n\n.. _binary-drop:\n.. _binary-select:\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots \\\\ &&|&\n \\hex{1A} &\\Rightarrow& \\DROP \\\\ &&|&\n \\hex{1B} &\\Rightarrow& \\SELECT \\\\ &&|&\n \\hex{1C}~~t^\\ast{:}\\Bvec(\\Bvaltype) &\\Rightarrow& \\SELECT~t^\\ast \\\\\n \\end{array}\n\n\n.. index:: variable instructions, local index, global index\n pair: binary format; instruction\n.. _binary-instr-variable:\n\nVariable Instructions\n~~~~~~~~~~~~~~~~~~~~~\n\n:ref:`Variable instructions ` are represented by byte codes followed by the encoding of the respective :ref:`index `.\n\n.. _binary-local.get:\n.. _binary-local.set:\n.. _binary-local.tee:\n.. _binary-global.get:\n.. _binary-global.set:\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots \\\\ &&|&\n \\hex{20}~~x{:}\\Blocalidx &\\Rightarrow& \\LOCALGET~x \\\\ &&|&\n \\hex{21}~~x{:}\\Blocalidx &\\Rightarrow& \\LOCALSET~x \\\\ &&|&\n \\hex{22}~~x{:}\\Blocalidx &\\Rightarrow& \\LOCALTEE~x \\\\ &&|&\n \\hex{23}~~x{:}\\Bglobalidx &\\Rightarrow& \\GLOBALGET~x \\\\ &&|&\n \\hex{24}~~x{:}\\Bglobalidx &\\Rightarrow& \\GLOBALSET~x \\\\\n \\end{array}\n\n\n.. index:: table instruction, table index\n pair: binary format; instruction\n.. _binary-instr-table:\n.. _binary-table.get:\n.. _binary-table.set:\n.. _binary-table.size:\n.. _binary-table.grow:\n.. _binary-table.fill:\n.. _binary-table.copy:\n.. _binary-table.init:\n.. _binary-elem.drop:\n\nTable Instructions\n~~~~~~~~~~~~~~~~~~\n\n:ref:`Table instructions ` are represented by either single byte or two byte codes.\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots \\\\ &&|&\n \\hex{25}~~x{:}\\Btableidx &\\Rightarrow& \\TABLEGET~x \\\\ &&|&\n \\hex{26}~~x{:}\\Btableidx &\\Rightarrow& \\TABLESET~x \\\\ &&|&\n \\hex{FC}~~12{:}\\Bu32~~y{:}\\Belemidx~~x{:}\\Btableidx &\\Rightarrow& \\TABLEINIT~x~y \\\\ &&|&\n \\hex{FC}~~13{:}\\Bu32~~x{:}\\Belemidx &\\Rightarrow& \\ELEMDROP~x \\\\ &&|&\n \\hex{FC}~~14{:}\\Bu32~~x{:}\\Btableidx~~y{:}\\Btableidx &\\Rightarrow& \\TABLECOPY~x~y \\\\ &&|&\n \\hex{FC}~~15{:}\\Bu32~~x{:}\\Btableidx &\\Rightarrow& \\TABLEGROW~x \\\\ &&|&\n \\hex{FC}~~16{:}\\Bu32~~x{:}\\Btableidx &\\Rightarrow& \\TABLESIZE~x \\\\ &&|&\n \\hex{FC}~~17{:}\\Bu32~~x{:}\\Btableidx &\\Rightarrow& \\TABLEFILL~x \\\\\n \\end{array}\n\n\n.. index:: memory instruction, memory index\n pair: binary format; instruction\n.. _binary-instr-memory:\n\nMemory Instructions\n~~~~~~~~~~~~~~~~~~~\n\nEach variant of :ref:`memory instruction ` is encoded with a different byte code. Loads and stores are followed by the encoding of their |memarg| immediate.\n\n.. _binary-memarg:\n.. _binary-load:\n.. _binary-loadn:\n.. _binary-store:\n.. _binary-storen:\n.. _binary-memory.size:\n.. _binary-memory.grow:\n.. _binary-memory.fill:\n.. _binary-memory.copy:\n.. _binary-memory.init:\n.. _binary-data.drop:\n\n.. math::\n \\begin{array}{llclll}\n \\production{memory argument} & \\Bmemarg &::=&\n a{:}\\Bu32~~o{:}\\Bu32 &\\Rightarrow& \\{ \\ALIGN~a,~\\OFFSET~o \\} \\\\\n \\production{instruction} & \\Binstr &::=& \\dots \\\\ &&|&\n \\hex{28}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\LOAD~m \\\\ &&|&\n \\hex{29}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD~m \\\\ &&|&\n \\hex{2A}~~m{:}\\Bmemarg &\\Rightarrow& \\F32.\\LOAD~m \\\\ &&|&\n \\hex{2B}~~m{:}\\Bmemarg &\\Rightarrow& \\F64.\\LOAD~m \\\\ &&|&\n \\hex{2C}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\LOAD\\K{8\\_s}~m \\\\ &&|&\n \\hex{2D}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\LOAD\\K{8\\_u}~m \\\\ &&|&\n \\hex{2E}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\LOAD\\K{16\\_s}~m \\\\ &&|&\n \\hex{2F}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\LOAD\\K{16\\_u}~m \\\\ &&|&\n \\hex{30}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD\\K{8\\_s}~m \\\\ &&|&\n \\hex{31}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD\\K{8\\_u}~m \\\\ &&|&\n \\hex{32}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD\\K{16\\_s}~m \\\\ &&|&\n \\hex{33}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD\\K{16\\_u}~m \\\\ &&|&\n \\hex{34}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD\\K{32\\_s}~m \\\\ &&|&\n \\hex{35}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\LOAD\\K{32\\_u}~m \\\\ &&|&\n \\hex{36}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\STORE~m \\\\ &&|&\n \\hex{37}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\STORE~m \\\\ &&|&\n \\hex{38}~~m{:}\\Bmemarg &\\Rightarrow& \\F32.\\STORE~m \\\\ &&|&\n \\hex{39}~~m{:}\\Bmemarg &\\Rightarrow& \\F64.\\STORE~m \\\\ &&|&\n \\hex{3A}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\STORE\\K{8}~m \\\\ &&|&\n \\hex{3B}~~m{:}\\Bmemarg &\\Rightarrow& \\I32.\\STORE\\K{16}~m \\\\ &&|&\n \\hex{3C}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\STORE\\K{8}~m \\\\ &&|&\n \\hex{3D}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\STORE\\K{16}~m \\\\ &&|&\n \\hex{3E}~~m{:}\\Bmemarg &\\Rightarrow& \\I64.\\STORE\\K{32}~m \\\\ &&|&\n \\hex{3F}~~\\hex{00} &\\Rightarrow& \\MEMORYSIZE \\\\ &&|&\n \\hex{40}~~\\hex{00} &\\Rightarrow& \\MEMORYGROW \\\\ &&|&\n \\hex{FC}~~8{:}\\Bu32~~x{:}\\Bdataidx~\\hex{00} &\\Rightarrow& \\MEMORYINIT~x \\\\ &&|&\n \\hex{FC}~~9{:}\\Bu32~~x{:}\\Bdataidx &\\Rightarrow& \\DATADROP~x \\\\ &&|&\n \\hex{FC}~~10{:}\\Bu32~~\\hex{00}~~\\hex{00} &\\Rightarrow& \\MEMORYCOPY \\\\ &&|&\n \\hex{FC}~~11{:}\\Bu32~~\\hex{00} &\\Rightarrow& \\MEMORYFILL \\\\\n \\end{array}\n\n.. note::\n In future versions of WebAssembly, the additional zero bytes occurring in the encoding of the |MEMORYSIZE|, |MEMORYGROW|, |MEMORYCOPY|, and |MEMORYFILL| instructions may be used to index additional memories.\n\n\n.. index:: numeric instruction\n pair: binary format; instruction\n.. _binary-instr-numeric:\n\nNumeric Instructions\n~~~~~~~~~~~~~~~~~~~~\n\nAll variants of :ref:`numeric instructions ` are represented by separate byte codes.\n\nThe |CONST| instructions are followed by the respective literal.\n\n.. _binary-const:\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots \\\\&&|&\n \\hex{41}~~n{:}\\Bi32 &\\Rightarrow& \\I32.\\CONST~n \\\\ &&|&\n \\hex{42}~~n{:}\\Bi64 &\\Rightarrow& \\I64.\\CONST~n \\\\ &&|&\n \\hex{43}~~z{:}\\Bf32 &\\Rightarrow& \\F32.\\CONST~z \\\\ &&|&\n \\hex{44}~~z{:}\\Bf64 &\\Rightarrow& \\F64.\\CONST~z \\\\\n \\end{array}\n\nAll other numeric instructions are plain opcodes without any immediates.\n\n.. _binary-testop:\n.. _binary-relop:\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots && \\phantom{thisshouldbeenough} \\\\&&|&\n \\hex{45} &\\Rightarrow& \\I32.\\EQZ \\\\ &&|&\n \\hex{46} &\\Rightarrow& \\I32.\\EQ \\\\ &&|&\n \\hex{47} &\\Rightarrow& \\I32.\\NE \\\\ &&|&\n \\hex{48} &\\Rightarrow& \\I32.\\LT\\K{\\_s} \\\\ &&|&\n \\hex{49} &\\Rightarrow& \\I32.\\LT\\K{\\_u} \\\\ &&|&\n \\hex{4A} &\\Rightarrow& \\I32.\\GT\\K{\\_s} \\\\ &&|&\n \\hex{4B} &\\Rightarrow& \\I32.\\GT\\K{\\_u} \\\\ &&|&\n \\hex{4C} &\\Rightarrow& \\I32.\\LE\\K{\\_s} \\\\ &&|&\n \\hex{4D} &\\Rightarrow& \\I32.\\LE\\K{\\_u} \\\\ &&|&\n \\hex{4E} &\\Rightarrow& \\I32.\\GE\\K{\\_s} \\\\ &&|&\n \\hex{4F} &\\Rightarrow& \\I32.\\GE\\K{\\_u} \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{50} &\\Rightarrow& \\I64.\\EQZ \\\\ &&|&\n \\hex{51} &\\Rightarrow& \\I64.\\EQ \\\\ &&|&\n \\hex{52} &\\Rightarrow& \\I64.\\NE \\\\ &&|&\n \\hex{53} &\\Rightarrow& \\I64.\\LT\\K{\\_s} \\\\ &&|&\n \\hex{54} &\\Rightarrow& \\I64.\\LT\\K{\\_u} \\\\ &&|&\n \\hex{55} &\\Rightarrow& \\I64.\\GT\\K{\\_s} \\\\ &&|&\n \\hex{56} &\\Rightarrow& \\I64.\\GT\\K{\\_u} \\\\ &&|&\n \\hex{57} &\\Rightarrow& \\I64.\\LE\\K{\\_s} \\\\ &&|&\n \\hex{58} &\\Rightarrow& \\I64.\\LE\\K{\\_u} \\\\ &&|&\n \\hex{59} &\\Rightarrow& \\I64.\\GE\\K{\\_s} \\\\ &&|&\n \\hex{5A} &\\Rightarrow& \\I64.\\GE\\K{\\_u} \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{5B} &\\Rightarrow& \\F32.\\EQ \\\\ &&|&\n \\hex{5C} &\\Rightarrow& \\F32.\\NE \\\\ &&|&\n \\hex{5D} &\\Rightarrow& \\F32.\\LT \\\\ &&|&\n \\hex{5E} &\\Rightarrow& \\F32.\\GT \\\\ &&|&\n \\hex{5F} &\\Rightarrow& \\F32.\\LE \\\\ &&|&\n \\hex{60} &\\Rightarrow& \\F32.\\GE \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{61} &\\Rightarrow& \\F64.\\EQ \\\\ &&|&\n \\hex{62} &\\Rightarrow& \\F64.\\NE \\\\ &&|&\n \\hex{63} &\\Rightarrow& \\F64.\\LT \\\\ &&|&\n \\hex{64} &\\Rightarrow& \\F64.\\GT \\\\ &&|&\n \\hex{65} &\\Rightarrow& \\F64.\\LE \\\\ &&|&\n \\hex{66} &\\Rightarrow& \\F64.\\GE \\\\\n \\end{array}\n\n.. _binary-unop:\n.. _binary-binop:\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{67} &\\Rightarrow& \\I32.\\CLZ \\\\ &&|&\n \\hex{68} &\\Rightarrow& \\I32.\\CTZ \\\\ &&|&\n \\hex{69} &\\Rightarrow& \\I32.\\POPCNT \\\\ &&|&\n \\hex{6A} &\\Rightarrow& \\I32.\\ADD \\\\ &&|&\n \\hex{6B} &\\Rightarrow& \\I32.\\SUB \\\\ &&|&\n \\hex{6C} &\\Rightarrow& \\I32.\\MUL \\\\ &&|&\n \\hex{6D} &\\Rightarrow& \\I32.\\DIV\\K{\\_s} \\\\ &&|&\n \\hex{6E} &\\Rightarrow& \\I32.\\DIV\\K{\\_u} \\\\ &&|&\n \\hex{6F} &\\Rightarrow& \\I32.\\REM\\K{\\_s} \\\\ &&|&\n \\hex{70} &\\Rightarrow& \\I32.\\REM\\K{\\_u} \\\\ &&|&\n \\hex{71} &\\Rightarrow& \\I32.\\AND \\\\ &&|&\n \\hex{72} &\\Rightarrow& \\I32.\\OR \\\\ &&|&\n \\hex{73} &\\Rightarrow& \\I32.\\XOR \\\\ &&|&\n \\hex{74} &\\Rightarrow& \\I32.\\SHL \\\\ &&|&\n \\hex{75} &\\Rightarrow& \\I32.\\SHR\\K{\\_s} \\\\ &&|&\n \\hex{76} &\\Rightarrow& \\I32.\\SHR\\K{\\_u} \\\\ &&|&\n \\hex{77} &\\Rightarrow& \\I32.\\ROTL \\\\ &&|&\n \\hex{78} &\\Rightarrow& \\I32.\\ROTR \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{79} &\\Rightarrow& \\I64.\\CLZ \\\\ &&|&\n \\hex{7A} &\\Rightarrow& \\I64.\\CTZ \\\\ &&|&\n \\hex{7B} &\\Rightarrow& \\I64.\\POPCNT \\\\ &&|&\n \\hex{7C} &\\Rightarrow& \\I64.\\ADD \\\\ &&|&\n \\hex{7D} &\\Rightarrow& \\I64.\\SUB \\\\ &&|&\n \\hex{7E} &\\Rightarrow& \\I64.\\MUL \\\\ &&|&\n \\hex{7F} &\\Rightarrow& \\I64.\\DIV\\K{\\_s} \\\\ &&|&\n \\hex{80} &\\Rightarrow& \\I64.\\DIV\\K{\\_u} \\\\ &&|&\n \\hex{81} &\\Rightarrow& \\I64.\\REM\\K{\\_s} \\\\ &&|&\n \\hex{82} &\\Rightarrow& \\I64.\\REM\\K{\\_u} \\\\ &&|&\n \\hex{83} &\\Rightarrow& \\I64.\\AND \\\\ &&|&\n \\hex{84} &\\Rightarrow& \\I64.\\OR \\\\ &&|&\n \\hex{85} &\\Rightarrow& \\I64.\\XOR \\\\ &&|&\n \\hex{86} &\\Rightarrow& \\I64.\\SHL \\\\ &&|&\n \\hex{87} &\\Rightarrow& \\I64.\\SHR\\K{\\_s} \\\\ &&|&\n \\hex{88} &\\Rightarrow& \\I64.\\SHR\\K{\\_u} \\\\ &&|&\n \\hex{89} &\\Rightarrow& \\I64.\\ROTL \\\\ &&|&\n \\hex{8A} &\\Rightarrow& \\I64.\\ROTR \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{8B} &\\Rightarrow& \\F32.\\ABS \\\\ &&|&\n \\hex{8C} &\\Rightarrow& \\F32.\\NEG \\\\ &&|&\n \\hex{8D} &\\Rightarrow& \\F32.\\CEIL \\\\ &&|&\n \\hex{8E} &\\Rightarrow& \\F32.\\FLOOR \\\\ &&|&\n \\hex{8F} &\\Rightarrow& \\F32.\\TRUNC \\\\ &&|&\n \\hex{90} &\\Rightarrow& \\F32.\\NEAREST \\\\ &&|&\n \\hex{91} &\\Rightarrow& \\F32.\\SQRT \\\\ &&|&\n \\hex{92} &\\Rightarrow& \\F32.\\ADD \\\\ &&|&\n \\hex{93} &\\Rightarrow& \\F32.\\SUB \\\\ &&|&\n \\hex{94} &\\Rightarrow& \\F32.\\MUL \\\\ &&|&\n \\hex{95} &\\Rightarrow& \\F32.\\DIV \\\\ &&|&\n \\hex{96} &\\Rightarrow& \\F32.\\FMIN \\\\ &&|&\n \\hex{97} &\\Rightarrow& \\F32.\\FMAX \\\\ &&|&\n \\hex{98} &\\Rightarrow& \\F32.\\COPYSIGN \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{99} &\\Rightarrow& \\F64.\\ABS \\\\ &&|&\n \\hex{9A} &\\Rightarrow& \\F64.\\NEG \\\\ &&|&\n \\hex{9B} &\\Rightarrow& \\F64.\\CEIL \\\\ &&|&\n \\hex{9C} &\\Rightarrow& \\F64.\\FLOOR \\\\ &&|&\n \\hex{9D} &\\Rightarrow& \\F64.\\TRUNC \\\\ &&|&\n \\hex{9E} &\\Rightarrow& \\F64.\\NEAREST \\\\ &&|&\n \\hex{9F} &\\Rightarrow& \\F64.\\SQRT \\\\ &&|&\n \\hex{A0} &\\Rightarrow& \\F64.\\ADD \\\\ &&|&\n \\hex{A1} &\\Rightarrow& \\F64.\\SUB \\\\ &&|&\n \\hex{A2} &\\Rightarrow& \\F64.\\MUL \\\\ &&|&\n \\hex{A3} &\\Rightarrow& \\F64.\\DIV \\\\ &&|&\n \\hex{A4} &\\Rightarrow& \\F64.\\FMIN \\\\ &&|&\n \\hex{A5} &\\Rightarrow& \\F64.\\FMAX \\\\ &&|&\n \\hex{A6} &\\Rightarrow& \\F64.\\COPYSIGN \\\\\n \\end{array}\n\n.. _binary-cvtop:\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{A7} &\\Rightarrow& \\I32.\\WRAP\\K{\\_}\\I64 \\\\ &&|&\n \\hex{A8} &\\Rightarrow& \\I32.\\TRUNC\\K{\\_}\\F32\\K{\\_s} \\\\ &&|&\n \\hex{A9} &\\Rightarrow& \\I32.\\TRUNC\\K{\\_}\\F32\\K{\\_u} \\\\ &&|&\n \\hex{AA} &\\Rightarrow& \\I32.\\TRUNC\\K{\\_}\\F64\\K{\\_s} \\\\ &&|&\n \\hex{AB} &\\Rightarrow& \\I32.\\TRUNC\\K{\\_}\\F64\\K{\\_u} \\\\ &&|&\n \\hex{AC} &\\Rightarrow& \\I64.\\EXTEND\\K{\\_}\\I32\\K{\\_s} \\\\ &&|&\n \\hex{AD} &\\Rightarrow& \\I64.\\EXTEND\\K{\\_}\\I32\\K{\\_u} \\\\ &&|&\n \\hex{AE} &\\Rightarrow& \\I64.\\TRUNC\\K{\\_}\\F32\\K{\\_s} \\\\ &&|&\n \\hex{AF} &\\Rightarrow& \\I64.\\TRUNC\\K{\\_}\\F32\\K{\\_u} \\\\ &&|&\n \\hex{B0} &\\Rightarrow& \\I64.\\TRUNC\\K{\\_}\\F64\\K{\\_s} \\\\ &&|&\n \\hex{B1} &\\Rightarrow& \\I64.\\TRUNC\\K{\\_}\\F64\\K{\\_u} \\\\ &&|&\n \\hex{B2} &\\Rightarrow& \\F32.\\CONVERT\\K{\\_}\\I32\\K{\\_s} \\\\ &&|&\n \\hex{B3} &\\Rightarrow& \\F32.\\CONVERT\\K{\\_}\\I32\\K{\\_u} \\\\ &&|&\n \\hex{B4} &\\Rightarrow& \\F32.\\CONVERT\\K{\\_}\\I64\\K{\\_s} \\\\ &&|&\n \\hex{B5} &\\Rightarrow& \\F32.\\CONVERT\\K{\\_}\\I64\\K{\\_u} \\\\ &&|&\n \\hex{B6} &\\Rightarrow& \\F32.\\DEMOTE\\K{\\_}\\F64 \\\\ &&|&\n \\hex{B7} &\\Rightarrow& \\F64.\\CONVERT\\K{\\_}\\I32\\K{\\_s} \\\\ &&|&\n \\hex{B8} &\\Rightarrow& \\F64.\\CONVERT\\K{\\_}\\I32\\K{\\_u} \\\\ &&|&\n \\hex{B9} &\\Rightarrow& \\F64.\\CONVERT\\K{\\_}\\I64\\K{\\_s} \\\\ &&|&\n \\hex{BA} &\\Rightarrow& \\F64.\\CONVERT\\K{\\_}\\I64\\K{\\_u} \\\\ &&|&\n \\hex{BB} &\\Rightarrow& \\F64.\\PROMOTE\\K{\\_}\\F32 \\\\ &&|&\n \\hex{BC} &\\Rightarrow& \\I32.\\REINTERPRET\\K{\\_}\\F32 \\\\ &&|&\n \\hex{BD} &\\Rightarrow& \\I64.\\REINTERPRET\\K{\\_}\\F64 \\\\ &&|&\n \\hex{BE} &\\Rightarrow& \\F32.\\REINTERPRET\\K{\\_}\\I32 \\\\ &&|&\n \\hex{BF} &\\Rightarrow& \\F64.\\REINTERPRET\\K{\\_}\\I64 \\\\\n \\end{array}\n\n.. math::\n \\begin{array}{llclll}\n \\phantom{\\production{instruction}} & \\phantom{\\Binstr} &\\phantom{::=}& \\phantom{\\dots} && \\phantom{thisshouldbeenough} \\\\[-2ex] &&|&\n \\hex{C0} &\\Rightarrow& \\I32.\\EXTEND\\K{8\\_s} \\\\ &&|&\n \\hex{C1} &\\Rightarrow& \\I32.\\EXTEND\\K{16\\_s} \\\\ &&|&\n \\hex{C2} &\\Rightarrow& \\I64.\\EXTEND\\K{8\\_s} \\\\ &&|&\n \\hex{C3} &\\Rightarrow& \\I64.\\EXTEND\\K{16\\_s} \\\\ &&|&\n \\hex{C4} &\\Rightarrow& \\I64.\\EXTEND\\K{32\\_s} \\\\\n \\end{array}\n\n.. _binary-cvtop-trunc-sat:\n\nThe saturating truncation instructions all have a one byte prefix,\nwhereas the actual opcode is encoded by a variable-length :ref:`unsigned integer `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{instruction} & \\Binstr &::=& \\dots && \\phantom{thisshouldbeenough} \\\\&&|&\n \\hex{FC}~~0{:}\\Bu32 &\\Rightarrow& \\I32.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_s} \\\\ &&|&\n \\hex{FC}~~1{:}\\Bu32 &\\Rightarrow& \\I32.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_u} \\\\ &&|&\n \\hex{FC}~~2{:}\\Bu32 &\\Rightarrow& \\I32.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_s} \\\\ &&|&\n \\hex{FC}~~3{:}\\Bu32 &\\Rightarrow& \\I32.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_u} \\\\ &&|&\n \\hex{FC}~~4{:}\\Bu32 &\\Rightarrow& \\I64.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_s} \\\\ &&|&\n \\hex{FC}~~5{:}\\Bu32 &\\Rightarrow& \\I64.\\TRUNC\\K{\\_sat\\_}\\F32\\K{\\_u} \\\\ &&|&\n \\hex{FC}~~6{:}\\Bu32 &\\Rightarrow& \\I64.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_s} \\\\ &&|&\n \\hex{FC}~~7{:}\\Bu32 &\\Rightarrow& \\I64.\\TRUNC\\K{\\_sat\\_}\\F64\\K{\\_u} \\\\\n \\end{array}\n\n\n.. index:: expression\n pair: binary format; expression\n single: expression; constant\n.. _binary-expr:\n\nExpressions\n~~~~~~~~~~~\n\n:ref:`Expressions ` are encoded by their instruction sequence terminated with an explicit :math:`\\hex{0B}` opcode for |END|.\n\n.. math::\n \\begin{array}{llclll}\n \\production{expression} & \\Bexpr &::=&\n (\\X{in}{:}\\Binstr)^\\ast~~\\hex{0B} &\\Rightarrow& \\X{in}^\\ast~\\END \\\\\n \\end{array}\n" }, { "path": "document/core/binary/modules.rst", "content": "Modules\n-------\n\nThe binary encoding of modules is organized into *sections*.\nMost sections correspond to one component of a :ref:`module ` record,\nexcept that :ref:`function definitions ` are split into two sections, separating their type declarations in the :ref:`function section ` from their bodies in the :ref:`code section `.\n\n.. note::\n This separation enables *parallel* and *streaming* compilation of the functions in a module.\n\n\n.. index:: index, type index, function index, table index, memory index, global index, element index, data index, local index, label index\n pair: binary format; type index\n pair: binary format; function index\n pair: binary format; table index\n pair: binary format; memory index\n pair: binary format; global index\n pair: binary format; element index\n pair: binary format; data index\n pair: binary format; local index\n pair: binary format; label index\n.. _binary-typeidx:\n.. _binary-funcidx:\n.. _binary-tableidx:\n.. _binary-memidx:\n.. _binary-globalidx:\n.. _binary-elemidx:\n.. _binary-dataidx:\n.. _binary-localidx:\n.. _binary-labelidx:\n.. _binary-index:\n\nIndices\n~~~~~~~\n\nAll :ref:`indices ` are encoded with their respective value.\n\n.. math::\n \\begin{array}{llclll}\n \\production{type index} & \\Btypeidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{function index} & \\Bfuncidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{table index} & \\Btableidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{memory index} & \\Bmemidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{global index} & \\Bglobalidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{element index} & \\Belemidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{data index} & \\Bdataidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{local index} & \\Blocalidx &::=& x{:}\\Bu32 &\\Rightarrow& x \\\\\n \\production{label index} & \\Blabelidx &::=& l{:}\\Bu32 &\\Rightarrow& l \\\\\n \\end{array}\n\n\n.. index:: ! section\n pair: binary format; section\n.. _binary-section:\n\nSections\n~~~~~~~~\n\nEach section consists of\n\n* a one-byte section *id*,\n* the |U32| *size* of the contents, in bytes,\n* the actual *contents*, whose structure is depended on the section id.\n\nEvery section is optional; an omitted section is equivalent to the section being present with empty contents.\n\nThe following parameterized grammar rule defines the generic structure of a section with id :math:`N` and contents described by the grammar :math:`\\B{B}`.\n\n.. math::\n \\begin{array}{llclll@{\\qquad}l}\n \\production{section} & \\Bsection_N(\\B{B}) &::=&\n N{:}\\Bbyte~~\\X{size}{:}\\Bu32~~\\X{cont}{:}\\B{B}\n &\\Rightarrow& \\X{cont} & (\\iff \\X{size} = ||\\B{B}||) \\\\ &&|&\n \\epsilon &\\Rightarrow& \\epsilon\n \\end{array}\n\nFor most sections, the contents :math:`\\B{B}` encodes a :ref:`vector `.\nIn these cases, the empty result :math:`\\epsilon` is interpreted as the empty vector.\n\n.. note::\n Other than for unknown :ref:`custom sections `,\n the :math:`\\X{size}` is not required for decoding, but can be used to skip sections when navigating through a binary.\n The module is malformed if the size does not match the length of the binary contents :math:`\\B{B}`.\n\nThe following section ids are used:\n\n== ===============================================\nId Section \n== ===============================================\n 0 :ref:`custom section ` \n 1 :ref:`type section ` \n 2 :ref:`import section ` \n 3 :ref:`function section ` \n 4 :ref:`table section ` \n 5 :ref:`memory section ` \n 6 :ref:`global section ` \n 7 :ref:`export section ` \n 8 :ref:`start section ` \n 9 :ref:`element section ` \n10 :ref:`code section ` \n11 :ref:`data section ` \n12 :ref:`data count section `\n== ===============================================\n\n\n.. index:: ! custom section\n pair: binary format; custom section\n single: section; custom\n.. _binary-customsec:\n\nCustom Section\n~~~~~~~~~~~~~~\n\n*Custom sections* have the id 0.\nThey are intended to be used for debugging information or third-party extensions, and are ignored by the WebAssembly semantics.\nTheir contents consist of a :ref:`name ` further identifying the custom section, followed by an uninterpreted sequence of bytes for custom use.\n\n.. math::\n \\begin{array}{llclll}\n \\production{custom section} & \\Bcustomsec &::=&\n \\Bsection_0(\\Bcustom) \\\\\n \\production{custom data} & \\Bcustom &::=&\n \\Bname~~\\Bbyte^\\ast \\\\\n \\end{array}\n\n.. note::\n If an implementation interprets the data of a custom section, then errors in that data, or the placement of the section, must not invalidate the module.\n\n\n.. index:: ! type section, type definition\n pair: binary format; type section\n pair: section; type\n.. _binary-typedef:\n.. _binary-typesec:\n\nType Section\n~~~~~~~~~~~~\n\nThe *type section* has the id 1.\nIt decodes into a vector of :ref:`function types ` that represent the |MTYPES| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{type section} & \\Btypesec &::=&\n \\X{ft}^\\ast{:\\,}\\Bsection_1(\\Bvec(\\Bfunctype)) &\\Rightarrow& \\X{ft}^\\ast \\\\\n \\end{array}\n\n\n.. index:: ! import section, import, name, function type, table type, memory type, global type\n pair: binary format; import\n pair: section; import\n.. _binary-import:\n.. _binary-importdesc:\n.. _binary-importsec:\n\nImport Section\n~~~~~~~~~~~~~~\n\nThe *import section* has the id 2.\nIt decodes into a vector of :ref:`imports ` that represent the |MIMPORTS| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{import section} & \\Bimportsec &::=&\n \\X{im}^\\ast{:}\\Bsection_2(\\Bvec(\\Bimport)) &\\Rightarrow& \\X{im}^\\ast \\\\\n \\production{import} & \\Bimport &::=&\n \\X{mod}{:}\\Bname~~\\X{nm}{:}\\Bname~~d{:}\\Bimportdesc\n &\\Rightarrow& \\{ \\IMODULE~\\X{mod}, \\INAME~\\X{nm}, \\IDESC~d \\} \\\\\n \\production{import description} & \\Bimportdesc &::=&\n \\hex{00}~~x{:}\\Btypeidx &\\Rightarrow& \\IDFUNC~x \\\\ &&|&\n \\hex{01}~~\\X{tt}{:}\\Btabletype &\\Rightarrow& \\IDTABLE~\\X{tt} \\\\ &&|&\n \\hex{02}~~\\X{mt}{:}\\Bmemtype &\\Rightarrow& \\IDMEM~\\X{mt} \\\\ &&|&\n \\hex{03}~~\\X{gt}{:}\\Bglobaltype &\\Rightarrow& \\IDGLOBAL~\\X{gt} \\\\\n \\end{array}\n\n\n.. index:: ! function section, function, type index, function type\n pair: binary format; function\n pair: section; function\n.. _binary-funcsec:\n\nFunction Section\n~~~~~~~~~~~~~~~~\n\nThe *function section* has the id 3.\nIt decodes into a vector of :ref:`type indices ` that represent the |FTYPE| fields of the :ref:`functions ` in the |MFUNCS| component of a :ref:`module `.\nThe |FLOCALS| and |FBODY| fields of the respective functions are encoded separately in the :ref:`code section `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{function section} & \\Bfuncsec &::=&\n x^\\ast{:}\\Bsection_3(\\Bvec(\\Btypeidx)) &\\Rightarrow& x^\\ast \\\\\n \\end{array}\n\n\n.. index:: ! table section, table, table type\n pair: binary format; table\n pair: section; table\n.. _binary-table:\n.. _binary-tablesec:\n\nTable Section\n~~~~~~~~~~~~~\n\nThe *table section* has the id 4.\nIt decodes into a vector of :ref:`tables ` that represent the |MTABLES| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{table section} & \\Btablesec &::=&\n \\X{tab}^\\ast{:}\\Bsection_4(\\Bvec(\\Btable)) &\\Rightarrow& \\X{tab}^\\ast \\\\\n \\production{table} & \\Btable &::=&\n \\X{tt}{:}\\Btabletype &\\Rightarrow& \\{ \\TTYPE~\\X{tt} \\} \\\\\n \\end{array}\n\n\n.. index:: ! memory section, memory, memory type\n pair: binary format; memory\n pair: section; memory\n.. _binary-mem:\n.. _binary-memsec:\n\nMemory Section\n~~~~~~~~~~~~~~\n\nThe *memory section* has the id 5.\nIt decodes into a vector of :ref:`memories ` that represent the |MMEMS| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{memory section} & \\Bmemsec &::=&\n \\X{mem}^\\ast{:}\\Bsection_5(\\Bvec(\\Bmem)) &\\Rightarrow& \\X{mem}^\\ast \\\\\n \\production{memory} & \\Bmem &::=&\n \\X{mt}{:}\\Bmemtype &\\Rightarrow& \\{ \\MTYPE~\\X{mt} \\} \\\\\n \\end{array}\n\n\n.. index:: ! global section, global, global type, expression\n pair: binary format; global\n pair: section; global\n.. _binary-global:\n.. _binary-globalsec:\n\nGlobal Section\n~~~~~~~~~~~~~~\n\nThe *global section* has the id 6.\nIt decodes into a vector of :ref:`globals ` that represent the |MGLOBALS| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{global section} & \\Bglobalsec &::=&\n \\X{glob}^\\ast{:}\\Bsection_6(\\Bvec(\\Bglobal)) &\\Rightarrow& \\X{glob}^\\ast \\\\\n \\production{global} & \\Bglobal &::=&\n \\X{gt}{:}\\Bglobaltype~~e{:}\\Bexpr\n &\\Rightarrow& \\{ \\GTYPE~\\X{gt}, \\GINIT~e \\} \\\\\n \\end{array}\n\n\n.. index:: ! export section, export, name, index, function index, table index, memory index, global index\n pair: binary format; export\n pair: section; export\n.. _binary-export:\n.. _binary-exportdesc:\n.. _binary-exportsec:\n\nExport Section\n~~~~~~~~~~~~~~\n\nThe *export section* has the id 7.\nIt decodes into a vector of :ref:`exports ` that represent the |MEXPORTS| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{export section} & \\Bexportsec &::=&\n \\X{ex}^\\ast{:}\\Bsection_7(\\Bvec(\\Bexport)) &\\Rightarrow& \\X{ex}^\\ast \\\\\n \\production{export} & \\Bexport &::=&\n \\X{nm}{:}\\Bname~~d{:}\\Bexportdesc\n &\\Rightarrow& \\{ \\ENAME~\\X{nm}, \\EDESC~d \\} \\\\\n \\production{export description} & \\Bexportdesc &::=&\n \\hex{00}~~x{:}\\Bfuncidx &\\Rightarrow& \\EDFUNC~x \\\\ &&|&\n \\hex{01}~~x{:}\\Btableidx &\\Rightarrow& \\EDTABLE~x \\\\ &&|&\n \\hex{02}~~x{:}\\Bmemidx &\\Rightarrow& \\EDMEM~x \\\\ &&|&\n \\hex{03}~~x{:}\\Bglobalidx &\\Rightarrow& \\EDGLOBAL~x \\\\\n \\end{array}\n\n\n.. index:: ! start section, start function, function index\n pair: binary format; start function\n single: section; start\n single: start function; section\n.. _binary-start:\n.. _binary-startsec:\n\nStart Section\n~~~~~~~~~~~~~\n\nThe *start section* has the id 8.\nIt decodes into an optional :ref:`start function ` that represents the |MSTART| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{start section} & \\Bstartsec &::=&\n \\X{st}^?{:}\\Bsection_8(\\Bstart) &\\Rightarrow& \\X{st}^? \\\\\n \\production{start function} & \\Bstart &::=&\n x{:}\\Bfuncidx &\\Rightarrow& \\{ \\SFUNC~x \\} \\\\\n \\end{array}\n\n\n.. index:: ! element section, element, table index, expression, function index\n pair: binary format; element\n pair: section; element\n single: table; element\n single: element; segment\n.. _binary-elem:\n.. _binary-elemsec:\n.. _binary-elemkind:\n\nElement Section\n~~~~~~~~~~~~~~~\n\nThe *element section* has the id 9.\nIt decodes into a vector of :ref:`element segments ` that represent the |MELEMS| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{element section} & \\Belemsec &::=&\n \\X{seg}^\\ast{:}\\Bsection_9(\\Bvec(\\Belem)) &\\Rightarrow& \\X{seg} \\\\\n \\production{element segment} & \\Belem &::=&\n \\hex{00}~~e{:}\\Bexpr~~y^\\ast{:}\\Bvec(\\Bfuncidx)\n &\\Rightarrow& \\{ \\ETYPE~\\FUNCREF, \\EINIT~((\\REFFUNC~y)~\\END)^\\ast, \\EMODE~\\EACTIVE~\\{ \\ETABLE~0, \\EOFFSET~e \\} \\} \\\\ &&|&\n \\hex{01}~~\\X{et}:\\Belemkind~~y^\\ast{:}\\Bvec(\\Bfuncidx)\n &\\Rightarrow& \\{ \\ETYPE~\\X{et}, \\EINIT~((\\REFFUNC~y)~\\END)^\\ast, \\EMODE~\\EPASSIVE \\} \\\\ &&|&\n \\hex{02}~~x{:}\\Btableidx~~e{:}\\Bexpr~~\\X{et}:\\Belemkind~~y^\\ast{:}\\Bvec(\\Bfuncidx)\n &\\Rightarrow& \\{ \\ETYPE~\\X{et}, \\EINIT~((\\REFFUNC~y)~\\END)^\\ast, \\EMODE~\\EACTIVE~\\{ \\ETABLE~x, \\EOFFSET~e \\} \\} \\\\ &&|&\n \\hex{03}~~\\X{et}:\\Belemkind~~y^\\ast{:}\\Bvec(\\Bfuncidx)\n &\\Rightarrow& \\{ \\ETYPE~\\X{et}, \\EINIT~((\\REFFUNC~y)~\\END)^\\ast, \\EMODE~\\EDECLARATIVE \\} \\\\ &&|&\n \\hex{04}~~e{:}\\Bexpr~~\\X{el}^\\ast{:}\\Bvec(\\Bexpr)\n &\\Rightarrow& \\{ \\ETYPE~\\FUNCREF, \\EINIT~\\X{el}^\\ast, \\EMODE~\\EACTIVE~\\{ \\ETABLE~0, \\EOFFSET~e \\} \\} \\\\ &&|&\n \\hex{05}~~\\X{et}:\\Breftype~~\\X{el}^\\ast{:}\\Bvec(\\Bexpr)\n &\\Rightarrow& \\{ \\ETYPE~et, \\EINIT~\\X{el}^\\ast, \\EMODE~\\EPASSIVE \\} \\\\ &&|&\n \\hex{06}~~x{:}\\Btableidx~~e{:}\\Bexpr~~\\X{et}:\\Breftype~~\\X{el}^\\ast{:}\\Bvec(\\Bexpr)\n &\\Rightarrow& \\{ \\ETYPE~et, \\EINIT~\\X{el}^\\ast, \\EMODE~\\EACTIVE~\\{ \\ETABLE~x, \\EOFFSET~e \\} \\} \\\\ &&|&\n \\hex{07}~~\\X{et}:\\Breftype~~\\X{el}^\\ast{:}\\Bvec(\\Bexpr)\n &\\Rightarrow& \\{ \\ETYPE~et, \\EINIT~\\X{el}^\\ast, \\EMODE~\\EDECLARATIVE \\} \\\\\n \\production{element kind} & \\Belemkind &::=&\n \\hex{00} &\\Rightarrow& \\FUNCREF \\\\\n \\end{array}\n\n.. note::\n The initial byte can be interpreted as a bitfield.\n Bit 0 indicates a passive or declarative segment,\n bit 1 indicates the presence of an explicit table index for an active segment and otherwise distinguishes passive from declarative segments,\n bit 2 indicates the use of element type and element :ref:`expressions ` instead of element kind and element indices.\n\n Additional element kinds may be added in future versions of WebAssembly.\n\n\n.. index:: ! code section, function, local, type index, function type\n pair: binary format; function\n pair: binary format; local\n pair: section; code\n.. _binary-code:\n.. _binary-func:\n.. _binary-local:\n.. _binary-codesec:\n\nCode Section\n~~~~~~~~~~~~\n\nThe *code section* has the id 10.\nIt decodes into a vector of *code* entries that are pairs of :ref:`value type ` vectors and :ref:`expressions `.\nThey represent the |FLOCALS| and |FBODY| field of the :ref:`functions ` in the |MFUNCS| component of a :ref:`module `.\nThe |FTYPE| fields of the respective functions are encoded separately in the :ref:`function section `.\n\nThe encoding of each code entry consists of\n\n* the |U32| *size* of the function code in bytes,\n* the actual *function code*, which in turn consists of\n\n * the declaration of *locals*,\n * the function *body* as an :ref:`expression `.\n\nLocal declarations are compressed into a vector whose entries consist of\n\n* a |U32| *count*,\n* a :ref:`value type `,\n\ndenoting *count* locals of the same value type.\n\n.. math::\n \\begin{array}{llclll@{\\qquad}l}\n \\production{code section} & \\Bcodesec &::=&\n \\X{code}^\\ast{:}\\Bsection_{10}(\\Bvec(\\Bcode))\n &\\Rightarrow& \\X{code}^\\ast \\\\\n \\production{code} & \\Bcode &::=&\n \\X{size}{:}\\Bu32~~\\X{code}{:}\\Bfunc\n &\\Rightarrow& \\X{code} & (\\iff \\X{size} = ||\\Bfunc||) \\\\\n \\production{function} & \\Bfunc &::=&\n (t^\\ast)^\\ast{:}\\Bvec(\\Blocals)~~e{:}\\Bexpr\n &\\Rightarrow& \\concat((t^\\ast)^\\ast), e^\\ast\n & (\\iff |\\concat((t^\\ast)^\\ast)| < 2^{32}) \\\\\n \\production{locals} & \\Blocals &::=&\n n{:}\\Bu32~~t{:}\\Bvaltype &\\Rightarrow& t^n \\\\\n \\end{array}\n\nHere, :math:`\\X{code}` ranges over pairs :math:`(\\valtype^\\ast, \\expr)`.\nThe meta function :math:`\\concat((t^\\ast)^\\ast)` concatenates all sequences :math:`t_i^\\ast` in :math:`(t^\\ast)^\\ast`.\nAny code for which the length of the resulting sequence is out of bounds of the maximum size of a :ref:`vector ` is malformed.\n\n.. note::\n Like with :ref:`sections `, the code :math:`\\X{size}` is not needed for decoding, but can be used to skip functions when navigating through a binary.\n The module is malformed if a size does not match the length of the respective function code.\n\n\n.. index:: ! data section, data, memory, memory index, expression, byte\n pair: binary format; data\n pair: section; data\n single: memory; data\n single: data; segment\n.. _binary-data:\n.. _binary-datasec:\n\nData Section\n~~~~~~~~~~~~\n\nThe *data section* has the id 11.\nIt decodes into a vector of :ref:`data segments ` that represent the |MDATAS| component of a :ref:`module `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{data section} & \\Bdatasec &::=&\n \\X{seg}^\\ast{:}\\Bsection_{11}(\\Bvec(\\Bdata)) &\\Rightarrow& \\X{seg} \\\\\n \\production{data segment} & \\Bdata &::=&\n \\hex{00}~~e{:}\\Bexpr~~b^\\ast{:}\\Bvec(\\Bbyte)\n &\\Rightarrow& \\{ \\DINIT~b^\\ast, \\DMODE~\\DACTIVE~\\{ \\DMEM~0, \\DOFFSET~e \\} \\} \\\\ &&|&\n \\hex{01}~~b^\\ast{:}\\Bvec(\\Bbyte)\n &\\Rightarrow& \\{ \\DINIT~b^\\ast, \\DMODE~\\DPASSIVE \\} \\\\ &&|&\n \\hex{02}~~x{:}\\Bmemidx~~e{:}\\Bexpr~~b^\\ast{:}\\Bvec(\\Bbyte)\n &\\Rightarrow& \\{ \\DINIT~b^\\ast, \\DMODE~\\DACTIVE~\\{ \\DMEM~x, \\DOFFSET~e \\} \\} \\\\\n \\end{array}\n\n.. note::\n The initial byte can be interpreted as a bitfield.\n Bit 0 indicates a passive segment,\n bit 1 indicates the presence of an explicit memory index for an active segment.\n\n In the current version of WebAssembly, at most one memory may be defined or\n imported in a single module, so all valid :ref:`active ` data\n segments have a |DMEM| value of :math:`0`.\n\n\n.. index:: ! data count section, data count, data segment\n pair: binary format; data count\n pair: section; data count\n.. _binary-datacountsec:\n\nData Count Section\n~~~~~~~~~~~~~~~~~~\n\nThe *data count section* has the id 12.\nIt decodes into an optional :ref:`u32 ` that represents the number of :ref:`data segments ` in the :ref:`data section `. If this count does not match the length of the data segment vector, the module is malformed.\n\n.. math::\n \\begin{array}{llclll}\n \\production{data count section} & \\Bdatacountsec &::=&\n \\X{n}^?{:}\\Bsection_{12}(\\Bu32) &\\Rightarrow& \\X{n}^? \\\\\n \\end{array}\n\n.. note::\n The data count section is used to simplify single-pass validation. Since the\n data section occurs after the code section, the :math:`\\MEMORYINIT` and\n :math:`\\DATADROP` instructions would not be able to check whether the data\n segment index is valid until the data section is read. The data count section\n occurs before the code section, so a single-pass validator can use this count\n instead of deferring validation.\n\n\n.. index:: module, section, type definition, function type, function, table, memory, global, element, data, start function, import, export, context, version\n pair: binary format; module\n.. _binary-magic:\n.. _binary-version:\n.. _binary-module:\n\nModules\n~~~~~~~\n\nThe encoding of a :ref:`module ` starts with a preamble containing a 4-byte magic number (the string :math:`\\text{\\backslash0asm}`) and a version field.\nThe current version of the WebAssembly binary format is 1.\n\nThe preamble is followed by a sequence of :ref:`sections `.\n:ref:`Custom sections ` may be inserted at any place in this sequence,\nwhile other sections must occur at most once and in the prescribed order.\nAll sections can be empty.\n\nThe lengths of vectors produced by the (possibly empty) :ref:`function ` and :ref:`code ` section must match up.\n\nSimilarly, the optional data count must match the length of the :ref:`data segment ` vector.\nFurthermore, it must be present if any :math:`data index ` occurs in the code section.\n\n.. math::\n \\begin{array}{llcllll}\n \\production{magic} & \\Bmagic &::=&\n \\hex{00}~\\hex{61}~\\hex{73}~\\hex{6D} \\\\\n \\production{version} & \\Bversion &::=&\n \\hex{01}~\\hex{00}~\\hex{00}~\\hex{00} \\\\\n \\production{module} & \\Bmodule &::=&\n \\Bmagic \\\\ &&&\n \\Bversion \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\functype^\\ast{:\\,}\\Btypesec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\import^\\ast{:\\,}\\Bimportsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\typeidx^n{:\\,}\\Bfuncsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\table^\\ast{:\\,}\\Btablesec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\mem^\\ast{:\\,}\\Bmemsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\global^\\ast{:\\,}\\Bglobalsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\export^\\ast{:\\,}\\Bexportsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\start^?{:\\,}\\Bstartsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\elem^\\ast{:\\,}\\Belemsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n m^?{:\\,}\\Bdatacountsec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\X{code}^n{:\\,}\\Bcodesec \\\\ &&&\n \\Bcustomsec^\\ast \\\\ &&&\n \\data^m{:\\,}\\Bdatasec \\\\ &&&\n \\Bcustomsec^\\ast\n \\quad\\Rightarrow\\quad \\{~\n \\begin{array}[t]{@{}l@{}}\n \\MTYPES~\\functype^\\ast, \\\\\n \\MFUNCS~\\func^n, \\\\\n \\MTABLES~\\table^\\ast, \\\\\n \\MMEMS~\\mem^\\ast, \\\\\n \\MGLOBALS~\\global^\\ast, \\\\\n \\MELEMS~\\elem^\\ast, \\\\\n \\MDATAS~\\data^m, \\\\\n \\MSTART~\\start^?, \\\\\n \\MIMPORTS~\\import^\\ast, \\\\\n \\MEXPORTS~\\export^\\ast ~\\} \\\\\n \\end{array} \\\\ &&&\n (\\iff m^? \\neq \\epsilon \\vee \\freedataidx(\\X{code}^n) = \\emptyset) \\\\\n \\end{array}\n\nwhere for each :math:`t_i^\\ast, e_i` in :math:`\\X{code}^n`,\n\n.. math::\n \\func^n[i] = \\{ \\FTYPE~\\typeidx^n[i], \\FLOCALS~t_i^\\ast, \\FBODY~e_i \\} ) \\\\\n\n.. note::\n The version of the WebAssembly binary format may increase in the future\n if backward-incompatible changes have to be made to the format.\n However, such changes are expected to occur very infrequently, if ever.\n The binary format is intended to be forward-compatible,\n such that future extensions can be made without incrementing its version.\n" }, { "path": "document/core/binary/types.rst", "content": ".. index:: type\n pair: binary format; type\n.. _binary-type:\n\nTypes\n-----\n\n.. note::\n In future versions of WebAssembly, value types may include types denoted by :ref:`type indices `.\n Thus, the binary format for types corresponds to the encodings of small negative :math:`\\xref{binary/values}{binary-sint}{\\sN}` values, so that they can coexist with (positive) type indices in the future.\n\n\n.. index:: number type\n pair: binary format; number type\n.. _binary-numtype:\n\nNumber Types\n~~~~~~~~~~~~\n\n:ref:`Number types ` are encoded by a single byte.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{number type} & \\Bnumtype &::=&\n \\hex{7F} &\\Rightarrow& \\I32 \\\\ &&|&\n \\hex{7E} &\\Rightarrow& \\I64 \\\\ &&|&\n \\hex{7D} &\\Rightarrow& \\F32 \\\\ &&|&\n \\hex{7C} &\\Rightarrow& \\F64 \\\\\n \\end{array}\n\n\n.. index:: reference type\n pair: binary format; reference type\n.. _binary-reftype:\n\nReference Types\n~~~~~~~~~~~~~~~\n\n:ref:`Reference types ` are also encoded by a single byte.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{reference type} & \\Breftype &::=&\n \\hex{70} &\\Rightarrow& \\FUNCREF \\\\ &&|&\n \\hex{6F} &\\Rightarrow& \\EXTERNREF \\\\\n \\end{array}\n\n\n.. index:: value type, number type, reference type\n pair: binary format; value type\n.. _binary-valtype:\n\nValue Types\n~~~~~~~~~~~\n\n:ref:`Value types ` are encoded with their respective encoding as a :ref:`number type ` or :ref:`reference type `.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{value type} & \\Bvaltype &::=&\n t{:}\\Bnumtype &\\Rightarrow& t \\\\ &&|&\n t{:}\\Breftype &\\Rightarrow& t \\\\\n \\end{array}\n\n.. note::\n Value types can occur in contexts where :ref:`type indices ` are also allowed, such as in the case of :ref:`block types `.\n Thus, the binary format for types corresponds to the |SignedLEB128|_ :ref:`encoding ` of small negative :math:`\\sN` values, so that they can coexist with (positive) type indices in the future.\n\n\n.. index:: result type, value type\n pair: binary format; result type\n.. _binary-resulttype:\n\nResult Types\n~~~~~~~~~~~~\n\n:ref:`Result types ` are encoded by the respective :ref:`vectors ` of :ref:`value types ``.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{result type} & \\Bresulttype &::=&\n t^\\ast{:\\,}\\Bvec(\\Bvaltype) &\\Rightarrow& [t^\\ast] \\\\\n \\end{array}\n\n\n.. index:: function type, value type, result type\n pair: binary format; function type\n.. _binary-functype:\n\nFunction Types\n~~~~~~~~~~~~~~\n\n:ref:`Function types ` are encoded by the byte :math:`\\hex{60}` followed by the respective :ref:`vectors ` of parameter and result types.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{function type} & \\Bfunctype &::=&\n \\hex{60}~~\\X{rt}_1{:\\,}\\Bresulttype~~\\X{rt}_2{:\\,}\\Bresulttype\n &\\Rightarrow& \\X{rt}_1 \\to \\X{rt}_2 \\\\\n \\end{array}\n\n\n.. index:: limits\n pair: binary format; limits\n.. _binary-limits:\n\nLimits\n~~~~~~\n\n:ref:`Limits ` are encoded with a preceding flag indicating whether a maximum is present.\n\n.. math::\n \\begin{array}{llclll}\n \\production{limits} & \\Blimits &::=&\n \\hex{00}~~n{:}\\Bu32 &\\Rightarrow& \\{ \\LMIN~n, \\LMAX~\\epsilon \\} \\\\ &&|&\n \\hex{01}~~n{:}\\Bu32~~m{:}\\Bu32 &\\Rightarrow& \\{ \\LMIN~n, \\LMAX~m \\} \\\\\n \\end{array}\n\n\n.. index:: memory type, limits, page size\n pair: binary format; memory type\n.. _binary-memtype:\n\nMemory Types\n~~~~~~~~~~~~\n\n:ref:`Memory types ` are encoded with their :ref:`limits `.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{memory type} & \\Bmemtype &::=&\n \\X{lim}{:}\\Blimits &\\Rightarrow& \\X{lim} \\\\\n \\end{array}\n\n\n.. index:: table type, reference type, limits\n pair: binary format; table type\n.. _binary-tabletype:\n\nTable Types\n~~~~~~~~~~~\n\n:ref:`Table types ` are encoded with their :ref:`limits ` and the encoding of their element :ref:`reference type `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{table type} & \\Btabletype &::=&\n \\X{et}{:}\\Breftype~~\\X{lim}{:}\\Blimits &\\Rightarrow& \\X{lim}~\\X{et} \\\\\n \\end{array}\n\n\n.. index:: global type, mutability, value type\n pair: binary format; global type\n pair: binary format; mutability\n.. _binary-mut:\n.. _binary-globaltype:\n\nGlobal Types\n~~~~~~~~~~~~\n\n:ref:`Global types ` are encoded by their :ref:`value type ` and a flag for their :ref:`mutability `.\n\n.. math::\n \\begin{array}{llclll}\n \\production{global type} & \\Bglobaltype &::=&\n t{:}\\Bvaltype~~m{:}\\Bmut &\\Rightarrow& m~t \\\\\n \\production{mutability} & \\Bmut &::=&\n \\hex{00} &\\Rightarrow& \\MCONST \\\\ &&|&\n \\hex{01} &\\Rightarrow& \\MVAR \\\\\n \\end{array}\n" }, { "path": "document/core/binary/values.rst", "content": ".. index:: value\n pair: binary format; value\n.. _binary-value:\n\nValues\n------\n\n\n.. index:: byte\n pair: binary format; byte\n.. _binary-byte:\n\nBytes\n~~~~~\n\n:ref:`Bytes ` encode themselves.\n\n.. math::\n \\begin{array}{llcll@{\\qquad}l}\n \\production{byte} & \\Bbyte &::=&\n \\hex{00} &\\Rightarrow& \\hex{00} \\\\ &&|&&\n \\dots \\\\ &&|&\n \\hex{FF} &\\Rightarrow& \\hex{FF} \\\\\n \\end{array}\n\n\n.. index:: integer, unsigned integer, signed integer, uninterpreted integer, LEB128, two's complement\n pair: binary format; integer\n pair: binary format; unsigned integer\n pair: binary format; signed integer\n pair: binary format; uninterpreted integer\n.. _binary-sint:\n.. _binary-uint:\n.. _binary-int:\n\nIntegers\n~~~~~~~~\n\nAll :ref:`integers ` are encoded using the |LEB128|_ variable-length integer encoding, in either unsigned or signed variant.\n\n:ref:`Unsigned integers ` are encoded in |UnsignedLEB128|_ format.\nAs an additional constraint, the total number of bytes encoding a value of type :math:`\\uN` must not exceed :math:`\\F{ceil}(N/7)` bytes.\n\n.. math::\n \\begin{array}{llclll@{\\qquad}l}\n \\production{unsigned integer} & \\BuN &::=&\n n{:}\\Bbyte &\\Rightarrow& n & (\\iff n < 2^7 \\wedge n < 2^N) \\\\ &&|&\n n{:}\\Bbyte~~m{:}\\BuX{(N\\B{-7})} &\\Rightarrow&\n 2^7\\cdot m + (n-2^7) & (\\iff n \\geq 2^7 \\wedge N > 7) \\\\\n \\end{array}\n\n:ref:`Signed integers ` are encoded in |SignedLEB128|_ format, which uses a two's complement representation.\nAs an additional constraint, the total number of bytes encoding a value of type :math:`\\sN` must not exceed :math:`\\F{ceil}(N/7)` bytes.\n\n.. math::\n \\begin{array}{llclll@{\\qquad}l}\n \\production{signed integer} & \\BsN &::=&\n n{:}\\Bbyte &\\Rightarrow& n & (\\iff n < 2^6 \\wedge n < 2^{N-1}) \\\\ &&|&\n n{:}\\Bbyte &\\Rightarrow& n-2^7 & (\\iff 2^6 \\leq n < 2^7 \\wedge n \\geq 2^7-2^{N-1}) \\\\ &&|&\n n{:}\\Bbyte~~m{:}\\BsX{(N\\B{-7})} &\\Rightarrow&\n 2^7\\cdot m + (n-2^7) & (\\iff n \\geq 2^7 \\wedge N > 7) \\\\\n \\end{array}\n\n:ref:`Uninterpreted integers ` are encoded as signed integers.\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{uninterpreted integer} & \\BiN &::=&\n n{:}\\BsN &\\Rightarrow& i & (\\iff n = \\signed_{\\iN}(i))\n \\end{array}\n\n.. note::\n The side conditions :math:`N > 7` in the productions for non-terminal bytes of the :math:`\\uX{}` and :math:`\\sX{}` encodings restrict the encoding's length.\n However, \"trailing zeros\" are still allowed within these bounds.\n For example, :math:`\\hex{03}` and :math:`\\hex{83}~\\hex{00}` are both well-formed encodings for the value :math:`3` as a |u8|.\n Similarly, either of :math:`\\hex{7e}` and :math:`\\hex{FE}~\\hex{7F}` and :math:`\\hex{FE}~\\hex{FF}~\\hex{7F}` are well-formed encodings of the value :math:`-2` as a |s16|.\n\n The side conditions on the value :math:`n` of terminal bytes further enforce that\n any unused bits in these bytes must be :math:`0` for positive values and :math:`1` for negative ones.\n For example, :math:`\\hex{83}~\\hex{10}` is malformed as a |u8| encoding.\n Similarly, both :math:`\\hex{83}~\\hex{3E}` and :math:`\\hex{FF}~\\hex{7B}` are malformed as |s8| encodings.\n\n\n.. index:: floating-point number, little endian\n pair: binary format; floating-point number\n.. _binary-float:\n\nFloating-Point\n~~~~~~~~~~~~~~\n\n:ref:`Floating-point ` values are encoded directly by their |IEEE754|_ (Section 3.4) bit pattern in |LittleEndian|_ byte order:\n\n.. math::\n \\begin{array}{llclll@{\\qquad\\qquad}l}\n \\production{floating-point value} & \\BfN &::=&\n b^\\ast{:\\,}\\Bbyte^{N/8} &\\Rightarrow& \\bytes_{\\fN}^{-1}(b^\\ast) \\\\\n \\end{array}\n\n\n.. index:: name, byte, Unicode, ! UTF-8\n pair: binary format; name\n.. _binary-utf8:\n.. _binary-name:\n\nNames\n~~~~~\n\n:ref:`Names ` are encoded as a :ref:`vector ` of bytes containing the |Unicode|_ (Section 3.9) UTF-8 encoding of the name's character sequence.\n\n.. math::\n \\begin{array}{llclllll}\n \\production{name} & \\Bname &::=&\n b^\\ast{:}\\Bvec(\\Bbyte) &\\Rightarrow& \\name\n && (\\iff \\utf8(\\name) = b^\\ast) \\\\\n \\end{array}\n\nThe auxiliary |utf8| function expressing this encoding is defined as follows:\n\n.. math::\n \\begin{array}{@{}l@{}}\n \\begin{array}{@{}lcl@{\\qquad}l@{}}\n \\utf8(c^\\ast) &=& (\\utf8(c))^\\ast \\\\[1ex]\n \\utf8(c) &=& b &\n (\\begin{array}[t]{@{}c@{~}l@{}}\n \\iff & c < \\unicode{80} \\\\\n \\wedge & c = b) \\\\\n \\end{array} \\\\\n \\utf8(c) &=& b_1~b_2 &\n (\\begin{array}[t]{@{}c@{~}l@{}}\n \\iff & \\unicode{80} \\leq c < \\unicode{800} \\\\\n \\wedge & c = 2^6(b_1-\\hex{C0})+(b_2-\\hex{80})) \\\\\n \\end{array} \\\\\n \\utf8(c) &=& b_1~b_2~b_3 &\n (\\begin{array}[t]{@{}c@{~}l@{}}\n \\iff & \\unicode{800} \\leq c < \\unicode{D800} \\vee \\unicode{E000} \\leq c < \\unicode{10000} \\\\\n \\wedge & c = 2^{12}(b_1-\\hex{E0})+2^6(b_2-\\hex{80})+(b_3-\\hex{80})) \\\\\n \\end{array} \\\\\n \\utf8(c) &=& b_1~b_2~b_3~b_4 &\n (\\begin{array}[t]{@{}c@{~}l@{}}\n \\iff & \\unicode{10000} \\leq c < \\unicode{110000} \\\\\n \\wedge & c = 2^{18}(b_1-\\hex{F0})+2^{12}(b_2-\\hex{80})+2^6(b_3-\\hex{80})+(b_4-\\hex{80})) \\\\\n \\end{array} \\\\\n \\end{array} \\\\\n \\where b_2, b_3, b_4 < \\hex{C0} \\\\\n \\end{array}\n\n.. note::\n Unlike in some other formats, name strings are not 0-terminated.\n" }, { "path": "document/core/conf.py", "content": "# -*- coding: utf-8 -*-\n#\n# WebAssembly documentation build configuration file, created by\n# sphinx-quickstart on Mon Nov 21 11:32:49 2016.\n#\n# This file is execfile()d with the current directory set to its\n# containing dir.\n#\n# Note that not all possible configuration values are present in this\n# autogenerated file.\n#\n# All configuration values have a default; values that are commented out\n# serve to show the default.\n\n# If extensions (or modules to document with autodoc) are in another directory,\n# add these directories to sys.path here. If the directory is relative to the\n# documentation root, use os.path.abspath to make it absolute, like shown here.\nimport os\nimport sys\npwd = os.path.abspath('.')\nsys.path.insert(0, pwd + '/util')\n\n# -- General configuration ------------------------------------------------\n\n# If your documentation needs a minimal Sphinx version, state it here.\n#\nneeds_sphinx = '1.4'\n\n# Add any Sphinx extension module names here, as strings. They can be\n# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom\n# ones.\nextensions = [\n 'sphinx.ext.todo',\n 'sphinx.ext.coverage',\n 'sphinx.ext.mathjax',\n 'sphinx.ext.ifconfig',\n 'sphinx.ext.githubpages',\n 'mathdef',\n 'pseudo-lexer'\n]\n\n# Add any paths that contain templates here, relative to this directory.\ntemplates_path = ['_templates']\n\n# The suffix(es) of source filenames.\n# You can specify multiple suffix as a list of string:\n#\nsource_suffix = ['.rst']\n\n# The encoding of source files.\n#\n# source_encoding = 'utf-8-sig'\n\n# The master toctree document.\nmaster_doc = 'index'\n\n# General information about the project.\nname = 'WebAssembly'\nproject = u'WebAssembly'\ntitle = u'WebAssembly Specification'\ncopyright = u'2017, WebAssembly Community Group'\nauthor = u'WebAssembly Community Group'\neditor = u'Andreas Rossberg (editor)'\nlogo = 'static/webassembly.png'\n\n# The version info for the project you're documenting, acts as replacement for\n# |version| and |release|, also used in various other places throughout the\n# built documents.\n#\n# The short X.Y version.\nversion = u'1.1'\n# The full version, including alpha/beta/rc tags.\nrelease = version + ''\n\n# The language for content autogenerated by Sphinx. Refer to documentation\n# for a list of supported languages.\n#\n# This is also used if you do content translation via gettext catalogs.\n# Usually you set \"language\" from the command line for these cases.\nlanguage = None\n\n# There are two options for replacing |today|: either, you set today to some\n# non-false value, then it is used:\n#\n# today = ''\n#\n# Else, today_fmt is used as the format for a strftime call.\n#\n# today_fmt = '%B %d, %Y'\n\n# List of patterns, relative to source directory, that match files and\n# directories to ignore when looking for source files.\n# This patterns also effect to html_static_path and html_extra_path\nexclude_patterns = ['_build', 'Thumbs.db', '.DS_Store']\n\n# The reST default role (used for this markup: `text`) to use for all\n# documents.\n#\n# default_role = None\n\n# If true, '()' will be appended to :func: etc. cross-reference text.\n#\n# add_function_parentheses = True\n\n# If true, the current module name will be prepended to all description\n# unit titles (such as .. function::).\n#\n# add_module_names = True\n\n# If true, sectionauthor and moduleauthor directives will be shown in the\n# output. They are ignored by default.\n#\n# show_authors = False\n\n# The name of the Pygments (syntax highlighting) style to use.\npygments_style = 'sphinx'\n\n# A list of ignored prefixes for module index sorting.\n# modindex_common_prefix = []\n\n# If true, keep warnings as \"system message\" paragraphs in the built documents.\n# keep_warnings = False\n\n# If true, `todo` and `todoList` produce output, else they produce nothing.\ntodo_include_todos = True\n\n\n# -- Options for HTML output ----------------------------------------------\n\n# The theme to use for HTML and HTML Help pages. See the documentation for\n# a list of builtin themes.\n#\nhtml_theme = 'alabaster'\n\n# Theme options are theme-specific and customize the look and feel of a theme\n# further. For a list of options available for each theme, see the\n# documentation.\n#\nhtml_theme_options = {\n 'logo': logo,\n 'logo_name': 'WebAssembly',\n 'description': 'WebAssembly Specification',\n 'fixed_sidebar': True,\n 'sidebar_width': '260px',\n 'sidebar_collapse': True,\n 'show_powered_by': False,\n 'extra_nav_links': {\n 'Index': 'BASEDIR/genindex.html',\n 'Download as PDF': 'BASEDIR/_download/' + name + '.pdf'\n },\n}\n\nhtml_sidebars = {\n '**': [\n # 'about.html',\n 'navigation.html',\n # 'relations.html',\n 'searchbox.html',\n ]\n}\n\n\n# Add any paths that contain custom themes here, relative to this directory.\n# html_theme_path = []\n\n# The name for this set of Sphinx documents.\n# \" v documentation\" by default.\n#\nhtml_title = project + u' ' + release\n\n# A shorter title for the navigation bar. Default is the same as html_title.\n#\n# html_short_title = None\n\n# The name of an image file (relative to this directory) to place at the top\n# of the sidebar.\n#\nhtml_logo = logo\n\n# The name of an image file (relative to this directory) to use as a favicon of\n# the docs. This file should be a Windows icon file (.ico) being 16x16 or 32x32\n# pixels large.\n#\n# html_favicon = None\n\n# Add any paths that contain custom static files (such as style sheets) here,\n# relative to this directory. They are copied after the builtin static files,\n# so a file named \"default.css\" will overwrite the builtin \"default.css\".\nhtml_static_path = ['_static', 'static/custom.css']\n\n# Add any extra paths that contain custom files (such as robots.txt or\n# .htaccess) here, relative to this directory. These files are copied\n# directly to the root of the documentation.\n#\n# html_extra_path = []\n\n# If not None, a 'Last updated on:' timestamp is inserted at every page\n# bottom, using the given strftime format.\n# The empty string is equivalent to '%b %d, %Y'.\n#\n# html_last_updated_fmt = None\n\n# If true, SmartyPants will be used to convert quotes and dashes to\n# typographically correct entities.\n#\n# html_use_smartypants = True\n\n# Additional templates that should be rendered to pages, maps page names to\n# template names.\n#\n# html_additional_pages = {}\n\n# If false, no module index is generated.\n#\nhtml_domain_indices = False\n\n# If false, no index is generated.\n#\nhtml_use_index = True\n\n# If true, the index is split into individual pages for each letter.\n#\nhtml_split_index = False\n\n# If true, the reST sources are included in the HTML build as _sources/name. The default is True.\n#\nhtml_copy_source = False\n\n# If true, links to the reST sources are added to the pages.\n#\nhtml_show_sourcelink = False\n\n# If true, \"Created using Sphinx\" is shown in the HTML footer. Default is True.\n#\nhtml_show_sphinx = False\n\n# If true, \"(C) Copyright ...\" is shown in the HTML footer. Default is True.\n#\nhtml_show_copyright = True\n\n# If this is not None, a ‘Last updated on:’ timestamp is inserted at every\n# page bottom, using the given strftime() format.\n#\nhtml_last_updated_fmt = '%F'\n\n# If true, an OpenSearch description file will be output, and all pages will\n# contain a tag referring to it. The value of this option must be the\n# base URL from which the finished HTML is served.\n#\n# html_use_opensearch = ''\n\n# This is the file name suffix for HTML files (e.g. \".xhtml\").\n#\n# html_file_suffix = None\n\n# Language to be used for generating the HTML full-text search index.\n# Sphinx supports the following languages:\n# 'da', 'de', 'en', 'es', 'fi', 'fr', 'hu', 'it', 'ja'\n# 'nl', 'no', 'pt', 'ro', 'ru', 'sv', 'tr', 'zh'\n#\n# html_search_language = 'en'\n\n# A dictionary with options for the search language support, empty by default.\n# 'ja' uses this config value.\n# 'zh' user can custom change `jieba` dictionary path.\n#\n# html_search_options = {'type': 'default'}\n\n# The name of a javascript file (relative to the configuration directory) that\n# implements a search results scorer. If empty, the default will be used.\n#\n# html_search_scorer = 'scorer.js'\n\n# Output file base name for HTML help builder.\n#\nhtmlhelp_basename = 'WebAssemblydoc'\n\n\n# -- Options for LaTeX output ---------------------------------------------\n\nlatex_elements = {\n # The paper size ('a4paper' or 'letterpaper').\n 'papersize': 'a4paper',\n\n # The font size ('10pt', '11pt' or '12pt').\n 'pointsize': '10pt',\n\n # Additional stuff for the LaTeX preamble.\n 'preamble': '',\n\n # Latex figure (float) alignment\n 'figure_align': 'htbp',\n\n # Fancy chapters [Bjarne, Sonny, Lenny, Glenn, Conny, Rejne]\n 'fncychap': '\\\\usepackage[Sonny]{fncychap}',\n}\n\n# Grouping the document tree into LaTeX files. List of tuples\n# (source start file, target name, title,\n# author, documentclass [howto, manual, or own class]).\nlatex_documents = [\n ( master_doc,\n name + '.tex',\n title,\n author + '\\\\\\\\ \\\\hfill\\\\large ' + editor,\n 'manual'\n ),\n]\n\n# The name of an image file (relative to this directory) to place at the top of\n# the title page.\n#\nlatex_logo = logo\n\n# For \"manual\" documents [part, chapter, or section].\n#\nlatex_toplevel_sectioning = 'chapter'\n\n# If true, show page references after internal links.\n#\nlatex_show_pagerefs = False\n\n# How to show URL addresses after external links [no, footnote, inline].\n#\nlatex_show_urls = 'footnote'\n\n# Documents to append as an appendix to all manuals.\n#\n# latex_appendices = []\n\n# It false, will not define \\strong, \\code, \\titleref, \\crossref ... but only\n# \\sphinxstrong, ..., \\sphinxtitleref, ... To help avoid clash with user added\n# packages.\n#\n# latex_keep_old_macro_names = True\n\n# If false, no module index is generated.\n#\nlatex_domain_indices = False\n\n\n# -- Options for manual page output ---------------------------------------\n\n# One entry per manual page. List of tuples\n# (source start file, name, description, authors, manual section).\nman_pages = [\n ( master_doc,\n name,\n title,\n [author],\n 1\n )\n]\n\n# If true, show URL addresses after external links.\n#\n# man_show_urls = False\n\n\n# -- Options for Texinfo output -------------------------------------------\n\n# Grouping the document tree into Texinfo files. List of tuples\n# (source start file, target name, title, author,\n# dir menu entry, description, category)\ntexinfo_documents = [\n ( master_doc,\n name,\n title,\n author,\n name,\n 'A portable low-level execution format.',\n 'Virtual Machine'\n ),\n]\n\n# Documents to append as an appendix to all manuals.\n#\n# texinfo_appendices = []\n\n# If false, no module index is generated.\n#\ntexinfo_domain_indices = False\n\n# How to display URL addresses: 'footnote', 'no', or 'inline'.\n#\n# texinfo_show_urls = 'footnote'\n\n# If true, do not generate a @detailmenu in the \"Top\" node's menu.\n#\n# texinfo_no_detailmenu = False\n\n\n# -- Options for Epub output ----------------------------------------------\n\n# Bibliographic Dublin Core info.\nepub_title = project\nepub_author = author\nepub_publisher = author\nepub_copyright = copyright\n\n# The basename for the epub file. It defaults to the project name.\n# epub_basename = project\n\n# The HTML theme for the epub output. Since the default themes are not\n# optimized for small screen space, using the same theme for HTML and epub\n# output is usually not wise. This defaults to 'epub', a theme designed to save\n# visual space.\n#\n# epub_theme = 'epub'\n\n# The language of the text. It defaults to the language option\n# or 'en' if the language is not set.\n#\n# epub_language = ''\n\n# The scheme of the identifier. Typical schemes are ISBN or URL.\n# epub_scheme = ''\n\n# The unique identifier of the text. This can be a ISBN number\n# or the project homepage.\n#\n# epub_identifier = ''\n\n# A unique identification for the text.\n#\n# epub_uid = ''\n\n# A tuple containing the cover image and cover page html template filenames.\n#\n# epub_cover = ()\n\n# A sequence of (type, uri, title) tuples for the guide element of content.opf.\n#\n# epub_guide = ()\n\n# HTML files that should be inserted before the pages created by sphinx.\n# The format is a list of tuples containing the path and title.\n#\n# epub_pre_files = []\n\n# HTML files that should be inserted after the pages created by sphinx.\n# The format is a list of tuples containing the path and title.\n#\n# epub_post_files = []\n\n# A list of files that should not be packed into the epub file.\nepub_exclude_files = ['search.html']\n\n# The depth of the table of contents in toc.ncx.\n#\n# epub_tocdepth = 3\n\n# Allow duplicate toc entries.\n#\n# epub_tocdup = True\n\n# Choose between 'default' and 'includehidden'.\n#\n# epub_tocscope = 'default'\n\n# Fix unsupported image types using the Pillow.\n#\n# epub_fix_images = False\n\n# Scale large images.\n#\n# epub_max_image_width = 0\n\n# How to display URL addresses: 'footnote', 'no', or 'inline'.\n#\n# epub_show_urls = 'inline'\n\n# If false, no index is generated.\n#\n# epub_use_index = True\n\n# Macros\nrst_prolog = \"\"\"\n.. include:: /\"\"\" + pwd + \"\"\"/util/macros.def\n\"\"\"\n\n# https://www.sphinx-doc.org/en/master/usage/extensions/math.html#confval-mathjax_config\n# http://docs.mathjax.org/en/v2.7-latest/options/input-processors/TeX.html\nmathjax_config = {\n 'TeX': { 'MAXBUFFER': 30*1024 },\n}\n" }, { "path": "document/core/exec/conventions.rst", "content": ".. index:: ! execution, stack, store\n\nConventions\n-----------\n\nWebAssembly code is *executed* when :ref:`instantiating ` a module or :ref:`invoking ` an :ref:`exported ` function on the resulting module :ref:`instance `.\n\nExecution behavior is defined in terms of an *abstract machine* that models the *program state*.\nIt includes a *stack*, which records operand values and control constructs, and an abstract *store* containing global state.\n\nFor each instruction, there is a rule that specifies the effect of its execution on the program state.\nFurthermore, there are rules describing the instantiation of a module.\nAs with :ref:`validation `, all rules are given in two *equivalent* forms:\n\n1. In *prose*, describing the execution in intuitive form.\n2. In *formal notation*, describing the rule in mathematical form. [#cite-pldi2017]_\n\n.. note::\n As with validation, the prose and formal rules are equivalent,\n so that understanding of the formal notation is *not* required to read this specification.\n The formalism offers a more concise description in notation that is used widely in programming languages semantics and is readily amenable to mathematical proof.\n\n\n.. _exec-notation-textual:\n\nProse Notation\n~~~~~~~~~~~~~~\n\nExecution is specified by stylised, step-wise rules for each :ref:`instruction ` of the :ref:`abstract syntax `.\nThe following conventions are adopted in stating these rules.\n\n* The execution rules implicitly assume a given :ref:`store ` :math:`S`.\n\n* The execution rules also assume the presence of an implicit :ref:`stack `\n that is modified by *pushing* or *popping*\n :ref:`values `, :ref:`labels `, and :ref:`frames `.\n\n* Certain rules require the stack to contain at least one frame.\n The most recent frame is referred to as the *current* frame.\n\n* Both the store and the current frame are mutated by *replacing* some of their components.\n Such replacement is assumed to apply globally.\n\n* The execution of an instruction may *trap*,\n in which case the entire computation is aborted and no further modifications to the store are performed by it. (Other computations can still be initiated afterwards.)\n\n* The execution of an instruction may also end in a *jump* to a designated target,\n which defines the next instruction to execute.\n\n* Execution can *enter* and *exit* :ref:`instruction sequences ` that form :ref:`blocks `.\n\n* :ref:`Instruction sequences ` are implicitly executed in order, unless a trap or jump occurs.\n\n* In various places the rules contain *assertions* expressing crucial invariants about the program state.\n\n\n.. index:: ! reduction rules, configuration, evaluation context\n.. _exec-notation:\n\nFormal Notation\n~~~~~~~~~~~~~~~\n\n.. note::\n This section gives a brief explanation of the notation for specifying execution formally.\n For the interested reader, a more thorough introduction can be found in respective text books. [#cite-tapl]_\n\nThe formal execution rules use a standard approach for specifying operational semantics, rendering them into *reduction rules*.\nEvery rule has the following general form:\n\n.. math::\n \\X{configuration} \\quad\\stepto\\quad \\X{configuration}\n\nA *configuration* is a syntactic description of a program state.\nEach rule specifies one *step* of execution.\nAs long as there is at most one reduction rule applicable to a given configuration, reduction -- and thereby execution -- is *deterministic*.\nWebAssembly has only very few exceptions to this, which are noted explicitly in this specification.\n\nFor WebAssembly, a configuration typically is a tuple :math:`(S; F; \\instr^\\ast)` consisting of the current :ref:`store ` :math:`S`, the :ref:`call frame ` :math:`F` of the current function, and the sequence of :ref:`instructions ` that is to be executed.\n(A more precise definition is given :ref:`later `.)\n\nTo avoid unnecessary clutter, the store :math:`S` and the frame :math:`F` are omitted from reduction rules that do not touch them.\n\nThere is no separate representation of the :ref:`stack `.\nInstead, it is conveniently represented as part of the configuration's instruction sequence.\nIn particular, :ref:`values ` are defined to coincide with |CONST| instructions,\nand a sequence of |CONST| instructions can be interpreted as an operand \"stack\" that grows to the right.\n\n.. note::\n For example, the :ref:`reduction rule ` for the :math:`\\I32.\\ADD` instruction can be given as follows:\n\n .. math::\n (\\I32.\\CONST~n_1)~(\\I32.\\CONST~n_2)~\\I32.\\ADD \\quad\\stepto\\quad (\\I32.\\CONST~(n_1 + n_2) \\mod 2^{32})\n\n Per this rule, two |CONST| instructions and the |ADD| instruction itself are removed from the instruction stream and replaced with one new |CONST| instruction.\n This can be interpreted as popping two value off the stack and pushing the result.\n\n When no result is produced, an instruction reduces to the empty sequence:\n\n .. math::\n \\NOP \\quad\\stepto\\quad \\epsilon\n\n:ref:`Labels