terser 5.7.1 → 5.10.0

package/lib/compress/index.js

@@ -41,34 +41,11 @@
 
  ***********************************************************************/
 
-"use strict";
-
-import {
-    defaults,
-    HOP,
-    keep_name,
-    make_node,
-    makePredicate,
-    map_add,
-    MAP,
-    member,
-    noop,
-    remove,
-    return_false,
-    return_null,
-    return_this,
-    return_true,
-    string_template,
-    regexp_source_fix,
-    has_annotation
-} from "../utils/index.js";
-import { first_in_statement, } from "../utils/first_in_statement.js";
 import {
     AST_Accessor,
     AST_Array,
     AST_Arrow,
     AST_Assign,
-    AST_Await,
     AST_BigInt,
     AST_Binary,
     AST_Block,
@@ -76,7 +53,6 @@ import {
     AST_Boolean,
     AST_Break,
     AST_Call,
-    AST_Case,
     AST_Catch,
     AST_Chain,
     AST_Class,
@@ -86,7 +62,6 @@ import {
     AST_Conditional,
     AST_Const,
     AST_Constant,
-    AST_Continue,
     AST_Debugger,
     AST_Default,
     AST_DefaultAssign,
@@ -103,7 +78,6 @@ import {
     AST_Expansion,
     AST_Export,
     AST_False,
-    AST_Finally,
     AST_For,
     AST_ForIn,
     AST_Function,
@@ -112,21 +86,17 @@ import {
     AST_Import,
     AST_Infinity,
     AST_IterationStatement,
-    AST_Jump,
     AST_LabeledStatement,
     AST_Lambda,
     AST_Let,
-    AST_LoopControl,
     AST_NaN,
     AST_New,
     AST_Node,
     AST_Null,
     AST_Number,
     AST_Object,
-    AST_ObjectGetter,
     AST_ObjectKeyVal,
     AST_ObjectProperty,
-    AST_ObjectSetter,
     AST_PrefixedTemplateString,
     AST_PropAccess,
     AST_RegExp,
@@ -143,7 +113,6 @@ import {
     AST_SymbolBlockDeclaration,
     AST_SymbolCatch,
     AST_SymbolClassProperty,
-    AST_SymbolConst,
     AST_SymbolDeclaration,
     AST_SymbolDefun,
     AST_SymbolExport,
@@ -153,7 +122,6 @@ import {
     AST_SymbolMethod,
     AST_SymbolRef,
     AST_SymbolVar,
-    AST_TemplateSegment,
     AST_TemplateString,
     AST_This,
     AST_Toplevel,
@@ -173,13 +141,28 @@ import {
     TreeWalker,
     walk,
     walk_abort,
-    walk_body,
     walk_parent,
 
     _INLINE,
     _NOINLINE,
     _PURE
 } from "../ast.js";
+import {
+    defaults,
+    HOP,
+    keep_name,
+    make_node,
+    makePredicate,
+    map_add,
+    MAP,
+    member,
+    remove,
+    return_false,
+    return_true,
+    regexp_source_fix,
+    has_annotation
+} from "../utils/index.js";
+import { first_in_statement } from "../utils/first_in_statement.js";
 import { equivalent_to } from "../equivalent-to.js";
 import {
     is_basic_identifier_string,
@@ -194,24 +177,52 @@ import {
 } from "../scope.js";
 import "../size.js";
 
-const UNUSED    = 0b00000001;
-const TRUTHY    = 0b00000010;
-const FALSY     = 0b00000100;
-const UNDEFINED = 0b00001000;
-const INLINED   = 0b00010000;
-// Nodes to which values are ever written. Used when keep_assign is part of the unused option string.
-const WRITE_ONLY= 0b00100000;
-
-// information specific to a single compression pass
-const SQUEEZED  = 0b0000000100000000;
-const OPTIMIZED = 0b0000001000000000;
-const TOP       = 0b0000010000000000;
-
-const CLEAR_BETWEEN_PASSES = SQUEEZED | OPTIMIZED | TOP;
-
-const has_flag = (node, flag) => node.flags & flag;
-const set_flag = (node, flag) => { node.flags |= flag; };
-const clear_flag = (node, flag) => { node.flags &= ~flag; };
+import "./evaluate.js";
+import "./drop-side-effect-free.js";
+import "./reduce-vars.js";
+import {
+    is_undeclared_ref,
+    lazy_op,
+    is_nullish,
+    is_undefined,
+    is_lhs,
+    aborts,
+} from "./inference.js";
+import {
+    SQUEEZED,
+    OPTIMIZED,
+    INLINED,
+    CLEAR_BETWEEN_PASSES,
+    TOP,
+    WRITE_ONLY,
+    UNDEFINED,
+    UNUSED,
+    TRUTHY,
+    FALSY,
+
+    has_flag,
+    set_flag,
+    clear_flag,
+} from "./compressor-flags.js";
+import {
+    make_sequence,
+    best_of,
+    best_of_expression,
+    make_node_from_constant,
+    merge_sequence,
+    get_simple_key,
+    has_break_or_continue,
+    maintain_this_binding,
+    identifier_atom,
+    is_identifier_atom,
+    is_func_expr,
+    is_ref_of,
+    can_be_evicted_from_block,
+    as_statement_array,
+    is_iife_call,
+    is_recursive_ref
+} from "./common.js";
+import { tighten_body, trim_unreachable_code } from "./tighten-body.js";
 
 class Compressor extends TreeWalker {
     constructor(options, { false_by_default = false, mangle_options = false }) {
@@ -379,7 +390,8 @@ class Compressor extends TreeWalker {
         var passes = +this.options.passes || 1;
         var min_count = 1 / 0;
         var stopping = false;
-        var mangle = { ie8: this.option("ie8") };
+        var nth_identifier = this.mangle_options && this.mangle_options.nth_identifier || base54;
+        var mangle = { ie8: this.option("ie8"), nth_identifier: nth_identifier };
         for (var pass = 0; pass < passes; pass++) {
             this._toplevel.figure_out_scope(mangle);
             if (pass === 0 && this.option("drop_console")) {
@@ -488,9 +500,9 @@ AST_Scope.DEFMETHOD("process_expression", function(insert, compressor) {
         if (!insert && node instanceof AST_Return) {
             if (compressor) {
                 var value = node.value && node.value.drop_side_effect_free(compressor, true);
-                return value ? make_node(AST_SimpleStatement, node, {
-                    body: value
-                }) : make_node(AST_EmptyStatement, node);
+                return value
+                    ? make_node(AST_SimpleStatement, node, { body: value })
+                    : make_node(AST_EmptyStatement, node);
             }
             return make_node(AST_SimpleStatement, node, {
                 body: node.value || make_node(AST_UnaryPrefix, node, {
@@ -522,604 +534,6 @@ AST_Scope.DEFMETHOD("process_expression", function(insert, compressor) {
     self.transform(tt);
 });
 
-function read_property(obj, key) {
-    key = get_value(key);
-    if (key instanceof AST_Node) return;
-
-    var value;
-    if (obj instanceof AST_Array) {
-        var elements = obj.elements;
-        if (key == "length") return make_node_from_constant(elements.length, obj);
-        if (typeof key == "number" && key in elements) value = elements[key];
-    } else if (obj instanceof AST_Object) {
-        key = "" + key;
-        var props = obj.properties;
-        for (var i = props.length; --i >= 0;) {
-            var prop = props[i];
-            if (!(prop instanceof AST_ObjectKeyVal)) return;
-            if (!value && props[i].key === key) value = props[i].value;
-        }
-    }
-
-    return value instanceof AST_SymbolRef && value.fixed_value() || value;
-}
-
-function is_modified(compressor, tw, node, value, level, immutable) {
-    var parent = tw.parent(level);
-    var lhs = is_lhs(node, parent);
-    if (lhs) return lhs;
-    if (!immutable
-        && parent instanceof AST_Call
-        && parent.expression === node
-        && !(value instanceof AST_Arrow)
-        && !(value instanceof AST_Class)
-        && !parent.is_callee_pure(compressor)
-        && (!(value instanceof AST_Function)
-            || !(parent instanceof AST_New) && value.contains_this())) {
-        return true;
-    }
-    if (parent instanceof AST_Array) {
-        return is_modified(compressor, tw, parent, parent, level + 1);
-    }
-    if (parent instanceof AST_ObjectKeyVal && node === parent.value) {
-        var obj = tw.parent(level + 1);
-        return is_modified(compressor, tw, obj, obj, level + 2);
-    }
-    if (parent instanceof AST_PropAccess && parent.expression === node) {
-        var prop = read_property(value, parent.property);
-        return !immutable && is_modified(compressor, tw, parent, prop, level + 1);
-    }
-}
-
-(function(def_reduce_vars) {
-    def_reduce_vars(AST_Node, noop);
-
-    function reset_def(compressor, def) {
-        def.assignments = 0;
-        def.chained = false;
-        def.direct_access = false;
-        def.escaped = 0;
-        def.recursive_refs = 0;
-        def.references = [];
-        def.single_use = undefined;
-        if (def.scope.pinned()) {
-            def.fixed = false;
-        } else if (def.orig[0] instanceof AST_SymbolConst || !compressor.exposed(def)) {
-            def.fixed = def.init;
-        } else {
-            def.fixed = false;
-        }
-    }
-
-    function reset_variables(tw, compressor, node) {
-        node.variables.forEach(function(def) {
-            reset_def(compressor, def);
-            if (def.fixed === null) {
-                tw.defs_to_safe_ids.set(def.id, tw.safe_ids);
-                mark(tw, def, true);
-            } else if (def.fixed) {
-                tw.loop_ids.set(def.id, tw.in_loop);
-                mark(tw, def, true);
-            }
-        });
-    }
-
-    function reset_block_variables(compressor, node) {
-        if (node.block_scope) node.block_scope.variables.forEach((def) => {
-            reset_def(compressor, def);
-        });
-    }
-
-    function push(tw) {
-        tw.safe_ids = Object.create(tw.safe_ids);
-    }
-
-    function pop(tw) {
-        tw.safe_ids = Object.getPrototypeOf(tw.safe_ids);
-    }
-
-    function mark(tw, def, safe) {
-        tw.safe_ids[def.id] = safe;
-    }
-
-    function safe_to_read(tw, def) {
-        if (def.single_use == "m") return false;
-        if (tw.safe_ids[def.id]) {
-            if (def.fixed == null) {
-                var orig = def.orig[0];
-                if (orig instanceof AST_SymbolFunarg || orig.name == "arguments") return false;
-                def.fixed = make_node(AST_Undefined, orig);
-            }
-            return true;
-        }
-        return def.fixed instanceof AST_Defun;
-    }
-
-    function safe_to_assign(tw, def, scope, value) {
-        if (def.fixed === undefined) return true;
-        let def_safe_ids;
-        if (def.fixed === null
-            && (def_safe_ids = tw.defs_to_safe_ids.get(def.id))
-        ) {
-            def_safe_ids[def.id] = false;
-            tw.defs_to_safe_ids.delete(def.id);
-            return true;
-        }
-        if (!HOP(tw.safe_ids, def.id)) return false;
-        if (!safe_to_read(tw, def)) return false;
-        if (def.fixed === false) return false;
-        if (def.fixed != null && (!value || def.references.length > def.assignments)) return false;
-        if (def.fixed instanceof AST_Defun) {
-            return value instanceof AST_Node && def.fixed.parent_scope === scope;
-        }
-        return def.orig.every((sym) => {
-            return !(sym instanceof AST_SymbolConst
-                || sym instanceof AST_SymbolDefun
-                || sym instanceof AST_SymbolLambda);
-        });
-    }
-
-    function ref_once(tw, compressor, def) {
-        return compressor.option("unused")
-            && !def.scope.pinned()
-            && def.references.length - def.recursive_refs == 1
-            && tw.loop_ids.get(def.id) === tw.in_loop;
-    }
-
-    function is_immutable(value) {
-        if (!value) return false;
-        return value.is_constant()
-            || value instanceof AST_Lambda
-            || value instanceof AST_This;
-    }
-
-    // A definition "escapes" when its value can leave the point of use.
-    // Example: `a = b || c`
-    // In this example, "b" and "c" are escaping, because they're going into "a"
-    //
-    // def.escaped is != 0 when it escapes.
-    //
-    // When greater than 1, it means that N chained properties will be read off
-    // of that def before an escape occurs. This is useful for evaluating
-    // property accesses, where you need to know when to stop.
-    function mark_escaped(tw, d, scope, node, value, level = 0, depth = 1) {
-        var parent = tw.parent(level);
-        if (value) {
-            if (value.is_constant()) return;
-            if (value instanceof AST_ClassExpression) return;
-        }
-
-        if (
-            parent instanceof AST_Assign && (parent.operator === "=" || parent.logical) && node === parent.right
-            || parent instanceof AST_Call && (node !== parent.expression || parent instanceof AST_New)
-            || parent instanceof AST_Exit && node === parent.value && node.scope !== d.scope
-            || parent instanceof AST_VarDef && node === parent.value
-            || parent instanceof AST_Yield && node === parent.value && node.scope !== d.scope
-        ) {
-            if (depth > 1 && !(value && value.is_constant_expression(scope))) depth = 1;
-            if (!d.escaped || d.escaped > depth) d.escaped = depth;
-            return;
-        } else if (
-            parent instanceof AST_Array
-            || parent instanceof AST_Await
-            || parent instanceof AST_Binary && lazy_op.has(parent.operator)
-            || parent instanceof AST_Conditional && node !== parent.condition
-            || parent instanceof AST_Expansion
-            || parent instanceof AST_Sequence && node === parent.tail_node()
-        ) {
-            mark_escaped(tw, d, scope, parent, parent, level + 1, depth);
-        } else if (parent instanceof AST_ObjectKeyVal && node === parent.value) {
-            var obj = tw.parent(level + 1);
-
-            mark_escaped(tw, d, scope, obj, obj, level + 2, depth);
-        } else if (parent instanceof AST_PropAccess && node === parent.expression) {
-            value = read_property(value, parent.property);
-
-            mark_escaped(tw, d, scope, parent, value, level + 1, depth + 1);
-            if (value) return;
-        }
-
-        if (level > 0) return;
-        if (parent instanceof AST_Sequence && node !== parent.tail_node()) return;
-        if (parent instanceof AST_SimpleStatement) return;
-
-        d.direct_access = true;
-    }
-
-    const suppress = node => walk(node, node => {
-        if (!(node instanceof AST_Symbol)) return;
-        var d = node.definition();
-        if (!d) return;
-        if (node instanceof AST_SymbolRef) d.references.push(node);
-        d.fixed = false;
-    });
-    def_reduce_vars(AST_Accessor, function(tw, descend, compressor) {
-        push(tw);
-        reset_variables(tw, compressor, this);
-        descend();
-        pop(tw);
-        return true;
-    });
-    def_reduce_vars(AST_Assign, function(tw, descend, compressor) {
-        var node = this;
-        if (node.left instanceof AST_Destructuring) {
-            suppress(node.left);
-            return;
-        }
-
-        const finish_walk = () => {
-            if (node.logical) {
-                node.left.walk(tw);
-
-                push(tw);
-                node.right.walk(tw);
-                pop(tw);
-
-                return true;
-            }
-        };
-
-        var sym = node.left;
-        if (!(sym instanceof AST_SymbolRef)) return finish_walk();
-
-        var def = sym.definition();
-        var safe = safe_to_assign(tw, def, sym.scope, node.right);
-        def.assignments++;
-        if (!safe) return finish_walk();
-
-        var fixed = def.fixed;
-        if (!fixed && node.operator != "=" && !node.logical) return finish_walk();
-
-        var eq = node.operator == "=";
-        var value = eq ? node.right : node;
-        if (is_modified(compressor, tw, node, value, 0)) return finish_walk();
-
-        def.references.push(sym);
-
-        if (!node.logical) {
-            if (!eq) def.chained = true;
-
-            def.fixed = eq ? function() {
-                return node.right;
-            } : function() {
-                return make_node(AST_Binary, node, {
-                    operator: node.operator.slice(0, -1),
-                    left: fixed instanceof AST_Node ? fixed : fixed(),
-                    right: node.right
-                });
-            };
-        }
-
-        if (node.logical) {
-            mark(tw, def, false);
-            push(tw);
-            node.right.walk(tw);
-            pop(tw);
-            return true;
-        }
-
-        mark(tw, def, false);
-        node.right.walk(tw);
-        mark(tw, def, true);
-
-        mark_escaped(tw, def, sym.scope, node, value, 0, 1);
-
-        return true;
-    });
-    def_reduce_vars(AST_Binary, function(tw) {
-        if (!lazy_op.has(this.operator)) return;
-        this.left.walk(tw);
-        push(tw);
-        this.right.walk(tw);
-        pop(tw);
-        return true;
-    });
-    def_reduce_vars(AST_Block, function(tw, descend, compressor) {
-        reset_block_variables(compressor, this);
-    });
-    def_reduce_vars(AST_Case, function(tw) {
-        push(tw);
-        this.expression.walk(tw);
-        pop(tw);
-        push(tw);
-        walk_body(this, tw);
-        pop(tw);
-        return true;
-    });
-    def_reduce_vars(AST_Class, function(tw, descend) {
-        clear_flag(this, INLINED);
-        push(tw);
-        descend();
-        pop(tw);
-        return true;
-    });
-    def_reduce_vars(AST_Conditional, function(tw) {
-        this.condition.walk(tw);
-        push(tw);
-        this.consequent.walk(tw);
-        pop(tw);
-        push(tw);
-        this.alternative.walk(tw);
-        pop(tw);
-        return true;
-    });
-
-    def_reduce_vars(AST_Chain, function(tw, descend) {
-        // Chains' conditions apply left-to-right, cumulatively.
-        // If we walk normally we don't go in that order because we would pop before pushing again
-        // Solution: AST_PropAccess and AST_Call push when they are optional, and never pop.
-        // Then we pop everything when they are done being walked.
-        const safe_ids = tw.safe_ids;
-
-        descend();
-
-        // Unroll back to start
-        tw.safe_ids = safe_ids;
-        return true;
-    });
-    def_reduce_vars(AST_Call, function (tw) {
-        this.expression.walk(tw);
-
-        if (this.optional) {
-            // Never pop -- it's popped at AST_Chain above
-            push(tw);
-        }
-
-        for (const arg of this.args) arg.walk(tw);
-
-        return true;
-    });
-    def_reduce_vars(AST_PropAccess, function (tw) {
-        if (!this.optional) return;
-
-        this.expression.walk(tw);
-
-        // Never pop -- it's popped at AST_Chain above
-        push(tw);
-
-        if (this.property instanceof AST_Node) this.property.walk(tw);
-
-        return true;
-    });
-    def_reduce_vars(AST_Default, function(tw, descend) {
-        push(tw);
-        descend();
-        pop(tw);
-        return true;
-    });
-    function mark_lambda(tw, descend, compressor) {
-        clear_flag(this, INLINED);
-        push(tw);
-        reset_variables(tw, compressor, this);
-        if (this.uses_arguments) {
-            descend();
-            pop(tw);
-            return;
-        }
-        var iife;
-        if (!this.name
-            && (iife = tw.parent()) instanceof AST_Call
-            && iife.expression === this
-            && !iife.args.some(arg => arg instanceof AST_Expansion)
-            && this.argnames.every(arg_name => arg_name instanceof AST_Symbol)
-        ) {
-            // Virtually turn IIFE parameters into variable definitions:
-            //   (function(a,b) {...})(c,d) => (function() {var a=c,b=d; ...})()
-            // So existing transformation rules can work on them.
-            this.argnames.forEach((arg, i) => {
-                if (!arg.definition) return;
-                var d = arg.definition();
-                // Avoid setting fixed when there's more than one origin for a variable value
-                if (d.orig.length > 1) return;
-                if (d.fixed === undefined && (!this.uses_arguments || tw.has_directive("use strict"))) {
-                    d.fixed = function() {
-                        return iife.args[i] || make_node(AST_Undefined, iife);
-                    };
-                    tw.loop_ids.set(d.id, tw.in_loop);
-                    mark(tw, d, true);
-                } else {
-                    d.fixed = false;
-                }
-            });
-        }
-        descend();
-        pop(tw);
-        return true;
-    }
-
-    def_reduce_vars(AST_Lambda, mark_lambda);
-
-    def_reduce_vars(AST_Do, function(tw, descend, compressor) {
-        reset_block_variables(compressor, this);
-        const saved_loop = tw.in_loop;
-        tw.in_loop = this;
-        push(tw);
-        this.body.walk(tw);
-        if (has_break_or_continue(this)) {
-            pop(tw);
-            push(tw);
-        }
-        this.condition.walk(tw);
-        pop(tw);
-        tw.in_loop = saved_loop;
-        return true;
-    });
-    def_reduce_vars(AST_For, function(tw, descend, compressor) {
-        reset_block_variables(compressor, this);
-        if (this.init) this.init.walk(tw);
-        const saved_loop = tw.in_loop;
-        tw.in_loop = this;
-        push(tw);
-        if (this.condition) this.condition.walk(tw);
-        this.body.walk(tw);
-        if (this.step) {
-            if (has_break_or_continue(this)) {
-                pop(tw);
-                push(tw);
-            }
-            this.step.walk(tw);
-        }
-        pop(tw);
-        tw.in_loop = saved_loop;
-        return true;
-    });
-    def_reduce_vars(AST_ForIn, function(tw, descend, compressor) {
-        reset_block_variables(compressor, this);
-        suppress(this.init);
-        this.object.walk(tw);
-        const saved_loop = tw.in_loop;
-        tw.in_loop = this;
-        push(tw);
-        this.body.walk(tw);
-        pop(tw);
-        tw.in_loop = saved_loop;
-        return true;
-    });
-
-    def_reduce_vars(AST_If, function(tw) {
-        this.condition.walk(tw);
-        push(tw);
-        this.body.walk(tw);
-        pop(tw);
-        if (this.alternative) {
-            push(tw);
-            this.alternative.walk(tw);
-            pop(tw);
-        }
-        return true;
-    });
-    def_reduce_vars(AST_LabeledStatement, function(tw) {
-        push(tw);
-        this.body.walk(tw);
-        pop(tw);
-        return true;
-    });
-    def_reduce_vars(AST_SymbolCatch, function() {
-        this.definition().fixed = false;
-    });
-
-    def_reduce_vars(AST_SymbolRef, function(tw, descend, compressor) {
-        var d = this.definition();
-        d.references.push(this);
-        if (d.references.length == 1
-            && !d.fixed
-            && d.orig[0] instanceof AST_SymbolDefun) {
-            tw.loop_ids.set(d.id, tw.in_loop);
-        }
-        var fixed_value;
-        if (d.fixed === undefined || !safe_to_read(tw, d)) {
-            d.fixed = false;
-        } else if (d.fixed) {
-            fixed_value = this.fixed_value();
-            if (
-                fixed_value instanceof AST_Lambda
-                && recursive_ref(tw, d)
-            ) {
-                d.recursive_refs++;
-            } else if (fixed_value
-                && !compressor.exposed(d)
-                && ref_once(tw, compressor, d)
-            ) {
-                d.single_use =
-                    fixed_value instanceof AST_Lambda && !fixed_value.pinned()
-                    || fixed_value instanceof AST_Class
-                    || d.scope === this.scope && fixed_value.is_constant_expression();
-            } else {
-                d.single_use = false;
-            }
-            if (is_modified(compressor, tw, this, fixed_value, 0, is_immutable(fixed_value))) {
-                if (d.single_use) {
-                    d.single_use = "m";
-                } else {
-                    d.fixed = false;
-                }
-            }
-        }
-        mark_escaped(tw, d, this.scope, this, fixed_value, 0, 1);
-    });
-    def_reduce_vars(AST_Toplevel, function(tw, descend, compressor) {
-        this.globals.forEach(function(def) {
-            reset_def(compressor, def);
-        });
-        reset_variables(tw, compressor, this);
-    });
-    def_reduce_vars(AST_Try, function(tw, descend, compressor) {
-        reset_block_variables(compressor, this);
-        push(tw);
-        walk_body(this, tw);
-        pop(tw);
-        if (this.bcatch) {
-            push(tw);
-            this.bcatch.walk(tw);
-            pop(tw);
-        }
-        if (this.bfinally) this.bfinally.walk(tw);
-        return true;
-    });
-    def_reduce_vars(AST_Unary, function(tw) {
-        var node = this;
-        if (node.operator !== "++" && node.operator !== "--") return;
-        var exp = node.expression;
-        if (!(exp instanceof AST_SymbolRef)) return;
-        var def = exp.definition();
-        var safe = safe_to_assign(tw, def, exp.scope, true);
-        def.assignments++;
-        if (!safe) return;
-        var fixed = def.fixed;
-        if (!fixed) return;
-        def.references.push(exp);
-        def.chained = true;
-        def.fixed = function() {
-            return make_node(AST_Binary, node, {
-                operator: node.operator.slice(0, -1),
-                left: make_node(AST_UnaryPrefix, node, {
-                    operator: "+",
-                    expression: fixed instanceof AST_Node ? fixed : fixed()
-                }),
-                right: make_node(AST_Number, node, {
-                    value: 1
-                })
-            });
-        };
-        mark(tw, def, true);
-        return true;
-    });
-    def_reduce_vars(AST_VarDef, function(tw, descend) {
-        var node = this;
-        if (node.name instanceof AST_Destructuring) {
-            suppress(node.name);
-            return;
-        }
-        var d = node.name.definition();
-        if (node.value) {
-            if (safe_to_assign(tw, d, node.name.scope, node.value)) {
-                d.fixed = function() {
-                    return node.value;
-                };
-                tw.loop_ids.set(d.id, tw.in_loop);
-                mark(tw, d, false);
-                descend();
-                mark(tw, d, true);
-                return true;
-            } else {
-                d.fixed = false;
-            }
-        }
-    });
-    def_reduce_vars(AST_While, function(tw, descend, compressor) {
-        reset_block_variables(compressor, this);
-        const saved_loop = tw.in_loop;
-        tw.in_loop = this;
-        push(tw);
-        descend();
-        pop(tw);
-        tw.in_loop = saved_loop;
-        return true;
-    });
-})(function(node, func) {
-    node.DEFMETHOD("reduce_vars", func);
-});
-
 AST_Toplevel.DEFMETHOD("reset_opt_flags", function(compressor) {
     const self = this;
     const reduce_vars = compressor.option("reduce_vars");
@@ -1146,2606 +560,49 @@ AST_Toplevel.DEFMETHOD("reset_opt_flags", function(compressor) {
     self.walk(preparation);
 });
 
-AST_Symbol.DEFMETHOD("fixed_value", function() {
-    var fixed = this.thedef.fixed;
-    if (!fixed || fixed instanceof AST_Node) return fixed;
-    return fixed();
-});
-
-AST_SymbolRef.DEFMETHOD("is_immutable", function() {
-    var orig = this.definition().orig;
-    return orig.length == 1 && orig[0] instanceof AST_SymbolLambda;
-});
-
-function is_func_expr(node) {
-    return node instanceof AST_Arrow || node instanceof AST_Function;
-}
-
-function is_lhs_read_only(lhs) {
-    if (lhs instanceof AST_This) return true;
-    if (lhs instanceof AST_SymbolRef) return lhs.definition().orig[0] instanceof AST_SymbolLambda;
-    if (lhs instanceof AST_PropAccess) {
-        lhs = lhs.expression;
-        if (lhs instanceof AST_SymbolRef) {
-            if (lhs.is_immutable()) return false;
-            lhs = lhs.fixed_value();
-        }
-        if (!lhs) return true;
-        if (lhs instanceof AST_RegExp) return false;
-        if (lhs instanceof AST_Constant) return true;
-        return is_lhs_read_only(lhs);
-    }
-    return false;
-}
-
-function is_ref_of(ref, type) {
-    if (!(ref instanceof AST_SymbolRef)) return false;
-    var orig = ref.definition().orig;
-    for (var i = orig.length; --i >= 0;) {
-        if (orig[i] instanceof type) return true;
-    }
-}
-
-function find_scope(tw) {
-    for (let i = 0;;i++) {
-        const p = tw.parent(i);
-        if (p instanceof AST_Toplevel) return p;
-        if (p instanceof AST_Lambda) return p;
-        if (p.block_scope) return p.block_scope;
-    }
-}
-
-function find_variable(compressor, name) {
-    var scope, i = 0;
-    while (scope = compressor.parent(i++)) {
-        if (scope instanceof AST_Scope) break;
-        if (scope instanceof AST_Catch && scope.argname) {
-            scope = scope.argname.definition().scope;
-            break;
-        }
-    }
-    return scope.find_variable(name);
-}
-
-function make_sequence(orig, expressions) {
-    if (expressions.length == 1) return expressions[0];
-    if (expressions.length == 0) throw new Error("trying to create a sequence with length zero!");
-    return make_node(AST_Sequence, orig, {
-        expressions: expressions.reduce(merge_sequence, [])
-    });
-}
-
-function make_node_from_constant(val, orig) {
-    switch (typeof val) {
-      case "string":
-        return make_node(AST_String, orig, {
-            value: val
-        });
-      case "number":
-        if (isNaN(val)) return make_node(AST_NaN, orig);
-        if (isFinite(val)) {
-            return 1 / val < 0 ? make_node(AST_UnaryPrefix, orig, {
-                operator: "-",
-                expression: make_node(AST_Number, orig, { value: -val })
-            }) : make_node(AST_Number, orig, { value: val });
-        }
-        return val < 0 ? make_node(AST_UnaryPrefix, orig, {
-            operator: "-",
-            expression: make_node(AST_Infinity, orig)
-        }) : make_node(AST_Infinity, orig);
-      case "boolean":
-        return make_node(val ? AST_True : AST_False, orig);
-      case "undefined":
-        return make_node(AST_Undefined, orig);
-      default:
-        if (val === null) {
-            return make_node(AST_Null, orig, { value: null });
-        }
-        if (val instanceof RegExp) {
-            return make_node(AST_RegExp, orig, {
-                value: {
-                    source: regexp_source_fix(val.source),
-                    flags: val.flags
-                }
-            });
-        }
-        throw new Error(string_template("Can't handle constant of type: {type}", {
-            type: typeof val
-        }));
-    }
-}
-
-// we shouldn't compress (1,func)(something) to
-// func(something) because that changes the meaning of
-// the func (becomes lexical instead of global).
-function maintain_this_binding(parent, orig, val) {
-    if (parent instanceof AST_UnaryPrefix && parent.operator == "delete"
-        || parent instanceof AST_Call && parent.expression === orig
-            && (val instanceof AST_PropAccess || val instanceof AST_SymbolRef && val.name == "eval")) {
-        return make_sequence(orig, [ make_node(AST_Number, orig, { value: 0 }), val ]);
-    }
-    return val;
-}
-
-function merge_sequence(array, node) {
-    if (node instanceof AST_Sequence) {
-        array.push(...node.expressions);
-    } else {
-        array.push(node);
-    }
-    return array;
-}
-
-function as_statement_array(thing) {
-    if (thing === null) return [];
-    if (thing instanceof AST_BlockStatement) return thing.body;
-    if (thing instanceof AST_EmptyStatement) return [];
-    if (thing instanceof AST_Statement) return [ thing ];
-    throw new Error("Can't convert thing to statement array");
-}
-
-function is_empty(thing) {
-    if (thing === null) return true;
-    if (thing instanceof AST_EmptyStatement) return true;
-    if (thing instanceof AST_BlockStatement) return thing.body.length == 0;
-    return false;
-}
-
-function can_be_evicted_from_block(node) {
-    return !(
-        node instanceof AST_DefClass ||
-        node instanceof AST_Defun ||
-        node instanceof AST_Let ||
-        node instanceof AST_Const ||
-        node instanceof AST_Export ||
-        node instanceof AST_Import
-    );
-}
-
-function loop_body(x) {
-    if (x instanceof AST_IterationStatement) {
-        return x.body instanceof AST_BlockStatement ? x.body : x;
-    }
-    return x;
-}
-
-function is_iife_call(node) {
-    // Used to determine whether the node can benefit from negation.
-    // Not the case with arrow functions (you need an extra set of parens).
-    if (node.TYPE != "Call") return false;
-    return node.expression instanceof AST_Function || is_iife_call(node.expression);
-}
-
-function is_undeclared_ref(node) {
-    return node instanceof AST_SymbolRef && node.definition().undeclared;
-}
-
-var global_names = makePredicate("Array Boolean clearInterval clearTimeout console Date decodeURI decodeURIComponent encodeURI encodeURIComponent Error escape eval EvalError Function isFinite isNaN JSON Math Number parseFloat parseInt RangeError ReferenceError RegExp Object setInterval setTimeout String SyntaxError TypeError unescape URIError");
-AST_SymbolRef.DEFMETHOD("is_declared", function(compressor) {
-    return !this.definition().undeclared
-        || compressor.option("unsafe") && global_names.has(this.name);
-});
-
-var identifier_atom = makePredicate("Infinity NaN undefined");
-function is_identifier_atom(node) {
-    return node instanceof AST_Infinity
-        || node instanceof AST_NaN
-        || node instanceof AST_Undefined;
-}
-
-// Tighten a bunch of statements together. Used whenever there is a block.
-function tighten_body(statements, compressor) {
-    var in_loop, in_try;
-    var scope = compressor.find_parent(AST_Scope).get_defun_scope();
-    find_loop_scope_try();
-    var CHANGED, max_iter = 10;
-    do {
-        CHANGED = false;
-        eliminate_spurious_blocks(statements);
-        if (compressor.option("dead_code")) {
-            eliminate_dead_code(statements, compressor);
-        }
-        if (compressor.option("if_return")) {
-            handle_if_return(statements, compressor);
-        }
-        if (compressor.sequences_limit > 0) {
-            sequencesize(statements, compressor);
-            sequencesize_2(statements, compressor);
-        }
-        if (compressor.option("join_vars")) {
-            join_consecutive_vars(statements);
-        }
-        if (compressor.option("collapse_vars")) {
-            collapse(statements, compressor);
-        }
-    } while (CHANGED && max_iter-- > 0);
-
-    function find_loop_scope_try() {
-        var node = compressor.self(), level = 0;
-        do {
-            if (node instanceof AST_Catch || node instanceof AST_Finally) {
-                level++;
-            } else if (node instanceof AST_IterationStatement) {
-                in_loop = true;
-            } else if (node instanceof AST_Scope) {
-                scope = node;
-                break;
-            } else if (node instanceof AST_Try) {
-                in_try = true;
-            }
-        } while (node = compressor.parent(level++));
-    }
-
-    // Search from right to left for assignment-like expressions:
-    // - `var a = x;`
-    // - `a = x;`
-    // - `++a`
-    // For each candidate, scan from left to right for first usage, then try
-    // to fold assignment into the site for compression.
-    // Will not attempt to collapse assignments into or past code blocks
-    // which are not sequentially executed, e.g. loops and conditionals.
-    function collapse(statements, compressor) {
-        if (scope.pinned()) return statements;
-        var args;
-        var candidates = [];
-        var stat_index = statements.length;
-        var scanner = new TreeTransformer(function(node) {
-            if (abort) return node;
-            // Skip nodes before `candidate` as quickly as possible
-            if (!hit) {
-                if (node !== hit_stack[hit_index]) return node;
-                hit_index++;
-                if (hit_index < hit_stack.length) return handle_custom_scan_order(node);
-                hit = true;
-                stop_after = find_stop(node, 0);
-                if (stop_after === node) abort = true;
-                return node;
-            }
-            // Stop immediately if these node types are encountered
-            var parent = scanner.parent();
-            if (node instanceof AST_Assign
-                    && (node.logical || node.operator != "=" && lhs.equivalent_to(node.left))
-                || node instanceof AST_Await
-                || node instanceof AST_Call && lhs instanceof AST_PropAccess && lhs.equivalent_to(node.expression)
-                || node instanceof AST_Debugger
-                || node instanceof AST_Destructuring
-                || node instanceof AST_Expansion
-                    && node.expression instanceof AST_Symbol
-                    && (
-                        node.expression instanceof AST_This
-                        || node.expression.definition().references.length > 1
-                    )
-                || node instanceof AST_IterationStatement && !(node instanceof AST_For)
-                || node instanceof AST_LoopControl
-                || node instanceof AST_Try
-                || node instanceof AST_With
-                || node instanceof AST_Yield
-                || node instanceof AST_Export
-                || node instanceof AST_Class
-                || parent instanceof AST_For && node !== parent.init
-                || !replace_all
-                    && (
-                        node instanceof AST_SymbolRef
-                        && !node.is_declared(compressor)
-                        && !pure_prop_access_globals.has(node))
-                || node instanceof AST_SymbolRef
-                    && parent instanceof AST_Call
-                    && has_annotation(parent, _NOINLINE)
-            ) {
-                abort = true;
-                return node;
-            }
-            // Stop only if candidate is found within conditional branches
-            if (!stop_if_hit && (!lhs_local || !replace_all)
-                && (parent instanceof AST_Binary && lazy_op.has(parent.operator) && parent.left !== node
-                    || parent instanceof AST_Conditional && parent.condition !== node
-                    || parent instanceof AST_If && parent.condition !== node)) {
-                stop_if_hit = parent;
-            }
-            // Replace variable with assignment when found
-            if (can_replace
-                && !(node instanceof AST_SymbolDeclaration)
-                && lhs.equivalent_to(node)
-            ) {
-                if (stop_if_hit) {
-                    abort = true;
-                    return node;
-                }
-                if (is_lhs(node, parent)) {
-                    if (value_def) replaced++;
-                    return node;
-                } else {
-                    replaced++;
-                    if (value_def && candidate instanceof AST_VarDef) return node;
-                }
-                CHANGED = abort = true;
-                if (candidate instanceof AST_UnaryPostfix) {
-                    return make_node(AST_UnaryPrefix, candidate, candidate);
-                }
-                if (candidate instanceof AST_VarDef) {
-                    var def = candidate.name.definition();
-                    var value = candidate.value;
-                    if (def.references.length - def.replaced == 1 && !compressor.exposed(def)) {
-                        def.replaced++;
-                        if (funarg && is_identifier_atom(value)) {
-                            return value.transform(compressor);
-                        } else {
-                            return maintain_this_binding(parent, node, value);
-                        }
-                    }
-                    return make_node(AST_Assign, candidate, {
-                        operator: "=",
-                        logical: false,
-                        left: make_node(AST_SymbolRef, candidate.name, candidate.name),
-                        right: value
-                    });
-                }
-                clear_flag(candidate, WRITE_ONLY);
-                return candidate;
-            }
-            // These node types have child nodes that execute sequentially,
-            // but are otherwise not safe to scan into or beyond them.
-            var sym;
-            if (node instanceof AST_Call
-                || node instanceof AST_Exit
-                    && (side_effects || lhs instanceof AST_PropAccess || may_modify(lhs))
-                || node instanceof AST_PropAccess
-                    && (side_effects || node.expression.may_throw_on_access(compressor))
-                || node instanceof AST_SymbolRef
-                    && (lvalues.get(node.name) || side_effects && may_modify(node))
-                || node instanceof AST_VarDef && node.value
-                    && (lvalues.has(node.name.name) || side_effects && may_modify(node.name))
-                || (sym = is_lhs(node.left, node))
-                    && (sym instanceof AST_PropAccess || lvalues.has(sym.name))
-                || may_throw
-                    && (in_try ? node.has_side_effects(compressor) : side_effects_external(node))) {
-                stop_after = node;
-                if (node instanceof AST_Scope) abort = true;
-            }
-            return handle_custom_scan_order(node);
-        }, function(node) {
-            if (abort) return;
-            if (stop_after === node) abort = true;
-            if (stop_if_hit === node) stop_if_hit = null;
-        });
-
-        var multi_replacer = new TreeTransformer(function(node) {
-            if (abort) return node;
-            // Skip nodes before `candidate` as quickly as possible
-            if (!hit) {
-                if (node !== hit_stack[hit_index]) return node;
-                hit_index++;
-                if (hit_index < hit_stack.length) return;
-                hit = true;
-                return node;
-            }
-            // Replace variable when found
-            if (node instanceof AST_SymbolRef
-                && node.name == def.name) {
-                if (!--replaced) abort = true;
-                if (is_lhs(node, multi_replacer.parent())) return node;
-                def.replaced++;
-                value_def.replaced--;
-                return candidate.value;
-            }
-            // Skip (non-executed) functions and (leading) default case in switch statements
-            if (node instanceof AST_Default || node instanceof AST_Scope) return node;
-        });
-
-        while (--stat_index >= 0) {
-            // Treat parameters as collapsible in IIFE, i.e.
-            //   function(a, b){ ... }(x());
-            // would be translated into equivalent assignments:
-            //   var a = x(), b = undefined;
-            if (stat_index == 0 && compressor.option("unused")) extract_args();
-            // Find collapsible assignments
-            var hit_stack = [];
-            extract_candidates(statements[stat_index]);
-            while (candidates.length > 0) {
-                hit_stack = candidates.pop();
-                var hit_index = 0;
-                var candidate = hit_stack[hit_stack.length - 1];
-                var value_def = null;
-                var stop_after = null;
-                var stop_if_hit = null;
-                var lhs = get_lhs(candidate);
-                if (!lhs || is_lhs_read_only(lhs) || lhs.has_side_effects(compressor)) continue;
-                // Locate symbols which may execute code outside of scanning range
-                var lvalues = get_lvalues(candidate);
-                var lhs_local = is_lhs_local(lhs);
-                if (lhs instanceof AST_SymbolRef) lvalues.set(lhs.name, false);
-                var side_effects = value_has_side_effects(candidate);
-                var replace_all = replace_all_symbols();
-                var may_throw = candidate.may_throw(compressor);
-                var funarg = candidate.name instanceof AST_SymbolFunarg;
-                var hit = funarg;
-                var abort = false, replaced = 0, can_replace = !args || !hit;
-                if (!can_replace) {
-                    for (var j = compressor.self().argnames.lastIndexOf(candidate.name) + 1; !abort && j < args.length; j++) {
-                        args[j].transform(scanner);
-                    }
-                    can_replace = true;
-                }
-                for (var i = stat_index; !abort && i < statements.length; i++) {
-                    statements[i].transform(scanner);
-                }
-                if (value_def) {
-                    var def = candidate.name.definition();
-                    if (abort && def.references.length - def.replaced > replaced) replaced = false;
-                    else {
-                        abort = false;
-                        hit_index = 0;
-                        hit = funarg;
-                        for (var i = stat_index; !abort && i < statements.length; i++) {
-                            statements[i].transform(multi_replacer);
-                        }
-                        value_def.single_use = false;
-                    }
-                }
-                if (replaced && !remove_candidate(candidate)) statements.splice(stat_index, 1);
-            }
-        }
-
-        function handle_custom_scan_order(node) {
-            // Skip (non-executed) functions
-            if (node instanceof AST_Scope) return node;
-
-            // Scan case expressions first in a switch statement
-            if (node instanceof AST_Switch) {
-                node.expression = node.expression.transform(scanner);
-                for (var i = 0, len = node.body.length; !abort && i < len; i++) {
-                    var branch = node.body[i];
-                    if (branch instanceof AST_Case) {
-                        if (!hit) {
-                            if (branch !== hit_stack[hit_index]) continue;
-                            hit_index++;
-                        }
-                        branch.expression = branch.expression.transform(scanner);
-                        if (!replace_all) break;
-                    }
-                }
-                abort = true;
-                return node;
-            }
-        }
-
-        function redefined_within_scope(def, scope) {
-            if (def.global) return false;
-            let cur_scope = def.scope;
-            while (cur_scope && cur_scope !== scope) {
-                if (cur_scope.variables.has(def.name)) return true;
-                cur_scope = cur_scope.parent_scope;
-            }
-            return false;
-        }
-
-        function has_overlapping_symbol(fn, arg, fn_strict) {
-            var found = false, scan_this = !(fn instanceof AST_Arrow);
-            arg.walk(new TreeWalker(function(node, descend) {
-                if (found) return true;
-                if (node instanceof AST_SymbolRef && (fn.variables.has(node.name) || redefined_within_scope(node.definition(), fn))) {
-                    var s = node.definition().scope;
-                    if (s !== scope) while (s = s.parent_scope) {
-                        if (s === scope) return true;
-                    }
-                    return found = true;
-                }
-                if ((fn_strict || scan_this) && node instanceof AST_This) {
-                    return found = true;
-                }
-                if (node instanceof AST_Scope && !(node instanceof AST_Arrow)) {
-                    var prev = scan_this;
-                    scan_this = false;
-                    descend();
-                    scan_this = prev;
-                    return true;
-                }
-            }));
-            return found;
-        }
-
-        function extract_args() {
-            var iife, fn = compressor.self();
-            if (is_func_expr(fn)
-                && !fn.name
-                && !fn.uses_arguments
-                && !fn.pinned()
-                && (iife = compressor.parent()) instanceof AST_Call
-                && iife.expression === fn
-                && iife.args.every((arg) => !(arg instanceof AST_Expansion))
-            ) {
-                var fn_strict = compressor.has_directive("use strict");
-                if (fn_strict && !member(fn_strict, fn.body)) fn_strict = false;
-                var len = fn.argnames.length;
-                args = iife.args.slice(len);
-                var names = new Set();
-                for (var i = len; --i >= 0;) {
-                    var sym = fn.argnames[i];
-                    var arg = iife.args[i];
-                    // The following two line fix is a duplicate of the fix at
-                    // https://github.com/terser/terser/commit/011d3eb08cefe6922c7d1bdfa113fc4aeaca1b75
-                    // This might mean that these two pieces of code (one here in collapse_vars and another in reduce_vars
-                    // Might be doing the exact same thing.
-                    const def = sym.definition && sym.definition();
-                    const is_reassigned = def && def.orig.length > 1;
-                    if (is_reassigned) continue;
-                    args.unshift(make_node(AST_VarDef, sym, {
-                        name: sym,
-                        value: arg
-                    }));
-                    if (names.has(sym.name)) continue;
-                    names.add(sym.name);
-                    if (sym instanceof AST_Expansion) {
-                        var elements = iife.args.slice(i);
-                        if (elements.every((arg) =>
-                            !has_overlapping_symbol(fn, arg, fn_strict)
-                        )) {
-                            candidates.unshift([ make_node(AST_VarDef, sym, {
-                                name: sym.expression,
-                                value: make_node(AST_Array, iife, {
-                                    elements: elements
-                                })
-                            }) ]);
-                        }
-                    } else {
-                        if (!arg) {
-                            arg = make_node(AST_Undefined, sym).transform(compressor);
-                        } else if (arg instanceof AST_Lambda && arg.pinned()
-                            || has_overlapping_symbol(fn, arg, fn_strict)
-                        ) {
-                            arg = null;
-                        }
-                        if (arg) candidates.unshift([ make_node(AST_VarDef, sym, {
-                            name: sym,
-                            value: arg
-                        }) ]);
-                    }
-                }
-            }
-        }
-
-        function extract_candidates(expr) {
-            hit_stack.push(expr);
-            if (expr instanceof AST_Assign) {
-                if (
-                    !expr.left.has_side_effects(compressor)
-                    && !(expr.right instanceof AST_Chain)
-                ) {
-                    candidates.push(hit_stack.slice());
-                }
-                extract_candidates(expr.right);
-            } else if (expr instanceof AST_Binary) {
-                extract_candidates(expr.left);
-                extract_candidates(expr.right);
-            } else if (expr instanceof AST_Call && !has_annotation(expr, _NOINLINE)) {
-                extract_candidates(expr.expression);
-                expr.args.forEach(extract_candidates);
-            } else if (expr instanceof AST_Case) {
-                extract_candidates(expr.expression);
-            } else if (expr instanceof AST_Conditional) {
-                extract_candidates(expr.condition);
-                extract_candidates(expr.consequent);
-                extract_candidates(expr.alternative);
-            } else if (expr instanceof AST_Definitions) {
-                var len = expr.definitions.length;
-                // limit number of trailing variable definitions for consideration
-                var i = len - 200;
-                if (i < 0) i = 0;
-                for (; i < len; i++) {
-                    extract_candidates(expr.definitions[i]);
-                }
-            } else if (expr instanceof AST_DWLoop) {
-                extract_candidates(expr.condition);
-                if (!(expr.body instanceof AST_Block)) {
-                    extract_candidates(expr.body);
-                }
-            } else if (expr instanceof AST_Exit) {
-                if (expr.value) extract_candidates(expr.value);
-            } else if (expr instanceof AST_For) {
-                if (expr.init) extract_candidates(expr.init);
-                if (expr.condition) extract_candidates(expr.condition);
-                if (expr.step) extract_candidates(expr.step);
-                if (!(expr.body instanceof AST_Block)) {
-                    extract_candidates(expr.body);
-                }
-            } else if (expr instanceof AST_ForIn) {
-                extract_candidates(expr.object);
-                if (!(expr.body instanceof AST_Block)) {
-                    extract_candidates(expr.body);
-                }
-            } else if (expr instanceof AST_If) {
-                extract_candidates(expr.condition);
-                if (!(expr.body instanceof AST_Block)) {
-                    extract_candidates(expr.body);
-                }
-                if (expr.alternative && !(expr.alternative instanceof AST_Block)) {
-                    extract_candidates(expr.alternative);
-                }
-            } else if (expr instanceof AST_Sequence) {
-                expr.expressions.forEach(extract_candidates);
-            } else if (expr instanceof AST_SimpleStatement) {
-                extract_candidates(expr.body);
-            } else if (expr instanceof AST_Switch) {
-                extract_candidates(expr.expression);
-                expr.body.forEach(extract_candidates);
-            } else if (expr instanceof AST_Unary) {
-                if (expr.operator == "++" || expr.operator == "--") {
-                    candidates.push(hit_stack.slice());
-                }
-            } else if (expr instanceof AST_VarDef) {
-                if (expr.value && !(expr.value instanceof AST_Chain)) {
-                    candidates.push(hit_stack.slice());
-                    extract_candidates(expr.value);
-                }
-            }
-            hit_stack.pop();
-        }
-
-        function find_stop(node, level, write_only) {
-            var parent = scanner.parent(level);
-            if (parent instanceof AST_Assign) {
-                if (write_only
-                    && !parent.logical
-                    && !(parent.left instanceof AST_PropAccess
-                        || lvalues.has(parent.left.name))) {
-                    return find_stop(parent, level + 1, write_only);
-                }
-                return node;
-            }
-            if (parent instanceof AST_Binary) {
-                if (write_only && (!lazy_op.has(parent.operator) || parent.left === node)) {
-                    return find_stop(parent, level + 1, write_only);
-                }
-                return node;
-            }
-            if (parent instanceof AST_Call) return node;
-            if (parent instanceof AST_Case) return node;
-            if (parent instanceof AST_Conditional) {
-                if (write_only && parent.condition === node) {
-                    return find_stop(parent, level + 1, write_only);
-                }
-                return node;
-            }
-            if (parent instanceof AST_Definitions) {
-                return find_stop(parent, level + 1, true);
-            }
-            if (parent instanceof AST_Exit) {
-                return write_only ? find_stop(parent, level + 1, write_only) : node;
-            }
-            if (parent instanceof AST_If) {
-                if (write_only && parent.condition === node) {
-                    return find_stop(parent, level + 1, write_only);
-                }
-                return node;
-            }
-            if (parent instanceof AST_IterationStatement) return node;
-            if (parent instanceof AST_Sequence) {
-                return find_stop(parent, level + 1, parent.tail_node() !== node);
-            }
-            if (parent instanceof AST_SimpleStatement) {
-                return find_stop(parent, level + 1, true);
-            }
-            if (parent instanceof AST_Switch) return node;
-            if (parent instanceof AST_VarDef) return node;
-            return null;
-        }
-
-        function mangleable_var(var_def) {
-            var value = var_def.value;
-            if (!(value instanceof AST_SymbolRef)) return;
-            if (value.name == "arguments") return;
-            var def = value.definition();
-            if (def.undeclared) return;
-            return value_def = def;
-        }
-
-        function get_lhs(expr) {
-            if (expr instanceof AST_Assign && expr.logical) {
-                return false;
-            } else if (expr instanceof AST_VarDef && expr.name instanceof AST_SymbolDeclaration) {
-                var def = expr.name.definition();
-                if (!member(expr.name, def.orig)) return;
-                var referenced = def.references.length - def.replaced;
-                if (!referenced) return;
-                var declared = def.orig.length - def.eliminated;
-                if (declared > 1 && !(expr.name instanceof AST_SymbolFunarg)
-                    || (referenced > 1 ? mangleable_var(expr) : !compressor.exposed(def))) {
-                    return make_node(AST_SymbolRef, expr.name, expr.name);
-                }
-            } else {
-                const lhs = expr instanceof AST_Assign
-                    ? expr.left
-                    : expr.expression;
-                return !is_ref_of(lhs, AST_SymbolConst)
-                    && !is_ref_of(lhs, AST_SymbolLet) && lhs;
-            }
-        }
-
-        function get_rvalue(expr) {
-            if (expr instanceof AST_Assign) {
-                return expr.right;
-            } else {
-                return expr.value;
-            }
-        }
-
-        function get_lvalues(expr) {
-            var lvalues = new Map();
-            if (expr instanceof AST_Unary) return lvalues;
-            var tw = new TreeWalker(function(node) {
-                var sym = node;
-                while (sym instanceof AST_PropAccess) sym = sym.expression;
-                if (sym instanceof AST_SymbolRef || sym instanceof AST_This) {
-                    lvalues.set(sym.name, lvalues.get(sym.name) || is_modified(compressor, tw, node, node, 0));
-                }
-            });
-            get_rvalue(expr).walk(tw);
-            return lvalues;
-        }
-
-        function remove_candidate(expr) {
-            if (expr.name instanceof AST_SymbolFunarg) {
-                var iife = compressor.parent(), argnames = compressor.self().argnames;
-                var index = argnames.indexOf(expr.name);
-                if (index < 0) {
-                    iife.args.length = Math.min(iife.args.length, argnames.length - 1);
-                } else {
-                    var args = iife.args;
-                    if (args[index]) args[index] = make_node(AST_Number, args[index], {
-                        value: 0
-                    });
-                }
-                return true;
-            }
-            var found = false;
-            return statements[stat_index].transform(new TreeTransformer(function(node, descend, in_list) {
-                if (found) return node;
-                if (node === expr || node.body === expr) {
-                    found = true;
-                    if (node instanceof AST_VarDef) {
-                        node.value = node.name instanceof AST_SymbolConst
-                             ? make_node(AST_Undefined, node.value)  // `const` always needs value.
-                             : null;
-                        return node;
-                    }
-                    return in_list ? MAP.skip : null;
-                }
-            }, function(node) {
-                if (node instanceof AST_Sequence) switch (node.expressions.length) {
-                  case 0: return null;
-                  case 1: return node.expressions[0];
-                }
-            }));
-        }
-
-        function is_lhs_local(lhs) {
-            while (lhs instanceof AST_PropAccess) lhs = lhs.expression;
-            return lhs instanceof AST_SymbolRef
-                && lhs.definition().scope === scope
-                && !(in_loop
-                    && (lvalues.has(lhs.name)
-                        || candidate instanceof AST_Unary
-                        || (candidate instanceof AST_Assign
-                            && !candidate.logical
-                            && candidate.operator != "=")));
-        }
-
-        function value_has_side_effects(expr) {
-            if (expr instanceof AST_Unary) return unary_side_effects.has(expr.operator);
-            return get_rvalue(expr).has_side_effects(compressor);
-        }
-
-        function replace_all_symbols() {
-            if (side_effects) return false;
-            if (value_def) return true;
-            if (lhs instanceof AST_SymbolRef) {
-                var def = lhs.definition();
-                if (def.references.length - def.replaced == (candidate instanceof AST_VarDef ? 1 : 2)) {
-                    return true;
-                }
-            }
-            return false;
-        }
-
-        function may_modify(sym) {
-            if (!sym.definition) return true; // AST_Destructuring
-            var def = sym.definition();
-            if (def.orig.length == 1 && def.orig[0] instanceof AST_SymbolDefun) return false;
-            if (def.scope.get_defun_scope() !== scope) return true;
-            return !def.references.every((ref) => {
-                var s = ref.scope.get_defun_scope();
-                // "block" scope within AST_Catch
-                if (s.TYPE == "Scope") s = s.parent_scope;
-                return s === scope;
-            });
-        }
-
-        function side_effects_external(node, lhs) {
-            if (node instanceof AST_Assign) return side_effects_external(node.left, true);
-            if (node instanceof AST_Unary) return side_effects_external(node.expression, true);
-            if (node instanceof AST_VarDef) return node.value && side_effects_external(node.value);
-            if (lhs) {
-                if (node instanceof AST_Dot) return side_effects_external(node.expression, true);
-                if (node instanceof AST_Sub) return side_effects_external(node.expression, true);
-                if (node instanceof AST_SymbolRef) return node.definition().scope !== scope;
-            }
-            return false;
-        }
-    }
-
-    function eliminate_spurious_blocks(statements) {
-        var seen_dirs = [];
-        for (var i = 0; i < statements.length;) {
-            var stat = statements[i];
-            if (stat instanceof AST_BlockStatement && stat.body.every(can_be_evicted_from_block)) {
-                CHANGED = true;
-                eliminate_spurious_blocks(stat.body);
-                statements.splice(i, 1, ...stat.body);
-                i += stat.body.length;
-            } else if (stat instanceof AST_EmptyStatement) {
-                CHANGED = true;
-                statements.splice(i, 1);
-            } else if (stat instanceof AST_Directive) {
-                if (seen_dirs.indexOf(stat.value) < 0) {
-                    i++;
-                    seen_dirs.push(stat.value);
-                } else {
-                    CHANGED = true;
-                    statements.splice(i, 1);
-                }
-            } else i++;
-        }
-    }
-
-    function handle_if_return(statements, compressor) {
-        var self = compressor.self();
-        var multiple_if_returns = has_multiple_if_returns(statements);
-        var in_lambda = self instanceof AST_Lambda;
-        for (var i = statements.length; --i >= 0;) {
-            var stat = statements[i];
-            var j = next_index(i);
-            var next = statements[j];
-
-            if (in_lambda && !next && stat instanceof AST_Return) {
-                if (!stat.value) {
-                    CHANGED = true;
-                    statements.splice(i, 1);
-                    continue;
-                }
-                if (stat.value instanceof AST_UnaryPrefix && stat.value.operator == "void") {
-                    CHANGED = true;
-                    statements[i] = make_node(AST_SimpleStatement, stat, {
-                        body: stat.value.expression
-                    });
-                    continue;
-                }
-            }
-
-            if (stat instanceof AST_If) {
-                var ab = aborts(stat.body);
-                if (can_merge_flow(ab)) {
-                    if (ab.label) {
-                        remove(ab.label.thedef.references, ab);
-                    }
-                    CHANGED = true;
-                    stat = stat.clone();
-                    stat.condition = stat.condition.negate(compressor);
-                    var body = as_statement_array_with_return(stat.body, ab);
-                    stat.body = make_node(AST_BlockStatement, stat, {
-                        body: as_statement_array(stat.alternative).concat(extract_functions())
-                    });
-                    stat.alternative = make_node(AST_BlockStatement, stat, {
-                        body: body
-                    });
-                    statements[i] = stat.transform(compressor);
-                    continue;
-                }
-
-                var ab = aborts(stat.alternative);
-                if (can_merge_flow(ab)) {
-                    if (ab.label) {
-                        remove(ab.label.thedef.references, ab);
-                    }
-                    CHANGED = true;
-                    stat = stat.clone();
-                    stat.body = make_node(AST_BlockStatement, stat.body, {
-                        body: as_statement_array(stat.body).concat(extract_functions())
-                    });
-                    var body = as_statement_array_with_return(stat.alternative, ab);
-                    stat.alternative = make_node(AST_BlockStatement, stat.alternative, {
-                        body: body
-                    });
-                    statements[i] = stat.transform(compressor);
-                    continue;
-                }
-            }
-
-            if (stat instanceof AST_If && stat.body instanceof AST_Return) {
-                var value = stat.body.value;
-                //---
-                // pretty silly case, but:
-                // if (foo()) return; return; ==> foo(); return;
-                if (!value && !stat.alternative
-                    && (in_lambda && !next || next instanceof AST_Return && !next.value)) {
-                    CHANGED = true;
-                    statements[i] = make_node(AST_SimpleStatement, stat.condition, {
-                        body: stat.condition
-                    });
-                    continue;
-                }
-                //---
-                // if (foo()) return x; return y; ==> return foo() ? x : y;
-                if (value && !stat.alternative && next instanceof AST_Return && next.value) {
-                    CHANGED = true;
-                    stat = stat.clone();
-                    stat.alternative = next;
-                    statements[i] = stat.transform(compressor);
-                    statements.splice(j, 1);
-                    continue;
-                }
-                //---
-                // if (foo()) return x; [ return ; ] ==> return foo() ? x : undefined;
-                if (value && !stat.alternative
-                    && (!next && in_lambda && multiple_if_returns
-                        || next instanceof AST_Return)) {
-                    CHANGED = true;
-                    stat = stat.clone();
-                    stat.alternative = next || make_node(AST_Return, stat, {
-                        value: null
-                    });
-                    statements[i] = stat.transform(compressor);
-                    if (next) statements.splice(j, 1);
-                    continue;
-                }
-                //---
-                // if (a) return b; if (c) return d; e; ==> return a ? b : c ? d : void e;
-                //
-                // if sequences is not enabled, this can lead to an endless loop (issue #866).
-                // however, with sequences on this helps producing slightly better output for
-                // the example code.
-                var prev = statements[prev_index(i)];
-                if (compressor.option("sequences") && in_lambda && !stat.alternative
-                    && prev instanceof AST_If && prev.body instanceof AST_Return
-                    && next_index(j) == statements.length && next instanceof AST_SimpleStatement) {
-                    CHANGED = true;
-                    stat = stat.clone();
-                    stat.alternative = make_node(AST_BlockStatement, next, {
-                        body: [
-                            next,
-                            make_node(AST_Return, next, {
-                                value: null
-                            })
-                        ]
-                    });
-                    statements[i] = stat.transform(compressor);
-                    statements.splice(j, 1);
-                    continue;
-                }
-            }
-        }
-
-        function has_multiple_if_returns(statements) {
-            var n = 0;
-            for (var i = statements.length; --i >= 0;) {
-                var stat = statements[i];
-                if (stat instanceof AST_If && stat.body instanceof AST_Return) {
-                    if (++n > 1) return true;
-                }
-            }
-            return false;
-        }
-
-        function is_return_void(value) {
-            return !value || value instanceof AST_UnaryPrefix && value.operator == "void";
-        }
-
-        function can_merge_flow(ab) {
-            if (!ab) return false;
-            for (var j = i + 1, len = statements.length; j < len; j++) {
-                var stat = statements[j];
-                if (stat instanceof AST_Const || stat instanceof AST_Let) return false;
-            }
-            var lct = ab instanceof AST_LoopControl ? compressor.loopcontrol_target(ab) : null;
-            return ab instanceof AST_Return && in_lambda && is_return_void(ab.value)
-                || ab instanceof AST_Continue && self === loop_body(lct)
-                || ab instanceof AST_Break && lct instanceof AST_BlockStatement && self === lct;
-        }
-
-        function extract_functions() {
-            var tail = statements.slice(i + 1);
-            statements.length = i + 1;
-            return tail.filter(function(stat) {
-                if (stat instanceof AST_Defun) {
-                    statements.push(stat);
-                    return false;
-                }
-                return true;
-            });
-        }
-
-        function as_statement_array_with_return(node, ab) {
-            var body = as_statement_array(node).slice(0, -1);
-            if (ab.value) {
-                body.push(make_node(AST_SimpleStatement, ab.value, {
-                    body: ab.value.expression
-                }));
-            }
-            return body;
-        }
-
-        function next_index(i) {
-            for (var j = i + 1, len = statements.length; j < len; j++) {
-                var stat = statements[j];
-                if (!(stat instanceof AST_Var && declarations_only(stat))) {
-                    break;
-                }
-            }
-            return j;
-        }
-
-        function prev_index(i) {
-            for (var j = i; --j >= 0;) {
-                var stat = statements[j];
-                if (!(stat instanceof AST_Var && declarations_only(stat))) {
-                    break;
-                }
-            }
-            return j;
-        }
-    }
-
-    function eliminate_dead_code(statements, compressor) {
-        var has_quit;
-        var self = compressor.self();
-        for (var i = 0, n = 0, len = statements.length; i < len; i++) {
-            var stat = statements[i];
-            if (stat instanceof AST_LoopControl) {
-                var lct = compressor.loopcontrol_target(stat);
-                if (stat instanceof AST_Break
-                        && !(lct instanceof AST_IterationStatement)
-                        && loop_body(lct) === self
-                    || stat instanceof AST_Continue
-                        && loop_body(lct) === self) {
-                    if (stat.label) {
-                        remove(stat.label.thedef.references, stat);
-                    }
-                } else {
-                    statements[n++] = stat;
-                }
-            } else {
-                statements[n++] = stat;
-            }
-            if (aborts(stat)) {
-                has_quit = statements.slice(i + 1);
-                break;
-            }
-        }
-        statements.length = n;
-        CHANGED = n != len;
-        if (has_quit) has_quit.forEach(function(stat) {
-            trim_unreachable_code(compressor, stat, statements);
-        });
-    }
-
-    function declarations_only(node) {
-        return node.definitions.every((var_def) =>
-            !var_def.value
-        );
-    }
-
-    function sequencesize(statements, compressor) {
-        if (statements.length < 2) return;
-        var seq = [], n = 0;
-        function push_seq() {
-            if (!seq.length) return;
-            var body = make_sequence(seq[0], seq);
-            statements[n++] = make_node(AST_SimpleStatement, body, { body: body });
-            seq = [];
-        }
-        for (var i = 0, len = statements.length; i < len; i++) {
-            var stat = statements[i];
-            if (stat instanceof AST_SimpleStatement) {
-                if (seq.length >= compressor.sequences_limit) push_seq();
-                var body = stat.body;
-                if (seq.length > 0) body = body.drop_side_effect_free(compressor);
-                if (body) merge_sequence(seq, body);
-            } else if (stat instanceof AST_Definitions && declarations_only(stat)
-                || stat instanceof AST_Defun) {
-                statements[n++] = stat;
-            } else {
-                push_seq();
-                statements[n++] = stat;
-            }
-        }
-        push_seq();
-        statements.length = n;
-        if (n != len) CHANGED = true;
-    }
-
-    function to_simple_statement(block, decls) {
-        if (!(block instanceof AST_BlockStatement)) return block;
-        var stat = null;
-        for (var i = 0, len = block.body.length; i < len; i++) {
-            var line = block.body[i];
-            if (line instanceof AST_Var && declarations_only(line)) {
-                decls.push(line);
-            } else if (stat) {
-                return false;
-            } else {
-                stat = line;
-            }
-        }
-        return stat;
-    }
-
-    function sequencesize_2(statements, compressor) {
-        function cons_seq(right) {
-            n--;
-            CHANGED = true;
-            var left = prev.body;
-            return make_sequence(left, [ left, right ]).transform(compressor);
-        }
-        var n = 0, prev;
-        for (var i = 0; i < statements.length; i++) {
-            var stat = statements[i];
-            if (prev) {
-                if (stat instanceof AST_Exit) {
-                    stat.value = cons_seq(stat.value || make_node(AST_Undefined, stat).transform(compressor));
-                } else if (stat instanceof AST_For) {
-                    if (!(stat.init instanceof AST_Definitions)) {
-                        const abort = walk(prev.body, node => {
-                            if (node instanceof AST_Scope) return true;
-                            if (
-                                node instanceof AST_Binary
-                                && node.operator === "in"
-                            ) {
-                                return walk_abort;
-                            }
-                        });
-                        if (!abort) {
-                            if (stat.init) stat.init = cons_seq(stat.init);
-                            else {
-                                stat.init = prev.body;
-                                n--;
-                                CHANGED = true;
-                            }
-                        }
-                    }
-                } else if (stat instanceof AST_ForIn) {
-                    if (!(stat.init instanceof AST_Const) && !(stat.init instanceof AST_Let)) {
-                        stat.object = cons_seq(stat.object);
-                    }
-                } else if (stat instanceof AST_If) {
-                    stat.condition = cons_seq(stat.condition);
-                } else if (stat instanceof AST_Switch) {
-                    stat.expression = cons_seq(stat.expression);
-                } else if (stat instanceof AST_With) {
-                    stat.expression = cons_seq(stat.expression);
-                }
-            }
-            if (compressor.option("conditionals") && stat instanceof AST_If) {
-                var decls = [];
-                var body = to_simple_statement(stat.body, decls);
-                var alt = to_simple_statement(stat.alternative, decls);
-                if (body !== false && alt !== false && decls.length > 0) {
-                    var len = decls.length;
-                    decls.push(make_node(AST_If, stat, {
-                        condition: stat.condition,
-                        body: body || make_node(AST_EmptyStatement, stat.body),
-                        alternative: alt
-                    }));
-                    decls.unshift(n, 1);
-                    [].splice.apply(statements, decls);
-                    i += len;
-                    n += len + 1;
-                    prev = null;
-                    CHANGED = true;
-                    continue;
-                }
-            }
-            statements[n++] = stat;
-            prev = stat instanceof AST_SimpleStatement ? stat : null;
-        }
-        statements.length = n;
-    }
-
-    function join_object_assignments(defn, body) {
-        if (!(defn instanceof AST_Definitions)) return;
-        var def = defn.definitions[defn.definitions.length - 1];
-        if (!(def.value instanceof AST_Object)) return;
-        var exprs;
-        if (body instanceof AST_Assign && !body.logical) {
-            exprs = [ body ];
-        } else if (body instanceof AST_Sequence) {
-            exprs = body.expressions.slice();
-        }
-        if (!exprs) return;
-        var trimmed = false;
-        do {
-            var node = exprs[0];
-            if (!(node instanceof AST_Assign)) break;
-            if (node.operator != "=") break;
-            if (!(node.left instanceof AST_PropAccess)) break;
-            var sym = node.left.expression;
-            if (!(sym instanceof AST_SymbolRef)) break;
-            if (def.name.name != sym.name) break;
-            if (!node.right.is_constant_expression(scope)) break;
-            var prop = node.left.property;
-            if (prop instanceof AST_Node) {
-                prop = prop.evaluate(compressor);
-            }
-            if (prop instanceof AST_Node) break;
-            prop = "" + prop;
-            var diff = compressor.option("ecma") < 2015
-                && compressor.has_directive("use strict") ? function(node) {
-                return node.key != prop && (node.key && node.key.name != prop);
-            } : function(node) {
-                return node.key && node.key.name != prop;
-            };
-            if (!def.value.properties.every(diff)) break;
-            var p = def.value.properties.filter(function (p) { return p.key === prop; })[0];
-            if (!p) {
-                def.value.properties.push(make_node(AST_ObjectKeyVal, node, {
-                    key: prop,
-                    value: node.right
-                }));
-            } else {
-                p.value = new AST_Sequence({
-                    start: p.start,
-                    expressions: [p.value.clone(), node.right.clone()],
-                    end: p.end
-                });
-            }
-            exprs.shift();
-            trimmed = true;
-        } while (exprs.length);
-        return trimmed && exprs;
-    }
-
-    function join_consecutive_vars(statements) {
-        var defs;
-        for (var i = 0, j = -1, len = statements.length; i < len; i++) {
-            var stat = statements[i];
-            var prev = statements[j];
-            if (stat instanceof AST_Definitions) {
-                if (prev && prev.TYPE == stat.TYPE) {
-                    prev.definitions = prev.definitions.concat(stat.definitions);
-                    CHANGED = true;
-                } else if (defs && defs.TYPE == stat.TYPE && declarations_only(stat)) {
-                    defs.definitions = defs.definitions.concat(stat.definitions);
-                    CHANGED = true;
-                } else {
-                    statements[++j] = stat;
-                    defs = stat;
-                }
-            } else if (stat instanceof AST_Exit) {
-                stat.value = extract_object_assignments(stat.value);
-            } else if (stat instanceof AST_For) {
-                var exprs = join_object_assignments(prev, stat.init);
-                if (exprs) {
-                    CHANGED = true;
-                    stat.init = exprs.length ? make_sequence(stat.init, exprs) : null;
-                    statements[++j] = stat;
-                } else if (prev instanceof AST_Var && (!stat.init || stat.init.TYPE == prev.TYPE)) {
-                    if (stat.init) {
-                        prev.definitions = prev.definitions.concat(stat.init.definitions);
-                    }
-                    stat.init = prev;
-                    statements[j] = stat;
-                    CHANGED = true;
-                } else if (defs && stat.init && defs.TYPE == stat.init.TYPE && declarations_only(stat.init)) {
-                    defs.definitions = defs.definitions.concat(stat.init.definitions);
-                    stat.init = null;
-                    statements[++j] = stat;
-                    CHANGED = true;
-                } else {
-                    statements[++j] = stat;
-                }
-            } else if (stat instanceof AST_ForIn) {
-                stat.object = extract_object_assignments(stat.object);
-            } else if (stat instanceof AST_If) {
-                stat.condition = extract_object_assignments(stat.condition);
-            } else if (stat instanceof AST_SimpleStatement) {
-                var exprs = join_object_assignments(prev, stat.body);
-                if (exprs) {
-                    CHANGED = true;
-                    if (!exprs.length) continue;
-                    stat.body = make_sequence(stat.body, exprs);
-                }
-                statements[++j] = stat;
-            } else if (stat instanceof AST_Switch) {
-                stat.expression = extract_object_assignments(stat.expression);
-            } else if (stat instanceof AST_With) {
-                stat.expression = extract_object_assignments(stat.expression);
-            } else {
-                statements[++j] = stat;
-            }
-        }
-        statements.length = j + 1;
-
-        function extract_object_assignments(value) {
-            statements[++j] = stat;
-            var exprs = join_object_assignments(prev, value);
-            if (exprs) {
-                CHANGED = true;
-                if (exprs.length) {
-                    return make_sequence(value, exprs);
-                } else if (value instanceof AST_Sequence) {
-                    return value.tail_node().left;
-                } else {
-                    return value.left;
-                }
-            }
-            return value;
-        }
-    }
-}
-
-function trim_unreachable_code(compressor, stat, target) {
-    walk(stat, node => {
-        if (node instanceof AST_Var) {
-            node.remove_initializers();
-            target.push(node);
-            return true;
-        }
-        if (
-            node instanceof AST_Defun
-            && (node === stat || !compressor.has_directive("use strict"))
-        ) {
-            target.push(node === stat ? node : make_node(AST_Var, node, {
-                definitions: [
-                    make_node(AST_VarDef, node, {
-                        name: make_node(AST_SymbolVar, node.name, node.name),
-                        value: null
-                    })
-                ]
-            }));
-            return true;
-        }
-        if (node instanceof AST_Export || node instanceof AST_Import) {
-            target.push(node);
-            return true;
-        }
-        if (node instanceof AST_Scope) {
-            return true;
-        }
-    });
-}
-
-function get_value(key) {
-    if (key instanceof AST_Constant) {
-        return key.getValue();
-    }
-    if (key instanceof AST_UnaryPrefix
-        && key.operator == "void"
-        && key.expression instanceof AST_Constant) {
-        return;
-    }
-    return key;
-}
-
-function is_undefined(node, compressor) {
-    return (
-        has_flag(node, UNDEFINED)
-        || node instanceof AST_Undefined
-        || node instanceof AST_UnaryPrefix
-            && node.operator == "void"
-            && !node.expression.has_side_effects(compressor)
-    );
-}
-
-// may_throw_on_access()
-// returns true if this node may be null, undefined or contain `AST_Accessor`
-(function(def_may_throw_on_access) {
-    AST_Node.DEFMETHOD("may_throw_on_access", function(compressor) {
-        return !compressor.option("pure_getters")
-            || this._dot_throw(compressor);
-    });
-
-    function is_strict(compressor) {
-        return /strict/.test(compressor.option("pure_getters"));
-    }
-
-    def_may_throw_on_access(AST_Node, is_strict);
-    def_may_throw_on_access(AST_Null, return_true);
-    def_may_throw_on_access(AST_Undefined, return_true);
-    def_may_throw_on_access(AST_Constant, return_false);
-    def_may_throw_on_access(AST_Array, return_false);
-    def_may_throw_on_access(AST_Object, function(compressor) {
-        if (!is_strict(compressor)) return false;
-        for (var i = this.properties.length; --i >=0;)
-            if (this.properties[i]._dot_throw(compressor)) return true;
-        return false;
-    });
-    // Do not be as strict with classes as we are with objects.
-    // Hopefully the community is not going to abuse static getters and setters.
-    // https://github.com/terser/terser/issues/724#issuecomment-643655656
-    def_may_throw_on_access(AST_Class, return_false);
-    def_may_throw_on_access(AST_ObjectProperty, return_false);
-    def_may_throw_on_access(AST_ObjectGetter, return_true);
-    def_may_throw_on_access(AST_Expansion, function(compressor) {
-        return this.expression._dot_throw(compressor);
-    });
-    def_may_throw_on_access(AST_Function, return_false);
-    def_may_throw_on_access(AST_Arrow, return_false);
-    def_may_throw_on_access(AST_UnaryPostfix, return_false);
-    def_may_throw_on_access(AST_UnaryPrefix, function() {
-        return this.operator == "void";
-    });
-    def_may_throw_on_access(AST_Binary, function(compressor) {
-        return (this.operator == "&&" || this.operator == "||" || this.operator == "??")
-            && (this.left._dot_throw(compressor) || this.right._dot_throw(compressor));
-    });
-    def_may_throw_on_access(AST_Assign, function(compressor) {
-        if (this.logical) return true;
-
-        return this.operator == "="
-            && this.right._dot_throw(compressor);
-    });
-    def_may_throw_on_access(AST_Conditional, function(compressor) {
-        return this.consequent._dot_throw(compressor)
-            || this.alternative._dot_throw(compressor);
-    });
-    def_may_throw_on_access(AST_Dot, function(compressor) {
-        if (!is_strict(compressor)) return false;
-
-        if (this.property == "prototype") {
-            return !(
-                this.expression instanceof AST_Function
-                || this.expression instanceof AST_Class
-            );
-        }
-        return true;
-    });
-    def_may_throw_on_access(AST_Chain, function(compressor) {
-        return this.expression._dot_throw(compressor);
-    });
-    def_may_throw_on_access(AST_Sequence, function(compressor) {
-        return this.tail_node()._dot_throw(compressor);
-    });
-    def_may_throw_on_access(AST_SymbolRef, function(compressor) {
-        if (this.name === "arguments") return false;
-        if (has_flag(this, UNDEFINED)) return true;
-        if (!is_strict(compressor)) return false;
-        if (is_undeclared_ref(this) && this.is_declared(compressor)) return false;
-        if (this.is_immutable()) return false;
-        var fixed = this.fixed_value();
-        return !fixed || fixed._dot_throw(compressor);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("_dot_throw", func);
-});
-
-/* -----[ boolean/negation helpers ]----- */
-
-// methods to determine whether an expression has a boolean result type
-(function(def_is_boolean) {
-    const unary_bool = makePredicate("! delete");
-    const binary_bool = makePredicate("in instanceof == != === !== < <= >= >");
-    def_is_boolean(AST_Node, return_false);
-    def_is_boolean(AST_UnaryPrefix, function() {
-        return unary_bool.has(this.operator);
-    });
-    def_is_boolean(AST_Binary, function() {
-        return binary_bool.has(this.operator)
-            || lazy_op.has(this.operator)
-                && this.left.is_boolean()
-                && this.right.is_boolean();
-    });
-    def_is_boolean(AST_Conditional, function() {
-        return this.consequent.is_boolean() && this.alternative.is_boolean();
-    });
-    def_is_boolean(AST_Assign, function() {
-        return this.operator == "=" && this.right.is_boolean();
-    });
-    def_is_boolean(AST_Sequence, function() {
-        return this.tail_node().is_boolean();
-    });
-    def_is_boolean(AST_True, return_true);
-    def_is_boolean(AST_False, return_true);
-})(function(node, func) {
-    node.DEFMETHOD("is_boolean", func);
-});
-
-// methods to determine if an expression has a numeric result type
-(function(def_is_number) {
-    def_is_number(AST_Node, return_false);
-    def_is_number(AST_Number, return_true);
-    var unary = makePredicate("+ - ~ ++ --");
-    def_is_number(AST_Unary, function() {
-        return unary.has(this.operator);
-    });
-    var binary = makePredicate("- * / % & | ^ << >> >>>");
-    def_is_number(AST_Binary, function(compressor) {
-        return binary.has(this.operator) || this.operator == "+"
-            && this.left.is_number(compressor)
-            && this.right.is_number(compressor);
-    });
-    def_is_number(AST_Assign, function(compressor) {
-        return binary.has(this.operator.slice(0, -1))
-            || this.operator == "=" && this.right.is_number(compressor);
-    });
-    def_is_number(AST_Sequence, function(compressor) {
-        return this.tail_node().is_number(compressor);
-    });
-    def_is_number(AST_Conditional, function(compressor) {
-        return this.consequent.is_number(compressor) && this.alternative.is_number(compressor);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("is_number", func);
-});
-
-// methods to determine if an expression has a string result type
-(function(def_is_string) {
-    def_is_string(AST_Node, return_false);
-    def_is_string(AST_String, return_true);
-    def_is_string(AST_TemplateString, return_true);
-    def_is_string(AST_UnaryPrefix, function() {
-        return this.operator == "typeof";
-    });
-    def_is_string(AST_Binary, function(compressor) {
-        return this.operator == "+" &&
-            (this.left.is_string(compressor) || this.right.is_string(compressor));
-    });
-    def_is_string(AST_Assign, function(compressor) {
-        return (this.operator == "=" || this.operator == "+=") && this.right.is_string(compressor);
-    });
-    def_is_string(AST_Sequence, function(compressor) {
-        return this.tail_node().is_string(compressor);
-    });
-    def_is_string(AST_Conditional, function(compressor) {
-        return this.consequent.is_string(compressor) && this.alternative.is_string(compressor);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("is_string", func);
-});
-
-var lazy_op = makePredicate("&& || ??");
-var unary_side_effects = makePredicate("delete ++ --");
-
-function is_lhs(node, parent) {
-    if (parent instanceof AST_Unary && unary_side_effects.has(parent.operator)) return parent.expression;
-    if (parent instanceof AST_Assign && parent.left === node) return node;
-}
-
-(function(def_find_defs) {
-    function to_node(value, orig) {
-        if (value instanceof AST_Node) return make_node(value.CTOR, orig, value);
-        if (Array.isArray(value)) return make_node(AST_Array, orig, {
-            elements: value.map(function(value) {
-                return to_node(value, orig);
-            })
-        });
-        if (value && typeof value == "object") {
-            var props = [];
-            for (var key in value) if (HOP(value, key)) {
-                props.push(make_node(AST_ObjectKeyVal, orig, {
-                    key: key,
-                    value: to_node(value[key], orig)
-                }));
-            }
-            return make_node(AST_Object, orig, {
-                properties: props
-            });
-        }
-        return make_node_from_constant(value, orig);
-    }
-
-    AST_Toplevel.DEFMETHOD("resolve_defines", function(compressor) {
-        if (!compressor.option("global_defs")) return this;
-        this.figure_out_scope({ ie8: compressor.option("ie8") });
-        return this.transform(new TreeTransformer(function(node) {
-            var def = node._find_defs(compressor, "");
-            if (!def) return;
-            var level = 0, child = node, parent;
-            while (parent = this.parent(level++)) {
-                if (!(parent instanceof AST_PropAccess)) break;
-                if (parent.expression !== child) break;
-                child = parent;
-            }
-            if (is_lhs(child, parent)) {
-                return;
-            }
-            return def;
-        }));
-    });
-    def_find_defs(AST_Node, noop);
-    def_find_defs(AST_Chain, function(compressor, suffix) {
-        return this.expression._find_defs(compressor, suffix);
-    });
-    def_find_defs(AST_Dot, function(compressor, suffix) {
-        return this.expression._find_defs(compressor, "." + this.property + suffix);
-    });
-    def_find_defs(AST_SymbolDeclaration, function() {
-        if (!this.global()) return;
-    });
-    def_find_defs(AST_SymbolRef, function(compressor, suffix) {
-        if (!this.global()) return;
-        var defines = compressor.option("global_defs");
-        var name = this.name + suffix;
-        if (HOP(defines, name)) return to_node(defines[name], this);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("_find_defs", func);
-});
-
-function best_of_expression(ast1, ast2) {
-    return ast1.size() > ast2.size() ? ast2 : ast1;
-}
-
-function best_of_statement(ast1, ast2) {
-    return best_of_expression(
-        make_node(AST_SimpleStatement, ast1, {
-            body: ast1
-        }),
-        make_node(AST_SimpleStatement, ast2, {
-            body: ast2
-        })
-    ).body;
-}
-
-function best_of(compressor, ast1, ast2) {
-    return (first_in_statement(compressor) ? best_of_statement : best_of_expression)(ast1, ast2);
-}
-
-function convert_to_predicate(obj) {
-    const out = new Map();
-    for (var key of Object.keys(obj)) {
-        out.set(key, makePredicate(obj[key]));
-    }
-    return out;
-}
-
-var object_fns = [
-    "constructor",
-    "toString",
-    "valueOf",
-];
-var native_fns = convert_to_predicate({
-    Array: [
-        "indexOf",
-        "join",
-        "lastIndexOf",
-        "slice",
-    ].concat(object_fns),
-    Boolean: object_fns,
-    Function: object_fns,
-    Number: [
-        "toExponential",
-        "toFixed",
-        "toPrecision",
-    ].concat(object_fns),
-    Object: object_fns,
-    RegExp: [
-        "test",
-    ].concat(object_fns),
-    String: [
-        "charAt",
-        "charCodeAt",
-        "concat",
-        "indexOf",
-        "italics",
-        "lastIndexOf",
-        "match",
-        "replace",
-        "search",
-        "slice",
-        "split",
-        "substr",
-        "substring",
-        "toLowerCase",
-        "toUpperCase",
-        "trim",
-    ].concat(object_fns),
-});
-var static_fns = convert_to_predicate({
-    Array: [
-        "isArray",
-    ],
-    Math: [
-        "abs",
-        "acos",
-        "asin",
-        "atan",
-        "ceil",
-        "cos",
-        "exp",
-        "floor",
-        "log",
-        "round",
-        "sin",
-        "sqrt",
-        "tan",
-        "atan2",
-        "pow",
-        "max",
-        "min",
-    ],
-    Number: [
-        "isFinite",
-        "isNaN",
-    ],
-    Object: [
-        "create",
-        "getOwnPropertyDescriptor",
-        "getOwnPropertyNames",
-        "getPrototypeOf",
-        "isExtensible",
-        "isFrozen",
-        "isSealed",
-        "keys",
-    ],
-    String: [
-        "fromCharCode",
-    ],
-});
-
-// methods to evaluate a constant expression
-(function(def_eval) {
-    // If the node has been successfully reduced to a constant,
-    // then its value is returned; otherwise the element itself
-    // is returned.
-    // They can be distinguished as constant value is never a
-    // descendant of AST_Node.
-    AST_Node.DEFMETHOD("evaluate", function(compressor) {
-        if (!compressor.option("evaluate")) return this;
-        var val = this._eval(compressor, 1);
-        if (!val || val instanceof RegExp) return val;
-        if (typeof val == "function" || typeof val == "object") return this;
-        return val;
-    });
-    var unaryPrefix = makePredicate("! ~ - + void");
-    AST_Node.DEFMETHOD("is_constant", function() {
-        // Accomodate when compress option evaluate=false
-        // as well as the common constant expressions !0 and -1
-        if (this instanceof AST_Constant) {
-            return !(this instanceof AST_RegExp);
-        } else {
-            return this instanceof AST_UnaryPrefix
-                && this.expression instanceof AST_Constant
-                && unaryPrefix.has(this.operator);
-        }
-    });
-    def_eval(AST_Statement, function() {
-        throw new Error(string_template("Cannot evaluate a statement [{file}:{line},{col}]", this.start));
-    });
-    def_eval(AST_Lambda, return_this);
-    def_eval(AST_Class, return_this);
-    def_eval(AST_Node, return_this);
-    def_eval(AST_Constant, function() {
-        return this.getValue();
-    });
-    def_eval(AST_BigInt, return_this);
-    def_eval(AST_RegExp, function(compressor) {
-        let evaluated = compressor.evaluated_regexps.get(this);
-        if (evaluated === undefined) {
-            try {
-                evaluated = (0, eval)(this.print_to_string());
-            } catch (e) {
-                evaluated = null;
-            }
-            compressor.evaluated_regexps.set(this, evaluated);
-        }
-        return evaluated || this;
-    });
-    def_eval(AST_TemplateString, function() {
-        if (this.segments.length !== 1) return this;
-        return this.segments[0].value;
-    });
-    def_eval(AST_Function, function(compressor) {
-        if (compressor.option("unsafe")) {
-            var fn = function() {};
-            fn.node = this;
-            fn.toString = () => this.print_to_string();
-            return fn;
-        }
-        return this;
-    });
-    def_eval(AST_Array, function(compressor, depth) {
-        if (compressor.option("unsafe")) {
-            var elements = [];
-            for (var i = 0, len = this.elements.length; i < len; i++) {
-                var element = this.elements[i];
-                var value = element._eval(compressor, depth);
-                if (element === value) return this;
-                elements.push(value);
-            }
-            return elements;
-        }
-        return this;
-    });
-    def_eval(AST_Object, function(compressor, depth) {
-        if (compressor.option("unsafe")) {
-            var val = {};
-            for (var i = 0, len = this.properties.length; i < len; i++) {
-                var prop = this.properties[i];
-                if (prop instanceof AST_Expansion) return this;
-                var key = prop.key;
-                if (key instanceof AST_Symbol) {
-                    key = key.name;
-                } else if (key instanceof AST_Node) {
-                    key = key._eval(compressor, depth);
-                    if (key === prop.key) return this;
-                }
-                if (typeof Object.prototype[key] === "function") {
-                    return this;
-                }
-                if (prop.value instanceof AST_Function) continue;
-                val[key] = prop.value._eval(compressor, depth);
-                if (val[key] === prop.value) return this;
-            }
-            return val;
-        }
-        return this;
-    });
-    var non_converting_unary = makePredicate("! typeof void");
-    def_eval(AST_UnaryPrefix, function(compressor, depth) {
-        var e = this.expression;
-        // Function would be evaluated to an array and so typeof would
-        // incorrectly return 'object'. Hence making is a special case.
-        if (compressor.option("typeofs")
-            && this.operator == "typeof"
-            && (e instanceof AST_Lambda
-                || e instanceof AST_SymbolRef
-                    && e.fixed_value() instanceof AST_Lambda)) {
-            return typeof function() {};
-        }
-        if (!non_converting_unary.has(this.operator)) depth++;
-        e = e._eval(compressor, depth);
-        if (e === this.expression) return this;
-        switch (this.operator) {
-          case "!": return !e;
-          case "typeof":
-            // typeof <RegExp> returns "object" or "function" on different platforms
-            // so cannot evaluate reliably
-            if (e instanceof RegExp) return this;
-            return typeof e;
-          case "void": return void e;
-          case "~": return ~e;
-          case "-": return -e;
-          case "+": return +e;
-        }
-        return this;
-    });
-    var non_converting_binary = makePredicate("&& || ?? === !==");
-    const identity_comparison = makePredicate("== != === !==");
-    const has_identity = value =>
-        typeof value === "object"
-        || typeof value === "function"
-        || typeof value === "symbol";
-
-    def_eval(AST_Binary, function(compressor, depth) {
-        if (!non_converting_binary.has(this.operator)) depth++;
-
-        var left = this.left._eval(compressor, depth);
-        if (left === this.left) return this;
-        var right = this.right._eval(compressor, depth);
-        if (right === this.right) return this;
-        var result;
-
-        if (
-            left != null
-            && right != null
-            && identity_comparison.has(this.operator)
-            && has_identity(left)
-            && has_identity(right)
-            && typeof left === typeof right
-        ) {
-            // Do not compare by reference
-            return this;
-        }
-
-        switch (this.operator) {
-          case "&&"  : result = left &&  right; break;
-          case "||"  : result = left ||  right; break;
-          case "??"  : result = left != null ? left : right; break;
-          case "|"   : result = left |   right; break;
-          case "&"   : result = left &   right; break;
-          case "^"   : result = left ^   right; break;
-          case "+"   : result = left +   right; break;
-          case "*"   : result = left *   right; break;
-          case "**"  : result = Math.pow(left, right); break;
-          case "/"   : result = left /   right; break;
-          case "%"   : result = left %   right; break;
-          case "-"   : result = left -   right; break;
-          case "<<"  : result = left <<  right; break;
-          case ">>"  : result = left >>  right; break;
-          case ">>>" : result = left >>> right; break;
-          case "=="  : result = left ==  right; break;
-          case "===" : result = left === right; break;
-          case "!="  : result = left !=  right; break;
-          case "!==" : result = left !== right; break;
-          case "<"   : result = left <   right; break;
-          case "<="  : result = left <=  right; break;
-          case ">"   : result = left >   right; break;
-          case ">="  : result = left >=  right; break;
-          default:
-              return this;
-        }
-        if (isNaN(result) && compressor.find_parent(AST_With)) {
-            // leave original expression as is
-            return this;
-        }
-        return result;
-    });
-    def_eval(AST_Conditional, function(compressor, depth) {
-        var condition = this.condition._eval(compressor, depth);
-        if (condition === this.condition) return this;
-        var node = condition ? this.consequent : this.alternative;
-        var value = node._eval(compressor, depth);
-        return value === node ? this : value;
-    });
-
-    // Set of AST_SymbolRef which are currently being evaluated.
-    // Avoids infinite recursion of ._eval()
-    const reentrant_ref_eval = new Set();
-    def_eval(AST_SymbolRef, function(compressor, depth) {
-        if (reentrant_ref_eval.has(this)) return this;
-
-        var fixed = this.fixed_value();
-        if (!fixed) return this;
-
-        reentrant_ref_eval.add(this);
-        const value = fixed._eval(compressor, depth);
-        reentrant_ref_eval.delete(this);
-
-        if (value === fixed) return this;
-
-        if (value && typeof value == "object") {
-            var escaped = this.definition().escaped;
-            if (escaped && depth > escaped) return this;
-        }
-        return value;
-    });
-    var global_objs = { Array, Math, Number, Object, String };
-    var static_values = convert_to_predicate({
-        Math: [
-            "E",
-            "LN10",
-            "LN2",
-            "LOG2E",
-            "LOG10E",
-            "PI",
-            "SQRT1_2",
-            "SQRT2",
-        ],
-        Number: [
-            "MAX_VALUE",
-            "MIN_VALUE",
-            "NaN",
-            "NEGATIVE_INFINITY",
-            "POSITIVE_INFINITY",
-        ],
-    });
-    const regexp_flags = new Set([
-        "dotAll",
-        "global",
-        "ignoreCase",
-        "multiline",
-        "sticky",
-        "unicode",
-    ]);
-    def_eval(AST_PropAccess, function(compressor, depth) {
-        if (this.optional) {
-            const obj = this.expression._eval(compressor, depth);
-            if (obj == null) return undefined;
-        }
-        if (compressor.option("unsafe")) {
-            var key = this.property;
-            if (key instanceof AST_Node) {
-                key = key._eval(compressor, depth);
-                if (key === this.property) return this;
-            }
-            var exp = this.expression;
-            var val;
-            if (is_undeclared_ref(exp)) {
-
-                var aa;
-                var first_arg = exp.name === "hasOwnProperty"
-                    && key === "call"
-                    && (aa = compressor.parent() && compressor.parent().args)
-                    && (aa && aa[0]
-                    && aa[0].evaluate(compressor));
-
-                first_arg = first_arg instanceof AST_Dot ? first_arg.expression : first_arg;
-
-                if (first_arg == null || first_arg.thedef && first_arg.thedef.undeclared) {
-                    return this.clone();
-                }
-                var static_value = static_values.get(exp.name);
-                if (!static_value || !static_value.has(key)) return this;
-                val = global_objs[exp.name];
-            } else {
-                val = exp._eval(compressor, depth + 1);
-                if (val instanceof RegExp) {
-                    if (key == "source") {
-                        return regexp_source_fix(val.source);
-                    } else if (key == "flags" || regexp_flags.has(key)) {
-                        return val[key];
-                    }
-                }
-                if (!val || val === exp || !HOP(val, key)) return this;
-                if (typeof val == "function") switch (key) {
-                  case "name":
-                    return val.node.name ? val.node.name.name : "";
-                  case "length":
-                    return val.node.length_property();
-                  default:
-                    return this;
-                }
-            }
-            return val[key];
-        }
-        return this;
-    });
-    def_eval(AST_Chain, function(compressor, depth) {
-        const evaluated = this.expression._eval(compressor, depth);
-        return evaluated === this.expression ? this : evaluated;
-    });
-    def_eval(AST_Call, function(compressor, depth) {
-        var exp = this.expression;
-        if (this.optional) {
-            const callee = this.expression._eval(compressor, depth);
-            if (callee == null) return undefined;
-        }
-        if (compressor.option("unsafe") && exp instanceof AST_PropAccess) {
-            var key = exp.property;
-            if (key instanceof AST_Node) {
-                key = key._eval(compressor, depth);
-                if (key === exp.property) return this;
-            }
-            var val;
-            var e = exp.expression;
-            if (is_undeclared_ref(e)) {
-                var first_arg =
-                    e.name === "hasOwnProperty" &&
-                    key === "call" &&
-                    (this.args[0] && this.args[0].evaluate(compressor));
-
-                first_arg = first_arg instanceof AST_Dot ? first_arg.expression : first_arg;
-
-                if ((first_arg == null || first_arg.thedef && first_arg.thedef.undeclared)) {
-                    return this.clone();
-                }
-                var static_fn = static_fns.get(e.name);
-                if (!static_fn || !static_fn.has(key)) return this;
-                val = global_objs[e.name];
-            } else {
-                val = e._eval(compressor, depth + 1);
-                if (val === e || !val) return this;
-                var native_fn = native_fns.get(val.constructor.name);
-                if (!native_fn || !native_fn.has(key)) return this;
-            }
-            var args = [];
-            for (var i = 0, len = this.args.length; i < len; i++) {
-                var arg = this.args[i];
-                var value = arg._eval(compressor, depth);
-                if (arg === value) return this;
-                if (arg instanceof AST_Lambda) return this;
-                args.push(value);
-            }
-            try {
-                return val[key].apply(val, args);
-            } catch (ex) {
-                // We don't really care
-            }
-        }
-        return this;
-    });
-    def_eval(AST_New, return_this);
-})(function(node, func) {
-    node.DEFMETHOD("_eval", func);
-});
-
-// method to negate an expression
-(function(def_negate) {
-    function basic_negation(exp) {
-        return make_node(AST_UnaryPrefix, exp, {
-            operator: "!",
-            expression: exp
-        });
-    }
-    function best(orig, alt, first_in_statement) {
-        var negated = basic_negation(orig);
-        if (first_in_statement) {
-            var stat = make_node(AST_SimpleStatement, alt, {
-                body: alt
-            });
-            return best_of_expression(negated, stat) === stat ? alt : negated;
-        }
-        return best_of_expression(negated, alt);
-    }
-    def_negate(AST_Node, function() {
-        return basic_negation(this);
-    });
-    def_negate(AST_Statement, function() {
-        throw new Error("Cannot negate a statement");
-    });
-    def_negate(AST_Function, function() {
-        return basic_negation(this);
-    });
-    def_negate(AST_Arrow, function() {
-        return basic_negation(this);
-    });
-    def_negate(AST_UnaryPrefix, function() {
-        if (this.operator == "!")
-            return this.expression;
-        return basic_negation(this);
-    });
-    def_negate(AST_Sequence, function(compressor) {
-        var expressions = this.expressions.slice();
-        expressions.push(expressions.pop().negate(compressor));
-        return make_sequence(this, expressions);
-    });
-    def_negate(AST_Conditional, function(compressor, first_in_statement) {
-        var self = this.clone();
-        self.consequent = self.consequent.negate(compressor);
-        self.alternative = self.alternative.negate(compressor);
-        return best(this, self, first_in_statement);
-    });
-    def_negate(AST_Binary, function(compressor, first_in_statement) {
-        var self = this.clone(), op = this.operator;
-        if (compressor.option("unsafe_comps")) {
-            switch (op) {
-              case "<=" : self.operator = ">"  ; return self;
-              case "<"  : self.operator = ">=" ; return self;
-              case ">=" : self.operator = "<"  ; return self;
-              case ">"  : self.operator = "<=" ; return self;
-            }
-        }
-        switch (op) {
-          case "==" : self.operator = "!="; return self;
-          case "!=" : self.operator = "=="; return self;
-          case "===": self.operator = "!=="; return self;
-          case "!==": self.operator = "==="; return self;
-          case "&&":
-            self.operator = "||";
-            self.left = self.left.negate(compressor, first_in_statement);
-            self.right = self.right.negate(compressor);
-            return best(this, self, first_in_statement);
-          case "||":
-            self.operator = "&&";
-            self.left = self.left.negate(compressor, first_in_statement);
-            self.right = self.right.negate(compressor);
-            return best(this, self, first_in_statement);
-          case "??":
-            self.right = self.right.negate(compressor);
-            return best(this, self, first_in_statement);
-        }
-        return basic_negation(this);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("negate", function(compressor, first_in_statement) {
-        return func.call(this, compressor, first_in_statement);
-    });
-});
-
-var global_pure_fns = makePredicate("Boolean decodeURI decodeURIComponent Date encodeURI encodeURIComponent Error escape EvalError isFinite isNaN Number Object parseFloat parseInt RangeError ReferenceError String SyntaxError TypeError unescape URIError");
-AST_Call.DEFMETHOD("is_callee_pure", function(compressor) {
-    if (compressor.option("unsafe")) {
-        var expr = this.expression;
-        var first_arg = (this.args && this.args[0] && this.args[0].evaluate(compressor));
-        if (
-            expr.expression && expr.expression.name === "hasOwnProperty" &&
-            (first_arg == null || first_arg.thedef && first_arg.thedef.undeclared)
-        ) {
-            return false;
-        }
-        if (is_undeclared_ref(expr) && global_pure_fns.has(expr.name)) return true;
-        let static_fn;
-        if (expr instanceof AST_Dot
-            && is_undeclared_ref(expr.expression)
-            && (static_fn = static_fns.get(expr.expression.name))
-            && static_fn.has(expr.property)) {
-            return true;
-        }
-    }
-    return !!has_annotation(this, _PURE) || !compressor.pure_funcs(this);
-});
-AST_Node.DEFMETHOD("is_call_pure", return_false);
-AST_Dot.DEFMETHOD("is_call_pure", function(compressor) {
-    if (!compressor.option("unsafe")) return;
-    const expr = this.expression;
-    let map;
-    if (expr instanceof AST_Array) {
-        map = native_fns.get("Array");
-    } else if (expr.is_boolean()) {
-        map = native_fns.get("Boolean");
-    } else if (expr.is_number(compressor)) {
-        map = native_fns.get("Number");
-    } else if (expr instanceof AST_RegExp) {
-        map = native_fns.get("RegExp");
-    } else if (expr.is_string(compressor)) {
-        map = native_fns.get("String");
-    } else if (!this.may_throw_on_access(compressor)) {
-        map = native_fns.get("Object");
-    }
-    return map && map.has(this.property);
-});
-
-const pure_prop_access_globals = new Set([
-    "Number",
-    "String",
-    "Array",
-    "Object",
-    "Function",
-    "Promise",
-]);
-// determine if expression has side effects
-(function(def_has_side_effects) {
-    def_has_side_effects(AST_Node, return_true);
-
-    def_has_side_effects(AST_EmptyStatement, return_false);
-    def_has_side_effects(AST_Constant, return_false);
-    def_has_side_effects(AST_This, return_false);
-
-    function any(list, compressor) {
-        for (var i = list.length; --i >= 0;)
-            if (list[i].has_side_effects(compressor))
-                return true;
-        return false;
-    }
-
-    def_has_side_effects(AST_Block, function(compressor) {
-        return any(this.body, compressor);
-    });
-    def_has_side_effects(AST_Call, function(compressor) {
-        if (
-            !this.is_callee_pure(compressor)
-            && (!this.expression.is_call_pure(compressor)
-                || this.expression.has_side_effects(compressor))
-        ) {
-            return true;
-        }
-        return any(this.args, compressor);
-    });
-    def_has_side_effects(AST_Switch, function(compressor) {
-        return this.expression.has_side_effects(compressor)
-            || any(this.body, compressor);
-    });
-    def_has_side_effects(AST_Case, function(compressor) {
-        return this.expression.has_side_effects(compressor)
-            || any(this.body, compressor);
-    });
-    def_has_side_effects(AST_Try, function(compressor) {
-        return any(this.body, compressor)
-            || this.bcatch && this.bcatch.has_side_effects(compressor)
-            || this.bfinally && this.bfinally.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_If, function(compressor) {
-        return this.condition.has_side_effects(compressor)
-            || this.body && this.body.has_side_effects(compressor)
-            || this.alternative && this.alternative.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_LabeledStatement, function(compressor) {
-        return this.body.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_SimpleStatement, function(compressor) {
-        return this.body.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Lambda, return_false);
-    def_has_side_effects(AST_Class, function (compressor) {
-        if (this.extends && this.extends.has_side_effects(compressor)) {
-            return true;
-        }
-        return any(this.properties, compressor);
-    });
-    def_has_side_effects(AST_Binary, function(compressor) {
-        return this.left.has_side_effects(compressor)
-            || this.right.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Assign, return_true);
-    def_has_side_effects(AST_Conditional, function(compressor) {
-        return this.condition.has_side_effects(compressor)
-            || this.consequent.has_side_effects(compressor)
-            || this.alternative.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Unary, function(compressor) {
-        return unary_side_effects.has(this.operator)
-            || this.expression.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_SymbolRef, function(compressor) {
-        return !this.is_declared(compressor) && !pure_prop_access_globals.has(this.name);
-    });
-    def_has_side_effects(AST_SymbolClassProperty, return_false);
-    def_has_side_effects(AST_SymbolDeclaration, return_false);
-    def_has_side_effects(AST_Object, function(compressor) {
-        return any(this.properties, compressor);
-    });
-    def_has_side_effects(AST_ObjectProperty, function(compressor) {
-        return (
-            this.computed_key() && this.key.has_side_effects(compressor)
-            || this.value && this.value.has_side_effects(compressor)
-        );
-    });
-    def_has_side_effects(AST_ClassProperty, function(compressor) {
-        return (
-            this.computed_key() && this.key.has_side_effects(compressor)
-            || this.static && this.value && this.value.has_side_effects(compressor)
-        );
-    });
-    def_has_side_effects(AST_ConciseMethod, function(compressor) {
-        return this.computed_key() && this.key.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_ObjectGetter, function(compressor) {
-        return this.computed_key() && this.key.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_ObjectSetter, function(compressor) {
-        return this.computed_key() && this.key.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Array, function(compressor) {
-        return any(this.elements, compressor);
-    });
-    def_has_side_effects(AST_Dot, function(compressor) {
-        return !this.optional && this.expression.may_throw_on_access(compressor)
-            || this.expression.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Sub, function(compressor) {
-        if (this.optional && is_nullish(this.expression, compressor)) {
-            return false;
-        }
-
-        return !this.optional && this.expression.may_throw_on_access(compressor)
-            || this.expression.has_side_effects(compressor)
-            || this.property.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Chain, function (compressor) {
-        return this.expression.has_side_effects(compressor);
-    });
-    def_has_side_effects(AST_Sequence, function(compressor) {
-        return any(this.expressions, compressor);
-    });
-    def_has_side_effects(AST_Definitions, function(compressor) {
-        return any(this.definitions, compressor);
-    });
-    def_has_side_effects(AST_VarDef, function() {
-        return this.value;
-    });
-    def_has_side_effects(AST_TemplateSegment, return_false);
-    def_has_side_effects(AST_TemplateString, function(compressor) {
-        return any(this.segments, compressor);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("has_side_effects", func);
-});
-
-// determine if expression may throw
-(function(def_may_throw) {
-    def_may_throw(AST_Node, return_true);
-
-    def_may_throw(AST_Constant, return_false);
-    def_may_throw(AST_EmptyStatement, return_false);
-    def_may_throw(AST_Lambda, return_false);
-    def_may_throw(AST_SymbolDeclaration, return_false);
-    def_may_throw(AST_This, return_false);
-
-    function any(list, compressor) {
-        for (var i = list.length; --i >= 0;)
-            if (list[i].may_throw(compressor))
-                return true;
-        return false;
-    }
-
-    def_may_throw(AST_Class, function(compressor) {
-        if (this.extends && this.extends.may_throw(compressor)) return true;
-        return any(this.properties, compressor);
-    });
-
-    def_may_throw(AST_Array, function(compressor) {
-        return any(this.elements, compressor);
-    });
-    def_may_throw(AST_Assign, function(compressor) {
-        if (this.right.may_throw(compressor)) return true;
-        if (!compressor.has_directive("use strict")
-            && this.operator == "="
-            && this.left instanceof AST_SymbolRef) {
-            return false;
-        }
-        return this.left.may_throw(compressor);
-    });
-    def_may_throw(AST_Binary, function(compressor) {
-        return this.left.may_throw(compressor)
-            || this.right.may_throw(compressor);
-    });
-    def_may_throw(AST_Block, function(compressor) {
-        return any(this.body, compressor);
-    });
-    def_may_throw(AST_Call, function(compressor) {
-        if (this.optional && is_nullish(this.expression, compressor)) return false;
-        if (any(this.args, compressor)) return true;
-        if (this.is_callee_pure(compressor)) return false;
-        if (this.expression.may_throw(compressor)) return true;
-        return !(this.expression instanceof AST_Lambda)
-            || any(this.expression.body, compressor);
-    });
-    def_may_throw(AST_Case, function(compressor) {
-        return this.expression.may_throw(compressor)
-            || any(this.body, compressor);
-    });
-    def_may_throw(AST_Conditional, function(compressor) {
-        return this.condition.may_throw(compressor)
-            || this.consequent.may_throw(compressor)
-            || this.alternative.may_throw(compressor);
-    });
-    def_may_throw(AST_Definitions, function(compressor) {
-        return any(this.definitions, compressor);
-    });
-    def_may_throw(AST_If, function(compressor) {
-        return this.condition.may_throw(compressor)
-            || this.body && this.body.may_throw(compressor)
-            || this.alternative && this.alternative.may_throw(compressor);
-    });
-    def_may_throw(AST_LabeledStatement, function(compressor) {
-        return this.body.may_throw(compressor);
-    });
-    def_may_throw(AST_Object, function(compressor) {
-        return any(this.properties, compressor);
-    });
-    def_may_throw(AST_ObjectProperty, function(compressor) {
-        // TODO key may throw too
-        return this.value ? this.value.may_throw(compressor) : false;
-    });
-    def_may_throw(AST_ClassProperty, function(compressor) {
-        return (
-            this.computed_key() && this.key.may_throw(compressor)
-            || this.static && this.value && this.value.may_throw(compressor)
-        );
-    });
-    def_may_throw(AST_ConciseMethod, function(compressor) {
-        return this.computed_key() && this.key.may_throw(compressor);
-    });
-    def_may_throw(AST_ObjectGetter, function(compressor) {
-        return this.computed_key() && this.key.may_throw(compressor);
-    });
-    def_may_throw(AST_ObjectSetter, function(compressor) {
-        return this.computed_key() && this.key.may_throw(compressor);
-    });
-    def_may_throw(AST_Return, function(compressor) {
-        return this.value && this.value.may_throw(compressor);
-    });
-    def_may_throw(AST_Sequence, function(compressor) {
-        return any(this.expressions, compressor);
-    });
-    def_may_throw(AST_SimpleStatement, function(compressor) {
-        return this.body.may_throw(compressor);
-    });
-    def_may_throw(AST_Dot, function(compressor) {
-        return !this.optional && this.expression.may_throw_on_access(compressor)
-            || this.expression.may_throw(compressor);
-    });
-    def_may_throw(AST_Sub, function(compressor) {
-        if (this.optional && is_nullish(this.expression, compressor)) return false;
+AST_Symbol.DEFMETHOD("fixed_value", function() {
+    var fixed = this.thedef.fixed;
+    if (!fixed || fixed instanceof AST_Node) return fixed;
+    return fixed();
+});
 
-        return !this.optional && this.expression.may_throw_on_access(compressor)
-            || this.expression.may_throw(compressor)
-            || this.property.may_throw(compressor);
-    });
-    def_may_throw(AST_Chain, function(compressor) {
-        return this.expression.may_throw(compressor);
-    });
-    def_may_throw(AST_Switch, function(compressor) {
-        return this.expression.may_throw(compressor)
-            || any(this.body, compressor);
-    });
-    def_may_throw(AST_SymbolRef, function(compressor) {
-        return !this.is_declared(compressor) && !pure_prop_access_globals.has(this.name);
-    });
-    def_may_throw(AST_SymbolClassProperty, return_false);
-    def_may_throw(AST_Try, function(compressor) {
-        return this.bcatch ? this.bcatch.may_throw(compressor) : any(this.body, compressor)
-            || this.bfinally && this.bfinally.may_throw(compressor);
-    });
-    def_may_throw(AST_Unary, function(compressor) {
-        if (this.operator == "typeof" && this.expression instanceof AST_SymbolRef)
-            return false;
-        return this.expression.may_throw(compressor);
-    });
-    def_may_throw(AST_VarDef, function(compressor) {
-        if (!this.value) return false;
-        return this.value.may_throw(compressor);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("may_throw", func);
+AST_SymbolRef.DEFMETHOD("is_immutable", function() {
+    var orig = this.definition().orig;
+    return orig.length == 1 && orig[0] instanceof AST_SymbolLambda;
 });
 
-// determine if expression is constant
-(function(def_is_constant_expression) {
-    function all_refs_local(scope) {
-        let result = true;
-        walk(this, node => {
-            if (node instanceof AST_SymbolRef) {
-                if (has_flag(this, INLINED)) {
-                    result = false;
-                    return walk_abort;
-                }
-                var def = node.definition();
-                if (
-                    member(def, this.enclosed)
-                    && !this.variables.has(def.name)
-                ) {
-                    if (scope) {
-                        var scope_def = scope.find_variable(node);
-                        if (def.undeclared ? !scope_def : scope_def === def) {
-                            result = "f";
-                            return true;
-                        }
-                    }
-                    result = false;
-                    return walk_abort;
-                }
-                return true;
-            }
-            if (node instanceof AST_This && this instanceof AST_Arrow) {
-                // TODO check arguments too!
-                result = false;
-                return walk_abort;
-            }
-        });
-        return result;
+function find_scope(tw) {
+    for (let i = 0;;i++) {
+        const p = tw.parent(i);
+        if (p instanceof AST_Toplevel) return p;
+        if (p instanceof AST_Lambda) return p;
+        if (p.block_scope) return p.block_scope;
     }
+}
 
-    def_is_constant_expression(AST_Node, return_false);
-    def_is_constant_expression(AST_Constant, return_true);
-    def_is_constant_expression(AST_Class, function(scope) {
-        if (this.extends && !this.extends.is_constant_expression(scope)) {
-            return false;
-        }
-
-        for (const prop of this.properties) {
-            if (prop.computed_key() && !prop.key.is_constant_expression(scope)) {
-                return false;
-            }
-            if (prop.static && prop.value && !prop.value.is_constant_expression(scope)) {
-                return false;
-            }
+function find_variable(compressor, name) {
+    var scope, i = 0;
+    while (scope = compressor.parent(i++)) {
+        if (scope instanceof AST_Scope) break;
+        if (scope instanceof AST_Catch && scope.argname) {
+            scope = scope.argname.definition().scope;
+            break;
         }
+    }
+    return scope.find_variable(name);
+}
 
-        return all_refs_local.call(this, scope);
-    });
-    def_is_constant_expression(AST_Lambda, all_refs_local);
-    def_is_constant_expression(AST_Unary, function() {
-        return this.expression.is_constant_expression();
-    });
-    def_is_constant_expression(AST_Binary, function() {
-        return this.left.is_constant_expression()
-            && this.right.is_constant_expression();
-    });
-    def_is_constant_expression(AST_Array, function() {
-        return this.elements.every((l) => l.is_constant_expression());
-    });
-    def_is_constant_expression(AST_Object, function() {
-        return this.properties.every((l) => l.is_constant_expression());
-    });
-    def_is_constant_expression(AST_ObjectProperty, function() {
-        return !!(!(this.key instanceof AST_Node) && this.value && this.value.is_constant_expression());
-    });
-})(function(node, func) {
-    node.DEFMETHOD("is_constant_expression", func);
-});
-
-// tell me if a statement aborts
-function aborts(thing) {
-    return thing && thing.aborts();
+function is_empty(thing) {
+    if (thing === null) return true;
+    if (thing instanceof AST_EmptyStatement) return true;
+    if (thing instanceof AST_BlockStatement) return thing.body.length == 0;
+    return false;
 }
-(function(def_aborts) {
-    def_aborts(AST_Statement, return_null);
-    def_aborts(AST_Jump, return_this);
-    function block_aborts() {
-        for (var i = 0; i < this.body.length; i++) {
-            if (aborts(this.body[i])) {
-                return this.body[i];
-            }
-        }
-        return null;
-    }
-    def_aborts(AST_Import, function() { return null; });
-    def_aborts(AST_BlockStatement, block_aborts);
-    def_aborts(AST_SwitchBranch, block_aborts);
-    def_aborts(AST_If, function() {
-        return this.alternative && aborts(this.body) && aborts(this.alternative) && this;
-    });
-})(function(node, func) {
-    node.DEFMETHOD("aborts", func);
+
+var global_names = makePredicate("Array Boolean clearInterval clearTimeout console Date decodeURI decodeURIComponent encodeURI encodeURIComponent Error escape eval EvalError Function isFinite isNaN JSON Math Number parseFloat parseInt RangeError ReferenceError RegExp Object setInterval setTimeout String SyntaxError TypeError unescape URIError");
+AST_SymbolRef.DEFMETHOD("is_declared", function(compressor) {
+    return !this.definition().undeclared
+        || compressor.option("unsafe") && global_names.has(this.name);
 });
 
 /* -----[ optimizers ]----- */
@@ -4387,7 +1244,7 @@ AST_Scope.DEFMETHOD("hoist_properties", function(compressor) {
         ) {
             const defs = defs_by_id.get(node.expression.definition().id);
             if (defs) {
-                const def = defs.get(String(get_value(node.property)));
+                const def = defs.get(String(get_simple_key(node.property)));
                 const sym = make_node(AST_SymbolRef, node, {
                     name: def.name,
                     scope: node.expression.scope,
@@ -4401,223 +1258,6 @@ AST_Scope.DEFMETHOD("hoist_properties", function(compressor) {
     return self.transform(hoister);
 });
 
-// drop_side_effect_free()
-// remove side-effect-free parts which only affects return value
-(function(def_drop_side_effect_free) {
-    // Drop side-effect-free elements from an array of expressions.
-    // Returns an array of expressions with side-effects or null
-    // if all elements were dropped. Note: original array may be
-    // returned if nothing changed.
-    function trim(nodes, compressor, first_in_statement) {
-        var len = nodes.length;
-        if (!len) return null;
-        var ret = [], changed = false;
-        for (var i = 0; i < len; i++) {
-            var node = nodes[i].drop_side_effect_free(compressor, first_in_statement);
-            changed |= node !== nodes[i];
-            if (node) {
-                ret.push(node);
-                first_in_statement = false;
-            }
-        }
-        return changed ? ret.length ? ret : null : nodes;
-    }
-
-    def_drop_side_effect_free(AST_Node, return_this);
-    def_drop_side_effect_free(AST_Constant, return_null);
-    def_drop_side_effect_free(AST_This, return_null);
-    def_drop_side_effect_free(AST_Call, function(compressor, first_in_statement) {
-        if (this.optional && is_nullish(this.expression, compressor)) {
-            return make_node(AST_Undefined, this);
-        }
-
-        if (!this.is_callee_pure(compressor)) {
-            if (this.expression.is_call_pure(compressor)) {
-                var exprs = this.args.slice();
-                exprs.unshift(this.expression.expression);
-                exprs = trim(exprs, compressor, first_in_statement);
-                return exprs && make_sequence(this, exprs);
-            }
-            if (is_func_expr(this.expression)
-                && (!this.expression.name || !this.expression.name.definition().references.length)) {
-                var node = this.clone();
-                node.expression.process_expression(false, compressor);
-                return node;
-            }
-            return this;
-        }
-        var args = trim(this.args, compressor, first_in_statement);
-        return args && make_sequence(this, args);
-    });
-    def_drop_side_effect_free(AST_Accessor, return_null);
-    def_drop_side_effect_free(AST_Function, return_null);
-    def_drop_side_effect_free(AST_Arrow, return_null);
-    def_drop_side_effect_free(AST_Class, function (compressor) {
-        const with_effects = [];
-        const trimmed_extends = this.extends && this.extends.drop_side_effect_free(compressor);
-        if (trimmed_extends) with_effects.push(trimmed_extends);
-        for (const prop of this.properties) {
-            const trimmed_prop = prop.drop_side_effect_free(compressor);
-            if (trimmed_prop) with_effects.push(trimmed_prop);
-        }
-        if (!with_effects.length) return null;
-        return make_sequence(this, with_effects);
-    });
-    def_drop_side_effect_free(AST_Binary, function(compressor, first_in_statement) {
-        var right = this.right.drop_side_effect_free(compressor);
-        if (!right) return this.left.drop_side_effect_free(compressor, first_in_statement);
-        if (lazy_op.has(this.operator)) {
-            if (right === this.right) return this;
-            var node = this.clone();
-            node.right = right;
-            return node;
-        } else {
-            var left = this.left.drop_side_effect_free(compressor, first_in_statement);
-            if (!left) return this.right.drop_side_effect_free(compressor, first_in_statement);
-            return make_sequence(this, [ left, right ]);
-        }
-    });
-    def_drop_side_effect_free(AST_Assign, function(compressor) {
-        if (this.logical) return this;
-
-        var left = this.left;
-        if (left.has_side_effects(compressor)
-            || compressor.has_directive("use strict")
-                && left instanceof AST_PropAccess
-                && left.expression.is_constant()) {
-            return this;
-        }
-        set_flag(this, WRITE_ONLY);
-        while (left instanceof AST_PropAccess) {
-            left = left.expression;
-        }
-        if (left.is_constant_expression(compressor.find_parent(AST_Scope))) {
-            return this.right.drop_side_effect_free(compressor);
-        }
-        return this;
-    });
-    def_drop_side_effect_free(AST_Conditional, function(compressor) {
-        var consequent = this.consequent.drop_side_effect_free(compressor);
-        var alternative = this.alternative.drop_side_effect_free(compressor);
-        if (consequent === this.consequent && alternative === this.alternative) return this;
-        if (!consequent) return alternative ? make_node(AST_Binary, this, {
-            operator: "||",
-            left: this.condition,
-            right: alternative
-        }) : this.condition.drop_side_effect_free(compressor);
-        if (!alternative) return make_node(AST_Binary, this, {
-            operator: "&&",
-            left: this.condition,
-            right: consequent
-        });
-        var node = this.clone();
-        node.consequent = consequent;
-        node.alternative = alternative;
-        return node;
-    });
-    def_drop_side_effect_free(AST_Unary, function(compressor, first_in_statement) {
-        if (unary_side_effects.has(this.operator)) {
-            if (!this.expression.has_side_effects(compressor)) {
-                set_flag(this, WRITE_ONLY);
-            } else {
-                clear_flag(this, WRITE_ONLY);
-            }
-            return this;
-        }
-        if (this.operator == "typeof" && this.expression instanceof AST_SymbolRef) return null;
-        var expression = this.expression.drop_side_effect_free(compressor, first_in_statement);
-        if (first_in_statement && expression && is_iife_call(expression)) {
-            if (expression === this.expression && this.operator == "!") return this;
-            return expression.negate(compressor, first_in_statement);
-        }
-        return expression;
-    });
-    def_drop_side_effect_free(AST_SymbolRef, function(compressor) {
-        const safe_access = this.is_declared(compressor)
-            || pure_prop_access_globals.has(this.name);
-        return safe_access ? null : this;
-    });
-    def_drop_side_effect_free(AST_Object, function(compressor, first_in_statement) {
-        var values = trim(this.properties, compressor, first_in_statement);
-        return values && make_sequence(this, values);
-    });
-    def_drop_side_effect_free(AST_ObjectProperty, function(compressor, first_in_statement) {
-        const computed_key = this instanceof AST_ObjectKeyVal && this.key instanceof AST_Node;
-        const key = computed_key && this.key.drop_side_effect_free(compressor, first_in_statement);
-        const value = this.value && this.value.drop_side_effect_free(compressor, first_in_statement);
-        if (key && value) {
-            return make_sequence(this, [key, value]);
-        }
-        return key || value;
-    });
-    def_drop_side_effect_free(AST_ClassProperty, function (compressor) {
-        const key = this.computed_key() && this.key.drop_side_effect_free(compressor);
-
-        const value = this.static && this.value
-            && this.value.drop_side_effect_free(compressor);
-
-        if (key && value) return make_sequence(this, [key, value]);
-        return key || value || null;
-    });
-    def_drop_side_effect_free(AST_ConciseMethod, function () {
-        return this.computed_key() ? this.key : null;
-    });
-    def_drop_side_effect_free(AST_ObjectGetter, function () {
-        return this.computed_key() ? this.key : null;
-    });
-    def_drop_side_effect_free(AST_ObjectSetter, function () {
-        return this.computed_key() ? this.key : null;
-    });
-    def_drop_side_effect_free(AST_Array, function(compressor, first_in_statement) {
-        var values = trim(this.elements, compressor, first_in_statement);
-        return values && make_sequence(this, values);
-    });
-    def_drop_side_effect_free(AST_Dot, function(compressor, first_in_statement) {
-        if (this.optional) {
-            return is_nullish(this.expression, compressor) ? make_node(AST_Undefined, this) : this;
-        }
-        if (this.expression.may_throw_on_access(compressor)) return this;
-
-        return this.expression.drop_side_effect_free(compressor, first_in_statement);
-    });
-    def_drop_side_effect_free(AST_Sub, function(compressor, first_in_statement) {
-        if (this.optional) {
-            return is_nullish(this.expression, compressor) ? make_node(AST_Undefined, this): this;
-        }
-        if (this.expression.may_throw_on_access(compressor)) return this;
-
-        var expression = this.expression.drop_side_effect_free(compressor, first_in_statement);
-        if (!expression) return this.property.drop_side_effect_free(compressor, first_in_statement);
-        var property = this.property.drop_side_effect_free(compressor);
-        if (!property) return expression;
-        return make_sequence(this, [ expression, property ]);
-    });
-    def_drop_side_effect_free(AST_Chain, function (compressor, first_in_statement) {
-        return this.expression.drop_side_effect_free(compressor, first_in_statement);
-    });
-    def_drop_side_effect_free(AST_Sequence, function(compressor) {
-        var last = this.tail_node();
-        var expr = last.drop_side_effect_free(compressor);
-        if (expr === last) return this;
-        var expressions = this.expressions.slice(0, -1);
-        if (expr) expressions.push(expr);
-        if (!expressions.length) {
-            return make_node(AST_Number, this, { value: 0 });
-        }
-        return make_sequence(this, expressions);
-    });
-    def_drop_side_effect_free(AST_Expansion, function(compressor, first_in_statement) {
-        return this.expression.drop_side_effect_free(compressor, first_in_statement);
-    });
-    def_drop_side_effect_free(AST_TemplateSegment, return_null);
-    def_drop_side_effect_free(AST_TemplateString, function(compressor) {
-        var values = trim(this.segments, compressor, first_in_statement);
-        return values && make_sequence(this, values);
-    });
-})(function(node, func) {
-    node.DEFMETHOD("drop_side_effect_free", func);
-});
-
 def_optimize(AST_SimpleStatement, function(self, compressor) {
     if (compressor.option("side_effects")) {
         var body = self.body;
@@ -4636,20 +1276,6 @@ def_optimize(AST_While, function(self, compressor) {
     return compressor.option("loops") ? make_node(AST_For, self, self).optimize(compressor) : self;
 });
 
-function has_break_or_continue(loop, parent) {
-    var found = false;
-    var tw = new TreeWalker(function(node) {
-        if (found || node instanceof AST_Scope) return true;
-        if (node instanceof AST_LoopControl && tw.loopcontrol_target(node) === loop) {
-            return found = true;
-        }
-    });
-    if (parent instanceof AST_LabeledStatement) tw.push(parent);
-    tw.push(loop);
-    loop.body.walk(tw);
-    return found;
-}
-
 def_optimize(AST_Do, function(self, compressor) {
     if (!compressor.option("loops")) return self;
     var cond = self.condition.tail_node().evaluate(compressor);
@@ -4967,58 +1593,294 @@ def_optimize(AST_Switch, function(self, compressor) {
                 }
             }
         }
-        if (aborts(branch)) {
-            var prev = body[body.length - 1];
-            if (aborts(prev) && prev.body.length == branch.body.length
-                && make_node(AST_BlockStatement, prev, prev).equivalent_to(make_node(AST_BlockStatement, branch, branch))) {
-                prev.body = [];
-            }
-        }
         body.push(branch);
     }
     while (i < len) eliminate_branch(self.body[i++], body[body.length - 1]);
+    self.body = body;
+
+    let default_or_exact = default_branch || exact_match;
+    default_branch = null;
+    exact_match = null;
+
+    // group equivalent branches so they will be located next to each other,
+    // that way the next micro-optimization will merge them.
+    // ** bail micro-optimization if not a simple switch case with breaks
+    if (body.every((branch, i) =>
+        (branch === default_or_exact || branch.expression instanceof AST_Constant)
+        && (branch.body.length === 0 || aborts(branch) || body.length - 1 === i))
+    ) {
+        for (let i = 0; i < body.length; i++) {
+            const branch = body[i];
+            for (let j = i + 1; j < body.length; j++) {
+                const next = body[j];
+                if (next.body.length === 0) continue;
+                const last_branch = j === (body.length - 1);
+                const equivalentBranch = branches_equivalent(next, branch, false);
+                if (equivalentBranch || (last_branch && branches_equivalent(next, branch, true))) {
+                    if (!equivalentBranch && last_branch) {
+                        next.body.push(make_node(AST_Break));
+                    }
+
+                    // let's find previous siblings with inert fallthrough...
+                    let x = j - 1;
+                    let fallthroughDepth = 0;
+                    while (x > i) {
+                        if (is_inert_body(body[x--])) {
+                            fallthroughDepth++;
+                        } else {
+                            break;
+                        }
+                    }
+
+                    const plucked = body.splice(j - fallthroughDepth, 1 + fallthroughDepth);
+                    body.splice(i + 1, 0, ...plucked);
+                    i += plucked.length;
+                }
+            }
+        }
+    }
+
+    // merge equivalent branches in a row
+    for (let i = 0; i < body.length; i++) {
+        let branch = body[i];
+        if (branch.body.length === 0) continue;
+        if (!aborts(branch)) continue;
+
+        for (let j = i + 1; j < body.length; i++, j++) {
+            let next = body[j];
+            if (next.body.length === 0) continue;
+            if (
+                branches_equivalent(next, branch, false)
+                || (j === body.length - 1 && branches_equivalent(next, branch, true))
+            ) {
+                branch.body = [];
+                branch = next;
+                continue;
+            }
+            break;
+        }
+    }
+
+    // Prune any empty branches at the end of the switch statement.
+    {
+        let i = body.length - 1;
+        for (; i >= 0; i--) {
+            let bbody = body[i].body;
+            if (is_break(bbody[bbody.length - 1], compressor)) bbody.pop();
+            if (!is_inert_body(body[i])) break;
+        }
+        // i now points to the index of a branch that contains a body. By incrementing, it's
+        // pointing to the first branch that's empty.
+        i++;
+        if (!default_or_exact || body.indexOf(default_or_exact) >= i) {
+            // The default behavior is to do nothing. We can take advantage of that to
+            // remove all case expressions that are side-effect free that also do
+            // nothing, since they'll default to doing nothing. But we can't remove any
+            // case expressions before one that would side-effect, since they may cause
+            // the side-effect to be skipped.
+            for (let j = body.length - 1; j >= i; j--) {
+                let branch = body[j];
+                if (branch === default_or_exact) {
+                    default_or_exact = null;
+                    body.pop();
+                } else if (!branch.expression.has_side_effects(compressor)) {
+                    body.pop();
+                } else {
+                    break;
+                }
+            }
+        }
+    }
+
+
+    // Prune side-effect free branches that fall into default.
+    DEFAULT: if (default_or_exact) {
+        let default_index = body.indexOf(default_or_exact);
+        let default_body_index = default_index;
+        for (; default_body_index < body.length - 1; default_body_index++) {
+            if (!is_inert_body(body[default_body_index])) break;
+        }
+        if (default_body_index < body.length - 1) {
+            break DEFAULT;
+        }
+
+        let side_effect_index = body.length - 1;
+        for (; side_effect_index >= 0; side_effect_index--) {
+            let branch = body[side_effect_index];
+            if (branch === default_or_exact) continue;
+            if (branch.expression.has_side_effects(compressor)) break;
+        }
+        // If the default behavior comes after any side-effect case expressions,
+        // then we can fold all side-effect free cases into the default branch.
+        // If the side-effect case is after the default, then any side-effect
+        // free cases could prevent the side-effect from occurring.
+        if (default_body_index > side_effect_index) {
+            let prev_body_index = default_index - 1;
+            for (; prev_body_index >= 0; prev_body_index--) {
+                if (!is_inert_body(body[prev_body_index])) break;
+            }
+            let before = Math.max(side_effect_index, prev_body_index) + 1;
+            let after = default_index;
+            if (side_effect_index > default_index) {
+                // If the default falls into the same body as a side-effect
+                // case, then we need preserve that case and only prune the
+                // cases after it.
+                after = side_effect_index;
+                body[side_effect_index].body = body[default_body_index].body;
+            } else {
+                // The default will be the last branch.
+                default_or_exact.body = body[default_body_index].body;
+            }
+
+            // Prune everything after the default (or last side-effect case)
+            // until the next case with a body.
+            body.splice(after + 1, default_body_index - after);
+            // Prune everything before the default that falls into it.
+            body.splice(before, default_index - before);
+        }
+    }
+
+    // See if we can remove the switch entirely if all cases (the default) fall into the same case body.
+    DEFAULT: if (default_or_exact) {
+        let i = body.findIndex(branch => !is_inert_body(branch));
+        let caseBody;
+        // `i` is equal to one of the following:
+        // - `-1`, there is no body in the switch statement.
+        // - `body.length - 1`, all cases fall into the same body.
+        // - anything else, there are multiple bodies in the switch.
+        if (i === body.length - 1) {
+            // All cases fall into the case body.
+            let branch = body[i];
+            if (has_nested_break(self)) break DEFAULT;
+
+            // This is the last case body, and we've already pruned any breaks, so it's
+            // safe to hoist.
+            caseBody = make_node(AST_BlockStatement, branch, {
+                body: branch.body
+            });
+            branch.body = [];
+        } else if (i !== -1) {
+            // If there are multiple bodies, then we cannot optimize anything.
+            break DEFAULT;
+        }
+
+        let sideEffect = body.find(branch => {
+            return (
+                branch !== default_or_exact
+                && branch.expression.has_side_effects(compressor)
+            );
+        });
+        // If no cases cause a side-effect, we can eliminate the switch entirely.
+        if (!sideEffect) {
+            return make_node(AST_BlockStatement, self, {
+                body: decl.concat(
+                    statement(self.expression),
+                    default_or_exact.expression ? statement(default_or_exact.expression) : [],
+                    caseBody || []
+                )
+            }).optimize(compressor);
+        }
+
+        // If we're this far, either there was no body or all cases fell into the same body.
+        // If there was no body, then we don't need a default branch (because the default is
+        // do nothing). If there was a body, we'll extract it to after the switch, so the
+        // switch's new default is to do nothing and we can still prune it.
+        const default_index = body.indexOf(default_or_exact);
+        body.splice(default_index, 1);
+        default_or_exact = null;
+
+        if (caseBody) {
+            // Recurse into switch statement one more time so that we can append the case body
+            // outside of the switch. This recursion will only happen once since we've pruned
+            // the default case.
+            return make_node(AST_BlockStatement, self, {
+                body: decl.concat(self, caseBody)
+            }).optimize(compressor);
+        }
+        // If we fall here, there is a default branch somewhere, there are no case bodies,
+        // and there's a side-effect somewhere. Just let the below paths take care of it.
+    }
+
     if (body.length > 0) {
         body[0].body = decl.concat(body[0].body);
     }
-    self.body = body;
-    while (branch = body[body.length - 1]) {
-        var stat = branch.body[branch.body.length - 1];
-        if (stat instanceof AST_Break && compressor.loopcontrol_target(stat) === self)
-            branch.body.pop();
-        if (branch.body.length || branch instanceof AST_Case
-            && (default_branch || branch.expression.has_side_effects(compressor))) break;
-        if (body.pop() === default_branch) default_branch = null;
-    }
+
     if (body.length == 0) {
         return make_node(AST_BlockStatement, self, {
-            body: decl.concat(make_node(AST_SimpleStatement, self.expression, {
-                body: self.expression
-            }))
+            body: decl.concat(statement(self.expression))
         }).optimize(compressor);
     }
-    if (body.length == 1 && (body[0] === exact_match || body[0] === default_branch)) {
-        var has_break = false;
-        var tw = new TreeWalker(function(node) {
-            if (has_break
-                || node instanceof AST_Lambda
-                || node instanceof AST_SimpleStatement) return true;
-            if (node instanceof AST_Break && tw.loopcontrol_target(node) === self)
-                has_break = true;
-        });
-        self.walk(tw);
-        if (!has_break) {
-            var statements = body[0].body.slice();
-            var exp = body[0].expression;
-            if (exp) statements.unshift(make_node(AST_SimpleStatement, exp, {
-                body: exp
-            }));
-            statements.unshift(make_node(AST_SimpleStatement, self.expression, {
-                body:self.expression
-            }));
-            return make_node(AST_BlockStatement, self, {
-                body: statements
+    if (body.length == 1 && !has_nested_break(self)) {
+        // This is the last case body, and we've already pruned any breaks, so it's
+        // safe to hoist.
+        let branch = body[0];
+        return make_node(AST_If, self, {
+            condition: make_node(AST_Binary, self, {
+                operator: "===",
+                left: self.expression,
+                right: branch.expression,
+            }),
+            body: make_node(AST_BlockStatement, branch, {
+                body: branch.body
+            }),
+            alternative: null
+        }).optimize(compressor);
+    }
+    if (body.length === 2 && default_or_exact && !has_nested_break(self)) {
+        let branch = body[0] === default_or_exact ? body[1] : body[0];
+        let exact_exp = default_or_exact.expression && statement(default_or_exact.expression);
+        if (aborts(body[0])) {
+            // Only the first branch body could have a break (at the last statement)
+            let first = body[0];
+            if (is_break(first.body[first.body.length - 1], compressor)) {
+                first.body.pop();
+            }
+            return make_node(AST_If, self, {
+                condition: make_node(AST_Binary, self, {
+                    operator: "===",
+                    left: self.expression,
+                    right: branch.expression,
+                }),
+                body: make_node(AST_BlockStatement, branch, {
+                    body: branch.body
+                }),
+                alternative: make_node(AST_BlockStatement, default_or_exact, {
+                    body: [].concat(
+                        exact_exp || [],
+                        default_or_exact.body
+                    )
+                })
             }).optimize(compressor);
         }
+        let operator = "===";
+        let consequent = make_node(AST_BlockStatement, branch, {
+            body: branch.body,
+        });
+        let always = make_node(AST_BlockStatement, default_or_exact, {
+            body: [].concat(
+                exact_exp || [],
+                default_or_exact.body
+            )
+        });
+        if (body[0] === default_or_exact) {
+            operator = "!==";
+            let tmp = always;
+            always = consequent;
+            consequent = tmp;
+        }
+        return make_node(AST_BlockStatement, self, {
+            body: [
+                make_node(AST_If, self, {
+                    condition: make_node(AST_Binary, self, {
+                        operator: operator,
+                        left: self.expression,
+                        right: branch.expression,
+                    }),
+                    body: consequent,
+                    alternative: null
+                })
+            ].concat(always)
+        }).optimize(compressor);
     }
     return self;
 
@@ -5029,6 +1891,50 @@ def_optimize(AST_Switch, function(self, compressor) {
             trim_unreachable_code(compressor, branch, decl);
         }
     }
+    function branches_equivalent(branch, prev, insertBreak) {
+        let bbody = branch.body;
+        let pbody = prev.body;
+        if (insertBreak) {
+            bbody = bbody.concat(make_node(AST_Break));
+        }
+        if (bbody.length !== pbody.length) return false;
+        let bblock = make_node(AST_BlockStatement, branch, { body: bbody });
+        let pblock = make_node(AST_BlockStatement, prev, { body: pbody });
+        return bblock.equivalent_to(pblock);
+    }
+    function statement(expression) {
+        return make_node(AST_SimpleStatement, expression, {
+            body: expression
+        });
+    }
+    function has_nested_break(root) {
+        let has_break = false;
+        let tw = new TreeWalker(node => {
+            if (has_break) return true;
+            if (node instanceof AST_Lambda) return true;
+            if (node instanceof AST_SimpleStatement) return true;
+            if (!is_break(node, tw)) return;
+            let parent = tw.parent();
+            if (
+                parent instanceof AST_SwitchBranch
+                && parent.body[parent.body.length - 1] === node
+            ) {
+                return;
+            }
+            has_break = true;
+        });
+        root.walk(tw);
+        return has_break;
+    }
+    function is_break(node, stack) {
+        return node instanceof AST_Break
+            && stack.loopcontrol_target(node) === self;
+    }
+    function is_inert_body(branch) {
+        return !aborts(branch) && !make_node(AST_BlockStatement, branch, {
+            body: branch.body
+        }).has_side_effects(compressor);
+    }
 });
 
 def_optimize(AST_Try, function(self, compressor) {
@@ -5149,10 +2055,6 @@ def_optimize(AST_Call, function(self, compressor) {
         }
     }
 
-    if (self.optional && is_nullish(fn, compressor)) {
-        return make_node(AST_Undefined, self);
-    }
-
     var is_func = fn instanceof AST_Lambda;
 
     if (is_func && fn.pinned()) return self;
@@ -5195,6 +2097,14 @@ def_optimize(AST_Call, function(self, compressor) {
     }
 
     if (compressor.option("unsafe")) {
+        if (exp instanceof AST_Dot && exp.start.value === "Array" && exp.property === "from" && self.args.length === 1) {
+            const [argument] = self.args;
+            if (argument instanceof AST_Array) {
+                return make_node(AST_Array, argument, {
+                    elements: argument.elements
+                }).optimize(compressor);
+            }
+        }
         if (is_undeclared_ref(exp)) switch (exp.name) {
           case "Array":
             if (self.args.length != 1) {
@@ -5400,6 +2310,7 @@ def_optimize(AST_Call, function(self, compressor) {
             argnames: [],
             body: []
         }).optimize(compressor);
+        var nth_identifier = compressor.mangle_options && compressor.mangle_options.nth_identifier || base54;
         if (self.args.every((x) => x instanceof AST_String)) {
             // quite a corner-case, but we can handle it:
             //   https://github.com/mishoo/UglifyJS2/issues/203
@@ -5409,14 +2320,13 @@ def_optimize(AST_Call, function(self, compressor) {
                     return arg.value;
                 }).join(",") + "){" + self.args[self.args.length - 1].value + "})";
                 var ast = parse(code);
-                var mangle = { ie8: compressor.option("ie8") };
+                var mangle = { ie8: compressor.option("ie8"), nth_identifier: nth_identifier };
                 ast.figure_out_scope(mangle);
                 var comp = new Compressor(compressor.options, {
                     mangle_options: compressor.mangle_options
                 });
                 ast = ast.transform(comp);
                 ast.figure_out_scope(mangle);
-                base54.reset();
                 ast.compute_char_frequency(mangle);
                 ast.mangle_names(mangle);
                 var fun;
@@ -5511,7 +2421,7 @@ def_optimize(AST_Call, function(self, compressor) {
                 || has_annotation(self, _INLINE)
                 || compressor.option("unused")
                     && (def = exp.definition()).references.length == 1
-                    && !recursive_ref(compressor, def)
+                    && !is_recursive_ref(compressor, def)
                     && fn.is_constant_expression(exp.scope))
             && !has_annotation(self, _PURE | _NOINLINE)
             && !fn.contains_this()
@@ -5541,6 +2451,7 @@ def_optimize(AST_Call, function(self, compressor) {
     if (can_inline && has_annotation(self, _INLINE)) {
         set_flag(fn, SQUEEZED);
         fn = make_node(fn.CTOR === AST_Defun ? AST_Function : fn.CTOR, fn, fn);
+        fn = fn.clone(true);
         fn.figure_out_scope({}, {
             parent_scope: find_scope(compressor),
             toplevel: compressor.get_toplevel()
@@ -5761,12 +2672,14 @@ def_optimize(AST_Call, function(self, compressor) {
         flatten_args(decls, expressions);
         flatten_vars(decls, expressions);
         expressions.push(returned_value);
+
         if (decls.length) {
             const i = scope.body.indexOf(compressor.parent(level - 1)) + 1;
             scope.body.splice(i, 0, make_node(AST_Var, fn, {
                 definitions: decls
             }));
         }
+
         return expressions.map(exp => exp.clone(true));
     }
 });
@@ -5837,16 +2750,16 @@ def_optimize(AST_UnaryPostfix, function(self, compressor) {
 
 def_optimize(AST_UnaryPrefix, function(self, compressor) {
     var e = self.expression;
-    if (self.operator == "delete"
-        && !(e instanceof AST_SymbolRef
-            || e instanceof AST_PropAccess
-            || is_identifier_atom(e))) {
-        if (e instanceof AST_Sequence) {
-            const exprs = e.expressions.slice();
-            exprs.push(make_node(AST_True, self));
-            return make_sequence(self, exprs).optimize(compressor);
-        }
-        return make_sequence(self, [ e, make_node(AST_True, self) ]).optimize(compressor);
+    if (
+        self.operator == "delete" &&
+        !(
+            e instanceof AST_SymbolRef ||
+            e instanceof AST_PropAccess ||
+            e instanceof AST_Chain ||
+            is_identifier_atom(e)
+        )
+    ) {
+        return make_sequence(self, [e, make_node(AST_True, self)]).optimize(compressor);
     }
     var seq = self.lift_sequences(compressor);
     if (seq !== self) {
@@ -6421,20 +3334,6 @@ def_optimize(AST_SymbolExport, function(self) {
     return self;
 });
 
-function recursive_ref(compressor, def) {
-    var node;
-    for (var i = 0; node = compressor.parent(i); i++) {
-        if (
-            node instanceof AST_Lambda
-            || node instanceof AST_Class
-        ) {
-            var name = node.name;
-            if (name && name.definition() === def) break;
-        }
-    }
-    return node;
-}
-
 function within_array_or_object_literal(compressor) {
     var node, level = 0;
     while (node = compressor.parent(level++)) {
@@ -6498,7 +3397,7 @@ def_optimize(AST_SymbolRef, function(self, compressor) {
                     || within_array_or_object_literal(compressor)
                     || !compressor.option("reduce_funcs"))) {
                 single_use = false;
-            } else if (recursive_ref(compressor, def)) {
+            } else if (is_recursive_ref(compressor, def)) {
                 single_use = false;
             } else if (def.scope !== self.scope || def.orig[0] instanceof AST_SymbolFunarg) {
                 single_use = fixed.is_constant_expression(self.scope);
@@ -6692,7 +3591,15 @@ function is_reachable(self, defs) {
         if (node instanceof AST_Scope && node !== self) {
             var parent = info.parent();
 
-            if (parent instanceof AST_Call && parent.expression === node) return;
+            if (
+                parent instanceof AST_Call
+                && parent.expression === node
+                // Async/Generators aren't guaranteed to sync evaluate all of
+                // their body steps, so it's possible they close over the variable.
+                && !(node.async || node.is_generator)
+            ) {
+                return;
+            }
 
             if (walk(node, find_ref)) return walk_abort;
 
@@ -6783,23 +3690,6 @@ def_optimize(AST_DefaultAssign, function(self, compressor) {
     return self;
 });
 
-function is_nullish(node, compressor) {
-    let fixed;
-    return (
-        node instanceof AST_Null
-        || is_undefined(node, compressor)
-        || (
-            node instanceof AST_SymbolRef
-            && (fixed = node.definition().fixed) instanceof AST_Node
-            && is_nullish(fixed, compressor)
-        )
-        // Recurse into those optional chains!
-        || node instanceof AST_PropAccess && node.optional && is_nullish(node.expression, compressor)
-        || node instanceof AST_Call && node.optional && is_nullish(node.expression, compressor)
-        || node instanceof AST_Chain && is_nullish(node.expression, compressor)
-    );
-}
-
 function is_nullish_check(check, check_subject, compressor) {
     if (check_subject.may_throw(compressor)) return false;
 
@@ -7050,7 +3940,8 @@ def_optimize(AST_Conditional, function(self, compressor) {
             right: alternative
         }).optimize(compressor);
     }
-    var in_bool = compressor.in_boolean_context();
+
+    const in_bool = compressor.in_boolean_context();
     if (is_true(self.consequent)) {
         if (is_false(self.alternative)) {
             // c ? true : false ---> !!c
@@ -7356,14 +4247,20 @@ def_optimize(AST_Sub, function(self, compressor) {
         ev = make_node_from_constant(ev, self).optimize(compressor);
         return best_of(compressor, ev, self);
     }
-    if (self.optional && is_nullish(self.expression, compressor)) {
-        return make_node(AST_Undefined, self);
-    }
     return self;
 });
 
 def_optimize(AST_Chain, function (self, compressor) {
-    self.expression = self.expression.optimize(compressor);
+    if (is_nullish(self.expression, compressor)) {
+        let parent = compressor.parent();
+        // It's valid to delete a nullish optional chain, but if we optimized
+        // this to `delete undefined` then it would appear to be a syntax error
+        // when we try to optimize the delete. Thankfully, `delete 0` is fine.
+        if (parent instanceof AST_UnaryPrefix && parent.operator === "delete") {
+            return make_node_from_constant(0, self);
+        }
+        return make_node(AST_Undefined, self);
+    }
     return self;
 });
 
@@ -7430,9 +4327,6 @@ def_optimize(AST_Dot, function(self, compressor) {
         ev = make_node_from_constant(ev, self).optimize(compressor);
         return best_of(compressor, ev, self);
     }
-    if (self.optional && is_nullish(self.expression, compressor)) {
-        return make_node(AST_Undefined, self);
-    }
     return self;
 });
 
@@ -7492,9 +4386,11 @@ function inline_object_prop_spread(props, compressor) {
                 // non-iterable value silently does nothing; it is thus safe
                 // to remove. AST_String is the only iterable AST_Constant.
                 props.splice(i, 1);
+                i--;
             } else if (is_nullish(expr, compressor)) {
                 // Likewise, null and undefined can be silently removed.
                 props.splice(i, 1);
+                i--;
             }
         }
     }
@@ -7642,12 +4538,15 @@ function lift_key(self, compressor) {
         if (self.key.value == "constructor"
             && compressor.parent() instanceof AST_Class) return self;
         if (self instanceof AST_ObjectKeyVal) {
+            self.quote = self.key.quote;
             self.key = self.key.value;
         } else if (self instanceof AST_ClassProperty) {
+            self.quote = self.key.quote;
             self.key = make_node(AST_SymbolClassProperty, self.key, {
                 name: self.key.value
             });
         } else {
+            self.quote = self.key.quote;
             self.key = make_node(AST_SymbolMethod, self.key, {
                 name: self.key.value
             });