src/glsl/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 /*
  36  * Per-register validation state.
  37  */
  38
  39 typedef struct {
  40    /*
  41     * equivalent to the uses and defs in nir_register, but built up by the
  42     * validator. At the end, we verify that the sets have the same entries.
  43     */
  44    struct set *uses, *defs;
  45    nir_function_impl *where_defined; /* NULL for global registers */
  46 } reg_validate_state;
  47
  48 typedef struct {
  49    /* map of register -> validation state (struct above) */
  50    struct hash_table *regs;
  51
  52    /* the current shader being validated */
  53    nir_shader *shader;
  54
  55    /* the current instruction being validated */
  56    nir_instr *instr;
  57
  58    /* the current basic block being validated */
  59    nir_block *block;
  60
  61    /* the current if statement being validated */
  62    nir_if *if_stmt;
  63
  64    /* the parent of the current cf node being visited */
  65    nir_cf_node *parent_node;
  66
  67    /* the current function implementation being validated */
  68    nir_function_impl *impl;
  69
  70    /* map of SSA value -> function implementation where it is defined */
  71    struct hash_table *ssa_defs;
  72
  73    /* bitset of ssa definitions we have found; used to check uniqueness */
  74    BITSET_WORD *ssa_defs_found;
  75
  76    /* bitset of registers we have currently found; used to check uniqueness */
  77    BITSET_WORD *regs_found;
  78
  79    /* map of local variable -> function implementation where it is defined */
  80    struct hash_table *var_defs;
  81 } validate_state;
  82
  83 static void validate_src(nir_src *src, validate_state *state);
  84
  85 static void
  86 validate_reg_src(nir_reg_src *src, validate_state *state)
  87 {
  88    assert(src->reg != NULL);
  89
  90    struct set_entry *entry =
  91       _mesa_set_search(src->reg->uses, _mesa_hash_pointer(state->instr),
  92                        state->instr);
  93    assert(entry && "use not in nir_register.uses");
  94
  95    struct hash_entry *entry2;
  96    entry2 = _mesa_hash_table_search(state->regs, src->reg);
  97
  98    assert(entry2);
  99
 100    reg_validate_state *reg_state = (reg_validate_state *) entry2->data;
 101    _mesa_set_add(reg_state->uses, _mesa_hash_pointer(state->instr),
 102                  state->instr);
 103
 104    if (!src->reg->is_global) {
 105       assert(reg_state->where_defined == state->impl &&
 106              "using a register declared in a different function");
 107    }
 108
 109    assert((src->reg->num_array_elems == 0 ||
 110           src->base_offset < src->reg->num_array_elems) &&
 111           "definitely out-of-bounds array access");
 112
 113    if (src->indirect) {
 114       assert(src->reg->num_array_elems != 0);
 115       assert((src->indirect->is_ssa || src->indirect->reg.indirect == NULL) &&
 116              "only one level of indirection allowed");
 117       validate_src(src->indirect, state);
 118    }
 119 }
 120
 121 static void
 122 validate_ssa_src(nir_ssa_def *def, validate_state *state)
 123 {
 124    assert(def != NULL);
 125
 126    struct hash_entry *entry = _mesa_hash_table_search(state->ssa_defs, def);
 127
 128    assert(entry);
 129
 130    assert((nir_function_impl *) entry->data == state->impl &&
 131           "using an SSA value defined in a different function");
 132
 133    struct set_entry *entry2;
 134
 135    entry2 = _mesa_set_search(def->uses, _mesa_hash_pointer(state->instr),
 136                               state->instr);
 137
 138    assert(entry2 && "SSA use missing");
 139
 140    /* TODO validate that the use is dominated by the definition */
 141 }
 142
 143 static void
 144 validate_src(nir_src *src, validate_state *state)
 145 {
 146    if (src->is_ssa)
 147       validate_ssa_src(src->ssa, state);
 148    else
 149       validate_reg_src(&src->reg, state);
 150 }
 151
 152 static void
 153 validate_alu_src(nir_alu_instr *instr, unsigned index, validate_state *state)
 154 {
 155    nir_alu_src *src = &instr->src[index];
 156
 157    unsigned num_components;
 158    if (src->src.is_ssa)
 159       num_components = src->src.ssa->num_components;
 160    else {
 161       if (src->src.reg.reg->is_packed)
 162          num_components = 4; /* can't check anything */
 163       else
 164          num_components = src->src.reg.reg->num_components;
 165    }
 166    for (unsigned i = 0; i < 4; i++) {
 167       assert(src->swizzle[i] < 4);
 168
 169       if (nir_alu_instr_channel_used(instr, index, i))
 170          assert(src->swizzle[i] < num_components);
 171    }
 172
 173    validate_src(&src->src, state);
 174 }
 175
 176 static void
 177 validate_reg_dest(nir_reg_dest *dest, validate_state *state)
 178 {
 179    assert(dest->reg != NULL);
 180
 181    struct set_entry *entry =
 182       _mesa_set_search(dest->reg->defs, _mesa_hash_pointer(state->instr),
 183                        state->instr);
 184    assert(entry && "definition not in nir_register.defs");
 185
 186    struct hash_entry *entry2;
 187    entry2 = _mesa_hash_table_search(state->regs, dest->reg);
 188
 189    assert(entry2);
 190
 191    reg_validate_state *reg_state = (reg_validate_state *) entry2->data;
 192    _mesa_set_add(reg_state->defs, _mesa_hash_pointer(state->instr),
 193                  state->instr);
 194
 195    if (!dest->reg->is_global) {
 196       assert(reg_state->where_defined == state->impl &&
 197              "writing to a register declared in a different function");
 198    }
 199
 200    assert((dest->reg->num_array_elems == 0 ||
 201           dest->base_offset < dest->reg->num_array_elems) &&
 202           "definitely out-of-bounds array access");
 203
 204    if (dest->indirect) {
 205       assert(dest->reg->num_array_elems != 0);
 206       assert((dest->indirect->is_ssa || dest->indirect->reg.indirect == NULL) &&
 207              "only one level of indirection allowed");
 208       validate_src(dest->indirect, state);
 209    }
 210 }
 211
 212 static void
 213 validate_ssa_def(nir_ssa_def *def, validate_state *state)
 214 {
 215    assert(def->index < state->impl->ssa_alloc);
 216    assert(!BITSET_TEST(state->ssa_defs_found, def->index));
 217    BITSET_SET(state->ssa_defs_found, def->index);
 218
 219    assert(def->num_components <= 4);
 220    _mesa_hash_table_insert(state->ssa_defs, def, state->impl);
 221 }
 222
 223 static void
 224 validate_dest(nir_dest *dest, validate_state *state)
 225 {
 226    if (dest->is_ssa)
 227       validate_ssa_def(&dest->ssa, state);
 228    else
 229       validate_reg_dest(&dest->reg, state);
 230 }
 231
 232 static void
 233 validate_alu_dest(nir_alu_dest *dest, validate_state *state)
 234 {
 235    unsigned dest_size =
 236       dest->dest.is_ssa ? dest->dest.ssa.num_components
 237                         : dest->dest.reg.reg->num_components;
 238    bool is_packed = !dest->dest.is_ssa && dest->dest.reg.reg->is_packed;
 239    /*
 240     * validate that the instruction doesn't write to components not in the
 241     * register/SSA value
 242     */
 243    assert(is_packed || !(dest->write_mask & ~((1 << dest_size) - 1)));
 244    validate_dest(&dest->dest, state);
 245 }
 246
 247 static void
 248 validate_alu_instr(nir_alu_instr *instr, validate_state *state)
 249 {
 250    assert(instr->op < nir_num_opcodes);
 251
 252    validate_alu_dest(&instr->dest, state);
 253
 254    for (unsigned i = 0; i < nir_op_infos[instr->op].num_inputs; i++) {
 255       validate_alu_src(instr, i, state);
 256    }
 257
 258    if (instr->has_predicate)
 259       validate_src(&instr->predicate, state);
 260 }
 261
 262 static void
 263 validate_deref_chain(nir_deref *deref, validate_state *state)
 264 {
 265    nir_deref *parent = NULL;
 266    while (deref != NULL) {
 267       switch (deref->deref_type) {
 268       case nir_deref_type_array:
 269          assert(deref->type == glsl_get_array_element(parent->type));
 270          if (nir_deref_as_array(deref)->deref_array_type ==
 271              nir_deref_array_type_indirect)
 272             validate_src(&nir_deref_as_array(deref)->indirect, state);
 273          break;
 274
 275       case nir_deref_type_struct:
 276          assert(deref->type ==
 277                 glsl_get_struct_field(parent->type,
 278                                       nir_deref_as_struct(deref)->elem));
 279          break;
 280
 281       case nir_deref_type_var:
 282          break;
 283
 284       default:
 285          assert(!"Invalid deref type");
 286          break;
 287       }
 288
 289       parent = deref;
 290       deref = deref->child;
 291    }
 292 }
 293
 294 static void
 295 validate_var_use(nir_variable *var, validate_state *state)
 296 {
 297    if (var->data.mode == nir_var_local) {
 298       struct hash_entry *entry = _mesa_hash_table_search(state->var_defs, var);
 299
 300       assert(entry);
 301       assert((nir_function_impl *) entry->data == state->impl);
 302    }
 303 }
 304
 305 static void
 306 validate_deref_var(nir_deref_var *deref, validate_state *state)
 307 {
 308    assert(deref != NULL);
 309    assert(deref->deref.type == deref->var->type);
 310
 311    validate_var_use(deref->var, state);
 312
 313    validate_deref_chain(&deref->deref, state);
 314 }
 315
 316 static void
 317 validate_intrinsic_instr(nir_intrinsic_instr *instr, validate_state *state)
 318 {
 319    unsigned num_srcs = nir_intrinsic_infos[instr->intrinsic].num_srcs;
 320    for (unsigned i = 0; i < num_srcs; i++) {
 321       validate_src(&instr->src[i], state);
 322    }
 323
 324    if (nir_intrinsic_infos[instr->intrinsic].has_dest) {
 325       validate_dest(&instr->dest, state);
 326    }
 327
 328    unsigned num_vars = nir_intrinsic_infos[instr->intrinsic].num_variables;
 329    for (unsigned i = 0; i < num_vars; i++) {
 330       validate_deref_var(instr->variables[i], state);
 331    }
 332
 333    if (instr->has_predicate)
 334       validate_src(&instr->predicate, state);
 335 }
 336
 337 static void
 338 validate_tex_instr(nir_tex_instr *instr, validate_state *state)
 339 {
 340    validate_dest(&instr->dest, state);
 341
 342    bool src_type_seen[nir_num_texinput_types];
 343    for (unsigned i = 0; i < nir_num_texinput_types; i++)
 344       src_type_seen[i] = false;
 345
 346    for (unsigned i = 0; i < instr->num_srcs; i++) {
 347       assert(!src_type_seen[instr->src_type[i]]);
 348       src_type_seen[instr->src_type[i]] = true;
 349       validate_src(&instr->src[i], state);
 350    }
 351
 352    if (instr->sampler != NULL)
 353       validate_deref_var(instr->sampler, state);
 354 }
 355
 356 static void
 357 validate_call_instr(nir_call_instr *instr, validate_state *state)
 358 {
 359    if (instr->return_deref == NULL)
 360       assert(glsl_type_is_void(instr->callee->return_type));
 361    else
 362       assert(instr->return_deref->deref.type == instr->callee->return_type);
 363
 364    assert(instr->num_params == instr->callee->num_params);
 365
 366    for (unsigned i = 0; i < instr->num_params; i++) {
 367       assert(instr->callee->params[i].type == instr->params[i]->deref.type);
 368       validate_deref_var(instr->params[i], state);
 369    }
 370
 371    validate_deref_var(instr->return_deref, state);
 372
 373    if (instr->has_predicate)
 374       validate_src(&instr->predicate, state);
 375 }
 376
 377 static void
 378 validate_load_const_instr(nir_load_const_instr *instr, validate_state *state)
 379 {
 380    validate_dest(&instr->dest, state);
 381
 382    if (instr->array_elems != 0) {
 383       assert(!instr->dest.is_ssa);
 384       assert(instr->dest.reg.base_offset + instr->array_elems <=
 385              instr->dest.reg.reg->num_array_elems);
 386    }
 387
 388    if (instr->has_predicate)
 389       validate_src(&instr->predicate, state);
 390 }
 391
 392 static void
 393 validate_ssa_undef_instr(nir_ssa_undef_instr *instr, validate_state *state)
 394 {
 395    validate_ssa_def(&instr->def, state);
 396 }
 397
 398 static void
 399 validate_phi_instr(nir_phi_instr *instr, validate_state *state)
 400 {
 401    /*
 402     * don't validate the sources until we get to them from their predecessor
 403     * basic blocks, to avoid validating an SSA use before its definition.
 404     */
 405
 406    validate_dest(&instr->dest, state);
 407
 408    exec_list_validate(&instr->srcs);
 409    assert(exec_list_length(&instr->srcs) ==
 410           state->block->predecessors->entries);
 411 }
 412
 413 static void
 414 validate_instr(nir_instr *instr, validate_state *state)
 415 {
 416    assert(instr->block == state->block);
 417
 418    state->instr = instr;
 419
 420    switch (instr->type) {
 421    case nir_instr_type_alu:
 422       validate_alu_instr(nir_instr_as_alu(instr), state);
 423       break;
 424
 425    case nir_instr_type_call:
 426       validate_call_instr(nir_instr_as_call(instr), state);
 427       break;
 428
 429    case nir_instr_type_intrinsic:
 430       validate_intrinsic_instr(nir_instr_as_intrinsic(instr), state);
 431       break;
 432
 433    case nir_instr_type_texture:
 434       validate_tex_instr(nir_instr_as_texture(instr), state);
 435       break;
 436
 437    case nir_instr_type_load_const:
 438       validate_load_const_instr(nir_instr_as_load_const(instr), state);
 439       break;
 440
 441    case nir_instr_type_phi:
 442       validate_phi_instr(nir_instr_as_phi(instr), state);
 443       break;
 444
 445    case nir_instr_type_ssa_undef:
 446       validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr), state);
 447       break;
 448
 449    case nir_instr_type_jump:
 450       break;
 451
 452    default:
 453       assert(!"Invalid ALU instruction type");
 454       break;
 455    }
 456 }
 457
 458 static void
 459 validate_phi_src(nir_phi_instr *instr, nir_block *pred, validate_state *state)
 460 {
 461    state->instr = &instr->instr;
 462
 463    exec_list_validate(&instr->srcs);
 464    foreach_list_typed(nir_phi_src, src, node, &instr->srcs) {
 465       if (src->pred == pred) {
 466          validate_src(&src->src, state);
 467          return;
 468       }
 469    }
 470
 471    abort();
 472 }
 473
 474 static void
 475 validate_phi_srcs(nir_block *block, nir_block *succ, validate_state *state)
 476 {
 477    nir_foreach_instr(succ, instr) {
 478       if (instr->type != nir_instr_type_phi)
 479          break;
 480
 481       validate_phi_src(nir_instr_as_phi(instr), block, state);
 482    }
 483 }
 484
 485 static void validate_cf_node(nir_cf_node *node, validate_state *state);
 486
 487 static void
 488 validate_block(nir_block *block, validate_state *state)
 489 {
 490    assert(block->cf_node.parent == state->parent_node);
 491
 492    state->block = block;
 493
 494    exec_list_validate(&block->instr_list);
 495    nir_foreach_instr(block, instr) {
 496       if (instr->type == nir_instr_type_phi) {
 497          assert(instr == nir_block_first_instr(block) ||
 498                 nir_instr_prev(instr)->type == nir_instr_type_phi);
 499       }
 500
 501       if (instr->type == nir_instr_type_jump) {
 502          assert(instr == nir_block_last_instr(block));
 503       }
 504
 505       validate_instr(instr, state);
 506    }
 507
 508    assert(block->successors[0] != NULL);
 509
 510    for (unsigned i = 0; i < 2; i++) {
 511       if (block->successors[i] != NULL) {
 512          struct set_entry *entry =
 513             _mesa_set_search(block->successors[i]->predecessors,
 514                              _mesa_hash_pointer(block), block);
 515          assert(entry);
 516
 517          validate_phi_srcs(block, block->successors[i], state);
 518       }
 519    }
 520
 521    if (!exec_list_is_empty(&block->instr_list) &&
 522        nir_block_last_instr(block)->type == nir_instr_type_jump)
 523       assert(block->successors[1] == NULL);
 524 }
 525
 526 static void
 527 validate_if(nir_if *if_stmt, validate_state *state)
 528 {
 529    assert(!exec_node_is_head_sentinel(if_stmt->cf_node.node.prev));
 530    nir_cf_node *prev_node = nir_cf_node_prev(&if_stmt->cf_node);
 531    assert(prev_node->type == nir_cf_node_block);
 532
 533    nir_block *prev_block = nir_cf_node_as_block(prev_node);
 534    assert(&prev_block->successors[0]->cf_node ==
 535           nir_if_first_then_node(if_stmt));
 536    assert(&prev_block->successors[1]->cf_node ==
 537           nir_if_first_else_node(if_stmt));
 538
 539    assert(!exec_node_is_tail_sentinel(if_stmt->cf_node.node.next));
 540    nir_cf_node *next_node = nir_cf_node_next(&if_stmt->cf_node);
 541    assert(next_node->type == nir_cf_node_block);
 542
 543    if (!if_stmt->condition.is_ssa) {
 544       nir_register *reg = if_stmt->condition.reg.reg;
 545       struct set_entry *entry =
 546          _mesa_set_search(reg->if_uses, _mesa_hash_pointer(if_stmt), if_stmt);
 547       assert(entry);
 548    } else {
 549       nir_ssa_def *def = if_stmt->condition.ssa;
 550       struct set_entry *entry =
 551          _mesa_set_search(def->if_uses, _mesa_hash_pointer(if_stmt), if_stmt);
 552       assert(entry);
 553    }
 554
 555    assert(!exec_list_is_empty(&if_stmt->then_list));
 556    assert(!exec_list_is_empty(&if_stmt->else_list));
 557
 558    nir_cf_node *old_parent = state->parent_node;
 559    state->parent_node = &if_stmt->cf_node;
 560
 561    exec_list_validate(&if_stmt->then_list);
 562    foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->then_list) {
 563       validate_cf_node(cf_node, state);
 564    }
 565
 566    exec_list_validate(&if_stmt->else_list);
 567    foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->else_list) {
 568       validate_cf_node(cf_node, state);
 569    }
 570
 571    state->parent_node = old_parent;
 572 }
 573
 574 static void
 575 validate_loop(nir_loop *loop, validate_state *state)
 576 {
 577    assert(!exec_node_is_head_sentinel(loop->cf_node.node.prev));
 578    nir_cf_node *prev_node = nir_cf_node_prev(&loop->cf_node);
 579    assert(prev_node->type == nir_cf_node_block);
 580
 581    nir_block *prev_block = nir_cf_node_as_block(prev_node);
 582    assert(&prev_block->successors[0]->cf_node == nir_loop_first_cf_node(loop));
 583    assert(prev_block->successors[1] == NULL);
 584
 585    assert(!exec_node_is_tail_sentinel(loop->cf_node.node.next));
 586    nir_cf_node *next_node = nir_cf_node_next(&loop->cf_node);
 587    assert(next_node->type == nir_cf_node_block);
 588
 589    assert(!exec_list_is_empty(&loop->body));
 590
 591    nir_cf_node *old_parent = state->parent_node;
 592    state->parent_node = &loop->cf_node;
 593
 594    exec_list_validate(&loop->body);
 595    foreach_list_typed(nir_cf_node, cf_node, node, &loop->body) {
 596       validate_cf_node(cf_node, state);
 597    }
 598
 599    state->parent_node = old_parent;
 600 }
 601
 602 static void
 603 validate_cf_node(nir_cf_node *node, validate_state *state)
 604 {
 605    assert(node->parent == state->parent_node);
 606
 607    switch (node->type) {
 608    case nir_cf_node_block:
 609       validate_block(nir_cf_node_as_block(node), state);
 610       break;
 611
 612    case nir_cf_node_if:
 613       validate_if(nir_cf_node_as_if(node), state);
 614       break;
 615
 616    case nir_cf_node_loop:
 617       validate_loop(nir_cf_node_as_loop(node), state);
 618       break;
 619
 620    default:
 621       assert(!"Invalid ALU instruction type");
 622       break;
 623    }
 624 }
 625
 626 static void
 627 prevalidate_reg_decl(nir_register *reg, bool is_global, validate_state *state)
 628 {
 629    assert(reg->is_global == is_global);
 630
 631    if (is_global)
 632       assert(reg->index < state->shader->reg_alloc);
 633    else
 634       assert(reg->index < state->impl->reg_alloc);
 635    assert(!BITSET_TEST(state->regs_found, reg->index));
 636    BITSET_SET(state->regs_found, reg->index);
 637
 638    reg_validate_state *reg_state = ralloc(state->regs, reg_validate_state);
 639    reg_state->uses = _mesa_set_create(reg_state, _mesa_key_pointer_equal);
 640    reg_state->defs = _mesa_set_create(reg_state, _mesa_key_pointer_equal);
 641
 642    reg_state->where_defined = is_global ? NULL : state->impl;
 643
 644    _mesa_hash_table_insert(state->regs, reg, reg_state);
 645 }
 646
 647 static void
 648 postvalidate_reg_decl(nir_register *reg, validate_state *state)
 649 {
 650    struct hash_entry *entry = _mesa_hash_table_search(state->regs, reg);
 651
 652    reg_validate_state *reg_state = (reg_validate_state *) entry->data;
 653
 654    if (reg_state->uses->entries != reg->uses->entries) {
 655       printf("extra entries in register uses:\n");
 656       struct set_entry *entry;
 657       set_foreach(reg->uses, entry) {
 658          struct set_entry *entry2 =
 659             _mesa_set_search(reg_state->uses, _mesa_hash_pointer(entry->key),
 660                              entry->key);
 661
 662          if (entry2 == NULL) {
 663             printf("%p\n", entry->key);
 664          }
 665       }
 666
 667       abort();
 668    }
 669
 670    if (reg_state->defs->entries != reg->defs->entries) {
 671       printf("extra entries in register defs:\n");
 672       struct set_entry *entry;
 673       set_foreach(reg->defs, entry) {
 674          struct set_entry *entry2 =
 675             _mesa_set_search(reg_state->defs, _mesa_hash_pointer(entry->key),
 676                              entry->key);
 677
 678          if (entry2 == NULL) {
 679             printf("%p\n", entry->key);
 680          }
 681       }
 682
 683       abort();
 684    }
 685 }
 686
 687 static void
 688 validate_var_decl(nir_variable *var, bool is_global, validate_state *state)
 689 {
 690    assert(is_global != (var->data.mode == nir_var_local));
 691
 692    /*
 693     * TODO validate some things ir_validate.cpp does (requires more GLSL type
 694     * support)
 695     */
 696
 697    if (!is_global) {
 698       _mesa_hash_table_insert(state->var_defs, var, state->impl);
 699    }
 700 }
 701
 702 static void
 703 validate_function_impl(nir_function_impl *impl, validate_state *state)
 704 {
 705    assert(impl->overload->impl == impl);
 706    assert(impl->cf_node.parent == NULL);
 707
 708    assert(impl->num_params == impl->overload->num_params);
 709    for (unsigned i = 0; i < impl->num_params; i++)
 710       assert(impl->params[i]->type == impl->overload->params[i].type);
 711
 712    if (glsl_type_is_void(impl->overload->return_type))
 713       assert(impl->return_var == NULL);
 714    else
 715       assert(impl->return_var->type == impl->overload->return_type);
 716
 717    assert(exec_list_is_empty(&impl->end_block->instr_list));
 718    assert(impl->end_block->successors[0] == NULL);
 719    assert(impl->end_block->successors[1] == NULL);
 720
 721    state->impl = impl;
 722    state->parent_node = &impl->cf_node;
 723
 724    exec_list_validate(&impl->locals);
 725    foreach_list_typed(nir_variable, var, node, &impl->locals) {
 726       validate_var_decl(var, false, state);
 727    }
 728
 729    state->regs_found = realloc(state->regs_found,
 730                                BITSET_WORDS(impl->reg_alloc) *
 731                                sizeof(BITSET_WORD));
 732    memset(state->regs_found, 0, BITSET_WORDS(impl->reg_alloc) *
 733                                 sizeof(BITSET_WORD));
 734    exec_list_validate(&impl->registers);
 735    foreach_list_typed(nir_register, reg, node, &impl->registers) {
 736       prevalidate_reg_decl(reg, false, state);
 737    }
 738
 739    state->ssa_defs_found = realloc(state->ssa_defs_found,
 740                                    BITSET_WORDS(impl->ssa_alloc) *
 741                                    sizeof(BITSET_WORD));
 742    memset(state->ssa_defs_found, 0, BITSET_WORDS(impl->ssa_alloc) *
 743                                     sizeof(BITSET_WORD));
 744    exec_list_validate(&impl->body);
 745    foreach_list_typed(nir_cf_node, node, node, &impl->body) {
 746       validate_cf_node(node, state);
 747    }
 748
 749    foreach_list_typed(nir_register, reg, node, &impl->registers) {
 750       postvalidate_reg_decl(reg, state);
 751    }
 752 }
 753
 754 static void
 755 validate_function_overload(nir_function_overload *overload,
 756                            validate_state *state)
 757 {
 758    if (overload->impl != NULL)
 759       validate_function_impl(overload->impl, state);
 760 }
 761
 762 static void
 763 validate_function(nir_function *func, validate_state *state)
 764 {
 765    exec_list_validate(&func->overload_list);
 766    foreach_list_typed(nir_function_overload, overload, node, &func->overload_list) {
 767       assert(overload->function == func);
 768       validate_function_overload(overload, state);
 769    }
 770 }
 771
 772 static void
 773 init_validate_state(validate_state *state)
 774 {
 775    state->regs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
 776                                          _mesa_key_pointer_equal);
 777    state->ssa_defs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
 778                                              _mesa_key_pointer_equal);
 779    state->ssa_defs_found = NULL;
 780    state->regs_found = NULL;
 781    state->var_defs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
 782                                              _mesa_key_pointer_equal);
 783 }
 784
 785 static void
 786 destroy_validate_state(validate_state *state)
 787 {
 788    _mesa_hash_table_destroy(state->regs, NULL);
 789    _mesa_hash_table_destroy(state->ssa_defs, NULL);
 790    free(state->ssa_defs_found);
 791    free(state->regs_found);
 792    _mesa_hash_table_destroy(state->var_defs, NULL);
 793 }
 794
 795 void
 796 nir_validate_shader(nir_shader *shader)
 797 {
 798    validate_state state;
 799    init_validate_state(&state);
 800
 801    state.shader = shader;
 802
 803    struct hash_entry *entry;
 804    hash_table_foreach(shader->uniforms, entry) {
 805       validate_var_decl((nir_variable *) entry->data, true, &state);
 806    }
 807
 808    hash_table_foreach(shader->inputs, entry) {
 809      validate_var_decl((nir_variable *) entry->data, true, &state);
 810    }
 811
 812    hash_table_foreach(shader->outputs, entry) {
 813       validate_var_decl((nir_variable *) entry->data, true, &state);
 814    }
 815
 816    exec_list_validate(&shader->globals);
 817    foreach_list_typed(nir_variable, var, node, &shader->globals) {
 818      validate_var_decl(var, true, &state);
 819    }
 820
 821    exec_list_validate(&shader->system_values);
 822    foreach_list_typed(nir_variable, var, node, &shader->system_values) {
 823      validate_var_decl(var, true, &state);
 824    }
 825
 826    state.regs_found = realloc(state.regs_found,
 827                               BITSET_WORDS(shader->reg_alloc) *
 828                               sizeof(BITSET_WORD));
 829    memset(state.regs_found, 0, BITSET_WORDS(shader->reg_alloc) *
 830                                sizeof(BITSET_WORD));
 831    exec_list_validate(&shader->registers);
 832    foreach_list_typed(nir_register, reg, node, &shader->registers) {
 833       prevalidate_reg_decl(reg, true, &state);
 834    }
 835
 836    exec_list_validate(&shader->functions);
 837    foreach_list_typed(nir_function, func, node, &shader->functions) {
 838       validate_function(func, &state);
 839    }
 840
 841    foreach_list_typed(nir_register, reg, node, &shader->registers) {
 842       postvalidate_reg_decl(reg, &state);
 843    }
 844
 845    destroy_validate_state(&state);
 846 }