%PDF- <> %âãÏÓ endobj 2 0 obj <> endobj 3 0 obj <>/ExtGState<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI] >>/Annots[ 28 0 R 29 0 R] /MediaBox[ 0 0 595.5 842.25] /Contents 4 0 R/Group<>/Tabs/S>> endobj ºaâÚÎΞ-ÌE1ÍØÄ÷{òò2ÿ ÛÖ^ÔÀá TÎ{¦?§®¥kuµùÕ5sLOšuY>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<> endobj 2 0 obj<>endobj 2 0 obj<>es 3 0 R>> endobj 2 0 obj<> ox[ 0.000000 0.000000 609.600000 935.600000]/Fi endobj 3 0 obj<> endobj 7 1 obj<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI]>>/Subtype/Form>> stream
// Copyright 2015 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef V8_UTILS_LOCKED_QUEUE_INL_H_ #define V8_UTILS_LOCKED_QUEUE_INL_H_ #include "src/base/atomic-utils.h" #include "src/utils/locked-queue.h" namespace v8 { namespace internal { template <typename Record> struct LockedQueue<Record>::Node : Malloced { Node() : next(nullptr) {} Record value; base::AtomicValue<Node*> next; }; template <typename Record> inline LockedQueue<Record>::LockedQueue() { head_ = new Node(); CHECK_NOT_NULL(head_); tail_ = head_; } template <typename Record> inline LockedQueue<Record>::~LockedQueue() { // Destroy all remaining nodes. Note that we do not destroy the actual values. Node* old_node = nullptr; Node* cur_node = head_; while (cur_node != nullptr) { old_node = cur_node; cur_node = cur_node->next.Value(); delete old_node; } } template <typename Record> inline void LockedQueue<Record>::Enqueue(Record record) { Node* n = new Node(); CHECK_NOT_NULL(n); n->value = std::move(record); { base::MutexGuard guard(&tail_mutex_); tail_->next.SetValue(n); tail_ = n; } } template <typename Record> inline bool LockedQueue<Record>::Dequeue(Record* record) { Node* old_head = nullptr; { base::MutexGuard guard(&head_mutex_); old_head = head_; Node* const next_node = head_->next.Value(); if (next_node == nullptr) return false; *record = std::move(next_node->value); head_ = next_node; } delete old_head; return true; } template <typename Record> inline bool LockedQueue<Record>::IsEmpty() const { base::MutexGuard guard(&head_mutex_); return head_->next.Value() == nullptr; } template <typename Record> inline bool LockedQueue<Record>::Peek(Record* record) const { base::MutexGuard guard(&head_mutex_); Node* const next_node = head_->next.Value(); if (next_node == nullptr) return false; *record = next_node->value; return true; } } // namespace internal } // namespace v8 #endif // V8_UTILS_LOCKED_QUEUE_INL_H_