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_value
*val
=
88 vtn_push_value(b
, w
[2], vtn_value_type_access_chain
);
90 struct vtn_type
*type
= vtn_value(b
, w
[1], vtn_value_type_type
)->type
;
92 assert(b
->func_param_idx
< b
->func
->impl
->num_params
);
93 nir_variable
*param
= b
->func
->impl
->params
[b
->func_param_idx
++];
95 assert(param
->type
== type
->type
);
97 /* Name the parameter so it shows up nicely in NIR */
98 param
->name
= ralloc_strdup(param
, val
->name
);
100 struct vtn_variable
*vtn_var
= rzalloc(b
, struct vtn_variable
);
101 vtn_var
->type
= type
;
102 vtn_var
->var
= param
;
103 vtn_var
->chain
.var
= vtn_var
;
104 vtn_var
->chain
.length
= 0;
106 struct vtn_type
*without_array
= type
;
107 while(glsl_type_is_array(without_array
->type
))
108 without_array
= without_array
->array_element
;
110 if (glsl_type_is_image(without_array
->type
)) {
111 vtn_var
->mode
= vtn_variable_mode_image
;
112 param
->interface_type
= without_array
->type
;
113 } else if (glsl_type_is_sampler(without_array
->type
)) {
114 vtn_var
->mode
= vtn_variable_mode_sampler
;
115 param
->interface_type
= without_array
->type
;
117 vtn_var
->mode
= vtn_variable_mode_param
;
120 val
->access_chain
= &vtn_var
->chain
;
125 assert(b
->block
== NULL
);
126 b
->block
= rzalloc(b
, struct vtn_block
);
127 b
->block
->node
.type
= vtn_cf_node_type_block
;
129 vtn_push_value(b
, w
[1], vtn_value_type_block
)->block
= b
->block
;
131 if (b
->func
->start_block
== NULL
) {
132 /* This is the first block encountered for this function. In this
133 * case, we set the start block and add it to the list of
134 * implemented functions that we'll walk later.
136 b
->func
->start_block
= b
->block
;
137 exec_list_push_tail(&b
->functions
, &b
->func
->node
);
142 case SpvOpSelectionMerge
:
144 assert(b
->block
&& b
->block
->merge
== NULL
);
149 case SpvOpBranchConditional
:
153 case SpvOpReturnValue
:
154 case SpvOpUnreachable
:
155 assert(b
->block
&& b
->block
->branch
== NULL
);
156 b
->block
->branch
= w
;
161 /* Continue on as per normal */
169 vtn_add_case(struct vtn_builder
*b
, struct vtn_switch
*swtch
,
170 struct vtn_block
*break_block
,
171 uint32_t block_id
, uint32_t val
, bool is_default
)
173 struct vtn_block
*case_block
=
174 vtn_value(b
, block_id
, vtn_value_type_block
)->block
;
176 /* Don't create dummy cases that just break */
177 if (case_block
== break_block
)
180 if (case_block
->switch_case
== NULL
) {
181 struct vtn_case
*c
= ralloc(b
, struct vtn_case
);
183 list_inithead(&c
->body
);
184 c
->start_block
= case_block
;
185 c
->fallthrough
= NULL
;
186 nir_array_init(&c
->values
, b
);
187 c
->is_default
= false;
190 list_addtail(&c
->link
, &swtch
->cases
);
192 case_block
->switch_case
= c
;
196 case_block
->switch_case
->is_default
= true;
198 nir_array_add(&case_block
->switch_case
->values
, uint32_t, val
);
202 /* This function performs a depth-first search of the cases and puts them
203 * in fall-through order.
206 vtn_order_case(struct vtn_switch
*swtch
, struct vtn_case
*cse
)
213 list_del(&cse
->link
);
215 if (cse
->fallthrough
) {
216 vtn_order_case(swtch
, cse
->fallthrough
);
218 /* If we have a fall-through, place this case right before the case it
219 * falls through to. This ensures that fallthroughs come one after
220 * the other. These two can never get separated because that would
221 * imply something else falling through to the same case. Also, this
222 * can't break ordering because the DFS ensures that this case is
223 * visited before anything that falls through to it.
225 list_addtail(&cse
->link
, &cse
->fallthrough
->link
);
227 list_add(&cse
->link
, &swtch
->cases
);
231 static enum vtn_branch_type
232 vtn_get_branch_type(struct vtn_block
*block
,
233 struct vtn_case
*swcase
, struct vtn_block
*switch_break
,
234 struct vtn_block
*loop_break
, struct vtn_block
*loop_cont
)
236 if (block
->switch_case
) {
237 /* This branch is actually a fallthrough */
238 assert(swcase
->fallthrough
== NULL
||
239 swcase
->fallthrough
== block
->switch_case
);
240 swcase
->fallthrough
= block
->switch_case
;
241 return vtn_branch_type_switch_fallthrough
;
242 } else if (block
== loop_break
) {
243 return vtn_branch_type_loop_break
;
244 } else if (block
== loop_cont
) {
245 return vtn_branch_type_loop_continue
;
246 } else if (block
== switch_break
) {
247 return vtn_branch_type_switch_break
;
249 return vtn_branch_type_none
;
254 vtn_cfg_walk_blocks(struct vtn_builder
*b
, struct list_head
*cf_list
,
255 struct vtn_block
*start
, struct vtn_case
*switch_case
,
256 struct vtn_block
*switch_break
,
257 struct vtn_block
*loop_break
, struct vtn_block
*loop_cont
,
258 struct vtn_block
*end
)
260 struct vtn_block
*block
= start
;
261 while (block
!= end
) {
262 if (block
->merge
&& (*block
->merge
& SpvOpCodeMask
) == SpvOpLoopMerge
&&
264 struct vtn_loop
*loop
= ralloc(b
, struct vtn_loop
);
266 loop
->node
.type
= vtn_cf_node_type_loop
;
267 list_inithead(&loop
->body
);
268 list_inithead(&loop
->cont_body
);
269 loop
->control
= block
->merge
[3];
271 list_addtail(&loop
->node
.link
, cf_list
);
274 struct vtn_block
*new_loop_break
=
275 vtn_value(b
, block
->merge
[1], vtn_value_type_block
)->block
;
276 struct vtn_block
*new_loop_cont
=
277 vtn_value(b
, block
->merge
[2], vtn_value_type_block
)->block
;
279 /* Note: This recursive call will start with the current block as
280 * its start block. If we weren't careful, we would get here
281 * again and end up in infinite recursion. This is why we set
282 * block->loop above and check for it before creating one. This
283 * way, we only create the loop once and the second call that
284 * tries to handle this loop goes to the cases below and gets
285 * handled as a regular block.
287 * Note: When we make the recursive walk calls, we pass NULL for
288 * the switch break since you have to break out of the loop first.
289 * We do, however, still pass the current switch case because it's
290 * possible that the merge block for the loop is the start of
293 vtn_cfg_walk_blocks(b
, &loop
->body
, block
, switch_case
, NULL
,
294 new_loop_break
, new_loop_cont
, NULL
);
295 vtn_cfg_walk_blocks(b
, &loop
->cont_body
, new_loop_cont
, NULL
, NULL
,
296 new_loop_break
, NULL
, block
);
298 block
= new_loop_break
;
302 assert(block
->node
.link
.next
== NULL
);
303 list_addtail(&block
->node
.link
, cf_list
);
305 switch (*block
->branch
& SpvOpCodeMask
) {
307 struct vtn_block
*branch_block
=
308 vtn_value(b
, block
->branch
[1], vtn_value_type_block
)->block
;
310 block
->branch_type
= vtn_get_branch_type(branch_block
,
311 switch_case
, switch_break
,
312 loop_break
, loop_cont
);
314 if (block
->branch_type
!= vtn_branch_type_none
)
317 block
= branch_block
;
322 case SpvOpReturnValue
:
323 block
->branch_type
= vtn_branch_type_return
;
327 block
->branch_type
= vtn_branch_type_discard
;
330 case SpvOpBranchConditional
: {
331 struct vtn_block
*then_block
=
332 vtn_value(b
, block
->branch
[2], vtn_value_type_block
)->block
;
333 struct vtn_block
*else_block
=
334 vtn_value(b
, block
->branch
[3], vtn_value_type_block
)->block
;
336 struct vtn_if
*if_stmt
= ralloc(b
, struct vtn_if
);
338 if_stmt
->node
.type
= vtn_cf_node_type_if
;
339 if_stmt
->condition
= block
->branch
[1];
340 list_inithead(&if_stmt
->then_body
);
341 list_inithead(&if_stmt
->else_body
);
343 list_addtail(&if_stmt
->node
.link
, cf_list
);
346 (*block
->merge
& SpvOpCodeMask
) == SpvOpSelectionMerge
) {
347 if_stmt
->control
= block
->merge
[2];
350 if_stmt
->then_type
= vtn_get_branch_type(then_block
,
351 switch_case
, switch_break
,
352 loop_break
, loop_cont
);
353 if_stmt
->else_type
= vtn_get_branch_type(else_block
,
354 switch_case
, switch_break
,
355 loop_break
, loop_cont
);
357 if (if_stmt
->then_type
== vtn_branch_type_none
&&
358 if_stmt
->else_type
== vtn_branch_type_none
) {
359 /* Neither side of the if is something we can short-circuit. */
360 assert((*block
->merge
& SpvOpCodeMask
) == SpvOpSelectionMerge
);
361 struct vtn_block
*merge_block
=
362 vtn_value(b
, block
->merge
[1], vtn_value_type_block
)->block
;
364 vtn_cfg_walk_blocks(b
, &if_stmt
->then_body
, then_block
,
365 switch_case
, switch_break
,
366 loop_break
, loop_cont
, merge_block
);
367 vtn_cfg_walk_blocks(b
, &if_stmt
->else_body
, else_block
,
368 switch_case
, switch_break
,
369 loop_break
, loop_cont
, merge_block
);
371 enum vtn_branch_type merge_type
=
372 vtn_get_branch_type(merge_block
, switch_case
, switch_break
,
373 loop_break
, loop_cont
);
374 if (merge_type
== vtn_branch_type_none
) {
380 } else if (if_stmt
->then_type
!= vtn_branch_type_none
&&
381 if_stmt
->else_type
!= vtn_branch_type_none
) {
382 /* Both sides were short-circuited. We're done here. */
385 /* Exeactly one side of the branch could be short-circuited.
386 * We set the branch up as a predicated break/continue and we
387 * continue on with the other side as if it were what comes
390 if (if_stmt
->then_type
== vtn_branch_type_none
) {
397 unreachable("Should have returned or continued");
401 assert((*block
->merge
& SpvOpCodeMask
) == SpvOpSelectionMerge
);
402 struct vtn_block
*break_block
=
403 vtn_value(b
, block
->merge
[1], vtn_value_type_block
)->block
;
405 struct vtn_switch
*swtch
= ralloc(b
, struct vtn_switch
);
407 swtch
->node
.type
= vtn_cf_node_type_switch
;
408 swtch
->selector
= block
->branch
[1];
409 list_inithead(&swtch
->cases
);
411 list_addtail(&swtch
->node
.link
, cf_list
);
413 /* First, we go through and record all of the cases. */
414 const uint32_t *branch_end
=
415 block
->branch
+ (block
->branch
[0] >> SpvWordCountShift
);
417 vtn_add_case(b
, swtch
, break_block
, block
->branch
[2], 0, true);
418 for (const uint32_t *w
= block
->branch
+ 3; w
< branch_end
; w
+= 2)
419 vtn_add_case(b
, swtch
, break_block
, w
[1], w
[0], false);
421 /* Now, we go through and walk the blocks. While we walk through
422 * the blocks, we also gather the much-needed fall-through
425 list_for_each_entry(struct vtn_case
, cse
, &swtch
->cases
, link
) {
426 assert(cse
->start_block
!= break_block
);
427 vtn_cfg_walk_blocks(b
, &cse
->body
, cse
->start_block
, cse
,
428 break_block
, NULL
, loop_cont
, NULL
);
431 /* Finally, we walk over all of the cases one more time and put
432 * them in fall-through order.
434 for (const uint32_t *w
= block
->branch
+ 2; w
< branch_end
; w
+= 2) {
435 struct vtn_block
*case_block
=
436 vtn_value(b
, *w
, vtn_value_type_block
)->block
;
438 if (case_block
== break_block
)
441 assert(case_block
->switch_case
);
443 vtn_order_case(swtch
, case_block
->switch_case
);
446 enum vtn_branch_type branch_type
=
447 vtn_get_branch_type(break_block
, switch_case
, NULL
,
448 loop_break
, loop_cont
);
450 if (branch_type
!= vtn_branch_type_none
) {
451 /* It is possible that the break is actually the continue block
452 * for the containing loop. In this case, we need to bail and let
453 * the loop parsing code handle the continue properly.
455 assert(branch_type
== vtn_branch_type_loop_continue
);
463 case SpvOpUnreachable
:
467 unreachable("Unhandled opcode");
473 vtn_build_cfg(struct vtn_builder
*b
, const uint32_t *words
, const uint32_t *end
)
475 vtn_foreach_instruction(b
, words
, end
,
476 vtn_cfg_handle_prepass_instruction
);
478 foreach_list_typed(struct vtn_function
, func
, node
, &b
->functions
) {
479 vtn_cfg_walk_blocks(b
, &func
->body
, func
->start_block
,
480 NULL
, NULL
, NULL
, NULL
, NULL
);
485 vtn_handle_phis_first_pass(struct vtn_builder
*b
, SpvOp opcode
,
486 const uint32_t *w
, unsigned count
)
488 if (opcode
== SpvOpLabel
)
489 return true; /* Nothing to do */
491 /* If this isn't a phi node, stop. */
492 if (opcode
!= SpvOpPhi
)
495 /* For handling phi nodes, we do a poor-man's out-of-ssa on the spot.
496 * For each phi, we create a variable with the appropreate type and
497 * do a load from that variable. Then, in a second pass, we add
498 * stores to that variable to each of the predecessor blocks.
500 * We could do something more intelligent here. However, in order to
501 * handle loops and things properly, we really need dominance
502 * information. It would end up basically being the into-SSA
503 * algorithm all over again. It's easier if we just let
504 * lower_vars_to_ssa do that for us instead of repeating it here.
506 struct vtn_value
*val
= vtn_push_value(b
, w
[2], vtn_value_type_ssa
);
508 struct vtn_type
*type
= vtn_value(b
, w
[1], vtn_value_type_type
)->type
;
509 nir_variable
*phi_var
=
510 nir_local_variable_create(b
->nb
.impl
, type
->type
, "phi");
511 _mesa_hash_table_insert(b
->phi_table
, w
, phi_var
);
513 val
->ssa
= vtn_local_load(b
, nir_deref_var_create(b
, phi_var
));
519 vtn_handle_phi_second_pass(struct vtn_builder
*b
, SpvOp opcode
,
520 const uint32_t *w
, unsigned count
)
522 if (opcode
!= SpvOpPhi
)
525 struct hash_entry
*phi_entry
= _mesa_hash_table_search(b
->phi_table
, w
);
527 nir_variable
*phi_var
= phi_entry
->data
;
529 for (unsigned i
= 3; i
< count
; i
+= 2) {
530 struct vtn_block
*pred
=
531 vtn_value(b
, w
[i
+ 1], vtn_value_type_block
)->block
;
533 b
->nb
.cursor
= nir_after_instr(&pred
->end_nop
->instr
);
535 struct vtn_ssa_value
*src
= vtn_ssa_value(b
, w
[i
]);
537 vtn_local_store(b
, src
, nir_deref_var_create(b
, phi_var
));
544 vtn_emit_branch(struct vtn_builder
*b
, enum vtn_branch_type branch_type
,
545 nir_variable
*switch_fall_var
, bool *has_switch_break
)
547 switch (branch_type
) {
548 case vtn_branch_type_switch_break
:
549 nir_store_var(&b
->nb
, switch_fall_var
, nir_imm_int(&b
->nb
, NIR_FALSE
), 1);
550 *has_switch_break
= true;
552 case vtn_branch_type_switch_fallthrough
:
553 break; /* Nothing to do */
554 case vtn_branch_type_loop_break
:
555 nir_jump(&b
->nb
, nir_jump_break
);
557 case vtn_branch_type_loop_continue
:
558 nir_jump(&b
->nb
, nir_jump_continue
);
560 case vtn_branch_type_return
:
561 nir_jump(&b
->nb
, nir_jump_return
);
563 case vtn_branch_type_discard
: {
564 nir_intrinsic_instr
*discard
=
565 nir_intrinsic_instr_create(b
->nb
.shader
, nir_intrinsic_discard
);
566 nir_builder_instr_insert(&b
->nb
, &discard
->instr
);
570 unreachable("Invalid branch type");
575 vtn_emit_cf_list(struct vtn_builder
*b
, struct list_head
*cf_list
,
576 nir_variable
*switch_fall_var
, bool *has_switch_break
,
577 vtn_instruction_handler handler
)
579 list_for_each_entry(struct vtn_cf_node
, node
, cf_list
, link
) {
580 switch (node
->type
) {
581 case vtn_cf_node_type_block
: {
582 struct vtn_block
*block
= (struct vtn_block
*)node
;
584 const uint32_t *block_start
= block
->label
;
585 const uint32_t *block_end
= block
->merge
? block
->merge
:
588 block_start
= vtn_foreach_instruction(b
, block_start
, block_end
,
589 vtn_handle_phis_first_pass
);
591 vtn_foreach_instruction(b
, block_start
, block_end
, handler
);
593 block
->end_nop
= nir_intrinsic_instr_create(b
->nb
.shader
,
595 nir_builder_instr_insert(&b
->nb
, &block
->end_nop
->instr
);
597 if ((*block
->branch
& SpvOpCodeMask
) == SpvOpReturnValue
) {
598 struct vtn_ssa_value
*src
= vtn_ssa_value(b
, block
->branch
[1]);
599 vtn_local_store(b
, src
,
600 nir_deref_var_create(b
, b
->impl
->return_var
));
603 if (block
->branch_type
!= vtn_branch_type_none
) {
604 vtn_emit_branch(b
, block
->branch_type
,
605 switch_fall_var
, has_switch_break
);
611 case vtn_cf_node_type_if
: {
612 struct vtn_if
*vtn_if
= (struct vtn_if
*)node
;
613 bool sw_break
= false;
616 nir_push_if(&b
->nb
, vtn_ssa_value(b
, vtn_if
->condition
)->def
);
617 if (vtn_if
->then_type
== vtn_branch_type_none
) {
618 vtn_emit_cf_list(b
, &vtn_if
->then_body
,
619 switch_fall_var
, &sw_break
, handler
);
621 vtn_emit_branch(b
, vtn_if
->then_type
, switch_fall_var
, &sw_break
);
624 nir_push_else(&b
->nb
, nif
);
625 if (vtn_if
->else_type
== vtn_branch_type_none
) {
626 vtn_emit_cf_list(b
, &vtn_if
->else_body
,
627 switch_fall_var
, &sw_break
, handler
);
629 vtn_emit_branch(b
, vtn_if
->else_type
, switch_fall_var
, &sw_break
);
632 nir_pop_if(&b
->nb
, nif
);
634 /* If we encountered a switch break somewhere inside of the if,
635 * then it would have been handled correctly by calling
636 * emit_cf_list or emit_branch for the interrior. However, we
637 * need to predicate everything following on wether or not we're
641 *has_switch_break
= true;
642 nir_push_if(&b
->nb
, nir_load_var(&b
->nb
, switch_fall_var
));
647 case vtn_cf_node_type_loop
: {
648 struct vtn_loop
*vtn_loop
= (struct vtn_loop
*)node
;
650 nir_loop
*loop
= nir_push_loop(&b
->nb
);
651 vtn_emit_cf_list(b
, &vtn_loop
->body
, NULL
, NULL
, handler
);
653 if (!list_empty(&vtn_loop
->cont_body
)) {
654 /* If we have a non-trivial continue body then we need to put
655 * it at the beginning of the loop with a flag to ensure that
656 * it doesn't get executed in the first iteration.
658 nir_variable
*do_cont
=
659 nir_local_variable_create(b
->nb
.impl
, glsl_bool_type(), "cont");
661 b
->nb
.cursor
= nir_before_cf_node(&loop
->cf_node
);
662 nir_store_var(&b
->nb
, do_cont
, nir_imm_int(&b
->nb
, NIR_FALSE
), 1);
664 b
->nb
.cursor
= nir_before_cf_list(&loop
->body
);
667 nir_push_if(&b
->nb
, nir_load_var(&b
->nb
, do_cont
));
669 vtn_emit_cf_list(b
, &vtn_loop
->cont_body
, NULL
, NULL
, handler
);
671 nir_pop_if(&b
->nb
, cont_if
);
673 nir_store_var(&b
->nb
, do_cont
, nir_imm_int(&b
->nb
, NIR_TRUE
), 1);
675 b
->has_loop_continue
= true;
678 nir_pop_loop(&b
->nb
, loop
);
682 case vtn_cf_node_type_switch
: {
683 struct vtn_switch
*vtn_switch
= (struct vtn_switch
*)node
;
685 /* First, we create a variable to keep track of whether or not the
686 * switch is still going at any given point. Any switch breaks
687 * will set this variable to false.
689 nir_variable
*fall_var
=
690 nir_local_variable_create(b
->nb
.impl
, glsl_bool_type(), "fall");
691 nir_store_var(&b
->nb
, fall_var
, nir_imm_int(&b
->nb
, NIR_FALSE
), 1);
693 /* Next, we gather up all of the conditions. We have to do this
694 * up-front because we also need to build an "any" condition so
695 * that we can use !any for default.
697 const int num_cases
= list_length(&vtn_switch
->cases
);
698 NIR_VLA(nir_ssa_def
*, conditions
, num_cases
);
700 nir_ssa_def
*sel
= vtn_ssa_value(b
, vtn_switch
->selector
)->def
;
701 /* An accumulation of all conditions. Used for the default */
702 nir_ssa_def
*any
= NULL
;
705 list_for_each_entry(struct vtn_case
, cse
, &vtn_switch
->cases
, link
) {
706 if (cse
->is_default
) {
707 conditions
[i
++] = NULL
;
711 nir_ssa_def
*cond
= NULL
;
712 nir_array_foreach(&cse
->values
, uint32_t, val
) {
713 nir_ssa_def
*is_val
=
714 nir_ieq(&b
->nb
, sel
, nir_imm_int(&b
->nb
, *val
));
716 cond
= cond
? nir_ior(&b
->nb
, cond
, is_val
) : is_val
;
719 any
= any
? nir_ior(&b
->nb
, any
, cond
) : cond
;
720 conditions
[i
++] = cond
;
722 assert(i
== num_cases
);
724 /* Now we can walk the list of cases and actually emit code */
726 list_for_each_entry(struct vtn_case
, cse
, &vtn_switch
->cases
, link
) {
727 /* Figure out the condition */
728 nir_ssa_def
*cond
= conditions
[i
++];
729 if (cse
->is_default
) {
730 assert(cond
== NULL
);
731 cond
= nir_inot(&b
->nb
, any
);
733 /* Take fallthrough into account */
734 cond
= nir_ior(&b
->nb
, cond
, nir_load_var(&b
->nb
, fall_var
));
736 nir_if
*case_if
= nir_push_if(&b
->nb
, cond
);
738 bool has_break
= false;
739 nir_store_var(&b
->nb
, fall_var
, nir_imm_int(&b
->nb
, NIR_TRUE
), 1);
740 vtn_emit_cf_list(b
, &cse
->body
, fall_var
, &has_break
, handler
);
741 (void)has_break
; /* We don't care */
743 nir_pop_if(&b
->nb
, case_if
);
745 assert(i
== num_cases
);
751 unreachable("Invalid CF node type");
757 vtn_function_emit(struct vtn_builder
*b
, struct vtn_function
*func
,
758 vtn_instruction_handler instruction_handler
)
760 nir_builder_init(&b
->nb
, func
->impl
);
761 b
->nb
.cursor
= nir_after_cf_list(&func
->impl
->body
);
762 b
->has_loop_continue
= false;
763 b
->phi_table
= _mesa_hash_table_create(b
, _mesa_hash_pointer
,
764 _mesa_key_pointer_equal
);
766 vtn_emit_cf_list(b
, &func
->body
, NULL
, NULL
, instruction_handler
);
768 vtn_foreach_instruction(b
, func
->start_block
->label
, func
->end
,
769 vtn_handle_phi_second_pass
);
771 /* Continue blocks for loops get inserted before the body of the loop
772 * but instructions in the continue may use SSA defs in the loop body.
773 * Therefore, we need to repair SSA to insert the needed phi nodes.
775 if (b
->has_loop_continue
)
776 nir_repair_ssa_impl(func
->impl
);