You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1300 lines
42 KiB
1300 lines
42 KiB
/***********************************************************************
|
|
|
|
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
https://github.com/mishoo/UglifyJS2
|
|
|
|
-------------------------------- (C) ---------------------------------
|
|
|
|
Author: Mihai Bazon
|
|
<mihai.bazon@gmail.com>
|
|
http://mihai.bazon.net/blog
|
|
|
|
Distributed under the BSD license:
|
|
|
|
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
|
|
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 OutputStream(options) {
|
|
|
|
options = defaults(options, {
|
|
indent_start : 0,
|
|
indent_level : 4,
|
|
quote_keys : false,
|
|
space_colon : true,
|
|
ascii_only : false,
|
|
unescape_regexps : false,
|
|
inline_script : false,
|
|
width : 80,
|
|
max_line_len : 32000,
|
|
beautify : false,
|
|
source_map : null,
|
|
bracketize : false,
|
|
semicolons : true,
|
|
comments : false,
|
|
preserve_line : false,
|
|
screw_ie8 : false,
|
|
preamble : null,
|
|
}, true);
|
|
|
|
var indentation = 0;
|
|
var current_col = 0;
|
|
var current_line = 1;
|
|
var current_pos = 0;
|
|
var OUTPUT = "";
|
|
|
|
function to_ascii(str, identifier) {
|
|
return str.replace(/[\u0080-\uffff]/g, function(ch) {
|
|
var code = ch.charCodeAt(0).toString(16);
|
|
if (code.length <= 2 && !identifier) {
|
|
while (code.length < 2) code = "0" + code;
|
|
return "\\x" + code;
|
|
} else {
|
|
while (code.length < 4) code = "0" + code;
|
|
return "\\u" + code;
|
|
}
|
|
});
|
|
};
|
|
|
|
function make_string(str) {
|
|
var dq = 0, sq = 0;
|
|
str = str.replace(/[\\\b\f\n\r\t\x22\x27\u2028\u2029\0]/g, function(s){
|
|
switch (s) {
|
|
case "\\": return "\\\\";
|
|
case "\b": return "\\b";
|
|
case "\f": return "\\f";
|
|
case "\n": return "\\n";
|
|
case "\r": return "\\r";
|
|
case "\u2028": return "\\u2028";
|
|
case "\u2029": return "\\u2029";
|
|
case '"': ++dq; return '"';
|
|
case "'": ++sq; return "'";
|
|
case "\0": return "\\x00";
|
|
}
|
|
return s;
|
|
});
|
|
if (options.ascii_only) str = to_ascii(str);
|
|
if (dq > sq) return "'" + str.replace(/\x27/g, "\\'") + "'";
|
|
else return '"' + str.replace(/\x22/g, '\\"') + '"';
|
|
};
|
|
|
|
function encode_string(str) {
|
|
var ret = make_string(str);
|
|
if (options.inline_script)
|
|
ret = ret.replace(/<\x2fscript([>\/\t\n\f\r ])/gi, "<\\/script$1");
|
|
return ret;
|
|
};
|
|
|
|
function make_name(name) {
|
|
name = name.toString();
|
|
if (options.ascii_only)
|
|
name = to_ascii(name, true);
|
|
return name;
|
|
};
|
|
|
|
function make_indent(back) {
|
|
return repeat_string(" ", options.indent_start + indentation - back * options.indent_level);
|
|
};
|
|
|
|
/* -----[ beautification/minification ]----- */
|
|
|
|
var might_need_space = false;
|
|
var might_need_semicolon = false;
|
|
var last = null;
|
|
|
|
function last_char() {
|
|
return last.charAt(last.length - 1);
|
|
};
|
|
|
|
function maybe_newline() {
|
|
if (options.max_line_len && current_col > options.max_line_len)
|
|
print("\n");
|
|
};
|
|
|
|
var requireSemicolonChars = makePredicate("( [ + * / - , .");
|
|
|
|
function print(str) {
|
|
str = String(str);
|
|
var ch = str.charAt(0);
|
|
if (might_need_semicolon) {
|
|
if ((!ch || ";}".indexOf(ch) < 0) && !/[;]$/.test(last)) {
|
|
if (options.semicolons || requireSemicolonChars(ch)) {
|
|
OUTPUT += ";";
|
|
current_col++;
|
|
current_pos++;
|
|
} else {
|
|
OUTPUT += "\n";
|
|
current_pos++;
|
|
current_line++;
|
|
current_col = 0;
|
|
}
|
|
if (!options.beautify)
|
|
might_need_space = false;
|
|
}
|
|
might_need_semicolon = false;
|
|
maybe_newline();
|
|
}
|
|
|
|
if (!options.beautify && options.preserve_line && stack[stack.length - 1]) {
|
|
var target_line = stack[stack.length - 1].start.line;
|
|
while (current_line < target_line) {
|
|
OUTPUT += "\n";
|
|
current_pos++;
|
|
current_line++;
|
|
current_col = 0;
|
|
might_need_space = false;
|
|
}
|
|
}
|
|
|
|
if (might_need_space) {
|
|
var prev = last_char();
|
|
if ((is_identifier_char(prev)
|
|
&& (is_identifier_char(ch) || ch == "\\"))
|
|
|| (/^[\+\-\/]$/.test(ch) && ch == prev))
|
|
{
|
|
OUTPUT += " ";
|
|
current_col++;
|
|
current_pos++;
|
|
}
|
|
might_need_space = false;
|
|
}
|
|
var a = str.split(/\r?\n/), n = a.length - 1;
|
|
current_line += n;
|
|
if (n == 0) {
|
|
current_col += a[n].length;
|
|
} else {
|
|
current_col = a[n].length;
|
|
}
|
|
current_pos += str.length;
|
|
last = str;
|
|
OUTPUT += str;
|
|
};
|
|
|
|
var space = options.beautify ? function() {
|
|
print(" ");
|
|
} : function() {
|
|
might_need_space = true;
|
|
};
|
|
|
|
var indent = options.beautify ? function(half) {
|
|
if (options.beautify) {
|
|
print(make_indent(half ? 0.5 : 0));
|
|
}
|
|
} : noop;
|
|
|
|
var with_indent = options.beautify ? function(col, cont) {
|
|
if (col === true) col = next_indent();
|
|
var save_indentation = indentation;
|
|
indentation = col;
|
|
var ret = cont();
|
|
indentation = save_indentation;
|
|
return ret;
|
|
} : function(col, cont) { return cont() };
|
|
|
|
var newline = options.beautify ? function() {
|
|
print("\n");
|
|
} : noop;
|
|
|
|
var semicolon = options.beautify ? function() {
|
|
print(";");
|
|
} : function() {
|
|
might_need_semicolon = true;
|
|
};
|
|
|
|
function force_semicolon() {
|
|
might_need_semicolon = false;
|
|
print(";");
|
|
};
|
|
|
|
function next_indent() {
|
|
return indentation + options.indent_level;
|
|
};
|
|
|
|
function with_block(cont) {
|
|
var ret;
|
|
print("{");
|
|
newline();
|
|
with_indent(next_indent(), function(){
|
|
ret = cont();
|
|
});
|
|
indent();
|
|
print("}");
|
|
return ret;
|
|
};
|
|
|
|
function with_parens(cont) {
|
|
print("(");
|
|
//XXX: still nice to have that for argument lists
|
|
//var ret = with_indent(current_col, cont);
|
|
var ret = cont();
|
|
print(")");
|
|
return ret;
|
|
};
|
|
|
|
function with_square(cont) {
|
|
print("[");
|
|
//var ret = with_indent(current_col, cont);
|
|
var ret = cont();
|
|
print("]");
|
|
return ret;
|
|
};
|
|
|
|
function comma() {
|
|
print(",");
|
|
space();
|
|
};
|
|
|
|
function colon() {
|
|
print(":");
|
|
if (options.space_colon) space();
|
|
};
|
|
|
|
var add_mapping = options.source_map ? function(token, name) {
|
|
try {
|
|
if (token) options.source_map.add(
|
|
token.file || "?",
|
|
current_line, current_col,
|
|
token.line, token.col,
|
|
(!name && token.type == "name") ? token.value : name
|
|
);
|
|
} catch(ex) {
|
|
AST_Node.warn("Couldn't figure out mapping for {file}:{line},{col} → {cline},{ccol} [{name}]", {
|
|
file: token.file,
|
|
line: token.line,
|
|
col: token.col,
|
|
cline: current_line,
|
|
ccol: current_col,
|
|
name: name || ""
|
|
})
|
|
}
|
|
} : noop;
|
|
|
|
function get() {
|
|
return OUTPUT;
|
|
};
|
|
|
|
if (options.preamble) {
|
|
print(options.preamble.replace(/\r\n?|[\n\u2028\u2029]|\s*$/g, "\n"));
|
|
}
|
|
|
|
var stack = [];
|
|
return {
|
|
get : get,
|
|
toString : get,
|
|
indent : indent,
|
|
indentation : function() { return indentation },
|
|
current_width : function() { return current_col - indentation },
|
|
should_break : function() { return options.width && this.current_width() >= options.width },
|
|
newline : newline,
|
|
print : print,
|
|
space : space,
|
|
comma : comma,
|
|
colon : colon,
|
|
last : function() { return last },
|
|
semicolon : semicolon,
|
|
force_semicolon : force_semicolon,
|
|
to_ascii : to_ascii,
|
|
print_name : function(name) { print(make_name(name)) },
|
|
print_string : function(str) { print(encode_string(str)) },
|
|
next_indent : next_indent,
|
|
with_indent : with_indent,
|
|
with_block : with_block,
|
|
with_parens : with_parens,
|
|
with_square : with_square,
|
|
add_mapping : add_mapping,
|
|
option : function(opt) { return options[opt] },
|
|
line : function() { return current_line },
|
|
col : function() { return current_col },
|
|
pos : function() { return current_pos },
|
|
push_node : function(node) { stack.push(node) },
|
|
pop_node : function() { return stack.pop() },
|
|
stack : function() { return stack },
|
|
parent : function(n) {
|
|
return stack[stack.length - 2 - (n || 0)];
|
|
}
|
|
};
|
|
|
|
};
|
|
|
|
/* -----[ code generators ]----- */
|
|
|
|
(function(){
|
|
|
|
/* -----[ utils ]----- */
|
|
|
|
function DEFPRINT(nodetype, generator) {
|
|
nodetype.DEFMETHOD("_codegen", generator);
|
|
};
|
|
|
|
AST_Node.DEFMETHOD("print", function(stream, force_parens){
|
|
var self = this, generator = self._codegen;
|
|
function doit() {
|
|
self.add_comments(stream);
|
|
self.add_source_map(stream);
|
|
generator(self, stream);
|
|
}
|
|
stream.push_node(self);
|
|
if (force_parens || self.needs_parens(stream)) {
|
|
stream.with_parens(doit);
|
|
} else {
|
|
doit();
|
|
}
|
|
stream.pop_node();
|
|
});
|
|
|
|
AST_Node.DEFMETHOD("print_to_string", function(options){
|
|
var s = OutputStream(options);
|
|
this.print(s);
|
|
return s.get();
|
|
});
|
|
|
|
/* -----[ comments ]----- */
|
|
|
|
AST_Node.DEFMETHOD("add_comments", function(output){
|
|
var c = output.option("comments"), self = this;
|
|
if (c) {
|
|
var start = self.start;
|
|
if (start && !start._comments_dumped) {
|
|
start._comments_dumped = true;
|
|
var comments = start.comments_before || [];
|
|
|
|
// XXX: ugly fix for https://github.com/mishoo/UglifyJS2/issues/112
|
|
// and https://github.com/mishoo/UglifyJS2/issues/372
|
|
if (self instanceof AST_Exit && self.value) {
|
|
self.value.walk(new TreeWalker(function(node){
|
|
if (node.start && node.start.comments_before) {
|
|
comments = comments.concat(node.start.comments_before);
|
|
node.start.comments_before = [];
|
|
}
|
|
if (node instanceof AST_Function ||
|
|
node instanceof AST_Array ||
|
|
node instanceof AST_Object)
|
|
{
|
|
return true; // don't go inside.
|
|
}
|
|
}));
|
|
}
|
|
|
|
if (c.test) {
|
|
comments = comments.filter(function(comment){
|
|
return c.test(comment.value);
|
|
});
|
|
} else if (typeof c == "function") {
|
|
comments = comments.filter(function(comment){
|
|
return c(self, comment);
|
|
});
|
|
}
|
|
comments.forEach(function(c){
|
|
if (/comment[134]/.test(c.type)) {
|
|
output.print("//" + c.value + "\n");
|
|
output.indent();
|
|
}
|
|
else if (c.type == "comment2") {
|
|
output.print("/*" + c.value + "*/");
|
|
if (start.nlb) {
|
|
output.print("\n");
|
|
output.indent();
|
|
} else {
|
|
output.space();
|
|
}
|
|
}
|
|
});
|
|
}
|
|
}
|
|
});
|
|
|
|
/* -----[ PARENTHESES ]----- */
|
|
|
|
function PARENS(nodetype, func) {
|
|
nodetype.DEFMETHOD("needs_parens", func);
|
|
};
|
|
|
|
PARENS(AST_Node, function(){
|
|
return false;
|
|
});
|
|
|
|
// a function expression needs parens around it when it's provably
|
|
// the first token to appear in a statement.
|
|
PARENS(AST_Function, function(output){
|
|
return first_in_statement(output);
|
|
});
|
|
|
|
// same goes for an object literal, because otherwise it would be
|
|
// interpreted as a block of code.
|
|
PARENS(AST_Object, function(output){
|
|
return first_in_statement(output);
|
|
});
|
|
|
|
PARENS(AST_Unary, function(output){
|
|
var p = output.parent();
|
|
return p instanceof AST_PropAccess && p.expression === this;
|
|
});
|
|
|
|
PARENS(AST_Seq, function(output){
|
|
var p = output.parent();
|
|
return p instanceof AST_Call // (foo, bar)() or foo(1, (2, 3), 4)
|
|
|| p instanceof AST_Unary // !(foo, bar, baz)
|
|
|| p instanceof AST_Binary // 1 + (2, 3) + 4 ==> 8
|
|
|| p instanceof AST_VarDef // var a = (1, 2), b = a + a; ==> b == 4
|
|
|| p instanceof AST_PropAccess // (1, {foo:2}).foo or (1, {foo:2})["foo"] ==> 2
|
|
|| p instanceof AST_Array // [ 1, (2, 3), 4 ] ==> [ 1, 3, 4 ]
|
|
|| p instanceof AST_ObjectProperty // { foo: (1, 2) }.foo ==> 2
|
|
|| p instanceof AST_Conditional /* (false, true) ? (a = 10, b = 20) : (c = 30)
|
|
* ==> 20 (side effect, set a := 10 and b := 20) */
|
|
;
|
|
});
|
|
|
|
PARENS(AST_Binary, function(output){
|
|
var p = output.parent();
|
|
// (foo && bar)()
|
|
if (p instanceof AST_Call && p.expression === this)
|
|
return true;
|
|
// typeof (foo && bar)
|
|
if (p instanceof AST_Unary)
|
|
return true;
|
|
// (foo && bar)["prop"], (foo && bar).prop
|
|
if (p instanceof AST_PropAccess && p.expression === this)
|
|
return true;
|
|
// this deals with precedence: 3 * (2 + 1)
|
|
if (p instanceof AST_Binary) {
|
|
var po = p.operator, pp = PRECEDENCE[po];
|
|
var so = this.operator, sp = PRECEDENCE[so];
|
|
if (pp > sp
|
|
|| (pp == sp
|
|
&& this === p.right)) {
|
|
return true;
|
|
}
|
|
}
|
|
});
|
|
|
|
PARENS(AST_PropAccess, function(output){
|
|
var p = output.parent();
|
|
if (p instanceof AST_New && p.expression === this) {
|
|
// i.e. new (foo.bar().baz)
|
|
//
|
|
// if there's one call into this subtree, then we need
|
|
// parens around it too, otherwise the call will be
|
|
// interpreted as passing the arguments to the upper New
|
|
// expression.
|
|
try {
|
|
this.walk(new TreeWalker(function(node){
|
|
if (node instanceof AST_Call) throw p;
|
|
}));
|
|
} catch(ex) {
|
|
if (ex !== p) throw ex;
|
|
return true;
|
|
}
|
|
}
|
|
});
|
|
|
|
PARENS(AST_Call, function(output){
|
|
var p = output.parent(), p1;
|
|
if (p instanceof AST_New && p.expression === this)
|
|
return true;
|
|
|
|
// workaround for Safari bug.
|
|
// https://bugs.webkit.org/show_bug.cgi?id=123506
|
|
return this.expression instanceof AST_Function
|
|
&& p instanceof AST_PropAccess
|
|
&& p.expression === this
|
|
&& (p1 = output.parent(1)) instanceof AST_Assign
|
|
&& p1.left === p;
|
|
});
|
|
|
|
PARENS(AST_New, function(output){
|
|
var p = output.parent();
|
|
if (no_constructor_parens(this, output)
|
|
&& (p instanceof AST_PropAccess // (new Date).getTime(), (new Date)["getTime"]()
|
|
|| p instanceof AST_Call && p.expression === this)) // (new foo)(bar)
|
|
return true;
|
|
});
|
|
|
|
PARENS(AST_Number, function(output){
|
|
var p = output.parent();
|
|
if (this.getValue() < 0 && p instanceof AST_PropAccess && p.expression === this)
|
|
return true;
|
|
});
|
|
|
|
PARENS(AST_NaN, function(output){
|
|
var p = output.parent();
|
|
if (p instanceof AST_PropAccess && p.expression === this)
|
|
return true;
|
|
});
|
|
|
|
function assign_and_conditional_paren_rules(output) {
|
|
var p = output.parent();
|
|
// !(a = false) → true
|
|
if (p instanceof AST_Unary)
|
|
return true;
|
|
// 1 + (a = 2) + 3 → 6, side effect setting a = 2
|
|
if (p instanceof AST_Binary && !(p instanceof AST_Assign))
|
|
return true;
|
|
// (a = func)() —or— new (a = Object)()
|
|
if (p instanceof AST_Call && p.expression === this)
|
|
return true;
|
|
// (a = foo) ? bar : baz
|
|
if (p instanceof AST_Conditional && p.condition === this)
|
|
return true;
|
|
// (a = foo)["prop"] —or— (a = foo).prop
|
|
if (p instanceof AST_PropAccess && p.expression === this)
|
|
return true;
|
|
};
|
|
|
|
PARENS(AST_Assign, assign_and_conditional_paren_rules);
|
|
PARENS(AST_Conditional, assign_and_conditional_paren_rules);
|
|
|
|
/* -----[ PRINTERS ]----- */
|
|
|
|
DEFPRINT(AST_Directive, function(self, output){
|
|
output.print_string(self.value);
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_Debugger, function(self, output){
|
|
output.print("debugger");
|
|
output.semicolon();
|
|
});
|
|
|
|
/* -----[ statements ]----- */
|
|
|
|
function display_body(body, is_toplevel, output) {
|
|
var last = body.length - 1;
|
|
body.forEach(function(stmt, i){
|
|
if (!(stmt instanceof AST_EmptyStatement)) {
|
|
output.indent();
|
|
stmt.print(output);
|
|
if (!(i == last && is_toplevel)) {
|
|
output.newline();
|
|
if (is_toplevel) output.newline();
|
|
}
|
|
}
|
|
});
|
|
};
|
|
|
|
AST_StatementWithBody.DEFMETHOD("_do_print_body", function(output){
|
|
force_statement(this.body, output);
|
|
});
|
|
|
|
DEFPRINT(AST_Statement, function(self, output){
|
|
self.body.print(output);
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_Toplevel, function(self, output){
|
|
display_body(self.body, true, output);
|
|
output.print("");
|
|
});
|
|
DEFPRINT(AST_LabeledStatement, function(self, output){
|
|
self.label.print(output);
|
|
output.colon();
|
|
self.body.print(output);
|
|
});
|
|
DEFPRINT(AST_SimpleStatement, function(self, output){
|
|
self.body.print(output);
|
|
output.semicolon();
|
|
});
|
|
function print_bracketed(body, output) {
|
|
if (body.length > 0) output.with_block(function(){
|
|
display_body(body, false, output);
|
|
});
|
|
else output.print("{}");
|
|
};
|
|
DEFPRINT(AST_BlockStatement, function(self, output){
|
|
print_bracketed(self.body, output);
|
|
});
|
|
DEFPRINT(AST_EmptyStatement, function(self, output){
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_Do, function(self, output){
|
|
output.print("do");
|
|
output.space();
|
|
self._do_print_body(output);
|
|
output.space();
|
|
output.print("while");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.condition.print(output);
|
|
});
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_While, function(self, output){
|
|
output.print("while");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.condition.print(output);
|
|
});
|
|
output.space();
|
|
self._do_print_body(output);
|
|
});
|
|
DEFPRINT(AST_For, function(self, output){
|
|
output.print("for");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
if (self.init) {
|
|
if (self.init instanceof AST_Definitions) {
|
|
self.init.print(output);
|
|
} else {
|
|
parenthesize_for_noin(self.init, output, true);
|
|
}
|
|
output.print(";");
|
|
output.space();
|
|
} else {
|
|
output.print(";");
|
|
}
|
|
if (self.condition) {
|
|
self.condition.print(output);
|
|
output.print(";");
|
|
output.space();
|
|
} else {
|
|
output.print(";");
|
|
}
|
|
if (self.step) {
|
|
self.step.print(output);
|
|
}
|
|
});
|
|
output.space();
|
|
self._do_print_body(output);
|
|
});
|
|
DEFPRINT(AST_ForIn, function(self, output){
|
|
output.print("for");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.init.print(output);
|
|
output.space();
|
|
output.print("in");
|
|
output.space();
|
|
self.object.print(output);
|
|
});
|
|
output.space();
|
|
self._do_print_body(output);
|
|
});
|
|
DEFPRINT(AST_With, function(self, output){
|
|
output.print("with");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.expression.print(output);
|
|
});
|
|
output.space();
|
|
self._do_print_body(output);
|
|
});
|
|
|
|
/* -----[ functions ]----- */
|
|
AST_Lambda.DEFMETHOD("_do_print", function(output, nokeyword){
|
|
var self = this;
|
|
if (!nokeyword) {
|
|
output.print("function");
|
|
}
|
|
if (self.name) {
|
|
output.space();
|
|
self.name.print(output);
|
|
}
|
|
output.with_parens(function(){
|
|
self.argnames.forEach(function(arg, i){
|
|
if (i) output.comma();
|
|
arg.print(output);
|
|
});
|
|
});
|
|
output.space();
|
|
print_bracketed(self.body, output);
|
|
});
|
|
DEFPRINT(AST_Lambda, function(self, output){
|
|
self._do_print(output);
|
|
});
|
|
|
|
/* -----[ exits ]----- */
|
|
AST_Exit.DEFMETHOD("_do_print", function(output, kind){
|
|
output.print(kind);
|
|
if (this.value) {
|
|
output.space();
|
|
this.value.print(output);
|
|
}
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_Return, function(self, output){
|
|
self._do_print(output, "return");
|
|
});
|
|
DEFPRINT(AST_Throw, function(self, output){
|
|
self._do_print(output, "throw");
|
|
});
|
|
|
|
/* -----[ loop control ]----- */
|
|
AST_LoopControl.DEFMETHOD("_do_print", function(output, kind){
|
|
output.print(kind);
|
|
if (this.label) {
|
|
output.space();
|
|
this.label.print(output);
|
|
}
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_Break, function(self, output){
|
|
self._do_print(output, "break");
|
|
});
|
|
DEFPRINT(AST_Continue, function(self, output){
|
|
self._do_print(output, "continue");
|
|
});
|
|
|
|
/* -----[ if ]----- */
|
|
function make_then(self, output) {
|
|
if (output.option("bracketize")) {
|
|
make_block(self.body, output);
|
|
return;
|
|
}
|
|
// The squeezer replaces "block"-s that contain only a single
|
|
// statement with the statement itself; technically, the AST
|
|
// is correct, but this can create problems when we output an
|
|
// IF having an ELSE clause where the THEN clause ends in an
|
|
// IF *without* an ELSE block (then the outer ELSE would refer
|
|
// to the inner IF). This function checks for this case and
|
|
// adds the block brackets if needed.
|
|
if (!self.body)
|
|
return output.force_semicolon();
|
|
if (self.body instanceof AST_Do
|
|
&& !output.option("screw_ie8")) {
|
|
// https://github.com/mishoo/UglifyJS/issues/#issue/57 IE
|
|
// croaks with "syntax error" on code like this: if (foo)
|
|
// do ... while(cond); else ... we need block brackets
|
|
// around do/while
|
|
make_block(self.body, output);
|
|
return;
|
|
}
|
|
var b = self.body;
|
|
while (true) {
|
|
if (b instanceof AST_If) {
|
|
if (!b.alternative) {
|
|
make_block(self.body, output);
|
|
return;
|
|
}
|
|
b = b.alternative;
|
|
}
|
|
else if (b instanceof AST_StatementWithBody) {
|
|
b = b.body;
|
|
}
|
|
else break;
|
|
}
|
|
force_statement(self.body, output);
|
|
};
|
|
DEFPRINT(AST_If, function(self, output){
|
|
output.print("if");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.condition.print(output);
|
|
});
|
|
output.space();
|
|
if (self.alternative) {
|
|
make_then(self, output);
|
|
output.space();
|
|
output.print("else");
|
|
output.space();
|
|
force_statement(self.alternative, output);
|
|
} else {
|
|
self._do_print_body(output);
|
|
}
|
|
});
|
|
|
|
/* -----[ switch ]----- */
|
|
DEFPRINT(AST_Switch, function(self, output){
|
|
output.print("switch");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.expression.print(output);
|
|
});
|
|
output.space();
|
|
if (self.body.length > 0) output.with_block(function(){
|
|
self.body.forEach(function(stmt, i){
|
|
if (i) output.newline();
|
|
output.indent(true);
|
|
stmt.print(output);
|
|
});
|
|
});
|
|
else output.print("{}");
|
|
});
|
|
AST_SwitchBranch.DEFMETHOD("_do_print_body", function(output){
|
|
if (this.body.length > 0) {
|
|
output.newline();
|
|
this.body.forEach(function(stmt){
|
|
output.indent();
|
|
stmt.print(output);
|
|
output.newline();
|
|
});
|
|
}
|
|
});
|
|
DEFPRINT(AST_Default, function(self, output){
|
|
output.print("default:");
|
|
self._do_print_body(output);
|
|
});
|
|
DEFPRINT(AST_Case, function(self, output){
|
|
output.print("case");
|
|
output.space();
|
|
self.expression.print(output);
|
|
output.print(":");
|
|
self._do_print_body(output);
|
|
});
|
|
|
|
/* -----[ exceptions ]----- */
|
|
DEFPRINT(AST_Try, function(self, output){
|
|
output.print("try");
|
|
output.space();
|
|
print_bracketed(self.body, output);
|
|
if (self.bcatch) {
|
|
output.space();
|
|
self.bcatch.print(output);
|
|
}
|
|
if (self.bfinally) {
|
|
output.space();
|
|
self.bfinally.print(output);
|
|
}
|
|
});
|
|
DEFPRINT(AST_Catch, function(self, output){
|
|
output.print("catch");
|
|
output.space();
|
|
output.with_parens(function(){
|
|
self.argname.print(output);
|
|
});
|
|
output.space();
|
|
print_bracketed(self.body, output);
|
|
});
|
|
DEFPRINT(AST_Finally, function(self, output){
|
|
output.print("finally");
|
|
output.space();
|
|
print_bracketed(self.body, output);
|
|
});
|
|
|
|
/* -----[ var/const ]----- */
|
|
AST_Definitions.DEFMETHOD("_do_print", function(output, kind){
|
|
output.print(kind);
|
|
output.space();
|
|
this.definitions.forEach(function(def, i){
|
|
if (i) output.comma();
|
|
def.print(output);
|
|
});
|
|
var p = output.parent();
|
|
var in_for = p instanceof AST_For || p instanceof AST_ForIn;
|
|
var avoid_semicolon = in_for && p.init === this;
|
|
if (!avoid_semicolon)
|
|
output.semicolon();
|
|
});
|
|
DEFPRINT(AST_Var, function(self, output){
|
|
self._do_print(output, "var");
|
|
});
|
|
DEFPRINT(AST_Const, function(self, output){
|
|
self._do_print(output, "const");
|
|
});
|
|
|
|
function parenthesize_for_noin(node, output, noin) {
|
|
if (!noin) node.print(output);
|
|
else try {
|
|
// need to take some precautions here:
|
|
// https://github.com/mishoo/UglifyJS2/issues/60
|
|
node.walk(new TreeWalker(function(node){
|
|
if (node instanceof AST_Binary && node.operator == "in")
|
|
throw output;
|
|
}));
|
|
node.print(output);
|
|
} catch(ex) {
|
|
if (ex !== output) throw ex;
|
|
node.print(output, true);
|
|
}
|
|
};
|
|
|
|
DEFPRINT(AST_VarDef, function(self, output){
|
|
self.name.print(output);
|
|
if (self.value) {
|
|
output.space();
|
|
output.print("=");
|
|
output.space();
|
|
var p = output.parent(1);
|
|
var noin = p instanceof AST_For || p instanceof AST_ForIn;
|
|
parenthesize_for_noin(self.value, output, noin);
|
|
}
|
|
});
|
|
|
|
/* -----[ other expressions ]----- */
|
|
DEFPRINT(AST_Call, function(self, output){
|
|
self.expression.print(output);
|
|
if (self instanceof AST_New && no_constructor_parens(self, output))
|
|
return;
|
|
output.with_parens(function(){
|
|
self.args.forEach(function(expr, i){
|
|
if (i) output.comma();
|
|
expr.print(output);
|
|
});
|
|
});
|
|
});
|
|
DEFPRINT(AST_New, function(self, output){
|
|
output.print("new");
|
|
output.space();
|
|
AST_Call.prototype._codegen(self, output);
|
|
});
|
|
|
|
AST_Seq.DEFMETHOD("_do_print", function(output){
|
|
this.car.print(output);
|
|
if (this.cdr) {
|
|
output.comma();
|
|
if (output.should_break()) {
|
|
output.newline();
|
|
output.indent();
|
|
}
|
|
this.cdr.print(output);
|
|
}
|
|
});
|
|
DEFPRINT(AST_Seq, function(self, output){
|
|
self._do_print(output);
|
|
// var p = output.parent();
|
|
// if (p instanceof AST_Statement) {
|
|
// output.with_indent(output.next_indent(), function(){
|
|
// self._do_print(output);
|
|
// });
|
|
// } else {
|
|
// self._do_print(output);
|
|
// }
|
|
});
|
|
DEFPRINT(AST_Dot, function(self, output){
|
|
var expr = self.expression;
|
|
expr.print(output);
|
|
if (expr instanceof AST_Number && expr.getValue() >= 0) {
|
|
if (!/[xa-f.]/i.test(output.last())) {
|
|
output.print(".");
|
|
}
|
|
}
|
|
output.print(".");
|
|
// the name after dot would be mapped about here.
|
|
output.add_mapping(self.end);
|
|
output.print_name(self.property);
|
|
});
|
|
DEFPRINT(AST_Sub, function(self, output){
|
|
self.expression.print(output);
|
|
output.print("[");
|
|
self.property.print(output);
|
|
output.print("]");
|
|
});
|
|
DEFPRINT(AST_UnaryPrefix, function(self, output){
|
|
var op = self.operator;
|
|
output.print(op);
|
|
if (/^[a-z]/i.test(op))
|
|
output.space();
|
|
self.expression.print(output);
|
|
});
|
|
DEFPRINT(AST_UnaryPostfix, function(self, output){
|
|
self.expression.print(output);
|
|
output.print(self.operator);
|
|
});
|
|
DEFPRINT(AST_Binary, function(self, output){
|
|
self.left.print(output);
|
|
output.space();
|
|
output.print(self.operator);
|
|
if (self.operator == "<"
|
|
&& self.right instanceof AST_UnaryPrefix
|
|
&& self.right.operator == "!"
|
|
&& self.right.expression instanceof AST_UnaryPrefix
|
|
&& self.right.expression.operator == "--") {
|
|
// space is mandatory to avoid outputting <!--
|
|
// http://javascript.spec.whatwg.org/#comment-syntax
|
|
output.print(" ");
|
|
} else {
|
|
// the space is optional depending on "beautify"
|
|
output.space();
|
|
}
|
|
self.right.print(output);
|
|
});
|
|
DEFPRINT(AST_Conditional, function(self, output){
|
|
self.condition.print(output);
|
|
output.space();
|
|
output.print("?");
|
|
output.space();
|
|
self.consequent.print(output);
|
|
output.space();
|
|
output.colon();
|
|
self.alternative.print(output);
|
|
});
|
|
|
|
/* -----[ literals ]----- */
|
|
DEFPRINT(AST_Array, function(self, output){
|
|
output.with_square(function(){
|
|
var a = self.elements, len = a.length;
|
|
if (len > 0) output.space();
|
|
a.forEach(function(exp, i){
|
|
if (i) output.comma();
|
|
exp.print(output);
|
|
// If the final element is a hole, we need to make sure it
|
|
// doesn't look like a trailing comma, by inserting an actual
|
|
// trailing comma.
|
|
if (i === len - 1 && exp instanceof AST_Hole)
|
|
output.comma();
|
|
});
|
|
if (len > 0) output.space();
|
|
});
|
|
});
|
|
DEFPRINT(AST_Object, function(self, output){
|
|
if (self.properties.length > 0) output.with_block(function(){
|
|
self.properties.forEach(function(prop, i){
|
|
if (i) {
|
|
output.print(",");
|
|
output.newline();
|
|
}
|
|
output.indent();
|
|
prop.print(output);
|
|
});
|
|
output.newline();
|
|
});
|
|
else output.print("{}");
|
|
});
|
|
DEFPRINT(AST_ObjectKeyVal, function(self, output){
|
|
var key = self.key;
|
|
if (output.option("quote_keys")) {
|
|
output.print_string(key + "");
|
|
} else if ((typeof key == "number"
|
|
|| !output.option("beautify")
|
|
&& +key + "" == key)
|
|
&& parseFloat(key) >= 0) {
|
|
output.print(make_num(key));
|
|
} else if (RESERVED_WORDS(key) ? output.option("screw_ie8") : is_identifier_string(key)) {
|
|
output.print_name(key);
|
|
} else {
|
|
output.print_string(key);
|
|
}
|
|
output.colon();
|
|
self.value.print(output);
|
|
});
|
|
DEFPRINT(AST_ObjectSetter, function(self, output){
|
|
output.print("set");
|
|
output.space();
|
|
self.key.print(output);
|
|
self.value._do_print(output, true);
|
|
});
|
|
DEFPRINT(AST_ObjectGetter, function(self, output){
|
|
output.print("get");
|
|
output.space();
|
|
self.key.print(output);
|
|
self.value._do_print(output, true);
|
|
});
|
|
DEFPRINT(AST_Symbol, function(self, output){
|
|
var def = self.definition();
|
|
output.print_name(def ? def.mangled_name || def.name : self.name);
|
|
});
|
|
DEFPRINT(AST_Undefined, function(self, output){
|
|
output.print("void 0");
|
|
});
|
|
DEFPRINT(AST_Hole, noop);
|
|
DEFPRINT(AST_Infinity, function(self, output){
|
|
output.print("1/0");
|
|
});
|
|
DEFPRINT(AST_NaN, function(self, output){
|
|
output.print("0/0");
|
|
});
|
|
DEFPRINT(AST_This, function(self, output){
|
|
output.print("this");
|
|
});
|
|
DEFPRINT(AST_Constant, function(self, output){
|
|
output.print(self.getValue());
|
|
});
|
|
DEFPRINT(AST_String, function(self, output){
|
|
output.print_string(self.getValue());
|
|
});
|
|
DEFPRINT(AST_Number, function(self, output){
|
|
output.print(make_num(self.getValue()));
|
|
});
|
|
|
|
function regexp_safe_literal(code) {
|
|
return [
|
|
0x5c , // \
|
|
0x2f , // /
|
|
0x2e , // .
|
|
0x2b , // +
|
|
0x2a , // *
|
|
0x3f , // ?
|
|
0x28 , // (
|
|
0x29 , // )
|
|
0x5b , // [
|
|
0x5d , // ]
|
|
0x7b , // {
|
|
0x7d , // }
|
|
0x24 , // $
|
|
0x5e , // ^
|
|
0x3a , // :
|
|
0x7c , // |
|
|
0x21 , // !
|
|
0x0a , // \n
|
|
0x0d , // \r
|
|
0x00 , // \0
|
|
0xfeff , // Unicode BOM
|
|
0x2028 , // unicode "line separator"
|
|
0x2029 , // unicode "paragraph separator"
|
|
].indexOf(code) < 0;
|
|
};
|
|
|
|
DEFPRINT(AST_RegExp, function(self, output){
|
|
var str = self.getValue().toString();
|
|
if (output.option("ascii_only")) {
|
|
str = output.to_ascii(str);
|
|
} else if (output.option("unescape_regexps")) {
|
|
str = str.split("\\\\").map(function(str){
|
|
return str.replace(/\\u[0-9a-fA-F]{4}|\\x[0-9a-fA-F]{2}/g, function(s){
|
|
var code = parseInt(s.substr(2), 16);
|
|
return regexp_safe_literal(code) ? String.fromCharCode(code) : s;
|
|
});
|
|
}).join("\\\\");
|
|
}
|
|
output.print(str);
|
|
var p = output.parent();
|
|
if (p instanceof AST_Binary && /^in/.test(p.operator) && p.left === self)
|
|
output.print(" ");
|
|
});
|
|
|
|
function force_statement(stat, output) {
|
|
if (output.option("bracketize")) {
|
|
if (!stat || stat instanceof AST_EmptyStatement)
|
|
output.print("{}");
|
|
else if (stat instanceof AST_BlockStatement)
|
|
stat.print(output);
|
|
else output.with_block(function(){
|
|
output.indent();
|
|
stat.print(output);
|
|
output.newline();
|
|
});
|
|
} else {
|
|
if (!stat || stat instanceof AST_EmptyStatement)
|
|
output.force_semicolon();
|
|
else
|
|
stat.print(output);
|
|
}
|
|
};
|
|
|
|
// return true if the node at the top of the stack (that means the
|
|
// innermost node in the current output) is lexically the first in
|
|
// a statement.
|
|
function first_in_statement(output) {
|
|
var a = output.stack(), i = a.length, node = a[--i], p = a[--i];
|
|
while (i > 0) {
|
|
if (p instanceof AST_Statement && p.body === node)
|
|
return true;
|
|
if ((p instanceof AST_Seq && p.car === node ) ||
|
|
(p instanceof AST_Call && p.expression === node && !(p instanceof AST_New) ) ||
|
|
(p instanceof AST_Dot && p.expression === node ) ||
|
|
(p instanceof AST_Sub && p.expression === node ) ||
|
|
(p instanceof AST_Conditional && p.condition === node ) ||
|
|
(p instanceof AST_Binary && p.left === node ) ||
|
|
(p instanceof AST_UnaryPostfix && p.expression === node ))
|
|
{
|
|
node = p;
|
|
p = a[--i];
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
};
|
|
|
|
// self should be AST_New. decide if we want to show parens or not.
|
|
function no_constructor_parens(self, output) {
|
|
return self.args.length == 0 && !output.option("beautify");
|
|
};
|
|
|
|
function best_of(a) {
|
|
var best = a[0], len = best.length;
|
|
for (var i = 1; i < a.length; ++i) {
|
|
if (a[i].length < len) {
|
|
best = a[i];
|
|
len = best.length;
|
|
}
|
|
}
|
|
return best;
|
|
};
|
|
|
|
function make_num(num) {
|
|
var str = num.toString(10), a = [ str.replace(/^0\./, ".").replace('e+', 'e') ], m;
|
|
if (Math.floor(num) === num) {
|
|
if (num >= 0) {
|
|
a.push("0x" + num.toString(16).toLowerCase(), // probably pointless
|
|
"0" + num.toString(8)); // same.
|
|
} else {
|
|
a.push("-0x" + (-num).toString(16).toLowerCase(), // probably pointless
|
|
"-0" + (-num).toString(8)); // same.
|
|
}
|
|
if ((m = /^(.*?)(0+)$/.exec(num))) {
|
|
a.push(m[1] + "e" + m[2].length);
|
|
}
|
|
} else if ((m = /^0?\.(0+)(.*)$/.exec(num))) {
|
|
a.push(m[2] + "e-" + (m[1].length + m[2].length),
|
|
str.substr(str.indexOf(".")));
|
|
}
|
|
return best_of(a);
|
|
};
|
|
|
|
function make_block(stmt, output) {
|
|
if (stmt instanceof AST_BlockStatement) {
|
|
stmt.print(output);
|
|
return;
|
|
}
|
|
output.with_block(function(){
|
|
output.indent();
|
|
stmt.print(output);
|
|
output.newline();
|
|
});
|
|
};
|
|
|
|
/* -----[ source map generators ]----- */
|
|
|
|
function DEFMAP(nodetype, generator) {
|
|
nodetype.DEFMETHOD("add_source_map", function(stream){
|
|
generator(this, stream);
|
|
});
|
|
};
|
|
|
|
// We could easily add info for ALL nodes, but it seems to me that
|
|
// would be quite wasteful, hence this noop in the base class.
|
|
DEFMAP(AST_Node, noop);
|
|
|
|
function basic_sourcemap_gen(self, output) {
|
|
output.add_mapping(self.start);
|
|
};
|
|
|
|
// XXX: I'm not exactly sure if we need it for all of these nodes,
|
|
// or if we should add even more.
|
|
|
|
DEFMAP(AST_Directive, basic_sourcemap_gen);
|
|
DEFMAP(AST_Debugger, basic_sourcemap_gen);
|
|
DEFMAP(AST_Symbol, basic_sourcemap_gen);
|
|
DEFMAP(AST_Jump, basic_sourcemap_gen);
|
|
DEFMAP(AST_StatementWithBody, basic_sourcemap_gen);
|
|
DEFMAP(AST_LabeledStatement, noop); // since the label symbol will mark it
|
|
DEFMAP(AST_Lambda, basic_sourcemap_gen);
|
|
DEFMAP(AST_Switch, basic_sourcemap_gen);
|
|
DEFMAP(AST_SwitchBranch, basic_sourcemap_gen);
|
|
DEFMAP(AST_BlockStatement, basic_sourcemap_gen);
|
|
DEFMAP(AST_Toplevel, noop);
|
|
DEFMAP(AST_New, basic_sourcemap_gen);
|
|
DEFMAP(AST_Try, basic_sourcemap_gen);
|
|
DEFMAP(AST_Catch, basic_sourcemap_gen);
|
|
DEFMAP(AST_Finally, basic_sourcemap_gen);
|
|
DEFMAP(AST_Definitions, basic_sourcemap_gen);
|
|
DEFMAP(AST_Constant, basic_sourcemap_gen);
|
|
DEFMAP(AST_ObjectProperty, function(self, output){
|
|
output.add_mapping(self.start, self.key);
|
|
});
|
|
|
|
})();
|