mirror of
https://github.com/mod-playerbots/azerothcore-wotlk.git
synced 2026-01-13 09:17:18 +00:00
* refactor(src/common): remove unused imports * fix: build * chore: fix build * chore: size_t -> std::size_t * chore: fix fuckup from previous commit * chore: fix build * chore: fix build * chore: fix build * chore: fix build with std::size_t * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build * chore: fix build
120 lines
2.7 KiB
C++
120 lines
2.7 KiB
C++
/*
|
|
* This file is part of the AzerothCore Project. See AUTHORS file for Copyright information
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU Affero General Public License as published by the
|
|
* Free Software Foundation; either version 3 of the License, or (at your
|
|
* option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for
|
|
* more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along
|
|
* with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef _PCQ_H
|
|
#define _PCQ_H
|
|
|
|
#include <condition_variable>
|
|
#include <queue>
|
|
|
|
template <typename T>
|
|
class ProducerConsumerQueue
|
|
{
|
|
private:
|
|
std::mutex _queueLock;
|
|
std::queue<T> _queue;
|
|
std::condition_variable _condition;
|
|
std::atomic<bool> _shutdown;
|
|
|
|
public:
|
|
ProducerConsumerQueue() : _shutdown(false) { }
|
|
|
|
void Push(const T& value)
|
|
{
|
|
std::lock_guard<std::mutex> lock(_queueLock);
|
|
_queue.push(std::move(value));
|
|
|
|
_condition.notify_one();
|
|
}
|
|
|
|
bool Empty()
|
|
{
|
|
std::lock_guard<std::mutex> lock(_queueLock);
|
|
|
|
return _queue.empty();
|
|
}
|
|
|
|
[[nodiscard]] std::size_t Size() const
|
|
{
|
|
return _queue.size();
|
|
}
|
|
|
|
bool Pop(T& value)
|
|
{
|
|
std::lock_guard<std::mutex> lock(_queueLock);
|
|
|
|
if (_queue.empty() || _shutdown)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
value = _queue.front();
|
|
|
|
_queue.pop();
|
|
|
|
return true;
|
|
}
|
|
|
|
void WaitAndPop(T& value)
|
|
{
|
|
std::unique_lock<std::mutex> lock(_queueLock);
|
|
|
|
// we could be using .wait(lock, predicate) overload here but it is broken
|
|
// https://connect.microsoft.com/VisualStudio/feedback/details/1098841
|
|
while (_queue.empty() && !_shutdown)
|
|
{
|
|
_condition.wait(lock);
|
|
}
|
|
|
|
if (_queue.empty() || _shutdown)
|
|
{
|
|
return;
|
|
}
|
|
|
|
value = _queue.front();
|
|
|
|
_queue.pop();
|
|
}
|
|
|
|
void Cancel()
|
|
{
|
|
std::unique_lock<std::mutex> lock(_queueLock);
|
|
|
|
while (!_queue.empty())
|
|
{
|
|
T& value = _queue.front();
|
|
|
|
DeleteQueuedObject(value);
|
|
|
|
_queue.pop();
|
|
}
|
|
|
|
_shutdown = true;
|
|
|
|
_condition.notify_all();
|
|
}
|
|
|
|
private:
|
|
template<typename E = T>
|
|
typename std::enable_if<std::is_pointer<E>::value>::type DeleteQueuedObject(E& obj) { delete obj; }
|
|
|
|
template<typename E = T>
|
|
typename std::enable_if<!std::is_pointer<E>::value>::type DeleteQueuedObject(E const& /*packet*/) { }
|
|
};
|
|
|
|
#endif
|