| // Copyright 2019 The Fuchsia Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style license that can be |
| // found in the LICENSE file. |
| |
| // |
| // This is the "basic" fence pool implementation. |
| // |
| // A host-OS-optimized platform will work directly with the VkFence |
| // payloads to avoid scanning for signaled fences. |
| // |
| |
| #include "queue_pool.h" |
| |
| #include "common/vk/assert.h" |
| #include "device.h" |
| |
| // |
| // |
| // |
| |
| struct spn_queue_pool |
| { |
| VkQueue q; |
| }; |
| |
| // |
| // FIXME(allanmac): The number and composition of queues (compute |
| // vs. graphics) will be configured by the target. |
| // |
| // This implies Spinel/VK needs to either create the queue pool itself |
| // or accept an externally defined queue strategy. |
| // |
| // This is moot until we get Timeline Semaphores and can run on multiple |
| // queues. |
| // |
| |
| void |
| spn_device_queue_pool_create(struct spn_device * const device, uint32_t const queue_count) |
| { |
| device->queue_pool = spn_allocator_host_perm_alloc(&device->allocator.host.perm, |
| SPN_MEM_FLAGS_READ_WRITE, |
| sizeof(*device->queue_pool)); |
| |
| // |
| // FIXME(allanmac): for now just return queue 0 but the pool |
| // creation needs to be a little bit more sophisticated. |
| // |
| vkGetDeviceQueue(device->environment.d, device->environment.qfi, 0, &device->queue_pool->q); |
| } |
| |
| void |
| spn_device_queue_pool_dispose(struct spn_device * const device) |
| { |
| spn_allocator_host_perm_free(&device->allocator.host.perm, device->queue_pool); |
| } |
| |
| // |
| // |
| // |
| |
| VkQueue |
| spn_device_queue_next(struct spn_device * const device) |
| { |
| return device->queue_pool->q; |
| } |
| |
| // |
| // |
| // |
| |
| VkQueue |
| spn_device_queue_label(struct spn_device * const device) |
| { |
| return device->queue_pool->q; |
| } |
| |
| // |
| // |
| // |
