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_SCHEDULE_H_ | 5 #ifndef V8_COMPILER_SCHEDULE_H_ |
6 #define V8_COMPILER_SCHEDULE_H_ | 6 #define V8_COMPILER_SCHEDULE_H_ |
7 | 7 |
8 #include <iosfwd> | 8 #include <iosfwd> |
9 | 9 |
10 #include "src/zone-containers.h" | 10 #include "src/zone-containers.h" |
(...skipping 88 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
99 void ClearSuccessors() { successors_.clear(); } | 99 void ClearSuccessors() { successors_.clear(); } |
100 void AddSuccessor(BasicBlock* successor); | 100 void AddSuccessor(BasicBlock* successor); |
101 | 101 |
102 // Nodes in the basic block. | 102 // Nodes in the basic block. |
103 typedef Node* value_type; | 103 typedef Node* value_type; |
104 bool empty() const { return nodes_.empty(); } | 104 bool empty() const { return nodes_.empty(); } |
105 size_t size() const { return nodes_.size(); } | 105 size_t size() const { return nodes_.size(); } |
106 Node* NodeAt(size_t index) { return nodes_[index]; } | 106 Node* NodeAt(size_t index) { return nodes_[index]; } |
107 size_t NodeCount() const { return nodes_.size(); } | 107 size_t NodeCount() const { return nodes_.size(); } |
108 | 108 |
| 109 value_type& front() { return nodes_.front(); } |
| 110 value_type const& front() const { return nodes_.front(); } |
| 111 |
109 typedef NodeVector::iterator iterator; | 112 typedef NodeVector::iterator iterator; |
110 iterator begin() { return nodes_.begin(); } | 113 iterator begin() { return nodes_.begin(); } |
111 iterator end() { return nodes_.end(); } | 114 iterator end() { return nodes_.end(); } |
112 | 115 |
113 typedef NodeVector::const_iterator const_iterator; | 116 typedef NodeVector::const_iterator const_iterator; |
114 const_iterator begin() const { return nodes_.begin(); } | 117 const_iterator begin() const { return nodes_.begin(); } |
115 const_iterator end() const { return nodes_.end(); } | 118 const_iterator end() const { return nodes_.end(); } |
116 | 119 |
117 typedef NodeVector::reverse_iterator reverse_iterator; | 120 typedef NodeVector::reverse_iterator reverse_iterator; |
118 reverse_iterator rbegin() { return nodes_.rbegin(); } | 121 reverse_iterator rbegin() { return nodes_.rbegin(); } |
(...skipping 166 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
285 DISALLOW_COPY_AND_ASSIGN(Schedule); | 288 DISALLOW_COPY_AND_ASSIGN(Schedule); |
286 }; | 289 }; |
287 | 290 |
288 std::ostream& operator<<(std::ostream&, const Schedule&); | 291 std::ostream& operator<<(std::ostream&, const Schedule&); |
289 | 292 |
290 } // namespace compiler | 293 } // namespace compiler |
291 } // namespace internal | 294 } // namespace internal |
292 } // namespace v8 | 295 } // namespace v8 |
293 | 296 |
294 #endif // V8_COMPILER_SCHEDULE_H_ | 297 #endif // V8_COMPILER_SCHEDULE_H_ |
OLD | NEW |