2 * Copyright © 2015 Thomas Helland
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:
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
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
25 #include "nir_constant_expressions.h"
26 #include "nir_loop_analyze.h"
33 } nir_loop_variable_type
;
35 struct nir_basic_induction_var
;
38 /* A link for the work list */
39 struct list_head process_link
;
43 /* The ssa_def associated with this info */
46 /* The type of this ssa_def */
47 nir_loop_variable_type type
;
49 /* If this is of type basic_induction */
50 struct nir_basic_induction_var
*ind
;
52 /* True if variable is in an if branch or a nested loop */
57 typedef struct nir_basic_induction_var
{
58 nir_op alu_op
; /* The type of alu-operation */
59 nir_loop_variable
*alu_def
; /* The def of the alu-operation */
60 nir_loop_variable
*invariant
; /* The invariant alu-operand */
61 nir_loop_variable
*def_outside_loop
; /* The phi-src outside the loop */
62 } nir_basic_induction_var
;
65 /* The loop we store information for */
68 /* Loop_variable for all ssa_defs in function */
69 nir_loop_variable
*loop_vars
;
71 /* A list of the loop_vars to analyze */
72 struct list_head process_list
;
74 nir_variable_mode indirect_mask
;
78 static nir_loop_variable
*
79 get_loop_var(nir_ssa_def
*value
, loop_info_state
*state
)
81 return &(state
->loop_vars
[value
->index
]);
85 loop_info_state
*state
;
90 init_loop_def(nir_ssa_def
*def
, void *void_init_loop_state
)
92 init_loop_state
*loop_init_state
= void_init_loop_state
;
93 nir_loop_variable
*var
= get_loop_var(def
, loop_init_state
->state
);
95 if (loop_init_state
->in_control_flow
) {
96 var
->in_control_flow
= true;
98 /* Add to the tail of the list. That way we start at the beginning of
99 * the defs in the loop instead of the end when walking the list. This
100 * means less recursive calls. Only add defs that are not in nested
101 * loops or conditional blocks.
103 list_addtail(&var
->process_link
, &loop_init_state
->state
->process_list
);
112 init_loop_block(nir_block
*block
, loop_info_state
*state
,
113 bool in_control_flow
)
115 init_loop_state init_state
= {.in_control_flow
= in_control_flow
,
118 nir_foreach_instr(instr
, block
) {
119 if (instr
->type
== nir_instr_type_intrinsic
||
120 instr
->type
== nir_instr_type_alu
||
121 instr
->type
== nir_instr_type_tex
) {
122 state
->loop
->info
->num_instructions
++;
125 nir_foreach_ssa_def(instr
, init_loop_def
, &init_state
);
132 is_var_alu(nir_loop_variable
*var
)
134 return var
->def
->parent_instr
->type
== nir_instr_type_alu
;
138 is_var_constant(nir_loop_variable
*var
)
140 return var
->def
->parent_instr
->type
== nir_instr_type_load_const
;
144 is_var_phi(nir_loop_variable
*var
)
146 return var
->def
->parent_instr
->type
== nir_instr_type_phi
;
150 mark_invariant(nir_ssa_def
*def
, loop_info_state
*state
)
152 nir_loop_variable
*var
= get_loop_var(def
, state
);
154 if (var
->type
== invariant
)
158 var
->type
= invariant
;
162 if (var
->type
== not_invariant
)
165 if (is_var_alu(var
)) {
166 nir_alu_instr
*alu
= nir_instr_as_alu(def
->parent_instr
);
168 for (unsigned i
= 0; i
< nir_op_infos
[alu
->op
].num_inputs
; i
++) {
169 if (!mark_invariant(alu
->src
[i
].src
.ssa
, state
)) {
170 var
->type
= not_invariant
;
174 var
->type
= invariant
;
178 /* Phis shouldn't be invariant except if one operand is invariant, and the
179 * other is the phi itself. These should be removed by opt_remove_phis.
180 * load_consts are already set to invariant and constant during init,
181 * and so should return earlier. Remaining op_codes are set undefined.
183 var
->type
= not_invariant
;
188 compute_invariance_information(loop_info_state
*state
)
190 /* An expression is invariant in a loop L if:
193 * – it’s a variable use, all of whose single defs are outside of L
195 * – it’s a pure computation all of whose args are loop invariant
196 * – it’s a variable use whose single reaching def, and the
197 * rhs of that def is loop-invariant
199 list_for_each_entry_safe(nir_loop_variable
, var
, &state
->process_list
,
201 assert(!var
->in_control_flow
);
203 if (mark_invariant(var
->def
, state
))
204 list_del(&var
->process_link
);
209 compute_induction_information(loop_info_state
*state
)
211 bool found_induction_var
= false;
212 list_for_each_entry_safe(nir_loop_variable
, var
, &state
->process_list
,
215 /* It can't be an induction variable if it is invariant. Invariants and
216 * things in nested loops or conditionals should have been removed from
217 * the list by compute_invariance_information().
219 assert(!var
->in_control_flow
&& var
->type
!= invariant
);
221 /* We are only interested in checking phis for the basic induction
222 * variable case as its simple to detect. All basic induction variables
225 if (!is_var_phi(var
))
228 nir_phi_instr
*phi
= nir_instr_as_phi(var
->def
->parent_instr
);
229 nir_basic_induction_var
*biv
= rzalloc(state
, nir_basic_induction_var
);
231 nir_foreach_phi_src(src
, phi
) {
232 nir_loop_variable
*src_var
= get_loop_var(src
->src
.ssa
, state
);
234 /* If one of the sources is in a conditional or nested block then
237 if (src_var
->in_control_flow
)
240 if (!src_var
->in_loop
) {
241 biv
->def_outside_loop
= src_var
;
242 } else if (is_var_alu(src_var
)) {
243 nir_alu_instr
*alu
= nir_instr_as_alu(src_var
->def
->parent_instr
);
245 if (nir_op_infos
[alu
->op
].num_inputs
== 2) {
246 biv
->alu_def
= src_var
;
247 biv
->alu_op
= alu
->op
;
249 for (unsigned i
= 0; i
< 2; i
++) {
250 /* Is one of the operands const, and the other the phi */
251 if (alu
->src
[i
].src
.ssa
->parent_instr
->type
== nir_instr_type_load_const
&&
252 alu
->src
[1-i
].src
.ssa
== &phi
->dest
.ssa
)
253 biv
->invariant
= get_loop_var(alu
->src
[i
].src
.ssa
, state
);
259 if (biv
->alu_def
&& biv
->def_outside_loop
&& biv
->invariant
&&
260 is_var_constant(biv
->def_outside_loop
)) {
261 assert(is_var_constant(biv
->invariant
));
262 biv
->alu_def
->type
= basic_induction
;
263 biv
->alu_def
->ind
= biv
;
264 var
->type
= basic_induction
;
267 found_induction_var
= true;
272 return found_induction_var
;
276 initialize_ssa_def(nir_ssa_def
*def
, void *void_state
)
278 loop_info_state
*state
= void_state
;
279 nir_loop_variable
*var
= get_loop_var(def
, state
);
281 var
->in_loop
= false;
284 if (def
->parent_instr
->type
== nir_instr_type_load_const
) {
285 var
->type
= invariant
;
287 var
->type
= undefined
;
294 find_loop_terminators(loop_info_state
*state
)
296 bool success
= false;
297 foreach_list_typed_safe(nir_cf_node
, node
, node
, &state
->loop
->body
) {
298 if (node
->type
== nir_cf_node_if
) {
299 nir_if
*nif
= nir_cf_node_as_if(node
);
301 nir_block
*break_blk
= NULL
;
302 nir_block
*continue_from_blk
= NULL
;
303 bool continue_from_then
= true;
305 nir_block
*last_then
= nir_if_last_then_block(nif
);
306 nir_block
*last_else
= nir_if_last_else_block(nif
);
307 if (nir_block_ends_in_break(last_then
)) {
308 break_blk
= last_then
;
309 continue_from_blk
= last_else
;
310 continue_from_then
= false;
311 } else if (nir_block_ends_in_break(last_else
)) {
312 break_blk
= last_else
;
313 continue_from_blk
= last_then
;
316 /* If there is a break then we should find a terminator. If we can
317 * not find a loop terminator, but there is a break-statement then
318 * we should return false so that we do not try to find trip-count
320 if (!nir_is_trivial_loop_if(nif
, break_blk
)) {
321 state
->loop
->info
->complex_loop
= true;
325 /* Continue if the if contained no jumps at all */
329 if (nif
->condition
.ssa
->parent_instr
->type
== nir_instr_type_phi
) {
330 state
->loop
->info
->complex_loop
= true;
334 nir_loop_terminator
*terminator
=
335 rzalloc(state
->loop
->info
, nir_loop_terminator
);
337 list_addtail(&terminator
->loop_terminator_link
,
338 &state
->loop
->info
->loop_terminator_list
);
340 terminator
->nif
= nif
;
341 terminator
->break_block
= break_blk
;
342 terminator
->continue_from_block
= continue_from_blk
;
343 terminator
->continue_from_then
= continue_from_then
;
344 terminator
->conditional_instr
= nif
->condition
.ssa
->parent_instr
;
354 get_iteration(nir_op cond_op
, nir_const_value
*initial
, nir_const_value
*step
,
355 nir_const_value
*limit
)
364 int32_t initial_val
= initial
->i32
[0];
365 int32_t span
= limit
->i32
[0] - initial_val
;
366 iter
= span
/ step
->i32
[0];
371 uint32_t initial_val
= initial
->u32
[0];
372 uint32_t span
= limit
->u32
[0] - initial_val
;
373 iter
= span
/ step
->u32
[0];
380 float initial_val
= initial
->f32
[0];
381 float span
= limit
->f32
[0] - initial_val
;
382 iter
= span
/ step
->f32
[0];
393 test_iterations(int32_t iter_int
, nir_const_value
*step
,
394 nir_const_value
*limit
, nir_op cond_op
, unsigned bit_size
,
395 nir_alu_type induction_base_type
,
396 nir_const_value
*initial
, bool limit_rhs
, bool invert_cond
)
398 assert(nir_op_infos
[cond_op
].num_inputs
== 2);
400 nir_const_value iter_src
= { {0, } };
403 switch (induction_base_type
) {
405 iter_src
.f32
[0] = (float) iter_int
;
406 mul_op
= nir_op_fmul
;
407 add_op
= nir_op_fadd
;
411 iter_src
.i32
[0] = iter_int
;
412 mul_op
= nir_op_imul
;
413 add_op
= nir_op_iadd
;
416 unreachable("Unhandled induction variable base type!");
419 /* Multiple the iteration count we are testing by the number of times we
420 * step the induction variable each iteration.
422 nir_const_value mul_src
[2] = { iter_src
, *step
};
423 nir_const_value mul_result
=
424 nir_eval_const_opcode(mul_op
, 1, bit_size
, mul_src
);
426 /* Add the initial value to the accumulated induction variable total */
427 nir_const_value add_src
[2] = { mul_result
, *initial
};
428 nir_const_value add_result
=
429 nir_eval_const_opcode(add_op
, 1, bit_size
, add_src
);
431 nir_const_value src
[2] = { { {0, } }, { {0, } } };
432 src
[limit_rhs
? 0 : 1] = add_result
;
433 src
[limit_rhs
? 1 : 0] = *limit
;
435 /* Evaluate the loop exit condition */
436 nir_const_value result
= nir_eval_const_opcode(cond_op
, 1, bit_size
, src
);
438 return invert_cond
? (result
.u32
[0] == 0) : (result
.u32
[0] != 0);
442 calculate_iterations(nir_const_value
*initial
, nir_const_value
*step
,
443 nir_const_value
*limit
, nir_loop_variable
*alu_def
,
444 nir_alu_instr
*cond_alu
, bool limit_rhs
, bool invert_cond
)
446 assert(initial
!= NULL
&& step
!= NULL
&& limit
!= NULL
);
448 nir_alu_instr
*alu
= nir_instr_as_alu(alu_def
->def
->parent_instr
);
450 /* nir_op_isub should have been lowered away by this point */
451 assert(alu
->op
!= nir_op_isub
);
453 /* Make sure the alu type for our induction variable is compatible with the
454 * conditional alus input type. If its not something has gone really wrong.
456 nir_alu_type induction_base_type
=
457 nir_alu_type_get_base_type(nir_op_infos
[alu
->op
].output_type
);
458 if (induction_base_type
== nir_type_int
|| induction_base_type
== nir_type_uint
) {
459 assert(nir_alu_type_get_base_type(nir_op_infos
[cond_alu
->op
].input_types
[1]) == nir_type_int
||
460 nir_alu_type_get_base_type(nir_op_infos
[cond_alu
->op
].input_types
[1]) == nir_type_uint
);
462 assert(nir_alu_type_get_base_type(nir_op_infos
[cond_alu
->op
].input_types
[0]) ==
463 induction_base_type
);
466 /* Check for nsupported alu operations */
467 if (alu
->op
!= nir_op_iadd
&& alu
->op
!= nir_op_fadd
)
470 /* do-while loops can increment the starting value before the condition is
477 * Here we check if the induction variable is used directly by the loop
478 * condition and if so we assume we need to step the initial value.
480 unsigned trip_offset
= 0;
481 if (cond_alu
->src
[0].src
.ssa
== alu_def
->def
||
482 cond_alu
->src
[1].src
.ssa
== alu_def
->def
) {
486 int iter_int
= get_iteration(cond_alu
->op
, initial
, step
, limit
);
488 /* If iter_int is negative the loop is ill-formed or is the conditional is
489 * unsigned with a huge iteration count so don't bother going any further.
494 /* An explanation from the GLSL unrolling pass:
496 * Make sure that the calculated number of iterations satisfies the exit
497 * condition. This is needed to catch off-by-one errors and some types of
498 * ill-formed loops. For example, we need to detect that the following
499 * loop does not have a maximum iteration count.
501 * for (float x = 0.0; x != 0.9; x += 0.2);
503 assert(nir_src_bit_size(alu
->src
[0].src
) ==
504 nir_src_bit_size(alu
->src
[1].src
));
505 unsigned bit_size
= nir_src_bit_size(alu
->src
[0].src
);
506 for (int bias
= -1; bias
<= 1; bias
++) {
507 const int iter_bias
= iter_int
+ bias
;
509 if (test_iterations(iter_bias
, step
, limit
, cond_alu
->op
, bit_size
,
510 induction_base_type
, initial
,
511 limit_rhs
, invert_cond
)) {
512 return iter_bias
> 0 ? iter_bias
- trip_offset
: iter_bias
;
519 /* Run through each of the terminators of the loop and try to infer a possible
520 * trip-count. We need to check them all, and set the lowest trip-count as the
521 * trip-count of our loop. If one of the terminators has an undecidable
522 * trip-count we can not safely assume anything about the duration of the
526 find_trip_count(loop_info_state
*state
)
528 bool trip_count_known
= true;
529 nir_loop_terminator
*limiting_terminator
= NULL
;
530 int max_trip_count
= -1;
532 list_for_each_entry(nir_loop_terminator
, terminator
,
533 &state
->loop
->info
->loop_terminator_list
,
534 loop_terminator_link
) {
536 if (terminator
->conditional_instr
->type
!= nir_instr_type_alu
) {
537 /* If we get here the loop is dead and will get cleaned up by the
538 * nir_opt_dead_cf pass.
540 trip_count_known
= false;
544 nir_alu_instr
*alu
= nir_instr_as_alu(terminator
->conditional_instr
);
545 nir_loop_variable
*basic_ind
= NULL
;
546 nir_loop_variable
*limit
= NULL
;
547 bool limit_rhs
= true;
550 case nir_op_fge
: case nir_op_ige
: case nir_op_uge
:
551 case nir_op_flt
: case nir_op_ilt
: case nir_op_ult
:
552 case nir_op_feq
: case nir_op_ieq
:
553 case nir_op_fne
: case nir_op_ine
:
555 /* We assume that the limit is the "right" operand */
556 basic_ind
= get_loop_var(alu
->src
[0].src
.ssa
, state
);
557 limit
= get_loop_var(alu
->src
[1].src
.ssa
, state
);
559 if (basic_ind
->type
!= basic_induction
) {
560 /* We had it the wrong way, flip things around */
561 basic_ind
= get_loop_var(alu
->src
[1].src
.ssa
, state
);
562 limit
= get_loop_var(alu
->src
[0].src
.ssa
, state
);
566 /* The comparison has to have a basic induction variable
567 * and a constant for us to be able to find trip counts
569 if (basic_ind
->type
!= basic_induction
|| !is_var_constant(limit
)) {
570 trip_count_known
= false;
574 /* We have determined that we have the following constants:
575 * (With the typical int i = 0; i < x; i++; as an example)
578 * - Step / iteration size
579 * Thats all thats needed to calculate the trip-count
582 nir_const_value initial_val
=
583 nir_instr_as_load_const(basic_ind
->ind
->def_outside_loop
->
584 def
->parent_instr
)->value
;
586 nir_const_value step_val
=
587 nir_instr_as_load_const(basic_ind
->ind
->invariant
->def
->
588 parent_instr
)->value
;
590 nir_const_value limit_val
=
591 nir_instr_as_load_const(limit
->def
->parent_instr
)->value
;
593 int iterations
= calculate_iterations(&initial_val
, &step_val
,
595 basic_ind
->ind
->alu_def
, alu
,
597 terminator
->continue_from_then
);
599 /* Where we not able to calculate the iteration count */
600 if (iterations
== -1) {
601 trip_count_known
= false;
605 /* If this is the first run or we have found a smaller amount of
606 * iterations than previously (we have identified a more limiting
607 * terminator) set the trip count and limiting terminator.
609 if (max_trip_count
== -1 || iterations
< max_trip_count
) {
610 max_trip_count
= iterations
;
611 limiting_terminator
= terminator
;
616 trip_count_known
= false;
620 state
->loop
->info
->exact_trip_count_known
= trip_count_known
;
621 if (max_trip_count
> -1)
622 state
->loop
->info
->max_trip_count
= max_trip_count
;
623 state
->loop
->info
->limiting_terminator
= limiting_terminator
;
627 force_unroll_array_access(loop_info_state
*state
, nir_deref_instr
*deref
)
629 for (nir_deref_instr
*d
= deref
; d
; d
= nir_deref_instr_parent(d
)) {
630 if (d
->deref_type
!= nir_deref_type_array
)
633 assert(d
->arr
.index
.is_ssa
);
634 nir_loop_variable
*array_index
= get_loop_var(d
->arr
.index
.ssa
, state
);
636 if (array_index
->type
!= basic_induction
)
639 nir_deref_instr
*parent
= nir_deref_instr_parent(d
);
640 assert(glsl_type_is_array(parent
->type
) ||
641 glsl_type_is_matrix(parent
->type
));
642 if (glsl_get_length(parent
->type
) == state
->loop
->info
->max_trip_count
)
645 if (deref
->mode
& state
->indirect_mask
)
653 force_unroll_heuristics(loop_info_state
*state
, nir_block
*block
)
655 nir_foreach_instr(instr
, block
) {
656 if (instr
->type
!= nir_instr_type_intrinsic
)
659 nir_intrinsic_instr
*intrin
= nir_instr_as_intrinsic(instr
);
661 /* Check for arrays variably-indexed by a loop induction variable.
662 * Unrolling the loop may convert that access into constant-indexing.
664 if (intrin
->intrinsic
== nir_intrinsic_load_deref
||
665 intrin
->intrinsic
== nir_intrinsic_store_deref
||
666 intrin
->intrinsic
== nir_intrinsic_copy_deref
) {
667 if (force_unroll_array_access(state
,
668 nir_src_as_deref(intrin
->src
[0])))
671 if (intrin
->intrinsic
== nir_intrinsic_copy_deref
&&
672 force_unroll_array_access(state
,
673 nir_src_as_deref(intrin
->src
[1])))
682 get_loop_info(loop_info_state
*state
, nir_function_impl
*impl
)
684 /* Initialize all variables to "outside_loop". This also marks defs
685 * invariant and constant if they are nir_instr_type_load_consts
687 nir_foreach_block(block
, impl
) {
688 nir_foreach_instr(instr
, block
)
689 nir_foreach_ssa_def(instr
, initialize_ssa_def
, state
);
692 /* Add all entries in the outermost part of the loop to the processing list
693 * Mark the entries in conditionals or in nested loops accordingly
695 foreach_list_typed_safe(nir_cf_node
, node
, node
, &state
->loop
->body
) {
696 switch (node
->type
) {
698 case nir_cf_node_block
:
699 init_loop_block(nir_cf_node_as_block(node
), state
, false);
703 nir_foreach_block_in_cf_node(block
, node
)
704 init_loop_block(block
, state
, true);
707 case nir_cf_node_loop
:
708 nir_foreach_block_in_cf_node(block
, node
) {
709 init_loop_block(block
, state
, true);
713 case nir_cf_node_function
:
718 /* Try to find all simple terminators of the loop. If we can't find any,
719 * or we find possible terminators that have side effects then bail.
721 if (!find_loop_terminators(state
)) {
722 list_for_each_entry_safe(nir_loop_terminator
, terminator
,
723 &state
->loop
->info
->loop_terminator_list
,
724 loop_terminator_link
) {
725 list_del(&terminator
->loop_terminator_link
);
726 ralloc_free(terminator
);
731 /* Induction analysis needs invariance information so get that first */
732 compute_invariance_information(state
);
734 /* We have invariance information so try to find induction variables */
735 if (!compute_induction_information(state
))
738 /* Run through each of the terminators and try to compute a trip-count */
739 find_trip_count(state
);
741 nir_shader
*ns
= impl
->function
->shader
;
742 nir_foreach_block_in_cf_node(block
, &state
->loop
->cf_node
) {
743 if (force_unroll_heuristics(state
, block
)) {
744 state
->loop
->info
->force_unroll
= true;
750 static loop_info_state
*
751 initialize_loop_info_state(nir_loop
*loop
, void *mem_ctx
,
752 nir_function_impl
*impl
)
754 loop_info_state
*state
= rzalloc(mem_ctx
, loop_info_state
);
755 state
->loop_vars
= rzalloc_array(mem_ctx
, nir_loop_variable
,
759 list_inithead(&state
->process_list
);
762 ralloc_free(loop
->info
);
764 loop
->info
= rzalloc(loop
, nir_loop_info
);
766 list_inithead(&loop
->info
->loop_terminator_list
);
772 process_loops(nir_cf_node
*cf_node
, nir_variable_mode indirect_mask
)
774 switch (cf_node
->type
) {
775 case nir_cf_node_block
:
777 case nir_cf_node_if
: {
778 nir_if
*if_stmt
= nir_cf_node_as_if(cf_node
);
779 foreach_list_typed(nir_cf_node
, nested_node
, node
, &if_stmt
->then_list
)
780 process_loops(nested_node
, indirect_mask
);
781 foreach_list_typed(nir_cf_node
, nested_node
, node
, &if_stmt
->else_list
)
782 process_loops(nested_node
, indirect_mask
);
785 case nir_cf_node_loop
: {
786 nir_loop
*loop
= nir_cf_node_as_loop(cf_node
);
787 foreach_list_typed(nir_cf_node
, nested_node
, node
, &loop
->body
)
788 process_loops(nested_node
, indirect_mask
);
792 unreachable("unknown cf node type");
795 nir_loop
*loop
= nir_cf_node_as_loop(cf_node
);
796 nir_function_impl
*impl
= nir_cf_node_get_function(cf_node
);
797 void *mem_ctx
= ralloc_context(NULL
);
799 loop_info_state
*state
= initialize_loop_info_state(loop
, mem_ctx
, impl
);
800 state
->indirect_mask
= indirect_mask
;
802 get_loop_info(state
, impl
);
804 ralloc_free(mem_ctx
);
808 nir_loop_analyze_impl(nir_function_impl
*impl
,
809 nir_variable_mode indirect_mask
)
811 nir_index_ssa_defs(impl
);
812 foreach_list_typed(nir_cf_node
, node
, node
, &impl
->body
)
813 process_loops(node
, indirect_mask
);