Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 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 |
| 3 | // found in the LICENSE file. |
| 4 | |
| 5 | #ifndef V8_COMPILER_SCHEDULER_H_ |
| 6 | #define V8_COMPILER_SCHEDULER_H_ |
| 7 | |
| 8 | #include "src/v8.h" |
| 9 | |
| 10 | #include "src/compiler/opcodes.h" |
| 11 | #include "src/compiler/schedule.h" |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 12 | #include "src/compiler/zone-pool.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 13 | #include "src/zone-containers.h" |
| 14 | |
| 15 | namespace v8 { |
| 16 | namespace internal { |
| 17 | namespace compiler { |
| 18 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 19 | class CFGBuilder; |
| 20 | class ControlEquivalence; |
| 21 | class SpecialRPONumberer; |
| 22 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 23 | // Computes a schedule from a graph, placing nodes into basic blocks and |
| 24 | // ordering the basic blocks in the special RPO order. |
| 25 | class Scheduler { |
| 26 | public: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 27 | // The complete scheduling algorithm. Creates a new schedule and places all |
| 28 | // nodes from the graph into it. |
| 29 | static Schedule* ComputeSchedule(Zone* zone, Graph* graph); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 30 | |
| 31 | // Compute the RPO of blocks in an existing schedule. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 32 | static BasicBlockVector* ComputeSpecialRPO(Zone* zone, Schedule* schedule); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 33 | |
| 34 | private: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 35 | // Placement of a node changes during scheduling. The placement state |
| 36 | // transitions over time while the scheduler is choosing a position: |
| 37 | // |
| 38 | // +---------------------+-----+----> kFixed |
| 39 | // / / / |
| 40 | // kUnknown ----+------> kCoupled ----+ / |
| 41 | // \ / |
| 42 | // +----> kSchedulable ----+--------> kScheduled |
| 43 | // |
| 44 | // 1) GetPlacement(): kUnknown -> kCoupled|kSchedulable|kFixed |
| 45 | // 2) UpdatePlacement(): kCoupled|kSchedulable -> kFixed|kScheduled |
| 46 | enum Placement { kUnknown, kSchedulable, kFixed, kCoupled, kScheduled }; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 47 | |
| 48 | // Per-node data tracked during scheduling. |
| 49 | struct SchedulerData { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 50 | BasicBlock* minimum_block_; // Minimum legal RPO placement. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 51 | int unscheduled_count_; // Number of unscheduled uses of this node. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 52 | Placement placement_; // Whether the node is fixed, schedulable, |
| 53 | // coupled to another node, or not yet known. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 54 | }; |
| 55 | |
| 56 | Zone* zone_; |
| 57 | Graph* graph_; |
| 58 | Schedule* schedule_; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 59 | NodeVectorVector scheduled_nodes_; // Per-block list of nodes in reverse. |
| 60 | NodeVector schedule_root_nodes_; // Fixed root nodes seed the worklist. |
| 61 | ZoneQueue<Node*> schedule_queue_; // Worklist of schedulable nodes. |
| 62 | ZoneVector<SchedulerData> node_data_; // Per-node data for all nodes. |
| 63 | CFGBuilder* control_flow_builder_; // Builds basic blocks for controls. |
| 64 | SpecialRPONumberer* special_rpo_; // Special RPO numbering of blocks. |
| 65 | ControlEquivalence* equivalence_; // Control dependence equivalence. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 66 | |
| 67 | Scheduler(Zone* zone, Graph* graph, Schedule* schedule); |
| 68 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 69 | inline SchedulerData DefaultSchedulerData(); |
| 70 | inline SchedulerData* GetData(Node* node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 71 | |
| 72 | Placement GetPlacement(Node* node); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 73 | void UpdatePlacement(Node* node, Placement placement); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 74 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 75 | inline bool IsCoupledControlEdge(Node* node, int index); |
| 76 | void IncrementUnscheduledUseCount(Node* node, int index, Node* from); |
| 77 | void DecrementUnscheduledUseCount(Node* node, int index, Node* from); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 78 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 79 | BasicBlock* GetCommonDominator(BasicBlock* b1, BasicBlock* b2); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 80 | void PropagateImmediateDominators(BasicBlock* block); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 81 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 82 | // Phase 1: Build control-flow graph. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 83 | friend class CFGBuilder; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 84 | void BuildCFG(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 85 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 86 | // Phase 2: Compute special RPO and dominator tree. |
| 87 | friend class SpecialRPONumberer; |
| 88 | void ComputeSpecialRPONumbering(); |
| 89 | void GenerateImmediateDominatorTree(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 90 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 91 | // Phase 3: Prepare use counts for nodes. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 92 | friend class PrepareUsesVisitor; |
| 93 | void PrepareUses(); |
| 94 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 95 | // Phase 4: Schedule nodes early. |
| 96 | friend class ScheduleEarlyNodeVisitor; |
| 97 | void ScheduleEarly(); |
| 98 | |
| 99 | // Phase 5: Schedule nodes late. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 100 | friend class ScheduleLateNodeVisitor; |
| 101 | void ScheduleLate(); |
| 102 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 103 | // Phase 6: Seal the final schedule. |
| 104 | void SealFinalSchedule(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 105 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 106 | void FuseFloatingControl(BasicBlock* block, Node* node); |
| 107 | void MovePlannedNodes(BasicBlock* from, BasicBlock* to); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 108 | }; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 109 | |
| 110 | } // namespace compiler |
| 111 | } // namespace internal |
| 112 | } // namespace v8 |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 113 | |
| 114 | #endif // V8_COMPILER_SCHEDULER_H_ |