early-access version 1349
This commit is contained in:
parent
861118690c
commit
843abfbd8d
3 changed files with 19 additions and 10 deletions
|
@ -1,7 +1,7 @@
|
||||||
yuzu emulator early access
|
yuzu emulator early access
|
||||||
=============
|
=============
|
||||||
|
|
||||||
This is the source code for early-access 1348.
|
This is the source code for early-access 1349.
|
||||||
|
|
||||||
## Legal Notice
|
## Legal Notice
|
||||||
|
|
||||||
|
|
|
@ -130,10 +130,7 @@ StagingBufferRef StagingBufferPool::Request(size_t size, MemoryUsage usage) {
|
||||||
if (usage == MemoryUsage::Upload && size <= MAX_STREAM_BUFFER_REQUEST_SIZE) {
|
if (usage == MemoryUsage::Upload && size <= MAX_STREAM_BUFFER_REQUEST_SIZE) {
|
||||||
return GetStreamBuffer(size);
|
return GetStreamBuffer(size);
|
||||||
}
|
}
|
||||||
if (const std::optional<StagingBufferRef> ref = TryGetReservedBuffer(size, usage)) {
|
return GetStagingBuffer(size, usage);
|
||||||
return *ref;
|
|
||||||
}
|
|
||||||
return CreateStagingBuffer(size, usage);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
void StagingBufferPool::TickFrame() {
|
void StagingBufferPool::TickFrame() {
|
||||||
|
@ -145,17 +142,20 @@ void StagingBufferPool::TickFrame() {
|
||||||
}
|
}
|
||||||
|
|
||||||
StagingBufferRef StagingBufferPool::GetStreamBuffer(size_t size) {
|
StagingBufferRef StagingBufferPool::GetStreamBuffer(size_t size) {
|
||||||
|
for (size_t region = Region(free_iterator) + 1,
|
||||||
|
region_end = std::min(Region(iterator + size) + 1, NUM_SYNCS);
|
||||||
|
region < region_end; ++region) {
|
||||||
|
// If we'd have to wait, get a staging buffer to avoid waiting
|
||||||
|
if (!scheduler.IsFree(sync_ticks[region])) {
|
||||||
|
return GetStagingBuffer(size, MemoryUsage::Upload);
|
||||||
|
}
|
||||||
|
}
|
||||||
for (size_t region = Region(used_iterator), region_end = Region(iterator); region < region_end;
|
for (size_t region = Region(used_iterator), region_end = Region(iterator); region < region_end;
|
||||||
++region) {
|
++region) {
|
||||||
sync_ticks[region] = scheduler.CurrentTick();
|
sync_ticks[region] = scheduler.CurrentTick();
|
||||||
}
|
}
|
||||||
used_iterator = iterator;
|
used_iterator = iterator;
|
||||||
|
|
||||||
for (size_t region = Region(free_iterator) + 1,
|
|
||||||
region_end = std::min(Region(iterator + size) + 1, NUM_SYNCS);
|
|
||||||
region < region_end; ++region) {
|
|
||||||
scheduler.Wait(sync_ticks[region]);
|
|
||||||
}
|
|
||||||
if (iterator + size > free_iterator) {
|
if (iterator + size > free_iterator) {
|
||||||
free_iterator = iterator + size;
|
free_iterator = iterator + size;
|
||||||
}
|
}
|
||||||
|
@ -180,6 +180,13 @@ StagingBufferRef StagingBufferPool::GetStreamBuffer(size_t size) {
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
StagingBufferRef StagingBufferPool::GetStagingBuffer(size_t size, MemoryUsage usage) {
|
||||||
|
if (const std::optional<StagingBufferRef> ref = TryGetReservedBuffer(size, usage)) {
|
||||||
|
return *ref;
|
||||||
|
}
|
||||||
|
return CreateStagingBuffer(size, usage);
|
||||||
|
}
|
||||||
|
|
||||||
std::optional<StagingBufferRef> StagingBufferPool::TryGetReservedBuffer(size_t size,
|
std::optional<StagingBufferRef> StagingBufferPool::TryGetReservedBuffer(size_t size,
|
||||||
MemoryUsage usage) {
|
MemoryUsage usage) {
|
||||||
StagingBuffers& cache_level = GetCache(usage)[Common::Log2Ceil64(size)];
|
StagingBuffers& cache_level = GetCache(usage)[Common::Log2Ceil64(size)];
|
||||||
|
|
|
@ -67,6 +67,8 @@ private:
|
||||||
|
|
||||||
StagingBufferRef GetStreamBuffer(size_t size);
|
StagingBufferRef GetStreamBuffer(size_t size);
|
||||||
|
|
||||||
|
StagingBufferRef GetStagingBuffer(size_t size, MemoryUsage usage);
|
||||||
|
|
||||||
std::optional<StagingBufferRef> TryGetReservedBuffer(size_t size, MemoryUsage usage);
|
std::optional<StagingBufferRef> TryGetReservedBuffer(size_t size, MemoryUsage usage);
|
||||||
|
|
||||||
StagingBufferRef CreateStagingBuffer(size_t size, MemoryUsage usage);
|
StagingBufferRef CreateStagingBuffer(size_t size, MemoryUsage usage);
|
||||||
|
|
Loading…
Reference in a new issue