OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_COMPILER_SCHEDULER_H_ | 5 #ifndef V8_COMPILER_SCHEDULER_H_ |
6 #define V8_COMPILER_SCHEDULER_H_ | 6 #define V8_COMPILER_SCHEDULER_H_ |
7 | 7 |
8 #include <vector> | 8 #include <vector> |
9 | 9 |
10 #include "src/v8.h" | 10 #include "src/v8.h" |
(...skipping 26 matching lines...) Expand all Loading... |
37 NodeVector deopts_; | 37 NodeVector deopts_; |
38 NodeVector returns_; | 38 NodeVector returns_; |
39 NodeVector loops_and_merges_; | 39 NodeVector loops_and_merges_; |
40 IntVector unscheduled_uses_; | 40 IntVector unscheduled_uses_; |
41 NodeVectorVector scheduled_nodes_; | 41 NodeVectorVector scheduled_nodes_; |
42 NodeVector schedule_root_nodes_; | 42 NodeVector schedule_root_nodes_; |
43 IntVector schedule_early_rpo_index_; | 43 IntVector schedule_early_rpo_index_; |
44 | 44 |
45 Scheduler(Zone* zone, Graph* graph, Schedule* schedule); | 45 Scheduler(Zone* zone, Graph* graph, Schedule* schedule); |
46 | 46 |
| 47 bool IsBasicBlockBegin(Node* node); |
| 48 bool CanBeScheduled(Node* node); |
| 49 bool HasFixedSchedulePosition(Node* node); |
| 50 bool IsScheduleRoot(Node* node); |
| 51 |
47 int GetRPONumber(BasicBlock* block) { | 52 int GetRPONumber(BasicBlock* block) { |
48 DCHECK(block->rpo_number_ >= 0 && | 53 DCHECK(block->rpo_number_ >= 0 && |
49 block->rpo_number_ < static_cast<int>(schedule_->rpo_order_.size())); | 54 block->rpo_number_ < static_cast<int>(schedule_->rpo_order_.size())); |
50 DCHECK(schedule_->rpo_order_[block->rpo_number_] == block); | 55 DCHECK(schedule_->rpo_order_[block->rpo_number_] == block); |
51 return block->rpo_number_; | 56 return block->rpo_number_; |
52 } | 57 } |
53 | 58 |
54 void PrepareAuxiliaryNodeData(); | 59 void PrepareAuxiliaryNodeData(); |
55 void PrepareAuxiliaryBlockData(); | 60 void PrepareAuxiliaryBlockData(); |
56 | 61 |
(...skipping 18 matching lines...) Expand all Loading... |
75 void PrepareUses(); | 80 void PrepareUses(); |
76 | 81 |
77 friend class ScheduleLateNodeVisitor; | 82 friend class ScheduleLateNodeVisitor; |
78 void ScheduleLate(); | 83 void ScheduleLate(); |
79 }; | 84 }; |
80 } | 85 } |
81 } | 86 } |
82 } // namespace v8::internal::compiler | 87 } // namespace v8::internal::compiler |
83 | 88 |
84 #endif // V8_COMPILER_SCHEDULER_H_ | 89 #endif // V8_COMPILER_SCHEDULER_H_ |
OLD | NEW |