2019-05-24 15:57:50 +01:00
|
|
|
/*
|
2024-02-08 14:03:41 +00:00
|
|
|
* Copyright (c) 2017-2024 Arm Limited.
|
2019-05-24 15:57:50 +01:00
|
|
|
*
|
|
|
|
|
* SPDX-License-Identifier: MIT
|
|
|
|
|
*
|
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
|
* of this software and associated documentation files (the "Software"), to
|
|
|
|
|
* deal in the Software without restriction, including without limitation the
|
|
|
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
|
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
|
*
|
|
|
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
|
|
|
* copies or substantial portions of the Software.
|
|
|
|
|
*
|
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
|
* SOFTWARE.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* @file swapchain_base.cpp
|
|
|
|
|
*
|
|
|
|
|
* @brief Contains the implementation for the swapchain.
|
|
|
|
|
*
|
|
|
|
|
* This file contains much of the swapchain implementation,
|
|
|
|
|
* that is not specific to how images are created or presented.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <array>
|
|
|
|
|
#include <cassert>
|
|
|
|
|
#include <cerrno>
|
|
|
|
|
#include <cstdio>
|
|
|
|
|
#include <cstdlib>
|
2023-10-30 16:11:26 +08:00
|
|
|
#include <system_error>
|
2019-05-24 15:57:50 +01:00
|
|
|
|
|
|
|
|
#include <unistd.h>
|
|
|
|
|
#include <vulkan/vulkan.h>
|
|
|
|
|
|
2021-03-23 10:24:43 +00:00
|
|
|
#include "util/log.hpp"
|
2022-03-18 12:05:46 +00:00
|
|
|
#include "util/helpers.hpp"
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-03-23 10:24:43 +00:00
|
|
|
#include "swapchain_base.hpp"
|
2019-05-24 15:57:50 +01:00
|
|
|
namespace wsi
|
|
|
|
|
{
|
|
|
|
|
|
2020-05-01 13:25:30 +01:00
|
|
|
void swapchain_base::page_flip_thread()
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2020-07-10 10:28:51 +01:00
|
|
|
auto &sc_images = m_swapchain_images;
|
2019-05-24 15:57:50 +01:00
|
|
|
VkResult vk_res = VK_SUCCESS;
|
|
|
|
|
uint64_t timeout = UINT64_MAX;
|
2020-05-01 13:25:30 +01:00
|
|
|
constexpr uint64_t SEMAPHORE_TIMEOUT = 250000000; /* 250 ms. */
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2020-05-01 13:25:30 +01:00
|
|
|
/* No mutex is needed for the accesses to m_page_flip_thread_run variable as after the variable is
|
|
|
|
|
* initialized it is only ever changed to false. The while loop will make the thread read the
|
|
|
|
|
* value repeatedly, and the combination of semaphores and thread joins will force any changes to
|
|
|
|
|
* the variable to be visible to this thread.
|
|
|
|
|
*/
|
|
|
|
|
while (m_page_flip_thread_run)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2024-04-12 14:52:39 +02:00
|
|
|
|
|
|
|
|
uint32_t image_index;
|
|
|
|
|
if (m_present_mode == VK_PRESENT_MODE_SHARED_CONTINUOUS_REFRESH_KHR)
|
2020-05-01 13:25:30 +01:00
|
|
|
{
|
2024-04-12 14:52:39 +02:00
|
|
|
/* In continuous mode the application will only make one presentation request,
|
|
|
|
|
* therefore the page flip semaphore will only be signalled once. */
|
|
|
|
|
if (!m_first_present)
|
|
|
|
|
{
|
|
|
|
|
vk_res = VK_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
else if ((vk_res = m_page_flip_semaphore.wait(SEMAPHORE_TIMEOUT)) == VK_TIMEOUT)
|
|
|
|
|
{
|
|
|
|
|
/* Image is not ready yet. */
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
assert(vk_res == VK_SUCCESS);
|
|
|
|
|
|
|
|
|
|
/* For continuous mode there will be only one image in the swapchain.
|
|
|
|
|
* This image will always be used, and there is no pending state in this case. */
|
|
|
|
|
image_index = 0;
|
2020-05-01 13:25:30 +01:00
|
|
|
}
|
2024-04-12 14:52:39 +02:00
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Waiting for the page_flip_semaphore which will be signalled once there is an
|
|
|
|
|
* image to display.*/
|
|
|
|
|
if ((vk_res = m_page_flip_semaphore.wait(SEMAPHORE_TIMEOUT)) == VK_TIMEOUT)
|
|
|
|
|
{
|
|
|
|
|
/* Image is not ready yet. */
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2024-04-12 14:52:39 +02:00
|
|
|
/* We want to present the oldest queued for present image from our present queue,
|
|
|
|
|
* which we can find at the sc->pending_buffer_pool.head index. */
|
|
|
|
|
std::unique_lock<std::recursive_mutex> image_status_lock(m_image_status_mutex);
|
|
|
|
|
auto pending_index = m_pending_buffer_pool.pop_front();
|
|
|
|
|
assert(pending_index.has_value());
|
|
|
|
|
image_index = *pending_index;
|
|
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-09-01 22:30:31 +01:00
|
|
|
/* We may need to wait for the payload of the present sync of the oldest pending image to be finished. */
|
2024-04-12 14:52:39 +02:00
|
|
|
while ((vk_res = image_wait_present(sc_images[image_index], timeout)) == VK_TIMEOUT)
|
2023-04-18 10:58:09 +01:00
|
|
|
{
|
|
|
|
|
WSI_LOG_WARNING("Timeout waiting for image's present fences, retrying..");
|
|
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
if (vk_res != VK_SUCCESS)
|
|
|
|
|
{
|
2021-09-22 11:15:26 +01:00
|
|
|
set_error_state(vk_res);
|
2020-05-01 13:25:30 +01:00
|
|
|
m_free_image_semaphore.post();
|
2019-05-24 15:57:50 +01:00
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
2024-04-12 14:52:39 +02:00
|
|
|
call_present(image_index);
|
2021-10-14 15:45:34 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::call_present(uint32_t image_index)
|
|
|
|
|
{
|
|
|
|
|
/* First present of the swapchain. If it has an ancestor, wait until all the
|
|
|
|
|
* pending buffers from the ancestor have been presented. */
|
|
|
|
|
if (m_first_present)
|
|
|
|
|
{
|
|
|
|
|
if (m_ancestor != VK_NULL_HANDLE)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-10-14 15:45:34 +00:00
|
|
|
auto *ancestor = reinterpret_cast<swapchain_base *>(m_ancestor);
|
|
|
|
|
ancestor->wait_for_pending_buffers();
|
|
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
sem_post(&m_start_present_semaphore);
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
present_image(image_index);
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
m_first_present = false;
|
|
|
|
|
}
|
|
|
|
|
/* The swapchain has already started presenting. */
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
present_image(image_index);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool swapchain_base::has_descendant_started_presenting()
|
|
|
|
|
{
|
|
|
|
|
if (m_descendant == VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
auto *desc = reinterpret_cast<swapchain_base *>(m_descendant);
|
2021-11-25 15:30:46 +00:00
|
|
|
return desc->m_started_presenting;
|
2021-10-14 15:45:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
VkResult swapchain_base::init_page_flip_thread()
|
|
|
|
|
{
|
|
|
|
|
/* Setup semaphore for signaling pageflip thread */
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY_LOG_CALL(m_page_flip_semaphore.init(0));
|
2021-10-14 15:45:34 +00:00
|
|
|
m_thread_sem_defined = true;
|
|
|
|
|
|
|
|
|
|
/* Launch page flipping thread */
|
|
|
|
|
m_page_flip_thread_run = true;
|
|
|
|
|
try
|
|
|
|
|
{
|
|
|
|
|
m_page_flip_thread = std::thread(&swapchain_base::page_flip_thread, this);
|
|
|
|
|
}
|
|
|
|
|
catch (const std::system_error &)
|
|
|
|
|
{
|
|
|
|
|
return VK_ERROR_INITIALIZATION_FAILED;
|
|
|
|
|
}
|
2022-11-11 14:27:03 +00:00
|
|
|
catch (const std::bad_alloc &)
|
|
|
|
|
{
|
|
|
|
|
return VK_ERROR_INITIALIZATION_FAILED;
|
|
|
|
|
}
|
2021-10-14 15:45:34 +00:00
|
|
|
return VK_SUCCESS;
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::unpresent_image(uint32_t presented_index)
|
|
|
|
|
{
|
2021-05-27 14:57:53 +01:00
|
|
|
std::unique_lock<std::recursive_mutex> image_status_lock(m_image_status_mutex);
|
|
|
|
|
|
2024-04-12 14:52:39 +02:00
|
|
|
if (m_present_mode == VK_PRESENT_MODE_SHARED_DEMAND_REFRESH_KHR ||
|
|
|
|
|
m_present_mode == VK_PRESENT_MODE_SHARED_CONTINUOUS_REFRESH_KHR)
|
|
|
|
|
{
|
|
|
|
|
m_swapchain_images[presented_index].status = swapchain_image::ACQUIRED;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
m_swapchain_images[presented_index].status = swapchain_image::FREE;
|
|
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-05-27 14:57:53 +01:00
|
|
|
image_status_lock.unlock();
|
2024-04-12 14:52:39 +02:00
|
|
|
|
|
|
|
|
if (m_present_mode != VK_PRESENT_MODE_SHARED_DEMAND_REFRESH_KHR &&
|
|
|
|
|
m_present_mode != VK_PRESENT_MODE_SHARED_CONTINUOUS_REFRESH_KHR)
|
|
|
|
|
{
|
|
|
|
|
m_free_image_semaphore.post();
|
|
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
2020-11-27 09:59:18 +00:00
|
|
|
swapchain_base::swapchain_base(layer::device_private_data &dev_data, const VkAllocationCallbacks *callbacks)
|
2019-05-24 15:57:50 +01:00
|
|
|
: m_device_data(dev_data)
|
2021-10-14 15:45:34 +00:00
|
|
|
, m_page_flip_thread_run(false)
|
2021-10-07 14:48:44 +01:00
|
|
|
, m_start_present_semaphore()
|
2019-05-24 15:57:50 +01:00
|
|
|
, m_thread_sem_defined(false)
|
|
|
|
|
, m_first_present(true)
|
2021-10-07 14:48:44 +01:00
|
|
|
, m_pending_buffer_pool()
|
2021-05-27 13:53:07 +01:00
|
|
|
, m_allocator(dev_data.get_allocator(), VK_SYSTEM_ALLOCATION_SCOPE_OBJECT, callbacks)
|
2020-11-27 09:59:18 +00:00
|
|
|
, m_swapchain_images(m_allocator)
|
2019-05-24 15:57:50 +01:00
|
|
|
, m_surface(VK_NULL_HANDLE)
|
|
|
|
|
, m_present_mode(VK_PRESENT_MODE_IMMEDIATE_KHR)
|
|
|
|
|
, m_descendant(VK_NULL_HANDLE)
|
|
|
|
|
, m_ancestor(VK_NULL_HANDLE)
|
|
|
|
|
, m_device(VK_NULL_HANDLE)
|
|
|
|
|
, m_queue(VK_NULL_HANDLE)
|
2022-03-18 12:05:46 +00:00
|
|
|
#if WSI_IMAGE_COMPRESSION_CONTROL_SWAPCHAIN
|
2022-11-11 14:27:03 +00:00
|
|
|
, m_image_compression_control_params({ VK_IMAGE_COMPRESSION_DEFAULT_EXT, 0 })
|
2022-03-18 12:05:46 +00:00
|
|
|
#endif
|
2022-07-04 10:15:14 +01:00
|
|
|
, m_image_create_info()
|
2021-09-21 09:03:49 +01:00
|
|
|
, m_image_acquire_lock()
|
2021-09-22 11:15:26 +01:00
|
|
|
, m_error_state(VK_NOT_READY)
|
2021-11-25 15:30:46 +00:00
|
|
|
, m_started_presenting(false)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
VkResult swapchain_base::init(VkDevice device, const VkSwapchainCreateInfoKHR *swapchain_create_info)
|
|
|
|
|
{
|
|
|
|
|
assert(device != VK_NULL_HANDLE);
|
|
|
|
|
assert(swapchain_create_info != nullptr);
|
|
|
|
|
assert(swapchain_create_info->surface != VK_NULL_HANDLE);
|
|
|
|
|
|
|
|
|
|
m_device = device;
|
|
|
|
|
m_surface = swapchain_create_info->surface;
|
|
|
|
|
|
2021-01-31 20:09:53 +00:00
|
|
|
m_present_mode = swapchain_create_info->presentMode;
|
|
|
|
|
|
2022-03-18 12:05:46 +00:00
|
|
|
#if WSI_IMAGE_COMPRESSION_CONTROL_SWAPCHAIN
|
|
|
|
|
const auto *image_compression_control = util::find_extension<VkImageCompressionControlEXT>(
|
|
|
|
|
VK_STRUCTURE_TYPE_IMAGE_COMPRESSION_CONTROL_EXT, swapchain_create_info->pNext);
|
|
|
|
|
if (m_device_data.is_swapchain_compression_control_enabled() && image_compression_control != nullptr)
|
|
|
|
|
{
|
2022-07-04 10:15:14 +01:00
|
|
|
m_image_compression_control_params.compression_control_plane_count =
|
|
|
|
|
image_compression_control->compressionControlPlaneCount;
|
|
|
|
|
m_image_compression_control_params.flags = image_compression_control->flags;
|
2022-03-18 12:05:46 +00:00
|
|
|
for (uint32_t i = 0; i < image_compression_control->compressionControlPlaneCount; i++)
|
|
|
|
|
{
|
2022-07-04 10:15:14 +01:00
|
|
|
m_image_compression_control_params.fixed_rate_flags[i] = image_compression_control->pFixedRateFlags[i];
|
2022-03-18 12:05:46 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
2020-07-10 10:28:51 +01:00
|
|
|
/* Init image to invalid values. */
|
|
|
|
|
if (!m_swapchain_images.try_resize(swapchain_create_info->minImageCount))
|
2021-10-20 15:27:47 +01:00
|
|
|
{
|
2019-05-24 15:57:50 +01:00
|
|
|
return VK_ERROR_OUT_OF_HOST_MEMORY;
|
2021-10-20 15:27:47 +01:00
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2020-07-10 10:28:51 +01:00
|
|
|
/* We have allocated images, we can call the platform init function if something needs to be done. */
|
2021-10-14 15:45:34 +00:00
|
|
|
bool use_presentation_thread = true;
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY_LOG_CALL(init_platform(device, swapchain_create_info, use_presentation_thread));
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
if (use_presentation_thread)
|
|
|
|
|
{
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY_LOG_CALL(init_page_flip_thread());
|
2021-10-14 15:45:34 +00:00
|
|
|
}
|
|
|
|
|
|
2019-05-24 15:57:50 +01:00
|
|
|
VkImageCreateInfo image_create_info = {};
|
|
|
|
|
image_create_info.sType = VK_STRUCTURE_TYPE_IMAGE_CREATE_INFO;
|
|
|
|
|
image_create_info.pNext = nullptr;
|
|
|
|
|
image_create_info.imageType = VK_IMAGE_TYPE_2D;
|
|
|
|
|
image_create_info.format = swapchain_create_info->imageFormat;
|
2022-11-11 14:27:03 +00:00
|
|
|
image_create_info.extent = { swapchain_create_info->imageExtent.width, swapchain_create_info->imageExtent.height,
|
|
|
|
|
1 };
|
2019-05-24 15:57:50 +01:00
|
|
|
image_create_info.mipLevels = 1;
|
|
|
|
|
image_create_info.arrayLayers = swapchain_create_info->imageArrayLayers;
|
|
|
|
|
image_create_info.samples = VK_SAMPLE_COUNT_1_BIT;
|
|
|
|
|
image_create_info.tiling = VK_IMAGE_TILING_OPTIMAL;
|
|
|
|
|
image_create_info.usage = swapchain_create_info->imageUsage;
|
|
|
|
|
image_create_info.flags = 0;
|
|
|
|
|
image_create_info.sharingMode = swapchain_create_info->imageSharingMode;
|
|
|
|
|
image_create_info.queueFamilyIndexCount = swapchain_create_info->queueFamilyIndexCount;
|
|
|
|
|
image_create_info.pQueueFamilyIndices = swapchain_create_info->pQueueFamilyIndices;
|
|
|
|
|
image_create_info.initialLayout = VK_IMAGE_LAYOUT_UNDEFINED;
|
|
|
|
|
|
2022-11-24 11:24:34 +00:00
|
|
|
VkResult result = m_free_image_semaphore.init(m_swapchain_images.size());
|
2019-05-24 15:57:50 +01:00
|
|
|
if (result != VK_SUCCESS)
|
|
|
|
|
{
|
|
|
|
|
assert(result == VK_ERROR_OUT_OF_HOST_MEMORY);
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
2022-11-11 14:27:03 +00:00
|
|
|
for (auto &img : m_swapchain_images)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY_LOG_CALL(create_and_bind_swapchain_image(image_create_info, img));
|
2021-10-20 15:27:47 +01:00
|
|
|
|
|
|
|
|
VkSemaphoreCreateInfo semaphore_info = {};
|
|
|
|
|
semaphore_info.sType = VK_STRUCTURE_TYPE_SEMAPHORE_CREATE_INFO;
|
2022-11-24 11:24:34 +00:00
|
|
|
|
|
|
|
|
TRY_LOG_CALL(m_device_data.disp.CreateSemaphore(m_device, &semaphore_info, get_allocation_callbacks(),
|
|
|
|
|
&img.present_semaphore));
|
2024-04-09 16:14:27 +01:00
|
|
|
TRY_LOG_CALL(m_device_data.disp.CreateSemaphore(m_device, &semaphore_info, get_allocation_callbacks(),
|
|
|
|
|
&img.present_fence_wait));
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
m_device_data.disp.GetDeviceQueue(m_device, 0, 0, &m_queue);
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY_LOG_CALL(m_device_data.SetDeviceLoaderData(m_device, m_queue));
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
int res = sem_init(&m_start_present_semaphore, 0, 0);
|
2019-05-24 15:57:50 +01:00
|
|
|
/* Only programming error can cause this to fail. */
|
|
|
|
|
assert(res == 0);
|
|
|
|
|
if (res != 0)
|
|
|
|
|
{
|
|
|
|
|
return VK_ERROR_OUT_OF_HOST_MEMORY;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Release the swapchain images of the old swapchain in order
|
|
|
|
|
* to free up memory for new swapchain. This is necessary especially
|
|
|
|
|
* on platform with limited display memory size.
|
|
|
|
|
*
|
|
|
|
|
* NB: This must be done last in initialization, when the rest of
|
|
|
|
|
* the swapchain is valid.
|
|
|
|
|
*/
|
|
|
|
|
if (swapchain_create_info->oldSwapchain != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
/* Set ancestor. */
|
|
|
|
|
m_ancestor = swapchain_create_info->oldSwapchain;
|
|
|
|
|
|
|
|
|
|
auto *ancestor = reinterpret_cast<swapchain_base *>(m_ancestor);
|
|
|
|
|
ancestor->deprecate(reinterpret_cast<VkSwapchainKHR>(this));
|
|
|
|
|
}
|
|
|
|
|
|
2021-09-22 11:15:26 +01:00
|
|
|
set_error_state(VK_SUCCESS);
|
2019-05-24 15:57:50 +01:00
|
|
|
|
|
|
|
|
return VK_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::teardown()
|
|
|
|
|
{
|
|
|
|
|
/* This method will block until all resources associated with this swapchain
|
|
|
|
|
* are released. Images in the ACQUIRED or FREE state can be freed
|
2021-05-27 14:57:53 +01:00
|
|
|
* immediately. For images in the PENDING state, we will block until the
|
2019-05-24 15:57:50 +01:00
|
|
|
* presentation engine is finished with them. */
|
|
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
if (has_descendant_started_presenting())
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-10-14 15:45:34 +00:00
|
|
|
/* Here we wait for the start_present_semaphore, once this semaphore is up,
|
|
|
|
|
* the descendant has finished waiting, we don't want to delete vkImages and vkFences
|
|
|
|
|
* and semaphores before the waiting is done. */
|
2019-05-24 15:57:50 +01:00
|
|
|
auto *desc = reinterpret_cast<swapchain_base *>(m_descendant);
|
2021-10-14 15:45:34 +00:00
|
|
|
sem_wait(&desc->m_start_present_semaphore);
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
2021-09-22 11:15:26 +01:00
|
|
|
else if (!error_has_occured())
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-10-14 15:45:34 +00:00
|
|
|
/* If descendant hasn't started presenting, there are pending buffers in the swapchain. */
|
2019-05-24 15:57:50 +01:00
|
|
|
wait_for_pending_buffers();
|
|
|
|
|
}
|
|
|
|
|
|
2020-11-26 18:00:05 +00:00
|
|
|
if (m_queue != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
/* Make sure the vkFences are done signaling. */
|
2020-08-04 12:25:34 +01:00
|
|
|
m_device_data.disp.QueueWaitIdle(m_queue);
|
2020-11-26 18:00:05 +00:00
|
|
|
}
|
|
|
|
|
|
2019-05-24 15:57:50 +01:00
|
|
|
/* We are safe to destroy everything. */
|
|
|
|
|
if (m_thread_sem_defined)
|
|
|
|
|
{
|
2020-05-01 13:25:30 +01:00
|
|
|
/* Tell flip thread to end. */
|
|
|
|
|
m_page_flip_thread_run = false;
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2020-05-01 13:25:30 +01:00
|
|
|
if (m_page_flip_thread.joinable())
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2020-05-01 13:25:30 +01:00
|
|
|
m_page_flip_thread.join();
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
2020-05-01 13:25:30 +01:00
|
|
|
else
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-03-23 10:24:43 +00:00
|
|
|
WSI_LOG_ERROR("m_page_flip_thread is not joinable");
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
2021-10-14 15:45:34 +00:00
|
|
|
}
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
int res = sem_destroy(&m_start_present_semaphore);
|
|
|
|
|
if (res != 0)
|
|
|
|
|
{
|
|
|
|
|
WSI_LOG_ERROR("sem_destroy failed for start_present_semaphore with %d", errno);
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (m_descendant != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
auto *sc = reinterpret_cast<swapchain_base *>(m_descendant);
|
|
|
|
|
sc->clear_ancestor();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (m_ancestor != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
auto *sc = reinterpret_cast<swapchain_base *>(m_ancestor);
|
|
|
|
|
sc->clear_descendant();
|
|
|
|
|
}
|
|
|
|
|
/* Release the images array. */
|
2022-11-11 14:27:03 +00:00
|
|
|
for (auto &img : m_swapchain_images)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2020-07-10 10:28:51 +01:00
|
|
|
/* Call implementation specific release */
|
|
|
|
|
destroy_image(img);
|
2021-10-20 15:27:47 +01:00
|
|
|
|
|
|
|
|
m_device_data.disp.DestroySemaphore(m_device, img.present_semaphore, get_allocation_callbacks());
|
2024-04-09 16:14:27 +01:00
|
|
|
m_device_data.disp.DestroySemaphore(m_device, img.present_fence_wait, get_allocation_callbacks());
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2022-11-11 14:27:03 +00:00
|
|
|
VkResult swapchain_base::acquire_next_image(uint64_t timeout, VkSemaphore semaphore, VkFence fence,
|
|
|
|
|
uint32_t *image_index)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-09-21 09:03:49 +01:00
|
|
|
std::unique_lock<std::mutex> acquire_lock(m_image_acquire_lock);
|
|
|
|
|
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY(wait_for_free_buffer(timeout));
|
2021-09-22 11:15:26 +01:00
|
|
|
if (error_has_occured())
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-09-22 11:15:26 +01:00
|
|
|
return get_error_state();
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
2021-05-27 14:57:53 +01:00
|
|
|
std::unique_lock<std::recursive_mutex> image_status_lock(m_image_status_mutex);
|
|
|
|
|
|
2021-10-07 14:48:44 +01:00
|
|
|
size_t i;
|
2020-07-10 10:28:51 +01:00
|
|
|
for (i = 0; i < m_swapchain_images.size(); ++i)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
|
|
|
|
if (m_swapchain_images[i].status == swapchain_image::FREE)
|
|
|
|
|
{
|
|
|
|
|
m_swapchain_images[i].status = swapchain_image::ACQUIRED;
|
|
|
|
|
*image_index = i;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2020-07-10 10:28:51 +01:00
|
|
|
assert(i < m_swapchain_images.size());
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-05-27 14:57:53 +01:00
|
|
|
image_status_lock.unlock();
|
|
|
|
|
|
2022-01-13 10:08:03 +00:00
|
|
|
/* Try to signal fences/semaphores with a sync FD for optimal performance. */
|
2024-01-24 09:21:00 +01:00
|
|
|
if (m_device_data.disp.get_fn<PFN_vkImportFenceFdKHR>("vkImportFenceFdKHR").has_value() &&
|
|
|
|
|
m_device_data.disp.get_fn<PFN_vkImportSemaphoreFdKHR>("vkImportSemaphoreFdKHR").has_value())
|
2022-01-13 10:08:03 +00:00
|
|
|
{
|
|
|
|
|
if (fence != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
int already_signalled_sentinel_fd = -1;
|
|
|
|
|
auto info = VkImportFenceFdInfoKHR{};
|
|
|
|
|
{
|
|
|
|
|
info.sType = VK_STRUCTURE_TYPE_IMPORT_FENCE_FD_INFO_KHR;
|
|
|
|
|
info.fence = fence;
|
|
|
|
|
info.handleType = VK_EXTERNAL_FENCE_HANDLE_TYPE_SYNC_FD_BIT;
|
|
|
|
|
info.fd = already_signalled_sentinel_fd;
|
2024-02-08 14:03:41 +00:00
|
|
|
info.flags = VK_FENCE_IMPORT_TEMPORARY_BIT;
|
2022-01-13 10:08:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
auto result = m_device_data.disp.ImportFenceFdKHR(m_device, &info);
|
|
|
|
|
switch (result)
|
|
|
|
|
{
|
|
|
|
|
case VK_SUCCESS:
|
|
|
|
|
fence = VK_NULL_HANDLE;
|
|
|
|
|
break;
|
|
|
|
|
case VK_ERROR_INVALID_EXTERNAL_HANDLE:
|
|
|
|
|
/* Leave to fallback. */
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (semaphore != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
int already_signalled_sentinel_fd = -1;
|
|
|
|
|
auto info = VkImportSemaphoreFdInfoKHR{};
|
|
|
|
|
{
|
|
|
|
|
info.sType = VK_STRUCTURE_TYPE_IMPORT_SEMAPHORE_FD_INFO_KHR;
|
|
|
|
|
info.semaphore = semaphore;
|
|
|
|
|
info.handleType = VK_EXTERNAL_SEMAPHORE_HANDLE_TYPE_SYNC_FD_BIT;
|
2023-11-01 14:42:22 +00:00
|
|
|
info.flags = VK_SEMAPHORE_IMPORT_TEMPORARY_BIT;
|
2022-01-13 10:08:03 +00:00
|
|
|
info.fd = already_signalled_sentinel_fd;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
auto result = m_device_data.disp.ImportSemaphoreFdKHR(m_device, &info);
|
|
|
|
|
switch (result)
|
|
|
|
|
{
|
|
|
|
|
case VK_SUCCESS:
|
|
|
|
|
semaphore = VK_NULL_HANDLE;
|
|
|
|
|
break;
|
|
|
|
|
case VK_ERROR_INVALID_EXTERNAL_HANDLE:
|
|
|
|
|
/* Leave to fallback. */
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Fallback for when importing fence/semaphore sync FDs is unsupported by the ICD. */
|
2024-04-09 16:04:28 +01:00
|
|
|
queue_submit_semaphores semaphores = {
|
|
|
|
|
nullptr,
|
|
|
|
|
0,
|
|
|
|
|
(semaphore != VK_NULL_HANDLE) ? &semaphore : nullptr,
|
|
|
|
|
(semaphore != VK_NULL_HANDLE) ? 1u : 0,
|
|
|
|
|
};
|
|
|
|
|
TRY(sync_queue_submit(m_device_data, m_queue, fence, semaphores));
|
2022-11-24 11:24:34 +00:00
|
|
|
|
2024-04-09 16:04:28 +01:00
|
|
|
return VK_SUCCESS;
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
VkResult swapchain_base::get_swapchain_images(uint32_t *swapchain_image_count, VkImage *swapchain_images)
|
|
|
|
|
{
|
|
|
|
|
if (swapchain_images == nullptr)
|
|
|
|
|
{
|
|
|
|
|
/* Return the number of swapchain images. */
|
2020-07-10 10:28:51 +01:00
|
|
|
*swapchain_image_count = m_swapchain_images.size();
|
2019-05-24 15:57:50 +01:00
|
|
|
|
|
|
|
|
return VK_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2020-07-10 10:28:51 +01:00
|
|
|
assert(m_swapchain_images.size() > 0);
|
2019-05-24 15:57:50 +01:00
|
|
|
assert(*swapchain_image_count > 0);
|
|
|
|
|
|
|
|
|
|
/* Populate array, write actual number of images returned. */
|
|
|
|
|
uint32_t current_image = 0;
|
|
|
|
|
|
|
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
swapchain_images[current_image] = m_swapchain_images[current_image].image;
|
|
|
|
|
|
|
|
|
|
current_image++;
|
|
|
|
|
|
2020-07-10 10:28:51 +01:00
|
|
|
if (current_image == m_swapchain_images.size())
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
|
|
|
|
*swapchain_image_count = current_image;
|
|
|
|
|
|
|
|
|
|
return VK_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} while (current_image < *swapchain_image_count);
|
|
|
|
|
|
|
|
|
|
/* If swapchain_image_count is smaller than the number of presentable images
|
|
|
|
|
* in the swapchain, VK_INCOMPLETE must be returned instead of VK_SUCCESS. */
|
|
|
|
|
*swapchain_image_count = current_image;
|
|
|
|
|
|
|
|
|
|
return VK_INCOMPLETE;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2022-07-04 10:15:14 +01:00
|
|
|
VkResult swapchain_base::create_aliased_image_handle(VkImage *image)
|
|
|
|
|
{
|
|
|
|
|
return m_device_data.disp.CreateImage(m_device, &m_image_create_info, get_allocation_callbacks(), image);
|
|
|
|
|
}
|
|
|
|
|
|
2024-04-12 14:52:39 +02:00
|
|
|
VkResult swapchain_base::get_swapchain_status()
|
|
|
|
|
{
|
|
|
|
|
return get_error_state();
|
|
|
|
|
}
|
|
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
VkResult swapchain_base::notify_presentation_engine(uint32_t image_index)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-10-14 15:45:34 +00:00
|
|
|
const std::lock_guard<std::recursive_mutex> lock(m_image_status_mutex);
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
/* If the descendant has started presenting, we should release the image
|
|
|
|
|
* however we do not want to block inside the main thread so we mark it
|
|
|
|
|
* as free and let the page flip thread take care of it. */
|
|
|
|
|
const bool descendant_started_presenting = has_descendant_started_presenting();
|
|
|
|
|
if (descendant_started_presenting)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-10-14 15:45:34 +00:00
|
|
|
m_swapchain_images[image_index].status = swapchain_image::FREE;
|
|
|
|
|
m_free_image_semaphore.post();
|
|
|
|
|
return VK_ERROR_OUT_OF_DATE_KHR;
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
|
2021-10-14 15:45:34 +00:00
|
|
|
m_swapchain_images[image_index].status = swapchain_image::PENDING;
|
2021-11-25 15:30:46 +00:00
|
|
|
m_started_presenting = true;
|
2021-10-14 15:45:34 +00:00
|
|
|
|
|
|
|
|
if (m_page_flip_thread_run)
|
|
|
|
|
{
|
|
|
|
|
bool buffer_pool_res = m_pending_buffer_pool.push_back(image_index);
|
|
|
|
|
(void)buffer_pool_res;
|
|
|
|
|
assert(buffer_pool_res);
|
|
|
|
|
m_page_flip_semaphore.post();
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
call_present(image_index);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return VK_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
|
2024-04-09 16:14:27 +01:00
|
|
|
VkResult swapchain_base::queue_present(VkQueue queue, const VkPresentInfoKHR *present_info, const uint32_t image_index,
|
|
|
|
|
bool use_image_present_semaphore, const VkFence present_fence)
|
2021-10-14 15:45:34 +00:00
|
|
|
{
|
|
|
|
|
|
2021-10-20 15:27:47 +01:00
|
|
|
const VkSemaphore *wait_semaphores = &m_swapchain_images[image_index].present_semaphore;
|
|
|
|
|
uint32_t sem_count = 1;
|
2024-04-09 16:14:27 +01:00
|
|
|
if (!use_image_present_semaphore)
|
2021-10-20 15:27:47 +01:00
|
|
|
{
|
|
|
|
|
wait_semaphores = present_info->pWaitSemaphores;
|
|
|
|
|
sem_count = present_info->waitSemaphoreCount;
|
|
|
|
|
}
|
|
|
|
|
|
2024-04-12 14:52:39 +02:00
|
|
|
if (!m_page_flip_thread_run)
|
|
|
|
|
{
|
|
|
|
|
/* If the page flip thread is not running, we need to wait for any present payload here, before setting a new present payload. */
|
|
|
|
|
constexpr uint64_t WAIT_PRESENT_TIMEOUT = 1000000000; /* 1 second */
|
|
|
|
|
TRY_LOG_CALL(image_wait_present(m_swapchain_images[image_index], WAIT_PRESENT_TIMEOUT));
|
|
|
|
|
}
|
|
|
|
|
|
2024-04-09 16:14:27 +01:00
|
|
|
queue_submit_semaphores semaphores = {
|
|
|
|
|
wait_semaphores,
|
|
|
|
|
sem_count,
|
|
|
|
|
(present_fence != VK_NULL_HANDLE) ? &m_swapchain_images[image_index].present_fence_wait : nullptr,
|
|
|
|
|
(present_fence != VK_NULL_HANDLE) ? 1u : 0,
|
|
|
|
|
};
|
2024-04-09 16:04:28 +01:00
|
|
|
TRY_LOG_CALL(image_set_present_payload(m_swapchain_images[image_index], queue, semaphores));
|
|
|
|
|
|
2024-04-09 16:14:27 +01:00
|
|
|
if (present_fence != VK_NULL_HANDLE)
|
|
|
|
|
{
|
|
|
|
|
const queue_submit_semaphores wait_semaphores = { &m_swapchain_images[image_index].present_fence_wait, 1, nullptr,
|
|
|
|
|
0 };
|
|
|
|
|
/*
|
|
|
|
|
* Here we chain wait_semaphores with present_fence through present_fence_wait.
|
|
|
|
|
*/
|
|
|
|
|
TRY(sync_queue_submit(m_device_data, queue, present_fence, wait_semaphores));
|
|
|
|
|
}
|
|
|
|
|
|
2022-11-24 11:24:34 +00:00
|
|
|
TRY(notify_presentation_engine(image_index));
|
2019-05-24 15:57:50 +01:00
|
|
|
|
|
|
|
|
return VK_SUCCESS;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::deprecate(VkSwapchainKHR descendant)
|
|
|
|
|
{
|
2022-11-11 14:27:03 +00:00
|
|
|
for (auto &img : m_swapchain_images)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2020-07-10 10:28:51 +01:00
|
|
|
if (img.status == swapchain_image::FREE)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2020-07-10 10:28:51 +01:00
|
|
|
destroy_image(img);
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Set its descendant. */
|
|
|
|
|
m_descendant = descendant;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::wait_for_pending_buffers()
|
|
|
|
|
{
|
2021-09-21 09:03:49 +01:00
|
|
|
std::unique_lock<std::mutex> acquire_lock(m_image_acquire_lock);
|
2019-05-24 15:57:50 +01:00
|
|
|
int wait;
|
2021-09-21 09:03:49 +01:00
|
|
|
int acquired_images = 0;
|
2021-05-27 14:57:53 +01:00
|
|
|
std::unique_lock<std::recursive_mutex> image_status_lock(m_image_status_mutex);
|
2019-05-24 15:57:50 +01:00
|
|
|
|
2022-11-11 14:27:03 +00:00
|
|
|
for (auto &img : m_swapchain_images)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-09-21 09:03:49 +01:00
|
|
|
if (img.status == swapchain_image::ACQUIRED)
|
2019-05-24 15:57:50 +01:00
|
|
|
{
|
2021-09-21 09:03:49 +01:00
|
|
|
acquired_images++;
|
2019-05-24 15:57:50 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2021-09-21 09:03:49 +01:00
|
|
|
/* Waiting for free images waits for both free and pending. One pending image may be presented and acquired by a
|
|
|
|
|
* compositor. The WSI backend may not necessarily know which pending image is presented to change its state. It may
|
|
|
|
|
* be impossible to wait for that one presented image. */
|
2021-10-07 14:48:44 +01:00
|
|
|
wait = static_cast<int>(m_swapchain_images.size()) - acquired_images - 1;
|
2021-05-27 14:57:53 +01:00
|
|
|
image_status_lock.unlock();
|
2019-05-24 15:57:50 +01:00
|
|
|
|
|
|
|
|
while (wait > 0)
|
|
|
|
|
{
|
|
|
|
|
/* Take down one free image semaphore. */
|
|
|
|
|
wait_for_free_buffer(UINT64_MAX);
|
|
|
|
|
--wait;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::clear_ancestor()
|
|
|
|
|
{
|
|
|
|
|
m_ancestor = VK_NULL_HANDLE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void swapchain_base::clear_descendant()
|
|
|
|
|
{
|
|
|
|
|
m_descendant = VK_NULL_HANDLE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
VkResult swapchain_base::wait_for_free_buffer(uint64_t timeout)
|
|
|
|
|
{
|
|
|
|
|
VkResult retval;
|
|
|
|
|
/* first see if a buffer is already marked as free */
|
|
|
|
|
retval = m_free_image_semaphore.wait(0);
|
|
|
|
|
if (retval == VK_NOT_READY)
|
|
|
|
|
{
|
|
|
|
|
/* if not, we still have work to do even if timeout==0 -
|
|
|
|
|
* the swapchain implementation may be able to get a buffer without
|
|
|
|
|
* waiting */
|
|
|
|
|
|
|
|
|
|
retval = get_free_buffer(&timeout);
|
|
|
|
|
if (retval == VK_SUCCESS)
|
|
|
|
|
{
|
|
|
|
|
/* the sub-implementation has done it's thing, so re-check the
|
|
|
|
|
* semaphore */
|
|
|
|
|
retval = m_free_image_semaphore.wait(timeout);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
|
|
|
|
|
2024-01-23 18:19:27 +00:00
|
|
|
void swapchain_base::release_images(uint32_t image_count, const uint32_t *indices)
|
|
|
|
|
{
|
|
|
|
|
for (uint32_t i = 0; i < image_count; i++)
|
|
|
|
|
{
|
|
|
|
|
uint32_t index = indices[i];
|
|
|
|
|
assert(index < m_swapchain_images.size());
|
|
|
|
|
/* Applications can only pass acquired images that the device doesn't own */
|
|
|
|
|
assert(m_swapchain_images[index].status == swapchain_image::ACQUIRED);
|
|
|
|
|
unpresent_image(index);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-05-24 15:57:50 +01:00
|
|
|
} /* namespace wsi */
|