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