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
]);
388 nir_jump_instr_create(void *mem_ctx
, nir_jump_type type
)
390 nir_jump_instr
*instr
= ralloc(mem_ctx
, nir_jump_instr
);
391 instr_init(&instr
->instr
, nir_instr_type_jump
);
396 nir_load_const_instr
*
397 nir_load_const_instr_create(void *mem_ctx
, unsigned num_components
)
399 nir_load_const_instr
*instr
= ralloc(mem_ctx
, nir_load_const_instr
);
400 instr_init(&instr
->instr
, nir_instr_type_load_const
);
402 nir_ssa_def_init(&instr
->instr
, &instr
->def
, num_components
, NULL
);
407 nir_intrinsic_instr
*
408 nir_intrinsic_instr_create(void *mem_ctx
, nir_intrinsic_op op
)
410 unsigned num_srcs
= nir_intrinsic_infos
[op
].num_srcs
;
411 nir_intrinsic_instr
*instr
=
413 sizeof(nir_intrinsic_instr
) + num_srcs
* sizeof(nir_src
));
415 instr_init(&instr
->instr
, nir_instr_type_intrinsic
);
416 instr
->intrinsic
= op
;
418 if (nir_intrinsic_infos
[op
].has_dest
)
419 dest_init(&instr
->dest
);
421 for (unsigned i
= 0; i
< num_srcs
; i
++)
422 src_init(&instr
->src
[i
]);
428 nir_call_instr_create(void *mem_ctx
, nir_function_overload
*callee
)
430 nir_call_instr
*instr
= ralloc(mem_ctx
, nir_call_instr
);
431 instr_init(&instr
->instr
, nir_instr_type_call
);
433 instr
->callee
= callee
;
434 instr
->num_params
= callee
->num_params
;
435 instr
->params
= ralloc_array(mem_ctx
, nir_deref_var
*, instr
->num_params
);
436 instr
->return_deref
= NULL
;
442 nir_tex_instr_create(void *mem_ctx
, unsigned num_srcs
)
444 nir_tex_instr
*instr
= ralloc(mem_ctx
, nir_tex_instr
);
445 instr_init(&instr
->instr
, nir_instr_type_tex
);
447 dest_init(&instr
->dest
);
449 instr
->num_srcs
= num_srcs
;
450 for (unsigned i
= 0; i
< 4; i
++)
451 src_init(&instr
->src
[i
]);
453 instr
->sampler_index
= 0;
454 instr
->sampler_array_size
= 0;
455 instr
->sampler
= NULL
;
461 nir_phi_instr_create(void *mem_ctx
)
463 nir_phi_instr
*instr
= ralloc(mem_ctx
, nir_phi_instr
);
464 instr_init(&instr
->instr
, nir_instr_type_phi
);
466 dest_init(&instr
->dest
);
467 exec_list_make_empty(&instr
->srcs
);
471 nir_parallel_copy_instr
*
472 nir_parallel_copy_instr_create(void *mem_ctx
)
474 nir_parallel_copy_instr
*instr
= ralloc(mem_ctx
, nir_parallel_copy_instr
);
475 instr_init(&instr
->instr
, nir_instr_type_parallel_copy
);
477 exec_list_make_empty(&instr
->copies
);
482 nir_ssa_undef_instr
*
483 nir_ssa_undef_instr_create(void *mem_ctx
, unsigned num_components
)
485 nir_ssa_undef_instr
*instr
= ralloc(mem_ctx
, nir_ssa_undef_instr
);
486 instr_init(&instr
->instr
, nir_instr_type_ssa_undef
);
488 nir_ssa_def_init(&instr
->instr
, &instr
->def
, num_components
, NULL
);
494 nir_deref_var_create(void *mem_ctx
, nir_variable
*var
)
496 nir_deref_var
*deref
= ralloc(mem_ctx
, nir_deref_var
);
497 deref
->deref
.deref_type
= nir_deref_type_var
;
498 deref
->deref
.child
= NULL
;
499 deref
->deref
.type
= var
->type
;
505 nir_deref_array_create(void *mem_ctx
)
507 nir_deref_array
*deref
= ralloc(mem_ctx
, nir_deref_array
);
508 deref
->deref
.deref_type
= nir_deref_type_array
;
509 deref
->deref
.child
= NULL
;
510 deref
->deref_array_type
= nir_deref_array_type_direct
;
511 src_init(&deref
->indirect
);
512 deref
->base_offset
= 0;
517 nir_deref_struct_create(void *mem_ctx
, unsigned field_index
)
519 nir_deref_struct
*deref
= ralloc(mem_ctx
, nir_deref_struct
);
520 deref
->deref
.deref_type
= nir_deref_type_struct
;
521 deref
->deref
.child
= NULL
;
522 deref
->index
= field_index
;
526 static nir_deref_var
*
527 copy_deref_var(void *mem_ctx
, nir_deref_var
*deref
)
529 nir_deref_var
*ret
= nir_deref_var_create(mem_ctx
, deref
->var
);
530 ret
->deref
.type
= deref
->deref
.type
;
531 if (deref
->deref
.child
)
532 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
536 static nir_deref_array
*
537 copy_deref_array(void *mem_ctx
, nir_deref_array
*deref
)
539 nir_deref_array
*ret
= nir_deref_array_create(mem_ctx
);
540 ret
->base_offset
= deref
->base_offset
;
541 ret
->deref_array_type
= deref
->deref_array_type
;
542 if (deref
->deref_array_type
== nir_deref_array_type_indirect
) {
543 ret
->indirect
= nir_src_copy(deref
->indirect
, mem_ctx
);
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_struct
*
552 copy_deref_struct(void *mem_ctx
, nir_deref_struct
*deref
)
554 nir_deref_struct
*ret
= nir_deref_struct_create(mem_ctx
, deref
->index
);
555 ret
->deref
.type
= deref
->deref
.type
;
556 if (deref
->deref
.child
)
557 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
562 nir_copy_deref(void *mem_ctx
, nir_deref
*deref
)
564 switch (deref
->deref_type
) {
565 case nir_deref_type_var
:
566 return ©_deref_var(mem_ctx
, nir_deref_as_var(deref
))->deref
;
567 case nir_deref_type_array
:
568 return ©_deref_array(mem_ctx
, nir_deref_as_array(deref
))->deref
;
569 case nir_deref_type_struct
:
570 return ©_deref_struct(mem_ctx
, nir_deref_as_struct(deref
))->deref
;
572 unreachable("Invalid dereference type");
580 * \name Control flow modification
582 * These functions modify the control flow tree while keeping the control flow
583 * graph up-to-date. The invariants respected are:
584 * 1. Each then statement, else statement, or loop body must have at least one
586 * 2. Each if-statement and loop must have one basic block before it and one
588 * 3. Two basic blocks cannot be directly next to each other.
589 * 4. If a basic block has a jump instruction, there must be only one and it
590 * must be at the end of the block.
591 * 5. The CFG must always be connected - this means that we must insert a fake
592 * CFG edge for loops with no break statement.
594 * The purpose of the second one is so that we have places to insert code during
595 * GCM, as well as eliminating the possibility of critical edges.
600 link_non_block_to_block(nir_cf_node
*node
, nir_block
*block
)
602 if (node
->type
== nir_cf_node_if
) {
604 * We're trying to link an if to a block after it; this just means linking
605 * the last block of the then and else branches.
608 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
610 nir_cf_node
*last_then
= nir_if_last_then_node(if_stmt
);
611 assert(last_then
->type
== nir_cf_node_block
);
612 nir_block
*last_then_block
= nir_cf_node_as_block(last_then
);
614 nir_cf_node
*last_else
= nir_if_last_else_node(if_stmt
);
615 assert(last_else
->type
== nir_cf_node_block
);
616 nir_block
*last_else_block
= nir_cf_node_as_block(last_else
);
618 if (exec_list_is_empty(&last_then_block
->instr_list
) ||
619 nir_block_last_instr(last_then_block
)->type
!= nir_instr_type_jump
) {
620 unlink_block_successors(last_then_block
);
621 link_blocks(last_then_block
, block
, NULL
);
624 if (exec_list_is_empty(&last_else_block
->instr_list
) ||
625 nir_block_last_instr(last_else_block
)->type
!= nir_instr_type_jump
) {
626 unlink_block_successors(last_else_block
);
627 link_blocks(last_else_block
, block
, NULL
);
630 assert(node
->type
== nir_cf_node_loop
);
633 * We can only get to this codepath if we're inserting a new loop, or
634 * at least a loop with no break statements; we can't insert break
635 * statements into a loop when we haven't inserted it into the CFG
636 * because we wouldn't know which block comes after the loop
637 * and therefore, which block should be the successor of the block with
638 * the break). Therefore, we need to insert a fake edge (see invariant
642 nir_loop
*loop
= nir_cf_node_as_loop(node
);
644 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
645 assert(last
->type
== nir_cf_node_block
);
646 nir_block
*last_block
= nir_cf_node_as_block(last
);
648 last_block
->successors
[1] = block
;
649 block_add_pred(block
, last_block
);
654 link_block_to_non_block(nir_block
*block
, nir_cf_node
*node
)
656 if (node
->type
== nir_cf_node_if
) {
658 * We're trying to link a block to an if after it; this just means linking
659 * the block to the first block of the then and else branches.
662 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
664 nir_cf_node
*first_then
= nir_if_first_then_node(if_stmt
);
665 assert(first_then
->type
== nir_cf_node_block
);
666 nir_block
*first_then_block
= nir_cf_node_as_block(first_then
);
668 nir_cf_node
*first_else
= nir_if_first_else_node(if_stmt
);
669 assert(first_else
->type
== nir_cf_node_block
);
670 nir_block
*first_else_block
= nir_cf_node_as_block(first_else
);
672 unlink_block_successors(block
);
673 link_blocks(block
, first_then_block
, first_else_block
);
676 * For similar reasons as the corresponding case in
677 * link_non_block_to_block(), don't worry about if the loop header has
678 * any predecessors that need to be unlinked.
681 assert(node
->type
== nir_cf_node_loop
);
683 nir_loop
*loop
= nir_cf_node_as_loop(node
);
685 nir_cf_node
*loop_header
= nir_loop_first_cf_node(loop
);
686 assert(loop_header
->type
== nir_cf_node_block
);
687 nir_block
*loop_header_block
= nir_cf_node_as_block(loop_header
);
689 unlink_block_successors(block
);
690 link_blocks(block
, loop_header_block
, NULL
);
696 * Takes a basic block and inserts a new empty basic block before it, making its
697 * predecessors point to the new block. This essentially splits the block into
698 * an empty header and a body so that another non-block CF node can be inserted
699 * between the two. Note that this does *not* link the two basic blocks, so
700 * some kind of cleanup *must* be performed after this call.
704 split_block_beginning(nir_block
*block
)
706 nir_block
*new_block
= nir_block_create(ralloc_parent(block
));
707 new_block
->cf_node
.parent
= block
->cf_node
.parent
;
708 exec_node_insert_node_before(&block
->cf_node
.node
, &new_block
->cf_node
.node
);
710 struct set_entry
*entry
;
711 set_foreach(block
->predecessors
, entry
) {
712 nir_block
*pred
= (nir_block
*) entry
->key
;
714 unlink_blocks(pred
, block
);
715 link_blocks(pred
, new_block
, NULL
);
722 rewrite_phi_preds(nir_block
*block
, nir_block
*old_pred
, nir_block
*new_pred
)
724 nir_foreach_instr_safe(block
, instr
) {
725 if (instr
->type
!= nir_instr_type_phi
)
728 nir_phi_instr
*phi
= nir_instr_as_phi(instr
);
729 foreach_list_typed_safe(nir_phi_src
, src
, node
, &phi
->srcs
) {
730 if (src
->pred
== old_pred
) {
731 src
->pred
= new_pred
;
739 * Moves the successors of source to the successors of dest, leaving both
740 * successors of source NULL.
744 move_successors(nir_block
*source
, nir_block
*dest
)
746 nir_block
*succ1
= source
->successors
[0];
747 nir_block
*succ2
= source
->successors
[1];
750 unlink_blocks(source
, succ1
);
751 rewrite_phi_preds(succ1
, source
, dest
);
755 unlink_blocks(source
, succ2
);
756 rewrite_phi_preds(succ2
, source
, dest
);
759 unlink_block_successors(dest
);
760 link_blocks(dest
, succ1
, succ2
);
764 split_block_end(nir_block
*block
)
766 nir_block
*new_block
= nir_block_create(ralloc_parent(block
));
767 new_block
->cf_node
.parent
= block
->cf_node
.parent
;
768 exec_node_insert_after(&block
->cf_node
.node
, &new_block
->cf_node
.node
);
770 move_successors(block
, new_block
);
776 * Inserts a non-basic block between two basic blocks and links them together.
780 insert_non_block(nir_block
*before
, nir_cf_node
*node
, nir_block
*after
)
782 node
->parent
= before
->cf_node
.parent
;
783 exec_node_insert_after(&before
->cf_node
.node
, &node
->node
);
784 link_block_to_non_block(before
, node
);
785 link_non_block_to_block(node
, after
);
789 * Inserts a non-basic block before a basic block.
793 insert_non_block_before_block(nir_cf_node
*node
, nir_block
*block
)
795 /* split off the beginning of block into new_block */
796 nir_block
*new_block
= split_block_beginning(block
);
798 /* insert our node in between new_block and block */
799 insert_non_block(new_block
, node
, block
);
803 insert_non_block_after_block(nir_block
*block
, nir_cf_node
*node
)
805 /* split off the end of block into new_block */
806 nir_block
*new_block
= split_block_end(block
);
808 /* insert our node in between block and new_block */
809 insert_non_block(block
, node
, new_block
);
812 /* walk up the control flow tree to find the innermost enclosed loop */
814 nearest_loop(nir_cf_node
*node
)
816 while (node
->type
!= nir_cf_node_loop
) {
820 return nir_cf_node_as_loop(node
);
824 nir_cf_node_get_function(nir_cf_node
*node
)
826 while (node
->type
!= nir_cf_node_function
) {
830 return nir_cf_node_as_function(node
);
834 * update the CFG after a jump instruction has been added to the end of a block
838 handle_jump(nir_block
*block
)
840 nir_instr
*instr
= nir_block_last_instr(block
);
841 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
843 unlink_block_successors(block
);
845 nir_function_impl
*impl
= nir_cf_node_get_function(&block
->cf_node
);
846 nir_metadata_preserve(impl
, nir_metadata_none
);
848 if (jump_instr
->type
== nir_jump_break
||
849 jump_instr
->type
== nir_jump_continue
) {
850 nir_loop
*loop
= nearest_loop(&block
->cf_node
);
852 if (jump_instr
->type
== nir_jump_continue
) {
853 nir_cf_node
*first_node
= nir_loop_first_cf_node(loop
);
854 assert(first_node
->type
== nir_cf_node_block
);
855 nir_block
*first_block
= nir_cf_node_as_block(first_node
);
856 link_blocks(block
, first_block
, NULL
);
858 nir_cf_node
*after
= nir_cf_node_next(&loop
->cf_node
);
859 assert(after
->type
== nir_cf_node_block
);
860 nir_block
*after_block
= nir_cf_node_as_block(after
);
861 link_blocks(block
, after_block
, NULL
);
863 /* If we inserted a fake link, remove it */
864 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
865 assert(last
->type
== nir_cf_node_block
);
866 nir_block
*last_block
= nir_cf_node_as_block(last
);
867 if (last_block
->successors
[1] != NULL
)
868 unlink_blocks(last_block
, after_block
);
871 assert(jump_instr
->type
== nir_jump_return
);
872 link_blocks(block
, impl
->end_block
, NULL
);
877 handle_remove_jump(nir_block
*block
, nir_jump_type type
)
879 unlink_block_successors(block
);
881 if (exec_node_is_tail_sentinel(block
->cf_node
.node
.next
)) {
882 nir_cf_node
*parent
= block
->cf_node
.parent
;
883 if (parent
->type
== nir_cf_node_if
) {
884 nir_cf_node
*next
= nir_cf_node_next(parent
);
885 assert(next
->type
== nir_cf_node_block
);
886 nir_block
*next_block
= nir_cf_node_as_block(next
);
888 link_blocks(block
, next_block
, NULL
);
890 assert(parent
->type
== nir_cf_node_loop
);
891 nir_loop
*loop
= nir_cf_node_as_loop(parent
);
893 nir_cf_node
*head
= nir_loop_first_cf_node(loop
);
894 assert(head
->type
== nir_cf_node_block
);
895 nir_block
*head_block
= nir_cf_node_as_block(head
);
897 link_blocks(block
, head_block
, NULL
);
900 nir_cf_node
*next
= nir_cf_node_next(&block
->cf_node
);
901 if (next
->type
== nir_cf_node_if
) {
902 nir_if
*next_if
= nir_cf_node_as_if(next
);
904 nir_cf_node
*first_then
= nir_if_first_then_node(next_if
);
905 assert(first_then
->type
== nir_cf_node_block
);
906 nir_block
*first_then_block
= nir_cf_node_as_block(first_then
);
908 nir_cf_node
*first_else
= nir_if_first_else_node(next_if
);
909 assert(first_else
->type
== nir_cf_node_block
);
910 nir_block
*first_else_block
= nir_cf_node_as_block(first_else
);
912 link_blocks(block
, first_then_block
, first_else_block
);
914 assert(next
->type
== nir_cf_node_loop
);
915 nir_loop
*next_loop
= nir_cf_node_as_loop(next
);
917 nir_cf_node
*first
= nir_loop_first_cf_node(next_loop
);
918 assert(first
->type
== nir_cf_node_block
);
919 nir_block
*first_block
= nir_cf_node_as_block(first
);
921 link_blocks(block
, first_block
, NULL
);
925 if (type
== nir_jump_break
) {
926 nir_loop
*loop
= nearest_loop(&block
->cf_node
);
928 nir_cf_node
*next
= nir_cf_node_next(&loop
->cf_node
);
929 assert(next
->type
== nir_cf_node_block
);
930 nir_block
*next_block
= nir_cf_node_as_block(next
);
932 if (next_block
->predecessors
->entries
== 0) {
933 /* insert fake link */
934 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
935 assert(last
->type
== nir_cf_node_block
);
936 nir_block
*last_block
= nir_cf_node_as_block(last
);
938 last_block
->successors
[1] = next_block
;
939 block_add_pred(next_block
, last_block
);
943 nir_function_impl
*impl
= nir_cf_node_get_function(&block
->cf_node
);
944 nir_metadata_preserve(impl
, nir_metadata_none
);
948 * Inserts a basic block before another by merging the instructions.
950 * @param block the target of the insertion
951 * @param before the block to be inserted - must not have been inserted before
952 * @param has_jump whether \before has a jump instruction at the end
956 insert_block_before_block(nir_block
*block
, nir_block
*before
, bool has_jump
)
958 assert(!has_jump
|| exec_list_is_empty(&block
->instr_list
));
960 foreach_list_typed(nir_instr
, instr
, node
, &before
->instr_list
) {
961 instr
->block
= block
;
964 exec_list_prepend(&block
->instr_list
, &before
->instr_list
);
971 * Inserts a basic block after another by merging the instructions.
973 * @param block the target of the insertion
974 * @param after the block to be inserted - must not have been inserted before
975 * @param has_jump whether \after has a jump instruction at the end
979 insert_block_after_block(nir_block
*block
, nir_block
*after
, bool has_jump
)
981 foreach_list_typed(nir_instr
, instr
, node
, &after
->instr_list
) {
982 instr
->block
= block
;
985 exec_list_append(&block
->instr_list
, &after
->instr_list
);
992 update_if_uses(nir_cf_node
*node
)
994 if (node
->type
!= nir_cf_node_if
)
997 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
999 struct set
*if_uses_set
= if_stmt
->condition
.is_ssa
?
1000 if_stmt
->condition
.ssa
->if_uses
:
1001 if_stmt
->condition
.reg
.reg
->uses
;
1003 _mesa_set_add(if_uses_set
, _mesa_hash_pointer(if_stmt
), if_stmt
);
1007 nir_cf_node_insert_after(nir_cf_node
*node
, nir_cf_node
*after
)
1009 update_if_uses(after
);
1011 if (after
->type
== nir_cf_node_block
) {
1013 * either node or the one after it must be a basic block, by invariant #2;
1014 * in either case, just merge the blocks together.
1016 nir_block
*after_block
= nir_cf_node_as_block(after
);
1018 bool has_jump
= !exec_list_is_empty(&after_block
->instr_list
) &&
1019 nir_block_last_instr(after_block
)->type
== nir_instr_type_jump
;
1021 if (node
->type
== nir_cf_node_block
) {
1022 insert_block_after_block(nir_cf_node_as_block(node
), after_block
,
1025 nir_cf_node
*next
= nir_cf_node_next(node
);
1026 assert(next
->type
== nir_cf_node_block
);
1027 nir_block
*next_block
= nir_cf_node_as_block(next
);
1029 insert_block_before_block(next_block
, after_block
, has_jump
);
1032 if (node
->type
== nir_cf_node_block
) {
1033 insert_non_block_after_block(nir_cf_node_as_block(node
), after
);
1036 * We have to insert a non-basic block after a non-basic block. Since
1037 * every non-basic block has a basic block after it, this is equivalent
1038 * to inserting a non-basic block before a basic 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_non_block_before_block(after
, next_block
);
1049 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1050 nir_metadata_preserve(impl
, nir_metadata_none
);
1054 nir_cf_node_insert_before(nir_cf_node
*node
, nir_cf_node
*before
)
1056 update_if_uses(before
);
1058 if (before
->type
== nir_cf_node_block
) {
1059 nir_block
*before_block
= nir_cf_node_as_block(before
);
1061 bool has_jump
= !exec_list_is_empty(&before_block
->instr_list
) &&
1062 nir_block_last_instr(before_block
)->type
== nir_instr_type_jump
;
1064 if (node
->type
== nir_cf_node_block
) {
1065 insert_block_before_block(nir_cf_node_as_block(node
), before_block
,
1068 nir_cf_node
*prev
= nir_cf_node_prev(node
);
1069 assert(prev
->type
== nir_cf_node_block
);
1070 nir_block
*prev_block
= nir_cf_node_as_block(prev
);
1072 insert_block_after_block(prev_block
, before_block
, has_jump
);
1075 if (node
->type
== nir_cf_node_block
) {
1076 insert_non_block_before_block(before
, nir_cf_node_as_block(node
));
1079 * We have to insert a non-basic block before a non-basic block. This
1080 * is equivalent to inserting a non-basic block after a basic block.
1083 nir_cf_node
*prev_node
= nir_cf_node_prev(node
);
1084 assert(prev_node
->type
== nir_cf_node_block
);
1085 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
1087 insert_non_block_after_block(prev_block
, before
);
1091 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1092 nir_metadata_preserve(impl
, nir_metadata_none
);
1096 nir_cf_node_insert_begin(struct exec_list
*list
, nir_cf_node
*node
)
1098 nir_cf_node
*begin
= exec_node_data(nir_cf_node
, list
->head
, node
);
1099 nir_cf_node_insert_before(begin
, node
);
1103 nir_cf_node_insert_end(struct exec_list
*list
, nir_cf_node
*node
)
1105 nir_cf_node
*end
= exec_node_data(nir_cf_node
, list
->tail_pred
, node
);
1106 nir_cf_node_insert_after(end
, node
);
1110 * Stitch two basic blocks together into one. The aggregate must have the same
1111 * predecessors as the first and the same successors as the second.
1115 stitch_blocks(nir_block
*before
, nir_block
*after
)
1118 * We move after into before, so we have to deal with up to 2 successors vs.
1119 * possibly a large number of predecessors.
1121 * TODO: special case when before is empty and after isn't?
1124 move_successors(after
, before
);
1126 foreach_list_typed(nir_instr
, instr
, node
, &after
->instr_list
) {
1127 instr
->block
= before
;
1130 exec_list_append(&before
->instr_list
, &after
->instr_list
);
1131 exec_node_remove(&after
->cf_node
.node
);
1135 nir_cf_node_remove(nir_cf_node
*node
)
1137 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1138 nir_metadata_preserve(impl
, nir_metadata_none
);
1140 if (node
->type
== nir_cf_node_block
) {
1142 * Basic blocks can't really be removed by themselves, since they act as
1143 * padding between the non-basic blocks. So all we do here is empty the
1144 * block of instructions.
1146 * TODO: could we assert here?
1148 exec_list_make_empty(&nir_cf_node_as_block(node
)->instr_list
);
1150 nir_cf_node
*before
= nir_cf_node_prev(node
);
1151 assert(before
->type
== nir_cf_node_block
);
1152 nir_block
*before_block
= nir_cf_node_as_block(before
);
1154 nir_cf_node
*after
= nir_cf_node_next(node
);
1155 assert(after
->type
== nir_cf_node_block
);
1156 nir_block
*after_block
= nir_cf_node_as_block(after
);
1158 exec_node_remove(&node
->node
);
1159 stitch_blocks(before_block
, after_block
);
1164 add_use_cb(nir_src
*src
, void *state
)
1166 nir_instr
*instr
= (nir_instr
*) state
;
1168 struct set
*uses_set
= src
->is_ssa
? src
->ssa
->uses
: src
->reg
.reg
->uses
;
1170 _mesa_set_add(uses_set
, _mesa_hash_pointer(instr
), instr
);
1176 add_ssa_def_cb(nir_ssa_def
*def
, void *state
)
1178 nir_instr
*instr
= (nir_instr
*) state
;
1180 if (instr
->block
&& def
->index
== UINT_MAX
) {
1181 nir_function_impl
*impl
=
1182 nir_cf_node_get_function(&instr
->block
->cf_node
);
1184 def
->index
= impl
->ssa_alloc
++;
1191 add_reg_def_cb(nir_dest
*dest
, void *state
)
1193 nir_instr
*instr
= (nir_instr
*) state
;
1196 _mesa_set_add(dest
->reg
.reg
->defs
, _mesa_hash_pointer(instr
), instr
);
1202 add_defs_uses(nir_instr
*instr
)
1204 nir_foreach_src(instr
, add_use_cb
, instr
);
1205 nir_foreach_dest(instr
, add_reg_def_cb
, instr
);
1206 nir_foreach_ssa_def(instr
, add_ssa_def_cb
, instr
);
1210 nir_instr_insert_before(nir_instr
*instr
, nir_instr
*before
)
1212 assert(before
->type
!= nir_instr_type_jump
);
1213 before
->block
= instr
->block
;
1214 add_defs_uses(before
);
1215 exec_node_insert_node_before(&instr
->node
, &before
->node
);
1219 nir_instr_insert_after(nir_instr
*instr
, nir_instr
*after
)
1221 if (after
->type
== nir_instr_type_jump
) {
1222 assert(instr
== nir_block_last_instr(instr
->block
));
1223 assert(instr
->type
!= nir_instr_type_jump
);
1226 after
->block
= instr
->block
;
1227 add_defs_uses(after
);
1228 exec_node_insert_after(&instr
->node
, &after
->node
);
1230 if (after
->type
== nir_instr_type_jump
)
1231 handle_jump(after
->block
);
1235 nir_instr_insert_before_block(nir_block
*block
, nir_instr
*before
)
1237 if (before
->type
== nir_instr_type_jump
)
1238 assert(exec_list_is_empty(&block
->instr_list
));
1240 before
->block
= block
;
1241 add_defs_uses(before
);
1242 exec_list_push_head(&block
->instr_list
, &before
->node
);
1244 if (before
->type
== nir_instr_type_jump
)
1249 nir_instr_insert_after_block(nir_block
*block
, nir_instr
*after
)
1251 if (after
->type
== nir_instr_type_jump
) {
1252 assert(exec_list_is_empty(&block
->instr_list
) ||
1253 nir_block_last_instr(block
)->type
!= nir_instr_type_jump
);
1256 after
->block
= block
;
1257 add_defs_uses(after
);
1258 exec_list_push_tail(&block
->instr_list
, &after
->node
);
1260 if (after
->type
== nir_instr_type_jump
)
1265 nir_instr_insert_before_cf(nir_cf_node
*node
, nir_instr
*before
)
1267 if (node
->type
== nir_cf_node_block
) {
1268 nir_instr_insert_before_block(nir_cf_node_as_block(node
), before
);
1270 nir_cf_node
*prev
= nir_cf_node_prev(node
);
1271 assert(prev
->type
== nir_cf_node_block
);
1272 nir_block
*prev_block
= nir_cf_node_as_block(prev
);
1274 nir_instr_insert_before_block(prev_block
, before
);
1279 nir_instr_insert_after_cf(nir_cf_node
*node
, nir_instr
*after
)
1281 if (node
->type
== nir_cf_node_block
) {
1282 nir_instr_insert_after_block(nir_cf_node_as_block(node
), after
);
1284 nir_cf_node
*next
= nir_cf_node_next(node
);
1285 assert(next
->type
== nir_cf_node_block
);
1286 nir_block
*next_block
= nir_cf_node_as_block(next
);
1288 nir_instr_insert_before_block(next_block
, after
);
1293 nir_instr_insert_before_cf_list(struct exec_list
*list
, nir_instr
*before
)
1295 nir_cf_node
*first_node
= exec_node_data(nir_cf_node
,
1296 exec_list_get_head(list
), node
);
1297 nir_instr_insert_before_cf(first_node
, before
);
1301 nir_instr_insert_after_cf_list(struct exec_list
*list
, nir_instr
*after
)
1303 nir_cf_node
*last_node
= exec_node_data(nir_cf_node
,
1304 exec_list_get_tail(list
), node
);
1305 nir_instr_insert_after_cf(last_node
, after
);
1309 remove_use_cb(nir_src
*src
, void *state
)
1311 nir_instr
*instr
= (nir_instr
*) state
;
1313 struct set
*uses_set
= src
->is_ssa
? src
->ssa
->uses
: src
->reg
.reg
->uses
;
1315 struct set_entry
*entry
= _mesa_set_search(uses_set
,
1316 _mesa_hash_pointer(instr
),
1319 _mesa_set_remove(uses_set
, entry
);
1325 remove_def_cb(nir_dest
*dest
, void *state
)
1327 nir_instr
*instr
= (nir_instr
*) state
;
1332 nir_register
*reg
= dest
->reg
.reg
;
1334 struct set_entry
*entry
= _mesa_set_search(reg
->defs
,
1335 _mesa_hash_pointer(instr
),
1338 _mesa_set_remove(reg
->defs
, entry
);
1344 remove_defs_uses(nir_instr
*instr
)
1346 nir_foreach_dest(instr
, remove_def_cb
, instr
);
1347 nir_foreach_src(instr
, remove_use_cb
, instr
);
1350 void nir_instr_remove(nir_instr
*instr
)
1352 remove_defs_uses(instr
);
1353 exec_node_remove(&instr
->node
);
1355 if (instr
->type
== nir_instr_type_jump
) {
1356 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
1357 handle_remove_jump(instr
->block
, jump_instr
->type
);
1364 nir_index_local_regs(nir_function_impl
*impl
)
1367 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
1368 reg
->index
= index
++;
1370 impl
->reg_alloc
= index
;
1374 nir_index_global_regs(nir_shader
*shader
)
1377 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
1378 reg
->index
= index
++;
1380 shader
->reg_alloc
= index
;
1384 visit_alu_dest(nir_alu_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1386 return cb(&instr
->dest
.dest
, state
);
1390 visit_intrinsic_dest(nir_intrinsic_instr
*instr
, nir_foreach_dest_cb cb
,
1393 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
)
1394 return cb(&instr
->dest
, state
);
1400 visit_texture_dest(nir_tex_instr
*instr
, nir_foreach_dest_cb cb
,
1403 return cb(&instr
->dest
, state
);
1407 visit_phi_dest(nir_phi_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1409 return cb(&instr
->dest
, state
);
1413 visit_parallel_copy_dest(nir_parallel_copy_instr
*instr
,
1414 nir_foreach_dest_cb cb
, void *state
)
1416 foreach_list_typed(nir_parallel_copy_copy
, copy
, node
, &instr
->copies
) {
1417 if (!cb(©
->dest
, state
))
1425 nir_foreach_dest(nir_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1427 switch (instr
->type
) {
1428 case nir_instr_type_alu
:
1429 return visit_alu_dest(nir_instr_as_alu(instr
), cb
, state
);
1430 case nir_instr_type_intrinsic
:
1431 return visit_intrinsic_dest(nir_instr_as_intrinsic(instr
), cb
, state
);
1432 case nir_instr_type_tex
:
1433 return visit_texture_dest(nir_instr_as_tex(instr
), cb
, state
);
1434 case nir_instr_type_phi
:
1435 return visit_phi_dest(nir_instr_as_phi(instr
), cb
, state
);
1436 case nir_instr_type_parallel_copy
:
1437 return visit_parallel_copy_dest(nir_instr_as_parallel_copy(instr
),
1440 case nir_instr_type_load_const
:
1441 case nir_instr_type_ssa_undef
:
1442 case nir_instr_type_call
:
1443 case nir_instr_type_jump
:
1447 unreachable("Invalid instruction type");
1454 struct foreach_ssa_def_state
{
1455 nir_foreach_ssa_def_cb cb
;
1460 nir_ssa_def_visitor(nir_dest
*dest
, void *void_state
)
1462 struct foreach_ssa_def_state
*state
= void_state
;
1465 return state
->cb(&dest
->ssa
, state
->client_state
);
1471 nir_foreach_ssa_def(nir_instr
*instr
, nir_foreach_ssa_def_cb cb
, void *state
)
1473 switch (instr
->type
) {
1474 case nir_instr_type_alu
:
1475 case nir_instr_type_tex
:
1476 case nir_instr_type_intrinsic
:
1477 case nir_instr_type_phi
:
1478 case nir_instr_type_parallel_copy
: {
1479 struct foreach_ssa_def_state foreach_state
= {cb
, state
};
1480 return nir_foreach_dest(instr
, nir_ssa_def_visitor
, &foreach_state
);
1483 case nir_instr_type_load_const
:
1484 return cb(&nir_instr_as_load_const(instr
)->def
, state
);
1485 case nir_instr_type_ssa_undef
:
1486 return cb(&nir_instr_as_ssa_undef(instr
)->def
, state
);
1487 case nir_instr_type_call
:
1488 case nir_instr_type_jump
:
1491 unreachable("Invalid instruction type");
1496 visit_src(nir_src
*src
, nir_foreach_src_cb cb
, void *state
)
1498 if (!cb(src
, state
))
1500 if (!src
->is_ssa
&& src
->reg
.indirect
)
1501 return cb(src
->reg
.indirect
, state
);
1506 visit_deref_array_src(nir_deref_array
*deref
, nir_foreach_src_cb cb
,
1509 if (deref
->deref_array_type
== nir_deref_array_type_indirect
)
1510 return visit_src(&deref
->indirect
, cb
, state
);
1515 visit_deref_src(nir_deref_var
*deref
, nir_foreach_src_cb cb
, void *state
)
1517 nir_deref
*cur
= &deref
->deref
;
1518 while (cur
!= NULL
) {
1519 if (cur
->deref_type
== nir_deref_type_array
)
1520 if (!visit_deref_array_src(nir_deref_as_array(cur
), cb
, state
))
1530 visit_alu_src(nir_alu_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1532 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++)
1533 if (!visit_src(&instr
->src
[i
].src
, cb
, state
))
1540 visit_tex_src(nir_tex_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1542 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++)
1543 if (!visit_src(&instr
->src
[i
], cb
, state
))
1546 if (instr
->sampler
!= NULL
)
1547 if (!visit_deref_src(instr
->sampler
, cb
, state
))
1554 visit_intrinsic_src(nir_intrinsic_instr
*instr
, nir_foreach_src_cb cb
,
1557 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
1558 for (unsigned i
= 0; i
< num_srcs
; i
++)
1559 if (!visit_src(&instr
->src
[i
], cb
, state
))
1563 nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
1564 for (unsigned i
= 0; i
< num_vars
; i
++)
1565 if (!visit_deref_src(instr
->variables
[i
], cb
, state
))
1572 visit_call_src(nir_call_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1578 visit_load_const_src(nir_load_const_instr
*instr
, nir_foreach_src_cb cb
,
1585 visit_phi_src(nir_phi_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1587 foreach_list_typed(nir_phi_src
, src
, node
, &instr
->srcs
) {
1588 if (!visit_src(&src
->src
, cb
, state
))
1596 visit_parallel_copy_src(nir_parallel_copy_instr
*instr
,
1597 nir_foreach_src_cb cb
, void *state
)
1599 foreach_list_typed(nir_parallel_copy_copy
, copy
, node
, &instr
->copies
) {
1600 if (!visit_src(©
->src
, cb
, state
))
1609 nir_foreach_src_cb cb
;
1610 } visit_dest_indirect_state
;
1613 visit_dest_indirect(nir_dest
*dest
, void *_state
)
1615 visit_dest_indirect_state
*state
= (visit_dest_indirect_state
*) _state
;
1617 if (!dest
->is_ssa
&& dest
->reg
.indirect
)
1618 return state
->cb(dest
->reg
.indirect
, state
->state
);
1624 nir_foreach_src(nir_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1626 switch (instr
->type
) {
1627 case nir_instr_type_alu
:
1628 if (!visit_alu_src(nir_instr_as_alu(instr
), cb
, state
))
1631 case nir_instr_type_intrinsic
:
1632 if (!visit_intrinsic_src(nir_instr_as_intrinsic(instr
), cb
, state
))
1635 case nir_instr_type_tex
:
1636 if (!visit_tex_src(nir_instr_as_tex(instr
), cb
, state
))
1639 case nir_instr_type_call
:
1640 if (!visit_call_src(nir_instr_as_call(instr
), cb
, state
))
1643 case nir_instr_type_load_const
:
1644 if (!visit_load_const_src(nir_instr_as_load_const(instr
), cb
, state
))
1647 case nir_instr_type_phi
:
1648 if (!visit_phi_src(nir_instr_as_phi(instr
), cb
, state
))
1651 case nir_instr_type_parallel_copy
:
1652 if (!visit_parallel_copy_src(nir_instr_as_parallel_copy(instr
),
1656 case nir_instr_type_jump
:
1657 case nir_instr_type_ssa_undef
:
1661 unreachable("Invalid instruction type");
1665 visit_dest_indirect_state dest_state
;
1666 dest_state
.state
= state
;
1668 return nir_foreach_dest(instr
, visit_dest_indirect
, &dest_state
);
1672 nir_src_as_const_value(nir_src src
)
1677 if (src
.ssa
->parent_instr
->type
!= nir_instr_type_load_const
)
1680 nir_load_const_instr
*load
= nir_instr_as_load_const(src
.ssa
->parent_instr
);
1682 return &load
->value
;
1686 nir_srcs_equal(nir_src src1
, nir_src src2
)
1690 return src1
.ssa
== src2
.ssa
;
1698 if ((src1
.reg
.indirect
== NULL
) != (src2
.reg
.indirect
== NULL
))
1701 if (src1
.reg
.indirect
) {
1702 if (!nir_srcs_equal(*src1
.reg
.indirect
, *src2
.reg
.indirect
))
1706 return src1
.reg
.reg
== src2
.reg
.reg
&&
1707 src1
.reg
.base_offset
== src2
.reg
.base_offset
;
1713 src_does_not_use_def(nir_src
*src
, void *void_def
)
1715 nir_ssa_def
*def
= void_def
;
1718 return src
->ssa
!= def
;
1725 src_does_not_use_reg(nir_src
*src
, void *void_reg
)
1727 nir_register
*reg
= void_reg
;
1732 return src
->reg
.reg
!= reg
;
1737 nir_instr_rewrite_src(nir_instr
*instr
, nir_src
*src
, nir_src new_src
)
1740 nir_ssa_def
*old_ssa
= src
->ssa
;
1742 if (old_ssa
&& nir_foreach_src(instr
, src_does_not_use_def
, old_ssa
)) {
1743 struct set_entry
*entry
= _mesa_set_search(old_ssa
->uses
,
1744 _mesa_hash_pointer(instr
),
1747 _mesa_set_remove(old_ssa
->uses
, entry
);
1750 if (src
->reg
.indirect
)
1751 nir_instr_rewrite_src(instr
, src
->reg
.indirect
, new_src
);
1753 nir_register
*old_reg
= src
->reg
.reg
;
1755 if (old_reg
&& nir_foreach_src(instr
, src_does_not_use_reg
, old_reg
)) {
1756 struct set_entry
*entry
= _mesa_set_search(old_reg
->uses
,
1757 _mesa_hash_pointer(instr
),
1760 _mesa_set_remove(old_reg
->uses
, entry
);
1764 if (new_src
.is_ssa
) {
1766 _mesa_set_add(new_src
.ssa
->uses
, _mesa_hash_pointer(instr
), instr
);
1768 if (new_src
.reg
.reg
)
1769 _mesa_set_add(new_src
.reg
.reg
->uses
, _mesa_hash_pointer(instr
), instr
);
1774 nir_ssa_def_init(nir_instr
*instr
, nir_ssa_def
*def
,
1775 unsigned num_components
, const char *name
)
1777 void *mem_ctx
= ralloc_parent(instr
);
1780 def
->parent_instr
= instr
;
1781 def
->uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
1782 def
->if_uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
1783 def
->num_components
= num_components
;
1786 nir_function_impl
*impl
=
1787 nir_cf_node_get_function(&instr
->block
->cf_node
);
1789 def
->index
= impl
->ssa_alloc
++;
1791 def
->index
= UINT_MAX
;
1795 struct ssa_def_rewrite_state
{
1802 ssa_def_rewrite_uses_src(nir_src
*src
, void *void_state
)
1804 struct ssa_def_rewrite_state
*state
= void_state
;
1806 if (src
->is_ssa
&& src
->ssa
== state
->old
)
1807 *src
= nir_src_copy(state
->new_src
, state
->mem_ctx
);
1813 nir_ssa_def_rewrite_uses(nir_ssa_def
*def
, nir_src new_src
, void *mem_ctx
)
1815 struct ssa_def_rewrite_state state
;
1816 state
.mem_ctx
= mem_ctx
;
1818 state
.new_src
= new_src
;
1820 assert(!new_src
.is_ssa
|| def
!= new_src
.ssa
);
1822 struct set
*new_uses
, *new_if_uses
;
1823 if (new_src
.is_ssa
) {
1824 new_uses
= new_src
.ssa
->uses
;
1825 new_if_uses
= new_src
.ssa
->if_uses
;
1827 new_uses
= new_src
.reg
.reg
->uses
;
1828 new_if_uses
= new_src
.reg
.reg
->if_uses
;
1831 struct set_entry
*entry
;
1832 set_foreach(def
->uses
, entry
) {
1833 nir_instr
*instr
= (nir_instr
*)entry
->key
;
1835 _mesa_set_remove(def
->uses
, entry
);
1836 nir_foreach_src(instr
, ssa_def_rewrite_uses_src
, &state
);
1837 _mesa_set_add(new_uses
, _mesa_hash_pointer(instr
), instr
);
1840 set_foreach(def
->if_uses
, entry
) {
1841 nir_if
*if_use
= (nir_if
*)entry
->key
;
1843 _mesa_set_remove(def
->if_uses
, entry
);
1844 if_use
->condition
= nir_src_copy(new_src
, mem_ctx
);
1845 _mesa_set_add(new_if_uses
, _mesa_hash_pointer(if_use
), if_use
);
1850 static bool foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1851 bool reverse
, void *state
);
1854 foreach_if(nir_if
*if_stmt
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1857 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
,
1858 &if_stmt
->else_list
) {
1859 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1863 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
,
1864 &if_stmt
->then_list
) {
1865 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1869 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->then_list
) {
1870 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1874 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->else_list
) {
1875 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1884 foreach_loop(nir_loop
*loop
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1887 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
, &loop
->body
) {
1888 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1892 foreach_list_typed_safe(nir_cf_node
, node
, node
, &loop
->body
) {
1893 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1902 foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1903 bool reverse
, void *state
)
1905 switch (node
->type
) {
1906 case nir_cf_node_block
:
1907 return cb(nir_cf_node_as_block(node
), state
);
1908 case nir_cf_node_if
:
1909 return foreach_if(nir_cf_node_as_if(node
), cb
, reverse
, state
);
1910 case nir_cf_node_loop
:
1911 return foreach_loop(nir_cf_node_as_loop(node
), cb
, reverse
, state
);
1915 unreachable("Invalid CFG node type");
1923 nir_foreach_block(nir_function_impl
*impl
, nir_foreach_block_cb cb
, void *state
)
1925 foreach_list_typed_safe(nir_cf_node
, node
, node
, &impl
->body
) {
1926 if (!foreach_cf_node(node
, cb
, false, state
))
1930 return cb(impl
->end_block
, state
);
1934 nir_foreach_block_reverse(nir_function_impl
*impl
, nir_foreach_block_cb cb
,
1937 if (!cb(impl
->end_block
, state
))
1940 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
, &impl
->body
) {
1941 if (!foreach_cf_node(node
, cb
, true, state
))
1949 nir_block_get_following_if(nir_block
*block
)
1951 if (exec_node_is_tail_sentinel(&block
->cf_node
.node
))
1954 if (nir_cf_node_is_last(&block
->cf_node
))
1957 nir_cf_node
*next_node
= nir_cf_node_next(&block
->cf_node
);
1959 if (next_node
->type
!= nir_cf_node_if
)
1962 return nir_cf_node_as_if(next_node
);
1966 index_block(nir_block
*block
, void *state
)
1968 unsigned *index
= (unsigned *) state
;
1969 block
->index
= (*index
)++;
1974 nir_index_blocks(nir_function_impl
*impl
)
1978 if (impl
->valid_metadata
& nir_metadata_block_index
)
1981 nir_foreach_block(impl
, index_block
, &index
);
1983 impl
->num_blocks
= index
;
1987 index_ssa_def(nir_ssa_def
*def
, unsigned *index
)
1989 def
->index
= (*index
)++;
1993 index_ssa_def_cb(nir_dest
*dest
, void *state
)
1995 unsigned *index
= (unsigned *) state
;
1997 index_ssa_def(&dest
->ssa
, index
);
2002 index_ssa_undef(nir_ssa_undef_instr
*instr
, unsigned *index
)
2004 index_ssa_def(&instr
->def
, index
);
2008 index_ssa_block(nir_block
*block
, void *state
)
2010 unsigned *index
= (unsigned *) state
;
2012 nir_foreach_instr(block
, instr
) {
2013 if (instr
->type
== nir_instr_type_ssa_undef
)
2014 index_ssa_undef(nir_instr_as_ssa_undef(instr
), index
);
2016 nir_foreach_dest(instr
, index_ssa_def_cb
, state
);
2023 nir_index_ssa_defs(nir_function_impl
*impl
)
2026 nir_foreach_block(impl
, index_ssa_block
, &index
);
2027 impl
->ssa_alloc
= index
;