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
, *defs
;
50 nir_function_impl
*where_defined
; /* NULL for global registers */
54 /* map of register -> validation state (struct above) */
55 struct hash_table
*regs
;
57 /* the current shader being validated */
60 /* the current instruction being validated */
63 /* the current basic block being validated */
66 /* the current if statement being validated */
69 /* the parent of the current cf node being visited */
70 nir_cf_node
*parent_node
;
72 /* the current function implementation being validated */
73 nir_function_impl
*impl
;
75 /* map of SSA value -> function implementation where it is defined */
76 struct hash_table
*ssa_defs
;
78 /* bitset of ssa definitions we have found; used to check uniqueness */
79 BITSET_WORD
*ssa_defs_found
;
81 /* bitset of registers we have currently found; used to check uniqueness */
82 BITSET_WORD
*regs_found
;
84 /* map of local variable -> function implementation where it is defined */
85 struct hash_table
*var_defs
;
88 static void validate_src(nir_src
*src
, validate_state
*state
);
91 validate_reg_src(nir_reg_src
*src
, validate_state
*state
)
93 assert(src
->reg
!= NULL
);
95 struct set_entry
*entry
= _mesa_set_search(src
->reg
->uses
, state
->instr
);
96 assert(entry
&& "use not in nir_register.uses");
98 struct hash_entry
*entry2
;
99 entry2
= _mesa_hash_table_search(state
->regs
, src
->reg
);
103 reg_validate_state
*reg_state
= (reg_validate_state
*) entry2
->data
;
104 _mesa_set_add(reg_state
->uses
, state
->instr
);
106 if (!src
->reg
->is_global
) {
107 assert(reg_state
->where_defined
== state
->impl
&&
108 "using a register declared in a different function");
111 assert((src
->reg
->num_array_elems
== 0 ||
112 src
->base_offset
< src
->reg
->num_array_elems
) &&
113 "definitely out-of-bounds array access");
116 assert(src
->reg
->num_array_elems
!= 0);
117 assert((src
->indirect
->is_ssa
|| src
->indirect
->reg
.indirect
== NULL
) &&
118 "only one level of indirection allowed");
119 validate_src(src
->indirect
, state
);
124 validate_ssa_src(nir_ssa_def
*def
, validate_state
*state
)
128 struct hash_entry
*entry
= _mesa_hash_table_search(state
->ssa_defs
, def
);
132 assert((nir_function_impl
*) entry
->data
== state
->impl
&&
133 "using an SSA value defined in a different function");
135 struct set_entry
*entry2
;
137 entry2
= _mesa_set_search(def
->uses
, state
->instr
);
139 assert(entry2
&& "SSA use missing");
141 /* TODO validate that the use is dominated by the definition */
145 validate_src(nir_src
*src
, validate_state
*state
)
148 validate_ssa_src(src
->ssa
, state
);
150 validate_reg_src(&src
->reg
, state
);
154 validate_alu_src(nir_alu_instr
*instr
, unsigned index
, validate_state
*state
)
156 nir_alu_src
*src
= &instr
->src
[index
];
158 unsigned num_components
;
160 num_components
= src
->src
.ssa
->num_components
;
162 if (src
->src
.reg
.reg
->is_packed
)
163 num_components
= 4; /* can't check anything */
165 num_components
= src
->src
.reg
.reg
->num_components
;
167 for (unsigned i
= 0; i
< 4; i
++) {
168 assert(src
->swizzle
[i
] < 4);
170 if (nir_alu_instr_channel_used(instr
, index
, i
))
171 assert(src
->swizzle
[i
] < num_components
);
174 validate_src(&src
->src
, state
);
178 validate_reg_dest(nir_reg_dest
*dest
, validate_state
*state
)
180 assert(dest
->reg
!= NULL
);
182 struct set_entry
*entry
= _mesa_set_search(dest
->reg
->defs
, state
->instr
);
183 assert(entry
&& "definition not in nir_register.defs");
185 struct hash_entry
*entry2
;
186 entry2
= _mesa_hash_table_search(state
->regs
, dest
->reg
);
190 reg_validate_state
*reg_state
= (reg_validate_state
*) entry2
->data
;
191 _mesa_set_add(reg_state
->defs
, state
->instr
);
193 if (!dest
->reg
->is_global
) {
194 assert(reg_state
->where_defined
== state
->impl
&&
195 "writing to a register declared in a different function");
198 assert((dest
->reg
->num_array_elems
== 0 ||
199 dest
->base_offset
< dest
->reg
->num_array_elems
) &&
200 "definitely out-of-bounds array access");
202 if (dest
->indirect
) {
203 assert(dest
->reg
->num_array_elems
!= 0);
204 assert((dest
->indirect
->is_ssa
|| dest
->indirect
->reg
.indirect
== NULL
) &&
205 "only one level of indirection allowed");
206 validate_src(dest
->indirect
, state
);
211 validate_ssa_def(nir_ssa_def
*def
, validate_state
*state
)
213 assert(def
->index
< state
->impl
->ssa_alloc
);
214 assert(!BITSET_TEST(state
->ssa_defs_found
, def
->index
));
215 BITSET_SET(state
->ssa_defs_found
, def
->index
);
217 assert(def
->num_components
<= 4);
218 _mesa_hash_table_insert(state
->ssa_defs
, def
, state
->impl
);
222 validate_dest(nir_dest
*dest
, validate_state
*state
)
225 validate_ssa_def(&dest
->ssa
, state
);
227 validate_reg_dest(&dest
->reg
, state
);
231 validate_alu_dest(nir_alu_dest
*dest
, validate_state
*state
)
234 dest
->dest
.is_ssa
? dest
->dest
.ssa
.num_components
235 : dest
->dest
.reg
.reg
->num_components
;
236 bool is_packed
= !dest
->dest
.is_ssa
&& dest
->dest
.reg
.reg
->is_packed
;
238 * validate that the instruction doesn't write to components not in the
241 assert(is_packed
|| !(dest
->write_mask
& ~((1 << dest_size
) - 1)));
243 /* validate that saturate is only ever used on instructions with
244 * destinations of type float
246 nir_alu_instr
*alu
= nir_instr_as_alu(state
->instr
);
247 assert(nir_op_infos
[alu
->op
].output_type
== nir_type_float
||
250 validate_dest(&dest
->dest
, state
);
254 validate_alu_instr(nir_alu_instr
*instr
, validate_state
*state
)
256 assert(instr
->op
< nir_num_opcodes
);
258 validate_alu_dest(&instr
->dest
, state
);
260 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++) {
261 validate_alu_src(instr
, i
, state
);
266 validate_deref_chain(nir_deref
*deref
, validate_state
*state
)
268 nir_deref
*parent
= NULL
;
269 while (deref
!= NULL
) {
270 switch (deref
->deref_type
) {
271 case nir_deref_type_array
:
272 assert(deref
->type
== glsl_get_array_element(parent
->type
));
273 if (nir_deref_as_array(deref
)->deref_array_type
==
274 nir_deref_array_type_indirect
)
275 validate_src(&nir_deref_as_array(deref
)->indirect
, state
);
278 case nir_deref_type_struct
:
279 assert(deref
->type
==
280 glsl_get_struct_field(parent
->type
,
281 nir_deref_as_struct(deref
)->index
));
284 case nir_deref_type_var
:
288 assert(!"Invalid deref type");
293 deref
= deref
->child
;
298 validate_var_use(nir_variable
*var
, validate_state
*state
)
300 if (var
->data
.mode
== nir_var_local
) {
301 struct hash_entry
*entry
= _mesa_hash_table_search(state
->var_defs
, var
);
304 assert((nir_function_impl
*) entry
->data
== state
->impl
);
309 validate_deref_var(nir_deref_var
*deref
, validate_state
*state
)
311 assert(deref
!= NULL
);
312 assert(deref
->deref
.type
== deref
->var
->type
);
314 validate_var_use(deref
->var
, state
);
316 validate_deref_chain(&deref
->deref
, state
);
320 validate_intrinsic_instr(nir_intrinsic_instr
*instr
, validate_state
*state
)
322 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
323 for (unsigned i
= 0; i
< num_srcs
; i
++) {
324 unsigned components_read
=
325 nir_intrinsic_infos
[instr
->intrinsic
].src_components
[i
];
326 if (components_read
== 0)
327 components_read
= instr
->num_components
;
329 assert(components_read
> 0);
331 if (instr
->src
[i
].is_ssa
) {
332 assert(components_read
<= instr
->src
[i
].ssa
->num_components
);
333 } else if (!instr
->src
[i
].reg
.reg
->is_packed
) {
334 assert(components_read
<= instr
->src
[i
].reg
.reg
->num_components
);
337 validate_src(&instr
->src
[i
], state
);
340 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
) {
341 unsigned components_written
=
342 nir_intrinsic_infos
[instr
->intrinsic
].dest_components
;
343 if (components_written
== 0)
344 components_written
= instr
->num_components
;
346 assert(components_written
> 0);
348 if (instr
->dest
.is_ssa
) {
349 assert(components_written
<= instr
->dest
.ssa
.num_components
);
350 } else if (!instr
->dest
.reg
.reg
->is_packed
) {
351 assert(components_written
<= instr
->dest
.reg
.reg
->num_components
);
354 validate_dest(&instr
->dest
, state
);
357 unsigned num_vars
= nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
358 for (unsigned i
= 0; i
< num_vars
; i
++) {
359 validate_deref_var(instr
->variables
[i
], state
);
362 switch (instr
->intrinsic
) {
363 case nir_intrinsic_load_var
:
364 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_out
);
366 case nir_intrinsic_store_var
:
367 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
368 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
);
370 case nir_intrinsic_copy_var
:
371 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
372 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
);
373 assert(instr
->variables
[1]->var
->data
.mode
!= nir_var_shader_out
);
381 validate_tex_instr(nir_tex_instr
*instr
, validate_state
*state
)
383 validate_dest(&instr
->dest
, state
);
385 bool src_type_seen
[nir_num_tex_src_types
];
386 for (unsigned i
= 0; i
< nir_num_tex_src_types
; i
++)
387 src_type_seen
[i
] = false;
389 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++) {
390 assert(!src_type_seen
[instr
->src
[i
].src_type
]);
391 src_type_seen
[instr
->src
[i
].src_type
] = true;
392 validate_src(&instr
->src
[i
].src
, state
);
395 if (instr
->sampler
!= NULL
)
396 validate_deref_var(instr
->sampler
, state
);
400 validate_call_instr(nir_call_instr
*instr
, validate_state
*state
)
402 if (instr
->return_deref
== NULL
)
403 assert(glsl_type_is_void(instr
->callee
->return_type
));
405 assert(instr
->return_deref
->deref
.type
== instr
->callee
->return_type
);
407 assert(instr
->num_params
== instr
->callee
->num_params
);
409 for (unsigned i
= 0; i
< instr
->num_params
; i
++) {
410 assert(instr
->callee
->params
[i
].type
== instr
->params
[i
]->deref
.type
);
411 validate_deref_var(instr
->params
[i
], state
);
414 validate_deref_var(instr
->return_deref
, state
);
418 validate_load_const_instr(nir_load_const_instr
*instr
, validate_state
*state
)
420 validate_ssa_def(&instr
->def
, state
);
424 validate_ssa_undef_instr(nir_ssa_undef_instr
*instr
, validate_state
*state
)
426 validate_ssa_def(&instr
->def
, state
);
430 validate_phi_instr(nir_phi_instr
*instr
, validate_state
*state
)
433 * don't validate the sources until we get to them from their predecessor
434 * basic blocks, to avoid validating an SSA use before its definition.
437 validate_dest(&instr
->dest
, state
);
439 exec_list_validate(&instr
->srcs
);
440 assert(exec_list_length(&instr
->srcs
) ==
441 state
->block
->predecessors
->entries
);
445 validate_instr(nir_instr
*instr
, validate_state
*state
)
447 assert(instr
->block
== state
->block
);
449 state
->instr
= instr
;
451 switch (instr
->type
) {
452 case nir_instr_type_alu
:
453 validate_alu_instr(nir_instr_as_alu(instr
), state
);
456 case nir_instr_type_call
:
457 validate_call_instr(nir_instr_as_call(instr
), state
);
460 case nir_instr_type_intrinsic
:
461 validate_intrinsic_instr(nir_instr_as_intrinsic(instr
), state
);
464 case nir_instr_type_tex
:
465 validate_tex_instr(nir_instr_as_tex(instr
), state
);
468 case nir_instr_type_load_const
:
469 validate_load_const_instr(nir_instr_as_load_const(instr
), state
);
472 case nir_instr_type_phi
:
473 validate_phi_instr(nir_instr_as_phi(instr
), state
);
476 case nir_instr_type_ssa_undef
:
477 validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr
), state
);
480 case nir_instr_type_jump
:
484 assert(!"Invalid ALU instruction type");
490 validate_phi_src(nir_phi_instr
*instr
, nir_block
*pred
, validate_state
*state
)
492 state
->instr
= &instr
->instr
;
494 assert(instr
->dest
.is_ssa
);
496 exec_list_validate(&instr
->srcs
);
497 nir_foreach_phi_src(instr
, src
) {
498 if (src
->pred
== pred
) {
499 assert(src
->src
.is_ssa
);
500 assert(src
->src
.ssa
->num_components
==
501 instr
->dest
.ssa
.num_components
);
503 validate_src(&src
->src
, state
);
512 validate_phi_srcs(nir_block
*block
, nir_block
*succ
, validate_state
*state
)
514 nir_foreach_instr(succ
, instr
) {
515 if (instr
->type
!= nir_instr_type_phi
)
518 validate_phi_src(nir_instr_as_phi(instr
), block
, state
);
522 static void validate_cf_node(nir_cf_node
*node
, validate_state
*state
);
525 validate_block(nir_block
*block
, validate_state
*state
)
527 assert(block
->cf_node
.parent
== state
->parent_node
);
529 state
->block
= block
;
531 exec_list_validate(&block
->instr_list
);
532 nir_foreach_instr(block
, instr
) {
533 if (instr
->type
== nir_instr_type_phi
) {
534 assert(instr
== nir_block_first_instr(block
) ||
535 nir_instr_prev(instr
)->type
== nir_instr_type_phi
);
538 if (instr
->type
== nir_instr_type_jump
) {
539 assert(instr
== nir_block_last_instr(block
));
542 validate_instr(instr
, state
);
545 assert(block
->successors
[0] != NULL
);
547 for (unsigned i
= 0; i
< 2; i
++) {
548 if (block
->successors
[i
] != NULL
) {
549 struct set_entry
*entry
=
550 _mesa_set_search(block
->successors
[i
]->predecessors
, block
);
553 validate_phi_srcs(block
, block
->successors
[i
], state
);
557 if (!exec_list_is_empty(&block
->instr_list
) &&
558 nir_block_last_instr(block
)->type
== nir_instr_type_jump
)
559 assert(block
->successors
[1] == NULL
);
563 validate_if(nir_if
*if_stmt
, validate_state
*state
)
565 assert(!exec_node_is_head_sentinel(if_stmt
->cf_node
.node
.prev
));
566 nir_cf_node
*prev_node
= nir_cf_node_prev(&if_stmt
->cf_node
);
567 assert(prev_node
->type
== nir_cf_node_block
);
569 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
570 assert(&prev_block
->successors
[0]->cf_node
==
571 nir_if_first_then_node(if_stmt
));
572 assert(&prev_block
->successors
[1]->cf_node
==
573 nir_if_first_else_node(if_stmt
));
575 assert(!exec_node_is_tail_sentinel(if_stmt
->cf_node
.node
.next
));
576 nir_cf_node
*next_node
= nir_cf_node_next(&if_stmt
->cf_node
);
577 assert(next_node
->type
== nir_cf_node_block
);
579 if (!if_stmt
->condition
.is_ssa
) {
580 nir_register
*reg
= if_stmt
->condition
.reg
.reg
;
581 struct set_entry
*entry
= _mesa_set_search(reg
->if_uses
, if_stmt
);
584 nir_ssa_def
*def
= if_stmt
->condition
.ssa
;
585 struct set_entry
*entry
= _mesa_set_search(def
->if_uses
, if_stmt
);
589 assert(!exec_list_is_empty(&if_stmt
->then_list
));
590 assert(!exec_list_is_empty(&if_stmt
->else_list
));
592 nir_cf_node
*old_parent
= state
->parent_node
;
593 state
->parent_node
= &if_stmt
->cf_node
;
595 exec_list_validate(&if_stmt
->then_list
);
596 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->then_list
) {
597 validate_cf_node(cf_node
, state
);
600 exec_list_validate(&if_stmt
->else_list
);
601 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->else_list
) {
602 validate_cf_node(cf_node
, state
);
605 state
->parent_node
= old_parent
;
609 validate_loop(nir_loop
*loop
, validate_state
*state
)
611 assert(!exec_node_is_head_sentinel(loop
->cf_node
.node
.prev
));
612 nir_cf_node
*prev_node
= nir_cf_node_prev(&loop
->cf_node
);
613 assert(prev_node
->type
== nir_cf_node_block
);
615 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
616 assert(&prev_block
->successors
[0]->cf_node
== nir_loop_first_cf_node(loop
));
617 assert(prev_block
->successors
[1] == NULL
);
619 assert(!exec_node_is_tail_sentinel(loop
->cf_node
.node
.next
));
620 nir_cf_node
*next_node
= nir_cf_node_next(&loop
->cf_node
);
621 assert(next_node
->type
== nir_cf_node_block
);
623 assert(!exec_list_is_empty(&loop
->body
));
625 nir_cf_node
*old_parent
= state
->parent_node
;
626 state
->parent_node
= &loop
->cf_node
;
628 exec_list_validate(&loop
->body
);
629 foreach_list_typed(nir_cf_node
, cf_node
, node
, &loop
->body
) {
630 validate_cf_node(cf_node
, state
);
633 state
->parent_node
= old_parent
;
637 validate_cf_node(nir_cf_node
*node
, validate_state
*state
)
639 assert(node
->parent
== state
->parent_node
);
641 switch (node
->type
) {
642 case nir_cf_node_block
:
643 validate_block(nir_cf_node_as_block(node
), state
);
647 validate_if(nir_cf_node_as_if(node
), state
);
650 case nir_cf_node_loop
:
651 validate_loop(nir_cf_node_as_loop(node
), state
);
655 assert(!"Invalid ALU instruction type");
661 prevalidate_reg_decl(nir_register
*reg
, bool is_global
, validate_state
*state
)
663 assert(reg
->is_global
== is_global
);
666 assert(reg
->index
< state
->shader
->reg_alloc
);
668 assert(reg
->index
< state
->impl
->reg_alloc
);
669 assert(!BITSET_TEST(state
->regs_found
, reg
->index
));
670 BITSET_SET(state
->regs_found
, reg
->index
);
672 reg_validate_state
*reg_state
= ralloc(state
->regs
, reg_validate_state
);
673 reg_state
->uses
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
674 _mesa_key_pointer_equal
);
675 reg_state
->defs
= _mesa_set_create(reg_state
, _mesa_hash_pointer
,
676 _mesa_key_pointer_equal
);
678 reg_state
->where_defined
= is_global
? NULL
: state
->impl
;
680 _mesa_hash_table_insert(state
->regs
, reg
, reg_state
);
684 postvalidate_reg_decl(nir_register
*reg
, validate_state
*state
)
686 struct hash_entry
*entry
= _mesa_hash_table_search(state
->regs
, reg
);
688 reg_validate_state
*reg_state
= (reg_validate_state
*) entry
->data
;
690 if (reg_state
->uses
->entries
!= reg
->uses
->entries
) {
691 printf("extra entries in register uses:\n");
692 struct set_entry
*entry
;
693 set_foreach(reg
->uses
, entry
) {
694 struct set_entry
*entry2
=
695 _mesa_set_search(reg_state
->uses
, entry
->key
);
697 if (entry2
== NULL
) {
698 printf("%p\n", entry
->key
);
705 if (reg_state
->defs
->entries
!= reg
->defs
->entries
) {
706 printf("extra entries in register defs:\n");
707 struct set_entry
*entry
;
708 set_foreach(reg
->defs
, entry
) {
709 struct set_entry
*entry2
=
710 _mesa_set_search(reg_state
->defs
, entry
->key
);
712 if (entry2
== NULL
) {
713 printf("%p\n", entry
->key
);
722 validate_var_decl(nir_variable
*var
, bool is_global
, validate_state
*state
)
724 assert(is_global
!= (var
->data
.mode
== nir_var_local
));
727 * TODO validate some things ir_validate.cpp does (requires more GLSL type
732 _mesa_hash_table_insert(state
->var_defs
, var
, state
->impl
);
737 validate_function_impl(nir_function_impl
*impl
, validate_state
*state
)
739 assert(impl
->overload
->impl
== impl
);
740 assert(impl
->cf_node
.parent
== NULL
);
742 assert(impl
->num_params
== impl
->overload
->num_params
);
743 for (unsigned i
= 0; i
< impl
->num_params
; i
++)
744 assert(impl
->params
[i
]->type
== impl
->overload
->params
[i
].type
);
746 if (glsl_type_is_void(impl
->overload
->return_type
))
747 assert(impl
->return_var
== NULL
);
749 assert(impl
->return_var
->type
== impl
->overload
->return_type
);
751 assert(exec_list_is_empty(&impl
->end_block
->instr_list
));
752 assert(impl
->end_block
->successors
[0] == NULL
);
753 assert(impl
->end_block
->successors
[1] == NULL
);
756 state
->parent_node
= &impl
->cf_node
;
758 exec_list_validate(&impl
->locals
);
759 foreach_list_typed(nir_variable
, var
, node
, &impl
->locals
) {
760 validate_var_decl(var
, false, state
);
763 state
->regs_found
= realloc(state
->regs_found
,
764 BITSET_WORDS(impl
->reg_alloc
) *
765 sizeof(BITSET_WORD
));
766 memset(state
->regs_found
, 0, BITSET_WORDS(impl
->reg_alloc
) *
767 sizeof(BITSET_WORD
));
768 exec_list_validate(&impl
->registers
);
769 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
770 prevalidate_reg_decl(reg
, false, state
);
773 state
->ssa_defs_found
= realloc(state
->ssa_defs_found
,
774 BITSET_WORDS(impl
->ssa_alloc
) *
775 sizeof(BITSET_WORD
));
776 memset(state
->ssa_defs_found
, 0, BITSET_WORDS(impl
->ssa_alloc
) *
777 sizeof(BITSET_WORD
));
778 exec_list_validate(&impl
->body
);
779 foreach_list_typed(nir_cf_node
, node
, node
, &impl
->body
) {
780 validate_cf_node(node
, state
);
783 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
784 postvalidate_reg_decl(reg
, state
);
789 validate_function_overload(nir_function_overload
*overload
,
790 validate_state
*state
)
792 if (overload
->impl
!= NULL
)
793 validate_function_impl(overload
->impl
, state
);
797 validate_function(nir_function
*func
, validate_state
*state
)
799 exec_list_validate(&func
->overload_list
);
800 foreach_list_typed(nir_function_overload
, overload
, node
, &func
->overload_list
) {
801 assert(overload
->function
== func
);
802 validate_function_overload(overload
, state
);
807 init_validate_state(validate_state
*state
)
809 state
->regs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
810 _mesa_key_pointer_equal
);
811 state
->ssa_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
812 _mesa_key_pointer_equal
);
813 state
->ssa_defs_found
= NULL
;
814 state
->regs_found
= NULL
;
815 state
->var_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
816 _mesa_key_pointer_equal
);
820 destroy_validate_state(validate_state
*state
)
822 _mesa_hash_table_destroy(state
->regs
, NULL
);
823 _mesa_hash_table_destroy(state
->ssa_defs
, NULL
);
824 free(state
->ssa_defs_found
);
825 free(state
->regs_found
);
826 _mesa_hash_table_destroy(state
->var_defs
, NULL
);
830 nir_validate_shader(nir_shader
*shader
)
832 validate_state state
;
833 init_validate_state(&state
);
835 state
.shader
= shader
;
837 struct hash_entry
*entry
;
838 hash_table_foreach(shader
->uniforms
, entry
) {
839 validate_var_decl((nir_variable
*) entry
->data
, true, &state
);
842 hash_table_foreach(shader
->inputs
, entry
) {
843 validate_var_decl((nir_variable
*) entry
->data
, true, &state
);
846 hash_table_foreach(shader
->outputs
, entry
) {
847 validate_var_decl((nir_variable
*) entry
->data
, true, &state
);
850 exec_list_validate(&shader
->globals
);
851 foreach_list_typed(nir_variable
, var
, node
, &shader
->globals
) {
852 validate_var_decl(var
, true, &state
);
855 exec_list_validate(&shader
->system_values
);
856 foreach_list_typed(nir_variable
, var
, node
, &shader
->system_values
) {
857 validate_var_decl(var
, true, &state
);
860 state
.regs_found
= realloc(state
.regs_found
,
861 BITSET_WORDS(shader
->reg_alloc
) *
862 sizeof(BITSET_WORD
));
863 memset(state
.regs_found
, 0, BITSET_WORDS(shader
->reg_alloc
) *
864 sizeof(BITSET_WORD
));
865 exec_list_validate(&shader
->registers
);
866 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
867 prevalidate_reg_decl(reg
, true, &state
);
870 exec_list_validate(&shader
->functions
);
871 foreach_list_typed(nir_function
, func
, node
, &shader
->functions
) {
872 validate_function(func
, &state
);
875 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
876 postvalidate_reg_decl(reg
, &state
);
879 destroy_validate_state(&state
);