%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_H_ #define V8_UTILS_LOCKED_QUEUE_H_ #include "src/base/platform/platform.h" #include "src/utils/allocation.h" namespace v8 { namespace internal { // Simple lock-based unbounded size queue (multi producer; multi consumer) based // on "Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue // Algorithms" by M. Scott and M. Michael. // See: // https://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html template <typename Record> class LockedQueue final { public: inline LockedQueue(); LockedQueue(const LockedQueue&) = delete; LockedQueue& operator=(const LockedQueue&) = delete; inline ~LockedQueue(); inline void Enqueue(Record record); inline bool Dequeue(Record* record); inline bool IsEmpty() const; inline bool Peek(Record* record) const; private: struct Node; mutable base::Mutex head_mutex_; base::Mutex tail_mutex_; Node* head_; Node* tail_; }; } // namespace internal } // namespace v8 #endif // V8_UTILS_LOCKED_QUEUE_H_