porffor 0.17.0-f43ba190c → 0.18.3
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/README.md +10 -9
- package/bf +0 -0
- package/compiler/2c.js +98 -15
- package/compiler/assemble.js +19 -4
- package/compiler/builtins/array.ts +102 -9
- package/compiler/builtins/date.ts +104 -106
- package/compiler/builtins/error.js +2 -5
- package/compiler/builtins/set.ts +4 -5
- package/compiler/builtins/string_f64.ts +4 -6
- package/compiler/builtins/symbol.ts +2 -1
- package/compiler/builtins/typedarray.js +58 -6
- package/compiler/builtins/z_ecma262.ts +1 -0
- package/compiler/builtins.js +13 -2
- package/compiler/codegen.js +486 -127
- package/compiler/cyclone.js +36 -0
- package/compiler/decompile.js +2 -2
- package/compiler/generated_builtins.js +2714 -713
- package/compiler/index.js +1 -0
- package/compiler/opt.js +3 -5
- package/compiler/precompile.js +4 -2
- package/compiler/prototype.js +0 -69
- package/package.json +1 -1
- package/rhemyn/README.md +7 -4
- package/rhemyn/compile.js +170 -76
- package/runner/index.js +3 -2
- package/runner/repl.js +1 -2
- package/runner/version.js +0 -12
package/compiler/index.js
CHANGED
package/compiler/opt.js
CHANGED
@@ -114,8 +114,6 @@ export default (funcs, globals, pages, tags, exceptions) => {
|
|
114
114
|
while (runs > 0) {
|
115
115
|
runs--;
|
116
116
|
|
117
|
-
let depth = [];
|
118
|
-
|
119
117
|
let getCount = {}, setCount = {};
|
120
118
|
for (const x in f.locals) {
|
121
119
|
getCount[f.locals[x].idx] = 0;
|
@@ -128,9 +126,6 @@ export default (funcs, globals, pages, tags, exceptions) => {
|
|
128
126
|
inst = [ ...inst ];
|
129
127
|
wasm[i] = inst;
|
130
128
|
|
131
|
-
if (inst[0] === Opcodes.if || inst[0] === Opcodes.loop || inst[0] === Opcodes.block) depth.push(inst[0]);
|
132
|
-
if (inst[0] === Opcodes.end) depth.pop();
|
133
|
-
|
134
129
|
if (inst[0] === Opcodes.local_get) getCount[inst[1]]++;
|
135
130
|
if (inst[0] === Opcodes.local_set || inst[0] === Opcodes.local_tee) setCount[inst[1]]++;
|
136
131
|
|
@@ -203,6 +198,9 @@ export default (funcs, globals, pages, tags, exceptions) => {
|
|
203
198
|
if (type === 'Array') missing = !pages.hasArray;
|
204
199
|
if (type === 'String') missing = !pages.hasString;
|
205
200
|
if (type === 'ByteString') missing = !pages.hasByteString;
|
201
|
+
if (['Set', 'Uint8Array', 'Int8Array', 'Uint8ClampedArray', 'Uint16Array', 'Int16Array', 'Uint32Array', 'Int32Array', 'Float32Array', 'Float64Array'].includes(type)) {
|
202
|
+
missing = funcs.find(x => x.name === type) == null;
|
203
|
+
}
|
206
204
|
|
207
205
|
if (missing) {
|
208
206
|
let j = i, depth = 0;
|
package/compiler/precompile.js
CHANGED
@@ -6,6 +6,8 @@ import { join } from 'node:path';
|
|
6
6
|
|
7
7
|
import { fileURLToPath } from 'node:url';
|
8
8
|
const __dirname = fileURLToPath(new URL('.', import.meta.url));
|
9
|
+
globalThis.precompileCompilerPath = __dirname;
|
10
|
+
globalThis.precompile = true;
|
9
11
|
|
10
12
|
const argv = process.argv.slice();
|
11
13
|
|
@@ -14,7 +16,7 @@ const compile = async (file, [ _funcs, _globals ]) => {
|
|
14
16
|
let first = source.slice(0, source.indexOf('\n'));
|
15
17
|
|
16
18
|
if (first.startsWith('export default')) {
|
17
|
-
source = (await import(file)).default();
|
19
|
+
source = await (await import(file)).default();
|
18
20
|
first = source.slice(0, source.indexOf('\n'));
|
19
21
|
}
|
20
22
|
|
@@ -117,7 +119,7 @@ ${funcs.map(x => {
|
|
117
119
|
locals: ${JSON.stringify(Object.values(x.locals).slice(x.params.length).map(x => x.type))},
|
118
120
|
localNames: ${JSON.stringify(Object.keys(x.locals))},
|
119
121
|
${x.data && x.data.length > 0 ? ` data: ${JSON.stringify(x.data)},` : ''}
|
120
|
-
${x.table ? ` table: true` : ''}
|
122
|
+
${x.table ? ` table: true,` : ''}${x.constr ? ` constr: true,` : ''}
|
121
123
|
};`.replaceAll('\n\n', '\n').replaceAll('\n\n', '\n').replaceAll('\n\n', '\n');
|
122
124
|
}).join('\n')}
|
123
125
|
};`;
|
package/compiler/prototype.js
CHANGED
@@ -208,72 +208,6 @@ export const PrototypeFuncs = function() {
|
|
208
208
|
// ...number(1, Valtype.i32),
|
209
209
|
// [ Opcodes.i32_sub ]
|
210
210
|
// ]),
|
211
|
-
],
|
212
|
-
|
213
|
-
fill: (pointer, length, wElement, wType, iTmp, iTmp2) => [
|
214
|
-
...wElement,
|
215
|
-
[ Opcodes.local_set, iTmp ],
|
216
|
-
|
217
|
-
// use cached length i32 as pointer
|
218
|
-
...length.getCachedI32(),
|
219
|
-
|
220
|
-
// length - 1 for indexes
|
221
|
-
...number(1, Valtype.i32),
|
222
|
-
[ Opcodes.i32_sub ],
|
223
|
-
|
224
|
-
// * sizeof value
|
225
|
-
...number(ValtypeSize[valtype] + 1, Valtype.i32),
|
226
|
-
[ Opcodes.i32_mul ],
|
227
|
-
|
228
|
-
...length.setCachedI32(),
|
229
|
-
|
230
|
-
...(noUnlikelyChecks ? [] : [
|
231
|
-
...length.getCachedI32(),
|
232
|
-
...number(0, Valtype.i32),
|
233
|
-
[ Opcodes.i32_lt_s ],
|
234
|
-
[ Opcodes.if, Blocktype.void ],
|
235
|
-
...pointer,
|
236
|
-
Opcodes.i32_from_u,
|
237
|
-
[ Opcodes.br, 1 ],
|
238
|
-
[ Opcodes.end ]
|
239
|
-
]),
|
240
|
-
|
241
|
-
[ Opcodes.loop, Blocktype.void ],
|
242
|
-
|
243
|
-
// calculate offset
|
244
|
-
...length.getCachedI32(),
|
245
|
-
...pointer,
|
246
|
-
[ Opcodes.i32_add ],
|
247
|
-
[ Opcodes.local_set, iTmp2 ],
|
248
|
-
|
249
|
-
// store value
|
250
|
-
[ Opcodes.local_get, iTmp2 ],
|
251
|
-
[ Opcodes.local_get, iTmp ],
|
252
|
-
[ Opcodes.store, 0, ValtypeSize.i32 ],
|
253
|
-
|
254
|
-
// store type
|
255
|
-
[ Opcodes.local_get, iTmp2 ],
|
256
|
-
...wType,
|
257
|
-
[ Opcodes.i32_store8, 0, ValtypeSize.i32 + ValtypeSize[valtype] ],
|
258
|
-
|
259
|
-
// pointer - sizeof value
|
260
|
-
...length.getCachedI32(),
|
261
|
-
...number(ValtypeSize[valtype] + 1, Valtype.i32),
|
262
|
-
[ Opcodes.i32_sub ],
|
263
|
-
|
264
|
-
...length.setCachedI32(),
|
265
|
-
|
266
|
-
// if pointer >= 0, loop
|
267
|
-
...length.getCachedI32(),
|
268
|
-
...number(0, Valtype.i32),
|
269
|
-
[ Opcodes.i32_ge_s ],
|
270
|
-
[ Opcodes.br_if, 0 ],
|
271
|
-
|
272
|
-
[ Opcodes.end ],
|
273
|
-
|
274
|
-
// return this array
|
275
|
-
...pointer,
|
276
|
-
Opcodes.i32_from_u,
|
277
211
|
]
|
278
212
|
};
|
279
213
|
|
@@ -282,9 +216,6 @@ export const PrototypeFuncs = function() {
|
|
282
216
|
this[TYPES.array].push.noArgRetLength = true;
|
283
217
|
this[TYPES.array].push.local = Valtype.i32;
|
284
218
|
this[TYPES.array].pop.local = Valtype.i32;
|
285
|
-
this[TYPES.array].fill.local = valtypeBinary;
|
286
|
-
this[TYPES.array].fill.local2 = Valtype.i32;
|
287
|
-
this[TYPES.array].fill.returnType = TYPES.array;
|
288
219
|
|
289
220
|
this[TYPES.string] = {
|
290
221
|
at: (pointer, length, wIndex, wType, iTmp, _, arrayShell) => {
|
package/package.json
CHANGED
package/rhemyn/README.md
CHANGED
@@ -24,13 +24,16 @@ Made for use with Porffor but could possibly be adapted, implementation/library
|
|
24
24
|
- 🟢 digit, not digit (eg `\d\D`)
|
25
25
|
- 🟢 word, not word (eg `\w\W`)
|
26
26
|
- 🟢 whitespace, not whitespace (eg `\s\S`)
|
27
|
-
-
|
28
|
-
-
|
29
|
-
-
|
30
|
-
-
|
27
|
+
- 🟡 quantifiers
|
28
|
+
- 🟡 star (eg `a*`)
|
29
|
+
- 🟡 plus (eg `a+`)
|
30
|
+
- 🟡 optional (eg `a?`)
|
31
31
|
- 🟠 lazy modifier (eg `a*?`)
|
32
32
|
- 🔴 n repetitions (eg `a{4}`)
|
33
33
|
- 🔴 n-m repetitions (eg `a{2,4}`)
|
34
|
+
- 🟠 groups
|
35
|
+
- 🟠 capturing groups (`(a)`)
|
36
|
+
- 🔴 non-capturing groups (`(?:a)`)
|
34
37
|
- 🔴 assertions
|
35
38
|
- 🔴 beginning (eg `^a`)
|
36
39
|
- 🔴 end (eg `a$`)
|
package/rhemyn/compile.js
CHANGED
@@ -6,75 +6,78 @@ import { TYPES } from '../compiler/types.js';
|
|
6
6
|
|
7
7
|
// local indexes
|
8
8
|
const BasePointer = 0; // base string pointer
|
9
|
-
const
|
10
|
-
const
|
11
|
-
const
|
12
|
-
const
|
13
|
-
const
|
14
|
-
|
15
|
-
|
16
|
-
|
9
|
+
const Counter = 2; // what char we are running on
|
10
|
+
const Pointer = 3; // next char pointer
|
11
|
+
const Length = 4;
|
12
|
+
const Tmp = 5;
|
13
|
+
const QuantifierTmp = 6; // the temporary variable used for quanitifers
|
14
|
+
|
15
|
+
const doesSucceedZero = (node) => {
|
16
|
+
for (const n of node.body) {
|
17
|
+
if (n.type === "Group") {
|
18
|
+
if (!doesSucceedZero(node)) return false;
|
19
|
+
}
|
20
|
+
if (!n.quantifier || n.quantifier[0] > 0) {
|
21
|
+
return false;
|
22
|
+
}
|
23
|
+
}
|
24
|
+
return true;
|
25
|
+
}
|
26
|
+
|
17
27
|
const generate = (node, negated = false, get = true, stringSize = 2, func = 'test') => {
|
18
28
|
let out = [];
|
19
29
|
switch (node.type) {
|
20
30
|
case 'Expression':
|
21
|
-
|
31
|
+
let succeedsZero = doesSucceedZero(node);
|
32
|
+
|
22
33
|
out = [
|
23
34
|
// set length local
|
24
35
|
[ Opcodes.local_get, BasePointer ],
|
25
36
|
[ Opcodes.i32_load, Math.log2(ValtypeSize.i32) - 1, 0 ],
|
26
|
-
[ Opcodes.
|
37
|
+
[ Opcodes.local_tee, Length ],
|
27
38
|
|
28
|
-
|
39
|
+
...number(0, Valtype.i32),
|
40
|
+
[ Opcodes.i32_eq ],
|
41
|
+
[ Opcodes.if, Blocktype.void ],
|
42
|
+
...number(succeedsZero ? 1 : 0, Valtype.i32),
|
43
|
+
[ Opcodes.return ],
|
44
|
+
[ Opcodes.end ],
|
45
|
+
|
46
|
+
// pointer = base + sizeof i32
|
29
47
|
[ Opcodes.local_get, BasePointer ],
|
30
48
|
...number(ValtypeSize.i32, Valtype.i32),
|
31
49
|
[ Opcodes.i32_add ],
|
32
|
-
[ Opcodes.local_set, IterPointer ],
|
33
|
-
|
34
|
-
[ Opcodes.loop, Blocktype.void ],
|
35
|
-
|
36
|
-
// reset pointer as iter pointer
|
37
|
-
[ Opcodes.local_get, IterPointer ],
|
38
50
|
[ Opcodes.local_set, Pointer ],
|
39
51
|
|
40
|
-
[ Opcodes.
|
41
|
-
|
42
|
-
|
43
|
-
|
44
|
-
|
45
|
-
|
46
|
-
|
47
|
-
|
48
|
-
|
49
|
-
|
50
|
-
|
51
|
-
|
52
|
-
[ Opcodes.
|
53
|
-
]
|
54
|
-
|
55
|
-
|
56
|
-
|
57
|
-
|
58
|
-
|
59
|
-
|
60
|
-
|
61
|
-
|
62
|
-
|
63
|
-
|
64
|
-
|
65
|
-
|
66
|
-
[ Opcodes.local_get, Counter ],
|
67
|
-
...number(1, Valtype.i32),
|
68
|
-
[ Opcodes.i32_add ],
|
69
|
-
[ Opcodes.local_tee, Counter ],
|
70
|
-
|
71
|
-
[ Opcodes.local_get, Length ],
|
72
|
-
[ Opcodes.i32_ne ],
|
73
|
-
|
74
|
-
[ Opcodes.br_if, 0 ],
|
52
|
+
[ Opcodes.loop, Blocktype.void ],
|
53
|
+
[ Opcodes.block, Blocktype.void ],
|
54
|
+
// generate checks
|
55
|
+
...node.body.flatMap(x => generate(x, negated, true, stringSize, func)),
|
56
|
+
|
57
|
+
// reached end without branching out, successful match
|
58
|
+
...({
|
59
|
+
test: number(1, Valtype.i32),
|
60
|
+
search: [
|
61
|
+
[ Opcodes.local_get, Counter ]
|
62
|
+
]
|
63
|
+
})[func],
|
64
|
+
[ Opcodes.return ],
|
65
|
+
[ Opcodes.end ],
|
66
|
+
|
67
|
+
// counter++, if length > counter, loop
|
68
|
+
[ Opcodes.local_get, Length ],
|
69
|
+
|
70
|
+
[ Opcodes.local_get, Counter ],
|
71
|
+
...number(1, Valtype.i32),
|
72
|
+
[ Opcodes.i32_add ],
|
73
|
+
[ Opcodes.local_tee, Counter ],
|
74
|
+
|
75
|
+
[ Opcodes.i32_gt_s ],
|
76
|
+
|
77
|
+
[ Opcodes.br_if, 0 ],
|
75
78
|
[ Opcodes.end ],
|
76
79
|
|
77
|
-
// no match
|
80
|
+
// no match
|
78
81
|
...number(({
|
79
82
|
test: 0,
|
80
83
|
search: -1
|
@@ -110,12 +113,12 @@ const generate = (node, negated = false, get = true, stringSize = 2, func = 'tes
|
|
110
113
|
return out;
|
111
114
|
};
|
112
115
|
|
113
|
-
const getNextChar = (stringSize) => [
|
116
|
+
const getNextChar = (stringSize, peek = false) => [
|
114
117
|
// get char from pointer
|
115
118
|
[ Opcodes.local_get, Pointer ],
|
116
119
|
[ stringSize == 2 ? Opcodes.i32_load16_u : Opcodes.i32_load8_u, 0, 0 ],
|
117
120
|
|
118
|
-
...(
|
121
|
+
...(peek ? [] : [
|
119
122
|
// pointer += string size
|
120
123
|
[ Opcodes.local_get, Pointer ],
|
121
124
|
...number(stringSize, Valtype.i32),
|
@@ -134,37 +137,123 @@ const checkFailure = () => [
|
|
134
137
|
[ Opcodes.br_if, 0 ]
|
135
138
|
];
|
136
139
|
|
137
|
-
const
|
140
|
+
const wrapQuantifier = (node, method, get, stringSize) => {
|
141
|
+
const [ min, max ] = node.quantifier;
|
138
142
|
return [
|
139
|
-
|
143
|
+
// initalize our temp value (number of matched characters)
|
144
|
+
...number(0, Valtype.i32),
|
145
|
+
[Opcodes.local_set, QuantifierTmp],
|
146
|
+
|
147
|
+
// if len - counter == 0, if min == 0, succeed, else fail
|
148
|
+
[ Opcodes.local_get, Length ],
|
149
|
+
[ Opcodes.local_get, Counter ],
|
150
|
+
[ Opcodes.i32_sub ],
|
151
|
+
...number(0, Valtype.i32),
|
152
|
+
[ Opcodes.i32_eq ],
|
153
|
+
...(min == 0 ? [
|
154
|
+
[ Opcodes.if, Blocktype.void ],
|
155
|
+
] : [
|
156
|
+
[ Opcodes.br_if, 0 ],
|
157
|
+
]),
|
158
|
+
|
159
|
+
// start loop
|
160
|
+
[Opcodes.loop, Blocktype.void],
|
161
|
+
[ Opcodes.block, Blocktype.void ],
|
162
|
+
// if counter + tmp == length, break
|
163
|
+
[ Opcodes.local_get, Counter ],
|
164
|
+
[ Opcodes.local_get, QuantifierTmp ],
|
165
|
+
[ Opcodes.i32_add ],
|
166
|
+
[ Opcodes.local_get, Length ],
|
167
|
+
[ Opcodes.i32_eq ],
|
168
|
+
[ Opcodes.br_if, 0 ],
|
169
|
+
|
170
|
+
// if doesn't match, break
|
171
|
+
...method,
|
172
|
+
[Opcodes.br_if, 0 ],
|
173
|
+
...(get ? [
|
174
|
+
// pointer += stringSize
|
175
|
+
[ Opcodes.local_get, Pointer ],
|
176
|
+
...number(stringSize, Valtype.i32),
|
177
|
+
[ Opcodes.i32_add ],
|
178
|
+
[ Opcodes.local_set, Pointer ]
|
179
|
+
] : []),
|
180
|
+
|
181
|
+
// if maximum was reached, break
|
182
|
+
...(max ? [
|
183
|
+
[ Opcodes.local_get, QuantifierTmp ],
|
184
|
+
...number(max, Valtype.i32),
|
185
|
+
[ Opcodes.i32_eq ],
|
186
|
+
[ Opcodes.br_if, 0 ]
|
187
|
+
] : []),
|
188
|
+
|
189
|
+
[ Opcodes.local_get, QuantifierTmp ],
|
190
|
+
...number(1, Valtype.i32),
|
191
|
+
[ Opcodes.i32_add ],
|
192
|
+
[ Opcodes.local_set, QuantifierTmp ],
|
193
|
+
[ Opcodes.br, 1 ],
|
194
|
+
[ Opcodes.end ],
|
195
|
+
[ Opcodes.end ],
|
196
|
+
|
197
|
+
// if less than minimum, fail
|
198
|
+
[Opcodes.local_get, QuantifierTmp],
|
199
|
+
...number(min, Valtype.i32),
|
200
|
+
[Opcodes.i32_lt_s],
|
201
|
+
...(get ? checkFailure(): []),
|
202
|
+
|
203
|
+
...(min == 0 ? [ [ Opcodes.end ] ] : []),
|
204
|
+
];
|
205
|
+
}
|
206
|
+
|
207
|
+
const generateChar = (node, negated, get, stringSize) => {
|
208
|
+
const hasQuantifier = !!node.quantifier;
|
209
|
+
const out = [
|
210
|
+
...(get ? getNextChar(stringSize, hasQuantifier) : []),
|
140
211
|
...number(node.char.charCodeAt(0), Valtype.i32),
|
141
212
|
negated ? [ Opcodes.i32_eq ] : [ Opcodes.i32_ne ],
|
142
|
-
|
213
|
+
];
|
214
|
+
|
215
|
+
if (node.quantifier) {
|
216
|
+
return wrapQuantifier(node, out, get, stringSize);
|
217
|
+
}
|
218
|
+
|
219
|
+
return [
|
220
|
+
...out,
|
221
|
+
...(get ? checkFailure(): []),
|
143
222
|
];
|
144
223
|
};
|
145
224
|
|
146
225
|
const generateSet = (node, negated, get, stringSize) => {
|
147
226
|
// for a single char we do not need a tmp, it is like just
|
148
227
|
const singleChar = node.body.length === 1 && node.body[0].type === 'Character';
|
228
|
+
if (singleChar) return generateChar(node.body[0], negated, get, stringSize)
|
149
229
|
|
150
|
-
|
151
|
-
|
152
|
-
|
230
|
+
const hasQuantifier = !!node.quantifier;
|
231
|
+
|
232
|
+
const out = [
|
233
|
+
...(get ? getNextChar(stringSize, hasQuantifier) : []),
|
234
|
+
[ Opcodes.local_set, Tmp ],
|
153
235
|
];
|
154
236
|
|
155
237
|
for (const x of node.body) {
|
156
|
-
out
|
157
|
-
|
158
|
-
...(singleChar ? [] : [ [ Opcodes.local_get, Tmp ] ]),
|
238
|
+
out.push(
|
239
|
+
[ Opcodes.local_get, Tmp ],
|
159
240
|
...generate(x, negated, false, stringSize)
|
160
|
-
|
241
|
+
);
|
161
242
|
}
|
162
243
|
|
163
|
-
if (node.body.length > 0)
|
244
|
+
if (node.body.length > 0) {
|
245
|
+
for (let i = 0; i < node.body.length - 1; i++) {
|
246
|
+
out.push(negated ? [ Opcodes.i32_or ] : [ Opcodes.i32_and ])
|
247
|
+
}
|
248
|
+
};
|
249
|
+
|
250
|
+
if (hasQuantifier) {
|
251
|
+
return wrapQuantifier(node, out, get, stringSize);
|
252
|
+
}
|
164
253
|
|
165
254
|
return [
|
166
255
|
...out,
|
167
|
-
...checkFailure()
|
256
|
+
...checkFailure(),
|
168
257
|
];
|
169
258
|
};
|
170
259
|
|
@@ -206,28 +295,33 @@ const wrapFunc = (regex, func, name, index) => {
|
|
206
295
|
// bytestring
|
207
296
|
...generate(parsed, false, true, 1, func),
|
208
297
|
[ Opcodes.end ]
|
209
|
-
], name, index);
|
298
|
+
], name, index, types[func]);
|
210
299
|
};
|
211
300
|
|
212
301
|
export const test = (regex, index = 0, name = 'regex_test_' + regex) => wrapFunc(regex, 'test', name, index);
|
213
302
|
export const search = (regex, index = 0, name = 'regex_search_' + regex) => wrapFunc(regex, 'search', name, index);
|
214
303
|
|
215
|
-
const
|
304
|
+
export const types = {
|
305
|
+
test: TYPES.boolean,
|
306
|
+
search: TYPES.number
|
307
|
+
};
|
308
|
+
|
309
|
+
const outputFunc = (wasm, name, index, returnType) => ({
|
216
310
|
name,
|
217
311
|
index,
|
218
312
|
wasm,
|
313
|
+
returnType,
|
219
314
|
|
220
315
|
export: true,
|
221
316
|
params: [ Valtype.i32, Valtype.i32 ],
|
222
317
|
returns: [ Valtype.i32 ],
|
223
|
-
returnType: TYPES.boolean,
|
224
318
|
locals: {
|
225
319
|
basePointer: { idx: 0, type: Valtype.i32 },
|
226
|
-
|
227
|
-
|
228
|
-
|
229
|
-
|
230
|
-
|
231
|
-
|
320
|
+
inputType: { idx: 1, type: Valtype.i32 },
|
321
|
+
counter: { idx: 2, type: Valtype.i32 },
|
322
|
+
pointer: { idx: 3, type: Valtype.i32 },
|
323
|
+
length: { idx: 4, type: Valtype.i32 },
|
324
|
+
tmp: { idx: 5, type: Valtype.i32 },
|
325
|
+
quantifierTmp: { idx: 6, type: Valtype.i32 },
|
232
326
|
}
|
233
327
|
});
|
package/runner/index.js
CHANGED
@@ -1,5 +1,6 @@
|
|
1
1
|
#!/usr/bin/env node
|
2
2
|
import fs from 'node:fs';
|
3
|
+
globalThis.version = '0.18.3+945765df9';
|
3
4
|
|
4
5
|
// deno compat
|
5
6
|
if (typeof process === 'undefined' && typeof Deno !== 'undefined') {
|
@@ -22,7 +23,7 @@ if (process.argv.includes('--compile-hints')) {
|
|
22
23
|
|
23
24
|
if (process.argv.includes('--help')) {
|
24
25
|
// description + version
|
25
|
-
console.log(`\x1B[1m\x1B[35mPorffor\x1B[0m is a JavaScript engine/runtime/compiler. \x1B[90m(${
|
26
|
+
console.log(`\x1B[1m\x1B[35mPorffor\x1B[0m is a JavaScript engine/runtime/compiler. \x1B[90m(${globalThis.version})\x1B[0m`);
|
26
27
|
|
27
28
|
// basic usage
|
28
29
|
console.log(`Usage: \x1B[1mporf [command] path/to/script.js [...prefs] [...args]\x1B[0m`);
|
@@ -102,7 +103,7 @@ globalThis.file = file;
|
|
102
103
|
if (!file) {
|
103
104
|
if (process.argv.includes('-v') || process.argv.includes('--version')) {
|
104
105
|
// just print version
|
105
|
-
console.log(
|
106
|
+
console.log(globalThis.version);
|
106
107
|
process.exit(0);
|
107
108
|
}
|
108
109
|
|
package/runner/repl.js
CHANGED
@@ -1,6 +1,5 @@
|
|
1
1
|
import { TYPE_NAMES } from '../compiler/types.js';
|
2
2
|
import compile from '../compiler/wrap.js';
|
3
|
-
import version from './version.js';
|
4
3
|
|
5
4
|
import util from 'node:util';
|
6
5
|
|
@@ -32,7 +31,7 @@ if (host.startsWith('Node')) host = '\x1B[92m' + host;
|
|
32
31
|
if (host.startsWith('Deno')) host = '\x1B[97m' + host;
|
33
32
|
if (host.startsWith('Bun')) host = '\x1B[93m' + host;
|
34
33
|
|
35
|
-
console.log(`Welcome to \x1B[1m\x1B[35mPorffor\x1B[0m \x1B[90m(${version})\x1B[0m running on \x1B[1m${host.replace('/', ' \x1B[0m\x1B[90m(')})\x1B[0m`);
|
34
|
+
console.log(`Welcome to \x1B[1m\x1B[35mPorffor\x1B[0m \x1B[90m(${globalThis.version})\x1B[0m running on \x1B[1m${host.replace('/', ' \x1B[0m\x1B[90m(')})\x1B[0m`);
|
36
35
|
console.log(`\x1B[90musing opt ${process.argv.find(x => x.startsWith('-O')) ?? '-O1'}, parser ${parser}, valtype ${valtype}\x1B[0m`);
|
37
36
|
console.log();
|
38
37
|
|
package/runner/version.js
DELETED
@@ -1,12 +0,0 @@
|
|
1
|
-
import { readFileSync } from 'node:fs';
|
2
|
-
|
3
|
-
export let version = 'unknown';
|
4
|
-
export let rev = 'unknown';
|
5
|
-
|
6
|
-
const packageJson = JSON.parse(readFileSync(new URL('../package.json', import.meta.url), 'utf8'));
|
7
|
-
version = packageJson.version.split('-')[0];
|
8
|
-
rev = packageJson.version.split('-')[1];
|
9
|
-
|
10
|
-
if (!rev) rev = readFileSync(new URL('../.git/refs/heads/main', import.meta.url), 'utf8').trim().slice(0, 9);
|
11
|
-
|
12
|
-
export default `${version}-${rev}`;
|