Merge remote-tracking branch 'mesa-public/master' into vulkan
[mesa.git] / src / vulkan / anv_util.c
1 /*
2 * Copyright © 2015 Intel Corporation
3 *
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:
10 *
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
13 * Software.
14 *
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
21 * IN THE SOFTWARE.
22 */
23
24 #include <stdarg.h>
25 #include <stdio.h>
26 #include <stdlib.h>
27 #include <string.h>
28 #include <errno.h>
29 #include <assert.h>
30
31 #include "anv_private.h"
32
33 /** Log an error message. */
34 void anv_printflike(1, 2)
35 anv_loge(const char *format, ...)
36 {
37 va_list va;
38
39 va_start(va, format);
40 anv_loge_v(format, va);
41 va_end(va);
42 }
43
44 /** \see anv_loge() */
45 void
46 anv_loge_v(const char *format, va_list va)
47 {
48 fprintf(stderr, "vk: error: ");
49 vfprintf(stderr, format, va);
50 fprintf(stderr, "\n");
51 }
52
53 void anv_printflike(3, 4)
54 __anv_finishme(const char *file, int line, const char *format, ...)
55 {
56 va_list ap;
57 char buffer[256];
58
59 va_start(ap, format);
60 vsnprintf(buffer, sizeof(buffer), format, ap);
61 va_end(ap);
62
63 fprintf(stderr, "%s:%d: FINISHME: %s\n", file, line, buffer);
64 }
65
66 void anv_noreturn anv_printflike(1, 2)
67 anv_abortf(const char *format, ...)
68 {
69 va_list va;
70
71 va_start(va, format);
72 anv_abortfv(format, va);
73 va_end(va);
74 }
75
76 void anv_noreturn
77 anv_abortfv(const char *format, va_list va)
78 {
79 fprintf(stderr, "vk: error: ");
80 vfprintf(stderr, format, va);
81 fprintf(stderr, "\n");
82 abort();
83 }
84
85 int
86 anv_vector_init(struct anv_vector *vector, uint32_t element_size, uint32_t size)
87 {
88 assert(util_is_power_of_two(size));
89 assert(element_size < size && util_is_power_of_two(element_size));
90
91 vector->head = 0;
92 vector->tail = 0;
93 vector->element_size = element_size;
94 vector->size = size;
95 vector->data = malloc(size);
96
97 return vector->data != NULL;
98 }
99
100 void *
101 anv_vector_add(struct anv_vector *vector)
102 {
103 uint32_t offset, size, split, tail;
104 void *data;
105
106 if (vector->head - vector->tail == vector->size) {
107 size = vector->size * 2;
108 data = malloc(size);
109 if (data == NULL)
110 return NULL;
111 split = align_u32(vector->tail, vector->size);
112 tail = vector->tail & (vector->size - 1);
113 if (vector->head - split < vector->size) {
114 memcpy(data + tail,
115 vector->data + tail,
116 split - vector->tail);
117 memcpy(data + vector->size,
118 vector->data, vector->head - split);
119 } else {
120 memcpy(data + tail,
121 vector->data + tail,
122 vector->head - vector->tail);
123 }
124 free(vector->data);
125 vector->data = data;
126 vector->size = size;
127 }
128
129 assert(vector->head - vector->tail < vector->size);
130
131 offset = vector->head & (vector->size - 1);
132 vector->head += vector->element_size;
133
134 return vector->data + offset;
135 }
136
137 void *
138 anv_vector_remove(struct anv_vector *vector)
139 {
140 uint32_t offset;
141
142 if (vector->head == vector->tail)
143 return NULL;
144
145 assert(vector->head - vector->tail <= vector->size);
146
147 offset = vector->tail & (vector->size - 1);
148 vector->tail += vector->element_size;
149
150 return vector->data + offset;
151 }