| 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_BUILDER_H_ | 5 #ifndef VM_FLOW_GRAPH_BUILDER_H_ |
| 6 #define VM_FLOW_GRAPH_BUILDER_H_ | 6 #define VM_FLOW_GRAPH_BUILDER_H_ |
| 7 | 7 |
| 8 #include "platform/assert.h" | 8 #include "platform/assert.h" |
| 9 #include "platform/globals.h" | 9 #include "platform/globals.h" |
| 10 #include "vm/allocation.h" | 10 #include "vm/allocation.h" |
| (...skipping 320 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 331 // parts are reachable. Assumes this graph is open. | 331 // parts are reachable. Assumes this graph is open. |
| 332 void Join(const TestGraphVisitor& test_fragment, | 332 void Join(const TestGraphVisitor& test_fragment, |
| 333 const EffectGraphVisitor& true_fragment, | 333 const EffectGraphVisitor& true_fragment, |
| 334 const EffectGraphVisitor& false_fragment); | 334 const EffectGraphVisitor& false_fragment); |
| 335 | 335 |
| 336 // Append a 'while loop' test and back edge to this graph, depending on | 336 // Append a 'while loop' test and back edge to this graph, depending on |
| 337 // which parts are reachable. Afterward, the graph exit is the false | 337 // which parts are reachable. Afterward, the graph exit is the false |
| 338 // successor of the loop condition. | 338 // successor of the loop condition. |
| 339 void TieLoop(intptr_t token_pos, | 339 void TieLoop(intptr_t token_pos, |
| 340 const TestGraphVisitor& test_fragment, | 340 const TestGraphVisitor& test_fragment, |
| 341 const EffectGraphVisitor& body_fragment); | 341 const EffectGraphVisitor& body_fragment, |
| 342 const EffectGraphVisitor& test_preamble_fragment); |
| 342 | 343 |
| 343 // Wraps a value in a push-argument instruction and adds the result to the | 344 // Wraps a value in a push-argument instruction and adds the result to the |
| 344 // graph. | 345 // graph. |
| 345 PushArgumentInstr* PushArgument(Value* value); | 346 PushArgumentInstr* PushArgument(Value* value); |
| 346 | 347 |
| 347 // This implementation shares state among visitors by using the builder. | 348 // This implementation shares state among visitors by using the builder. |
| 348 // The implementation is incorrect if a visitor that hits a return is not | 349 // The implementation is incorrect if a visitor that hits a return is not |
| 349 // actually added to the graph. | 350 // actually added to the graph. |
| 350 void AddReturnExit(intptr_t token_pos, Value* value); | 351 void AddReturnExit(intptr_t token_pos, Value* value); |
| 351 | 352 |
| (...skipping 251 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 603 // Output parameters. | 604 // Output parameters. |
| 604 GrowableArray<TargetEntryInstr**> true_successor_addresses_; | 605 GrowableArray<TargetEntryInstr**> true_successor_addresses_; |
| 605 GrowableArray<TargetEntryInstr**> false_successor_addresses_; | 606 GrowableArray<TargetEntryInstr**> false_successor_addresses_; |
| 606 | 607 |
| 607 intptr_t condition_token_pos_; | 608 intptr_t condition_token_pos_; |
| 608 }; | 609 }; |
| 609 | 610 |
| 610 } // namespace dart | 611 } // namespace dart |
| 611 | 612 |
| 612 #endif // VM_FLOW_GRAPH_BUILDER_H_ | 613 #endif // VM_FLOW_GRAPH_BUILDER_H_ |
| OLD | NEW |