2 * Copyright © 2015 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 #include "vtn_private.h"
25 #include "nir/nir_vla.h"
28 vtn_cfg_handle_prepass_instruction(struct vtn_builder
*b
, SpvOp opcode
,
29 const uint32_t *w
, unsigned count
)
33 assert(b
->func
== NULL
);
34 b
->func
= rzalloc(b
, struct vtn_function
);
36 list_inithead(&b
->func
->body
);
37 b
->func
->control
= w
[3];
39 MAYBE_UNUSED
const struct glsl_type
*result_type
=
40 vtn_value(b
, w
[1], vtn_value_type_type
)->type
->type
;
41 struct vtn_value
*val
= vtn_push_value(b
, w
[2], vtn_value_type_function
);
44 const struct glsl_type
*func_type
=
45 vtn_value(b
, w
[4], vtn_value_type_type
)->type
->type
;
47 assert(glsl_get_function_return_type(func_type
) == result_type
);
50 nir_function_create(b
->shader
, ralloc_strdup(b
->shader
, val
->name
));
52 func
->num_params
= glsl_get_length(func_type
);
53 func
->params
= ralloc_array(b
->shader
, nir_parameter
, func
->num_params
);
54 for (unsigned i
= 0; i
< func
->num_params
; i
++) {
55 const struct glsl_function_param
*param
=
56 glsl_get_function_param(func_type
, i
);
57 func
->params
[i
].type
= param
->type
;
60 func
->params
[i
].param_type
= nir_parameter_inout
;
62 func
->params
[i
].param_type
= nir_parameter_in
;
66 func
->params
[i
].param_type
= nir_parameter_out
;
68 assert(!"Parameter is neither in nor out");
73 func
->return_type
= glsl_get_function_return_type(func_type
);
75 b
->func
->impl
= nir_function_impl_create(func
);
77 b
->func_param_idx
= 0;
81 case SpvOpFunctionEnd
:
86 case SpvOpFunctionParameter
: {
87 struct vtn_type
*type
= vtn_value(b
, w
[1], vtn_value_type_type
)->type
;
89 assert(b
->func_param_idx
< b
->func
->impl
->num_params
);
90 nir_variable
*param
= b
->func
->impl
->params
[b
->func_param_idx
++];
92 assert(param
->type
== type
->type
);
94 struct vtn_variable
*vtn_var
= rzalloc(b
, struct vtn_variable
);
98 struct vtn_type
*without_array
= type
;
99 while(glsl_type_is_array(without_array
->type
))
100 without_array
= without_array
->array_element
;
102 if (glsl_type_is_image(without_array
->type
)) {
103 vtn_var
->mode
= vtn_variable_mode_image
;
104 param
->interface_type
= without_array
->type
;
105 } else if (glsl_type_is_sampler(without_array
->type
)) {
106 vtn_var
->mode
= vtn_variable_mode_sampler
;
107 param
->interface_type
= without_array
->type
;
109 vtn_var
->mode
= vtn_variable_mode_param
;
112 struct vtn_value
*val
= vtn_push_value(b
, w
[2], vtn_value_type_pointer
);
114 /* Name the parameter so it shows up nicely in NIR */
115 param
->name
= ralloc_strdup(param
, val
->name
);
117 val
->pointer
= vtn_pointer_for_variable(b
, vtn_var
);
122 assert(b
->block
== NULL
);
123 b
->block
= rzalloc(b
, struct vtn_block
);
124 b
->block
->node
.type
= vtn_cf_node_type_block
;
126 vtn_push_value(b
, w
[1], vtn_value_type_block
)->block
= b
->block
;
128 if (b
->func
->start_block
== NULL
) {
129 /* This is the first block encountered for this function. In this
130 * case, we set the start block and add it to the list of
131 * implemented functions that we'll walk later.
133 b
->func
->start_block
= b
->block
;
134 exec_list_push_tail(&b
->functions
, &b
->func
->node
);
139 case SpvOpSelectionMerge
:
141 assert(b
->block
&& b
->block
->merge
== NULL
);
146 case SpvOpBranchConditional
:
150 case SpvOpReturnValue
:
151 case SpvOpUnreachable
:
152 assert(b
->block
&& b
->block
->branch
== NULL
);
153 b
->block
->branch
= w
;
158 /* Continue on as per normal */
166 vtn_add_case(struct vtn_builder
*b
, struct vtn_switch
*swtch
,
167 struct vtn_block
*break_block
,
168 uint32_t block_id
, uint32_t val
, bool is_default
)
170 struct vtn_block
*case_block
=
171 vtn_value(b
, block_id
, vtn_value_type_block
)->block
;
173 /* Don't create dummy cases that just break */
174 if (case_block
== break_block
)
177 if (case_block
->switch_case
== NULL
) {
178 struct vtn_case
*c
= ralloc(b
, struct vtn_case
);
180 list_inithead(&c
->body
);
181 c
->start_block
= case_block
;
182 c
->fallthrough
= NULL
;
183 util_dynarray_init(&c
->values
, b
);
184 c
->is_default
= false;
187 list_addtail(&c
->link
, &swtch
->cases
);
189 case_block
->switch_case
= c
;
193 case_block
->switch_case
->is_default
= true;
195 util_dynarray_append(&case_block
->switch_case
->values
, uint32_t, val
);
199 /* This function performs a depth-first search of the cases and puts them
200 * in fall-through order.
203 vtn_order_case(struct vtn_switch
*swtch
, struct vtn_case
*cse
)
210 list_del(&cse
->link
);
212 if (cse
->fallthrough
) {
213 vtn_order_case(swtch
, cse
->fallthrough
);
215 /* If we have a fall-through, place this case right before the case it
216 * falls through to. This ensures that fallthroughs come one after
217 * the other. These two can never get separated because that would
218 * imply something else falling through to the same case. Also, this
219 * can't break ordering because the DFS ensures that this case is
220 * visited before anything that falls through to it.
222 list_addtail(&cse
->link
, &cse
->fallthrough
->link
);
224 list_add(&cse
->link
, &swtch
->cases
);
228 static enum vtn_branch_type
229 vtn_get_branch_type(struct vtn_block
*block
,
230 struct vtn_case
*swcase
, struct vtn_block
*switch_break
,
231 struct vtn_block
*loop_break
, struct vtn_block
*loop_cont
)
233 if (block
->switch_case
) {
234 /* This branch is actually a fallthrough */
235 assert(swcase
->fallthrough
== NULL
||
236 swcase
->fallthrough
== block
->switch_case
);
237 swcase
->fallthrough
= block
->switch_case
;
238 return vtn_branch_type_switch_fallthrough
;
239 } else if (block
== loop_break
) {
240 return vtn_branch_type_loop_break
;
241 } else if (block
== loop_cont
) {
242 return vtn_branch_type_loop_continue
;
243 } else if (block
== switch_break
) {
244 return vtn_branch_type_switch_break
;
246 return vtn_branch_type_none
;
251 vtn_cfg_walk_blocks(struct vtn_builder
*b
, struct list_head
*cf_list
,
252 struct vtn_block
*start
, struct vtn_case
*switch_case
,
253 struct vtn_block
*switch_break
,
254 struct vtn_block
*loop_break
, struct vtn_block
*loop_cont
,
255 struct vtn_block
*end
)
257 struct vtn_block
*block
= start
;
258 while (block
!= end
) {
259 if (block
->merge
&& (*block
->merge
& SpvOpCodeMask
) == SpvOpLoopMerge
&&
261 struct vtn_loop
*loop
= ralloc(b
, struct vtn_loop
);
263 loop
->node
.type
= vtn_cf_node_type_loop
;
264 list_inithead(&loop
->body
);
265 list_inithead(&loop
->cont_body
);
266 loop
->control
= block
->merge
[3];
268 list_addtail(&loop
->node
.link
, cf_list
);
271 struct vtn_block
*new_loop_break
=
272 vtn_value(b
, block
->merge
[1], vtn_value_type_block
)->block
;
273 struct vtn_block
*new_loop_cont
=
274 vtn_value(b
, block
->merge
[2], vtn_value_type_block
)->block
;
276 /* Note: This recursive call will start with the current block as
277 * its start block. If we weren't careful, we would get here
278 * again and end up in infinite recursion. This is why we set
279 * block->loop above and check for it before creating one. This
280 * way, we only create the loop once and the second call that
281 * tries to handle this loop goes to the cases below and gets
282 * handled as a regular block.
284 * Note: When we make the recursive walk calls, we pass NULL for
285 * the switch break since you have to break out of the loop first.
286 * We do, however, still pass the current switch case because it's
287 * possible that the merge block for the loop is the start of
290 vtn_cfg_walk_blocks(b
, &loop
->body
, block
, switch_case
, NULL
,
291 new_loop_break
, new_loop_cont
, NULL
);
292 vtn_cfg_walk_blocks(b
, &loop
->cont_body
, new_loop_cont
, NULL
, NULL
,
293 new_loop_break
, NULL
, block
);
295 block
= new_loop_break
;
299 assert(block
->node
.link
.next
== NULL
);
300 list_addtail(&block
->node
.link
, cf_list
);
302 switch (*block
->branch
& SpvOpCodeMask
) {
304 struct vtn_block
*branch_block
=
305 vtn_value(b
, block
->branch
[1], vtn_value_type_block
)->block
;
307 block
->branch_type
= vtn_get_branch_type(branch_block
,
308 switch_case
, switch_break
,
309 loop_break
, loop_cont
);
311 if (block
->branch_type
!= vtn_branch_type_none
)
314 block
= branch_block
;
319 case SpvOpReturnValue
:
320 block
->branch_type
= vtn_branch_type_return
;
324 block
->branch_type
= vtn_branch_type_discard
;
327 case SpvOpBranchConditional
: {
328 struct vtn_block
*then_block
=
329 vtn_value(b
, block
->branch
[2], vtn_value_type_block
)->block
;
330 struct vtn_block
*else_block
=
331 vtn_value(b
, block
->branch
[3], vtn_value_type_block
)->block
;
333 struct vtn_if
*if_stmt
= ralloc(b
, struct vtn_if
);
335 if_stmt
->node
.type
= vtn_cf_node_type_if
;
336 if_stmt
->condition
= block
->branch
[1];
337 list_inithead(&if_stmt
->then_body
);
338 list_inithead(&if_stmt
->else_body
);
340 list_addtail(&if_stmt
->node
.link
, cf_list
);
343 (*block
->merge
& SpvOpCodeMask
) == SpvOpSelectionMerge
) {
344 if_stmt
->control
= block
->merge
[2];
347 if_stmt
->then_type
= vtn_get_branch_type(then_block
,
348 switch_case
, switch_break
,
349 loop_break
, loop_cont
);
350 if_stmt
->else_type
= vtn_get_branch_type(else_block
,
351 switch_case
, switch_break
,
352 loop_break
, loop_cont
);
354 if (if_stmt
->then_type
== vtn_branch_type_none
&&
355 if_stmt
->else_type
== vtn_branch_type_none
) {
356 /* Neither side of the if is something we can short-circuit. */
357 assert((*block
->merge
& SpvOpCodeMask
) == SpvOpSelectionMerge
);
358 struct vtn_block
*merge_block
=
359 vtn_value(b
, block
->merge
[1], vtn_value_type_block
)->block
;
361 vtn_cfg_walk_blocks(b
, &if_stmt
->then_body
, then_block
,
362 switch_case
, switch_break
,
363 loop_break
, loop_cont
, merge_block
);
364 vtn_cfg_walk_blocks(b
, &if_stmt
->else_body
, else_block
,
365 switch_case
, switch_break
,
366 loop_break
, loop_cont
, merge_block
);
368 enum vtn_branch_type merge_type
=
369 vtn_get_branch_type(merge_block
, switch_case
, switch_break
,
370 loop_break
, loop_cont
);
371 if (merge_type
== vtn_branch_type_none
) {
377 } else if (if_stmt
->then_type
!= vtn_branch_type_none
&&
378 if_stmt
->else_type
!= vtn_branch_type_none
) {
379 /* Both sides were short-circuited. We're done here. */
382 /* Exeactly one side of the branch could be short-circuited.
383 * We set the branch up as a predicated break/continue and we
384 * continue on with the other side as if it were what comes
387 if (if_stmt
->then_type
== vtn_branch_type_none
) {
394 unreachable("Should have returned or continued");
398 assert((*block
->merge
& SpvOpCodeMask
) == SpvOpSelectionMerge
);
399 struct vtn_block
*break_block
=
400 vtn_value(b
, block
->merge
[1], vtn_value_type_block
)->block
;
402 struct vtn_switch
*swtch
= ralloc(b
, struct vtn_switch
);
404 swtch
->node
.type
= vtn_cf_node_type_switch
;
405 swtch
->selector
= block
->branch
[1];
406 list_inithead(&swtch
->cases
);
408 list_addtail(&swtch
->node
.link
, cf_list
);
410 /* First, we go through and record all of the cases. */
411 const uint32_t *branch_end
=
412 block
->branch
+ (block
->branch
[0] >> SpvWordCountShift
);
414 vtn_add_case(b
, swtch
, break_block
, block
->branch
[2], 0, true);
415 for (const uint32_t *w
= block
->branch
+ 3; w
< branch_end
; w
+= 2)
416 vtn_add_case(b
, swtch
, break_block
, w
[1], w
[0], false);
418 /* Now, we go through and walk the blocks. While we walk through
419 * the blocks, we also gather the much-needed fall-through
422 list_for_each_entry(struct vtn_case
, cse
, &swtch
->cases
, link
) {
423 assert(cse
->start_block
!= break_block
);
424 vtn_cfg_walk_blocks(b
, &cse
->body
, cse
->start_block
, cse
,
425 break_block
, NULL
, loop_cont
, NULL
);
428 /* Finally, we walk over all of the cases one more time and put
429 * them in fall-through order.
431 for (const uint32_t *w
= block
->branch
+ 2; w
< branch_end
; w
+= 2) {
432 struct vtn_block
*case_block
=
433 vtn_value(b
, *w
, vtn_value_type_block
)->block
;
435 if (case_block
== break_block
)
438 assert(case_block
->switch_case
);
440 vtn_order_case(swtch
, case_block
->switch_case
);
443 enum vtn_branch_type branch_type
=
444 vtn_get_branch_type(break_block
, switch_case
, NULL
,
445 loop_break
, loop_cont
);
447 if (branch_type
!= vtn_branch_type_none
) {
448 /* It is possible that the break is actually the continue block
449 * for the containing loop. In this case, we need to bail and let
450 * the loop parsing code handle the continue properly.
452 assert(branch_type
== vtn_branch_type_loop_continue
);
460 case SpvOpUnreachable
:
464 unreachable("Unhandled opcode");
470 vtn_build_cfg(struct vtn_builder
*b
, const uint32_t *words
, const uint32_t *end
)
472 vtn_foreach_instruction(b
, words
, end
,
473 vtn_cfg_handle_prepass_instruction
);
475 foreach_list_typed(struct vtn_function
, func
, node
, &b
->functions
) {
476 vtn_cfg_walk_blocks(b
, &func
->body
, func
->start_block
,
477 NULL
, NULL
, NULL
, NULL
, NULL
);
482 vtn_handle_phis_first_pass(struct vtn_builder
*b
, SpvOp opcode
,
483 const uint32_t *w
, unsigned count
)
485 if (opcode
== SpvOpLabel
)
486 return true; /* Nothing to do */
488 /* If this isn't a phi node, stop. */
489 if (opcode
!= SpvOpPhi
)
492 /* For handling phi nodes, we do a poor-man's out-of-ssa on the spot.
493 * For each phi, we create a variable with the appropreate type and
494 * do a load from that variable. Then, in a second pass, we add
495 * stores to that variable to each of the predecessor blocks.
497 * We could do something more intelligent here. However, in order to
498 * handle loops and things properly, we really need dominance
499 * information. It would end up basically being the into-SSA
500 * algorithm all over again. It's easier if we just let
501 * lower_vars_to_ssa do that for us instead of repeating it here.
503 struct vtn_value
*val
= vtn_push_value(b
, w
[2], vtn_value_type_ssa
);
505 struct vtn_type
*type
= vtn_value(b
, w
[1], vtn_value_type_type
)->type
;
506 nir_variable
*phi_var
=
507 nir_local_variable_create(b
->nb
.impl
, type
->type
, "phi");
508 _mesa_hash_table_insert(b
->phi_table
, w
, phi_var
);
510 val
->ssa
= vtn_local_load(b
, nir_deref_var_create(b
, phi_var
));
516 vtn_handle_phi_second_pass(struct vtn_builder
*b
, SpvOp opcode
,
517 const uint32_t *w
, unsigned count
)
519 if (opcode
!= SpvOpPhi
)
522 struct hash_entry
*phi_entry
= _mesa_hash_table_search(b
->phi_table
, w
);
524 nir_variable
*phi_var
= phi_entry
->data
;
526 for (unsigned i
= 3; i
< count
; i
+= 2) {
527 struct vtn_block
*pred
=
528 vtn_value(b
, w
[i
+ 1], vtn_value_type_block
)->block
;
530 b
->nb
.cursor
= nir_after_instr(&pred
->end_nop
->instr
);
532 struct vtn_ssa_value
*src
= vtn_ssa_value(b
, w
[i
]);
534 vtn_local_store(b
, src
, nir_deref_var_create(b
, phi_var
));
541 vtn_emit_branch(struct vtn_builder
*b
, enum vtn_branch_type branch_type
,
542 nir_variable
*switch_fall_var
, bool *has_switch_break
)
544 switch (branch_type
) {
545 case vtn_branch_type_switch_break
:
546 nir_store_var(&b
->nb
, switch_fall_var
, nir_imm_int(&b
->nb
, NIR_FALSE
), 1);
547 *has_switch_break
= true;
549 case vtn_branch_type_switch_fallthrough
:
550 break; /* Nothing to do */
551 case vtn_branch_type_loop_break
:
552 nir_jump(&b
->nb
, nir_jump_break
);
554 case vtn_branch_type_loop_continue
:
555 nir_jump(&b
->nb
, nir_jump_continue
);
557 case vtn_branch_type_return
:
558 nir_jump(&b
->nb
, nir_jump_return
);
560 case vtn_branch_type_discard
: {
561 nir_intrinsic_instr
*discard
=
562 nir_intrinsic_instr_create(b
->nb
.shader
, nir_intrinsic_discard
);
563 nir_builder_instr_insert(&b
->nb
, &discard
->instr
);
567 unreachable("Invalid branch type");
572 vtn_emit_cf_list(struct vtn_builder
*b
, struct list_head
*cf_list
,
573 nir_variable
*switch_fall_var
, bool *has_switch_break
,
574 vtn_instruction_handler handler
)
576 list_for_each_entry(struct vtn_cf_node
, node
, cf_list
, link
) {
577 switch (node
->type
) {
578 case vtn_cf_node_type_block
: {
579 struct vtn_block
*block
= (struct vtn_block
*)node
;
581 const uint32_t *block_start
= block
->label
;
582 const uint32_t *block_end
= block
->merge
? block
->merge
:
585 block_start
= vtn_foreach_instruction(b
, block_start
, block_end
,
586 vtn_handle_phis_first_pass
);
588 vtn_foreach_instruction(b
, block_start
, block_end
, handler
);
590 block
->end_nop
= nir_intrinsic_instr_create(b
->nb
.shader
,
592 nir_builder_instr_insert(&b
->nb
, &block
->end_nop
->instr
);
594 if ((*block
->branch
& SpvOpCodeMask
) == SpvOpReturnValue
) {
595 struct vtn_ssa_value
*src
= vtn_ssa_value(b
, block
->branch
[1]);
596 vtn_local_store(b
, src
,
597 nir_deref_var_create(b
, b
->impl
->return_var
));
600 if (block
->branch_type
!= vtn_branch_type_none
) {
601 vtn_emit_branch(b
, block
->branch_type
,
602 switch_fall_var
, has_switch_break
);
608 case vtn_cf_node_type_if
: {
609 struct vtn_if
*vtn_if
= (struct vtn_if
*)node
;
610 bool sw_break
= false;
613 nir_push_if(&b
->nb
, vtn_ssa_value(b
, vtn_if
->condition
)->def
);
614 if (vtn_if
->then_type
== vtn_branch_type_none
) {
615 vtn_emit_cf_list(b
, &vtn_if
->then_body
,
616 switch_fall_var
, &sw_break
, handler
);
618 vtn_emit_branch(b
, vtn_if
->then_type
, switch_fall_var
, &sw_break
);
621 nir_push_else(&b
->nb
, nif
);
622 if (vtn_if
->else_type
== vtn_branch_type_none
) {
623 vtn_emit_cf_list(b
, &vtn_if
->else_body
,
624 switch_fall_var
, &sw_break
, handler
);
626 vtn_emit_branch(b
, vtn_if
->else_type
, switch_fall_var
, &sw_break
);
629 nir_pop_if(&b
->nb
, nif
);
631 /* If we encountered a switch break somewhere inside of the if,
632 * then it would have been handled correctly by calling
633 * emit_cf_list or emit_branch for the interrior. However, we
634 * need to predicate everything following on wether or not we're
638 *has_switch_break
= true;
639 nir_push_if(&b
->nb
, nir_load_var(&b
->nb
, switch_fall_var
));
644 case vtn_cf_node_type_loop
: {
645 struct vtn_loop
*vtn_loop
= (struct vtn_loop
*)node
;
647 nir_loop
*loop
= nir_push_loop(&b
->nb
);
648 vtn_emit_cf_list(b
, &vtn_loop
->body
, NULL
, NULL
, handler
);
650 if (!list_empty(&vtn_loop
->cont_body
)) {
651 /* If we have a non-trivial continue body then we need to put
652 * it at the beginning of the loop with a flag to ensure that
653 * it doesn't get executed in the first iteration.
655 nir_variable
*do_cont
=
656 nir_local_variable_create(b
->nb
.impl
, glsl_bool_type(), "cont");
658 b
->nb
.cursor
= nir_before_cf_node(&loop
->cf_node
);
659 nir_store_var(&b
->nb
, do_cont
, nir_imm_int(&b
->nb
, NIR_FALSE
), 1);
661 b
->nb
.cursor
= nir_before_cf_list(&loop
->body
);
664 nir_push_if(&b
->nb
, nir_load_var(&b
->nb
, do_cont
));
666 vtn_emit_cf_list(b
, &vtn_loop
->cont_body
, NULL
, NULL
, handler
);
668 nir_pop_if(&b
->nb
, cont_if
);
670 nir_store_var(&b
->nb
, do_cont
, nir_imm_int(&b
->nb
, NIR_TRUE
), 1);
672 b
->has_loop_continue
= true;
675 nir_pop_loop(&b
->nb
, loop
);
679 case vtn_cf_node_type_switch
: {
680 struct vtn_switch
*vtn_switch
= (struct vtn_switch
*)node
;
682 /* First, we create a variable to keep track of whether or not the
683 * switch is still going at any given point. Any switch breaks
684 * will set this variable to false.
686 nir_variable
*fall_var
=
687 nir_local_variable_create(b
->nb
.impl
, glsl_bool_type(), "fall");
688 nir_store_var(&b
->nb
, fall_var
, nir_imm_int(&b
->nb
, NIR_FALSE
), 1);
690 /* Next, we gather up all of the conditions. We have to do this
691 * up-front because we also need to build an "any" condition so
692 * that we can use !any for default.
694 const int num_cases
= list_length(&vtn_switch
->cases
);
695 NIR_VLA(nir_ssa_def
*, conditions
, num_cases
);
697 nir_ssa_def
*sel
= vtn_ssa_value(b
, vtn_switch
->selector
)->def
;
698 /* An accumulation of all conditions. Used for the default */
699 nir_ssa_def
*any
= NULL
;
702 list_for_each_entry(struct vtn_case
, cse
, &vtn_switch
->cases
, link
) {
703 if (cse
->is_default
) {
704 conditions
[i
++] = NULL
;
708 nir_ssa_def
*cond
= NULL
;
709 util_dynarray_foreach(&cse
->values
, uint32_t, val
) {
710 nir_ssa_def
*is_val
=
711 nir_ieq(&b
->nb
, sel
, nir_imm_int(&b
->nb
, *val
));
713 cond
= cond
? nir_ior(&b
->nb
, cond
, is_val
) : is_val
;
716 any
= any
? nir_ior(&b
->nb
, any
, cond
) : cond
;
717 conditions
[i
++] = cond
;
719 assert(i
== num_cases
);
721 /* Now we can walk the list of cases and actually emit code */
723 list_for_each_entry(struct vtn_case
, cse
, &vtn_switch
->cases
, link
) {
724 /* Figure out the condition */
725 nir_ssa_def
*cond
= conditions
[i
++];
726 if (cse
->is_default
) {
727 assert(cond
== NULL
);
728 cond
= nir_inot(&b
->nb
, any
);
730 /* Take fallthrough into account */
731 cond
= nir_ior(&b
->nb
, cond
, nir_load_var(&b
->nb
, fall_var
));
733 nir_if
*case_if
= nir_push_if(&b
->nb
, cond
);
735 bool has_break
= false;
736 nir_store_var(&b
->nb
, fall_var
, nir_imm_int(&b
->nb
, NIR_TRUE
), 1);
737 vtn_emit_cf_list(b
, &cse
->body
, fall_var
, &has_break
, handler
);
738 (void)has_break
; /* We don't care */
740 nir_pop_if(&b
->nb
, case_if
);
742 assert(i
== num_cases
);
748 unreachable("Invalid CF node type");
754 vtn_function_emit(struct vtn_builder
*b
, struct vtn_function
*func
,
755 vtn_instruction_handler instruction_handler
)
757 nir_builder_init(&b
->nb
, func
->impl
);
758 b
->nb
.cursor
= nir_after_cf_list(&func
->impl
->body
);
759 b
->has_loop_continue
= false;
760 b
->phi_table
= _mesa_hash_table_create(b
, _mesa_hash_pointer
,
761 _mesa_key_pointer_equal
);
763 vtn_emit_cf_list(b
, &func
->body
, NULL
, NULL
, instruction_handler
);
765 vtn_foreach_instruction(b
, func
->start_block
->label
, func
->end
,
766 vtn_handle_phi_second_pass
);
768 /* Continue blocks for loops get inserted before the body of the loop
769 * but instructions in the continue may use SSA defs in the loop body.
770 * Therefore, we need to repair SSA to insert the needed phi nodes.
772 if (b
->has_loop_continue
)
773 nir_repair_ssa_impl(func
->impl
);