nir/validate: Allow derefs in phi nodes
[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_size, unsigned num_components);
133
134 static void
135 validate_reg_src(nir_src *src, validate_state *state,
136 unsigned bit_size, 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_size)
160 validate_assert(state, src->reg.reg->bit_size == bit_size);
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_size, 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_size)
204 validate_assert(state, src->ssa->bit_size == bit_size);
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_size, 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_size, num_components);
222 else
223 validate_reg_src(src, state, bit_size, 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_size, 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_size)
267 validate_assert(state, dest->reg->bit_size == bit_size);
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_set_create(def_state, _mesa_hash_pointer,
304 _mesa_key_pointer_equal);
305 def_state->if_uses = _mesa_set_create(def_state, _mesa_hash_pointer,
306 _mesa_key_pointer_equal);
307 _mesa_hash_table_insert(state->ssa_defs, def, def_state);
308 }
309
310 static void
311 validate_dest(nir_dest *dest, validate_state *state,
312 unsigned bit_size, unsigned num_components)
313 {
314 if (dest->is_ssa) {
315 if (bit_size)
316 validate_assert(state, dest->ssa.bit_size == bit_size);
317 if (num_components)
318 validate_assert(state, dest->ssa.num_components == num_components);
319 validate_ssa_def(&dest->ssa, state);
320 } else {
321 validate_reg_dest(&dest->reg, state, bit_size, num_components);
322 }
323 }
324
325 static void
326 validate_alu_dest(nir_alu_instr *instr, validate_state *state)
327 {
328 nir_alu_dest *dest = &instr->dest;
329
330 unsigned dest_size = nir_dest_num_components(dest->dest);
331 bool is_packed = !dest->dest.is_ssa && dest->dest.reg.reg->is_packed;
332 /*
333 * validate that the instruction doesn't write to components not in the
334 * register/SSA value
335 */
336 validate_assert(state, is_packed || !(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 (var->data.mode == nir_var_local)
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(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_shared) {
452 /* Shared variables have a bit more relaxed rules because we need
453 * to be able to handle array derefs on vectors. Fortunately,
454 * nir_lower_io handles these just fine.
455 */
456 validate_assert(state, glsl_type_is_array(parent->type) ||
457 glsl_type_is_matrix(parent->type) ||
458 glsl_type_is_vector(parent->type));
459 } else {
460 /* Most of NIR cannot handle array derefs on vectors */
461 validate_assert(state, glsl_type_is_array(parent->type) ||
462 glsl_type_is_matrix(parent->type));
463 }
464 validate_assert(state,
465 instr->type == glsl_get_array_element(parent->type));
466
467 if (instr->deref_type == nir_deref_type_array) {
468 validate_src(&instr->arr.index, state,
469 nir_dest_bit_size(instr->dest), 1);
470 }
471 break;
472
473 case nir_deref_type_ptr_as_array:
474 /* ptr_as_array derefs must have a parent that is either an array,
475 * ptr_as_array, or cast. If the parent is a cast, we get the stride
476 * information (if any) from the cast deref.
477 */
478 validate_assert(state,
479 parent->deref_type == nir_deref_type_array ||
480 parent->deref_type == nir_deref_type_ptr_as_array ||
481 parent->deref_type == nir_deref_type_cast);
482 validate_src(&instr->arr.index, state,
483 nir_dest_bit_size(instr->dest), 1);
484 break;
485
486 default:
487 unreachable("Invalid deref instruction type");
488 }
489 }
490
491 /* We intentionally don't validate the size of the destination because we
492 * want to let other compiler components such as SPIR-V decide how big
493 * pointers should be.
494 */
495 validate_dest(&instr->dest, state, 0, 0);
496
497 /* Deref instructions as if conditions don't make sense because if
498 * conditions expect well-formed Booleans. If you want to compare with
499 * NULL, an explicit comparison operation should be used.
500 */
501 validate_assert(state, list_empty(&instr->dest.ssa.if_uses));
502 }
503
504 static void
505 validate_intrinsic_instr(nir_intrinsic_instr *instr, validate_state *state)
506 {
507 unsigned dest_bit_size = 0;
508 unsigned src_bit_sizes[NIR_INTRINSIC_MAX_INPUTS] = { 0, };
509 switch (instr->intrinsic) {
510 case nir_intrinsic_load_param: {
511 unsigned param_idx = nir_intrinsic_param_idx(instr);
512 validate_assert(state, param_idx < state->impl->function->num_params);
513 nir_parameter *param = &state->impl->function->params[param_idx];
514 validate_assert(state, instr->num_components == param->num_components);
515 dest_bit_size = param->bit_size;
516 break;
517 }
518
519 case nir_intrinsic_load_deref: {
520 nir_deref_instr *src = nir_src_as_deref(instr->src[0]);
521 validate_assert(state, glsl_type_is_vector_or_scalar(src->type) ||
522 (src->mode == nir_var_uniform &&
523 glsl_get_base_type(src->type) == GLSL_TYPE_SUBROUTINE));
524 validate_assert(state, instr->num_components ==
525 glsl_get_vector_elements(src->type));
526 dest_bit_size = glsl_get_bit_size(src->type);
527 break;
528 }
529
530 case nir_intrinsic_store_deref: {
531 nir_deref_instr *dst = nir_src_as_deref(instr->src[0]);
532 validate_assert(state, glsl_type_is_vector_or_scalar(dst->type));
533 validate_assert(state, instr->num_components ==
534 glsl_get_vector_elements(dst->type));
535 src_bit_sizes[1] = glsl_get_bit_size(dst->type);
536 validate_assert(state, (dst->mode & (nir_var_shader_in |
537 nir_var_uniform)) == 0);
538 validate_assert(state, (nir_intrinsic_write_mask(instr) & ~((1 << instr->num_components) - 1)) == 0);
539 break;
540 }
541
542 case nir_intrinsic_copy_deref: {
543 nir_deref_instr *dst = nir_src_as_deref(instr->src[0]);
544 nir_deref_instr *src = nir_src_as_deref(instr->src[1]);
545 validate_assert(state, dst->type == src->type);
546 validate_assert(state, (dst->mode & (nir_var_shader_in |
547 nir_var_uniform)) == 0);
548 break;
549 }
550
551 default:
552 break;
553 }
554
555 unsigned num_srcs = nir_intrinsic_infos[instr->intrinsic].num_srcs;
556 for (unsigned i = 0; i < num_srcs; i++) {
557 unsigned components_read = nir_intrinsic_src_components(instr, i);
558
559 validate_assert(state, components_read > 0);
560
561 validate_src(&instr->src[i], state, src_bit_sizes[i], components_read);
562 }
563
564 if (nir_intrinsic_infos[instr->intrinsic].has_dest) {
565 unsigned components_written = nir_intrinsic_dest_components(instr);
566
567 validate_assert(state, components_written > 0);
568
569 validate_dest(&instr->dest, state, dest_bit_size, components_written);
570 }
571 }
572
573 static void
574 validate_tex_instr(nir_tex_instr *instr, validate_state *state)
575 {
576 bool src_type_seen[nir_num_tex_src_types];
577 for (unsigned i = 0; i < nir_num_tex_src_types; i++)
578 src_type_seen[i] = false;
579
580 for (unsigned i = 0; i < instr->num_srcs; i++) {
581 validate_assert(state, !src_type_seen[instr->src[i].src_type]);
582 src_type_seen[instr->src[i].src_type] = true;
583 validate_src(&instr->src[i].src, state,
584 0, nir_tex_instr_src_size(instr, i));
585 }
586
587 validate_dest(&instr->dest, state, 0, nir_tex_instr_dest_size(instr));
588 }
589
590 static void
591 validate_call_instr(nir_call_instr *instr, validate_state *state)
592 {
593 validate_assert(state, instr->num_params == instr->callee->num_params);
594
595 for (unsigned i = 0; i < instr->num_params; i++) {
596 validate_src(&instr->params[i], state,
597 instr->callee->params[i].bit_size,
598 instr->callee->params[i].num_components);
599 }
600 }
601
602 static void
603 validate_load_const_instr(nir_load_const_instr *instr, validate_state *state)
604 {
605 validate_ssa_def(&instr->def, state);
606 }
607
608 static void
609 validate_ssa_undef_instr(nir_ssa_undef_instr *instr, validate_state *state)
610 {
611 validate_ssa_def(&instr->def, state);
612 }
613
614 static void
615 validate_phi_instr(nir_phi_instr *instr, validate_state *state)
616 {
617 /*
618 * don't validate the sources until we get to them from their predecessor
619 * basic blocks, to avoid validating an SSA use before its definition.
620 */
621
622 validate_dest(&instr->dest, state, 0, 0);
623
624 exec_list_validate(&instr->srcs);
625 validate_assert(state, exec_list_length(&instr->srcs) ==
626 state->block->predecessors->entries);
627 }
628
629 static void
630 validate_instr(nir_instr *instr, validate_state *state)
631 {
632 validate_assert(state, instr->block == state->block);
633
634 state->instr = instr;
635
636 switch (instr->type) {
637 case nir_instr_type_alu:
638 validate_alu_instr(nir_instr_as_alu(instr), state);
639 break;
640
641 case nir_instr_type_deref:
642 validate_deref_instr(nir_instr_as_deref(instr), state);
643 break;
644
645 case nir_instr_type_call:
646 validate_call_instr(nir_instr_as_call(instr), state);
647 break;
648
649 case nir_instr_type_intrinsic:
650 validate_intrinsic_instr(nir_instr_as_intrinsic(instr), state);
651 break;
652
653 case nir_instr_type_tex:
654 validate_tex_instr(nir_instr_as_tex(instr), state);
655 break;
656
657 case nir_instr_type_load_const:
658 validate_load_const_instr(nir_instr_as_load_const(instr), state);
659 break;
660
661 case nir_instr_type_phi:
662 validate_phi_instr(nir_instr_as_phi(instr), state);
663 break;
664
665 case nir_instr_type_ssa_undef:
666 validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr), state);
667 break;
668
669 case nir_instr_type_jump:
670 break;
671
672 default:
673 validate_assert(state, !"Invalid ALU instruction type");
674 break;
675 }
676
677 state->instr = NULL;
678 }
679
680 static void
681 validate_phi_src(nir_phi_instr *instr, nir_block *pred, validate_state *state)
682 {
683 state->instr = &instr->instr;
684
685 validate_assert(state, instr->dest.is_ssa);
686
687 exec_list_validate(&instr->srcs);
688 nir_foreach_phi_src(src, instr) {
689 if (src->pred == pred) {
690 validate_assert(state, src->src.is_ssa);
691 validate_src(&src->src, state, instr->dest.ssa.bit_size,
692 instr->dest.ssa.num_components);
693 state->instr = NULL;
694 return;
695 }
696 }
697
698 abort();
699 }
700
701 static void
702 validate_phi_srcs(nir_block *block, nir_block *succ, validate_state *state)
703 {
704 nir_foreach_instr(instr, succ) {
705 if (instr->type != nir_instr_type_phi)
706 break;
707
708 validate_phi_src(nir_instr_as_phi(instr), block, state);
709 }
710 }
711
712 static void validate_cf_node(nir_cf_node *node, validate_state *state);
713
714 static void
715 validate_block(nir_block *block, validate_state *state)
716 {
717 validate_assert(state, block->cf_node.parent == state->parent_node);
718
719 state->block = block;
720
721 exec_list_validate(&block->instr_list);
722 nir_foreach_instr(instr, block) {
723 if (instr->type == nir_instr_type_phi) {
724 validate_assert(state, instr == nir_block_first_instr(block) ||
725 nir_instr_prev(instr)->type == nir_instr_type_phi);
726 }
727
728 if (instr->type == nir_instr_type_jump) {
729 validate_assert(state, instr == nir_block_last_instr(block));
730 }
731
732 validate_instr(instr, state);
733 }
734
735 validate_assert(state, block->successors[0] != NULL);
736 validate_assert(state, block->successors[0] != block->successors[1]);
737
738 for (unsigned i = 0; i < 2; i++) {
739 if (block->successors[i] != NULL) {
740 struct set_entry *entry =
741 _mesa_set_search(block->successors[i]->predecessors, block);
742 validate_assert(state, entry);
743
744 validate_phi_srcs(block, block->successors[i], state);
745 }
746 }
747
748 set_foreach(block->predecessors, entry) {
749 const nir_block *pred = entry->key;
750 validate_assert(state, pred->successors[0] == block ||
751 pred->successors[1] == block);
752 }
753
754 if (!exec_list_is_empty(&block->instr_list) &&
755 nir_block_last_instr(block)->type == nir_instr_type_jump) {
756 validate_assert(state, block->successors[1] == NULL);
757 nir_jump_instr *jump = nir_instr_as_jump(nir_block_last_instr(block));
758 switch (jump->type) {
759 case nir_jump_break: {
760 nir_block *after =
761 nir_cf_node_as_block(nir_cf_node_next(&state->loop->cf_node));
762 validate_assert(state, block->successors[0] == after);
763 break;
764 }
765
766 case nir_jump_continue: {
767 nir_block *first = nir_loop_first_block(state->loop);
768 validate_assert(state, block->successors[0] == first);
769 break;
770 }
771
772 case nir_jump_return:
773 validate_assert(state, block->successors[0] == state->impl->end_block);
774 break;
775
776 default:
777 unreachable("bad jump type");
778 }
779 } else {
780 nir_cf_node *next = nir_cf_node_next(&block->cf_node);
781 if (next == NULL) {
782 switch (state->parent_node->type) {
783 case nir_cf_node_loop: {
784 nir_block *first = nir_loop_first_block(state->loop);
785 validate_assert(state, block->successors[0] == first);
786 /* due to the hack for infinite loops, block->successors[1] may
787 * point to the block after the loop.
788 */
789 break;
790 }
791
792 case nir_cf_node_if: {
793 nir_block *after =
794 nir_cf_node_as_block(nir_cf_node_next(state->parent_node));
795 validate_assert(state, block->successors[0] == after);
796 validate_assert(state, block->successors[1] == NULL);
797 break;
798 }
799
800 case nir_cf_node_function:
801 validate_assert(state, block->successors[0] == state->impl->end_block);
802 validate_assert(state, block->successors[1] == NULL);
803 break;
804
805 default:
806 unreachable("unknown control flow node type");
807 }
808 } else {
809 if (next->type == nir_cf_node_if) {
810 nir_if *if_stmt = nir_cf_node_as_if(next);
811 validate_assert(state, block->successors[0] ==
812 nir_if_first_then_block(if_stmt));
813 validate_assert(state, block->successors[1] ==
814 nir_if_first_else_block(if_stmt));
815 } else {
816 validate_assert(state, next->type == nir_cf_node_loop);
817 nir_loop *loop = nir_cf_node_as_loop(next);
818 validate_assert(state, block->successors[0] ==
819 nir_loop_first_block(loop));
820 validate_assert(state, block->successors[1] == NULL);
821 }
822 }
823 }
824 }
825
826 static void
827 validate_if(nir_if *if_stmt, validate_state *state)
828 {
829 state->if_stmt = if_stmt;
830
831 validate_assert(state, !exec_node_is_head_sentinel(if_stmt->cf_node.node.prev));
832 nir_cf_node *prev_node = nir_cf_node_prev(&if_stmt->cf_node);
833 validate_assert(state, prev_node->type == nir_cf_node_block);
834
835 validate_assert(state, !exec_node_is_tail_sentinel(if_stmt->cf_node.node.next));
836 nir_cf_node *next_node = nir_cf_node_next(&if_stmt->cf_node);
837 validate_assert(state, next_node->type == nir_cf_node_block);
838
839 validate_src(&if_stmt->condition, state, 0, 1);
840
841 validate_assert(state, !exec_list_is_empty(&if_stmt->then_list));
842 validate_assert(state, !exec_list_is_empty(&if_stmt->else_list));
843
844 nir_cf_node *old_parent = state->parent_node;
845 state->parent_node = &if_stmt->cf_node;
846
847 exec_list_validate(&if_stmt->then_list);
848 foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->then_list) {
849 validate_cf_node(cf_node, state);
850 }
851
852 exec_list_validate(&if_stmt->else_list);
853 foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->else_list) {
854 validate_cf_node(cf_node, state);
855 }
856
857 state->parent_node = old_parent;
858 state->if_stmt = NULL;
859 }
860
861 static void
862 validate_loop(nir_loop *loop, validate_state *state)
863 {
864 validate_assert(state, !exec_node_is_head_sentinel(loop->cf_node.node.prev));
865 nir_cf_node *prev_node = nir_cf_node_prev(&loop->cf_node);
866 validate_assert(state, prev_node->type == nir_cf_node_block);
867
868 validate_assert(state, !exec_node_is_tail_sentinel(loop->cf_node.node.next));
869 nir_cf_node *next_node = nir_cf_node_next(&loop->cf_node);
870 validate_assert(state, next_node->type == nir_cf_node_block);
871
872 validate_assert(state, !exec_list_is_empty(&loop->body));
873
874 nir_cf_node *old_parent = state->parent_node;
875 state->parent_node = &loop->cf_node;
876 nir_loop *old_loop = state->loop;
877 state->loop = loop;
878
879 exec_list_validate(&loop->body);
880 foreach_list_typed(nir_cf_node, cf_node, node, &loop->body) {
881 validate_cf_node(cf_node, state);
882 }
883
884 state->parent_node = old_parent;
885 state->loop = old_loop;
886 }
887
888 static void
889 validate_cf_node(nir_cf_node *node, validate_state *state)
890 {
891 validate_assert(state, node->parent == state->parent_node);
892
893 switch (node->type) {
894 case nir_cf_node_block:
895 validate_block(nir_cf_node_as_block(node), state);
896 break;
897
898 case nir_cf_node_if:
899 validate_if(nir_cf_node_as_if(node), state);
900 break;
901
902 case nir_cf_node_loop:
903 validate_loop(nir_cf_node_as_loop(node), state);
904 break;
905
906 default:
907 unreachable("Invalid CF node type");
908 }
909 }
910
911 static void
912 prevalidate_reg_decl(nir_register *reg, bool is_global, validate_state *state)
913 {
914 validate_assert(state, reg->is_global == is_global);
915
916 if (is_global)
917 validate_assert(state, reg->index < state->shader->reg_alloc);
918 else
919 validate_assert(state, reg->index < state->impl->reg_alloc);
920 validate_assert(state, !BITSET_TEST(state->regs_found, reg->index));
921 BITSET_SET(state->regs_found, reg->index);
922
923 list_validate(&reg->uses);
924 list_validate(&reg->defs);
925 list_validate(&reg->if_uses);
926
927 reg_validate_state *reg_state = ralloc(state->regs, reg_validate_state);
928 reg_state->uses = _mesa_set_create(reg_state, _mesa_hash_pointer,
929 _mesa_key_pointer_equal);
930 reg_state->if_uses = _mesa_set_create(reg_state, _mesa_hash_pointer,
931 _mesa_key_pointer_equal);
932 reg_state->defs = _mesa_set_create(reg_state, _mesa_hash_pointer,
933 _mesa_key_pointer_equal);
934
935 reg_state->where_defined = is_global ? NULL : state->impl;
936
937 _mesa_hash_table_insert(state->regs, reg, reg_state);
938 }
939
940 static void
941 postvalidate_reg_decl(nir_register *reg, validate_state *state)
942 {
943 struct hash_entry *entry = _mesa_hash_table_search(state->regs, reg);
944
945 assume(entry);
946 reg_validate_state *reg_state = (reg_validate_state *) entry->data;
947
948 nir_foreach_use(src, reg) {
949 struct set_entry *entry = _mesa_set_search(reg_state->uses, src);
950 validate_assert(state, entry);
951 _mesa_set_remove(reg_state->uses, entry);
952 }
953
954 if (reg_state->uses->entries != 0) {
955 printf("extra entries in register uses:\n");
956 set_foreach(reg_state->uses, entry)
957 printf("%p\n", entry->key);
958
959 abort();
960 }
961
962 nir_foreach_if_use(src, reg) {
963 struct set_entry *entry = _mesa_set_search(reg_state->if_uses, src);
964 validate_assert(state, entry);
965 _mesa_set_remove(reg_state->if_uses, entry);
966 }
967
968 if (reg_state->if_uses->entries != 0) {
969 printf("extra entries in register if_uses:\n");
970 set_foreach(reg_state->if_uses, entry)
971 printf("%p\n", entry->key);
972
973 abort();
974 }
975
976 nir_foreach_def(src, reg) {
977 struct set_entry *entry = _mesa_set_search(reg_state->defs, src);
978 validate_assert(state, entry);
979 _mesa_set_remove(reg_state->defs, entry);
980 }
981
982 if (reg_state->defs->entries != 0) {
983 printf("extra entries in register defs:\n");
984 set_foreach(reg_state->defs, entry)
985 printf("%p\n", entry->key);
986
987 abort();
988 }
989 }
990
991 static void
992 validate_var_decl(nir_variable *var, bool is_global, validate_state *state)
993 {
994 state->var = var;
995
996 validate_assert(state, is_global == nir_variable_is_global(var));
997
998 /* Must have exactly one mode set */
999 validate_assert(state, util_is_power_of_two_nonzero(var->data.mode));
1000
1001 if (var->data.compact) {
1002 /* The "compact" flag is only valid on arrays of scalars. */
1003 assert(glsl_type_is_array(var->type));
1004
1005 const struct glsl_type *type = glsl_get_array_element(var->type);
1006 if (nir_is_per_vertex_io(var, state->shader->info.stage)) {
1007 assert(glsl_type_is_array(type));
1008 assert(glsl_type_is_scalar(glsl_get_array_element(type)));
1009 } else {
1010 assert(glsl_type_is_scalar(type));
1011 }
1012 }
1013
1014 if (var->num_members > 0) {
1015 const struct glsl_type *without_array = glsl_without_array(var->type);
1016 validate_assert(state, glsl_type_is_struct(without_array));
1017 validate_assert(state, var->num_members == glsl_get_length(without_array));
1018 validate_assert(state, var->members != NULL);
1019 }
1020
1021 /*
1022 * TODO validate some things ir_validate.cpp does (requires more GLSL type
1023 * support)
1024 */
1025
1026 _mesa_hash_table_insert(state->var_defs, var,
1027 is_global ? NULL : state->impl);
1028
1029 state->var = NULL;
1030 }
1031
1032 static bool
1033 postvalidate_ssa_def(nir_ssa_def *def, void *void_state)
1034 {
1035 validate_state *state = void_state;
1036
1037 struct hash_entry *entry = _mesa_hash_table_search(state->ssa_defs, def);
1038
1039 assume(entry);
1040 ssa_def_validate_state *def_state = (ssa_def_validate_state *)entry->data;
1041
1042 nir_foreach_use(src, def) {
1043 struct set_entry *entry = _mesa_set_search(def_state->uses, src);
1044 validate_assert(state, entry);
1045 _mesa_set_remove(def_state->uses, entry);
1046 }
1047
1048 if (def_state->uses->entries != 0) {
1049 printf("extra entries in SSA def uses:\n");
1050 set_foreach(def_state->uses, entry)
1051 printf("%p\n", entry->key);
1052
1053 abort();
1054 }
1055
1056 nir_foreach_if_use(src, def) {
1057 struct set_entry *entry = _mesa_set_search(def_state->if_uses, src);
1058 validate_assert(state, entry);
1059 _mesa_set_remove(def_state->if_uses, entry);
1060 }
1061
1062 if (def_state->if_uses->entries != 0) {
1063 printf("extra entries in SSA def uses:\n");
1064 set_foreach(def_state->if_uses, entry)
1065 printf("%p\n", entry->key);
1066
1067 abort();
1068 }
1069
1070 return true;
1071 }
1072
1073 static void
1074 validate_function_impl(nir_function_impl *impl, validate_state *state)
1075 {
1076 validate_assert(state, impl->function->impl == impl);
1077 validate_assert(state, impl->cf_node.parent == NULL);
1078
1079 validate_assert(state, exec_list_is_empty(&impl->end_block->instr_list));
1080 validate_assert(state, impl->end_block->successors[0] == NULL);
1081 validate_assert(state, impl->end_block->successors[1] == NULL);
1082
1083 state->impl = impl;
1084 state->parent_node = &impl->cf_node;
1085
1086 exec_list_validate(&impl->locals);
1087 nir_foreach_variable(var, &impl->locals) {
1088 validate_var_decl(var, false, state);
1089 }
1090
1091 state->regs_found = realloc(state->regs_found,
1092 BITSET_WORDS(impl->reg_alloc) *
1093 sizeof(BITSET_WORD));
1094 memset(state->regs_found, 0, BITSET_WORDS(impl->reg_alloc) *
1095 sizeof(BITSET_WORD));
1096 exec_list_validate(&impl->registers);
1097 foreach_list_typed(nir_register, reg, node, &impl->registers) {
1098 prevalidate_reg_decl(reg, false, state);
1099 }
1100
1101 state->ssa_defs_found = realloc(state->ssa_defs_found,
1102 BITSET_WORDS(impl->ssa_alloc) *
1103 sizeof(BITSET_WORD));
1104 memset(state->ssa_defs_found, 0, BITSET_WORDS(impl->ssa_alloc) *
1105 sizeof(BITSET_WORD));
1106 exec_list_validate(&impl->body);
1107 foreach_list_typed(nir_cf_node, node, node, &impl->body) {
1108 validate_cf_node(node, state);
1109 }
1110
1111 foreach_list_typed(nir_register, reg, node, &impl->registers) {
1112 postvalidate_reg_decl(reg, state);
1113 }
1114
1115 nir_foreach_block(block, impl) {
1116 nir_foreach_instr(instr, block)
1117 nir_foreach_ssa_def(instr, postvalidate_ssa_def, state);
1118 }
1119 }
1120
1121 static void
1122 validate_function(nir_function *func, validate_state *state)
1123 {
1124 if (func->impl != NULL) {
1125 validate_assert(state, func->impl->function == func);
1126 validate_function_impl(func->impl, state);
1127 }
1128 }
1129
1130 static void
1131 init_validate_state(validate_state *state)
1132 {
1133 state->regs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
1134 _mesa_key_pointer_equal);
1135 state->ssa_defs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
1136 _mesa_key_pointer_equal);
1137 state->ssa_defs_found = NULL;
1138 state->regs_found = NULL;
1139 state->var_defs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
1140 _mesa_key_pointer_equal);
1141 state->errors = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
1142 _mesa_key_pointer_equal);
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 */