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)
29 #include "nir_control_flow_private.h"
33 nir_shader_create(void *mem_ctx
,
34 gl_shader_stage stage
,
35 const nir_shader_compiler_options
*options
)
37 nir_shader
*shader
= ralloc(mem_ctx
, nir_shader
);
39 exec_list_make_empty(&shader
->uniforms
);
40 exec_list_make_empty(&shader
->inputs
);
41 exec_list_make_empty(&shader
->outputs
);
42 exec_list_make_empty(&shader
->shared
);
44 shader
->options
= options
;
45 memset(&shader
->info
, 0, sizeof(shader
->info
));
47 exec_list_make_empty(&shader
->functions
);
48 exec_list_make_empty(&shader
->registers
);
49 exec_list_make_empty(&shader
->globals
);
50 exec_list_make_empty(&shader
->system_values
);
51 shader
->reg_alloc
= 0;
53 shader
->num_inputs
= 0;
54 shader
->num_outputs
= 0;
55 shader
->num_uniforms
= 0;
56 shader
->num_shared
= 0;
58 shader
->stage
= stage
;
64 reg_create(void *mem_ctx
, struct exec_list
*list
)
66 nir_register
*reg
= ralloc(mem_ctx
, nir_register
);
68 list_inithead(®
->uses
);
69 list_inithead(®
->defs
);
70 list_inithead(®
->if_uses
);
72 reg
->num_components
= 0;
74 reg
->num_array_elems
= 0;
75 reg
->is_packed
= false;
78 exec_list_push_tail(list
, ®
->node
);
84 nir_global_reg_create(nir_shader
*shader
)
86 nir_register
*reg
= reg_create(shader
, &shader
->registers
);
87 reg
->index
= shader
->reg_alloc
++;
88 reg
->is_global
= true;
94 nir_local_reg_create(nir_function_impl
*impl
)
96 nir_register
*reg
= reg_create(ralloc_parent(impl
), &impl
->registers
);
97 reg
->index
= impl
->reg_alloc
++;
98 reg
->is_global
= false;
104 nir_reg_remove(nir_register
*reg
)
106 exec_node_remove(®
->node
);
110 nir_shader_add_variable(nir_shader
*shader
, nir_variable
*var
)
112 switch (var
->data
.mode
) {
114 assert(!"invalid mode");
118 assert(!"nir_shader_add_variable cannot be used for local variables");
122 assert(!"nir_shader_add_variable cannot be used for function parameters");
126 exec_list_push_tail(&shader
->globals
, &var
->node
);
129 case nir_var_shader_in
:
130 exec_list_push_tail(&shader
->inputs
, &var
->node
);
133 case nir_var_shader_out
:
134 exec_list_push_tail(&shader
->outputs
, &var
->node
);
137 case nir_var_uniform
:
138 case nir_var_shader_storage
:
139 exec_list_push_tail(&shader
->uniforms
, &var
->node
);
143 assert(shader
->stage
== MESA_SHADER_COMPUTE
);
144 exec_list_push_tail(&shader
->shared
, &var
->node
);
147 case nir_var_system_value
:
148 exec_list_push_tail(&shader
->system_values
, &var
->node
);
154 nir_variable_create(nir_shader
*shader
, nir_variable_mode mode
,
155 const struct glsl_type
*type
, const char *name
)
157 nir_variable
*var
= rzalloc(shader
, nir_variable
);
158 var
->name
= ralloc_strdup(var
, name
);
160 var
->data
.mode
= mode
;
162 if ((mode
== nir_var_shader_in
&& shader
->stage
!= MESA_SHADER_VERTEX
) ||
163 (mode
== nir_var_shader_out
&& shader
->stage
!= MESA_SHADER_FRAGMENT
))
164 var
->data
.interpolation
= INTERP_QUALIFIER_SMOOTH
;
166 if (mode
== nir_var_shader_in
|| mode
== nir_var_uniform
)
167 var
->data
.read_only
= true;
169 nir_shader_add_variable(shader
, var
);
175 nir_local_variable_create(nir_function_impl
*impl
,
176 const struct glsl_type
*type
, const char *name
)
178 nir_variable
*var
= rzalloc(impl
->function
->shader
, nir_variable
);
179 var
->name
= ralloc_strdup(var
, name
);
181 var
->data
.mode
= nir_var_local
;
183 nir_function_impl_add_variable(impl
, var
);
189 nir_function_create(nir_shader
*shader
, const char *name
)
191 nir_function
*func
= ralloc(shader
, nir_function
);
193 exec_list_push_tail(&shader
->functions
, &func
->node
);
195 func
->name
= ralloc_strdup(func
, name
);
196 func
->shader
= shader
;
197 func
->num_params
= 0;
199 func
->return_type
= glsl_void_type();
205 void nir_src_copy(nir_src
*dest
, const nir_src
*src
, void *mem_ctx
)
207 dest
->is_ssa
= src
->is_ssa
;
209 dest
->ssa
= src
->ssa
;
211 dest
->reg
.base_offset
= src
->reg
.base_offset
;
212 dest
->reg
.reg
= src
->reg
.reg
;
213 if (src
->reg
.indirect
) {
214 dest
->reg
.indirect
= ralloc(mem_ctx
, nir_src
);
215 nir_src_copy(dest
->reg
.indirect
, src
->reg
.indirect
, mem_ctx
);
217 dest
->reg
.indirect
= NULL
;
222 void nir_dest_copy(nir_dest
*dest
, const nir_dest
*src
, nir_instr
*instr
)
224 /* Copying an SSA definition makes no sense whatsoever. */
225 assert(!src
->is_ssa
);
227 dest
->is_ssa
= false;
229 dest
->reg
.base_offset
= src
->reg
.base_offset
;
230 dest
->reg
.reg
= src
->reg
.reg
;
231 if (src
->reg
.indirect
) {
232 dest
->reg
.indirect
= ralloc(instr
, nir_src
);
233 nir_src_copy(dest
->reg
.indirect
, src
->reg
.indirect
, instr
);
235 dest
->reg
.indirect
= NULL
;
240 nir_alu_src_copy(nir_alu_src
*dest
, const nir_alu_src
*src
,
241 nir_alu_instr
*instr
)
243 nir_src_copy(&dest
->src
, &src
->src
, &instr
->instr
);
244 dest
->abs
= src
->abs
;
245 dest
->negate
= src
->negate
;
246 for (unsigned i
= 0; i
< 4; i
++)
247 dest
->swizzle
[i
] = src
->swizzle
[i
];
251 nir_alu_dest_copy(nir_alu_dest
*dest
, const nir_alu_dest
*src
,
252 nir_alu_instr
*instr
)
254 nir_dest_copy(&dest
->dest
, &src
->dest
, &instr
->instr
);
255 dest
->write_mask
= src
->write_mask
;
256 dest
->saturate
= src
->saturate
;
261 cf_init(nir_cf_node
*node
, nir_cf_node_type type
)
263 exec_node_init(&node
->node
);
269 nir_function_impl_create_bare(nir_shader
*shader
)
271 nir_function_impl
*impl
= ralloc(shader
, nir_function_impl
);
273 impl
->function
= NULL
;
275 cf_init(&impl
->cf_node
, nir_cf_node_function
);
277 exec_list_make_empty(&impl
->body
);
278 exec_list_make_empty(&impl
->registers
);
279 exec_list_make_empty(&impl
->locals
);
280 impl
->num_params
= 0;
282 impl
->return_var
= NULL
;
285 impl
->valid_metadata
= nir_metadata_none
;
287 /* create start & end blocks */
288 nir_block
*start_block
= nir_block_create(shader
);
289 nir_block
*end_block
= nir_block_create(shader
);
290 start_block
->cf_node
.parent
= &impl
->cf_node
;
291 end_block
->cf_node
.parent
= &impl
->cf_node
;
292 impl
->end_block
= end_block
;
294 exec_list_push_tail(&impl
->body
, &start_block
->cf_node
.node
);
296 start_block
->successors
[0] = end_block
;
297 _mesa_set_add(end_block
->predecessors
, start_block
);
302 nir_function_impl_create(nir_function
*function
)
304 assert(function
->impl
== NULL
);
306 nir_function_impl
*impl
= nir_function_impl_create_bare(function
->shader
);
308 function
->impl
= impl
;
309 impl
->function
= function
;
311 impl
->num_params
= function
->num_params
;
312 impl
->params
= ralloc_array(function
->shader
,
313 nir_variable
*, impl
->num_params
);
315 for (unsigned i
= 0; i
< impl
->num_params
; i
++) {
316 impl
->params
[i
] = rzalloc(function
->shader
, nir_variable
);
317 impl
->params
[i
]->type
= function
->params
[i
].type
;
318 impl
->params
[i
]->data
.mode
= nir_var_param
;
319 impl
->params
[i
]->data
.location
= i
;
322 if (!glsl_type_is_void(function
->return_type
)) {
323 impl
->return_var
= rzalloc(function
->shader
, nir_variable
);
324 impl
->return_var
->type
= function
->return_type
;
325 impl
->return_var
->data
.mode
= nir_var_param
;
326 impl
->return_var
->data
.location
= -1;
328 impl
->return_var
= NULL
;
335 nir_block_create(nir_shader
*shader
)
337 nir_block
*block
= ralloc(shader
, nir_block
);
339 cf_init(&block
->cf_node
, nir_cf_node_block
);
341 block
->successors
[0] = block
->successors
[1] = NULL
;
342 block
->predecessors
= _mesa_set_create(block
, _mesa_hash_pointer
,
343 _mesa_key_pointer_equal
);
344 block
->imm_dom
= NULL
;
345 /* XXX maybe it would be worth it to defer allocation? This
346 * way it doesn't get allocated for shader ref's that never run
347 * nir_calc_dominance? For example, state-tracker creates an
348 * initial IR, clones that, runs appropriate lowering pass, passes
349 * to driver which does common lowering/opt, and then stores ref
350 * which is later used to do state specific lowering and futher
351 * opt. Do any of the references not need dominance metadata?
353 block
->dom_frontier
= _mesa_set_create(block
, _mesa_hash_pointer
,
354 _mesa_key_pointer_equal
);
356 exec_list_make_empty(&block
->instr_list
);
362 src_init(nir_src
*src
)
366 src
->reg
.indirect
= NULL
;
367 src
->reg
.base_offset
= 0;
371 nir_if_create(nir_shader
*shader
)
373 nir_if
*if_stmt
= ralloc(shader
, nir_if
);
375 cf_init(&if_stmt
->cf_node
, nir_cf_node_if
);
376 src_init(&if_stmt
->condition
);
378 nir_block
*then
= nir_block_create(shader
);
379 exec_list_make_empty(&if_stmt
->then_list
);
380 exec_list_push_tail(&if_stmt
->then_list
, &then
->cf_node
.node
);
381 then
->cf_node
.parent
= &if_stmt
->cf_node
;
383 nir_block
*else_stmt
= nir_block_create(shader
);
384 exec_list_make_empty(&if_stmt
->else_list
);
385 exec_list_push_tail(&if_stmt
->else_list
, &else_stmt
->cf_node
.node
);
386 else_stmt
->cf_node
.parent
= &if_stmt
->cf_node
;
392 nir_loop_create(nir_shader
*shader
)
394 nir_loop
*loop
= ralloc(shader
, nir_loop
);
396 cf_init(&loop
->cf_node
, nir_cf_node_loop
);
398 nir_block
*body
= nir_block_create(shader
);
399 exec_list_make_empty(&loop
->body
);
400 exec_list_push_tail(&loop
->body
, &body
->cf_node
.node
);
401 body
->cf_node
.parent
= &loop
->cf_node
;
403 body
->successors
[0] = body
;
404 _mesa_set_add(body
->predecessors
, body
);
410 instr_init(nir_instr
*instr
, nir_instr_type type
)
414 exec_node_init(&instr
->node
);
418 dest_init(nir_dest
*dest
)
420 dest
->is_ssa
= false;
421 dest
->reg
.reg
= NULL
;
422 dest
->reg
.indirect
= NULL
;
423 dest
->reg
.base_offset
= 0;
427 alu_dest_init(nir_alu_dest
*dest
)
429 dest_init(&dest
->dest
);
430 dest
->saturate
= false;
431 dest
->write_mask
= 0xf;
435 alu_src_init(nir_alu_src
*src
)
438 src
->abs
= src
->negate
= false;
446 nir_alu_instr_create(nir_shader
*shader
, nir_op op
)
448 unsigned num_srcs
= nir_op_infos
[op
].num_inputs
;
449 nir_alu_instr
*instr
=
451 sizeof(nir_alu_instr
) + num_srcs
* sizeof(nir_alu_src
));
453 instr_init(&instr
->instr
, nir_instr_type_alu
);
455 alu_dest_init(&instr
->dest
);
456 for (unsigned i
= 0; i
< num_srcs
; i
++)
457 alu_src_init(&instr
->src
[i
]);
463 nir_jump_instr_create(nir_shader
*shader
, nir_jump_type type
)
465 nir_jump_instr
*instr
= ralloc(shader
, nir_jump_instr
);
466 instr_init(&instr
->instr
, nir_instr_type_jump
);
471 nir_load_const_instr
*
472 nir_load_const_instr_create(nir_shader
*shader
, unsigned num_components
)
474 nir_load_const_instr
*instr
= ralloc(shader
, nir_load_const_instr
);
475 instr_init(&instr
->instr
, nir_instr_type_load_const
);
477 nir_ssa_def_init(&instr
->instr
, &instr
->def
, num_components
, NULL
);
482 nir_intrinsic_instr
*
483 nir_intrinsic_instr_create(nir_shader
*shader
, nir_intrinsic_op op
)
485 unsigned num_srcs
= nir_intrinsic_infos
[op
].num_srcs
;
486 nir_intrinsic_instr
*instr
=
488 sizeof(nir_intrinsic_instr
) + num_srcs
* sizeof(nir_src
));
490 instr_init(&instr
->instr
, nir_instr_type_intrinsic
);
491 instr
->intrinsic
= op
;
493 if (nir_intrinsic_infos
[op
].has_dest
)
494 dest_init(&instr
->dest
);
496 for (unsigned i
= 0; i
< num_srcs
; i
++)
497 src_init(&instr
->src
[i
]);
503 nir_call_instr_create(nir_shader
*shader
, nir_function
*callee
)
505 nir_call_instr
*instr
= ralloc(shader
, nir_call_instr
);
506 instr_init(&instr
->instr
, nir_instr_type_call
);
508 instr
->callee
= callee
;
509 instr
->num_params
= callee
->num_params
;
510 instr
->params
= ralloc_array(instr
, nir_deref_var
*, instr
->num_params
);
511 instr
->return_deref
= NULL
;
517 nir_tex_instr_create(nir_shader
*shader
, unsigned num_srcs
)
519 nir_tex_instr
*instr
= rzalloc(shader
, nir_tex_instr
);
520 instr_init(&instr
->instr
, nir_instr_type_tex
);
522 dest_init(&instr
->dest
);
524 instr
->num_srcs
= num_srcs
;
525 instr
->src
= ralloc_array(instr
, nir_tex_src
, num_srcs
);
526 for (unsigned i
= 0; i
< num_srcs
; i
++)
527 src_init(&instr
->src
[i
].src
);
529 instr
->texture_index
= 0;
530 instr
->texture_array_size
= 0;
531 instr
->texture
= NULL
;
532 instr
->sampler_index
= 0;
533 instr
->sampler
= NULL
;
539 nir_phi_instr_create(nir_shader
*shader
)
541 nir_phi_instr
*instr
= ralloc(shader
, nir_phi_instr
);
542 instr_init(&instr
->instr
, nir_instr_type_phi
);
544 dest_init(&instr
->dest
);
545 exec_list_make_empty(&instr
->srcs
);
549 nir_parallel_copy_instr
*
550 nir_parallel_copy_instr_create(nir_shader
*shader
)
552 nir_parallel_copy_instr
*instr
= ralloc(shader
, nir_parallel_copy_instr
);
553 instr_init(&instr
->instr
, nir_instr_type_parallel_copy
);
555 exec_list_make_empty(&instr
->entries
);
560 nir_ssa_undef_instr
*
561 nir_ssa_undef_instr_create(nir_shader
*shader
, unsigned num_components
)
563 nir_ssa_undef_instr
*instr
= ralloc(shader
, nir_ssa_undef_instr
);
564 instr_init(&instr
->instr
, nir_instr_type_ssa_undef
);
566 nir_ssa_def_init(&instr
->instr
, &instr
->def
, num_components
, NULL
);
572 nir_deref_var_create(void *mem_ctx
, nir_variable
*var
)
574 nir_deref_var
*deref
= ralloc(mem_ctx
, nir_deref_var
);
575 deref
->deref
.deref_type
= nir_deref_type_var
;
576 deref
->deref
.child
= NULL
;
577 deref
->deref
.type
= var
->type
;
583 nir_deref_array_create(void *mem_ctx
)
585 nir_deref_array
*deref
= ralloc(mem_ctx
, nir_deref_array
);
586 deref
->deref
.deref_type
= nir_deref_type_array
;
587 deref
->deref
.child
= NULL
;
588 deref
->deref_array_type
= nir_deref_array_type_direct
;
589 src_init(&deref
->indirect
);
590 deref
->base_offset
= 0;
595 nir_deref_struct_create(void *mem_ctx
, unsigned field_index
)
597 nir_deref_struct
*deref
= ralloc(mem_ctx
, nir_deref_struct
);
598 deref
->deref
.deref_type
= nir_deref_type_struct
;
599 deref
->deref
.child
= NULL
;
600 deref
->index
= field_index
;
604 static nir_deref_var
*
605 copy_deref_var(void *mem_ctx
, nir_deref_var
*deref
)
607 nir_deref_var
*ret
= nir_deref_var_create(mem_ctx
, deref
->var
);
608 ret
->deref
.type
= deref
->deref
.type
;
609 if (deref
->deref
.child
)
610 ret
->deref
.child
= nir_copy_deref(ret
, deref
->deref
.child
);
614 static nir_deref_array
*
615 copy_deref_array(void *mem_ctx
, nir_deref_array
*deref
)
617 nir_deref_array
*ret
= nir_deref_array_create(mem_ctx
);
618 ret
->base_offset
= deref
->base_offset
;
619 ret
->deref_array_type
= deref
->deref_array_type
;
620 if (deref
->deref_array_type
== nir_deref_array_type_indirect
) {
621 nir_src_copy(&ret
->indirect
, &deref
->indirect
, mem_ctx
);
623 ret
->deref
.type
= deref
->deref
.type
;
624 if (deref
->deref
.child
)
625 ret
->deref
.child
= nir_copy_deref(ret
, deref
->deref
.child
);
629 static nir_deref_struct
*
630 copy_deref_struct(void *mem_ctx
, nir_deref_struct
*deref
)
632 nir_deref_struct
*ret
= nir_deref_struct_create(mem_ctx
, deref
->index
);
633 ret
->deref
.type
= deref
->deref
.type
;
634 if (deref
->deref
.child
)
635 ret
->deref
.child
= nir_copy_deref(ret
, deref
->deref
.child
);
640 nir_copy_deref(void *mem_ctx
, nir_deref
*deref
)
642 switch (deref
->deref_type
) {
643 case nir_deref_type_var
:
644 return ©_deref_var(mem_ctx
, nir_deref_as_var(deref
))->deref
;
645 case nir_deref_type_array
:
646 return ©_deref_array(mem_ctx
, nir_deref_as_array(deref
))->deref
;
647 case nir_deref_type_struct
:
648 return ©_deref_struct(mem_ctx
, nir_deref_as_struct(deref
))->deref
;
650 unreachable("Invalid dereference type");
656 /* Returns a load_const instruction that represents the constant
657 * initializer for the given deref chain. The caller is responsible for
658 * ensuring that there actually is a constant initializer.
660 nir_load_const_instr
*
661 nir_deref_get_const_initializer_load(nir_shader
*shader
, nir_deref_var
*deref
)
663 nir_constant
*constant
= deref
->var
->constant_initializer
;
666 const nir_deref
*tail
= &deref
->deref
;
667 unsigned matrix_offset
= 0;
668 while (tail
->child
) {
669 switch (tail
->child
->deref_type
) {
670 case nir_deref_type_array
: {
671 nir_deref_array
*arr
= nir_deref_as_array(tail
->child
);
672 assert(arr
->deref_array_type
== nir_deref_array_type_direct
);
673 if (glsl_type_is_matrix(tail
->type
)) {
674 assert(arr
->deref
.child
== NULL
);
675 matrix_offset
= arr
->base_offset
;
677 constant
= constant
->elements
[arr
->base_offset
];
682 case nir_deref_type_struct
: {
683 constant
= constant
->elements
[nir_deref_as_struct(tail
->child
)->index
];
688 unreachable("Invalid deref child type");
694 nir_load_const_instr
*load
=
695 nir_load_const_instr_create(shader
, glsl_get_vector_elements(tail
->type
));
697 matrix_offset
*= load
->def
.num_components
;
698 for (unsigned i
= 0; i
< load
->def
.num_components
; i
++) {
699 switch (glsl_get_base_type(tail
->type
)) {
700 case GLSL_TYPE_FLOAT
:
703 load
->value
.u
[i
] = constant
->value
.u
[matrix_offset
+ i
];
706 load
->value
.u
[i
] = constant
->value
.b
[matrix_offset
+ i
] ?
707 NIR_TRUE
: NIR_FALSE
;
710 unreachable("Invalid immediate type");
718 nir_cf_node_get_function(nir_cf_node
*node
)
720 while (node
->type
!= nir_cf_node_function
) {
724 return nir_cf_node_as_function(node
);
728 add_use_cb(nir_src
*src
, void *state
)
730 nir_instr
*instr
= state
;
732 src
->parent_instr
= instr
;
733 list_addtail(&src
->use_link
,
734 src
->is_ssa
? &src
->ssa
->uses
: &src
->reg
.reg
->uses
);
740 add_ssa_def_cb(nir_ssa_def
*def
, void *state
)
742 nir_instr
*instr
= state
;
744 if (instr
->block
&& def
->index
== UINT_MAX
) {
745 nir_function_impl
*impl
=
746 nir_cf_node_get_function(&instr
->block
->cf_node
);
748 def
->index
= impl
->ssa_alloc
++;
755 add_reg_def_cb(nir_dest
*dest
, void *state
)
757 nir_instr
*instr
= state
;
760 dest
->reg
.parent_instr
= instr
;
761 list_addtail(&dest
->reg
.def_link
, &dest
->reg
.reg
->defs
);
768 add_defs_uses(nir_instr
*instr
)
770 nir_foreach_src(instr
, add_use_cb
, instr
);
771 nir_foreach_dest(instr
, add_reg_def_cb
, instr
);
772 nir_foreach_ssa_def(instr
, add_ssa_def_cb
, instr
);
776 nir_instr_insert(nir_cursor cursor
, nir_instr
*instr
)
778 switch (cursor
.option
) {
779 case nir_cursor_before_block
:
780 /* Only allow inserting jumps into empty blocks. */
781 if (instr
->type
== nir_instr_type_jump
)
782 assert(exec_list_is_empty(&cursor
.block
->instr_list
));
784 instr
->block
= cursor
.block
;
785 add_defs_uses(instr
);
786 exec_list_push_head(&cursor
.block
->instr_list
, &instr
->node
);
788 case nir_cursor_after_block
: {
789 /* Inserting instructions after a jump is illegal. */
790 nir_instr
*last
= nir_block_last_instr(cursor
.block
);
791 assert(last
== NULL
|| last
->type
!= nir_instr_type_jump
);
794 instr
->block
= cursor
.block
;
795 add_defs_uses(instr
);
796 exec_list_push_tail(&cursor
.block
->instr_list
, &instr
->node
);
799 case nir_cursor_before_instr
:
800 assert(instr
->type
!= nir_instr_type_jump
);
801 instr
->block
= cursor
.instr
->block
;
802 add_defs_uses(instr
);
803 exec_node_insert_node_before(&cursor
.instr
->node
, &instr
->node
);
805 case nir_cursor_after_instr
:
806 /* Inserting instructions after a jump is illegal. */
807 assert(cursor
.instr
->type
!= nir_instr_type_jump
);
809 /* Only allow inserting jumps at the end of the block. */
810 if (instr
->type
== nir_instr_type_jump
)
811 assert(cursor
.instr
== nir_block_last_instr(cursor
.instr
->block
));
813 instr
->block
= cursor
.instr
->block
;
814 add_defs_uses(instr
);
815 exec_node_insert_after(&cursor
.instr
->node
, &instr
->node
);
819 if (instr
->type
== nir_instr_type_jump
)
820 nir_handle_add_jump(instr
->block
);
824 src_is_valid(const nir_src
*src
)
826 return src
->is_ssa
? (src
->ssa
!= NULL
) : (src
->reg
.reg
!= NULL
);
830 remove_use_cb(nir_src
*src
, void *state
)
832 if (src_is_valid(src
))
833 list_del(&src
->use_link
);
839 remove_def_cb(nir_dest
*dest
, void *state
)
842 list_del(&dest
->reg
.def_link
);
848 remove_defs_uses(nir_instr
*instr
)
850 nir_foreach_dest(instr
, remove_def_cb
, instr
);
851 nir_foreach_src(instr
, remove_use_cb
, instr
);
854 void nir_instr_remove(nir_instr
*instr
)
856 remove_defs_uses(instr
);
857 exec_node_remove(&instr
->node
);
859 if (instr
->type
== nir_instr_type_jump
) {
860 nir_jump_instr
*jump_instr
= nir_instr_as_jump(instr
);
861 nir_handle_remove_jump(instr
->block
, jump_instr
->type
);
868 nir_index_local_regs(nir_function_impl
*impl
)
871 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
872 reg
->index
= index
++;
874 impl
->reg_alloc
= index
;
878 nir_index_global_regs(nir_shader
*shader
)
881 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
882 reg
->index
= index
++;
884 shader
->reg_alloc
= index
;
888 visit_alu_dest(nir_alu_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
890 return cb(&instr
->dest
.dest
, state
);
894 visit_intrinsic_dest(nir_intrinsic_instr
*instr
, nir_foreach_dest_cb cb
,
897 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
)
898 return cb(&instr
->dest
, state
);
904 visit_texture_dest(nir_tex_instr
*instr
, nir_foreach_dest_cb cb
,
907 return cb(&instr
->dest
, state
);
911 visit_phi_dest(nir_phi_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
913 return cb(&instr
->dest
, state
);
917 visit_parallel_copy_dest(nir_parallel_copy_instr
*instr
,
918 nir_foreach_dest_cb cb
, void *state
)
920 nir_foreach_parallel_copy_entry(instr
, entry
) {
921 if (!cb(&entry
->dest
, state
))
929 nir_foreach_dest(nir_instr
*instr
, nir_foreach_dest_cb cb
, void *state
)
931 switch (instr
->type
) {
932 case nir_instr_type_alu
:
933 return visit_alu_dest(nir_instr_as_alu(instr
), cb
, state
);
934 case nir_instr_type_intrinsic
:
935 return visit_intrinsic_dest(nir_instr_as_intrinsic(instr
), cb
, state
);
936 case nir_instr_type_tex
:
937 return visit_texture_dest(nir_instr_as_tex(instr
), cb
, state
);
938 case nir_instr_type_phi
:
939 return visit_phi_dest(nir_instr_as_phi(instr
), cb
, state
);
940 case nir_instr_type_parallel_copy
:
941 return visit_parallel_copy_dest(nir_instr_as_parallel_copy(instr
),
944 case nir_instr_type_load_const
:
945 case nir_instr_type_ssa_undef
:
946 case nir_instr_type_call
:
947 case nir_instr_type_jump
:
951 unreachable("Invalid instruction type");
958 struct foreach_ssa_def_state
{
959 nir_foreach_ssa_def_cb cb
;
964 nir_ssa_def_visitor(nir_dest
*dest
, void *void_state
)
966 struct foreach_ssa_def_state
*state
= void_state
;
969 return state
->cb(&dest
->ssa
, state
->client_state
);
975 nir_foreach_ssa_def(nir_instr
*instr
, nir_foreach_ssa_def_cb cb
, void *state
)
977 switch (instr
->type
) {
978 case nir_instr_type_alu
:
979 case nir_instr_type_tex
:
980 case nir_instr_type_intrinsic
:
981 case nir_instr_type_phi
:
982 case nir_instr_type_parallel_copy
: {
983 struct foreach_ssa_def_state foreach_state
= {cb
, state
};
984 return nir_foreach_dest(instr
, nir_ssa_def_visitor
, &foreach_state
);
987 case nir_instr_type_load_const
:
988 return cb(&nir_instr_as_load_const(instr
)->def
, state
);
989 case nir_instr_type_ssa_undef
:
990 return cb(&nir_instr_as_ssa_undef(instr
)->def
, state
);
991 case nir_instr_type_call
:
992 case nir_instr_type_jump
:
995 unreachable("Invalid instruction type");
1000 visit_src(nir_src
*src
, nir_foreach_src_cb cb
, void *state
)
1002 if (!cb(src
, state
))
1004 if (!src
->is_ssa
&& src
->reg
.indirect
)
1005 return cb(src
->reg
.indirect
, state
);
1010 visit_deref_array_src(nir_deref_array
*deref
, nir_foreach_src_cb cb
,
1013 if (deref
->deref_array_type
== nir_deref_array_type_indirect
)
1014 return visit_src(&deref
->indirect
, cb
, state
);
1019 visit_deref_src(nir_deref_var
*deref
, nir_foreach_src_cb cb
, void *state
)
1021 nir_deref
*cur
= &deref
->deref
;
1022 while (cur
!= NULL
) {
1023 if (cur
->deref_type
== nir_deref_type_array
) {
1024 if (!visit_deref_array_src(nir_deref_as_array(cur
), cb
, state
))
1035 visit_alu_src(nir_alu_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1037 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++)
1038 if (!visit_src(&instr
->src
[i
].src
, cb
, state
))
1045 visit_tex_src(nir_tex_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1047 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++) {
1048 if (!visit_src(&instr
->src
[i
].src
, cb
, state
))
1052 if (instr
->texture
!= NULL
) {
1053 if (!visit_deref_src(instr
->texture
, cb
, state
))
1057 if (instr
->sampler
!= NULL
) {
1058 if (!visit_deref_src(instr
->sampler
, cb
, state
))
1066 visit_intrinsic_src(nir_intrinsic_instr
*instr
, nir_foreach_src_cb cb
,
1069 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
1070 for (unsigned i
= 0; i
< num_srcs
; i
++) {
1071 if (!visit_src(&instr
->src
[i
], cb
, state
))
1076 nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
1077 for (unsigned i
= 0; i
< num_vars
; i
++) {
1078 if (!visit_deref_src(instr
->variables
[i
], cb
, state
))
1086 visit_call_src(nir_call_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1092 visit_load_const_src(nir_load_const_instr
*instr
, nir_foreach_src_cb cb
,
1099 visit_phi_src(nir_phi_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1101 nir_foreach_phi_src(instr
, src
) {
1102 if (!visit_src(&src
->src
, cb
, state
))
1110 visit_parallel_copy_src(nir_parallel_copy_instr
*instr
,
1111 nir_foreach_src_cb cb
, void *state
)
1113 nir_foreach_parallel_copy_entry(instr
, entry
) {
1114 if (!visit_src(&entry
->src
, cb
, state
))
1123 nir_foreach_src_cb cb
;
1124 } visit_dest_indirect_state
;
1127 visit_dest_indirect(nir_dest
*dest
, void *_state
)
1129 visit_dest_indirect_state
*state
= (visit_dest_indirect_state
*) _state
;
1131 if (!dest
->is_ssa
&& dest
->reg
.indirect
)
1132 return state
->cb(dest
->reg
.indirect
, state
->state
);
1138 nir_foreach_src(nir_instr
*instr
, nir_foreach_src_cb cb
, void *state
)
1140 switch (instr
->type
) {
1141 case nir_instr_type_alu
:
1142 if (!visit_alu_src(nir_instr_as_alu(instr
), cb
, state
))
1145 case nir_instr_type_intrinsic
:
1146 if (!visit_intrinsic_src(nir_instr_as_intrinsic(instr
), cb
, state
))
1149 case nir_instr_type_tex
:
1150 if (!visit_tex_src(nir_instr_as_tex(instr
), cb
, state
))
1153 case nir_instr_type_call
:
1154 if (!visit_call_src(nir_instr_as_call(instr
), cb
, state
))
1157 case nir_instr_type_load_const
:
1158 if (!visit_load_const_src(nir_instr_as_load_const(instr
), cb
, state
))
1161 case nir_instr_type_phi
:
1162 if (!visit_phi_src(nir_instr_as_phi(instr
), cb
, state
))
1165 case nir_instr_type_parallel_copy
:
1166 if (!visit_parallel_copy_src(nir_instr_as_parallel_copy(instr
),
1170 case nir_instr_type_jump
:
1171 case nir_instr_type_ssa_undef
:
1175 unreachable("Invalid instruction type");
1179 visit_dest_indirect_state dest_state
;
1180 dest_state
.state
= state
;
1182 return nir_foreach_dest(instr
, visit_dest_indirect
, &dest_state
);
1186 nir_src_as_const_value(nir_src src
)
1191 if (src
.ssa
->parent_instr
->type
!= nir_instr_type_load_const
)
1194 nir_load_const_instr
*load
= nir_instr_as_load_const(src
.ssa
->parent_instr
);
1196 return &load
->value
;
1200 * Returns true if the source is known to be dynamically uniform. Otherwise it
1201 * returns false which means it may or may not be dynamically uniform but it
1202 * can't be determined.
1205 nir_src_is_dynamically_uniform(nir_src src
)
1210 /* Constants are trivially dynamically uniform */
1211 if (src
.ssa
->parent_instr
->type
== nir_instr_type_load_const
)
1214 /* As are uniform variables */
1215 if (src
.ssa
->parent_instr
->type
== nir_instr_type_intrinsic
) {
1216 nir_intrinsic_instr
*intr
= nir_instr_as_intrinsic(src
.ssa
->parent_instr
);
1218 if (intr
->intrinsic
== nir_intrinsic_load_uniform
)
1222 /* XXX: this could have many more tests, such as when a sampler function is
1223 * called with dynamically uniform arguments.
1229 src_remove_all_uses(nir_src
*src
)
1231 for (; src
; src
= src
->is_ssa
? NULL
: src
->reg
.indirect
) {
1232 if (!src_is_valid(src
))
1235 list_del(&src
->use_link
);
1240 src_add_all_uses(nir_src
*src
, nir_instr
*parent_instr
, nir_if
*parent_if
)
1242 for (; src
; src
= src
->is_ssa
? NULL
: src
->reg
.indirect
) {
1243 if (!src_is_valid(src
))
1247 src
->parent_instr
= parent_instr
;
1249 list_addtail(&src
->use_link
, &src
->ssa
->uses
);
1251 list_addtail(&src
->use_link
, &src
->reg
.reg
->uses
);
1254 src
->parent_if
= parent_if
;
1256 list_addtail(&src
->use_link
, &src
->ssa
->if_uses
);
1258 list_addtail(&src
->use_link
, &src
->reg
.reg
->if_uses
);
1264 nir_instr_rewrite_src(nir_instr
*instr
, nir_src
*src
, nir_src new_src
)
1266 assert(!src_is_valid(src
) || src
->parent_instr
== instr
);
1268 src_remove_all_uses(src
);
1270 src_add_all_uses(src
, instr
, NULL
);
1274 nir_instr_move_src(nir_instr
*dest_instr
, nir_src
*dest
, nir_src
*src
)
1276 assert(!src_is_valid(dest
) || dest
->parent_instr
== dest_instr
);
1278 src_remove_all_uses(dest
);
1279 src_remove_all_uses(src
);
1281 *src
= NIR_SRC_INIT
;
1282 src_add_all_uses(dest
, dest_instr
, NULL
);
1286 nir_if_rewrite_condition(nir_if
*if_stmt
, nir_src new_src
)
1288 nir_src
*src
= &if_stmt
->condition
;
1289 assert(!src_is_valid(src
) || src
->parent_if
== if_stmt
);
1291 src_remove_all_uses(src
);
1293 src_add_all_uses(src
, NULL
, if_stmt
);
1297 nir_instr_rewrite_dest(nir_instr
*instr
, nir_dest
*dest
, nir_dest new_dest
)
1300 /* We can only overwrite an SSA destination if it has no uses. */
1301 assert(list_empty(&dest
->ssa
.uses
) && list_empty(&dest
->ssa
.if_uses
));
1303 list_del(&dest
->reg
.def_link
);
1304 if (dest
->reg
.indirect
)
1305 src_remove_all_uses(dest
->reg
.indirect
);
1308 /* We can't re-write with an SSA def */
1309 assert(!new_dest
.is_ssa
);
1311 nir_dest_copy(dest
, &new_dest
, instr
);
1313 dest
->reg
.parent_instr
= instr
;
1314 list_addtail(&dest
->reg
.def_link
, &new_dest
.reg
.reg
->defs
);
1316 if (dest
->reg
.indirect
)
1317 src_add_all_uses(dest
->reg
.indirect
, instr
, NULL
);
1321 nir_ssa_def_init(nir_instr
*instr
, nir_ssa_def
*def
,
1322 unsigned num_components
, const char *name
)
1325 def
->parent_instr
= instr
;
1326 list_inithead(&def
->uses
);
1327 list_inithead(&def
->if_uses
);
1328 def
->num_components
= num_components
;
1329 def
->bit_size
= 32; /* FIXME: Add an input paremeter or guess? */
1332 nir_function_impl
*impl
=
1333 nir_cf_node_get_function(&instr
->block
->cf_node
);
1335 def
->index
= impl
->ssa_alloc
++;
1337 def
->index
= UINT_MAX
;
1342 nir_ssa_dest_init(nir_instr
*instr
, nir_dest
*dest
,
1343 unsigned num_components
, const char *name
)
1345 dest
->is_ssa
= true;
1346 nir_ssa_def_init(instr
, &dest
->ssa
, num_components
, name
);
1350 nir_ssa_def_rewrite_uses(nir_ssa_def
*def
, nir_src new_src
)
1352 assert(!new_src
.is_ssa
|| def
!= new_src
.ssa
);
1354 nir_foreach_use_safe(def
, use_src
)
1355 nir_instr_rewrite_src(use_src
->parent_instr
, use_src
, new_src
);
1357 nir_foreach_if_use_safe(def
, use_src
)
1358 nir_if_rewrite_condition(use_src
->parent_if
, new_src
);
1362 is_instr_between(nir_instr
*start
, nir_instr
*end
, nir_instr
*between
)
1364 assert(start
->block
== end
->block
);
1366 if (between
->block
!= start
->block
)
1369 /* Search backwards looking for "between" */
1370 while (start
!= end
) {
1374 end
= nir_instr_prev(end
);
1381 /* Replaces all uses of the given SSA def with the given source but only if
1382 * the use comes after the after_me instruction. This can be useful if you
1383 * are emitting code to fix up the result of some instruction: you can freely
1384 * use the result in that code and then call rewrite_uses_after and pass the
1385 * last fixup instruction as after_me and it will replace all of the uses you
1386 * want without touching the fixup code.
1388 * This function assumes that after_me is in the same block as
1389 * def->parent_instr and that after_me comes after def->parent_instr.
1392 nir_ssa_def_rewrite_uses_after(nir_ssa_def
*def
, nir_src new_src
,
1393 nir_instr
*after_me
)
1395 assert(!new_src
.is_ssa
|| def
!= new_src
.ssa
);
1397 nir_foreach_use_safe(def
, use_src
) {
1398 assert(use_src
->parent_instr
!= def
->parent_instr
);
1399 /* Since def already dominates all of its uses, the only way a use can
1400 * not be dominated by after_me is if it is between def and after_me in
1401 * the instruction list.
1403 if (!is_instr_between(def
->parent_instr
, after_me
, use_src
->parent_instr
))
1404 nir_instr_rewrite_src(use_src
->parent_instr
, use_src
, new_src
);
1407 nir_foreach_if_use_safe(def
, use_src
)
1408 nir_if_rewrite_condition(use_src
->parent_if
, new_src
);
1411 static bool foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1412 bool reverse
, void *state
);
1415 foreach_if(nir_if
*if_stmt
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1418 foreach_list_typed_reverse_safe(nir_cf_node
, node
, node
,
1419 &if_stmt
->else_list
) {
1420 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1424 foreach_list_typed_reverse_safe(nir_cf_node
, node
, node
,
1425 &if_stmt
->then_list
) {
1426 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1430 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->then_list
) {
1431 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1435 foreach_list_typed_safe(nir_cf_node
, node
, node
, &if_stmt
->else_list
) {
1436 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1445 foreach_loop(nir_loop
*loop
, nir_foreach_block_cb cb
, bool reverse
, void *state
)
1448 foreach_list_typed_reverse_safe(nir_cf_node
, node
, node
, &loop
->body
) {
1449 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1453 foreach_list_typed_safe(nir_cf_node
, node
, node
, &loop
->body
) {
1454 if (!foreach_cf_node(node
, cb
, reverse
, state
))
1463 foreach_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1464 bool reverse
, void *state
)
1466 switch (node
->type
) {
1467 case nir_cf_node_block
:
1468 return cb(nir_cf_node_as_block(node
), state
);
1469 case nir_cf_node_if
:
1470 return foreach_if(nir_cf_node_as_if(node
), cb
, reverse
, state
);
1471 case nir_cf_node_loop
:
1472 return foreach_loop(nir_cf_node_as_loop(node
), cb
, reverse
, state
);
1476 unreachable("Invalid CFG node type");
1484 nir_foreach_block_in_cf_node(nir_cf_node
*node
, nir_foreach_block_cb cb
,
1487 return foreach_cf_node(node
, cb
, false, state
);
1491 nir_foreach_block(nir_function_impl
*impl
, nir_foreach_block_cb cb
, void *state
)
1493 foreach_list_typed_safe(nir_cf_node
, node
, node
, &impl
->body
) {
1494 if (!foreach_cf_node(node
, cb
, false, state
))
1498 return cb(impl
->end_block
, state
);
1502 nir_foreach_block_reverse(nir_function_impl
*impl
, nir_foreach_block_cb cb
,
1505 if (!cb(impl
->end_block
, state
))
1508 foreach_list_typed_reverse_safe(nir_cf_node
, node
, node
, &impl
->body
) {
1509 if (!foreach_cf_node(node
, cb
, true, state
))
1517 nir_block_get_following_if(nir_block
*block
)
1519 if (exec_node_is_tail_sentinel(&block
->cf_node
.node
))
1522 if (nir_cf_node_is_last(&block
->cf_node
))
1525 nir_cf_node
*next_node
= nir_cf_node_next(&block
->cf_node
);
1527 if (next_node
->type
!= nir_cf_node_if
)
1530 return nir_cf_node_as_if(next_node
);
1534 nir_block_get_following_loop(nir_block
*block
)
1536 if (exec_node_is_tail_sentinel(&block
->cf_node
.node
))
1539 if (nir_cf_node_is_last(&block
->cf_node
))
1542 nir_cf_node
*next_node
= nir_cf_node_next(&block
->cf_node
);
1544 if (next_node
->type
!= nir_cf_node_loop
)
1547 return nir_cf_node_as_loop(next_node
);
1550 index_block(nir_block
*block
, void *state
)
1552 unsigned *index
= state
;
1553 block
->index
= (*index
)++;
1558 nir_index_blocks(nir_function_impl
*impl
)
1562 if (impl
->valid_metadata
& nir_metadata_block_index
)
1565 nir_foreach_block(impl
, index_block
, &index
);
1567 impl
->num_blocks
= index
;
1571 index_ssa_def_cb(nir_ssa_def
*def
, void *state
)
1573 unsigned *index
= (unsigned *) state
;
1574 def
->index
= (*index
)++;
1580 index_ssa_block(nir_block
*block
, void *state
)
1582 nir_foreach_instr(block
, instr
)
1583 nir_foreach_ssa_def(instr
, index_ssa_def_cb
, state
);
1589 * The indices are applied top-to-bottom which has the very nice property
1590 * that, if A dominates B, then A->index <= B->index.
1593 nir_index_ssa_defs(nir_function_impl
*impl
)
1596 nir_foreach_block(impl
, index_ssa_block
, &index
);
1597 impl
->ssa_alloc
= index
;
1601 index_instrs_block(nir_block
*block
, void *state
)
1603 unsigned *index
= state
;
1604 nir_foreach_instr(block
, instr
)
1605 instr
->index
= (*index
)++;
1611 * The indices are applied top-to-bottom which has the very nice property
1612 * that, if A dominates B, then A->index <= B->index.
1615 nir_index_instrs(nir_function_impl
*impl
)
1618 nir_foreach_block(impl
, index_instrs_block
, &index
);
1623 nir_intrinsic_from_system_value(gl_system_value val
)
1626 case SYSTEM_VALUE_VERTEX_ID
:
1627 return nir_intrinsic_load_vertex_id
;
1628 case SYSTEM_VALUE_INSTANCE_ID
:
1629 return nir_intrinsic_load_instance_id
;
1630 case SYSTEM_VALUE_DRAW_ID
:
1631 return nir_intrinsic_load_draw_id
;
1632 case SYSTEM_VALUE_BASE_INSTANCE
:
1633 return nir_intrinsic_load_base_instance
;
1634 case SYSTEM_VALUE_VERTEX_ID_ZERO_BASE
:
1635 return nir_intrinsic_load_vertex_id_zero_base
;
1636 case SYSTEM_VALUE_BASE_VERTEX
:
1637 return nir_intrinsic_load_base_vertex
;
1638 case SYSTEM_VALUE_INVOCATION_ID
:
1639 return nir_intrinsic_load_invocation_id
;
1640 case SYSTEM_VALUE_FRONT_FACE
:
1641 return nir_intrinsic_load_front_face
;
1642 case SYSTEM_VALUE_SAMPLE_ID
:
1643 return nir_intrinsic_load_sample_id
;
1644 case SYSTEM_VALUE_SAMPLE_POS
:
1645 return nir_intrinsic_load_sample_pos
;
1646 case SYSTEM_VALUE_SAMPLE_MASK_IN
:
1647 return nir_intrinsic_load_sample_mask_in
;
1648 case SYSTEM_VALUE_LOCAL_INVOCATION_ID
:
1649 return nir_intrinsic_load_local_invocation_id
;
1650 case SYSTEM_VALUE_WORK_GROUP_ID
:
1651 return nir_intrinsic_load_work_group_id
;
1652 case SYSTEM_VALUE_NUM_WORK_GROUPS
:
1653 return nir_intrinsic_load_num_work_groups
;
1654 case SYSTEM_VALUE_PRIMITIVE_ID
:
1655 return nir_intrinsic_load_primitive_id
;
1656 case SYSTEM_VALUE_TESS_COORD
:
1657 return nir_intrinsic_load_tess_coord
;
1658 case SYSTEM_VALUE_TESS_LEVEL_OUTER
:
1659 return nir_intrinsic_load_tess_level_outer
;
1660 case SYSTEM_VALUE_TESS_LEVEL_INNER
:
1661 return nir_intrinsic_load_tess_level_inner
;
1662 case SYSTEM_VALUE_VERTICES_IN
:
1663 return nir_intrinsic_load_patch_vertices_in
;
1664 case SYSTEM_VALUE_HELPER_INVOCATION
:
1665 return nir_intrinsic_load_helper_invocation
;
1667 unreachable("system value does not directly correspond to intrinsic");
1672 nir_system_value_from_intrinsic(nir_intrinsic_op intrin
)
1675 case nir_intrinsic_load_vertex_id
:
1676 return SYSTEM_VALUE_VERTEX_ID
;
1677 case nir_intrinsic_load_instance_id
:
1678 return SYSTEM_VALUE_INSTANCE_ID
;
1679 case nir_intrinsic_load_draw_id
:
1680 return SYSTEM_VALUE_DRAW_ID
;
1681 case nir_intrinsic_load_base_instance
:
1682 return SYSTEM_VALUE_BASE_INSTANCE
;
1683 case nir_intrinsic_load_vertex_id_zero_base
:
1684 return SYSTEM_VALUE_VERTEX_ID_ZERO_BASE
;
1685 case nir_intrinsic_load_base_vertex
:
1686 return SYSTEM_VALUE_BASE_VERTEX
;
1687 case nir_intrinsic_load_invocation_id
:
1688 return SYSTEM_VALUE_INVOCATION_ID
;
1689 case nir_intrinsic_load_front_face
:
1690 return SYSTEM_VALUE_FRONT_FACE
;
1691 case nir_intrinsic_load_sample_id
:
1692 return SYSTEM_VALUE_SAMPLE_ID
;
1693 case nir_intrinsic_load_sample_pos
:
1694 return SYSTEM_VALUE_SAMPLE_POS
;
1695 case nir_intrinsic_load_sample_mask_in
:
1696 return SYSTEM_VALUE_SAMPLE_MASK_IN
;
1697 case nir_intrinsic_load_local_invocation_id
:
1698 return SYSTEM_VALUE_LOCAL_INVOCATION_ID
;
1699 case nir_intrinsic_load_num_work_groups
:
1700 return SYSTEM_VALUE_NUM_WORK_GROUPS
;
1701 case nir_intrinsic_load_work_group_id
:
1702 return SYSTEM_VALUE_WORK_GROUP_ID
;
1703 case nir_intrinsic_load_primitive_id
:
1704 return SYSTEM_VALUE_PRIMITIVE_ID
;
1705 case nir_intrinsic_load_tess_coord
:
1706 return SYSTEM_VALUE_TESS_COORD
;
1707 case nir_intrinsic_load_tess_level_outer
:
1708 return SYSTEM_VALUE_TESS_LEVEL_OUTER
;
1709 case nir_intrinsic_load_tess_level_inner
:
1710 return SYSTEM_VALUE_TESS_LEVEL_INNER
;
1711 case nir_intrinsic_load_patch_vertices_in
:
1712 return SYSTEM_VALUE_VERTICES_IN
;
1713 case nir_intrinsic_load_helper_invocation
:
1714 return SYSTEM_VALUE_HELPER_INVOCATION
;
1716 unreachable("intrinsic doesn't produce a system value");