| 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 /** | 7 /** |
| 8 * Replaces some instructions with specialized versions to make codegen easier. | 8 * Replaces some instructions with specialized versions to make codegen easier. |
| 9 * Caches codegen information on nodes. | 9 * Caches codegen information on nodes. |
| 10 */ | 10 */ |
| (...skipping 103 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 114 if (backend.isInterceptedSelector(selector) && | 114 if (backend.isInterceptedSelector(selector) && |
| 115 !backend.isInterceptedMixinSelector(selector)) { | 115 !backend.isInterceptedMixinSelector(selector)) { |
| 116 HInstruction interceptor = node.inputs[0]; | 116 HInstruction interceptor = node.inputs[0]; |
| 117 HInstruction receiverArgument = node.inputs[1]; | 117 HInstruction receiverArgument = node.inputs[1]; |
| 118 | 118 |
| 119 if (interceptor.nonCheck() == receiverArgument.nonCheck()) { | 119 if (interceptor.nonCheck() == receiverArgument.nonCheck()) { |
| 120 // TODO(15933): Make automatically generated property extraction | 120 // TODO(15933): Make automatically generated property extraction |
| 121 // closures work with the dummy receiver optimization. | 121 // closures work with the dummy receiver optimization. |
| 122 if (!selector.isGetter) { | 122 if (!selector.isGetter) { |
| 123 ConstantValue constant = new DummyConstantValue( | 123 ConstantValue constant = new DummyConstantValue( |
| 124 DummyConstantKinds.dummyReceiver, |
| 124 receiverArgument.instructionType); | 125 receiverArgument.instructionType); |
| 125 HConstant dummy = graph.addConstant(constant, compiler); | 126 HConstant dummy = graph.addConstant(constant, compiler); |
| 126 receiverArgument.usedBy.remove(node); | 127 receiverArgument.usedBy.remove(node); |
| 127 node.inputs[1] = dummy; | 128 node.inputs[1] = dummy; |
| 128 dummy.usedBy.add(node); | 129 dummy.usedBy.add(node); |
| 129 } | 130 } |
| 130 } | 131 } |
| 131 } | 132 } |
| 132 } | 133 } |
| 133 | 134 |
| (...skipping 623 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 757 } | 758 } |
| 758 | 759 |
| 759 // If [thenInput] is defined in the first predecessor, then it is only used | 760 // If [thenInput] is defined in the first predecessor, then it is only used |
| 760 // by [phi] and can be generated at use site. | 761 // by [phi] and can be generated at use site. |
| 761 if (identical(thenInput.block, end.predecessors[0])) { | 762 if (identical(thenInput.block, end.predecessors[0])) { |
| 762 assert(thenInput.usedBy.length == 1); | 763 assert(thenInput.usedBy.length == 1); |
| 763 markAsGenerateAtUseSite(thenInput); | 764 markAsGenerateAtUseSite(thenInput); |
| 764 } | 765 } |
| 765 } | 766 } |
| 766 } | 767 } |
| OLD | NEW |