| OLD | NEW |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 part of ssa; | 5 part of ssa; |
| 6 | 6 |
| 7 abstract class OptimizationPhase { | 7 abstract class OptimizationPhase { |
| 8 String get name; | 8 String get name; |
| 9 void visitGraph(HGraph graph); | 9 void visitGraph(HGraph graph); |
| 10 } | 10 } |
| (...skipping 2131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2142 | 2142 |
| 2143 keyedValues.forEach((receiver, values) { | 2143 keyedValues.forEach((receiver, values) { |
| 2144 result.keyedValues[receiver] = | 2144 result.keyedValues[receiver] = |
| 2145 new Map<HInstruction, HInstruction>.from(values); | 2145 new Map<HInstruction, HInstruction>.from(values); |
| 2146 }); | 2146 }); |
| 2147 | 2147 |
| 2148 result.nonEscapingReceivers.addAll(nonEscapingReceivers); | 2148 result.nonEscapingReceivers.addAll(nonEscapingReceivers); |
| 2149 return result; | 2149 return result; |
| 2150 } | 2150 } |
| 2151 } | 2151 } |
| OLD | NEW |