123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348 |
- /*
- * Copyright © 2010 Intel Corporation
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice (including the next
- * paragraph) shall be included in all copies or substantial portions of the
- * Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
- * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
- #include "ir.h"
-
- /**
- * \file ir_hv_accept.cpp
- * Implementations of all hierarchical visitor accept methods for IR
- * instructions.
- */
-
- /**
- * Process a list of nodes using a hierarchical vistor
- *
- * \warning
- * This function will operate correctly if a node being processed is removed
- * from list. However, if nodes are added to the list after the node being
- * processed, some of the added noded may not be processed.
- */
- static ir_visitor_status
- visit_list_elements(ir_hierarchical_visitor *v, exec_list *l)
- {
- exec_node *next;
-
- for (exec_node *n = l->head; n->next != NULL; n = next) {
- next = n->next;
-
- ir_instruction *const ir = (ir_instruction *) n;
- ir_visitor_status s = ir->accept(v);
-
- if (s != visit_continue)
- return s;
- }
-
- return visit_continue;
- }
-
-
- ir_visitor_status
- ir_variable::accept(ir_hierarchical_visitor *v)
- {
- return v->visit(this);
- }
-
-
- ir_visitor_status
- ir_loop::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
-
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = visit_list_elements(v, &this->body_instructions);
- if (s == visit_stop)
- return s;
-
- if (s != visit_continue_with_parent) {
- if (this->from) {
- s = this->from->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- }
-
- if (this->to) {
- s = this->to->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- }
-
- if (this->increment) {
- s = this->increment->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- }
- }
-
- return v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_loop_jump::accept(ir_hierarchical_visitor *v)
- {
- return v->visit(this);
- }
-
-
- ir_visitor_status
- ir_function_signature::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = visit_list_elements(v, &this->body);
- return (s == visit_stop) ? s : v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_function::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = visit_list_elements(v, &this->signatures);
- return (s == visit_stop) ? s : v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_expression::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
-
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- for (unsigned i = 0; i < this->get_num_operands(); i++) {
- switch (this->operands[i]->accept(v)) {
- case visit_continue:
- break;
-
- case visit_continue_with_parent:
- // I wish for Java's labeled break-statement here.
- goto done;
-
- case visit_stop:
- return s;
- }
- }
-
- done:
- return v->visit_leave(this);
- }
-
- ir_visitor_status
- ir_texture::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->sampler->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->coordinate->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- if (this->projector) {
- s = this->projector->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- }
-
- if (this->shadow_comparitor) {
- s = this->shadow_comparitor->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- }
-
- switch (this->op) {
- case ir_tex:
- break;
- case ir_txb:
- s = this->lod_info.bias->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- break;
- case ir_txl:
- case ir_txf:
- s = this->lod_info.lod->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- break;
- case ir_txd:
- s = this->lod_info.grad.dPdx->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->lod_info.grad.dPdy->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- break;
- }
-
- return visit_continue_with_parent;
- }
-
-
- ir_visitor_status
- ir_swizzle::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->val->accept(v);
- return (s == visit_stop) ? s : v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_dereference_variable::accept(ir_hierarchical_visitor *v)
- {
- return v->visit(this);
- }
-
-
- ir_visitor_status
- ir_dereference_array::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->array_index->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->array->accept(v);
- return (s == visit_stop) ? s : v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_dereference_record::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->record->accept(v);
- return (s == visit_stop) ? s : v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_assignment::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->lhs->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->rhs->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- if (this->condition)
- s = this->condition->accept(v);
-
- return (s == visit_stop) ? s : v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_constant::accept(ir_hierarchical_visitor *v)
- {
- return v->visit(this);
- }
-
-
- ir_visitor_status
- ir_call::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = visit_list_elements(v, &this->actual_parameters);
- if (s == visit_stop)
- return s;
-
- return v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_return::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- ir_rvalue *val = this->get_value();
- if (val) {
- s = val->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
- }
-
- return v->visit_leave(this);
- }
-
-
- ir_visitor_status
- ir_if::accept(ir_hierarchical_visitor *v)
- {
- ir_visitor_status s = v->visit_enter(this);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- s = this->condition->accept(v);
- if (s != visit_continue)
- return (s == visit_continue_with_parent) ? visit_continue : s;
-
- if (s != visit_continue_with_parent) {
- s = visit_list_elements(v, &this->then_instructions);
- if (s == visit_stop)
- return s;
- }
-
- if (s != visit_continue_with_parent) {
- s = visit_list_elements(v, &this->else_instructions);
- if (s == visit_stop)
- return s;
- }
-
- return v->visit_leave(this);
- }
|