toilscript 0.0.1 → 0.1.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +201 -201
- package/NOTICE +94 -94
- package/README.md +101 -114
- package/bin/asc.js +0 -0
- package/bin/asinit.js +6 -6
- package/dist/asc.generated.d.ts +10027 -0
- package/dist/asc.js +24474 -0
- package/dist/asc.js.map +7 -0
- package/dist/importmap.json +9 -0
- package/dist/toilscript.generated.d.ts +11242 -0
- package/dist/toilscript.js +337 -0
- package/dist/toilscript.js.map +7 -0
- package/dist/web.js +22 -0
- package/lib/binaryen.d.ts +2 -2
- package/lib/binaryen.js +2 -2
- package/package.json +115 -114
- package/std/README.md +6 -6
- package/std/assembly/array.ts +550 -550
- package/std/assembly/arraybuffer.ts +77 -77
- package/std/assembly/atomics.ts +127 -127
- package/std/assembly/bindings/asyncify.ts +16 -16
- package/std/assembly/bindings/dom.ts +291 -291
- package/std/assembly/bindings/node.ts +6 -6
- package/std/assembly/bitflags.ts +53 -53
- package/std/assembly/builtins.ts +2650 -2650
- package/std/assembly/byteslice.ts +177 -177
- package/std/assembly/compat.ts +2 -2
- package/std/assembly/console.ts +42 -42
- package/std/assembly/crypto.ts +9 -9
- package/std/assembly/dataview.ts +181 -181
- package/std/assembly/date.ts +375 -375
- package/std/assembly/diagnostics.ts +11 -11
- package/std/assembly/encoding.ts +151 -151
- package/std/assembly/endian.ts +45 -45
- package/std/assembly/error.ts +44 -44
- package/std/assembly/fixedarray.ts +173 -173
- package/std/assembly/fixedmap.ts +326 -326
- package/std/assembly/fixedset.ts +275 -275
- package/std/assembly/function.ts +42 -42
- package/std/assembly/index.d.ts +2892 -2891
- package/std/assembly/iterator.ts +35 -35
- package/std/assembly/map.ts +269 -269
- package/std/assembly/math.ts +3289 -3289
- package/std/assembly/memory.ts +123 -123
- package/std/assembly/number.ts +388 -388
- package/std/assembly/object.ts +36 -36
- package/std/assembly/performance.ts +9 -9
- package/std/assembly/pointer.ts +80 -80
- package/std/assembly/polyfills.ts +27 -27
- package/std/assembly/process.ts +50 -50
- package/std/assembly/reference.ts +48 -48
- package/std/assembly/regexp.ts +12 -12
- package/std/assembly/rt/README.md +83 -83
- package/std/assembly/rt/common.ts +81 -81
- package/std/assembly/rt/index-incremental.ts +2 -2
- package/std/assembly/rt/index-memory.ts +1 -1
- package/std/assembly/rt/index-minimal.ts +2 -2
- package/std/assembly/rt/index-stub.ts +1 -1
- package/std/assembly/rt/index.d.ts +37 -37
- package/std/assembly/rt/itcms.ts +419 -419
- package/std/assembly/rt/memory-runtime.ts +94 -94
- package/std/assembly/rt/rtrace.ts +15 -15
- package/std/assembly/rt/stub.ts +133 -133
- package/std/assembly/rt/tcms.ts +254 -254
- package/std/assembly/rt/tlsf.ts +592 -592
- package/std/assembly/rt.ts +90 -90
- package/std/assembly/set.ts +225 -225
- package/std/assembly/shared/feature.ts +68 -68
- package/std/assembly/shared/runtime.ts +13 -13
- package/std/assembly/shared/target.ts +11 -11
- package/std/assembly/shared/tsconfig.json +11 -11
- package/std/assembly/shared/typeinfo.ts +72 -72
- package/std/assembly/staticarray.ts +423 -423
- package/std/assembly/string.ts +850 -850
- package/std/assembly/symbol.ts +114 -114
- package/std/assembly/table.ts +16 -16
- package/std/assembly/toilscript.ts +16 -0
- package/std/assembly/tsconfig.json +6 -6
- package/std/assembly/typedarray.ts +1954 -1954
- package/std/assembly/uri.ts +17 -17
- package/std/assembly/util/bytes.ts +107 -107
- package/std/assembly/util/casemap.ts +497 -497
- package/std/assembly/util/error.ts +58 -58
- package/std/assembly/util/hash.ts +117 -117
- package/std/assembly/util/math.ts +1922 -1922
- package/std/assembly/util/memory.ts +290 -290
- package/std/assembly/util/number.ts +873 -873
- package/std/assembly/util/sort.ts +313 -313
- package/std/assembly/util/string.ts +1202 -1202
- package/std/assembly/util/uri.ts +275 -275
- package/std/assembly/vector.ts +4 -4
- package/std/assembly.json +16 -16
- package/std/portable/index.d.ts +461 -461
- package/std/portable/index.js +416 -416
- package/std/portable.json +11 -11
- package/std/types/assembly/index.d.ts +1 -1
- package/std/types/assembly/package.json +2 -2
- package/std/types/portable/index.d.ts +1 -1
- package/std/types/portable/package.json +2 -2
- package/tsconfig-base.json +13 -13
- package/util/README.md +23 -23
- package/util/browser/fs.js +1 -1
- package/util/browser/module.js +5 -5
- package/util/browser/path.js +520 -520
- package/util/browser/process.js +59 -59
- package/util/browser/url.js +23 -23
- package/util/cpu.d.ts +9 -9
- package/util/cpu.js +42 -42
- package/util/find.d.ts +6 -6
- package/util/find.js +20 -20
- package/util/node.d.ts +21 -21
- package/util/node.js +34 -34
- package/util/options.d.ts +70 -70
- package/util/options.js +262 -262
- package/util/terminal.d.ts +52 -52
- package/util/terminal.js +35 -35
- package/util/text.d.ts +26 -26
- package/util/text.js +114 -114
- package/util/tsconfig.json +9 -9
- package/util/web.d.ts +11 -11
- package/util/web.js +33 -33
package/std/assembly/util/uri.ts
CHANGED
|
@@ -1,275 +1,275 @@
|
|
|
1
|
-
import { E_URI_MALFORMED } from "./error";
|
|
2
|
-
import { CharCode } from "./string";
|
|
3
|
-
|
|
4
|
-
// Truncated lookup boolean table that helps us quickly determine
|
|
5
|
-
// if a char needs to be escaped for URIs (RFC 2396).
|
|
6
|
-
// @ts-ignore: decorator
|
|
7
|
-
@lazy export const URI_UNSAFE = memory.data<u8>([
|
|
8
|
-
/* skip 32 + 1 always set to '1' head slots
|
|
9
|
-
*/ 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
10
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0,
|
|
11
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
12
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0,
|
|
13
|
-
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
14
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, /*
|
|
15
|
-
skip 128 + 1 always set to '1' tail slots */
|
|
16
|
-
]);
|
|
17
|
-
|
|
18
|
-
// Truncated lookup boolean table that helps us quickly determine
|
|
19
|
-
// if a char needs to be escaped for URLs (RFC 3986).
|
|
20
|
-
// @ts-ignore: decorator
|
|
21
|
-
@lazy export const URL_UNSAFE = memory.data<u8>([
|
|
22
|
-
/* skip 32 + 1 always set to '1' head slots
|
|
23
|
-
*/ 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1,
|
|
24
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1,
|
|
25
|
-
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
26
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0,
|
|
27
|
-
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
28
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, /*
|
|
29
|
-
skip 128 + 1 always set to '1' tail slots */
|
|
30
|
-
]);
|
|
31
|
-
|
|
32
|
-
// Truncated lookup boolean table for determine reserved chars: ;/?:@&=+$,#
|
|
33
|
-
// @ts-ignore: decorator
|
|
34
|
-
@lazy export const URI_RESERVED = memory.data<u8>([
|
|
35
|
-
/* skip 32 + 3 always set to '0' head slots
|
|
36
|
-
*/ 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1,
|
|
37
|
-
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1,
|
|
38
|
-
1, /* skip 191 always set to '0' tail slots */
|
|
39
|
-
]);
|
|
40
|
-
|
|
41
|
-
export function encode(src: usize, len: usize, table: usize): usize {
|
|
42
|
-
if (!len) return src;
|
|
43
|
-
|
|
44
|
-
let i: usize = 0, offset: usize = 0, outSize = len << 1;
|
|
45
|
-
let dst = __new(outSize, idof<String>());
|
|
46
|
-
|
|
47
|
-
while (i < len) {
|
|
48
|
-
let org = i;
|
|
49
|
-
let c: u32, c1: u32;
|
|
50
|
-
// fast scan a check chars until it valid ASCII
|
|
51
|
-
// and safe for copying withoud escaping.
|
|
52
|
-
do {
|
|
53
|
-
c = <u32>load<u16>(src + (i << 1));
|
|
54
|
-
// is it valid ASII and safe?
|
|
55
|
-
if (c - 33 < 94) { // 127 - 33
|
|
56
|
-
if (load<u8>(table + (c - 33))) break;
|
|
57
|
-
} else break;
|
|
58
|
-
} while (++i < len);
|
|
59
|
-
|
|
60
|
-
// if we have some safe range of sequence just copy it without encoding
|
|
61
|
-
if (i > org) {
|
|
62
|
-
let size = i - org << 1;
|
|
63
|
-
if (offset + size > outSize) {
|
|
64
|
-
outSize = offset + size;
|
|
65
|
-
dst = __renew(dst, outSize);
|
|
66
|
-
}
|
|
67
|
-
// TODO: should we optimize for short cases like 2 byte size?
|
|
68
|
-
memory.copy(
|
|
69
|
-
dst + offset,
|
|
70
|
-
src + (org << 1),
|
|
71
|
-
size
|
|
72
|
-
);
|
|
73
|
-
offset += size;
|
|
74
|
-
// return if we reach end on input string
|
|
75
|
-
if (i >= len) break;
|
|
76
|
-
}
|
|
77
|
-
|
|
78
|
-
// decode UTF16 with checking for unpaired surrogates
|
|
79
|
-
if (c >= 0xD800) {
|
|
80
|
-
if (c >= 0xDC00 && c <= 0xDFFF) {
|
|
81
|
-
throw new URIError(E_URI_MALFORMED);
|
|
82
|
-
}
|
|
83
|
-
if (c <= 0xDBFF) {
|
|
84
|
-
if (i >= len) {
|
|
85
|
-
throw new URIError(E_URI_MALFORMED);
|
|
86
|
-
}
|
|
87
|
-
c1 = <u32>load<u16>(src + (++i << 1));
|
|
88
|
-
if (c1 < 0xDC00 || c1 > 0xDFFF) {
|
|
89
|
-
throw new URIError(E_URI_MALFORMED);
|
|
90
|
-
}
|
|
91
|
-
c = (((c & 0x3FF) << 10) | (c1 & 0x3FF)) + 0x10000;
|
|
92
|
-
}
|
|
93
|
-
}
|
|
94
|
-
|
|
95
|
-
let estSize = offset + (c < 0x80 ? 1 * 6 : 4 * 6);
|
|
96
|
-
if (estSize > outSize) {
|
|
97
|
-
// doubling estimated size but only for greater than one
|
|
98
|
-
// input lenght due to we already estemated it for worst case
|
|
99
|
-
outSize = len > 1 ? estSize << 1 : estSize;
|
|
100
|
-
dst = __renew(dst, outSize);
|
|
101
|
-
}
|
|
102
|
-
|
|
103
|
-
if (c < 0x80) {
|
|
104
|
-
// encode ASCII unsafe code point
|
|
105
|
-
storeHex(dst, offset, c);
|
|
106
|
-
offset += 6;
|
|
107
|
-
} else {
|
|
108
|
-
// encode UTF-8 unsafe code point
|
|
109
|
-
if (c < 0x800) {
|
|
110
|
-
storeHex(dst, offset, (c >> 6) | 0xC0);
|
|
111
|
-
offset += 6;
|
|
112
|
-
} else {
|
|
113
|
-
if (c < 0x10000) {
|
|
114
|
-
storeHex(dst, offset, (c >> 12) | 0xE0);
|
|
115
|
-
offset += 6;
|
|
116
|
-
} else {
|
|
117
|
-
storeHex(dst, offset, (c >> 18) | 0xF0);
|
|
118
|
-
offset += 6;
|
|
119
|
-
storeHex(dst, offset, (c >> 12 & 0x3F) | 0x80);
|
|
120
|
-
offset += 6;
|
|
121
|
-
}
|
|
122
|
-
storeHex(dst, offset, (c >> 6 & 0x3F) | 0x80);
|
|
123
|
-
offset += 6;
|
|
124
|
-
}
|
|
125
|
-
storeHex(dst, offset, (c & 0x3F) | 0x80);
|
|
126
|
-
offset += 6;
|
|
127
|
-
}
|
|
128
|
-
++i;
|
|
129
|
-
}
|
|
130
|
-
// shink output string buffer if necessary
|
|
131
|
-
if (outSize > offset) {
|
|
132
|
-
dst = __renew(dst, offset);
|
|
133
|
-
}
|
|
134
|
-
return dst;
|
|
135
|
-
}
|
|
136
|
-
|
|
137
|
-
export function decode(src: usize, len: usize, component: bool): usize {
|
|
138
|
-
if (!len) return src;
|
|
139
|
-
|
|
140
|
-
let i: usize = 0, offset: usize = 0, ch: u32 = 0;
|
|
141
|
-
let dst = __new(len << 1, idof<String>());
|
|
142
|
-
|
|
143
|
-
while (i < len) {
|
|
144
|
-
let org = i;
|
|
145
|
-
while (i < len && (ch = load<u16>(src + (i << 1))) != CharCode.PERCENT) i++;
|
|
146
|
-
|
|
147
|
-
if (i > org) {
|
|
148
|
-
let size = i - org << 1;
|
|
149
|
-
// TODO: should we optimize for short cases like 2 byte size?
|
|
150
|
-
memory.copy(
|
|
151
|
-
dst + offset,
|
|
152
|
-
src + (org << 1),
|
|
153
|
-
size
|
|
154
|
-
);
|
|
155
|
-
offset += size;
|
|
156
|
-
if (i >= len) break;
|
|
157
|
-
}
|
|
158
|
-
|
|
159
|
-
// decode hex
|
|
160
|
-
if (
|
|
161
|
-
i + 2 >= len ||
|
|
162
|
-
ch != CharCode.PERCENT ||
|
|
163
|
-
(ch = loadHex(src, i + 1 << 1)) == -1
|
|
164
|
-
) throw new URIError(E_URI_MALFORMED);
|
|
165
|
-
|
|
166
|
-
i += 3;
|
|
167
|
-
if (ch < 0x80) {
|
|
168
|
-
if (!component && isReserved(ch)) {
|
|
169
|
-
ch = CharCode.PERCENT;
|
|
170
|
-
i -= 2;
|
|
171
|
-
}
|
|
172
|
-
} else {
|
|
173
|
-
// decode UTF-8 sequence
|
|
174
|
-
let nb = utf8LenFromUpperByte(ch);
|
|
175
|
-
// minimal surrogate: 2 => 0x80, 3 => 0x800, 4 => 0x10000, _ => -1
|
|
176
|
-
let lo: u32 = 1 << (17 * nb >> 2) - 1;
|
|
177
|
-
// mask: 2 => 31, 3 => 15, 4 => 7, _ => 0
|
|
178
|
-
ch &= nb ? (0x80 >> nb) - 1 : 0;
|
|
179
|
-
|
|
180
|
-
while (--nb != 0) {
|
|
181
|
-
let c1: u32;
|
|
182
|
-
// decode hex
|
|
183
|
-
if (
|
|
184
|
-
i + 2 >= len ||
|
|
185
|
-
load<u16>(src + (i << 1)) != CharCode.PERCENT ||
|
|
186
|
-
(c1 = loadHex(src, i + 1 << 1)) == -1
|
|
187
|
-
) throw new URIError(E_URI_MALFORMED);
|
|
188
|
-
|
|
189
|
-
i += 3;
|
|
190
|
-
if ((c1 & 0xC0) != 0x80) {
|
|
191
|
-
ch = 0;
|
|
192
|
-
break;
|
|
193
|
-
}
|
|
194
|
-
ch = (ch << 6) | (c1 & 0x3F);
|
|
195
|
-
}
|
|
196
|
-
|
|
197
|
-
// check if UTF8 code point properly fit into invalid UTF16 encoding
|
|
198
|
-
if (ch < lo || lo == -1 || ch > 0x10FFFF || (ch >= 0xD800 && ch < 0xE000)) {
|
|
199
|
-
throw new URIError(E_URI_MALFORMED);
|
|
200
|
-
}
|
|
201
|
-
|
|
202
|
-
// encode UTF16
|
|
203
|
-
if (ch >= 0x10000) {
|
|
204
|
-
ch -= 0x10000;
|
|
205
|
-
let lo = ch >> 10 | 0xD800;
|
|
206
|
-
let hi = (ch & 0x03FF) | 0xDC00;
|
|
207
|
-
store<u32>(dst + offset, lo | (hi << 16));
|
|
208
|
-
offset += 4;
|
|
209
|
-
continue;
|
|
210
|
-
}
|
|
211
|
-
}
|
|
212
|
-
store<u16>(dst + offset, ch);
|
|
213
|
-
offset += 2;
|
|
214
|
-
}
|
|
215
|
-
|
|
216
|
-
assert(offset <= (len << 1));
|
|
217
|
-
// shink output string buffer if necessary
|
|
218
|
-
if ((len << 1) > offset) {
|
|
219
|
-
dst = __renew(dst, offset);
|
|
220
|
-
}
|
|
221
|
-
return dst;
|
|
222
|
-
}
|
|
223
|
-
|
|
224
|
-
function storeHex(dst: usize, offset: usize, ch: u32): void {
|
|
225
|
-
// @ts-ignore: decorator
|
|
226
|
-
const HEX_CHARS = memory.data<u8>([
|
|
227
|
-
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
|
|
228
|
-
0x38, 0x39, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46
|
|
229
|
-
]);
|
|
230
|
-
|
|
231
|
-
store<u16>(dst + offset, CharCode.PERCENT, 0); // %
|
|
232
|
-
store<u32>(
|
|
233
|
-
dst + offset,
|
|
234
|
-
<u32>load<u8>(HEX_CHARS + (ch >> 4 & 0x0F)) |
|
|
235
|
-
<u32>load<u8>(HEX_CHARS + (ch & 0x0F)) << 16,
|
|
236
|
-
2
|
|
237
|
-
); // XX
|
|
238
|
-
}
|
|
239
|
-
|
|
240
|
-
function loadHex(src: usize, offset: usize): u32 {
|
|
241
|
-
let c0 = <u32>load<u16>(src + offset, 0);
|
|
242
|
-
let c1 = <u32>load<u16>(src + offset, 2);
|
|
243
|
-
return isHex(c0) && isHex(c1)
|
|
244
|
-
? fromHex(c0) << 4 | fromHex(c1)
|
|
245
|
-
: -1;
|
|
246
|
-
}
|
|
247
|
-
|
|
248
|
-
// @ts-ignore: decorator
|
|
249
|
-
@inline function fromHex(ch: u32): u32 {
|
|
250
|
-
return (ch | 32) % 39 - 9;
|
|
251
|
-
}
|
|
252
|
-
|
|
253
|
-
// @ts-ignore: decorator
|
|
254
|
-
@inline function utf8LenFromUpperByte(c0: u32): u32 {
|
|
255
|
-
// same as
|
|
256
|
-
// if (c0 - 0xC0 <= 0xDF - 0xC0) return 2;
|
|
257
|
-
// if (c0 - 0xE0 <= 0xEF - 0xE0) return 3;
|
|
258
|
-
// if (c0 - 0xF0 <= 0xF7 - 0xF0) return 4;
|
|
259
|
-
// return 0;
|
|
260
|
-
return c0 - 0xC0 < 56
|
|
261
|
-
? clz(~(c0 << 24))
|
|
262
|
-
: 0;
|
|
263
|
-
}
|
|
264
|
-
|
|
265
|
-
// @ts-ignore: decorator
|
|
266
|
-
@inline function isReserved(ch: u32): bool {
|
|
267
|
-
return ch - 35 < 30
|
|
268
|
-
? <bool>load<u8>(URI_RESERVED + (ch - 35))
|
|
269
|
-
: false;
|
|
270
|
-
}
|
|
271
|
-
|
|
272
|
-
// @ts-ignore: decorator
|
|
273
|
-
@inline function isHex(ch: u32): bool {
|
|
274
|
-
return (ch - CharCode._0 < 10) || ((ch | 32) - CharCode.a < 6);
|
|
275
|
-
}
|
|
1
|
+
import { E_URI_MALFORMED } from "./error";
|
|
2
|
+
import { CharCode } from "./string";
|
|
3
|
+
|
|
4
|
+
// Truncated lookup boolean table that helps us quickly determine
|
|
5
|
+
// if a char needs to be escaped for URIs (RFC 2396).
|
|
6
|
+
// @ts-ignore: decorator
|
|
7
|
+
@lazy export const URI_UNSAFE = memory.data<u8>([
|
|
8
|
+
/* skip 32 + 1 always set to '1' head slots
|
|
9
|
+
*/ 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
10
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0,
|
|
11
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
12
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0,
|
|
13
|
+
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
14
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, /*
|
|
15
|
+
skip 128 + 1 always set to '1' tail slots */
|
|
16
|
+
]);
|
|
17
|
+
|
|
18
|
+
// Truncated lookup boolean table that helps us quickly determine
|
|
19
|
+
// if a char needs to be escaped for URLs (RFC 3986).
|
|
20
|
+
// @ts-ignore: decorator
|
|
21
|
+
@lazy export const URL_UNSAFE = memory.data<u8>([
|
|
22
|
+
/* skip 32 + 1 always set to '1' head slots
|
|
23
|
+
*/ 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1,
|
|
24
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1,
|
|
25
|
+
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
26
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0,
|
|
27
|
+
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
28
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, /*
|
|
29
|
+
skip 128 + 1 always set to '1' tail slots */
|
|
30
|
+
]);
|
|
31
|
+
|
|
32
|
+
// Truncated lookup boolean table for determine reserved chars: ;/?:@&=+$,#
|
|
33
|
+
// @ts-ignore: decorator
|
|
34
|
+
@lazy export const URI_RESERVED = memory.data<u8>([
|
|
35
|
+
/* skip 32 + 3 always set to '0' head slots
|
|
36
|
+
*/ 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1,
|
|
37
|
+
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1,
|
|
38
|
+
1, /* skip 191 always set to '0' tail slots */
|
|
39
|
+
]);
|
|
40
|
+
|
|
41
|
+
export function encode(src: usize, len: usize, table: usize): usize {
|
|
42
|
+
if (!len) return src;
|
|
43
|
+
|
|
44
|
+
let i: usize = 0, offset: usize = 0, outSize = len << 1;
|
|
45
|
+
let dst = __new(outSize, idof<String>());
|
|
46
|
+
|
|
47
|
+
while (i < len) {
|
|
48
|
+
let org = i;
|
|
49
|
+
let c: u32, c1: u32;
|
|
50
|
+
// fast scan a check chars until it valid ASCII
|
|
51
|
+
// and safe for copying withoud escaping.
|
|
52
|
+
do {
|
|
53
|
+
c = <u32>load<u16>(src + (i << 1));
|
|
54
|
+
// is it valid ASII and safe?
|
|
55
|
+
if (c - 33 < 94) { // 127 - 33
|
|
56
|
+
if (load<u8>(table + (c - 33))) break;
|
|
57
|
+
} else break;
|
|
58
|
+
} while (++i < len);
|
|
59
|
+
|
|
60
|
+
// if we have some safe range of sequence just copy it without encoding
|
|
61
|
+
if (i > org) {
|
|
62
|
+
let size = i - org << 1;
|
|
63
|
+
if (offset + size > outSize) {
|
|
64
|
+
outSize = offset + size;
|
|
65
|
+
dst = __renew(dst, outSize);
|
|
66
|
+
}
|
|
67
|
+
// TODO: should we optimize for short cases like 2 byte size?
|
|
68
|
+
memory.copy(
|
|
69
|
+
dst + offset,
|
|
70
|
+
src + (org << 1),
|
|
71
|
+
size
|
|
72
|
+
);
|
|
73
|
+
offset += size;
|
|
74
|
+
// return if we reach end on input string
|
|
75
|
+
if (i >= len) break;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
// decode UTF16 with checking for unpaired surrogates
|
|
79
|
+
if (c >= 0xD800) {
|
|
80
|
+
if (c >= 0xDC00 && c <= 0xDFFF) {
|
|
81
|
+
throw new URIError(E_URI_MALFORMED);
|
|
82
|
+
}
|
|
83
|
+
if (c <= 0xDBFF) {
|
|
84
|
+
if (i >= len) {
|
|
85
|
+
throw new URIError(E_URI_MALFORMED);
|
|
86
|
+
}
|
|
87
|
+
c1 = <u32>load<u16>(src + (++i << 1));
|
|
88
|
+
if (c1 < 0xDC00 || c1 > 0xDFFF) {
|
|
89
|
+
throw new URIError(E_URI_MALFORMED);
|
|
90
|
+
}
|
|
91
|
+
c = (((c & 0x3FF) << 10) | (c1 & 0x3FF)) + 0x10000;
|
|
92
|
+
}
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
let estSize = offset + (c < 0x80 ? 1 * 6 : 4 * 6);
|
|
96
|
+
if (estSize > outSize) {
|
|
97
|
+
// doubling estimated size but only for greater than one
|
|
98
|
+
// input lenght due to we already estemated it for worst case
|
|
99
|
+
outSize = len > 1 ? estSize << 1 : estSize;
|
|
100
|
+
dst = __renew(dst, outSize);
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
if (c < 0x80) {
|
|
104
|
+
// encode ASCII unsafe code point
|
|
105
|
+
storeHex(dst, offset, c);
|
|
106
|
+
offset += 6;
|
|
107
|
+
} else {
|
|
108
|
+
// encode UTF-8 unsafe code point
|
|
109
|
+
if (c < 0x800) {
|
|
110
|
+
storeHex(dst, offset, (c >> 6) | 0xC0);
|
|
111
|
+
offset += 6;
|
|
112
|
+
} else {
|
|
113
|
+
if (c < 0x10000) {
|
|
114
|
+
storeHex(dst, offset, (c >> 12) | 0xE0);
|
|
115
|
+
offset += 6;
|
|
116
|
+
} else {
|
|
117
|
+
storeHex(dst, offset, (c >> 18) | 0xF0);
|
|
118
|
+
offset += 6;
|
|
119
|
+
storeHex(dst, offset, (c >> 12 & 0x3F) | 0x80);
|
|
120
|
+
offset += 6;
|
|
121
|
+
}
|
|
122
|
+
storeHex(dst, offset, (c >> 6 & 0x3F) | 0x80);
|
|
123
|
+
offset += 6;
|
|
124
|
+
}
|
|
125
|
+
storeHex(dst, offset, (c & 0x3F) | 0x80);
|
|
126
|
+
offset += 6;
|
|
127
|
+
}
|
|
128
|
+
++i;
|
|
129
|
+
}
|
|
130
|
+
// shink output string buffer if necessary
|
|
131
|
+
if (outSize > offset) {
|
|
132
|
+
dst = __renew(dst, offset);
|
|
133
|
+
}
|
|
134
|
+
return dst;
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
export function decode(src: usize, len: usize, component: bool): usize {
|
|
138
|
+
if (!len) return src;
|
|
139
|
+
|
|
140
|
+
let i: usize = 0, offset: usize = 0, ch: u32 = 0;
|
|
141
|
+
let dst = __new(len << 1, idof<String>());
|
|
142
|
+
|
|
143
|
+
while (i < len) {
|
|
144
|
+
let org = i;
|
|
145
|
+
while (i < len && (ch = load<u16>(src + (i << 1))) != CharCode.PERCENT) i++;
|
|
146
|
+
|
|
147
|
+
if (i > org) {
|
|
148
|
+
let size = i - org << 1;
|
|
149
|
+
// TODO: should we optimize for short cases like 2 byte size?
|
|
150
|
+
memory.copy(
|
|
151
|
+
dst + offset,
|
|
152
|
+
src + (org << 1),
|
|
153
|
+
size
|
|
154
|
+
);
|
|
155
|
+
offset += size;
|
|
156
|
+
if (i >= len) break;
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
// decode hex
|
|
160
|
+
if (
|
|
161
|
+
i + 2 >= len ||
|
|
162
|
+
ch != CharCode.PERCENT ||
|
|
163
|
+
(ch = loadHex(src, i + 1 << 1)) == -1
|
|
164
|
+
) throw new URIError(E_URI_MALFORMED);
|
|
165
|
+
|
|
166
|
+
i += 3;
|
|
167
|
+
if (ch < 0x80) {
|
|
168
|
+
if (!component && isReserved(ch)) {
|
|
169
|
+
ch = CharCode.PERCENT;
|
|
170
|
+
i -= 2;
|
|
171
|
+
}
|
|
172
|
+
} else {
|
|
173
|
+
// decode UTF-8 sequence
|
|
174
|
+
let nb = utf8LenFromUpperByte(ch);
|
|
175
|
+
// minimal surrogate: 2 => 0x80, 3 => 0x800, 4 => 0x10000, _ => -1
|
|
176
|
+
let lo: u32 = 1 << (17 * nb >> 2) - 1;
|
|
177
|
+
// mask: 2 => 31, 3 => 15, 4 => 7, _ => 0
|
|
178
|
+
ch &= nb ? (0x80 >> nb) - 1 : 0;
|
|
179
|
+
|
|
180
|
+
while (--nb != 0) {
|
|
181
|
+
let c1: u32;
|
|
182
|
+
// decode hex
|
|
183
|
+
if (
|
|
184
|
+
i + 2 >= len ||
|
|
185
|
+
load<u16>(src + (i << 1)) != CharCode.PERCENT ||
|
|
186
|
+
(c1 = loadHex(src, i + 1 << 1)) == -1
|
|
187
|
+
) throw new URIError(E_URI_MALFORMED);
|
|
188
|
+
|
|
189
|
+
i += 3;
|
|
190
|
+
if ((c1 & 0xC0) != 0x80) {
|
|
191
|
+
ch = 0;
|
|
192
|
+
break;
|
|
193
|
+
}
|
|
194
|
+
ch = (ch << 6) | (c1 & 0x3F);
|
|
195
|
+
}
|
|
196
|
+
|
|
197
|
+
// check if UTF8 code point properly fit into invalid UTF16 encoding
|
|
198
|
+
if (ch < lo || lo == -1 || ch > 0x10FFFF || (ch >= 0xD800 && ch < 0xE000)) {
|
|
199
|
+
throw new URIError(E_URI_MALFORMED);
|
|
200
|
+
}
|
|
201
|
+
|
|
202
|
+
// encode UTF16
|
|
203
|
+
if (ch >= 0x10000) {
|
|
204
|
+
ch -= 0x10000;
|
|
205
|
+
let lo = ch >> 10 | 0xD800;
|
|
206
|
+
let hi = (ch & 0x03FF) | 0xDC00;
|
|
207
|
+
store<u32>(dst + offset, lo | (hi << 16));
|
|
208
|
+
offset += 4;
|
|
209
|
+
continue;
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
store<u16>(dst + offset, ch);
|
|
213
|
+
offset += 2;
|
|
214
|
+
}
|
|
215
|
+
|
|
216
|
+
assert(offset <= (len << 1));
|
|
217
|
+
// shink output string buffer if necessary
|
|
218
|
+
if ((len << 1) > offset) {
|
|
219
|
+
dst = __renew(dst, offset);
|
|
220
|
+
}
|
|
221
|
+
return dst;
|
|
222
|
+
}
|
|
223
|
+
|
|
224
|
+
function storeHex(dst: usize, offset: usize, ch: u32): void {
|
|
225
|
+
// @ts-ignore: decorator
|
|
226
|
+
const HEX_CHARS = memory.data<u8>([
|
|
227
|
+
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
|
|
228
|
+
0x38, 0x39, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46
|
|
229
|
+
]);
|
|
230
|
+
|
|
231
|
+
store<u16>(dst + offset, CharCode.PERCENT, 0); // %
|
|
232
|
+
store<u32>(
|
|
233
|
+
dst + offset,
|
|
234
|
+
<u32>load<u8>(HEX_CHARS + (ch >> 4 & 0x0F)) |
|
|
235
|
+
<u32>load<u8>(HEX_CHARS + (ch & 0x0F)) << 16,
|
|
236
|
+
2
|
|
237
|
+
); // XX
|
|
238
|
+
}
|
|
239
|
+
|
|
240
|
+
function loadHex(src: usize, offset: usize): u32 {
|
|
241
|
+
let c0 = <u32>load<u16>(src + offset, 0);
|
|
242
|
+
let c1 = <u32>load<u16>(src + offset, 2);
|
|
243
|
+
return isHex(c0) && isHex(c1)
|
|
244
|
+
? fromHex(c0) << 4 | fromHex(c1)
|
|
245
|
+
: -1;
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
// @ts-ignore: decorator
|
|
249
|
+
@inline function fromHex(ch: u32): u32 {
|
|
250
|
+
return (ch | 32) % 39 - 9;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
// @ts-ignore: decorator
|
|
254
|
+
@inline function utf8LenFromUpperByte(c0: u32): u32 {
|
|
255
|
+
// same as
|
|
256
|
+
// if (c0 - 0xC0 <= 0xDF - 0xC0) return 2;
|
|
257
|
+
// if (c0 - 0xE0 <= 0xEF - 0xE0) return 3;
|
|
258
|
+
// if (c0 - 0xF0 <= 0xF7 - 0xF0) return 4;
|
|
259
|
+
// return 0;
|
|
260
|
+
return c0 - 0xC0 < 56
|
|
261
|
+
? clz(~(c0 << 24))
|
|
262
|
+
: 0;
|
|
263
|
+
}
|
|
264
|
+
|
|
265
|
+
// @ts-ignore: decorator
|
|
266
|
+
@inline function isReserved(ch: u32): bool {
|
|
267
|
+
return ch - 35 < 30
|
|
268
|
+
? <bool>load<u8>(URI_RESERVED + (ch - 35))
|
|
269
|
+
: false;
|
|
270
|
+
}
|
|
271
|
+
|
|
272
|
+
// @ts-ignore: decorator
|
|
273
|
+
@inline function isHex(ch: u32): bool {
|
|
274
|
+
return (ch - CharCode._0 < 10) || ((ch | 32) - CharCode.a < 6);
|
|
275
|
+
}
|
package/std/assembly/vector.ts
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
/** Vector abstraction. */
|
|
2
|
-
@final @unmanaged
|
|
3
|
-
export abstract class V128 {
|
|
4
|
-
}
|
|
1
|
+
/** Vector abstraction. */
|
|
2
|
+
@final @unmanaged
|
|
3
|
+
export abstract class V128 {
|
|
4
|
+
}
|
package/std/assembly.json
CHANGED
|
@@ -1,16 +1,16 @@
|
|
|
1
|
-
{
|
|
2
|
-
"extends": "../tsconfig-base.json",
|
|
3
|
-
"compilerOptions": {
|
|
4
|
-
"target": "esnext",
|
|
5
|
-
"module": "commonjs",
|
|
6
|
-
"noLib": true,
|
|
7
|
-
"allowJs": false,
|
|
8
|
-
"typeRoots": [ "types" ],
|
|
9
|
-
"types": [ "assembly" ],
|
|
10
|
-
"paths": {
|
|
11
|
-
"*": [
|
|
12
|
-
"./assembly/*"
|
|
13
|
-
]
|
|
14
|
-
}
|
|
15
|
-
}
|
|
16
|
-
}
|
|
1
|
+
{
|
|
2
|
+
"extends": "../tsconfig-base.json",
|
|
3
|
+
"compilerOptions": {
|
|
4
|
+
"target": "esnext",
|
|
5
|
+
"module": "commonjs",
|
|
6
|
+
"noLib": true,
|
|
7
|
+
"allowJs": false,
|
|
8
|
+
"typeRoots": [ "types" ],
|
|
9
|
+
"types": [ "assembly" ],
|
|
10
|
+
"paths": {
|
|
11
|
+
"*": [
|
|
12
|
+
"./assembly/*"
|
|
13
|
+
]
|
|
14
|
+
}
|
|
15
|
+
}
|
|
16
|
+
}
|