aboutsummaryrefslogtreecommitdiff
path: root/lib/compress.js
diff options
context:
space:
mode:
Diffstat (limited to 'lib/compress.js')
-rw-r--r--lib/compress.js71
1 files changed, 40 insertions, 31 deletions
diff --git a/lib/compress.js b/lib/compress.js
index 3200a66f..db6a26d6 100644
--- a/lib/compress.js
+++ b/lib/compress.js
@@ -1056,31 +1056,37 @@ merge(Compressor.prototype, {
throw def;
});
def(AST_Binary, function(c){
- var left = this.left, right = this.right;
+ var left = this.left, right = this.right, result;
switch (this.operator) {
- case "&&" : return ev(left, c) && ev(right, c);
- case "||" : return ev(left, c) || ev(right, c);
- case "|" : return ev(left, c) | ev(right, c);
- case "&" : return ev(left, c) & ev(right, c);
- case "^" : return ev(left, c) ^ ev(right, c);
- case "+" : return ev(left, c) + ev(right, c);
- case "*" : return ev(left, c) * ev(right, c);
- case "/" : return ev(left, c) / ev(right, c);
- case "%" : return ev(left, c) % ev(right, c);
- case "-" : return ev(left, c) - ev(right, c);
- case "<<" : return ev(left, c) << ev(right, c);
- case ">>" : return ev(left, c) >> ev(right, c);
- case ">>>" : return ev(left, c) >>> ev(right, c);
- case "==" : return ev(left, c) == ev(right, c);
- case "===" : return ev(left, c) === ev(right, c);
- case "!=" : return ev(left, c) != ev(right, c);
- case "!==" : return ev(left, c) !== ev(right, c);
- case "<" : return ev(left, c) < ev(right, c);
- case "<=" : return ev(left, c) <= ev(right, c);
- case ">" : return ev(left, c) > ev(right, c);
- case ">=" : return ev(left, c) >= ev(right, c);
- }
- throw def;
+ case "&&" : result = ev(left, c) && ev(right, c); break;
+ case "||" : result = ev(left, c) || ev(right, c); break;
+ case "|" : result = ev(left, c) | ev(right, c); break;
+ case "&" : result = ev(left, c) & ev(right, c); break;
+ case "^" : result = ev(left, c) ^ ev(right, c); break;
+ case "+" : result = ev(left, c) + ev(right, c); break;
+ case "*" : result = ev(left, c) * ev(right, c); break;
+ case "/" : result = ev(left, c) / ev(right, c); break;
+ case "%" : result = ev(left, c) % ev(right, c); break;
+ case "-" : result = ev(left, c) - ev(right, c); break;
+ case "<<" : result = ev(left, c) << ev(right, c); break;
+ case ">>" : result = ev(left, c) >> ev(right, c); break;
+ case ">>>" : result = ev(left, c) >>> ev(right, c); break;
+ case "==" : result = ev(left, c) == ev(right, c); break;
+ case "===" : result = ev(left, c) === ev(right, c); break;
+ case "!=" : result = ev(left, c) != ev(right, c); break;
+ case "!==" : result = ev(left, c) !== ev(right, c); break;
+ case "<" : result = ev(left, c) < ev(right, c); break;
+ case "<=" : result = ev(left, c) <= ev(right, c); break;
+ case ">" : result = ev(left, c) > ev(right, c); break;
+ case ">=" : result = ev(left, c) >= ev(right, c); break;
+ default:
+ throw def;
+ }
+ if (isNaN(result) && c.find_parent(AST_With)) {
+ // leave original expression as is
+ throw def;
+ }
+ return result;
});
def(AST_Conditional, function(compressor){
return ev(this.condition, compressor)
@@ -2599,13 +2605,16 @@ merge(Compressor.prototype, {
if (defines && HOP(defines, self.name)) {
return make_node_from_constant(compressor, defines[self.name], self);
}
- switch (self.name) {
- case "undefined":
- return make_node(AST_Undefined, self);
- case "NaN":
- return make_node(AST_NaN, self).transform(compressor);
- case "Infinity":
- return make_node(AST_Infinity, self).transform(compressor);
+ // testing against !self.scope.uses_with first is an optimization
+ if (!self.scope.uses_with || !compressor.find_parent(AST_With)) {
+ switch (self.name) {
+ case "undefined":
+ return make_node(AST_Undefined, self);
+ case "NaN":
+ return make_node(AST_NaN, self).transform(compressor);
+ case "Infinity":
+ return make_node(AST_Infinity, self).transform(compressor);
+ }
}
}
return self;