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 * This file checks for invalid IR indicating a bug somewhere in the compiler.
35 /* Since this file is just a pile of asserts, don't bother compiling it if
36 * we're not building a debug build.
41 * Per-register validation state.
46 * equivalent to the uses and defs in nir_register, but built up by the
47 * validator. At the end, we verify that the sets have the same entries.
49 struct set
*uses
, *if_uses
, *defs
;
50 nir_function_impl
*where_defined
; /* NULL for global registers */
55 * equivalent to the uses in nir_ssa_def, but built up by the validator.
56 * At the end, we verify that the sets have the same entries.
58 struct set
*uses
, *if_uses
;
59 nir_function_impl
*where_defined
;
60 } ssa_def_validate_state
;
63 /* map of register -> validation state (struct above) */
64 struct hash_table
*regs
;
66 /* the current shader being validated */
69 /* the current instruction being validated */
72 /* the current basic block being validated */
75 /* the current if statement being validated */
78 /* the current loop being visited */
81 /* the parent of the current cf node being visited */
82 nir_cf_node
*parent_node
;
84 /* the current function implementation being validated */
85 nir_function_impl
*impl
;
87 /* map of SSA value -> function implementation where it is defined */
88 struct hash_table
*ssa_defs
;
90 /* bitset of ssa definitions we have found; used to check uniqueness */
91 BITSET_WORD
*ssa_defs_found
;
93 /* bitset of registers we have currently found; used to check uniqueness */
94 BITSET_WORD
*regs_found
;
96 /* map of local variable -> function implementation where it is defined */
97 struct hash_table
*var_defs
;
100 static void validate_src(nir_src
*src
, validate_state
*state
);
103 validate_reg_src(nir_src
*src
, validate_state
*state
)
105 assert(src
->reg
.reg
!= NULL
);
107 struct hash_entry
*entry
;
108 entry
= _mesa_hash_table_search(state
->regs
, src
->reg
.reg
);
111 reg_validate_state
*reg_state
= (reg_validate_state
*) entry
->data
;
114 _mesa_set_add(reg_state
->uses
, src
);
116 assert(state
->if_stmt
);
117 _mesa_set_add(reg_state
->if_uses
, src
);
120 if (!src
->reg
.reg
->is_global
) {
121 assert(reg_state
->where_defined
== state
->impl
&&
122 "using a register declared in a different function");
125 assert((src
->reg
.reg
->num_array_elems
== 0 ||
126 src
->reg
.base_offset
< src
->reg
.reg
->num_array_elems
) &&
127 "definitely out-of-bounds array access");
129 if (src
->reg
.indirect
) {
130 assert(src
->reg
.reg
->num_array_elems
!= 0);
131 assert((src
->reg
.indirect
->is_ssa
||
132 src
->reg
.indirect
->reg
.indirect
== NULL
) &&
133 "only one level of indirection allowed");
134 validate_src(src
->reg
.indirect
, state
);
139 validate_ssa_src(nir_src
*src
, validate_state
*state
)
141 assert(src
->ssa
!= NULL
);
143 struct hash_entry
*entry
= _mesa_hash_table_search(state
->ssa_defs
, src
->ssa
);
147 ssa_def_validate_state
*def_state
= (ssa_def_validate_state
*)entry
->data
;
149 assert(def_state
->where_defined
== state
->impl
&&
150 "using an SSA value defined in a different function");
153 _mesa_set_add(def_state
->uses
, src
);
155 assert(state
->if_stmt
);
156 _mesa_set_add(def_state
->if_uses
, src
);
159 /* TODO validate that the use is dominated by the definition */
163 validate_src(nir_src
*src
, validate_state
*state
)
166 assert(src
->parent_instr
== state
->instr
);
168 assert(src
->parent_if
== state
->if_stmt
);
171 validate_ssa_src(src
, state
);
173 validate_reg_src(src
, state
);
177 validate_alu_src(nir_alu_instr
*instr
, unsigned index
, validate_state
*state
)
179 nir_alu_src
*src
= &instr
->src
[index
];
181 unsigned num_components
;
182 unsigned src_bit_size
;
183 if (src
->src
.is_ssa
) {
184 src_bit_size
= src
->src
.ssa
->bit_size
;
185 num_components
= src
->src
.ssa
->num_components
;
187 src_bit_size
= src
->src
.reg
.reg
->bit_size
;
188 if (src
->src
.reg
.reg
->is_packed
)
189 num_components
= 4; /* can't check anything */
191 num_components
= src
->src
.reg
.reg
->num_components
;
193 for (unsigned i
= 0; i
< 4; i
++) {
194 assert(src
->swizzle
[i
] < 4);
196 if (nir_alu_instr_channel_used(instr
, index
, i
))
197 assert(src
->swizzle
[i
] < num_components
);
200 nir_alu_type src_type
= nir_op_infos
[instr
->op
].input_types
[index
];
202 /* 8-bit float isn't a thing */
203 if (nir_alu_type_get_base_type(src_type
) == nir_type_float
)
204 assert(src_bit_size
== 16 || src_bit_size
== 32 || src_bit_size
== 64);
206 if (nir_alu_type_get_type_size(src_type
)) {
207 /* This source has an explicit bit size */
208 assert(nir_alu_type_get_type_size(src_type
) == src_bit_size
);
210 if (!nir_alu_type_get_type_size(nir_op_infos
[instr
->op
].output_type
)) {
211 unsigned dest_bit_size
=
212 instr
->dest
.dest
.is_ssa
? instr
->dest
.dest
.ssa
.bit_size
213 : instr
->dest
.dest
.reg
.reg
->bit_size
;
214 assert(dest_bit_size
== src_bit_size
);
218 validate_src(&src
->src
, state
);
222 validate_reg_dest(nir_reg_dest
*dest
, validate_state
*state
)
224 assert(dest
->reg
!= NULL
);
226 assert(dest
->parent_instr
== state
->instr
);
228 struct hash_entry
*entry2
;
229 entry2
= _mesa_hash_table_search(state
->regs
, dest
->reg
);
233 reg_validate_state
*reg_state
= (reg_validate_state
*) entry2
->data
;
234 _mesa_set_add(reg_state
->defs
, dest
);
236 if (!dest
->reg
->is_global
) {
237 assert(reg_state
->where_defined
== state
->impl
&&
238 "writing to a register declared in a different function");
241 assert((dest
->reg
->num_array_elems
== 0 ||
242 dest
->base_offset
< dest
->reg
->num_array_elems
) &&
243 "definitely out-of-bounds array access");
245 if (dest
->indirect
) {
246 assert(dest
->reg
->num_array_elems
!= 0);
247 assert((dest
->indirect
->is_ssa
|| dest
->indirect
->reg
.indirect
== NULL
) &&
248 "only one level of indirection allowed");
249 validate_src(dest
->indirect
, state
);
254 validate_ssa_def(nir_ssa_def
*def
, validate_state
*state
)
256 assert(def
->index
< state
->impl
->ssa_alloc
);
257 assert(!BITSET_TEST(state
->ssa_defs_found
, def
->index
));
258 BITSET_SET(state
->ssa_defs_found
, def
->index
);
260 assert(def
->parent_instr
== state
->instr
);
262 assert(def
->num_components
<= 4);
264 list_validate(&def
->uses
);
265 list_validate(&def
->if_uses
);
267 ssa_def_validate_state
*def_state
= ralloc(state
->ssa_defs
,
268 ssa_def_validate_state
);
269 def_state
->where_defined
= state
->impl
;
270 def_state
->uses
= _mesa_set_create(def_state
, _mesa_hash_pointer
,
271 _mesa_key_pointer_equal
);
272 def_state
->if_uses
= _mesa_set_create(def_state
, _mesa_hash_pointer
,
273 _mesa_key_pointer_equal
);
274 _mesa_hash_table_insert(state
->ssa_defs
, def
, def_state
);
278 validate_dest(nir_dest
*dest
, validate_state
*state
)
281 validate_ssa_def(&dest
->ssa
, state
);
283 validate_reg_dest(&dest
->reg
, state
);
287 validate_alu_dest(nir_alu_instr
*instr
, validate_state
*state
)
289 nir_alu_dest
*dest
= &instr
->dest
;
292 dest
->dest
.is_ssa
? dest
->dest
.ssa
.num_components
293 : dest
->dest
.reg
.reg
->num_components
;
294 bool is_packed
= !dest
->dest
.is_ssa
&& dest
->dest
.reg
.reg
->is_packed
;
296 * validate that the instruction doesn't write to components not in the
299 assert(is_packed
|| !(dest
->write_mask
& ~((1 << dest_size
) - 1)));
301 /* validate that saturate is only ever used on instructions with
302 * destinations of type float
304 nir_alu_instr
*alu
= nir_instr_as_alu(state
->instr
);
305 assert(nir_op_infos
[alu
->op
].output_type
== nir_type_float
||
308 unsigned bit_size
= dest
->dest
.is_ssa
? dest
->dest
.ssa
.bit_size
309 : dest
->dest
.reg
.reg
->bit_size
;
310 nir_alu_type type
= nir_op_infos
[instr
->op
].output_type
;
312 /* 8-bit float isn't a thing */
313 if (nir_alu_type_get_base_type(type
) == nir_type_float
)
314 assert(bit_size
== 16 || bit_size
== 32 || bit_size
== 64);
316 assert(nir_alu_type_get_type_size(type
) == 0 ||
317 nir_alu_type_get_type_size(type
) == bit_size
);
319 validate_dest(&dest
->dest
, state
);
323 validate_alu_instr(nir_alu_instr
*instr
, validate_state
*state
)
325 assert(instr
->op
< nir_num_opcodes
);
327 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++) {
328 validate_alu_src(instr
, i
, state
);
331 validate_alu_dest(instr
, state
);
335 validate_deref_chain(nir_deref
*deref
, validate_state
*state
)
337 assert(deref
->child
== NULL
|| ralloc_parent(deref
->child
) == deref
);
339 nir_deref
*parent
= NULL
;
340 while (deref
!= NULL
) {
341 switch (deref
->deref_type
) {
342 case nir_deref_type_array
:
343 assert(deref
->type
== glsl_get_array_element(parent
->type
));
344 if (nir_deref_as_array(deref
)->deref_array_type
==
345 nir_deref_array_type_indirect
)
346 validate_src(&nir_deref_as_array(deref
)->indirect
, state
);
349 case nir_deref_type_struct
:
350 assert(deref
->type
==
351 glsl_get_struct_field(parent
->type
,
352 nir_deref_as_struct(deref
)->index
));
355 case nir_deref_type_var
:
359 assert(!"Invalid deref type");
364 deref
= deref
->child
;
369 validate_var_use(nir_variable
*var
, validate_state
*state
)
371 if (var
->data
.mode
== nir_var_local
) {
372 struct hash_entry
*entry
= _mesa_hash_table_search(state
->var_defs
, var
);
375 assert((nir_function_impl
*) entry
->data
== state
->impl
);
380 validate_deref_var(void *parent_mem_ctx
, nir_deref_var
*deref
, validate_state
*state
)
382 assert(deref
!= NULL
);
383 assert(ralloc_parent(deref
) == parent_mem_ctx
);
384 assert(deref
->deref
.type
== deref
->var
->type
);
386 validate_var_use(deref
->var
, state
);
388 validate_deref_chain(&deref
->deref
, state
);
392 validate_intrinsic_instr(nir_intrinsic_instr
*instr
, validate_state
*state
)
394 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
395 for (unsigned i
= 0; i
< num_srcs
; i
++) {
396 unsigned components_read
=
397 nir_intrinsic_infos
[instr
->intrinsic
].src_components
[i
];
398 if (components_read
== 0)
399 components_read
= instr
->num_components
;
401 assert(components_read
> 0);
403 if (instr
->src
[i
].is_ssa
) {
404 assert(components_read
<= instr
->src
[i
].ssa
->num_components
);
405 } else if (!instr
->src
[i
].reg
.reg
->is_packed
) {
406 assert(components_read
<= instr
->src
[i
].reg
.reg
->num_components
);
409 validate_src(&instr
->src
[i
], state
);
412 unsigned num_vars
= nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
413 for (unsigned i
= 0; i
< num_vars
; i
++) {
414 validate_deref_var(instr
, instr
->variables
[i
], state
);
417 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
) {
418 unsigned components_written
=
419 nir_intrinsic_infos
[instr
->intrinsic
].dest_components
;
420 if (components_written
== 0)
421 components_written
= instr
->num_components
;
423 assert(components_written
> 0);
425 if (instr
->dest
.is_ssa
) {
426 assert(components_written
<= instr
->dest
.ssa
.num_components
);
427 } else if (!instr
->dest
.reg
.reg
->is_packed
) {
428 assert(components_written
<= instr
->dest
.reg
.reg
->num_components
);
431 validate_dest(&instr
->dest
, state
);
434 switch (instr
->intrinsic
) {
435 case nir_intrinsic_load_var
: {
436 const struct glsl_type
*type
=
437 nir_deref_tail(&instr
->variables
[0]->deref
)->type
;
438 assert(glsl_type_is_vector_or_scalar(type
) ||
439 (instr
->variables
[0]->var
->data
.mode
== nir_var_uniform
&&
440 glsl_get_base_type(type
) == GLSL_TYPE_SUBROUTINE
));
441 assert(instr
->num_components
== glsl_get_vector_elements(type
));
444 case nir_intrinsic_store_var
: {
445 const struct glsl_type
*type
=
446 nir_deref_tail(&instr
->variables
[0]->deref
)->type
;
447 assert(glsl_type_is_vector_or_scalar(type
) ||
448 (instr
->variables
[0]->var
->data
.mode
== nir_var_uniform
&&
449 glsl_get_base_type(type
) == GLSL_TYPE_SUBROUTINE
));
450 assert(instr
->num_components
== glsl_get_vector_elements(type
));
451 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
452 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
&&
453 instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_storage
);
454 assert((nir_intrinsic_write_mask(instr
) & ~((1 << instr
->num_components
) - 1)) == 0);
457 case nir_intrinsic_copy_var
:
458 assert(nir_deref_tail(&instr
->variables
[0]->deref
)->type
==
459 nir_deref_tail(&instr
->variables
[1]->deref
)->type
);
460 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
461 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
&&
462 instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_storage
);
470 validate_tex_instr(nir_tex_instr
*instr
, validate_state
*state
)
472 bool src_type_seen
[nir_num_tex_src_types
];
473 for (unsigned i
= 0; i
< nir_num_tex_src_types
; i
++)
474 src_type_seen
[i
] = false;
476 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++) {
477 assert(!src_type_seen
[instr
->src
[i
].src_type
]);
478 src_type_seen
[instr
->src
[i
].src_type
] = true;
479 validate_src(&instr
->src
[i
].src
, state
);
482 if (instr
->texture
!= NULL
)
483 validate_deref_var(instr
, instr
->texture
, state
);
485 if (instr
->sampler
!= NULL
)
486 validate_deref_var(instr
, instr
->sampler
, state
);
488 validate_dest(&instr
->dest
, state
);
492 validate_call_instr(nir_call_instr
*instr
, validate_state
*state
)
494 if (instr
->return_deref
== NULL
) {
495 assert(glsl_type_is_void(instr
->callee
->return_type
));
497 assert(instr
->return_deref
->deref
.type
== instr
->callee
->return_type
);
498 validate_deref_var(instr
, instr
->return_deref
, state
);
501 assert(instr
->num_params
== instr
->callee
->num_params
);
503 for (unsigned i
= 0; i
< instr
->num_params
; i
++) {
504 assert(instr
->callee
->params
[i
].type
== instr
->params
[i
]->deref
.type
);
505 validate_deref_var(instr
, instr
->params
[i
], state
);
510 validate_load_const_instr(nir_load_const_instr
*instr
, validate_state
*state
)
512 validate_ssa_def(&instr
->def
, state
);
516 validate_ssa_undef_instr(nir_ssa_undef_instr
*instr
, validate_state
*state
)
518 validate_ssa_def(&instr
->def
, state
);
522 validate_phi_instr(nir_phi_instr
*instr
, validate_state
*state
)
525 * don't validate the sources until we get to them from their predecessor
526 * basic blocks, to avoid validating an SSA use before its definition.
529 validate_dest(&instr
->dest
, state
);
531 exec_list_validate(&instr
->srcs
);
532 assert(exec_list_length(&instr
->srcs
) ==
533 state
->block
->predecessors
->entries
);
537 validate_instr(nir_instr
*instr
, validate_state
*state
)
539 assert(instr
->block
== state
->block
);
541 state
->instr
= instr
;
543 switch (instr
->type
) {
544 case nir_instr_type_alu
:
545 validate_alu_instr(nir_instr_as_alu(instr
), state
);
548 case nir_instr_type_call
:
549 validate_call_instr(nir_instr_as_call(instr
), state
);
552 case nir_instr_type_intrinsic
:
553 validate_intrinsic_instr(nir_instr_as_intrinsic(instr
), state
);
556 case nir_instr_type_tex
:
557 validate_tex_instr(nir_instr_as_tex(instr
), state
);
560 case nir_instr_type_load_const
:
561 validate_load_const_instr(nir_instr_as_load_const(instr
), state
);
564 case nir_instr_type_phi
:
565 validate_phi_instr(nir_instr_as_phi(instr
), state
);
568 case nir_instr_type_ssa_undef
:
569 validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr
), state
);
572 case nir_instr_type_jump
:
576 assert(!"Invalid ALU instruction type");
584 validate_phi_src(nir_phi_instr
*instr
, nir_block
*pred
, validate_state
*state
)
586 state
->instr
= &instr
->instr
;
588 assert(instr
->dest
.is_ssa
);
590 exec_list_validate(&instr
->srcs
);
591 nir_foreach_phi_src(instr
, src
) {
592 if (src
->pred
== pred
) {
593 assert(src
->src
.is_ssa
);
594 assert(src
->src
.ssa
->num_components
==
595 instr
->dest
.ssa
.num_components
);
597 validate_src(&src
->src
, state
);
607 validate_phi_srcs(nir_block
*block
, nir_block
*succ
, validate_state
*state
)
609 nir_foreach_instr(instr
, succ
) {
610 if (instr
->type
!= nir_instr_type_phi
)
613 validate_phi_src(nir_instr_as_phi(instr
), block
, state
);
617 static void validate_cf_node(nir_cf_node
*node
, validate_state
*state
);
620 validate_block(nir_block
*block
, validate_state
*state
)
622 assert(block
->cf_node
.parent
== state
->parent_node
);
624 state
->block
= block
;
626 exec_list_validate(&block
->instr_list
);
627 nir_foreach_instr(instr
, block
) {
628 if (instr
->type
== nir_instr_type_phi
) {
629 assert(instr
== nir_block_first_instr(block
) ||
630 nir_instr_prev(instr
)->type
== nir_instr_type_phi
);
633 if (instr
->type
== nir_instr_type_jump
) {
634 assert(instr
== nir_block_last_instr(block
));
637 validate_instr(instr
, state
);
640 assert(block
->successors
[0] != NULL
);
641 assert(block
->successors
[0] != block
->successors
[1]);
643 for (unsigned i
= 0; i
< 2; i
++) {
644 if (block
->successors
[i
] != NULL
) {
645 struct set_entry
*entry
=
646 _mesa_set_search(block
->successors
[i
]->predecessors
, block
);
649 validate_phi_srcs(block
, block
->successors
[i
], state
);
653 struct set_entry
*entry
;
654 set_foreach(block
->predecessors
, entry
) {
655 const nir_block
*pred
= entry
->key
;
656 assert(pred
->successors
[0] == block
||
657 pred
->successors
[1] == block
);
660 if (!exec_list_is_empty(&block
->instr_list
) &&
661 nir_block_last_instr(block
)->type
== nir_instr_type_jump
) {
662 assert(block
->successors
[1] == NULL
);
663 nir_jump_instr
*jump
= nir_instr_as_jump(nir_block_last_instr(block
));
664 switch (jump
->type
) {
665 case nir_jump_break
: {
667 nir_cf_node_as_block(nir_cf_node_next(&state
->loop
->cf_node
));
668 assert(block
->successors
[0] == after
);
672 case nir_jump_continue
: {
674 nir_cf_node_as_block(nir_loop_first_cf_node(state
->loop
));
675 assert(block
->successors
[0] == first
);
679 case nir_jump_return
:
680 assert(block
->successors
[0] == state
->impl
->end_block
);
684 unreachable("bad jump type");
687 nir_cf_node
*next
= nir_cf_node_next(&block
->cf_node
);
689 switch (state
->parent_node
->type
) {
690 case nir_cf_node_loop
: {
692 nir_cf_node_as_block(nir_loop_first_cf_node(state
->loop
));
693 assert(block
->successors
[0] == first
);
694 /* due to the hack for infinite loops, block->successors[1] may
695 * point to the block after the loop.
700 case nir_cf_node_if
: {
702 nir_cf_node_as_block(nir_cf_node_next(state
->parent_node
));
703 assert(block
->successors
[0] == after
);
704 assert(block
->successors
[1] == NULL
);
708 case nir_cf_node_function
:
709 assert(block
->successors
[0] == state
->impl
->end_block
);
710 assert(block
->successors
[1] == NULL
);
714 unreachable("unknown control flow node type");
717 if (next
->type
== nir_cf_node_if
) {
718 nir_if
*if_stmt
= nir_cf_node_as_if(next
);
719 assert(&block
->successors
[0]->cf_node
==
720 nir_if_first_then_node(if_stmt
));
721 assert(&block
->successors
[1]->cf_node
==
722 nir_if_first_else_node(if_stmt
));
724 assert(next
->type
== nir_cf_node_loop
);
725 nir_loop
*loop
= nir_cf_node_as_loop(next
);
726 assert(&block
->successors
[0]->cf_node
==
727 nir_loop_first_cf_node(loop
));
728 assert(block
->successors
[1] == NULL
);
735 validate_if(nir_if
*if_stmt
, validate_state
*state
)
737 state
->if_stmt
= if_stmt
;
739 assert(!exec_node_is_head_sentinel(if_stmt
->cf_node
.node
.prev
));
740 nir_cf_node
*prev_node
= nir_cf_node_prev(&if_stmt
->cf_node
);
741 assert(prev_node
->type
== nir_cf_node_block
);
743 assert(!exec_node_is_tail_sentinel(if_stmt
->cf_node
.node
.next
));
744 nir_cf_node
*next_node
= nir_cf_node_next(&if_stmt
->cf_node
);
745 assert(next_node
->type
== nir_cf_node_block
);
747 validate_src(&if_stmt
->condition
, state
);
749 assert(!exec_list_is_empty(&if_stmt
->then_list
));
750 assert(!exec_list_is_empty(&if_stmt
->else_list
));
752 nir_cf_node
*old_parent
= state
->parent_node
;
753 state
->parent_node
= &if_stmt
->cf_node
;
755 exec_list_validate(&if_stmt
->then_list
);
756 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->then_list
) {
757 validate_cf_node(cf_node
, state
);
760 exec_list_validate(&if_stmt
->else_list
);
761 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->else_list
) {
762 validate_cf_node(cf_node
, state
);
765 state
->parent_node
= old_parent
;
766 state
->if_stmt
= NULL
;
770 validate_loop(nir_loop
*loop
, validate_state
*state
)
772 assert(!exec_node_is_head_sentinel(loop
->cf_node
.node
.prev
));
773 nir_cf_node
*prev_node
= nir_cf_node_prev(&loop
->cf_node
);
774 assert(prev_node
->type
== nir_cf_node_block
);
776 assert(!exec_node_is_tail_sentinel(loop
->cf_node
.node
.next
));
777 nir_cf_node
*next_node
= nir_cf_node_next(&loop
->cf_node
);
778 assert(next_node
->type
== nir_cf_node_block
);
780 assert(!exec_list_is_empty(&loop
->body
));
782 nir_cf_node
*old_parent
= state
->parent_node
;
783 state
->parent_node
= &loop
->cf_node
;
784 nir_loop
*old_loop
= state
->loop
;
787 exec_list_validate(&loop
->body
);
788 foreach_list_typed(nir_cf_node
, cf_node
, node
, &loop
->body
) {
789 validate_cf_node(cf_node
, state
);
792 state
->parent_node
= old_parent
;
793 state
->loop
= old_loop
;
797 validate_cf_node(nir_cf_node
*node
, validate_state
*state
)
799 assert(node
->parent
== state
->parent_node
);
801 switch (node
->type
) {
802 case nir_cf_node_block
:
803 validate_block(nir_cf_node_as_block(node
), state
);
807 validate_if(nir_cf_node_as_if(node
), state
);
810 case nir_cf_node_loop
:
811 validate_loop(nir_cf_node_as_loop(node
), state
);
815 unreachable("Invalid CF node type");
820 prevalidate_reg_decl(nir_register
*reg
, bool is_global
, validate_state
*state
)
822 assert(reg
->is_global
== is_global
);
825 assert(reg
->index
< state
->shader
->reg_alloc
);
827 assert(reg
->index
< state
->impl
->reg_alloc
);
828 assert(!BITSET_TEST(state
->regs_found
, reg
->index
));
829 BITSET_SET(state
->regs_found
, reg
->index
);
831 list_validate(®
->uses
);
832 list_validate(®
->defs
);
833 list_validate(®
->if_uses
);
835 reg_validate_state
*reg_state
= ralloc(state
->regs
, reg_validate_state
);
836 reg_state
->uses
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
837 _mesa_key_pointer_equal
);
838 reg_state
->if_uses
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
839 _mesa_key_pointer_equal
);
840 reg_state
->defs
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
841 _mesa_key_pointer_equal
);
843 reg_state
->where_defined
= is_global
? NULL
: state
->impl
;
845 _mesa_hash_table_insert(state
->regs
, reg
, reg_state
);
849 postvalidate_reg_decl(nir_register
*reg
, validate_state
*state
)
851 struct hash_entry
*entry
= _mesa_hash_table_search(state
->regs
, reg
);
853 reg_validate_state
*reg_state
= (reg_validate_state
*) entry
->data
;
855 nir_foreach_use(reg
, src
) {
856 struct set_entry
*entry
= _mesa_set_search(reg_state
->uses
, src
);
858 _mesa_set_remove(reg_state
->uses
, entry
);
861 if (reg_state
->uses
->entries
!= 0) {
862 printf("extra entries in register uses:\n");
863 struct set_entry
*entry
;
864 set_foreach(reg_state
->uses
, entry
)
865 printf("%p\n", entry
->key
);
870 nir_foreach_if_use(reg
, src
) {
871 struct set_entry
*entry
= _mesa_set_search(reg_state
->if_uses
, src
);
873 _mesa_set_remove(reg_state
->if_uses
, entry
);
876 if (reg_state
->if_uses
->entries
!= 0) {
877 printf("extra entries in register if_uses:\n");
878 struct set_entry
*entry
;
879 set_foreach(reg_state
->if_uses
, entry
)
880 printf("%p\n", entry
->key
);
885 nir_foreach_def(reg
, src
) {
886 struct set_entry
*entry
= _mesa_set_search(reg_state
->defs
, src
);
888 _mesa_set_remove(reg_state
->defs
, entry
);
891 if (reg_state
->defs
->entries
!= 0) {
892 printf("extra entries in register defs:\n");
893 struct set_entry
*entry
;
894 set_foreach(reg_state
->defs
, entry
)
895 printf("%p\n", entry
->key
);
902 validate_var_decl(nir_variable
*var
, bool is_global
, validate_state
*state
)
904 assert(is_global
== nir_variable_is_global(var
));
906 /* Must have exactly one mode set */
907 assert(util_bitcount(var
->data
.mode
) == 1);
910 * TODO validate some things ir_validate.cpp does (requires more GLSL type
915 _mesa_hash_table_insert(state
->var_defs
, var
, state
->impl
);
920 postvalidate_ssa_def(nir_ssa_def
*def
, void *void_state
)
922 validate_state
*state
= void_state
;
924 struct hash_entry
*entry
= _mesa_hash_table_search(state
->ssa_defs
, def
);
925 ssa_def_validate_state
*def_state
= (ssa_def_validate_state
*)entry
->data
;
927 nir_foreach_use(def
, src
) {
928 struct set_entry
*entry
= _mesa_set_search(def_state
->uses
, src
);
930 _mesa_set_remove(def_state
->uses
, entry
);
933 if (def_state
->uses
->entries
!= 0) {
934 printf("extra entries in register uses:\n");
935 struct set_entry
*entry
;
936 set_foreach(def_state
->uses
, entry
)
937 printf("%p\n", entry
->key
);
942 nir_foreach_if_use(def
, src
) {
943 struct set_entry
*entry
= _mesa_set_search(def_state
->if_uses
, src
);
945 _mesa_set_remove(def_state
->if_uses
, entry
);
948 if (def_state
->if_uses
->entries
!= 0) {
949 printf("extra entries in register uses:\n");
950 struct set_entry
*entry
;
951 set_foreach(def_state
->if_uses
, entry
)
952 printf("%p\n", entry
->key
);
961 validate_function_impl(nir_function_impl
*impl
, validate_state
*state
)
963 assert(impl
->function
->impl
== impl
);
964 assert(impl
->cf_node
.parent
== NULL
);
966 assert(impl
->num_params
== impl
->function
->num_params
);
967 for (unsigned i
= 0; i
< impl
->num_params
; i
++) {
968 assert(impl
->params
[i
]->type
== impl
->function
->params
[i
].type
);
969 assert(impl
->params
[i
]->data
.mode
== nir_var_param
);
970 assert(impl
->params
[i
]->data
.location
== i
);
971 validate_var_decl(impl
->params
[i
], false, state
);
974 if (glsl_type_is_void(impl
->function
->return_type
)) {
975 assert(impl
->return_var
== NULL
);
977 assert(impl
->return_var
->type
== impl
->function
->return_type
);
978 assert(impl
->return_var
->data
.mode
== nir_var_param
);
979 assert(impl
->return_var
->data
.location
== -1);
980 validate_var_decl(impl
->return_var
, false, state
);
983 assert(exec_list_is_empty(&impl
->end_block
->instr_list
));
984 assert(impl
->end_block
->successors
[0] == NULL
);
985 assert(impl
->end_block
->successors
[1] == NULL
);
988 state
->parent_node
= &impl
->cf_node
;
990 exec_list_validate(&impl
->locals
);
991 nir_foreach_variable(var
, &impl
->locals
) {
992 validate_var_decl(var
, false, state
);
995 state
->regs_found
= realloc(state
->regs_found
,
996 BITSET_WORDS(impl
->reg_alloc
) *
997 sizeof(BITSET_WORD
));
998 memset(state
->regs_found
, 0, BITSET_WORDS(impl
->reg_alloc
) *
999 sizeof(BITSET_WORD
));
1000 exec_list_validate(&impl
->registers
);
1001 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
1002 prevalidate_reg_decl(reg
, false, state
);
1005 state
->ssa_defs_found
= realloc(state
->ssa_defs_found
,
1006 BITSET_WORDS(impl
->ssa_alloc
) *
1007 sizeof(BITSET_WORD
));
1008 memset(state
->ssa_defs_found
, 0, BITSET_WORDS(impl
->ssa_alloc
) *
1009 sizeof(BITSET_WORD
));
1010 exec_list_validate(&impl
->body
);
1011 foreach_list_typed(nir_cf_node
, node
, node
, &impl
->body
) {
1012 validate_cf_node(node
, state
);
1015 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
1016 postvalidate_reg_decl(reg
, state
);
1019 nir_foreach_block(block
, impl
) {
1020 nir_foreach_instr(instr
, block
)
1021 nir_foreach_ssa_def(instr
, postvalidate_ssa_def
, state
);
1026 validate_function(nir_function
*func
, validate_state
*state
)
1028 if (func
->impl
!= NULL
) {
1029 assert(func
->impl
->function
== func
);
1030 validate_function_impl(func
->impl
, state
);
1035 init_validate_state(validate_state
*state
)
1037 state
->regs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
1038 _mesa_key_pointer_equal
);
1039 state
->ssa_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
1040 _mesa_key_pointer_equal
);
1041 state
->ssa_defs_found
= NULL
;
1042 state
->regs_found
= NULL
;
1043 state
->var_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
1044 _mesa_key_pointer_equal
);
1049 destroy_validate_state(validate_state
*state
)
1051 _mesa_hash_table_destroy(state
->regs
, NULL
);
1052 _mesa_hash_table_destroy(state
->ssa_defs
, NULL
);
1053 free(state
->ssa_defs_found
);
1054 free(state
->regs_found
);
1055 _mesa_hash_table_destroy(state
->var_defs
, NULL
);
1059 nir_validate_shader(nir_shader
*shader
)
1061 validate_state state
;
1062 init_validate_state(&state
);
1064 state
.shader
= shader
;
1066 exec_list_validate(&shader
->uniforms
);
1067 nir_foreach_variable(var
, &shader
->uniforms
) {
1068 validate_var_decl(var
, true, &state
);
1071 exec_list_validate(&shader
->inputs
);
1072 nir_foreach_variable(var
, &shader
->inputs
) {
1073 validate_var_decl(var
, true, &state
);
1076 exec_list_validate(&shader
->outputs
);
1077 nir_foreach_variable(var
, &shader
->outputs
) {
1078 validate_var_decl(var
, true, &state
);
1081 exec_list_validate(&shader
->shared
);
1082 nir_foreach_variable(var
, &shader
->shared
) {
1083 validate_var_decl(var
, true, &state
);
1086 exec_list_validate(&shader
->globals
);
1087 nir_foreach_variable(var
, &shader
->globals
) {
1088 validate_var_decl(var
, true, &state
);
1091 exec_list_validate(&shader
->system_values
);
1092 nir_foreach_variable(var
, &shader
->system_values
) {
1093 validate_var_decl(var
, true, &state
);
1096 state
.regs_found
= realloc(state
.regs_found
,
1097 BITSET_WORDS(shader
->reg_alloc
) *
1098 sizeof(BITSET_WORD
));
1099 memset(state
.regs_found
, 0, BITSET_WORDS(shader
->reg_alloc
) *
1100 sizeof(BITSET_WORD
));
1101 exec_list_validate(&shader
->registers
);
1102 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
1103 prevalidate_reg_decl(reg
, true, &state
);
1106 exec_list_validate(&shader
->functions
);
1107 foreach_list_typed(nir_function
, func
, node
, &shader
->functions
) {
1108 validate_function(func
, &state
);
1111 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
1112 postvalidate_reg_decl(reg
, &state
);
1115 destroy_validate_state(&state
);