| OLD | NEW |
| 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2013, 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_ALLOCATOR_H_ | 5 #ifndef VM_FLOW_GRAPH_ALLOCATOR_H_ |
| 6 #define VM_FLOW_GRAPH_ALLOCATOR_H_ | 6 #define VM_FLOW_GRAPH_ALLOCATOR_H_ |
| 7 | 7 |
| 8 #include "vm/flow_graph.h" | 8 #include "vm/flow_graph.h" |
| 9 #include "vm/growable_array.h" | 9 #include "vm/growable_array.h" |
| 10 #include "vm/intermediate_language.h" | 10 #include "vm/intermediate_language.h" |
| (...skipping 86 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 97 // Discover structural (reducible) loops nesting structure. | 97 // Discover structural (reducible) loops nesting structure. |
| 98 // It will be used later in SplitBetween heuristic that selects an | 98 // It will be used later in SplitBetween heuristic that selects an |
| 99 // optimal splitting position. | 99 // optimal splitting position. |
| 100 void DiscoverLoops(); | 100 void DiscoverLoops(); |
| 101 | 101 |
| 102 LiveRange* MakeLiveRangeForTemporary(); | 102 LiveRange* MakeLiveRangeForTemporary(); |
| 103 | 103 |
| 104 // Visit instructions in the postorder and build live ranges for | 104 // Visit instructions in the postorder and build live ranges for |
| 105 // all SSA values. | 105 // all SSA values. |
| 106 void BuildLiveRanges(); | 106 void BuildLiveRanges(); |
| 107 |
| 107 Instruction* ConnectOutgoingPhiMoves(BlockEntryInstr* block, | 108 Instruction* ConnectOutgoingPhiMoves(BlockEntryInstr* block, |
| 108 BitVector* interference_set); | 109 BitVector* interference_set); |
| 109 void ProcessEnvironmentUses(BlockEntryInstr* block, Instruction* current); | 110 void ProcessEnvironmentUses(BlockEntryInstr* block, Instruction* current); |
| 110 void ProcessOneInstruction(BlockEntryInstr* block, | 111 void ProcessOneInstruction(BlockEntryInstr* block, |
| 111 Instruction* instr, | 112 Instruction* instr, |
| 112 BitVector* interference_set); | 113 BitVector* interference_set); |
| 113 void ConnectIncomingPhiMoves(BlockEntryInstr* block); | 114 void ConnectIncomingPhiMoves(JoinEntryInstr* join); |
| 114 void BlockLocation(Location loc, intptr_t from, intptr_t to); | 115 void BlockLocation(Location loc, intptr_t from, intptr_t to); |
| 115 void BlockRegisterLocation(Location loc, | 116 void BlockRegisterLocation(Location loc, |
| 116 intptr_t from, | 117 intptr_t from, |
| 117 intptr_t to, | 118 intptr_t to, |
| 118 bool* blocked_registers, | 119 bool* blocked_registers, |
| 119 LiveRange** blocking_ranges); | 120 LiveRange** blocking_ranges); |
| 120 | 121 |
| 121 intptr_t NumberOfRegisters() const { return number_of_registers_; } | 122 intptr_t NumberOfRegisters() const { return number_of_registers_; } |
| 122 | 123 |
| 123 // Find all safepoints that are covered by this live range. | 124 // Find all safepoints that are covered by this live range. |
| (...skipping 517 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 641 | 642 |
| 642 AllocationFinger finger_; | 643 AllocationFinger finger_; |
| 643 | 644 |
| 644 DISALLOW_COPY_AND_ASSIGN(LiveRange); | 645 DISALLOW_COPY_AND_ASSIGN(LiveRange); |
| 645 }; | 646 }; |
| 646 | 647 |
| 647 | 648 |
| 648 } // namespace dart | 649 } // namespace dart |
| 649 | 650 |
| 650 #endif // VM_FLOW_GRAPH_ALLOCATOR_H_ | 651 #endif // VM_FLOW_GRAPH_ALLOCATOR_H_ |
| OLD | NEW |