mirror of https://github.com/nostar/urfd.git
Tom Early
3 years ago
parent
939773f54b
commit
10e4972040
@ -1,70 +0,0 @@
|
||||
// Copyright © 2015 Jean-Luc Deltombe (LX3JL). All rights reserved.
|
||||
|
||||
// urfd -- The universal reflector
|
||||
// Copyright © 2021 Thomas A. Early N7TAE
|
||||
//
|
||||
// This program is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU 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 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 <https://www.gnu.org/licenses/>.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <mutex>
|
||||
#include <queue>
|
||||
#include "Packet.h"
|
||||
|
||||
class CClient;
|
||||
|
||||
class CPacketQueue
|
||||
{
|
||||
public:
|
||||
// destructor
|
||||
virtual ~CPacketQueue() {}
|
||||
|
||||
// lock
|
||||
void Lock()
|
||||
{
|
||||
m_Mutex.lock();
|
||||
}
|
||||
|
||||
void Unlock()
|
||||
{
|
||||
m_Mutex.unlock();
|
||||
}
|
||||
|
||||
// pass thru
|
||||
std::unique_ptr<CPacket> pop()
|
||||
{
|
||||
auto pack = std::move(queue.front());
|
||||
queue.pop();
|
||||
return std::move(pack);
|
||||
}
|
||||
|
||||
bool empty() const
|
||||
{
|
||||
return queue.empty();
|
||||
}
|
||||
|
||||
void push(std::unique_ptr<CPacket> &packet)
|
||||
{
|
||||
queue.push(std::move(packet));
|
||||
}
|
||||
|
||||
protected:
|
||||
// status
|
||||
bool m_bOpen;
|
||||
uint16_t m_uiStreamId;
|
||||
std::mutex m_Mutex;
|
||||
|
||||
// the queue
|
||||
std::queue<std::unique_ptr<CPacket>> queue;
|
||||
};
|
||||
@ -0,0 +1,76 @@
|
||||
// urfd -- The universal reflector
|
||||
// Copyright © 2023 Thomas A. Early N7TAE
|
||||
//
|
||||
// This program is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU 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 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 <https://www.gnu.org/licenses/>.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <queue>
|
||||
#include <mutex>
|
||||
#include <condition_variable>
|
||||
|
||||
// A threadsafe-queue.
|
||||
template <class T>
|
||||
class CSafePacketQueue
|
||||
{
|
||||
public:
|
||||
CSafePacketQueue(void) : q() , m() , c() {}
|
||||
|
||||
~CSafePacketQueue(void) {}
|
||||
|
||||
void Push(T t)
|
||||
{
|
||||
std::lock_guard<std::mutex> lock(m);
|
||||
q.push(std::move(t));
|
||||
c.notify_one();
|
||||
}
|
||||
|
||||
T Pop(void)
|
||||
{
|
||||
std::lock_guard<std::mutex> lock(m);
|
||||
if (q.empty())
|
||||
return nullptr;
|
||||
else
|
||||
{
|
||||
T val = std::move(q.front());
|
||||
q.pop();
|
||||
return val;
|
||||
}
|
||||
}
|
||||
|
||||
// If the queue is empty, wait till a element is avaiable.
|
||||
T PopWait(void)
|
||||
{
|
||||
std::unique_lock<std::mutex> lock(m);
|
||||
while(q.empty())
|
||||
{
|
||||
// release lock as long as the wait and reaquire it afterwards.
|
||||
c.wait(lock);
|
||||
}
|
||||
T val = std::move(q.front());
|
||||
q.pop();
|
||||
return val;
|
||||
}
|
||||
|
||||
bool IsEmpty(void)
|
||||
{
|
||||
std::unique_lock<std::mutex> lock(m);
|
||||
return q.empty();
|
||||
}
|
||||
|
||||
private:
|
||||
std::queue<T> q;
|
||||
mutable std::mutex m;
|
||||
std::condition_variable c;
|
||||
};
|
||||
Loading…
Reference in new issue