1 /*
2 * Copyright © 2016 Intel Corporation
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
13 * Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21 * IN THE SOFTWARE.
22 */
23
24 #ifndef NIR_LOOP_ANALYZE_H
25 #define NIR_LOOP_ANALYZE_H
26
27 #include "nir.h"
28
29 /* Returns true if nir_cf_node contains a jump other than the expected_jump
30 * parameter.
31 */
32 static inline bool
contains_other_jump(nir_cf_node * node,nir_instr * expected_jump)33 contains_other_jump(nir_cf_node *node, nir_instr *expected_jump)
34 {
35 switch (node->type) {
36 case nir_cf_node_block: {
37 nir_instr *lst_instr = nir_block_last_instr(nir_cf_node_as_block(node));
38
39 /* dead_cf should have eliminated any instruction after the first break
40 */
41 nir_foreach_instr(instr, nir_cf_node_as_block(node))
42 assert(instr->type != nir_instr_type_jump || instr == lst_instr);
43
44 if (lst_instr && lst_instr->type == nir_instr_type_jump &&
45 lst_instr != expected_jump)
46 return true;
47 else
48 return false;
49 }
50 case nir_cf_node_if: {
51 nir_if *if_stmt = nir_cf_node_as_if(node);
52
53 foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->then_list) {
54 if (contains_other_jump(node, expected_jump))
55 return true;
56 }
57
58 foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->else_list) {
59 if (contains_other_jump(node, expected_jump))
60 return true;
61 }
62
63 return false;
64 }
65 case nir_cf_node_loop:
66 /* the jumps of nested loops are unrelated */
67 return false;
68
69 default:
70 unreachable("Unhandled cf node type");
71 }
72 }
73
74 /* Here we define a trivial if as containing only a single break that must be
75 * located at the end of either the then or else branch of the top level if,
76 * there must be no other breaks or any other type of jump. Or we pass NULL
77 * to break_block the if must contains no jumps at all.
78 */
79 static inline bool
nir_is_trivial_loop_if(nir_if * nif,nir_block * break_block)80 nir_is_trivial_loop_if(nir_if *nif, nir_block *break_block)
81 {
82 nir_instr *last_instr = NULL;
83
84 if (break_block) {
85 last_instr = nir_block_last_instr(break_block);
86 assert(last_instr && last_instr->type == nir_instr_type_jump &&
87 nir_instr_as_jump(last_instr)->type == nir_jump_break);
88 }
89
90 if (contains_other_jump(&nif->cf_node, last_instr))
91 return false;
92
93 return true;
94 }
95
96 static inline bool
nir_is_supported_terminator_condition(nir_ssa_scalar cond)97 nir_is_supported_terminator_condition(nir_ssa_scalar cond)
98 {
99 if (!nir_ssa_scalar_is_alu(cond))
100 return false;
101
102 nir_alu_instr *alu = nir_instr_as_alu(cond.def->parent_instr);
103 return nir_alu_instr_is_comparison(alu) &&
104 nir_op_infos[alu->op].num_inputs == 2;
105 }
106
107 #endif /* NIR_LOOP_ANALYZE_H */
108