aboutsummaryrefslogtreecommitdiff
path: root/lib/propmangle.js
diff options
context:
space:
mode:
authorMihai Bazon <mihai.bazon@gmail.com>2015-03-14 11:22:28 +0200
committerMihai Bazon <mihai.bazon@gmail.com>2015-03-14 11:22:28 +0200
commitea3430102cf87b01b1e1bef275e2a8b8c8a70988 (patch)
tree0bbae0a90fc485e177b3ca71e3566ed8b04fe5f9 /lib/propmangle.js
parent9de7199b88edb37753a36a9688d34a4be801f41b (diff)
downloadtracifyjs-ea3430102cf87b01b1e1bef275e2a8b8c8a70988.tar.gz
tracifyjs-ea3430102cf87b01b1e1bef275e2a8b8c8a70988.zip
Add property name mangler
We only touch properties that are present in an object literal, or which are assigned to. Example: x = { foo: 1 }; x.bar = 2; x["baz"] = 3; x[cond ? "qwe" : "asd"] = 4; console.log(x.stuff); The names "foo", "bar", "baz", "qwe" and "asd" will be mangled, and the resulting mangled names will be used for the same properties throughout the code. The "stuff" will not be, since it's just referenced but never assigned to. This *will* break most of the code out there, but could work on carefully written code: do not use eval, do not define methods or properties by walking an array of names, etc. Also, a comprehensive list of exclusions needs to be passed, to avoid mangling properties that are standard in JavaScript, DOM, used in external libraries etc.
Diffstat (limited to 'lib/propmangle.js')
-rw-r--r--lib/propmangle.js211
1 files changed, 211 insertions, 0 deletions
diff --git a/lib/propmangle.js b/lib/propmangle.js
new file mode 100644
index 00000000..41eeffe4
--- /dev/null
+++ b/lib/propmangle.js
@@ -0,0 +1,211 @@
+/***********************************************************************
+
+ A JavaScript tokenizer / parser / beautifier / compressor.
+ https://github.com/mishoo/UglifyJS2
+
+ -------------------------------- (C) ---------------------------------
+
+ Author: Mihai Bazon
+ <mihai.bazon@gmail.com>
+ http://mihai.bazon.net/blog
+
+ Distributed under the BSD license:
+
+ Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions
+ are met:
+
+ * Redistributions of source code must retain the above
+ copyright notice, this list of conditions and the following
+ disclaimer.
+
+ * Redistributions in binary form must reproduce the above
+ copyright notice, this list of conditions and the following
+ disclaimer in the documentation and/or other materials
+ provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+ OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+ TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+ THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ SUCH DAMAGE.
+
+ ***********************************************************************/
+
+"use strict";
+
+function find_builtins() {
+ var a = [];
+ [ Object, Array, Function, Number,
+ String, Boolean, Error, Math,
+ Date, RegExp
+ ].forEach(function(ctor){
+ Object.getOwnPropertyNames(ctor).map(add);
+ if (ctor.prototype) {
+ Object.getOwnPropertyNames(ctor.prototype).map(add);
+ }
+ });
+ function add(name) {
+ push_uniq(a, name);
+ }
+ return a;
+}
+
+function mangle_properties(ast, options) {
+ options = defaults(options, {
+ reserved : null,
+ cache : null
+ });
+
+ var reserved = options.reserved;
+ if (reserved == null)
+ reserved = find_builtins();
+
+ var cache = options.cache;
+ if (cache == null) {
+ cache = {
+ cname: -1,
+ props: new Dictionary()
+ };
+ }
+
+ var names_to_mangle = [];
+
+ // step 1: find candidates to mangle
+ ast.walk(new TreeWalker(function(node){
+ if (node instanceof AST_ObjectKeyVal) {
+ add(node.key);
+ }
+ else if (node instanceof AST_ObjectProperty) {
+ // setter or getter, since KeyVal is handled above
+ add(node.key.name);
+ }
+ else if (node instanceof AST_Dot) {
+ if (this.parent() instanceof AST_Assign) {
+ add(node.property);
+ }
+ }
+ else if (node instanceof AST_Sub) {
+ if (this.parent() instanceof AST_Assign) {
+ addStrings(node.property);
+ }
+ }
+ }));
+
+ // step 2: transform the tree, renaming properties
+ return ast.transform(new TreeTransformer(null, function(node){
+ if (node instanceof AST_ObjectKeyVal) {
+ if (should_mangle(node.key)) {
+ node.key = mangle(node.key);
+ }
+ }
+ else if (node instanceof AST_ObjectProperty) {
+ // setter or getter
+ if (should_mangle(node.key.name)) {
+ node.key.name = mangle(node.key.name);
+ }
+ }
+ else if (node instanceof AST_Dot) {
+ if (should_mangle(node.property)) {
+ node.property = mangle(node.property);
+ }
+ }
+ else if (node instanceof AST_Sub) {
+ node.property = mangleStrings(node.property);
+ }
+ // else if (node instanceof AST_String) {
+ // if (should_mangle(node.value)) {
+ // AST_Node.warn(
+ // "Found \"{prop}\" property candidate for mangling in an arbitrary string [{file}:{line},{col}]", {
+ // file : node.start.file,
+ // line : node.start.line,
+ // col : node.start.col,
+ // prop : node.value
+ // }
+ // );
+ // }
+ // }
+ }));
+
+ // only function declarations after this line
+
+ function can_mangle(name) {
+ if (reserved.indexOf(name) >= 0) return false;
+ if (/^[0-9.]+$/.test(name)) return false;
+ return true;
+ }
+
+ function should_mangle(name) {
+ return names_to_mangle.indexOf(name) >= 0;
+ }
+
+ function add(name) {
+ if (can_mangle(name))
+ push_uniq(names_to_mangle, name);
+ }
+
+ function mangle(name) {
+ var mangled = cache.props.get(name);
+ if (!mangled) {
+ do {
+ mangled = base54(++cache.cname);
+ } while (!can_mangle(mangled));
+ cache.props.set(name, mangled);
+ }
+ return mangled;
+ }
+
+ function addStrings(node) {
+ var out = {};
+ try {
+ (function walk(node){
+ node.walk(new TreeWalker(function(node){
+ if (node instanceof AST_Seq) {
+ walk(node.cdr);
+ return true;
+ }
+ if (node instanceof AST_String) {
+ add(node.value);
+ return true;
+ }
+ if (node instanceof AST_Conditional) {
+ walk(node.consequent);
+ walk(node.alternative);
+ return true;
+ }
+ throw out;
+ }));
+ })(node);
+ } catch(ex) {
+ if (ex !== out) throw ex;
+ }
+ }
+
+ function mangleStrings(node) {
+ return node.transform(new TreeTransformer(function(node){
+ if (node instanceof AST_Seq) {
+ node.cdr = mangleStrings(node.cdr);
+ }
+ else if (node instanceof AST_String) {
+ if (should_mangle(node.value)) {
+ node.value = mangle(node.value);
+ }
+ }
+ else if (node instanceof AST_Conditional) {
+ node.consequent = mangleStrings(node.consequent);
+ node.alternative = mangleStrings(node.alternative);
+ }
+ return node;
+ }));
+ }
+
+}