src/glsl/ir_validate.cpp

   1 /*
   2  * Copyright © 2010 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
  21  * DEALINGS IN THE SOFTWARE.
  22  */
  23
  24 /**
  25  * \file ir_validate.cpp
  26  *
  27  * Attempts to verify that various invariants of the IR tree are true.
  28  *
  29  * In particular, at the moment it makes sure that no single
  30  * ir_instruction node except for ir_variable appears multiple times
  31  * in the ir tree.  ir_variable does appear multiple times: Once as a
  32  * declaration in an exec_list, and multiple times as the endpoint of
  33  * a dereference chain.
  34  */
  35
  36 #include <inttypes.h>
  37 #include "ir.h"
  38 #include "ir_hierarchical_visitor.h"
  39 #include "hash_table.h"
  40
  41 static unsigned int hash_func(const void *key)
  42 {
  43    return (unsigned int)(uintptr_t)key;
  44 }
  45
  46 static int hash_compare_func(const void *key1, const void *key2)
  47 {
  48    return key1 == key2 ? 0 : 1;
  49 }
  50
  51
  52 class ir_validate : public ir_hierarchical_visitor {
  53 public:
  54    ir_validate()
  55    {
  56       this->ht = hash_table_ctor(0, hash_func, hash_compare_func);
  57
  58       this->callback = ir_validate::validate_ir;
  59       this->data = ht;
  60    }
  61
  62    ~ir_validate()
  63    {
  64       hash_table_dtor(this->ht);
  65    }
  66
  67    virtual ir_visitor_status visit(ir_variable *v);
  68
  69    static void validate_ir(ir_instruction *ir, void *data);
  70
  71    struct hash_table *ht;
  72 };
  73
  74 ir_visitor_status
  75 ir_validate::visit(ir_variable *ir)
  76 {
  77    /* An ir_variable is the one thing that can (and will) appear multiple times
  78     * in an IR tree.
  79     */
  80    (void) ir;
  81    return visit_continue;
  82 }
  83
  84 void
  85 ir_validate::validate_ir(ir_instruction *ir, void *data)
  86 {
  87    struct hash_table *ht = (struct hash_table *) data;
  88
  89    if (hash_table_find(ht, ir)) {
  90       printf("Instruction node present twice in ir tree:\n");
  91       ir->print();
  92       printf("\n");
  93       abort();
  94    }
  95    hash_table_insert(ht, ir, ir);
  96 }
  97
  98 void
  99 validate_ir_tree(exec_list *instructions)
 100 {
 101    ir_validate v;
 102
 103    v.run(instructions);
 104 }