src/intel/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 VkResult
  86 __vk_errorf(VkResult error, const char *file, int line, const char *format, ...)
  87 {
  88    va_list ap;
  89    char buffer[256];
  90
  91 #define ERROR_CASE(error) case error: error_str = #error; break;
  92
  93    const char *error_str;
  94    switch ((int32_t)error) {
  95
  96    /* Core errors */
  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)
 105
 106    /* Extension errors */
 107    ERROR_CASE(VK_ERROR_OUT_OF_DATE_KHR)
 108
 109    default:
 110       assert(!"Unknown error");
 111       error_str = "unknown error";
 112    }
 113
 114 #undef ERROR_CASE
 115
 116    if (format) {
 117       va_start(ap, format);
 118       vsnprintf(buffer, sizeof(buffer), format, ap);
 119       va_end(ap);
 120
 121       fprintf(stderr, "%s:%d: %s (%s)\n", file, line, buffer, error_str);
 122    } else {
 123       fprintf(stderr, "%s:%d: %s\n", file, line, error_str);
 124    }
 125
 126    return error;
 127 }
 128
 129 int
 130 anv_vector_init(struct anv_vector *vector, uint32_t element_size, uint32_t size)
 131 {
 132    assert(util_is_power_of_two(size));
 133    assert(element_size < size && util_is_power_of_two(element_size));
 134
 135    vector->head = 0;
 136    vector->tail = 0;
 137    vector->element_size = element_size;
 138    vector->size = size;
 139    vector->data = malloc(size);
 140
 141    return vector->data != NULL;
 142 }
 143
 144 void *
 145 anv_vector_add(struct anv_vector *vector)
 146 {
 147    uint32_t offset, size, split, src_tail, dst_tail;
 148    void *data;
 149
 150    if (vector->head - vector->tail == vector->size) {
 151       size = vector->size * 2;
 152       data = malloc(size);
 153       if (data == NULL)
 154          return NULL;
 155       src_tail = vector->tail & (vector->size - 1);
 156       dst_tail = vector->tail & (size - 1);
 157       if (src_tail == 0) {
 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.
 160           */
 161          memcpy(data + dst_tail, vector->data, vector->size);
 162       } else {
 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.
 167           */
 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);
 174       }
 175       free(vector->data);
 176       vector->data = data;
 177       vector->size = size;
 178    }
 179
 180    assert(vector->head - vector->tail < vector->size);
 181
 182    offset = vector->head & (vector->size - 1);
 183    vector->head += vector->element_size;
 184
 185    return vector->data + offset;
 186 }
 187
 188 void *
 189 anv_vector_remove(struct anv_vector *vector)
 190 {
 191    uint32_t offset;
 192
 193    if (vector->head == vector->tail)
 194       return NULL;
 195
 196    assert(vector->head - vector->tail <= vector->size);
 197
 198    offset = vector->tail & (vector->size - 1);
 199    vector->tail += vector->element_size;
 200
 201    return vector->data + offset;
 202 }