blob: 4b54944c0c46ceda884789c4ff5b8cc49f140fa1 [file] [log] [blame]
/*
* Copyright (C) 2020-2021 Collabora Ltd.
*
* 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.
*
* Authors (Collabora):
* Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
*/
#ifndef __BI_TEST_H
#define __BI_TEST_H
#include <stdio.h>
#include <inttypes.h>
#include "compiler.h"
/* Helper to generate a bi_builder suitable for creating test instructions */
static inline bi_block *
bit_block(bi_context *ctx)
{
bi_block *blk = rzalloc(ctx, bi_block);
util_dynarray_init(&blk->predecessors, blk);
list_addtail(&blk->link, &ctx->blocks);
list_inithead(&blk->instructions);
blk->index = ctx->num_blocks++;
return blk;
}
static inline bi_builder *
bit_builder(void *memctx)
{
bi_context *ctx = rzalloc(memctx, bi_context);
list_inithead(&ctx->blocks);
ctx->inputs = rzalloc(memctx, struct panfrost_compile_inputs);
bi_block *blk = bit_block(ctx);
bi_builder *b = rzalloc(memctx, bi_builder);
b->shader = ctx;
b->cursor = bi_after_block(blk);
return b;
}
/* Helper to compare for logical equality of instructions. Need to skip over
* the pointers, guaranteed to be first. After that we can compare raw data.
*/
static inline bool
bit_instr_equal(bi_instr *A, bi_instr *B)
{
size_t skip = sizeof(struct list_head) + 2 * sizeof(bi_index *);
if (memcmp((uint8_t *) A + skip, (uint8_t *) B + skip, sizeof(bi_instr) - skip))
return false;
if (memcmp(A->dest, B->dest, sizeof(bi_index) * A->nr_dests))
return false;
if (memcmp(A->src, B->src, sizeof(bi_index) * A->nr_srcs))
return false;
return true;
}
static inline bool
bit_block_equal(bi_block *A, bi_block *B)
{
if (list_length(&A->instructions) != list_length(&B->instructions))
return false;
list_pair_for_each_entry(bi_instr, insA, insB,
&A->instructions, &B->instructions, link) {
if (!bit_instr_equal(insA, insB))
return false;
}
return true;
}
static inline bool
bit_shader_equal(bi_context *A, bi_context *B)
{
if (list_length(&A->blocks) != list_length(&B->blocks))
return false;
list_pair_for_each_entry(bi_block, blockA, blockB,
&A->blocks, &B->blocks, link) {
if (!bit_block_equal(blockA, blockB))
return false;
}
return true;
}
#define ASSERT_SHADER_EQUAL(A, B) \
if (!bit_shader_equal(A, B)) { \
ADD_FAILURE(); \
fprintf(stderr, "Pass produced unexpected results"); \
fprintf(stderr, " Actual:\n"); \
bi_print_shader(A, stderr); \
fprintf(stderr, " Expected:\n"); \
bi_print_shader(B, stderr); \
fprintf(stderr, "\n"); \
} \
#define INSTRUCTION_CASE(instr, expected, pass) do { \
bi_builder *A = bit_builder(mem_ctx); \
bi_builder *B = bit_builder(mem_ctx); \
{ \
bi_builder *b = A; \
instr; \
} \
{ \
bi_builder *b = B; \
expected; \
} \
pass(A->shader); \
ASSERT_SHADER_EQUAL(A->shader, B->shader); \
} while(0)
#endif