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 "src/v8.h" | 8 #include "src/v8.h" |
9 | 9 |
10 #include "src/compiler/node.h" | 10 #include "src/compiler/node.h" |
(...skipping 62 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
73 inline SchedulerData DefaultSchedulerData(); | 73 inline SchedulerData DefaultSchedulerData(); |
74 inline SchedulerData* GetData(Node* node); | 74 inline SchedulerData* GetData(Node* node); |
75 | 75 |
76 Placement GetPlacement(Node* node); | 76 Placement GetPlacement(Node* node); |
77 void UpdatePlacement(Node* node, Placement placement); | 77 void UpdatePlacement(Node* node, Placement placement); |
78 | 78 |
79 inline bool IsCoupledControlEdge(Node* node, int index); | 79 inline bool IsCoupledControlEdge(Node* node, int index); |
80 void IncrementUnscheduledUseCount(Node* node, int index, Node* from); | 80 void IncrementUnscheduledUseCount(Node* node, int index, Node* from); |
81 void DecrementUnscheduledUseCount(Node* node, int index, Node* from); | 81 void DecrementUnscheduledUseCount(Node* node, int index, Node* from); |
82 | 82 |
83 BasicBlock* GetCommonDominator(BasicBlock* b1, BasicBlock* b2); | |
84 void PropagateImmediateDominators(BasicBlock* block); | 83 void PropagateImmediateDominators(BasicBlock* block); |
85 | 84 |
86 // Phase 1: Build control-flow graph. | 85 // Phase 1: Build control-flow graph. |
87 friend class CFGBuilder; | 86 friend class CFGBuilder; |
88 void BuildCFG(); | 87 void BuildCFG(); |
89 | 88 |
90 // Phase 2: Compute special RPO and dominator tree. | 89 // Phase 2: Compute special RPO and dominator tree. |
91 friend class SpecialRPONumberer; | 90 friend class SpecialRPONumberer; |
92 void ComputeSpecialRPONumbering(); | 91 void ComputeSpecialRPONumbering(); |
93 void GenerateImmediateDominatorTree(); | 92 void GenerateImmediateDominatorTree(); |
(...skipping 15 matching lines...) Expand all Loading... |
109 | 108 |
110 void FuseFloatingControl(BasicBlock* block, Node* node); | 109 void FuseFloatingControl(BasicBlock* block, Node* node); |
111 void MovePlannedNodes(BasicBlock* from, BasicBlock* to); | 110 void MovePlannedNodes(BasicBlock* from, BasicBlock* to); |
112 }; | 111 }; |
113 | 112 |
114 } // namespace compiler | 113 } // namespace compiler |
115 } // namespace internal | 114 } // namespace internal |
116 } // namespace v8 | 115 } // namespace v8 |
117 | 116 |
118 #endif // V8_COMPILER_SCHEDULER_H_ | 117 #endif // V8_COMPILER_SCHEDULER_H_ |
OLD | NEW |