OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #ifndef V8_CIRCULAR_QUEUE_H_ | 28 #ifndef V8_CIRCULAR_QUEUE_H_ |
29 #define V8_CIRCULAR_QUEUE_H_ | 29 #define V8_CIRCULAR_QUEUE_H_ |
30 | 30 |
| 31 #include "atomicops.h" |
31 #include "v8globals.h" | 32 #include "v8globals.h" |
32 | 33 |
33 namespace v8 { | 34 namespace v8 { |
34 namespace internal { | 35 namespace internal { |
35 | 36 |
36 | 37 |
37 // Lock-free cache-friendly sampling circular queue for large | 38 // Lock-free cache-friendly sampling circular queue for large |
38 // records. Intended for fast transfer of large records between a | 39 // records. Intended for fast transfer of large records between a |
39 // single producer and a single consumer. If the queue is full, | 40 // single producer and a single consumer. If the queue is full, |
40 // StartEnqueue will return NULL. The queue is designed with | 41 // StartEnqueue will return NULL. The queue is designed with |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
81 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* enqueue_pos_; | 82 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* enqueue_pos_; |
82 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* dequeue_pos_; | 83 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* dequeue_pos_; |
83 | 84 |
84 DISALLOW_COPY_AND_ASSIGN(SamplingCircularQueue); | 85 DISALLOW_COPY_AND_ASSIGN(SamplingCircularQueue); |
85 }; | 86 }; |
86 | 87 |
87 | 88 |
88 } } // namespace v8::internal | 89 } } // namespace v8::internal |
89 | 90 |
90 #endif // V8_CIRCULAR_QUEUE_H_ | 91 #endif // V8_CIRCULAR_QUEUE_H_ |
OLD | NEW |