2 * Copyright © 2010 Intel Corporation
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:
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
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.
27 * \file ir_hv_accept.cpp
28 * Implementations of all hierarchical visitor accept methods for IR
33 * Process a list of nodes using a hierarchical vistor.
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.
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.
47 visit_list_elements(ir_hierarchical_visitor *v, exec_list *l,
50 ir_instruction *prev_base_ir = v->base_ir;
52 foreach_list_safe(n, l) {
53 ir_instruction *const ir = (ir_instruction *) n;
56 ir_visitor_status s = ir->accept(v);
58 if (s != visit_continue)
62 v->base_ir = prev_base_ir;
64 return visit_continue;
69 ir_variable::accept(ir_hierarchical_visitor *v)
71 return v->visit(this);
76 ir_loop::accept(ir_hierarchical_visitor *v)
78 ir_visitor_status s = v->visit_enter(this);
80 if (s != visit_continue)
81 return (s == visit_continue_with_parent) ? visit_continue : s;
83 s = visit_list_elements(v, &this->body_instructions);
87 if (s != visit_continue_with_parent) {
89 s = this->from->accept(v);
90 if (s != visit_continue)
91 return (s == visit_continue_with_parent) ? visit_continue : s;
95 s = this->to->accept(v);
96 if (s != visit_continue)
97 return (s == visit_continue_with_parent) ? visit_continue : s;
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;
107 return v->visit_leave(this);
112 ir_loop_jump::accept(ir_hierarchical_visitor *v)
114 return v->visit(this);
119 ir_function_signature::accept(ir_hierarchical_visitor *v)
121 ir_visitor_status s = v->visit_enter(this);
122 if (s != visit_continue)
123 return (s == visit_continue_with_parent) ? visit_continue : s;
125 s = visit_list_elements(v, &this->parameters);
129 s = visit_list_elements(v, &this->body);
130 return (s == visit_stop) ? s : v->visit_leave(this);
135 ir_function::accept(ir_hierarchical_visitor *v)
137 ir_visitor_status s = v->visit_enter(this);
138 if (s != visit_continue)
139 return (s == visit_continue_with_parent) ? visit_continue : s;
141 s = visit_list_elements(v, &this->signatures, false);
142 return (s == visit_stop) ? s : v->visit_leave(this);
147 ir_expression::accept(ir_hierarchical_visitor *v)
149 ir_visitor_status s = v->visit_enter(this);
151 if (s != visit_continue)
152 return (s == visit_continue_with_parent) ? visit_continue : s;
154 for (unsigned i = 0; i < this->get_num_operands(); i++) {
155 switch (this->operands[i]->accept(v)) {
159 case visit_continue_with_parent:
160 // I wish for Java's labeled break-statement here.
169 return v->visit_leave(this);
173 ir_texture::accept(ir_hierarchical_visitor *v)
175 ir_visitor_status s = v->visit_enter(this);
176 if (s != visit_continue)
177 return (s == visit_continue_with_parent) ? visit_continue : s;
179 s = this->sampler->accept(v);
180 if (s != visit_continue)
181 return (s == visit_continue_with_parent) ? visit_continue : s;
183 s = this->coordinate->accept(v);
184 if (s != visit_continue)
185 return (s == visit_continue_with_parent) ? visit_continue : s;
187 if (this->projector) {
188 s = this->projector->accept(v);
189 if (s != visit_continue)
190 return (s == visit_continue_with_parent) ? visit_continue : s;
193 if (this->shadow_comparitor) {
194 s = this->shadow_comparitor->accept(v);
195 if (s != visit_continue)
196 return (s == visit_continue_with_parent) ? visit_continue : s;
200 s = this->offset->accept(v);
201 if (s != visit_continue)
202 return (s == visit_continue_with_parent) ? visit_continue : s;
209 s = this->lod_info.bias->accept(v);
210 if (s != visit_continue)
211 return (s == visit_continue_with_parent) ? visit_continue : s;
215 s = this->lod_info.lod->accept(v);
216 if (s != visit_continue)
217 return (s == visit_continue_with_parent) ? visit_continue : s;
220 s = this->lod_info.grad.dPdx->accept(v);
221 if (s != visit_continue)
222 return (s == visit_continue_with_parent) ? visit_continue : s;
224 s = this->lod_info.grad.dPdy->accept(v);
225 if (s != visit_continue)
226 return (s == visit_continue_with_parent) ? visit_continue : s;
230 return (s == visit_stop) ? s : v->visit_leave(this);
235 ir_swizzle::accept(ir_hierarchical_visitor *v)
237 ir_visitor_status s = v->visit_enter(this);
238 if (s != visit_continue)
239 return (s == visit_continue_with_parent) ? visit_continue : s;
241 s = this->val->accept(v);
242 return (s == visit_stop) ? s : v->visit_leave(this);
247 ir_dereference_variable::accept(ir_hierarchical_visitor *v)
249 return v->visit(this);
254 ir_dereference_array::accept(ir_hierarchical_visitor *v)
256 ir_visitor_status s = v->visit_enter(this);
257 if (s != visit_continue)
258 return (s == visit_continue_with_parent) ? visit_continue : s;
260 /* The array index is not the target of the assignment, so clear the
261 * 'in_assignee' flag. Restore it after returning from the array index.
263 const bool was_in_assignee = v->in_assignee;
264 v->in_assignee = false;
265 s = this->array_index->accept(v);
266 v->in_assignee = was_in_assignee;
268 if (s != visit_continue)
269 return (s == visit_continue_with_parent) ? visit_continue : s;
271 s = this->array->accept(v);
272 return (s == visit_stop) ? s : v->visit_leave(this);
277 ir_dereference_record::accept(ir_hierarchical_visitor *v)
279 ir_visitor_status s = v->visit_enter(this);
280 if (s != visit_continue)
281 return (s == visit_continue_with_parent) ? visit_continue : s;
283 s = this->record->accept(v);
284 return (s == visit_stop) ? s : v->visit_leave(this);
289 ir_assignment::accept(ir_hierarchical_visitor *v)
291 ir_visitor_status s = v->visit_enter(this);
292 if (s != visit_continue)
293 return (s == visit_continue_with_parent) ? visit_continue : s;
295 v->in_assignee = true;
296 s = this->lhs->accept(v);
297 v->in_assignee = false;
298 if (s != visit_continue)
299 return (s == visit_continue_with_parent) ? visit_continue : s;
301 s = this->rhs->accept(v);
302 if (s != visit_continue)
303 return (s == visit_continue_with_parent) ? visit_continue : s;
306 s = this->condition->accept(v);
308 return (s == visit_stop) ? s : v->visit_leave(this);
313 ir_constant::accept(ir_hierarchical_visitor *v)
315 return v->visit(this);
320 ir_call::accept(ir_hierarchical_visitor *v)
322 ir_visitor_status s = v->visit_enter(this);
323 if (s != visit_continue)
324 return (s == visit_continue_with_parent) ? visit_continue : s;
326 s = visit_list_elements(v, &this->actual_parameters, false);
330 return v->visit_leave(this);
335 ir_return::accept(ir_hierarchical_visitor *v)
337 ir_visitor_status s = v->visit_enter(this);
338 if (s != visit_continue)
339 return (s == visit_continue_with_parent) ? visit_continue : s;
341 ir_rvalue *val = this->get_value();
344 if (s != visit_continue)
345 return (s == visit_continue_with_parent) ? visit_continue : s;
348 return v->visit_leave(this);
353 ir_discard::accept(ir_hierarchical_visitor *v)
355 ir_visitor_status s = v->visit_enter(this);
356 if (s != visit_continue)
357 return (s == visit_continue_with_parent) ? visit_continue : s;
359 if (this->condition != NULL) {
360 s = this->condition->accept(v);
361 if (s != visit_continue)
362 return (s == visit_continue_with_parent) ? visit_continue : s;
365 return v->visit_leave(this);
370 ir_if::accept(ir_hierarchical_visitor *v)
372 ir_visitor_status s = v->visit_enter(this);
373 if (s != visit_continue)
374 return (s == visit_continue_with_parent) ? visit_continue : s;
376 s = this->condition->accept(v);
377 if (s != visit_continue)
378 return (s == visit_continue_with_parent) ? visit_continue : s;
380 if (s != visit_continue_with_parent) {
381 s = visit_list_elements(v, &this->then_instructions);
386 if (s != visit_continue_with_parent) {
387 s = visit_list_elements(v, &this->else_instructions);
392 return v->visit_leave(this);