mirror of
https://gitlab.freedesktop.org/mesa/mesa.git
synced 2025-12-22 15:40:11 +01:00
96c19d23c9
Ever since4246c2869cand7d85dc4f35loop unrolling can no longer depend on inot being eliminated from the loop terminator condition so we need to be able to handle it. Here we simply check to see if the inot contains a simple terminator condition we previously handled. We also update the previous users of this function to use a newly name copy of the previous behaviour nir_is_terminator_condition_with_two_inputs(). Reviewed-by: Ian Romanick <ian.d.romanick@intel.com> Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/18006>
120 lines
3.9 KiB
C
120 lines
3.9 KiB
C
/*
|
|
* Copyright © 2016 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.
|
|
*/
|
|
|
|
#ifndef NIR_LOOP_ANALYZE_H
|
|
#define NIR_LOOP_ANALYZE_H
|
|
|
|
#include "nir.h"
|
|
|
|
/* Returns true if nir_cf_node contains a jump other than the expected_jump
|
|
* parameter.
|
|
*/
|
|
static inline bool
|
|
contains_other_jump(nir_cf_node *node, nir_instr *expected_jump)
|
|
{
|
|
switch (node->type) {
|
|
case nir_cf_node_block: {
|
|
nir_instr *lst_instr = nir_block_last_instr(nir_cf_node_as_block(node));
|
|
|
|
/* dead_cf should have eliminated any instruction after the first break
|
|
*/
|
|
nir_foreach_instr(instr, nir_cf_node_as_block(node))
|
|
assert(instr->type != nir_instr_type_jump || instr == lst_instr);
|
|
|
|
if (lst_instr && lst_instr->type == nir_instr_type_jump &&
|
|
lst_instr != expected_jump)
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
case nir_cf_node_if: {
|
|
nir_if *if_stmt = nir_cf_node_as_if(node);
|
|
|
|
foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->then_list) {
|
|
if (contains_other_jump(node, expected_jump))
|
|
return true;
|
|
}
|
|
|
|
foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->else_list) {
|
|
if (contains_other_jump(node, expected_jump))
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
case nir_cf_node_loop:
|
|
/* the jumps of nested loops are unrelated */
|
|
return false;
|
|
|
|
default:
|
|
unreachable("Unhandled cf node type");
|
|
}
|
|
}
|
|
|
|
/* Here we define a trivial if as containing only a single break that must be
|
|
* located at the end of either the then or else branch of the top level if,
|
|
* there must be no other breaks or any other type of jump. Or we pass NULL
|
|
* to break_block the if must contains no jumps at all.
|
|
*/
|
|
static inline bool
|
|
nir_is_trivial_loop_if(nir_if *nif, nir_block *break_block)
|
|
{
|
|
nir_instr *last_instr = NULL;
|
|
|
|
if (break_block) {
|
|
last_instr = nir_block_last_instr(break_block);
|
|
assert(last_instr && last_instr->type == nir_instr_type_jump &&
|
|
nir_instr_as_jump(last_instr)->type == nir_jump_break);
|
|
}
|
|
|
|
if (contains_other_jump(&nif->cf_node, last_instr))
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
static inline bool
|
|
nir_is_terminator_condition_with_two_inputs(nir_ssa_scalar cond)
|
|
{
|
|
if (!nir_ssa_scalar_is_alu(cond))
|
|
return false;
|
|
|
|
nir_alu_instr *alu = nir_instr_as_alu(cond.def->parent_instr);
|
|
return nir_alu_instr_is_comparison(alu) &&
|
|
nir_op_infos[alu->op].num_inputs == 2;
|
|
}
|
|
|
|
static inline bool
|
|
nir_is_supported_terminator_condition(nir_ssa_scalar cond)
|
|
{
|
|
if (!nir_ssa_scalar_is_alu(cond))
|
|
return false;
|
|
|
|
nir_alu_instr *alu = nir_instr_as_alu(cond.def->parent_instr);
|
|
return nir_alu_instr_is_comparison(alu) &&
|
|
(nir_op_infos[alu->op].num_inputs == 2 ||
|
|
(alu->op == nir_op_inot &&
|
|
nir_is_terminator_condition_with_two_inputs(nir_ssa_scalar_chase_alu_src(cond, 0))));
|
|
}
|
|
|
|
#endif /* NIR_LOOP_ANALYZE_H */
|