| 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  |   8  | 
|   9 namespace v8 { |   9 namespace v8 { | 
|  10 namespace internal { |  10 namespace internal { | 
|  11 namespace compiler { |  11 namespace compiler { | 
|  12  |  12  | 
|  13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) |  13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) | 
|  14     : 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) { | 
|  15   DCHECK_NE(0u, num_states);        // user error! |  15   DCHECK_NE(0u, num_states);        // user error! | 
|  16   DCHECK_LT(mark_min_, mark_max_);  // check for wraparound. |  16   DCHECK_LT(mark_min_, mark_max_);  // check for wraparound. | 
|  17 } |  17 } | 
|  18  |  18  | 
|  19  |  | 
|  20 void NodeMarkerBase::Reset(Graph* graph) { |  | 
|  21   uint32_t const num_states = mark_max_ - mark_min_; |  | 
|  22   mark_min_ = graph->mark_max_; |  | 
|  23   mark_max_ = graph->mark_max_ += num_states; |  | 
|  24   DCHECK_LT(mark_min_, mark_max_);  // check for wraparound. |  | 
|  25 } |  | 
|  26  |  | 
|  27 }  // namespace compiler |  19 }  // namespace compiler | 
|  28 }  // namespace internal |  20 }  // namespace internal | 
|  29 }  // namespace v8 |  21 }  // namespace v8 | 
| OLD | NEW |