nir: Add goto_if jump instruction
[mesa.git] / src / compiler / nir / nir_validate.c
1 /*
2 * Copyright © 2014 Intel Corporation
3 *
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:
10 *
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
13 * Software.
14 *
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
21 * IN THE SOFTWARE.
22 *
23 * Authors:
24 * Connor Abbott (cwabbott0@gmail.com)
25 *
26 */
27
28 #include "nir.h"
29 #include "c11/threads.h"
30 #include <assert.h>
31
32 /*
33 * This file checks for invalid IR indicating a bug somewhere in the compiler.
34 */
35
36 /* Since this file is just a pile of asserts, don't bother compiling it if
37 * we're not building a debug build.
38 */
39 #ifndef NDEBUG
40
41 /*
42 * Per-register validation state.
43 */
44
45 typedef struct {
46 /*
47 * equivalent to the uses and defs in nir_register, but built up by the
48 * validator. At the end, we verify that the sets have the same entries.
49 */
50 struct set *uses, *if_uses, *defs;
51 nir_function_impl *where_defined; /* NULL for global registers */
52 } reg_validate_state;
53
54 typedef struct {
55 void *mem_ctx;
56
57 /* map of register -> validation state (struct above) */
58 struct hash_table *regs;
59
60 /* the current shader being validated */
61 nir_shader *shader;
62
63 /* the current instruction being validated */
64 nir_instr *instr;
65
66 /* the current variable being validated */
67 nir_variable *var;
68
69 /* the current basic block being validated */
70 nir_block *block;
71
72 /* the current if statement being validated */
73 nir_if *if_stmt;
74
75 /* the current loop being visited */
76 nir_loop *loop;
77
78 /* the parent of the current cf node being visited */
79 nir_cf_node *parent_node;
80
81 /* the current function implementation being validated */
82 nir_function_impl *impl;
83
84 /* Set of seen SSA sources */
85 struct set *ssa_srcs;
86
87 /* bitset of ssa definitions we have found; used to check uniqueness */
88 BITSET_WORD *ssa_defs_found;
89
90 /* bitset of registers we have currently found; used to check uniqueness */
91 BITSET_WORD *regs_found;
92
93 /* map of variable -> function implementation where it is defined or NULL
94 * if it is a global variable
95 */
96 struct hash_table *var_defs;
97
98 /* map of instruction/var/etc to failed assert string */
99 struct hash_table *errors;
100 } validate_state;
101
102 static void
103 log_error(validate_state *state, const char *cond, const char *file, int line)
104 {
105 const void *obj;
106
107 if (state->instr)
108 obj = state->instr;
109 else if (state->var)
110 obj = state->var;
111 else
112 obj = cond;
113
114 char *msg = ralloc_asprintf(state->errors, "error: %s (%s:%d)",
115 cond, file, line);
116
117 _mesa_hash_table_insert(state->errors, obj, msg);
118 }
119
120 #define validate_assert(state, cond) do { \
121 if (!(cond)) \
122 log_error(state, #cond, __FILE__, __LINE__); \
123 } while (0)
124
125 static void validate_src(nir_src *src, validate_state *state,
126 unsigned bit_sizes, unsigned num_components);
127
128 static void
129 validate_num_components(validate_state *state, unsigned num_components)
130 {
131 validate_assert(state, nir_num_components_valid(num_components));
132 }
133
134 static void
135 validate_reg_src(nir_src *src, validate_state *state,
136 unsigned bit_sizes, unsigned num_components)
137 {
138 validate_assert(state, src->reg.reg != NULL);
139
140 struct hash_entry *entry;
141 entry = _mesa_hash_table_search(state->regs, src->reg.reg);
142 validate_assert(state, entry);
143
144 reg_validate_state *reg_state = (reg_validate_state *) entry->data;
145
146 if (state->instr) {
147 _mesa_set_add(reg_state->uses, src);
148 } else {
149 validate_assert(state, state->if_stmt);
150 _mesa_set_add(reg_state->if_uses, src);
151 }
152
153 validate_assert(state, reg_state->where_defined == state->impl &&
154 "using a register declared in a different function");
155
156 if (bit_sizes)
157 validate_assert(state, src->reg.reg->bit_size & bit_sizes);
158 if (num_components)
159 validate_assert(state, src->reg.reg->num_components == num_components);
160
161 validate_assert(state, (src->reg.reg->num_array_elems == 0 ||
162 src->reg.base_offset < src->reg.reg->num_array_elems) &&
163 "definitely out-of-bounds array access");
164
165 if (src->reg.indirect) {
166 validate_assert(state, src->reg.reg->num_array_elems != 0);
167 validate_assert(state, (src->reg.indirect->is_ssa ||
168 src->reg.indirect->reg.indirect == NULL) &&
169 "only one level of indirection allowed");
170 validate_src(src->reg.indirect, state, 32, 1);
171 }
172 }
173
174 #define SET_PTR_BIT(ptr, bit) \
175 (void *)(((uintptr_t)(ptr)) | (((uintptr_t)1) << bit))
176
177 static void
178 validate_ssa_src(nir_src *src, validate_state *state,
179 unsigned bit_sizes, unsigned num_components)
180 {
181 validate_assert(state, src->ssa != NULL);
182
183 /* As we walk SSA defs, we add every use to this set. We need to make sure
184 * our use is seen in a use list.
185 */
186 struct set_entry *entry;
187 if (state->instr) {
188 entry = _mesa_set_search(state->ssa_srcs, src);
189 } else {
190 entry = _mesa_set_search(state->ssa_srcs, SET_PTR_BIT(src, 0));
191 }
192 validate_assert(state, entry);
193
194 /* This will let us prove that we've seen all the sources */
195 if (entry)
196 _mesa_set_remove(state->ssa_srcs, entry);
197
198 if (bit_sizes)
199 validate_assert(state, src->ssa->bit_size & bit_sizes);
200 if (num_components)
201 validate_assert(state, src->ssa->num_components == num_components);
202
203 /* TODO validate that the use is dominated by the definition */
204 }
205
206 static void
207 validate_src(nir_src *src, validate_state *state,
208 unsigned bit_sizes, unsigned num_components)
209 {
210 if (state->instr)
211 validate_assert(state, src->parent_instr == state->instr);
212 else
213 validate_assert(state, src->parent_if == state->if_stmt);
214
215 if (src->is_ssa)
216 validate_ssa_src(src, state, bit_sizes, num_components);
217 else
218 validate_reg_src(src, state, bit_sizes, num_components);
219 }
220
221 static void
222 validate_alu_src(nir_alu_instr *instr, unsigned index, validate_state *state)
223 {
224 nir_alu_src *src = &instr->src[index];
225
226 if (instr->op == nir_op_mov)
227 assert(!src->abs && !src->negate);
228
229 unsigned num_components = nir_src_num_components(src->src);
230 for (unsigned i = 0; i < NIR_MAX_VEC_COMPONENTS; i++) {
231 validate_assert(state, src->swizzle[i] < NIR_MAX_VEC_COMPONENTS);
232
233 if (nir_alu_instr_channel_used(instr, index, i))
234 validate_assert(state, src->swizzle[i] < num_components);
235 }
236
237 validate_src(&src->src, state, 0, 0);
238 }
239
240 static void
241 validate_reg_dest(nir_reg_dest *dest, validate_state *state,
242 unsigned bit_sizes, unsigned num_components)
243 {
244 validate_assert(state, dest->reg != NULL);
245
246 validate_assert(state, dest->parent_instr == state->instr);
247
248 struct hash_entry *entry2;
249 entry2 = _mesa_hash_table_search(state->regs, dest->reg);
250
251 validate_assert(state, entry2);
252
253 reg_validate_state *reg_state = (reg_validate_state *) entry2->data;
254 _mesa_set_add(reg_state->defs, dest);
255
256 validate_assert(state, reg_state->where_defined == state->impl &&
257 "writing to a register declared in a different function");
258
259 if (bit_sizes)
260 validate_assert(state, dest->reg->bit_size & bit_sizes);
261 if (num_components)
262 validate_assert(state, dest->reg->num_components == num_components);
263
264 validate_assert(state, (dest->reg->num_array_elems == 0 ||
265 dest->base_offset < dest->reg->num_array_elems) &&
266 "definitely out-of-bounds array access");
267
268 if (dest->indirect) {
269 validate_assert(state, dest->reg->num_array_elems != 0);
270 validate_assert(state, (dest->indirect->is_ssa || dest->indirect->reg.indirect == NULL) &&
271 "only one level of indirection allowed");
272 validate_src(dest->indirect, state, 32, 1);
273 }
274 }
275
276 static void
277 validate_ssa_def(nir_ssa_def *def, validate_state *state)
278 {
279 validate_assert(state, def->index < state->impl->ssa_alloc);
280 validate_assert(state, !BITSET_TEST(state->ssa_defs_found, def->index));
281 BITSET_SET(state->ssa_defs_found, def->index);
282
283 validate_assert(state, def->parent_instr == state->instr);
284 validate_num_components(state, def->num_components);
285
286 list_validate(&def->uses);
287 nir_foreach_use(src, def) {
288 validate_assert(state, src->is_ssa);
289 validate_assert(state, src->ssa == def);
290 bool already_seen = false;
291 _mesa_set_search_and_add(state->ssa_srcs, src, &already_seen);
292 /* A nir_src should only appear once and only in one SSA def use list */
293 validate_assert(state, !already_seen);
294 }
295
296 list_validate(&def->if_uses);
297 nir_foreach_if_use(src, def) {
298 validate_assert(state, src->is_ssa);
299 validate_assert(state, src->ssa == def);
300 bool already_seen = false;
301 _mesa_set_search_and_add(state->ssa_srcs, SET_PTR_BIT(src, 0),
302 &already_seen);
303 /* A nir_src should only appear once and only in one SSA def use list */
304 validate_assert(state, !already_seen);
305 }
306 }
307
308 static void
309 validate_dest(nir_dest *dest, validate_state *state,
310 unsigned bit_sizes, unsigned num_components)
311 {
312 if (dest->is_ssa) {
313 if (bit_sizes)
314 validate_assert(state, dest->ssa.bit_size & bit_sizes);
315 if (num_components)
316 validate_assert(state, dest->ssa.num_components == num_components);
317 validate_ssa_def(&dest->ssa, state);
318 } else {
319 validate_reg_dest(&dest->reg, state, bit_sizes, num_components);
320 }
321 }
322
323 static void
324 validate_alu_dest(nir_alu_instr *instr, validate_state *state)
325 {
326 nir_alu_dest *dest = &instr->dest;
327
328 if (instr->op == nir_op_mov)
329 assert(!dest->saturate);
330
331 unsigned dest_size = nir_dest_num_components(dest->dest);
332 /*
333 * validate that the instruction doesn't write to components not in the
334 * register/SSA value
335 */
336 validate_assert(state, !(dest->write_mask & ~((1 << dest_size) - 1)));
337
338 /* validate that saturate is only ever used on instructions with
339 * destinations of type float
340 */
341 nir_alu_instr *alu = nir_instr_as_alu(state->instr);
342 validate_assert(state,
343 (nir_alu_type_get_base_type(nir_op_infos[alu->op].output_type) ==
344 nir_type_float) ||
345 !dest->saturate);
346
347 validate_dest(&dest->dest, state, 0, 0);
348 }
349
350 static void
351 validate_alu_instr(nir_alu_instr *instr, validate_state *state)
352 {
353 validate_assert(state, instr->op < nir_num_opcodes);
354
355 unsigned instr_bit_size = 0;
356 for (unsigned i = 0; i < nir_op_infos[instr->op].num_inputs; i++) {
357 nir_alu_type src_type = nir_op_infos[instr->op].input_types[i];
358 unsigned src_bit_size = nir_src_bit_size(instr->src[i].src);
359 if (nir_alu_type_get_type_size(src_type)) {
360 validate_assert(state, src_bit_size == nir_alu_type_get_type_size(src_type));
361 } else if (instr_bit_size) {
362 validate_assert(state, src_bit_size == instr_bit_size);
363 } else {
364 instr_bit_size = src_bit_size;
365 }
366
367 if (nir_alu_type_get_base_type(src_type) == nir_type_float) {
368 /* 8-bit float isn't a thing */
369 validate_assert(state, src_bit_size == 16 || src_bit_size == 32 ||
370 src_bit_size == 64);
371 }
372
373 validate_alu_src(instr, i, state);
374 }
375
376 nir_alu_type dest_type = nir_op_infos[instr->op].output_type;
377 unsigned dest_bit_size = nir_dest_bit_size(instr->dest.dest);
378 if (nir_alu_type_get_type_size(dest_type)) {
379 validate_assert(state, dest_bit_size == nir_alu_type_get_type_size(dest_type));
380 } else if (instr_bit_size) {
381 validate_assert(state, dest_bit_size == instr_bit_size);
382 } else {
383 /* The only unsized thing is the destination so it's vacuously valid */
384 }
385
386 if (nir_alu_type_get_base_type(dest_type) == nir_type_float) {
387 /* 8-bit float isn't a thing */
388 validate_assert(state, dest_bit_size == 16 || dest_bit_size == 32 ||
389 dest_bit_size == 64);
390 }
391
392 validate_alu_dest(instr, state);
393 }
394
395 static void
396 validate_var_use(nir_variable *var, validate_state *state)
397 {
398 struct hash_entry *entry = _mesa_hash_table_search(state->var_defs, var);
399 validate_assert(state, entry);
400 if (entry && var->data.mode == nir_var_function_temp)
401 validate_assert(state, (nir_function_impl *) entry->data == state->impl);
402 }
403
404 static void
405 validate_deref_instr(nir_deref_instr *instr, validate_state *state)
406 {
407 if (instr->deref_type == nir_deref_type_var) {
408 /* Variable dereferences are stupid simple. */
409 validate_assert(state, instr->mode == instr->var->data.mode);
410 validate_assert(state, instr->type == instr->var->type);
411 validate_var_use(instr->var, state);
412 } else if (instr->deref_type == nir_deref_type_cast) {
413 /* For cast, we simply have to trust the instruction. It's up to
414 * lowering passes and front/back-ends to make them sane.
415 */
416 validate_src(&instr->parent, state, 0, 0);
417
418 /* We just validate that the type and mode are there */
419 validate_assert(state, instr->mode);
420 validate_assert(state, instr->type);
421 } else {
422 /* We require the parent to be SSA. This may be lifted in the future */
423 validate_assert(state, instr->parent.is_ssa);
424
425 /* The parent pointer value must have the same number of components
426 * as the destination.
427 */
428 validate_src(&instr->parent, state, nir_dest_bit_size(instr->dest),
429 nir_dest_num_components(instr->dest));
430
431 nir_instr *parent_instr = instr->parent.ssa->parent_instr;
432
433 /* The parent must come from another deref instruction */
434 validate_assert(state, parent_instr->type == nir_instr_type_deref);
435
436 nir_deref_instr *parent = nir_instr_as_deref(parent_instr);
437
438 validate_assert(state, instr->mode == parent->mode);
439
440 switch (instr->deref_type) {
441 case nir_deref_type_struct:
442 validate_assert(state, glsl_type_is_struct_or_ifc(parent->type));
443 validate_assert(state,
444 instr->strct.index < glsl_get_length(parent->type));
445 validate_assert(state, instr->type ==
446 glsl_get_struct_field(parent->type, instr->strct.index));
447 break;
448
449 case nir_deref_type_array:
450 case nir_deref_type_array_wildcard:
451 if (instr->mode == nir_var_mem_ubo ||
452 instr->mode == nir_var_mem_ssbo ||
453 instr->mode == nir_var_mem_shared ||
454 instr->mode == nir_var_mem_global) {
455 /* Shared variables and UBO/SSBOs have a bit more relaxed rules
456 * because we need to be able to handle array derefs on vectors.
457 * Fortunately, nir_lower_io handles these just fine.
458 */
459 validate_assert(state, glsl_type_is_array(parent->type) ||
460 glsl_type_is_matrix(parent->type) ||
461 glsl_type_is_vector(parent->type));
462 } else {
463 /* Most of NIR cannot handle array derefs on vectors */
464 validate_assert(state, glsl_type_is_array(parent->type) ||
465 glsl_type_is_matrix(parent->type));
466 }
467 validate_assert(state,
468 instr->type == glsl_get_array_element(parent->type));
469
470 if (instr->deref_type == nir_deref_type_array) {
471 validate_src(&instr->arr.index, state,
472 nir_dest_bit_size(instr->dest), 1);
473 }
474 break;
475
476 case nir_deref_type_ptr_as_array:
477 /* ptr_as_array derefs must have a parent that is either an array,
478 * ptr_as_array, or cast. If the parent is a cast, we get the stride
479 * information (if any) from the cast deref.
480 */
481 validate_assert(state,
482 parent->deref_type == nir_deref_type_array ||
483 parent->deref_type == nir_deref_type_ptr_as_array ||
484 parent->deref_type == nir_deref_type_cast);
485 validate_src(&instr->arr.index, state,
486 nir_dest_bit_size(instr->dest), 1);
487 break;
488
489 default:
490 unreachable("Invalid deref instruction type");
491 }
492 }
493
494 /* We intentionally don't validate the size of the destination because we
495 * want to let other compiler components such as SPIR-V decide how big
496 * pointers should be.
497 */
498 validate_dest(&instr->dest, state, 0, 0);
499
500 /* Deref instructions as if conditions don't make sense because if
501 * conditions expect well-formed Booleans. If you want to compare with
502 * NULL, an explicit comparison operation should be used.
503 */
504 validate_assert(state, list_is_empty(&instr->dest.ssa.if_uses));
505
506 /* Only certain modes can be used as sources for phi instructions. */
507 nir_foreach_use(use, &instr->dest.ssa) {
508 if (use->parent_instr->type == nir_instr_type_phi) {
509 validate_assert(state, instr->mode == nir_var_mem_ubo ||
510 instr->mode == nir_var_mem_ssbo ||
511 instr->mode == nir_var_mem_shared ||
512 instr->mode == nir_var_mem_global);
513 }
514 }
515 }
516
517 static bool
518 vectorized_intrinsic(nir_intrinsic_instr *intr)
519 {
520 const nir_intrinsic_info *info = &nir_intrinsic_infos[intr->intrinsic];
521
522 if (info->dest_components == 0)
523 return true;
524
525 for (unsigned i = 0; i < info->num_srcs; i++)
526 if (info->src_components[i] == 0)
527 return true;
528
529 return false;
530 }
531
532 static void
533 validate_intrinsic_instr(nir_intrinsic_instr *instr, validate_state *state)
534 {
535 unsigned dest_bit_size = 0;
536 unsigned src_bit_sizes[NIR_INTRINSIC_MAX_INPUTS] = { 0, };
537 switch (instr->intrinsic) {
538 case nir_intrinsic_load_param: {
539 unsigned param_idx = nir_intrinsic_param_idx(instr);
540 validate_assert(state, param_idx < state->impl->function->num_params);
541 nir_parameter *param = &state->impl->function->params[param_idx];
542 validate_assert(state, instr->num_components == param->num_components);
543 dest_bit_size = param->bit_size;
544 break;
545 }
546
547 case nir_intrinsic_load_deref: {
548 nir_deref_instr *src = nir_src_as_deref(instr->src[0]);
549 assert(src);
550 validate_assert(state, glsl_type_is_vector_or_scalar(src->type) ||
551 (src->mode == nir_var_uniform &&
552 glsl_get_base_type(src->type) == GLSL_TYPE_SUBROUTINE));
553 validate_assert(state, instr->num_components ==
554 glsl_get_vector_elements(src->type));
555 dest_bit_size = glsl_get_bit_size(src->type);
556 /* Also allow 32-bit boolean load operations */
557 if (glsl_type_is_boolean(src->type))
558 dest_bit_size |= 32;
559 break;
560 }
561
562 case nir_intrinsic_store_deref: {
563 nir_deref_instr *dst = nir_src_as_deref(instr->src[0]);
564 assert(dst);
565 validate_assert(state, glsl_type_is_vector_or_scalar(dst->type));
566 validate_assert(state, instr->num_components ==
567 glsl_get_vector_elements(dst->type));
568 src_bit_sizes[1] = glsl_get_bit_size(dst->type);
569 /* Also allow 32-bit boolean store operations */
570 if (glsl_type_is_boolean(dst->type))
571 src_bit_sizes[1] |= 32;
572 validate_assert(state, (dst->mode & (nir_var_shader_in |
573 nir_var_uniform)) == 0);
574 validate_assert(state, (nir_intrinsic_write_mask(instr) & ~((1 << instr->num_components) - 1)) == 0);
575 break;
576 }
577
578 case nir_intrinsic_copy_deref: {
579 nir_deref_instr *dst = nir_src_as_deref(instr->src[0]);
580 nir_deref_instr *src = nir_src_as_deref(instr->src[1]);
581 validate_assert(state, glsl_get_bare_type(dst->type) ==
582 glsl_get_bare_type(src->type));
583 validate_assert(state, (dst->mode & (nir_var_shader_in |
584 nir_var_uniform)) == 0);
585 break;
586 }
587
588 case nir_intrinsic_load_ubo:
589 case nir_intrinsic_load_ssbo:
590 case nir_intrinsic_load_shared:
591 case nir_intrinsic_load_global:
592 case nir_intrinsic_load_scratch:
593 case nir_intrinsic_load_constant:
594 /* These memory load operations must have alignments */
595 validate_assert(state,
596 util_is_power_of_two_nonzero(nir_intrinsic_align_mul(instr)));
597 validate_assert(state, nir_intrinsic_align_offset(instr) <
598 nir_intrinsic_align_mul(instr));
599 /* Fall through */
600
601 case nir_intrinsic_load_uniform:
602 case nir_intrinsic_load_input:
603 case nir_intrinsic_load_per_vertex_input:
604 case nir_intrinsic_load_interpolated_input:
605 case nir_intrinsic_load_output:
606 case nir_intrinsic_load_per_vertex_output:
607 case nir_intrinsic_load_push_constant:
608 /* All memory load operations must load at least a byte */
609 validate_assert(state, nir_dest_bit_size(instr->dest) >= 8);
610 break;
611
612 case nir_intrinsic_store_ssbo:
613 case nir_intrinsic_store_shared:
614 case nir_intrinsic_store_global:
615 case nir_intrinsic_store_scratch:
616 /* These memory store operations must also have alignments */
617 validate_assert(state,
618 util_is_power_of_two_nonzero(nir_intrinsic_align_mul(instr)));
619 validate_assert(state, nir_intrinsic_align_offset(instr) <
620 nir_intrinsic_align_mul(instr));
621 /* Fall through */
622
623 case nir_intrinsic_store_output:
624 case nir_intrinsic_store_per_vertex_output:
625 /* All memory store operations must store at least a byte */
626 validate_assert(state, nir_src_bit_size(instr->src[0]) >= 8);
627 break;
628
629 default:
630 break;
631 }
632
633 if (instr->num_components > 0)
634 validate_num_components(state, instr->num_components);
635
636 const nir_intrinsic_info *info = &nir_intrinsic_infos[instr->intrinsic];
637 unsigned num_srcs = info->num_srcs;
638 for (unsigned i = 0; i < num_srcs; i++) {
639 unsigned components_read = nir_intrinsic_src_components(instr, i);
640
641 validate_num_components(state, components_read);
642
643 validate_src(&instr->src[i], state, src_bit_sizes[i], components_read);
644 }
645
646 if (nir_intrinsic_infos[instr->intrinsic].has_dest) {
647 unsigned components_written = nir_intrinsic_dest_components(instr);
648 unsigned bit_sizes = nir_intrinsic_infos[instr->intrinsic].dest_bit_sizes;
649
650 validate_num_components(state, components_written);
651 if (dest_bit_size && bit_sizes)
652 validate_assert(state, dest_bit_size & bit_sizes);
653 else
654 dest_bit_size = dest_bit_size ? dest_bit_size : bit_sizes;
655
656 validate_dest(&instr->dest, state, dest_bit_size, components_written);
657 }
658
659 if (!vectorized_intrinsic(instr))
660 validate_assert(state, instr->num_components == 0);
661 }
662
663 static void
664 validate_tex_instr(nir_tex_instr *instr, validate_state *state)
665 {
666 bool src_type_seen[nir_num_tex_src_types];
667 for (unsigned i = 0; i < nir_num_tex_src_types; i++)
668 src_type_seen[i] = false;
669
670 for (unsigned i = 0; i < instr->num_srcs; i++) {
671 validate_assert(state, !src_type_seen[instr->src[i].src_type]);
672 src_type_seen[instr->src[i].src_type] = true;
673 validate_src(&instr->src[i].src, state,
674 0, nir_tex_instr_src_size(instr, i));
675
676 switch (instr->src[i].src_type) {
677 case nir_tex_src_texture_deref:
678 case nir_tex_src_sampler_deref:
679 validate_assert(state, instr->src[i].src.is_ssa);
680 validate_assert(state,
681 instr->src[i].src.ssa->parent_instr->type == nir_instr_type_deref);
682 break;
683 default:
684 break;
685 }
686 }
687
688 if (nir_tex_instr_has_explicit_tg4_offsets(instr)) {
689 validate_assert(state, instr->op == nir_texop_tg4);
690 validate_assert(state, !src_type_seen[nir_tex_src_offset]);
691 }
692
693 validate_dest(&instr->dest, state, 0, nir_tex_instr_dest_size(instr));
694 }
695
696 static void
697 validate_call_instr(nir_call_instr *instr, validate_state *state)
698 {
699 validate_assert(state, instr->num_params == instr->callee->num_params);
700
701 for (unsigned i = 0; i < instr->num_params; i++) {
702 validate_src(&instr->params[i], state,
703 instr->callee->params[i].bit_size,
704 instr->callee->params[i].num_components);
705 }
706 }
707
708 static void
709 validate_const_value(nir_const_value *val, unsigned bit_size,
710 validate_state *state)
711 {
712 /* In order for block copies to work properly for things like instruction
713 * comparisons and [de]serialization, we require the unused bits of the
714 * nir_const_value to be zero.
715 */
716 nir_const_value cmp_val;
717 memset(&cmp_val, 0, sizeof(cmp_val));
718 switch (bit_size) {
719 case 1:
720 cmp_val.b = val->b;
721 break;
722 case 8:
723 cmp_val.u8 = val->u8;
724 break;
725 case 16:
726 cmp_val.u16 = val->u16;
727 break;
728 case 32:
729 cmp_val.u32 = val->u32;
730 break;
731 case 64:
732 cmp_val.u64 = val->u64;
733 break;
734 default:
735 validate_assert(state, !"Invalid load_const bit size");
736 }
737 validate_assert(state, memcmp(val, &cmp_val, sizeof(cmp_val)) == 0);
738 }
739
740 static void
741 validate_load_const_instr(nir_load_const_instr *instr, validate_state *state)
742 {
743 validate_ssa_def(&instr->def, state);
744
745 for (unsigned i = 0; i < instr->def.num_components; i++)
746 validate_const_value(&instr->value[i], instr->def.bit_size, state);
747 }
748
749 static void
750 validate_ssa_undef_instr(nir_ssa_undef_instr *instr, validate_state *state)
751 {
752 validate_ssa_def(&instr->def, state);
753 }
754
755 static void
756 validate_phi_instr(nir_phi_instr *instr, validate_state *state)
757 {
758 /*
759 * don't validate the sources until we get to them from their predecessor
760 * basic blocks, to avoid validating an SSA use before its definition.
761 */
762
763 validate_dest(&instr->dest, state, 0, 0);
764
765 exec_list_validate(&instr->srcs);
766 validate_assert(state, exec_list_length(&instr->srcs) ==
767 state->block->predecessors->entries);
768 }
769
770 static void
771 validate_jump_instr(nir_jump_instr *instr, validate_state *state)
772 {
773 nir_block *block = state->block;
774 validate_assert(state, &instr->instr == nir_block_last_instr(block));
775
776 switch (instr->type) {
777 case nir_jump_return:
778 validate_assert(state, block->successors[0] == state->impl->end_block);
779 validate_assert(state, block->successors[1] == NULL);
780 validate_assert(state, instr->target == NULL);
781 validate_assert(state, instr->else_target == NULL);
782 break;
783
784 case nir_jump_break:
785 validate_assert(state, state->impl->structured);
786 validate_assert(state, state->loop != NULL);
787 if (state->loop) {
788 nir_block *after =
789 nir_cf_node_as_block(nir_cf_node_next(&state->loop->cf_node));
790 validate_assert(state, block->successors[0] == after);
791 }
792 validate_assert(state, block->successors[1] == NULL);
793 validate_assert(state, instr->target == NULL);
794 validate_assert(state, instr->else_target == NULL);
795 break;
796
797 case nir_jump_continue:
798 validate_assert(state, state->impl->structured);
799 validate_assert(state, state->loop != NULL);
800 if (state->loop) {
801 nir_block *first = nir_loop_first_block(state->loop);
802 validate_assert(state, block->successors[0] == first);
803 }
804 validate_assert(state, block->successors[1] == NULL);
805 validate_assert(state, instr->target == NULL);
806 validate_assert(state, instr->else_target == NULL);
807 break;
808
809 case nir_jump_goto:
810 validate_assert(state, !state->impl->structured);
811 validate_assert(state, instr->target == block->successors[0]);
812 validate_assert(state, instr->target != NULL);
813 validate_assert(state, instr->else_target == NULL);
814 break;
815
816 case nir_jump_goto_if:
817 validate_assert(state, !state->impl->structured);
818 validate_assert(state, instr->target == block->successors[1]);
819 validate_assert(state, instr->else_target == block->successors[0]);
820 validate_src(&instr->condition, state, 0, 1);
821 validate_assert(state, instr->target != NULL);
822 validate_assert(state, instr->else_target != NULL);
823 break;
824
825 default:
826 validate_assert(state, !"Invalid jump instruction type");
827 break;
828 }
829 }
830
831 static void
832 validate_instr(nir_instr *instr, validate_state *state)
833 {
834 validate_assert(state, instr->block == state->block);
835
836 state->instr = instr;
837
838 switch (instr->type) {
839 case nir_instr_type_alu:
840 validate_alu_instr(nir_instr_as_alu(instr), state);
841 break;
842
843 case nir_instr_type_deref:
844 validate_deref_instr(nir_instr_as_deref(instr), state);
845 break;
846
847 case nir_instr_type_call:
848 validate_call_instr(nir_instr_as_call(instr), state);
849 break;
850
851 case nir_instr_type_intrinsic:
852 validate_intrinsic_instr(nir_instr_as_intrinsic(instr), state);
853 break;
854
855 case nir_instr_type_tex:
856 validate_tex_instr(nir_instr_as_tex(instr), state);
857 break;
858
859 case nir_instr_type_load_const:
860 validate_load_const_instr(nir_instr_as_load_const(instr), state);
861 break;
862
863 case nir_instr_type_phi:
864 validate_phi_instr(nir_instr_as_phi(instr), state);
865 break;
866
867 case nir_instr_type_ssa_undef:
868 validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr), state);
869 break;
870
871 case nir_instr_type_jump:
872 validate_jump_instr(nir_instr_as_jump(instr), state);
873 break;
874
875 default:
876 validate_assert(state, !"Invalid ALU instruction type");
877 break;
878 }
879
880 state->instr = NULL;
881 }
882
883 static void
884 validate_phi_src(nir_phi_instr *instr, nir_block *pred, validate_state *state)
885 {
886 state->instr = &instr->instr;
887
888 validate_assert(state, instr->dest.is_ssa);
889
890 exec_list_validate(&instr->srcs);
891 nir_foreach_phi_src(src, instr) {
892 if (src->pred == pred) {
893 validate_assert(state, src->src.is_ssa);
894 validate_src(&src->src, state, instr->dest.ssa.bit_size,
895 instr->dest.ssa.num_components);
896 state->instr = NULL;
897 return;
898 }
899 }
900 validate_assert(state, !"Phi does not have a source corresponding to one "
901 "of its predecessor blocks");
902 }
903
904 static void
905 validate_phi_srcs(nir_block *block, nir_block *succ, validate_state *state)
906 {
907 nir_foreach_instr(instr, succ) {
908 if (instr->type != nir_instr_type_phi)
909 break;
910
911 validate_phi_src(nir_instr_as_phi(instr), block, state);
912 }
913 }
914
915 static void validate_cf_node(nir_cf_node *node, validate_state *state);
916
917 static void
918 validate_block(nir_block *block, validate_state *state)
919 {
920 validate_assert(state, block->cf_node.parent == state->parent_node);
921
922 state->block = block;
923
924 exec_list_validate(&block->instr_list);
925 nir_foreach_instr(instr, block) {
926 if (instr->type == nir_instr_type_phi) {
927 validate_assert(state, instr == nir_block_first_instr(block) ||
928 nir_instr_prev(instr)->type == nir_instr_type_phi);
929 }
930
931 validate_instr(instr, state);
932 }
933
934 validate_assert(state, block->successors[0] != NULL);
935 validate_assert(state, block->successors[0] != block->successors[1]);
936
937 for (unsigned i = 0; i < 2; i++) {
938 if (block->successors[i] != NULL) {
939 struct set_entry *entry =
940 _mesa_set_search(block->successors[i]->predecessors, block);
941 validate_assert(state, entry);
942
943 validate_phi_srcs(block, block->successors[i], state);
944 }
945 }
946
947 set_foreach(block->predecessors, entry) {
948 const nir_block *pred = entry->key;
949 validate_assert(state, pred->successors[0] == block ||
950 pred->successors[1] == block);
951 }
952
953 if (!state->impl->structured) {
954 validate_assert(state, nir_block_ends_in_jump(block));
955 } else if (!nir_block_ends_in_jump(block)) {
956 nir_cf_node *next = nir_cf_node_next(&block->cf_node);
957 if (next == NULL) {
958 switch (state->parent_node->type) {
959 case nir_cf_node_loop: {
960 nir_block *first = nir_loop_first_block(state->loop);
961 validate_assert(state, block->successors[0] == first);
962 /* due to the hack for infinite loops, block->successors[1] may
963 * point to the block after the loop.
964 */
965 break;
966 }
967
968 case nir_cf_node_if: {
969 nir_block *after =
970 nir_cf_node_as_block(nir_cf_node_next(state->parent_node));
971 validate_assert(state, block->successors[0] == after);
972 validate_assert(state, block->successors[1] == NULL);
973 break;
974 }
975
976 case nir_cf_node_function:
977 validate_assert(state, block->successors[0] == state->impl->end_block);
978 validate_assert(state, block->successors[1] == NULL);
979 break;
980
981 default:
982 unreachable("unknown control flow node type");
983 }
984 } else {
985 if (next->type == nir_cf_node_if) {
986 nir_if *if_stmt = nir_cf_node_as_if(next);
987 validate_assert(state, block->successors[0] ==
988 nir_if_first_then_block(if_stmt));
989 validate_assert(state, block->successors[1] ==
990 nir_if_first_else_block(if_stmt));
991 } else if (next->type == nir_cf_node_loop) {
992 nir_loop *loop = nir_cf_node_as_loop(next);
993 validate_assert(state, block->successors[0] ==
994 nir_loop_first_block(loop));
995 validate_assert(state, block->successors[1] == NULL);
996 } else {
997 validate_assert(state,
998 !"Structured NIR cannot have consecutive blocks");
999 }
1000 }
1001 }
1002 }
1003
1004 static void
1005 validate_if(nir_if *if_stmt, validate_state *state)
1006 {
1007 validate_assert(state, state->impl->structured);
1008
1009 state->if_stmt = if_stmt;
1010
1011 validate_assert(state, !exec_node_is_head_sentinel(if_stmt->cf_node.node.prev));
1012 nir_cf_node *prev_node = nir_cf_node_prev(&if_stmt->cf_node);
1013 validate_assert(state, prev_node->type == nir_cf_node_block);
1014
1015 validate_assert(state, !exec_node_is_tail_sentinel(if_stmt->cf_node.node.next));
1016 nir_cf_node *next_node = nir_cf_node_next(&if_stmt->cf_node);
1017 validate_assert(state, next_node->type == nir_cf_node_block);
1018
1019 validate_src(&if_stmt->condition, state, 0, 1);
1020
1021 validate_assert(state, !exec_list_is_empty(&if_stmt->then_list));
1022 validate_assert(state, !exec_list_is_empty(&if_stmt->else_list));
1023
1024 nir_cf_node *old_parent = state->parent_node;
1025 state->parent_node = &if_stmt->cf_node;
1026
1027 exec_list_validate(&if_stmt->then_list);
1028 foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->then_list) {
1029 validate_cf_node(cf_node, state);
1030 }
1031
1032 exec_list_validate(&if_stmt->else_list);
1033 foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->else_list) {
1034 validate_cf_node(cf_node, state);
1035 }
1036
1037 state->parent_node = old_parent;
1038 state->if_stmt = NULL;
1039 }
1040
1041 static void
1042 validate_loop(nir_loop *loop, validate_state *state)
1043 {
1044 validate_assert(state, state->impl->structured);
1045
1046 validate_assert(state, !exec_node_is_head_sentinel(loop->cf_node.node.prev));
1047 nir_cf_node *prev_node = nir_cf_node_prev(&loop->cf_node);
1048 validate_assert(state, prev_node->type == nir_cf_node_block);
1049
1050 validate_assert(state, !exec_node_is_tail_sentinel(loop->cf_node.node.next));
1051 nir_cf_node *next_node = nir_cf_node_next(&loop->cf_node);
1052 validate_assert(state, next_node->type == nir_cf_node_block);
1053
1054 validate_assert(state, !exec_list_is_empty(&loop->body));
1055
1056 nir_cf_node *old_parent = state->parent_node;
1057 state->parent_node = &loop->cf_node;
1058 nir_loop *old_loop = state->loop;
1059 state->loop = loop;
1060
1061 exec_list_validate(&loop->body);
1062 foreach_list_typed(nir_cf_node, cf_node, node, &loop->body) {
1063 validate_cf_node(cf_node, state);
1064 }
1065
1066 state->parent_node = old_parent;
1067 state->loop = old_loop;
1068 }
1069
1070 static void
1071 validate_cf_node(nir_cf_node *node, validate_state *state)
1072 {
1073 validate_assert(state, node->parent == state->parent_node);
1074
1075 switch (node->type) {
1076 case nir_cf_node_block:
1077 validate_block(nir_cf_node_as_block(node), state);
1078 break;
1079
1080 case nir_cf_node_if:
1081 validate_if(nir_cf_node_as_if(node), state);
1082 break;
1083
1084 case nir_cf_node_loop:
1085 validate_loop(nir_cf_node_as_loop(node), state);
1086 break;
1087
1088 default:
1089 unreachable("Invalid CF node type");
1090 }
1091 }
1092
1093 static void
1094 prevalidate_reg_decl(nir_register *reg, validate_state *state)
1095 {
1096 validate_assert(state, reg->index < state->impl->reg_alloc);
1097 validate_assert(state, !BITSET_TEST(state->regs_found, reg->index));
1098 validate_num_components(state, reg->num_components);
1099 BITSET_SET(state->regs_found, reg->index);
1100
1101 list_validate(&reg->uses);
1102 list_validate(&reg->defs);
1103 list_validate(&reg->if_uses);
1104
1105 reg_validate_state *reg_state = ralloc(state->regs, reg_validate_state);
1106 reg_state->uses = _mesa_pointer_set_create(reg_state);
1107 reg_state->if_uses = _mesa_pointer_set_create(reg_state);
1108 reg_state->defs = _mesa_pointer_set_create(reg_state);
1109
1110 reg_state->where_defined = state->impl;
1111
1112 _mesa_hash_table_insert(state->regs, reg, reg_state);
1113 }
1114
1115 static void
1116 postvalidate_reg_decl(nir_register *reg, validate_state *state)
1117 {
1118 struct hash_entry *entry = _mesa_hash_table_search(state->regs, reg);
1119
1120 assume(entry);
1121 reg_validate_state *reg_state = (reg_validate_state *) entry->data;
1122
1123 nir_foreach_use(src, reg) {
1124 struct set_entry *entry = _mesa_set_search(reg_state->uses, src);
1125 validate_assert(state, entry);
1126 _mesa_set_remove(reg_state->uses, entry);
1127 }
1128 validate_assert(state, reg_state->uses->entries == 0);
1129
1130 nir_foreach_if_use(src, reg) {
1131 struct set_entry *entry = _mesa_set_search(reg_state->if_uses, src);
1132 validate_assert(state, entry);
1133 _mesa_set_remove(reg_state->if_uses, entry);
1134 }
1135 validate_assert(state, reg_state->if_uses->entries == 0);
1136
1137 nir_foreach_def(src, reg) {
1138 struct set_entry *entry = _mesa_set_search(reg_state->defs, src);
1139 validate_assert(state, entry);
1140 _mesa_set_remove(reg_state->defs, entry);
1141 }
1142 validate_assert(state, reg_state->defs->entries == 0);
1143 }
1144
1145 static void
1146 validate_var_decl(nir_variable *var, nir_variable_mode valid_modes,
1147 validate_state *state)
1148 {
1149 state->var = var;
1150
1151 /* Must have exactly one mode set */
1152 validate_assert(state, util_is_power_of_two_nonzero(var->data.mode));
1153 validate_assert(state, var->data.mode & valid_modes);
1154
1155 if (var->data.compact) {
1156 /* The "compact" flag is only valid on arrays of scalars. */
1157 assert(glsl_type_is_array(var->type));
1158
1159 const struct glsl_type *type = glsl_get_array_element(var->type);
1160 if (nir_is_per_vertex_io(var, state->shader->info.stage)) {
1161 assert(glsl_type_is_array(type));
1162 assert(glsl_type_is_scalar(glsl_get_array_element(type)));
1163 } else {
1164 assert(glsl_type_is_scalar(type));
1165 }
1166 }
1167
1168 if (var->num_members > 0) {
1169 const struct glsl_type *without_array = glsl_without_array(var->type);
1170 validate_assert(state, glsl_type_is_struct_or_ifc(without_array));
1171 validate_assert(state, var->num_members == glsl_get_length(without_array));
1172 validate_assert(state, var->members != NULL);
1173 }
1174
1175 if (var->data.per_view)
1176 validate_assert(state, glsl_type_is_array(var->type));
1177
1178 /*
1179 * TODO validate some things ir_validate.cpp does (requires more GLSL type
1180 * support)
1181 */
1182
1183 _mesa_hash_table_insert(state->var_defs, var,
1184 valid_modes == nir_var_function_temp ?
1185 state->impl : NULL);
1186
1187 state->var = NULL;
1188 }
1189
1190 static void
1191 validate_function_impl(nir_function_impl *impl, validate_state *state)
1192 {
1193 /* Resize the ssa_srcs set. It's likely that the size of this set will
1194 * never actually hit the number of SSA defs because we remove sources from
1195 * the set as we visit them. (It could actually be much larger because
1196 * each SSA def can be used more than once.) However, growing it now costs
1197 * us very little (the extra memory is already dwarfed by the SSA defs
1198 * themselves) and makes collisions much less likely.
1199 */
1200 _mesa_set_resize(state->ssa_srcs, impl->ssa_alloc);
1201
1202 validate_assert(state, impl->function->impl == impl);
1203 validate_assert(state, impl->cf_node.parent == NULL);
1204
1205 validate_assert(state, exec_list_is_empty(&impl->end_block->instr_list));
1206 validate_assert(state, impl->end_block->successors[0] == NULL);
1207 validate_assert(state, impl->end_block->successors[1] == NULL);
1208
1209 state->impl = impl;
1210 state->parent_node = &impl->cf_node;
1211
1212 exec_list_validate(&impl->locals);
1213 nir_foreach_function_temp_variable(var, impl) {
1214 validate_var_decl(var, nir_var_function_temp, state);
1215 }
1216
1217 state->regs_found = reralloc(state->mem_ctx, state->regs_found,
1218 BITSET_WORD, BITSET_WORDS(impl->reg_alloc));
1219 memset(state->regs_found, 0, BITSET_WORDS(impl->reg_alloc) *
1220 sizeof(BITSET_WORD));
1221 exec_list_validate(&impl->registers);
1222 foreach_list_typed(nir_register, reg, node, &impl->registers) {
1223 prevalidate_reg_decl(reg, state);
1224 }
1225
1226 state->ssa_defs_found = reralloc(state->mem_ctx, state->ssa_defs_found,
1227 BITSET_WORD, BITSET_WORDS(impl->ssa_alloc));
1228 memset(state->ssa_defs_found, 0, BITSET_WORDS(impl->ssa_alloc) *
1229 sizeof(BITSET_WORD));
1230 exec_list_validate(&impl->body);
1231 foreach_list_typed(nir_cf_node, node, node, &impl->body) {
1232 validate_cf_node(node, state);
1233 }
1234
1235 foreach_list_typed(nir_register, reg, node, &impl->registers) {
1236 postvalidate_reg_decl(reg, state);
1237 }
1238
1239 validate_assert(state, state->ssa_srcs->entries == 0);
1240 _mesa_set_clear(state->ssa_srcs, NULL);
1241 }
1242
1243 static void
1244 validate_function(nir_function *func, validate_state *state)
1245 {
1246 if (func->impl != NULL) {
1247 validate_assert(state, func->impl->function == func);
1248 validate_function_impl(func->impl, state);
1249 }
1250 }
1251
1252 static void
1253 init_validate_state(validate_state *state)
1254 {
1255 state->mem_ctx = ralloc_context(NULL);
1256 state->regs = _mesa_pointer_hash_table_create(state->mem_ctx);
1257 state->ssa_srcs = _mesa_pointer_set_create(state->mem_ctx);
1258 state->ssa_defs_found = NULL;
1259 state->regs_found = NULL;
1260 state->var_defs = _mesa_pointer_hash_table_create(state->mem_ctx);
1261 state->errors = _mesa_pointer_hash_table_create(state->mem_ctx);
1262
1263 state->loop = NULL;
1264 state->instr = NULL;
1265 state->var = NULL;
1266 }
1267
1268 static void
1269 destroy_validate_state(validate_state *state)
1270 {
1271 ralloc_free(state->mem_ctx);
1272 }
1273
1274 mtx_t fail_dump_mutex = _MTX_INITIALIZER_NP;
1275
1276 static void
1277 dump_errors(validate_state *state, const char *when)
1278 {
1279 struct hash_table *errors = state->errors;
1280
1281 /* Lock around dumping so that we get clean dumps in a multi-threaded
1282 * scenario
1283 */
1284 mtx_lock(&fail_dump_mutex);
1285
1286 if (when) {
1287 fprintf(stderr, "NIR validation failed %s\n", when);
1288 fprintf(stderr, "%d errors:\n", _mesa_hash_table_num_entries(errors));
1289 } else {
1290 fprintf(stderr, "NIR validation failed with %d errors:\n",
1291 _mesa_hash_table_num_entries(errors));
1292 }
1293
1294 nir_print_shader_annotated(state->shader, stderr, errors);
1295
1296 if (_mesa_hash_table_num_entries(errors) > 0) {
1297 fprintf(stderr, "%d additional errors:\n",
1298 _mesa_hash_table_num_entries(errors));
1299 hash_table_foreach(errors, entry) {
1300 fprintf(stderr, "%s\n", (char *)entry->data);
1301 }
1302 }
1303
1304 mtx_unlock(&fail_dump_mutex);
1305
1306 abort();
1307 }
1308
1309 void
1310 nir_validate_shader(nir_shader *shader, const char *when)
1311 {
1312 static int should_validate = -1;
1313 if (should_validate < 0)
1314 should_validate = env_var_as_boolean("NIR_VALIDATE", true);
1315 if (!should_validate)
1316 return;
1317
1318 validate_state state;
1319 init_validate_state(&state);
1320
1321 state.shader = shader;
1322
1323 nir_variable_mode valid_modes =
1324 nir_var_shader_in |
1325 nir_var_shader_out |
1326 nir_var_shader_temp |
1327 nir_var_uniform |
1328 nir_var_mem_ubo |
1329 nir_var_system_value |
1330 nir_var_mem_ssbo |
1331 nir_var_mem_shared;
1332
1333 exec_list_validate(&shader->variables);
1334 nir_foreach_variable_in_shader(var, shader)
1335 validate_var_decl(var, valid_modes, &state);
1336
1337 exec_list_validate(&shader->functions);
1338 foreach_list_typed(nir_function, func, node, &shader->functions) {
1339 validate_function(func, &state);
1340 }
1341
1342 if (_mesa_hash_table_num_entries(state.errors) > 0)
1343 dump_errors(&state, when);
1344
1345 destroy_validate_state(&state);
1346 }
1347
1348 #endif /* NDEBUG */