2017-06-22 12:13:25 -07:00
|
|
|
/*
|
|
|
|
* Copyright © 2017 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 "nir.h"
|
|
|
|
#include "nir_builder.h"
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \file nir_opt_intrinsics.c
|
|
|
|
*/
|
|
|
|
|
2020-10-23 16:48:38 -05:00
|
|
|
static bool
|
|
|
|
src_is_single_use_shuffle(nir_src src, nir_ssa_def **data, nir_ssa_def **index)
|
|
|
|
{
|
|
|
|
nir_intrinsic_instr *shuffle = nir_src_as_intrinsic(src);
|
|
|
|
if (shuffle == NULL || shuffle->intrinsic != nir_intrinsic_shuffle)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
/* This is only called when src is part of an ALU op so requiring no if
|
|
|
|
* uses is reasonable. If we ever want to use this from an if statement,
|
|
|
|
* we can change it then.
|
|
|
|
*/
|
2023-04-06 13:19:31 -04:00
|
|
|
if (!list_is_singular(&shuffle->dest.ssa.uses))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (nir_ssa_def_used_by_if(&shuffle->dest.ssa))
|
2020-10-23 16:48:38 -05:00
|
|
|
return false;
|
|
|
|
|
|
|
|
assert(shuffle->src[0].is_ssa);
|
|
|
|
assert(shuffle->src[1].is_ssa);
|
|
|
|
|
|
|
|
*data = shuffle->src[0].ssa;
|
|
|
|
*index = shuffle->src[1].ssa;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static nir_ssa_def *
|
2021-02-04 15:45:11 -06:00
|
|
|
try_opt_bcsel_of_shuffle(nir_builder *b, nir_alu_instr *alu,
|
|
|
|
bool block_has_discard)
|
2020-10-23 16:48:38 -05:00
|
|
|
{
|
|
|
|
assert(alu->op == nir_op_bcsel);
|
|
|
|
|
2021-02-04 15:45:11 -06:00
|
|
|
/* If we've seen a discard in this block, don't do the optimization. We
|
|
|
|
* could try to do something fancy where we check if the shuffle is on our
|
|
|
|
* side of the discard or not but this is good enough for correctness for
|
|
|
|
* now and subgroup ops in the presence of discard aren't common.
|
|
|
|
*/
|
|
|
|
if (block_has_discard)
|
|
|
|
return false;
|
|
|
|
|
2020-10-23 16:48:38 -05:00
|
|
|
if (!nir_alu_src_is_trivial_ssa(alu, 0))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
nir_ssa_def *data1, *index1;
|
|
|
|
if (!nir_alu_src_is_trivial_ssa(alu, 1) ||
|
2021-02-04 15:45:11 -06:00
|
|
|
alu->src[1].src.ssa->parent_instr->block != alu->instr.block ||
|
2020-10-23 16:48:38 -05:00
|
|
|
!src_is_single_use_shuffle(alu->src[1].src, &data1, &index1))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
nir_ssa_def *data2, *index2;
|
|
|
|
if (!nir_alu_src_is_trivial_ssa(alu, 2) ||
|
2021-02-04 15:45:11 -06:00
|
|
|
alu->src[2].src.ssa->parent_instr->block != alu->instr.block ||
|
2020-10-23 16:48:38 -05:00
|
|
|
!src_is_single_use_shuffle(alu->src[2].src, &data2, &index2))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (data1 != data2)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
nir_ssa_def *index = nir_bcsel(b, alu->src[0].src.ssa, index1, index2);
|
2021-02-15 15:48:55 -06:00
|
|
|
nir_ssa_def *shuffle = nir_shuffle(b, data1, index);
|
2021-01-01 20:37:53 +01:00
|
|
|
|
|
|
|
return shuffle;
|
2020-10-23 16:48:38 -05:00
|
|
|
}
|
|
|
|
|
2023-06-13 14:07:53 +01:00
|
|
|
static bool
|
|
|
|
src_is_quad_broadcast(nir_block *block, nir_src src, nir_intrinsic_instr **intrin)
|
|
|
|
{
|
|
|
|
nir_intrinsic_instr *broadcast = nir_src_as_intrinsic(src);
|
|
|
|
if (broadcast == NULL || broadcast->instr.block != block)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
switch (broadcast->intrinsic) {
|
|
|
|
case nir_intrinsic_quad_broadcast:
|
|
|
|
if (!nir_src_is_const(broadcast->src[1]))
|
|
|
|
return false;
|
|
|
|
FALLTHROUGH;
|
|
|
|
case nir_intrinsic_quad_swap_horizontal:
|
|
|
|
case nir_intrinsic_quad_swap_vertical:
|
|
|
|
case nir_intrinsic_quad_swap_diagonal:
|
|
|
|
case nir_intrinsic_quad_swizzle_amd:
|
|
|
|
*intrin = broadcast;
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool
|
|
|
|
src_is_alu(nir_op op, nir_src src, nir_src srcs[2])
|
|
|
|
{
|
|
|
|
nir_alu_instr *alu = nir_src_as_alu_instr(src);
|
|
|
|
if (alu == NULL || alu->op != op)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!nir_alu_src_is_trivial_ssa(alu, 0) || !nir_alu_src_is_trivial_ssa(alu, 1))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
srcs[0] = alu->src[0].src;
|
|
|
|
srcs[1] = alu->src[1].src;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static nir_ssa_def *
|
|
|
|
try_opt_quad_vote(nir_builder *b, nir_alu_instr *alu, bool block_has_discard)
|
|
|
|
{
|
|
|
|
if (block_has_discard)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (!nir_alu_src_is_trivial_ssa(alu, 0) || !nir_alu_src_is_trivial_ssa(alu, 1))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
nir_intrinsic_instr *quad_broadcasts[4];
|
|
|
|
nir_src srcs[2][2];
|
|
|
|
bool found = false;
|
|
|
|
|
|
|
|
/* Match (broadcast0 op broadcast1) op (broadcast2 op broadcast3). */
|
|
|
|
found = src_is_alu(alu->op, alu->src[0].src, srcs[0]) &&
|
|
|
|
src_is_alu(alu->op, alu->src[1].src, srcs[1]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[0][0], &quad_broadcasts[0]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[0][1], &quad_broadcasts[1]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[1][0], &quad_broadcasts[2]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[1][1], &quad_broadcasts[3]);
|
|
|
|
|
|
|
|
/* Match ((broadcast2 op broadcast3) op broadcast1) op broadcast0). */
|
|
|
|
if (!found) {
|
|
|
|
if ((src_is_alu(alu->op, alu->src[0].src, srcs[0]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, alu->src[1].src, &quad_broadcasts[0])) ||
|
|
|
|
(src_is_alu(alu->op, alu->src[1].src, srcs[0]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, alu->src[0].src, &quad_broadcasts[0]))) {
|
|
|
|
/* ((broadcast2 || broadcast3) || broadcast1) */
|
|
|
|
if ((src_is_alu(alu->op, srcs[0][0], srcs[1]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[0][1], &quad_broadcasts[1])) ||
|
|
|
|
(src_is_alu(alu->op, srcs[0][1], srcs[1]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[0][0], &quad_broadcasts[1]))) {
|
|
|
|
/* (broadcast2 || broadcast3) */
|
|
|
|
found = src_is_quad_broadcast(alu->instr.block, srcs[1][0], &quad_broadcasts[2]) &&
|
|
|
|
src_is_quad_broadcast(alu->instr.block, srcs[1][1], &quad_broadcasts[3]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!found)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Check if each lane in a quad reduces all lanes in the quad, and if all broadcasts read the
|
|
|
|
* same data.
|
|
|
|
*/
|
|
|
|
uint16_t lanes_read = 0;
|
|
|
|
for (unsigned i = 0; i < 4; i++) {
|
|
|
|
if (!nir_srcs_equal(quad_broadcasts[i]->src[0], quad_broadcasts[0]->src[0]))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
for (unsigned j = 0; j < 4; j++) {
|
|
|
|
unsigned lane;
|
|
|
|
switch (quad_broadcasts[i]->intrinsic) {
|
|
|
|
case nir_intrinsic_quad_broadcast:
|
|
|
|
lane = nir_src_as_uint(quad_broadcasts[i]->src[1]) & 0x3;
|
|
|
|
break;
|
|
|
|
case nir_intrinsic_quad_swap_horizontal:
|
|
|
|
lane = j ^ 1;
|
|
|
|
break;
|
|
|
|
case nir_intrinsic_quad_swap_vertical:
|
|
|
|
lane = j ^ 2;
|
|
|
|
break;
|
|
|
|
case nir_intrinsic_quad_swap_diagonal:
|
|
|
|
lane = 3 - j;
|
|
|
|
break;
|
|
|
|
case nir_intrinsic_quad_swizzle_amd:
|
|
|
|
lane = (nir_intrinsic_swizzle_mask(quad_broadcasts[i]) >> (j * 2)) & 0x3;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
unreachable();
|
|
|
|
}
|
|
|
|
lanes_read |= (1 << lane) << (j * 4);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (lanes_read != 0xffff)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Create reduction. */
|
|
|
|
return nir_reduce(b, quad_broadcasts[0]->src[0].ssa, .reduction_op = alu->op, .cluster_size = 4,
|
|
|
|
.include_helpers = true);
|
|
|
|
}
|
|
|
|
|
2020-10-23 16:48:38 -05:00
|
|
|
static bool
|
2021-02-04 15:45:11 -06:00
|
|
|
opt_intrinsics_alu(nir_builder *b, nir_alu_instr *alu,
|
2023-06-13 14:07:53 +01:00
|
|
|
bool block_has_discard, const struct nir_shader_compiler_options *options)
|
2020-10-23 16:48:38 -05:00
|
|
|
{
|
|
|
|
nir_ssa_def *replacement = NULL;
|
|
|
|
|
|
|
|
switch (alu->op) {
|
|
|
|
case nir_op_bcsel:
|
2021-02-04 15:45:11 -06:00
|
|
|
replacement = try_opt_bcsel_of_shuffle(b, alu, block_has_discard);
|
2020-10-23 16:48:38 -05:00
|
|
|
break;
|
2023-06-13 14:07:53 +01:00
|
|
|
case nir_op_iand:
|
|
|
|
case nir_op_ior:
|
|
|
|
if (nir_dest_bit_size(alu->dest.dest) == 1 && options->optimize_quad_vote_to_reduce)
|
|
|
|
replacement = try_opt_quad_vote(b, alu, block_has_discard);
|
|
|
|
break;
|
2020-10-23 16:48:38 -05:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (replacement) {
|
|
|
|
nir_ssa_def_rewrite_uses(&alu->dest.dest.ssa,
|
2021-03-03 00:13:38 -06:00
|
|
|
replacement);
|
2020-10-23 16:48:38 -05:00
|
|
|
nir_instr_remove(&alu->instr);
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-10-23 16:05:29 -05:00
|
|
|
static bool
|
|
|
|
opt_intrinsics_intrin(nir_builder *b, nir_intrinsic_instr *intrin,
|
|
|
|
const struct nir_shader_compiler_options *options)
|
|
|
|
{
|
|
|
|
switch (intrin->intrinsic) {
|
|
|
|
case nir_intrinsic_load_sample_mask_in: {
|
|
|
|
/* Transform:
|
|
|
|
* gl_SampleMaskIn == 0 ---> gl_HelperInvocation
|
|
|
|
* gl_SampleMaskIn != 0 ---> !gl_HelperInvocation
|
|
|
|
*/
|
|
|
|
if (!options->optimize_sample_mask_in)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
bool progress = false;
|
|
|
|
nir_foreach_use_safe(use_src, &intrin->dest.ssa) {
|
|
|
|
if (use_src->parent_instr->type == nir_instr_type_alu) {
|
|
|
|
nir_alu_instr *alu = nir_instr_as_alu(use_src->parent_instr);
|
|
|
|
|
|
|
|
if (alu->op == nir_op_ieq ||
|
|
|
|
alu->op == nir_op_ine) {
|
|
|
|
/* Check for 0 in either operand. */
|
|
|
|
nir_const_value *const_val =
|
|
|
|
nir_src_as_const_value(alu->src[0].src);
|
|
|
|
if (!const_val)
|
|
|
|
const_val = nir_src_as_const_value(alu->src[1].src);
|
|
|
|
if (!const_val || const_val->i32 != 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
nir_ssa_def *new_expr = nir_load_helper_invocation(b, 1);
|
|
|
|
|
|
|
|
if (alu->op == nir_op_ine)
|
|
|
|
new_expr = nir_inot(b, new_expr);
|
|
|
|
|
|
|
|
nir_ssa_def_rewrite_uses(&alu->dest.dest.ssa,
|
2021-03-03 00:13:38 -06:00
|
|
|
new_expr);
|
2020-10-23 16:05:29 -05:00
|
|
|
nir_instr_remove(&alu->instr);
|
|
|
|
progress = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return progress;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-06-22 12:13:25 -07:00
|
|
|
static bool
|
2019-04-09 21:40:33 -04:00
|
|
|
opt_intrinsics_impl(nir_function_impl *impl,
|
|
|
|
const struct nir_shader_compiler_options *options)
|
2017-06-22 12:13:25 -07:00
|
|
|
{
|
2023-06-26 10:42:29 -04:00
|
|
|
nir_builder b = nir_builder_create(impl);
|
2017-06-22 12:13:25 -07:00
|
|
|
bool progress = false;
|
|
|
|
|
|
|
|
nir_foreach_block(block, impl) {
|
2021-02-04 15:45:11 -06:00
|
|
|
bool block_has_discard = false;
|
|
|
|
|
2017-06-22 12:13:25 -07:00
|
|
|
nir_foreach_instr_safe(instr, block) {
|
|
|
|
b.cursor = nir_before_instr(instr);
|
|
|
|
|
2020-10-23 16:05:29 -05:00
|
|
|
switch (instr->type) {
|
2020-10-23 16:48:38 -05:00
|
|
|
case nir_instr_type_alu:
|
2021-02-04 15:45:11 -06:00
|
|
|
if (opt_intrinsics_alu(&b, nir_instr_as_alu(instr),
|
2023-06-13 14:07:53 +01:00
|
|
|
block_has_discard, options))
|
2020-10-23 16:48:38 -05:00
|
|
|
progress = true;
|
|
|
|
break;
|
|
|
|
|
2021-02-04 15:45:11 -06:00
|
|
|
case nir_instr_type_intrinsic: {
|
|
|
|
nir_intrinsic_instr *intrin = nir_instr_as_intrinsic(instr);
|
|
|
|
if (intrin->intrinsic == nir_intrinsic_discard ||
|
|
|
|
intrin->intrinsic == nir_intrinsic_discard_if ||
|
|
|
|
intrin->intrinsic == nir_intrinsic_demote ||
|
|
|
|
intrin->intrinsic == nir_intrinsic_demote_if ||
|
|
|
|
intrin->intrinsic == nir_intrinsic_terminate ||
|
|
|
|
intrin->intrinsic == nir_intrinsic_terminate_if)
|
|
|
|
block_has_discard = true;
|
|
|
|
|
|
|
|
if (opt_intrinsics_intrin(&b, intrin, options))
|
2020-10-23 16:05:29 -05:00
|
|
|
progress = true;
|
|
|
|
break;
|
2021-02-04 15:45:11 -06:00
|
|
|
}
|
2020-10-23 16:05:29 -05:00
|
|
|
|
2017-06-22 12:13:25 -07:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return progress;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
nir_opt_intrinsics(nir_shader *shader)
|
|
|
|
{
|
|
|
|
bool progress = false;
|
|
|
|
|
2023-06-22 13:27:59 -04:00
|
|
|
nir_foreach_function_impl(impl, shader) {
|
|
|
|
if (opt_intrinsics_impl(impl, shader->options)) {
|
2017-08-22 12:18:32 -07:00
|
|
|
progress = true;
|
2023-06-22 13:27:59 -04:00
|
|
|
nir_metadata_preserve(impl, nir_metadata_block_index |
|
|
|
|
nir_metadata_dominance);
|
2020-05-21 20:41:12 -05:00
|
|
|
} else {
|
2023-06-22 13:27:59 -04:00
|
|
|
nir_metadata_preserve(impl, nir_metadata_all);
|
2017-08-22 12:18:32 -07:00
|
|
|
}
|
2017-06-22 12:13:25 -07:00
|
|
|
}
|
|
|
|
|
2017-08-22 12:18:32 -07:00
|
|
|
return progress;
|
2017-06-22 12:13:25 -07:00
|
|
|
}
|