/*********************************************************************** A JavaScript tokenizer / parser / beautifier / compressor. https://github.com/mishoo/UglifyJS -------------------------------- (C) --------------------------------- Author: Mihai Bazon http://mihai.bazon.net/blog Distributed under the BSD license: Copyright 2012 (c) Mihai Bazon Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ***********************************************************************/ "use strict"; function SymbolDef(id, scope, orig, init) { this.eliminated = 0; this.global = false; this.id = id; this.init = init; this.lambda = orig instanceof AST_SymbolLambda; this.mangled_name = null; this.name = orig.name; this.orig = [ orig ]; this.references = []; this.replaced = 0; this.scope = scope; this.undeclared = false; } SymbolDef.prototype = { forEach: function(fn) { this.orig.forEach(fn); this.references.forEach(fn); }, mangle: function(options) { var cache = options.cache && options.cache.props; if (this.global && cache && cache.has(this.name)) { this.mangled_name = cache.get(this.name); } else if (!this.mangled_name && !this.unmangleable(options)) { var def = this.redefined(); if (def) { this.mangled_name = def.mangled_name || def.name; } else { this.mangled_name = next_mangled_name(this.scope, options, this); } if (this.global && cache) { cache.set(this.name, this.mangled_name); } } }, redefined: function() { var scope = this.defun; if (!scope) return; var name = this.name; var def = scope.variables.get(name) || scope instanceof AST_Toplevel && scope.globals.get(name) || this.orig[0] instanceof AST_SymbolConst && find_if(function(def) { return def.name == name; }, scope.enclosed); if (def && def !== this) return def.redefined() || def; }, unmangleable: function(options) { return this.global && !options.toplevel || this.undeclared || !options.eval && this.scope.pinned() || options.keep_fnames && (this.orig[0] instanceof AST_SymbolLambda || this.orig[0] instanceof AST_SymbolDefun); }, }; AST_Toplevel.DEFMETHOD("figure_out_scope", function(options) { options = defaults(options, { cache: null, ie8: false, }); // pass 1: setup scope chaining and handle definitions var self = this; var defun = null; var next_def_id = 0; var scope = self.parent_scope = null; var tw = new TreeWalker(function(node, descend) { if (node instanceof AST_Defun) { node.name.walk(tw); walk_scope(function() { node.argnames.forEach(function(argname) { argname.walk(tw); }); walk_body(node, tw); }); return true; } if (node instanceof AST_SwitchBranch) { node.init_vars(scope); descend(); return true; } if (node instanceof AST_Try) { walk_scope(function() { walk_body(node, tw); }); if (node.bcatch) node.bcatch.walk(tw); if (node.bfinally) node.bfinally.walk(tw); return true; } if (node instanceof AST_With) { var s = scope; do { s = s.resolve(); if (s.uses_with) break; s.uses_with = true; } while (s = s.parent_scope); walk_scope(descend); return true; } if (node instanceof AST_BlockScope) { walk_scope(descend); return true; } if (node instanceof AST_Symbol) { node.scope = scope; } if (node instanceof AST_Label) { node.thedef = node; node.references = []; } if (node instanceof AST_SymbolCatch) { scope.def_variable(node).defun = defun; } else if (node instanceof AST_SymbolConst) { scope.def_variable(node).defun = defun; } else if (node instanceof AST_SymbolDefun) { defun.def_function(node, tw.parent()); entangle(defun, scope); } else if (node instanceof AST_SymbolFunarg) { defun.def_variable(node); entangle(defun, scope); } else if (node instanceof AST_SymbolLambda) { var def = defun.def_function(node, node.name == "arguments" ? undefined : defun); if (options.ie8) def.defun = defun.parent_scope.resolve(); } else if (node instanceof AST_SymbolLet) { scope.def_variable(node); } else if (node instanceof AST_SymbolVar) { defun.def_variable(node, null); entangle(defun, scope); } function walk_scope(descend) { node.init_vars(scope); var save_defun = defun; var save_scope = scope; if (node instanceof AST_Scope) defun = node; scope = node; descend(); scope = save_scope; defun = save_defun; } function entangle(defun, scope) { if (defun === scope) return; node.mark_enclosed(options); var def = scope.find_variable(node); if (node.thedef === def) return; node.thedef = def; def.orig.push(node); node.mark_enclosed(options); } }); self.make_def = function(orig, init) { return new SymbolDef(++next_def_id, this, orig, init); }; self.walk(tw); // pass 2: find back references and eval self.globals = new Dictionary(); var in_arg = []; var tw = new TreeWalker(function(node) { if (node instanceof AST_Lambda) { in_arg.push(node); node.argnames.forEach(function(argname) { argname.walk(tw); }); in_arg.pop(); walk_body(node, tw); return true; } if (node instanceof AST_LoopControl) { if (node.label) node.label.thedef.references.push(node); return true; } if (node instanceof AST_SymbolRef) { var name = node.name; var sym = node.scope.find_variable(name); for (var i = in_arg.length; i > 0 && sym;) { i = in_arg.lastIndexOf(sym.scope, i - 1); if (i < 0) break; var decl = sym.orig[0]; if (decl instanceof AST_SymbolFunarg || decl instanceof AST_SymbolLambda) { node.in_arg = true; break; } sym = sym.scope.parent_scope.find_variable(name); } if (!sym) { sym = self.def_global(node); } else if (name == "arguments" && sym.scope instanceof AST_Lambda) { sym.scope.uses_arguments = true; } if (name == "eval") { var parent = tw.parent(); if (parent.TYPE == "Call" && parent.expression === node) { var s = node.scope; do { s = s.resolve(); if (s.uses_eval) break; s.uses_eval = true; } while (s = s.parent_scope); } else if (sym.undeclared) { self.uses_eval = true; } } node.thedef = sym; node.reference(options); return true; } // ensure mangling works if `catch` reuses a scope variable if (node instanceof AST_SymbolCatch) { var def = node.definition().redefined(); if (def) for (var s = node.scope; s; s = s.parent_scope) { push_uniq(s.enclosed, def); if (s === def.scope) break; } return true; } // ensure compression works if `const` reuses a scope variable if (node instanceof AST_SymbolConst) { var redef = node.definition().redefined(); if (redef) redef.const_redefs = true; return true; } }); self.walk(tw); // pass 3: fix up any scoping issue with IE8 if (options.ie8) self.walk(new TreeWalker(function(node) { if (node instanceof AST_SymbolCatch) { var scope = node.thedef.defun; if (scope.name instanceof AST_SymbolLambda && scope.name.name == node.name) { scope = scope.parent_scope.resolve(); } redefine(node, scope); return true; } if (node instanceof AST_SymbolLambda) { var def = node.thedef; redefine(node, node.scope.parent_scope.resolve()); if (typeof node.thedef.init !== "undefined") { node.thedef.init = false; } else if (def.init) { node.thedef.init = def.init; } return true; } })); function redefine(node, scope) { var name = node.name; var old_def = node.thedef; if (!all(old_def.orig, function(sym) { return !(sym instanceof AST_SymbolConst || sym instanceof AST_SymbolLet); })) return; var new_def = scope.find_variable(name); if (new_def) { var redef = new_def.redefined(); if (redef) new_def = redef; } else { new_def = self.globals.get(name); } if (new_def) { new_def.orig.push(node); } else { new_def = scope.def_variable(node); } old_def.defun = new_def.scope; old_def.forEach(function(node) { node.redef = true; node.thedef = new_def; node.reference(options); }); if (old_def.lambda) new_def.lambda = true; if (new_def.undeclared) self.variables.set(name, new_def); } }); AST_Toplevel.DEFMETHOD("def_global", function(node) { var globals = this.globals, name = node.name; if (globals.has(name)) { return globals.get(name); } else { var g = this.make_def(node); g.undeclared = true; g.global = true; globals.set(name, g); return g; } }); function init_block_vars(scope, parent) { scope.enclosed = []; // variables from this or outer scope(s) that are referenced from this or inner scopes scope.parent_scope = parent; // the parent scope (null if this is the top level) scope.functions = new Dictionary(); // map name to AST_SymbolDefun (functions defined in this scope) scope.variables = new Dictionary(); // map name to AST_SymbolVar (variables defined in this scope; includes functions) if (parent) scope.make_def = parent.make_def; // top-level tracking of SymbolDef instances } function init_scope_vars(scope, parent) { init_block_vars(scope, parent); scope.uses_eval = false; // will be set to true if this or nested scope uses the global `eval` scope.uses_with = false; // will be set to true if this or some nested scope uses the `with` statement } AST_BlockScope.DEFMETHOD("init_vars", function(parent_scope) { init_block_vars(this, parent_scope); }); AST_Scope.DEFMETHOD("init_vars", function(parent_scope) { init_scope_vars(this, parent_scope); }); AST_Lambda.DEFMETHOD("init_vars", function(parent_scope) { init_scope_vars(this, parent_scope); this.uses_arguments = false; this.def_variable(new AST_SymbolFunarg({ name: "arguments", start: this.start, end: this.end, })); return this; }); AST_Symbol.DEFMETHOD("mark_enclosed", function(options) { var def = this.definition(); for (var s = this.scope; s; s = s.parent_scope) { push_uniq(s.enclosed, def); if (options.keep_fnames) { s.functions.each(function(d) { push_uniq(def.scope.enclosed, d); }); } if (s === def.scope) break; } }); AST_Symbol.DEFMETHOD("reference", function(options) { this.definition().references.push(this); this.mark_enclosed(options); }); AST_BlockScope.DEFMETHOD("find_variable", function(name) { if (name instanceof AST_Symbol) name = name.name; return this.variables.get(name) || (this.parent_scope && this.parent_scope.find_variable(name)); }); AST_BlockScope.DEFMETHOD("def_function", function(symbol, init) { var def = this.def_variable(symbol, init); if (!def.init || def.init instanceof AST_Defun) def.init = init; this.functions.set(symbol.name, def); return def; }); AST_BlockScope.DEFMETHOD("def_variable", function(symbol, init) { var def = this.variables.get(symbol.name); if (def) { def.orig.push(symbol); if (def.init instanceof AST_Function) def.init = init; } else { def = this.make_def(symbol, init); this.variables.set(symbol.name, def); def.global = !this.parent_scope; } return symbol.thedef = def; }); function names_in_use(scope, options) { var names = scope.names_in_use; if (!names) { scope.cname = -1; scope.cname_holes = []; scope.names_in_use = names = Object.create(null); var cache = options.cache && options.cache.props; scope.enclosed.forEach(function(def) { if (def.unmangleable(options)) names[def.name] = true; if (def.global && cache && cache.has(def.name)) { names[cache.get(def.name)] = true; } }); } return names; } function next_mangled_name(scope, options, def) { var in_use = names_in_use(scope, options); var holes = scope.cname_holes; var names = Object.create(null); var scopes = [ scope ]; def.forEach(function(sym) { var scope = sym.scope; do { if (scopes.indexOf(scope) < 0) { for (var name in names_in_use(scope, options)) { names[name] = true; } scopes.push(scope); } else break; } while (scope = scope.parent_scope); }); var name; for (var i = 0; i < holes.length; i++) { name = base54(holes[i]); if (names[name]) continue; holes.splice(i, 1); in_use[name] = true; return name; } while (true) { name = base54(++scope.cname); if (in_use[name] || RESERVED_WORDS[name] || options.reserved.has[name]) continue; if (!names[name]) break; holes.push(scope.cname); } in_use[name] = true; return name; } AST_Symbol.DEFMETHOD("unmangleable", function(options) { var def = this.definition(); return !def || def.unmangleable(options); }); // labels are always mangleable AST_Label.DEFMETHOD("unmangleable", return_false); AST_Symbol.DEFMETHOD("definition", function() { return this.thedef; }); function _default_mangler_options(options) { options = defaults(options, { eval : false, ie8 : false, keep_fnames : false, reserved : [], toplevel : false, }); if (!Array.isArray(options.reserved)) options.reserved = []; // Never mangle arguments push_uniq(options.reserved, "arguments"); options.reserved.has = makePredicate(options.reserved); return options; } AST_Toplevel.DEFMETHOD("mangle_names", function(options) { options = _default_mangler_options(options); // We only need to mangle declaration nodes. Special logic wired // into the code generator will display the mangled name if it's // present (and for AST_SymbolRef-s it'll use the mangled name of // the AST_SymbolDeclaration that it points to). var lname = -1; if (options.cache && options.cache.props) { var mangled_names = names_in_use(this, options); options.cache.props.each(function(mangled_name) { mangled_names[mangled_name] = true; }); } var redefined = []; var tw = new TreeWalker(function(node, descend) { if (node instanceof AST_LabeledStatement) { // lname is incremented when we get to the AST_Label var save_nesting = lname; descend(); lname = save_nesting; return true; } if (node instanceof AST_BlockScope) { var to_mangle = []; node.variables.each(function(def) { if (!defer_redef(def)) to_mangle.push(def); }); descend(); if (options.cache && node instanceof AST_Toplevel) { node.globals.each(mangle); } if (node instanceof AST_Defun && tw.has_directive("use asm")) { var sym = new AST_SymbolRef(node.name); sym.scope = node; sym.reference(options); } to_mangle.forEach(mangle); return true; } if (node instanceof AST_Label) { var name; do { name = base54(++lname); } while (RESERVED_WORDS[name]); node.mangled_name = name; return true; } }); this.walk(tw); redefined.forEach(mangle); function mangle(def) { if (options.reserved.has[def.name]) return; def.mangle(options); } function defer_redef(def, node) { var redef = def.redefined(); if (!redef) return false; redefined.push(def); def.references.forEach(reference); var node = def.orig[0]; if (node instanceof AST_SymbolCatch || node instanceof AST_SymbolConst) reference(node); return true; function reference(sym) { sym.thedef = redef; sym.reference(options); sym.thedef = def; } } }); AST_Toplevel.DEFMETHOD("find_colliding_names", function(options) { var cache = options.cache && options.cache.props; var avoid = Object.create(RESERVED_WORDS); options.reserved.forEach(to_avoid); this.globals.each(add_def); this.walk(new TreeWalker(function(node) { if (node instanceof AST_BlockScope) node.variables.each(add_def); })); return avoid; function to_avoid(name) { avoid[name] = true; } function add_def(def) { var name = def.name; if (def.global && cache && cache.has(name)) name = cache.get(name); else if (!def.unmangleable(options)) return; to_avoid(name); } }); AST_Toplevel.DEFMETHOD("expand_names", function(options) { base54.reset(); base54.sort(); options = _default_mangler_options(options); var avoid = this.find_colliding_names(options); var cname = 0; this.globals.each(rename); this.walk(new TreeWalker(function(node) { if (node instanceof AST_BlockScope) node.variables.each(rename); })); function next_name() { var name; do { name = base54(cname++); } while (avoid[name]); return name; } function rename(def) { if (def.global && options.cache) return; if (def.unmangleable(options)) return; if (options.reserved.has[def.name]) return; var redef = def.redefined(); var name = redef ? redef.rename || redef.name : next_name(); def.rename = name; def.forEach(function(sym) { if (sym.definition() === def) sym.name = name; }); } }); AST_Node.DEFMETHOD("tail_node", return_this); AST_Sequence.DEFMETHOD("tail_node", function() { return this.expressions[this.expressions.length - 1]; }); AST_Toplevel.DEFMETHOD("compute_char_frequency", function(options) { options = _default_mangler_options(options); base54.reset(); var fn = AST_Symbol.prototype.add_source_map; try { AST_Symbol.prototype.add_source_map = function() { if (!this.unmangleable(options)) base54.consider(this.name, -1); }; if (options.properties) { AST_Dot.prototype.add_source_map = function() { base54.consider(this.property, -1); }; AST_Sub.prototype.add_source_map = function() { skip_string(this.property); }; } base54.consider(this.print_to_string(), 1); } finally { AST_Symbol.prototype.add_source_map = fn; delete AST_Dot.prototype.add_source_map; delete AST_Sub.prototype.add_source_map; } base54.sort(); function skip_string(node) { if (node instanceof AST_String) { base54.consider(node.value, -1); } else if (node instanceof AST_Conditional) { skip_string(node.consequent); skip_string(node.alternative); } else if (node instanceof AST_Sequence) { skip_string(node.tail_node()); } } }); var base54 = (function() { var freq = Object.create(null); function init(chars) { var array = []; for (var i = 0; i < chars.length; i++) { var ch = chars[i]; array.push(ch); freq[ch] = -1e-2 * i; } return array; } var digits = init("0123456789"); var leading = init("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_"); var chars, frequency; function reset() { frequency = Object.create(freq); } base54.consider = function(str, delta) { for (var i = str.length; --i >= 0;) { frequency[str[i]] += delta; } }; function compare(a, b) { return frequency[b] - frequency[a]; } base54.sort = function() { chars = leading.sort(compare).concat(digits.sort(compare)); }; base54.reset = reset; reset(); function base54(num) { var ret = "", base = 54; num++; do { num--; ret += chars[num % base]; num = Math.floor(num / base); base = 64; } while (num > 0); return ret; } return base54; })();