OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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 #include "src/compiler/node-marker.h" | 5 #include "src/compiler/node-marker.h" |
6 | 6 |
7 #include "src/compiler/graph.h" | 7 #include "src/compiler/graph.h" |
8 #include "src/compiler/node.h" | |
9 | 8 |
10 namespace v8 { | 9 namespace v8 { |
11 namespace internal { | 10 namespace internal { |
12 namespace compiler { | 11 namespace compiler { |
13 | 12 |
14 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) | 13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) |
15 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) { | 14 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) { |
16 DCHECK_NE(0u, num_states); // user error! | 15 DCHECK_NE(0u, num_states); // user error! |
17 DCHECK_LT(mark_min_, mark_max_); // check for wraparound. | 16 DCHECK_LT(mark_min_, mark_max_); // check for wraparound. |
18 } | 17 } |
19 | 18 |
20 | 19 |
21 Mark NodeMarkerBase::Get(Node* node) { | |
22 Mark mark = node->mark(); | |
23 if (mark < mark_min_) { | |
24 mark = mark_min_; | |
25 node->set_mark(mark_min_); | |
26 } | |
27 DCHECK_LT(mark, mark_max_); | |
28 return mark - mark_min_; | |
29 } | |
30 | |
31 | |
32 void NodeMarkerBase::Set(Node* node, Mark mark) { | |
33 DCHECK_LT(mark, mark_max_ - mark_min_); | |
34 DCHECK_LT(node->mark(), mark_max_); | |
35 node->set_mark(mark + mark_min_); | |
36 } | |
37 | |
38 | |
39 void NodeMarkerBase::Reset(Graph* graph) { | 20 void NodeMarkerBase::Reset(Graph* graph) { |
40 uint32_t const num_states = mark_max_ - mark_min_; | 21 uint32_t const num_states = mark_max_ - mark_min_; |
41 mark_min_ = graph->mark_max_; | 22 mark_min_ = graph->mark_max_; |
42 mark_max_ = graph->mark_max_ += num_states; | 23 mark_max_ = graph->mark_max_ += num_states; |
43 DCHECK_LT(mark_min_, mark_max_); // check for wraparound. | 24 DCHECK_LT(mark_min_, mark_max_); // check for wraparound. |
44 } | 25 } |
45 | 26 |
46 } // namespace compiler | 27 } // namespace compiler |
47 } // namespace internal | 28 } // namespace internal |
48 } // namespace v8 | 29 } // namespace v8 |
OLD | NEW |