dart2js cps: More rewritings for compound assignments.

pkg/compiler/lib/src/tree_ir/optimization/statement_rewriter.dart

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library tree_ir.optimization.statement_rewriter;
 
 import 'optimization.dart' show Pass;
 import '../tree_ir_nodes.dart';
 import '../../io/source_information.dart';
 import '../../elements/elements.dart';
@@ skipping 734 matching lines @@
     }
     return node;
   }
 
   Expression visitTypeOperator(TypeOperator node) {
     _rewriteList(node.typeArguments);
     node.value = visitExpression(node.value);
     return node;
   }
 
-  bool sameVariable(Expression e1, Expression e2) {
-    return e1 is VariableUse && e2 is VariableUse && e1.variable == e2.variable;
-  }
-
   bool isCompoundableBuiltin(Expression e) {
     return e is ApplyBuiltinOperator &&
-           e.arguments.length == 2 &&
+           e.arguments.length >= 2 &&
            isCompoundableOperator(e.operator);
   }
 
+  /// Converts a compoundable operator application into the right-hand side for
+  /// use in a compound assignment, discarding the left-hand value.
+  ///
+  /// For example, for `x + y + z` it returns `y + z`.
+  Expression contractCompoundableBuiltin(ApplyBuiltinOperator e) {
+    assert(isCompoundableBuiltin(e));
+    if (e.arguments.length > 2) {
+      assert(e.operator == BuiltinOperator.StringConcatenate);
+      return new ApplyBuiltinOperator(e.operator, e.arguments.skip(1).toList());
+    } else {
+      return e.arguments[1];
+    }
+  }
+
   void destroyVariableUse(VariableUse node) {
     --node.variable.readCount;
   }
 
   Expression visitSetField(SetField node) {
     allowRhsPropagation.add(true);
     node.value = visitExpression(node.value);
     if (isCompoundableBuiltin(node.value)) {
       ApplyBuiltinOperator rhs = node.value;
       Expression left = rhs.arguments[0];
-      Expression right = rhs.arguments[1];
       if (left is GetField &&
           left.field == node.field &&
-          sameVariable(left.object, node.object)) {
-        destroyVariableUse(left.object);
+          samePrimary(left.object, node.object)) {
+        destroyPrimaryExpression(left.object);
         node.compound = rhs.operator;
-        node.value = right;
+        node.value = contractCompoundableBuiltin(rhs);
       }
     }
     node.object = visitExpression(node.object);
     allowRhsPropagation.removeLast();
     return node;
   }
 
   Expression visitGetField(GetField node) {
     node.object = visitExpression(node.object);
     return node;
   }
 
   Expression visitGetStatic(GetStatic node) {
     return node;
   }
 
   Expression visitSetStatic(SetStatic node) {
     allowRhsPropagation.add(true);
     node.value = visitExpression(node.value);
+    if (isCompoundableBuiltin(node.value)) {
+      ApplyBuiltinOperator rhs = node.value;
+      Expression left = rhs.arguments[0];
+      if (left is GetStatic &&
+          left.element == node.element &&
+          !left.useLazyGetter) {
+        node.compound = rhs.operator;
+        node.value = contractCompoundableBuiltin(rhs);
+      }
+    }
     allowRhsPropagation.removeLast();
     return node;
   }
 
   Expression visitGetTypeTestProperty(GetTypeTestProperty node) {
     node.object = visitExpression(node.object);
     return node;
   }
 
   Expression visitCreateBox(CreateBox node) {
@@ skipping 39 matching lines @@
     node.index = visitExpression(node.index);
     node.object = visitExpression(node.object);
     return node;
   }
 
   Expression visitSetIndex(SetIndex node) {
     node.value = visitExpression(node.value);
     if (isCompoundableBuiltin(node.value)) {
       ApplyBuiltinOperator rhs = node.value;
       Expression left = rhs.arguments[0];
-      Expression right = rhs.arguments[1];
       if (left is GetIndex &&
-          sameVariable(left.object, node.object) &&
-          sameVariable(left.index, node.index)) {
-        destroyVariableUse(left.object);
-        destroyVariableUse(left.index);
+          samePrimary(left.object, node.object) &&
+          samePrimary(left.index, node.index)) {
+        destroyPrimaryExpression(left.object);
+        destroyPrimaryExpression(left.index);
         node.compound = rhs.operator;
-        node.value = right;
+        node.value = contractCompoundableBuiltin(rhs);
       }
     }
     node.index = visitExpression(node.index);
     node.object = visitExpression(node.object);
     return node;
   }
 
   /// True if [operator] is a binary operator that always has the same value
   /// if its arguments are swapped.
   bool isSymmetricOperator(BuiltinOperator operator) {
@@ skipping 151 matching lines @@
   ///
   ///     C ? (v = E1) : (v = E2)
   ///       ==>
   ///     v = C ? E1 : E2
   ///
   /// The latter form is more compact and can also be inlined.
   CombinedExpressions combineAsConditional(
       Expression s,
       Expression t,
       Expression condition) {
-    if (s is Assign && t is Assign && s.variable == t.variable) {
-      Expression values = new Conditional(condition, s.value, t.value);
-      return new CombinedAssigns(s, t, new CombinedExpressions(values));
+    if (s is Assign && t is Assign &&
+        s.variable == t.variable) {
+      return new CombinedAssigns(s, t,
+          combineAsConditional(s.value, t.value, condition));
+    }
+    if (s is SetStatic &&
+        t is SetStatic &&
+        s.element == t.element) {
+      return new CombinedSetStatics(s, t,
+            combineAsConditional(s.value, t.value, condition));
+    }
+    if (s is SetField &&
+        t is SetField &&
+        s.compound == null &&
+        t.compound == null &&
+        s.field == t.field &&
+        samePrimary(s.object, t.object)) {
+      return new CombinedSetFields(s, t,
+          combineAsConditional(s.value, t.value, condition));
+    }
+    if (s is SetIndex &&
+        t is SetIndex &&
+        s.compound == null &&
+        t.compound == null &&
+        samePrimary(s.object, t.object) &&
+        samePrimary(s.index, t.index)) {
+      return new CombinedSetIndexes(s, t,
+          combineAsConditional(s.value, t.value, condition));
     }
     return new CombinedExpressions(new Conditional(condition, s, t));
   }
 
   /// Returns a statement equivalent to both [s] and [t], or null if [s] and
   /// [t] are incompatible.
   /// If non-null is returned, the caller MUST discard [s] and [t] and use
   /// the returned statement instead.
   /// If two breaks are combined, the label's break counter will be decremented.
   Statement combineStatements(Statement s, Statement t) {
@@ skipping 222 matching lines @@
 ///
 /// Explicitly reverting a combination is necessary to maintain variable
 /// reference counts.
 abstract class CombinedExpressions {
   Expression get combined;
   void uncombine();
 
   factory CombinedExpressions(Expression e) = GenericCombinedExpressions;
 }
 
-/// Combines assignments of form `[variable] := E1` and `[variable] := E2` into
-/// a single assignment of form `[variable] := combine(E1, E2)`.
+/// Combines assignments of form `v := E1` and `v := E2` into
+/// a single assignment of form `v := combine(E1, E2)`.

[sra1, 2016/01/22 03:22:04]

We probably want to avoid this where one arm is a constant that the JS VM can
tell does not need a write-barrier. 

[asgerf, 2016/01/22 18:54:47]

Good point.  I looked at the IR generated by V8 in the two cases and it does
indeed hit a write-barrier it would not hit otherwise.

 class CombinedAssigns implements CombinedExpressions {
   Assign assign1, assign2;
   CombinedExpressions value;
-  Expression combined;
+  Assign combined;
 
   CombinedAssigns(this.assign1, this.assign2, this.value) {
     assert(assign1.variable == assign2.variable);
     assign1.variable.writeCount -= 2; // Destroy the two original assignemnts.
     combined = new Assign(assign1.variable, value.combined);
   }
 
   void uncombine() {
     value.uncombine();
     ++assign1.variable.writeCount; // Restore original reference count.
   }
 }
 
+/// Combines `static = E1` and `static = E2` into `static = combine(E1, E2)`.
+class CombinedSetStatics implements CombinedExpressions {
+  SetStatic assign1, assign2;
+  CombinedExpressions value;
+  SetStatic combined;
+
+  CombinedSetStatics(this.assign1, this.assign2, this.value) {
+    assert(assign1.element == assign2.element);
+    // TODO(asgerf): Can we combine source information from the two assignments?
+    combined = new SetStatic(assign1.element, value.combined,
+        assign1.sourceInformation);
+  }
+
+  void uncombine() {
+    value.uncombine();
+  }
+}
+
+/// Combines `v.field = E1` and `v.field = E2` into `v.field = combine(E1, E2)`.
+class CombinedSetFields implements CombinedExpressions {
+  SetField assign1, assign2;
+  CombinedExpressions value;
+  SetField combined;
+
+  CombinedSetFields(this.assign1, this.assign2, this.value) {
+    assert(samePrimary(assign1.object, assign2.object));
+    assert(assign1.field == assign2.field);
+    assert(assign1.compound == null);
+    assert(assign2.compound == null);
+    destroyPrimaryExpression(assign2.object);
+    combined = new SetField(assign1.object, assign1.field, value.combined);
+  }
+
+  void uncombine() {
+    value.uncombine();
+    restorePrimaryExpression(assign2.object);
+  }
+}
+
+/// Combines `v[index] = E1` and `v[index] = E2` into
+/// `v[index] = combine(E1, E2)`.
+class CombinedSetIndexes implements CombinedExpressions {
+  SetIndex assign1, assign2;
+  CombinedExpressions value;
+  SetIndex combined;
+
+  CombinedSetIndexes(this.assign1, this.assign2, this.value) {
+    assert(samePrimary(assign1.object, assign2.object));
+    assert(samePrimary(assign1.index, assign2.index));
+    assert(assign1.compound == null);
+    assert(assign2.compound == null);
+    destroyPrimaryExpression(assign2.object);
+    destroyPrimaryExpression(assign2.index);
+    combined = new SetIndex(assign1.object, assign1.index, value.combined,
+        compound: assign1.compound);
+  }
+
+  void uncombine() {
+    value.uncombine();
+    restorePrimaryExpression(assign2.object);
+    restorePrimaryExpression(assign2.index);
+  }
+}
+
 /// Combines two variable uses into one.
 class CombinedUses implements CombinedExpressions {
   VariableUse use1, use2;
-  Expression combined;
+  VariableUse combined;
 
   CombinedUses(this.use1, this.use2) {
     assert(use1.variable == use2.variable);
     use1.variable.readCount -= 2; // Destroy both the original uses.
     combined = new VariableUse(use1.variable);
   }
 
   void uncombine() {
     ++use1.variable.readCount; // Restore original reference count.
   }
@@ skipping 32 matching lines @@
   VariableUseCallback callback;
 
   VariableUseVisitor(this.callback);
 
   visitVariableUse(VariableUse use) => callback(use);
 
   static void visit(Expression node, VariableUseCallback callback) {
     new VariableUseVisitor(callback).visitExpression(node);
   }
 }
+
+bool sameVariable(Expression e1, Expression e2) {
+  return e1 is VariableUse && e2 is VariableUse && e1.variable == e2.variable;
+}
+
+/// True if [e1] and [e2] are primary expressions (expressions without
+/// subexpressions) with the same value.
+bool samePrimary(Expression e1, Expression e2) {
+  return sameVariable(e1, e2) || (e1 is This && e2 is This);
+}
+
+/// Decrement the reference count for [e] if it is a variable use.
+void destroyPrimaryExpression(Expression e) {
+  if (e is VariableUse) {
+    --e.variable.readCount;
+  } else {
+    assert(e is This);
+  }
+}
+
+/// Increment the reference count for [e] if it is a variable use.
+void restorePrimaryExpression(Expression e) {
+  if (e is VariableUse) {
+    ++e.variable.readCount;
+  } else {
+    assert(e is This);
+  }
+}