porffor 0.2.0-94ef1ca → 0.2.0-964b4c2

package/compiler/2c.js

@@ -35,7 +35,10 @@ const todo = msg => {
   throw new TodoError(`todo: ${msg}`);
 };
 
-const removeBrackets = str => str.startsWith('(') && str.endsWith(')') ? str.slice(1, -1) : str;
+const removeBrackets = str => {
+  if (str.startsWith('(long)(unsigned long)')) return '(long)(unsigned long)(' + removeBrackets(str.slice(22, -1)) + ')';
+  return str.startsWith('(') && str.endsWith(')') ? str.slice(1, -1) : str;
+};
 
 export default ({ funcs, globals, tags, exceptions, pages }) => {
   const invOperatorOpcode = Object.values(operatorOpcode).reduce((acc, x) => {

package/compiler/decompile.js

@@ -116,13 +116,12 @@ export default (wasm, name = '', ind = 0, locals = {}, params = [], returns = []
   return highlightAsm(out);
 };
 
-export const highlightAsm = asm =>
-  asm
-    .replace(/(local|global|memory)\.[^\s]*/g, _ => `\x1B[31m${_}\x1B[0m`)
-    .replace(/(i(8|16|32|64)x[0-9]+|v128)(\.[^\s]*)?/g, _ => `\x1B[34m${_}\x1B[0m`)
-    .replace(/[^m](i32|i64|f32|f64|drop)(\.[^\s]*)?/g, _ => `${_[0]}\x1B[36m${_.slice(1)}\x1B[0m`)
-    .replace(/(return_call|call|br_if|br|return|throw|rethrow)/g, _ => `\x1B[35m${_}\x1B[0m`)
-    .replace(/(block|loop|if|end|else|try|catch_all|catch|delegate)/g, _ => `\x1B[95m${_}\x1B[0m`)
-    .replace(/unreachable/g, _ => `\x1B[91m${_}\x1B[0m`)
-    .replace(/ \-?[0-9\.]+/g, _ => ` \x1B[33m${_.slice(1)}\x1B[0m`)
-    .replace(/ ;;.*$/gm, _ => `\x1B[90m${_.replaceAll(/\x1B\[[0-9]+m/g, '')}\x1B[0m`);
+export const highlightAsm = asm => asm
+  .replace(/(local|global|memory)\.[^\s]*/g, _ => `\x1B[31m${_}\x1B[0m`)
+  .replace(/(i(8|16|32|64)x[0-9]+|v128)(\.[^\s]*)?/g, _ => `\x1B[34m${_}\x1B[0m`)
+  .replace(/[^m](i32|i64|f32|f64|drop)(\.[^\s]*)?/g, _ => `${_[0]}\x1B[36m${_.slice(1)}\x1B[0m`)
+  .replace(/(return_call|call|br_if|br|return|rethrow|throw)/g, _ => `\x1B[35m${_}\x1B[0m`)
+  .replace(/(block|loop|if|end|else|try|catch_all|catch|delegate)/g, _ => `\x1B[95m${_}\x1B[0m`)
+  .replace(/unreachable/g, _ => `\x1B[91m${_}\x1B[0m`)
+  .replace(/ \-?[0-9\.]+/g, _ => ` \x1B[33m${_.slice(1)}\x1B[0m`)
+  .replace(/ ;;.*$/gm, _ => `\x1B[90m${_.replaceAll(/\x1B\[[0-9]+m/g, '')}\x1B[0m`);

package/compiler/encoding.js

@@ -105,119 +105,5 @@ export const read_unsignedLEB128 = _input => {
 };
 
 // ieee 754 binary64
-
-// from https://github.com/feross/ieee754
-// BSD 3-Clause. Copyright 2008 Fair Oaks Labs, Inc. (https://github.com/feross/ieee754/blob/master/LICENSE)
-export const ieee754_binary64 = value => {
-  return [...new Uint8Array(new Float64Array([ value ]).buffer)];
-
-  let isLE = true, mLen = 52, nBytes = 8, offset = 0;
-  let buffer = new Array(nBytes).fill(0);
-
-  let e, m, c
-  let eLen = (nBytes * 8) - mLen - 1
-  const eMax = (1 << eLen) - 1
-  const eBias = eMax >> 1
-  const rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
-  let i = isLE ? 0 : (nBytes - 1)
-  const d = isLE ? 1 : -1
-  const s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
-
-  value = Math.abs(value)
-
-  if (isNaN(value) || value === Infinity) {
-    m = isNaN(value) ? 1 : 0
-    e = eMax
-  } else {
-    e = Math.floor(Math.log(value) / Math.LN2)
-    if (value * (c = Math.pow(2, -e)) < 1) {
-      e--
-      c *= 2
-    }
-    if (e + eBias >= 1) {
-      value += rt / c
-    } else {
-      value += rt * Math.pow(2, 1 - eBias)
-    }
-    if (value * c >= 2) {
-      e++
-      c /= 2
-    }
-
-    if (e + eBias >= eMax) {
-      m = 0
-      e = eMax
-    } else if (e + eBias >= 1) {
-      m = ((value * c) - 1) * Math.pow(2, mLen)
-      e = e + eBias
-    } else {
-      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
-      e = 0
-    }
-  }
-
-  while (mLen >= 8) {
-    buffer[offset + i] = m & 0xff
-    i += d
-    m /= 256
-    mLen -= 8
-  }
-
-  e = (e << mLen) | m
-  eLen += mLen
-  while (eLen > 0) {
-    buffer[offset + i] = e & 0xff
-    i += d
-    e /= 256
-    eLen -= 8
-  }
-
-  buffer[offset + i - d] |= s * 128
-
-  return buffer;
-};
-
-export const read_ieee754_binary64 = buffer => {
-  return new Float64Array(new Uint8Array(buffer).buffer)[0];
-
-  let isLE = true, mLen = 52, nBytes = 8, offset = 0;
-
-  let e, m
-  const eLen = (nBytes * 8) - mLen - 1
-  const eMax = (1 << eLen) - 1
-  const eBias = eMax >> 1
-  let nBits = -7
-  let i = isLE ? (nBytes - 1) : 0
-  const d = isLE ? -1 : 1
-  let s = buffer[offset + i]
-
-  i += d
-
-  e = s & ((1 << (-nBits)) - 1)
-  s >>= (-nBits)
-  nBits += eLen
-  while (nBits > 0) {
-    e = (e * 256) + buffer[offset + i]
-    i += d
-    nBits -= 8
-  }
-
-  m = e & ((1 << (-nBits)) - 1)
-  e >>= (-nBits)
-  nBits += mLen
-  while (nBits > 0) {
-    m = (m * 256) + buffer[offset + i]
-    i += d
-    nBits -= 8
-  }
-
-  if (e === 0) {
-    e = 1 - eBias
-  } else if (e === eMax) {
-    return m ? NaN : ((s ? -1 : 1) * Infinity)
-  } else {
-    m = m + Math.pow(2, mLen)
-    e = e - eBias
-  }
-  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
-};
+export const ieee754_binary64 = value => [...new Uint8Array(new Float64Array([ value ]).buffer)];
+export const read_ieee754_binary64 = buffer => new Float64Array(new Uint8Array(buffer).buffer)[0];

package/compiler/index.js

@@ -82,6 +82,8 @@ export default (code, flags) => {
     } else {
       console.log(c);
     }
+
+    if (process.version) process.exit();
   }
 
   if (target === 'native') {
@@ -96,6 +98,8 @@ export default (code, flags) => {
 
     // obvious command escape is obvious
     execSync(args.join(' '), { stdio: 'inherit' });
+
+    if (process.version) process.exit();
   }
 
   return out;

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.2.0-94ef1ca",
+  "version": "0.2.0-964b4c2",
   "author": "CanadaHonk",
   "license": "MIT",
   "dependencies": {

package/tmp.c

@@ -0,0 +1,69 @@
+
+#include <stdio.h>
+
+struct ReturnValue {
+  double value;
+  long type;
+};
+
+double sum = 0;
+long sumdtype = 0;
+double counter = 0;
+long counterdtype = 0;
+
+double inline f64_f(double x, double y) {
+  return (x - ((int)(x / y) * y));
+}
+
+struct ReturnValue isPrime(double number, long numberdtype) {
+  double i = 0;
+  long idtype = 0;
+  double __tmpop_left = 0;
+  double __tmpop_right = 0;
+  long compare_left_pointer = 0;
+  long compare_left_length = 0;
+  long compare_right_pointer = 0;
+  long compare_right_length = 0;
+  long compare_index = 0;
+  long compare_index_end = 0;
+
+  if (number < 2e+0) {
+    return (struct ReturnValue){ 1, 0e+0 };
+  }
+  i = 2e+0;
+  idtype = 0;
+  while (i < number) {
+    if (f64_f(number, i) == 0e+0) {
+      return (struct ReturnValue){ 1, 0e+0 };
+    }
+    i = i + 1e+0;
+  }
+  return (struct ReturnValue){ 1, 1e+0 };
+}
+
+double inline __console_log(double x) {
+  printf("%f\n", x);
+  printf("%c", (int)(1e+1));
+}
+
+int main() {
+  long dlast_type = 0;
+  double elogicinner_tmp = 0;
+  long dtypeswitch_tmp = 0;
+
+  sum = 0e+0;
+  sumdtype = 0;
+  counter = 0e+0;
+  counterdtype = 0;
+  while (counter <= 1e+5) {
+    const struct ReturnValue _ = isPrime(counter, counterdtype);
+    dlast_type = _.type;
+    if ((unsigned long)(elogicinner_tmp = _.value) == 1e+0) {
+      sum = sum + counter;
+      sumdtype = 0;
+    }
+    counter = counter + 1e+0;
+  }
+  __console_log(sum);
+}
+