Files
mesa/src/asahi/lib/tests/test-packing.cpp
T
2022-10-22 14:59:25 -04:00

114 lines
3.3 KiB
C++

/*
* Copyright (C) 2022 Alyssa Rosenzweig
*
* 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 "agx_pack.h"
#include <gtest/gtest.h>
const struct {
float f;
uint16_t encoded;
bool inexact;
} lod_cases[] = {
/* Lower bound clamp */
{ -INFINITY, 0x00, true },
{ -0.1, 0x00, true },
{ -0.0, 0x00, true },
/* Exact bounds */
{ 0.0, 0x00 },
{ 14.0, 0x380 },
/* Upper bound clamp */
{ 14.1, 0x380, true },
{ 18.1, 0x380, true },
{ INFINITY, 0x380, true },
};
const struct {
uint32_t group_size;
uint32_t length;
uint32_t value;
uint32_t encoded;
} group_cases[] = {
/* Groups of 16 in a 4-bit word */
{ 16, 4, 0, 0x1 },
{ 16, 4, 1, 0x1 },
{ 16, 4, 16, 0x1 },
{ 16, 4, 17, 0x2 },
{ 16, 4, 31, 0x2 },
{ 16, 4, 32, 0x2 },
{ 16, 4, 33, 0x3 },
{ 16, 4, 239, 0xF },
{ 16, 4, 240, 0xF },
{ 16, 4, 241, 0x0 },
{ 16, 4, 255, 0x0 },
{ 16, 4, 256, 0x0 },
};
TEST(LODClamp, Encode)
{
for (unsigned i = 0; i < ARRAY_SIZE(lod_cases); ++i)
ASSERT_EQ(__gen_pack_lod(lod_cases[i].f, 0, 9), lod_cases[i].encoded);
}
TEST(LODClamp, Decode)
{
for (unsigned i = 0; i < ARRAY_SIZE(lod_cases); ++i) {
if (lod_cases[i].inexact)
continue;
uint8_t cl[4] = { 0 };
memcpy(cl, &lod_cases[i].encoded, sizeof(lod_cases[i].encoded));
ASSERT_EQ(__gen_unpack_lod(cl, 0, 10), lod_cases[i].f);
}
}
TEST(Groups, Encode)
{
for (unsigned i = 0; i < ARRAY_SIZE(group_cases); ++i) {
ASSERT_EQ(__gen_to_groups(group_cases[i].value,
group_cases[i].group_size,
group_cases[i].length),
group_cases[i].encoded);
}
}
TEST(Groups, Decode)
{
for (unsigned i = 0; i < ARRAY_SIZE(group_cases); ++i) {
unsigned expected = ALIGN_POT(group_cases[i].value,
group_cases[i].group_size);
/* Clamp to minimum encodable */
if (group_cases[i].value == 0)
expected = group_cases[i].group_size;
ASSERT_EQ(__gen_from_groups(group_cases[i].encoded,
group_cases[i].group_size,
group_cases[i].length),
expected);
}
}