| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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_UNBOUND_QUEUE_INL_H_ | 5 #ifndef V8_PROFILER_UNBOUND_QUEUE_INL_H_ |
| 6 #define V8_UNBOUND_QUEUE_INL_H_ | 6 #define V8_PROFILER_UNBOUND_QUEUE_INL_H_ |
| 7 | 7 |
| 8 #include "src/unbound-queue.h" | 8 #include "src/profiler/unbound-queue.h" |
| 9 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| 11 namespace internal { | 11 namespace internal { |
| 12 | 12 |
| 13 template<typename Record> | 13 template<typename Record> |
| 14 struct UnboundQueue<Record>::Node: public Malloced { | 14 struct UnboundQueue<Record>::Node: public Malloced { |
| 15 explicit Node(const Record& value) | 15 explicit Node(const Record& value) |
| 16 : value(value), next(NULL) { | 16 : value(value), next(NULL) { |
| 17 } | 17 } |
| 18 | 18 |
| (...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 72 | 72 |
| 73 template<typename Record> | 73 template<typename Record> |
| 74 Record* UnboundQueue<Record>::Peek() const { | 74 Record* UnboundQueue<Record>::Peek() const { |
| 75 if (divider_ == base::Acquire_Load(&last_)) return NULL; | 75 if (divider_ == base::Acquire_Load(&last_)) return NULL; |
| 76 Node* next = reinterpret_cast<Node*>(divider_)->next; | 76 Node* next = reinterpret_cast<Node*>(divider_)->next; |
| 77 return &next->value; | 77 return &next->value; |
| 78 } | 78 } |
| 79 | 79 |
| 80 } } // namespace v8::internal | 80 } } // namespace v8::internal |
| 81 | 81 |
| 82 #endif // V8_UNBOUND_QUEUE_INL_H_ | 82 #endif // V8_PROFILER_UNBOUND_QUEUE_INL_H_ |
| OLD | NEW |