1 // Copyright 2010 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
28 #ifndef V8_UNBOUND_QUEUE_INL_H_
29 #define V8_UNBOUND_QUEUE_INL_H_
31 #include "unbound-queue.h"
36 template<typename Record>
37 struct UnboundQueue<Record>::Node: public Malloced {
38 explicit Node(const Record& value)
39 : value(value), next(NULL) {
47 template<typename Record>
48 UnboundQueue<Record>::UnboundQueue() {
49 first_ = new Node(Record());
50 divider_ = last_ = reinterpret_cast<AtomicWord>(first_);
54 template<typename Record>
55 UnboundQueue<Record>::~UnboundQueue() {
56 while (first_ != NULL) DeleteFirst();
60 template<typename Record>
61 void UnboundQueue<Record>::DeleteFirst() {
68 template<typename Record>
69 void UnboundQueue<Record>::Dequeue(Record* rec) {
70 ASSERT(divider_ != last_);
71 Node* next = reinterpret_cast<Node*>(divider_)->next;
73 OS::ReleaseStore(÷r_, reinterpret_cast<AtomicWord>(next));
77 template<typename Record>
78 void UnboundQueue<Record>::Enqueue(const Record& rec) {
79 Node*& next = reinterpret_cast<Node*>(last_)->next;
81 OS::ReleaseStore(&last_, reinterpret_cast<AtomicWord>(next));
82 while (first_ != reinterpret_cast<Node*>(divider_)) DeleteFirst();
86 template<typename Record>
87 Record* UnboundQueue<Record>::Peek() {
88 ASSERT(divider_ != last_);
89 Node* next = reinterpret_cast<Node*>(divider_)->next;
93 } } // namespace v8::internal
95 #endif // V8_UNBOUND_QUEUE_INL_H_