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 #ifndef VM_FLOW_GRAPH_OPTIMIZER_H_ | 5 #ifndef VM_FLOW_GRAPH_OPTIMIZER_H_ |
6 #define VM_FLOW_GRAPH_OPTIMIZER_H_ | 6 #define VM_FLOW_GRAPH_OPTIMIZER_H_ |
7 | 7 |
8 #include "vm/intermediate_language.h" | 8 #include "vm/intermediate_language.h" |
9 #include "vm/flow_graph.h" | 9 #include "vm/flow_graph.h" |
10 | 10 |
(...skipping 219 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
230 void ReplaceWithMathCFunction(InstanceCallInstr* call, | 230 void ReplaceWithMathCFunction(InstanceCallInstr* call, |
231 MethodRecognizer::Kind recognized_kind); | 231 MethodRecognizer::Kind recognized_kind); |
232 | 232 |
233 void OptimizeLeftShiftBitAndSmiOp(Definition* bit_and_instr, | 233 void OptimizeLeftShiftBitAndSmiOp(Definition* bit_and_instr, |
234 Definition* left_instr, | 234 Definition* left_instr, |
235 Definition* right_instr); | 235 Definition* right_instr); |
236 void TryMergeTruncDivMod(GrowableArray<BinarySmiOpInstr*>* merge_candidates); | 236 void TryMergeTruncDivMod(GrowableArray<BinarySmiOpInstr*>* merge_candidates); |
237 void TryMergeMathUnary(GrowableArray<MathUnaryInstr*>* merge_candidates); | 237 void TryMergeMathUnary(GrowableArray<MathUnaryInstr*>* merge_candidates); |
238 | 238 |
239 void AppendLoadIndexedForMerged(Definition* instr, intptr_t ix, intptr_t cid); | 239 void AppendLoadIndexedForMerged(Definition* instr, intptr_t ix, intptr_t cid); |
240 | 240 void AppendExtractNthOutputForMerged(Definition* instr, intptr_t ix, |
| 241 Representation rep, intptr_t cid); |
241 bool TryStringLengthOneEquality(InstanceCallInstr* call, Token::Kind op_kind); | 242 bool TryStringLengthOneEquality(InstanceCallInstr* call, Token::Kind op_kind); |
242 | 243 |
243 FlowGraph* flow_graph_; | 244 FlowGraph* flow_graph_; |
244 | 245 |
245 DISALLOW_COPY_AND_ASSIGN(FlowGraphOptimizer); | 246 DISALLOW_COPY_AND_ASSIGN(FlowGraphOptimizer); |
246 }; | 247 }; |
247 | 248 |
248 | 249 |
249 // Loop invariant code motion. | 250 // Loop invariant code motion. |
250 class LICM : public ValueObject { | 251 class LICM : public ValueObject { |
(...skipping 166 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
417 // Optimize spill stores inside try-blocks by identifying values that always | 418 // Optimize spill stores inside try-blocks by identifying values that always |
418 // contain a single known constant at catch block entry. | 419 // contain a single known constant at catch block entry. |
419 class TryCatchAnalyzer : public AllStatic { | 420 class TryCatchAnalyzer : public AllStatic { |
420 public: | 421 public: |
421 static void Optimize(FlowGraph* flow_graph); | 422 static void Optimize(FlowGraph* flow_graph); |
422 }; | 423 }; |
423 | 424 |
424 } // namespace dart | 425 } // namespace dart |
425 | 426 |
426 #endif // VM_FLOW_GRAPH_OPTIMIZER_H_ | 427 #endif // VM_FLOW_GRAPH_OPTIMIZER_H_ |
OLD | NEW |