ffb64283ee
To faciliate break optimizations. We use a more efficient lowering than the literal transition of the NIR. Signed-off-by: Alyssa Rosenzweig <alyssa@rosenzweig.io> Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/25052>
99 lines
2.5 KiB
C
99 lines
2.5 KiB
C
/*
|
|
* Copyright 2022 Alyssa Rosenzweig
|
|
* SPDX-License-Identifier: MIT
|
|
*/
|
|
|
|
#include "agx_builder.h"
|
|
#include "agx_compiler.h"
|
|
#include "agx_opcodes.h"
|
|
|
|
/* Lower pseudo instructions created during optimization. */
|
|
|
|
static agx_instr *
|
|
while_for_break_if(agx_builder *b, agx_instr *I)
|
|
{
|
|
if (I->op == AGX_OPCODE_BREAK_IF_FCMP) {
|
|
return agx_while_fcmp(b, I->src[0], I->src[1], I->nest, I->fcond,
|
|
!I->invert_cond);
|
|
} else {
|
|
return agx_while_icmp(b, I->src[0], I->src[1], I->nest, I->icond,
|
|
!I->invert_cond);
|
|
}
|
|
}
|
|
|
|
static agx_instr *
|
|
cmpsel_for_break_if(agx_builder *b, agx_instr *I)
|
|
{
|
|
agx_index r0l = agx_register(0, AGX_SIZE_16);
|
|
|
|
/* If the condition is true, set r0l to nest to break */
|
|
agx_index t = agx_immediate(I->nest);
|
|
agx_index f = r0l;
|
|
|
|
if (I->invert_cond) {
|
|
agx_index temp = t;
|
|
t = f;
|
|
f = temp;
|
|
}
|
|
|
|
if (I->op == AGX_OPCODE_BREAK_IF_FCMP)
|
|
agx_fcmpsel_to(b, r0l, I->src[0], I->src[1], t, f, I->fcond);
|
|
else
|
|
agx_icmpsel_to(b, r0l, I->src[0], I->src[1], t, f, I->icond);
|
|
|
|
return agx_push_exec(b, 0);
|
|
}
|
|
|
|
static agx_instr *
|
|
lower(agx_builder *b, agx_instr *I)
|
|
{
|
|
switch (I->op) {
|
|
|
|
/* Various instructions are implemented as bitwise truth tables */
|
|
case AGX_OPCODE_MOV:
|
|
return agx_bitop_to(b, I->dest[0], I->src[0], agx_zero(), AGX_BITOP_MOV);
|
|
|
|
case AGX_OPCODE_NOT:
|
|
return agx_bitop_to(b, I->dest[0], I->src[0], agx_zero(), AGX_BITOP_NOT);
|
|
|
|
case AGX_OPCODE_AND:
|
|
return agx_bitop_to(b, I->dest[0], I->src[0], I->src[1], AGX_BITOP_AND);
|
|
|
|
case AGX_OPCODE_XOR:
|
|
return agx_bitop_to(b, I->dest[0], I->src[0], I->src[1], AGX_BITOP_XOR);
|
|
|
|
case AGX_OPCODE_OR:
|
|
return agx_bitop_to(b, I->dest[0], I->src[0], I->src[1], AGX_BITOP_OR);
|
|
|
|
/* Writes to the nesting counter lowered to the real register */
|
|
case AGX_OPCODE_BEGIN_CF:
|
|
return agx_mov_imm_to(b, agx_register(0, AGX_SIZE_16), 0);
|
|
|
|
case AGX_OPCODE_BREAK:
|
|
agx_mov_imm_to(b, agx_register(0, AGX_SIZE_16), I->nest);
|
|
return agx_pop_exec(b, 0);
|
|
|
|
case AGX_OPCODE_BREAK_IF_ICMP:
|
|
case AGX_OPCODE_BREAK_IF_FCMP: {
|
|
if (I->nest == 1)
|
|
return while_for_break_if(b, I);
|
|
else
|
|
return cmpsel_for_break_if(b, I);
|
|
}
|
|
|
|
default:
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
void
|
|
agx_lower_pseudo(agx_context *ctx)
|
|
{
|
|
agx_foreach_instr_global_safe(ctx, I) {
|
|
agx_builder b = agx_init_builder(ctx, agx_before_instr(I));
|
|
|
|
if (lower(&b, I))
|
|
agx_remove_instruction(I);
|
|
}
|
|
}
|