|
|
|
@ -1,3 +1,4 @@ |
|
|
|
// SPDX-FileCopyrightText: Copyright 2025 Eden Emulator Project
|
|
|
|
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
|
|
|
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
|
|
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
|
|
|
@ -75,7 +76,7 @@ Status BufferQueueProducer::SetBufferCount(s32 buffer_count) { |
|
|
|
return Status::BadValue; |
|
|
|
} |
|
|
|
|
|
|
|
// There must be no dequeued buffers when changing the buffer count.
|
|
|
|
// There must be no dequeued buffers when changing the buffer count.
|
|
|
|
for (s32 s{}; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) { |
|
|
|
if (slots[s].buffer_state == BufferState::Dequeued) { |
|
|
|
LOG_ERROR(Service_Nvnflinger, "buffer owned by producer"); |
|
|
|
@ -96,8 +97,8 @@ Status BufferQueueProducer::SetBufferCount(s32 buffer_count) { |
|
|
|
return Status::BadValue; |
|
|
|
} |
|
|
|
|
|
|
|
// Here we are guaranteed that the producer doesn't have any dequeued buffers and will
|
|
|
|
// release all of its buffer references.
|
|
|
|
// Here we are guaranteed that the producer doesn't have any dequeued buffers and will
|
|
|
|
// release all of its buffer references.
|
|
|
|
if (core->GetPreallocatedBufferCountLocked() <= 0) { |
|
|
|
core->FreeAllBuffersLocked(); |
|
|
|
} |
|
|
|
@ -108,7 +109,7 @@ Status BufferQueueProducer::SetBufferCount(s32 buffer_count) { |
|
|
|
listener = core->consumer_listener; |
|
|
|
} |
|
|
|
|
|
|
|
// Call back without lock held
|
|
|
|
// Call back without lock held
|
|
|
|
if (listener != nullptr) { |
|
|
|
listener->OnBuffersReleased(); |
|
|
|
} |
|
|
|
@ -134,7 +135,7 @@ Status BufferQueueProducer::WaitForFreeSlotThenRelock(bool async, s32* found, St |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
// Free up any buffers that are in slots beyond the max buffer count
|
|
|
|
// Free up any buffers that are in slots beyond the max buffer count
|
|
|
|
for (s32 s = max_buffer_count; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) { |
|
|
|
ASSERT(slots[s].buffer_state == BufferState::Free); |
|
|
|
if (slots[s].graphic_buffer != nullptr && slots[s].buffer_state == BufferState::Free && |
|
|
|
@ -144,7 +145,7 @@ Status BufferQueueProducer::WaitForFreeSlotThenRelock(bool async, s32* found, St |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
// Look for a free buffer to give to the client
|
|
|
|
// Look for a free buffer to give to the client
|
|
|
|
*found = BufferQueueCore::INVALID_BUFFER_SLOT; |
|
|
|
s32 dequeued_count{}; |
|
|
|
s32 acquired_count{}; |
|
|
|
@ -169,16 +170,16 @@ Status BufferQueueProducer::WaitForFreeSlotThenRelock(bool async, s32* found, St |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
// Producers are not allowed to dequeue more than one buffer if they did not set a buffer
|
|
|
|
// count
|
|
|
|
// Producers are not allowed to dequeue more than one buffer if they did not set a buffer
|
|
|
|
// count
|
|
|
|
if (!core->override_max_buffer_count && dequeued_count) { |
|
|
|
LOG_ERROR(Service_Nvnflinger, |
|
|
|
"can't dequeue multiple buffers without setting the buffer count"); |
|
|
|
return Status::InvalidOperation; |
|
|
|
} |
|
|
|
|
|
|
|
// See whether a buffer has been queued since the last SetBufferCount so we know whether to
|
|
|
|
// perform the min undequeued buffers check below
|
|
|
|
// See whether a buffer has been queued since the last SetBufferCount so we know whether to
|
|
|
|
// perform the min undequeued buffers check below
|
|
|
|
if (core->buffer_has_been_queued) { |
|
|
|
// Make sure the producer is not trying to dequeue more buffers than allowed
|
|
|
|
const s32 new_undequeued_count = max_buffer_count - (dequeued_count + 1); |
|
|
|
@ -191,16 +192,16 @@ Status BufferQueueProducer::WaitForFreeSlotThenRelock(bool async, s32* found, St |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
// If we disconnect and reconnect quickly, we can be in a state where our slots are empty
|
|
|
|
// but we have many buffers in the queue. This can cause us to run out of memory if we
|
|
|
|
// outrun the consumer. Wait here if it looks like we have too many buffers queued up.
|
|
|
|
// If we disconnect and reconnect quickly, we can be in a state where our slots are empty
|
|
|
|
// but we have many buffers in the queue. This can cause us to run out of memory if we
|
|
|
|
// outrun the consumer. Wait here if it looks like we have too many buffers queued up.
|
|
|
|
const bool too_many_buffers = core->queue.size() > static_cast<size_t>(max_buffer_count); |
|
|
|
if (too_many_buffers) { |
|
|
|
LOG_ERROR(Service_Nvnflinger, "queue size is {}, waiting", core->queue.size()); |
|
|
|
} |
|
|
|
|
|
|
|
// If no buffer is found, or if the queue has too many buffers outstanding, wait for a
|
|
|
|
// buffer to be acquired or released, or for the max buffer count to change.
|
|
|
|
// If no buffer is found, or if the queue has too many buffers outstanding, wait for a
|
|
|
|
// buffer to be acquired or released, or for the max buffer count to change.
|
|
|
|
try_again = (*found == BufferQueueCore::INVALID_BUFFER_SLOT) || too_many_buffers; |
|
|
|
if (try_again) { |
|
|
|
// Return an error if we're in non-blocking mode (producer and consumer are controlled
|
|
|
|
@ -240,7 +241,7 @@ Status BufferQueueProducer::DequeueBuffer(s32* out_slot, Fence* out_fence, bool |
|
|
|
format = core->default_buffer_format; |
|
|
|
} |
|
|
|
|
|
|
|
// Enable the usage bits the consumer requested
|
|
|
|
// Enable the usage bits the consumer requested
|
|
|
|
usage |= core->consumer_usage_bit; |
|
|
|
|
|
|
|
s32 found{}; |
|
|
|
@ -249,7 +250,7 @@ Status BufferQueueProducer::DequeueBuffer(s32* out_slot, Fence* out_fence, bool |
|
|
|
return status; |
|
|
|
} |
|
|
|
|
|
|
|
// This should not happen
|
|
|
|
// This should not happen
|
|
|
|
if (found == BufferQueueCore::INVALID_BUFFER_SLOT) { |
|
|
|
LOG_ERROR(Service_Nvnflinger, "no available buffer slots"); |
|
|
|
return Status::Busy; |
|
|
|
@ -361,7 +362,7 @@ Status BufferQueueProducer::DetachNextBuffer(std::shared_ptr<GraphicBuffer>* out |
|
|
|
return Status::NoInit; |
|
|
|
} |
|
|
|
|
|
|
|
// Find the oldest valid slot
|
|
|
|
// Find the oldest valid slot
|
|
|
|
int found = BufferQueueCore::INVALID_BUFFER_SLOT; |
|
|
|
for (int s = 0; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) { |
|
|
|
if (slots[s].buffer_state == BufferState::Free && slots[s].graphic_buffer != nullptr) { |
|
|
|
@ -407,7 +408,7 @@ Status BufferQueueProducer::AttachBuffer(s32* out_slot, |
|
|
|
return status; |
|
|
|
} |
|
|
|
|
|
|
|
// This should not happen
|
|
|
|
// This should not happen
|
|
|
|
if (found == BufferQueueCore::INVALID_BUFFER_SLOT) { |
|
|
|
LOG_ERROR(Service_Nvnflinger, "No available buffer slots"); |
|
|
|
return Status::Busy; |
|
|
|
@ -530,11 +531,6 @@ Status BufferQueueProducer::QueueBuffer(s32 slot, const QueueBufferInput& input, |
|
|
|
item.is_droppable = core->dequeue_buffer_cannot_block || async; |
|
|
|
item.swap_interval = swap_interval; |
|
|
|
|
|
|
|
position = (position + 1) % 8; |
|
|
|
core->history[position] = {.frame_number = core->frame_counter, |
|
|
|
.queue_time = slots[slot].queue_time, |
|
|
|
.state = BufferState::Queued}; |
|
|
|
|
|
|
|
sticky_transform = sticky_transform_; |
|
|
|
|
|
|
|
if (core->queue.empty()) { |
|
|
|
@ -551,8 +547,17 @@ Status BufferQueueProducer::QueueBuffer(s32 slot, const QueueBufferInput& input, |
|
|
|
// mark it as freed
|
|
|
|
if (core->StillTracking(*front)) { |
|
|
|
slots[front->slot].buffer_state = BufferState::Free; |
|
|
|
// Reset the frame number of the freed buffer so that it is the first in line to
|
|
|
|
// be dequeued again
|
|
|
|
|
|
|
|
// Mark tracked buffer history records as free
|
|
|
|
for (auto& buffer_history_record : core->buffer_history) { |
|
|
|
if (buffer_history_record.frame_number == front->frame_number) { |
|
|
|
buffer_history_record.state = BufferState::Free; |
|
|
|
break; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
// Reset the frame number of the freed buffer so that it is the first in line to
|
|
|
|
// be dequeued again
|
|
|
|
slots[front->slot].frame_number = 0; |
|
|
|
} |
|
|
|
// Overwrite the droppable buffer with the incoming one
|
|
|
|
@ -564,22 +569,23 @@ Status BufferQueueProducer::QueueBuffer(s32 slot, const QueueBufferInput& input, |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
core->PushHistory(core->frame_counter, slots[slot].queue_time, slots[slot].presentation_time, BufferState::Queued); |
|
|
|
core->buffer_has_been_queued = true; |
|
|
|
core->SignalDequeueCondition(); |
|
|
|
output->Inflate(core->default_width, core->default_height, core->transform_hint, |
|
|
|
static_cast<u32>(core->queue.size())); |
|
|
|
|
|
|
|
// Take a ticket for the callback functions
|
|
|
|
// Take a ticket for the callback functions
|
|
|
|
callback_ticket = next_callback_ticket++; |
|
|
|
} |
|
|
|
|
|
|
|
// Don't send the GraphicBuffer through the callback, and don't send the slot number, since the
|
|
|
|
// consumer shouldn't need it
|
|
|
|
// Don't send the GraphicBuffer through the callback, and don't send the slot number, since the
|
|
|
|
// consumer shouldn't need it
|
|
|
|
item.graphic_buffer.reset(); |
|
|
|
item.slot = BufferItem::INVALID_BUFFER_SLOT; |
|
|
|
|
|
|
|
// Call back without the main BufferQueue lock held, but with the callback lock held so we can
|
|
|
|
// ensure that callbacks occur in order
|
|
|
|
// Call back without the main BufferQueue lock held, but with the callback lock held so we can
|
|
|
|
// ensure that callbacks occur in order
|
|
|
|
{ |
|
|
|
std::scoped_lock lock{callback_mutex}; |
|
|
|
while (callback_ticket != current_callback_ticket) { |
|
|
|
@ -797,8 +803,8 @@ Status BufferQueueProducer::SetPreallocatedBuffer(s32 slot, |
|
|
|
slots[slot].graphic_buffer = std::make_shared<GraphicBuffer>(nvmap, buffer); |
|
|
|
slots[slot].frame_number = 0; |
|
|
|
|
|
|
|
// Most games preallocate a buffer and pass a valid buffer here. However, it is possible for
|
|
|
|
// this to be called with an empty buffer, Naruto Ultimate Ninja Storm is a game that does this.
|
|
|
|
// Most games preallocate a buffer and pass a valid buffer here. However, it is possible for
|
|
|
|
// this to be called with an empty buffer, Naruto Ultimate Ninja Storm is a game that does this.
|
|
|
|
if (buffer) { |
|
|
|
slots[slot].is_preallocated = true; |
|
|
|
|
|
|
|
@ -938,33 +944,46 @@ void BufferQueueProducer::Transact(u32 code, std::span<const u8> parcel_data, |
|
|
|
break; |
|
|
|
} |
|
|
|
case TransactionId::GetBufferHistory: { |
|
|
|
LOG_WARNING(Service_Nvnflinger, "called, transaction=GetBufferHistory"); |
|
|
|
LOG_DEBUG(Service_Nvnflinger, "called, transaction=GetBufferHistory"); |
|
|
|
|
|
|
|
std::scoped_lock lock{core->mutex}; |
|
|
|
|
|
|
|
auto buffer_history_count = (std::min)(parcel_in.Read<s32>(), (s32)core->history.size()); |
|
|
|
|
|
|
|
if (buffer_history_count <= 0) { |
|
|
|
const s32 request = parcel_in.Read<s32>(); |
|
|
|
if (request <= 0) { |
|
|
|
parcel_out.Write(Status::BadValue); |
|
|
|
parcel_out.Write<s32>(0); |
|
|
|
status = Status::None; |
|
|
|
break; |
|
|
|
} |
|
|
|
|
|
|
|
auto info = new BufferInfo[buffer_history_count]; |
|
|
|
auto pos = position; |
|
|
|
for (int i = 0; i < buffer_history_count; i++) { |
|
|
|
info[i] = core->history[(pos - i) % core->history.size()]; |
|
|
|
LOG_WARNING(Service_Nvnflinger, "frame_number={}, state={}", |
|
|
|
core->history[(pos - i) % core->history.size()].frame_number, |
|
|
|
(u32)core->history[(pos - i) % core->history.size()].state); |
|
|
|
pos--; |
|
|
|
constexpr u32 history_max = BufferQueueCore::BUFFER_HISTORY_SIZE; |
|
|
|
std::array<BufferHistoryInfo, history_max> buffer_history_snapshot{}; |
|
|
|
s32 valid_index{}; |
|
|
|
{ |
|
|
|
std::scoped_lock lk(core->mutex); |
|
|
|
|
|
|
|
const u32 current_history_pos = core->buffer_history_pos; |
|
|
|
u32 index_reversed{}; |
|
|
|
for (u32 i = 0; i < history_max; ++i) { |
|
|
|
// Wrap values backwards e.g. 7, 6, 5, etc. in the range of 0-7
|
|
|
|
index_reversed = (current_history_pos + history_max - i) % history_max; |
|
|
|
const auto& current_history_buffer = core->buffer_history[index_reversed]; |
|
|
|
|
|
|
|
// Here we use the frame number as a terminator.
|
|
|
|
// Because a buffer without frame_number is not considered complete
|
|
|
|
if (current_history_buffer.frame_number == 0) { |
|
|
|
break; |
|
|
|
} |
|
|
|
|
|
|
|
buffer_history_snapshot[valid_index] = current_history_buffer; |
|
|
|
++valid_index; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
const s32 limit = std::min(request, valid_index); |
|
|
|
parcel_out.Write(Status::NoError); |
|
|
|
parcel_out.Write(buffer_history_count); |
|
|
|
parcel_out.WriteFlattenedObject<BufferInfo>(info); |
|
|
|
status = Status::None; |
|
|
|
parcel_out.Write<s32>(limit); |
|
|
|
for (s32 i = 0; i < limit; ++i) { |
|
|
|
parcel_out.Write(buffer_history_snapshot[i]); |
|
|
|
} |
|
|
|
|
|
|
|
break; |
|
|
|
} |
|
|
|
default: |
|
|
|
@ -972,9 +991,7 @@ void BufferQueueProducer::Transact(u32 code, std::span<const u8> parcel_data, |
|
|
|
break; |
|
|
|
} |
|
|
|
|
|
|
|
if (status != Status::None) { |
|
|
|
parcel_out.Write(status); |
|
|
|
} |
|
|
|
parcel_out.Write(status); |
|
|
|
|
|
|
|
const auto serialized = parcel_out.Serialize(); |
|
|
|
std::memcpy(parcel_reply.data(), serialized.data(), |
|
|
|
|