rpcs3/Utilities/SQueue.h

115 lines
1.4 KiB
C
Raw Normal View History

2014-02-24 00:00:42 +00:00
#pragma once
template<typename T, u32 SQSize = 666>
class SQueue
{
std::mutex m_mutex;
2014-02-24 00:00:42 +00:00
u32 m_pos;
u32 m_count;
T m_data[SQSize];
public:
SQueue()
: m_pos(0)
, m_count(0)
{
}
const u32 GetSize() const
{
return SQSize;
}
2014-03-06 11:50:45 +00:00
bool Push(const T& data)
2014-02-24 00:00:42 +00:00
{
while (true)
{
if (m_count >= SQSize)
{
2014-03-02 23:02:42 +00:00
if (Emu.IsStopped())
{
return false;
}
2014-02-24 00:00:42 +00:00
Sleep(1);
continue;
}
{
std::lock_guard<std::mutex> lock(m_mutex);
2014-02-24 00:00:42 +00:00
if (m_count >= SQSize) continue;
m_data[(m_pos + m_count++) % SQSize] = data;
return true;
}
}
}
bool Pop(T& data)
{
while (true)
{
if (!m_count)
{
2014-03-02 23:02:42 +00:00
if (Emu.IsStopped())
{
return false;
}
2014-02-24 00:00:42 +00:00
Sleep(1);
continue;
}
{
std::lock_guard<std::mutex> lock(m_mutex);
2014-02-24 00:00:42 +00:00
if (!m_count) continue;
data = m_data[m_pos];
m_pos = (m_pos + 1) % SQSize;
m_count--;
return true;
}
}
}
2014-03-22 01:08:25 +00:00
volatile u32 GetCount() // may be not safe
2014-02-24 00:00:42 +00:00
{
return m_count;
}
2014-03-22 01:08:25 +00:00
volatile bool IsEmpty() // may be not safe
2014-02-24 00:00:42 +00:00
{
return !m_count;
}
void Clear()
{
std::lock_guard<std::mutex> lock(m_mutex);
2014-02-24 00:00:42 +00:00
m_count = 0;
}
2014-03-02 23:02:42 +00:00
T& Peek(u32 pos = 0)
{
2014-03-22 01:08:25 +00:00
while (true)
{
if (!m_count)
{
if (Emu.IsStopped())
{
break;
}
Sleep(1);
continue;
}
{
std::lock_guard<std::mutex> lock(m_mutex);
2014-03-22 01:08:25 +00:00
if (m_count) break;
}
}
2014-03-02 23:02:42 +00:00
return m_data[(m_pos + pos) % SQSize];
}
2014-03-06 11:50:45 +00:00
};