i2pd/Queue.h

151 lines
2.7 KiB
C
Raw Normal View History

2013-12-10 13:00:13 +00:00
#ifndef QUEUE_H__
#define QUEUE_H__
#include <queue>
#include <mutex>
#include <thread>
#include <condition_variable>
2014-04-23 16:49:02 +00:00
#include <functional>
2013-12-10 13:00:13 +00:00
namespace i2p
{
namespace util
{
template<typename Element>
class Queue
{
public:
void Put (Element * e)
{
std::unique_lock<std::mutex> l(m_QueueMutex);
m_Queue.push (e);
m_NonEmpty.notify_one ();
}
Element * GetNext ()
{
std::unique_lock<std::mutex> l(m_QueueMutex);
Element * el = GetNonThreadSafe ();
if (!el)
{
m_NonEmpty.wait (l);
el = GetNonThreadSafe ();
}
return el;
}
Element * GetNextWithTimeout (int usec)
{
std::unique_lock<std::mutex> l(m_QueueMutex);
Element * el = GetNonThreadSafe ();
if (!el)
{
m_NonEmpty.wait_for (l, std::chrono::milliseconds (usec));
el = GetNonThreadSafe ();
}
return el;
}
2014-01-11 01:21:38 +00:00
2014-04-23 16:17:14 +00:00
void Wait ()
{
std::unique_lock<std::mutex> l(m_QueueMutex);
m_NonEmpty.wait (l);
}
2014-01-11 01:21:38 +00:00
bool Wait (int sec, int usec)
{
std::unique_lock<std::mutex> l(m_QueueMutex);
return m_NonEmpty.wait_for (l, std::chrono::seconds (sec) + std::chrono::milliseconds (usec)) != std::cv_status::timeout;
}
bool IsEmpty ()
{
std::unique_lock<std::mutex> l(m_QueueMutex);
return m_Queue.empty ();
}
2013-12-10 13:00:13 +00:00
2014-07-02 17:48:45 +00:00
void WakeUp () { m_NonEmpty.notify_all (); };
2013-12-10 13:00:13 +00:00
Element * Get ()
{
std::unique_lock<std::mutex> l(m_QueueMutex);
return GetNonThreadSafe ();
}
2014-01-11 01:21:38 +00:00
Element * Peek ()
{
std::unique_lock<std::mutex> l(m_QueueMutex);
return GetNonThreadSafe (true);
}
2013-12-10 13:00:13 +00:00
private:
2014-01-11 01:21:38 +00:00
Element * GetNonThreadSafe (bool peek = false)
2013-12-10 13:00:13 +00:00
{
if (!m_Queue.empty ())
{
Element * el = m_Queue.front ();
2014-01-11 01:21:38 +00:00
if (!peek)
m_Queue.pop ();
2013-12-10 13:00:13 +00:00
return el;
}
return nullptr;
}
private:
std::queue<Element *> m_Queue;
std::mutex m_QueueMutex;
std::condition_variable m_NonEmpty;
};
template<class Msg>
class MsgQueue: public Queue<Msg>
{
public:
2014-04-23 16:49:02 +00:00
typedef std::function<void()> OnEmpty;
2014-04-23 16:17:14 +00:00
MsgQueue (): m_IsRunning (true), m_Thread (std::bind (&MsgQueue<Msg>::Run, this)) {};
2014-07-02 17:48:45 +00:00
~MsgQueue () { Stop (); };
2014-02-04 23:15:42 +00:00
void Stop()
{
2014-07-02 17:48:45 +00:00
if (m_IsRunning)
{
m_IsRunning = false;
Queue<Msg>::WakeUp ();
m_Thread.join();
}
2014-02-04 23:15:42 +00:00
}
2013-12-10 13:00:13 +00:00
2014-04-23 16:49:02 +00:00
void SetOnEmpty (OnEmpty const & e) { m_OnEmpty = e; };
2013-12-10 13:00:13 +00:00
private:
2014-04-23 16:17:14 +00:00
2013-12-10 13:00:13 +00:00
void Run ()
{
2014-04-23 16:17:14 +00:00
while (m_IsRunning)
2013-12-10 13:00:13 +00:00
{
2014-04-23 16:17:14 +00:00
while (Msg * msg = Queue<Msg>::Get ())
{
msg->Process ();
delete msg;
}
2014-04-23 16:49:02 +00:00
if (m_OnEmpty != nullptr)
m_OnEmpty ();
2014-04-23 16:17:14 +00:00
Queue<Msg>::Wait ();
2013-12-10 13:00:13 +00:00
}
}
private:
2014-04-23 16:17:14 +00:00
bool m_IsRunning;
std::thread m_Thread;
2014-04-23 16:49:02 +00:00
OnEmpty m_OnEmpty;
2013-12-10 13:00:13 +00:00
};
}
}
#endif