RPCS3/rpcs3
1
0
Fork 0
mirror of https://github.com/RPCS3/rpcs3.git synced 2024-11-25 20:22:30 +01:00
Code Issues Releases Wiki Activity

rsx: Simplify FIFO concurrent access.

Browse Source
This commit is contained in:
kd-11 2022-09-09 22:04:32 +03:00 committed by kd-11
parent f319362e35
commit d686b48f65
1 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
rpcs3/Emu/RSX/RSXFIFO.cpp
View File

@ -119,14 +119,17 @@ namespace rsx
m_cache_size = put - m_cache_addr;
}
rsx::reservation_lock<true, 1> rsx_lock(addr1, m_cache_size, true);
// Atomic FIFO debug options
const bool force_cache_fill = g_cfg.core.rsx_fifo_accuracy == rsx_fifo_mode::atomic_ordered;
const bool strict_fetch_ordering = g_cfg.core.rsx_fifo_accuracy >= rsx_fifo_mode::atomic_ordered;
rsx::reservation_lock<true, 1> rsx_lock(addr1, m_cache_size, true);
const auto src = vm::_ptr<spu_rdata_t>(addr1);
// Find the next set bit after every iteration
u64 start_time = 0;
u32 bytes_read = 0;
// Find the next set bit after every iteration
for (int i = 0;; i = (std::countr_zero<u32>(utils::rol8(to_fetch, 0 - i - 1)) + i + 1) % 8)
{
// If a reservation is being updated, try to load another
@ -154,9 +157,10 @@ namespace rsx
if (!start_time)
{
if ((bytes_read << 1) >= m_cache_size)
if (bytes_read >= 256 && !force_cache_fill)
{
// Cut our losses, we have enough to work with.
// Cut our losses if we have something to work with.
// This is the first time falling out of the reservation loop above, so we have clean data with no holes.
m_cache_size = bytes_read;
break;
}
@ -183,7 +187,7 @@ namespace rsx
busy_wait(200);
}
if (g_cfg.core.rsx_fifo_accuracy >= rsx_fifo_mode::atomic_ordered)
if (strict_fetch_ordering)
{
i = (i - 1) % 8;
}