| OLD | NEW |
| 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 dart2js.optimizers; | 5 part of dart2js.optimizers; |
| 6 | 6 |
| 7 /// Eliminate redundant phis from the given [FunctionDefinition]. | 7 /// Eliminate redundant phis from the given [FunctionDefinition]. |
| 8 /// | 8 /// |
| 9 /// Phis in this case are [Continuations] together with corresponding | 9 /// Phis in this case are [Continuations] together with corresponding |
| 10 /// [InvokeContinuation]s. A [Continuation] parameter at position i is redundant | 10 /// [InvokeContinuation]s. A [Continuation] parameter at position i is redundant |
| 11 /// if for all [InvokeContinuation]s, the parameter at position i is identical | 11 /// if for all [InvokeContinuation]s, the parameter at position i is identical |
| 12 /// (except for feedback). Redundant parameters are removed from the | 12 /// (except for feedback). Redundant parameters are removed from the |
| 13 /// continuation signature, all invocations, and replaced within the | 13 /// continuation signature, all invocations, and replaced within the |
| 14 /// continuation body. | 14 /// continuation body. |
| 15 class RedundantPhiEliminator extends RecursiveVisitor implements Pass { | 15 class RedundantPhiEliminator extends RecursiveVisitor implements Pass { |
| 16 final Set<Continuation> workSet = new Set<Continuation>(); | 16 final Set<Continuation> workSet = new Set<Continuation>(); |
| 17 | 17 |
| 18 void rewrite(final FunctionDefinition root) { | 18 void rewrite(final ExecutableDefinition root) => root.applyPass(this); |
| 19 |
| 20 void rewriteFunctionDefinition(final FunctionDefinition root) { |
| 19 if (root.isAbstract) return; | 21 if (root.isAbstract) return; |
| 22 rewriteExecutableDefinition(root); |
| 23 } |
| 24 |
| 25 void rewriteFieldDefinition(final FieldDefinition root) { |
| 26 rewriteExecutableDefinition(root); |
| 27 } |
| 28 |
| 29 void rewriteExecutableDefinition(final ExecutableDefinition root) { |
| 20 | 30 |
| 21 // Set all parent pointers. | 31 // Set all parent pointers. |
| 22 new ParentVisitor().visit(root); | 32 new ParentVisitor().visit(root); |
| 23 | 33 |
| 24 // Traverse the tree once to build the work set. | 34 // Traverse the tree once to build the work set. |
| 25 visit(root); | 35 visit(root); |
| 26 | 36 |
| 27 // Process each continuation one-by-one. | 37 // Process each continuation one-by-one. |
| 28 while (workSet.isNotEmpty) { | 38 while (workSet.isNotEmpty) { |
| 29 Continuation cont = workSet.first; | 39 Continuation cont = workSet.first; |
| (...skipping 141 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 171 | 181 |
| 172 // Insert it just below the binding of definition. | 182 // Insert it just below the binding of definition. |
| 173 InteriorNode binding = definition.parent; | 183 InteriorNode binding = definition.parent; |
| 174 | 184 |
| 175 letCont.body = binding.body; | 185 letCont.body = binding.body; |
| 176 binding.body.parent = letCont; | 186 binding.body.parent = letCont; |
| 177 | 187 |
| 178 binding.body = letCont; | 188 binding.body = letCont; |
| 179 letCont.parent = binding; | 189 letCont.parent = binding; |
| 180 } | 190 } |
| OLD | NEW |