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_SCHEDULE_H_ |
| 6 | #define V8_COMPILER_SCHEDULE_H_ |
| 7 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 8 | #include <iosfwd> |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 9 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 10 | #include "src/zone-containers.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 11 | |
| 12 | namespace v8 { |
| 13 | namespace internal { |
| 14 | namespace compiler { |
| 15 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 16 | // Forward declarations. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 17 | class BasicBlock; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 18 | class BasicBlockInstrumentor; |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 19 | class Node; |
| 20 | |
| 21 | |
| 22 | typedef ZoneVector<BasicBlock*> BasicBlockVector; |
| 23 | typedef ZoneVector<Node*> NodeVector; |
| 24 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 25 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 26 | // A basic block contains an ordered list of nodes and ends with a control |
| 27 | // node. Note that if a basic block has phis, then all phis must appear as the |
| 28 | // first nodes in the block. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 29 | class BasicBlock final : public ZoneObject { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 30 | public: |
| 31 | // Possible control nodes that can end a block. |
| 32 | enum Control { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 33 | kNone, // Control not initialized yet. |
| 34 | kGoto, // Goto a single successor block. |
| 35 | kCall, // Call with continuation as first successor, exception |
| 36 | // second. |
| 37 | kBranch, // Branch if true to first successor, otherwise second. |
| 38 | kSwitch, // Table dispatch to one of the successor blocks. |
| 39 | kDeoptimize, // Return a value from this method. |
| 40 | kTailCall, // Tail call another method from this method. |
| 41 | kReturn, // Return a value from this method. |
| 42 | kThrow // Throw an exception. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 43 | }; |
| 44 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 45 | class Id { |
| 46 | public: |
| 47 | int ToInt() const { return static_cast<int>(index_); } |
| 48 | size_t ToSize() const { return index_; } |
| 49 | static Id FromSize(size_t index) { return Id(index); } |
| 50 | static Id FromInt(int index) { return Id(static_cast<size_t>(index)); } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 51 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 52 | private: |
| 53 | explicit Id(size_t index) : index_(index) {} |
| 54 | size_t index_; |
| 55 | }; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 56 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 57 | BasicBlock(Zone* zone, Id id); |
| 58 | |
| 59 | Id id() const { return id_; } |
| 60 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 61 | // Predecessors. |
| 62 | BasicBlockVector& predecessors() { return predecessors_; } |
| 63 | const BasicBlockVector& predecessors() const { return predecessors_; } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 64 | size_t PredecessorCount() const { return predecessors_.size(); } |
| 65 | BasicBlock* PredecessorAt(size_t index) { return predecessors_[index]; } |
| 66 | void ClearPredecessors() { predecessors_.clear(); } |
| 67 | void AddPredecessor(BasicBlock* predecessor); |
| 68 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 69 | // Successors. |
| 70 | BasicBlockVector& successors() { return successors_; } |
| 71 | const BasicBlockVector& successors() const { return successors_; } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 72 | size_t SuccessorCount() const { return successors_.size(); } |
| 73 | BasicBlock* SuccessorAt(size_t index) { return successors_[index]; } |
| 74 | void ClearSuccessors() { successors_.clear(); } |
| 75 | void AddSuccessor(BasicBlock* successor); |
| 76 | |
| 77 | // Nodes in the basic block. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 78 | typedef Node* value_type; |
| 79 | bool empty() const { return nodes_.empty(); } |
| 80 | size_t size() const { return nodes_.size(); } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 81 | Node* NodeAt(size_t index) { return nodes_[index]; } |
| 82 | size_t NodeCount() const { return nodes_.size(); } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 83 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 84 | value_type& front() { return nodes_.front(); } |
| 85 | value_type const& front() const { return nodes_.front(); } |
| 86 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 87 | typedef NodeVector::iterator iterator; |
| 88 | iterator begin() { return nodes_.begin(); } |
| 89 | iterator end() { return nodes_.end(); } |
| 90 | |
| 91 | typedef NodeVector::const_iterator const_iterator; |
| 92 | const_iterator begin() const { return nodes_.begin(); } |
| 93 | const_iterator end() const { return nodes_.end(); } |
| 94 | |
| 95 | typedef NodeVector::reverse_iterator reverse_iterator; |
| 96 | reverse_iterator rbegin() { return nodes_.rbegin(); } |
| 97 | reverse_iterator rend() { return nodes_.rend(); } |
| 98 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 99 | void AddNode(Node* node); |
| 100 | template <class InputIterator> |
| 101 | void InsertNodes(iterator insertion_point, InputIterator insertion_start, |
| 102 | InputIterator insertion_end) { |
| 103 | nodes_.insert(insertion_point, insertion_start, insertion_end); |
| 104 | } |
| 105 | |
| 106 | // Accessors. |
| 107 | Control control() const { return control_; } |
| 108 | void set_control(Control control); |
| 109 | |
| 110 | Node* control_input() const { return control_input_; } |
| 111 | void set_control_input(Node* control_input); |
| 112 | |
| 113 | bool deferred() const { return deferred_; } |
| 114 | void set_deferred(bool deferred) { deferred_ = deferred; } |
| 115 | |
| 116 | int32_t dominator_depth() const { return dominator_depth_; } |
| 117 | void set_dominator_depth(int32_t depth) { dominator_depth_ = depth; } |
| 118 | |
| 119 | BasicBlock* dominator() const { return dominator_; } |
| 120 | void set_dominator(BasicBlock* dominator) { dominator_ = dominator; } |
| 121 | |
| 122 | BasicBlock* rpo_next() const { return rpo_next_; } |
| 123 | void set_rpo_next(BasicBlock* rpo_next) { rpo_next_ = rpo_next; } |
| 124 | |
| 125 | BasicBlock* loop_header() const { return loop_header_; } |
| 126 | void set_loop_header(BasicBlock* loop_header); |
| 127 | |
| 128 | BasicBlock* loop_end() const { return loop_end_; } |
| 129 | void set_loop_end(BasicBlock* loop_end); |
| 130 | |
| 131 | int32_t loop_depth() const { return loop_depth_; } |
| 132 | void set_loop_depth(int32_t loop_depth); |
| 133 | |
| 134 | int32_t loop_number() const { return loop_number_; } |
| 135 | void set_loop_number(int32_t loop_number) { loop_number_ = loop_number; } |
| 136 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 137 | int32_t rpo_number() const { return rpo_number_; } |
| 138 | void set_rpo_number(int32_t rpo_number); |
| 139 | |
| 140 | // Loop membership helpers. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 141 | inline bool IsLoopHeader() const { return loop_end_ != nullptr; } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 142 | bool LoopContains(BasicBlock* block) const; |
| 143 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 144 | // Computes the immediate common dominator of {b1} and {b2}. The worst time |
| 145 | // complexity is O(N) where N is the height of the dominator tree. |
| 146 | static BasicBlock* GetCommonDominator(BasicBlock* b1, BasicBlock* b2); |
| 147 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 148 | private: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 149 | int32_t loop_number_; // loop number of the block. |
| 150 | int32_t rpo_number_; // special RPO number of the block. |
| 151 | bool deferred_; // true if the block contains deferred code. |
| 152 | int32_t dominator_depth_; // Depth within the dominator tree. |
| 153 | BasicBlock* dominator_; // Immediate dominator of the block. |
| 154 | BasicBlock* rpo_next_; // Link to next block in special RPO order. |
| 155 | BasicBlock* loop_header_; // Pointer to dominating loop header basic block, |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 156 | // nullptr if none. For loop headers, this points to |
| 157 | // enclosing loop header. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 158 | BasicBlock* loop_end_; // end of the loop, if this block is a loop header. |
| 159 | int32_t loop_depth_; // loop nesting, 0 is top-level |
| 160 | |
| 161 | Control control_; // Control at the end of the block. |
| 162 | Node* control_input_; // Input value for control. |
| 163 | NodeVector nodes_; // nodes of this block in forward order. |
| 164 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 165 | BasicBlockVector successors_; |
| 166 | BasicBlockVector predecessors_; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 167 | Id id_; |
| 168 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 169 | DISALLOW_COPY_AND_ASSIGN(BasicBlock); |
| 170 | }; |
| 171 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 172 | std::ostream& operator<<(std::ostream&, const BasicBlock::Control&); |
| 173 | std::ostream& operator<<(std::ostream&, const BasicBlock::Id&); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 174 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 175 | |
| 176 | // A schedule represents the result of assigning nodes to basic blocks |
| 177 | // and ordering them within basic blocks. Prior to computing a schedule, |
| 178 | // a graph has no notion of control flow ordering other than that induced |
| 179 | // by the graph's dependencies. A schedule is required to generate code. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 180 | class Schedule final : public ZoneObject { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 181 | public: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 182 | explicit Schedule(Zone* zone, size_t node_count_hint = 0); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 183 | |
| 184 | // Return the block which contains {node}, if any. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 185 | BasicBlock* block(Node* node) const; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 186 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 187 | bool IsScheduled(Node* node); |
| 188 | BasicBlock* GetBlockById(BasicBlock::Id block_id); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 189 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 190 | size_t BasicBlockCount() const { return all_blocks_.size(); } |
| 191 | size_t RpoBlockCount() const { return rpo_order_.size(); } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 192 | |
| 193 | // Check if nodes {a} and {b} are in the same block. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 194 | bool SameBasicBlock(Node* a, Node* b) const; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 195 | |
| 196 | // BasicBlock building: create a new block. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 197 | BasicBlock* NewBasicBlock(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 198 | |
| 199 | // BasicBlock building: records that a node will later be added to a block but |
| 200 | // doesn't actually add the node to the block. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 201 | void PlanNode(BasicBlock* block, Node* node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 202 | |
| 203 | // BasicBlock building: add a node to the end of the block. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 204 | void AddNode(BasicBlock* block, Node* node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 205 | |
| 206 | // BasicBlock building: add a goto to the end of {block}. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 207 | void AddGoto(BasicBlock* block, BasicBlock* succ); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 208 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 209 | // BasicBlock building: add a call at the end of {block}. |
| 210 | void AddCall(BasicBlock* block, Node* call, BasicBlock* success_block, |
| 211 | BasicBlock* exception_block); |
| 212 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 213 | // BasicBlock building: add a branch at the end of {block}. |
| 214 | void AddBranch(BasicBlock* block, Node* branch, BasicBlock* tblock, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 215 | BasicBlock* fblock); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 216 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 217 | // BasicBlock building: add a switch at the end of {block}. |
| 218 | void AddSwitch(BasicBlock* block, Node* sw, BasicBlock** succ_blocks, |
| 219 | size_t succ_count); |
| 220 | |
| 221 | // BasicBlock building: add a deoptimize at the end of {block}. |
| 222 | void AddDeoptimize(BasicBlock* block, Node* input); |
| 223 | |
| 224 | // BasicBlock building: add a tailcall at the end of {block}. |
| 225 | void AddTailCall(BasicBlock* block, Node* input); |
| 226 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 227 | // BasicBlock building: add a return at the end of {block}. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 228 | void AddReturn(BasicBlock* block, Node* input); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 229 | |
| 230 | // BasicBlock building: add a throw at the end of {block}. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 231 | void AddThrow(BasicBlock* block, Node* input); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 232 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 233 | // BasicBlock mutation: insert a branch into the end of {block}. |
| 234 | void InsertBranch(BasicBlock* block, BasicBlock* end, Node* branch, |
| 235 | BasicBlock* tblock, BasicBlock* fblock); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 236 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 237 | // BasicBlock mutation: insert a switch into the end of {block}. |
| 238 | void InsertSwitch(BasicBlock* block, BasicBlock* end, Node* sw, |
| 239 | BasicBlock** succ_blocks, size_t succ_count); |
| 240 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 241 | // Exposed publicly for testing only. |
| 242 | void AddSuccessorForTesting(BasicBlock* block, BasicBlock* succ) { |
| 243 | return AddSuccessor(block, succ); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 244 | } |
| 245 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 246 | const BasicBlockVector* all_blocks() const { return &all_blocks_; } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 247 | BasicBlockVector* rpo_order() { return &rpo_order_; } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 248 | const BasicBlockVector* rpo_order() const { return &rpo_order_; } |
| 249 | |
| 250 | BasicBlock* start() { return start_; } |
| 251 | BasicBlock* end() { return end_; } |
| 252 | |
| 253 | Zone* zone() const { return zone_; } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 254 | |
| 255 | private: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 256 | friend class Scheduler; |
| 257 | friend class BasicBlockInstrumentor; |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 258 | friend class RawMachineAssembler; |
| 259 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 260 | // Ensure properties of the CFG assumed by further stages. |
| 261 | void EnsureCFGWellFormedness(); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 262 | // Ensure split-edge form for a hand-assembled schedule. |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 263 | void EnsureSplitEdgeForm(BasicBlock* block); |
| 264 | // Ensure entry into a deferred block happens from a single hot block. |
| 265 | void EnsureDeferredCodeSingleEntryPoint(BasicBlock* block); |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 266 | // Copy deferred block markers down as far as possible |
| 267 | void PropagateDeferredMark(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 268 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 269 | void AddSuccessor(BasicBlock* block, BasicBlock* succ); |
| 270 | void MoveSuccessors(BasicBlock* from, BasicBlock* to); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 271 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 272 | void SetControlInput(BasicBlock* block, Node* node); |
| 273 | void SetBlockForNode(BasicBlock* block, Node* node); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 274 | |
| 275 | Zone* zone_; |
| 276 | BasicBlockVector all_blocks_; // All basic blocks in the schedule. |
| 277 | BasicBlockVector nodeid_to_block_; // Map from node to containing block. |
| 278 | BasicBlockVector rpo_order_; // Reverse-post-order block list. |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 279 | BasicBlock* start_; |
| 280 | BasicBlock* end_; |
| 281 | |
| 282 | DISALLOW_COPY_AND_ASSIGN(Schedule); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 283 | }; |
| 284 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 285 | std::ostream& operator<<(std::ostream&, const Schedule&); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 286 | |
| 287 | } // namespace compiler |
| 288 | } // namespace internal |
| 289 | } // namespace v8 |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 290 | |
| 291 | #endif // V8_COMPILER_SCHEDULE_H_ |