2014-11-14 21:35:25 -08:00
|
|
|
/*
|
|
|
|
|
* Copyright © 2014 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.
|
|
|
|
|
*
|
|
|
|
|
* Authors:
|
|
|
|
|
* Jason Ekstrand (jason@jlekstrand.net)
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|
2020-10-01 18:25:37 -05:00
|
|
|
#include "nir.h"
|
|
|
|
|
#include "nir_builder.h"
|
2015-01-22 23:32:16 -05:00
|
|
|
#include "nir_constant_expressions.h"
|
2014-11-14 21:35:25 -08:00
|
|
|
#include <math.h>
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Implements SSA-based constant folding.
|
|
|
|
|
*/
|
|
|
|
|
|
2019-09-26 11:19:07 +01:00
|
|
|
struct constant_fold_state {
|
2019-09-04 17:03:18 +01:00
|
|
|
bool has_load_constant;
|
|
|
|
|
bool has_indirect_load_const;
|
2019-09-26 11:19:07 +01:00
|
|
|
};
|
|
|
|
|
|
2014-11-14 21:35:25 -08:00
|
|
|
static bool
|
2020-10-01 18:29:08 -05:00
|
|
|
try_fold_alu(nir_builder *b, nir_alu_instr *instr)
|
2014-11-14 21:35:25 -08:00
|
|
|
{
|
2019-03-27 00:59:03 +01:00
|
|
|
nir_const_value src[NIR_MAX_VEC_COMPONENTS][NIR_MAX_VEC_COMPONENTS];
|
2014-11-14 21:35:25 -08:00
|
|
|
|
|
|
|
|
if (!instr->dest.dest.is_ssa)
|
|
|
|
|
return false;
|
|
|
|
|
|
2015-08-14 10:45:06 -07:00
|
|
|
/* In the case that any outputs/inputs have unsized types, then we need to
|
|
|
|
|
* guess the bit-size. In this case, the validator ensures that all
|
|
|
|
|
* bit-sizes match so we can just take the bit-size from first
|
|
|
|
|
* output/input with an unsized type. If all the outputs/inputs are sized
|
|
|
|
|
* then we don't need to guess the bit-size at all because the code we
|
|
|
|
|
* generate for constant opcodes in this case already knows the sizes of
|
|
|
|
|
* the types involved and does not need the provided bit-size for anything
|
|
|
|
|
* (although it still requires to receive a valid bit-size).
|
|
|
|
|
*/
|
|
|
|
|
unsigned bit_size = 0;
|
|
|
|
|
if (!nir_alu_type_get_type_size(nir_op_infos[instr->op].output_type))
|
|
|
|
|
bit_size = instr->dest.dest.ssa.bit_size;
|
|
|
|
|
|
2014-11-14 21:35:25 -08:00
|
|
|
for (unsigned i = 0; i < nir_op_infos[instr->op].num_inputs; i++) {
|
|
|
|
|
if (!instr->src[i].src.is_ssa)
|
|
|
|
|
return false;
|
|
|
|
|
|
2018-12-06 14:31:20 -06:00
|
|
|
if (bit_size == 0 &&
|
|
|
|
|
!nir_alu_type_get_type_size(nir_op_infos[instr->op].input_types[i]))
|
2015-08-14 10:45:06 -07:00
|
|
|
bit_size = instr->src[i].src.ssa->bit_size;
|
|
|
|
|
|
2015-01-22 23:32:16 -05:00
|
|
|
nir_instr *src_instr = instr->src[i].src.ssa->parent_instr;
|
|
|
|
|
|
|
|
|
|
if (src_instr->type != nir_instr_type_load_const)
|
2014-11-14 21:35:25 -08:00
|
|
|
return false;
|
2015-01-22 23:32:16 -05:00
|
|
|
nir_load_const_instr* load_const = nir_instr_as_load_const(src_instr);
|
|
|
|
|
|
2015-01-25 11:47:53 -05:00
|
|
|
for (unsigned j = 0; j < nir_ssa_alu_instr_src_components(instr, i);
|
|
|
|
|
j++) {
|
2019-03-27 18:27:39 -05:00
|
|
|
src[i][j] = load_const->value[instr->src[i].swizzle[j]];
|
2015-01-22 23:32:16 -05:00
|
|
|
}
|
2014-11-14 21:35:25 -08:00
|
|
|
|
|
|
|
|
/* We shouldn't have any source modifiers in the optimization loop. */
|
|
|
|
|
assert(!instr->src[i].abs && !instr->src[i].negate);
|
|
|
|
|
}
|
|
|
|
|
|
2015-08-14 10:45:06 -07:00
|
|
|
if (bit_size == 0)
|
|
|
|
|
bit_size = 32;
|
|
|
|
|
|
2014-11-14 21:35:25 -08:00
|
|
|
/* We shouldn't have any saturate modifiers in the optimization loop. */
|
|
|
|
|
assert(!instr->dest.saturate);
|
|
|
|
|
|
2019-03-27 00:59:03 +01:00
|
|
|
nir_const_value dest[NIR_MAX_VEC_COMPONENTS];
|
|
|
|
|
nir_const_value *srcs[NIR_MAX_VEC_COMPONENTS];
|
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
|
|
|
for (unsigned i = 0; i < nir_op_infos[instr->op].num_inputs; ++i)
|
|
|
|
|
srcs[i] = src[i];
|
|
|
|
|
nir_eval_const_opcode(instr->op, dest, instr->dest.dest.ssa.num_components,
|
2020-10-01 18:25:37 -05:00
|
|
|
bit_size, srcs,
|
|
|
|
|
b->shader->info.float_controls_execution_mode);
|
|
|
|
|
|
|
|
|
|
b->cursor = nir_before_instr(&instr->instr);
|
|
|
|
|
nir_ssa_def *imm = nir_build_imm(b, instr->dest.dest.ssa.num_components,
|
|
|
|
|
instr->dest.dest.ssa.bit_size,
|
|
|
|
|
dest);
|
|
|
|
|
nir_ssa_def_rewrite_uses(&instr->dest.dest.ssa, nir_src_for_ssa(imm));
|
2014-11-14 21:35:25 -08:00
|
|
|
nir_instr_remove(&instr->instr);
|
2020-10-01 18:25:37 -05:00
|
|
|
|
2014-11-14 21:35:25 -08:00
|
|
|
ralloc_free(instr);
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2014-12-05 12:05:55 -08:00
|
|
|
static bool
|
2020-10-01 18:29:08 -05:00
|
|
|
try_fold_intrinsic(nir_builder *b, nir_intrinsic_instr *instr,
|
|
|
|
|
struct constant_fold_state *state)
|
2014-12-05 12:05:55 -08:00
|
|
|
{
|
|
|
|
|
bool progress = false;
|
|
|
|
|
|
2019-07-18 13:39:49 +02:00
|
|
|
if ((instr->intrinsic == nir_intrinsic_demote_if ||
|
|
|
|
|
instr->intrinsic == nir_intrinsic_discard_if) &&
|
2018-10-22 15:53:14 -05:00
|
|
|
nir_src_is_const(instr->src[0])) {
|
|
|
|
|
if (nir_src_as_bool(instr->src[0])) {
|
2020-10-01 18:25:37 -05:00
|
|
|
b->cursor = nir_before_instr(&instr->instr);
|
2019-07-18 13:39:49 +02:00
|
|
|
nir_intrinsic_op op = instr->intrinsic == nir_intrinsic_discard_if ?
|
|
|
|
|
nir_intrinsic_discard :
|
|
|
|
|
nir_intrinsic_demote;
|
2020-10-01 18:25:37 -05:00
|
|
|
nir_intrinsic_instr *new_instr =
|
|
|
|
|
nir_intrinsic_instr_create(b->shader, op);
|
|
|
|
|
nir_builder_instr_insert(b, &new_instr->instr);
|
2016-03-15 18:32:19 -07:00
|
|
|
}
|
2020-10-01 18:25:37 -05:00
|
|
|
nir_instr_remove(&instr->instr);
|
|
|
|
|
progress = true;
|
2019-09-04 17:03:18 +01:00
|
|
|
} else if (instr->intrinsic == nir_intrinsic_load_constant) {
|
|
|
|
|
state->has_load_constant = true;
|
|
|
|
|
|
|
|
|
|
if (!nir_src_is_const(instr->src[0])) {
|
|
|
|
|
state->has_indirect_load_const = true;
|
|
|
|
|
return progress;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned offset = nir_src_as_uint(instr->src[0]);
|
|
|
|
|
unsigned base = nir_intrinsic_base(instr);
|
|
|
|
|
unsigned range = nir_intrinsic_range(instr);
|
2020-10-01 18:25:37 -05:00
|
|
|
assert(base + range <= b->shader->constant_data_size);
|
2019-09-04 17:03:18 +01:00
|
|
|
|
2020-10-01 18:25:37 -05:00
|
|
|
b->cursor = nir_before_instr(&instr->instr);
|
|
|
|
|
nir_ssa_def *val;
|
2019-09-04 17:03:18 +01:00
|
|
|
if (offset >= range) {
|
2020-10-01 18:25:37 -05:00
|
|
|
val = nir_ssa_undef(b, instr->dest.ssa.num_components,
|
|
|
|
|
instr->dest.ssa.bit_size);
|
2019-09-04 17:03:18 +01:00
|
|
|
} else {
|
2020-10-01 18:25:37 -05:00
|
|
|
nir_const_value imm[NIR_MAX_VEC_COMPONENTS];
|
|
|
|
|
uint8_t *data = (uint8_t*)b->shader->constant_data + base;
|
2019-09-04 17:03:18 +01:00
|
|
|
for (unsigned i = 0; i < instr->num_components; i++) {
|
|
|
|
|
unsigned bytes = instr->dest.ssa.bit_size / 8;
|
|
|
|
|
bytes = MIN2(bytes, range - offset);
|
|
|
|
|
|
2020-10-01 18:25:37 -05:00
|
|
|
memcpy(&imm[i].u64, data + offset, bytes);
|
2019-09-04 17:03:18 +01:00
|
|
|
offset += bytes;
|
|
|
|
|
}
|
2020-10-01 18:25:37 -05:00
|
|
|
val = nir_build_imm(b, instr->dest.ssa.num_components,
|
|
|
|
|
instr->dest.ssa.bit_size, imm);
|
2019-09-04 17:03:18 +01:00
|
|
|
}
|
2020-10-01 18:25:37 -05:00
|
|
|
nir_ssa_def_rewrite_uses(&instr->dest.ssa, nir_src_for_ssa(val));
|
2019-09-04 17:03:18 +01:00
|
|
|
nir_instr_remove(&instr->instr);
|
|
|
|
|
progress = true;
|
2016-03-15 18:32:19 -07:00
|
|
|
}
|
|
|
|
|
|
2014-12-05 12:05:55 -08:00
|
|
|
return progress;
|
|
|
|
|
}
|
|
|
|
|
|
2014-11-14 21:35:25 -08:00
|
|
|
static bool
|
2020-10-01 18:29:08 -05:00
|
|
|
try_fold_instr(nir_builder *b, nir_instr *instr, void *_state)
|
2014-11-14 21:35:25 -08:00
|
|
|
{
|
2020-10-01 18:29:08 -05:00
|
|
|
switch (instr->type) {
|
|
|
|
|
case nir_instr_type_alu:
|
|
|
|
|
return try_fold_alu(b, nir_instr_as_alu(instr));
|
|
|
|
|
case nir_instr_type_intrinsic:
|
|
|
|
|
return try_fold_intrinsic(b, nir_instr_as_intrinsic(instr), _state);
|
|
|
|
|
default:
|
|
|
|
|
/* Don't know how to constant fold */
|
|
|
|
|
return false;
|
2018-09-10 14:31:29 -07:00
|
|
|
}
|
2014-11-14 21:35:25 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
nir_opt_constant_folding(nir_shader *shader)
|
|
|
|
|
{
|
2019-09-26 11:19:07 +01:00
|
|
|
struct constant_fold_state state;
|
2019-09-04 17:03:18 +01:00
|
|
|
state.has_load_constant = false;
|
|
|
|
|
state.has_indirect_load_const = false;
|
2014-11-14 21:35:25 -08:00
|
|
|
|
2020-10-01 18:29:08 -05:00
|
|
|
bool progress = nir_shader_instructions_pass(shader, try_fold_instr,
|
|
|
|
|
nir_metadata_block_index |
|
|
|
|
|
nir_metadata_dominance,
|
|
|
|
|
&state);
|
2014-11-14 21:35:25 -08:00
|
|
|
|
2019-09-04 17:03:18 +01:00
|
|
|
/* This doesn't free the constant data if there are no constant loads because
|
|
|
|
|
* the data might still be used but the loads have been lowered to load_ubo
|
|
|
|
|
*/
|
|
|
|
|
if (state.has_load_constant && !state.has_indirect_load_const &&
|
|
|
|
|
shader->constant_data_size) {
|
|
|
|
|
ralloc_free(shader->constant_data);
|
|
|
|
|
shader->constant_data = NULL;
|
|
|
|
|
shader->constant_data_size = 0;
|
|
|
|
|
}
|
|
|
|
|
|
2014-11-14 21:35:25 -08:00
|
|
|
return progress;
|
|
|
|
|
}
|