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 parent of the current cf node being visited */
79 nir_cf_node
*parent_node
;
81 /* the current function implementation being validated */
82 nir_function_impl
*impl
;
84 /* map of SSA value -> function implementation where it is defined */
85 struct hash_table
*ssa_defs
;
87 /* bitset of ssa definitions we have found; used to check uniqueness */
88 BITSET_WORD
*ssa_defs_found
;
90 /* bitset of registers we have currently found; used to check uniqueness */
91 BITSET_WORD
*regs_found
;
93 /* map of local variable -> function implementation where it is defined */
94 struct hash_table
*var_defs
;
97 static void validate_src(nir_src
*src
, validate_state
*state
);
100 validate_reg_src(nir_reg_src
*src
, validate_state
*state
)
102 assert(src
->reg
!= NULL
);
104 struct hash_entry
*entry
;
105 entry
= _mesa_hash_table_search(state
->regs
, src
->reg
);
108 reg_validate_state
*reg_state
= (reg_validate_state
*) entry
->data
;
111 _mesa_set_add(reg_state
->uses
, state
->instr
);
113 assert(_mesa_set_search(src
->reg
->uses
, state
->instr
));
115 assert(state
->if_stmt
);
116 _mesa_set_add(reg_state
->if_uses
, state
->if_stmt
);
118 assert(_mesa_set_search(src
->reg
->if_uses
, state
->if_stmt
));
121 if (!src
->reg
->is_global
) {
122 assert(reg_state
->where_defined
== state
->impl
&&
123 "using a register declared in a different function");
126 assert((src
->reg
->num_array_elems
== 0 ||
127 src
->base_offset
< src
->reg
->num_array_elems
) &&
128 "definitely out-of-bounds array access");
131 assert(src
->reg
->num_array_elems
!= 0);
132 assert((src
->indirect
->is_ssa
|| src
->indirect
->reg
.indirect
== NULL
) &&
133 "only one level of indirection allowed");
134 validate_src(src
->indirect
, state
);
139 validate_ssa_src(nir_ssa_def
*def
, validate_state
*state
)
143 struct hash_entry
*entry
= _mesa_hash_table_search(state
->ssa_defs
, def
);
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
, state
->instr
);
155 assert(_mesa_set_search(def
->uses
, state
->instr
));
157 assert(state
->if_stmt
);
158 _mesa_set_add(def_state
->if_uses
, state
->if_stmt
);
160 assert(_mesa_set_search(def
->if_uses
, state
->if_stmt
));
163 /* TODO validate that the use is dominated by the definition */
167 validate_src(nir_src
*src
, validate_state
*state
)
170 validate_ssa_src(src
->ssa
, state
);
172 validate_reg_src(&src
->reg
, state
);
176 validate_alu_src(nir_alu_instr
*instr
, unsigned index
, validate_state
*state
)
178 nir_alu_src
*src
= &instr
->src
[index
];
180 unsigned num_components
;
182 num_components
= src
->src
.ssa
->num_components
;
184 if (src
->src
.reg
.reg
->is_packed
)
185 num_components
= 4; /* can't check anything */
187 num_components
= src
->src
.reg
.reg
->num_components
;
189 for (unsigned i
= 0; i
< 4; i
++) {
190 assert(src
->swizzle
[i
] < 4);
192 if (nir_alu_instr_channel_used(instr
, index
, i
))
193 assert(src
->swizzle
[i
] < num_components
);
196 validate_src(&src
->src
, state
);
200 validate_reg_dest(nir_reg_dest
*dest
, validate_state
*state
)
202 assert(dest
->reg
!= NULL
);
204 struct set_entry
*entry
= _mesa_set_search(dest
->reg
->defs
, state
->instr
);
205 assert(entry
&& "definition not in nir_register.defs");
207 struct hash_entry
*entry2
;
208 entry2
= _mesa_hash_table_search(state
->regs
, dest
->reg
);
212 reg_validate_state
*reg_state
= (reg_validate_state
*) entry2
->data
;
213 _mesa_set_add(reg_state
->defs
, state
->instr
);
215 if (!dest
->reg
->is_global
) {
216 assert(reg_state
->where_defined
== state
->impl
&&
217 "writing to a register declared in a different function");
220 assert((dest
->reg
->num_array_elems
== 0 ||
221 dest
->base_offset
< dest
->reg
->num_array_elems
) &&
222 "definitely out-of-bounds array access");
224 if (dest
->indirect
) {
225 assert(dest
->reg
->num_array_elems
!= 0);
226 assert((dest
->indirect
->is_ssa
|| dest
->indirect
->reg
.indirect
== NULL
) &&
227 "only one level of indirection allowed");
228 validate_src(dest
->indirect
, state
);
233 validate_ssa_def(nir_ssa_def
*def
, validate_state
*state
)
235 assert(def
->index
< state
->impl
->ssa_alloc
);
236 assert(!BITSET_TEST(state
->ssa_defs_found
, def
->index
));
237 BITSET_SET(state
->ssa_defs_found
, def
->index
);
239 assert(def
->num_components
<= 4);
241 ssa_def_validate_state
*def_state
= ralloc(state
->ssa_defs
,
242 ssa_def_validate_state
);
243 def_state
->where_defined
= state
->impl
;
244 def_state
->uses
= _mesa_set_create(def_state
, _mesa_hash_pointer
,
245 _mesa_key_pointer_equal
);
246 def_state
->if_uses
= _mesa_set_create(def_state
, _mesa_hash_pointer
,
247 _mesa_key_pointer_equal
);
248 _mesa_hash_table_insert(state
->ssa_defs
, def
, def_state
);
252 validate_dest(nir_dest
*dest
, validate_state
*state
)
255 validate_ssa_def(&dest
->ssa
, state
);
257 validate_reg_dest(&dest
->reg
, state
);
261 validate_alu_dest(nir_alu_dest
*dest
, validate_state
*state
)
264 dest
->dest
.is_ssa
? dest
->dest
.ssa
.num_components
265 : dest
->dest
.reg
.reg
->num_components
;
266 bool is_packed
= !dest
->dest
.is_ssa
&& dest
->dest
.reg
.reg
->is_packed
;
268 * validate that the instruction doesn't write to components not in the
271 assert(is_packed
|| !(dest
->write_mask
& ~((1 << dest_size
) - 1)));
273 /* validate that saturate is only ever used on instructions with
274 * destinations of type float
276 nir_alu_instr
*alu
= nir_instr_as_alu(state
->instr
);
277 assert(nir_op_infos
[alu
->op
].output_type
== nir_type_float
||
280 validate_dest(&dest
->dest
, state
);
284 validate_alu_instr(nir_alu_instr
*instr
, validate_state
*state
)
286 assert(instr
->op
< nir_num_opcodes
);
288 validate_alu_dest(&instr
->dest
, state
);
290 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++) {
291 validate_alu_src(instr
, i
, state
);
296 validate_deref_chain(nir_deref
*deref
, validate_state
*state
)
298 nir_deref
*parent
= NULL
;
299 while (deref
!= NULL
) {
300 switch (deref
->deref_type
) {
301 case nir_deref_type_array
:
302 assert(deref
->type
== glsl_get_array_element(parent
->type
));
303 if (nir_deref_as_array(deref
)->deref_array_type
==
304 nir_deref_array_type_indirect
)
305 validate_src(&nir_deref_as_array(deref
)->indirect
, state
);
308 case nir_deref_type_struct
:
309 assert(deref
->type
==
310 glsl_get_struct_field(parent
->type
,
311 nir_deref_as_struct(deref
)->index
));
314 case nir_deref_type_var
:
318 assert(!"Invalid deref type");
323 deref
= deref
->child
;
328 validate_var_use(nir_variable
*var
, validate_state
*state
)
330 if (var
->data
.mode
== nir_var_local
) {
331 struct hash_entry
*entry
= _mesa_hash_table_search(state
->var_defs
, var
);
334 assert((nir_function_impl
*) entry
->data
== state
->impl
);
339 validate_deref_var(nir_deref_var
*deref
, validate_state
*state
)
341 assert(deref
!= NULL
);
342 assert(deref
->deref
.type
== deref
->var
->type
);
344 validate_var_use(deref
->var
, state
);
346 validate_deref_chain(&deref
->deref
, state
);
350 validate_intrinsic_instr(nir_intrinsic_instr
*instr
, validate_state
*state
)
352 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
353 for (unsigned i
= 0; i
< num_srcs
; i
++) {
354 unsigned components_read
=
355 nir_intrinsic_infos
[instr
->intrinsic
].src_components
[i
];
356 if (components_read
== 0)
357 components_read
= instr
->num_components
;
359 assert(components_read
> 0);
361 if (instr
->src
[i
].is_ssa
) {
362 assert(components_read
<= instr
->src
[i
].ssa
->num_components
);
363 } else if (!instr
->src
[i
].reg
.reg
->is_packed
) {
364 assert(components_read
<= instr
->src
[i
].reg
.reg
->num_components
);
367 validate_src(&instr
->src
[i
], state
);
370 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
) {
371 unsigned components_written
=
372 nir_intrinsic_infos
[instr
->intrinsic
].dest_components
;
373 if (components_written
== 0)
374 components_written
= instr
->num_components
;
376 assert(components_written
> 0);
378 if (instr
->dest
.is_ssa
) {
379 assert(components_written
<= instr
->dest
.ssa
.num_components
);
380 } else if (!instr
->dest
.reg
.reg
->is_packed
) {
381 assert(components_written
<= instr
->dest
.reg
.reg
->num_components
);
384 validate_dest(&instr
->dest
, state
);
387 unsigned num_vars
= nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
388 for (unsigned i
= 0; i
< num_vars
; i
++) {
389 validate_deref_var(instr
->variables
[i
], state
);
392 switch (instr
->intrinsic
) {
393 case nir_intrinsic_load_var
:
394 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_out
);
396 case nir_intrinsic_store_var
:
397 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
398 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
);
400 case nir_intrinsic_copy_var
:
401 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
402 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
);
403 assert(instr
->variables
[1]->var
->data
.mode
!= nir_var_shader_out
);
411 validate_tex_instr(nir_tex_instr
*instr
, validate_state
*state
)
413 validate_dest(&instr
->dest
, state
);
415 bool src_type_seen
[nir_num_tex_src_types
];
416 for (unsigned i
= 0; i
< nir_num_tex_src_types
; i
++)
417 src_type_seen
[i
] = false;
419 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++) {
420 assert(!src_type_seen
[instr
->src
[i
].src_type
]);
421 src_type_seen
[instr
->src
[i
].src_type
] = true;
422 validate_src(&instr
->src
[i
].src
, state
);
425 if (instr
->sampler
!= NULL
)
426 validate_deref_var(instr
->sampler
, state
);
430 validate_call_instr(nir_call_instr
*instr
, validate_state
*state
)
432 if (instr
->return_deref
== NULL
)
433 assert(glsl_type_is_void(instr
->callee
->return_type
));
435 assert(instr
->return_deref
->deref
.type
== instr
->callee
->return_type
);
437 assert(instr
->num_params
== instr
->callee
->num_params
);
439 for (unsigned i
= 0; i
< instr
->num_params
; i
++) {
440 assert(instr
->callee
->params
[i
].type
== instr
->params
[i
]->deref
.type
);
441 validate_deref_var(instr
->params
[i
], state
);
444 validate_deref_var(instr
->return_deref
, state
);
448 validate_load_const_instr(nir_load_const_instr
*instr
, validate_state
*state
)
450 validate_ssa_def(&instr
->def
, state
);
454 validate_ssa_undef_instr(nir_ssa_undef_instr
*instr
, validate_state
*state
)
456 validate_ssa_def(&instr
->def
, state
);
460 validate_phi_instr(nir_phi_instr
*instr
, validate_state
*state
)
463 * don't validate the sources until we get to them from their predecessor
464 * basic blocks, to avoid validating an SSA use before its definition.
467 validate_dest(&instr
->dest
, state
);
469 exec_list_validate(&instr
->srcs
);
470 assert(exec_list_length(&instr
->srcs
) ==
471 state
->block
->predecessors
->entries
);
475 validate_instr(nir_instr
*instr
, validate_state
*state
)
477 assert(instr
->block
== state
->block
);
479 state
->instr
= instr
;
481 switch (instr
->type
) {
482 case nir_instr_type_alu
:
483 validate_alu_instr(nir_instr_as_alu(instr
), state
);
486 case nir_instr_type_call
:
487 validate_call_instr(nir_instr_as_call(instr
), state
);
490 case nir_instr_type_intrinsic
:
491 validate_intrinsic_instr(nir_instr_as_intrinsic(instr
), state
);
494 case nir_instr_type_tex
:
495 validate_tex_instr(nir_instr_as_tex(instr
), state
);
498 case nir_instr_type_load_const
:
499 validate_load_const_instr(nir_instr_as_load_const(instr
), state
);
502 case nir_instr_type_phi
:
503 validate_phi_instr(nir_instr_as_phi(instr
), state
);
506 case nir_instr_type_ssa_undef
:
507 validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr
), state
);
510 case nir_instr_type_jump
:
514 assert(!"Invalid ALU instruction type");
522 validate_phi_src(nir_phi_instr
*instr
, nir_block
*pred
, validate_state
*state
)
524 state
->instr
= &instr
->instr
;
526 assert(instr
->dest
.is_ssa
);
528 exec_list_validate(&instr
->srcs
);
529 nir_foreach_phi_src(instr
, src
) {
530 if (src
->pred
== pred
) {
531 assert(src
->src
.is_ssa
);
532 assert(src
->src
.ssa
->num_components
==
533 instr
->dest
.ssa
.num_components
);
535 validate_src(&src
->src
, state
);
545 validate_phi_srcs(nir_block
*block
, nir_block
*succ
, validate_state
*state
)
547 nir_foreach_instr(succ
, instr
) {
548 if (instr
->type
!= nir_instr_type_phi
)
551 validate_phi_src(nir_instr_as_phi(instr
), block
, state
);
555 static void validate_cf_node(nir_cf_node
*node
, validate_state
*state
);
558 validate_block(nir_block
*block
, validate_state
*state
)
560 assert(block
->cf_node
.parent
== state
->parent_node
);
562 state
->block
= block
;
564 exec_list_validate(&block
->instr_list
);
565 nir_foreach_instr(block
, instr
) {
566 if (instr
->type
== nir_instr_type_phi
) {
567 assert(instr
== nir_block_first_instr(block
) ||
568 nir_instr_prev(instr
)->type
== nir_instr_type_phi
);
571 if (instr
->type
== nir_instr_type_jump
) {
572 assert(instr
== nir_block_last_instr(block
));
575 validate_instr(instr
, state
);
578 assert(block
->successors
[0] != NULL
);
580 for (unsigned i
= 0; i
< 2; i
++) {
581 if (block
->successors
[i
] != NULL
) {
582 struct set_entry
*entry
=
583 _mesa_set_search(block
->successors
[i
]->predecessors
, block
);
586 validate_phi_srcs(block
, block
->successors
[i
], state
);
590 if (!exec_list_is_empty(&block
->instr_list
) &&
591 nir_block_last_instr(block
)->type
== nir_instr_type_jump
)
592 assert(block
->successors
[1] == NULL
);
596 validate_if(nir_if
*if_stmt
, validate_state
*state
)
598 state
->if_stmt
= if_stmt
;
600 assert(!exec_node_is_head_sentinel(if_stmt
->cf_node
.node
.prev
));
601 nir_cf_node
*prev_node
= nir_cf_node_prev(&if_stmt
->cf_node
);
602 assert(prev_node
->type
== nir_cf_node_block
);
604 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
605 assert(&prev_block
->successors
[0]->cf_node
==
606 nir_if_first_then_node(if_stmt
));
607 assert(&prev_block
->successors
[1]->cf_node
==
608 nir_if_first_else_node(if_stmt
));
610 assert(!exec_node_is_tail_sentinel(if_stmt
->cf_node
.node
.next
));
611 nir_cf_node
*next_node
= nir_cf_node_next(&if_stmt
->cf_node
);
612 assert(next_node
->type
== nir_cf_node_block
);
614 validate_src(&if_stmt
->condition
, state
);
616 assert(!exec_list_is_empty(&if_stmt
->then_list
));
617 assert(!exec_list_is_empty(&if_stmt
->else_list
));
619 nir_cf_node
*old_parent
= state
->parent_node
;
620 state
->parent_node
= &if_stmt
->cf_node
;
622 exec_list_validate(&if_stmt
->then_list
);
623 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->then_list
) {
624 validate_cf_node(cf_node
, state
);
627 exec_list_validate(&if_stmt
->else_list
);
628 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->else_list
) {
629 validate_cf_node(cf_node
, state
);
632 state
->parent_node
= old_parent
;
633 state
->if_stmt
= NULL
;
637 validate_loop(nir_loop
*loop
, validate_state
*state
)
639 assert(!exec_node_is_head_sentinel(loop
->cf_node
.node
.prev
));
640 nir_cf_node
*prev_node
= nir_cf_node_prev(&loop
->cf_node
);
641 assert(prev_node
->type
== nir_cf_node_block
);
643 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
644 assert(&prev_block
->successors
[0]->cf_node
== nir_loop_first_cf_node(loop
));
645 assert(prev_block
->successors
[1] == NULL
);
647 assert(!exec_node_is_tail_sentinel(loop
->cf_node
.node
.next
));
648 nir_cf_node
*next_node
= nir_cf_node_next(&loop
->cf_node
);
649 assert(next_node
->type
== nir_cf_node_block
);
651 assert(!exec_list_is_empty(&loop
->body
));
653 nir_cf_node
*old_parent
= state
->parent_node
;
654 state
->parent_node
= &loop
->cf_node
;
656 exec_list_validate(&loop
->body
);
657 foreach_list_typed(nir_cf_node
, cf_node
, node
, &loop
->body
) {
658 validate_cf_node(cf_node
, state
);
661 state
->parent_node
= old_parent
;
665 validate_cf_node(nir_cf_node
*node
, validate_state
*state
)
667 assert(node
->parent
== state
->parent_node
);
669 switch (node
->type
) {
670 case nir_cf_node_block
:
671 validate_block(nir_cf_node_as_block(node
), state
);
675 validate_if(nir_cf_node_as_if(node
), state
);
678 case nir_cf_node_loop
:
679 validate_loop(nir_cf_node_as_loop(node
), state
);
683 assert(!"Invalid ALU instruction type");
689 prevalidate_reg_decl(nir_register
*reg
, bool is_global
, validate_state
*state
)
691 assert(reg
->is_global
== is_global
);
694 assert(reg
->index
< state
->shader
->reg_alloc
);
696 assert(reg
->index
< state
->impl
->reg_alloc
);
697 assert(!BITSET_TEST(state
->regs_found
, reg
->index
));
698 BITSET_SET(state
->regs_found
, reg
->index
);
700 reg_validate_state
*reg_state
= ralloc(state
->regs
, reg_validate_state
);
701 reg_state
->uses
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
702 _mesa_key_pointer_equal
);
703 reg_state
->if_uses
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
704 _mesa_key_pointer_equal
);
705 reg_state
->defs
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
706 _mesa_key_pointer_equal
);
708 reg_state
->where_defined
= is_global
? NULL
: state
->impl
;
710 _mesa_hash_table_insert(state
->regs
, reg
, reg_state
);
714 postvalidate_reg_decl(nir_register
*reg
, validate_state
*state
)
716 struct hash_entry
*entry
= _mesa_hash_table_search(state
->regs
, reg
);
718 reg_validate_state
*reg_state
= (reg_validate_state
*) entry
->data
;
720 if (reg_state
->uses
->entries
!= reg
->uses
->entries
) {
721 printf("extra entries in register uses:\n");
722 struct set_entry
*entry
;
723 set_foreach(reg
->uses
, entry
) {
724 struct set_entry
*entry2
=
725 _mesa_set_search(reg_state
->uses
, entry
->key
);
727 if (entry2
== NULL
) {
728 printf("%p\n", entry
->key
);
735 if (reg_state
->if_uses
->entries
!= reg
->if_uses
->entries
) {
736 printf("extra entries in register if_uses:\n");
737 struct set_entry
*entry
;
738 set_foreach(reg
->if_uses
, entry
) {
739 struct set_entry
*entry2
=
740 _mesa_set_search(reg_state
->if_uses
, entry
->key
);
742 if (entry2
== NULL
) {
743 printf("%p\n", entry
->key
);
750 if (reg_state
->defs
->entries
!= reg
->defs
->entries
) {
751 printf("extra entries in register defs:\n");
752 struct set_entry
*entry
;
753 set_foreach(reg
->defs
, entry
) {
754 struct set_entry
*entry2
=
755 _mesa_set_search(reg_state
->defs
, entry
->key
);
757 if (entry2
== NULL
) {
758 printf("%p\n", entry
->key
);
767 validate_var_decl(nir_variable
*var
, bool is_global
, validate_state
*state
)
769 assert(is_global
!= (var
->data
.mode
== nir_var_local
));
772 * TODO validate some things ir_validate.cpp does (requires more GLSL type
777 _mesa_hash_table_insert(state
->var_defs
, var
, state
->impl
);
782 postvalidate_ssa_def(nir_ssa_def
*def
, void *void_state
)
784 validate_state
*state
= void_state
;
786 struct hash_entry
*entry
= _mesa_hash_table_search(state
->ssa_defs
, def
);
787 ssa_def_validate_state
*def_state
= (ssa_def_validate_state
*)entry
->data
;
789 if (def_state
->uses
->entries
!= def
->uses
->entries
) {
790 printf("extra entries in SSA def uses:\n");
791 struct set_entry
*entry
;
792 set_foreach(def
->uses
, entry
) {
793 struct set_entry
*entry2
=
794 _mesa_set_search(def_state
->uses
, entry
->key
);
796 if (entry2
== NULL
) {
797 printf("%p\n", entry
->key
);
804 if (def_state
->if_uses
->entries
!= def
->if_uses
->entries
) {
805 printf("extra entries in SSA def uses:\n");
806 struct set_entry
*entry
;
807 set_foreach(def
->if_uses
, entry
) {
808 struct set_entry
*entry2
=
809 _mesa_set_search(def_state
->if_uses
, entry
->key
);
811 if (entry2
== NULL
) {
812 printf("%p\n", entry
->key
);
823 postvalidate_ssa_defs_block(nir_block
*block
, void *state
)
825 nir_foreach_instr(block
, instr
)
826 nir_foreach_ssa_def(instr
, postvalidate_ssa_def
, state
);
832 validate_function_impl(nir_function_impl
*impl
, validate_state
*state
)
834 assert(impl
->overload
->impl
== impl
);
835 assert(impl
->cf_node
.parent
== NULL
);
837 assert(impl
->num_params
== impl
->overload
->num_params
);
838 for (unsigned i
= 0; i
< impl
->num_params
; i
++)
839 assert(impl
->params
[i
]->type
== impl
->overload
->params
[i
].type
);
841 if (glsl_type_is_void(impl
->overload
->return_type
))
842 assert(impl
->return_var
== NULL
);
844 assert(impl
->return_var
->type
== impl
->overload
->return_type
);
846 assert(exec_list_is_empty(&impl
->end_block
->instr_list
));
847 assert(impl
->end_block
->successors
[0] == NULL
);
848 assert(impl
->end_block
->successors
[1] == NULL
);
851 state
->parent_node
= &impl
->cf_node
;
853 exec_list_validate(&impl
->locals
);
854 foreach_list_typed(nir_variable
, var
, node
, &impl
->locals
) {
855 validate_var_decl(var
, false, state
);
858 state
->regs_found
= realloc(state
->regs_found
,
859 BITSET_WORDS(impl
->reg_alloc
) *
860 sizeof(BITSET_WORD
));
861 memset(state
->regs_found
, 0, BITSET_WORDS(impl
->reg_alloc
) *
862 sizeof(BITSET_WORD
));
863 exec_list_validate(&impl
->registers
);
864 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
865 prevalidate_reg_decl(reg
, false, state
);
868 state
->ssa_defs_found
= realloc(state
->ssa_defs_found
,
869 BITSET_WORDS(impl
->ssa_alloc
) *
870 sizeof(BITSET_WORD
));
871 memset(state
->ssa_defs_found
, 0, BITSET_WORDS(impl
->ssa_alloc
) *
872 sizeof(BITSET_WORD
));
873 exec_list_validate(&impl
->body
);
874 foreach_list_typed(nir_cf_node
, node
, node
, &impl
->body
) {
875 validate_cf_node(node
, state
);
878 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
879 postvalidate_reg_decl(reg
, state
);
882 nir_foreach_block(impl
, postvalidate_ssa_defs_block
, state
);
886 validate_function_overload(nir_function_overload
*overload
,
887 validate_state
*state
)
889 if (overload
->impl
!= NULL
)
890 validate_function_impl(overload
->impl
, state
);
894 validate_function(nir_function
*func
, validate_state
*state
)
896 exec_list_validate(&func
->overload_list
);
897 foreach_list_typed(nir_function_overload
, overload
, node
, &func
->overload_list
) {
898 assert(overload
->function
== func
);
899 validate_function_overload(overload
, state
);
904 init_validate_state(validate_state
*state
)
906 state
->regs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
907 _mesa_key_pointer_equal
);
908 state
->ssa_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
909 _mesa_key_pointer_equal
);
910 state
->ssa_defs_found
= NULL
;
911 state
->regs_found
= NULL
;
912 state
->var_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
913 _mesa_key_pointer_equal
);
917 destroy_validate_state(validate_state
*state
)
919 _mesa_hash_table_destroy(state
->regs
, NULL
);
920 _mesa_hash_table_destroy(state
->ssa_defs
, NULL
);
921 free(state
->ssa_defs_found
);
922 free(state
->regs_found
);
923 _mesa_hash_table_destroy(state
->var_defs
, NULL
);
927 nir_validate_shader(nir_shader
*shader
)
929 validate_state state
;
930 init_validate_state(&state
);
932 state
.shader
= shader
;
934 exec_list_validate(&shader
->uniforms
);
935 foreach_list_typed(nir_variable
, var
, node
, &shader
->uniforms
) {
936 validate_var_decl(var
, true, &state
);
939 exec_list_validate(&shader
->inputs
);
940 foreach_list_typed(nir_variable
, var
, node
, &shader
->inputs
) {
941 validate_var_decl(var
, true, &state
);
944 exec_list_validate(&shader
->outputs
);
945 foreach_list_typed(nir_variable
, var
, node
, &shader
->outputs
) {
946 validate_var_decl(var
, true, &state
);
949 exec_list_validate(&shader
->globals
);
950 foreach_list_typed(nir_variable
, var
, node
, &shader
->globals
) {
951 validate_var_decl(var
, true, &state
);
954 exec_list_validate(&shader
->system_values
);
955 foreach_list_typed(nir_variable
, var
, node
, &shader
->system_values
) {
956 validate_var_decl(var
, true, &state
);
959 state
.regs_found
= realloc(state
.regs_found
,
960 BITSET_WORDS(shader
->reg_alloc
) *
961 sizeof(BITSET_WORD
));
962 memset(state
.regs_found
, 0, BITSET_WORDS(shader
->reg_alloc
) *
963 sizeof(BITSET_WORD
));
964 exec_list_validate(&shader
->registers
);
965 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
966 prevalidate_reg_decl(reg
, true, &state
);
969 exec_list_validate(&shader
->functions
);
970 foreach_list_typed(nir_function
, func
, node
, &shader
->functions
) {
971 validate_function(func
, &state
);
974 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
975 postvalidate_reg_decl(reg
, &state
);
978 destroy_validate_state(&state
);