"use strict"; var _slicedToArray = function () { function sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"]) _i["return"](); } finally { if (_d) throw _e; } } return _arr; } return function (arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return sliceIterator(arr, i); } else { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } }; }(); var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var evaluate = require("babel-helper-evaluate-path"); // Assuming all the static methods from below array are side effect free evaluation // except Math.random var VALID_CALLEES = ["String", "Number", "Math"]; var INVALID_METHODS = ["random"]; module.exports = function (_ref) { var t = _ref.types; var BuiltInReplacer = function () { function BuiltInReplacer(program, _ref2) { var tdz = _ref2.tdz; _classCallCheck(this, BuiltInReplacer); this.program = program; this.tdz = tdz; // map; this.pathsToUpdate = new Map(); } _createClass(BuiltInReplacer, [{ key: "run", value: function run() { this.collect(); this.replace(); } }, { key: "collect", value: function collect() { var context = this; var collectVisitor = { AssignmentExpression(path) { var left = path.get("left"); // Should bail and not run the plugin // when builtin is polyfilled if (t.isMemberExpression(left) && isBuiltInComputed(left)) { var parent = path; do { parent.stop(); } while (parent = parent.parentPath); } }, MemberExpression(path) { if (path.parentPath.isCallExpression()) { return; } if (!isComputed(path) && isBuiltin(path) && !path.getFunctionParent().isProgram()) { var expName = memberToString(path.node); addToMap(context.pathsToUpdate, expName, path); } }, CallExpression: { exit(path) { var callee = path.get("callee"); if (!callee.isMemberExpression()) { return; } // computed property should not be optimized // Math[max]() -> Math.max() if (!isComputed(callee) && isBuiltin(callee)) { var result = evaluate(path, { tdz: context.tdz }); // deopt when we have side effecty evaluate-able arguments // Math.max(foo(), 1) --> untouched // Math.floor(1) --> 1 if (result.confident && hasPureArgs(path)) { path.replaceWith(t.valueToNode(result.value)); } else if (!callee.getFunctionParent().isProgram()) { var expName = memberToString(callee.node); addToMap(context.pathsToUpdate, expName, callee); } } } } }; this.program.traverse(collectVisitor); } }, { key: "replace", value: function replace() { var _iteratorNormalCompletion = true; var _didIteratorError = false; var _iteratorError = undefined; try { for (var _iterator = this.pathsToUpdate[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { var _ref3 = _step.value; var _ref4 = _slicedToArray(_ref3, 2); var expName = _ref4[0]; var paths = _ref4[1]; // transform only if there is more than 1 occurence if (paths.length <= 1) { continue; } var segmentsMap = getSegmentedSubPaths(paths); var _iteratorNormalCompletion2 = true; var _didIteratorError2 = false; var _iteratorError2 = undefined; try { for (var _iterator2 = segmentsMap[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) { var _ref5 = _step2.value; var _ref6 = _slicedToArray(_ref5, 2); var parent = _ref6[0]; var subpaths = _ref6[1]; if (subpaths.length <= 1) { continue; } var uniqueIdentifier = parent.scope.generateUidIdentifier(expName); var newNode = t.variableDeclaration("var", [t.variableDeclarator(uniqueIdentifier, subpaths[0].node)]); var _iteratorNormalCompletion3 = true; var _didIteratorError3 = false; var _iteratorError3 = undefined; try { for (var _iterator3 = subpaths[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) { var path = _step3.value; path.replaceWith(t.clone(uniqueIdentifier)); } // hoist the created var to the top of the function scope } catch (err) { _didIteratorError3 = true; _iteratorError3 = err; } finally { try { if (!_iteratorNormalCompletion3 && _iterator3.return) { _iterator3.return(); } } finally { if (_didIteratorError3) { throw _iteratorError3; } } } parent.get("body").unshiftContainer("body", newNode); } } catch (err) { _didIteratorError2 = true; _iteratorError2 = err; } finally { try { if (!_iteratorNormalCompletion2 && _iterator2.return) { _iterator2.return(); } } finally { if (_didIteratorError2) { throw _iteratorError2; } } } } } catch (err) { _didIteratorError = true; _iteratorError = err; } finally { try { if (!_iteratorNormalCompletion && _iterator.return) { _iterator.return(); } } finally { if (_didIteratorError) { throw _iteratorError; } } } } }]); return BuiltInReplacer; }(); return { name: "minify-builtins", visitor: { Program(path, _ref7) { var _ref7$opts = _ref7.opts; _ref7$opts = _ref7$opts === undefined ? {} : _ref7$opts; var _ref7$opts$tdz = _ref7$opts.tdz, tdz = _ref7$opts$tdz === undefined ? false : _ref7$opts$tdz; var builtInReplacer = new BuiltInReplacer(path, { tdz }); builtInReplacer.run(); } } }; function memberToString(memberExpr) { var object = memberExpr.object, property = memberExpr.property; var result = ""; if (t.isIdentifier(object)) result += object.name; if (t.isMemberExpression(object)) result += memberToString(object); if (t.isIdentifier(property)) result += property.name; return result; } function isBuiltInComputed(memberExpr) { var node = memberExpr.node; var object = node.object, computed = node.computed; return computed && t.isIdentifier(object) && VALID_CALLEES.indexOf(object.name) >= 0; } function isBuiltin(memberExpr) { var _memberExpr$node = memberExpr.node, object = _memberExpr$node.object, property = _memberExpr$node.property; if (t.isIdentifier(object) && t.isIdentifier(property) && VALID_CALLEES.indexOf(object.name) >= 0 && INVALID_METHODS.indexOf(property.name) < 0) { return true; } return false; } }; function addToMap(map, key, value) { if (!map.has(key)) { map.set(key, []); } map.get(key).push(value); } // Creates a segmented map that contains the earliest common Ancestor // as the key and array of subpaths that are descendats of the LCA as value function getSegmentedSubPaths(paths) { var segments = new Map(); // Get earliest Path in tree where paths intersect paths[0].getDeepestCommonAncestorFrom(paths, function (lastCommon, index, ancestries) { // found the LCA if (!lastCommon.isProgram()) { var fnParent = void 0; if (lastCommon.isFunction() && lastCommon.get("body").isBlockStatement()) { segments.set(lastCommon, paths); return; } else if (!(fnParent = lastCommon.getFunctionParent()).isProgram() && fnParent.get("body").isBlockStatement()) { segments.set(fnParent, paths); return; } } // Deopt and construct segments otherwise var _loop = function _loop(ancestor) { var fnPath = getChildFuncion(ancestor); if (fnPath === void 0) { return "continue"; } var validDescendants = paths.filter(function (p) { return p.isDescendant(fnPath); }); segments.set(fnPath, validDescendants); }; var _iteratorNormalCompletion4 = true; var _didIteratorError4 = false; var _iteratorError4 = undefined; try { for (var _iterator4 = ancestries[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) { var ancestor = _step4.value; var _ret = _loop(ancestor); if (_ret === "continue") continue; } } catch (err) { _didIteratorError4 = true; _iteratorError4 = err; } finally { try { if (!_iteratorNormalCompletion4 && _iterator4.return) { _iterator4.return(); } } finally { if (_didIteratorError4) { throw _iteratorError4; } } } }); return segments; } function getChildFuncion() { var ancestors = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []; var _iteratorNormalCompletion5 = true; var _didIteratorError5 = false; var _iteratorError5 = undefined; try { for (var _iterator5 = ancestors[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) { var path = _step5.value; if (path.isFunction() && path.get("body").isBlockStatement()) { return path; } } } catch (err) { _didIteratorError5 = true; _iteratorError5 = err; } finally { try { if (!_iteratorNormalCompletion5 && _iterator5.return) { _iterator5.return(); } } finally { if (_didIteratorError5) { throw _iteratorError5; } } } } function hasPureArgs(path) { var args = path.get("arguments"); var _iteratorNormalCompletion6 = true; var _didIteratorError6 = false; var _iteratorError6 = undefined; try { for (var _iterator6 = args[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) { var arg = _step6.value; if (!arg.isPure()) { return false; } } } catch (err) { _didIteratorError6 = true; _iteratorError6 = err; } finally { try { if (!_iteratorNormalCompletion6 && _iterator6.return) { _iterator6.return(); } } finally { if (_didIteratorError6) { throw _iteratorError6; } } } return true; } function isComputed(path) { var node = path.node; return node.computed; }