RPCS3/rpcs3
1
0
Fork 0
mirror of https://github.com/RPCS3/rpcs3.git synced 2026-10-12 02:09:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

rsx: Optimize recursion in the vertex program analyzer's instruction walk

Browse Source 
Avoid use of std::function for recursion, and ensure that std::stack is backed by a vector, instead of the default deque.
This commit is contained in:
Whatcookie
2026-10-06 10:00:59 +00:00
committed by GitHub
parent c7642cb875
commit 1b90d1c149
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
rpcs3/Emu/RSX/Program/ProgramStateCache.cpp
+4 -4
View File
@@ -142,14 +142,14 @@ vertex_program_utils::vertex_program_metadata vertex_program_utils::analyse_vert
bit_set<rsx::max_vertex_program_instructions> instructions_to_patch;
std::pair<u32, u32> instruction_range{ umax, 0 };
bool has_branch_instruction = false;
std::stack<u32> call_stack;
std::stack<u32, std::vector<u32>> call_stack;
D3 d3{};
D2 d2{};
D1 d1{};
D0 d0{};
std::function<void(u32, bool)> walk_function = [&](u32 start, bool fast_exit)
auto walk_function = [&](auto&& self, u32 start, bool fast_exit) -> void
{
u32 current_instruction = start;
std::set<u32> conditional_targets;
@@ -333,7 +333,7 @@ vertex_program_utils::vertex_program_metadata vertex_program_utils::analyse_vert
{
if (!result.instruction_mask[target])
{
walk_function(target, true);
self(self, target, true);
}
}
};
@@ -346,7 +346,7 @@ vertex_program_utils::vertex_program_metadata vertex_program_utils::analyse_vert
dump.close();
}
walk_function(entry, false);
walk_function(walk_function, entry, false);
const u32 instruction_count = (instruction_range.second - instruction_range.first + 1);
result.ucode_length = instruction_count * 16;