1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
#ifndef QUEUE_STATE_HH_
#define QUEUE_STATE_HH_
#include "context.hh"
#include "device_clock.hh"
#include "timestamp_pool.hh"
#include <vulkan/utility/vk_dispatch_table.h>
#include <vulkan/vulkan.hpp>
#include <deque>
#include <memory>
#include <unordered_map>
namespace low_latency {
class QueueContext final : public Context {
private:
// The amount of queue submissions we allow tracked per queue before
// we give up tracking them. This is neccessary for queues which do not
// present anything.
static constexpr auto MAX_TRACKED_SUBMISSIONS = 50u;
public:
DeviceContext& device;
const VkQueue queue;
const std::uint32_t queue_family_index;
struct CommandPoolOwner final {
private:
const QueueContext& queue;
VkCommandPool command_pool;
public:
CommandPoolOwner(const QueueContext& queue);
CommandPoolOwner(const CommandPoolOwner&) = delete;
CommandPoolOwner(CommandPoolOwner&&) = delete;
CommandPoolOwner operator=(const CommandPoolOwner&) = delete;
CommandPoolOwner operator=(CommandPoolOwner&&) = delete;
~CommandPoolOwner();
public:
operator const VkCommandPool&() const { return this->command_pool; }
};
const std::unique_ptr<CommandPoolOwner> command_pool;
std::unique_ptr<TimestampPool> timestamp_pool;
// NVIDIA's extension lets the application explicitly state that this queue
// does not contribute to the frame. AMD's extension has no such mechanism -
// so this will always be false when using VK_AMD_anti_lag.
bool should_ignore_latency = false;
public:
// I want our queue bookkeeping to be fairly simple and do one thing - track
// submissions that have yet to have been presented to a swapchain. General
// idea:
//
// For each vkQueueSubmit (specifically for each pSubmitInfo in that
// hook) grab the VK_EXT_present_id value provided by the application for
// that submission. Once we add our timing objects as part of the hook, we
// then take those timing objects, bundle them into a Submission struct, and
// append it to the (potentially currently nonexistent) mapping of
// present_id's to deque<Submission>'s. Now we cleanly track what queue
// submissions refer to what present_id.
//
// When our hook sees a VkQueuePresentKHR, we take the provided present_id
// and notify our device that it needs to watch for when this completes.
// We give it our submissions. Now, it's out of our hands. We remove the
// present_id_t mapping when doing so.
struct Submission {
std::shared_ptr<TimestampPool::Handle> head_handle, tail_handle;
DeviceClock::time_point_t cpu_present_time;
};
using submissions_t =
std::shared_ptr<std::deque<std::unique_ptr<Submission>>>;
using present_id_t = std::uint64_t;
std::unordered_map<present_id_t, submissions_t> unpresented_submissions;
public:
QueueContext(DeviceContext& device_context, const VkQueue& queue,
const std::uint32_t& queue_family_index);
virtual ~QueueContext();
public:
void notify_submit(const present_id_t& present_id,
const std::shared_ptr<TimestampPool::Handle> head_handle,
const std::shared_ptr<TimestampPool::Handle> tail_handle,
const DeviceClock::time_point_t& now);
void notify_present(const VkSwapchainKHR& swapchain,
const std::uint64_t& present_id);
public:
bool should_inject_timestamps() const;
};
}; // namespace low_latency
#endif
|
