src/glsl/ir_hv_accept.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 #include "ir.h"
  25
  26 /**
  27  * \file ir_hv_accept.cpp
  28  * Implementations of all hierarchical visitor accept methods for IR
  29  * instructions.
  30  */
  31
  32 /**
  33  * Process a list of nodes using a hierarchical vistor.
  34  *
  35  * If statement_list is true (the default), this is a list of statements, so
  36  * v->base_ir will be set to point to each statement just before iterating
  37  * over it, and restored after iteration is complete.  If statement_list is
  38  * false, this is a list that appears inside a statement (e.g. a parameter
  39  * list), so v->base_ir will be left alone.
  40  *
  41  * \warning
  42  * This function will operate correctly if a node being processed is removed
  43  * from the list.  However, if nodes are added to the list after the node being
  44  * processed, some of the added nodes may not be processed.
  45  */
  46 ir_visitor_status
  47 visit_list_elements(ir_hierarchical_visitor *v, exec_list *l,
  48                     bool statement_list)
  49 {
  50    ir_instruction *prev_base_ir = v->base_ir;
  51
  52    foreach_list_safe(n, l) {
  53       ir_instruction *const ir = (ir_instruction *) n;
  54       if (statement_list)
  55          v->base_ir = ir;
  56       ir_visitor_status s = ir->accept(v);
  57
  58       if (s != visit_continue)
  59          return s;
  60    }
  61    if (statement_list)
  62       v->base_ir = prev_base_ir;
  63
  64    return visit_continue;
  65 }
  66
  67
  68 ir_visitor_status
  69 ir_variable::accept(ir_hierarchical_visitor *v)
  70 {
  71    return v->visit(this);
  72 }
  73
  74
  75 ir_visitor_status
  76 ir_loop::accept(ir_hierarchical_visitor *v)
  77 {
  78    ir_visitor_status s = v->visit_enter(this);
  79
  80    if (s != visit_continue)
  81       return (s == visit_continue_with_parent) ? visit_continue : s;
  82
  83    s = visit_list_elements(v, &this->body_instructions);
  84    if (s == visit_stop)
  85       return s;
  86
  87    if (s != visit_continue_with_parent) {
  88       if (this->from) {
  89          s = this->from->accept(v);
  90          if (s != visit_continue)
  91             return (s == visit_continue_with_parent) ? visit_continue : s;
  92       }
  93
  94       if (this->to) {
  95          s = this->to->accept(v);
  96          if (s != visit_continue)
  97             return (s == visit_continue_with_parent) ? visit_continue : s;
  98       }
  99
 100       if (this->increment) {
 101          s = this->increment->accept(v);
 102          if (s != visit_continue)
 103             return (s == visit_continue_with_parent) ? visit_continue : s;
 104       }
 105    }
 106
 107    return v->visit_leave(this);
 108 }
 109
 110
 111 ir_visitor_status
 112 ir_loop_jump::accept(ir_hierarchical_visitor *v)
 113 {
 114    return v->visit(this);
 115 }
 116
 117
 118 ir_visitor_status
 119 ir_function_signature::accept(ir_hierarchical_visitor *v)
 120 {
 121    ir_visitor_status s = v->visit_enter(this);
 122    if (s != visit_continue)
 123       return (s == visit_continue_with_parent) ? visit_continue : s;
 124
 125    s = visit_list_elements(v, &this->parameters);
 126    if (s == visit_stop)
 127       return s;
 128
 129    s = visit_list_elements(v, &this->body);
 130    return (s == visit_stop) ? s : v->visit_leave(this);
 131 }
 132
 133
 134 ir_visitor_status
 135 ir_function::accept(ir_hierarchical_visitor *v)
 136 {
 137    ir_visitor_status s = v->visit_enter(this);
 138    if (s != visit_continue)
 139       return (s == visit_continue_with_parent) ? visit_continue : s;
 140
 141    s = visit_list_elements(v, &this->signatures, false);
 142    return (s == visit_stop) ? s : v->visit_leave(this);
 143 }
 144
 145
 146 ir_visitor_status
 147 ir_expression::accept(ir_hierarchical_visitor *v)
 148 {
 149    ir_visitor_status s = v->visit_enter(this);
 150
 151    if (s != visit_continue)
 152       return (s == visit_continue_with_parent) ? visit_continue : s;
 153
 154    for (unsigned i = 0; i < this->get_num_operands(); i++) {
 155       switch (this->operands[i]->accept(v)) {
 156       case visit_continue:
 157          break;
 158
 159       case visit_continue_with_parent:
 160          // I wish for Java's labeled break-statement here.
 161          goto done;
 162
 163       case visit_stop:
 164          return s;
 165       }
 166    }
 167
 168 done:
 169    return v->visit_leave(this);
 170 }
 171
 172 ir_visitor_status
 173 ir_texture::accept(ir_hierarchical_visitor *v)
 174 {
 175    ir_visitor_status s = v->visit_enter(this);
 176    if (s != visit_continue)
 177       return (s == visit_continue_with_parent) ? visit_continue : s;
 178
 179    s = this->sampler->accept(v);
 180    if (s != visit_continue)
 181       return (s == visit_continue_with_parent) ? visit_continue : s;
 182
 183    if (this->coordinate) {
 184       s = this->coordinate->accept(v);
 185       if (s != visit_continue)
 186          return (s == visit_continue_with_parent) ? visit_continue : s;
 187    }
 188
 189    if (this->projector) {
 190       s = this->projector->accept(v);
 191       if (s != visit_continue)
 192          return (s == visit_continue_with_parent) ? visit_continue : s;
 193    }
 194
 195    if (this->shadow_comparitor) {
 196       s = this->shadow_comparitor->accept(v);
 197       if (s != visit_continue)
 198          return (s == visit_continue_with_parent) ? visit_continue : s;
 199    }
 200
 201    if (this->offset) {
 202       s = this->offset->accept(v);
 203       if (s != visit_continue)
 204          return (s == visit_continue_with_parent) ? visit_continue : s;
 205    }
 206
 207    switch (this->op) {
 208    case ir_tex:
 209       break;
 210    case ir_txb:
 211       s = this->lod_info.bias->accept(v);
 212       if (s != visit_continue)
 213          return (s == visit_continue_with_parent) ? visit_continue : s;
 214       break;
 215    case ir_txl:
 216    case ir_txf:
 217    case ir_txs:
 218       s = this->lod_info.lod->accept(v);
 219       if (s != visit_continue)
 220          return (s == visit_continue_with_parent) ? visit_continue : s;
 221       break;
 222    case ir_txd:
 223       s = this->lod_info.grad.dPdx->accept(v);
 224       if (s != visit_continue)
 225          return (s == visit_continue_with_parent) ? visit_continue : s;
 226
 227       s = this->lod_info.grad.dPdy->accept(v);
 228       if (s != visit_continue)
 229          return (s == visit_continue_with_parent) ? visit_continue : s;
 230       break;
 231    }
 232
 233    return (s == visit_stop) ? s : v->visit_leave(this);
 234 }
 235
 236
 237 ir_visitor_status
 238 ir_swizzle::accept(ir_hierarchical_visitor *v)
 239 {
 240    ir_visitor_status s = v->visit_enter(this);
 241    if (s != visit_continue)
 242       return (s == visit_continue_with_parent) ? visit_continue : s;
 243
 244    s = this->val->accept(v);
 245    return (s == visit_stop) ? s : v->visit_leave(this);
 246 }
 247
 248
 249 ir_visitor_status
 250 ir_dereference_variable::accept(ir_hierarchical_visitor *v)
 251 {
 252    return v->visit(this);
 253 }
 254
 255
 256 ir_visitor_status
 257 ir_dereference_array::accept(ir_hierarchical_visitor *v)
 258 {
 259    ir_visitor_status s = v->visit_enter(this);
 260    if (s != visit_continue)
 261       return (s == visit_continue_with_parent) ? visit_continue : s;
 262
 263    /* The array index is not the target of the assignment, so clear the
 264     * 'in_assignee' flag.  Restore it after returning from the array index.
 265     */
 266    const bool was_in_assignee = v->in_assignee;
 267    v->in_assignee = false;
 268    s = this->array_index->accept(v);
 269    v->in_assignee = was_in_assignee;
 270
 271    if (s != visit_continue)
 272       return (s == visit_continue_with_parent) ? visit_continue : s;
 273
 274    s = this->array->accept(v);
 275    return (s == visit_stop) ? s : v->visit_leave(this);
 276 }
 277
 278
 279 ir_visitor_status
 280 ir_dereference_record::accept(ir_hierarchical_visitor *v)
 281 {
 282    ir_visitor_status s = v->visit_enter(this);
 283    if (s != visit_continue)
 284       return (s == visit_continue_with_parent) ? visit_continue : s;
 285
 286    s = this->record->accept(v);
 287    return (s == visit_stop) ? s : v->visit_leave(this);
 288 }
 289
 290
 291 ir_visitor_status
 292 ir_assignment::accept(ir_hierarchical_visitor *v)
 293 {
 294    ir_visitor_status s = v->visit_enter(this);
 295    if (s != visit_continue)
 296       return (s == visit_continue_with_parent) ? visit_continue : s;
 297
 298    v->in_assignee = true;
 299    s = this->lhs->accept(v);
 300    v->in_assignee = false;
 301    if (s != visit_continue)
 302       return (s == visit_continue_with_parent) ? visit_continue : s;
 303
 304    s = this->rhs->accept(v);
 305    if (s != visit_continue)
 306       return (s == visit_continue_with_parent) ? visit_continue : s;
 307
 308    if (this->condition)
 309       s = this->condition->accept(v);
 310
 311    return (s == visit_stop) ? s : v->visit_leave(this);
 312 }
 313
 314
 315 ir_visitor_status
 316 ir_constant::accept(ir_hierarchical_visitor *v)
 317 {
 318    return v->visit(this);
 319 }
 320
 321
 322 ir_visitor_status
 323 ir_call::accept(ir_hierarchical_visitor *v)
 324 {
 325    ir_visitor_status s = v->visit_enter(this);
 326    if (s != visit_continue)
 327       return (s == visit_continue_with_parent) ? visit_continue : s;
 328
 329    s = visit_list_elements(v, &this->actual_parameters, false);
 330    if (s == visit_stop)
 331       return s;
 332
 333    return v->visit_leave(this);
 334 }
 335
 336
 337 ir_visitor_status
 338 ir_return::accept(ir_hierarchical_visitor *v)
 339 {
 340    ir_visitor_status s = v->visit_enter(this);
 341    if (s != visit_continue)
 342       return (s == visit_continue_with_parent) ? visit_continue : s;
 343
 344    ir_rvalue *val = this->get_value();
 345    if (val) {
 346       s = val->accept(v);
 347       if (s != visit_continue)
 348          return (s == visit_continue_with_parent) ? visit_continue : s;
 349    }
 350
 351    return v->visit_leave(this);
 352 }
 353
 354
 355 ir_visitor_status
 356 ir_discard::accept(ir_hierarchical_visitor *v)
 357 {
 358    ir_visitor_status s = v->visit_enter(this);
 359    if (s != visit_continue)
 360       return (s == visit_continue_with_parent) ? visit_continue : s;
 361
 362    if (this->condition != NULL) {
 363       s = this->condition->accept(v);
 364       if (s != visit_continue)
 365          return (s == visit_continue_with_parent) ? visit_continue : s;
 366    }
 367
 368    return v->visit_leave(this);
 369 }
 370
 371
 372 ir_visitor_status
 373 ir_if::accept(ir_hierarchical_visitor *v)
 374 {
 375    ir_visitor_status s = v->visit_enter(this);
 376    if (s != visit_continue)
 377       return (s == visit_continue_with_parent) ? visit_continue : s;
 378
 379    s = this->condition->accept(v);
 380    if (s != visit_continue)
 381       return (s == visit_continue_with_parent) ? visit_continue : s;
 382
 383    if (s != visit_continue_with_parent) {
 384       s = visit_list_elements(v, &this->then_instructions);
 385       if (s == visit_stop)
 386          return s;
 387    }
 388
 389    if (s != visit_continue_with_parent) {
 390       s = visit_list_elements(v, &this->else_instructions);
 391       if (s == visit_stop)
 392          return s;
 393    }
 394
 395    return v->visit_leave(this);
 396 }