artemist/yuzu
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Merge pull request #12072 from FernandoS27/winter-is-2-seconds-too-soon

Browse source 
Buffer Cache: Eliminate clears on Indirect buffers
This commit is contained in:
liamwhite 2023-11-19 09:49:30 -05:00 committed by GitHub
parent feb60de5c3 ae60a5657e
commit efb3165e3d
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
2 changed files with 1 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
src/video_core/buffer_cache/buffer_cache.h
View file

@ -1192,11 +1192,6 @@ void BufferCache<P>::UpdateDrawIndirect() {
.size = static_cast<u32>(size), .size = static_cast<u32>(size),
.buffer_id = FindBuffer(*cpu_addr, static_cast<u32>(size)), .buffer_id = FindBuffer(*cpu_addr, static_cast<u32>(size)),
}; };
VAddr cpu_addr_start = Common::AlignDown(*cpu_addr, 64);
VAddr cpu_addr_end = Common::AlignUp(*cpu_addr + size, 64);
IntervalType interval{cpu_addr_start, cpu_addr_end};
ClearDownload(interval);
common_ranges.subtract(interval);
}; };
if (current_draw_indirect->include_count) { if (current_draw_indirect->include_count) {
update(current_draw_indirect->count_start_address, sizeof(u32), update(current_draw_indirect->count_start_address, sizeof(u32),

2
src/video_core/engines/maxwell_3d.cpp
View file

@ -268,7 +268,7 @@ size_t Maxwell3D::EstimateIndexBufferSize() {
std::numeric_limits<u32>::max()}; std::numeric_limits<u32>::max()};
const size_t byte_size = regs.index_buffer.FormatSizeInBytes(); const size_t byte_size = regs.index_buffer.FormatSizeInBytes();
const size_t log2_byte_size = Common::Log2Ceil64(byte_size); const size_t log2_byte_size = Common::Log2Ceil64(byte_size);
const size_t cap{GetMaxCurrentVertices() * 3 * byte_size}; const size_t cap{GetMaxCurrentVertices() * 4 * byte_size};
const size_t lower_cap = const size_t lower_cap =
std::min<size_t>(static_cast<size_t>(end_address - start_address), cap); std::min<size_t>(static_cast<size_t>(end_address - start_address), cap);
return std::min<size_t>( return std::min<size_t>(