dartfmt pkg/compiler

pkg/compiler/lib/src/cps_ir/scalar_replacement.dart

 // Copyright (c) 2015, 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 dart2js.cps_ir.scalar_replacement;
 
 import 'optimizers.dart';
 
 import 'dart:collection' show Queue;
 
 import '../common.dart';
-import '../compiler.dart' as dart2js show
-    Compiler;
+import '../compiler.dart' as dart2js show Compiler;
 import '../constants/values.dart';
 import '../elements/elements.dart';
 import '../types/types.dart';
 import '../world.dart' show World;
 import 'cps_ir_nodes.dart';
 
 /**
  * Replaces aggregates with a set of local values.  Performs inlining of
  * single-use closures to generate more replaceable aggregates.
  */
@@ skipping 14 matching lines @@
     analyzer.analyze(root);
     analyzer.process();
   }
 }
 
 /**
  * Do scalar replacement of aggregates on instances. Since scalar replacement
  * can create new candidates, iterate until all scalar replacements are done.
  */
 class ScalarReplacementVisitor extends TrampolineRecursiveVisitor {
-
   final InternalErrorFunction internalError;
   final World classWorld;
   ScalarReplacementRemovalVisitor removalVisitor;
 
   Primitive _current = null;
   Set<Primitive> _allocations = new Set<Primitive>();
   Queue<Primitive> _queue = new Queue<Primitive>();
 
   ScalarReplacementVisitor(this.internalError, this.classWorld) {
     removalVisitor = new ScalarReplacementRemovalVisitor(this);
   }
 
   void analyze(FunctionDefinition root) {
     visit(root);
   }
 
   void process() {
     while (_queue.isNotEmpty) {
       Primitive allocation = _queue.removeFirst();
       _allocations.remove(allocation);
       _current = allocation;
       tryScalarReplacement(allocation);
     }
   }
 
   void tryScalarReplacement(Primitive allocation) {
-
     // We can do scalar replacement of an aggregate if all uses of an allocation
     // are reads or writes.
     for (Reference ref = allocation.firstRef; ref != null; ref = ref.next) {
       Node use = ref.parent;
       if (use is GetField) continue;
       if (use is SetField && use.objectRef == ref) continue;
       return;
     }
 
     Set<FieldElement> reads = new Set<FieldElement>();
     Set<FieldElement> writes = new Set<FieldElement>();
     for (Reference ref = allocation.firstRef; ref != null; ref = ref.next) {
       Node use = ref.parent;
       if (use is GetField) {
         reads.add(use.field);
       } else if (use is SetField) {
         writes.add(use.field);
       } else {
         assert(false);
       }
     }
 
     // Find the initial values of the fields. A CreateBox has no initial
     // values. CreateInstance has initial values in the order of the fields.
     Map<FieldElement, Primitive> fieldInitialValues =
         <FieldElement, Primitive>{};
     if (allocation is CreateInstance) {
       int i = 0;
       allocation.classElement.forEachInstanceField(
-        (ClassElement enclosingClass, FieldElement field) {
-          Primitive argument = allocation.argument(i++);
-          fieldInitialValues[field] = argument;
-        },
-        includeSuperAndInjectedMembers: true);
+          (ClassElement enclosingClass, FieldElement field) {
+        Primitive argument = allocation.argument(i++);
+        fieldInitialValues[field] = argument;
+      }, includeSuperAndInjectedMembers: true);
     }
 
     // Create [MutableVariable]s for each written field. Initialize the
     // MutableVariable with the value from the allocator, or initialize with a
     // `null` constant if there is not initial value.
     Map<FieldElement, MutableVariable> cells =
         <FieldElement, MutableVariable>{};
-    InteriorNode insertionPoint = allocation.parent;  // LetPrim
+    InteriorNode insertionPoint = allocation.parent; // LetPrim
     for (FieldElement field in writes) {
       MutableVariable variable = new MutableVariable(field);
       variable.type = new TypeMask.nonNullEmpty();
       cells[field] = variable;
       Primitive initialValue = fieldInitialValues[field];
       if (initialValue == null) {
         assert(allocation is CreateBox);
         initialValue = new Constant(new NullConstantValue());
         LetPrim let = new LetPrim(initialValue);
         let.primitive.parent = let;
@@ skipping 80 matching lines @@
   // -------------------------- Visitor overrides ------------------------------
   void visitCreateInstance(CreateInstance node) {
     enqueue(node);
   }
 
   void visitCreateBox(CreateBox node) {
     enqueue(node);
   }
 }
 
-
 /// Visit a just-deleted subterm and unlink all [Reference]s in it.  Reconsider
 /// allocations for scalar replacement.
 class ScalarReplacementRemovalVisitor extends TrampolineRecursiveVisitor {
   ScalarReplacementVisitor process;
 
   ScalarReplacementRemovalVisitor(this.process);
 
   processReference(Reference reference) {
     process.reconsider(reference.definition);
     reference.unlink();
   }
 }