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