mirror of
https://github.com/RPCS3/rpcs3.git
synced 2025-07-12 17:58:37 +12:00
cellSyncQueuePeek
This commit is contained in:
parent
9b24ca7a28
commit
9b24db3a76
1 changed files with 102 additions and 2 deletions
|
@ -817,15 +817,115 @@ s32 cellSyncQueueTryPop(mem_ptr_t<CellSyncQueue> queue, u32 buffer_addr)
|
||||||
|
|
||||||
s32 cellSyncQueuePeek(mem_ptr_t<CellSyncQueue> queue, u32 buffer_addr)
|
s32 cellSyncQueuePeek(mem_ptr_t<CellSyncQueue> queue, u32 buffer_addr)
|
||||||
{
|
{
|
||||||
cellSync->Todo("cellSyncQueuePeek(queue_addr=0x%x, buffer_addr=0x%x)", queue.GetAddr(), buffer_addr);
|
cellSync->Log("cellSyncQueuePeek(queue_addr=0x%x, buffer_addr=0x%x)", queue.GetAddr(), buffer_addr);
|
||||||
|
|
||||||
|
if (!queue || !buffer_addr)
|
||||||
|
{
|
||||||
|
return CELL_SYNC_ERROR_NULL_POINTER;
|
||||||
|
}
|
||||||
|
if (queue.GetAddr() % 32)
|
||||||
|
{
|
||||||
|
return CELL_SYNC_ERROR_ALIGN;
|
||||||
|
}
|
||||||
|
|
||||||
|
const u32 size = (u32)queue->m_size;
|
||||||
|
const u32 depth = (u32)queue->m_depth;
|
||||||
|
if (((u32)queue->m_v1 & 0xffffff) > depth || ((u32)queue->m_v2 & 0xffffff) > depth)
|
||||||
|
{
|
||||||
|
cellSync->Error("cellSyncQueuePeek(queue_addr=0x%x): m_depth limit broken", queue.GetAddr());
|
||||||
|
Emu.Pause();
|
||||||
|
}
|
||||||
|
|
||||||
|
u32 position;
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
const u64 old_data = queue->m_data();
|
||||||
|
CellSyncQueue new_queue;
|
||||||
|
new_queue.m_data() = old_data;
|
||||||
|
|
||||||
|
const u32 v1 = (u32)new_queue.m_v1;
|
||||||
|
const u32 v2 = (u32)new_queue.m_v2;
|
||||||
|
if ((v1 >> 24) || ((v2 & 0xffffff) <= (v2 >> 24)))
|
||||||
|
{
|
||||||
|
std::this_thread::sleep_for(std::chrono::milliseconds(1)); // hack
|
||||||
|
if (Emu.IsStopped())
|
||||||
|
{
|
||||||
|
cellSync->Warning("cellSyncQueuePeek(queue_addr=0x%x) aborted", queue.GetAddr());
|
||||||
|
return CELL_OK;
|
||||||
|
}
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
new_queue.m_v1 = 0x1000000 | v1;
|
||||||
|
position = ((v1 & 0xffffff) + depth - (v2 & 0xffffff)) % depth;
|
||||||
|
if (InterlockedCompareExchange(&queue->m_data(), new_queue.m_data(), old_data) == old_data) break;
|
||||||
|
}
|
||||||
|
|
||||||
|
memcpy(Memory + buffer_addr, Memory + (u64)queue->m_addr + position * size, size);
|
||||||
|
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
const u64 old_data = queue->m_data();
|
||||||
|
CellSyncQueue new_queue;
|
||||||
|
new_queue.m_data() = old_data;
|
||||||
|
|
||||||
|
new_queue.m_v1 &= 0xffffff; // TODO: use InterlockedAnd() or something
|
||||||
|
if (InterlockedCompareExchange(&queue->m_data(), new_queue.m_data(), old_data) == old_data) break;
|
||||||
|
}
|
||||||
return CELL_OK;
|
return CELL_OK;
|
||||||
}
|
}
|
||||||
|
|
||||||
s32 cellSyncQueueTryPeek(mem_ptr_t<CellSyncQueue> queue, u32 buffer_addr)
|
s32 cellSyncQueueTryPeek(mem_ptr_t<CellSyncQueue> queue, u32 buffer_addr)
|
||||||
{
|
{
|
||||||
cellSync->Todo("cellSyncQueueTryPeek(queue_addr=0x%x, buffer_addr=0x%x)", queue.GetAddr(), buffer_addr);
|
cellSync->Log("cellSyncQueueTryPeek(queue_addr=0x%x, buffer_addr=0x%x)", queue.GetAddr(), buffer_addr);
|
||||||
|
|
||||||
|
if (!queue || !buffer_addr)
|
||||||
|
{
|
||||||
|
return CELL_SYNC_ERROR_NULL_POINTER;
|
||||||
|
}
|
||||||
|
if (queue.GetAddr() % 32)
|
||||||
|
{
|
||||||
|
return CELL_SYNC_ERROR_ALIGN;
|
||||||
|
}
|
||||||
|
|
||||||
|
const u32 size = (u32)queue->m_size;
|
||||||
|
const u32 depth = (u32)queue->m_depth;
|
||||||
|
if (((u32)queue->m_v1 & 0xffffff) > depth || ((u32)queue->m_v2 & 0xffffff) > depth)
|
||||||
|
{
|
||||||
|
cellSync->Error("cellSyncQueueTryPeek(queue_addr=0x%x): m_depth limit broken", queue.GetAddr());
|
||||||
|
Emu.Pause();
|
||||||
|
}
|
||||||
|
|
||||||
|
u32 position;
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
const u64 old_data = queue->m_data();
|
||||||
|
CellSyncQueue new_queue;
|
||||||
|
new_queue.m_data() = old_data;
|
||||||
|
|
||||||
|
const u32 v1 = (u32)new_queue.m_v1;
|
||||||
|
const u32 v2 = (u32)new_queue.m_v2;
|
||||||
|
if ((v1 >> 24) || ((v2 & 0xffffff) <= (v2 >> 24)))
|
||||||
|
{
|
||||||
|
return CELL_SYNC_ERROR_BUSY;
|
||||||
|
}
|
||||||
|
|
||||||
|
new_queue.m_v1 = 0x1000000 | v1;
|
||||||
|
position = ((v1 & 0xffffff) + depth - (v2 & 0xffffff)) % depth;
|
||||||
|
if (InterlockedCompareExchange(&queue->m_data(), new_queue.m_data(), old_data) == old_data) break;
|
||||||
|
}
|
||||||
|
|
||||||
|
memcpy(Memory + buffer_addr, Memory + (u64)queue->m_addr + position * size, size);
|
||||||
|
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
const u64 old_data = queue->m_data();
|
||||||
|
CellSyncQueue new_queue;
|
||||||
|
new_queue.m_data() = old_data;
|
||||||
|
|
||||||
|
new_queue.m_v1 &= 0xffffff; // TODO: use InterlockedAnd() or something
|
||||||
|
if (InterlockedCompareExchange(&queue->m_data(), new_queue.m_data(), old_data) == old_data) break;
|
||||||
|
}
|
||||||
return CELL_OK;
|
return CELL_OK;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue