Algorithms/algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[09_queue] concurrency, lock_free_queue, updated.

Browse Source
This commit is contained in:
Liam Huang 2018-10-11 18:06:05 +08:00
parent ee3253afdd
commit 038359ef26
1 changed files with 14 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
c-cpp/09_queue/lock_free_queue.hpp
View File

@ -24,11 +24,21 @@ class LockFreeQueue {
public: public:
LockFreeQueue() head(new node), tail(head.load()) {} LockFreeQueue() head(new node), tail(head.load()) {}
LockFreeQueue(const LockFreeQueue&) = delete; LockFreeQueue(const LockFreeQueue&) = delete;
LockFreeQueue(LockFreeQueue&& other) : head(other.head.load()), tail(other.tail.load()) {
other.head.store(nullptr);
other.tail.store(nullptr);
}
LockFreeQueue& operator=(const LockFreeQueue&) = delete; LockFreeQueue& operator=(const LockFreeQueue&) = delete;
// TODO(Liam Huang): move constructor and move assignment should be well implemented later, LockFreeQueue& operator=(LockFreeQueue&& rhs) {
// and hance marked "delete". while (node* const old_head = head.load()) {
LockFreeQueue(LockFreeQueue&&) = delete; head.store(old_head->next);
LockFreeQueue& operator=(LockFreeQueue&&) = delete; delete old_head;
}
head.store(rhs.head.load());
tail.store(rhs.tail.load());
rhs.head.store(nullptr);
rhs.tail.store(nullptr);
}
~LockFreeQueue() { ~LockFreeQueue() {
while (node* const old_head = head.load()) { while (node* const old_head = head.load()) {
head.store(old_head->next); head.store(old_head->next);