porffor 0.0.0-a2afb57 → 0.0.0-afb21d1

package/README.md

@@ -1,4 +1,4 @@
-# porffor
+# porffor &nbsp;<sup><sub>/ˈpɔrfɔr/ &nbsp;*(poor-for)*</sup></sub>
 a basic experimental wip *aot* optimizing js -> wasm/c engine/compiler/runtime in js. not serious/intended for (real) use. (this is a straight forward, honest readme)<br>
 age: ~2 months
 

package/compiler/builtins.js

@@ -1,6 +1,5 @@
 import { Blocktype, Opcodes, Valtype } from "./wasmSpec.js";
 import { number, i32x4 } from "./embedding.js";
-import { signedLEB128 } from "./encoding.js";
 
 export const importedFuncs = [
   {
@@ -416,13 +415,13 @@ export const BuiltinFuncs = function() {
     wasm: [
       // setup: s1 = state0, s0 = state1, state0 = s0
       [ Opcodes.global_get, 0 ], // state0
-      [ Opcodes.local_set, 0 ], // s1
+      [ Opcodes.local_tee, 0 ], // s1
       [ Opcodes.global_get, 1 ], // state1
       [ Opcodes.local_tee, 1, ], // s0
       [ Opcodes.global_set, 0 ], // state0
 
       // s1 ^= s1 << 23
-      [ Opcodes.local_get, 0 ], // s1
+      // [ Opcodes.local_get, 0 ], // s1
       [ Opcodes.local_get, 0 ], // s1
       [ Opcodes.i64_const, 23 ],
       [ Opcodes.i64_shl ], // <<
@@ -452,20 +451,24 @@ export const BuiltinFuncs = function() {
 
       // you thought it was over? now we need the result as a f64 between 0-1 :)
 
-      // mantissa = (state1 + s0) & ((1 << 53) - 1)
+      // state1 + s0
       [ Opcodes.global_get, 1 ], // state1
       [ Opcodes.local_get, 1 ], // s0
       [ Opcodes.i64_add ],
 
-      [ Opcodes.i64_const, ...signedLEB128((1 << 53) - 1) ],
-      [ Opcodes.i64_and ],
+      // should we >> 12 here?
+      // it feels like it but it breaks values
+
+      // | 0x3FF0000000000000
+      [ Opcodes.i64_const, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0xf8, 0x3f ],
+      [ Opcodes.i64_or ],
 
-      // double(mantissa)
-      [ Opcodes.f64_convert_i64_u ],
+      // bit cast as f64
+      [ Opcodes.f64_reinterpret_i64 ],
 
-      // / (1 << 53)
-      ...number(1 << 53),
-      [ Opcodes.f64_div ]
+      // - 1
+      ...number(1),
+      [ Opcodes.f64_sub ],
     ]
   };
 

package/compiler/parse.js

@@ -1,4 +1,3 @@
-// import { parse } from 'acorn';
 const { parse } = (await import(globalThis.document ? 'https://esm.sh/acorn' : 'acorn'));
 
 export default (input, flags) => {

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "porffor",
   "description": "a basic experimental wip aot optimizing js -> wasm engine/compiler/runtime in js",
-  "version": "0.0.0-a2afb57",
+  "version": "0.0.0-afb21d1",
   "author": "CanadaHonk",
   "license": "MIT",
   "dependencies": {

package/rhemyn/compile.js

@@ -1,214 +1,214 @@
-import { Blocktype, Opcodes, Valtype, PageSize, ValtypeSize } from '../compiler/wasmSpec.js';
-import { number } from '../compiler/embedding.js';
-import { signedLEB128, unsignedLEB128 } from '../compiler/encoding.js';
-import parse from './parse.js';
-
-// local indexes
-const BasePointer = 0; // base string pointer
-const IterPointer = 1; // this iteration base pointer
-const EndPointer = 2; // pointer for the end
-const Counter = 3; // what char we are running on
-const Pointer = 4; // next char BYTE pointer
-const Length = 5;
-const Tmp = 6;
-
-let exprLastGet = false;
-const generate = (node, negated = false, get = true, func = 'test') => {
-  let out = [];
-  switch (node.type) {
-    case 'Expression':
-      exprLastGet = false;
-      out = [
-        // set length local
-        [ Opcodes.local_get, BasePointer ],
-        [ Opcodes.i32_load, Math.log2(ValtypeSize.i32) - 1, 0 ],
-        [ Opcodes.local_set, Length ],
-
-        // set iter pointer local as base + sizeof i32 initially
-        [ Opcodes.local_get, BasePointer ],
-        ...number(ValtypeSize.i32, Valtype.i32),
-        [ Opcodes.i32_add ],
-        [ Opcodes.local_set, IterPointer ],
-
-        [ Opcodes.loop, Blocktype.void ],
-
-        // reset pointer as iter pointer
-        [ Opcodes.local_get, IterPointer ],
-        [ Opcodes.local_set, Pointer ],
-
-        [ Opcodes.block, Blocktype.void ],
-
-        // generate checks
-        ...node.body.flatMap((x, i) => {
-          exprLastGet = x.type !== 'Group' && i === (node.body.length - 1);
-          return generate(x, negated);
-        }),
-
-        // reached end without branching out, successful match
-        ...({
-          test: number(1, Valtype.i32),
-          search: [
-            [ Opcodes.local_get, Counter ]
-          ]
-        })[func],
-        [ Opcodes.return ],
-
-        [ Opcodes.end ],
-
-        // increment iter pointer by sizeof i16
-        [ Opcodes.local_get, IterPointer ],
-        ...number(ValtypeSize.i16, Valtype.i32),
-        [ Opcodes.i32_add ],
-        [ Opcodes.local_set, IterPointer ],
-
-        // increment counter by 1, check if eq length, if not loop
-        [ Opcodes.local_get, Counter ],
-        ...number(1, Valtype.i32),
-        [ Opcodes.i32_add ],
-        [ Opcodes.local_tee, Counter ],
-
-        [ Opcodes.local_get, Length ],
-        [ Opcodes.i32_ne ],
-
-        [ Opcodes.br_if, 0 ],
-        [ Opcodes.end ],
-
-        // no match, return 0
-        ...number(({
-          test: 0,
-          search: -1
-        })[func], Valtype.i32)
-      ];
-
-      if (globalThis.regexLog) {
-        const underline = x => `\u001b[4m\u001b[1m${x}\u001b[0m`;
-        console.log(`\n${underline('ast')}`);
-        console.log(node);
-        console.log(`\n${underline('wasm bytecode')}\n` + decompile(out) + '\n');
-      }
-
-      break;
-
-    case 'Character':
-      out = generateChar(node, node.negated ^ negated, get);
-      break;
-
-    case 'Set':
-      out = generateSet(node, node.negated, get);
-      break;
-
-    case 'Group':
-      out = generateGroup(node, negated, get);
-      break;
-
-    case 'Range':
-      out = generateRange(node, negated, get);
-      break;
-  }
-
-  return out;
-};
-
-const getNextChar = () => [
-  // get char from pointer
-  [ Opcodes.local_get, Pointer ],
-  [ Opcodes.i32_load16_u, Math.log2(ValtypeSize.i16) - 1, ...unsignedLEB128(0) ],
-
-  ...(exprLastGet ? [] : [
-    // pointer += sizeof i16
-    [ Opcodes.local_get, Pointer ],
-    ...number(ValtypeSize.i16, Valtype.i32),
-    [ Opcodes.i32_add ],
-    [ Opcodes.local_set, Pointer ]
-  ])
-];
-
-const checkFailure = () => [
-  // surely we do not need to do this for every single mismatch, right?
-  /* [ Opcodes.if, Blocktype.void ],
-  ...number(0, Valtype.i32),
-  [ Opcodes.return ],
-  [ Opcodes.end ], */
-
-  [ Opcodes.br_if, 0 ]
-];
-
-const generateChar = (node, negated, get) => {
-  return [
-    ...(get ? getNextChar() : []),
-    ...number(node.char.charCodeAt(0), Valtype.i32),
-    negated ? [ Opcodes.i32_eq ] : [ Opcodes.i32_ne ],
-    ...(get ? checkFailure(): [])
-  ];
-};
-
-const generateSet = (node, negated, get) => {
-  // for a single char we do not need a tmp, it is like just
-  const singleChar = node.body.length === 1 && node.body[0].type === 'Character';
-
-  let out = [
-    ...(get ? getNextChar() : []),
-    ...(singleChar ? [] : [ [ Opcodes.local_set, Tmp ] ]),
-  ];
-
-  for (const x of node.body) {
-    out = [
-      ...out,
-      ...(singleChar ? [] : [ [ Opcodes.local_get, Tmp ] ]),
-      ...generate(x, negated, false)
-    ];
-  }
-
-  out = out.concat(new Array(node.body.length - 1).fill(negated ? [ Opcodes.i32_or ] : [ Opcodes.i32_and ]));
-
-  return [
-    ...out,
-    ...checkFailure()
-  ];
-};
-
-const generateRange = (node, negated, get) => {
-  return [
-    ...(get ? getNextChar() : []),
-    ...(get ? [ [ Opcodes.local_tee, Tmp ] ] : []),
-
-    ...number(node.from.charCodeAt(0), Valtype.i32),
-    // negated ? [ Opcodes.i32_lt_s ] : [ Opcodes.i32_ge_s ],
-    negated ? [ Opcodes.i32_ge_s ] : [ Opcodes.i32_lt_s ],
-
-    [ Opcodes.local_get, Tmp ],
-    ...number(node.to.charCodeAt(0), Valtype.i32),
-    // negated ? [ Opcodes.i32_gt_s ] : [ Opcodes.i32_le_s ],
-    negated ? [ Opcodes.i32_le_s ] : [ Opcodes.i32_gt_s ],
-
-    negated ? [ Opcodes.i32_and ] : [ Opcodes.i32_or ],
-    ...(get ? checkFailure(): [])
-  ];
-};
-
-const generateGroup = (node, negated, get) => {
-
-};
-
-export const test = (regex, index = 0, name = 'regex_test_' + regex) => outputFunc(generate(parse(regex), false, true, 'test'), name, index);
-export const search = (regex, index = 0, name = 'regex_search_' + regex) => outputFunc(generate(parse(regex), false, true, 'search'), name, index);
-
-const outputFunc = (wasm, name, index) => ({
-  name,
-  index,
-  wasm,
-
-  export: true,
-  params: [ Valtype.i32 ],
-  returns: [ Valtype.i32 ],
-  returnType: 0xffffffffffff1, // boolean - todo: do not hardcode this
-  locals: {
-    basePointer: { idx: 0, type: Valtype.i32 },
-    iterPointer: { idx: 1, type: Valtype.i32 },
-    endPointer: { idx: 2, type: Valtype.i32 },
-    counter: { idx: 3, type: Valtype.i32 },
-    pointer: { idx: 4, type: Valtype.i32 },
-    length: { idx: 5, type: Valtype.i32 },
-    tmp: { idx: 6, type: Valtype.i32 },
-  }
+import { Blocktype, Opcodes, Valtype, PageSize, ValtypeSize } from '../compiler/wasmSpec.js';
+import { number } from '../compiler/embedding.js';
+import { signedLEB128, unsignedLEB128 } from '../compiler/encoding.js';
+import parse from './parse.js';
+
+// local indexes
+const BasePointer = 0; // base string pointer
+const IterPointer = 1; // this iteration base pointer
+const EndPointer = 2; // pointer for the end
+const Counter = 3; // what char we are running on
+const Pointer = 4; // next char BYTE pointer
+const Length = 5;
+const Tmp = 6;
+
+let exprLastGet = false;
+const generate = (node, negated = false, get = true, func = 'test') => {
+  let out = [];
+  switch (node.type) {
+    case 'Expression':
+      exprLastGet = false;
+      out = [
+        // set length local
+        [ Opcodes.local_get, BasePointer ],
+        [ Opcodes.i32_load, Math.log2(ValtypeSize.i32) - 1, ...unsignedLEB128(0) ],
+        [ Opcodes.local_set, Length ],
+
+        // set iter pointer local as base + sizeof i32 initially
+        [ Opcodes.local_get, BasePointer ],
+        ...number(ValtypeSize.i32, Valtype.i32),
+        [ Opcodes.i32_add ],
+        [ Opcodes.local_set, IterPointer ],
+
+        [ Opcodes.loop, Blocktype.void ],
+
+        // reset pointer as iter pointer
+        [ Opcodes.local_get, IterPointer ],
+        [ Opcodes.local_set, Pointer ],
+
+        [ Opcodes.block, Blocktype.void ],
+
+        // generate checks
+        ...node.body.flatMap((x, i) => {
+          exprLastGet = x.type !== 'Group' && i === (node.body.length - 1);
+          return generate(x, negated);
+        }),
+
+        // reached end without branching out, successful match
+        ...({
+          test: number(1, Valtype.i32),
+          search: [
+            [ Opcodes.local_get, Counter ]
+          ]
+        })[func],
+        [ Opcodes.return ],
+
+        [ Opcodes.end ],
+
+        // increment iter pointer by sizeof i16
+        [ Opcodes.local_get, IterPointer ],
+        ...number(ValtypeSize.i16, Valtype.i32),
+        [ Opcodes.i32_add ],
+        [ Opcodes.local_set, IterPointer ],
+
+        // increment counter by 1, check if eq length, if not loop
+        [ Opcodes.local_get, Counter ],
+        ...number(1, Valtype.i32),
+        [ Opcodes.i32_add ],
+        [ Opcodes.local_tee, Counter ],
+
+        [ Opcodes.local_get, Length ],
+        [ Opcodes.i32_ne ],
+
+        [ Opcodes.br_if, 0 ],
+        [ Opcodes.end ],
+
+        // no match, return 0
+        ...number(({
+          test: 0,
+          search: -1
+        })[func], Valtype.i32)
+      ];
+
+      if (globalThis.regexLog) {
+        const underline = x => `\u001b[4m\u001b[1m${x}\u001b[0m`;
+        console.log(`\n${underline('ast')}`);
+        console.log(node);
+        console.log(`\n${underline('wasm bytecode')}\n` + decompile(out) + '\n');
+      }
+
+      break;
+
+    case 'Character':
+      out = generateChar(node, node.negated ^ negated, get);
+      break;
+
+    case 'Set':
+      out = generateSet(node, node.negated, get);
+      break;
+
+    case 'Group':
+      out = generateGroup(node, negated, get);
+      break;
+
+    case 'Range':
+      out = generateRange(node, negated, get);
+      break;
+  }
+
+  return out;
+};
+
+const getNextChar = () => [
+  // get char from pointer
+  [ Opcodes.local_get, Pointer ],
+  [ Opcodes.i32_load16_u, Math.log2(ValtypeSize.i16) - 1, ...unsignedLEB128(0) ],
+
+  ...(exprLastGet ? [] : [
+    // pointer += sizeof i16
+    [ Opcodes.local_get, Pointer ],
+    ...number(ValtypeSize.i16, Valtype.i32),
+    [ Opcodes.i32_add ],
+    [ Opcodes.local_set, Pointer ]
+  ])
+];
+
+const checkFailure = () => [
+  // surely we do not need to do this for every single mismatch, right?
+  /* [ Opcodes.if, Blocktype.void ],
+  ...number(0, Valtype.i32),
+  [ Opcodes.return ],
+  [ Opcodes.end ], */
+
+  [ Opcodes.br_if, 0 ]
+];
+
+const generateChar = (node, negated, get) => {
+  return [
+    ...(get ? getNextChar() : []),
+    ...number(node.char.charCodeAt(0), Valtype.i32),
+    negated ? [ Opcodes.i32_eq ] : [ Opcodes.i32_ne ],
+    ...(get ? checkFailure(): [])
+  ];
+};
+
+const generateSet = (node, negated, get) => {
+  // for a single char we do not need a tmp, it is like just
+  const singleChar = node.body.length === 1 && node.body[0].type === 'Character';
+
+  let out = [
+    ...(get ? getNextChar() : []),
+    ...(singleChar ? [] : [ [ Opcodes.local_set, Tmp ] ]),
+  ];
+
+  for (const x of node.body) {
+    out = [
+      ...out,
+      ...(singleChar ? [] : [ [ Opcodes.local_get, Tmp ] ]),
+      ...generate(x, negated, false)
+    ];
+  }
+
+  out = out.concat(new Array(node.body.length - 1).fill(negated ? [ Opcodes.i32_or ] : [ Opcodes.i32_and ]));
+
+  return [
+    ...out,
+    ...checkFailure()
+  ];
+};
+
+const generateRange = (node, negated, get) => {
+  return [
+    ...(get ? getNextChar() : []),
+    ...(get ? [ [ Opcodes.local_tee, Tmp ] ] : []),
+
+    ...number(node.from.charCodeAt(0), Valtype.i32),
+    // negated ? [ Opcodes.i32_lt_s ] : [ Opcodes.i32_ge_s ],
+    negated ? [ Opcodes.i32_ge_s ] : [ Opcodes.i32_lt_s ],
+
+    [ Opcodes.local_get, Tmp ],
+    ...number(node.to.charCodeAt(0), Valtype.i32),
+    // negated ? [ Opcodes.i32_gt_s ] : [ Opcodes.i32_le_s ],
+    negated ? [ Opcodes.i32_le_s ] : [ Opcodes.i32_gt_s ],
+
+    negated ? [ Opcodes.i32_and ] : [ Opcodes.i32_or ],
+    ...(get ? checkFailure(): [])
+  ];
+};
+
+const generateGroup = (node, negated, get) => {
+
+};
+
+export const test = (regex, index = 0, name = 'regex_test_' + regex) => outputFunc(generate(parse(regex), false, true, 'test'), name, index);
+export const search = (regex, index = 0, name = 'regex_search_' + regex) => outputFunc(generate(parse(regex), false, true, 'search'), name, index);
+
+const outputFunc = (wasm, name, index) => ({
+  name,
+  index,
+  wasm,
+
+  export: true,
+  params: [ Valtype.i32 ],
+  returns: [ Valtype.i32 ],
+  returnType: 0xffffffffffff1, // boolean - todo: do not hardcode this
+  locals: {
+    basePointer: { idx: 0, type: Valtype.i32 },
+    iterPointer: { idx: 1, type: Valtype.i32 },
+    endPointer: { idx: 2, type: Valtype.i32 },
+    counter: { idx: 3, type: Valtype.i32 },
+    pointer: { idx: 4, type: Valtype.i32 },
+    length: { idx: 5, type: Valtype.i32 },
+    tmp: { idx: 6, type: Valtype.i32 },
+  }
 });

package/runner/index.js

@@ -34,14 +34,12 @@ const source = fs.readFileSync(file, 'utf8');
 
 let cache = '';
 const print = str => {
-  /* cache += str;
+  cache += str;
 
   if (str === '\n') {
     process.stdout.write(cache);
     cache = '';
-  } */
-
-  process.stdout.write(str);
+  }
 };
 
 try {
@@ -51,5 +49,5 @@ try {
   if (cache) process.stdout.write(cache);
 } catch (e) {
   if (cache) process.stdout.write(cache);
-  console.error(process.argv.includes('-i') ? e : `${e.constructor.name}: ${e.message}`);
+  console.error(`${e.constructor.name}: ${e.message}`);
 }

package/runner/info.js

@@ -36,7 +36,7 @@ const print = str => {
 };
 
 const t0 = performance.now();
-const { wasm, exports, pages } = await compile(source, raw ? [ 'module' ] : [ 'module', 'info' ], {}, print);
+const { wasm, exports } = await compile(source, raw ? [ 'module' ] : [ 'module', 'info' ], {}, print);
 
 if (!raw && typeof Deno === 'undefined') fs.writeFileSync('out.wasm', Buffer.from(wasm));
 
@@ -51,39 +51,4 @@ if (!process.argv.includes('-no-run')) {
 }
 
 if (!raw) console.log(bold(`wasm binary is ${wasm.byteLength} bytes`));
-if (!raw) console.log(`total: ${(performance.now() - t0).toFixed(2)}ms`);
-
-if (!raw && process.argv.includes('-mem') && exports.$) {
-  console.log();
-
-  let lastMemory, lastPages;
-  const PageSize = 65536;
-  const memoryToString = mem => {
-    let out = '';
-    const pages = lastPages.length;
-    const wasmPages = mem.buffer.byteLength / PageSize;
-
-    out += `\x1B[1mallocated ${mem.buffer.byteLength / 1024}KiB\x1B[0m for ${pages} things using ${wasmPages} Wasm page${wasmPages === 1 ? '' : 's'}\n`;
-
-    const buf = new Uint8Array(mem.buffer);
-
-    for (let i = 0; i < pages; i++) {
-      out += `\x1B[36m${lastPages[i]}\x1B[2m | \x1B[0m`;
-
-      for (let j = 0; j < 50; j++) {
-        const val = buf[i * pageSize + j];
-        if (val === 0) out += '\x1B[2m';
-        out += val.toString(16).padStart(2, '0');
-        if (val === 0) out += '\x1B[0m';
-        out += ' ';
-      }
-      out += '\n';
-    }
-
-    return out;
-  };
-
-  lastPages = [...pages.keys()];
-  lastMemory = exports.$;
-  console.log(memoryToString(lastMemory));
-}
+if (!raw) console.log(`total: ${(performance.now() - t0).toFixed(2)}ms`);

package/compiler/builtins/base64.js

@@ -1,92 +0,0 @@
-var btoa_a = str => {
-  // todo: throw invalid character for unicode
-
-  const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
-  const mask = (1 << 6) - 1;
-
-  let out = '';
-  let bits = 0, buffer = 0;
-  for (let i = 0; i < str.length; i++) {
-    buffer = (buffer << 8) | (0xff & str.charCodeAt(i));
-    bits += 8;
-
-    while (bits > 6) {
-      bits -= 6;
-      out += chars[mask & (buffer >> bits)];
-    }
-  }
-
-  if (bits) {
-    out += chars[mask & (buffer << (6 - bits))]
-  }
-
-  while ((out.length * 6) & 7) {
-    out += '=';
-  }
-
-  return out;
-};
-
-var btoa = function (input) {
-  // todo: throw invalid character for unicode
-  const keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
-
-  let output = "";
-  let chr1, chr2, chr3, enc1, enc2, enc3, enc4;
-  let i = 0;
-
-  while (i < input.length) {
-    chr1 = input.charCodeAt(i++);
-    chr2 = input.charCodeAt(i++);
-    chr3 = input.charCodeAt(i++);
-
-    enc1 = chr1 >> 2;
-    enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
-    enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
-    enc4 = chr3 & 63;
-
-    if (isNaN(chr2)) {
-      enc3 = enc4 = 64;
-    } else if (isNaN(chr3)) {
-      enc4 = 64;
-    }
-
-    output += keyStr.charAt(enc1);
-    output += keyStr.charAt(enc2);
-    output += keyStr.charAt(enc3);
-    output += keyStr.charAt(enc4);
-  }
-
-  return output;
-};
-
-var atob_b = function (input) {
-  const keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
-
-  let output = "";
-  let chr1, chr2, chr3;
-  let enc1, enc2, enc3, enc4;
-  let i = 0;
-
-  while (i < input.length) {
-    enc1 = keyStr.indexOf(input.charAt(i++));
-    enc2 = keyStr.indexOf(input.charAt(i++));
-    enc3 = keyStr.indexOf(input.charAt(i++));
-    enc4 = keyStr.indexOf(input.charAt(i++));
-
-    chr1 = (enc1 << 2) | (enc2 >> 4);
-    chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
-    chr3 = ((enc3 & 3) << 6) | enc4;
-
-    output += String.fromCharCode(chr1);
-
-    if (enc3 != 64) {
-      output += String.fromCharCode(chr2);
-    }
-    if (enc4 != 64) {
-      output += String.fromCharCode(chr3);
-    }
-  }
-
-  return output;
-};

package/hi.c

@@ -1,37 +0,0 @@
-#include <stdio.h>
-
-double inline f64_f(double x, double y) {
-  return x - (int)(x / y) * y;
-}
-
-double isPrime(double number) {
-  double i;
-
-  if (number < 2e+0) {
-    return 0e+0;
-  }
-  i = 2e+0;
-  while (i < number) {
-    if (f64_f(number, i) == 0e+0) {
-      return 0e+0;
-    }
-    i = i + 1e+0;
-  }
-  return 1e+0;
-}
-
-int main() {
-  double sum;
-  double counter;
-
-  sum = 0e+0;
-  counter = 0e+0;
-  while (counter <= 1e+5) {
-    if (isPrime(counter) == 1e+0) {
-      sum = sum + counter;
-    }
-    counter = counter + 1e+0;
-  }
-  printf("%f\n", sum);
-}
-

package/porf.cmd

@@ -1,2 +0,0 @@
-@echo off
-node runner %*

package/r.js

@@ -1,39 +0,0 @@
-compareArray.isSameValue = function(a, b) {
-  if (a === 0 && b === 0) return 1 / a === 1 / b;
-  if (a !== a && b !== b) return true;
-
-  return a === b;
-};
-
-function compareArray(a, b) {
-  // if either are nullish
-  if (a == null || b == null) return false;
-
-  // megahack: all arrays from now on will be >0 pointer
-  const _hack = '';
-
-  // hack: enforce type inference of being arrays
-  a ??= [];
-  b ??= [];
-
-  if (b.length !== a.length) {
-    return false;
-  }
-
-  for (var i = 0; i < a.length; i++) {
-    if (!compareArray.isSameValue(b[i], a[i])) {
-      return false;
-    }
-  }
-
-  return true;
-}
-
-console.log(compareArray(null, []));
-console.log(compareArray(undefined, []));
-
-console.log(compareArray([], []));
-console.log(compareArray([ 1 ], []));
-console.log(compareArray([ 1 ], [ 1 ]));
-console.log(compareArray([ 1, 2 ], [ 1 ]));
-console.log(compareArray([ 1, 2 ], [ 1, 2 ]));

package/runner/transform.js

@@ -1,15 +0,0 @@
-import compile from '../compiler/wrap.js';
-import fs from 'node:fs';
-
-const file = process.argv.slice(2).find(x => x[0] !== '-');
-
-const source = fs.readFileSync(file, 'utf8');
-
-const { wasm } = await compile(source);
-
-// const out = `(async () => { const print = str => process.stdout.write(str); (await WebAssembly.instantiate(Uint8Array.from([${wasm.toString()}]), {'': { p: i => print(i.toString()), c: i => print(String.fromCharCode(i))}})).instance.exports.m()})()`;
-// const out = `new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([${wasm.toString()}])),{'':{p:i=>process.stdout.write(i.toString())}}).exports.m()`;
-const out = `const a=new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([${wasm.toString()}])));const b=a.exports.m();console.log(Array.from(new Uint16Array(a.exports.$.buffer,b+4,new Int32Array(a.exports.$.buffer,b,1))).map(x=>String.fromCharCode(x)).join(''))`;
-
-console.log(out);
-eval(out);

package/sw.js

@@ -1,26 +0,0 @@
-self.addEventListener('install', () => self.skipWaiting());
-self.addEventListener('activate', e => e.waitUntil(self.clients.claim()));
-
-const handleFetch = async request => {
-  const r = await fetch(request.mode === 'no-cors' ? new Request(request, { credentials: 'omit' }) : request).catch(e => console.error(e));
-
-  if (r.status === 0) {
-    return r;
-  }
-
-  const headers = new Headers(r.headers);
-  headers.set('Cross-Origin-Embedder-Policy', 'credentialless');
-  headers.set('Cross-Origin-Opener-Policy', 'same-origin');
-  // headers.set('Cross-Origin-Resource-Policy', 'cross-origin');
-
-  return new Response(r.body, { status: r.status, statusText: r.statusText, headers });
-};
-
-self.addEventListener('fetch', e => {
-  const { request } = e;
-  if (request.cache === 'only-if-cached' && request.mode !== 'same-origin') {
-    return;
-  }
-
-  e.respondWith(handleFetch(request));
-});

package/t.js

@@ -1,31 +0,0 @@
-let assert = Object();
-
-assert._isSameValue = function (a, b) {
-  if (a === b) {
-    // Handle +/-0 vs. -/+0
-    return a !== 0 || 1 / a === 1 / b;
-  }
-
-  // Handle NaN vs. NaN
-  return a !== a && b !== b;
-
-  // return a === b;
-};
-
-assert.sameValue = function (actual, expected) {
-  /* try {
-    if (assert._isSameValue(actual, expected)) {
-      return;
-    }
-  } catch (error) {
-    throw new Test262Error('_isSameValue operation threw');
-  } */
-
-  if (assert._isSameValue(actual, expected)) {
-    return;
-  }
-
-  throw new Test262Error('assert.sameValue failed');
-};
-
-assert.sameValue("lego".charAt(), "l");

package/tmp.c

@@ -1,61 +0,0 @@
-#ifdef _WIN32
-#include <windows.h>
-#else
-#include <time.h>
-#endif
-
-#include <stdio.h>
-
-long long state0 = 1028798103;
-long long state1 = 477374377;
-double t = 0;
-
-double inline __Math_random() {
-  long long s1 = 0;
-  long long s0 = 0;
-
-  s1 = state0;
-  state0 = (s0 = state1);
-  state1 = ((((s1 = (s1 ^ (s1 << 23)))) ^ s0) ^ (s1 >> 17)) ^ (s0 >> 26);
-  return ((double)((state1 + s0) & 2097151) / 2.097152e+6);
-}
-
-double randoms(double max) {
-  double sum = 0;
-  double i = 0;
-
-  sum = 0e+0;
-  i = 0e+0;
-  while (i < max) {
-    sum = sum + __Math_random();
-    i = i + 1e+0;
-  }
-  return sum;
-}
-
-double inline __performance_now() {
-  double _time_out;
-#ifdef _WIN32
-  LARGE_INTEGER _time_freq, _time_t;
-  QueryPerformanceFrequency(&_time_freq);
-  QueryPerformanceCounter(&_time_t);
-  _time_out = ((double)_time_t.QuadPart / _time_freq.QuadPart) * 1000.;
-#else
-  struct timespec _time;
-  clock_gettime(CLOCK_MONOTONIC, &_time);
-  _time_out = _time.tv_nsec / 1000000. + _time.tv_sec * 1000.;
-#endif
-  return _time_out;
-}
-
-void inline __console_log(double x) {
-  printf("%f\n", x);
-  printf("%c", (int)(1e+1));
-}
-
-int main() {
-  t = __performance_now();
-  randoms(1e+5);
-  __console_log(__performance_now() - t);
-}
-