[core/nvnflinger] Rewrite GetBufferHistory
Some checks failed
eden-license / license-header (pull_request) Failing after 38s
Some checks failed
eden-license / license-header (pull_request) Failing after 38s
This commit is contained in:
parent
6699361b7e
commit
e3ad859786
6 changed files with 109 additions and 80 deletions
|
@ -1,3 +1,4 @@
|
||||||
|
// SPDX-FileCopyrightText: Copyright 2025 Eden Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
||||||
// SPDX-License-Identifier: GPL-3.0-or-later
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
||||||
|
@ -97,18 +98,18 @@ Status BufferQueueConsumer::AcquireBuffer(BufferItem* out_buffer,
|
||||||
slots[slot].needs_cleanup_on_release = false;
|
slots[slot].needs_cleanup_on_release = false;
|
||||||
slots[slot].buffer_state = BufferState::Acquired;
|
slots[slot].buffer_state = BufferState::Acquired;
|
||||||
|
|
||||||
|
// Mark tracked buffer history records as acquired
|
||||||
|
for (auto& buffer_history_record : core->buffer_history) {
|
||||||
|
if (buffer_history_record.frame_number == core->frame_counter) {
|
||||||
|
buffer_history_record.state = BufferState::Acquired;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// TODO: for now, avoid resetting the fence, so that when we next return this
|
// TODO: for now, avoid resetting the fence, so that when we next return this
|
||||||
// slot to the producer, it will wait for the fence to pass. We should fix this
|
// slot to the producer, it will wait for the fence to pass. We should fix this
|
||||||
// by properly waiting for the fence in the BufferItemConsumer.
|
// by properly waiting for the fence in the BufferItemConsumer.
|
||||||
// slots[slot].fence = Fence::NoFence();
|
// slots[slot].fence = Fence::NoFence();
|
||||||
|
|
||||||
const auto target_frame_number = slots[slot].frame_number;
|
|
||||||
for (size_t i = 0; i < core->history.size(); i++) {
|
|
||||||
if (core->history[i].frame_number == target_frame_number) {
|
|
||||||
core->history[i].state = BufferState::Acquired;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// If the buffer has previously been acquired by the consumer, set graphic_buffer to nullptr to
|
// If the buffer has previously been acquired by the consumer, set graphic_buffer to nullptr to
|
||||||
|
|
|
@ -1,3 +1,4 @@
|
||||||
|
// SPDX-FileCopyrightText: Copyright 2025 Eden Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
||||||
// SPDX-License-Identifier: GPL-3.0-or-later
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
||||||
|
@ -10,12 +11,19 @@
|
||||||
|
|
||||||
namespace Service::android {
|
namespace Service::android {
|
||||||
|
|
||||||
BufferQueueCore::BufferQueueCore() {
|
BufferQueueCore::BufferQueueCore() = default;
|
||||||
history.resize(8);
|
|
||||||
};
|
|
||||||
|
|
||||||
BufferQueueCore::~BufferQueueCore() = default;
|
BufferQueueCore::~BufferQueueCore() = default;
|
||||||
|
|
||||||
|
void BufferQueueCore::PushHistory(u64 frame_number, s64 queue_time, s64 presentation_time, BufferState state) {
|
||||||
|
buffer_history_pos = (buffer_history_pos + 1) % BUFFER_HISTORY_SIZE;
|
||||||
|
buffer_history[buffer_history_pos] = BufferHistoryInfo{
|
||||||
|
.frame_number = frame_number,
|
||||||
|
.queue_time = queue_time,
|
||||||
|
.presentation_time = presentation_time,
|
||||||
|
.state = state,
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
void BufferQueueCore::SignalDequeueCondition() {
|
void BufferQueueCore::SignalDequeueCondition() {
|
||||||
dequeue_possible.store(true);
|
dequeue_possible.store(true);
|
||||||
dequeue_condition.notify_all();
|
dequeue_condition.notify_all();
|
||||||
|
@ -47,7 +55,7 @@ s32 BufferQueueCore::GetMinMaxBufferCountLocked(bool async) const {
|
||||||
|
|
||||||
s32 BufferQueueCore::GetMaxBufferCountLocked(bool async) const {
|
s32 BufferQueueCore::GetMaxBufferCountLocked(bool async) const {
|
||||||
const auto min_buffer_count = GetMinMaxBufferCountLocked(async);
|
const auto min_buffer_count = GetMinMaxBufferCountLocked(async);
|
||||||
auto max_buffer_count = (std::max)(default_max_buffer_count, min_buffer_count);
|
auto max_buffer_count = std::max(default_max_buffer_count, min_buffer_count);
|
||||||
|
|
||||||
if (override_max_buffer_count != 0) {
|
if (override_max_buffer_count != 0) {
|
||||||
ASSERT(override_max_buffer_count >= min_buffer_count);
|
ASSERT(override_max_buffer_count >= min_buffer_count);
|
||||||
|
|
|
@ -1,3 +1,4 @@
|
||||||
|
// SPDX-FileCopyrightText: Copyright 2025 Eden Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
||||||
// SPDX-License-Identifier: GPL-3.0-or-later
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
||||||
|
@ -15,6 +16,7 @@
|
||||||
|
|
||||||
#include "core/hle/service/nvnflinger/buffer_item.h"
|
#include "core/hle/service/nvnflinger/buffer_item.h"
|
||||||
#include "core/hle/service/nvnflinger/buffer_queue_defs.h"
|
#include "core/hle/service/nvnflinger/buffer_queue_defs.h"
|
||||||
|
#include "core/hle/service/nvnflinger/buffer_slot.h"
|
||||||
#include "core/hle/service/nvnflinger/pixel_format.h"
|
#include "core/hle/service/nvnflinger/pixel_format.h"
|
||||||
#include "core/hle/service/nvnflinger/status.h"
|
#include "core/hle/service/nvnflinger/status.h"
|
||||||
#include "core/hle/service/nvnflinger/window.h"
|
#include "core/hle/service/nvnflinger/window.h"
|
||||||
|
@ -23,22 +25,19 @@ namespace Service::android {
|
||||||
|
|
||||||
#ifdef _MSC_VER
|
#ifdef _MSC_VER
|
||||||
#pragma pack(push, 1)
|
#pragma pack(push, 1)
|
||||||
|
struct BufferHistoryInfo {
|
||||||
|
#elif defined(__GNUC__) || defined(__clang__)
|
||||||
|
struct __attribute__((packed)) BufferHistoryInfo {
|
||||||
#endif
|
#endif
|
||||||
struct BufferInfo {
|
|
||||||
u64 frame_number;
|
u64 frame_number;
|
||||||
s64 queue_time;
|
s64 queue_time;
|
||||||
s64 presentation_time{};
|
s64 presentation_time;
|
||||||
BufferState state{BufferState::Free};
|
BufferState state;
|
||||||
}
|
};
|
||||||
#if defined(__GNUC__) || defined(__clang__)
|
|
||||||
__attribute__((packed))
|
|
||||||
#endif
|
|
||||||
;
|
|
||||||
#ifdef _MSC_VER
|
#ifdef _MSC_VER
|
||||||
#pragma pack(pop)
|
#pragma pack(pop)
|
||||||
#endif
|
#endif
|
||||||
static_assert(sizeof(BufferInfo) == 0x1C,
|
static_assert(sizeof(BufferHistoryInfo) == 0x1C, "BufferHistoryInfo must be 28 bytes");
|
||||||
"BufferInfo is an invalid size");
|
|
||||||
|
|
||||||
class IConsumerListener;
|
class IConsumerListener;
|
||||||
class IProducerListener;
|
class IProducerListener;
|
||||||
|
@ -49,10 +48,13 @@ class BufferQueueCore final {
|
||||||
|
|
||||||
public:
|
public:
|
||||||
static constexpr s32 INVALID_BUFFER_SLOT = BufferItem::INVALID_BUFFER_SLOT;
|
static constexpr s32 INVALID_BUFFER_SLOT = BufferItem::INVALID_BUFFER_SLOT;
|
||||||
|
static constexpr u32 BUFFER_HISTORY_SIZE = 8;
|
||||||
|
|
||||||
BufferQueueCore();
|
BufferQueueCore();
|
||||||
~BufferQueueCore();
|
~BufferQueueCore();
|
||||||
|
|
||||||
|
void PushHistory(u64 frame_number, s64 queue_time, s64 presentation_time, BufferState state);
|
||||||
|
|
||||||
private:
|
private:
|
||||||
void SignalDequeueCondition();
|
void SignalDequeueCondition();
|
||||||
bool WaitForDequeueCondition(std::unique_lock<std::mutex>& lk);
|
bool WaitForDequeueCondition(std::unique_lock<std::mutex>& lk);
|
||||||
|
@ -88,11 +90,11 @@ private:
|
||||||
const s32 max_acquired_buffer_count{}; // This is always zero on HOS
|
const s32 max_acquired_buffer_count{}; // This is always zero on HOS
|
||||||
bool buffer_has_been_queued{};
|
bool buffer_has_been_queued{};
|
||||||
u64 frame_counter{};
|
u64 frame_counter{};
|
||||||
|
std::array<BufferHistoryInfo, BUFFER_HISTORY_SIZE> buffer_history{};
|
||||||
|
u32 buffer_history_pos{BUFFER_HISTORY_SIZE-1};
|
||||||
u32 transform_hint{};
|
u32 transform_hint{};
|
||||||
bool is_allocating{};
|
bool is_allocating{};
|
||||||
mutable std::condition_variable_any is_allocating_condition;
|
mutable std::condition_variable_any is_allocating_condition;
|
||||||
|
|
||||||
std::vector<BufferInfo> history{8};
|
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace Service::android
|
} // namespace Service::android
|
||||||
|
|
|
@ -1,3 +1,4 @@
|
||||||
|
// SPDX-FileCopyrightText: Copyright 2025 Eden Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
||||||
// SPDX-License-Identifier: GPL-3.0-or-later
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
||||||
|
@ -75,7 +76,7 @@ Status BufferQueueProducer::SetBufferCount(s32 buffer_count) {
|
||||||
return Status::BadValue;
|
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) {
|
for (s32 s{}; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) {
|
||||||
if (slots[s].buffer_state == BufferState::Dequeued) {
|
if (slots[s].buffer_state == BufferState::Dequeued) {
|
||||||
LOG_ERROR(Service_Nvnflinger, "buffer owned by producer");
|
LOG_ERROR(Service_Nvnflinger, "buffer owned by producer");
|
||||||
|
@ -96,8 +97,8 @@ Status BufferQueueProducer::SetBufferCount(s32 buffer_count) {
|
||||||
return Status::BadValue;
|
return Status::BadValue;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Here we are guaranteed that the producer doesn't have any dequeued buffers and will
|
// Here we are guaranteed that the producer doesn't have any dequeued buffers and will
|
||||||
// release all of its buffer references.
|
// release all of its buffer references.
|
||||||
if (core->GetPreallocatedBufferCountLocked() <= 0) {
|
if (core->GetPreallocatedBufferCountLocked() <= 0) {
|
||||||
core->FreeAllBuffersLocked();
|
core->FreeAllBuffersLocked();
|
||||||
}
|
}
|
||||||
|
@ -108,7 +109,7 @@ Status BufferQueueProducer::SetBufferCount(s32 buffer_count) {
|
||||||
listener = core->consumer_listener;
|
listener = core->consumer_listener;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Call back without lock held
|
// Call back without lock held
|
||||||
if (listener != nullptr) {
|
if (listener != nullptr) {
|
||||||
listener->OnBuffersReleased();
|
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) {
|
for (s32 s = max_buffer_count; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) {
|
||||||
ASSERT(slots[s].buffer_state == BufferState::Free);
|
ASSERT(slots[s].buffer_state == BufferState::Free);
|
||||||
if (slots[s].graphic_buffer != nullptr && 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;
|
*found = BufferQueueCore::INVALID_BUFFER_SLOT;
|
||||||
s32 dequeued_count{};
|
s32 dequeued_count{};
|
||||||
s32 acquired_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
|
// Producers are not allowed to dequeue more than one buffer if they did not set a buffer
|
||||||
// count
|
// count
|
||||||
if (!core->override_max_buffer_count && dequeued_count) {
|
if (!core->override_max_buffer_count && dequeued_count) {
|
||||||
LOG_ERROR(Service_Nvnflinger,
|
LOG_ERROR(Service_Nvnflinger,
|
||||||
"can't dequeue multiple buffers without setting the buffer count");
|
"can't dequeue multiple buffers without setting the buffer count");
|
||||||
return Status::InvalidOperation;
|
return Status::InvalidOperation;
|
||||||
}
|
}
|
||||||
|
|
||||||
// See whether a buffer has been queued since the last SetBufferCount so we know whether to
|
// See whether a buffer has been queued since the last SetBufferCount so we know whether to
|
||||||
// perform the min undequeued buffers check below
|
// perform the min undequeued buffers check below
|
||||||
if (core->buffer_has_been_queued) {
|
if (core->buffer_has_been_queued) {
|
||||||
// Make sure the producer is not trying to dequeue more buffers than allowed
|
// Make sure the producer is not trying to dequeue more buffers than allowed
|
||||||
const s32 new_undequeued_count = max_buffer_count - (dequeued_count + 1);
|
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
|
// 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
|
// 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.
|
// 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);
|
const bool too_many_buffers = core->queue.size() > static_cast<size_t>(max_buffer_count);
|
||||||
if (too_many_buffers) {
|
if (too_many_buffers) {
|
||||||
LOG_ERROR(Service_Nvnflinger, "queue size is {}, waiting", core->queue.size());
|
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
|
// 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.
|
// buffer to be acquired or released, or for the max buffer count to change.
|
||||||
try_again = (*found == BufferQueueCore::INVALID_BUFFER_SLOT) || too_many_buffers;
|
try_again = (*found == BufferQueueCore::INVALID_BUFFER_SLOT) || too_many_buffers;
|
||||||
if (try_again) {
|
if (try_again) {
|
||||||
// Return an error if we're in non-blocking mode (producer and consumer are controlled
|
// 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;
|
format = core->default_buffer_format;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Enable the usage bits the consumer requested
|
// Enable the usage bits the consumer requested
|
||||||
usage |= core->consumer_usage_bit;
|
usage |= core->consumer_usage_bit;
|
||||||
|
|
||||||
s32 found{};
|
s32 found{};
|
||||||
|
@ -249,7 +250,7 @@ Status BufferQueueProducer::DequeueBuffer(s32* out_slot, Fence* out_fence, bool
|
||||||
return status;
|
return status;
|
||||||
}
|
}
|
||||||
|
|
||||||
// This should not happen
|
// This should not happen
|
||||||
if (found == BufferQueueCore::INVALID_BUFFER_SLOT) {
|
if (found == BufferQueueCore::INVALID_BUFFER_SLOT) {
|
||||||
LOG_ERROR(Service_Nvnflinger, "no available buffer slots");
|
LOG_ERROR(Service_Nvnflinger, "no available buffer slots");
|
||||||
return Status::Busy;
|
return Status::Busy;
|
||||||
|
@ -361,7 +362,7 @@ Status BufferQueueProducer::DetachNextBuffer(std::shared_ptr<GraphicBuffer>* out
|
||||||
return Status::NoInit;
|
return Status::NoInit;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Find the oldest valid slot
|
// Find the oldest valid slot
|
||||||
int found = BufferQueueCore::INVALID_BUFFER_SLOT;
|
int found = BufferQueueCore::INVALID_BUFFER_SLOT;
|
||||||
for (int s = 0; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) {
|
for (int s = 0; s < BufferQueueDefs::NUM_BUFFER_SLOTS; ++s) {
|
||||||
if (slots[s].buffer_state == BufferState::Free && slots[s].graphic_buffer != nullptr) {
|
if (slots[s].buffer_state == BufferState::Free && slots[s].graphic_buffer != nullptr) {
|
||||||
|
@ -407,7 +408,7 @@ Status BufferQueueProducer::AttachBuffer(s32* out_slot,
|
||||||
return status;
|
return status;
|
||||||
}
|
}
|
||||||
|
|
||||||
// This should not happen
|
// This should not happen
|
||||||
if (found == BufferQueueCore::INVALID_BUFFER_SLOT) {
|
if (found == BufferQueueCore::INVALID_BUFFER_SLOT) {
|
||||||
LOG_ERROR(Service_Nvnflinger, "No available buffer slots");
|
LOG_ERROR(Service_Nvnflinger, "No available buffer slots");
|
||||||
return Status::Busy;
|
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.is_droppable = core->dequeue_buffer_cannot_block || async;
|
||||||
item.swap_interval = swap_interval;
|
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_;
|
sticky_transform = sticky_transform_;
|
||||||
|
|
||||||
if (core->queue.empty()) {
|
if (core->queue.empty()) {
|
||||||
|
@ -551,8 +547,17 @@ Status BufferQueueProducer::QueueBuffer(s32 slot, const QueueBufferInput& input,
|
||||||
// mark it as freed
|
// mark it as freed
|
||||||
if (core->StillTracking(*front)) {
|
if (core->StillTracking(*front)) {
|
||||||
slots[front->slot].buffer_state = BufferState::Free;
|
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;
|
slots[front->slot].frame_number = 0;
|
||||||
}
|
}
|
||||||
// Overwrite the droppable buffer with the incoming one
|
// 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->buffer_has_been_queued = true;
|
||||||
core->SignalDequeueCondition();
|
core->SignalDequeueCondition();
|
||||||
output->Inflate(core->default_width, core->default_height, core->transform_hint,
|
output->Inflate(core->default_width, core->default_height, core->transform_hint,
|
||||||
static_cast<u32>(core->queue.size()));
|
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++;
|
callback_ticket = next_callback_ticket++;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Don't send the GraphicBuffer through the callback, and don't send the slot number, since the
|
// Don't send the GraphicBuffer through the callback, and don't send the slot number, since the
|
||||||
// consumer shouldn't need it
|
// consumer shouldn't need it
|
||||||
item.graphic_buffer.reset();
|
item.graphic_buffer.reset();
|
||||||
item.slot = BufferItem::INVALID_BUFFER_SLOT;
|
item.slot = BufferItem::INVALID_BUFFER_SLOT;
|
||||||
|
|
||||||
// Call back without the main BufferQueue lock held, but with the callback lock held so we can
|
// Call back without the main BufferQueue lock held, but with the callback lock held so we can
|
||||||
// ensure that callbacks occur in order
|
// ensure that callbacks occur in order
|
||||||
{
|
{
|
||||||
std::scoped_lock lock{callback_mutex};
|
std::scoped_lock lock{callback_mutex};
|
||||||
while (callback_ticket != current_callback_ticket) {
|
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].graphic_buffer = std::make_shared<GraphicBuffer>(nvmap, buffer);
|
||||||
slots[slot].frame_number = 0;
|
slots[slot].frame_number = 0;
|
||||||
|
|
||||||
// Most games preallocate a buffer and pass a valid buffer here. However, it is possible for
|
// 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.
|
// this to be called with an empty buffer, Naruto Ultimate Ninja Storm is a game that does this.
|
||||||
if (buffer) {
|
if (buffer) {
|
||||||
slots[slot].is_preallocated = true;
|
slots[slot].is_preallocated = true;
|
||||||
|
|
||||||
|
@ -938,33 +944,46 @@ void BufferQueueProducer::Transact(u32 code, std::span<const u8> parcel_data,
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
case TransactionId::GetBufferHistory: {
|
case TransactionId::GetBufferHistory: {
|
||||||
LOG_WARNING(Service_Nvnflinger, "called, transaction=GetBufferHistory");
|
LOG_DEBUG(Service_Nvnflinger, "called, transaction=GetBufferHistory");
|
||||||
|
|
||||||
std::scoped_lock lock{core->mutex};
|
const s32 request = parcel_in.Read<s32>();
|
||||||
|
if (request <= 0) {
|
||||||
auto buffer_history_count = (std::min)(parcel_in.Read<s32>(), (s32)core->history.size());
|
|
||||||
|
|
||||||
if (buffer_history_count <= 0) {
|
|
||||||
parcel_out.Write(Status::BadValue);
|
parcel_out.Write(Status::BadValue);
|
||||||
parcel_out.Write<s32>(0);
|
parcel_out.Write<s32>(0);
|
||||||
status = Status::None;
|
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
auto info = new BufferInfo[buffer_history_count];
|
constexpr u32 history_max = BufferQueueCore::BUFFER_HISTORY_SIZE;
|
||||||
auto pos = position;
|
std::array<BufferHistoryInfo, history_max> buffer_history_snapshot{};
|
||||||
for (int i = 0; i < buffer_history_count; i++) {
|
s32 valid_index{};
|
||||||
info[i] = core->history[(pos - i) % core->history.size()];
|
{
|
||||||
LOG_WARNING(Service_Nvnflinger, "frame_number={}, state={}",
|
std::scoped_lock lk(core->mutex);
|
||||||
core->history[(pos - i) % core->history.size()].frame_number,
|
|
||||||
(u32)core->history[(pos - i) % core->history.size()].state);
|
const u32 current_history_pos = core->buffer_history_pos;
|
||||||
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(Status::NoError);
|
||||||
parcel_out.Write(buffer_history_count);
|
parcel_out.Write<s32>(limit);
|
||||||
parcel_out.WriteFlattenedObject<BufferInfo>(info);
|
for (s32 i = 0; i < limit; ++i) {
|
||||||
status = Status::None;
|
parcel_out.Write(buffer_history_snapshot[i]);
|
||||||
|
}
|
||||||
|
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
default:
|
default:
|
||||||
|
@ -972,9 +991,7 @@ void BufferQueueProducer::Transact(u32 code, std::span<const u8> parcel_data,
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (status != Status::None) {
|
parcel_out.Write(status);
|
||||||
parcel_out.Write(status);
|
|
||||||
}
|
|
||||||
|
|
||||||
const auto serialized = parcel_out.Serialize();
|
const auto serialized = parcel_out.Serialize();
|
||||||
std::memcpy(parcel_reply.data(), serialized.data(),
|
std::memcpy(parcel_reply.data(), serialized.data(),
|
||||||
|
|
|
@ -1,3 +1,4 @@
|
||||||
|
// SPDX-FileCopyrightText: Copyright 2025 Eden Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
||||||
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
// SPDX-FileCopyrightText: Copyright 2014 The Android Open Source Project
|
||||||
// SPDX-License-Identifier: GPL-3.0-or-later
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
||||||
|
|
|
@ -15,7 +15,7 @@ namespace Service::android {
|
||||||
|
|
||||||
class GraphicBuffer;
|
class GraphicBuffer;
|
||||||
|
|
||||||
enum class BufferState : s32 {
|
enum class BufferState : u32 {
|
||||||
Free = 0,
|
Free = 0,
|
||||||
Dequeued = 1,
|
Dequeued = 1,
|
||||||
Queued = 2,
|
Queued = 2,
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue