ifs.js

/* CindyJS - (C) 2014-2016  The CindyJS Project
 * IFS rendering subcomponent licensed under the Apache License 2.0.
 * See https://github.com/CindyJS/CindyJS/tree/$gitid$/src/js/ifs
 * for corresponding sources.
 */
let nextInit = null;
let asm = null;
let buffer = null;
let imgSize = 0;
let imgPtr = null;
let imgData = null;
let imgTransfer = null;
let width = 0;
let height = 0;
const Module = {};
let generation = null;
let age = 0;

// check for imul support, and also for correctness
// ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
if (!Math.imul || Math.imul(0xffffffff, 5) !== -5)
Math.imul = function imul(a, b) {
  const ah = a >>> 16;
  const al = a & 0xffff;
  const bh = b >>> 16;
  const bl = b & 0xffff;
  return al * bl + (ah * bl + al * bh << 16) | 0;
};

onmessage = function (event) {
  const d = event.data;
  if (d.cmd === "init") {
    nextInit = d;
    if (generation === null) {
      next(d);
    }
  }
  if (d.cmd === "next") next(d);
};

function link() {
  asm = Module.asm(
  self,
  {
    _dbglog: function (i, d) {
      console.log(i, d);
    } },

  buffer);

}

function init(d) {
  age = 2; // start with 100 points
  generation = d.generation;
  width = d.width;
  height = d.height;
  const numIFS = d.systems.length;
  let numTrafos = 0;
  let i, j;
  for (i = 0; i < numIFS; ++i) numTrafos += d.systems[i].trafos.length;
  const fixedSize = 8 + 48;
  const ifsSize = 56 * numIFS;
  let trafoSize = (112 + 4) * numTrafos;
  if (trafoSize % 8) trafoSize += 8 - trafoSize % 8;
  imgSize = width * height * 4;
  const minSize = fixedSize + ifsSize + trafoSize + imgSize;
  let bufferSize = 1 << 16;
  while (bufferSize < minSize) bufferSize <<= 1;
  if (asm === null || buffer.byteLength < bufferSize) {
    buffer = new ArrayBuffer(bufferSize);
    link();
  }
  imgPtr = asm._init(numIFS, numTrafos, width, height);
  if (imgPtr !== fixedSize + ifsSize + trafoSize)
  throw Error(
  "Buffer size calculation out of sync: expected " +
  fixedSize +
  " + " +
  ifsSize +
  " + " +
  trafoSize +
  " = " + (
  fixedSize + ifsSize + trafoSize) +
  " but got " +
  imgPtr);

  const imgBytes = new Uint8ClampedArray(buffer, imgPtr, imgSize);
  if (typeof imgBytes.fill === "function") imgBytes.fill(0);
  // clear image
  else for (let addr = 0; addr < imgBytes.length; ++addr) imgBytes[addr] = 0;
  imgData = new ImageData(imgBytes, width, height);
  for (i = 0; i < numIFS; ++i) {
    const trafos = d.systems[i].trafos;
    asm._setIFS(i, trafos.length);
    for (j = 0; j < trafos.length; ++j) {
      const tr = trafos[j];
      if (tr.kind === "Tr") {
        asm._setProj(
        i,
        j,
        tr.prob,
        tr.color[0] * 255,
        tr.color[1] * 255,
        tr.color[2] * 255,
        tr.mat[0][0],
        tr.mat[0][1],
        tr.mat[0][2],
        tr.mat[1][0],
        tr.mat[1][1],
        tr.mat[1][2],
        tr.mat[2][0],
        tr.mat[2][1],
        tr.mat[2][2]);

      } else if (tr.kind === "Mt") {
        asm._setMoebius(
        i,
        j,
        tr.prob,
        tr.color[0] * 255,
        tr.color[1] * 255,
        tr.color[2] * 255,
        tr.moebius.sign,
        tr.moebius.ar,
        tr.moebius.ai,
        tr.moebius.br,
        tr.moebius.bi,
        tr.moebius.cr,
        tr.moebius.ci,
        tr.moebius.dr,
        tr.moebius.di);

      }
    }
  }
  asm._real(1000, 1);
}

function next(d) {
  if (d.buffer) {
    if (imgTransfer) {
      imgTransfer = d.buffer;
    } else {
      buffer = d.buffer;
      link();
      imgData = null; // won't be needing this
    }
  }
  if (nextInit) {
    init(nextInit);
    nextInit = null;
  }

  asm._real(10 ** age | 0, 0);
  if (age < 5) ++age;

  const ff = /Firefox\/(\d+)\.(\d+)/.exec(navigator.userAgent);
  if (ff) {
    // current versions of Firefox have serious problems with ImageBitmaps:
    // bug 1271504: will pre-multiply ImageBitmap repeatedly
    // bug 1312148: massive memory leak creating ImageBitmap instances
    // Furthermore bug 1312139 prevents us from using the fallback
    // since we cannot transfer a buffer which has been used by asm.js.
    // So we use a separate buffer (and one more copy step) for transfer.
    if (!imgTransfer || imgTransfer.byteLength < imgSize) imgTransfer = new ArrayBuffer(imgSize);
    const t = new Uint8ClampedArray(imgTransfer);
    t.set(imgData.data);
    postMessage(
    {
      generation,
      buffer: imgTransfer,
      imgPtr: 0,
      width,
      height },

    [imgTransfer]);

  } else if (typeof createImageBitmap === "function") {
    createImageBitmap(imgData).then(function (bmp) {
      postMessage(
      {
        generation,
        img: bmp },

      [bmp]);

    });
  } else {
    postMessage(
    {
      generation,
      buffer,
      imgPtr,
      width,
      height },

    [buffer]);

  }
}

// Code below was generated by emscripten, see ifs.cc for source code


Module["asm"] = function (global, env, buffer) {
  "use asm";
  const a = new global.Int8Array(buffer);
  const c = new global.Int32Array(buffer);
  const d = new global.Uint8Array(buffer);
  const h = new global.Float64Array(buffer);
  const M = global.Math.abs;
  const Z = global.Math.imul;
  function da(b, e) {
    b = b | 0;
    e = e | 0;
    let f = 0,
    g = 0,
    i = 0,
    j = 0.0,
    k = 0.0,
    l = 0,
    m = 0,
    n = 0.0,
    o = 0.0,
    p = 0.0,
    q = 0.0,
    r = 0,
    s = 0.0,
    t = 0.0,
    u = 0.0,
    v = 0.0,
    w = 0.0,
    x = 0.0,
    y = 0,
    z = 0;
    if (!b) return;
    f = c[11] | 0;
    do {
      b = b + -1 | 0;
      if (!f) f = 0;else
      {
        r = 0;
        do {
          m = 56 + (r * 56 | 0) | 0;
          l = c[2] | 0;
          l = l << 11 ^ l;
          c[2] = c[3];
          c[3] = c[4];
          g = c[5] | 0;
          c[4] = g;
          g = l >>> 8 ^ l ^ g ^ g >>> 19;
          c[5] = g;
          l = c[56 + (r * 56 | 0) + 48 >> 2] | 0;
          a: do
          if (!l) f = 0;else
          {
            i = c[56 + (r * 56 | 0) + 52 >> 2] | 0;
            f = 0;
            do {
              if (g >>> 0 <= (c[c[i + (f << 2) >> 2] >> 2] | 0) >>> 0) break a;
              f = f + 1 | 0;
            } while (f >>> 0 < l >>> 0);
          } while (
          0);
          b: do
          if ((f | 0) != (l | 0)) {
            i = c[(c[56 + (r * 56 | 0) + 52 >> 2] | 0) + (f << 2) >> 2] | 0;
            switch (c[i + 4 >> 2] | 0) {
              case 0:{
                  p = +h[m >> 3];
                  f = 56 + (r * 56 | 0) + 8 | 0;
                  q = +h[f >> 3];
                  g = 56 + (r * 56 | 0) + 16 | 0;
                  n = +h[g >> 3];
                  j = +h[i + 40 >> 3] * p + +h[i + 48 >> 3] * q + +h[i + 56 >> 3] * n;
                  k = p * +h[i + 88 >> 3] + q * +h[i + 96 >> 3] + n * +h[i + 104 >> 3];
                  n = p * +h[i + 64 >> 3] + q * +h[i + 72 >> 3] + n * +h[i + 80 >> 3];
                  break;
                }
              case 1:{
                  x = +h[i + 80 >> 3];
                  t = +h[i + 40 >> 3];
                  w = +h[i + 88 >> 3];
                  s = +h[i + 48 >> 3];
                  v = +h[i + 56 >> 3];
                  u = +h[m >> 3];
                  f = 56 + (r * 56 | 0) + 8 | 0;
                  j = +h[f >> 3];
                  g = 56 + (r * 56 | 0) + 16 | 0;
                  n = +h[g >> 3];
                  q = t * w * j - x * u - +h[i + 96 >> 3] * n;
                  w = w * u;
                  x = x * t * j;
                  p = +h[i + 104 >> 3] * n;
                  k = w + x + p;
                  o = s * u - t * v * j + +h[i + 64 >> 3] * n;
                  p = -x - w - p;
                  n = v * u + t * s * j + +h[i + 72 >> 3] * n;
                  j = k * n - o * q;
                  k = q * q - k * p;
                  n = o * p - q * n;
                  break;
                }
              default:
                break b;}

            x = +h[i + 8 >> 3];
            z = 56 + (r * 56 | 0) + 24 | 0;
            y = 56 + (r * 56 | 0) + 32 | 0;
            l = 56 + (r * 56 | 0) + 40 | 0;
            o = 1.0 - x;
            p = x * +h[z >> 3] + o * +h[i + 16 >> 3];
            q = x * +h[y >> 3] + o * +h[i + 24 >> 3];
            o = x * +h[l >> 3] + o * +h[i + 32 >> 3];
            h[z >> 3] = p;
            h[y >> 3] = q;
            h[l >> 3] = o;
            x = +M(+j);
            w = +M(+n);
            x = x < w ? w : x;
            w = +M(+k);
            x = 1.0 / (x < w ? w : x);
            h[m >> 3] = j * x;
            h[f >> 3] = n * x;
            h[g >> 3] = k * x;
            if (!e) {
              j = j / k + 0.5;
              if (!(j < 0.0 | j > 4294967295.0)) {
                k = n / k + 0.5;
                if (!(k < 0.0 | k > 4294967295.0)) {
                  g = ~~j >>> 0;
                  i = c[8] | 0;
                  if (g >>> 0 < i >>> 0) {
                    f = ~~k >>> 0;
                    if (f >>> 0 < (c[9] | 0) >>> 0) {
                      y = (Z(i, f) | 0) + g | 0;
                      m = c[10] | 0;
                      v = +h[3];
                      z = m + (y << 2) + 3 | 0;
                      w = (1.0 - v) * +(d[z >> 0] | 0) * 0.00392156862745098;
                      x = v + w;
                      u = 1.0 / x;
                      l = m + (y << 2) | 0;
                      a[l >> 0] = ~~((p * v + +(d[l >> 0] | 0) * w) * u + 0.5);
                      l = m + (y << 2) + 1 | 0;
                      a[l >> 0] = ~~(u * (q * v + w * +(d[l >> 0] | 0)) + 0.5);
                      y = m + (y << 2) + 2 | 0;
                      a[y >> 0] = ~~(u * (o * v + w * +(d[y >> 0] | 0)) + 0.5);
                      a[z >> 0] = ~~(x * 255.0 + 0.5);
                    }
                  }
                }
              }
            }
          } while (
          0);
          r = r + 1 | 0;
          f = c[11] | 0;
        } while (r >>> 0 < f >>> 0);
      }
    } while ((b | 0) != 0);
    return;
  }
  function ha(a, b, d, e, f, g, i, j, k, l, m, n, o, p, q) {
    a = a | 0;
    b = b | 0;
    d = +d;
    e = +e;
    f = +f;
    g = +g;
    i = +i;
    j = +j;
    k = +k;
    l = +l;
    m = +m;
    n = +n;
    o = +o;
    p = +p;
    q = +q;
    let r = 0,
    s = 0;
    a = 56 + (a * 56 | 0) + 52 | 0;
    s = c[(c[a >> 2] | 0) + (b << 2) >> 2] | 0;
    c[s + 4 >> 2] = 1;
    h[s + 8 >> 3] = d;
    h[s + 16 >> 3] = e;
    h[s + 24 >> 3] = f;
    h[s + 32 >> 3] = g;
    a = c[a >> 2] | 0;
    r = 0;
    g = 0.0;
    while (1) {
      g = g + +h[(c[a + (r << 2) >> 2] | 0) + 8 >> 3];
      if ((r | 0) == (b | 0)) break;else
      r = r + 1 | 0;
    }
    c[s >> 2] = ~~(g * 4294967296.0 + -0.5) >>> 0;
    h[s + 40 >> 3] = i;
    h[s + 48 >> 3] = j;
    h[s + 56 >> 3] = k;
    h[s + 64 >> 3] = l;
    h[s + 72 >> 3] = m;
    h[s + 80 >> 3] = n;
    h[s + 88 >> 3] = o;
    h[s + 96 >> 3] = p;
    h[s + 104 >> 3] = q;
    return;
  }
  function ga(a, b, d, e, f, g, i, j, k, l, m, n, o, p, q) {
    a = a | 0;
    b = b | 0;
    d = +d;
    e = +e;
    f = +f;
    g = +g;
    i = +i;
    j = +j;
    k = +k;
    l = +l;
    m = +m;
    n = +n;
    o = +o;
    p = +p;
    q = +q;
    let r = 0,
    s = 0;
    a = 56 + (a * 56 | 0) + 52 | 0;
    s = c[(c[a >> 2] | 0) + (b << 2) >> 2] | 0;
    c[s + 4 >> 2] = 0;
    h[s + 8 >> 3] = d;
    h[s + 16 >> 3] = e;
    h[s + 24 >> 3] = f;
    h[s + 32 >> 3] = g;
    a = c[a >> 2] | 0;
    r = 0;
    g = 0.0;
    while (1) {
      g = g + +h[(c[a + (r << 2) >> 2] | 0) + 8 >> 3];
      if ((r | 0) == (b | 0)) break;else
      r = r + 1 | 0;
    }
    c[s >> 2] = ~~(g * 4294967296.0 + -0.5) >>> 0;
    h[s + 40 >> 3] = i;
    h[s + 48 >> 3] = j;
    h[s + 56 >> 3] = k;
    h[s + 64 >> 3] = l;
    h[s + 72 >> 3] = m;
    h[s + 80 >> 3] = n;
    h[s + 88 >> 3] = o;
    h[s + 96 >> 3] = p;
    h[s + 104 >> 3] = q;
    return;
  }
  function ea(a, b, d, e) {
    a = a | 0;
    b = b | 0;
    d = d | 0;
    e = e | 0;
    c[2] = -691182520;
    c[3] = 1666775300;
    c[4] = -136142663;
    c[5] = -1722921925;
    h[3] = 0.5;
    c[11] = a;
    c[8] = d;
    c[9] = e;
    e = 56 + (a * 56 | 0) | 0;
    c[12] = e;
    a = e + (b << 2) | 0;
    d = a & 4;
    a = ((d | 0) == 0 ? 0 : 8 - d | 0) + a | 0;
    if (b | 0) {
      c[e >> 2] = a;
      if ((b | 0) != 1) {
        e = 1;
        do {
          c[(c[12] | 0) + (e << 2) >> 2] = a + (e * 112 | 0);
          e = e + 1 | 0;
        } while ((e | 0) != (b | 0));
      }
    }
    b = a + (b * 112 | 0) | 0;
    c[10] = b;
    return b | 0;
  }
  function fa(a, b) {
    a = a | 0;
    b = b | 0;
    let d = 0;
    d = 56 + (a * 56 | 0) | 0;
    c[d >> 2] = 0;
    c[d + 4 >> 2] = 0;
    c[d + 8 >> 2] = 0;
    c[d + 12 >> 2] = 0;
    h[56 + (a * 56 | 0) + 16 >> 3] = 1.0;
    h[56 + (a * 56 | 0) + 24 >> 3] = 1.0;
    h[56 + (a * 56 | 0) + 32 >> 3] = 1.0;
    h[56 + (a * 56 | 0) + 40 >> 3] = 1.0;
    c[56 + (a * 56 | 0) + 48 >> 2] = b;
    d = c[12] | 0;
    c[56 + (a * 56 | 0) + 52 >> 2] = d;
    c[12] = d + (b << 2);
    return;
  }
  return {
    _setProj: ga,
    _setIFS: fa,
    _real: da,
    _init: ea,
    _setMoebius: ha };

};
//# sourceMappingURL=ifs.js.map