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.
36 * Per-register validation state.
41 * equivalent to the uses and defs in nir_register, but built up by the
42 * validator. At the end, we verify that the sets have the same entries.
44 struct set
*uses
, *defs
;
45 nir_function_impl
*where_defined
; /* NULL for global registers */
49 /* map of register -> validation state (struct above) */
50 struct hash_table
*regs
;
52 /* the current shader being validated */
55 /* the current instruction being validated */
58 /* the current basic block being validated */
61 /* the current if statement being validated */
64 /* the parent of the current cf node being visited */
65 nir_cf_node
*parent_node
;
67 /* the current function implementation being validated */
68 nir_function_impl
*impl
;
70 /* map of SSA value -> function implementation where it is defined */
71 struct hash_table
*ssa_defs
;
73 /* bitset of ssa definitions we have found; used to check uniqueness */
74 BITSET_WORD
*ssa_defs_found
;
76 /* bitset of registers we have currently found; used to check uniqueness */
77 BITSET_WORD
*regs_found
;
79 /* map of local variable -> function implementation where it is defined */
80 struct hash_table
*var_defs
;
83 static void validate_src(nir_src
*src
, validate_state
*state
);
86 validate_reg_src(nir_reg_src
*src
, validate_state
*state
)
88 assert(src
->reg
!= NULL
);
90 struct set_entry
*entry
=
91 _mesa_set_search(src
->reg
->uses
, _mesa_hash_pointer(state
->instr
),
93 assert(entry
&& "use not in nir_register.uses");
95 struct hash_entry
*entry2
;
96 entry2
= _mesa_hash_table_search(state
->regs
, src
->reg
);
100 reg_validate_state
*reg_state
= (reg_validate_state
*) entry2
->data
;
101 _mesa_set_add(reg_state
->uses
, _mesa_hash_pointer(state
->instr
),
104 if (!src
->reg
->is_global
) {
105 assert(reg_state
->where_defined
== state
->impl
&&
106 "using a register declared in a different function");
109 assert((src
->reg
->num_array_elems
== 0 ||
110 src
->base_offset
< src
->reg
->num_array_elems
) &&
111 "definitely out-of-bounds array access");
114 assert(src
->reg
->num_array_elems
!= 0);
115 assert((src
->indirect
->is_ssa
|| src
->indirect
->reg
.indirect
== NULL
) &&
116 "only one level of indirection allowed");
117 validate_src(src
->indirect
, state
);
122 validate_ssa_src(nir_ssa_def
*def
, validate_state
*state
)
126 struct hash_entry
*entry
= _mesa_hash_table_search(state
->ssa_defs
, def
);
130 assert((nir_function_impl
*) entry
->data
== state
->impl
&&
131 "using an SSA value defined in a different function");
133 struct set_entry
*entry2
;
135 entry2
= _mesa_set_search(def
->uses
, _mesa_hash_pointer(state
->instr
),
138 assert(entry2
&& "SSA use missing");
140 /* TODO validate that the use is dominated by the definition */
144 validate_src(nir_src
*src
, validate_state
*state
)
147 validate_ssa_src(src
->ssa
, state
);
149 validate_reg_src(&src
->reg
, state
);
153 validate_alu_src(nir_alu_instr
*instr
, unsigned index
, validate_state
*state
)
155 nir_alu_src
*src
= &instr
->src
[index
];
157 unsigned num_components
;
159 num_components
= src
->src
.ssa
->num_components
;
161 if (src
->src
.reg
.reg
->is_packed
)
162 num_components
= 4; /* can't check anything */
164 num_components
= src
->src
.reg
.reg
->num_components
;
166 for (unsigned i
= 0; i
< 4; i
++) {
167 assert(src
->swizzle
[i
] < 4);
169 if (nir_alu_instr_channel_used(instr
, index
, i
))
170 assert(src
->swizzle
[i
] < num_components
);
173 validate_src(&src
->src
, state
);
177 validate_reg_dest(nir_reg_dest
*dest
, validate_state
*state
)
179 assert(dest
->reg
!= NULL
);
181 struct set_entry
*entry
=
182 _mesa_set_search(dest
->reg
->defs
, _mesa_hash_pointer(state
->instr
),
184 assert(entry
&& "definition not in nir_register.defs");
186 struct hash_entry
*entry2
;
187 entry2
= _mesa_hash_table_search(state
->regs
, dest
->reg
);
191 reg_validate_state
*reg_state
= (reg_validate_state
*) entry2
->data
;
192 _mesa_set_add(reg_state
->defs
, _mesa_hash_pointer(state
->instr
),
195 if (!dest
->reg
->is_global
) {
196 assert(reg_state
->where_defined
== state
->impl
&&
197 "writing to a register declared in a different function");
200 assert((dest
->reg
->num_array_elems
== 0 ||
201 dest
->base_offset
< dest
->reg
->num_array_elems
) &&
202 "definitely out-of-bounds array access");
204 if (dest
->indirect
) {
205 assert(dest
->reg
->num_array_elems
!= 0);
206 assert((dest
->indirect
->is_ssa
|| dest
->indirect
->reg
.indirect
== NULL
) &&
207 "only one level of indirection allowed");
208 validate_src(dest
->indirect
, state
);
213 validate_ssa_def(nir_ssa_def
*def
, validate_state
*state
)
215 assert(def
->index
< state
->impl
->ssa_alloc
);
216 assert(!BITSET_TEST(state
->ssa_defs_found
, def
->index
));
217 BITSET_SET(state
->ssa_defs_found
, def
->index
);
219 assert(def
->num_components
<= 4);
220 _mesa_hash_table_insert(state
->ssa_defs
, def
, state
->impl
);
224 validate_dest(nir_dest
*dest
, validate_state
*state
)
227 validate_ssa_def(&dest
->ssa
, state
);
229 validate_reg_dest(&dest
->reg
, state
);
233 validate_alu_dest(nir_alu_dest
*dest
, validate_state
*state
)
236 dest
->dest
.is_ssa
? dest
->dest
.ssa
.num_components
237 : dest
->dest
.reg
.reg
->num_components
;
238 bool is_packed
= !dest
->dest
.is_ssa
&& dest
->dest
.reg
.reg
->is_packed
;
240 * validate that the instruction doesn't write to components not in the
243 assert(is_packed
|| !(dest
->write_mask
& ~((1 << dest_size
) - 1)));
244 validate_dest(&dest
->dest
, state
);
248 validate_alu_instr(nir_alu_instr
*instr
, validate_state
*state
)
250 assert(instr
->op
< nir_num_opcodes
);
252 validate_alu_dest(&instr
->dest
, state
);
254 for (unsigned i
= 0; i
< nir_op_infos
[instr
->op
].num_inputs
; i
++) {
255 validate_alu_src(instr
, i
, state
);
260 validate_deref_chain(nir_deref
*deref
, validate_state
*state
)
262 nir_deref
*parent
= NULL
;
263 while (deref
!= NULL
) {
264 switch (deref
->deref_type
) {
265 case nir_deref_type_array
:
266 assert(deref
->type
== glsl_get_array_element(parent
->type
));
267 if (nir_deref_as_array(deref
)->deref_array_type
==
268 nir_deref_array_type_indirect
)
269 validate_src(&nir_deref_as_array(deref
)->indirect
, state
);
272 case nir_deref_type_struct
:
273 assert(deref
->type
==
274 glsl_get_struct_field(parent
->type
,
275 nir_deref_as_struct(deref
)->index
));
278 case nir_deref_type_var
:
282 assert(!"Invalid deref type");
287 deref
= deref
->child
;
292 validate_var_use(nir_variable
*var
, validate_state
*state
)
294 if (var
->data
.mode
== nir_var_local
) {
295 struct hash_entry
*entry
= _mesa_hash_table_search(state
->var_defs
, var
);
298 assert((nir_function_impl
*) entry
->data
== state
->impl
);
303 validate_deref_var(nir_deref_var
*deref
, validate_state
*state
)
305 assert(deref
!= NULL
);
306 assert(deref
->deref
.type
== deref
->var
->type
);
308 validate_var_use(deref
->var
, state
);
310 validate_deref_chain(&deref
->deref
, state
);
314 validate_intrinsic_instr(nir_intrinsic_instr
*instr
, validate_state
*state
)
316 unsigned num_srcs
= nir_intrinsic_infos
[instr
->intrinsic
].num_srcs
;
317 for (unsigned i
= 0; i
< num_srcs
; i
++) {
318 unsigned components_read
=
319 nir_intrinsic_infos
[instr
->intrinsic
].src_components
[i
];
320 if (components_read
== 0)
321 components_read
= instr
->num_components
;
323 assert(components_read
> 0);
325 if (instr
->src
[i
].is_ssa
) {
326 assert(components_read
<= instr
->src
[i
].ssa
->num_components
);
327 } else if (!instr
->src
[i
].reg
.reg
->is_packed
) {
328 assert(components_read
<= instr
->src
[i
].reg
.reg
->num_components
);
331 validate_src(&instr
->src
[i
], state
);
334 if (nir_intrinsic_infos
[instr
->intrinsic
].has_dest
) {
335 unsigned components_written
=
336 nir_intrinsic_infos
[instr
->intrinsic
].dest_components
;
337 if (components_written
== 0)
338 components_written
= instr
->num_components
;
340 assert(components_written
> 0);
342 if (instr
->dest
.is_ssa
) {
343 assert(components_written
<= instr
->dest
.ssa
.num_components
);
344 } else if (!instr
->dest
.reg
.reg
->is_packed
) {
345 assert(components_written
<= instr
->dest
.reg
.reg
->num_components
);
348 validate_dest(&instr
->dest
, state
);
351 unsigned num_vars
= nir_intrinsic_infos
[instr
->intrinsic
].num_variables
;
352 for (unsigned i
= 0; i
< num_vars
; i
++) {
353 validate_deref_var(instr
->variables
[i
], state
);
356 switch (instr
->intrinsic
) {
357 case nir_intrinsic_load_var
:
358 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_out
);
360 case nir_intrinsic_store_var
:
361 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
362 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
);
364 case nir_intrinsic_copy_var
:
365 assert(instr
->variables
[0]->var
->data
.mode
!= nir_var_shader_in
&&
366 instr
->variables
[0]->var
->data
.mode
!= nir_var_uniform
);
367 assert(instr
->variables
[1]->var
->data
.mode
!= nir_var_shader_out
);
375 validate_tex_instr(nir_tex_instr
*instr
, validate_state
*state
)
377 validate_dest(&instr
->dest
, state
);
379 bool src_type_seen
[nir_num_texinput_types
];
380 for (unsigned i
= 0; i
< nir_num_texinput_types
; i
++)
381 src_type_seen
[i
] = false;
383 for (unsigned i
= 0; i
< instr
->num_srcs
; i
++) {
384 assert(!src_type_seen
[instr
->src_type
[i
]]);
385 src_type_seen
[instr
->src_type
[i
]] = true;
386 validate_src(&instr
->src
[i
], state
);
389 if (instr
->sampler
!= NULL
)
390 validate_deref_var(instr
->sampler
, state
);
394 validate_call_instr(nir_call_instr
*instr
, validate_state
*state
)
396 if (instr
->return_deref
== NULL
)
397 assert(glsl_type_is_void(instr
->callee
->return_type
));
399 assert(instr
->return_deref
->deref
.type
== instr
->callee
->return_type
);
401 assert(instr
->num_params
== instr
->callee
->num_params
);
403 for (unsigned i
= 0; i
< instr
->num_params
; i
++) {
404 assert(instr
->callee
->params
[i
].type
== instr
->params
[i
]->deref
.type
);
405 validate_deref_var(instr
->params
[i
], state
);
408 validate_deref_var(instr
->return_deref
, state
);
412 validate_load_const_instr(nir_load_const_instr
*instr
, validate_state
*state
)
414 validate_dest(&instr
->dest
, state
);
416 if (instr
->array_elems
!= 0) {
417 assert(!instr
->dest
.is_ssa
);
418 assert(instr
->dest
.reg
.base_offset
+ instr
->array_elems
<=
419 instr
->dest
.reg
.reg
->num_array_elems
);
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 foreach_list_typed(nir_phi_src
, src
, node
, &instr
->srcs
) {
498 if (src
->pred
== pred
) {
499 unsigned num_components
;
501 num_components
= src
->src
.ssa
->num_components
;
503 if (src
->src
.reg
.reg
->is_packed
)
504 num_components
= 4; /* can't check anything */
506 num_components
= src
->src
.reg
.reg
->num_components
;
508 assert(num_components
== instr
->dest
.ssa
.num_components
);
510 validate_src(&src
->src
, state
);
519 validate_phi_srcs(nir_block
*block
, nir_block
*succ
, validate_state
*state
)
521 nir_foreach_instr(succ
, instr
) {
522 if (instr
->type
!= nir_instr_type_phi
)
525 validate_phi_src(nir_instr_as_phi(instr
), block
, state
);
529 static void validate_cf_node(nir_cf_node
*node
, validate_state
*state
);
532 validate_block(nir_block
*block
, validate_state
*state
)
534 assert(block
->cf_node
.parent
== state
->parent_node
);
536 state
->block
= block
;
538 exec_list_validate(&block
->instr_list
);
539 nir_foreach_instr(block
, instr
) {
540 if (instr
->type
== nir_instr_type_phi
) {
541 assert(instr
== nir_block_first_instr(block
) ||
542 nir_instr_prev(instr
)->type
== nir_instr_type_phi
);
545 if (instr
->type
== nir_instr_type_jump
) {
546 assert(instr
== nir_block_last_instr(block
));
549 validate_instr(instr
, state
);
552 assert(block
->successors
[0] != NULL
);
554 for (unsigned i
= 0; i
< 2; i
++) {
555 if (block
->successors
[i
] != NULL
) {
556 struct set_entry
*entry
=
557 _mesa_set_search(block
->successors
[i
]->predecessors
,
558 _mesa_hash_pointer(block
), block
);
561 validate_phi_srcs(block
, block
->successors
[i
], state
);
565 if (!exec_list_is_empty(&block
->instr_list
) &&
566 nir_block_last_instr(block
)->type
== nir_instr_type_jump
)
567 assert(block
->successors
[1] == NULL
);
571 validate_if(nir_if
*if_stmt
, validate_state
*state
)
573 assert(!exec_node_is_head_sentinel(if_stmt
->cf_node
.node
.prev
));
574 nir_cf_node
*prev_node
= nir_cf_node_prev(&if_stmt
->cf_node
);
575 assert(prev_node
->type
== nir_cf_node_block
);
577 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
578 assert(&prev_block
->successors
[0]->cf_node
==
579 nir_if_first_then_node(if_stmt
));
580 assert(&prev_block
->successors
[1]->cf_node
==
581 nir_if_first_else_node(if_stmt
));
583 assert(!exec_node_is_tail_sentinel(if_stmt
->cf_node
.node
.next
));
584 nir_cf_node
*next_node
= nir_cf_node_next(&if_stmt
->cf_node
);
585 assert(next_node
->type
== nir_cf_node_block
);
587 if (!if_stmt
->condition
.is_ssa
) {
588 nir_register
*reg
= if_stmt
->condition
.reg
.reg
;
589 struct set_entry
*entry
=
590 _mesa_set_search(reg
->if_uses
, _mesa_hash_pointer(if_stmt
), if_stmt
);
593 nir_ssa_def
*def
= if_stmt
->condition
.ssa
;
594 struct set_entry
*entry
=
595 _mesa_set_search(def
->if_uses
, _mesa_hash_pointer(if_stmt
), if_stmt
);
599 assert(!exec_list_is_empty(&if_stmt
->then_list
));
600 assert(!exec_list_is_empty(&if_stmt
->else_list
));
602 nir_cf_node
*old_parent
= state
->parent_node
;
603 state
->parent_node
= &if_stmt
->cf_node
;
605 exec_list_validate(&if_stmt
->then_list
);
606 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->then_list
) {
607 validate_cf_node(cf_node
, state
);
610 exec_list_validate(&if_stmt
->else_list
);
611 foreach_list_typed(nir_cf_node
, cf_node
, node
, &if_stmt
->else_list
) {
612 validate_cf_node(cf_node
, state
);
615 state
->parent_node
= old_parent
;
619 validate_loop(nir_loop
*loop
, validate_state
*state
)
621 assert(!exec_node_is_head_sentinel(loop
->cf_node
.node
.prev
));
622 nir_cf_node
*prev_node
= nir_cf_node_prev(&loop
->cf_node
);
623 assert(prev_node
->type
== nir_cf_node_block
);
625 nir_block
*prev_block
= nir_cf_node_as_block(prev_node
);
626 assert(&prev_block
->successors
[0]->cf_node
== nir_loop_first_cf_node(loop
));
627 assert(prev_block
->successors
[1] == NULL
);
629 assert(!exec_node_is_tail_sentinel(loop
->cf_node
.node
.next
));
630 nir_cf_node
*next_node
= nir_cf_node_next(&loop
->cf_node
);
631 assert(next_node
->type
== nir_cf_node_block
);
633 assert(!exec_list_is_empty(&loop
->body
));
635 nir_cf_node
*old_parent
= state
->parent_node
;
636 state
->parent_node
= &loop
->cf_node
;
638 exec_list_validate(&loop
->body
);
639 foreach_list_typed(nir_cf_node
, cf_node
, node
, &loop
->body
) {
640 validate_cf_node(cf_node
, state
);
643 state
->parent_node
= old_parent
;
647 validate_cf_node(nir_cf_node
*node
, validate_state
*state
)
649 assert(node
->parent
== state
->parent_node
);
651 switch (node
->type
) {
652 case nir_cf_node_block
:
653 validate_block(nir_cf_node_as_block(node
), state
);
657 validate_if(nir_cf_node_as_if(node
), state
);
660 case nir_cf_node_loop
:
661 validate_loop(nir_cf_node_as_loop(node
), state
);
665 assert(!"Invalid ALU instruction type");
671 prevalidate_reg_decl(nir_register
*reg
, bool is_global
, validate_state
*state
)
673 assert(reg
->is_global
== is_global
);
676 assert(reg
->index
< state
->shader
->reg_alloc
);
678 assert(reg
->index
< state
->impl
->reg_alloc
);
679 assert(!BITSET_TEST(state
->regs_found
, reg
->index
));
680 BITSET_SET(state
->regs_found
, reg
->index
);
682 reg_validate_state
*reg_state
= ralloc(state
->regs
, reg_validate_state
);
683 reg_state
->uses
= _mesa_set_create(reg_state
, _mesa_key_pointer_equal
);
684 reg_state
->defs
= _mesa_set_create(reg_state
, _mesa_key_pointer_equal
);
686 reg_state
->where_defined
= is_global
? NULL
: state
->impl
;
688 _mesa_hash_table_insert(state
->regs
, reg
, reg_state
);
692 postvalidate_reg_decl(nir_register
*reg
, validate_state
*state
)
694 struct hash_entry
*entry
= _mesa_hash_table_search(state
->regs
, reg
);
696 reg_validate_state
*reg_state
= (reg_validate_state
*) entry
->data
;
698 if (reg_state
->uses
->entries
!= reg
->uses
->entries
) {
699 printf("extra entries in register uses:\n");
700 struct set_entry
*entry
;
701 set_foreach(reg
->uses
, entry
) {
702 struct set_entry
*entry2
=
703 _mesa_set_search(reg_state
->uses
, _mesa_hash_pointer(entry
->key
),
706 if (entry2
== NULL
) {
707 printf("%p\n", entry
->key
);
714 if (reg_state
->defs
->entries
!= reg
->defs
->entries
) {
715 printf("extra entries in register defs:\n");
716 struct set_entry
*entry
;
717 set_foreach(reg
->defs
, entry
) {
718 struct set_entry
*entry2
=
719 _mesa_set_search(reg_state
->defs
, _mesa_hash_pointer(entry
->key
),
722 if (entry2
== NULL
) {
723 printf("%p\n", entry
->key
);
732 validate_var_decl(nir_variable
*var
, bool is_global
, validate_state
*state
)
734 assert(is_global
!= (var
->data
.mode
== nir_var_local
));
737 * TODO validate some things ir_validate.cpp does (requires more GLSL type
742 _mesa_hash_table_insert(state
->var_defs
, var
, state
->impl
);
747 validate_function_impl(nir_function_impl
*impl
, validate_state
*state
)
749 assert(impl
->overload
->impl
== impl
);
750 assert(impl
->cf_node
.parent
== NULL
);
752 assert(impl
->num_params
== impl
->overload
->num_params
);
753 for (unsigned i
= 0; i
< impl
->num_params
; i
++)
754 assert(impl
->params
[i
]->type
== impl
->overload
->params
[i
].type
);
756 if (glsl_type_is_void(impl
->overload
->return_type
))
757 assert(impl
->return_var
== NULL
);
759 assert(impl
->return_var
->type
== impl
->overload
->return_type
);
761 assert(exec_list_is_empty(&impl
->end_block
->instr_list
));
762 assert(impl
->end_block
->successors
[0] == NULL
);
763 assert(impl
->end_block
->successors
[1] == NULL
);
766 state
->parent_node
= &impl
->cf_node
;
768 exec_list_validate(&impl
->locals
);
769 foreach_list_typed(nir_variable
, var
, node
, &impl
->locals
) {
770 validate_var_decl(var
, false, state
);
773 state
->regs_found
= realloc(state
->regs_found
,
774 BITSET_WORDS(impl
->reg_alloc
) *
775 sizeof(BITSET_WORD
));
776 memset(state
->regs_found
, 0, BITSET_WORDS(impl
->reg_alloc
) *
777 sizeof(BITSET_WORD
));
778 exec_list_validate(&impl
->registers
);
779 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
780 prevalidate_reg_decl(reg
, false, state
);
783 state
->ssa_defs_found
= realloc(state
->ssa_defs_found
,
784 BITSET_WORDS(impl
->ssa_alloc
) *
785 sizeof(BITSET_WORD
));
786 memset(state
->ssa_defs_found
, 0, BITSET_WORDS(impl
->ssa_alloc
) *
787 sizeof(BITSET_WORD
));
788 exec_list_validate(&impl
->body
);
789 foreach_list_typed(nir_cf_node
, node
, node
, &impl
->body
) {
790 validate_cf_node(node
, state
);
793 foreach_list_typed(nir_register
, reg
, node
, &impl
->registers
) {
794 postvalidate_reg_decl(reg
, state
);
799 validate_function_overload(nir_function_overload
*overload
,
800 validate_state
*state
)
802 if (overload
->impl
!= NULL
)
803 validate_function_impl(overload
->impl
, state
);
807 validate_function(nir_function
*func
, validate_state
*state
)
809 exec_list_validate(&func
->overload_list
);
810 foreach_list_typed(nir_function_overload
, overload
, node
, &func
->overload_list
) {
811 assert(overload
->function
== func
);
812 validate_function_overload(overload
, state
);
817 init_validate_state(validate_state
*state
)
819 state
->regs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
820 _mesa_key_pointer_equal
);
821 state
->ssa_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
822 _mesa_key_pointer_equal
);
823 state
->ssa_defs_found
= NULL
;
824 state
->regs_found
= NULL
;
825 state
->var_defs
= _mesa_hash_table_create(NULL
, _mesa_hash_pointer
,
826 _mesa_key_pointer_equal
);
830 destroy_validate_state(validate_state
*state
)
832 _mesa_hash_table_destroy(state
->regs
, NULL
);
833 _mesa_hash_table_destroy(state
->ssa_defs
, NULL
);
834 free(state
->ssa_defs_found
);
835 free(state
->regs_found
);
836 _mesa_hash_table_destroy(state
->var_defs
, NULL
);
840 nir_validate_shader(nir_shader
*shader
)
842 validate_state state
;
843 init_validate_state(&state
);
845 state
.shader
= shader
;
847 struct hash_entry
*entry
;
848 hash_table_foreach(shader
->uniforms
, entry
) {
849 validate_var_decl((nir_variable
*) entry
->data
, true, &state
);
852 hash_table_foreach(shader
->inputs
, entry
) {
853 validate_var_decl((nir_variable
*) entry
->data
, true, &state
);
856 hash_table_foreach(shader
->outputs
, entry
) {
857 validate_var_decl((nir_variable
*) entry
->data
, true, &state
);
860 exec_list_validate(&shader
->globals
);
861 foreach_list_typed(nir_variable
, var
, node
, &shader
->globals
) {
862 validate_var_decl(var
, true, &state
);
865 exec_list_validate(&shader
->system_values
);
866 foreach_list_typed(nir_variable
, var
, node
, &shader
->system_values
) {
867 validate_var_decl(var
, true, &state
);
870 state
.regs_found
= realloc(state
.regs_found
,
871 BITSET_WORDS(shader
->reg_alloc
) *
872 sizeof(BITSET_WORD
));
873 memset(state
.regs_found
, 0, BITSET_WORDS(shader
->reg_alloc
) *
874 sizeof(BITSET_WORD
));
875 exec_list_validate(&shader
->registers
);
876 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
877 prevalidate_reg_decl(reg
, true, &state
);
880 exec_list_validate(&shader
->functions
);
881 foreach_list_typed(nir_function
, func
, node
, &shader
->functions
) {
882 validate_function(func
, &state
);
885 foreach_list_typed(nir_register
, reg
, node
, &shader
->registers
) {
886 postvalidate_reg_decl(reg
, &state
);
889 destroy_validate_state(&state
);