diff options
Diffstat (limited to 'src/3rdparty/v8/src/unbound-queue-inl.h')
| -rw-r--r-- | src/3rdparty/v8/src/unbound-queue-inl.h | 95 |
1 files changed, 0 insertions, 95 deletions
diff --git a/src/3rdparty/v8/src/unbound-queue-inl.h b/src/3rdparty/v8/src/unbound-queue-inl.h deleted file mode 100644 index fffb1db..0000000 --- a/src/3rdparty/v8/src/unbound-queue-inl.h +++ /dev/null @@ -1,95 +0,0 @@ -// Copyright 2010 the V8 project authors. All rights reserved. -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// * Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// * Redistributions in binary form must reproduce the above -// copyright notice, this list of conditions and the following -// disclaimer in the documentation and/or other materials provided -// with the distribution. -// * Neither the name of Google Inc. nor the names of its -// contributors may be used to endorse or promote products derived -// from this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - -#ifndef V8_UNBOUND_QUEUE_INL_H_ -#define V8_UNBOUND_QUEUE_INL_H_ - -#include "unbound-queue.h" - -namespace v8 { -namespace internal { - -template<typename Record> -struct UnboundQueue<Record>::Node: public Malloced { - explicit Node(const Record& value) - : value(value), next(NULL) { - } - - Record value; - Node* next; -}; - - -template<typename Record> -UnboundQueue<Record>::UnboundQueue() { - first_ = new Node(Record()); - divider_ = last_ = reinterpret_cast<AtomicWord>(first_); -} - - -template<typename Record> -UnboundQueue<Record>::~UnboundQueue() { - while (first_ != NULL) DeleteFirst(); -} - - -template<typename Record> -void UnboundQueue<Record>::DeleteFirst() { - Node* tmp = first_; - first_ = tmp->next; - delete tmp; -} - - -template<typename Record> -void UnboundQueue<Record>::Dequeue(Record* rec) { - ASSERT(divider_ != last_); - Node* next = reinterpret_cast<Node*>(divider_)->next; - *rec = next->value; - OS::ReleaseStore(÷r_, reinterpret_cast<AtomicWord>(next)); -} - - -template<typename Record> -void UnboundQueue<Record>::Enqueue(const Record& rec) { - Node*& next = reinterpret_cast<Node*>(last_)->next; - next = new Node(rec); - OS::ReleaseStore(&last_, reinterpret_cast<AtomicWord>(next)); - while (first_ != reinterpret_cast<Node*>(divider_)) DeleteFirst(); -} - - -template<typename Record> -Record* UnboundQueue<Record>::Peek() { - ASSERT(divider_ != last_); - Node* next = reinterpret_cast<Node*>(divider_)->next; - return &next->value; -} - -} } // namespace v8::internal - -#endif // V8_UNBOUND_QUEUE_INL_H_ |