src/amd/vulkan/radv_util.c

/*
 * Copyright © 2015 Intel Corporation
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice (including the next
 * paragraph) shall be included in all copies or substantial portions of the
 * Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
 * IN THE SOFTWARE.
 */

#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <assert.h>

#include "radv_private.h"

#include "util/u_math.h"

/** Log an error message.  */
void radv_printflike(1, 2)
	radv_loge(const char *format, ...)
{
	va_list va;

	va_start(va, format);
	radv_loge_v(format, va);
	va_end(va);
}

/** \see radv_loge() */
void
radv_loge_v(const char *format, va_list va)
{
	fprintf(stderr, "vk: error: ");
	vfprintf(stderr, format, va);
	fprintf(stderr, "\n");
}

void radv_printflike(3, 4)
	__radv_finishme(const char *file, int line, const char *format, ...)
{
	va_list ap;
	char buffer[256];

	va_start(ap, format);
	vsnprintf(buffer, sizeof(buffer), format, ap);
	va_end(ap);

	fprintf(stderr, "%s:%d: FINISHME: %s\n", file, line, buffer);
}

void radv_noreturn radv_printflike(1, 2)
	radv_abortf(const char *format, ...)
{
	va_list va;

	va_start(va, format);
	radv_abortfv(format, va);
	va_end(va);
}

void radv_noreturn
radv_abortfv(const char *format, va_list va)
{
	fprintf(stderr, "vk: error: ");
	vfprintf(stderr, format, va);
	fprintf(stderr, "\n");
	abort();
}

VkResult
__vk_errorf(VkResult error, const char *file, int line, const char *format, ...)
{
	va_list ap;
	char buffer[256];

#define ERROR_CASE(error) case error: error_str = #error; break;

	const char *error_str;
	switch ((int32_t)error) {

		/* Core errors */
		ERROR_CASE(VK_ERROR_OUT_OF_HOST_MEMORY)
			ERROR_CASE(VK_ERROR_OUT_OF_DEVICE_MEMORY)
			ERROR_CASE(VK_ERROR_INITIALIZATION_FAILED)
			ERROR_CASE(VK_ERROR_DEVICE_LOST)
			ERROR_CASE(VK_ERROR_MEMORY_MAP_FAILED)
			ERROR_CASE(VK_ERROR_LAYER_NOT_PRESENT)
			ERROR_CASE(VK_ERROR_EXTENSION_NOT_PRESENT)
			ERROR_CASE(VK_ERROR_INCOMPATIBLE_DRIVER)

			/* Extension errors */
			ERROR_CASE(VK_ERROR_OUT_OF_DATE_KHR)

	default:
		assert(!"Unknown error");
		error_str = "unknown error";
	}

#undef ERROR_CASE

	if (format) {
		va_start(ap, format);
		vsnprintf(buffer, sizeof(buffer), format, ap);
		va_end(ap);

		fprintf(stderr, "%s:%d: %s (%s)\n", file, line, buffer, error_str);
	} else {
		fprintf(stderr, "%s:%d: %s\n", file, line, error_str);
	}

	return error;
}

int
radv_vector_init(struct radv_vector *vector, uint32_t element_size, uint32_t size)
{
	assert(util_is_power_of_two(size));
	assert(element_size < size && util_is_power_of_two(element_size));

	vector->head = 0;
	vector->tail = 0;
	vector->element_size = element_size;
	vector->size = size;
	vector->data = malloc(size);

	return vector->data != NULL;
}

void *
radv_vector_add(struct radv_vector *vector)
{
	uint32_t offset, size, split, src_tail, dst_tail;
	void *data;

	if (vector->head - vector->tail == vector->size) {
		size = vector->size * 2;
		data = malloc(size);
		if (data == NULL)
			return NULL;
		src_tail = vector->tail & (vector->size - 1);
		dst_tail = vector->tail & (size - 1);
		if (src_tail == 0) {
			/* Since we know that the vector is full, this means that it's
			 * linear from start to end so we can do one copy.
			 */
			memcpy(data + dst_tail, vector->data, vector->size);
		} else {
			/* In this case, the vector is split into two pieces and we have
			 * to do two copies.  We have to be careful to make sure each
			 * piece goes to the right locations.  Thanks to the change in
			 * size, it may or may not still wrap around.
			 */
			split = align_u32(vector->tail, vector->size);
			assert(vector->tail <= split && split < vector->head);
			memcpy(data + dst_tail, vector->data + src_tail,
			       split - vector->tail);
			memcpy(data + (split & (size - 1)), vector->data,
			       vector->head - split);
		}
		free(vector->data);
		vector->data = data;
		vector->size = size;
	}

	assert(vector->head - vector->tail < vector->size);

	offset = vector->head & (vector->size - 1);
	vector->head += vector->element_size;

	return vector->data + offset;
}

void *
radv_vector_remove(struct radv_vector *vector)
{
	uint32_t offset;

	if (vector->head == vector->tail)
		return NULL;

	assert(vector->head - vector->tail <= vector->size);

	offset = vector->tail & (vector->size - 1);
	vector->tail += vector->element_size;

	return vector->data + offset;
}