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_rvalue::accept(ir_hierarchical_visitor *v)
  70 {
  71    return v->visit(this);
  72 }
  73
  74
  75 ir_visitor_status
  76 ir_variable::accept(ir_hierarchical_visitor *v)
  77 {
  78    return v->visit(this);
  79 }
  80
  81
  82 ir_visitor_status
  83 ir_loop::accept(ir_hierarchical_visitor *v)
  84 {
  85    ir_visitor_status s = v->visit_enter(this);
  86
  87    if (s != visit_continue)
  88       return (s == visit_continue_with_parent) ? visit_continue : s;
  89
  90    s = visit_list_elements(v, &this->body_instructions);
  91    if (s == visit_stop)
  92       return s;
  93
  94    if (s != visit_continue_with_parent) {
  95       if (this->from) {
  96          s = this->from->accept(v);
  97          if (s != visit_continue)
  98             return (s == visit_continue_with_parent) ? visit_continue : s;
  99       }
 100
 101       if (this->to) {
 102          s = this->to->accept(v);
 103          if (s != visit_continue)
 104             return (s == visit_continue_with_parent) ? visit_continue : s;
 105       }
 106
 107       if (this->increment) {
 108          s = this->increment->accept(v);
 109          if (s != visit_continue)
 110             return (s == visit_continue_with_parent) ? visit_continue : s;
 111       }
 112    }
 113
 114    return v->visit_leave(this);
 115 }
 116
 117
 118 ir_visitor_status
 119 ir_loop_jump::accept(ir_hierarchical_visitor *v)
 120 {
 121    return v->visit(this);
 122 }
 123
 124
 125 ir_visitor_status
 126 ir_function_signature::accept(ir_hierarchical_visitor *v)
 127 {
 128    ir_visitor_status s = v->visit_enter(this);
 129    if (s != visit_continue)
 130       return (s == visit_continue_with_parent) ? visit_continue : s;
 131
 132    s = visit_list_elements(v, &this->parameters);
 133    if (s == visit_stop)
 134       return s;
 135
 136    s = visit_list_elements(v, &this->body);
 137    return (s == visit_stop) ? s : v->visit_leave(this);
 138 }
 139
 140
 141 ir_visitor_status
 142 ir_function::accept(ir_hierarchical_visitor *v)
 143 {
 144    ir_visitor_status s = v->visit_enter(this);
 145    if (s != visit_continue)
 146       return (s == visit_continue_with_parent) ? visit_continue : s;
 147
 148    s = visit_list_elements(v, &this->signatures, false);
 149    return (s == visit_stop) ? s : v->visit_leave(this);
 150 }
 151
 152
 153 ir_visitor_status
 154 ir_expression::accept(ir_hierarchical_visitor *v)
 155 {
 156    ir_visitor_status s = v->visit_enter(this);
 157
 158    if (s != visit_continue)
 159       return (s == visit_continue_with_parent) ? visit_continue : s;
 160
 161    for (unsigned i = 0; i < this->get_num_operands(); i++) {
 162       switch (this->operands[i]->accept(v)) {
 163       case visit_continue:
 164          break;
 165
 166       case visit_continue_with_parent:
 167          // I wish for Java's labeled break-statement here.
 168          goto done;
 169
 170       case visit_stop:
 171          return s;
 172       }
 173    }
 174
 175 done:
 176    return v->visit_leave(this);
 177 }
 178
 179 ir_visitor_status
 180 ir_texture::accept(ir_hierarchical_visitor *v)
 181 {
 182    ir_visitor_status s = v->visit_enter(this);
 183    if (s != visit_continue)
 184       return (s == visit_continue_with_parent) ? visit_continue : s;
 185
 186    s = this->sampler->accept(v);
 187    if (s != visit_continue)
 188       return (s == visit_continue_with_parent) ? visit_continue : s;
 189
 190    if (this->coordinate) {
 191       s = this->coordinate->accept(v);
 192       if (s != visit_continue)
 193          return (s == visit_continue_with_parent) ? visit_continue : s;
 194    }
 195
 196    if (this->projector) {
 197       s = this->projector->accept(v);
 198       if (s != visit_continue)
 199          return (s == visit_continue_with_parent) ? visit_continue : s;
 200    }
 201
 202    if (this->shadow_comparitor) {
 203       s = this->shadow_comparitor->accept(v);
 204       if (s != visit_continue)
 205          return (s == visit_continue_with_parent) ? visit_continue : s;
 206    }
 207
 208    if (this->offset) {
 209       s = this->offset->accept(v);
 210       if (s != visit_continue)
 211          return (s == visit_continue_with_parent) ? visit_continue : s;
 212    }
 213
 214    switch (this->op) {
 215    case ir_tex:
 216    case ir_lod:
 217    case ir_tg4:
 218    case ir_query_levels:
 219       break;
 220    case ir_txb:
 221       s = this->lod_info.bias->accept(v);
 222       if (s != visit_continue)
 223          return (s == visit_continue_with_parent) ? visit_continue : s;
 224       break;
 225    case ir_txl:
 226    case ir_txf:
 227    case ir_txs:
 228       s = this->lod_info.lod->accept(v);
 229       if (s != visit_continue)
 230          return (s == visit_continue_with_parent) ? visit_continue : s;
 231       break;
 232    case ir_txf_ms:
 233       s = this->lod_info.sample_index->accept(v);
 234       if (s != visit_continue)
 235          return (s == visit_continue_with_parent) ? visit_continue : s;
 236       break;
 237    case ir_txd:
 238       s = this->lod_info.grad.dPdx->accept(v);
 239       if (s != visit_continue)
 240          return (s == visit_continue_with_parent) ? visit_continue : s;
 241
 242       s = this->lod_info.grad.dPdy->accept(v);
 243       if (s != visit_continue)
 244          return (s == visit_continue_with_parent) ? visit_continue : s;
 245       break;
 246    }
 247
 248    return (s == visit_stop) ? s : v->visit_leave(this);
 249 }
 250
 251
 252 ir_visitor_status
 253 ir_swizzle::accept(ir_hierarchical_visitor *v)
 254 {
 255    ir_visitor_status s = v->visit_enter(this);
 256    if (s != visit_continue)
 257       return (s == visit_continue_with_parent) ? visit_continue : s;
 258
 259    s = this->val->accept(v);
 260    return (s == visit_stop) ? s : v->visit_leave(this);
 261 }
 262
 263
 264 ir_visitor_status
 265 ir_dereference_variable::accept(ir_hierarchical_visitor *v)
 266 {
 267    return v->visit(this);
 268 }
 269
 270
 271 ir_visitor_status
 272 ir_dereference_array::accept(ir_hierarchical_visitor *v)
 273 {
 274    ir_visitor_status s = v->visit_enter(this);
 275    if (s != visit_continue)
 276       return (s == visit_continue_with_parent) ? visit_continue : s;
 277
 278    /* The array index is not the target of the assignment, so clear the
 279     * 'in_assignee' flag.  Restore it after returning from the array index.
 280     */
 281    const bool was_in_assignee = v->in_assignee;
 282    v->in_assignee = false;
 283    s = this->array_index->accept(v);
 284    v->in_assignee = was_in_assignee;
 285
 286    if (s != visit_continue)
 287       return (s == visit_continue_with_parent) ? visit_continue : s;
 288
 289    s = this->array->accept(v);
 290    return (s == visit_stop) ? s : v->visit_leave(this);
 291 }
 292
 293
 294 ir_visitor_status
 295 ir_dereference_record::accept(ir_hierarchical_visitor *v)
 296 {
 297    ir_visitor_status s = v->visit_enter(this);
 298    if (s != visit_continue)
 299       return (s == visit_continue_with_parent) ? visit_continue : s;
 300
 301    s = this->record->accept(v);
 302    return (s == visit_stop) ? s : v->visit_leave(this);
 303 }
 304
 305
 306 ir_visitor_status
 307 ir_assignment::accept(ir_hierarchical_visitor *v)
 308 {
 309    ir_visitor_status s = v->visit_enter(this);
 310    if (s != visit_continue)
 311       return (s == visit_continue_with_parent) ? visit_continue : s;
 312
 313    v->in_assignee = true;
 314    s = this->lhs->accept(v);
 315    v->in_assignee = false;
 316    if (s != visit_continue)
 317       return (s == visit_continue_with_parent) ? visit_continue : s;
 318
 319    s = this->rhs->accept(v);
 320    if (s != visit_continue)
 321       return (s == visit_continue_with_parent) ? visit_continue : s;
 322
 323    if (this->condition)
 324       s = this->condition->accept(v);
 325
 326    return (s == visit_stop) ? s : v->visit_leave(this);
 327 }
 328
 329
 330 ir_visitor_status
 331 ir_constant::accept(ir_hierarchical_visitor *v)
 332 {
 333    return v->visit(this);
 334 }
 335
 336
 337 ir_visitor_status
 338 ir_call::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    if (this->return_deref != NULL) {
 345       v->in_assignee = true;
 346       s = this->return_deref->accept(v);
 347       v->in_assignee = false;
 348       if (s != visit_continue)
 349          return (s == visit_continue_with_parent) ? visit_continue : s;
 350    }
 351
 352    s = visit_list_elements(v, &this->actual_parameters, false);
 353    if (s == visit_stop)
 354       return s;
 355
 356    return v->visit_leave(this);
 357 }
 358
 359
 360 ir_visitor_status
 361 ir_return::accept(ir_hierarchical_visitor *v)
 362 {
 363    ir_visitor_status s = v->visit_enter(this);
 364    if (s != visit_continue)
 365       return (s == visit_continue_with_parent) ? visit_continue : s;
 366
 367    ir_rvalue *val = this->get_value();
 368    if (val) {
 369       s = val->accept(v);
 370       if (s != visit_continue)
 371          return (s == visit_continue_with_parent) ? visit_continue : s;
 372    }
 373
 374    return v->visit_leave(this);
 375 }
 376
 377
 378 ir_visitor_status
 379 ir_discard::accept(ir_hierarchical_visitor *v)
 380 {
 381    ir_visitor_status s = v->visit_enter(this);
 382    if (s != visit_continue)
 383       return (s == visit_continue_with_parent) ? visit_continue : s;
 384
 385    if (this->condition != NULL) {
 386       s = this->condition->accept(v);
 387       if (s != visit_continue)
 388          return (s == visit_continue_with_parent) ? visit_continue : s;
 389    }
 390
 391    return v->visit_leave(this);
 392 }
 393
 394
 395 ir_visitor_status
 396 ir_if::accept(ir_hierarchical_visitor *v)
 397 {
 398    ir_visitor_status s = v->visit_enter(this);
 399    if (s != visit_continue)
 400       return (s == visit_continue_with_parent) ? visit_continue : s;
 401
 402    s = this->condition->accept(v);
 403    if (s != visit_continue)
 404       return (s == visit_continue_with_parent) ? visit_continue : s;
 405
 406    if (s != visit_continue_with_parent) {
 407       s = visit_list_elements(v, &this->then_instructions);
 408       if (s == visit_stop)
 409          return s;
 410    }
 411
 412    if (s != visit_continue_with_parent) {
 413       s = visit_list_elements(v, &this->else_instructions);
 414       if (s == visit_stop)
 415          return s;
 416    }
 417
 418    return v->visit_leave(this);
 419 }
 420
 421 ir_visitor_status
 422 ir_emit_vertex::accept(ir_hierarchical_visitor *v)
 423 {
 424    return v->visit(this);
 425 }
 426
 427
 428 ir_visitor_status
 429 ir_end_primitive::accept(ir_hierarchical_visitor *v)
 430 {
 431    return v->visit(this);
 432 }