2022-01-26 17:40:28 -08:00
|
|
|
/*
|
|
|
|
* Copyright 2016-2018 Józef Kucia for CodeWeavers
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __VKD3D_TEST_UTILS_H
|
|
|
|
#define __VKD3D_TEST_UTILS_H
|
|
|
|
|
2022-01-26 17:40:33 -08:00
|
|
|
#include <limits.h>
|
2022-01-26 17:40:28 -08:00
|
|
|
#include <stdbool.h>
|
2022-05-17 06:45:38 -07:00
|
|
|
#include <stdint.h>
|
2022-01-26 17:40:28 -08:00
|
|
|
#include <stdlib.h>
|
2022-05-17 06:45:40 -07:00
|
|
|
#include "vkd3d_test.h"
|
2022-01-26 17:40:28 -08:00
|
|
|
|
2022-01-26 17:40:33 -08:00
|
|
|
struct vec2
|
|
|
|
{
|
|
|
|
float x, y;
|
|
|
|
};
|
|
|
|
|
2022-01-26 17:40:28 -08:00
|
|
|
struct vec4
|
|
|
|
{
|
|
|
|
float x, y, z, w;
|
|
|
|
};
|
|
|
|
|
2022-05-17 06:45:38 -07:00
|
|
|
struct resource_readback
|
|
|
|
{
|
|
|
|
uint64_t width;
|
|
|
|
unsigned int height;
|
|
|
|
unsigned int depth;
|
|
|
|
uint64_t row_pitch;
|
|
|
|
void *data;
|
|
|
|
};
|
|
|
|
|
2022-01-26 17:40:28 -08:00
|
|
|
static inline bool vkd3d_array_reserve(void **elements, size_t *capacity, size_t element_count, size_t element_size)
|
|
|
|
{
|
|
|
|
size_t new_capacity, max_capacity;
|
|
|
|
void *new_elements;
|
|
|
|
|
|
|
|
if (element_count <= *capacity)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
max_capacity = ~(size_t)0 / element_size;
|
|
|
|
if (max_capacity < element_count)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
new_capacity = max(*capacity, 4);
|
|
|
|
while (new_capacity < element_count && new_capacity <= max_capacity / 2)
|
|
|
|
new_capacity *= 2;
|
|
|
|
|
|
|
|
if (new_capacity < element_count)
|
|
|
|
new_capacity = element_count;
|
|
|
|
|
|
|
|
if (!(new_elements = realloc(*elements, new_capacity * element_size)))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
*elements = new_elements;
|
|
|
|
*capacity = new_capacity;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-01-26 17:40:33 -08:00
|
|
|
static bool compare_float(float f, float g, unsigned int ulps)
|
|
|
|
{
|
|
|
|
int x, y;
|
|
|
|
union
|
|
|
|
{
|
|
|
|
float f;
|
|
|
|
int i;
|
|
|
|
} u;
|
|
|
|
|
|
|
|
u.f = f;
|
|
|
|
x = u.i;
|
|
|
|
u.f = g;
|
|
|
|
y = u.i;
|
|
|
|
|
|
|
|
if (x < 0)
|
|
|
|
x = INT_MIN - x;
|
|
|
|
if (y < 0)
|
|
|
|
y = INT_MIN - y;
|
|
|
|
|
|
|
|
if (abs(x - y) > ulps)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool compare_vec4(const struct vec4 *v1, const struct vec4 *v2, unsigned int ulps)
|
|
|
|
{
|
|
|
|
return compare_float(v1->x, v2->x, ulps)
|
|
|
|
&& compare_float(v1->y, v2->y, ulps)
|
|
|
|
&& compare_float(v1->z, v2->z, ulps)
|
|
|
|
&& compare_float(v1->w, v2->w, ulps);
|
|
|
|
}
|
|
|
|
|
2022-04-17 23:33:58 -07:00
|
|
|
static inline void set_rect(RECT *rect, int left, int top, int right, int bottom)
|
|
|
|
{
|
|
|
|
rect->left = left;
|
|
|
|
rect->right = right;
|
|
|
|
rect->top = top;
|
|
|
|
rect->bottom = bottom;
|
|
|
|
}
|
|
|
|
|
2022-05-17 06:45:40 -07:00
|
|
|
static void *get_readback_data(const struct resource_readback *rb,
|
|
|
|
unsigned int x, unsigned int y, unsigned int z, size_t element_size)
|
|
|
|
{
|
|
|
|
unsigned int slice_pitch = rb->row_pitch * rb->height;
|
|
|
|
return &((uint8_t *)rb->data)[slice_pitch * z + rb->row_pitch * y + x * element_size];
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct vec4 *get_readback_vec4(const struct resource_readback *rb, unsigned int x, unsigned int y)
|
|
|
|
{
|
|
|
|
return get_readback_data(rb, x, y, 0, sizeof(struct vec4));
|
|
|
|
}
|
|
|
|
|
|
|
|
#define check_readback_data_vec4(a, b, c, d) check_readback_data_vec4_(__LINE__, a, b, c, d)
|
|
|
|
static inline void check_readback_data_vec4_(unsigned int line, const struct resource_readback *rb,
|
|
|
|
const RECT *rect, const struct vec4 *expected, unsigned int max_diff)
|
|
|
|
{
|
|
|
|
RECT r = {0, 0, rb->width, rb->height};
|
|
|
|
unsigned int x = 0, y = 0;
|
|
|
|
struct vec4 got = {0};
|
|
|
|
bool all_match = true;
|
|
|
|
|
|
|
|
if (rect)
|
|
|
|
r = *rect;
|
|
|
|
|
|
|
|
for (y = r.top; y < r.bottom; ++y)
|
|
|
|
{
|
|
|
|
for (x = r.left; x < r.right; ++x)
|
|
|
|
{
|
|
|
|
got = *get_readback_vec4(rb, x, y);
|
|
|
|
if (!compare_vec4(&got, expected, max_diff))
|
|
|
|
{
|
|
|
|
all_match = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!all_match)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ok_(line)(all_match, "Got {%.8e, %.8e, %.8e, %.8e}, expected {%.8e, %.8e, %.8e, %.8e} at (%u, %u).\n",
|
|
|
|
got.x, got.y, got.z, got.w, expected->x, expected->y, expected->z, expected->w, x, y);
|
|
|
|
}
|
|
|
|
|
2022-01-26 17:40:28 -08:00
|
|
|
#endif
|