blob: 5bcab57b0c1991dc76148de1d790891b54a8856f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
// 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_LOCKED_QUEUE_H_
#define V8_LOCKED_QUEUE_H_
#include "src/allocation.h"
#include "src/base/platform/platform.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();
inline ~LockedQueue();
inline void Enqueue(const 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_;
DISALLOW_COPY_AND_ASSIGN(LockedQueue);
};
} // namespace internal
} // namespace v8
#endif // V8_LOCKED_QUEUE_H_
|
