2013-12-19 17:10:14 +00:00
|
|
|
#include "ta_ctx.h"
|
2015-08-11 21:55:48 +00:00
|
|
|
#include "hw/sh4/sh4_sched.h"
|
2019-09-11 13:09:23 +00:00
|
|
|
#include "oslib/oslib.h"
|
2015-08-11 21:55:48 +00:00
|
|
|
|
2013-12-19 17:10:14 +00:00
|
|
|
extern u32 fskip;
|
|
|
|
extern u32 FrameCount;
|
|
|
|
|
|
|
|
TA_context* ta_ctx;
|
|
|
|
tad_context ta_tad;
|
|
|
|
|
|
|
|
TA_context* vd_ctx;
|
|
|
|
rend_context vd_rc;
|
|
|
|
|
2018-04-09 19:11:06 +00:00
|
|
|
// helper for 32 byte aligned memory allocation
|
|
|
|
void* OS_aligned_malloc(size_t align, size_t size)
|
|
|
|
{
|
2019-08-31 15:36:34 +00:00
|
|
|
#ifdef __MINGW32__
|
|
|
|
return __mingw_aligned_malloc(size, align);
|
|
|
|
#elif defined(_WIN32)
|
|
|
|
return _aligned_malloc(size, align);
|
|
|
|
#else
|
|
|
|
void *result;
|
|
|
|
if (posix_memalign(&result, align, size))
|
|
|
|
return NULL;
|
|
|
|
else
|
|
|
|
return result;
|
|
|
|
#endif
|
2018-04-09 19:11:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// helper for 32 byte aligned memory de-allocation
|
|
|
|
void OS_aligned_free(void *ptr)
|
|
|
|
{
|
2019-08-31 15:36:34 +00:00
|
|
|
#ifdef __MINGW32__
|
|
|
|
__mingw_aligned_free(ptr);
|
|
|
|
#elif defined(_WIN32)
|
|
|
|
_aligned_free(ptr);
|
|
|
|
#else
|
|
|
|
free(ptr);
|
|
|
|
#endif
|
2018-04-09 19:11:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-12-19 17:10:14 +00:00
|
|
|
void SetCurrentTARC(u32 addr)
|
|
|
|
{
|
|
|
|
if (addr != TACTX_NONE)
|
|
|
|
{
|
|
|
|
if (ta_ctx)
|
|
|
|
SetCurrentTARC(TACTX_NONE);
|
|
|
|
|
|
|
|
verify(ta_ctx == 0);
|
|
|
|
//set new context
|
|
|
|
ta_ctx = tactx_Find(addr,true);
|
|
|
|
|
|
|
|
//copy cached params
|
|
|
|
ta_tad = ta_ctx->tad;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
//Flush cache to context
|
|
|
|
verify(ta_ctx != 0);
|
|
|
|
ta_ctx->tad=ta_tad;
|
|
|
|
|
|
|
|
//clear context
|
|
|
|
ta_ctx=0;
|
2014-04-25 16:57:34 +00:00
|
|
|
ta_tad.Reset(0);
|
2013-12-19 17:10:14 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool TryDecodeTARC()
|
|
|
|
{
|
2015-01-10 19:15:15 +00:00
|
|
|
verify(ta_ctx != 0);
|
2013-12-19 17:10:14 +00:00
|
|
|
|
|
|
|
if (vd_ctx == 0)
|
|
|
|
{
|
|
|
|
vd_ctx = ta_ctx;
|
|
|
|
|
|
|
|
vd_ctx->rend.proc_start = vd_ctx->rend.proc_end + 32;
|
|
|
|
vd_ctx->rend.proc_end = vd_ctx->tad.thd_data;
|
2014-05-02 00:43:34 +00:00
|
|
|
|
2013-12-19 17:10:14 +00:00
|
|
|
vd_ctx->rend_inuse.Lock();
|
|
|
|
vd_rc = vd_ctx->rend;
|
|
|
|
|
|
|
|
//signal the vdec thread
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void VDecEnd()
|
|
|
|
{
|
2015-01-10 19:15:15 +00:00
|
|
|
verify(vd_ctx != 0);
|
2013-12-19 17:10:14 +00:00
|
|
|
|
|
|
|
vd_ctx->rend = vd_rc;
|
|
|
|
|
|
|
|
vd_ctx->rend_inuse.Unlock();
|
|
|
|
|
|
|
|
vd_ctx = 0;
|
|
|
|
}
|
|
|
|
|
2019-09-25 19:08:39 +00:00
|
|
|
static cMutex mtx_rqueue;
|
2013-12-19 17:10:14 +00:00
|
|
|
TA_context* rqueue;
|
2019-04-27 12:08:43 +00:00
|
|
|
cResetEvent frame_finished;
|
2015-08-11 21:55:48 +00:00
|
|
|
|
2019-09-25 19:08:39 +00:00
|
|
|
static double last_frame1, last_frame2;
|
2020-03-28 16:58:01 +00:00
|
|
|
static u64 last_cycles1, last_cycles2;
|
2013-12-19 17:10:14 +00:00
|
|
|
|
2014-05-02 00:43:34 +00:00
|
|
|
bool QueueRender(TA_context* ctx)
|
2013-12-19 17:10:14 +00:00
|
|
|
{
|
|
|
|
verify(ctx != 0);
|
|
|
|
|
2015-08-11 21:55:48 +00:00
|
|
|
//Try to limit speed to a "sane" level
|
|
|
|
//Speed is also limited via audio, but audio
|
|
|
|
//is sometimes not accurate enough (android, vista+)
|
2019-09-25 19:08:39 +00:00
|
|
|
u32 cycle_span = (u32)(sh4_sched_now64() - last_cycles2);
|
2020-03-28 16:58:01 +00:00
|
|
|
last_cycles2 = last_cycles1;
|
|
|
|
last_cycles1 = sh4_sched_now64();
|
2019-09-25 19:08:39 +00:00
|
|
|
double time_span = os_GetSeconds() - last_frame2;
|
|
|
|
last_frame2 = last_frame1;
|
|
|
|
last_frame1 = os_GetSeconds();
|
2015-08-11 21:55:48 +00:00
|
|
|
|
|
|
|
bool too_fast = (cycle_span / time_span) > (SH4_MAIN_CLOCK * 1.2);
|
2020-03-27 14:15:20 +00:00
|
|
|
|
|
|
|
// Vulkan: rtt frames seem to be discarded often
|
|
|
|
if (rqueue && (too_fast || ctx->rend.isRTT) && settings.pvr.SynchronousRender)
|
2015-08-11 21:55:48 +00:00
|
|
|
//wait for a frame if
|
|
|
|
// we have another one queue'd and
|
2019-09-25 19:08:39 +00:00
|
|
|
// sh4 run at > 120% over the last two frames
|
|
|
|
// and SynchronousRender is enabled
|
2015-08-11 21:55:48 +00:00
|
|
|
frame_finished.Wait();
|
|
|
|
|
2019-08-19 15:19:27 +00:00
|
|
|
if (rqueue)
|
|
|
|
{
|
2018-05-11 17:08:54 +00:00
|
|
|
tactx_Recycle(ctx);
|
|
|
|
fskip++;
|
|
|
|
return false;
|
2014-05-02 00:43:34 +00:00
|
|
|
}
|
|
|
|
|
2015-08-11 21:55:48 +00:00
|
|
|
frame_finished.Reset();
|
2013-12-19 17:10:14 +00:00
|
|
|
mtx_rqueue.Lock();
|
|
|
|
TA_context* old = rqueue;
|
|
|
|
rqueue=ctx;
|
|
|
|
mtx_rqueue.Unlock();
|
|
|
|
|
2014-05-02 00:43:34 +00:00
|
|
|
verify(!old);
|
|
|
|
|
|
|
|
return true;
|
2013-12-19 17:10:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
TA_context* DequeueRender()
|
|
|
|
{
|
|
|
|
mtx_rqueue.Lock();
|
|
|
|
TA_context* rv = rqueue;
|
|
|
|
mtx_rqueue.Unlock();
|
|
|
|
|
|
|
|
if (rv)
|
|
|
|
FrameCount++;
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2015-07-28 21:43:03 +00:00
|
|
|
bool rend_framePending() {
|
|
|
|
mtx_rqueue.Lock();
|
|
|
|
TA_context* rv = rqueue;
|
|
|
|
mtx_rqueue.Unlock();
|
|
|
|
|
|
|
|
return rv != 0;
|
|
|
|
}
|
|
|
|
|
2014-05-02 00:43:34 +00:00
|
|
|
void FinishRender(TA_context* ctx)
|
|
|
|
{
|
2019-02-06 18:57:13 +00:00
|
|
|
if (ctx != NULL)
|
2019-06-21 12:10:04 +00:00
|
|
|
{
|
|
|
|
verify(rqueue == ctx);
|
|
|
|
mtx_rqueue.Lock();
|
|
|
|
rqueue = NULL;
|
|
|
|
mtx_rqueue.Unlock();
|
|
|
|
|
2019-02-06 18:57:13 +00:00
|
|
|
tactx_Recycle(ctx);
|
2019-06-21 12:10:04 +00:00
|
|
|
}
|
2015-08-11 21:55:48 +00:00
|
|
|
frame_finished.Set();
|
2014-05-02 00:43:34 +00:00
|
|
|
}
|
|
|
|
|
2019-09-11 13:09:23 +00:00
|
|
|
static cMutex mtx_pool;
|
2013-12-19 17:10:14 +00:00
|
|
|
|
2019-09-11 13:09:23 +00:00
|
|
|
static vector<TA_context*> ctx_pool;
|
|
|
|
static vector<TA_context*> ctx_list;
|
2013-12-19 17:10:14 +00:00
|
|
|
|
|
|
|
TA_context* tactx_Alloc()
|
|
|
|
{
|
|
|
|
TA_context* rv = 0;
|
|
|
|
|
|
|
|
mtx_pool.Lock();
|
|
|
|
if (ctx_pool.size())
|
|
|
|
{
|
|
|
|
rv = ctx_pool[ctx_pool.size()-1];
|
|
|
|
ctx_pool.pop_back();
|
|
|
|
}
|
|
|
|
mtx_pool.Unlock();
|
|
|
|
|
|
|
|
if (!rv)
|
|
|
|
{
|
|
|
|
rv = new TA_context();
|
|
|
|
rv->Alloc();
|
|
|
|
}
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
|
|
|
void tactx_Recycle(TA_context* poped_ctx)
|
|
|
|
{
|
|
|
|
mtx_pool.Lock();
|
|
|
|
{
|
|
|
|
if (ctx_pool.size()>2)
|
|
|
|
{
|
|
|
|
poped_ctx->Free();
|
|
|
|
delete poped_ctx;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
poped_ctx->Reset();
|
|
|
|
ctx_pool.push_back(poped_ctx);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mtx_pool.Unlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
TA_context* tactx_Find(u32 addr, bool allocnew)
|
|
|
|
{
|
2013-12-25 17:47:51 +00:00
|
|
|
for (size_t i=0; i<ctx_list.size(); i++)
|
2013-12-19 17:10:14 +00:00
|
|
|
{
|
|
|
|
if (ctx_list[i]->Address==addr)
|
|
|
|
return ctx_list[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
if (allocnew)
|
|
|
|
{
|
|
|
|
TA_context* rv = tactx_Alloc();
|
|
|
|
rv->Address=addr;
|
|
|
|
ctx_list.push_back(rv);
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
else
|
2013-12-24 00:56:44 +00:00
|
|
|
{
|
2013-12-19 17:10:14 +00:00
|
|
|
return 0;
|
2013-12-24 00:56:44 +00:00
|
|
|
}
|
2013-12-19 17:10:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
TA_context* tactx_Pop(u32 addr)
|
|
|
|
{
|
2013-12-25 17:47:51 +00:00
|
|
|
for (size_t i=0; i<ctx_list.size(); i++)
|
2013-12-19 17:10:14 +00:00
|
|
|
{
|
|
|
|
if (ctx_list[i]->Address==addr)
|
|
|
|
{
|
|
|
|
TA_context* rv = ctx_list[i];
|
|
|
|
|
|
|
|
if (ta_ctx == rv)
|
|
|
|
SetCurrentTARC(TACTX_NONE);
|
|
|
|
|
|
|
|
ctx_list.erase(ctx_list.begin() + i);
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2018-10-29 19:02:12 +00:00
|
|
|
|
|
|
|
void tactx_Term()
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < ctx_list.size(); i++)
|
|
|
|
{
|
|
|
|
ctx_list[i]->Free();
|
|
|
|
delete ctx_list[i];
|
|
|
|
}
|
2019-02-25 16:52:53 +00:00
|
|
|
ctx_list.clear();
|
2018-10-29 19:02:12 +00:00
|
|
|
mtx_pool.Lock();
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < ctx_pool.size(); i++)
|
|
|
|
{
|
|
|
|
ctx_pool[i]->Free();
|
|
|
|
delete ctx_pool[i];
|
|
|
|
}
|
|
|
|
}
|
2019-02-25 16:52:53 +00:00
|
|
|
ctx_pool.clear();
|
2018-10-29 19:02:12 +00:00
|
|
|
mtx_pool.Unlock();
|
|
|
|
}
|