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
)
399 nir_load_const_instr
*instr
= ralloc(mem_ctx
, nir_load_const_instr
);
400 instr_init(&instr
->instr
, nir_instr_type_load_const
);
402 dest_init(&instr
->dest
);
403 instr
->num_components
= 0;
404 instr
->array_elems
= 0;
409 nir_intrinsic_instr
*
410 nir_intrinsic_instr_create(void *mem_ctx
, nir_intrinsic_op op
)
412 unsigned num_srcs
= nir_intrinsic_infos
[op
].num_srcs
;
413 nir_intrinsic_instr
*instr
=
415 sizeof(nir_intrinsic_instr
) + num_srcs
* sizeof(nir_src
));
417 instr_init(&instr
->instr
, nir_instr_type_intrinsic
);
418 instr
->intrinsic
= op
;
420 if (nir_intrinsic_infos
[op
].has_dest
)
421 dest_init(&instr
->dest
);
423 for (unsigned i
= 0; i
< num_srcs
; i
++)
424 src_init(&instr
->src
[i
]);
430 nir_call_instr_create(void *mem_ctx
, nir_function_overload
*callee
)
432 nir_call_instr
*instr
= ralloc(mem_ctx
, nir_call_instr
);
433 instr_init(&instr
->instr
, nir_instr_type_call
);
435 instr
->callee
= callee
;
436 instr
->num_params
= callee
->num_params
;
437 instr
->params
= ralloc_array(mem_ctx
, nir_deref_var
*, instr
->num_params
);
438 instr
->return_deref
= NULL
;
444 nir_tex_instr_create(void *mem_ctx
, unsigned num_srcs
)
446 nir_tex_instr
*instr
= ralloc(mem_ctx
, nir_tex_instr
);
447 instr_init(&instr
->instr
, nir_instr_type_tex
);
449 dest_init(&instr
->dest
);
451 instr
->num_srcs
= num_srcs
;
452 for (unsigned i
= 0; i
< 4; i
++)
453 src_init(&instr
->src
[i
]);
455 instr
->sampler_index
= 0;
456 instr
->sampler_array_size
= 0;
457 instr
->sampler
= NULL
;
463 nir_phi_instr_create(void *mem_ctx
)
465 nir_phi_instr
*instr
= ralloc(mem_ctx
, nir_phi_instr
);
466 instr_init(&instr
->instr
, nir_instr_type_phi
);
468 dest_init(&instr
->dest
);
469 exec_list_make_empty(&instr
->srcs
);
473 nir_parallel_copy_instr
*
474 nir_parallel_copy_instr_create(void *mem_ctx
)
476 nir_parallel_copy_instr
*instr
= ralloc(mem_ctx
, nir_parallel_copy_instr
);
477 instr_init(&instr
->instr
, nir_instr_type_parallel_copy
);
479 instr
->at_end
= false;
480 exec_list_make_empty(&instr
->copies
);
485 nir_ssa_undef_instr
*
486 nir_ssa_undef_instr_create(void *mem_ctx
)
488 nir_ssa_undef_instr
*instr
= ralloc(mem_ctx
, nir_ssa_undef_instr
);
489 instr_init(&instr
->instr
, nir_instr_type_ssa_undef
);
491 instr
->def
.name
= NULL
;
492 instr
->def
.parent_instr
= &instr
->instr
;
498 nir_deref_var_create(void *mem_ctx
, nir_variable
*var
)
500 nir_deref_var
*deref
= ralloc(mem_ctx
, nir_deref_var
);
501 deref
->deref
.deref_type
= nir_deref_type_var
;
502 deref
->deref
.child
= NULL
;
503 deref
->deref
.type
= var
->type
;
509 nir_deref_array_create(void *mem_ctx
)
511 nir_deref_array
*deref
= ralloc(mem_ctx
, nir_deref_array
);
512 deref
->deref
.deref_type
= nir_deref_type_array
;
513 deref
->deref
.child
= NULL
;
514 deref
->deref_array_type
= nir_deref_array_type_direct
;
515 src_init(&deref
->indirect
);
516 deref
->base_offset
= 0;
521 nir_deref_struct_create(void *mem_ctx
, unsigned field_index
)
523 nir_deref_struct
*deref
= ralloc(mem_ctx
, nir_deref_struct
);
524 deref
->deref
.deref_type
= nir_deref_type_struct
;
525 deref
->deref
.child
= NULL
;
526 deref
->index
= field_index
;
530 static nir_deref_var
*
531 copy_deref_var(void *mem_ctx
, nir_deref_var
*deref
)
533 nir_deref_var
*ret
= nir_deref_var_create(mem_ctx
, deref
->var
);
534 ret
->deref
.type
= deref
->deref
.type
;
535 if (deref
->deref
.child
)
536 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
540 static nir_deref_array
*
541 copy_deref_array(void *mem_ctx
, nir_deref_array
*deref
)
543 nir_deref_array
*ret
= nir_deref_array_create(mem_ctx
);
544 ret
->base_offset
= deref
->base_offset
;
545 ret
->deref_array_type
= deref
->deref_array_type
;
546 if (deref
->deref_array_type
== nir_deref_array_type_indirect
) {
547 ret
->indirect
= nir_src_copy(deref
->indirect
, mem_ctx
);
549 ret
->deref
.type
= deref
->deref
.type
;
550 if (deref
->deref
.child
)
551 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
555 static nir_deref_struct
*
556 copy_deref_struct(void *mem_ctx
, nir_deref_struct
*deref
)
558 nir_deref_struct
*ret
= nir_deref_struct_create(mem_ctx
, deref
->index
);
559 ret
->deref
.type
= deref
->deref
.type
;
560 if (deref
->deref
.child
)
561 ret
->deref
.child
= nir_copy_deref(mem_ctx
, deref
->deref
.child
);
566 nir_copy_deref(void *mem_ctx
, nir_deref
*deref
)
568 switch (deref
->deref_type
) {
569 case nir_deref_type_var
:
570 return ©_deref_var(mem_ctx
, nir_deref_as_var(deref
))->deref
;
571 case nir_deref_type_array
:
572 return ©_deref_array(mem_ctx
, nir_deref_as_array(deref
))->deref
;
573 case nir_deref_type_struct
:
574 return ©_deref_struct(mem_ctx
, nir_deref_as_struct(deref
))->deref
;
576 unreachable("Invalid dereference type");
584 * \name Control flow modification
586 * These functions modify the control flow tree while keeping the control flow
587 * graph up-to-date. The invariants respected are:
588 * 1. Each then statement, else statement, or loop body must have at least one
590 * 2. Each if-statement and loop must have one basic block before it and one
592 * 3. Two basic blocks cannot be directly next to each other.
593 * 4. If a basic block has a jump instruction, there must be only one and it
594 * must be at the end of the block.
595 * 5. The CFG must always be connected - this means that we must insert a fake
596 * CFG edge for loops with no break statement.
598 * The purpose of the second one is so that we have places to insert code during
599 * GCM, as well as eliminating the possibility of critical edges.
604 link_non_block_to_block(nir_cf_node
*node
, nir_block
*block
)
606 if (node
->type
== nir_cf_node_if
) {
608 * We're trying to link an if to a block after it; this just means linking
609 * the last block of the then and else branches.
612 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
614 nir_cf_node
*last_then
= nir_if_last_then_node(if_stmt
);
615 assert(last_then
->type
== nir_cf_node_block
);
616 nir_block
*last_then_block
= nir_cf_node_as_block(last_then
);
618 nir_cf_node
*last_else
= nir_if_last_else_node(if_stmt
);
619 assert(last_else
->type
== nir_cf_node_block
);
620 nir_block
*last_else_block
= nir_cf_node_as_block(last_else
);
622 if (exec_list_is_empty(&last_then_block
->instr_list
) ||
623 nir_block_last_instr(last_then_block
)->type
!= nir_instr_type_jump
) {
624 unlink_block_successors(last_then_block
);
625 link_blocks(last_then_block
, block
, NULL
);
628 if (exec_list_is_empty(&last_else_block
->instr_list
) ||
629 nir_block_last_instr(last_else_block
)->type
!= nir_instr_type_jump
) {
630 unlink_block_successors(last_else_block
);
631 link_blocks(last_else_block
, block
, NULL
);
634 assert(node
->type
== nir_cf_node_loop
);
637 * We can only get to this codepath if we're inserting a new loop, or
638 * at least a loop with no break statements; we can't insert break
639 * statements into a loop when we haven't inserted it into the CFG
640 * because we wouldn't know which block comes after the loop
641 * and therefore, which block should be the successor of the block with
642 * the break). Therefore, we need to insert a fake edge (see invariant
646 nir_loop
*loop
= nir_cf_node_as_loop(node
);
648 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
649 assert(last
->type
== nir_cf_node_block
);
650 nir_block
*last_block
= nir_cf_node_as_block(last
);
652 last_block
->successors
[1] = block
;
653 block_add_pred(block
, last_block
);
658 link_block_to_non_block(nir_block
*block
, nir_cf_node
*node
)
660 if (node
->type
== nir_cf_node_if
) {
662 * We're trying to link a block to an if after it; this just means linking
663 * the block to the first block of the then and else branches.
666 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
668 nir_cf_node
*first_then
= nir_if_first_then_node(if_stmt
);
669 assert(first_then
->type
== nir_cf_node_block
);
670 nir_block
*first_then_block
= nir_cf_node_as_block(first_then
);
672 nir_cf_node
*first_else
= nir_if_first_else_node(if_stmt
);
673 assert(first_else
->type
== nir_cf_node_block
);
674 nir_block
*first_else_block
= nir_cf_node_as_block(first_else
);
676 unlink_block_successors(block
);
677 link_blocks(block
, first_then_block
, first_else_block
);
680 * For similar reasons as the corresponding case in
681 * link_non_block_to_block(), don't worry about if the loop header has
682 * any predecessors that need to be unlinked.
685 assert(node
->type
== nir_cf_node_loop
);
687 nir_loop
*loop
= nir_cf_node_as_loop(node
);
689 nir_cf_node
*loop_header
= nir_loop_first_cf_node(loop
);
690 assert(loop_header
->type
== nir_cf_node_block
);
691 nir_block
*loop_header_block
= nir_cf_node_as_block(loop_header
);
693 unlink_block_successors(block
);
694 link_blocks(block
, loop_header_block
, NULL
);
700 * Takes a basic block and inserts a new empty basic block before it, making its
701 * predecessors point to the new block. This essentially splits the block into
702 * an empty header and a body so that another non-block CF node can be inserted
703 * between the two. Note that this does *not* link the two basic blocks, so
704 * some kind of cleanup *must* be performed after this call.
708 split_block_beginning(nir_block
*block
)
710 nir_block
*new_block
= nir_block_create(ralloc_parent(block
));
711 new_block
->cf_node
.parent
= block
->cf_node
.parent
;
712 exec_node_insert_node_before(&block
->cf_node
.node
, &new_block
->cf_node
.node
);
714 struct set_entry
*entry
;
715 set_foreach(block
->predecessors
, entry
) {
716 nir_block
*pred
= (nir_block
*) entry
->key
;
718 unlink_blocks(pred
, block
);
719 link_blocks(pred
, new_block
, NULL
);
726 rewrite_phi_preds(nir_block
*block
, nir_block
*old_pred
, nir_block
*new_pred
)
728 nir_foreach_instr_safe(block
, instr
) {
729 if (instr
->type
!= nir_instr_type_phi
)
732 nir_phi_instr
*phi
= nir_instr_as_phi(instr
);
733 foreach_list_typed_safe(nir_phi_src
, src
, node
, &phi
->srcs
) {
734 if (src
->pred
== old_pred
) {
735 src
->pred
= new_pred
;
743 * Moves the successors of source to the successors of dest, leaving both
744 * successors of source NULL.
748 move_successors(nir_block
*source
, nir_block
*dest
)
750 nir_block
*succ1
= source
->successors
[0];
751 nir_block
*succ2
= source
->successors
[1];
754 unlink_blocks(source
, succ1
);
755 rewrite_phi_preds(succ1
, source
, dest
);
759 unlink_blocks(source
, succ2
);
760 rewrite_phi_preds(succ2
, source
, dest
);
763 unlink_block_successors(dest
);
764 link_blocks(dest
, succ1
, succ2
);
768 split_block_end(nir_block
*block
)
770 nir_block
*new_block
= nir_block_create(ralloc_parent(block
));
771 new_block
->cf_node
.parent
= block
->cf_node
.parent
;
772 exec_node_insert_after(&block
->cf_node
.node
, &new_block
->cf_node
.node
);
774 move_successors(block
, new_block
);
780 * Inserts a non-basic block between two basic blocks and links them together.
784 insert_non_block(nir_block
*before
, nir_cf_node
*node
, nir_block
*after
)
786 node
->parent
= before
->cf_node
.parent
;
787 exec_node_insert_after(&before
->cf_node
.node
, &node
->node
);
788 link_block_to_non_block(before
, node
);
789 link_non_block_to_block(node
, after
);
793 * Inserts a non-basic block before a basic block.
797 insert_non_block_before_block(nir_cf_node
*node
, nir_block
*block
)
799 /* split off the beginning of block into new_block */
800 nir_block
*new_block
= split_block_beginning(block
);
802 /* insert our node in between new_block and block */
803 insert_non_block(new_block
, node
, block
);
807 insert_non_block_after_block(nir_block
*block
, nir_cf_node
*node
)
809 /* split off the end of block into new_block */
810 nir_block
*new_block
= split_block_end(block
);
812 /* insert our node in between block and new_block */
813 insert_non_block(block
, node
, new_block
);
816 /* walk up the control flow tree to find the innermost enclosed loop */
818 nearest_loop(nir_cf_node
*node
)
820 while (node
->type
!= nir_cf_node_loop
) {
824 return nir_cf_node_as_loop(node
);
828 nir_cf_node_get_function(nir_cf_node
*node
)
830 while (node
->type
!= nir_cf_node_function
) {
834 return nir_cf_node_as_function(node
);
838 * update the CFG after a jump instruction has been added to the end of a block
842 handle_jump(nir_block
*block
)
844 nir_instr
*instr
= nir_block_last_instr(block
);
845 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
847 unlink_block_successors(block
);
849 nir_function_impl
*impl
= nir_cf_node_get_function(&block
->cf_node
);
850 nir_metadata_preserve(impl
, nir_metadata_none
);
852 if (jump_instr
->type
== nir_jump_break
||
853 jump_instr
->type
== nir_jump_continue
) {
854 nir_loop
*loop
= nearest_loop(&block
->cf_node
);
856 if (jump_instr
->type
== nir_jump_continue
) {
857 nir_cf_node
*first_node
= nir_loop_first_cf_node(loop
);
858 assert(first_node
->type
== nir_cf_node_block
);
859 nir_block
*first_block
= nir_cf_node_as_block(first_node
);
860 link_blocks(block
, first_block
, NULL
);
862 nir_cf_node
*after
= nir_cf_node_next(&loop
->cf_node
);
863 assert(after
->type
== nir_cf_node_block
);
864 nir_block
*after_block
= nir_cf_node_as_block(after
);
865 link_blocks(block
, after_block
, NULL
);
867 /* If we inserted a fake link, remove it */
868 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
869 assert(last
->type
== nir_cf_node_block
);
870 nir_block
*last_block
= nir_cf_node_as_block(last
);
871 if (last_block
->successors
[1] != NULL
)
872 unlink_blocks(last_block
, after_block
);
875 assert(jump_instr
->type
== nir_jump_return
);
876 link_blocks(block
, impl
->end_block
, NULL
);
881 handle_remove_jump(nir_block
*block
, nir_jump_type type
)
883 unlink_block_successors(block
);
885 if (exec_node_is_tail_sentinel(block
->cf_node
.node
.next
)) {
886 nir_cf_node
*parent
= block
->cf_node
.parent
;
887 if (parent
->type
== nir_cf_node_if
) {
888 nir_cf_node
*next
= nir_cf_node_next(parent
);
889 assert(next
->type
== nir_cf_node_block
);
890 nir_block
*next_block
= nir_cf_node_as_block(next
);
892 link_blocks(block
, next_block
, NULL
);
894 assert(parent
->type
== nir_cf_node_loop
);
895 nir_loop
*loop
= nir_cf_node_as_loop(parent
);
897 nir_cf_node
*head
= nir_loop_first_cf_node(loop
);
898 assert(head
->type
== nir_cf_node_block
);
899 nir_block
*head_block
= nir_cf_node_as_block(head
);
901 link_blocks(block
, head_block
, NULL
);
904 nir_cf_node
*next
= nir_cf_node_next(&block
->cf_node
);
905 if (next
->type
== nir_cf_node_if
) {
906 nir_if
*next_if
= nir_cf_node_as_if(next
);
908 nir_cf_node
*first_then
= nir_if_first_then_node(next_if
);
909 assert(first_then
->type
== nir_cf_node_block
);
910 nir_block
*first_then_block
= nir_cf_node_as_block(first_then
);
912 nir_cf_node
*first_else
= nir_if_first_else_node(next_if
);
913 assert(first_else
->type
== nir_cf_node_block
);
914 nir_block
*first_else_block
= nir_cf_node_as_block(first_else
);
916 link_blocks(block
, first_then_block
, first_else_block
);
918 assert(next
->type
== nir_cf_node_loop
);
919 nir_loop
*next_loop
= nir_cf_node_as_loop(next
);
921 nir_cf_node
*first
= nir_loop_first_cf_node(next_loop
);
922 assert(first
->type
== nir_cf_node_block
);
923 nir_block
*first_block
= nir_cf_node_as_block(first
);
925 link_blocks(block
, first_block
, NULL
);
929 if (type
== nir_jump_break
) {
930 nir_loop
*loop
= nearest_loop(&block
->cf_node
);
932 nir_cf_node
*next
= nir_cf_node_next(&loop
->cf_node
);
933 assert(next
->type
== nir_cf_node_block
);
934 nir_block
*next_block
= nir_cf_node_as_block(next
);
936 if (next_block
->predecessors
->entries
== 0) {
937 /* insert fake link */
938 nir_cf_node
*last
= nir_loop_last_cf_node(loop
);
939 assert(last
->type
== nir_cf_node_block
);
940 nir_block
*last_block
= nir_cf_node_as_block(last
);
942 last_block
->successors
[1] = next_block
;
943 block_add_pred(next_block
, last_block
);
947 nir_function_impl
*impl
= nir_cf_node_get_function(&block
->cf_node
);
948 nir_metadata_preserve(impl
, nir_metadata_none
);
952 * Inserts a basic block before another by merging the instructions.
954 * @param block the target of the insertion
955 * @param before the block to be inserted - must not have been inserted before
956 * @param has_jump whether \before has a jump instruction at the end
960 insert_block_before_block(nir_block
*block
, nir_block
*before
, bool has_jump
)
962 assert(!has_jump
|| exec_list_is_empty(&block
->instr_list
));
964 foreach_list_typed(nir_instr
, instr
, node
, &before
->instr_list
) {
965 instr
->block
= block
;
968 exec_list_prepend(&block
->instr_list
, &before
->instr_list
);
975 * Inserts a basic block after another by merging the instructions.
977 * @param block the target of the insertion
978 * @param after the block to be inserted - must not have been inserted before
979 * @param has_jump whether \after has a jump instruction at the end
983 insert_block_after_block(nir_block
*block
, nir_block
*after
, bool has_jump
)
985 foreach_list_typed(nir_instr
, instr
, node
, &after
->instr_list
) {
986 instr
->block
= block
;
989 exec_list_append(&block
->instr_list
, &after
->instr_list
);
996 update_if_uses(nir_cf_node
*node
)
998 if (node
->type
!= nir_cf_node_if
)
1001 nir_if
*if_stmt
= nir_cf_node_as_if(node
);
1003 struct set
*if_uses_set
= if_stmt
->condition
.is_ssa
?
1004 if_stmt
->condition
.ssa
->if_uses
:
1005 if_stmt
->condition
.reg
.reg
->uses
;
1007 _mesa_set_add(if_uses_set
, _mesa_hash_pointer(if_stmt
), if_stmt
);
1011 nir_cf_node_insert_after(nir_cf_node
*node
, nir_cf_node
*after
)
1013 update_if_uses(after
);
1015 if (after
->type
== nir_cf_node_block
) {
1017 * either node or the one after it must be a basic block, by invariant #2;
1018 * in either case, just merge the blocks together.
1020 nir_block
*after_block
= nir_cf_node_as_block(after
);
1022 bool has_jump
= !exec_list_is_empty(&after_block
->instr_list
) &&
1023 nir_block_last_instr(after_block
)->type
== nir_instr_type_jump
;
1025 if (node
->type
== nir_cf_node_block
) {
1026 insert_block_after_block(nir_cf_node_as_block(node
), after_block
,
1029 nir_cf_node
*next
= nir_cf_node_next(node
);
1030 assert(next
->type
== nir_cf_node_block
);
1031 nir_block
*next_block
= nir_cf_node_as_block(next
);
1033 insert_block_before_block(next_block
, after_block
, has_jump
);
1036 if (node
->type
== nir_cf_node_block
) {
1037 insert_non_block_after_block(nir_cf_node_as_block(node
), after
);
1040 * We have to insert a non-basic block after a non-basic block. Since
1041 * every non-basic block has a basic block after it, this is equivalent
1042 * to inserting a non-basic block before a basic block.
1045 nir_cf_node
*next
= nir_cf_node_next(node
);
1046 assert(next
->type
== nir_cf_node_block
);
1047 nir_block
*next_block
= nir_cf_node_as_block(next
);
1049 insert_non_block_before_block(after
, next_block
);
1053 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1054 nir_metadata_preserve(impl
, nir_metadata_none
);
1058 nir_cf_node_insert_before(nir_cf_node
*node
, nir_cf_node
*before
)
1060 update_if_uses(before
);
1062 if (before
->type
== nir_cf_node_block
) {
1063 nir_block
*before_block
= nir_cf_node_as_block(before
);
1065 bool has_jump
= !exec_list_is_empty(&before_block
->instr_list
) &&
1066 nir_block_last_instr(before_block
)->type
== nir_instr_type_jump
;
1068 if (node
->type
== nir_cf_node_block
) {
1069 insert_block_before_block(nir_cf_node_as_block(node
), before_block
,
1072 nir_cf_node
*prev
= nir_cf_node_prev(node
);
1073 assert(prev
->type
== nir_cf_node_block
);
1074 nir_block
*prev_block
= nir_cf_node_as_block(prev
);
1076 insert_block_after_block(prev_block
, before_block
, has_jump
);
1079 if (node
->type
== nir_cf_node_block
) {
1080 insert_non_block_before_block(before
, nir_cf_node_as_block(node
));
1083 * We have to insert a non-basic block before a non-basic block. This
1084 * is equivalent to inserting a non-basic block after a basic block.
1087 nir_cf_node
*prev_node
= nir_cf_node_prev(node
);
1088 assert(prev_node
->type
== nir_cf_node_block
);
1089 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
1091 insert_non_block_after_block(prev_block
, before
);
1095 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1096 nir_metadata_preserve(impl
, nir_metadata_none
);
1100 nir_cf_node_insert_begin(struct exec_list
*list
, nir_cf_node
*node
)
1102 nir_cf_node
*begin
= exec_node_data(nir_cf_node
, list
->head
, node
);
1103 nir_cf_node_insert_before(begin
, node
);
1107 nir_cf_node_insert_end(struct exec_list
*list
, nir_cf_node
*node
)
1109 nir_cf_node
*end
= exec_node_data(nir_cf_node
, list
->tail_pred
, node
);
1110 nir_cf_node_insert_after(end
, node
);
1114 * Stitch two basic blocks together into one. The aggregate must have the same
1115 * predecessors as the first and the same successors as the second.
1119 stitch_blocks(nir_block
*before
, nir_block
*after
)
1122 * We move after into before, so we have to deal with up to 2 successors vs.
1123 * possibly a large number of predecessors.
1125 * TODO: special case when before is empty and after isn't?
1128 move_successors(after
, before
);
1130 foreach_list_typed(nir_instr
, instr
, node
, &after
->instr_list
) {
1131 instr
->block
= before
;
1134 exec_list_append(&before
->instr_list
, &after
->instr_list
);
1135 exec_node_remove(&after
->cf_node
.node
);
1139 nir_cf_node_remove(nir_cf_node
*node
)
1141 nir_function_impl
*impl
= nir_cf_node_get_function(node
);
1142 nir_metadata_preserve(impl
, nir_metadata_none
);
1144 if (node
->type
== nir_cf_node_block
) {
1146 * Basic blocks can't really be removed by themselves, since they act as
1147 * padding between the non-basic blocks. So all we do here is empty the
1148 * block of instructions.
1150 * TODO: could we assert here?
1152 exec_list_make_empty(&nir_cf_node_as_block(node
)->instr_list
);
1154 nir_cf_node
*before
= nir_cf_node_prev(node
);
1155 assert(before
->type
== nir_cf_node_block
);
1156 nir_block
*before_block
= nir_cf_node_as_block(before
);
1158 nir_cf_node
*after
= nir_cf_node_next(node
);
1159 assert(after
->type
== nir_cf_node_block
);
1160 nir_block
*after_block
= nir_cf_node_as_block(after
);
1162 exec_node_remove(&node
->node
);
1163 stitch_blocks(before_block
, after_block
);
1168 add_use_cb(nir_src
*src
, void *state
)
1170 nir_instr
*instr
= (nir_instr
*) state
;
1172 struct set
*uses_set
= src
->is_ssa
? src
->ssa
->uses
: src
->reg
.reg
->uses
;
1174 _mesa_set_add(uses_set
, _mesa_hash_pointer(instr
), instr
);
1180 add_ssa_def(nir_instr
*instr
, nir_ssa_def
*def
)
1182 if (instr
->block
&& def
->index
== UINT_MAX
) {
1183 nir_function_impl
*impl
=
1184 nir_cf_node_get_function(&instr
->block
->cf_node
);
1186 def
->index
= impl
->ssa_alloc
++;
1191 add_def_cb(nir_dest
*dest
, void *state
)
1193 nir_instr
*instr
= (nir_instr
*) state
;
1196 add_ssa_def(instr
, &dest
->ssa
);
1198 _mesa_set_add(dest
->reg
.reg
->defs
, _mesa_hash_pointer(instr
), instr
);
1205 add_defs_uses(nir_instr
*instr
)
1207 if (instr
->type
== nir_instr_type_ssa_undef
) {
1208 add_ssa_def(instr
, &nir_instr_as_ssa_undef(instr
)->def
);
1210 nir_foreach_src(instr
, add_use_cb
, instr
);
1211 nir_foreach_dest(instr
, add_def_cb
, instr
);
1216 nir_instr_insert_before(nir_instr
*instr
, nir_instr
*before
)
1218 assert(before
->type
!= nir_instr_type_jump
);
1219 before
->block
= instr
->block
;
1220 add_defs_uses(before
);
1221 exec_node_insert_node_before(&instr
->node
, &before
->node
);
1225 nir_instr_insert_after(nir_instr
*instr
, nir_instr
*after
)
1227 if (after
->type
== nir_instr_type_jump
) {
1228 assert(instr
== nir_block_last_instr(instr
->block
));
1229 assert(instr
->type
!= nir_instr_type_jump
);
1232 after
->block
= instr
->block
;
1233 add_defs_uses(after
);
1234 exec_node_insert_after(&instr
->node
, &after
->node
);
1236 if (after
->type
== nir_instr_type_jump
)
1237 handle_jump(after
->block
);
1241 nir_instr_insert_before_block(nir_block
*block
, nir_instr
*before
)
1243 if (before
->type
== nir_instr_type_jump
)
1244 assert(exec_list_is_empty(&block
->instr_list
));
1246 before
->block
= block
;
1247 add_defs_uses(before
);
1248 exec_list_push_head(&block
->instr_list
, &before
->node
);
1250 if (before
->type
== nir_instr_type_jump
)
1255 nir_instr_insert_after_block(nir_block
*block
, nir_instr
*after
)
1257 if (after
->type
== nir_instr_type_jump
) {
1258 assert(exec_list_is_empty(&block
->instr_list
) ||
1259 nir_block_last_instr(block
)->type
!= nir_instr_type_jump
);
1262 after
->block
= block
;
1263 add_defs_uses(after
);
1264 exec_list_push_tail(&block
->instr_list
, &after
->node
);
1266 if (after
->type
== nir_instr_type_jump
)
1271 nir_instr_insert_before_cf(nir_cf_node
*node
, nir_instr
*before
)
1273 if (node
->type
== nir_cf_node_block
) {
1274 nir_instr_insert_before_block(nir_cf_node_as_block(node
), before
);
1276 nir_cf_node
*prev
= nir_cf_node_prev(node
);
1277 assert(prev
->type
== nir_cf_node_block
);
1278 nir_block
*prev_block
= nir_cf_node_as_block(prev
);
1280 nir_instr_insert_before_block(prev_block
, before
);
1285 nir_instr_insert_after_cf(nir_cf_node
*node
, nir_instr
*after
)
1287 if (node
->type
== nir_cf_node_block
) {
1288 nir_instr_insert_after_block(nir_cf_node_as_block(node
), after
);
1290 nir_cf_node
*next
= nir_cf_node_next(node
);
1291 assert(next
->type
== nir_cf_node_block
);
1292 nir_block
*next_block
= nir_cf_node_as_block(next
);
1294 nir_instr_insert_before_block(next_block
, after
);
1299 nir_instr_insert_before_cf_list(struct exec_list
*list
, nir_instr
*before
)
1301 nir_cf_node
*first_node
= exec_node_data(nir_cf_node
,
1302 exec_list_get_head(list
), node
);
1303 nir_instr_insert_before_cf(first_node
, before
);
1307 nir_instr_insert_after_cf_list(struct exec_list
*list
, nir_instr
*after
)
1309 nir_cf_node
*last_node
= exec_node_data(nir_cf_node
,
1310 exec_list_get_tail(list
), node
);
1311 nir_instr_insert_after_cf(last_node
, after
);
1315 remove_use_cb(nir_src
*src
, void *state
)
1317 nir_instr
*instr
= (nir_instr
*) state
;
1319 struct set
*uses_set
= src
->is_ssa
? src
->ssa
->uses
: src
->reg
.reg
->uses
;
1321 struct set_entry
*entry
= _mesa_set_search(uses_set
,
1322 _mesa_hash_pointer(instr
),
1325 _mesa_set_remove(uses_set
, entry
);
1331 remove_def_cb(nir_dest
*dest
, void *state
)
1333 nir_instr
*instr
= (nir_instr
*) state
;
1338 nir_register
*reg
= dest
->reg
.reg
;
1340 struct set_entry
*entry
= _mesa_set_search(reg
->defs
,
1341 _mesa_hash_pointer(instr
),
1344 _mesa_set_remove(reg
->defs
, entry
);
1350 remove_defs_uses(nir_instr
*instr
)
1352 nir_foreach_dest(instr
, remove_def_cb
, instr
);
1353 nir_foreach_src(instr
, remove_use_cb
, instr
);
1356 void nir_instr_remove(nir_instr
*instr
)
1358 remove_defs_uses(instr
);
1359 exec_node_remove(&instr
->node
);
1361 if (instr
->type
== nir_instr_type_jump
) {
1362 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
1363 handle_remove_jump(instr
->block
, jump_instr
->type
);
1370 nir_index_local_regs(nir_function_impl
*impl
)
1373 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
1374 reg
->index
= index
++;
1376 impl
->reg_alloc
= index
;
1380 nir_index_global_regs(nir_shader
*shader
)
1383 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
1384 reg
->index
= index
++;
1386 shader
->reg_alloc
= index
;
1390 visit_alu_dest(nir_alu_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1392 return cb(&instr
->dest
.dest
, state
);
1396 visit_intrinsic_dest(nir_intrinsic_instr
*instr
, nir_foreach_dest_cb cb
,
1399 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
)
1400 return cb(&instr
->dest
, state
);
1406 visit_texture_dest(nir_tex_instr
*instr
, nir_foreach_dest_cb cb
,
1409 return cb(&instr
->dest
, state
);
1413 visit_load_const_dest(nir_load_const_instr
*instr
, nir_foreach_dest_cb cb
,
1416 return cb(&instr
->dest
, state
);
1420 visit_phi_dest(nir_phi_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1422 return cb(&instr
->dest
, state
);
1426 visit_parallel_copy_dest(nir_parallel_copy_instr
*instr
,
1427 nir_foreach_dest_cb cb
, void *state
)
1429 foreach_list_typed(nir_parallel_copy_copy
, copy
, node
, &instr
->copies
) {
1430 if (!cb(©
->dest
, state
))
1438 nir_foreach_dest(nir_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
1440 switch (instr
->type
) {
1441 case nir_instr_type_alu
:
1442 return visit_alu_dest(nir_instr_as_alu(instr
), cb
, state
);
1443 case nir_instr_type_intrinsic
:
1444 return visit_intrinsic_dest(nir_instr_as_intrinsic(instr
), cb
, state
);
1445 case nir_instr_type_tex
:
1446 return visit_texture_dest(nir_instr_as_tex(instr
), cb
, state
);
1447 case nir_instr_type_load_const
:
1448 return visit_load_const_dest(nir_instr_as_load_const(instr
), cb
, state
);
1449 case nir_instr_type_phi
:
1450 return visit_phi_dest(nir_instr_as_phi(instr
), cb
, state
);
1451 case nir_instr_type_parallel_copy
:
1452 return visit_parallel_copy_dest(nir_instr_as_parallel_copy(instr
),
1455 case nir_instr_type_ssa_undef
:
1456 case nir_instr_type_call
:
1457 case nir_instr_type_jump
:
1461 unreachable("Invalid instruction type");
1468 struct foreach_ssa_def_state
{
1469 nir_foreach_ssa_def_cb cb
;
1474 nir_ssa_def_visitor(nir_dest
*dest
, void *void_state
)
1476 struct foreach_ssa_def_state
*state
= void_state
;
1479 return state
->cb(&dest
->ssa
, state
->client_state
);
1485 nir_foreach_ssa_def(nir_instr
*instr
, nir_foreach_ssa_def_cb cb
, void *state
)
1487 switch (instr
->type
) {
1488 case nir_instr_type_alu
:
1489 case nir_instr_type_tex
:
1490 case nir_instr_type_intrinsic
:
1491 case nir_instr_type_load_const
:
1492 case nir_instr_type_phi
:
1493 case nir_instr_type_parallel_copy
: {
1494 struct foreach_ssa_def_state foreach_state
= {cb
, state
};
1495 return nir_foreach_dest(instr
, nir_ssa_def_visitor
, &foreach_state
);
1498 case nir_instr_type_ssa_undef
:
1499 return cb(&nir_instr_as_ssa_undef(instr
)->def
, state
);
1500 case nir_instr_type_call
:
1501 case nir_instr_type_jump
:
1504 unreachable("Invalid instruction type");
1509 visit_src(nir_src
*src
, nir_foreach_src_cb cb
, void *state
)
1511 if (!cb(src
, state
))
1513 if (!src
->is_ssa
&& src
->reg
.indirect
)
1514 return cb(src
->reg
.indirect
, state
);
1519 visit_deref_array_src(nir_deref_array
*deref
, nir_foreach_src_cb cb
,
1522 if (deref
->deref_array_type
== nir_deref_array_type_indirect
)
1523 return visit_src(&deref
->indirect
, cb
, state
);
1528 visit_deref_src(nir_deref_var
*deref
, nir_foreach_src_cb cb
, void *state
)
1530 nir_deref
*cur
= &deref
->deref
;
1531 while (cur
!= NULL
) {
1532 if (cur
->deref_type
== nir_deref_type_array
)
1533 if (!visit_deref_array_src(nir_deref_as_array(cur
), cb
, state
))
1543 visit_alu_src(nir_alu_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1545 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++)
1546 if (!visit_src(&instr
->src
[i
].src
, cb
, state
))
1553 visit_tex_src(nir_tex_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1555 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++)
1556 if (!visit_src(&instr
->src
[i
], cb
, state
))
1559 if (instr
->sampler
!= NULL
)
1560 if (!visit_deref_src(instr
->sampler
, cb
, state
))
1567 visit_intrinsic_src(nir_intrinsic_instr
*instr
, nir_foreach_src_cb cb
,
1570 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
1571 for (unsigned i
= 0; i
< num_srcs
; i
++)
1572 if (!visit_src(&instr
->src
[i
], cb
, state
))
1576 nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
1577 for (unsigned i
= 0; i
< num_vars
; i
++)
1578 if (!visit_deref_src(instr
->variables
[i
], cb
, state
))
1585 visit_call_src(nir_call_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1591 visit_load_const_src(nir_load_const_instr
*instr
, nir_foreach_src_cb cb
,
1598 visit_phi_src(nir_phi_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1600 foreach_list_typed(nir_phi_src
, src
, node
, &instr
->srcs
) {
1601 if (!visit_src(&src
->src
, cb
, state
))
1609 visit_parallel_copy_src(nir_parallel_copy_instr
*instr
,
1610 nir_foreach_src_cb cb
, void *state
)
1612 foreach_list_typed(nir_parallel_copy_copy
, copy
, node
, &instr
->copies
) {
1613 if (!visit_src(©
->src
, cb
, state
))
1622 nir_foreach_src_cb cb
;
1623 } visit_dest_indirect_state
;
1626 visit_dest_indirect(nir_dest
*dest
, void *_state
)
1628 visit_dest_indirect_state
*state
= (visit_dest_indirect_state
*) _state
;
1630 if (!dest
->is_ssa
&& dest
->reg
.indirect
)
1631 return state
->cb(dest
->reg
.indirect
, state
->state
);
1637 nir_foreach_src(nir_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1639 switch (instr
->type
) {
1640 case nir_instr_type_alu
:
1641 if (!visit_alu_src(nir_instr_as_alu(instr
), cb
, state
))
1644 case nir_instr_type_intrinsic
:
1645 if (!visit_intrinsic_src(nir_instr_as_intrinsic(instr
), cb
, state
))
1648 case nir_instr_type_tex
:
1649 if (!visit_tex_src(nir_instr_as_tex(instr
), cb
, state
))
1652 case nir_instr_type_call
:
1653 if (!visit_call_src(nir_instr_as_call(instr
), cb
, state
))
1656 case nir_instr_type_load_const
:
1657 if (!visit_load_const_src(nir_instr_as_load_const(instr
), cb
, state
))
1660 case nir_instr_type_phi
:
1661 if (!visit_phi_src(nir_instr_as_phi(instr
), cb
, state
))
1664 case nir_instr_type_parallel_copy
:
1665 if (!visit_parallel_copy_src(nir_instr_as_parallel_copy(instr
),
1669 case nir_instr_type_jump
:
1670 case nir_instr_type_ssa_undef
:
1674 unreachable("Invalid instruction type");
1678 visit_dest_indirect_state dest_state
;
1679 dest_state
.state
= state
;
1681 return nir_foreach_dest(instr
, visit_dest_indirect
, &dest_state
);
1685 nir_src_as_const_value(nir_src src
)
1690 if (src
.ssa
->parent_instr
->type
!= nir_instr_type_load_const
)
1693 nir_load_const_instr
*load
= nir_instr_as_load_const(src
.ssa
->parent_instr
);
1695 if (load
->array_elems
== 0)
1696 return &load
->value
;
1697 if (load
->array_elems
== 1)
1704 nir_srcs_equal(nir_src src1
, nir_src src2
)
1708 return src1
.ssa
== src2
.ssa
;
1716 if ((src1
.reg
.indirect
== NULL
) != (src2
.reg
.indirect
== NULL
))
1719 if (src1
.reg
.indirect
) {
1720 if (!nir_srcs_equal(*src1
.reg
.indirect
, *src2
.reg
.indirect
))
1724 return src1
.reg
.reg
== src2
.reg
.reg
&&
1725 src1
.reg
.base_offset
== src2
.reg
.base_offset
;
1731 src_does_not_use_def(nir_src
*src
, void *void_def
)
1733 nir_ssa_def
*def
= void_def
;
1736 return src
->ssa
!= def
;
1743 src_does_not_use_reg(nir_src
*src
, void *void_reg
)
1745 nir_register
*reg
= void_reg
;
1750 return src
->reg
.reg
!= reg
;
1755 nir_instr_rewrite_src(nir_instr
*instr
, nir_src
*src
, nir_src new_src
)
1758 nir_ssa_def
*old_ssa
= src
->ssa
;
1760 if (old_ssa
&& nir_foreach_src(instr
, src_does_not_use_def
, old_ssa
)) {
1761 struct set_entry
*entry
= _mesa_set_search(old_ssa
->uses
,
1762 _mesa_hash_pointer(instr
),
1765 _mesa_set_remove(old_ssa
->uses
, entry
);
1768 if (src
->reg
.indirect
)
1769 nir_instr_rewrite_src(instr
, src
->reg
.indirect
, new_src
);
1771 nir_register
*old_reg
= src
->reg
.reg
;
1773 if (old_reg
&& nir_foreach_src(instr
, src_does_not_use_reg
, old_reg
)) {
1774 struct set_entry
*entry
= _mesa_set_search(old_reg
->uses
,
1775 _mesa_hash_pointer(instr
),
1778 _mesa_set_remove(old_reg
->uses
, entry
);
1782 if (new_src
.is_ssa
) {
1784 _mesa_set_add(new_src
.ssa
->uses
, _mesa_hash_pointer(instr
), instr
);
1786 if (new_src
.reg
.reg
)
1787 _mesa_set_add(new_src
.reg
.reg
->uses
, _mesa_hash_pointer(instr
), instr
);
1792 nir_ssa_def_init(nir_instr
*instr
, nir_ssa_def
*def
,
1793 unsigned num_components
, const char *name
)
1795 void *mem_ctx
= ralloc_parent(instr
);
1798 def
->parent_instr
= instr
;
1799 def
->uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
1800 def
->if_uses
= _mesa_set_create(mem_ctx
, _mesa_key_pointer_equal
);
1801 def
->num_components
= num_components
;
1804 nir_function_impl
*impl
=
1805 nir_cf_node_get_function(&instr
->block
->cf_node
);
1807 def
->index
= impl
->ssa_alloc
++;
1809 def
->index
= UINT_MAX
;
1813 struct ssa_def_rewrite_state
{
1820 ssa_def_rewrite_uses_src(nir_src
*src
, void *void_state
)
1822 struct ssa_def_rewrite_state
*state
= void_state
;
1824 if (src
->is_ssa
&& src
->ssa
== state
->old
)
1825 *src
= nir_src_copy(state
->new_src
, state
->mem_ctx
);
1831 nir_ssa_def_rewrite_uses(nir_ssa_def
*def
, nir_src new_src
, void *mem_ctx
)
1833 struct ssa_def_rewrite_state state
;
1834 state
.mem_ctx
= mem_ctx
;
1836 state
.new_src
= new_src
;
1838 assert(!new_src
.is_ssa
|| def
!= new_src
.ssa
);
1840 struct set
*new_uses
, *new_if_uses
;
1841 if (new_src
.is_ssa
) {
1842 new_uses
= new_src
.ssa
->uses
;
1843 new_if_uses
= new_src
.ssa
->if_uses
;
1845 new_uses
= new_src
.reg
.reg
->uses
;
1846 new_if_uses
= new_src
.reg
.reg
->if_uses
;
1849 struct set_entry
*entry
;
1850 set_foreach(def
->uses
, entry
) {
1851 nir_instr
*instr
= (nir_instr
*)entry
->key
;
1853 _mesa_set_remove(def
->uses
, entry
);
1854 nir_foreach_src(instr
, ssa_def_rewrite_uses_src
, &state
);
1855 _mesa_set_add(new_uses
, _mesa_hash_pointer(instr
), instr
);
1858 set_foreach(def
->if_uses
, entry
) {
1859 nir_if
*if_use
= (nir_if
*)entry
->key
;
1861 _mesa_set_remove(def
->if_uses
, entry
);
1862 if_use
->condition
= nir_src_copy(new_src
, mem_ctx
);
1863 _mesa_set_add(new_if_uses
, _mesa_hash_pointer(if_use
), if_use
);
1868 static bool foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1869 bool reverse
, void *state
);
1872 foreach_if(nir_if
*if_stmt
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1875 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
,
1876 &if_stmt
->else_list
) {
1877 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1881 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
,
1882 &if_stmt
->then_list
) {
1883 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1887 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->then_list
) {
1888 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1892 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->else_list
) {
1893 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1902 foreach_loop(nir_loop
*loop
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1905 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
, &loop
->body
) {
1906 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1910 foreach_list_typed_safe(nir_cf_node
, node
, node
, &loop
->body
) {
1911 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1920 foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1921 bool reverse
, void *state
)
1923 switch (node
->type
) {
1924 case nir_cf_node_block
:
1925 return cb(nir_cf_node_as_block(node
), state
);
1926 case nir_cf_node_if
:
1927 return foreach_if(nir_cf_node_as_if(node
), cb
, reverse
, state
);
1928 case nir_cf_node_loop
:
1929 return foreach_loop(nir_cf_node_as_loop(node
), cb
, reverse
, state
);
1933 unreachable("Invalid CFG node type");
1941 nir_foreach_block(nir_function_impl
*impl
, nir_foreach_block_cb cb
, void *state
)
1943 foreach_list_typed_safe(nir_cf_node
, node
, node
, &impl
->body
) {
1944 if (!foreach_cf_node(node
, cb
, false, state
))
1948 return cb(impl
->end_block
, state
);
1952 nir_foreach_block_reverse(nir_function_impl
*impl
, nir_foreach_block_cb cb
,
1955 if (!cb(impl
->end_block
, state
))
1958 foreach_list_typed_safe_reverse(nir_cf_node
, node
, node
, &impl
->body
) {
1959 if (!foreach_cf_node(node
, cb
, true, state
))
1967 nir_block_following_if(nir_block
*block
)
1969 if (exec_node_is_tail_sentinel(&block
->cf_node
.node
))
1972 if (nir_cf_node_is_last(&block
->cf_node
))
1975 nir_cf_node
*next_node
= nir_cf_node_next(&block
->cf_node
);
1977 if (next_node
->type
!= nir_cf_node_if
)
1980 return nir_cf_node_as_if(next_node
);
1984 index_block(nir_block
*block
, void *state
)
1986 unsigned *index
= (unsigned *) state
;
1987 block
->index
= (*index
)++;
1992 nir_index_blocks(nir_function_impl
*impl
)
1996 if (impl
->valid_metadata
& nir_metadata_block_index
)
1999 nir_foreach_block(impl
, index_block
, &index
);
2001 impl
->num_blocks
= index
;
2005 index_ssa_def(nir_ssa_def
*def
, unsigned *index
)
2007 def
->index
= (*index
)++;
2011 index_ssa_def_cb(nir_dest
*dest
, void *state
)
2013 unsigned *index
= (unsigned *) state
;
2015 index_ssa_def(&dest
->ssa
, index
);
2020 index_ssa_undef(nir_ssa_undef_instr
*instr
, unsigned *index
)
2022 index_ssa_def(&instr
->def
, index
);
2026 index_ssa_block(nir_block
*block
, void *state
)
2028 unsigned *index
= (unsigned *) state
;
2030 nir_foreach_instr(block
, instr
) {
2031 if (instr
->type
== nir_instr_type_ssa_undef
)
2032 index_ssa_undef(nir_instr_as_ssa_undef(instr
), index
);
2034 nir_foreach_dest(instr
, index_ssa_def_cb
, state
);
2041 nir_index_ssa_defs(nir_function_impl
*impl
)
2044 nir_foreach_block(impl
, index_ssa_block
, &index
);
2045 impl
->ssa_alloc
= index
;