diff options
| author | JF Bastien <github@jfbastien.com> | 2015-06-15 18:37:10 +0200 |
|---|---|---|
| committer | JF Bastien <github@jfbastien.com> | 2015-06-15 18:37:10 +0200 |
| commit | 87c59de19443ef45799905bf5b547e302cea5740 (patch) | |
| tree | 7ad4d9c434a828a1189e4e85db370cd39821d3f0 /BinaryEncoding.md | |
| parent | 0f08d3363616080b0adeceea87f035980b843046 (diff) | |
| parent | ef6799f98620b327e7668075dd709f532e60ace2 (diff) | |
| download | nanowasm-design-87c59de19443ef45799905bf5b547e302cea5740.tar.gz | |
Merge pull request #168 from WebAssembly/urlify
Tidy up URLs
Diffstat (limited to 'BinaryEncoding.md')
| -rw-r--r-- | BinaryEncoding.md | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/BinaryEncoding.md b/BinaryEncoding.md index 3aad2a6..9788abf 100644 --- a/BinaryEncoding.md +++ b/BinaryEncoding.md @@ -27,7 +27,7 @@ Reducing download size, is achieved through three layers: features like constant pools. * Another example is reordering of functions and some internal nodes, which we know does not change semantics, but - [can improve general compression](http://www.rfk.id.au/blog/entry/cromulate-improve-compressibility/). + [can improve general compression](https://www.rfk.id.au/blog/entry/cromulate-improve-compressibility/). * **Generic** compression, such as gzip, already supported in browsers, or LZMA and other compression algorithms, which might be standardized as well. @@ -61,7 +61,7 @@ Yes: ### Variable-length integers * 31% size reduction before compression, 7% size reduction after compression. - * [LEB128](http://en.wikipedia.org/wiki/LEB128) except limited to uint32_t payloads. + * [LEB128](https://en.wikipedia.org/wiki/LEB128) except limited to uint32_t payloads. ## Global structure @@ -108,12 +108,12 @@ F1 and F2 and vendor V1 implements F1, assigning the next logical opcode indices opcodes, and V2 implements F2, assigning the same next logical opcode indices to F2's new opcodes and now a single binary has ambiguous semantics if it tries to use either F1 or F2. This type of non-linear feature addition is commonplace in JS and Web APIs and is guarded against by -having unique names for unique features (and associated [conventions](https://hsivonen.fi/vendor-prefixes)). +having unique names for unique features (and associated [conventions](https://hsivonen.fi/vendor-prefixes/)). The current proposal is to maintain both the efficiency of indices in the [serialized AST](BinaryEncoding.md#serialized-ast) and the established conflict-avoidance practices surrounding string names: * The WebAssembly spec doesn't define any global index spaces - * So, as a general rule, no magic numbers in the spec (other than the literal [magic number](http://en.wikipedia.org/wiki/Magic_number_%28programming%29)). + * So, as a general rule, no magic numbers in the spec (other than the literal [magic number](https://en.wikipedia.org/wiki/Magic_number_%28programming%29)). * Instead, a module defines its *own* local index spaces of opcodes by providing tables *of names*. * So what the spec *would* define is a set of names and their associated semantics. * If the implementation encounters a name it doesn't implement, by default an error is thrown while loading. |
