porffor 0.14.0-33cb5e44b → 0.14.0-3905158d3

package/CONTRIBUTING.md

@@ -231,7 +231,11 @@ builtins/tostring_number: impl radix
 
 Make sure you have Test262 cloned already **inside of `test262/`** (`git clone https://github.com/tc39/test262.git test262/test262`) and run `npm install` inside `test262/` too.
 
-Run `node test262` to run all the tests and get an output of total overall test results. The main thing you want to pay attention to is the emoji summary (lol):
+Run `node test262` to run all the tests and get an output of total overall test results.
+
+Warning: this will consume 1-6GB of memory and ~90% of all CPU cores while running (depending on thread count), it should take 15-120s depending on machine. You can specify how many threads with `--threads=N`, it will use the number of CPU threads by default.
+
+The main thing you want to pay attention to is the emoji summary (lol):
 ```
 🧪 50005 | 🤠 7007 (-89) | ❌ 1914 (-32) | 💀 13904 (-61) | 📝 23477 (-120) | ⏰ 2 | 🏗 2073 (+302) | 💥 1628
 ```

package/asur/index.js

@@ -1155,7 +1155,7 @@ if (bc.porfFunc && paused && op) {
   switch (byg(
     paused,
     funcLines[currentFunc] + currentLine,
-    '\x1b[1masur\x1b[22m: ' + callStack.join(' -> ') + (parents.length > 1 ? \` | \${parents.slice(1).map(x => invOpcodes[x.opcode]).join(' -> ')}\` : ''),
+    '\x1b[1masur debugger\x1b[22m: ' + callStack.join(' -> ') + (parents.length > 1 ? \` | \${parents.slice(1).map(x => invOpcodes[x.opcode]).join(' -> ')}\` : ''),
     [
       {
         x: termWidth - 1 - width - 6,

package/compiler/assemble.js

@@ -116,6 +116,20 @@ export default (funcs, globals, tags, pages, data, flags) => {
     ] ])
   );
 
+  if (pages.has('func argc lut')) {
+    // generate func argc lut data
+    const bytes = [];
+    for (let i = 0; i < funcs.length; i++) {
+      const argc = Math.floor(funcs[i].params.length / 2);
+      bytes.push(argc % 256, (argc / 256 | 0) % 256);
+    }
+
+    data.push({
+      offset: pages.get('func argc lut').ind * pageSize,
+      bytes
+    });
+  }
+
   // const t0 = performance.now();
 
   // specially optimized assembly for globals as this version is much (>5x) faster than traditional createSection()

package/compiler/builtins/array.ts

@@ -27,14 +27,16 @@ export const __Array_prototype_slice = (_this: any[], start: number, end: number
   let outPtr: i32 = Porffor.wasm`local.get ${out}`;
   let thisPtr: i32 = Porffor.wasm`local.get ${_this}`;
 
-  const thisPtrEnd: i32 = thisPtr + end * 8;
+  const thisPtrEnd: i32 = thisPtr + end * 9;
 
-  thisPtr += start * 8;
+  thisPtr += start * 9;
 
   while (thisPtr < thisPtrEnd) {
     Porffor.wasm.f64.store(outPtr, Porffor.wasm.f64.load(thisPtr, 0, 4), 0, 4);
-    thisPtr += 8;
-    outPtr += 8;
+    Porffor.wasm.i32.store8(outPtr + 8, Porffor.wasm.i32.load8_u(thisPtr + 8, 0, 4), 0, 4);
+
+    thisPtr += 9;
+    outPtr += 9;
   }
 
   out.length = end - start;
@@ -142,4 +144,80 @@ export const __Array_prototype_toReversed = (_this: any[]) => {
 
 export const __Array_prototype_valueOf = (_this: any[]) => {
   return _this;
+};
+
+
+export const __Array_prototype_forEach = (_this: any[], callbackFn: any) => {
+  const len: i32 = _this.length;
+  let i: i32 = 0;
+  while (i < len) {
+    callbackFn(_this[i], i++, _this);
+  }
+};
+
+export const __Array_prototype_filter = (_this: any[], callbackFn: any) => {
+  const out: any[] = [];
+
+  const len: i32 = _this.length;
+  let i: i32 = 0;
+  while (i < len) {
+    const el: any = _this[i];
+    if (callbackFn(el, i++, _this)) out.push(el);
+  }
+
+  return out;
+};
+
+export const __Array_prototype_map = (_this: any[], callbackFn: any) => {
+  const out: any[] = [];
+
+  const len: i32 = _this.length;
+  let i: i32 = 0;
+  while (i < len) {
+    out.push(callbackFn(_this[i], i++, _this));
+  }
+
+  return out;
+};
+
+export const __Array_prototype_find = (_this: any[], callbackFn: any) => {
+  const len: i32 = _this.length;
+  let i: i32 = 0;
+  while (i < len) {
+    const el: any = _this[i];
+    if (callbackFn(el, i++, _this)) return el;
+  }
+};
+
+export const __Array_prototype_findLast = (_this: any[], callbackFn: any) => {
+  let i: i32 = _this.length;
+  while (i > 0) {
+    const el: any = _this[--i];
+    if (callbackFn(el, i, _this)) return el;
+  }
+};
+
+export const __Array_prototype_findIndex = (_this: any[], callbackFn: any) => {
+  const len: i32 = _this.length;
+  let i: i32 = 0;
+  while (i < len) {
+    if (callbackFn(_this[i], i++, _this)) return i;
+  }
+};
+
+export const __Array_prototype_findLastIndex = (_this: any[], callbackFn: any) => {
+  let i: i32 = _this.length;
+  while (i > 0) {
+    if (callbackFn(_this[--i], i, _this)) return i;
+  }
+};
+
+export const __Array_prototype_every = (_this: any[], callbackFn: any) => {
+  const len: i32 = _this.length;
+  let i: i32 = 0;
+  while (i < len) {
+    if (!callbackFn(_this[i], i++, _this)) return false;
+  }
+
+  return true;
 };

package/compiler/builtins/boolean.ts

@@ -4,7 +4,7 @@ export const __Boolean_prototype_toString = (_this: boolean) => {
   // 1. Let b be ? ThisBooleanValue(this value).
   // 2. If b is true, return "true"; else return "false".
   let out: bytestring = '';
-  if (_this) out = 'true';
+  if (_this == true) out = 'true';
     else out = 'false';
 
   return out;

package/compiler/builtins/error.js

@@ -0,0 +1,22 @@
+export default () => {
+  let out = '';
+
+  const error = name => out += `export const ${name} = (message: bytestring) => {
+  return {};
+};
+
+export const ${name}$constructor = (message: bytestring) => {
+  return {};
+};`;
+
+  error('Error');
+  error('AggregateError');
+  error('TypeError');
+  error('ReferenceError');
+  error('SyntaxError');
+  error('RangeError');
+  error('EvalError');
+  error('URIError');
+
+  return out;
+};

package/compiler/builtins/math.ts

@@ -0,0 +1,408 @@
+// todo: use any and Number(x) in all these later
+// todo: specify the rest of this file later
+// todo/perf: make i32 variants later
+// todo/perf: add a compiler pref for accuracy vs perf (epsilion?)
+
+export const __Math_exp = (x: number): number => {
+  if (!Number.isFinite(x)) {
+    if (x == -Infinity) return 0;
+    return x;
+  }
+
+  if (x < 0) {
+    // exp(-x) = 1 / exp(+x)
+    return 1 / Math.exp(-x);
+  }
+
+  const k: number = Math.floor(x / Math.LN2);
+  const r: number = x - k * Math.LN2;
+
+  // Horner's method
+  let term: number = r;
+  let sum: number = 1 + r;
+  let i: number = 2;
+
+  while (Math.abs(term) > 1e-15) {
+    term *= r / i;
+    sum += term;
+    i++;
+  }
+
+  return sum * (1 << k);
+};
+
+export const __Math_log2 = (y: number): number => {
+  if (y <= 0) return NaN;
+  if (!Number.isFinite(y)) return y;
+
+  // approx using log knowledge
+  let x: number = y;
+  let exponent: number = 0;
+
+  while (x >= 2) {
+    x /= 2;
+    exponent++;
+  }
+
+  while (x < 1) {
+    x *= 2;
+    exponent--;
+  }
+
+  // 1 <= x < 2 -> 0 <= x < 1
+  x -= 1;
+
+  // refine with Newton-Raphson method
+  let delta: number;
+  do {
+    const e_x: number = Math.exp(x * Math.LN2);
+    delta = (e_x - y) / (e_x * Math.LN2);
+    x -= delta;
+  } while (Math.abs(delta) > 1e-15);
+
+  return x + exponent;
+};
+
+export const __Math_log = (y: number): number => {
+  if (y <= 0) {
+    if (y == 0) return -Infinity;
+    return NaN;
+  }
+  if (!Number.isFinite(y)) return y;
+
+  // guess using log knowledge
+  let x: number = y > 1 ? Math.log2(y) : 0;
+
+  // refine with Newton-Raphson method
+  let delta: number;
+  do {
+    const e_x: number = Math.exp(x);
+    delta = (e_x - y) / e_x;
+    x -= delta;
+  } while (Math.abs(delta) > 1e-15);
+
+  return x;
+};
+
+export const __Math_log10 = (x: number): number => {
+  if (x <= 0) {
+    if (x == 0) return -Infinity;
+    return NaN;
+  }
+  if (!Number.isFinite(x)) return x;
+
+  return Math.log(x) / Math.LN10;
+};
+
+// 21.3.2.26 Math.pow (base, exponent)
+// https://tc39.es/ecma262/#sec-math.pow
+export const __Math_pow = (base: number, exponent: number): number => {
+  // 1. Set base to ? ToNumber(base).
+  // 2. Set exponent to ? ToNumber(exponent).
+  // todo
+
+  // 3. Return Number::exponentiate(base, exponent).
+
+  // Number::exponentiate (base, exponent)
+  // https://tc39.es/ecma262/#sec-numeric-types-number-exponentiate
+  // 1. If exponent is NaN, return NaN.
+  if (Number.isNaN(exponent)) return NaN;
+
+  // 2. If exponent is either +0𝔽 or -0𝔽, return 1𝔽.
+  if (exponent == 0) return 1;
+
+  if (!Number.isFinite(base)) {
+    // 3. If base is NaN, return NaN.
+    if (Number.isNaN(base)) return base;
+
+    // 4. If base is +∞𝔽, then
+    if (base == Infinity) {
+      // a. If exponent > +0𝔽, return +∞𝔽. Otherwise, return +0𝔽.
+      if (exponent > 0) return base;
+      return 0;
+    }
+
+    // 5. If base is -∞𝔽, then
+    const isOdd = exponent % 2 == 1;
+
+    // a. If exponent > +0𝔽, then
+    if (exponent > 0) {
+      // i. If exponent is an odd integral Number, return -∞𝔽. Otherwise, return +∞𝔽.
+      if (isOdd) return -Infinity;
+      return Infinity;
+    }
+
+    // b. Else,
+    // i. If exponent is an odd integral Number, return -0𝔽. Otherwise, return +0𝔽.
+    if (isOdd) return -0;
+    return 0;
+  }
+
+  if (base == 0) {
+    // 6. If base is +0𝔽, then
+    if (1 / base == Infinity) {
+      // a. If exponent > +0𝔽, return +0𝔽. Otherwise, return +∞𝔽.
+      if (exponent > 0) return 0;
+      return Infinity;
+    }
+
+    // 7. If base is -0𝔽, then
+    const isOdd = exponent % 2 == 1;
+
+    // a. If exponent > +0𝔽, then
+    if (exponent > 0) {
+      // i. If exponent is an odd integral Number, return -0𝔽. Otherwise, return +0𝔽.
+      if (isOdd) return -0;
+      return 0;
+    }
+
+    // b. Else,
+    // i. If exponent is an odd integral Number, return -∞𝔽. Otherwise, return +∞𝔽.
+    if (isOdd) return -Infinity;
+    return Infinity;
+  }
+
+  // 8. Assert: base is finite and is neither +0𝔽 nor -0𝔽.
+  // todo
+
+  // 9. If exponent is +∞𝔽, then
+  if (exponent == Infinity) {
+    const abs = Math.abs(base);
+
+    // a. If abs(ℝ(base)) > 1, return +∞𝔽.
+    if (abs > 1) return Infinity;
+
+    // b. If abs(ℝ(base)) = 1, return NaN.
+    if (abs == 1) return NaN;
+
+    // c. If abs(ℝ(base)) < 1, return +0𝔽.
+    return 0;
+  }
+
+  // 10. If exponent is -∞𝔽, then
+  if (exponent == -Infinity) {
+    const abs = Math.abs(base);
+
+    // a. If abs(ℝ(base)) > 1, return +0𝔽.
+    if (abs > 1) return 0;
+
+    // b. If abs(ℝ(base)) = 1, return NaN.
+    if (abs == 1) return NaN;
+
+    // c. If abs(ℝ(base)) < 1, return +∞𝔽.
+    return Infinity;
+  }
+
+  // 11. Assert: exponent is finite and is neither +0𝔽 nor -0𝔽.
+  // todo
+
+  // 12. If base < -0𝔽 and exponent is not an integral Number, return NaN.
+  if (base < 0) if (!Number.isInteger(exponent)) return NaN;
+
+  // 13. Return an implementation-approximated Number value representing the result of raising ℝ(base) to the ℝ(exponent) power.
+  return Math.exp(exponent * Math.log(base));
+};
+
+
+export const __Math_expm1 = (x: number): number => {
+  if (!Number.isFinite(x)) {
+    if (x == -Infinity) return -1;
+    return x;
+  }
+
+  // use exp(x) - 1 for large x (perf)
+  if (Math.abs(x) > 1e-5) return Math.exp(x) - 1;
+
+  // Taylor series
+  let sum: number = x;
+  let term: number = x;
+  let i: number = 2;
+
+  while (Math.abs(term) > 1e-15) {
+    term *= x / i;
+    sum += term;
+    i++;
+  }
+
+  return sum;
+};
+
+export const __Math_log1p = (x: number): number => {
+  if (x == -1) return -Infinity; // log(0) = -inf
+  if (!Number.isFinite(x)) return x;
+
+  // use exp(x) - 1 for large x (perf)
+  if (Math.abs(x) > 1e-5) return Math.log(1 + x);
+
+  // Taylor series
+  let sum: number = 0;
+  let term: number = x;
+  let i: number = 2;
+
+  while (Math.abs(term) > 1e-15) {
+    term *= -x / i;
+    sum += term;
+    i++;
+  }
+
+  return sum;
+};
+
+
+export const __Math_sqrt = (y: number): number => {
+  if (y <= 0) {
+    if (y == 0) return 0;
+    return NaN;
+  }
+  if (!Number.isFinite(y)) return y;
+
+  // Babylonian method
+  let x: number = y;
+  let prev: number;
+
+  do {
+    prev = x;
+    x = 0.5 * (x + y / x);
+  } while (Math.abs(prev - x) > 1e-15);
+
+  return x;
+};
+
+export const __Math_cbrt = (y: number): number => {
+  if (y == 0) return 0; // cbrt(0) = 0
+  if (!Number.isFinite(y)) return y;
+
+  // Babylonian method
+  let x = Math.abs(y);
+
+  let prev: number;
+
+  do {
+    prev = x;
+    x = (2 * x + y / (x * x)) / 3;
+  } while (Math.abs(prev - x) > 1e-15);
+
+  return y < 0 ? -x : x;
+};
+
+
+// todo: varargs
+export const __Math_hypot = (x: number, y: number): number => Math.sqrt(x * x + y * y);
+
+export const __Math_sin = (x: number): number => {
+  // -inf <= x <= inf -> 0 <= x <= 2pi
+  const piX2: number = Math.PI * 2;
+  x %= piX2;
+  if (x < 0) x += piX2;
+
+  const x2: number = x * x;
+
+  return x * (
+    1 + x2 * (
+      -1.66666666666666307295e-1 + x2 * (
+        8.33333333332211858878e-3 + x2 * (
+          -1.98412698295895385996e-4 + x2 * (
+            2.75573136213857245213e-6 + x2 * (
+              -2.50507477628578072866e-8 + x2 * (
+                1.58962301576546568060e-10
+              )
+            )
+          )
+        )
+      )
+    )
+  );
+
+  // todo: investigate which is better (consider perf and accuracy)
+  // const x2 = x * x;
+  // const x4 = x2 * x2;
+  // const x6 = x4 * x2;
+  // const x8 = x4 * x4;
+  // const x10 = x6 * x4;
+  // const x12 = x6 * x6;
+  // const x14 = x12 * x2;
+
+  // return x * (
+  //   1 - x2 / 6 + x4 / 120 - x6 / 5040 + x8 / 362880 - x10 / 39916800 + x12 / 6227020800 - x14 / 1307674368000
+  // );
+};
+
+export const __Math_cos = (x: number): number => Math.sin(x - Math.PI / 2);
+export const __Math_tan = (x: number): number => Math.sin(x) / Math.cos(x);
+
+export const __Math_sinh = (x: number): number => (Math.exp(x) - Math.exp(-x)) / 2;
+export const __Math_cosh = (x: number): number => (Math.exp(x) + Math.exp(-x)) / 2;
+export const __Math_tanh = (x: number): number => Math.sinh(x) / Math.cosh(x);
+
+
+export const __Math_asinh = (x: number): number => Math.log(x + Math.sqrt(x * x + 1));
+export const __Math_acosh = (x: number): number => {
+  if (x < 1) return NaN;
+  return Math.log(x + Math.sqrt(x * x - 1));
+};
+export const __Math_atanh = (x: number): number => {
+  if (Math.abs(x) >= 1) return NaN;
+  return 0.5 * Math.log((1 + x) / (1 - x));
+};
+
+
+export const __Math_asin = (x: number): number => {
+  if (x <= -1) {
+    if (x == -1) return -Math.PI / 2;
+    return NaN;
+  }
+  if (x >= 1) {
+    if (x == 1) return Math.PI / 2;
+    return NaN;
+  }
+
+  // Taylor series
+  let sum: number = x;
+  let term: number = x;
+  let n: number = 1;
+
+  while (Math.abs(term) > 1e-15) {
+    term *= x * x * (2 * n - 1) * (2 * n - 1) / ((2 * n) * (2 * n + 1));
+    sum += term / (2 * n + 1);
+    n++;
+  }
+
+  return sum;
+};
+
+export const __Math_acos = (x: number): number => Math.asin(x) - Math.PI / 2;
+
+export const __Math_atan = (x: number): number => {
+  if (x == Infinity) return Math.PI / 2
+  if (x == -Infinity) return -Math.PI / 2;
+
+  // Taylor series
+  let sum: number = x;
+  let term: number = x;
+  let n: number = 1;
+
+  while (Math.abs(term) > 1e-15) {
+    term *= -x * x * (2 * n - 1) / ((2 * n) * (2 * n + 1));
+    sum += term;
+    n++;
+  }
+
+  return sum;
+};
+
+export const __Math_atan2 = (y: number, x: number): number => {
+  if (x == 0) {
+    if (y > 0) return Math.PI / 2;
+    if (y < 0) return -Math.PI / 2;
+
+    return NaN;
+  }
+
+  const ratio = y / x;
+  if (x > 0) {
+    return Math.atan(ratio);
+  }
+
+  if (y >= 0) return Math.atan(ratio) + Math.PI;
+  return Math.atan(ratio) - Math.PI;
+};

package/compiler/builtins/set.ts

@@ -56,14 +56,13 @@ i32.store8 0 12`;
 };
 
 
-// todo: this should be a getter somehow not a method
-export const __Set_prototype_size = (_this: Set) => {
+export const __Set_prototype_size$get = (_this: Set) => {
   return Porffor.wasm.i32.load(_this, 0, 0);
 };
 
 export const __Set_prototype_values = (_this: Set) => {
   // todo: this should return an iterator not array
-  const size: number = __Set_prototype_size(_this);
+  const size: number = Porffor.wasm.i32.load(_this, 0, 0);
 
   const out: any[] = __Porffor_allocate();
   for (let i: number = 0; i < size; i++) {
@@ -79,7 +78,7 @@ export const __Set_prototype_keys = (_this: Set) => {
 };
 
 export const __Set_prototype_has = (_this: Set, value: any) => {
-  const size: number = __Set_prototype_size(_this);
+  const size: number = Porffor.wasm.i32.load(_this, 0, 0);
 
   for (let i: number = 0; i < size; i++) {
     if (__Porffor_set_read(_this, i) === value) return true;
@@ -89,7 +88,7 @@ export const __Set_prototype_has = (_this: Set, value: any) => {
 };
 
 export const __Set_prototype_add = (_this: Set, value: any) => {
-  const size: number = __Set_prototype_size(_this);
+  const size: number = Porffor.wasm.i32.load(_this, 0, 0);
 
   // check if already in set
   for (let i: number = 0; i < size; i++) {
@@ -107,7 +106,7 @@ export const __Set_prototype_add = (_this: Set, value: any) => {
 };
 
 export const __Set_prototype_delete = (_this: Set, value: any) => {
-  const size: number = __Set_prototype_size(_this);
+  const size: number = Porffor.wasm.i32.load(_this, 0, 0);
 
   // check if already in set
   for (let i: number = 0; i < size; i++) {

package/compiler/builtins/symbol.ts

@@ -19,7 +19,7 @@ export const Symbol = (description: any): Symbol => {
 };
 
 // todo: this should be a getter somehow not a method
-export const __Symbol_prototype_description = (_this: Symbol) => {
+export const __Symbol_prototype_description$get = (_this: Symbol) => {
   const description: bytestring = __Porffor_symbol_descStore(false,
     Porffor.wasm`local.get ${_this}` - 1);
   return description;

package/compiler/builtins.js

@@ -221,7 +221,7 @@ export const BuiltinFuncs = function() {
     typedParams: true,
     locals: [ Valtype.i32, Valtype.i32 ],
     returns: [],
-    wasm: (scope, { typeSwitch }) => [
+    wasm: (scope, { typeSwitch, builtin }) => [
       ...typeSwitch(scope, [ [ Opcodes.local_get, 1 ] ], {
         [TYPES.number]: [
           [ Opcodes.local_get, 0 ],
@@ -317,7 +317,7 @@ export const BuiltinFuncs = function() {
 
           // make end pointer
           [ Opcodes.i32_load, Math.log2(ValtypeSize.i32) - 1, 0 ],
-          ...number(ValtypeSize[valtype], Valtype.i32),
+          ...number(ValtypeSize[valtype] + 1, Valtype.i32),
           [ Opcodes.i32_mul ],
 
           [ Opcodes.local_get, 2 ],
@@ -326,14 +326,18 @@ export const BuiltinFuncs = function() {
 
           [ Opcodes.loop, Blocktype.void ],
 
-          // print current char
+          // print current array element
           [ Opcodes.local_get, 2 ],
-          [ Opcodes.load, Math.log2(ValtypeSize.i16) - 1, ValtypeSize.i32 ],
-          [ Opcodes.call, importedFuncs.print ],
+          [ Opcodes.load, 0, ValtypeSize.i32 ],
+
+          [ Opcodes.local_get, 2 ],
+          [ Opcodes.i32_load8_u, 0, ValtypeSize.i32 + ValtypeSize[valtype] ],
+
+          [ Opcodes.call, builtin('__Porffor_print') ],
 
           // increment pointer by sizeof valtype
           [ Opcodes.local_get, 2 ],
-          ...number(ValtypeSize[valtype], Valtype.i32),
+          ...number(ValtypeSize[valtype] + 1, Valtype.i32),
           [ Opcodes.i32_add ],
           [ Opcodes.local_tee, 2 ],