2 * Copyright © 2015 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
31 #include "anv_private.h"
33 /** Log an error message. */
34 void anv_printflike(1, 2)
35 anv_loge(const char *format
, ...)
40 anv_loge_v(format
, va
);
44 /** \see anv_loge() */
46 anv_loge_v(const char *format
, va_list va
)
48 fprintf(stderr
, "vk: error: ");
49 vfprintf(stderr
, format
, va
);
50 fprintf(stderr
, "\n");
53 void anv_printflike(3, 4)
54 __anv_finishme(const char *file
, int line
, const char *format
, ...)
60 vsnprintf(buffer
, sizeof(buffer
), format
, ap
);
63 fprintf(stderr
, "%s:%d: FINISHME: %s\n", file
, line
, buffer
);
66 void anv_noreturn
anv_printflike(1, 2)
67 anv_abortf(const char *format
, ...)
72 anv_abortfv(format
, va
);
77 anv_abortfv(const char *format
, va_list va
)
79 fprintf(stderr
, "vk: error: ");
80 vfprintf(stderr
, format
, va
);
81 fprintf(stderr
, "\n");
86 __vk_errorf(VkResult error
, const char *file
, int line
, const char *format
, ...)
91 #define ERROR_CASE(error) case error: error_str = #error; break;
93 const char *error_str
;
94 switch ((int32_t)error
) {
97 ERROR_CASE(VK_ERROR_OUT_OF_HOST_MEMORY
)
98 ERROR_CASE(VK_ERROR_OUT_OF_DEVICE_MEMORY
)
99 ERROR_CASE(VK_ERROR_INITIALIZATION_FAILED
)
100 ERROR_CASE(VK_ERROR_DEVICE_LOST
)
101 ERROR_CASE(VK_ERROR_MEMORY_MAP_FAILED
)
102 ERROR_CASE(VK_ERROR_LAYER_NOT_PRESENT
)
103 ERROR_CASE(VK_ERROR_EXTENSION_NOT_PRESENT
)
104 ERROR_CASE(VK_ERROR_INCOMPATIBLE_DRIVER
)
106 /* Extension errors */
107 ERROR_CASE(VK_ERROR_OUT_OF_DATE_KHR
)
110 assert(!"Unknown error");
111 error_str
= "unknown error";
117 va_start(ap
, format
);
118 vsnprintf(buffer
, sizeof(buffer
), format
, ap
);
121 fprintf(stderr
, "%s:%d: %s (%s)\n", file
, line
, buffer
, error_str
);
123 fprintf(stderr
, "%s:%d: %s\n", file
, line
, error_str
);
130 anv_vector_init(struct anv_vector
*vector
, uint32_t element_size
, uint32_t size
)
132 assert(util_is_power_of_two(size
));
133 assert(element_size
< size
&& util_is_power_of_two(element_size
));
137 vector
->element_size
= element_size
;
139 vector
->data
= malloc(size
);
141 return vector
->data
!= NULL
;
145 anv_vector_add(struct anv_vector
*vector
)
147 uint32_t offset
, size
, split
, src_tail
, dst_tail
;
150 if (vector
->head
- vector
->tail
== vector
->size
) {
151 size
= vector
->size
* 2;
155 src_tail
= vector
->tail
& (vector
->size
- 1);
156 dst_tail
= vector
->tail
& (size
- 1);
158 /* Since we know that the vector is full, this means that it's
159 * linear from start to end so we can do one copy.
161 memcpy(data
+ dst_tail
, vector
->data
, vector
->size
);
163 /* In this case, the vector is split into two pieces and we have
164 * to do two copies. We have to be careful to make sure each
165 * piece goes to the right locations. Thanks to the change in
166 * size, it may or may not still wrap around.
168 split
= align_u32(vector
->tail
, vector
->size
);
169 assert(vector
->tail
<= split
&& split
< vector
->head
);
170 memcpy(data
+ dst_tail
, vector
->data
+ src_tail
,
171 split
- vector
->tail
);
172 memcpy(data
+ (split
& (size
- 1)), vector
->data
,
173 vector
->head
- split
);
180 assert(vector
->head
- vector
->tail
< vector
->size
);
182 offset
= vector
->head
& (vector
->size
- 1);
183 vector
->head
+= vector
->element_size
;
185 return vector
->data
+ offset
;
189 anv_vector_remove(struct anv_vector
*vector
)
193 if (vector
->head
== vector
->tail
)
196 assert(vector
->head
- vector
->tail
<= vector
->size
);
198 offset
= vector
->tail
& (vector
->size
- 1);
199 vector
->tail
+= vector
->element_size
;
201 return vector
->data
+ offset
;