2 * Copyright © 2017 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
26 /* common inlines and macros for vulkan drivers */
28 #include <vulkan/vulkan.h>
30 struct vk_struct_common {
31 VkStructureType sType;
32 struct vk_struct_common *pNext;
35 #define vk_foreach_struct(__iter, __start) \
36 for (struct vk_struct_common *__iter = (struct vk_struct_common *)(__start); \
37 __iter; __iter = __iter->pNext)
39 #define vk_foreach_struct_const(__iter, __start) \
40 for (const struct vk_struct_common *__iter = (const struct vk_struct_common *)(__start); \
41 __iter; __iter = __iter->pNext)
44 * A wrapper for a Vulkan output array. A Vulkan output array is one that
45 * follows the convention of the parameters to
46 * vkGetPhysicalDeviceQueueFamilyProperties().
51 * vkGetPhysicalDeviceQueueFamilyProperties(
52 * VkPhysicalDevice physicalDevice,
53 * uint32_t* pQueueFamilyPropertyCount,
54 * VkQueueFamilyProperties* pQueueFamilyProperties)
56 * VK_OUTARRAY_MAKE(props, pQueueFamilyProperties,
57 * pQueueFamilyPropertyCount);
59 * vk_outarray_append(&props, p) {
60 * p->queueFlags = ...;
61 * p->queueCount = ...;
64 * vk_outarray_append(&props, p) {
65 * p->queueFlags = ...;
66 * p->queueCount = ...;
69 * return vk_outarray_status(&props);
72 struct __vk_outarray {
77 * Capacity, in number of elements. Capacity is unlimited (UINT32_MAX) if
83 * Count of elements successfully written to the array. Every write is
84 * considered successful if data is null.
89 * Count of elements that would have been written to the array if its
90 * capacity were sufficient. Vulkan functions often return VK_INCOMPLETE
91 * when `*filled_len < wanted_len`.
97 __vk_outarray_init(struct __vk_outarray *a,
98 void *data, uint32_t *restrict len)
110 static inline VkResult
111 __vk_outarray_status(const struct __vk_outarray *a)
113 if (*a->filled_len < a->wanted_len)
114 return VK_INCOMPLETE;
120 __vk_outarray_next(struct __vk_outarray *a, size_t elem_size)
126 if (*a->filled_len >= a->cap)
130 p = a->data + (*a->filled_len) * elem_size;
137 #define vk_outarray(elem_t) \
139 struct __vk_outarray base; \
143 #define vk_outarray_typeof_elem(a) __typeof__((a)->meta[0])
144 #define vk_outarray_sizeof_elem(a) sizeof((a)->meta[0])
146 #define vk_outarray_init(a, data, len) \
147 __vk_outarray_init(&(a)->base, (data), (len))
149 #define VK_OUTARRAY_MAKE(name, data, len) \
150 vk_outarray(__typeof__((data)[0])) name; \
151 vk_outarray_init(&name, (data), (len))
153 #define vk_outarray_status(a) \
154 __vk_outarray_status(&(a)->base)
156 #define vk_outarray_next(a) \
157 ((vk_outarray_typeof_elem(a) *) \
158 __vk_outarray_next(&(a)->base, vk_outarray_sizeof_elem(a)))
161 * Append to a Vulkan output array.
163 * This is a block-based macro. For example:
165 * vk_outarray_append(&a, elem) {
170 * The array `a` has type `vk_outarray(elem_t) *`. It is usually declared with
171 * VK_OUTARRAY_MAKE(). The variable `elem` is block-scoped and has type
174 * The macro unconditionally increments the array's `wanted_len`. If the array
175 * is not full, then the macro also increment its `filled_len` and then
176 * executes the block. When the block is executed, `elem` is non-null and
177 * points to the newly appended element.
179 #define vk_outarray_append(a, elem) \
180 for (vk_outarray_typeof_elem(a) *elem = vk_outarray_next(a); \
181 elem != NULL; elem = NULL)
184 __vk_find_struct(void *start, VkStructureType sType)
186 vk_foreach_struct(s, start) {
187 if (s->sType == sType)
194 #define vk_find_struct(__start, __sType) \
195 __vk_find_struct((__start), VK_STRUCTURE_TYPE_##__sType)
197 #define vk_find_struct_const(__start, __sType) \
198 (const void *)__vk_find_struct((void *)(__start), VK_STRUCTURE_TYPE_##__sType)
200 #endif /* VK_UTIL_H */