Chromium Code Reviews| 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 #include "vm/compiler.h" | 5 #include "vm/compiler.h" |
| 6 | 6 |
| 7 #include "vm/assembler.h" | 7 #include "vm/assembler.h" |
| 8 #include "vm/ast_printer.h" | 8 #include "vm/ast_printer.h" |
| 9 #include "vm/code_generator.h" | 9 #include "vm/code_generator.h" |
| 10 #include "vm/code_patcher.h" | 10 #include "vm/code_patcher.h" |
| (...skipping 195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 206 if (FLAG_constant_propagation || | 206 if (FLAG_constant_propagation || |
| 207 FLAG_common_subexpression_elimination) { | 207 FLAG_common_subexpression_elimination) { |
| 208 flow_graph->ComputeUseLists(); | 208 flow_graph->ComputeUseLists(); |
| 209 } | 209 } |
| 210 if (FLAG_constant_propagation) { | 210 if (FLAG_constant_propagation) { |
| 211 ConstantPropagator::Optimize(flow_graph); | 211 ConstantPropagator::Optimize(flow_graph); |
| 212 } | 212 } |
| 213 if (FLAG_common_subexpression_elimination) { | 213 if (FLAG_common_subexpression_elimination) { |
| 214 DominatorBasedCSE::Optimize(flow_graph); | 214 DominatorBasedCSE::Optimize(flow_graph); |
| 215 } | 215 } |
| 216 if (FLAG_loop_invariant_code_motion) { | 216 if (FLAG_loop_invariant_code_motion && |
| 217 parsed_function.function().deoptimization_counter() == 0) { | |
|
Florian Schneider
2012/09/24 11:08:50
Since there could be other deoptimizations than th
| |
| 217 LICM::Optimize(flow_graph); | 218 LICM::Optimize(flow_graph); |
| 218 } | 219 } |
| 219 | 220 |
| 220 if (FLAG_range_analysis) { | 221 if (FLAG_range_analysis) { |
| 221 // We have to perform range analysis after LICM because it | 222 // We have to perform range analysis after LICM because it |
| 222 // optimistically moves CheckSmi through phis into loop preheaders | 223 // optimistically moves CheckSmi through phis into loop preheaders |
| 223 // making some phis smi. | 224 // making some phis smi. |
| 224 flow_graph->ComputeUseLists(); | 225 flow_graph->ComputeUseLists(); |
| 225 optimizer.InferSmiRanges(); | 226 optimizer.InferSmiRanges(); |
| 226 } | 227 } |
| (...skipping 355 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 582 result = isolate->object_store()->sticky_error(); | 583 result = isolate->object_store()->sticky_error(); |
| 583 isolate->object_store()->clear_sticky_error(); | 584 isolate->object_store()->clear_sticky_error(); |
| 584 isolate->set_long_jump_base(base); | 585 isolate->set_long_jump_base(base); |
| 585 return result.raw(); | 586 return result.raw(); |
| 586 } | 587 } |
| 587 UNREACHABLE(); | 588 UNREACHABLE(); |
| 588 return Object::null(); | 589 return Object::null(); |
| 589 } | 590 } |
| 590 | 591 |
| 591 } // namespace dart | 592 } // namespace dart |
| OLD | NEW |