mirror of
https://github.com/RPCS3/rpcs3.git
synced 2024-11-16 23:17:29 +00:00
4b8d6b6919
Improved Vertex Shader Decompiler.
206 lines
3.2 KiB
C++
206 lines
3.2 KiB
C++
#pragma once
|
|
#include "Array.h"
|
|
#include <functional>
|
|
#include <thread>
|
|
#include <mutex>
|
|
#include <atomic>
|
|
#include <condition_variable>
|
|
|
|
class ThreadExec;
|
|
|
|
class NamedThreadBase
|
|
{
|
|
std::string m_name;
|
|
|
|
public:
|
|
NamedThreadBase(const std::string& name) : m_name(name)
|
|
{
|
|
}
|
|
|
|
NamedThreadBase()
|
|
{
|
|
}
|
|
|
|
virtual std::string GetThreadName() const;
|
|
virtual void SetThreadName(const std::string& name);
|
|
};
|
|
|
|
NamedThreadBase* GetCurrentNamedThread();
|
|
|
|
class ThreadBase : public NamedThreadBase
|
|
{
|
|
protected:
|
|
std::atomic<bool> m_destroy;
|
|
std::atomic<bool> m_alive;
|
|
std::thread* m_executor;
|
|
|
|
mutable std::mutex m_main_mutex;
|
|
|
|
ThreadBase(const std::string& name);
|
|
~ThreadBase();
|
|
|
|
public:
|
|
void Start();
|
|
void Stop(bool wait = true);
|
|
|
|
bool Join() const;
|
|
bool IsAlive() const;
|
|
bool TestDestroy() const;
|
|
|
|
virtual void Task() = 0;
|
|
};
|
|
|
|
class thread
|
|
{
|
|
std::string m_name;
|
|
std::thread m_thr;
|
|
|
|
public:
|
|
thread(const std::string& name, std::function<void()> func);
|
|
thread(const std::string& name);
|
|
thread();
|
|
|
|
void start(std::function<void()> func);
|
|
void detach();
|
|
void join();
|
|
bool joinable() const;
|
|
};
|
|
|
|
template<typename T> class MTPacketBuffer
|
|
{
|
|
protected:
|
|
volatile bool m_busy;
|
|
volatile u32 m_put, m_get;
|
|
Array<u8> m_buffer;
|
|
u32 m_max_buffer_size;
|
|
mutable std::recursive_mutex m_cs_main;
|
|
|
|
void CheckBusy()
|
|
{
|
|
m_busy = m_put >= m_max_buffer_size;
|
|
}
|
|
|
|
public:
|
|
MTPacketBuffer(u32 max_buffer_size)
|
|
: m_max_buffer_size(max_buffer_size)
|
|
{
|
|
Flush();
|
|
}
|
|
|
|
~MTPacketBuffer()
|
|
{
|
|
Flush();
|
|
}
|
|
|
|
void Flush()
|
|
{
|
|
std::lock_guard<std::recursive_mutex> lock(m_cs_main);
|
|
m_put = m_get = 0;
|
|
m_buffer.Clear();
|
|
m_busy = false;
|
|
}
|
|
|
|
private:
|
|
virtual void _push(const T& v) = 0;
|
|
virtual T _pop() = 0;
|
|
|
|
public:
|
|
void Push(const T& v)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> lock(m_cs_main);
|
|
_push(v);
|
|
}
|
|
|
|
T Pop()
|
|
{
|
|
std::lock_guard<std::recursive_mutex> lock(m_cs_main);
|
|
return _pop();
|
|
}
|
|
|
|
bool HasNewPacket() const { std::lock_guard<std::recursive_mutex> lock(m_cs_main); return m_put != m_get; }
|
|
bool IsBusy() const { return m_busy; }
|
|
};
|
|
|
|
static __forceinline bool SemaphorePostAndWait(wxSemaphore& sem)
|
|
{
|
|
if(sem.TryWait() != wxSEMA_BUSY) return false;
|
|
|
|
sem.Post();
|
|
sem.Wait();
|
|
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
class StepThread : public ThreadBase
|
|
{
|
|
wxSemaphore m_main_sem;
|
|
wxSemaphore m_destroy_sem;
|
|
volatile bool m_exit;
|
|
|
|
protected:
|
|
StepThread(const wxString& name = "Unknown StepThread")
|
|
: ThreadBase(true, name)
|
|
, m_exit(false)
|
|
{
|
|
}
|
|
|
|
virtual ~StepThread() throw()
|
|
{
|
|
}
|
|
|
|
private:
|
|
virtual void Task()
|
|
{
|
|
m_exit = false;
|
|
|
|
while(!TestDestroy())
|
|
{
|
|
m_main_sem.Wait();
|
|
|
|
if(TestDestroy() || m_exit) break;
|
|
|
|
Step();
|
|
}
|
|
|
|
while(!TestDestroy()) Sleep(0);
|
|
if(m_destroy_sem.TryWait() != wxSEMA_NO_ERROR) m_destroy_sem.Post();
|
|
}
|
|
|
|
virtual void Step()=0;
|
|
|
|
public:
|
|
void DoStep()
|
|
{
|
|
if(IsRunning()) m_main_sem.Post();
|
|
}
|
|
|
|
void WaitForExit()
|
|
{
|
|
if(TestDestroy()) m_destroy_sem.Wait();
|
|
}
|
|
|
|
void WaitForNextStep()
|
|
{
|
|
if(!IsRunning()) return;
|
|
|
|
while(m_main_sem.TryWait() != wxSEMA_NO_ERROR) Sleep(0);
|
|
}
|
|
|
|
void Exit(bool wait = false)
|
|
{
|
|
if(!IsAlive()) return;
|
|
|
|
if(m_main_sem.TryWait() != wxSEMA_NO_ERROR)
|
|
{
|
|
m_exit = true;
|
|
m_main_sem.Post();
|
|
}
|
|
|
|
Delete();
|
|
|
|
if(wait) WaitForExit();
|
|
}
|
|
};
|
|
*/
|