-
Notifications
You must be signed in to change notification settings - Fork 39
/
Copy pathLockFreeQueueCpp11.h
96 lines (83 loc) · 2.21 KB
/
LockFreeQueueCpp11.h
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#pragma once
#include <atomic>
#include <cstddef>
template <typename T> class LockFreeQueueCpp11
{
public:
explicit LockFreeQueueCpp11(size_t capacity)
{
_capacityMask = capacity - 1;
for(size_t i = 1; i <= sizeof(void*) * 4; i <<= 1)
_capacityMask |= _capacityMask >> i;
_capacity = _capacityMask + 1;
_queue = (Node*)new char[sizeof(Node) * _capacity];
for(size_t i = 0; i < _capacity; ++i)
{
_queue[i].tail.store(i, std::memory_order_relaxed);
_queue[i].head.store(-1, std::memory_order_relaxed);
}
_tail.store(0, std::memory_order_relaxed);
_head.store(0, std::memory_order_relaxed);
}
~LockFreeQueueCpp11()
{
for(size_t i = _head; i != _tail; ++i)
(&_queue[i & _capacityMask].data)->~T();
delete [] (char*)_queue;
}
size_t capacity() const {return _capacity;}
size_t size() const
{
size_t head = _head.load(std::memory_order_acquire);
return _tail.load(std::memory_order_relaxed) - head;
}
bool push(const T& data)
{
Node* node;
size_t tail = _tail.load(std::memory_order_relaxed);
for(;;)
{
node = &_queue[tail & _capacityMask];
if(node->tail.load(std::memory_order_relaxed) != tail)
return false;
if((_tail.compare_exchange_weak(tail, tail + 1, std::memory_order_relaxed)))
break;
}
new (&node->data)T(data);
node->head.store(tail, std::memory_order_release);
return true;
}
bool pop(T& result)
{
Node* node;
size_t head = _head.load(std::memory_order_relaxed);
for(;;)
{
node = &_queue[head & _capacityMask];
if(node->head.load(std::memory_order_relaxed) != head)
return false;
if(_head.compare_exchange_weak(head, head + 1, std::memory_order_relaxed))
break;
}
result = node->data;
(&node->data)->~T();
node->tail.store(head + _capacity, std::memory_order_release);
return true;
}
private:
struct Node
{
T data;
std::atomic<size_t> tail;
std::atomic<size_t> head;
};
private:
size_t _capacityMask;
Node* _queue;
size_t _capacity;
char cacheLinePad1[64];
std::atomic<size_t> _tail;
char cacheLinePad2[64];
std::atomic<size_t> _head;
char cacheLinePad3[64];
};