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 /* 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 #ifdef DEBUG
  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 basic block being validated */
  73    nir_block *block;
  74
  75    /* the current if statement being validated */
  76    nir_if *if_stmt;
  77
  78    /* the current loop being visited */
  79    nir_loop *loop;
  80
  81    /* the parent of the current cf node being visited */
  82    nir_cf_node *parent_node;
  83
  84    /* the current function implementation being validated */
  85    nir_function_impl *impl;
  86
  87    /* map of SSA value -> function implementation where it is defined */
  88    struct hash_table *ssa_defs;
  89
  90    /* bitset of ssa definitions we have found; used to check uniqueness */
  91    BITSET_WORD *ssa_defs_found;
  92
  93    /* bitset of registers we have currently found; used to check uniqueness */
  94    BITSET_WORD *regs_found;
  95
  96    /* map of local variable -> function implementation where it is defined */
  97    struct hash_table *var_defs;
  98 } validate_state;
  99
 100 static void validate_src(nir_src *src, validate_state *state);
 101
 102 static void
 103 validate_reg_src(nir_src *src, validate_state *state)
 104 {
 105    assert(src->reg.reg != NULL);
 106
 107    struct hash_entry *entry;
 108    entry = _mesa_hash_table_search(state->regs, src->reg.reg);
 109    assert(entry);
 110
 111    reg_validate_state *reg_state = (reg_validate_state *) entry->data;
 112
 113    if (state->instr) {
 114       _mesa_set_add(reg_state->uses, src);
 115    } else {
 116       assert(state->if_stmt);
 117       _mesa_set_add(reg_state->if_uses, src);
 118    }
 119
 120    if (!src->reg.reg->is_global) {
 121       assert(reg_state->where_defined == state->impl &&
 122              "using a register declared in a different function");
 123    }
 124
 125    assert((src->reg.reg->num_array_elems == 0 ||
 126           src->reg.base_offset < src->reg.reg->num_array_elems) &&
 127           "definitely out-of-bounds array access");
 128
 129    if (src->reg.indirect) {
 130       assert(src->reg.reg->num_array_elems != 0);
 131       assert((src->reg.indirect->is_ssa ||
 132               src->reg.indirect->reg.indirect == NULL) &&
 133              "only one level of indirection allowed");
 134       validate_src(src->reg.indirect, state);
 135    }
 136 }
 137
 138 static void
 139 validate_ssa_src(nir_src *src, validate_state *state)
 140 {
 141    assert(src->ssa != NULL);
 142
 143    struct hash_entry *entry = _mesa_hash_table_search(state->ssa_defs, src->ssa);
 144
 145    assert(entry);
 146
 147    ssa_def_validate_state *def_state = (ssa_def_validate_state *)entry->data;
 148
 149    assert(def_state->where_defined == state->impl &&
 150           "using an SSA value defined in a different function");
 151
 152    if (state->instr) {
 153       _mesa_set_add(def_state->uses, src);
 154    } else {
 155       assert(state->if_stmt);
 156       _mesa_set_add(def_state->if_uses, src);
 157    }
 158
 159    /* TODO validate that the use is dominated by the definition */
 160 }
 161
 162 static void
 163 validate_src(nir_src *src, validate_state *state)
 164 {
 165    if (state->instr)
 166       assert(src->parent_instr == state->instr);
 167    else
 168       assert(src->parent_if == state->if_stmt);
 169
 170    if (src->is_ssa)
 171       validate_ssa_src(src, state);
 172    else
 173       validate_reg_src(src, state);
 174 }
 175
 176 static void
 177 validate_alu_src(nir_alu_instr *instr, unsigned index, validate_state *state)
 178 {
 179    nir_alu_src *src = &instr->src[index];
 180
 181    unsigned num_components;
 182    if (src->src.is_ssa)
 183       num_components = src->src.ssa->num_components;
 184    else {
 185       if (src->src.reg.reg->is_packed)
 186          num_components = 4; /* can't check anything */
 187       else
 188          num_components = src->src.reg.reg->num_components;
 189    }
 190    for (unsigned i = 0; i < 4; i++) {
 191       assert(src->swizzle[i] < 4);
 192
 193       if (nir_alu_instr_channel_used(instr, index, i))
 194          assert(src->swizzle[i] < num_components);
 195    }
 196
 197    validate_src(&src->src, state);
 198 }
 199
 200 static void
 201 validate_reg_dest(nir_reg_dest *dest, validate_state *state)
 202 {
 203    assert(dest->reg != NULL);
 204
 205    assert(dest->parent_instr == state->instr);
 206
 207    struct hash_entry *entry2;
 208    entry2 = _mesa_hash_table_search(state->regs, dest->reg);
 209
 210    assert(entry2);
 211
 212    reg_validate_state *reg_state = (reg_validate_state *) entry2->data;
 213    _mesa_set_add(reg_state->defs, dest);
 214
 215    if (!dest->reg->is_global) {
 216       assert(reg_state->where_defined == state->impl &&
 217              "writing to a register declared in a different function");
 218    }
 219
 220    assert((dest->reg->num_array_elems == 0 ||
 221           dest->base_offset < dest->reg->num_array_elems) &&
 222           "definitely out-of-bounds array access");
 223
 224    if (dest->indirect) {
 225       assert(dest->reg->num_array_elems != 0);
 226       assert((dest->indirect->is_ssa || dest->indirect->reg.indirect == NULL) &&
 227              "only one level of indirection allowed");
 228       validate_src(dest->indirect, state);
 229    }
 230 }
 231
 232 static void
 233 validate_ssa_def(nir_ssa_def *def, validate_state *state)
 234 {
 235    assert(def->index < state->impl->ssa_alloc);
 236    assert(!BITSET_TEST(state->ssa_defs_found, def->index));
 237    BITSET_SET(state->ssa_defs_found, def->index);
 238
 239    assert(def->parent_instr == state->instr);
 240
 241    assert(def->num_components <= 4);
 242
 243    list_validate(&def->uses);
 244    list_validate(&def->if_uses);
 245
 246    ssa_def_validate_state *def_state = ralloc(state->ssa_defs,
 247                                               ssa_def_validate_state);
 248    def_state->where_defined = state->impl;
 249    def_state->uses = _mesa_set_create(def_state, _mesa_hash_pointer,
 250                                       _mesa_key_pointer_equal);
 251    def_state->if_uses = _mesa_set_create(def_state, _mesa_hash_pointer,
 252                                          _mesa_key_pointer_equal);
 253    _mesa_hash_table_insert(state->ssa_defs, def, def_state);
 254 }
 255
 256 static void
 257 validate_dest(nir_dest *dest, validate_state *state)
 258 {
 259    if (dest->is_ssa)
 260       validate_ssa_def(&dest->ssa, state);
 261    else
 262       validate_reg_dest(&dest->reg, state);
 263 }
 264
 265 static void
 266 validate_alu_dest(nir_alu_dest *dest, validate_state *state)
 267 {
 268    unsigned dest_size =
 269       dest->dest.is_ssa ? dest->dest.ssa.num_components
 270                         : dest->dest.reg.reg->num_components;
 271    bool is_packed = !dest->dest.is_ssa && dest->dest.reg.reg->is_packed;
 272    /*
 273     * validate that the instruction doesn't write to components not in the
 274     * register/SSA value
 275     */
 276    assert(is_packed || !(dest->write_mask & ~((1 << dest_size) - 1)));
 277
 278    /* validate that saturate is only ever used on instructions with
 279     * destinations of type float
 280     */
 281    nir_alu_instr *alu = nir_instr_as_alu(state->instr);
 282    assert(nir_op_infos[alu->op].output_type == nir_type_float ||
 283           !dest->saturate);
 284
 285    validate_dest(&dest->dest, state);
 286 }
 287
 288 static void
 289 validate_alu_instr(nir_alu_instr *instr, validate_state *state)
 290 {
 291    assert(instr->op < nir_num_opcodes);
 292
 293    validate_alu_dest(&instr->dest, state);
 294
 295    for (unsigned i = 0; i < nir_op_infos[instr->op].num_inputs; i++) {
 296       validate_alu_src(instr, i, state);
 297    }
 298 }
 299
 300 static void
 301 validate_deref_chain(nir_deref *deref, validate_state *state)
 302 {
 303    assert(deref->child == NULL || ralloc_parent(deref->child) == deref);
 304
 305    nir_deref *parent = NULL;
 306    while (deref != NULL) {
 307       switch (deref->deref_type) {
 308       case nir_deref_type_array:
 309          assert(deref->type == glsl_get_array_element(parent->type));
 310          if (nir_deref_as_array(deref)->deref_array_type ==
 311              nir_deref_array_type_indirect)
 312             validate_src(&nir_deref_as_array(deref)->indirect, state);
 313          break;
 314
 315       case nir_deref_type_struct:
 316          assert(deref->type ==
 317                 glsl_get_struct_field(parent->type,
 318                                       nir_deref_as_struct(deref)->index));
 319          break;
 320
 321       case nir_deref_type_var:
 322          break;
 323
 324       default:
 325          assert(!"Invalid deref type");
 326          break;
 327       }
 328
 329       parent = deref;
 330       deref = deref->child;
 331    }
 332 }
 333
 334 static void
 335 validate_var_use(nir_variable *var, validate_state *state)
 336 {
 337    if (var->data.mode == nir_var_local) {
 338       struct hash_entry *entry = _mesa_hash_table_search(state->var_defs, var);
 339
 340       assert(entry);
 341       assert((nir_function_impl *) entry->data == state->impl);
 342    }
 343 }
 344
 345 static void
 346 validate_deref_var(void *parent_mem_ctx, nir_deref_var *deref, validate_state *state)
 347 {
 348    assert(deref != NULL);
 349    assert(ralloc_parent(deref) == parent_mem_ctx);
 350    assert(deref->deref.type == deref->var->type);
 351
 352    validate_var_use(deref->var, state);
 353
 354    validate_deref_chain(&deref->deref, state);
 355 }
 356
 357 static void
 358 validate_intrinsic_instr(nir_intrinsic_instr *instr, validate_state *state)
 359 {
 360    unsigned num_srcs = nir_intrinsic_infos[instr->intrinsic].num_srcs;
 361    for (unsigned i = 0; i < num_srcs; i++) {
 362       unsigned components_read =
 363          nir_intrinsic_infos[instr->intrinsic].src_components[i];
 364       if (components_read == 0)
 365          components_read = instr->num_components;
 366
 367       assert(components_read > 0);
 368
 369       if (instr->src[i].is_ssa) {
 370          assert(components_read <= instr->src[i].ssa->num_components);
 371       } else if (!instr->src[i].reg.reg->is_packed) {
 372          assert(components_read <= instr->src[i].reg.reg->num_components);
 373       }
 374
 375       validate_src(&instr->src[i], state);
 376    }
 377
 378    if (nir_intrinsic_infos[instr->intrinsic].has_dest) {
 379       unsigned components_written =
 380          nir_intrinsic_infos[instr->intrinsic].dest_components;
 381       if (components_written == 0)
 382          components_written = instr->num_components;
 383
 384       assert(components_written > 0);
 385
 386       if (instr->dest.is_ssa) {
 387          assert(components_written <= instr->dest.ssa.num_components);
 388       } else if (!instr->dest.reg.reg->is_packed) {
 389          assert(components_written <= instr->dest.reg.reg->num_components);
 390       }
 391
 392       validate_dest(&instr->dest, state);
 393    }
 394
 395    unsigned num_vars = nir_intrinsic_infos[instr->intrinsic].num_variables;
 396    for (unsigned i = 0; i < num_vars; i++) {
 397       validate_deref_var(instr, instr->variables[i], state);
 398    }
 399
 400    switch (instr->intrinsic) {
 401    case nir_intrinsic_load_var:
 402       assert(instr->variables[0]->var->data.mode != nir_var_shader_out);
 403       break;
 404    case nir_intrinsic_store_var:
 405       assert(instr->variables[0]->var->data.mode != nir_var_shader_in &&
 406              instr->variables[0]->var->data.mode != nir_var_uniform &&
 407              instr->variables[0]->var->data.mode != nir_var_shader_storage);
 408       break;
 409    case nir_intrinsic_copy_var:
 410       assert(instr->variables[0]->var->data.mode != nir_var_shader_in &&
 411              instr->variables[0]->var->data.mode != nir_var_uniform &&
 412              instr->variables[0]->var->data.mode != nir_var_shader_storage);
 413       assert(instr->variables[1]->var->data.mode != nir_var_shader_out);
 414       break;
 415    default:
 416       break;
 417    }
 418 }
 419
 420 static void
 421 validate_tex_instr(nir_tex_instr *instr, validate_state *state)
 422 {
 423    validate_dest(&instr->dest, state);
 424
 425    bool src_type_seen[nir_num_tex_src_types];
 426    for (unsigned i = 0; i < nir_num_tex_src_types; i++)
 427       src_type_seen[i] = false;
 428
 429    for (unsigned i = 0; i < instr->num_srcs; i++) {
 430       assert(!src_type_seen[instr->src[i].src_type]);
 431       src_type_seen[instr->src[i].src_type] = true;
 432       validate_src(&instr->src[i].src, state);
 433    }
 434
 435    if (instr->sampler != NULL)
 436       validate_deref_var(instr, instr->sampler, state);
 437 }
 438
 439 static void
 440 validate_call_instr(nir_call_instr *instr, validate_state *state)
 441 {
 442    if (instr->return_deref == NULL)
 443       assert(glsl_type_is_void(instr->callee->return_type));
 444    else
 445       assert(instr->return_deref->deref.type == instr->callee->return_type);
 446
 447    assert(instr->num_params == instr->callee->num_params);
 448
 449    for (unsigned i = 0; i < instr->num_params; i++) {
 450       assert(instr->callee->params[i].type == instr->params[i]->deref.type);
 451       validate_deref_var(instr, instr->params[i], state);
 452    }
 453
 454    validate_deref_var(instr, instr->return_deref, state);
 455 }
 456
 457 static void
 458 validate_load_const_instr(nir_load_const_instr *instr, validate_state *state)
 459 {
 460    validate_ssa_def(&instr->def, state);
 461 }
 462
 463 static void
 464 validate_ssa_undef_instr(nir_ssa_undef_instr *instr, validate_state *state)
 465 {
 466    validate_ssa_def(&instr->def, state);
 467 }
 468
 469 static void
 470 validate_phi_instr(nir_phi_instr *instr, validate_state *state)
 471 {
 472    /*
 473     * don't validate the sources until we get to them from their predecessor
 474     * basic blocks, to avoid validating an SSA use before its definition.
 475     */
 476
 477    validate_dest(&instr->dest, state);
 478
 479    exec_list_validate(&instr->srcs);
 480    assert(exec_list_length(&instr->srcs) ==
 481           state->block->predecessors->entries);
 482 }
 483
 484 static void
 485 validate_instr(nir_instr *instr, validate_state *state)
 486 {
 487    assert(instr->block == state->block);
 488
 489    state->instr = instr;
 490
 491    switch (instr->type) {
 492    case nir_instr_type_alu:
 493       validate_alu_instr(nir_instr_as_alu(instr), state);
 494       break;
 495
 496    case nir_instr_type_call:
 497       validate_call_instr(nir_instr_as_call(instr), state);
 498       break;
 499
 500    case nir_instr_type_intrinsic:
 501       validate_intrinsic_instr(nir_instr_as_intrinsic(instr), state);
 502       break;
 503
 504    case nir_instr_type_tex:
 505       validate_tex_instr(nir_instr_as_tex(instr), state);
 506       break;
 507
 508    case nir_instr_type_load_const:
 509       validate_load_const_instr(nir_instr_as_load_const(instr), state);
 510       break;
 511
 512    case nir_instr_type_phi:
 513       validate_phi_instr(nir_instr_as_phi(instr), state);
 514       break;
 515
 516    case nir_instr_type_ssa_undef:
 517       validate_ssa_undef_instr(nir_instr_as_ssa_undef(instr), state);
 518       break;
 519
 520    case nir_instr_type_jump:
 521       break;
 522
 523    default:
 524       assert(!"Invalid ALU instruction type");
 525       break;
 526    }
 527
 528    state->instr = NULL;
 529 }
 530
 531 static void
 532 validate_phi_src(nir_phi_instr *instr, nir_block *pred, validate_state *state)
 533 {
 534    state->instr = &instr->instr;
 535
 536    assert(instr->dest.is_ssa);
 537
 538    exec_list_validate(&instr->srcs);
 539    nir_foreach_phi_src(instr, src) {
 540       if (src->pred == pred) {
 541          assert(src->src.is_ssa);
 542          assert(src->src.ssa->num_components ==
 543                 instr->dest.ssa.num_components);
 544
 545          validate_src(&src->src, state);
 546          state->instr = NULL;
 547          return;
 548       }
 549    }
 550
 551    abort();
 552 }
 553
 554 static void
 555 validate_phi_srcs(nir_block *block, nir_block *succ, validate_state *state)
 556 {
 557    nir_foreach_instr(succ, instr) {
 558       if (instr->type != nir_instr_type_phi)
 559          break;
 560
 561       validate_phi_src(nir_instr_as_phi(instr), block, state);
 562    }
 563 }
 564
 565 static void validate_cf_node(nir_cf_node *node, validate_state *state);
 566
 567 static void
 568 validate_block(nir_block *block, validate_state *state)
 569 {
 570    assert(block->cf_node.parent == state->parent_node);
 571
 572    state->block = block;
 573
 574    exec_list_validate(&block->instr_list);
 575    nir_foreach_instr(block, instr) {
 576       if (instr->type == nir_instr_type_phi) {
 577          assert(instr == nir_block_first_instr(block) ||
 578                 nir_instr_prev(instr)->type == nir_instr_type_phi);
 579       }
 580
 581       if (instr->type == nir_instr_type_jump) {
 582          assert(instr == nir_block_last_instr(block));
 583       }
 584
 585       validate_instr(instr, state);
 586    }
 587
 588    assert(block->successors[0] != NULL);
 589
 590    for (unsigned i = 0; i < 2; i++) {
 591       if (block->successors[i] != NULL) {
 592          struct set_entry *entry =
 593             _mesa_set_search(block->successors[i]->predecessors, block);
 594          assert(entry);
 595
 596          validate_phi_srcs(block, block->successors[i], state);
 597       }
 598    }
 599
 600    struct set_entry *entry;
 601    set_foreach(block->predecessors, entry) {
 602       const nir_block *pred = entry->key;
 603       assert(pred->successors[0] == block ||
 604              pred->successors[1] == block);
 605    }
 606
 607    if (!exec_list_is_empty(&block->instr_list) &&
 608        nir_block_last_instr(block)->type == nir_instr_type_jump) {
 609       assert(block->successors[1] == NULL);
 610       nir_jump_instr *jump = nir_instr_as_jump(nir_block_last_instr(block));
 611       switch (jump->type) {
 612       case nir_jump_break: {
 613          nir_block *after =
 614             nir_cf_node_as_block(nir_cf_node_next(&state->loop->cf_node));
 615          assert(block->successors[0] == after);
 616          break;
 617       }
 618
 619       case nir_jump_continue: {
 620          nir_block *first =
 621             nir_cf_node_as_block(nir_loop_first_cf_node(state->loop));
 622          assert(block->successors[0] == first);
 623          break;
 624       }
 625
 626       case nir_jump_return:
 627          assert(block->successors[0] == state->impl->end_block);
 628          break;
 629
 630       default:
 631          unreachable("bad jump type");
 632       }
 633    } else {
 634       nir_cf_node *next = nir_cf_node_next(&block->cf_node);
 635       if (next == NULL) {
 636          switch (state->parent_node->type) {
 637          case nir_cf_node_loop: {
 638             nir_block *first =
 639                nir_cf_node_as_block(nir_loop_first_cf_node(state->loop));
 640             assert(block->successors[0] == first);
 641             /* due to the hack for infinite loops, block->successors[1] may
 642              * point to the block after the loop.
 643              */
 644             break;
 645          }
 646
 647          case nir_cf_node_if: {
 648             nir_block *after =
 649                nir_cf_node_as_block(nir_cf_node_next(state->parent_node));
 650             assert(block->successors[0] == after);
 651             assert(block->successors[1] == NULL);
 652             break;
 653          }
 654
 655          case nir_cf_node_function:
 656             assert(block->successors[0] == state->impl->end_block);
 657             assert(block->successors[1] == NULL);
 658             break;
 659
 660          default:
 661             unreachable("unknown control flow node type");
 662          }
 663       } else {
 664          if (next->type == nir_cf_node_if) {
 665             nir_if *if_stmt = nir_cf_node_as_if(next);
 666             assert(&block->successors[0]->cf_node ==
 667                    nir_if_first_then_node(if_stmt));
 668             assert(&block->successors[1]->cf_node ==
 669                    nir_if_first_else_node(if_stmt));
 670          } else {
 671             assert(next->type == nir_cf_node_loop);
 672             nir_loop *loop = nir_cf_node_as_loop(next);
 673             assert(&block->successors[0]->cf_node ==
 674                    nir_loop_first_cf_node(loop));
 675             assert(block->successors[1] == NULL);
 676          }
 677       }
 678    }
 679 }
 680
 681 static void
 682 validate_if(nir_if *if_stmt, validate_state *state)
 683 {
 684    state->if_stmt = if_stmt;
 685
 686    assert(!exec_node_is_head_sentinel(if_stmt->cf_node.node.prev));
 687    nir_cf_node *prev_node = nir_cf_node_prev(&if_stmt->cf_node);
 688    assert(prev_node->type == nir_cf_node_block);
 689
 690    assert(!exec_node_is_tail_sentinel(if_stmt->cf_node.node.next));
 691    nir_cf_node *next_node = nir_cf_node_next(&if_stmt->cf_node);
 692    assert(next_node->type == nir_cf_node_block);
 693
 694    validate_src(&if_stmt->condition, state);
 695
 696    assert(!exec_list_is_empty(&if_stmt->then_list));
 697    assert(!exec_list_is_empty(&if_stmt->else_list));
 698
 699    nir_cf_node *old_parent = state->parent_node;
 700    state->parent_node = &if_stmt->cf_node;
 701
 702    exec_list_validate(&if_stmt->then_list);
 703    foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->then_list) {
 704       validate_cf_node(cf_node, state);
 705    }
 706
 707    exec_list_validate(&if_stmt->else_list);
 708    foreach_list_typed(nir_cf_node, cf_node, node, &if_stmt->else_list) {
 709       validate_cf_node(cf_node, state);
 710    }
 711
 712    state->parent_node = old_parent;
 713    state->if_stmt = NULL;
 714 }
 715
 716 static void
 717 validate_loop(nir_loop *loop, validate_state *state)
 718 {
 719    assert(!exec_node_is_head_sentinel(loop->cf_node.node.prev));
 720    nir_cf_node *prev_node = nir_cf_node_prev(&loop->cf_node);
 721    assert(prev_node->type == nir_cf_node_block);
 722
 723    assert(!exec_node_is_tail_sentinel(loop->cf_node.node.next));
 724    nir_cf_node *next_node = nir_cf_node_next(&loop->cf_node);
 725    assert(next_node->type == nir_cf_node_block);
 726
 727    assert(!exec_list_is_empty(&loop->body));
 728
 729    nir_cf_node *old_parent = state->parent_node;
 730    state->parent_node = &loop->cf_node;
 731    nir_loop *old_loop = state->loop;
 732    state->loop = loop;
 733
 734    exec_list_validate(&loop->body);
 735    foreach_list_typed(nir_cf_node, cf_node, node, &loop->body) {
 736       validate_cf_node(cf_node, state);
 737    }
 738
 739    state->parent_node = old_parent;
 740    state->loop = old_loop;
 741 }
 742
 743 static void
 744 validate_cf_node(nir_cf_node *node, validate_state *state)
 745 {
 746    assert(node->parent == state->parent_node);
 747
 748    switch (node->type) {
 749    case nir_cf_node_block:
 750       validate_block(nir_cf_node_as_block(node), state);
 751       break;
 752
 753    case nir_cf_node_if:
 754       validate_if(nir_cf_node_as_if(node), state);
 755       break;
 756
 757    case nir_cf_node_loop:
 758       validate_loop(nir_cf_node_as_loop(node), state);
 759       break;
 760
 761    default:
 762       unreachable("Invalid CF node type");
 763    }
 764 }
 765
 766 static void
 767 prevalidate_reg_decl(nir_register *reg, bool is_global, validate_state *state)
 768 {
 769    assert(reg->is_global == is_global);
 770
 771    if (is_global)
 772       assert(reg->index < state->shader->reg_alloc);
 773    else
 774       assert(reg->index < state->impl->reg_alloc);
 775    assert(!BITSET_TEST(state->regs_found, reg->index));
 776    BITSET_SET(state->regs_found, reg->index);
 777
 778    list_validate(&reg->uses);
 779    list_validate(&reg->defs);
 780    list_validate(&reg->if_uses);
 781
 782    reg_validate_state *reg_state = ralloc(state->regs, reg_validate_state);
 783    reg_state->uses = _mesa_set_create(reg_state, _mesa_hash_pointer,
 784                                       _mesa_key_pointer_equal);
 785    reg_state->if_uses = _mesa_set_create(reg_state, _mesa_hash_pointer,
 786                                          _mesa_key_pointer_equal);
 787    reg_state->defs = _mesa_set_create(reg_state, _mesa_hash_pointer,
 788                                       _mesa_key_pointer_equal);
 789
 790    reg_state->where_defined = is_global ? NULL : state->impl;
 791
 792    _mesa_hash_table_insert(state->regs, reg, reg_state);
 793 }
 794
 795 static void
 796 postvalidate_reg_decl(nir_register *reg, validate_state *state)
 797 {
 798    struct hash_entry *entry = _mesa_hash_table_search(state->regs, reg);
 799
 800    reg_validate_state *reg_state = (reg_validate_state *) entry->data;
 801
 802    nir_foreach_use(reg, src) {
 803       struct set_entry *entry = _mesa_set_search(reg_state->uses, src);
 804       assert(entry);
 805       _mesa_set_remove(reg_state->uses, entry);
 806    }
 807
 808    if (reg_state->uses->entries != 0) {
 809       printf("extra entries in register uses:\n");
 810       struct set_entry *entry;
 811       set_foreach(reg_state->uses, entry)
 812          printf("%p\n", entry->key);
 813
 814       abort();
 815    }
 816
 817    nir_foreach_if_use(reg, src) {
 818       struct set_entry *entry = _mesa_set_search(reg_state->if_uses, src);
 819       assert(entry);
 820       _mesa_set_remove(reg_state->if_uses, entry);
 821    }
 822
 823    if (reg_state->if_uses->entries != 0) {
 824       printf("extra entries in register if_uses:\n");
 825       struct set_entry *entry;
 826       set_foreach(reg_state->if_uses, entry)
 827          printf("%p\n", entry->key);
 828
 829       abort();
 830    }
 831
 832    nir_foreach_def(reg, src) {
 833       struct set_entry *entry = _mesa_set_search(reg_state->defs, src);
 834       assert(entry);
 835       _mesa_set_remove(reg_state->defs, entry);
 836    }
 837
 838    if (reg_state->defs->entries != 0) {
 839       printf("extra entries in register defs:\n");
 840       struct set_entry *entry;
 841       set_foreach(reg_state->defs, entry)
 842          printf("%p\n", entry->key);
 843
 844       abort();
 845    }
 846 }
 847
 848 static void
 849 validate_var_decl(nir_variable *var, bool is_global, validate_state *state)
 850 {
 851    assert(is_global != (var->data.mode == nir_var_local));
 852
 853    /*
 854     * TODO validate some things ir_validate.cpp does (requires more GLSL type
 855     * support)
 856     */
 857
 858    if (!is_global) {
 859       _mesa_hash_table_insert(state->var_defs, var, state->impl);
 860    }
 861 }
 862
 863 static bool
 864 postvalidate_ssa_def(nir_ssa_def *def, void *void_state)
 865 {
 866    validate_state *state = void_state;
 867
 868    struct hash_entry *entry = _mesa_hash_table_search(state->ssa_defs, def);
 869    ssa_def_validate_state *def_state = (ssa_def_validate_state *)entry->data;
 870
 871    nir_foreach_use(def, src) {
 872       struct set_entry *entry = _mesa_set_search(def_state->uses, src);
 873       assert(entry);
 874       _mesa_set_remove(def_state->uses, entry);
 875    }
 876
 877    if (def_state->uses->entries != 0) {
 878       printf("extra entries in register uses:\n");
 879       struct set_entry *entry;
 880       set_foreach(def_state->uses, entry)
 881          printf("%p\n", entry->key);
 882
 883       abort();
 884    }
 885
 886    nir_foreach_if_use(def, src) {
 887       struct set_entry *entry = _mesa_set_search(def_state->if_uses, src);
 888       assert(entry);
 889       _mesa_set_remove(def_state->if_uses, entry);
 890    }
 891
 892    if (def_state->if_uses->entries != 0) {
 893       printf("extra entries in register uses:\n");
 894       struct set_entry *entry;
 895       set_foreach(def_state->if_uses, entry)
 896          printf("%p\n", entry->key);
 897
 898       abort();
 899    }
 900
 901    return true;
 902 }
 903
 904 static bool
 905 postvalidate_ssa_defs_block(nir_block *block, void *state)
 906 {
 907    nir_foreach_instr(block, instr)
 908       nir_foreach_ssa_def(instr, postvalidate_ssa_def, state);
 909
 910    return true;
 911 }
 912
 913 static void
 914 validate_function_impl(nir_function_impl *impl, validate_state *state)
 915 {
 916    assert(impl->overload->impl == impl);
 917    assert(impl->cf_node.parent == NULL);
 918
 919    assert(impl->num_params == impl->overload->num_params);
 920    for (unsigned i = 0; i < impl->num_params; i++)
 921       assert(impl->params[i]->type == impl->overload->params[i].type);
 922
 923    if (glsl_type_is_void(impl->overload->return_type))
 924       assert(impl->return_var == NULL);
 925    else
 926       assert(impl->return_var->type == impl->overload->return_type);
 927
 928    assert(exec_list_is_empty(&impl->end_block->instr_list));
 929    assert(impl->end_block->successors[0] == NULL);
 930    assert(impl->end_block->successors[1] == NULL);
 931
 932    state->impl = impl;
 933    state->parent_node = &impl->cf_node;
 934
 935    exec_list_validate(&impl->locals);
 936    foreach_list_typed(nir_variable, var, node, &impl->locals) {
 937       validate_var_decl(var, false, state);
 938    }
 939
 940    state->regs_found = realloc(state->regs_found,
 941                                BITSET_WORDS(impl->reg_alloc) *
 942                                sizeof(BITSET_WORD));
 943    memset(state->regs_found, 0, BITSET_WORDS(impl->reg_alloc) *
 944                                 sizeof(BITSET_WORD));
 945    exec_list_validate(&impl->registers);
 946    foreach_list_typed(nir_register, reg, node, &impl->registers) {
 947       prevalidate_reg_decl(reg, false, state);
 948    }
 949
 950    state->ssa_defs_found = realloc(state->ssa_defs_found,
 951                                    BITSET_WORDS(impl->ssa_alloc) *
 952                                    sizeof(BITSET_WORD));
 953    memset(state->ssa_defs_found, 0, BITSET_WORDS(impl->ssa_alloc) *
 954                                     sizeof(BITSET_WORD));
 955    exec_list_validate(&impl->body);
 956    foreach_list_typed(nir_cf_node, node, node, &impl->body) {
 957       validate_cf_node(node, state);
 958    }
 959
 960    foreach_list_typed(nir_register, reg, node, &impl->registers) {
 961       postvalidate_reg_decl(reg, state);
 962    }
 963
 964    nir_foreach_block(impl, postvalidate_ssa_defs_block, state);
 965 }
 966
 967 static void
 968 validate_function_overload(nir_function_overload *overload,
 969                            validate_state *state)
 970 {
 971    if (overload->impl != NULL)
 972       validate_function_impl(overload->impl, state);
 973 }
 974
 975 static void
 976 validate_function(nir_function *func, validate_state *state)
 977 {
 978    exec_list_validate(&func->overload_list);
 979    foreach_list_typed(nir_function_overload, overload, node, &func->overload_list) {
 980       assert(overload->function == func);
 981       validate_function_overload(overload, state);
 982    }
 983 }
 984
 985 static void
 986 init_validate_state(validate_state *state)
 987 {
 988    state->regs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
 989                                          _mesa_key_pointer_equal);
 990    state->ssa_defs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
 991                                              _mesa_key_pointer_equal);
 992    state->ssa_defs_found = NULL;
 993    state->regs_found = NULL;
 994    state->var_defs = _mesa_hash_table_create(NULL, _mesa_hash_pointer,
 995                                              _mesa_key_pointer_equal);
 996    state->loop = NULL;
 997 }
 998
 999 static void
1000 destroy_validate_state(validate_state *state)
1001 {
1002    _mesa_hash_table_destroy(state->regs, NULL);
1003    _mesa_hash_table_destroy(state->ssa_defs, NULL);
1004    free(state->ssa_defs_found);
1005    free(state->regs_found);
1006    _mesa_hash_table_destroy(state->var_defs, NULL);
1007 }
1008
1009 void
1010 nir_validate_shader(nir_shader *shader)
1011 {
1012    validate_state state;
1013    init_validate_state(&state);
1014
1015    state.shader = shader;
1016
1017    exec_list_validate(&shader->uniforms);
1018    foreach_list_typed(nir_variable, var, node, &shader->uniforms) {
1019       validate_var_decl(var, true, &state);
1020    }
1021
1022    exec_list_validate(&shader->inputs);
1023    foreach_list_typed(nir_variable, var, node, &shader->inputs) {
1024      validate_var_decl(var, true, &state);
1025    }
1026
1027    exec_list_validate(&shader->outputs);
1028    foreach_list_typed(nir_variable, var, node, &shader->outputs) {
1029      validate_var_decl(var, true, &state);
1030    }
1031
1032    exec_list_validate(&shader->globals);
1033    foreach_list_typed(nir_variable, var, node, &shader->globals) {
1034      validate_var_decl(var, true, &state);
1035    }
1036
1037    exec_list_validate(&shader->system_values);
1038    foreach_list_typed(nir_variable, var, node, &shader->system_values) {
1039      validate_var_decl(var, true, &state);
1040    }
1041
1042    state.regs_found = realloc(state.regs_found,
1043                               BITSET_WORDS(shader->reg_alloc) *
1044                               sizeof(BITSET_WORD));
1045    memset(state.regs_found, 0, BITSET_WORDS(shader->reg_alloc) *
1046                                sizeof(BITSET_WORD));
1047    exec_list_validate(&shader->registers);
1048    foreach_list_typed(nir_register, reg, node, &shader->registers) {
1049       prevalidate_reg_decl(reg, true, &state);
1050    }
1051
1052    exec_list_validate(&shader->functions);
1053    foreach_list_typed(nir_function, func, node, &shader->functions) {
1054       validate_function(func, &state);
1055    }
1056
1057    foreach_list_typed(nir_register, reg, node, &shader->registers) {
1058       postvalidate_reg_decl(reg, &state);
1059    }
1060
1061    destroy_validate_state(&state);
1062 }
1063
1064 #endif /* NDEBUG */