2 * Copyright © 2014 Intel Corporation
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
24 * Connor Abbott (cwabbott0@gmail.com)
32 nir_shader_create(void *mem_ctx
)
34 nir_shader
*shader
= ralloc(mem_ctx
, nir_shader
);
36 shader
->uniforms
= _mesa_hash_table_create(shader
, _mesa_key_hash_string
,
37 _mesa_key_string_equal
);
38 shader
->inputs
= _mesa_hash_table_create(shader
, _mesa_key_hash_string
,
39 _mesa_key_string_equal
);
40 shader
->outputs
= _mesa_hash_table_create(shader
, _mesa_key_hash_string
,
41 _mesa_key_string_equal
);
43 shader
->num_user_structures
= 0;
44 shader
->user_structures
= NULL
;
46 exec_list_make_empty(&shader
->functions
);
47 exec_list_make_empty(&shader
->registers
);
48 exec_list_make_empty(&shader
->globals
);
49 exec_list_make_empty(&shader
->system_values
);
50 shader
->reg_alloc
= 0;
52 shader
->num_inputs
= 0;
53 shader
->num_outputs
= 0;
54 shader
->num_uniforms
= 0;
60 reg_create(void *mem_ctx
, struct exec_list
*list
)
62 nir_register
*reg
= ralloc(mem_ctx
, nir_register
);
64 reg
->uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
65 reg
->defs
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
66 reg
->if_uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
68 reg
->num_components
= 0;
69 reg
->num_array_elems
= 0;
70 reg
->is_packed
= false;
73 exec_list_push_tail(list
, ®
->node
);
79 nir_global_reg_create(nir_shader
*shader
)
81 nir_register
*reg
= reg_create(shader
, &shader
->registers
);
82 reg
->index
= shader
->reg_alloc
++;
83 reg
->is_global
= true;
89 nir_local_reg_create(nir_function_impl
*impl
)
91 nir_register
*reg
= reg_create(ralloc_parent(impl
), &impl
->registers
);
92 reg
->index
= impl
->reg_alloc
++;
93 reg
->is_global
= false;
99 nir_reg_remove(nir_register
*reg
)
101 exec_node_remove(®
->node
);
105 nir_function_create(nir_shader
*shader
, const char *name
)
107 nir_function
*func
= ralloc(shader
, nir_function
);
109 exec_list_push_tail(&shader
->functions
, &func
->node
);
110 exec_list_make_empty(&func
->overload_list
);
112 func
->shader
= shader
;
117 nir_function_overload
*
118 nir_function_overload_create(nir_function
*func
)
120 void *mem_ctx
= ralloc_parent(func
);
122 nir_function_overload
*overload
= ralloc(mem_ctx
, nir_function_overload
);
124 overload
->num_params
= 0;
125 overload
->params
= NULL
;
126 overload
->return_type
= glsl_void_type();
127 overload
->impl
= NULL
;
129 exec_list_push_tail(&func
->overload_list
, &overload
->node
);
130 overload
->function
= func
;
135 nir_src
nir_src_copy(nir_src src
, void *mem_ctx
)
138 ret
.is_ssa
= src
.is_ssa
;
142 ret
.reg
.base_offset
= src
.reg
.base_offset
;
143 ret
.reg
.reg
= src
.reg
.reg
;
144 if (src
.reg
.indirect
) {
145 ret
.reg
.indirect
= ralloc(mem_ctx
, nir_src
);
146 *ret
.reg
.indirect
= *src
.reg
.indirect
;
148 ret
.reg
.indirect
= NULL
;
155 nir_dest
nir_dest_copy(nir_dest dest
, void *mem_ctx
)
158 ret
.is_ssa
= dest
.is_ssa
;
162 ret
.reg
.base_offset
= dest
.reg
.base_offset
;
163 ret
.reg
.reg
= dest
.reg
.reg
;
164 if (dest
.reg
.indirect
) {
165 ret
.reg
.indirect
= ralloc(mem_ctx
, nir_src
);
166 *ret
.reg
.indirect
= *dest
.reg
.indirect
;
168 ret
.reg
.indirect
= NULL
;
176 block_add_pred(nir_block
*block
, nir_block
*pred
)
178 _mesa_set_add(block
->predecessors
, _mesa_hash_pointer(pred
), pred
);
182 cf_init(nir_cf_node
*node
, nir_cf_node_type type
)
184 exec_node_init(&node
->node
);
190 link_blocks(nir_block
*pred
, nir_block
*succ1
, nir_block
*succ2
)
192 pred
->successors
[0] = succ1
;
193 block_add_pred(succ1
, pred
);
195 pred
->successors
[1] = succ2
;
197 block_add_pred(succ2
, pred
);
201 unlink_blocks(nir_block
*pred
, nir_block
*succ
)
203 if (pred
->successors
[0] == succ
) {
204 pred
->successors
[0] = pred
->successors
[1];
205 pred
->successors
[1] = NULL
;
207 assert(pred
->successors
[1] == succ
);
208 pred
->successors
[1] = NULL
;
211 struct set_entry
*entry
= _mesa_set_search(succ
->predecessors
,
212 _mesa_hash_pointer(pred
), pred
);
216 _mesa_set_remove(succ
->predecessors
, entry
);
220 unlink_block_successors(nir_block
*block
)
222 if (block
->successors
[0] != NULL
)
223 unlink_blocks(block
, block
->successors
[0]);
224 if (block
->successors
[1] != NULL
)
225 unlink_blocks(block
, block
->successors
[1]);
230 nir_function_impl_create(nir_function_overload
*overload
)
232 assert(overload
->impl
== NULL
);
234 void *mem_ctx
= ralloc_parent(overload
);
236 nir_function_impl
*impl
= ralloc(mem_ctx
, nir_function_impl
);
238 overload
->impl
= impl
;
239 impl
->overload
= overload
;
241 cf_init(&impl
->cf_node
, nir_cf_node_function
);
243 exec_list_make_empty(&impl
->body
);
244 exec_list_make_empty(&impl
->registers
);
245 exec_list_make_empty(&impl
->locals
);
246 impl
->num_params
= 0;
248 impl
->return_var
= NULL
;
251 impl
->valid_metadata
= nir_metadata_none
;
253 /* create start & end blocks */
254 nir_block
*start_block
= nir_block_create(mem_ctx
);
255 nir_block
*end_block
= nir_block_create(mem_ctx
);
256 start_block
->cf_node
.parent
= &impl
->cf_node
;
257 end_block
->cf_node
.parent
= &impl
->cf_node
;
258 impl
->start_block
= start_block
;
259 impl
->end_block
= end_block
;
261 exec_list_push_tail(&impl
->body
, &start_block
->cf_node
.node
);
263 start_block
->successors
[0] = end_block
;
264 block_add_pred(end_block
, start_block
);
270 nir_block_create(void *mem_ctx
)
272 nir_block
*block
= ralloc(mem_ctx
, nir_block
);
274 cf_init(&block
->cf_node
, nir_cf_node_block
);
276 block
->successors
[0] = block
->successors
[1] = NULL
;
277 block
->predecessors
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
278 block
->imm_dom
= NULL
;
279 block
->dom_frontier
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
281 exec_list_make_empty(&block
->instr_list
);
287 src_init(nir_src
*src
)
291 src
->reg
.indirect
= NULL
;
292 src
->reg
.base_offset
= 0;
296 nir_if_create(void *mem_ctx
)
298 nir_if
*if_stmt
= ralloc(mem_ctx
, nir_if
);
300 cf_init(&if_stmt
->cf_node
, nir_cf_node_if
);
301 src_init(&if_stmt
->condition
);
303 nir_block
*then
= nir_block_create(mem_ctx
);
304 exec_list_make_empty(&if_stmt
->then_list
);
305 exec_list_push_tail(&if_stmt
->then_list
, &then
->cf_node
.node
);
306 then
->cf_node
.parent
= &if_stmt
->cf_node
;
308 nir_block
*else_stmt
= nir_block_create(mem_ctx
);
309 exec_list_make_empty(&if_stmt
->else_list
);
310 exec_list_push_tail(&if_stmt
->else_list
, &else_stmt
->cf_node
.node
);
311 else_stmt
->cf_node
.parent
= &if_stmt
->cf_node
;
317 nir_loop_create(void *mem_ctx
)
319 nir_loop
*loop
= ralloc(mem_ctx
, nir_loop
);
321 cf_init(&loop
->cf_node
, nir_cf_node_loop
);
323 nir_block
*body
= nir_block_create(mem_ctx
);
324 exec_list_make_empty(&loop
->body
);
325 exec_list_push_tail(&loop
->body
, &body
->cf_node
.node
);
326 body
->cf_node
.parent
= &loop
->cf_node
;
328 body
->successors
[0] = body
;
329 block_add_pred(body
, body
);
335 instr_init(nir_instr
*instr
, nir_instr_type type
)
339 exec_node_init(&instr
->node
);
343 dest_init(nir_dest
*dest
)
345 dest
->is_ssa
= false;
346 dest
->reg
.reg
= NULL
;
347 dest
->reg
.indirect
= NULL
;
348 dest
->reg
.base_offset
= 0;
352 alu_dest_init(nir_alu_dest
*dest
)
354 dest_init(&dest
->dest
);
355 dest
->saturate
= false;
356 dest
->write_mask
= 0xf;
360 alu_src_init(nir_alu_src
*src
)
363 src
->abs
= src
->negate
= false;
371 nir_alu_instr_create(void *mem_ctx
, nir_op op
)
373 unsigned num_srcs
= nir_op_infos
[op
].num_inputs
;
374 nir_alu_instr
*instr
=
376 sizeof(nir_alu_instr
) + num_srcs
* sizeof(nir_alu_src
));
378 instr_init(&instr
->instr
, nir_instr_type_alu
);
380 alu_dest_init(&instr
->dest
);
381 for (unsigned i
= 0; i
< num_srcs
; i
++)
382 alu_src_init(&instr
->src
[i
]);
384 instr
->has_predicate
= false;
385 src_init(&instr
->predicate
);
391 nir_jump_instr_create(void *mem_ctx
, nir_jump_type type
)
393 nir_jump_instr
*instr
= ralloc(mem_ctx
, nir_jump_instr
);
394 instr_init(&instr
->instr
, nir_instr_type_jump
);
399 nir_load_const_instr
*
400 nir_load_const_instr_create(void *mem_ctx
)
402 nir_load_const_instr
*instr
= ralloc(mem_ctx
, nir_load_const_instr
);
403 instr_init(&instr
->instr
, nir_instr_type_load_const
);
405 dest_init(&instr
->dest
);
406 instr
->num_components
= 0;
407 instr
->array_elems
= 0;
409 instr
->has_predicate
= false;
410 src_init(&instr
->predicate
);
415 nir_intrinsic_instr
*
416 nir_intrinsic_instr_create(void *mem_ctx
, nir_intrinsic_op op
)
418 unsigned num_srcs
= nir_intrinsic_infos
[op
].num_srcs
;
419 nir_intrinsic_instr
*instr
=
421 sizeof(nir_intrinsic_instr
) + num_srcs
* sizeof(nir_src
));
423 instr_init(&instr
->instr
, nir_instr_type_intrinsic
);
424 instr
->intrinsic
= op
;
426 if (nir_intrinsic_infos
[op
].has_dest
)
427 dest_init(&instr
->dest
);
429 for (unsigned i
= 0; i
< num_srcs
; i
++)
430 src_init(&instr
->src
[i
]);
432 instr
->has_predicate
= false;
433 src_init(&instr
->predicate
);
439 nir_call_instr_create(void *mem_ctx
, nir_function_overload
*callee
)
441 nir_call_instr
*instr
= ralloc(mem_ctx
, nir_call_instr
);
442 instr_init(&instr
->instr
, nir_instr_type_call
);
444 instr
->callee
= callee
;
445 instr
->num_params
= callee
->num_params
;
446 instr
->params
= ralloc_array(mem_ctx
, nir_deref_var
*, instr
->num_params
);
447 instr
->return_deref
= NULL
;
449 instr
->has_predicate
= false;
450 src_init(&instr
->predicate
);
456 nir_tex_instr_create(void *mem_ctx
, unsigned num_srcs
)
458 nir_tex_instr
*instr
= ralloc(mem_ctx
, nir_tex_instr
);
459 instr_init(&instr
->instr
, nir_instr_type_texture
);
461 dest_init(&instr
->dest
);
463 instr
->num_srcs
= num_srcs
;
464 for (unsigned i
= 0; i
< num_srcs
; i
++)
465 src_init(&instr
->src
[i
]);
467 instr
->has_predicate
= false;
468 src_init(&instr
->predicate
);
474 nir_phi_instr_create(void *mem_ctx
)
476 nir_phi_instr
*instr
= ralloc(mem_ctx
, nir_phi_instr
);
477 instr_init(&instr
->instr
, nir_instr_type_phi
);
479 dest_init(&instr
->dest
);
480 exec_list_make_empty(&instr
->srcs
);
484 nir_parallel_copy_instr
*
485 nir_parallel_copy_instr_create(void *mem_ctx
)
487 nir_parallel_copy_instr
*instr
= ralloc(mem_ctx
, nir_parallel_copy_instr
);
488 instr_init(&instr
->instr
, nir_instr_type_parallel_copy
);
490 instr
->at_end
= false;
491 exec_list_make_empty(&instr
->copies
);
496 nir_ssa_undef_instr
*
497 nir_ssa_undef_instr_create(void *mem_ctx
)
499 nir_ssa_undef_instr
*instr
= ralloc(mem_ctx
, nir_ssa_undef_instr
);
500 instr_init(&instr
->instr
, nir_instr_type_ssa_undef
);
502 instr
->def
.name
= NULL
;
503 instr
->def
.parent_instr
= &instr
->instr
;
509 nir_deref_var_create(void *mem_ctx
, nir_variable
*var
)
511 nir_deref_var
*deref
= ralloc(mem_ctx
, nir_deref_var
);
512 deref
->deref
.deref_type
= nir_deref_type_var
;
513 deref
->deref
.child
= NULL
;
514 deref
->deref
.type
= var
->type
;
520 nir_deref_array_create(void *mem_ctx
)
522 nir_deref_array
*deref
= ralloc(mem_ctx
, nir_deref_array
);
523 deref
->deref
.deref_type
= nir_deref_type_array
;
524 deref
->deref
.child
= NULL
;
525 deref
->has_indirect
= false;
526 src_init(&deref
->indirect
);
527 deref
->base_offset
= 0;
532 nir_deref_struct_create(void *mem_ctx
, const char *field
)
534 nir_deref_struct
*deref
= ralloc(mem_ctx
, nir_deref_struct
);
535 deref
->deref
.deref_type
= nir_deref_type_struct
;
536 deref
->deref
.child
= NULL
;
537 deref
->elem
= ralloc_strdup(deref
, field
);
541 static nir_deref_var
*
542 copy_deref_var(void *mem_ctx
, nir_deref_var
*deref
)
544 nir_deref_var
*ret
= nir_deref_var_create(mem_ctx
, deref
->var
);
545 ret
->deref
.type
= deref
->deref
.type
;
546 if (deref
->deref
.child
)
547 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
551 static nir_deref_array
*
552 copy_deref_array(void *mem_ctx
, nir_deref_array
*deref
)
554 nir_deref_array
*ret
= nir_deref_array_create(mem_ctx
);
555 ret
->base_offset
= deref
->base_offset
;
556 if (deref
->has_indirect
) {
557 ret
->has_indirect
= true;
558 ret
->indirect
= deref
->indirect
;
560 ret
->deref
.type
= deref
->deref
.type
;
561 if (deref
->deref
.child
)
562 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
566 static nir_deref_struct
*
567 copy_deref_struct(void *mem_ctx
, nir_deref_struct
*deref
)
569 nir_deref_struct
*ret
= nir_deref_struct_create(mem_ctx
, deref
->elem
);
570 ret
->deref
.type
= deref
->deref
.type
;
571 if (deref
->deref
.child
)
572 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
577 nir_copy_deref(void *mem_ctx
, nir_deref
*deref
)
579 switch (deref
->deref_type
) {
580 case nir_deref_type_var
:
581 return ©_deref_var(mem_ctx
, nir_deref_as_var(deref
))->deref
;
582 case nir_deref_type_array
:
583 return ©_deref_array(mem_ctx
, nir_deref_as_array(deref
))->deref
;
584 case nir_deref_type_struct
:
585 return ©_deref_struct(mem_ctx
, nir_deref_as_struct(deref
))->deref
;
587 unreachable("Invalid dereference type");
595 * \name Control flow modification
597 * These functions modify the control flow tree while keeping the control flow
598 * graph up-to-date. The invariants respected are:
599 * 1. Each then statement, else statement, or loop body must have at least one
601 * 2. Each if-statement and loop must have one basic block before it and one
603 * 3. Two basic blocks cannot be directly next to each other.
604 * 4. If a basic block has a jump instruction, there must be only one and it
605 * must be at the end of the block.
606 * 5. The CFG must always be connected - this means that we must insert a fake
607 * CFG edge for loops with no break statement.
609 * The purpose of the second one is so that we have places to insert code during
610 * GCM, as well as eliminating the possibility of critical edges.
615 link_non_block_to_block(nir_cf_node
*node
, nir_block
*block
)
617 if (node
->type
== nir_cf_node_if
) {
619 * We're trying to link an if to a block after it; this just means linking
620 * the last block of the then and else branches.
623 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
625 nir_cf_node
*last_then
= nir_if_last_then_node(if_stmt
);
626 assert(last_then
->type
== nir_cf_node_block
);
627 nir_block
*last_then_block
= nir_cf_node_as_block(last_then
);
629 nir_cf_node
*last_else
= nir_if_last_else_node(if_stmt
);
630 assert(last_else
->type
== nir_cf_node_block
);
631 nir_block
*last_else_block
= nir_cf_node_as_block(last_else
);
633 if (exec_list_is_empty(&last_then_block
->instr_list
) ||
634 nir_block_last_instr(last_then_block
)->type
!= nir_instr_type_jump
) {
635 unlink_block_successors(last_then_block
);
636 link_blocks(last_then_block
, block
, NULL
);
639 if (exec_list_is_empty(&last_else_block
->instr_list
) ||
640 nir_block_last_instr(last_else_block
)->type
!= nir_instr_type_jump
) {
641 unlink_block_successors(last_else_block
);
642 link_blocks(last_else_block
, block
, NULL
);
645 assert(node
->type
== nir_cf_node_loop
);
648 * We can only get to this codepath if we're inserting a new loop, or
649 * at least a loop with no break statements; we can't insert break
650 * statements into a loop when we haven't inserted it into the CFG
651 * because we wouldn't know which block comes after the loop
652 * and therefore, which block should be the successor of the block with
653 * the break). Therefore, we need to insert a fake edge (see invariant
657 nir_loop
*loop
= nir_cf_node_as_loop(node
);
659 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
660 assert(last
->type
== nir_cf_node_block
);
661 nir_block
*last_block
= nir_cf_node_as_block(last
);
663 last_block
->successors
[1] = block
;
664 block_add_pred(block
, last_block
);
669 link_block_to_non_block(nir_block
*block
, nir_cf_node
*node
)
671 if (node
->type
== nir_cf_node_if
) {
673 * We're trying to link a block to an if after it; this just means linking
674 * the block to the first block of the then and else branches.
677 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
679 nir_cf_node
*first_then
= nir_if_first_then_node(if_stmt
);
680 assert(first_then
->type
== nir_cf_node_block
);
681 nir_block
*first_then_block
= nir_cf_node_as_block(first_then
);
683 nir_cf_node
*first_else
= nir_if_first_else_node(if_stmt
);
684 assert(first_else
->type
== nir_cf_node_block
);
685 nir_block
*first_else_block
= nir_cf_node_as_block(first_else
);
687 unlink_block_successors(block
);
688 link_blocks(block
, first_then_block
, first_else_block
);
691 * For similar reasons as the corresponding case in
692 * link_non_block_to_block(), don't worry about if the loop header has
693 * any predecessors that need to be unlinked.
696 assert(node
->type
== nir_cf_node_loop
);
698 nir_loop
*loop
= nir_cf_node_as_loop(node
);
700 nir_cf_node
*loop_header
= nir_loop_first_cf_node(loop
);
701 assert(loop_header
->type
== nir_cf_node_block
);
702 nir_block
*loop_header_block
= nir_cf_node_as_block(loop_header
);
704 unlink_block_successors(block
);
705 link_blocks(block
, loop_header_block
, NULL
);
711 * Takes a basic block and inserts a new empty basic block before it, making its
712 * predecessors point to the new block. This essentially splits the block into
713 * an empty header and a body so that another non-block CF node can be inserted
714 * between the two. Note that this does *not* link the two basic blocks, so
715 * some kind of cleanup *must* be performed after this call.
719 split_block_beginning(nir_block
*block
)
721 nir_block
*new_block
= nir_block_create(ralloc_parent(block
));
722 new_block
->cf_node
.parent
= block
->cf_node
.parent
;
723 exec_node_insert_node_before(&block
->cf_node
.node
, &new_block
->cf_node
.node
);
725 struct set_entry
*entry
;
726 set_foreach(block
->predecessors
, entry
) {
727 nir_block
*pred
= (nir_block
*) entry
->key
;
729 unlink_blocks(pred
, block
);
730 link_blocks(pred
, new_block
, NULL
);
737 rewrite_phi_preds(nir_block
*block
, nir_block
*old_pred
, nir_block
*new_pred
)
739 nir_foreach_instr_safe(block
, instr
) {
740 if (instr
->type
!= nir_instr_type_phi
)
743 nir_phi_instr
*phi
= nir_instr_as_phi(instr
);
744 foreach_list_typed_safe(nir_phi_src
, src
, node
, &phi
->srcs
) {
745 if (src
->pred
== old_pred
) {
746 src
->pred
= new_pred
;
754 * Moves the successors of source to the successors of dest, leaving both
755 * successors of source NULL.
759 move_successors(nir_block
*source
, nir_block
*dest
)
761 nir_block
*succ1
= source
->successors
[0];
762 nir_block
*succ2
= source
->successors
[1];
765 unlink_blocks(source
, succ1
);
766 rewrite_phi_preds(succ1
, source
, dest
);
770 unlink_blocks(source
, succ2
);
771 rewrite_phi_preds(succ2
, source
, dest
);
774 unlink_block_successors(dest
);
775 link_blocks(dest
, succ1
, succ2
);
779 split_block_end(nir_block
*block
)
781 nir_block
*new_block
= nir_block_create(ralloc_parent(block
));
782 new_block
->cf_node
.parent
= block
->cf_node
.parent
;
783 exec_node_insert_after(&block
->cf_node
.node
, &new_block
->cf_node
.node
);
785 move_successors(block
, new_block
);
791 * Inserts a non-basic block between two basic blocks and links them together.
795 insert_non_block(nir_block
*before
, nir_cf_node
*node
, nir_block
*after
)
797 node
->parent
= before
->cf_node
.parent
;
798 exec_node_insert_after(&before
->cf_node
.node
, &node
->node
);
799 link_block_to_non_block(before
, node
);
800 link_non_block_to_block(node
, after
);
804 * Inserts a non-basic block before a basic block.
808 insert_non_block_before_block(nir_cf_node
*node
, nir_block
*block
)
810 /* split off the beginning of block into new_block */
811 nir_block
*new_block
= split_block_beginning(block
);
813 /* insert our node in between new_block and block */
814 insert_non_block(new_block
, node
, block
);
818 insert_non_block_after_block(nir_block
*block
, nir_cf_node
*node
)
820 /* split off the end of block into new_block */
821 nir_block
*new_block
= split_block_end(block
);
823 /* insert our node in between block and new_block */
824 insert_non_block(block
, node
, new_block
);
827 /* walk up the control flow tree to find the innermost enclosed loop */
829 nearest_loop(nir_cf_node
*node
)
831 while (node
->type
!= nir_cf_node_loop
) {
835 return nir_cf_node_as_loop(node
);
839 nir_cf_node_get_function(nir_cf_node
*node
)
841 while (node
->type
!= nir_cf_node_function
) {
845 return nir_cf_node_as_function(node
);
849 * update the CFG after a jump instruction has been added to the end of a block
853 handle_jump(nir_block
*block
)
855 nir_instr
*instr
= nir_block_last_instr(block
);
856 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
858 unlink_block_successors(block
);
860 nir_function_impl
*impl
= nir_cf_node_get_function(&block
->cf_node
);
861 nir_metadata_dirty(impl
, nir_metadata_none
);
863 if (jump_instr
->type
== nir_jump_break
||
864 jump_instr
->type
== nir_jump_continue
) {
865 nir_loop
*loop
= nearest_loop(&block
->cf_node
);
867 if (jump_instr
->type
== nir_jump_continue
) {
868 nir_cf_node
*first_node
= nir_loop_first_cf_node(loop
);
869 assert(first_node
->type
== nir_cf_node_block
);
870 nir_block
*first_block
= nir_cf_node_as_block(first_node
);
871 link_blocks(block
, first_block
, NULL
);
873 nir_cf_node
*after
= nir_cf_node_next(&loop
->cf_node
);
874 assert(after
->type
== nir_cf_node_block
);
875 nir_block
*after_block
= nir_cf_node_as_block(after
);
876 link_blocks(block
, after_block
, NULL
);
878 /* If we inserted a fake link, remove it */
879 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
880 assert(last
->type
== nir_cf_node_block
);
881 nir_block
*last_block
= nir_cf_node_as_block(last
);
882 if (last_block
->successors
[1] != NULL
)
883 unlink_blocks(last_block
, after_block
);
886 assert(jump_instr
->type
== nir_jump_return
);
887 link_blocks(block
, impl
->end_block
, NULL
);
892 handle_remove_jump(nir_block
*block
, nir_jump_type type
)
894 unlink_block_successors(block
);
896 if (exec_node_is_tail_sentinel(block
->cf_node
.node
.next
)) {
897 nir_cf_node
*parent
= block
->cf_node
.parent
;
898 if (parent
->type
== nir_cf_node_if
) {
899 nir_cf_node
*next
= nir_cf_node_next(parent
);
900 assert(next
->type
== nir_cf_node_block
);
901 nir_block
*next_block
= nir_cf_node_as_block(next
);
903 link_blocks(block
, next_block
, NULL
);
905 assert(parent
->type
== nir_cf_node_loop
);
906 nir_loop
*loop
= nir_cf_node_as_loop(parent
);
908 nir_cf_node
*head
= nir_loop_first_cf_node(loop
);
909 assert(head
->type
== nir_cf_node_block
);
910 nir_block
*head_block
= nir_cf_node_as_block(head
);
912 link_blocks(block
, head_block
, NULL
);
915 nir_cf_node
*next
= nir_cf_node_next(&block
->cf_node
);
916 if (next
->type
== nir_cf_node_if
) {
917 nir_if
*next_if
= nir_cf_node_as_if(next
);
919 nir_cf_node
*first_then
= nir_if_first_then_node(next_if
);
920 assert(first_then
->type
== nir_cf_node_block
);
921 nir_block
*first_then_block
= nir_cf_node_as_block(first_then
);
923 nir_cf_node
*first_else
= nir_if_first_else_node(next_if
);
924 assert(first_else
->type
== nir_cf_node_block
);
925 nir_block
*first_else_block
= nir_cf_node_as_block(first_else
);
927 link_blocks(block
, first_then_block
, first_else_block
);
929 assert(next
->type
== nir_cf_node_loop
);
930 nir_loop
*next_loop
= nir_cf_node_as_loop(next
);
932 nir_cf_node
*first
= nir_loop_first_cf_node(next_loop
);
933 assert(first
->type
== nir_cf_node_block
);
934 nir_block
*first_block
= nir_cf_node_as_block(first
);
936 link_blocks(block
, first_block
, NULL
);
940 if (type
== nir_jump_break
) {
941 nir_loop
*loop
= nearest_loop(&block
->cf_node
);
943 nir_cf_node
*next
= nir_cf_node_next(&loop
->cf_node
);
944 assert(next
->type
== nir_cf_node_block
);
945 nir_block
*next_block
= nir_cf_node_as_block(next
);
947 if (next_block
->predecessors
->entries
== 0) {
948 /* insert fake link */
949 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
950 assert(last
->type
== nir_cf_node_block
);
951 nir_block
*last_block
= nir_cf_node_as_block(last
);
953 last_block
->successors
[1] = next_block
;
954 block_add_pred(next_block
, last_block
);
958 nir_function_impl
*impl
= nir_cf_node_get_function(&block
->cf_node
);
959 nir_metadata_dirty(impl
, nir_metadata_none
);
963 * Inserts a basic block before another by merging the instructions.
965 * @param block the target of the insertion
966 * @param before the block to be inserted - must not have been inserted before
967 * @param has_jump whether \before has a jump instruction at the end
971 insert_block_before_block(nir_block
*block
, nir_block
*before
, bool has_jump
)
973 assert(!has_jump
|| exec_list_is_empty(&block
->instr_list
));
975 foreach_list_typed(nir_instr
, instr
, node
, &before
->instr_list
) {
976 instr
->block
= block
;
979 exec_list_prepend(&block
->instr_list
, &before
->instr_list
);
986 * Inserts a basic block after another by merging the instructions.
988 * @param block the target of the insertion
989 * @param after the block to be inserted - must not have been inserted before
990 * @param has_jump whether \after has a jump instruction at the end
994 insert_block_after_block(nir_block
*block
, nir_block
*after
, bool has_jump
)
996 foreach_list_typed(nir_instr
, instr
, node
, &after
->instr_list
) {
997 instr
->block
= block
;
1000 exec_list_append(&block
->instr_list
, &after
->instr_list
);
1007 update_if_uses(nir_cf_node
*node
)
1009 if (node
->type
!= nir_cf_node_if
)
1012 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
1013 if (if_stmt
->condition
.is_ssa
)
1016 nir_register
*reg
= if_stmt
->condition
.reg
.reg
;
1017 assert(reg
!= NULL
);
1019 _mesa_set_add(reg
->if_uses
, _mesa_hash_pointer(if_stmt
), if_stmt
);
1023 nir_cf_node_insert_after(nir_cf_node
*node
, nir_cf_node
*after
)
1025 update_if_uses(after
);
1027 if (after
->type
== nir_cf_node_block
) {
1029 * either node or the one after it must be a basic block, by invariant #2;
1030 * in either case, just merge the blocks together.
1032 nir_block
*after_block
= nir_cf_node_as_block(after
);
1034 bool has_jump
= !exec_list_is_empty(&after_block
->instr_list
) &&
1035 nir_block_last_instr(after_block
)->type
== nir_instr_type_jump
;
1037 if (node
->type
== nir_cf_node_block
) {
1038 insert_block_after_block(nir_cf_node_as_block(node
), after_block
,
1041 nir_cf_node
*next
= nir_cf_node_next(node
);
1042 assert(next
->type
== nir_cf_node_block
);
1043 nir_block
*next_block
= nir_cf_node_as_block(next
);
1045 insert_block_before_block(next_block
, after_block
, has_jump
);
1048 if (node
->type
== nir_cf_node_block
) {
1049 insert_non_block_after_block(nir_cf_node_as_block(node
), after
);
1052 * We have to insert a non-basic block after a non-basic block. Since
1053 * every non-basic block has a basic block after it, this is equivalent
1054 * to inserting a non-basic block before a basic block.
1057 nir_cf_node
*next
= nir_cf_node_next(node
);
1058 assert(next
->type
== nir_cf_node_block
);
1059 nir_block
*next_block
= nir_cf_node_as_block(next
);
1061 insert_non_block_before_block(after
, next_block
);
1065 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1066 nir_metadata_dirty(impl
, nir_metadata_none
);
1070 nir_cf_node_insert_before(nir_cf_node
*node
, nir_cf_node
*before
)
1072 update_if_uses(before
);
1074 if (before
->type
== nir_cf_node_block
) {
1075 nir_block
*before_block
= nir_cf_node_as_block(before
);
1077 bool has_jump
= !exec_list_is_empty(&before_block
->instr_list
) &&
1078 nir_block_last_instr(before_block
)->type
== nir_instr_type_jump
;
1080 if (node
->type
== nir_cf_node_block
) {
1081 insert_block_before_block(nir_cf_node_as_block(node
), before_block
,
1084 nir_cf_node
*prev
= nir_cf_node_prev(node
);
1085 assert(prev
->type
== nir_cf_node_block
);
1086 nir_block
*prev_block
= nir_cf_node_as_block(prev
);
1088 insert_block_after_block(prev_block
, before_block
, has_jump
);
1091 if (node
->type
== nir_cf_node_block
) {
1092 insert_non_block_before_block(before
, nir_cf_node_as_block(node
));
1095 * We have to insert a non-basic block before a non-basic block. This
1096 * is equivalent to inserting a non-basic block after a basic block.
1099 nir_cf_node
*prev_node
= nir_cf_node_prev(node
);
1100 assert(prev_node
->type
== nir_cf_node_block
);
1101 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
1103 insert_non_block_after_block(prev_block
, before
);
1107 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1108 nir_metadata_dirty(impl
, nir_metadata_none
);
1112 nir_cf_node_insert_begin(struct exec_list
*list
, nir_cf_node
*node
)
1114 nir_cf_node
*begin
= exec_node_data(nir_cf_node
, list
->head
, node
);
1115 nir_cf_node_insert_before(begin
, node
);
1119 nir_cf_node_insert_end(struct exec_list
*list
, nir_cf_node
*node
)
1121 nir_cf_node
*end
= exec_node_data(nir_cf_node
, list
->tail_pred
, node
);
1122 nir_cf_node_insert_after(end
, node
);
1126 * Stitch two basic blocks together into one. The aggregate must have the same
1127 * predecessors as the first and the same successors as the second.
1131 stitch_blocks(nir_block
*before
, nir_block
*after
)
1134 * We move after into before, so we have to deal with up to 2 successors vs.
1135 * possibly a large number of predecessors.
1137 * TODO: special case when before is empty and after isn't?
1140 move_successors(after
, before
);
1142 foreach_list_typed(nir_instr
, instr
, node
, &after
->instr_list
) {
1143 instr
->block
= before
;
1146 exec_list_append(&before
->instr_list
, &after
->instr_list
);
1147 exec_node_remove(&after
->cf_node
.node
);
1151 nir_cf_node_remove(nir_cf_node
*node
)
1153 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1154 nir_metadata_dirty(impl
, nir_metadata_none
);
1156 if (node
->type
== nir_cf_node_block
) {
1158 * Basic blocks can't really be removed by themselves, since they act as
1159 * padding between the non-basic blocks. So all we do here is empty the
1160 * block of instructions.
1162 * TODO: could we assert here?
1164 exec_list_make_empty(&nir_cf_node_as_block(node
)->instr_list
);
1166 nir_cf_node
*before
= nir_cf_node_prev(node
);
1167 assert(before
->type
== nir_cf_node_block
);
1168 nir_block
*before_block
= nir_cf_node_as_block(before
);
1170 nir_cf_node
*after
= nir_cf_node_next(node
);
1171 assert(after
->type
== nir_cf_node_block
);
1172 nir_block
*after_block
= nir_cf_node_as_block(after
);
1174 exec_node_remove(&node
->node
);
1175 stitch_blocks(before_block
, after_block
);
1180 add_use_cb(nir_src
*src
, void *state
)
1182 nir_instr
*instr
= (nir_instr
*) state
;
1184 struct set
*uses_set
= src
->is_ssa
? src
->ssa
->uses
: src
->reg
.reg
->uses
;
1186 _mesa_set_add(uses_set
, _mesa_hash_pointer(instr
), instr
);
1192 add_def_cb(nir_dest
*dest
, void *state
)
1194 nir_instr
*instr
= (nir_instr
*) state
;
1199 nir_register
*reg
= dest
->reg
.reg
;
1201 _mesa_set_add(reg
->defs
, _mesa_hash_pointer(instr
), instr
);
1207 add_defs_uses(nir_instr
*instr
)
1209 nir_foreach_src(instr
, add_use_cb
, instr
);
1210 nir_foreach_dest(instr
, add_def_cb
, instr
);
1214 nir_instr_insert_before(nir_instr
*instr
, nir_instr
*before
)
1216 assert(before
->type
!= nir_instr_type_jump
);
1217 before
->block
= instr
->block
;
1218 add_defs_uses(before
);
1219 exec_node_insert_node_before(&instr
->node
, &before
->node
);
1223 nir_instr_insert_after(nir_instr
*instr
, nir_instr
*after
)
1225 if (after
->type
== nir_instr_type_jump
) {
1226 assert(instr
== nir_block_last_instr(instr
->block
));
1227 assert(instr
->type
!= nir_instr_type_jump
);
1230 after
->block
= instr
->block
;
1231 add_defs_uses(after
);
1232 exec_node_insert_after(&instr
->node
, &after
->node
);
1234 if (after
->type
== nir_instr_type_jump
)
1235 handle_jump(after
->block
);
1239 nir_instr_insert_before_block(nir_block
*block
, nir_instr
*before
)
1241 if (before
->type
== nir_instr_type_jump
)
1242 assert(exec_list_is_empty(&block
->instr_list
));
1244 before
->block
= block
;
1245 add_defs_uses(before
);
1246 exec_list_push_head(&block
->instr_list
, &before
->node
);
1248 if (before
->type
== nir_instr_type_jump
)
1253 nir_instr_insert_after_block(nir_block
*block
, nir_instr
*after
)
1255 if (after
->type
== nir_instr_type_jump
) {
1256 assert(exec_list_is_empty(&block
->instr_list
) ||
1257 nir_block_last_instr(block
)->type
!= nir_instr_type_jump
);
1260 after
->block
= block
;
1261 add_defs_uses(after
);
1262 exec_list_push_tail(&block
->instr_list
, &after
->node
);
1264 if (after
->type
== nir_instr_type_jump
)
1269 nir_instr_insert_before_cf(nir_cf_node
*node
, nir_instr
*before
)
1271 if (node
->type
== nir_cf_node_block
) {
1272 nir_instr_insert_before_block(nir_cf_node_as_block(node
), before
);
1274 nir_cf_node
*prev
= nir_cf_node_prev(node
);
1275 assert(prev
->type
== nir_cf_node_block
);
1276 nir_block
*prev_block
= nir_cf_node_as_block(prev
);
1278 nir_instr_insert_before_block(prev_block
, before
);
1283 nir_instr_insert_after_cf(nir_cf_node
*node
, nir_instr
*after
)
1285 if (node
->type
== nir_cf_node_block
) {
1286 nir_instr_insert_after_block(nir_cf_node_as_block(node
), after
);
1288 nir_cf_node
*next
= nir_cf_node_next(node
);
1289 assert(next
->type
== nir_cf_node_block
);
1290 nir_block
*next_block
= nir_cf_node_as_block(next
);
1292 nir_instr_insert_before_block(next_block
, after
);
1297 nir_instr_insert_before_cf_list(struct exec_list
*list
, nir_instr
*before
)
1299 nir_cf_node
*first_node
= exec_node_data(nir_cf_node
,
1300 exec_list_get_head(list
), node
);
1301 nir_instr_insert_before_cf(first_node
, before
);
1305 nir_instr_insert_after_cf_list(struct exec_list
*list
, nir_instr
*after
)
1307 nir_cf_node
*last_node
= exec_node_data(nir_cf_node
,
1308 exec_list_get_tail(list
), node
);
1309 nir_instr_insert_after_cf(last_node
, after
);
1313 remove_use_cb(nir_src
*src
, void *state
)
1315 nir_instr
*instr
= (nir_instr
*) state
;
1317 struct set
*uses_set
= src
->is_ssa
? src
->ssa
->uses
: src
->reg
.reg
->uses
;
1319 struct set_entry
*entry
= _mesa_set_search(uses_set
,
1320 _mesa_hash_pointer(instr
),
1323 _mesa_set_remove(uses_set
, entry
);
1329 remove_def_cb(nir_dest
*dest
, void *state
)
1331 nir_instr
*instr
= (nir_instr
*) state
;
1336 nir_register
*reg
= dest
->reg
.reg
;
1338 struct set_entry
*entry
= _mesa_set_search(reg
->defs
,
1339 _mesa_hash_pointer(instr
),
1342 _mesa_set_remove(reg
->defs
, entry
);
1348 remove_defs_uses(nir_instr
*instr
)
1350 nir_foreach_dest(instr
, remove_def_cb
, instr
);
1351 nir_foreach_src(instr
, remove_use_cb
, instr
);
1354 void nir_instr_remove(nir_instr
*instr
)
1356 remove_defs_uses(instr
);
1357 exec_node_remove(&instr
->node
);
1359 if (instr
->type
== nir_instr_type_jump
) {
1360 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
1361 handle_remove_jump(instr
->block
, jump_instr
->type
);
1368 nir_index_local_regs(nir_function_impl
*impl
)
1371 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
1372 reg
->index
= index
++;
1374 impl
->reg_alloc
= index
;
1378 nir_index_global_regs(nir_shader
*shader
)
1381 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
1382 reg
->index
= index
++;
1384 shader
->reg_alloc
= index
;
1388 visit_alu_dest(nir_alu_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1390 return cb(&instr
->dest
.dest
, state
);
1394 visit_intrinsic_dest(nir_intrinsic_instr
*instr
, nir_foreach_dest_cb cb
,
1397 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
)
1398 return cb(&instr
->dest
, state
);
1404 visit_texture_dest(nir_tex_instr
*instr
, nir_foreach_dest_cb cb
,
1407 return cb(&instr
->dest
, state
);
1411 visit_load_const_dest(nir_load_const_instr
*instr
, nir_foreach_dest_cb cb
,
1414 return cb(&instr
->dest
, state
);
1418 visit_phi_dest(nir_phi_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1420 return cb(&instr
->dest
, state
);
1424 visit_parallel_copy_dest(nir_parallel_copy_instr
*instr
,
1425 nir_foreach_dest_cb cb
, void *state
)
1427 foreach_list_typed(nir_parallel_copy_copy
, copy
, node
, &instr
->copies
) {
1428 if (!cb(©
->dest
, state
))
1436 nir_foreach_dest(nir_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1438 switch (instr
->type
) {
1439 case nir_instr_type_alu
:
1440 return visit_alu_dest(nir_instr_as_alu(instr
), cb
, state
);
1441 case nir_instr_type_intrinsic
:
1442 return visit_intrinsic_dest(nir_instr_as_intrinsic(instr
), cb
, state
);
1443 case nir_instr_type_texture
:
1444 return visit_texture_dest(nir_instr_as_texture(instr
), cb
, state
);
1445 case nir_instr_type_load_const
:
1446 return visit_load_const_dest(nir_instr_as_load_const(instr
), cb
, state
);
1447 case nir_instr_type_phi
:
1448 return visit_phi_dest(nir_instr_as_phi(instr
), cb
, state
);
1449 case nir_instr_type_parallel_copy
:
1450 return visit_parallel_copy_dest(nir_instr_as_parallel_copy(instr
),
1453 case nir_instr_type_ssa_undef
:
1454 case nir_instr_type_call
:
1455 case nir_instr_type_jump
:
1459 unreachable("Invalid instruction type");
1467 visit_src(nir_src
*src
, nir_foreach_src_cb cb
, void *state
)
1469 if (!cb(src
, state
))
1471 if (!src
->is_ssa
&& src
->reg
.indirect
)
1472 return cb(src
->reg
.indirect
, state
);
1477 visit_deref_array_src(nir_deref_array
*deref
, nir_foreach_src_cb cb
,
1480 if (deref
->has_indirect
)
1481 return visit_src(&deref
->indirect
, cb
, state
);
1486 visit_deref_src(nir_deref_var
*deref
, nir_foreach_src_cb cb
, void *state
)
1488 nir_deref
*cur
= &deref
->deref
;
1489 while (cur
!= NULL
) {
1490 if (cur
->deref_type
== nir_deref_type_array
)
1491 if (!visit_deref_array_src(nir_deref_as_array(cur
), cb
, state
))
1501 visit_alu_src(nir_alu_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1503 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++)
1504 if (!visit_src(&instr
->src
[i
].src
, cb
, state
))
1507 if (instr
->has_predicate
)
1508 if (!visit_src(&instr
->predicate
, cb
, state
))
1515 visit_tex_src(nir_tex_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1517 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++)
1518 if (!visit_src(&instr
->src
[i
], cb
, state
))
1521 if (instr
->has_predicate
)
1522 if (!visit_src(&instr
->predicate
, cb
, state
))
1525 if (instr
->sampler
!= NULL
)
1526 if (!visit_deref_src(instr
->sampler
, cb
, state
))
1533 visit_intrinsic_src(nir_intrinsic_instr
*instr
, nir_foreach_src_cb cb
,
1536 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
1537 for (unsigned i
= 0; i
< num_srcs
; i
++)
1538 if (!visit_src(&instr
->src
[i
], cb
, state
))
1542 nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
1543 for (unsigned i
= 0; i
< num_vars
; i
++)
1544 if (!visit_deref_src(instr
->variables
[i
], cb
, state
))
1547 if (instr
->has_predicate
)
1548 if (!visit_src(&instr
->predicate
, cb
, state
))
1555 visit_call_src(nir_call_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1557 if (instr
->has_predicate
)
1558 if (!visit_src(&instr
->predicate
, cb
, state
))
1565 visit_load_const_src(nir_load_const_instr
*instr
, nir_foreach_src_cb cb
,
1568 if (instr
->has_predicate
)
1569 if (!visit_src(&instr
->predicate
, cb
, state
))
1576 visit_phi_src(nir_phi_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1578 foreach_list_typed(nir_phi_src
, src
, node
, &instr
->srcs
) {
1579 if (!visit_src(&src
->src
, cb
, state
))
1587 visit_parallel_copy_src(nir_parallel_copy_instr
*instr
,
1588 nir_foreach_src_cb cb
, void *state
)
1590 foreach_list_typed(nir_parallel_copy_copy
, copy
, node
, &instr
->copies
) {
1591 if (!visit_src(©
->src
, cb
, state
))
1600 nir_foreach_src_cb cb
;
1601 } visit_dest_indirect_state
;
1604 visit_dest_indirect(nir_dest
*dest
, void *_state
)
1606 visit_dest_indirect_state
*state
= (visit_dest_indirect_state
*) _state
;
1608 if (!dest
->is_ssa
&& dest
->reg
.indirect
)
1609 return state
->cb(dest
->reg
.indirect
, state
->state
);
1615 nir_foreach_src(nir_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1617 switch (instr
->type
) {
1618 case nir_instr_type_alu
:
1619 if (!visit_alu_src(nir_instr_as_alu(instr
), cb
, state
))
1622 case nir_instr_type_intrinsic
:
1623 if (!visit_intrinsic_src(nir_instr_as_intrinsic(instr
), cb
, state
))
1626 case nir_instr_type_texture
:
1627 if (!visit_tex_src(nir_instr_as_texture(instr
), cb
, state
))
1630 case nir_instr_type_call
:
1631 if (!visit_call_src(nir_instr_as_call(instr
), cb
, state
))
1634 case nir_instr_type_load_const
:
1635 if (!visit_load_const_src(nir_instr_as_load_const(instr
), cb
, state
))
1638 case nir_instr_type_phi
:
1639 if (!visit_phi_src(nir_instr_as_phi(instr
), cb
, state
))
1642 case nir_instr_type_parallel_copy
:
1643 if (!visit_parallel_copy_src(nir_instr_as_parallel_copy(instr
),
1647 case nir_instr_type_jump
:
1648 case nir_instr_type_ssa_undef
:
1652 unreachable("Invalid instruction type");
1656 visit_dest_indirect_state dest_state
;
1657 dest_state
.state
= state
;
1659 return nir_foreach_dest(instr
, visit_dest_indirect
, &dest_state
);
1663 nir_srcs_equal(nir_src src1
, nir_src src2
)
1667 return src1
.ssa
== src2
.ssa
;
1675 if ((src1
.reg
.indirect
== NULL
) != (src2
.reg
.indirect
== NULL
))
1678 if (src1
.reg
.indirect
) {
1679 if (!nir_srcs_equal(*src1
.reg
.indirect
, *src2
.reg
.indirect
))
1683 return src1
.reg
.reg
== src2
.reg
.reg
&&
1684 src1
.reg
.base_offset
== src2
.reg
.base_offset
;
1690 src_does_not_use_def(nir_src
*src
, void *void_def
)
1692 nir_ssa_def
*def
= void_def
;
1695 return src
->ssa
!= def
;
1702 src_does_not_use_reg(nir_src
*src
, void *void_reg
)
1704 nir_register
*reg
= void_reg
;
1709 return src
->reg
.reg
!= reg
;
1714 nir_instr_rewrite_src(nir_instr
*instr
, nir_src
*src
, nir_src new_src
)
1717 nir_ssa_def
*old_ssa
= src
->ssa
;
1719 if (old_ssa
&& nir_foreach_src(instr
, src_does_not_use_def
, old_ssa
)) {
1720 struct set_entry
*entry
= _mesa_set_search(old_ssa
->uses
,
1721 _mesa_hash_pointer(instr
),
1724 _mesa_set_remove(old_ssa
->uses
, entry
);
1727 if (src
->reg
.indirect
)
1728 nir_instr_rewrite_src(instr
, src
->reg
.indirect
, new_src
);
1730 nir_register
*old_reg
= src
->reg
.reg
;
1732 if (old_reg
&& nir_foreach_src(instr
, src_does_not_use_reg
, old_reg
)) {
1733 struct set_entry
*entry
= _mesa_set_search(old_reg
->uses
,
1734 _mesa_hash_pointer(instr
),
1737 _mesa_set_remove(old_reg
->uses
, entry
);
1741 if (new_src
.is_ssa
) {
1743 _mesa_set_add(new_src
.ssa
->uses
, _mesa_hash_pointer(instr
), instr
);
1745 if (new_src
.reg
.reg
)
1746 _mesa_set_add(new_src
.reg
.reg
->uses
, _mesa_hash_pointer(instr
), instr
);
1751 nir_ssa_def_init(nir_function_impl
*impl
, nir_instr
*instr
, nir_ssa_def
*def
,
1752 unsigned num_components
, const char *name
)
1754 void *mem_ctx
= ralloc_parent(instr
);
1757 def
->index
= impl
->ssa_alloc
++;
1758 def
->parent_instr
= instr
;
1759 def
->uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
1760 def
->if_uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
1761 def
->num_components
= num_components
;
1764 struct ssa_def_rewrite_state
{
1771 ssa_def_rewrite_uses_src(nir_src
*src
, void *void_state
)
1773 struct ssa_def_rewrite_state
*state
= void_state
;
1775 if (src
->is_ssa
&& src
->ssa
== state
->old
)
1776 *src
= nir_src_copy(state
->new_src
, state
->mem_ctx
);
1782 nir_ssa_def_rewrite_uses(nir_ssa_def
*def
, nir_src new_src
, void *mem_ctx
)
1784 struct ssa_def_rewrite_state state
;
1785 state
.mem_ctx
= mem_ctx
;
1787 state
.new_src
= new_src
;
1789 assert(!new_src
.is_ssa
|| def
!= new_src
.ssa
);
1791 struct set
*new_uses
, *new_if_uses
;
1792 if (new_src
.is_ssa
) {
1793 new_uses
= new_src
.ssa
->uses
;
1794 new_if_uses
= new_src
.ssa
->if_uses
;
1796 new_uses
= new_src
.reg
.reg
->uses
;
1797 new_if_uses
= new_src
.reg
.reg
->if_uses
;
1800 struct set_entry
*entry
;
1801 set_foreach(def
->uses
, entry
) {
1802 nir_instr
*instr
= (nir_instr
*)entry
->key
;
1804 _mesa_set_remove(def
->uses
, entry
);
1805 nir_foreach_src(instr
, ssa_def_rewrite_uses_src
, &state
);
1806 _mesa_set_add(new_uses
, _mesa_hash_pointer(instr
), instr
);
1809 set_foreach(def
->if_uses
, entry
) {
1810 nir_if
*if_use
= (nir_if
*)entry
->key
;
1812 _mesa_set_remove(def
->if_uses
, entry
);
1813 if_use
->condition
= nir_src_copy(new_src
, mem_ctx
);
1814 _mesa_set_add(new_if_uses
, _mesa_hash_pointer(if_use
), if_use
);
1819 static bool foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1820 bool reverse
, void *state
);
1823 foreach_if(nir_if
*if_stmt
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1826 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
,
1827 &if_stmt
->else_list
) {
1828 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1832 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
,
1833 &if_stmt
->then_list
) {
1834 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1838 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->then_list
) {
1839 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1843 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->else_list
) {
1844 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1853 foreach_loop(nir_loop
*loop
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1856 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
, &loop
->body
) {
1857 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1861 foreach_list_typed_safe(nir_cf_node
, node
, node
, &loop
->body
) {
1862 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1871 foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1872 bool reverse
, void *state
)
1874 switch (node
->type
) {
1875 case nir_cf_node_block
:
1876 return cb(nir_cf_node_as_block(node
), state
);
1877 case nir_cf_node_if
:
1878 return foreach_if(nir_cf_node_as_if(node
), cb
, reverse
, state
);
1879 case nir_cf_node_loop
:
1880 return foreach_loop(nir_cf_node_as_loop(node
), cb
, reverse
, state
);
1884 unreachable("Invalid CFG node type");
1892 nir_foreach_block(nir_function_impl
*impl
, nir_foreach_block_cb cb
, void *state
)
1894 foreach_list_typed_safe(nir_cf_node
, node
, node
, &impl
->body
) {
1895 if (!foreach_cf_node(node
, cb
, false, state
))
1899 return cb(impl
->end_block
, state
);
1903 nir_foreach_block_reverse(nir_function_impl
*impl
, nir_foreach_block_cb cb
,
1906 if (!cb(impl
->end_block
, state
))
1909 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
, &impl
->body
) {
1910 if (!foreach_cf_node(node
, cb
, true, state
))
1918 nir_block_following_if(nir_block
*block
)
1920 if (exec_node_is_tail_sentinel(&block
->cf_node
.node
))
1923 if (nir_cf_node_is_last(&block
->cf_node
))
1926 nir_cf_node
*next_node
= nir_cf_node_next(&block
->cf_node
);
1928 if (next_node
->type
!= nir_cf_node_if
)
1931 return nir_cf_node_as_if(next_node
);
1935 index_block(nir_block
*block
, void *state
)
1937 unsigned *index
= (unsigned *) state
;
1938 block
->index
= (*index
)++;
1943 nir_index_blocks(nir_function_impl
*impl
)
1947 if (impl
->valid_metadata
& nir_metadata_block_index
)
1950 nir_foreach_block(impl
, index_block
, &index
);
1952 impl
->num_blocks
= index
;
1956 index_ssa_def(nir_ssa_def
*def
, unsigned *index
)
1958 def
->index
= (*index
)++;
1962 index_ssa_def_cb(nir_dest
*dest
, void *state
)
1964 unsigned *index
= (unsigned *) state
;
1966 index_ssa_def(&dest
->ssa
, index
);
1971 index_ssa_undef(nir_ssa_undef_instr
*instr
, unsigned *index
)
1973 index_ssa_def(&instr
->def
, index
);
1977 index_ssa_block(nir_block
*block
, void *state
)
1979 unsigned *index
= (unsigned *) state
;
1981 nir_foreach_instr(block
, instr
) {
1982 if (instr
->type
== nir_instr_type_ssa_undef
)
1983 index_ssa_undef(nir_instr_as_ssa_undef(instr
), index
);
1985 nir_foreach_dest(instr
, index_ssa_def_cb
, state
);
1992 nir_index_ssa_defs(nir_function_impl
*impl
)
1995 nir_foreach_block(impl
, index_ssa_block
, &index
);
1996 impl
->ssa_alloc
= index
;