4833 lines
178 KiB
JavaScript
4833 lines
178 KiB
JavaScript
var require = function (file, cwd) {
|
|
var resolved = require.resolve(file, cwd || '/');
|
|
var mod = require.modules[resolved];
|
|
if (!mod) throw new Error(
|
|
'Failed to resolve module ' + file + ', tried ' + resolved
|
|
);
|
|
var res = mod._cached ? mod._cached : mod();
|
|
return res;
|
|
}
|
|
var __require = require;
|
|
|
|
require.paths = [];
|
|
require.modules = {};
|
|
require.extensions = [".js",".coffee"];
|
|
|
|
require.resolve = (function () {
|
|
var core = {
|
|
'assert': true,
|
|
'events': true,
|
|
'fs': true,
|
|
'path': true,
|
|
'vm': true
|
|
};
|
|
|
|
return function (x, cwd) {
|
|
if (!cwd) cwd = '/';
|
|
|
|
if (core[x]) return x;
|
|
var path = require.modules.path();
|
|
var y = cwd || '.';
|
|
|
|
if (x.match(/^(?:\.\.?\/|\/)/)) {
|
|
var m = loadAsFileSync(path.resolve(y, x))
|
|
|| loadAsDirectorySync(path.resolve(y, x));
|
|
if (m) return m;
|
|
}
|
|
|
|
var n = loadNodeModulesSync(x, y);
|
|
if (n) return n;
|
|
|
|
throw new Error("Cannot find module '" + x + "'");
|
|
|
|
function loadAsFileSync (x) {
|
|
if (require.modules[x]) {
|
|
return x;
|
|
}
|
|
|
|
for (var i = 0; i < require.extensions.length; i++) {
|
|
var ext = require.extensions[i];
|
|
if (require.modules[x + ext]) return x + ext;
|
|
}
|
|
}
|
|
|
|
function loadAsDirectorySync (x) {
|
|
x = x.replace(/\/+$/, '');
|
|
var pkgfile = x + '/package.json';
|
|
if (require.modules[pkgfile]) {
|
|
var pkg = require.modules[pkgfile]();
|
|
var b = pkg.browserify;
|
|
if (typeof b === 'object' && b.main) {
|
|
var m = loadAsFileSync(path.resolve(x, b.main));
|
|
if (m) return m;
|
|
}
|
|
else if (typeof b === 'string') {
|
|
var m = loadAsFileSync(path.resolve(x, b));
|
|
if (m) return m;
|
|
}
|
|
else if (pkg.main) {
|
|
var m = loadAsFileSync(path.resolve(x, pkg.main));
|
|
if (m) return m;
|
|
}
|
|
}
|
|
|
|
return loadAsFileSync(x + '/index');
|
|
}
|
|
|
|
function loadNodeModulesSync (x, start) {
|
|
var dirs = nodeModulesPathsSync(start);
|
|
for (var i = 0; i < dirs.length; i++) {
|
|
var dir = dirs[i];
|
|
var m = loadAsFileSync(dir + '/' + x);
|
|
if (m) return m;
|
|
var n = loadAsDirectorySync(dir + '/' + x);
|
|
if (n) return n;
|
|
}
|
|
|
|
var m = loadAsFileSync(x);
|
|
if (m) return m;
|
|
}
|
|
|
|
function nodeModulesPathsSync (start) {
|
|
var parts;
|
|
if (start === '/') parts = [ '' ];
|
|
else parts = path.normalize(start).split('/');
|
|
|
|
var dirs = [];
|
|
for (var i = parts.length - 1; i >= 0; i--) {
|
|
if (parts[i] === 'node_modules') continue;
|
|
var dir = parts.slice(0, i + 1).join('/') + '/node_modules';
|
|
dirs.push(dir);
|
|
}
|
|
|
|
return dirs;
|
|
}
|
|
};
|
|
})();
|
|
|
|
require.alias = function (from, to) {
|
|
var path = require.modules.path();
|
|
var res = null;
|
|
try {
|
|
res = require.resolve(from + '/package.json', '/');
|
|
}
|
|
catch (err) {
|
|
res = require.resolve(from, '/');
|
|
}
|
|
var basedir = path.dirname(res);
|
|
|
|
var keys = Object_keys(require.modules);
|
|
|
|
for (var i = 0; i < keys.length; i++) {
|
|
var key = keys[i];
|
|
if (key.slice(0, basedir.length + 1) === basedir + '/') {
|
|
var f = key.slice(basedir.length);
|
|
require.modules[to + f] = require.modules[basedir + f];
|
|
}
|
|
else if (key === basedir) {
|
|
require.modules[to] = require.modules[basedir];
|
|
}
|
|
}
|
|
};
|
|
|
|
var Object_keys = Object.keys || function (obj) {
|
|
var res = [];
|
|
for (var key in obj) res.push(key)
|
|
return res;
|
|
};
|
|
|
|
if (typeof process === 'undefined') process = {};
|
|
|
|
if (!process.nextTick) process.nextTick = function (fn) {
|
|
setTimeout(fn, 0);
|
|
};
|
|
|
|
if (!process.title) process.title = 'browser';
|
|
|
|
if (!process.binding) process.binding = function (name) {
|
|
if (name === 'evals') return require('vm')
|
|
else throw new Error('No such module')
|
|
};
|
|
|
|
if (!process.cwd) process.cwd = function () { return '.' };
|
|
|
|
require.modules["path"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = ".";
|
|
var __filename = "path";
|
|
|
|
var require = function (file) {
|
|
return __require(file, ".");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, ".");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["path"]._cached = module.exports;
|
|
|
|
(function () {
|
|
function filter (xs, fn) {
|
|
var res = [];
|
|
for (var i = 0; i < xs.length; i++) {
|
|
if (fn(xs[i], i, xs)) res.push(xs[i]);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
// resolves . and .. elements in a path array with directory names there
|
|
// must be no slashes, empty elements, or device names (c:\) in the array
|
|
// (so also no leading and trailing slashes - it does not distinguish
|
|
// relative and absolute paths)
|
|
function normalizeArray(parts, allowAboveRoot) {
|
|
// if the path tries to go above the root, `up` ends up > 0
|
|
var up = 0;
|
|
for (var i = parts.length; i >= 0; i--) {
|
|
var last = parts[i];
|
|
if (last == '.') {
|
|
parts.splice(i, 1);
|
|
} else if (last === '..') {
|
|
parts.splice(i, 1);
|
|
up++;
|
|
} else if (up) {
|
|
parts.splice(i, 1);
|
|
up--;
|
|
}
|
|
}
|
|
|
|
// if the path is allowed to go above the root, restore leading ..s
|
|
if (allowAboveRoot) {
|
|
for (; up--; up) {
|
|
parts.unshift('..');
|
|
}
|
|
}
|
|
|
|
return parts;
|
|
}
|
|
|
|
// Regex to split a filename into [*, dir, basename, ext]
|
|
// posix version
|
|
var splitPathRe = /^(.+\/(?!$)|\/)?((?:.+?)?(\.[^.]*)?)$/;
|
|
|
|
// path.resolve([from ...], to)
|
|
// posix version
|
|
exports.resolve = function() {
|
|
var resolvedPath = '',
|
|
resolvedAbsolute = false;
|
|
|
|
for (var i = arguments.length; i >= -1 && !resolvedAbsolute; i--) {
|
|
var path = (i >= 0)
|
|
? arguments[i]
|
|
: process.cwd();
|
|
|
|
// Skip empty and invalid entries
|
|
if (typeof path !== 'string' || !path) {
|
|
continue;
|
|
}
|
|
|
|
resolvedPath = path + '/' + resolvedPath;
|
|
resolvedAbsolute = path.charAt(0) === '/';
|
|
}
|
|
|
|
// At this point the path should be resolved to a full absolute path, but
|
|
// handle relative paths to be safe (might happen when process.cwd() fails)
|
|
|
|
// Normalize the path
|
|
resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {
|
|
return !!p;
|
|
}), !resolvedAbsolute).join('/');
|
|
|
|
return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
|
|
};
|
|
|
|
// path.normalize(path)
|
|
// posix version
|
|
exports.normalize = function(path) {
|
|
var isAbsolute = path.charAt(0) === '/',
|
|
trailingSlash = path.slice(-1) === '/';
|
|
|
|
// Normalize the path
|
|
path = normalizeArray(filter(path.split('/'), function(p) {
|
|
return !!p;
|
|
}), !isAbsolute).join('/');
|
|
|
|
if (!path && !isAbsolute) {
|
|
path = '.';
|
|
}
|
|
if (path && trailingSlash) {
|
|
path += '/';
|
|
}
|
|
|
|
return (isAbsolute ? '/' : '') + path;
|
|
};
|
|
|
|
|
|
// posix version
|
|
exports.join = function() {
|
|
var paths = Array.prototype.slice.call(arguments, 0);
|
|
return exports.normalize(filter(paths, function(p, index) {
|
|
return p && typeof p === 'string';
|
|
}).join('/'));
|
|
};
|
|
|
|
|
|
exports.dirname = function(path) {
|
|
var dir = splitPathRe.exec(path)[1] || '';
|
|
var isWindows = false;
|
|
if (!dir) {
|
|
// No dirname
|
|
return '.';
|
|
} else if (dir.length === 1 ||
|
|
(isWindows && dir.length <= 3 && dir.charAt(1) === ':')) {
|
|
// It is just a slash or a drive letter with a slash
|
|
return dir;
|
|
} else {
|
|
// It is a full dirname, strip trailing slash
|
|
return dir.substring(0, dir.length - 1);
|
|
}
|
|
};
|
|
|
|
|
|
exports.basename = function(path, ext) {
|
|
var f = splitPathRe.exec(path)[2] || '';
|
|
// TODO: make this comparison case-insensitive on windows?
|
|
if (ext && f.substr(-1 * ext.length) === ext) {
|
|
f = f.substr(0, f.length - ext.length);
|
|
}
|
|
return f;
|
|
};
|
|
|
|
|
|
exports.extname = function(path) {
|
|
return splitPathRe.exec(path)[3] || '';
|
|
};
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["path"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/package.json"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito";
|
|
var __filename = "/node_modules/burrito/package.json";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/package.json"]._cached = module.exports;
|
|
|
|
(function () {
|
|
module.exports = {"name":"burrito","description":"Wrap up expressions with a trace function while walking the AST with rice and beans on the side","version":"0.2.8","repository":{"type":"git","url":"git://github.com/substack/node-burrito.git"},"main":"./index.js","keywords":["trace","ast","walk","syntax","source","tree","uglify"],"directories":{"lib":".","example":"example","test":"test"},"scripts":{"test":"expresso"},"dependencies":{"traverse":">=0.5.1 <0.6","uglify-js":"1.0.4"},"devDependencies":{"expresso":"=0.7.x"},"engines":{"node":">=0.4.0"},"license":"BSD","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"}};
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/package.json"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/uglify-js/package.json"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/uglify-js";
|
|
var __filename = "/node_modules/burrito/node_modules/uglify-js/package.json";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/uglify-js");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/uglify-js");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/package.json"]._cached = module.exports;
|
|
|
|
(function () {
|
|
module.exports = {"name":"uglify-js","author":{"name":"Mihai Bazon","email":"mihai.bazon@gmail.com","url":"http://mihai.bazon.net/blog"},"version":"1.0.4","main":"./uglify-js.js","bin":{"uglifyjs":"./bin/uglifyjs"},"repository":{"type":"git","url":"git@github.com:mishoo/UglifyJS.git"}};
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/package.json"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/uglify-js/uglify-js.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/uglify-js";
|
|
var __filename = "/node_modules/burrito/node_modules/uglify-js/uglify-js.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/uglify-js");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/uglify-js");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/uglify-js.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
//convienence function(src, [options]);
|
|
function uglify(orig_code, options){
|
|
options || (options = {});
|
|
var jsp = uglify.parser;
|
|
var pro = uglify.uglify;
|
|
|
|
var ast = jsp.parse(orig_code, options.strict_semicolons); // parse code and get the initial AST
|
|
ast = pro.ast_mangle(ast, options.mangle_options); // get a new AST with mangled names
|
|
ast = pro.ast_squeeze(ast, options.squeeze_options); // get an AST with compression optimizations
|
|
var final_code = pro.gen_code(ast, options.gen_options); // compressed code here
|
|
return final_code;
|
|
};
|
|
|
|
uglify.parser = require("./lib/parse-js");
|
|
uglify.uglify = require("./lib/process");
|
|
|
|
module.exports = uglify;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/uglify-js.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/uglify-js/lib/parse-js.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/uglify-js/lib";
|
|
var __filename = "/node_modules/burrito/node_modules/uglify-js/lib/parse-js.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/uglify-js/lib");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/uglify-js/lib");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/lib/parse-js.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
/***********************************************************************
|
|
|
|
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
|
|
This version is suitable for Node.js. With minimal changes (the
|
|
exports stuff) it should work on any JS platform.
|
|
|
|
This file contains the tokenizer/parser. It is a port to JavaScript
|
|
of parse-js [1], a JavaScript parser library written in Common Lisp
|
|
by Marijn Haverbeke. Thank you Marijn!
|
|
|
|
[1] http://marijn.haverbeke.nl/parse-js/
|
|
|
|
Exported functions:
|
|
|
|
- tokenizer(code) -- returns a function. Call the returned
|
|
function to fetch the next token.
|
|
|
|
- parse(code) -- returns an AST of the given JavaScript code.
|
|
|
|
-------------------------------- (C) ---------------------------------
|
|
|
|
Author: Mihai Bazon
|
|
<mihai.bazon@gmail.com>
|
|
http://mihai.bazon.net/blog
|
|
|
|
Distributed under the BSD license:
|
|
|
|
Copyright 2010 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
Based on parse-js (http://marijn.haverbeke.nl/parse-js/).
|
|
|
|
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.
|
|
|
|
***********************************************************************/
|
|
|
|
/* -----[ Tokenizer (constants) ]----- */
|
|
|
|
var KEYWORDS = array_to_hash([
|
|
"break",
|
|
"case",
|
|
"catch",
|
|
"const",
|
|
"continue",
|
|
"default",
|
|
"delete",
|
|
"do",
|
|
"else",
|
|
"finally",
|
|
"for",
|
|
"function",
|
|
"if",
|
|
"in",
|
|
"instanceof",
|
|
"new",
|
|
"return",
|
|
"switch",
|
|
"throw",
|
|
"try",
|
|
"typeof",
|
|
"var",
|
|
"void",
|
|
"while",
|
|
"with"
|
|
]);
|
|
|
|
var RESERVED_WORDS = array_to_hash([
|
|
"abstract",
|
|
"boolean",
|
|
"byte",
|
|
"char",
|
|
"class",
|
|
"debugger",
|
|
"double",
|
|
"enum",
|
|
"export",
|
|
"extends",
|
|
"final",
|
|
"float",
|
|
"goto",
|
|
"implements",
|
|
"import",
|
|
"int",
|
|
"interface",
|
|
"long",
|
|
"native",
|
|
"package",
|
|
"private",
|
|
"protected",
|
|
"public",
|
|
"short",
|
|
"static",
|
|
"super",
|
|
"synchronized",
|
|
"throws",
|
|
"transient",
|
|
"volatile"
|
|
]);
|
|
|
|
var KEYWORDS_BEFORE_EXPRESSION = array_to_hash([
|
|
"return",
|
|
"new",
|
|
"delete",
|
|
"throw",
|
|
"else",
|
|
"case"
|
|
]);
|
|
|
|
var KEYWORDS_ATOM = array_to_hash([
|
|
"false",
|
|
"null",
|
|
"true",
|
|
"undefined"
|
|
]);
|
|
|
|
var OPERATOR_CHARS = array_to_hash(characters("+-*&%=<>!?|~^"));
|
|
|
|
var RE_HEX_NUMBER = /^0x[0-9a-f]+$/i;
|
|
var RE_OCT_NUMBER = /^0[0-7]+$/;
|
|
var RE_DEC_NUMBER = /^\d*\.?\d*(?:e[+-]?\d*(?:\d\.?|\.?\d)\d*)?$/i;
|
|
|
|
var OPERATORS = array_to_hash([
|
|
"in",
|
|
"instanceof",
|
|
"typeof",
|
|
"new",
|
|
"void",
|
|
"delete",
|
|
"++",
|
|
"--",
|
|
"+",
|
|
"-",
|
|
"!",
|
|
"~",
|
|
"&",
|
|
"|",
|
|
"^",
|
|
"*",
|
|
"/",
|
|
"%",
|
|
">>",
|
|
"<<",
|
|
">>>",
|
|
"<",
|
|
">",
|
|
"<=",
|
|
">=",
|
|
"==",
|
|
"===",
|
|
"!=",
|
|
"!==",
|
|
"?",
|
|
"=",
|
|
"+=",
|
|
"-=",
|
|
"/=",
|
|
"*=",
|
|
"%=",
|
|
">>=",
|
|
"<<=",
|
|
">>>=",
|
|
"|=",
|
|
"^=",
|
|
"&=",
|
|
"&&",
|
|
"||"
|
|
]);
|
|
|
|
var WHITESPACE_CHARS = array_to_hash(characters(" \u00a0\n\r\t\f\v\u200b"));
|
|
|
|
var PUNC_BEFORE_EXPRESSION = array_to_hash(characters("[{}(,.;:"));
|
|
|
|
var PUNC_CHARS = array_to_hash(characters("[]{}(),;:"));
|
|
|
|
var REGEXP_MODIFIERS = array_to_hash(characters("gmsiy"));
|
|
|
|
/* -----[ Tokenizer ]----- */
|
|
|
|
// regexps adapted from http://xregexp.com/plugins/#unicode
|
|
var UNICODE = {
|
|
letter: new RegExp("[\\u0041-\\u005A\\u0061-\\u007A\\u00AA\\u00B5\\u00BA\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u0523\\u0531-\\u0556\\u0559\\u0561-\\u0587\\u05D0-\\u05EA\\u05F0-\\u05F2\\u0621-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971\\u0972\\u097B-\\u097F\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C33\\u0C35-\\u0C39\\u0C3D\\u0C58\\u0C59\\u0C60\\u0C61\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDE\\u0CE0\\u0CE1\\u0D05-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D28\\u0D2A-\\u0D39\\u0D3D\\u0D60\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E87\\u0E88\\u0E8A\\u0E8D\\u0E94-\\u0E97\\u0E99-\\u0E9F\\u0EA1-\\u0EA3\\u0EA5\\u0EA7\\u0EAA\\u0EAB\\u0EAD-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC\\u0EDD\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8B\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10D0-\\u10FA\\u10FC\\u1100-\\u1159\\u115F-\\u11A2\\u11A8-\\u11F9\\u1200-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F4\\u1401-\\u166C\\u166F-\\u1676\\u1681-\\u169A\\u16A0-\\u16EA\\u1700-\\u170C\\u170E-\\u1711\\u1720-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1877\\u1880-\\u18A8\\u18AA\\u1900-\\u191C\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19A9\\u19C1-\\u19C7\\u1A00-\\u1A16\\u1B05-\\u1B33\\u1B45-\\u1B4B\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u2094\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2C2E\\u2C30-\\u2C5E\\u2C60-\\u2C6F\\u2C71-\\u2C7D\\u2C80-\\u2CE4\\u2D00-\\u2D25\\u2D30-\\u2D65\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312D\\u3131-\\u318E\\u31A0-\\u31B7\\u31F0-\\u31FF\\u3400\\u4DB5\\u4E00\\u9FC3\\uA000-\\uA48C\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA65F\\uA662-\\uA66E\\uA67F-\\uA697\\uA717-\\uA71F\\uA722-\\uA788\\uA78B\\uA78C\\uA7FB-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA90A-\\uA925\\uA930-\\uA946\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAC00\\uD7A3\\uF900-\\uFA2D\\uFA30-\\uFA6A\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]"),
|
|
non_spacing_mark: new RegExp("[\\u0300-\\u036F\\u0483-\\u0487\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065E\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0900-\\u0902\\u093C\\u0941-\\u0948\\u094D\\u0951-\\u0955\\u0962\\u0963\\u0981\\u09BC\\u09C1-\\u09C4\\u09CD\\u09E2\\u09E3\\u0A01\\u0A02\\u0A3C\\u0A41\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81\\u0A82\\u0ABC\\u0AC1-\\u0AC5\\u0AC7\\u0AC8\\u0ACD\\u0AE2\\u0AE3\\u0B01\\u0B3C\\u0B3F\\u0B41-\\u0B44\\u0B4D\\u0B56\\u0B62\\u0B63\\u0B82\\u0BC0\\u0BCD\\u0C3E-\\u0C40\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0CBC\\u0CBF\\u0CC6\\u0CCC\\u0CCD\\u0CE2\\u0CE3\\u0D41-\\u0D44\\u0D4D\\u0D62\\u0D63\\u0DCA\\u0DD2-\\u0DD4\\u0DD6\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EB9\\u0EBB\\u0EBC\\u0EC8-\\u0ECD\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F71-\\u0F7E\\u0F80-\\u0F84\\u0F86\\u0F87\\u0F90-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102D-\\u1030\\u1032-\\u1037\\u1039\\u103A\\u103D\\u103E\\u1058\\u1059\\u105E-\\u1060\\u1071-\\u1074\\u1082\\u1085\\u1086\\u108D\\u109D\\u135F\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17B7-\\u17BD\\u17C6\\u17C9-\\u17D3\\u17DD\\u180B-\\u180D\\u18A9\\u1920-\\u1922\\u1927\\u1928\\u1932\\u1939-\\u193B\\u1A17\\u1A18\\u1A56\\u1A58-\\u1A5E\\u1A60\\u1A62\\u1A65-\\u1A6C\\u1A73-\\u1A7C\\u1A7F\\u1B00-\\u1B03\\u1B34\\u1B36-\\u1B3A\\u1B3C\\u1B42\\u1B6B-\\u1B73\\u1B80\\u1B81\\u1BA2-\\u1BA5\\u1BA8\\u1BA9\\u1C2C-\\u1C33\\u1C36\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE0\\u1CE2-\\u1CE8\\u1CED\\u1DC0-\\u1DE6\\u1DFD-\\u1DFF\\u20D0-\\u20DC\\u20E1\\u20E5-\\u20F0\\u2CEF-\\u2CF1\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F\\uA67C\\uA67D\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA825\\uA826\\uA8C4\\uA8E0-\\uA8F1\\uA926-\\uA92D\\uA947-\\uA951\\uA980-\\uA982\\uA9B3\\uA9B6-\\uA9B9\\uA9BC\\uAA29-\\uAA2E\\uAA31\\uAA32\\uAA35\\uAA36\\uAA43\\uAA4C\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uABE5\\uABE8\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE26]"),
|
|
space_combining_mark: new RegExp("[\\u0903\\u093E-\\u0940\\u0949-\\u094C\\u094E\\u0982\\u0983\\u09BE-\\u09C0\\u09C7\\u09C8\\u09CB\\u09CC\\u09D7\\u0A03\\u0A3E-\\u0A40\\u0A83\\u0ABE-\\u0AC0\\u0AC9\\u0ACB\\u0ACC\\u0B02\\u0B03\\u0B3E\\u0B40\\u0B47\\u0B48\\u0B4B\\u0B4C\\u0B57\\u0BBE\\u0BBF\\u0BC1\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCC\\u0BD7\\u0C01-\\u0C03\\u0C41-\\u0C44\\u0C82\\u0C83\\u0CBE\\u0CC0-\\u0CC4\\u0CC7\\u0CC8\\u0CCA\\u0CCB\\u0CD5\\u0CD6\\u0D02\\u0D03\\u0D3E-\\u0D40\\u0D46-\\u0D48\\u0D4A-\\u0D4C\\u0D57\\u0D82\\u0D83\\u0DCF-\\u0DD1\\u0DD8-\\u0DDF\\u0DF2\\u0DF3\\u0F3E\\u0F3F\\u0F7F\\u102B\\u102C\\u1031\\u1038\\u103B\\u103C\\u1056\\u1057\\u1062-\\u1064\\u1067-\\u106D\\u1083\\u1084\\u1087-\\u108C\\u108F\\u109A-\\u109C\\u17B6\\u17BE-\\u17C5\\u17C7\\u17C8\\u1923-\\u1926\\u1929-\\u192B\\u1930\\u1931\\u1933-\\u1938\\u19B0-\\u19C0\\u19C8\\u19C9\\u1A19-\\u1A1B\\u1A55\\u1A57\\u1A61\\u1A63\\u1A64\\u1A6D-\\u1A72\\u1B04\\u1B35\\u1B3B\\u1B3D-\\u1B41\\u1B43\\u1B44\\u1B82\\u1BA1\\u1BA6\\u1BA7\\u1BAA\\u1C24-\\u1C2B\\u1C34\\u1C35\\u1CE1\\u1CF2\\uA823\\uA824\\uA827\\uA880\\uA881\\uA8B4-\\uA8C3\\uA952\\uA953\\uA983\\uA9B4\\uA9B5\\uA9BA\\uA9BB\\uA9BD-\\uA9C0\\uAA2F\\uAA30\\uAA33\\uAA34\\uAA4D\\uAA7B\\uABE3\\uABE4\\uABE6\\uABE7\\uABE9\\uABEA\\uABEC]"),
|
|
connector_punctuation: new RegExp("[\\u005F\\u203F\\u2040\\u2054\\uFE33\\uFE34\\uFE4D-\\uFE4F\\uFF3F]")
|
|
};
|
|
|
|
function is_letter(ch) {
|
|
return UNICODE.letter.test(ch);
|
|
};
|
|
|
|
function is_digit(ch) {
|
|
ch = ch.charCodeAt(0);
|
|
return ch >= 48 && ch <= 57; //XXX: find out if "UnicodeDigit" means something else than 0..9
|
|
};
|
|
|
|
function is_alphanumeric_char(ch) {
|
|
return is_digit(ch) || is_letter(ch);
|
|
};
|
|
|
|
function is_unicode_combining_mark(ch) {
|
|
return UNICODE.non_spacing_mark.test(ch) || UNICODE.space_combining_mark.test(ch);
|
|
};
|
|
|
|
function is_unicode_connector_punctuation(ch) {
|
|
return UNICODE.connector_punctuation.test(ch);
|
|
};
|
|
|
|
function is_identifier_start(ch) {
|
|
return ch == "$" || ch == "_" || is_letter(ch);
|
|
};
|
|
|
|
function is_identifier_char(ch) {
|
|
return is_identifier_start(ch)
|
|
|| is_unicode_combining_mark(ch)
|
|
|| is_digit(ch)
|
|
|| is_unicode_connector_punctuation(ch)
|
|
|| ch == "\u200c" // zero-width non-joiner <ZWNJ>
|
|
|| ch == "\u200d" // zero-width joiner <ZWJ> (in my ECMA-262 PDF, this is also 200c)
|
|
;
|
|
};
|
|
|
|
function parse_js_number(num) {
|
|
if (RE_HEX_NUMBER.test(num)) {
|
|
return parseInt(num.substr(2), 16);
|
|
} else if (RE_OCT_NUMBER.test(num)) {
|
|
return parseInt(num.substr(1), 8);
|
|
} else if (RE_DEC_NUMBER.test(num)) {
|
|
return parseFloat(num);
|
|
}
|
|
};
|
|
|
|
function JS_Parse_Error(message, line, col, pos) {
|
|
this.message = message;
|
|
this.line = line;
|
|
this.col = col;
|
|
this.pos = pos;
|
|
try {
|
|
({})();
|
|
} catch(ex) {
|
|
this.stack = ex.stack;
|
|
};
|
|
};
|
|
|
|
JS_Parse_Error.prototype.toString = function() {
|
|
return this.message + " (line: " + this.line + ", col: " + this.col + ", pos: " + this.pos + ")" + "\n\n" + this.stack;
|
|
};
|
|
|
|
function js_error(message, line, col, pos) {
|
|
throw new JS_Parse_Error(message, line, col, pos);
|
|
};
|
|
|
|
function is_token(token, type, val) {
|
|
return token.type == type && (val == null || token.value == val);
|
|
};
|
|
|
|
var EX_EOF = {};
|
|
|
|
function tokenizer($TEXT) {
|
|
|
|
var S = {
|
|
text : $TEXT.replace(/\r\n?|[\n\u2028\u2029]/g, "\n").replace(/^\uFEFF/, ''),
|
|
pos : 0,
|
|
tokpos : 0,
|
|
line : 0,
|
|
tokline : 0,
|
|
col : 0,
|
|
tokcol : 0,
|
|
newline_before : false,
|
|
regex_allowed : false,
|
|
comments_before : []
|
|
};
|
|
|
|
function peek() { return S.text.charAt(S.pos); };
|
|
|
|
function next(signal_eof) {
|
|
var ch = S.text.charAt(S.pos++);
|
|
if (signal_eof && !ch)
|
|
throw EX_EOF;
|
|
if (ch == "\n") {
|
|
S.newline_before = true;
|
|
++S.line;
|
|
S.col = 0;
|
|
} else {
|
|
++S.col;
|
|
}
|
|
return ch;
|
|
};
|
|
|
|
function eof() {
|
|
return !S.peek();
|
|
};
|
|
|
|
function find(what, signal_eof) {
|
|
var pos = S.text.indexOf(what, S.pos);
|
|
if (signal_eof && pos == -1) throw EX_EOF;
|
|
return pos;
|
|
};
|
|
|
|
function start_token() {
|
|
S.tokline = S.line;
|
|
S.tokcol = S.col;
|
|
S.tokpos = S.pos;
|
|
};
|
|
|
|
function token(type, value, is_comment) {
|
|
S.regex_allowed = ((type == "operator" && !HOP(UNARY_POSTFIX, value)) ||
|
|
(type == "keyword" && HOP(KEYWORDS_BEFORE_EXPRESSION, value)) ||
|
|
(type == "punc" && HOP(PUNC_BEFORE_EXPRESSION, value)));
|
|
var ret = {
|
|
type : type,
|
|
value : value,
|
|
line : S.tokline,
|
|
col : S.tokcol,
|
|
pos : S.tokpos,
|
|
nlb : S.newline_before
|
|
};
|
|
if (!is_comment) {
|
|
ret.comments_before = S.comments_before;
|
|
S.comments_before = [];
|
|
}
|
|
S.newline_before = false;
|
|
return ret;
|
|
};
|
|
|
|
function skip_whitespace() {
|
|
while (HOP(WHITESPACE_CHARS, peek()))
|
|
next();
|
|
};
|
|
|
|
function read_while(pred) {
|
|
var ret = "", ch = peek(), i = 0;
|
|
while (ch && pred(ch, i++)) {
|
|
ret += next();
|
|
ch = peek();
|
|
}
|
|
return ret;
|
|
};
|
|
|
|
function parse_error(err) {
|
|
js_error(err, S.tokline, S.tokcol, S.tokpos);
|
|
};
|
|
|
|
function read_num(prefix) {
|
|
var has_e = false, after_e = false, has_x = false, has_dot = prefix == ".";
|
|
var num = read_while(function(ch, i){
|
|
if (ch == "x" || ch == "X") {
|
|
if (has_x) return false;
|
|
return has_x = true;
|
|
}
|
|
if (!has_x && (ch == "E" || ch == "e")) {
|
|
if (has_e) return false;
|
|
return has_e = after_e = true;
|
|
}
|
|
if (ch == "-") {
|
|
if (after_e || (i == 0 && !prefix)) return true;
|
|
return false;
|
|
}
|
|
if (ch == "+") return after_e;
|
|
after_e = false;
|
|
if (ch == ".") {
|
|
if (!has_dot && !has_x)
|
|
return has_dot = true;
|
|
return false;
|
|
}
|
|
return is_alphanumeric_char(ch);
|
|
});
|
|
if (prefix)
|
|
num = prefix + num;
|
|
var valid = parse_js_number(num);
|
|
if (!isNaN(valid)) {
|
|
return token("num", valid);
|
|
} else {
|
|
parse_error("Invalid syntax: " + num);
|
|
}
|
|
};
|
|
|
|
function read_escaped_char() {
|
|
var ch = next(true);
|
|
switch (ch) {
|
|
case "n" : return "\n";
|
|
case "r" : return "\r";
|
|
case "t" : return "\t";
|
|
case "b" : return "\b";
|
|
case "v" : return "\v";
|
|
case "f" : return "\f";
|
|
case "0" : return "\0";
|
|
case "x" : return String.fromCharCode(hex_bytes(2));
|
|
case "u" : return String.fromCharCode(hex_bytes(4));
|
|
default : return ch;
|
|
}
|
|
};
|
|
|
|
function hex_bytes(n) {
|
|
var num = 0;
|
|
for (; n > 0; --n) {
|
|
var digit = parseInt(next(true), 16);
|
|
if (isNaN(digit))
|
|
parse_error("Invalid hex-character pattern in string");
|
|
num = (num << 4) | digit;
|
|
}
|
|
return num;
|
|
};
|
|
|
|
function read_string() {
|
|
return with_eof_error("Unterminated string constant", function(){
|
|
var quote = next(), ret = "";
|
|
for (;;) {
|
|
var ch = next(true);
|
|
if (ch == "\\") ch = read_escaped_char();
|
|
else if (ch == quote) break;
|
|
ret += ch;
|
|
}
|
|
return token("string", ret);
|
|
});
|
|
};
|
|
|
|
function read_line_comment() {
|
|
next();
|
|
var i = find("\n"), ret;
|
|
if (i == -1) {
|
|
ret = S.text.substr(S.pos);
|
|
S.pos = S.text.length;
|
|
} else {
|
|
ret = S.text.substring(S.pos, i);
|
|
S.pos = i;
|
|
}
|
|
return token("comment1", ret, true);
|
|
};
|
|
|
|
function read_multiline_comment() {
|
|
next();
|
|
return with_eof_error("Unterminated multiline comment", function(){
|
|
var i = find("*/", true),
|
|
text = S.text.substring(S.pos, i),
|
|
tok = token("comment2", text, true);
|
|
S.pos = i + 2;
|
|
S.line += text.split("\n").length - 1;
|
|
S.newline_before = text.indexOf("\n") >= 0;
|
|
|
|
// https://github.com/mishoo/UglifyJS/issues/#issue/100
|
|
if (/^@cc_on/i.test(text)) {
|
|
warn("WARNING: at line " + S.line);
|
|
warn("*** Found \"conditional comment\": " + text);
|
|
warn("*** UglifyJS DISCARDS ALL COMMENTS. This means your code might no longer work properly in Internet Explorer.");
|
|
}
|
|
|
|
return tok;
|
|
});
|
|
};
|
|
|
|
function read_name() {
|
|
var backslash = false, name = "", ch;
|
|
while ((ch = peek()) != null) {
|
|
if (!backslash) {
|
|
if (ch == "\\") backslash = true, next();
|
|
else if (is_identifier_char(ch)) name += next();
|
|
else break;
|
|
}
|
|
else {
|
|
if (ch != "u") parse_error("Expecting UnicodeEscapeSequence -- uXXXX");
|
|
ch = read_escaped_char();
|
|
if (!is_identifier_char(ch)) parse_error("Unicode char: " + ch.charCodeAt(0) + " is not valid in identifier");
|
|
name += ch;
|
|
backslash = false;
|
|
}
|
|
}
|
|
return name;
|
|
};
|
|
|
|
function read_regexp() {
|
|
return with_eof_error("Unterminated regular expression", function(){
|
|
var prev_backslash = false, regexp = "", ch, in_class = false;
|
|
while ((ch = next(true))) if (prev_backslash) {
|
|
regexp += "\\" + ch;
|
|
prev_backslash = false;
|
|
} else if (ch == "[") {
|
|
in_class = true;
|
|
regexp += ch;
|
|
} else if (ch == "]" && in_class) {
|
|
in_class = false;
|
|
regexp += ch;
|
|
} else if (ch == "/" && !in_class) {
|
|
break;
|
|
} else if (ch == "\\") {
|
|
prev_backslash = true;
|
|
} else {
|
|
regexp += ch;
|
|
}
|
|
var mods = read_name();
|
|
return token("regexp", [ regexp, mods ]);
|
|
});
|
|
};
|
|
|
|
function read_operator(prefix) {
|
|
function grow(op) {
|
|
if (!peek()) return op;
|
|
var bigger = op + peek();
|
|
if (HOP(OPERATORS, bigger)) {
|
|
next();
|
|
return grow(bigger);
|
|
} else {
|
|
return op;
|
|
}
|
|
};
|
|
return token("operator", grow(prefix || next()));
|
|
};
|
|
|
|
function handle_slash() {
|
|
next();
|
|
var regex_allowed = S.regex_allowed;
|
|
switch (peek()) {
|
|
case "/":
|
|
S.comments_before.push(read_line_comment());
|
|
S.regex_allowed = regex_allowed;
|
|
return next_token();
|
|
case "*":
|
|
S.comments_before.push(read_multiline_comment());
|
|
S.regex_allowed = regex_allowed;
|
|
return next_token();
|
|
}
|
|
return S.regex_allowed ? read_regexp() : read_operator("/");
|
|
};
|
|
|
|
function handle_dot() {
|
|
next();
|
|
return is_digit(peek())
|
|
? read_num(".")
|
|
: token("punc", ".");
|
|
};
|
|
|
|
function read_word() {
|
|
var word = read_name();
|
|
return !HOP(KEYWORDS, word)
|
|
? token("name", word)
|
|
: HOP(OPERATORS, word)
|
|
? token("operator", word)
|
|
: HOP(KEYWORDS_ATOM, word)
|
|
? token("atom", word)
|
|
: token("keyword", word);
|
|
};
|
|
|
|
function with_eof_error(eof_error, cont) {
|
|
try {
|
|
return cont();
|
|
} catch(ex) {
|
|
if (ex === EX_EOF) parse_error(eof_error);
|
|
else throw ex;
|
|
}
|
|
};
|
|
|
|
function next_token(force_regexp) {
|
|
if (force_regexp)
|
|
return read_regexp();
|
|
skip_whitespace();
|
|
start_token();
|
|
var ch = peek();
|
|
if (!ch) return token("eof");
|
|
if (is_digit(ch)) return read_num();
|
|
if (ch == '"' || ch == "'") return read_string();
|
|
if (HOP(PUNC_CHARS, ch)) return token("punc", next());
|
|
if (ch == ".") return handle_dot();
|
|
if (ch == "/") return handle_slash();
|
|
if (HOP(OPERATOR_CHARS, ch)) return read_operator();
|
|
if (ch == "\\" || is_identifier_start(ch)) return read_word();
|
|
parse_error("Unexpected character '" + ch + "'");
|
|
};
|
|
|
|
next_token.context = function(nc) {
|
|
if (nc) S = nc;
|
|
return S;
|
|
};
|
|
|
|
return next_token;
|
|
|
|
};
|
|
|
|
/* -----[ Parser (constants) ]----- */
|
|
|
|
var UNARY_PREFIX = array_to_hash([
|
|
"typeof",
|
|
"void",
|
|
"delete",
|
|
"--",
|
|
"++",
|
|
"!",
|
|
"~",
|
|
"-",
|
|
"+"
|
|
]);
|
|
|
|
var UNARY_POSTFIX = array_to_hash([ "--", "++" ]);
|
|
|
|
var ASSIGNMENT = (function(a, ret, i){
|
|
while (i < a.length) {
|
|
ret[a[i]] = a[i].substr(0, a[i].length - 1);
|
|
i++;
|
|
}
|
|
return ret;
|
|
})(
|
|
["+=", "-=", "/=", "*=", "%=", ">>=", "<<=", ">>>=", "|=", "^=", "&="],
|
|
{ "=": true },
|
|
0
|
|
);
|
|
|
|
var PRECEDENCE = (function(a, ret){
|
|
for (var i = 0, n = 1; i < a.length; ++i, ++n) {
|
|
var b = a[i];
|
|
for (var j = 0; j < b.length; ++j) {
|
|
ret[b[j]] = n;
|
|
}
|
|
}
|
|
return ret;
|
|
})(
|
|
[
|
|
["||"],
|
|
["&&"],
|
|
["|"],
|
|
["^"],
|
|
["&"],
|
|
["==", "===", "!=", "!=="],
|
|
["<", ">", "<=", ">=", "in", "instanceof"],
|
|
[">>", "<<", ">>>"],
|
|
["+", "-"],
|
|
["*", "/", "%"]
|
|
],
|
|
{}
|
|
);
|
|
|
|
var STATEMENTS_WITH_LABELS = array_to_hash([ "for", "do", "while", "switch" ]);
|
|
|
|
var ATOMIC_START_TOKEN = array_to_hash([ "atom", "num", "string", "regexp", "name" ]);
|
|
|
|
/* -----[ Parser ]----- */
|
|
|
|
function NodeWithToken(str, start, end) {
|
|
this.name = str;
|
|
this.start = start;
|
|
this.end = end;
|
|
};
|
|
|
|
NodeWithToken.prototype.toString = function() { return this.name; };
|
|
|
|
function parse($TEXT, exigent_mode, embed_tokens) {
|
|
|
|
var S = {
|
|
input : typeof $TEXT == "string" ? tokenizer($TEXT, true) : $TEXT,
|
|
token : null,
|
|
prev : null,
|
|
peeked : null,
|
|
in_function : 0,
|
|
in_loop : 0,
|
|
labels : []
|
|
};
|
|
|
|
S.token = next();
|
|
|
|
function is(type, value) {
|
|
return is_token(S.token, type, value);
|
|
};
|
|
|
|
function peek() { return S.peeked || (S.peeked = S.input()); };
|
|
|
|
function next() {
|
|
S.prev = S.token;
|
|
if (S.peeked) {
|
|
S.token = S.peeked;
|
|
S.peeked = null;
|
|
} else {
|
|
S.token = S.input();
|
|
}
|
|
return S.token;
|
|
};
|
|
|
|
function prev() {
|
|
return S.prev;
|
|
};
|
|
|
|
function croak(msg, line, col, pos) {
|
|
var ctx = S.input.context();
|
|
js_error(msg,
|
|
line != null ? line : ctx.tokline,
|
|
col != null ? col : ctx.tokcol,
|
|
pos != null ? pos : ctx.tokpos);
|
|
};
|
|
|
|
function token_error(token, msg) {
|
|
croak(msg, token.line, token.col);
|
|
};
|
|
|
|
function unexpected(token) {
|
|
if (token == null)
|
|
token = S.token;
|
|
token_error(token, "Unexpected token: " + token.type + " (" + token.value + ")");
|
|
};
|
|
|
|
function expect_token(type, val) {
|
|
if (is(type, val)) {
|
|
return next();
|
|
}
|
|
token_error(S.token, "Unexpected token " + S.token.type + ", expected " + type);
|
|
};
|
|
|
|
function expect(punc) { return expect_token("punc", punc); };
|
|
|
|
function can_insert_semicolon() {
|
|
return !exigent_mode && (
|
|
S.token.nlb || is("eof") || is("punc", "}")
|
|
);
|
|
};
|
|
|
|
function semicolon() {
|
|
if (is("punc", ";")) next();
|
|
else if (!can_insert_semicolon()) unexpected();
|
|
};
|
|
|
|
function as() {
|
|
return slice(arguments);
|
|
};
|
|
|
|
function parenthesised() {
|
|
expect("(");
|
|
var ex = expression();
|
|
expect(")");
|
|
return ex;
|
|
};
|
|
|
|
function add_tokens(str, start, end) {
|
|
return str instanceof NodeWithToken ? str : new NodeWithToken(str, start, end);
|
|
};
|
|
|
|
function maybe_embed_tokens(parser) {
|
|
if (embed_tokens) return function() {
|
|
var start = S.token;
|
|
var ast = parser.apply(this, arguments);
|
|
ast[0] = add_tokens(ast[0], start, prev());
|
|
return ast;
|
|
};
|
|
else return parser;
|
|
};
|
|
|
|
var statement = maybe_embed_tokens(function() {
|
|
if (is("operator", "/")) {
|
|
S.peeked = null;
|
|
S.token = S.input(true); // force regexp
|
|
}
|
|
switch (S.token.type) {
|
|
case "num":
|
|
case "string":
|
|
case "regexp":
|
|
case "operator":
|
|
case "atom":
|
|
return simple_statement();
|
|
|
|
case "name":
|
|
return is_token(peek(), "punc", ":")
|
|
? labeled_statement(prog1(S.token.value, next, next))
|
|
: simple_statement();
|
|
|
|
case "punc":
|
|
switch (S.token.value) {
|
|
case "{":
|
|
return as("block", block_());
|
|
case "[":
|
|
case "(":
|
|
return simple_statement();
|
|
case ";":
|
|
next();
|
|
return as("block");
|
|
default:
|
|
unexpected();
|
|
}
|
|
|
|
case "keyword":
|
|
switch (prog1(S.token.value, next)) {
|
|
case "break":
|
|
return break_cont("break");
|
|
|
|
case "continue":
|
|
return break_cont("continue");
|
|
|
|
case "debugger":
|
|
semicolon();
|
|
return as("debugger");
|
|
|
|
case "do":
|
|
return (function(body){
|
|
expect_token("keyword", "while");
|
|
return as("do", prog1(parenthesised, semicolon), body);
|
|
})(in_loop(statement));
|
|
|
|
case "for":
|
|
return for_();
|
|
|
|
case "function":
|
|
return function_(true);
|
|
|
|
case "if":
|
|
return if_();
|
|
|
|
case "return":
|
|
if (S.in_function == 0)
|
|
croak("'return' outside of function");
|
|
return as("return",
|
|
is("punc", ";")
|
|
? (next(), null)
|
|
: can_insert_semicolon()
|
|
? null
|
|
: prog1(expression, semicolon));
|
|
|
|
case "switch":
|
|
return as("switch", parenthesised(), switch_block_());
|
|
|
|
case "throw":
|
|
return as("throw", prog1(expression, semicolon));
|
|
|
|
case "try":
|
|
return try_();
|
|
|
|
case "var":
|
|
return prog1(var_, semicolon);
|
|
|
|
case "const":
|
|
return prog1(const_, semicolon);
|
|
|
|
case "while":
|
|
return as("while", parenthesised(), in_loop(statement));
|
|
|
|
case "with":
|
|
return as("with", parenthesised(), statement());
|
|
|
|
default:
|
|
unexpected();
|
|
}
|
|
}
|
|
});
|
|
|
|
function labeled_statement(label) {
|
|
S.labels.push(label);
|
|
var start = S.token, stat = statement();
|
|
if (exigent_mode && !HOP(STATEMENTS_WITH_LABELS, stat[0]))
|
|
unexpected(start);
|
|
S.labels.pop();
|
|
return as("label", label, stat);
|
|
};
|
|
|
|
function simple_statement() {
|
|
return as("stat", prog1(expression, semicolon));
|
|
};
|
|
|
|
function break_cont(type) {
|
|
var name;
|
|
if (!can_insert_semicolon()) {
|
|
name = is("name") ? S.token.value : null;
|
|
}
|
|
if (name != null) {
|
|
next();
|
|
if (!member(name, S.labels))
|
|
croak("Label " + name + " without matching loop or statement");
|
|
}
|
|
else if (S.in_loop == 0)
|
|
croak(type + " not inside a loop or switch");
|
|
semicolon();
|
|
return as(type, name);
|
|
};
|
|
|
|
function for_() {
|
|
expect("(");
|
|
var init = null;
|
|
if (!is("punc", ";")) {
|
|
init = is("keyword", "var")
|
|
? (next(), var_(true))
|
|
: expression(true, true);
|
|
if (is("operator", "in"))
|
|
return for_in(init);
|
|
}
|
|
return regular_for(init);
|
|
};
|
|
|
|
function regular_for(init) {
|
|
expect(";");
|
|
var test = is("punc", ";") ? null : expression();
|
|
expect(";");
|
|
var step = is("punc", ")") ? null : expression();
|
|
expect(")");
|
|
return as("for", init, test, step, in_loop(statement));
|
|
};
|
|
|
|
function for_in(init) {
|
|
var lhs = init[0] == "var" ? as("name", init[1][0]) : init;
|
|
next();
|
|
var obj = expression();
|
|
expect(")");
|
|
return as("for-in", init, lhs, obj, in_loop(statement));
|
|
};
|
|
|
|
var function_ = maybe_embed_tokens(function(in_statement) {
|
|
var name = is("name") ? prog1(S.token.value, next) : null;
|
|
if (in_statement && !name)
|
|
unexpected();
|
|
expect("(");
|
|
return as(in_statement ? "defun" : "function",
|
|
name,
|
|
// arguments
|
|
(function(first, a){
|
|
while (!is("punc", ")")) {
|
|
if (first) first = false; else expect(",");
|
|
if (!is("name")) unexpected();
|
|
a.push(S.token.value);
|
|
next();
|
|
}
|
|
next();
|
|
return a;
|
|
})(true, []),
|
|
// body
|
|
(function(){
|
|
++S.in_function;
|
|
var loop = S.in_loop;
|
|
S.in_loop = 0;
|
|
var a = block_();
|
|
--S.in_function;
|
|
S.in_loop = loop;
|
|
return a;
|
|
})());
|
|
});
|
|
|
|
function if_() {
|
|
var cond = parenthesised(), body = statement(), belse;
|
|
if (is("keyword", "else")) {
|
|
next();
|
|
belse = statement();
|
|
}
|
|
return as("if", cond, body, belse);
|
|
};
|
|
|
|
function block_() {
|
|
expect("{");
|
|
var a = [];
|
|
while (!is("punc", "}")) {
|
|
if (is("eof")) unexpected();
|
|
a.push(statement());
|
|
}
|
|
next();
|
|
return a;
|
|
};
|
|
|
|
var switch_block_ = curry(in_loop, function(){
|
|
expect("{");
|
|
var a = [], cur = null;
|
|
while (!is("punc", "}")) {
|
|
if (is("eof")) unexpected();
|
|
if (is("keyword", "case")) {
|
|
next();
|
|
cur = [];
|
|
a.push([ expression(), cur ]);
|
|
expect(":");
|
|
}
|
|
else if (is("keyword", "default")) {
|
|
next();
|
|
expect(":");
|
|
cur = [];
|
|
a.push([ null, cur ]);
|
|
}
|
|
else {
|
|
if (!cur) unexpected();
|
|
cur.push(statement());
|
|
}
|
|
}
|
|
next();
|
|
return a;
|
|
});
|
|
|
|
function try_() {
|
|
var body = block_(), bcatch, bfinally;
|
|
if (is("keyword", "catch")) {
|
|
next();
|
|
expect("(");
|
|
if (!is("name"))
|
|
croak("Name expected");
|
|
var name = S.token.value;
|
|
next();
|
|
expect(")");
|
|
bcatch = [ name, block_() ];
|
|
}
|
|
if (is("keyword", "finally")) {
|
|
next();
|
|
bfinally = block_();
|
|
}
|
|
if (!bcatch && !bfinally)
|
|
croak("Missing catch/finally blocks");
|
|
return as("try", body, bcatch, bfinally);
|
|
};
|
|
|
|
function vardefs(no_in) {
|
|
var a = [];
|
|
for (;;) {
|
|
if (!is("name"))
|
|
unexpected();
|
|
var name = S.token.value;
|
|
next();
|
|
if (is("operator", "=")) {
|
|
next();
|
|
a.push([ name, expression(false, no_in) ]);
|
|
} else {
|
|
a.push([ name ]);
|
|
}
|
|
if (!is("punc", ","))
|
|
break;
|
|
next();
|
|
}
|
|
return a;
|
|
};
|
|
|
|
function var_(no_in) {
|
|
return as("var", vardefs(no_in));
|
|
};
|
|
|
|
function const_() {
|
|
return as("const", vardefs());
|
|
};
|
|
|
|
function new_() {
|
|
var newexp = expr_atom(false), args;
|
|
if (is("punc", "(")) {
|
|
next();
|
|
args = expr_list(")");
|
|
} else {
|
|
args = [];
|
|
}
|
|
return subscripts(as("new", newexp, args), true);
|
|
};
|
|
|
|
var expr_atom = maybe_embed_tokens(function(allow_calls) {
|
|
if (is("operator", "new")) {
|
|
next();
|
|
return new_();
|
|
}
|
|
if (is("operator") && HOP(UNARY_PREFIX, S.token.value)) {
|
|
return make_unary("unary-prefix",
|
|
prog1(S.token.value, next),
|
|
expr_atom(allow_calls));
|
|
}
|
|
if (is("punc")) {
|
|
switch (S.token.value) {
|
|
case "(":
|
|
next();
|
|
return subscripts(prog1(expression, curry(expect, ")")), allow_calls);
|
|
case "[":
|
|
next();
|
|
return subscripts(array_(), allow_calls);
|
|
case "{":
|
|
next();
|
|
return subscripts(object_(), allow_calls);
|
|
}
|
|
unexpected();
|
|
}
|
|
if (is("keyword", "function")) {
|
|
next();
|
|
return subscripts(function_(false), allow_calls);
|
|
}
|
|
if (HOP(ATOMIC_START_TOKEN, S.token.type)) {
|
|
var atom = S.token.type == "regexp"
|
|
? as("regexp", S.token.value[0], S.token.value[1])
|
|
: as(S.token.type, S.token.value);
|
|
return subscripts(prog1(atom, next), allow_calls);
|
|
}
|
|
unexpected();
|
|
});
|
|
|
|
function expr_list(closing, allow_trailing_comma, allow_empty) {
|
|
var first = true, a = [];
|
|
while (!is("punc", closing)) {
|
|
if (first) first = false; else expect(",");
|
|
if (allow_trailing_comma && is("punc", closing)) break;
|
|
if (is("punc", ",") && allow_empty) {
|
|
a.push([ "atom", "undefined" ]);
|
|
} else {
|
|
a.push(expression(false));
|
|
}
|
|
}
|
|
next();
|
|
return a;
|
|
};
|
|
|
|
function array_() {
|
|
return as("array", expr_list("]", !exigent_mode, true));
|
|
};
|
|
|
|
function object_() {
|
|
var first = true, a = [];
|
|
while (!is("punc", "}")) {
|
|
if (first) first = false; else expect(",");
|
|
if (!exigent_mode && is("punc", "}"))
|
|
// allow trailing comma
|
|
break;
|
|
var type = S.token.type;
|
|
var name = as_property_name();
|
|
if (type == "name" && (name == "get" || name == "set") && !is("punc", ":")) {
|
|
a.push([ as_name(), function_(false), name ]);
|
|
} else {
|
|
expect(":");
|
|
a.push([ name, expression(false) ]);
|
|
}
|
|
}
|
|
next();
|
|
return as("object", a);
|
|
};
|
|
|
|
function as_property_name() {
|
|
switch (S.token.type) {
|
|
case "num":
|
|
case "string":
|
|
return prog1(S.token.value, next);
|
|
}
|
|
return as_name();
|
|
};
|
|
|
|
function as_name() {
|
|
switch (S.token.type) {
|
|
case "name":
|
|
case "operator":
|
|
case "keyword":
|
|
case "atom":
|
|
return prog1(S.token.value, next);
|
|
default:
|
|
unexpected();
|
|
}
|
|
};
|
|
|
|
function subscripts(expr, allow_calls) {
|
|
if (is("punc", ".")) {
|
|
next();
|
|
return subscripts(as("dot", expr, as_name()), allow_calls);
|
|
}
|
|
if (is("punc", "[")) {
|
|
next();
|
|
return subscripts(as("sub", expr, prog1(expression, curry(expect, "]"))), allow_calls);
|
|
}
|
|
if (allow_calls && is("punc", "(")) {
|
|
next();
|
|
return subscripts(as("call", expr, expr_list(")")), true);
|
|
}
|
|
if (allow_calls && is("operator") && HOP(UNARY_POSTFIX, S.token.value)) {
|
|
return prog1(curry(make_unary, "unary-postfix", S.token.value, expr),
|
|
next);
|
|
}
|
|
return expr;
|
|
};
|
|
|
|
function make_unary(tag, op, expr) {
|
|
if ((op == "++" || op == "--") && !is_assignable(expr))
|
|
croak("Invalid use of " + op + " operator");
|
|
return as(tag, op, expr);
|
|
};
|
|
|
|
function expr_op(left, min_prec, no_in) {
|
|
var op = is("operator") ? S.token.value : null;
|
|
if (op && op == "in" && no_in) op = null;
|
|
var prec = op != null ? PRECEDENCE[op] : null;
|
|
if (prec != null && prec > min_prec) {
|
|
next();
|
|
var right = expr_op(expr_atom(true), prec, no_in);
|
|
return expr_op(as("binary", op, left, right), min_prec, no_in);
|
|
}
|
|
return left;
|
|
};
|
|
|
|
function expr_ops(no_in) {
|
|
return expr_op(expr_atom(true), 0, no_in);
|
|
};
|
|
|
|
function maybe_conditional(no_in) {
|
|
var expr = expr_ops(no_in);
|
|
if (is("operator", "?")) {
|
|
next();
|
|
var yes = expression(false);
|
|
expect(":");
|
|
return as("conditional", expr, yes, expression(false, no_in));
|
|
}
|
|
return expr;
|
|
};
|
|
|
|
function is_assignable(expr) {
|
|
if (!exigent_mode) return true;
|
|
switch (expr[0]) {
|
|
case "dot":
|
|
case "sub":
|
|
case "new":
|
|
case "call":
|
|
return true;
|
|
case "name":
|
|
return expr[1] != "this";
|
|
}
|
|
};
|
|
|
|
function maybe_assign(no_in) {
|
|
var left = maybe_conditional(no_in), val = S.token.value;
|
|
if (is("operator") && HOP(ASSIGNMENT, val)) {
|
|
if (is_assignable(left)) {
|
|
next();
|
|
return as("assign", ASSIGNMENT[val], left, maybe_assign(no_in));
|
|
}
|
|
croak("Invalid assignment");
|
|
}
|
|
return left;
|
|
};
|
|
|
|
var expression = maybe_embed_tokens(function(commas, no_in) {
|
|
if (arguments.length == 0)
|
|
commas = true;
|
|
var expr = maybe_assign(no_in);
|
|
if (commas && is("punc", ",")) {
|
|
next();
|
|
return as("seq", expr, expression(true, no_in));
|
|
}
|
|
return expr;
|
|
});
|
|
|
|
function in_loop(cont) {
|
|
try {
|
|
++S.in_loop;
|
|
return cont();
|
|
} finally {
|
|
--S.in_loop;
|
|
}
|
|
};
|
|
|
|
return as("toplevel", (function(a){
|
|
while (!is("eof"))
|
|
a.push(statement());
|
|
return a;
|
|
})([]));
|
|
|
|
};
|
|
|
|
/* -----[ Utilities ]----- */
|
|
|
|
function curry(f) {
|
|
var args = slice(arguments, 1);
|
|
return function() { return f.apply(this, args.concat(slice(arguments))); };
|
|
};
|
|
|
|
function prog1(ret) {
|
|
if (ret instanceof Function)
|
|
ret = ret();
|
|
for (var i = 1, n = arguments.length; --n > 0; ++i)
|
|
arguments[i]();
|
|
return ret;
|
|
};
|
|
|
|
function array_to_hash(a) {
|
|
var ret = {};
|
|
for (var i = 0; i < a.length; ++i)
|
|
ret[a[i]] = true;
|
|
return ret;
|
|
};
|
|
|
|
function slice(a, start) {
|
|
return Array.prototype.slice.call(a, start == null ? 0 : start);
|
|
};
|
|
|
|
function characters(str) {
|
|
return str.split("");
|
|
};
|
|
|
|
function member(name, array) {
|
|
for (var i = array.length; --i >= 0;)
|
|
if (array[i] === name)
|
|
return true;
|
|
return false;
|
|
};
|
|
|
|
function HOP(obj, prop) {
|
|
return Object.prototype.hasOwnProperty.call(obj, prop);
|
|
};
|
|
|
|
var warn = function() {};
|
|
|
|
/* -----[ Exports ]----- */
|
|
|
|
exports.tokenizer = tokenizer;
|
|
exports.parse = parse;
|
|
exports.slice = slice;
|
|
exports.curry = curry;
|
|
exports.member = member;
|
|
exports.array_to_hash = array_to_hash;
|
|
exports.PRECEDENCE = PRECEDENCE;
|
|
exports.KEYWORDS_ATOM = KEYWORDS_ATOM;
|
|
exports.RESERVED_WORDS = RESERVED_WORDS;
|
|
exports.KEYWORDS = KEYWORDS;
|
|
exports.ATOMIC_START_TOKEN = ATOMIC_START_TOKEN;
|
|
exports.OPERATORS = OPERATORS;
|
|
exports.is_alphanumeric_char = is_alphanumeric_char;
|
|
exports.set_logger = function(logger) {
|
|
warn = logger;
|
|
};
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/lib/parse-js.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/uglify-js/lib/process.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/uglify-js/lib";
|
|
var __filename = "/node_modules/burrito/node_modules/uglify-js/lib/process.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/uglify-js/lib");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/uglify-js/lib");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/lib/process.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
/***********************************************************************
|
|
|
|
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
|
|
This version is suitable for Node.js. With minimal changes (the
|
|
exports stuff) it should work on any JS platform.
|
|
|
|
This file implements some AST processors. They work on data built
|
|
by parse-js.
|
|
|
|
Exported functions:
|
|
|
|
- ast_mangle(ast, options) -- mangles the variable/function names
|
|
in the AST. Returns an AST.
|
|
|
|
- ast_squeeze(ast) -- employs various optimizations to make the
|
|
final generated code even smaller. Returns an AST.
|
|
|
|
- gen_code(ast, options) -- generates JS code from the AST. Pass
|
|
true (or an object, see the code for some options) as second
|
|
argument to get "pretty" (indented) code.
|
|
|
|
-------------------------------- (C) ---------------------------------
|
|
|
|
Author: Mihai Bazon
|
|
<mihai.bazon@gmail.com>
|
|
http://mihai.bazon.net/blog
|
|
|
|
Distributed under the BSD license:
|
|
|
|
Copyright 2010 (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.
|
|
|
|
***********************************************************************/
|
|
|
|
var jsp = require("./parse-js"),
|
|
slice = jsp.slice,
|
|
member = jsp.member,
|
|
PRECEDENCE = jsp.PRECEDENCE,
|
|
OPERATORS = jsp.OPERATORS;
|
|
|
|
/* -----[ helper for AST traversal ]----- */
|
|
|
|
function ast_walker(ast) {
|
|
function _vardefs(defs) {
|
|
return [ this[0], MAP(defs, function(def){
|
|
var a = [ def[0] ];
|
|
if (def.length > 1)
|
|
a[1] = walk(def[1]);
|
|
return a;
|
|
}) ];
|
|
};
|
|
function _block(statements) {
|
|
var out = [ this[0] ];
|
|
if (statements != null)
|
|
out.push(MAP(statements, walk));
|
|
return out;
|
|
};
|
|
var walkers = {
|
|
"string": function(str) {
|
|
return [ this[0], str ];
|
|
},
|
|
"num": function(num) {
|
|
return [ this[0], num ];
|
|
},
|
|
"name": function(name) {
|
|
return [ this[0], name ];
|
|
},
|
|
"toplevel": function(statements) {
|
|
return [ this[0], MAP(statements, walk) ];
|
|
},
|
|
"block": _block,
|
|
"splice": _block,
|
|
"var": _vardefs,
|
|
"const": _vardefs,
|
|
"try": function(t, c, f) {
|
|
return [
|
|
this[0],
|
|
MAP(t, walk),
|
|
c != null ? [ c[0], MAP(c[1], walk) ] : null,
|
|
f != null ? MAP(f, walk) : null
|
|
];
|
|
},
|
|
"throw": function(expr) {
|
|
return [ this[0], walk(expr) ];
|
|
},
|
|
"new": function(ctor, args) {
|
|
return [ this[0], walk(ctor), MAP(args, walk) ];
|
|
},
|
|
"switch": function(expr, body) {
|
|
return [ this[0], walk(expr), MAP(body, function(branch){
|
|
return [ branch[0] ? walk(branch[0]) : null,
|
|
MAP(branch[1], walk) ];
|
|
}) ];
|
|
},
|
|
"break": function(label) {
|
|
return [ this[0], label ];
|
|
},
|
|
"continue": function(label) {
|
|
return [ this[0], label ];
|
|
},
|
|
"conditional": function(cond, t, e) {
|
|
return [ this[0], walk(cond), walk(t), walk(e) ];
|
|
},
|
|
"assign": function(op, lvalue, rvalue) {
|
|
return [ this[0], op, walk(lvalue), walk(rvalue) ];
|
|
},
|
|
"dot": function(expr) {
|
|
return [ this[0], walk(expr) ].concat(slice(arguments, 1));
|
|
},
|
|
"call": function(expr, args) {
|
|
return [ this[0], walk(expr), MAP(args, walk) ];
|
|
},
|
|
"function": function(name, args, body) {
|
|
return [ this[0], name, args.slice(), MAP(body, walk) ];
|
|
},
|
|
"defun": function(name, args, body) {
|
|
return [ this[0], name, args.slice(), MAP(body, walk) ];
|
|
},
|
|
"if": function(conditional, t, e) {
|
|
return [ this[0], walk(conditional), walk(t), walk(e) ];
|
|
},
|
|
"for": function(init, cond, step, block) {
|
|
return [ this[0], walk(init), walk(cond), walk(step), walk(block) ];
|
|
},
|
|
"for-in": function(vvar, key, hash, block) {
|
|
return [ this[0], walk(vvar), walk(key), walk(hash), walk(block) ];
|
|
},
|
|
"while": function(cond, block) {
|
|
return [ this[0], walk(cond), walk(block) ];
|
|
},
|
|
"do": function(cond, block) {
|
|
return [ this[0], walk(cond), walk(block) ];
|
|
},
|
|
"return": function(expr) {
|
|
return [ this[0], walk(expr) ];
|
|
},
|
|
"binary": function(op, left, right) {
|
|
return [ this[0], op, walk(left), walk(right) ];
|
|
},
|
|
"unary-prefix": function(op, expr) {
|
|
return [ this[0], op, walk(expr) ];
|
|
},
|
|
"unary-postfix": function(op, expr) {
|
|
return [ this[0], op, walk(expr) ];
|
|
},
|
|
"sub": function(expr, subscript) {
|
|
return [ this[0], walk(expr), walk(subscript) ];
|
|
},
|
|
"object": function(props) {
|
|
return [ this[0], MAP(props, function(p){
|
|
return p.length == 2
|
|
? [ p[0], walk(p[1]) ]
|
|
: [ p[0], walk(p[1]), p[2] ]; // get/set-ter
|
|
}) ];
|
|
},
|
|
"regexp": function(rx, mods) {
|
|
return [ this[0], rx, mods ];
|
|
},
|
|
"array": function(elements) {
|
|
return [ this[0], MAP(elements, walk) ];
|
|
},
|
|
"stat": function(stat) {
|
|
return [ this[0], walk(stat) ];
|
|
},
|
|
"seq": function() {
|
|
return [ this[0] ].concat(MAP(slice(arguments), walk));
|
|
},
|
|
"label": function(name, block) {
|
|
return [ this[0], name, walk(block) ];
|
|
},
|
|
"with": function(expr, block) {
|
|
return [ this[0], walk(expr), walk(block) ];
|
|
},
|
|
"atom": function(name) {
|
|
return [ this[0], name ];
|
|
}
|
|
};
|
|
|
|
var user = {};
|
|
var stack = [];
|
|
function walk(ast) {
|
|
if (ast == null)
|
|
return null;
|
|
try {
|
|
stack.push(ast);
|
|
var type = ast[0];
|
|
var gen = user[type];
|
|
if (gen) {
|
|
var ret = gen.apply(ast, ast.slice(1));
|
|
if (ret != null)
|
|
return ret;
|
|
}
|
|
gen = walkers[type];
|
|
return gen.apply(ast, ast.slice(1));
|
|
} finally {
|
|
stack.pop();
|
|
}
|
|
};
|
|
|
|
function with_walkers(walkers, cont){
|
|
var save = {}, i;
|
|
for (i in walkers) if (HOP(walkers, i)) {
|
|
save[i] = user[i];
|
|
user[i] = walkers[i];
|
|
}
|
|
var ret = cont();
|
|
for (i in save) if (HOP(save, i)) {
|
|
if (!save[i]) delete user[i];
|
|
else user[i] = save[i];
|
|
}
|
|
return ret;
|
|
};
|
|
|
|
return {
|
|
walk: walk,
|
|
with_walkers: with_walkers,
|
|
parent: function() {
|
|
return stack[stack.length - 2]; // last one is current node
|
|
},
|
|
stack: function() {
|
|
return stack;
|
|
}
|
|
};
|
|
};
|
|
|
|
/* -----[ Scope and mangling ]----- */
|
|
|
|
function Scope(parent) {
|
|
this.names = {}; // names defined in this scope
|
|
this.mangled = {}; // mangled names (orig.name => mangled)
|
|
this.rev_mangled = {}; // reverse lookup (mangled => orig.name)
|
|
this.cname = -1; // current mangled name
|
|
this.refs = {}; // names referenced from this scope
|
|
this.uses_with = false; // will become TRUE if with() is detected in this or any subscopes
|
|
this.uses_eval = false; // will become TRUE if eval() is detected in this or any subscopes
|
|
this.parent = parent; // parent scope
|
|
this.children = []; // sub-scopes
|
|
if (parent) {
|
|
this.level = parent.level + 1;
|
|
parent.children.push(this);
|
|
} else {
|
|
this.level = 0;
|
|
}
|
|
};
|
|
|
|
var base54 = (function(){
|
|
var DIGITS = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_";
|
|
return function(num) {
|
|
var ret = "";
|
|
do {
|
|
ret = DIGITS.charAt(num % 54) + ret;
|
|
num = Math.floor(num / 54);
|
|
} while (num > 0);
|
|
return ret;
|
|
};
|
|
})();
|
|
|
|
Scope.prototype = {
|
|
has: function(name) {
|
|
for (var s = this; s; s = s.parent)
|
|
if (HOP(s.names, name))
|
|
return s;
|
|
},
|
|
has_mangled: function(mname) {
|
|
for (var s = this; s; s = s.parent)
|
|
if (HOP(s.rev_mangled, mname))
|
|
return s;
|
|
},
|
|
toJSON: function() {
|
|
return {
|
|
names: this.names,
|
|
uses_eval: this.uses_eval,
|
|
uses_with: this.uses_with
|
|
};
|
|
},
|
|
|
|
next_mangled: function() {
|
|
// we must be careful that the new mangled name:
|
|
//
|
|
// 1. doesn't shadow a mangled name from a parent
|
|
// scope, unless we don't reference the original
|
|
// name from this scope OR from any sub-scopes!
|
|
// This will get slow.
|
|
//
|
|
// 2. doesn't shadow an original name from a parent
|
|
// scope, in the event that the name is not mangled
|
|
// in the parent scope and we reference that name
|
|
// here OR IN ANY SUBSCOPES!
|
|
//
|
|
// 3. doesn't shadow a name that is referenced but not
|
|
// defined (possibly global defined elsewhere).
|
|
for (;;) {
|
|
var m = base54(++this.cname), prior;
|
|
|
|
// case 1.
|
|
prior = this.has_mangled(m);
|
|
if (prior && this.refs[prior.rev_mangled[m]] === prior)
|
|
continue;
|
|
|
|
// case 2.
|
|
prior = this.has(m);
|
|
if (prior && prior !== this && this.refs[m] === prior && !prior.has_mangled(m))
|
|
continue;
|
|
|
|
// case 3.
|
|
if (HOP(this.refs, m) && this.refs[m] == null)
|
|
continue;
|
|
|
|
// I got "do" once. :-/
|
|
if (!is_identifier(m))
|
|
continue;
|
|
|
|
return m;
|
|
}
|
|
},
|
|
set_mangle: function(name, m) {
|
|
this.rev_mangled[m] = name;
|
|
return this.mangled[name] = m;
|
|
},
|
|
get_mangled: function(name, newMangle) {
|
|
if (this.uses_eval || this.uses_with) return name; // no mangle if eval or with is in use
|
|
var s = this.has(name);
|
|
if (!s) return name; // not in visible scope, no mangle
|
|
if (HOP(s.mangled, name)) return s.mangled[name]; // already mangled in this scope
|
|
if (!newMangle) return name; // not found and no mangling requested
|
|
return s.set_mangle(name, s.next_mangled());
|
|
},
|
|
define: function(name) {
|
|
if (name != null)
|
|
return this.names[name] = name;
|
|
}
|
|
};
|
|
|
|
function ast_add_scope(ast) {
|
|
|
|
var current_scope = null;
|
|
var w = ast_walker(), walk = w.walk;
|
|
var having_eval = [];
|
|
|
|
function with_new_scope(cont) {
|
|
current_scope = new Scope(current_scope);
|
|
var ret = current_scope.body = cont();
|
|
ret.scope = current_scope;
|
|
current_scope = current_scope.parent;
|
|
return ret;
|
|
};
|
|
|
|
function define(name) {
|
|
return current_scope.define(name);
|
|
};
|
|
|
|
function reference(name) {
|
|
current_scope.refs[name] = true;
|
|
};
|
|
|
|
function _lambda(name, args, body) {
|
|
var is_defun = this[0] == "defun";
|
|
return [ this[0], is_defun ? define(name) : name, args, with_new_scope(function(){
|
|
if (!is_defun) define(name);
|
|
MAP(args, define);
|
|
return MAP(body, walk);
|
|
})];
|
|
};
|
|
|
|
return with_new_scope(function(){
|
|
// process AST
|
|
var ret = w.with_walkers({
|
|
"function": _lambda,
|
|
"defun": _lambda,
|
|
"with": function(expr, block) {
|
|
for (var s = current_scope; s; s = s.parent)
|
|
s.uses_with = true;
|
|
},
|
|
"var": function(defs) {
|
|
MAP(defs, function(d){ define(d[0]) });
|
|
},
|
|
"const": function(defs) {
|
|
MAP(defs, function(d){ define(d[0]) });
|
|
},
|
|
"try": function(t, c, f) {
|
|
if (c != null) return [
|
|
this[0],
|
|
MAP(t, walk),
|
|
[ define(c[0]), MAP(c[1], walk) ],
|
|
f != null ? MAP(f, walk) : null
|
|
];
|
|
},
|
|
"name": function(name) {
|
|
if (name == "eval")
|
|
having_eval.push(current_scope);
|
|
reference(name);
|
|
}
|
|
}, function(){
|
|
return walk(ast);
|
|
});
|
|
|
|
// the reason why we need an additional pass here is
|
|
// that names can be used prior to their definition.
|
|
|
|
// scopes where eval was detected and their parents
|
|
// are marked with uses_eval, unless they define the
|
|
// "eval" name.
|
|
MAP(having_eval, function(scope){
|
|
if (!scope.has("eval")) while (scope) {
|
|
scope.uses_eval = true;
|
|
scope = scope.parent;
|
|
}
|
|
});
|
|
|
|
// for referenced names it might be useful to know
|
|
// their origin scope. current_scope here is the
|
|
// toplevel one.
|
|
function fixrefs(scope, i) {
|
|
// do children first; order shouldn't matter
|
|
for (i = scope.children.length; --i >= 0;)
|
|
fixrefs(scope.children[i]);
|
|
for (i in scope.refs) if (HOP(scope.refs, i)) {
|
|
// find origin scope and propagate the reference to origin
|
|
for (var origin = scope.has(i), s = scope; s; s = s.parent) {
|
|
s.refs[i] = origin;
|
|
if (s === origin) break;
|
|
}
|
|
}
|
|
};
|
|
fixrefs(current_scope);
|
|
|
|
return ret;
|
|
});
|
|
|
|
};
|
|
|
|
/* -----[ mangle names ]----- */
|
|
|
|
function ast_mangle(ast, options) {
|
|
var w = ast_walker(), walk = w.walk, scope;
|
|
options = options || {};
|
|
|
|
function get_mangled(name, newMangle) {
|
|
if (!options.toplevel && !scope.parent) return name; // don't mangle toplevel
|
|
if (options.except && member(name, options.except))
|
|
return name;
|
|
return scope.get_mangled(name, newMangle);
|
|
};
|
|
|
|
function get_define(name) {
|
|
if (options.defines) {
|
|
// we always lookup a defined symbol for the current scope FIRST, so declared
|
|
// vars trump a DEFINE symbol, but if no such var is found, then match a DEFINE value
|
|
if (!scope.has(name)) {
|
|
if (HOP(options.defines, name)) {
|
|
return options.defines[name];
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
};
|
|
|
|
function _lambda(name, args, body) {
|
|
var is_defun = this[0] == "defun", extra;
|
|
if (name) {
|
|
if (is_defun) name = get_mangled(name);
|
|
else {
|
|
extra = {};
|
|
name = extra[name] = scope.next_mangled();
|
|
}
|
|
}
|
|
body = with_scope(body.scope, function(){
|
|
args = MAP(args, function(name){ return get_mangled(name) });
|
|
return MAP(body, walk);
|
|
}, extra);
|
|
return [ this[0], name, args, body ];
|
|
};
|
|
|
|
function with_scope(s, cont, extra) {
|
|
var _scope = scope;
|
|
scope = s;
|
|
if (extra) for (var i in extra) if (HOP(extra, i)) {
|
|
s.set_mangle(i, extra[i]);
|
|
}
|
|
for (var i in s.names) if (HOP(s.names, i)) {
|
|
get_mangled(i, true);
|
|
}
|
|
var ret = cont();
|
|
ret.scope = s;
|
|
scope = _scope;
|
|
return ret;
|
|
};
|
|
|
|
function _vardefs(defs) {
|
|
return [ this[0], MAP(defs, function(d){
|
|
return [ get_mangled(d[0]), walk(d[1]) ];
|
|
}) ];
|
|
};
|
|
|
|
return w.with_walkers({
|
|
"function": _lambda,
|
|
"defun": function() {
|
|
// move function declarations to the top when
|
|
// they are not in some block.
|
|
var ast = _lambda.apply(this, arguments);
|
|
switch (w.parent()[0]) {
|
|
case "toplevel":
|
|
case "function":
|
|
case "defun":
|
|
return MAP.at_top(ast);
|
|
}
|
|
return ast;
|
|
},
|
|
"var": _vardefs,
|
|
"const": _vardefs,
|
|
"name": function(name) {
|
|
return get_define(name) || [ this[0], get_mangled(name) ];
|
|
},
|
|
"try": function(t, c, f) {
|
|
return [ this[0],
|
|
MAP(t, walk),
|
|
c != null ? [ get_mangled(c[0]), MAP(c[1], walk) ] : null,
|
|
f != null ? MAP(f, walk) : null ];
|
|
},
|
|
"toplevel": function(body) {
|
|
var self = this;
|
|
return with_scope(self.scope, function(){
|
|
return [ self[0], MAP(body, walk) ];
|
|
});
|
|
}
|
|
}, function() {
|
|
return walk(ast_add_scope(ast));
|
|
});
|
|
};
|
|
|
|
/* -----[
|
|
- compress foo["bar"] into foo.bar,
|
|
- remove block brackets {} where possible
|
|
- join consecutive var declarations
|
|
- various optimizations for IFs:
|
|
- if (cond) foo(); else bar(); ==> cond?foo():bar();
|
|
- if (cond) foo(); ==> cond&&foo();
|
|
- if (foo) return bar(); else return baz(); ==> return foo?bar():baz(); // also for throw
|
|
- if (foo) return bar(); else something(); ==> {if(foo)return bar();something()}
|
|
]----- */
|
|
|
|
var warn = function(){};
|
|
|
|
function best_of(ast1, ast2) {
|
|
return gen_code(ast1).length > gen_code(ast2[0] == "stat" ? ast2[1] : ast2).length ? ast2 : ast1;
|
|
};
|
|
|
|
function last_stat(b) {
|
|
if (b[0] == "block" && b[1] && b[1].length > 0)
|
|
return b[1][b[1].length - 1];
|
|
return b;
|
|
}
|
|
|
|
function aborts(t) {
|
|
if (t) {
|
|
t = last_stat(t);
|
|
if (t[0] == "return" || t[0] == "break" || t[0] == "continue" || t[0] == "throw")
|
|
return true;
|
|
}
|
|
};
|
|
|
|
function boolean_expr(expr) {
|
|
return ( (expr[0] == "unary-prefix"
|
|
&& member(expr[1], [ "!", "delete" ])) ||
|
|
|
|
(expr[0] == "binary"
|
|
&& member(expr[1], [ "in", "instanceof", "==", "!=", "===", "!==", "<", "<=", ">=", ">" ])) ||
|
|
|
|
(expr[0] == "binary"
|
|
&& member(expr[1], [ "&&", "||" ])
|
|
&& boolean_expr(expr[2])
|
|
&& boolean_expr(expr[3])) ||
|
|
|
|
(expr[0] == "conditional"
|
|
&& boolean_expr(expr[2])
|
|
&& boolean_expr(expr[3])) ||
|
|
|
|
(expr[0] == "assign"
|
|
&& expr[1] === true
|
|
&& boolean_expr(expr[3])) ||
|
|
|
|
(expr[0] == "seq"
|
|
&& boolean_expr(expr[expr.length - 1]))
|
|
);
|
|
};
|
|
|
|
function make_conditional(c, t, e) {
|
|
var make_real_conditional = function() {
|
|
if (c[0] == "unary-prefix" && c[1] == "!") {
|
|
return e ? [ "conditional", c[2], e, t ] : [ "binary", "||", c[2], t ];
|
|
} else {
|
|
return e ? [ "conditional", c, t, e ] : [ "binary", "&&", c, t ];
|
|
}
|
|
};
|
|
// shortcut the conditional if the expression has a constant value
|
|
return when_constant(c, function(ast, val){
|
|
warn_unreachable(val ? e : t);
|
|
return (val ? t : e);
|
|
}, make_real_conditional);
|
|
};
|
|
|
|
function empty(b) {
|
|
return !b || (b[0] == "block" && (!b[1] || b[1].length == 0));
|
|
};
|
|
|
|
function is_string(node) {
|
|
return (node[0] == "string" ||
|
|
node[0] == "unary-prefix" && node[1] == "typeof" ||
|
|
node[0] == "binary" && node[1] == "+" &&
|
|
(is_string(node[2]) || is_string(node[3])));
|
|
};
|
|
|
|
var when_constant = (function(){
|
|
|
|
var $NOT_CONSTANT = {};
|
|
|
|
// this can only evaluate constant expressions. If it finds anything
|
|
// not constant, it throws $NOT_CONSTANT.
|
|
function evaluate(expr) {
|
|
switch (expr[0]) {
|
|
case "string":
|
|
case "num":
|
|
return expr[1];
|
|
case "name":
|
|
case "atom":
|
|
switch (expr[1]) {
|
|
case "true": return true;
|
|
case "false": return false;
|
|
}
|
|
break;
|
|
case "unary-prefix":
|
|
switch (expr[1]) {
|
|
case "!": return !evaluate(expr[2]);
|
|
case "typeof": return typeof evaluate(expr[2]);
|
|
case "~": return ~evaluate(expr[2]);
|
|
case "-": return -evaluate(expr[2]);
|
|
case "+": return +evaluate(expr[2]);
|
|
}
|
|
break;
|
|
case "binary":
|
|
var left = expr[2], right = expr[3];
|
|
switch (expr[1]) {
|
|
case "&&" : return evaluate(left) && evaluate(right);
|
|
case "||" : return evaluate(left) || evaluate(right);
|
|
case "|" : return evaluate(left) | evaluate(right);
|
|
case "&" : return evaluate(left) & evaluate(right);
|
|
case "^" : return evaluate(left) ^ evaluate(right);
|
|
case "+" : return evaluate(left) + evaluate(right);
|
|
case "*" : return evaluate(left) * evaluate(right);
|
|
case "/" : return evaluate(left) / evaluate(right);
|
|
case "-" : return evaluate(left) - evaluate(right);
|
|
case "<<" : return evaluate(left) << evaluate(right);
|
|
case ">>" : return evaluate(left) >> evaluate(right);
|
|
case ">>>" : return evaluate(left) >>> evaluate(right);
|
|
case "==" : return evaluate(left) == evaluate(right);
|
|
case "===" : return evaluate(left) === evaluate(right);
|
|
case "!=" : return evaluate(left) != evaluate(right);
|
|
case "!==" : return evaluate(left) !== evaluate(right);
|
|
case "<" : return evaluate(left) < evaluate(right);
|
|
case "<=" : return evaluate(left) <= evaluate(right);
|
|
case ">" : return evaluate(left) > evaluate(right);
|
|
case ">=" : return evaluate(left) >= evaluate(right);
|
|
case "in" : return evaluate(left) in evaluate(right);
|
|
case "instanceof" : return evaluate(left) instanceof evaluate(right);
|
|
}
|
|
}
|
|
throw $NOT_CONSTANT;
|
|
};
|
|
|
|
return function(expr, yes, no) {
|
|
try {
|
|
var val = evaluate(expr), ast;
|
|
switch (typeof val) {
|
|
case "string": ast = [ "string", val ]; break;
|
|
case "number": ast = [ "num", val ]; break;
|
|
case "boolean": ast = [ "name", String(val) ]; break;
|
|
default: throw new Error("Can't handle constant of type: " + (typeof val));
|
|
}
|
|
return yes.call(expr, ast, val);
|
|
} catch(ex) {
|
|
if (ex === $NOT_CONSTANT) {
|
|
if (expr[0] == "binary"
|
|
&& (expr[1] == "===" || expr[1] == "!==")
|
|
&& ((is_string(expr[2]) && is_string(expr[3]))
|
|
|| (boolean_expr(expr[2]) && boolean_expr(expr[3])))) {
|
|
expr[1] = expr[1].substr(0, 2);
|
|
}
|
|
else if (no && expr[0] == "binary"
|
|
&& (expr[1] == "||" || expr[1] == "&&")) {
|
|
// the whole expression is not constant but the lval may be...
|
|
try {
|
|
var lval = evaluate(expr[2]);
|
|
expr = ((expr[1] == "&&" && (lval ? expr[3] : lval)) ||
|
|
(expr[1] == "||" && (lval ? lval : expr[3])) ||
|
|
expr);
|
|
} catch(ex2) {
|
|
// IGNORE... lval is not constant
|
|
}
|
|
}
|
|
return no ? no.call(expr, expr) : null;
|
|
}
|
|
else throw ex;
|
|
}
|
|
};
|
|
|
|
})();
|
|
|
|
function warn_unreachable(ast) {
|
|
if (!empty(ast))
|
|
warn("Dropping unreachable code: " + gen_code(ast, true));
|
|
};
|
|
|
|
function prepare_ifs(ast) {
|
|
var w = ast_walker(), walk = w.walk;
|
|
// In this first pass, we rewrite ifs which abort with no else with an
|
|
// if-else. For example:
|
|
//
|
|
// if (x) {
|
|
// blah();
|
|
// return y;
|
|
// }
|
|
// foobar();
|
|
//
|
|
// is rewritten into:
|
|
//
|
|
// if (x) {
|
|
// blah();
|
|
// return y;
|
|
// } else {
|
|
// foobar();
|
|
// }
|
|
function redo_if(statements) {
|
|
statements = MAP(statements, walk);
|
|
|
|
for (var i = 0; i < statements.length; ++i) {
|
|
var fi = statements[i];
|
|
if (fi[0] != "if") continue;
|
|
|
|
if (fi[3] && walk(fi[3])) continue;
|
|
|
|
var t = walk(fi[2]);
|
|
if (!aborts(t)) continue;
|
|
|
|
var conditional = walk(fi[1]);
|
|
|
|
var e_body = statements.slice(i + 1);
|
|
var e;
|
|
if (e_body.length == 1) e = e_body[0];
|
|
else e = [ "block", e_body ];
|
|
|
|
var ret = statements.slice(0, i).concat([ [
|
|
fi[0], // "if"
|
|
conditional, // conditional
|
|
t, // then
|
|
e // else
|
|
] ]);
|
|
|
|
return redo_if(ret);
|
|
}
|
|
|
|
return statements;
|
|
};
|
|
|
|
function redo_if_lambda(name, args, body) {
|
|
body = redo_if(body);
|
|
return [ this[0], name, args.slice(), body ];
|
|
};
|
|
|
|
function redo_if_block(statements) {
|
|
var out = [ this[0] ];
|
|
if (statements != null)
|
|
out.push(redo_if(statements));
|
|
return out;
|
|
};
|
|
|
|
return w.with_walkers({
|
|
"defun": redo_if_lambda,
|
|
"function": redo_if_lambda,
|
|
"block": redo_if_block,
|
|
"splice": redo_if_block,
|
|
"toplevel": function(statements) {
|
|
return [ this[0], redo_if(statements) ];
|
|
},
|
|
"try": function(t, c, f) {
|
|
return [
|
|
this[0],
|
|
redo_if(t),
|
|
c != null ? [ c[0], redo_if(c[1]) ] : null,
|
|
f != null ? redo_if(f) : null
|
|
];
|
|
},
|
|
"with": function(expr, block) {
|
|
return [ this[0], walk(expr), redo_if(block) ];
|
|
}
|
|
}, function() {
|
|
return walk(ast);
|
|
});
|
|
};
|
|
|
|
function ast_squeeze(ast, options) {
|
|
options = defaults(options, {
|
|
make_seqs : true,
|
|
dead_code : true,
|
|
keep_comps : true,
|
|
no_warnings : false
|
|
});
|
|
|
|
var w = ast_walker(), walk = w.walk, scope;
|
|
|
|
function negate(c) {
|
|
var not_c = [ "unary-prefix", "!", c ];
|
|
switch (c[0]) {
|
|
case "unary-prefix":
|
|
return c[1] == "!" && boolean_expr(c[2]) ? c[2] : not_c;
|
|
case "seq":
|
|
c = slice(c);
|
|
c[c.length - 1] = negate(c[c.length - 1]);
|
|
return c;
|
|
case "conditional":
|
|
return best_of(not_c, [ "conditional", c[1], negate(c[2]), negate(c[3]) ]);
|
|
case "binary":
|
|
var op = c[1], left = c[2], right = c[3];
|
|
if (!options.keep_comps) switch (op) {
|
|
case "<=" : return [ "binary", ">", left, right ];
|
|
case "<" : return [ "binary", ">=", left, right ];
|
|
case ">=" : return [ "binary", "<", left, right ];
|
|
case ">" : return [ "binary", "<=", left, right ];
|
|
}
|
|
switch (op) {
|
|
case "==" : return [ "binary", "!=", left, right ];
|
|
case "!=" : return [ "binary", "==", left, right ];
|
|
case "===" : return [ "binary", "!==", left, right ];
|
|
case "!==" : return [ "binary", "===", left, right ];
|
|
case "&&" : return best_of(not_c, [ "binary", "||", negate(left), negate(right) ]);
|
|
case "||" : return best_of(not_c, [ "binary", "&&", negate(left), negate(right) ]);
|
|
}
|
|
break;
|
|
}
|
|
return not_c;
|
|
};
|
|
|
|
function with_scope(s, cont) {
|
|
var _scope = scope;
|
|
scope = s;
|
|
var ret = cont();
|
|
ret.scope = s;
|
|
scope = _scope;
|
|
return ret;
|
|
};
|
|
|
|
function rmblock(block) {
|
|
if (block != null && block[0] == "block" && block[1]) {
|
|
if (block[1].length == 1)
|
|
block = block[1][0];
|
|
else if (block[1].length == 0)
|
|
block = [ "block" ];
|
|
}
|
|
return block;
|
|
};
|
|
|
|
function _lambda(name, args, body) {
|
|
var is_defun = this[0] == "defun";
|
|
body = with_scope(body.scope, function(){
|
|
var ret = tighten(MAP(body, walk), "lambda");
|
|
if (!is_defun && name && !HOP(scope.refs, name))
|
|
name = null;
|
|
return ret;
|
|
});
|
|
return [ this[0], name, args, body ];
|
|
};
|
|
|
|
// we get here for blocks that have been already transformed.
|
|
// this function does a few things:
|
|
// 1. discard useless blocks
|
|
// 2. join consecutive var declarations
|
|
// 3. remove obviously dead code
|
|
// 4. transform consecutive statements using the comma operator
|
|
// 5. if block_type == "lambda" and it detects constructs like if(foo) return ... - rewrite like if (!foo) { ... }
|
|
function tighten(statements, block_type) {
|
|
statements = statements.reduce(function(a, stat){
|
|
if (stat[0] == "block") {
|
|
if (stat[1]) {
|
|
a.push.apply(a, stat[1]);
|
|
}
|
|
} else {
|
|
a.push(stat);
|
|
}
|
|
return a;
|
|
}, []);
|
|
|
|
statements = (function(a, prev){
|
|
statements.forEach(function(cur){
|
|
if (prev && ((cur[0] == "var" && prev[0] == "var") ||
|
|
(cur[0] == "const" && prev[0] == "const"))) {
|
|
prev[1] = prev[1].concat(cur[1]);
|
|
} else {
|
|
a.push(cur);
|
|
prev = cur;
|
|
}
|
|
});
|
|
return a;
|
|
})([]);
|
|
|
|
if (options.dead_code) statements = (function(a, has_quit){
|
|
statements.forEach(function(st){
|
|
if (has_quit) {
|
|
if (member(st[0], [ "function", "defun" , "var", "const" ])) {
|
|
a.push(st);
|
|
}
|
|
else if (!options.no_warnings)
|
|
warn_unreachable(st);
|
|
}
|
|
else {
|
|
a.push(st);
|
|
if (member(st[0], [ "return", "throw", "break", "continue" ]))
|
|
has_quit = true;
|
|
}
|
|
});
|
|
return a;
|
|
})([]);
|
|
|
|
if (options.make_seqs) statements = (function(a, prev) {
|
|
statements.forEach(function(cur){
|
|
if (prev && prev[0] == "stat" && cur[0] == "stat") {
|
|
prev[1] = [ "seq", prev[1], cur[1] ];
|
|
} else {
|
|
a.push(cur);
|
|
prev = cur;
|
|
}
|
|
});
|
|
return a;
|
|
})([]);
|
|
|
|
if (block_type == "lambda") statements = (function(i, a, stat){
|
|
while (i < statements.length) {
|
|
stat = statements[i++];
|
|
if (stat[0] == "if" && !stat[3]) {
|
|
if (stat[2][0] == "return" && stat[2][1] == null) {
|
|
a.push(make_if(negate(stat[1]), [ "block", statements.slice(i) ]));
|
|
break;
|
|
}
|
|
var last = last_stat(stat[2]);
|
|
if (last[0] == "return" && last[1] == null) {
|
|
a.push(make_if(stat[1], [ "block", stat[2][1].slice(0, -1) ], [ "block", statements.slice(i) ]));
|
|
break;
|
|
}
|
|
}
|
|
a.push(stat);
|
|
}
|
|
return a;
|
|
})(0, []);
|
|
|
|
return statements;
|
|
};
|
|
|
|
function make_if(c, t, e) {
|
|
return when_constant(c, function(ast, val){
|
|
if (val) {
|
|
warn_unreachable(e);
|
|
return t;
|
|
} else {
|
|
warn_unreachable(t);
|
|
return e;
|
|
}
|
|
}, function() {
|
|
return make_real_if(c, t, e);
|
|
});
|
|
};
|
|
|
|
function make_real_if(c, t, e) {
|
|
c = walk(c);
|
|
t = walk(t);
|
|
e = walk(e);
|
|
|
|
if (empty(t)) {
|
|
c = negate(c);
|
|
t = e;
|
|
e = null;
|
|
} else if (empty(e)) {
|
|
e = null;
|
|
} else {
|
|
// if we have both else and then, maybe it makes sense to switch them?
|
|
(function(){
|
|
var a = gen_code(c);
|
|
var n = negate(c);
|
|
var b = gen_code(n);
|
|
if (b.length < a.length) {
|
|
var tmp = t;
|
|
t = e;
|
|
e = tmp;
|
|
c = n;
|
|
}
|
|
})();
|
|
}
|
|
if (empty(e) && empty(t))
|
|
return [ "stat", c ];
|
|
var ret = [ "if", c, t, e ];
|
|
if (t[0] == "if" && empty(t[3]) && empty(e)) {
|
|
ret = best_of(ret, walk([ "if", [ "binary", "&&", c, t[1] ], t[2] ]));
|
|
}
|
|
else if (t[0] == "stat") {
|
|
if (e) {
|
|
if (e[0] == "stat") {
|
|
ret = best_of(ret, [ "stat", make_conditional(c, t[1], e[1]) ]);
|
|
}
|
|
}
|
|
else {
|
|
ret = best_of(ret, [ "stat", make_conditional(c, t[1]) ]);
|
|
}
|
|
}
|
|
else if (e && t[0] == e[0] && (t[0] == "return" || t[0] == "throw") && t[1] && e[1]) {
|
|
ret = best_of(ret, [ t[0], make_conditional(c, t[1], e[1] ) ]);
|
|
}
|
|
else if (e && aborts(t)) {
|
|
ret = [ [ "if", c, t ] ];
|
|
if (e[0] == "block") {
|
|
if (e[1]) ret = ret.concat(e[1]);
|
|
}
|
|
else {
|
|
ret.push(e);
|
|
}
|
|
ret = walk([ "block", ret ]);
|
|
}
|
|
else if (t && aborts(e)) {
|
|
ret = [ [ "if", negate(c), e ] ];
|
|
if (t[0] == "block") {
|
|
if (t[1]) ret = ret.concat(t[1]);
|
|
} else {
|
|
ret.push(t);
|
|
}
|
|
ret = walk([ "block", ret ]);
|
|
}
|
|
return ret;
|
|
};
|
|
|
|
function _do_while(cond, body) {
|
|
return when_constant(cond, function(cond, val){
|
|
if (!val) {
|
|
warn_unreachable(body);
|
|
return [ "block" ];
|
|
} else {
|
|
return [ "for", null, null, null, walk(body) ];
|
|
}
|
|
});
|
|
};
|
|
|
|
ast = prepare_ifs(ast);
|
|
ast = ast_add_scope(ast);
|
|
|
|
return w.with_walkers({
|
|
"sub": function(expr, subscript) {
|
|
if (subscript[0] == "string") {
|
|
var name = subscript[1];
|
|
if (is_identifier(name))
|
|
return [ "dot", walk(expr), name ];
|
|
else if (/^[1-9][0-9]*$/.test(name) || name === "0")
|
|
return [ "sub", walk(expr), [ "num", parseInt(name, 10) ] ];
|
|
}
|
|
},
|
|
"if": make_if,
|
|
"toplevel": function(body) {
|
|
return [ "toplevel", with_scope(this.scope, function(){
|
|
return tighten(MAP(body, walk));
|
|
}) ];
|
|
},
|
|
"switch": function(expr, body) {
|
|
var last = body.length - 1;
|
|
return [ "switch", walk(expr), MAP(body, function(branch, i){
|
|
var block = tighten(MAP(branch[1], walk));
|
|
if (i == last && block.length > 0) {
|
|
var node = block[block.length - 1];
|
|
if (node[0] == "break" && !node[1])
|
|
block.pop();
|
|
}
|
|
return [ branch[0] ? walk(branch[0]) : null, block ];
|
|
}) ];
|
|
},
|
|
"function": _lambda,
|
|
"defun": _lambda,
|
|
"block": function(body) {
|
|
if (body) return rmblock([ "block", tighten(MAP(body, walk)) ]);
|
|
},
|
|
"binary": function(op, left, right) {
|
|
return when_constant([ "binary", op, walk(left), walk(right) ], function yes(c){
|
|
return best_of(walk(c), this);
|
|
}, function no() {
|
|
return this;
|
|
});
|
|
},
|
|
"conditional": function(c, t, e) {
|
|
return make_conditional(walk(c), walk(t), walk(e));
|
|
},
|
|
"try": function(t, c, f) {
|
|
return [
|
|
"try",
|
|
tighten(MAP(t, walk)),
|
|
c != null ? [ c[0], tighten(MAP(c[1], walk)) ] : null,
|
|
f != null ? tighten(MAP(f, walk)) : null
|
|
];
|
|
},
|
|
"unary-prefix": function(op, expr) {
|
|
expr = walk(expr);
|
|
var ret = [ "unary-prefix", op, expr ];
|
|
if (op == "!")
|
|
ret = best_of(ret, negate(expr));
|
|
return when_constant(ret, function(ast, val){
|
|
return walk(ast); // it's either true or false, so minifies to !0 or !1
|
|
}, function() { return ret });
|
|
},
|
|
"name": function(name) {
|
|
switch (name) {
|
|
case "true": return [ "unary-prefix", "!", [ "num", 0 ]];
|
|
case "false": return [ "unary-prefix", "!", [ "num", 1 ]];
|
|
}
|
|
},
|
|
"new": function(ctor, args) {
|
|
if (ctor[0] == "name" && ctor[1] == "Array" && !scope.has("Array")) {
|
|
if (args.length != 1) {
|
|
return [ "array", args ];
|
|
} else {
|
|
return [ "call", [ "name", "Array" ], args ];
|
|
}
|
|
}
|
|
},
|
|
"call": function(expr, args) {
|
|
if (expr[0] == "name" && expr[1] == "Array" && args.length != 1 && !scope.has("Array")) {
|
|
return [ "array", args ];
|
|
}
|
|
},
|
|
"while": _do_while
|
|
}, function() {
|
|
return walk(ast);
|
|
});
|
|
};
|
|
|
|
/* -----[ re-generate code from the AST ]----- */
|
|
|
|
var DOT_CALL_NO_PARENS = jsp.array_to_hash([
|
|
"name",
|
|
"array",
|
|
"object",
|
|
"string",
|
|
"dot",
|
|
"sub",
|
|
"call",
|
|
"regexp"
|
|
]);
|
|
|
|
function make_string(str, ascii_only) {
|
|
var dq = 0, sq = 0;
|
|
str = str.replace(/[\\\b\f\n\r\t\x22\x27\u2028\u2029]/g, function(s){
|
|
switch (s) {
|
|
case "\\": return "\\\\";
|
|
case "\b": return "\\b";
|
|
case "\f": return "\\f";
|
|
case "\n": return "\\n";
|
|
case "\r": return "\\r";
|
|
case "\t": return "\\t";
|
|
case "\u2028": return "\\u2028";
|
|
case "\u2029": return "\\u2029";
|
|
case '"': ++dq; return '"';
|
|
case "'": ++sq; return "'";
|
|
}
|
|
return s;
|
|
});
|
|
if (ascii_only) str = to_ascii(str);
|
|
if (dq > sq) return "'" + str.replace(/\x27/g, "\\'") + "'";
|
|
else return '"' + str.replace(/\x22/g, '\\"') + '"';
|
|
};
|
|
|
|
function to_ascii(str) {
|
|
return str.replace(/[\u0080-\uffff]/g, function(ch) {
|
|
var code = ch.charCodeAt(0).toString(16);
|
|
while (code.length < 4) code = "0" + code;
|
|
return "\\u" + code;
|
|
});
|
|
};
|
|
|
|
var SPLICE_NEEDS_BRACKETS = jsp.array_to_hash([ "if", "while", "do", "for", "for-in", "with" ]);
|
|
|
|
function gen_code(ast, options) {
|
|
options = defaults(options, {
|
|
indent_start : 0,
|
|
indent_level : 4,
|
|
quote_keys : false,
|
|
space_colon : false,
|
|
beautify : false,
|
|
ascii_only : false
|
|
});
|
|
var beautify = !!options.beautify;
|
|
var indentation = 0,
|
|
newline = beautify ? "\n" : "",
|
|
space = beautify ? " " : "";
|
|
|
|
function encode_string(str) {
|
|
return make_string(str, options.ascii_only);
|
|
};
|
|
|
|
function make_name(name) {
|
|
name = name.toString();
|
|
if (options.ascii_only)
|
|
name = to_ascii(name);
|
|
return name;
|
|
};
|
|
|
|
function indent(line) {
|
|
if (line == null)
|
|
line = "";
|
|
if (beautify)
|
|
line = repeat_string(" ", options.indent_start + indentation * options.indent_level) + line;
|
|
return line;
|
|
};
|
|
|
|
function with_indent(cont, incr) {
|
|
if (incr == null) incr = 1;
|
|
indentation += incr;
|
|
try { return cont.apply(null, slice(arguments, 1)); }
|
|
finally { indentation -= incr; }
|
|
};
|
|
|
|
function add_spaces(a) {
|
|
if (beautify)
|
|
return a.join(" ");
|
|
var b = [];
|
|
for (var i = 0; i < a.length; ++i) {
|
|
var next = a[i + 1];
|
|
b.push(a[i]);
|
|
if (next &&
|
|
((/[a-z0-9_\x24]$/i.test(a[i].toString()) && /^[a-z0-9_\x24]/i.test(next.toString())) ||
|
|
(/[\+\-]$/.test(a[i].toString()) && /^[\+\-]/.test(next.toString())))) {
|
|
b.push(" ");
|
|
}
|
|
}
|
|
return b.join("");
|
|
};
|
|
|
|
function add_commas(a) {
|
|
return a.join("," + space);
|
|
};
|
|
|
|
function parenthesize(expr) {
|
|
var gen = make(expr);
|
|
for (var i = 1; i < arguments.length; ++i) {
|
|
var el = arguments[i];
|
|
if ((el instanceof Function && el(expr)) || expr[0] == el)
|
|
return "(" + gen + ")";
|
|
}
|
|
return gen;
|
|
};
|
|
|
|
function best_of(a) {
|
|
if (a.length == 1) {
|
|
return a[0];
|
|
}
|
|
if (a.length == 2) {
|
|
var b = a[1];
|
|
a = a[0];
|
|
return a.length <= b.length ? a : b;
|
|
}
|
|
return best_of([ a[0], best_of(a.slice(1)) ]);
|
|
};
|
|
|
|
function needs_parens(expr) {
|
|
if (expr[0] == "function" || expr[0] == "object") {
|
|
// dot/call on a literal function requires the
|
|
// function literal itself to be parenthesized
|
|
// only if it's the first "thing" in a
|
|
// statement. This means that the parent is
|
|
// "stat", but it could also be a "seq" and
|
|
// we're the first in this "seq" and the
|
|
// parent is "stat", and so on. Messy stuff,
|
|
// but it worths the trouble.
|
|
var a = slice($stack), self = a.pop(), p = a.pop();
|
|
while (p) {
|
|
if (p[0] == "stat") return true;
|
|
if (((p[0] == "seq" || p[0] == "call" || p[0] == "dot" || p[0] == "sub" || p[0] == "conditional") && p[1] === self) ||
|
|
((p[0] == "binary" || p[0] == "assign" || p[0] == "unary-postfix") && p[2] === self)) {
|
|
self = p;
|
|
p = a.pop();
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return !HOP(DOT_CALL_NO_PARENS, expr[0]);
|
|
};
|
|
|
|
function make_num(num) {
|
|
var str = num.toString(10), a = [ str.replace(/^0\./, ".") ], m;
|
|
if (Math.floor(num) === num) {
|
|
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);
|
|
};
|
|
|
|
var generators = {
|
|
"string": encode_string,
|
|
"num": make_num,
|
|
"name": make_name,
|
|
"toplevel": function(statements) {
|
|
return make_block_statements(statements)
|
|
.join(newline + newline);
|
|
},
|
|
"splice": function(statements) {
|
|
var parent = $stack[$stack.length - 2][0];
|
|
if (HOP(SPLICE_NEEDS_BRACKETS, parent)) {
|
|
// we need block brackets in this case
|
|
return make_block.apply(this, arguments);
|
|
} else {
|
|
return MAP(make_block_statements(statements, true),
|
|
function(line, i) {
|
|
// the first line is already indented
|
|
return i > 0 ? indent(line) : line;
|
|
}).join(newline);
|
|
}
|
|
},
|
|
"block": make_block,
|
|
"var": function(defs) {
|
|
return "var " + add_commas(MAP(defs, make_1vardef)) + ";";
|
|
},
|
|
"const": function(defs) {
|
|
return "const " + add_commas(MAP(defs, make_1vardef)) + ";";
|
|
},
|
|
"try": function(tr, ca, fi) {
|
|
var out = [ "try", make_block(tr) ];
|
|
if (ca) out.push("catch", "(" + ca[0] + ")", make_block(ca[1]));
|
|
if (fi) out.push("finally", make_block(fi));
|
|
return add_spaces(out);
|
|
},
|
|
"throw": function(expr) {
|
|
return add_spaces([ "throw", make(expr) ]) + ";";
|
|
},
|
|
"new": function(ctor, args) {
|
|
args = args.length > 0 ? "(" + add_commas(MAP(args, make)) + ")" : "";
|
|
return add_spaces([ "new", parenthesize(ctor, "seq", "binary", "conditional", "assign", function(expr){
|
|
var w = ast_walker(), has_call = {};
|
|
try {
|
|
w.with_walkers({
|
|
"call": function() { throw has_call },
|
|
"function": function() { return this }
|
|
}, function(){
|
|
w.walk(expr);
|
|
});
|
|
} catch(ex) {
|
|
if (ex === has_call)
|
|
return true;
|
|
throw ex;
|
|
}
|
|
}) + args ]);
|
|
},
|
|
"switch": function(expr, body) {
|
|
return add_spaces([ "switch", "(" + make(expr) + ")", make_switch_block(body) ]);
|
|
},
|
|
"break": function(label) {
|
|
var out = "break";
|
|
if (label != null)
|
|
out += " " + make_name(label);
|
|
return out + ";";
|
|
},
|
|
"continue": function(label) {
|
|
var out = "continue";
|
|
if (label != null)
|
|
out += " " + make_name(label);
|
|
return out + ";";
|
|
},
|
|
"conditional": function(co, th, el) {
|
|
return add_spaces([ parenthesize(co, "assign", "seq", "conditional"), "?",
|
|
parenthesize(th, "seq"), ":",
|
|
parenthesize(el, "seq") ]);
|
|
},
|
|
"assign": function(op, lvalue, rvalue) {
|
|
if (op && op !== true) op += "=";
|
|
else op = "=";
|
|
return add_spaces([ make(lvalue), op, parenthesize(rvalue, "seq") ]);
|
|
},
|
|
"dot": function(expr) {
|
|
var out = make(expr), i = 1;
|
|
if (expr[0] == "num") {
|
|
if (!/\./.test(expr[1]))
|
|
out += ".";
|
|
} else if (needs_parens(expr))
|
|
out = "(" + out + ")";
|
|
while (i < arguments.length)
|
|
out += "." + make_name(arguments[i++]);
|
|
return out;
|
|
},
|
|
"call": function(func, args) {
|
|
var f = make(func);
|
|
if (needs_parens(func))
|
|
f = "(" + f + ")";
|
|
return f + "(" + add_commas(MAP(args, function(expr){
|
|
return parenthesize(expr, "seq");
|
|
})) + ")";
|
|
},
|
|
"function": make_function,
|
|
"defun": make_function,
|
|
"if": function(co, th, el) {
|
|
var out = [ "if", "(" + make(co) + ")", el ? make_then(th) : make(th) ];
|
|
if (el) {
|
|
out.push("else", make(el));
|
|
}
|
|
return add_spaces(out);
|
|
},
|
|
"for": function(init, cond, step, block) {
|
|
var out = [ "for" ];
|
|
init = (init != null ? make(init) : "").replace(/;*\s*$/, ";" + space);
|
|
cond = (cond != null ? make(cond) : "").replace(/;*\s*$/, ";" + space);
|
|
step = (step != null ? make(step) : "").replace(/;*\s*$/, "");
|
|
var args = init + cond + step;
|
|
if (args == "; ; ") args = ";;";
|
|
out.push("(" + args + ")", make(block));
|
|
return add_spaces(out);
|
|
},
|
|
"for-in": function(vvar, key, hash, block) {
|
|
return add_spaces([ "for", "(" +
|
|
(vvar ? make(vvar).replace(/;+$/, "") : make(key)),
|
|
"in",
|
|
make(hash) + ")", make(block) ]);
|
|
},
|
|
"while": function(condition, block) {
|
|
return add_spaces([ "while", "(" + make(condition) + ")", make(block) ]);
|
|
},
|
|
"do": function(condition, block) {
|
|
return add_spaces([ "do", make(block), "while", "(" + make(condition) + ")" ]) + ";";
|
|
},
|
|
"return": function(expr) {
|
|
var out = [ "return" ];
|
|
if (expr != null) out.push(make(expr));
|
|
return add_spaces(out) + ";";
|
|
},
|
|
"binary": function(operator, lvalue, rvalue) {
|
|
var left = make(lvalue), right = make(rvalue);
|
|
// XXX: I'm pretty sure other cases will bite here.
|
|
// we need to be smarter.
|
|
// adding parens all the time is the safest bet.
|
|
if (member(lvalue[0], [ "assign", "conditional", "seq" ]) ||
|
|
lvalue[0] == "binary" && PRECEDENCE[operator] > PRECEDENCE[lvalue[1]]) {
|
|
left = "(" + left + ")";
|
|
}
|
|
if (member(rvalue[0], [ "assign", "conditional", "seq" ]) ||
|
|
rvalue[0] == "binary" && PRECEDENCE[operator] >= PRECEDENCE[rvalue[1]] &&
|
|
!(rvalue[1] == operator && member(operator, [ "&&", "||", "*" ]))) {
|
|
right = "(" + right + ")";
|
|
}
|
|
return add_spaces([ left, operator, right ]);
|
|
},
|
|
"unary-prefix": function(operator, expr) {
|
|
var val = make(expr);
|
|
if (!(expr[0] == "num" || (expr[0] == "unary-prefix" && !HOP(OPERATORS, operator + expr[1])) || !needs_parens(expr)))
|
|
val = "(" + val + ")";
|
|
return operator + (jsp.is_alphanumeric_char(operator.charAt(0)) ? " " : "") + val;
|
|
},
|
|
"unary-postfix": function(operator, expr) {
|
|
var val = make(expr);
|
|
if (!(expr[0] == "num" || (expr[0] == "unary-postfix" && !HOP(OPERATORS, operator + expr[1])) || !needs_parens(expr)))
|
|
val = "(" + val + ")";
|
|
return val + operator;
|
|
},
|
|
"sub": function(expr, subscript) {
|
|
var hash = make(expr);
|
|
if (needs_parens(expr))
|
|
hash = "(" + hash + ")";
|
|
return hash + "[" + make(subscript) + "]";
|
|
},
|
|
"object": function(props) {
|
|
if (props.length == 0)
|
|
return "{}";
|
|
return "{" + newline + with_indent(function(){
|
|
return MAP(props, function(p){
|
|
if (p.length == 3) {
|
|
// getter/setter. The name is in p[0], the arg.list in p[1][2], the
|
|
// body in p[1][3] and type ("get" / "set") in p[2].
|
|
return indent(make_function(p[0], p[1][2], p[1][3], p[2]));
|
|
}
|
|
var key = p[0], val = make(p[1]);
|
|
if (options.quote_keys) {
|
|
key = encode_string(key);
|
|
} else if ((typeof key == "number" || !beautify && +key + "" == key)
|
|
&& parseFloat(key) >= 0) {
|
|
key = make_num(+key);
|
|
} else if (!is_identifier(key)) {
|
|
key = encode_string(key);
|
|
}
|
|
return indent(add_spaces(beautify && options.space_colon
|
|
? [ key, ":", val ]
|
|
: [ key + ":", val ]));
|
|
}).join("," + newline);
|
|
}) + newline + indent("}");
|
|
},
|
|
"regexp": function(rx, mods) {
|
|
return "/" + rx + "/" + mods;
|
|
},
|
|
"array": function(elements) {
|
|
if (elements.length == 0) return "[]";
|
|
return add_spaces([ "[", add_commas(MAP(elements, function(el){
|
|
if (!beautify && el[0] == "atom" && el[1] == "undefined") return "";
|
|
return parenthesize(el, "seq");
|
|
})), "]" ]);
|
|
},
|
|
"stat": function(stmt) {
|
|
return make(stmt).replace(/;*\s*$/, ";");
|
|
},
|
|
"seq": function() {
|
|
return add_commas(MAP(slice(arguments), make));
|
|
},
|
|
"label": function(name, block) {
|
|
return add_spaces([ make_name(name), ":", make(block) ]);
|
|
},
|
|
"with": function(expr, block) {
|
|
return add_spaces([ "with", "(" + make(expr) + ")", make(block) ]);
|
|
},
|
|
"atom": function(name) {
|
|
return make_name(name);
|
|
}
|
|
};
|
|
|
|
// 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.
|
|
function make_then(th) {
|
|
if (th[0] == "do") {
|
|
// 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
|
|
return make([ "block", [ th ]]);
|
|
}
|
|
var b = th;
|
|
while (true) {
|
|
var type = b[0];
|
|
if (type == "if") {
|
|
if (!b[3])
|
|
// no else, we must add the block
|
|
return make([ "block", [ th ]]);
|
|
b = b[3];
|
|
}
|
|
else if (type == "while" || type == "do") b = b[2];
|
|
else if (type == "for" || type == "for-in") b = b[4];
|
|
else break;
|
|
}
|
|
return make(th);
|
|
};
|
|
|
|
function make_function(name, args, body, keyword) {
|
|
var out = keyword || "function";
|
|
if (name) {
|
|
out += " " + make_name(name);
|
|
}
|
|
out += "(" + add_commas(MAP(args, make_name)) + ")";
|
|
return add_spaces([ out, make_block(body) ]);
|
|
};
|
|
|
|
function make_block_statements(statements, noindent) {
|
|
for (var a = [], last = statements.length - 1, i = 0; i <= last; ++i) {
|
|
var stat = statements[i];
|
|
var code = make(stat);
|
|
if (code != ";") {
|
|
if (!beautify && i == last) {
|
|
if ((stat[0] == "while" && empty(stat[2])) ||
|
|
(member(stat[0], [ "for", "for-in"] ) && empty(stat[4])) ||
|
|
(stat[0] == "if" && empty(stat[2]) && !stat[3]) ||
|
|
(stat[0] == "if" && stat[3] && empty(stat[3]))) {
|
|
code = code.replace(/;*\s*$/, ";");
|
|
} else {
|
|
code = code.replace(/;+\s*$/, "");
|
|
}
|
|
}
|
|
a.push(code);
|
|
}
|
|
}
|
|
return noindent ? a : MAP(a, indent);
|
|
};
|
|
|
|
function make_switch_block(body) {
|
|
var n = body.length;
|
|
if (n == 0) return "{}";
|
|
return "{" + newline + MAP(body, function(branch, i){
|
|
var has_body = branch[1].length > 0, code = with_indent(function(){
|
|
return indent(branch[0]
|
|
? add_spaces([ "case", make(branch[0]) + ":" ])
|
|
: "default:");
|
|
}, 0.5) + (has_body ? newline + with_indent(function(){
|
|
return make_block_statements(branch[1]).join(newline);
|
|
}) : "");
|
|
if (!beautify && has_body && i < n - 1)
|
|
code += ";";
|
|
return code;
|
|
}).join(newline) + newline + indent("}");
|
|
};
|
|
|
|
function make_block(statements) {
|
|
if (!statements) return ";";
|
|
if (statements.length == 0) return "{}";
|
|
return "{" + newline + with_indent(function(){
|
|
return make_block_statements(statements).join(newline);
|
|
}) + newline + indent("}");
|
|
};
|
|
|
|
function make_1vardef(def) {
|
|
var name = def[0], val = def[1];
|
|
if (val != null)
|
|
name = add_spaces([ make_name(name), "=", parenthesize(val, "seq") ]);
|
|
return name;
|
|
};
|
|
|
|
var $stack = [];
|
|
|
|
function make(node) {
|
|
var type = node[0];
|
|
var gen = generators[type];
|
|
if (!gen)
|
|
throw new Error("Can't find generator for \"" + type + "\"");
|
|
$stack.push(node);
|
|
var ret = gen.apply(type, node.slice(1));
|
|
$stack.pop();
|
|
return ret;
|
|
};
|
|
|
|
return make(ast);
|
|
};
|
|
|
|
function split_lines(code, max_line_length) {
|
|
var splits = [ 0 ];
|
|
jsp.parse(function(){
|
|
var next_token = jsp.tokenizer(code);
|
|
var last_split = 0;
|
|
var prev_token;
|
|
function current_length(tok) {
|
|
return tok.pos - last_split;
|
|
};
|
|
function split_here(tok) {
|
|
last_split = tok.pos;
|
|
splits.push(last_split);
|
|
};
|
|
function custom(){
|
|
var tok = next_token.apply(this, arguments);
|
|
out: {
|
|
if (prev_token) {
|
|
if (prev_token.type == "keyword") break out;
|
|
}
|
|
if (current_length(tok) > max_line_length) {
|
|
switch (tok.type) {
|
|
case "keyword":
|
|
case "atom":
|
|
case "name":
|
|
case "punc":
|
|
split_here(tok);
|
|
break out;
|
|
}
|
|
}
|
|
}
|
|
prev_token = tok;
|
|
return tok;
|
|
};
|
|
custom.context = function() {
|
|
return next_token.context.apply(this, arguments);
|
|
};
|
|
return custom;
|
|
}());
|
|
return splits.map(function(pos, i){
|
|
return code.substring(pos, splits[i + 1] || code.length);
|
|
}).join("\n");
|
|
};
|
|
|
|
/* -----[ Utilities ]----- */
|
|
|
|
function repeat_string(str, i) {
|
|
if (i <= 0) return "";
|
|
if (i == 1) return str;
|
|
var d = repeat_string(str, i >> 1);
|
|
d += d;
|
|
if (i & 1) d += str;
|
|
return d;
|
|
};
|
|
|
|
function defaults(args, defs) {
|
|
var ret = {};
|
|
if (args === true)
|
|
args = {};
|
|
for (var i in defs) if (HOP(defs, i)) {
|
|
ret[i] = (args && HOP(args, i)) ? args[i] : defs[i];
|
|
}
|
|
return ret;
|
|
};
|
|
|
|
function is_identifier(name) {
|
|
return /^[a-z_$][a-z0-9_$]*$/i.test(name)
|
|
&& name != "this"
|
|
&& !HOP(jsp.KEYWORDS_ATOM, name)
|
|
&& !HOP(jsp.RESERVED_WORDS, name)
|
|
&& !HOP(jsp.KEYWORDS, name);
|
|
};
|
|
|
|
function HOP(obj, prop) {
|
|
return Object.prototype.hasOwnProperty.call(obj, prop);
|
|
};
|
|
|
|
// some utilities
|
|
|
|
var MAP;
|
|
|
|
(function(){
|
|
MAP = function(a, f, o) {
|
|
var ret = [];
|
|
for (var i = 0; i < a.length; ++i) {
|
|
var val = f.call(o, a[i], i);
|
|
if (val instanceof AtTop) ret.unshift(val.v);
|
|
else ret.push(val);
|
|
}
|
|
return ret;
|
|
};
|
|
MAP.at_top = function(val) { return new AtTop(val) };
|
|
function AtTop(val) { this.v = val };
|
|
})();
|
|
|
|
/* -----[ Exports ]----- */
|
|
|
|
exports.ast_walker = ast_walker;
|
|
exports.ast_mangle = ast_mangle;
|
|
exports.ast_squeeze = ast_squeeze;
|
|
exports.gen_code = gen_code;
|
|
exports.ast_add_scope = ast_add_scope;
|
|
exports.set_logger = function(logger) { warn = logger };
|
|
exports.make_string = make_string;
|
|
exports.split_lines = split_lines;
|
|
exports.MAP = MAP;
|
|
|
|
// keep this last!
|
|
exports.ast_squeeze_more = require("./squeeze-more").ast_squeeze_more;
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/lib/process.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/uglify-js/lib/squeeze-more.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/uglify-js/lib";
|
|
var __filename = "/node_modules/burrito/node_modules/uglify-js/lib/squeeze-more.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/uglify-js/lib");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/uglify-js/lib");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/lib/squeeze-more.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
var jsp = require("./parse-js"),
|
|
pro = require("./process"),
|
|
slice = jsp.slice,
|
|
member = jsp.member,
|
|
PRECEDENCE = jsp.PRECEDENCE,
|
|
OPERATORS = jsp.OPERATORS;
|
|
|
|
function ast_squeeze_more(ast) {
|
|
var w = pro.ast_walker(), walk = w.walk;
|
|
return w.with_walkers({
|
|
"call": function(expr, args) {
|
|
if (expr[0] == "dot" && expr[2] == "toString" && args.length == 0) {
|
|
// foo.toString() ==> foo+""
|
|
return [ "binary", "+", expr[1], [ "string", "" ]];
|
|
}
|
|
}
|
|
}, function() {
|
|
return walk(ast);
|
|
});
|
|
};
|
|
|
|
exports.ast_squeeze_more = ast_squeeze_more;
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/uglify-js/lib/squeeze-more.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/traverse/package.json"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/traverse";
|
|
var __filename = "/node_modules/burrito/node_modules/traverse/package.json";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/traverse");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/traverse");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/traverse/package.json"]._cached = module.exports;
|
|
|
|
(function () {
|
|
module.exports = {"name":"traverse","version":"0.5.0","description":"Traverse and transform objects by visiting every node on a recursive walk","author":"James Halliday","license":"MIT/X11","main":"./index","repository":{"type":"git","url":"http://github.com/substack/js-traverse.git"},"devDependencies":{"expresso":"0.7.x"},"scripts":{"test":"expresso"}};
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/traverse/package.json"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/node_modules/traverse/index.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito/node_modules/traverse";
|
|
var __filename = "/node_modules/burrito/node_modules/traverse/index.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito/node_modules/traverse");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito/node_modules/traverse");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/node_modules/traverse/index.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
module.exports = Traverse;
|
|
function Traverse (obj) {
|
|
if (!(this instanceof Traverse)) return new Traverse(obj);
|
|
this.value = obj;
|
|
}
|
|
|
|
Traverse.prototype.get = function (ps) {
|
|
var node = this.value;
|
|
for (var i = 0; i < ps.length; i ++) {
|
|
var key = ps[i];
|
|
if (!Object.hasOwnProperty.call(node, key)) {
|
|
node = undefined;
|
|
break;
|
|
}
|
|
node = node[key];
|
|
}
|
|
return node;
|
|
};
|
|
|
|
Traverse.prototype.set = function (ps, value) {
|
|
var node = this.value;
|
|
for (var i = 0; i < ps.length - 1; i ++) {
|
|
var key = ps[i];
|
|
if (!Object.hasOwnProperty.call(node, key)) node[key] = {};
|
|
node = node[key];
|
|
}
|
|
node[ps[i]] = value;
|
|
return value;
|
|
};
|
|
|
|
Traverse.prototype.map = function (cb) {
|
|
return walk(this.value, cb, true);
|
|
};
|
|
|
|
Traverse.prototype.forEach = function (cb) {
|
|
this.value = walk(this.value, cb, false);
|
|
return this.value;
|
|
};
|
|
|
|
Traverse.prototype.reduce = function (cb, init) {
|
|
var skip = arguments.length === 1;
|
|
var acc = skip ? this.value : init;
|
|
this.forEach(function (x) {
|
|
if (!this.isRoot || !skip) {
|
|
acc = cb.call(this, acc, x);
|
|
}
|
|
});
|
|
return acc;
|
|
};
|
|
|
|
Traverse.prototype.paths = function () {
|
|
var acc = [];
|
|
this.forEach(function (x) {
|
|
acc.push(this.path);
|
|
});
|
|
return acc;
|
|
};
|
|
|
|
Traverse.prototype.nodes = function () {
|
|
var acc = [];
|
|
this.forEach(function (x) {
|
|
acc.push(this.node);
|
|
});
|
|
return acc;
|
|
};
|
|
|
|
Traverse.prototype.clone = function () {
|
|
var parents = [], nodes = [];
|
|
|
|
return (function clone (src) {
|
|
for (var i = 0; i < parents.length; i++) {
|
|
if (parents[i] === src) {
|
|
return nodes[i];
|
|
}
|
|
}
|
|
|
|
if (typeof src === 'object' && src !== null) {
|
|
var dst = copy(src);
|
|
|
|
parents.push(src);
|
|
nodes.push(dst);
|
|
|
|
forEach(Object_keys(src), function (key) {
|
|
dst[key] = clone(src[key]);
|
|
});
|
|
|
|
parents.pop();
|
|
nodes.pop();
|
|
return dst;
|
|
}
|
|
else {
|
|
return src;
|
|
}
|
|
})(this.value);
|
|
};
|
|
|
|
function walk (root, cb, immutable) {
|
|
var path = [];
|
|
var parents = [];
|
|
var alive = true;
|
|
|
|
return (function walker (node_) {
|
|
var node = immutable ? copy(node_) : node_;
|
|
var modifiers = {};
|
|
|
|
var keepGoing = true;
|
|
|
|
var state = {
|
|
node : node,
|
|
node_ : node_,
|
|
path : [].concat(path),
|
|
parent : parents[parents.length - 1],
|
|
parents : parents,
|
|
key : path.slice(-1)[0],
|
|
isRoot : path.length === 0,
|
|
level : path.length,
|
|
circular : null,
|
|
update : function (x, stopHere) {
|
|
if (!state.isRoot) {
|
|
state.parent.node[state.key] = x;
|
|
}
|
|
state.node = x;
|
|
if (stopHere) keepGoing = false;
|
|
},
|
|
'delete' : function () {
|
|
delete state.parent.node[state.key];
|
|
},
|
|
remove : function () {
|
|
if (Array_isArray(state.parent.node)) {
|
|
state.parent.node.splice(state.key, 1);
|
|
}
|
|
else {
|
|
delete state.parent.node[state.key];
|
|
}
|
|
},
|
|
keys : null,
|
|
before : function (f) { modifiers.before = f },
|
|
after : function (f) { modifiers.after = f },
|
|
pre : function (f) { modifiers.pre = f },
|
|
post : function (f) { modifiers.post = f },
|
|
stop : function () { alive = false },
|
|
block : function () { keepGoing = false }
|
|
};
|
|
|
|
if (!alive) return state;
|
|
|
|
if (typeof node === 'object' && node !== null) {
|
|
state.keys = Object_keys(node);
|
|
|
|
state.isLeaf = state.keys.length == 0;
|
|
|
|
for (var i = 0; i < parents.length; i++) {
|
|
if (parents[i].node_ === node_) {
|
|
state.circular = parents[i];
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
state.isLeaf = true;
|
|
}
|
|
|
|
state.notLeaf = !state.isLeaf;
|
|
state.notRoot = !state.isRoot;
|
|
|
|
// use return values to update if defined
|
|
var ret = cb.call(state, state.node);
|
|
if (ret !== undefined && state.update) state.update(ret);
|
|
|
|
if (modifiers.before) modifiers.before.call(state, state.node);
|
|
|
|
if (!keepGoing) return state;
|
|
|
|
if (typeof state.node == 'object'
|
|
&& state.node !== null && !state.circular) {
|
|
parents.push(state);
|
|
|
|
forEach(state.keys, function (key, i) {
|
|
path.push(key);
|
|
|
|
if (modifiers.pre) modifiers.pre.call(state, state.node[key], key);
|
|
|
|
var child = walker(state.node[key]);
|
|
if (immutable && Object.hasOwnProperty.call(state.node, key)) {
|
|
state.node[key] = child.node;
|
|
}
|
|
|
|
child.isLast = i == state.keys.length - 1;
|
|
child.isFirst = i == 0;
|
|
|
|
if (modifiers.post) modifiers.post.call(state, child);
|
|
|
|
path.pop();
|
|
});
|
|
parents.pop();
|
|
}
|
|
|
|
if (modifiers.after) modifiers.after.call(state, state.node);
|
|
|
|
return state;
|
|
})(root).node;
|
|
}
|
|
|
|
function copy (src) {
|
|
if (typeof src === 'object' && src !== null) {
|
|
var dst;
|
|
|
|
if (Array_isArray(src)) {
|
|
dst = [];
|
|
}
|
|
else if (src instanceof Date) {
|
|
dst = new Date(src);
|
|
}
|
|
else if (src instanceof Boolean) {
|
|
dst = new Boolean(src);
|
|
}
|
|
else if (src instanceof Number) {
|
|
dst = new Number(src);
|
|
}
|
|
else if (src instanceof String) {
|
|
dst = new String(src);
|
|
}
|
|
else if (Object.create && Object.getPrototypeOf) {
|
|
dst = Object.create(Object.getPrototypeOf(src));
|
|
}
|
|
else if (src.__proto__ || src.constructor.prototype) {
|
|
var proto = src.__proto__ || src.constructor.prototype || {};
|
|
var T = function () {};
|
|
T.prototype = proto;
|
|
dst = new T;
|
|
if (!dst.__proto__) dst.__proto__ = proto;
|
|
}
|
|
|
|
forEach(Object_keys(src), function (key) {
|
|
dst[key] = src[key];
|
|
});
|
|
return dst;
|
|
}
|
|
else return src;
|
|
}
|
|
|
|
var Object_keys = Object.keys || function keys (obj) {
|
|
var res = [];
|
|
for (var key in obj) res.push(key)
|
|
return res;
|
|
};
|
|
|
|
var Array_isArray = Array.isArray || function isArray (xs) {
|
|
return Object.prototype.toString.call(xs) === '[object Array]';
|
|
};
|
|
|
|
var forEach = function (xs, fn) {
|
|
if (xs.forEach) return xs.forEach(fn)
|
|
else for (var i = 0; i < xs.length; i++) {
|
|
fn(xs[i], i, xs);
|
|
}
|
|
};
|
|
|
|
forEach(Object_keys(Traverse.prototype), function (key) {
|
|
Traverse[key] = function (obj) {
|
|
var args = [].slice.call(arguments, 1);
|
|
var t = Traverse(obj);
|
|
return t[key].apply(t, args);
|
|
};
|
|
});
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/node_modules/traverse/index.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["vm"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = ".";
|
|
var __filename = "vm";
|
|
|
|
var require = function (file) {
|
|
return __require(file, ".");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, ".");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["vm"]._cached = module.exports;
|
|
|
|
(function () {
|
|
var Object_keys = function (obj) {
|
|
if (Object.keys) return Object.keys(obj)
|
|
else {
|
|
var res = [];
|
|
for (var key in obj) res.push(key)
|
|
return res;
|
|
}
|
|
};
|
|
|
|
var forEach = function (xs, fn) {
|
|
if (xs.forEach) return xs.forEach(fn)
|
|
else for (var i = 0; i < xs.length; i++) {
|
|
fn(xs[i], i, xs);
|
|
}
|
|
};
|
|
|
|
var Script = exports.Script = function NodeScript (code) {
|
|
if (!(this instanceof Script)) return new Script(code);
|
|
this.code = code;
|
|
};
|
|
|
|
var iframe = document.createElement('iframe');
|
|
if (!iframe.style) iframe.style = {};
|
|
iframe.style.display = 'none';
|
|
|
|
var iframeCapable = true; // until proven otherwise
|
|
if (navigator.appName === 'Microsoft Internet Explorer') {
|
|
var m = navigator.appVersion.match(/\bMSIE (\d+\.\d+);/);
|
|
if (m && parseFloat(m[1]) <= 9.0) {
|
|
iframeCapable = false;
|
|
}
|
|
}
|
|
|
|
Script.prototype.runInNewContext = function (context) {
|
|
if (!context) context = {};
|
|
|
|
if (!iframeCapable) {
|
|
var keys = Object_keys(context);
|
|
var args = [];
|
|
for (var i = 0; i < keys.length; i++) {
|
|
args.push(context[keys[i]]);
|
|
}
|
|
|
|
var fn = Function(keys, this.code);
|
|
return fn.apply(null, args);
|
|
}
|
|
|
|
document.body.appendChild(iframe);
|
|
|
|
var win = iframe.contentWindow
|
|
|| (window.frames && window.frames[window.frames.length - 1])
|
|
|| window[window.length - 1]
|
|
;
|
|
|
|
forEach(Object_keys(context), function (key) {
|
|
win[key] = context[key];
|
|
iframe[key] = context[key];
|
|
});
|
|
|
|
if (win.eval) {
|
|
// chrome and ff can just .eval()
|
|
var res = win.eval(this.code);
|
|
}
|
|
else {
|
|
// this works in IE9 but not anything newer
|
|
iframe.setAttribute('src',
|
|
'javascript:__browserifyVmResult=(' + this.code + ')'
|
|
);
|
|
if ('__browserifyVmResult' in win) {
|
|
var res = win.__browserifyVmResult;
|
|
}
|
|
else {
|
|
iframeCapable = false;
|
|
res = this.runInThisContext(context);
|
|
}
|
|
}
|
|
|
|
forEach(Object_keys(win), function (key) {
|
|
context[key] = win[key];
|
|
});
|
|
|
|
document.body.removeChild(iframe);
|
|
|
|
return res;
|
|
};
|
|
|
|
Script.prototype.runInThisContext = function () {
|
|
return eval(this.code); // maybe...
|
|
};
|
|
|
|
Script.prototype.runInContext = function (context) {
|
|
// seems to be just runInNewContext on magical context objects which are
|
|
// otherwise indistinguishable from objects except plain old objects
|
|
// for the parameter segfaults node
|
|
return this.runInNewContext(context);
|
|
};
|
|
|
|
forEach(Object_keys(Script.prototype), function (name) {
|
|
exports[name] = Script[name] = function (code) {
|
|
var s = Script(code);
|
|
return s[name].apply(s, [].slice.call(arguments, 1));
|
|
};
|
|
});
|
|
|
|
exports.createScript = function (code) {
|
|
return exports.Script(code);
|
|
};
|
|
|
|
exports.createContext = Script.createContext = function (context) {
|
|
// not really sure what this one does
|
|
// seems to just make a shallow copy
|
|
var copy = {};
|
|
forEach(Object_keys(context), function (key) {
|
|
copy[key] = context[key];
|
|
});
|
|
return copy;
|
|
};
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["vm"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/jsonify/package.json"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/jsonify";
|
|
var __filename = "/node_modules/jsonify/package.json";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/jsonify");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/jsonify");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/jsonify/package.json"]._cached = module.exports;
|
|
|
|
(function () {
|
|
module.exports = {"name":"jsonify","version":"0.0.0","description":"JSON without touching any globals","main":"index.js","directories":{"lib":".","test":"test"},"devDependencies":{"tap":"0.0.x","garbage":"0.0.x"},"scripts":{"test":"tap test"},"repository":{"type":"git","url":"http://github.com/substack/jsonify.git"},"keywords":["json","browser"],"author":{"name":"Douglas Crockford","url":"http://crockford.com/"},"license":"Public Domain"};
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/jsonify/package.json"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/jsonify/index.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/jsonify";
|
|
var __filename = "/node_modules/jsonify/index.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/jsonify");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/jsonify");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/jsonify/index.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
exports.parse = require('./lib/parse');
|
|
exports.stringify = require('./lib/stringify');
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/jsonify/index.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/jsonify/lib/parse.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/jsonify/lib";
|
|
var __filename = "/node_modules/jsonify/lib/parse.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/jsonify/lib");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/jsonify/lib");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/jsonify/lib/parse.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
var at, // The index of the current character
|
|
ch, // The current character
|
|
escapee = {
|
|
'"': '"',
|
|
'\\': '\\',
|
|
'/': '/',
|
|
b: '\b',
|
|
f: '\f',
|
|
n: '\n',
|
|
r: '\r',
|
|
t: '\t'
|
|
},
|
|
text,
|
|
|
|
error = function (m) {
|
|
// Call error when something is wrong.
|
|
throw {
|
|
name: 'SyntaxError',
|
|
message: m,
|
|
at: at,
|
|
text: text
|
|
};
|
|
},
|
|
|
|
next = function (c) {
|
|
// If a c parameter is provided, verify that it matches the current character.
|
|
if (c && c !== ch) {
|
|
error("Expected '" + c + "' instead of '" + ch + "'");
|
|
}
|
|
|
|
// Get the next character. When there are no more characters,
|
|
// return the empty string.
|
|
|
|
ch = text.charAt(at);
|
|
at += 1;
|
|
return ch;
|
|
},
|
|
|
|
number = function () {
|
|
// Parse a number value.
|
|
var number,
|
|
string = '';
|
|
|
|
if (ch === '-') {
|
|
string = '-';
|
|
next('-');
|
|
}
|
|
while (ch >= '0' && ch <= '9') {
|
|
string += ch;
|
|
next();
|
|
}
|
|
if (ch === '.') {
|
|
string += '.';
|
|
while (next() && ch >= '0' && ch <= '9') {
|
|
string += ch;
|
|
}
|
|
}
|
|
if (ch === 'e' || ch === 'E') {
|
|
string += ch;
|
|
next();
|
|
if (ch === '-' || ch === '+') {
|
|
string += ch;
|
|
next();
|
|
}
|
|
while (ch >= '0' && ch <= '9') {
|
|
string += ch;
|
|
next();
|
|
}
|
|
}
|
|
number = +string;
|
|
if (!isFinite(number)) {
|
|
error("Bad number");
|
|
} else {
|
|
return number;
|
|
}
|
|
},
|
|
|
|
string = function () {
|
|
// Parse a string value.
|
|
var hex,
|
|
i,
|
|
string = '',
|
|
uffff;
|
|
|
|
// When parsing for string values, we must look for " and \ characters.
|
|
if (ch === '"') {
|
|
while (next()) {
|
|
if (ch === '"') {
|
|
next();
|
|
return string;
|
|
} else if (ch === '\\') {
|
|
next();
|
|
if (ch === 'u') {
|
|
uffff = 0;
|
|
for (i = 0; i < 4; i += 1) {
|
|
hex = parseInt(next(), 16);
|
|
if (!isFinite(hex)) {
|
|
break;
|
|
}
|
|
uffff = uffff * 16 + hex;
|
|
}
|
|
string += String.fromCharCode(uffff);
|
|
} else if (typeof escapee[ch] === 'string') {
|
|
string += escapee[ch];
|
|
} else {
|
|
break;
|
|
}
|
|
} else {
|
|
string += ch;
|
|
}
|
|
}
|
|
}
|
|
error("Bad string");
|
|
},
|
|
|
|
white = function () {
|
|
|
|
// Skip whitespace.
|
|
|
|
while (ch && ch <= ' ') {
|
|
next();
|
|
}
|
|
},
|
|
|
|
word = function () {
|
|
|
|
// true, false, or null.
|
|
|
|
switch (ch) {
|
|
case 't':
|
|
next('t');
|
|
next('r');
|
|
next('u');
|
|
next('e');
|
|
return true;
|
|
case 'f':
|
|
next('f');
|
|
next('a');
|
|
next('l');
|
|
next('s');
|
|
next('e');
|
|
return false;
|
|
case 'n':
|
|
next('n');
|
|
next('u');
|
|
next('l');
|
|
next('l');
|
|
return null;
|
|
}
|
|
error("Unexpected '" + ch + "'");
|
|
},
|
|
|
|
value, // Place holder for the value function.
|
|
|
|
array = function () {
|
|
|
|
// Parse an array value.
|
|
|
|
var array = [];
|
|
|
|
if (ch === '[') {
|
|
next('[');
|
|
white();
|
|
if (ch === ']') {
|
|
next(']');
|
|
return array; // empty array
|
|
}
|
|
while (ch) {
|
|
array.push(value());
|
|
white();
|
|
if (ch === ']') {
|
|
next(']');
|
|
return array;
|
|
}
|
|
next(',');
|
|
white();
|
|
}
|
|
}
|
|
error("Bad array");
|
|
},
|
|
|
|
object = function () {
|
|
|
|
// Parse an object value.
|
|
|
|
var key,
|
|
object = {};
|
|
|
|
if (ch === '{') {
|
|
next('{');
|
|
white();
|
|
if (ch === '}') {
|
|
next('}');
|
|
return object; // empty object
|
|
}
|
|
while (ch) {
|
|
key = string();
|
|
white();
|
|
next(':');
|
|
if (Object.hasOwnProperty.call(object, key)) {
|
|
error('Duplicate key "' + key + '"');
|
|
}
|
|
object[key] = value();
|
|
white();
|
|
if (ch === '}') {
|
|
next('}');
|
|
return object;
|
|
}
|
|
next(',');
|
|
white();
|
|
}
|
|
}
|
|
error("Bad object");
|
|
};
|
|
|
|
value = function () {
|
|
|
|
// Parse a JSON value. It could be an object, an array, a string, a number,
|
|
// or a word.
|
|
|
|
white();
|
|
switch (ch) {
|
|
case '{':
|
|
return object();
|
|
case '[':
|
|
return array();
|
|
case '"':
|
|
return string();
|
|
case '-':
|
|
return number();
|
|
default:
|
|
return ch >= '0' && ch <= '9' ? number() : word();
|
|
}
|
|
};
|
|
|
|
// Return the json_parse function. It will have access to all of the above
|
|
// functions and variables.
|
|
|
|
module.exports = function (source, reviver) {
|
|
var result;
|
|
|
|
text = source;
|
|
at = 0;
|
|
ch = ' ';
|
|
result = value();
|
|
white();
|
|
if (ch) {
|
|
error("Syntax error");
|
|
}
|
|
|
|
// If there is a reviver function, we recursively walk the new structure,
|
|
// passing each name/value pair to the reviver function for possible
|
|
// transformation, starting with a temporary root object that holds the result
|
|
// in an empty key. If there is not a reviver function, we simply return the
|
|
// result.
|
|
|
|
return typeof reviver === 'function' ? (function walk(holder, key) {
|
|
var k, v, value = holder[key];
|
|
if (value && typeof value === 'object') {
|
|
for (k in value) {
|
|
if (Object.prototype.hasOwnProperty.call(value, k)) {
|
|
v = walk(value, k);
|
|
if (v !== undefined) {
|
|
value[k] = v;
|
|
} else {
|
|
delete value[k];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return reviver.call(holder, key, value);
|
|
}({'': result}, '')) : result;
|
|
};
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/jsonify/lib/parse.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/jsonify/lib/stringify.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/jsonify/lib";
|
|
var __filename = "/node_modules/jsonify/lib/stringify.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/jsonify/lib");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/jsonify/lib");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/jsonify/lib/stringify.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
var cx = /[\u0000\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g,
|
|
escapable = /[\\\"\x00-\x1f\x7f-\x9f\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g,
|
|
gap,
|
|
indent,
|
|
meta = { // table of character substitutions
|
|
'\b': '\\b',
|
|
'\t': '\\t',
|
|
'\n': '\\n',
|
|
'\f': '\\f',
|
|
'\r': '\\r',
|
|
'"' : '\\"',
|
|
'\\': '\\\\'
|
|
},
|
|
rep;
|
|
|
|
function quote(string) {
|
|
// If the string contains no control characters, no quote characters, and no
|
|
// backslash characters, then we can safely slap some quotes around it.
|
|
// Otherwise we must also replace the offending characters with safe escape
|
|
// sequences.
|
|
|
|
escapable.lastIndex = 0;
|
|
return escapable.test(string) ? '"' + string.replace(escapable, function (a) {
|
|
var c = meta[a];
|
|
return typeof c === 'string' ? c :
|
|
'\\u' + ('0000' + a.charCodeAt(0).toString(16)).slice(-4);
|
|
}) + '"' : '"' + string + '"';
|
|
}
|
|
|
|
function str(key, holder) {
|
|
// Produce a string from holder[key].
|
|
var i, // The loop counter.
|
|
k, // The member key.
|
|
v, // The member value.
|
|
length,
|
|
mind = gap,
|
|
partial,
|
|
value = holder[key];
|
|
|
|
// If the value has a toJSON method, call it to obtain a replacement value.
|
|
if (value && typeof value === 'object' &&
|
|
typeof value.toJSON === 'function') {
|
|
value = value.toJSON(key);
|
|
}
|
|
|
|
// If we were called with a replacer function, then call the replacer to
|
|
// obtain a replacement value.
|
|
if (typeof rep === 'function') {
|
|
value = rep.call(holder, key, value);
|
|
}
|
|
|
|
// What happens next depends on the value's type.
|
|
switch (typeof value) {
|
|
case 'string':
|
|
return quote(value);
|
|
|
|
case 'number':
|
|
// JSON numbers must be finite. Encode non-finite numbers as null.
|
|
return isFinite(value) ? String(value) : 'null';
|
|
|
|
case 'boolean':
|
|
case 'null':
|
|
// If the value is a boolean or null, convert it to a string. Note:
|
|
// typeof null does not produce 'null'. The case is included here in
|
|
// the remote chance that this gets fixed someday.
|
|
return String(value);
|
|
|
|
case 'object':
|
|
if (!value) return 'null';
|
|
gap += indent;
|
|
partial = [];
|
|
|
|
// Array.isArray
|
|
if (Object.prototype.toString.apply(value) === '[object Array]') {
|
|
length = value.length;
|
|
for (i = 0; i < length; i += 1) {
|
|
partial[i] = str(i, value) || 'null';
|
|
}
|
|
|
|
// Join all of the elements together, separated with commas, and
|
|
// wrap them in brackets.
|
|
v = partial.length === 0 ? '[]' : gap ?
|
|
'[\n' + gap + partial.join(',\n' + gap) + '\n' + mind + ']' :
|
|
'[' + partial.join(',') + ']';
|
|
gap = mind;
|
|
return v;
|
|
}
|
|
|
|
// If the replacer is an array, use it to select the members to be
|
|
// stringified.
|
|
if (rep && typeof rep === 'object') {
|
|
length = rep.length;
|
|
for (i = 0; i < length; i += 1) {
|
|
k = rep[i];
|
|
if (typeof k === 'string') {
|
|
v = str(k, value);
|
|
if (v) {
|
|
partial.push(quote(k) + (gap ? ': ' : ':') + v);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
// Otherwise, iterate through all of the keys in the object.
|
|
for (k in value) {
|
|
if (Object.prototype.hasOwnProperty.call(value, k)) {
|
|
v = str(k, value);
|
|
if (v) {
|
|
partial.push(quote(k) + (gap ? ': ' : ':') + v);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Join all of the member texts together, separated with commas,
|
|
// and wrap them in braces.
|
|
|
|
v = partial.length === 0 ? '{}' : gap ?
|
|
'{\n' + gap + partial.join(',\n' + gap) + '\n' + mind + '}' :
|
|
'{' + partial.join(',') + '}';
|
|
gap = mind;
|
|
return v;
|
|
}
|
|
}
|
|
|
|
module.exports = function (value, replacer, space) {
|
|
var i;
|
|
gap = '';
|
|
indent = '';
|
|
|
|
// If the space parameter is a number, make an indent string containing that
|
|
// many spaces.
|
|
if (typeof space === 'number') {
|
|
for (i = 0; i < space; i += 1) {
|
|
indent += ' ';
|
|
}
|
|
}
|
|
// If the space parameter is a string, it will be used as the indent string.
|
|
else if (typeof space === 'string') {
|
|
indent = space;
|
|
}
|
|
|
|
// If there is a replacer, it must be a function or an array.
|
|
// Otherwise, throw an error.
|
|
rep = replacer;
|
|
if (replacer && typeof replacer !== 'function'
|
|
&& (typeof replacer !== 'object' || typeof replacer.length !== 'number')) {
|
|
throw new Error('JSON.stringify');
|
|
}
|
|
|
|
// Make a fake root object containing our value under the key of ''.
|
|
// Return the result of stringifying the value.
|
|
return str('', {'': value});
|
|
};
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/jsonify/lib/stringify.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
require.modules["/node_modules/burrito/index.js"] = function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/node_modules/burrito";
|
|
var __filename = "/node_modules/burrito/index.js";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/node_modules/burrito");
|
|
};
|
|
|
|
require.resolve = function (file) {
|
|
return __require.resolve(name, "/node_modules/burrito");
|
|
};
|
|
|
|
require.modules = __require.modules;
|
|
__require.modules["/node_modules/burrito/index.js"]._cached = module.exports;
|
|
|
|
(function () {
|
|
var uglify = require('uglify-js');
|
|
var parser = uglify.parser;
|
|
var parse = function (expr) {
|
|
if (typeof expr !== 'string') throw 'expression should be a string';
|
|
|
|
//try {
|
|
var args = [].slice.call(arguments);
|
|
var ast = parser.parse.apply(null, args);
|
|
/* }
|
|
catch (err) {
|
|
if (err.message === undefined
|
|
|| err.line === undefined
|
|
|| err.col === undefined
|
|
|| err.pos === undefined
|
|
) { throw err }
|
|
|
|
var e = new SyntaxError(
|
|
err.message
|
|
+ '\n at line ' + err.line + ':' + err.col + ' in expression:\n\n'
|
|
+ ' ' + expr.split(/\r?\n/)[err.line]
|
|
);
|
|
|
|
e.original = err;
|
|
e.line = err.line;
|
|
e.col = err.col;
|
|
e.pos = err.pos;
|
|
throw e;
|
|
}
|
|
*/
|
|
return ast;
|
|
};
|
|
|
|
var deparse = function (ast, b) {
|
|
return uglify.uglify.gen_code(ast, { beautify : b });
|
|
};
|
|
|
|
var traverse = require('traverse');
|
|
var vm = require('vm');
|
|
|
|
var burrito = module.exports = function (code, cb) {
|
|
var ast = Array_isArray(code)
|
|
? code // already an ast
|
|
: parse(code.toString(), false, true)
|
|
;
|
|
|
|
var ast_ = traverse(ast).map(function mapper () {
|
|
wrapNode(this, cb);
|
|
});
|
|
|
|
return deparse(parse(deparse(ast_)), true);
|
|
};
|
|
|
|
var wrapNode = burrito.wrapNode = function (state, cb) {
|
|
var node = state.node;
|
|
|
|
var ann = Array_isArray(node) && node[0]
|
|
&& typeof node[0] === 'object' && node[0].name
|
|
? node[0]
|
|
: null
|
|
;
|
|
|
|
if (!ann) return undefined;
|
|
|
|
var self = {
|
|
name : ann.name,
|
|
node : node,
|
|
start : node[0].start,
|
|
end : node[0].end,
|
|
value : node.slice(1),
|
|
state : state
|
|
};
|
|
|
|
self.wrap = function (s) {
|
|
var subsrc = deparse(
|
|
traverse(node).map(function (x) {
|
|
if (!this.isRoot) wrapNode(this, cb)
|
|
})
|
|
);
|
|
|
|
if (self.name === 'binary') {
|
|
var a = deparse(traverse(node[2]).map(function (x) {
|
|
if (!this.isRoot) wrapNode(this, cb)
|
|
}));
|
|
var b = deparse(traverse(node[3]).map(function (x) {
|
|
if (!this.isRoot) wrapNode(this, cb)
|
|
}));
|
|
}
|
|
|
|
var src = '';
|
|
|
|
if (typeof s === 'function') {
|
|
if (self.name === 'binary') {
|
|
src = s(subsrc, a, b);
|
|
}
|
|
else {
|
|
src = s(subsrc);
|
|
}
|
|
}
|
|
else {
|
|
src = s.toString()
|
|
.replace(/%s/g, function () {
|
|
return subsrc
|
|
})
|
|
;
|
|
|
|
if (self.name === 'binary') {
|
|
src = src
|
|
.replace(/%a/g, function () { return a })
|
|
.replace(/%b/g, function () { return b })
|
|
;
|
|
}
|
|
}
|
|
|
|
var expr = parse(src);
|
|
state.update(expr, true);
|
|
};
|
|
|
|
var cache = {};
|
|
|
|
self.parent = state.isRoot ? null : function () {
|
|
if (!cache.parent) {
|
|
var s = state;
|
|
var x;
|
|
do {
|
|
s = s.parent;
|
|
if (s) x = wrapNode(s);
|
|
} while (s && !x);
|
|
|
|
cache.parent = x;
|
|
}
|
|
|
|
return cache.parent;
|
|
};
|
|
|
|
self.source = function () {
|
|
if (!cache.source) cache.source = deparse(node);
|
|
return cache.source;
|
|
};
|
|
|
|
self.label = function () {
|
|
return burrito.label(self);
|
|
};
|
|
|
|
if (cb) cb.call(state, self);
|
|
|
|
if (self.node[0].name === 'conditional') {
|
|
self.wrap('[%s][0]');
|
|
}
|
|
|
|
return self;
|
|
}
|
|
|
|
burrito.microwave = function (code, context, cb) {
|
|
if (!cb) { cb = context; context = {} };
|
|
if (!context) context = {};
|
|
|
|
var src = burrito(code, cb);
|
|
return vm.runInNewContext(src, context);
|
|
};
|
|
|
|
burrito.generateName = function (len) {
|
|
var name = '';
|
|
var lower = '$'.charCodeAt(0);
|
|
var upper = 'z'.charCodeAt(0);
|
|
|
|
while (name.length < len) {
|
|
var c = String.fromCharCode(Math.floor(
|
|
Math.random() * (upper - lower + 1) + lower
|
|
));
|
|
if ((name + c).match(/^[A-Za-z_$][A-Za-z0-9_$]*$/)) name += c;
|
|
}
|
|
|
|
return name;
|
|
};
|
|
|
|
burrito.parse = parse;
|
|
burrito.deparse = deparse;
|
|
|
|
burrito.label = function (node) {
|
|
if (node.name === 'call') {
|
|
if (typeof node.value[0] === 'string') {
|
|
return node.value[0];
|
|
}
|
|
else if (node.value[0] && typeof node.value[0][1] === 'string') {
|
|
return node.value[0][1];
|
|
}
|
|
else {
|
|
return null;
|
|
}
|
|
}
|
|
else if (node.name === 'var') {
|
|
return node.value[0].map(function (x) { return x[0] });
|
|
}
|
|
else if (node.name === 'defun') {
|
|
return node.value[0];
|
|
}
|
|
else if (node.name === 'function') {
|
|
return node.value[0];
|
|
}
|
|
else {
|
|
return null;
|
|
}
|
|
};
|
|
|
|
var Array_isArray = Array.isArray || function isArray (xs) {
|
|
return Object.prototype.toString.call(xs) === '[object Array]';
|
|
};
|
|
;
|
|
}).call(module.exports);
|
|
|
|
__require.modules["/node_modules/burrito/index.js"]._cached = module.exports;
|
|
return module.exports;
|
|
};
|
|
|
|
process.nextTick(function () {
|
|
var module = { exports : {} };
|
|
var exports = module.exports;
|
|
var __dirname = "/";
|
|
var __filename = "//home/substack/projects/node-burrito/example/web";
|
|
|
|
var require = function (file) {
|
|
return __require(file, "/");
|
|
};
|
|
require.modules = __require.modules;
|
|
|
|
var burrito = require('burrito');
|
|
var json = require('jsonify');
|
|
|
|
var src = [
|
|
'function f () { g() }',
|
|
'function g () { h() }',
|
|
'function h () { throw "moo" + Array(x).join("!") }',
|
|
'var x = 4',
|
|
'f()'
|
|
].join('\r\n');
|
|
|
|
window.onload = function () {
|
|
burrito(src, function (node) {
|
|
document.body.innerHTML += node.name + '<br>\n';
|
|
});
|
|
};
|
|
if (document.readyState === 'complete') window.onload();
|
|
;
|
|
});
|