OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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_CIRCULAR_QUEUE_INL_H_ | 5 #ifndef V8_CIRCULAR_QUEUE_INL_H_ |
6 #define V8_CIRCULAR_QUEUE_INL_H_ | 6 #define V8_CIRCULAR_QUEUE_INL_H_ |
7 | 7 |
8 #include "circular-queue.h" | 8 #include "src/circular-queue.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
11 namespace internal { | 11 namespace internal { |
12 | 12 |
13 template<typename T, unsigned L> | 13 template<typename T, unsigned L> |
14 SamplingCircularQueue<T, L>::SamplingCircularQueue() | 14 SamplingCircularQueue<T, L>::SamplingCircularQueue() |
15 : enqueue_pos_(buffer_), | 15 : enqueue_pos_(buffer_), |
16 dequeue_pos_(buffer_) { | 16 dequeue_pos_(buffer_) { |
17 } | 17 } |
18 | 18 |
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 typename SamplingCircularQueue<T, L>::Entry* SamplingCircularQueue<T, L>::Next( | 60 typename SamplingCircularQueue<T, L>::Entry* SamplingCircularQueue<T, L>::Next( |
61 Entry* entry) { | 61 Entry* entry) { |
62 Entry* next = entry + 1; | 62 Entry* next = entry + 1; |
63 if (next == &buffer_[L]) return buffer_; | 63 if (next == &buffer_[L]) return buffer_; |
64 return next; | 64 return next; |
65 } | 65 } |
66 | 66 |
67 } } // namespace v8::internal | 67 } } // namespace v8::internal |
68 | 68 |
69 #endif // V8_CIRCULAR_QUEUE_INL_H_ | 69 #endif // V8_CIRCULAR_QUEUE_INL_H_ |
OLD | NEW |