fix corner cases with logical assignment operators (#4828)

fixes #4827

lib/compress.js

@@ -2391,21 +2391,36 @@ merge(Compressor.prototype, {
                 return null;
             }
 
+            function find_stop_logical(parent, op, level) {
+                var node;
+                do {
+                    node = parent;
+                    parent = scanner.parent(++level);
+                } while (parent instanceof AST_Assign && parent.operator.slice(0, -1) == op
+                    || parent instanceof AST_Binary && parent.operator == op);
+                return node;
+            }
+
             function find_stop_value(node, level) {
                 var parent = scanner.parent(level);
                 if (parent instanceof AST_Array) return find_stop_value(parent, level + 1);
-                if (parent instanceof AST_Assign) return may_throw(parent) || parent.left.match_symbol(function(ref) {
+                if (parent instanceof AST_Assign) {
-                    return ref instanceof AST_SymbolRef && (lhs.name == ref.name || value_def.name == ref.name);
+                    if (may_throw(parent)) return node;
-                }) ? node : find_stop_value(parent, level + 1);
+                    if (parent.left.match_symbol(function(ref) {
-                if (parent instanceof AST_Binary) {
+                        return ref instanceof AST_SymbolRef && (lhs.name == ref.name || value_def.name == ref.name);
-                    if (lazy_op[parent.operator] && parent.left !== node) {
+                    })) return node;
-                        do {
+                    var op;
-                            node = parent;
+                    if (parent.left === node || !lazy_op[op = parent.operator.slice(0, -1)]) {
-                            parent = scanner.parent(++level);
+                        return find_stop_value(parent, level + 1);
-                        } while (parent instanceof AST_Binary && parent.operator == node.operator);
-                        return node;
                     }
-                    return find_stop_value(parent, level + 1);
+                    return find_stop_logical(parent, op, level);
+                }
+                if (parent instanceof AST_Binary) {
+                    var op;
+                    if (parent.left === node || !lazy_op[op = parent.operator]) {
+                        return find_stop_value(parent, level + 1);
+                    }
+                    return find_stop_logical(parent, op, level);
                 }
                 if (parent instanceof AST_Call) return parent;
                 if (parent instanceof AST_Case) {
@@ -5325,8 +5340,9 @@ merge(Compressor.prototype, {
         var tw = new TreeWalker(function(node, descend) {
             if (node instanceof AST_Assign) {
                 var lhs = node.left;
+                var rhs = node.right;
                 if (lhs instanceof AST_Destructured) {
-                    node.right.walk(tw);
+                    rhs.walk(tw);
                     var marker = new TreeWalker(function(node) {
                         if (node instanceof AST_Destructured) return;
                         if (node instanceof AST_DefaultValue) {
@@ -5354,9 +5370,17 @@ merge(Compressor.prototype, {
                     lhs.walk(marker);
                     return true;
                 }
+                if (lazy_op[node.operator.slice(0, -1)]) {
+                    lhs.walk(tw);
+                    push();
+                    rhs.walk(tw);
+                    if (lhs instanceof AST_SymbolRef) mark(lhs);
+                    pop();
+                    return true;
+                }
                 if (lhs instanceof AST_SymbolRef) {
                     if (node.operator != "=") mark(lhs, true);
-                    node.right.walk(tw);
+                    rhs.walk(tw);
                     mark(lhs);
                     return true;
                 }

test/compress/assignments.js

@@ -603,3 +603,72 @@ issue_4819: {
     expect_stdout: "true"
     node_version: ">=15"
 }
+
+issue_4827_1: {
+    options = {
+        collapse_vars: true,
+        toplevel: true,
+    }
+    input: {
+        A = "FAIL";
+        var a = A, b = "PASS", c;
+        c &&= b = a, console.log(b);
+    }
+    expect: {
+        A = "FAIL";
+        var a = A, b = "PASS", c;
+        c &&= b = a, console.log(b);
+    }
+    expect_stdout: "PASS"
+    node_version: ">=15"
+}
+
+issue_4827_2: {
+    options = {
+        collapse_vars: true,
+        inline: true,
+        reduce_vars: true,
+        side_effects: true,
+        toplevel: true,
+        unused: true,
+    }
+    input: {
+        var a = 0, b = "PASS";
+        function f(c) {
+            a++,
+            c &&= b = a;
+        }
+        f();
+        console.log(b);
+    }
+    expect: {
+        var a = 0, b = "PASS";
+        a++,
+        c &&= b = a;
+        var c;
+        console.log(b);
+    }
+    expect_stdout: "PASS"
+    node_version: ">=15"
+}
+
+issue_4827_3: {
+    options = {
+        merge_vars: true,
+        toplevel: true,
+    }
+    input: {
+        var a = 0, b, c;
+        a++;
+        c &&= b = a;
+        console.log(b);
+    }
+    expect: {
+        var a = 0, b, c;
+        a++;
+        c &&= b = a;
+        console.log(b);
+    }
+    expect_stdout: "undefined"
+    node_version: ">=15"
+}