js-confuser 1.2.1 → 1.4.1

package/dist/transforms/string/encoding.js

@@ -0,0 +1,209 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _template = _interopRequireDefault(require("../../templates/template"));
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+const Encoding = {
+  ascii85: {
+    encode(a) {
+      var b, c, d, e, f, g, h, i, j, k; // @ts-ignore
+
+      for ( // @ts-ignore
+      !/[^\x00-\xFF]/.test(a), b = "\x00\x00\x00\x00".slice(a.length % 4 || 4), a += b, c = [], d = 0, e = a.length; e > d; d += 4) f = (a.charCodeAt(d) << 24) + (a.charCodeAt(d + 1) << 16) + (a.charCodeAt(d + 2) << 8) + a.charCodeAt(d + 3), 0 !== f ? (k = f % 85, f = (f - k) / 85, j = f % 85, f = (f - j) / 85, i = f % 85, f = (f - i) / 85, h = f % 85, f = (f - h) / 85, g = f % 85, c.push(g + 33, h + 33, i + 33, j + 33, k + 33)) : c.push(122);
+
+      return function (a, b) {
+        for (var c = b; c > 0; c--) a.pop();
+      }(c, b.length), "<~" + String.fromCharCode.apply(String, c) + "~>";
+    },
+
+    decode(a) {
+      var c,
+          d,
+          e,
+          f,
+          g,
+          h = String,
+          l = "length",
+          w = 255,
+          x = "charCodeAt",
+          y = "slice",
+          z = "replace";
+
+      for ("<~" === a[y](0, 2) && "~>" === a[y](-2), a = a[y](2, -2)[z](/s/g, "")[z]("z", "!!!!!"), c = "uuuuu"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);
+
+      return function (a, b) {
+        for (var c = b; c > 0; c--) a.pop();
+      }(e, c[l]), h.fromCharCode.apply(h, e);
+    },
+
+    template: (0, _template.default)("\n    function {name}(a, LL = [\"fromCharCode\", \"apply\"]) {\n      var c, d, e, f, g, h = String, l = \"length\", w = 255, x = \"charCodeAt\", y = \"slice\", z = \"replace\";\n      for (\"<~\" === a[y](0, 2) && \"~>\" === a[y](-2), a = a[y](2, -2)[z](/s/g, \"\")[z](\"z\", \"!!!!!\"), \n      c = \"uuuuu\"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), \n      e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);\n      return function(a, b) {\n        for (var c = b; c > 0; c--) a.pop();\n      }(e, c[l]), h[LL[0]][LL[1]](h, e);\n    }\n    ")
+  },
+  base32: {
+    encode: function (s) {
+      var a = "!\"#$%&'()*+,-./0123456789:;<=>?@";
+      var len = s.length;
+      var o = "";
+      var w,
+          c,
+          r = 0,
+          sh = 0,
+          i;
+
+      for (i = 0; i < len; i += 5) {
+        // mask top 5 bits
+        c = s.charCodeAt(i);
+        w = 0xf8 & c;
+        o += a.charAt(w >> 3);
+        r = 0x07 & c;
+        sh = 2;
+
+        if (i + 1 < len) {
+          c = s.charCodeAt(i + 1); // mask top 2 bits
+
+          w = 0xc0 & c;
+          o += a.charAt((r << 2) + (w >> 6));
+          o += a.charAt((0x3e & c) >> 1);
+          r = c & 0x01;
+          sh = 4;
+        }
+
+        if (i + 2 < len) {
+          c = s.charCodeAt(i + 2); // mask top 4 bits
+
+          w = 0xf0 & c;
+          o += a.charAt((r << 4) + (w >> 4));
+          r = 0x0f & c;
+          sh = 1;
+        }
+
+        if (i + 3 < len) {
+          c = s.charCodeAt(i + 3); // mask top 1 bit
+
+          w = 0x80 & c;
+          o += a.charAt((r << 1) + (w >> 7));
+          o += a.charAt((0x7c & c) >> 2);
+          r = 0x03 & c;
+          sh = 3;
+        }
+
+        if (i + 4 < len) {
+          c = s.charCodeAt(i + 4); // mask top 3 bits
+
+          w = 0xe0 & c;
+          o += a.charAt((r << 3) + (w >> 5));
+          o += a.charAt(0x1f & c);
+          r = 0;
+          sh = 0;
+        }
+      } // Calculate length of pad by getting the
+      // number of words to reach an 8th octet.
+
+
+      if (r != 0) {
+        o += a.charAt(r << sh);
+      }
+
+      return o;
+    },
+    decode: function (s) {
+      var v,
+          x,
+          bits = 0,
+          o = "",
+          len = s.length,
+          d = String,
+          e = "charCodeAt",
+          f = "fromCharCode",
+          i;
+
+      for (i = 0; i < len; i += 1) {
+        v = s[e](i) - 33, v >= 0 && v < 32 ? (bits += (x = x << 5 | v, 5), bits >= 8 ? bits -= (o += d[f](x >> bits - 8 & 0xff), 8) : 0) : 0;
+      }
+
+      return o;
+    },
+    template: (0, _template.default)("\n    function {name}(s) {\n      var v,\n        x,\n        b = 0,\n        o = \"\",\n        len = s.length,\n        d = String,\n        e = \"charCodeAt\",\n        f = \"fromCharCode\", i;\n  \n      for (i = 0; i < len; i += 1) {\n        (v = s[e](i) - 33),\n          v >= 0 && v < 32\n            ? ((b += ((x = (x << 5) | v), 5)),\n              b >= 8\n                ? (b -= ((o += d[f]((x >> (b - 8)) & 0xff)), 8))\n                : 0)\n            : 0;\n      }\n      return o;\n    }\n    ")
+  },
+  hexTable: {
+    encode: function (str) {
+      var output = "";
+
+      for (var j = 0; j < str.length; j += 3) {
+        var chunk = str.substring(j, j + 3);
+
+        if (!chunk) {
+          continue;
+        }
+
+        chunk = chunk + "~";
+        var uniqueChars = new Set([]);
+
+        for (var char of chunk) {
+          uniqueChars.add(char);
+        }
+
+        var keys = Array.from(uniqueChars).sort();
+        var table = {},
+            i = 0;
+
+        for (var key of keys) {
+          table[key] = i++;
+        }
+
+        var idx = [];
+
+        for (var char of chunk) {
+          idx.push(table[char]);
+        }
+
+        var table64 = "0x";
+
+        for (var i = keys.length - 1; i >= 0; i--) {
+          table64 += keys[i].charCodeAt(0).toString(16).toUpperCase();
+        }
+
+        var idxInt = 0;
+
+        for (var i = idx.length - 1; i >= 0; i--) {
+          idxInt = idxInt << 3 | idx[i];
+        }
+
+        var idx64 = "0x" + idxInt.toString(16).toUpperCase(); // console.log(chunk, table, idx, table64, idx64);
+
+        output += table64 + "," + idx64 + ",";
+      }
+
+      if (output.endsWith(",")) {
+        output = output.substring(0, output.length - 1);
+      }
+
+      return "{" + output + "}";
+    },
+    decode: function (str) {
+      var output = "";
+      str = str.substring(1, str.length - 1);
+      var chunks = str.split(",");
+
+      for (var i = 0; i < chunks.length; i += 2) {
+        var arr = [chunks[i], chunks[i + 1]];
+        var [table, idx] = arr.map(Number); // console.log(table, idx);
+
+        while (idx) {
+          output += String.fromCharCode(table >> 8 * (idx & 7) & 0xff);
+          idx >>= 3;
+        }
+      }
+
+      return output.replace(/~/g, "");
+    },
+    template: (0, _template.default)("\n      function {name}(str){\n        var output = \"\";\n    \n        str = str.substring(1, str.length - 1);\n        var chunks = str.split(\",\");\n      \n        for (var i = 0; i < chunks.length; i += 2) {\n          var arr = [chunks[i], chunks[i + 1]];\n      \n          var [table, idx] = arr.map(Number);\n      \n          // console.log(table, idx);\n          while (idx) {\n            output += String.fromCharCode((table >> (8 * (idx & 7))) & 0xff);\n            idx >>= 3;\n          }\n        }\n      \n        return output.replace(/~/g, \"\");\n      }\n    \n    ")
+  }
+};
+var _default = Encoding;
+exports.default = _default;

package/dist/transforms/string/stringCompression.js

@@ -62,7 +62,7 @@ function LZ_decode(b) {
   return g.join("");
 }
 
-const DecodeTemplate = (0, _template.default)("function {name}(b){\n    var o,\n    f,\n    a,\n    e = {},\n    d = b.split(\"\"),\n    c = (f = d[0]),\n    g = [c],\n    h = (o = 256);\n  for (b = 1; b < d.length; b++)\n    (a = d[b].charCodeAt(0)),\n      (a = h > a ? d[b] : e[a] ? e[a] : f + c),\n      g.push(a),\n      (c = a.charAt(0)),\n      (e[o] = f + c),\n      o++,\n      (f = a);\n  return g.join(\"\");\n  }");
+const DecodeTemplate = (0, _template.default)("function {name}(b){\n    var o,\n    f,\n    a,\n    e = {},\n    d = b.split(\"\"),\n    c = (f = d[0]),\n    g = [c],\n    h = (o = 256);\n  for (b = 1; b < d.length; b++)\n    (a = d[b].charCodeAt(0)),\n      (a = h > a ? d[b] : e[a] ? e[a] : f + c),\n      g.push(a),\n      (c = a.charAt(0)),\n      (e[o] = f + c),\n      o++,\n      (f = a);\n  return g.join(\"\").split(\"{delimiter}\");\n  }");
 
 class StringCompression extends _transform.default {
   constructor(o) {
@@ -94,17 +94,22 @@ class StringCompression extends _transform.default {
 
     var split = this.getPlaceholder();
     var decoder = this.getPlaceholder();
+    var getStringName = this.getPlaceholder();
     var encoded = LZ_encode(this.string);
 
     if (LZ_decode(encoded) !== this.string) {
       this.error(new Error("String failed to be decoded"));
     }
 
-    var callExpression = (0, _gen.CallExpression)((0, _gen.MemberExpression)((0, _gen.CallExpression)((0, _gen.Identifier)(decoder), [(0, _gen.Literal)(encoded)]), (0, _gen.Identifier)("split"), false), [(0, _gen.Literal)(this.delimiter)]);
-    (0, _insert.prepend)(tree, (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(split, callExpression)));
+    var getStringParamName = this.getPlaceholder();
+    var decoderParamName = this.getPlaceholder();
+    var callExpression = (0, _gen.CallExpression)((0, _gen.Identifier)(decoderParamName), [(0, _gen.CallExpression)((0, _gen.Identifier)(getStringParamName), [])]);
+    (0, _insert.prepend)(tree, (0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(split, (0, _gen.CallExpression)((0, _gen.FunctionExpression)([(0, _gen.Identifier)(getStringParamName), (0, _gen.Identifier)(decoderParamName)], [(0, _gen.ReturnStatement)(callExpression)]), [(0, _gen.Identifier)(getStringName), (0, _gen.Identifier)(decoder)]))));
+    (0, _insert.append)(tree, (0, _gen.FunctionDeclaration)(getStringName, [], [(0, _gen.ReturnStatement)((0, _gen.Literal)(encoded))]));
     (0, _insert.append)(tree, (0, _gen.FunctionDeclaration)(this.fnName, [(0, _gen.Identifier)("index")], [(0, _gen.ReturnStatement)((0, _gen.MemberExpression)((0, _gen.Identifier)(split), (0, _gen.Identifier)("index"), true))]));
     (0, _insert.append)(tree, DecodeTemplate.single({
-      name: decoder
+      name: decoder,
+      delimiter: this.delimiter
     }));
   }
 
@@ -151,12 +156,7 @@ class StringCompression extends _transform.default {
     }
 
     (0, _assert.ok)(typeof index === "number");
-    this.replace(object, (0, _gen.CallExpression)((0, _gen.Identifier)(this.fnName), [(0, _gen.Literal)(index)])); // Fix 2. Make parent property key computed
-
-    if (parents[0] && (parents[0].type == "Property" || parents[0].type == "MethodDefinition") && parents[0].key == object) {
-      parents[0].computed = true;
-      parents[0].shorthand = false;
-    }
+    this.replaceIdentifierOrLiteral(object, (0, _gen.CallExpression)((0, _gen.Identifier)(this.fnName), [(0, _gen.Literal)(index)]), parents);
   }
 
 }

package/dist/transforms/string/stringConcealing.js

@@ -12,52 +12,24 @@ var _order = require("../../order");
 
 var _template = _interopRequireDefault(require("../../templates/template"));
 
+var _traverse = require("../../traverse");
+
 var _compare = require("../../util/compare");
 
 var _gen = require("../../util/gen");
 
 var _insert = require("../../util/insert");
 
+var _random = require("../../util/random");
+
 var _transform = _interopRequireDefault(require("../transform"));
 
+var _encoding = _interopRequireDefault(require("./encoding"));
+
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
 
-/* eslint-disable @typescript-eslint/no-unused-expressions */
-function encode_ascii85(a) {
-  var b, c, d, e, f, g, h, i, j, k; // @ts-ignore
-
-  for ( // @ts-ignore
-  !/[^\x00-\xFF]/.test(a), b = "\x00\x00\x00\x00".slice(a.length % 4 || 4), a += b, c = [], d = 0, e = a.length; e > d; d += 4) f = (a.charCodeAt(d) << 24) + (a.charCodeAt(d + 1) << 16) + (a.charCodeAt(d + 2) << 8) + a.charCodeAt(d + 3), 0 !== f ? (k = f % 85, f = (f - k) / 85, j = f % 85, f = (f - j) / 85, i = f % 85, f = (f - i) / 85, h = f % 85, f = (f - h) / 85, g = f % 85, c.push(g + 33, h + 33, i + 33, j + 33, k + 33)) : c.push(122);
-
-  return function (a, b) {
-    for (var c = b; c > 0; c--) a.pop();
-  }(c, b.length), "<~" + String.fromCharCode.apply(String, c) + "~>";
-}
-
-function decode_ascii85(a) {
-  var c,
-      d,
-      e,
-      f,
-      g,
-      h = String,
-      l = "length",
-      w = 255,
-      x = "charCodeAt",
-      y = "slice",
-      z = "replace";
-
-  for ("<~" === a[y](0, 2) && "~>" === a[y](-2), a = a[y](2, -2)[z](/s/g, "")[z]("z", "!!!!!"), c = "uuuuu"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);
-
-  return function (a, b) {
-    for (var c = b; c > 0; c--) a.pop();
-  }(e, c[l]), h.fromCharCode.apply(h, e);
-}
-
-var Ascii85Template = (0, _template.default)("\nfunction {name}(a, LL = [\"fromCharCode\", \"apply\"]) {\n  var c, d, e, f, g, h = String, l = \"length\", w = 255, x = \"charCodeAt\", y = \"slice\", z = \"replace\";\n  for (\"<~\" === a[y](0, 2) && \"~>\" === a[y](-2), a = a[y](2, -2)[z](/s/g, \"\")[z](\"z\", \"!!!!!\"), \n  c = \"uuuuu\"[y](a[l] % 5 || 5), a += c, e = [], f = 0, g = a[l]; g > f; f += 5) d = 52200625 * (a[x](f) - 33) + 614125 * (a[x](f + 1) - 33) + 7225 * (a[x](f + 2) - 33) + 85 * (a[x](f + 3) - 33) + (a[x](f + 4) - 33), \n  e.push(w & d >> 24, w & d >> 16, w & d >> 8, w & d);\n  return function(a, b) {\n    for (var c = b; c > 0; c--) a.pop();\n  }(e, c[l]), h[LL[0]][LL[1]](h, e);\n}\n");
-
 function isModuleSource(object, parents) {
   if (!parents[0]) {
     return false;
@@ -90,51 +62,87 @@ class StringConcealing extends _transform.default {
 
     _defineProperty(this, "index", void 0);
 
-    _defineProperty(this, "getterName", this.getPlaceholder());
-
     _defineProperty(this, "arrayName", this.getPlaceholder());
 
-    _defineProperty(this, "decodeFn", this.getPlaceholder());
+    _defineProperty(this, "ignore", new Set());
+
+    _defineProperty(this, "variablesMade", 1);
+
+    _defineProperty(this, "encoding", Object.create(null));
 
-    _defineProperty(this, "decodeNode", void 0);
+    _defineProperty(this, "hasAllEncodings", void 0);
 
     this.set = new Set();
     this.index = Object.create(null);
+    this.arrayExpression = (0, _gen.ArrayExpression)([]);
+    this.hasAllEncodings = false; // Pad array with useless strings
+
+    var dead = (0, _random.getRandomInteger)(4, 10);
+
+    for (var i = 0; i < dead; i++) {
+      var str = (0, _random.getRandomString)((0, _random.getRandomInteger)(4, 20));
+      var fn = this.transform((0, _gen.Literal)(str), []);
+
+      if (fn) {
+        fn();
+      }
+    }
+  }
+
+  apply(tree) {
+    super.apply(tree);
+    var cacheName = this.getPlaceholder();
+    Object.keys(this.encoding).forEach(type => {
+      var {
+        template
+      } = _encoding.default[type];
+      var decodeFn = this.getPlaceholder();
+      var getterFn = this.encoding[type];
+      (0, _insert.append)(tree, template.single({
+        name: decodeFn
+      }));
+      (0, _insert.append)(tree, (0, _template.default)("\n            \n            function ".concat(getterFn, "(x, y, z, a = ").concat(decodeFn, ", b = ").concat(cacheName, "){\n              if ( z ) {\n                return y[").concat(cacheName, "[z]] = ").concat(getterFn, "(x, y);\n              } else if ( y ) {\n                [b, y] = [a(b), x || z]\n              }\n            \n              return y ? x[b[y]] : ").concat(cacheName, "[x] || (z=(b[x], a), ").concat(cacheName, "[x] = z(").concat(this.arrayName, "[x]))\n            }\n  \n            ")).single());
+    });
+    var flowIntegrity = this.getPlaceholder();
+    (0, _insert.prepend)(tree, (0, _gen.VariableDeclaration)([(0, _gen.VariableDeclarator)(cacheName, (0, _gen.ArrayExpression)([])), (0, _gen.VariableDeclarator)(flowIntegrity, (0, _gen.Literal)(0)), (0, _gen.VariableDeclarator)(this.arrayName, (0, _gen.CallExpression)((0, _gen.FunctionExpression)([], [(0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)("a", this.arrayExpression)), (0, _template.default)("return (".concat(flowIntegrity, " ? a.pop() : ").concat(flowIntegrity, "++, a)")).single()]), []))]));
   }
 
   match(object, parents) {
-    return object.type == "Program" || object.type == "Literal" && typeof object.value === "string" && !isModuleSource(object, parents) && !(0, _compare.isDirective)(object, parents) //&&
+    return object.type == "Literal" && typeof object.value === "string" && object.value.length >= 3 && !isModuleSource(object, parents) && !(0, _compare.isDirective)(object, parents) //&&
 
     /*!parents.find((x) => x.$dispatcherSkip)*/
     ;
   }
 
   transform(object, parents) {
-    if (object.type == "Program") {
-      this.arrayExpression = (0, _gen.ArrayExpression)([]);
-      return () => {
-        var cacheName = this.getPlaceholder();
-        (0, _insert.append)(object, (0, _template.default)("\n          \n          function ".concat(this.getterName, "(x, y, z){\n            if ( z ) {\n              return y[").concat(cacheName, "[z]] = x;\n            }\n            return y ? x[").concat(cacheName, "[y]] : ").concat(cacheName, "[x] || (").concat(cacheName, "[x] = ").concat(this.decodeFn, "(").concat(this.arrayName, "[x]))\n          }\n\n          ")).single());
-        (0, _insert.prepend)(object, (0, _gen.VariableDeclaration)([(0, _gen.VariableDeclarator)(cacheName, (0, _gen.ArrayExpression)([])), (0, _gen.VariableDeclarator)(this.arrayName, this.arrayExpression)]));
-        (0, _insert.append)(object, this.decodeNode = Ascii85Template.single({
-          name: this.decodeFn
-        }));
-      };
-    }
-
     return () => {
-      // No string concealing in the decoder function
-      if (parents.find(x => x == this.decodeNode)) {
+      // Empty strings are discarded
+      if (!object.value || this.ignore.has(object.value)) {
         return;
-      } // Empty strings are discarded
+      }
 
+      var types = Object.keys(this.encoding);
+      var type = (0, _random.choice)(types);
 
-      if (!object.value) {
-        return;
-      } // The decode function must return correct result
+      if (!type || !this.hasAllEncodings && Math.random() > 0.9) {
+        var allowed = Object.keys(_encoding.default).filter(type => !this.encoding[type]);
 
+        if (!allowed.length) {
+          this.hasAllEncodings = true;
+        } else {
+          var random = (0, _random.choice)(allowed);
+          type = random;
+          this.encoding[random] = this.getPlaceholder();
+        }
+      }
+
+      var fnName = this.encoding[type];
+      var encoder = _encoding.default[type]; // The decode function must return correct result
 
-      if (decode_ascii85(encode_ascii85(object.value)) != object.value) {
+      var encoded = encoder.encode(object.value);
+
+      if (encoder.decode(encoded) != object.value) {
+        this.ignore.add(object.value);
         this.warn(object.value.slice(0, 100));
         return;
       } // Fix 1. weird undefined error
@@ -144,21 +152,42 @@ class StringConcealing extends _transform.default {
         var index = -1;
 
         if (!this.set.has(object.value)) {
-          this.arrayExpression.elements.push((0, _gen.Literal)(encode_ascii85(object.value)));
+          this.arrayExpression.elements.push((0, _gen.Literal)(encoded));
           index = this.arrayExpression.elements.length - 1;
-          this.index[object.value] = index;
+          this.index[object.value] = [index, fnName];
           this.set.add(object.value);
         } else {
-          index = this.index[object.value];
+          [index, fnName] = this.index[object.value];
           (0, _assert.ok)(typeof index === "number");
         }
 
         (0, _assert.ok)(index != -1, "index == -1");
-        this.replace(object, (0, _gen.CallExpression)((0, _gen.Identifier)(this.getterName), [(0, _gen.Literal)(index)])); // Fix 2. Make parent property key computed
+        var callExpr = (0, _gen.CallExpression)((0, _gen.Identifier)(fnName), [(0, _gen.Literal)(index)]); // use `.apply` to fool automated de-obfuscators
+
+        if (Math.random() > 0.5) {
+          callExpr = (0, _gen.CallExpression)((0, _gen.MemberExpression)((0, _gen.Identifier)(fnName), (0, _gen.Identifier)("apply"), false), [(0, _gen.ThisExpression)(), (0, _gen.ArrayExpression)([(0, _gen.Literal)(index)])]);
+        } // use `.call`
+        else if (Math.random() > 0.5) {
+            callExpr = (0, _gen.CallExpression)((0, _gen.MemberExpression)((0, _gen.Identifier)(fnName), (0, _gen.Identifier)("call"), false), [(0, _gen.ThisExpression)(), (0, _gen.Literal)(index)]);
+          }
 
-        if (parents[0] && (parents[0].type == "Property" || parents[0].type == "MethodDefinition") && parents[0].key == object) {
-          parents[0].computed = true;
-          parents[0].shorthand = false;
+        var constantReference = parents.length && Math.random() > 0.5 / this.variablesMade;
+
+        if (constantReference) {
+          // Define the string earlier, reference the name here
+          var name = this.getPlaceholder();
+          var place = (0, _random.choice)(parents.filter(node => (0, _traverse.isBlock)(node)));
+
+          if (!place) {
+            this.error(Error("No lexical block to insert code"));
+          }
+
+          place.body.unshift((0, _gen.VariableDeclaration)((0, _gen.VariableDeclarator)(name, callExpr)));
+          this.replaceIdentifierOrLiteral(object, (0, _gen.Identifier)(name), parents);
+          this.variablesMade++;
+        } else {
+          // Direct call to the getter function
+          this.replaceIdentifierOrLiteral(object, callExpr, parents);
         }
       }
     };

package/dist/transforms/string/stringSplitting.js

@@ -21,6 +21,8 @@ var _compare = require("../../util/compare");
 
 var _assert = require("assert");
 
+var _probability = require("../../probability");
+
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
@@ -69,12 +71,6 @@ class StringSplitting extends _transform.default {
 
   transform(object, parents) {
     return () => {
-      var propIndex = parents.findIndex(x => x.type == "Property" || x.type == "MethodDefinition");
-
-      if (propIndex !== -1 && parents[propIndex].key == object) {
-        parents[propIndex].computed = true;
-      }
-
       var size = Math.round(Math.max(6, object.value.length / (0, _random.getRandomInteger)(3, 8)));
 
       if (object.value.length <= size) {
@@ -87,6 +83,10 @@ class StringSplitting extends _transform.default {
         return;
       }
 
+      if (!(0, _probability.ComputeProbabilityMap)(this.options.stringSplitting, x => x, object.value)) {
+        return;
+      }
+
       var binaryExpression;
       var parent;
       var last = chunks.pop();
@@ -100,7 +100,7 @@ class StringSplitting extends _transform.default {
         }
       });
       parent.right = (0, _gen.Literal)(last);
-      this.replace(object, parent);
+      this.replaceIdentifierOrLiteral(object, parent, parents);
     };
   }
 

package/dist/transforms/transform.js

@@ -317,6 +317,16 @@ class Transform {
 
     this.objectAssign(node1, node2);
   }
+
+  replaceIdentifierOrLiteral(node1, node2, parents) {
+    // Fix 2. Make parent property key computed
+    if (parents[0] && (parents[0].type == "Property" || parents[0].type == "MethodDefinition") && parents[0].key == node1) {
+      parents[0].computed = true;
+      parents[0].shorthand = false;
+    }
+
+    this.replace(node1, node2);
+  }
   /**
    * Smartly merges two Nodes.
    * - Null checking

package/dist/traverse.js

@@ -3,24 +3,13 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.getBlocks = getBlocks;
 exports.getBlock = getBlock;
 exports.isBlock = isBlock;
-exports.getDepth = getDepth;
 exports.walk = walk;
 exports.default = traverse;
 
 var _identifiers = require("./util/identifiers");
 
-/**
- * Returns all the scopes given parents array.
- * - `[object, ...parents]` is recommended.
- *
- * @param parents
- */
-function getBlocks(parents) {
-  return parents.filter(x => isBlock(x));
-}
 /**
  * A block refers to any object that has a **`.body`** property where code is nested.
  *
@@ -29,14 +18,12 @@ function getBlocks(parents) {
  * @param object
  * @param parents
  */
-
-
 function getBlock(object, parents) {
   if (!Array.isArray(parents)) {
     throw new Error("parents must be an array");
   }
 
-  return getBlocks([object, ...parents])[0];
+  return [object, ...parents].find(node => isBlock(node));
 }
 /**
  * Must have a **`.body`** property and be an array.
@@ -51,27 +38,6 @@ function getBlock(object, parents) {
 function isBlock(object) {
   return object && (object.type == "BlockStatement" || object.type == "Program");
 }
-/**
- * Returns a numerical representation of the depth.
- * - Depth is how many blocks nested.
- * - Program = 1 depth
- * -    First Fn = 2 depth
- * -        Nested Fn = 3 depth
- * -    Second Fn = 2 depth
- * -        etc...
- * @param object
- * @param parents
- */
-
-
-function getDepth(object, parents) {
-  if (!Array.isArray(parents)) {
-    throw new Error("parents should be an array");
-  }
-
-  var scopes = getBlocks([object, ...parents].filter(x => x));
-  return scopes.length;
-}
 
 function walk(object, parents, onEnter, seen = new Set()) {
   if (typeof object === "object" && object) {

package/dist/util/gen.js

@@ -136,6 +136,8 @@ function ThisExpression() {
 }
 
 function SwitchCase(test, consequent) {
+  (0, _assert.ok)(test === null || test);
+  (0, _assert.ok)(Array.isArray(consequent));
   return {
     type: "SwitchCase",
     test,
@@ -471,7 +473,7 @@ function AssignmentPattern(left, right) {
   (0, _assert.ok)(left);
   (0, _assert.ok)(right);
   return {
-    type: "AssignmentExpression",
+    type: "AssignmentPattern",
     left: left,
     right: right
   };