-
Notifications
You must be signed in to change notification settings - Fork 13.6k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
31 changed files
with
1,810 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,173 @@ | ||
/**************************************************************************** | ||
* | ||
* Copyright (C) 2019 PX4 Development Team. All rights reserved. | ||
* | ||
* Redistribution and use in source and binary forms, with or without | ||
* modification, are permitted provided that the following conditions | ||
* are met: | ||
* | ||
* 1. Redistributions of source code must retain the above copyright | ||
* notice, this list of conditions and the following disclaimer. | ||
* 2. Redistributions in binary form must reproduce the above copyright | ||
* notice, this list of conditions and the following disclaimer in | ||
* the documentation and/or other materials provided with the | ||
* distribution. | ||
* 3. Neither the name PX4 nor the names of its contributors may be | ||
* used to endorse or promote products derived from this software | ||
* without specific prior written permission. | ||
* | ||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | ||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | ||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS | ||
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE | ||
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, | ||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, | ||
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS | ||
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED | ||
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN | ||
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | ||
* POSSIBILITY OF SUCH DAMAGE. | ||
* | ||
****************************************************************************/ | ||
|
||
/** | ||
* @file BlockingList.hpp | ||
* | ||
* A blocking intrusive linked list. | ||
*/ | ||
|
||
#pragma once | ||
|
||
#include <pthread.h> | ||
#include <stdlib.h> | ||
|
||
#include "LockGuard.hpp" | ||
|
||
template<class T> | ||
class BlockingListNode | ||
{ | ||
public: | ||
|
||
void setSibling(T sibling) { _blocking_list_node_sibling = sibling; } | ||
const T getSibling() const { return _blocking_list_node_sibling; } | ||
|
||
protected: | ||
|
||
T _blocking_list_node_sibling{nullptr}; | ||
|
||
}; | ||
|
||
template<class T> | ||
class BlockingList | ||
{ | ||
public: | ||
|
||
~BlockingList() | ||
{ | ||
pthread_mutex_destroy(&_mutex); | ||
pthread_cond_destroy(&_cv); | ||
} | ||
|
||
void add(T newNode) | ||
{ | ||
LockGuard lg{_mutex}; | ||
newNode->setSibling(getHead()); | ||
_head = newNode; | ||
} | ||
|
||
bool remove(T removeNode) | ||
{ | ||
LockGuard lg{_mutex}; | ||
|
||
// base case | ||
if (removeNode == _head) { | ||
_head = nullptr; | ||
return true; | ||
} | ||
|
||
for (T node = getHead(); node != nullptr; node = node->getSibling()) { | ||
// is sibling the node to remove? | ||
if (node->getSibling() == removeNode) { | ||
// replace sibling | ||
if (node->getSibling() != nullptr) { | ||
node->setSibling(node->getSibling()->getSibling()); | ||
|
||
} else { | ||
node->setSibling(nullptr); | ||
} | ||
|
||
return true; | ||
} | ||
} | ||
|
||
return false; | ||
} | ||
|
||
struct Iterator { | ||
T node; | ||
Iterator(T v) : node(v) {} | ||
|
||
operator T() const { return node; } | ||
operator T &() { return node; } | ||
T operator* () const { return node; } | ||
Iterator &operator++ () | ||
{ | ||
if (node) { | ||
node = node->getSibling(); | ||
}; | ||
|
||
return *this; | ||
} | ||
}; | ||
|
||
Iterator begin() { return Iterator(getHead()); } | ||
Iterator end() { return Iterator(nullptr); } | ||
|
||
const T getHead() const { return _head; } | ||
|
||
bool empty() const { return getHead() == nullptr; } | ||
|
||
size_t size() const | ||
{ | ||
LockGuard lg{_mutex}; | ||
size_t sz = 0; | ||
|
||
for (auto node = getHead(); node != nullptr; node = node->getSibling()) { | ||
sz++; | ||
} | ||
|
||
return sz; | ||
} | ||
|
||
void deleteNode(T node) | ||
{ | ||
if (remove(node)) { | ||
// only delete if node was successfully removed | ||
delete node; | ||
} | ||
} | ||
|
||
void clear() | ||
{ | ||
LockGuard lg{_mutex}; | ||
auto node = getHead(); | ||
|
||
while (node != nullptr) { | ||
auto next = node->getSibling(); | ||
delete node; | ||
node = next; | ||
} | ||
|
||
_head = nullptr; | ||
} | ||
|
||
LockGuard getLockGuard() { return LockGuard{_mutex}; } | ||
|
||
private: | ||
|
||
pthread_mutex_t _mutex = PTHREAD_MUTEX_INITIALIZER; | ||
pthread_cond_t _cv = PTHREAD_COND_INITIALIZER; | ||
|
||
T _head{nullptr}; | ||
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,97 @@ | ||
/**************************************************************************** | ||
* | ||
* Copyright (C) 2019 PX4 Development Team. All rights reserved. | ||
* | ||
* Redistribution and use in source and binary forms, with or without | ||
* modification, are permitted provided that the following conditions | ||
* are met: | ||
* | ||
* 1. Redistributions of source code must retain the above copyright | ||
* notice, this list of conditions and the following disclaimer. | ||
* 2. Redistributions in binary form must reproduce the above copyright | ||
* notice, this list of conditions and the following disclaimer in | ||
* the documentation and/or other materials provided with the | ||
* distribution. | ||
* 3. Neither the name PX4 nor the names of its contributors may be | ||
* used to endorse or promote products derived from this software | ||
* without specific prior written permission. | ||
* | ||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | ||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | ||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS | ||
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE | ||
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, | ||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, | ||
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS | ||
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED | ||
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN | ||
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | ||
* POSSIBILITY OF SUCH DAMAGE. | ||
* | ||
****************************************************************************/ | ||
|
||
#pragma once | ||
|
||
#include <pthread.h> | ||
|
||
#include "LockGuard.hpp" | ||
|
||
template<class T, size_t N> | ||
class BlockingQueue | ||
{ | ||
public: | ||
|
||
BlockingQueue() = default; | ||
|
||
~BlockingQueue() | ||
{ | ||
pthread_mutex_destroy(&_mutex); | ||
pthread_cond_destroy(&_cv); | ||
} | ||
|
||
bool empty() const { return _count == 0; } | ||
bool full() const { return _count == N; } | ||
|
||
void push(T newItem) | ||
{ | ||
LockGuard lg(_mutex); | ||
|
||
if (full()) { | ||
pthread_cond_wait(&_cv, &_mutex); | ||
} | ||
|
||
_data[_tail] = newItem; | ||
_tail = (_tail + 1) % N; | ||
_count++; | ||
|
||
pthread_cond_signal(&_cv); | ||
} | ||
|
||
T pop() | ||
{ | ||
LockGuard lg(_mutex); | ||
|
||
if (empty()) { | ||
pthread_cond_wait(&_cv, &_mutex); | ||
} | ||
|
||
T ret = _data[_head]; | ||
_head = (_head + 1) % N; | ||
_count--; | ||
|
||
return ret; | ||
} | ||
|
||
private: | ||
|
||
pthread_mutex_t _mutex = PTHREAD_MUTEX_INITIALIZER; | ||
pthread_cond_t _cv = PTHREAD_COND_INITIALIZER; | ||
|
||
T _data[N]; | ||
size_t _count{0}; | ||
|
||
size_t _head{0}; | ||
size_t _tail{0}; | ||
|
||
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.