| 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_UNBOUND_QUEUE_INL_H_ |
| 6 #define V8_UNBOUND_QUEUE_INL_H_ | 6 #define V8_UNBOUND_QUEUE_INL_H_ |
| 7 | 7 |
| 8 #include "unbound-queue.h" | 8 #include "src/unbound-queue.h" |
| 9 | 9 |
| 10 #include "atomicops.h" | 10 #include "src/atomicops.h" |
| 11 | 11 |
| 12 namespace v8 { | 12 namespace v8 { |
| 13 namespace internal { | 13 namespace internal { |
| 14 | 14 |
| 15 template<typename Record> | 15 template<typename Record> |
| 16 struct UnboundQueue<Record>::Node: public Malloced { | 16 struct UnboundQueue<Record>::Node: public Malloced { |
| 17 explicit Node(const Record& value) | 17 explicit Node(const Record& value) |
| 18 : value(value), next(NULL) { | 18 : value(value), next(NULL) { |
| 19 } | 19 } |
| 20 | 20 |
| (...skipping 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 75 template<typename Record> | 75 template<typename Record> |
| 76 Record* UnboundQueue<Record>::Peek() const { | 76 Record* UnboundQueue<Record>::Peek() const { |
| 77 if (divider_ == Acquire_Load(&last_)) return NULL; | 77 if (divider_ == Acquire_Load(&last_)) return NULL; |
| 78 Node* next = reinterpret_cast<Node*>(divider_)->next; | 78 Node* next = reinterpret_cast<Node*>(divider_)->next; |
| 79 return &next->value; | 79 return &next->value; |
| 80 } | 80 } |
| 81 | 81 |
| 82 } } // namespace v8::internal | 82 } } // namespace v8::internal |
| 83 | 83 |
| 84 #endif // V8_UNBOUND_QUEUE_INL_H_ | 84 #endif // V8_UNBOUND_QUEUE_INL_H_ |
| OLD | NEW |