|
|
|
@ -567,12 +567,8 @@ public:
|
|
|
|
|
/// Construct a queue handle.
|
|
|
|
|
constexpr Queue(VkQueue queue, const DeviceDispatch& dld) noexcept : queue{queue}, dld{&dld} {}
|
|
|
|
|
|
|
|
|
|
/// Returns the checkpoint data.
|
|
|
|
|
/// @note Returns an empty vector when the function pointer is not present.
|
|
|
|
|
std::vector<VkCheckpointDataNV> GetCheckpointDataNV(const DeviceDispatch& dld) const;
|
|
|
|
|
|
|
|
|
|
void Submit(Span<VkSubmitInfo> submit_infos, VkFence fence) const {
|
|
|
|
|
Check(dld->vkQueueSubmit(queue, submit_infos.size(), submit_infos.data(), fence));
|
|
|
|
|
VkResult Submit(Span<VkSubmitInfo> submit_infos, VkFence fence) const noexcept {
|
|
|
|
|
return dld->vkQueueSubmit(queue, submit_infos.size(), submit_infos.data(), fence);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
VkResult Present(const VkPresentInfoKHR& present_info) const noexcept {
|
|
|
|
@ -734,18 +730,11 @@ public:
|
|
|
|
|
dld->vkResetQueryPoolEXT(handle, query_pool, first, count);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void GetQueryResults(VkQueryPool query_pool, u32 first, u32 count, std::size_t data_size,
|
|
|
|
|
void* data, VkDeviceSize stride, VkQueryResultFlags flags) const {
|
|
|
|
|
Check(dld->vkGetQueryPoolResults(handle, query_pool, first, count, data_size, data, stride,
|
|
|
|
|
flags));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
|
T GetQueryResult(VkQueryPool query_pool, u32 first, VkQueryResultFlags flags) const {
|
|
|
|
|
static_assert(std::is_trivially_copyable_v<T>);
|
|
|
|
|
T value;
|
|
|
|
|
GetQueryResults(query_pool, first, 1, sizeof(T), &value, sizeof(T), flags);
|
|
|
|
|
return value;
|
|
|
|
|
VkResult GetQueryResults(VkQueryPool query_pool, u32 first, u32 count, std::size_t data_size,
|
|
|
|
|
void* data, VkDeviceSize stride, VkQueryResultFlags flags) const
|
|
|
|
|
noexcept {
|
|
|
|
|
return dld->vkGetQueryPoolResults(handle, query_pool, first, count, data_size, data, stride,
|
|
|
|
|
flags);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|