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_in_list_safe(ir_instruction, ir, l) {
55 ir_visitor_status s = ir->accept(v);
57 if (s != visit_continue)
61 v->base_ir = prev_base_ir;
63 return visit_continue;
68 ir_rvalue::accept(ir_hierarchical_visitor *v)
70 return v->visit(this);
75 ir_variable::accept(ir_hierarchical_visitor *v)
77 return v->visit(this);
82 ir_loop::accept(ir_hierarchical_visitor *v)
84 ir_visitor_status s = v->visit_enter(this);
86 if (s != visit_continue)
87 return (s == visit_continue_with_parent) ? visit_continue : s;
89 s = visit_list_elements(v, &this->body_instructions);
93 return v->visit_leave(this);
98 ir_loop_jump::accept(ir_hierarchical_visitor *v)
100 return v->visit(this);
105 ir_function_signature::accept(ir_hierarchical_visitor *v)
107 ir_visitor_status s = v->visit_enter(this);
108 if (s != visit_continue)
109 return (s == visit_continue_with_parent) ? visit_continue : s;
111 s = visit_list_elements(v, &this->parameters);
115 s = visit_list_elements(v, &this->body);
116 return (s == visit_stop) ? s : v->visit_leave(this);
121 ir_function::accept(ir_hierarchical_visitor *v)
123 ir_visitor_status s = v->visit_enter(this);
124 if (s != visit_continue)
125 return (s == visit_continue_with_parent) ? visit_continue : s;
127 s = visit_list_elements(v, &this->signatures, false);
128 return (s == visit_stop) ? s : v->visit_leave(this);
133 ir_expression::accept(ir_hierarchical_visitor *v)
135 ir_visitor_status s = v->visit_enter(this);
137 if (s != visit_continue)
138 return (s == visit_continue_with_parent) ? visit_continue : s;
140 for (unsigned i = 0; i < this->num_operands; i++) {
141 switch (this->operands[i]->accept(v)) {
145 case visit_continue_with_parent:
146 // I wish for Java's labeled break-statement here.
155 return v->visit_leave(this);
159 ir_texture::accept(ir_hierarchical_visitor *v)
161 ir_visitor_status s = v->visit_enter(this);
162 if (s != visit_continue)
163 return (s == visit_continue_with_parent) ? visit_continue : s;
165 s = this->sampler->accept(v);
166 if (s != visit_continue)
167 return (s == visit_continue_with_parent) ? visit_continue : s;
169 if (this->coordinate) {
170 s = this->coordinate->accept(v);
171 if (s != visit_continue)
172 return (s == visit_continue_with_parent) ? visit_continue : s;
175 if (this->projector) {
176 s = this->projector->accept(v);
177 if (s != visit_continue)
178 return (s == visit_continue_with_parent) ? visit_continue : s;
181 if (this->shadow_comparator) {
182 s = this->shadow_comparator->accept(v);
183 if (s != visit_continue)
184 return (s == visit_continue_with_parent) ? visit_continue : s;
188 s = this->offset->accept(v);
189 if (s != visit_continue)
190 return (s == visit_continue_with_parent) ? visit_continue : s;
196 case ir_query_levels:
197 case ir_texture_samples:
198 case ir_samples_identical:
201 s = this->lod_info.bias->accept(v);
202 if (s != visit_continue)
203 return (s == visit_continue_with_parent) ? visit_continue : s;
208 s = this->lod_info.lod->accept(v);
209 if (s != visit_continue)
210 return (s == visit_continue_with_parent) ? visit_continue : s;
213 s = this->lod_info.sample_index->accept(v);
214 if (s != visit_continue)
215 return (s == visit_continue_with_parent) ? visit_continue : s;
218 s = this->lod_info.grad.dPdx->accept(v);
219 if (s != visit_continue)
220 return (s == visit_continue_with_parent) ? visit_continue : s;
222 s = this->lod_info.grad.dPdy->accept(v);
223 if (s != visit_continue)
224 return (s == visit_continue_with_parent) ? visit_continue : s;
227 s = this->lod_info.component->accept(v);
228 if (s != visit_continue)
229 return (s == visit_continue_with_parent) ? visit_continue : s;
233 assert(s == visit_continue);
234 return v->visit_leave(this);
239 ir_swizzle::accept(ir_hierarchical_visitor *v)
241 ir_visitor_status s = v->visit_enter(this);
242 if (s != visit_continue)
243 return (s == visit_continue_with_parent) ? visit_continue : s;
245 s = this->val->accept(v);
246 return (s == visit_stop) ? s : v->visit_leave(this);
251 ir_dereference_variable::accept(ir_hierarchical_visitor *v)
253 return v->visit(this);
258 ir_dereference_array::accept(ir_hierarchical_visitor *v)
260 ir_visitor_status s = v->visit_enter(this);
261 if (s != visit_continue)
262 return (s == visit_continue_with_parent) ? visit_continue : s;
264 /* The array index is not the target of the assignment, so clear the
265 * 'in_assignee' flag. Restore it after returning from the array index.
267 const bool was_in_assignee = v->in_assignee;
268 v->in_assignee = false;
269 s = this->array_index->accept(v);
270 v->in_assignee = was_in_assignee;
272 if (s != visit_continue)
273 return (s == visit_continue_with_parent) ? visit_continue : s;
275 s = this->array->accept(v);
276 return (s == visit_stop) ? s : v->visit_leave(this);
281 ir_dereference_record::accept(ir_hierarchical_visitor *v)
283 ir_visitor_status s = v->visit_enter(this);
284 if (s != visit_continue)
285 return (s == visit_continue_with_parent) ? visit_continue : s;
287 s = this->record->accept(v);
288 return (s == visit_stop) ? s : v->visit_leave(this);
293 ir_assignment::accept(ir_hierarchical_visitor *v)
295 ir_visitor_status s = v->visit_enter(this);
296 if (s != visit_continue)
297 return (s == visit_continue_with_parent) ? visit_continue : s;
299 v->in_assignee = true;
300 s = this->lhs->accept(v);
301 v->in_assignee = false;
302 if (s != visit_continue)
303 return (s == visit_continue_with_parent) ? visit_continue : s;
305 s = this->rhs->accept(v);
306 if (s != visit_continue)
307 return (s == visit_continue_with_parent) ? visit_continue : s;
310 s = this->condition->accept(v);
312 return (s == visit_stop) ? s : v->visit_leave(this);
317 ir_constant::accept(ir_hierarchical_visitor *v)
319 return v->visit(this);
324 ir_call::accept(ir_hierarchical_visitor *v)
326 ir_visitor_status s = v->visit_enter(this);
327 if (s != visit_continue)
328 return (s == visit_continue_with_parent) ? visit_continue : s;
330 if (this->return_deref != NULL) {
331 v->in_assignee = true;
332 s = this->return_deref->accept(v);
333 v->in_assignee = false;
334 if (s != visit_continue)
335 return (s == visit_continue_with_parent) ? visit_continue : s;
338 s = visit_list_elements(v, &this->actual_parameters, false);
342 return v->visit_leave(this);
347 ir_return::accept(ir_hierarchical_visitor *v)
349 ir_visitor_status s = v->visit_enter(this);
350 if (s != visit_continue)
351 return (s == visit_continue_with_parent) ? visit_continue : s;
353 ir_rvalue *val = this->get_value();
356 if (s != visit_continue)
357 return (s == visit_continue_with_parent) ? visit_continue : s;
360 return v->visit_leave(this);
365 ir_discard::accept(ir_hierarchical_visitor *v)
367 ir_visitor_status s = v->visit_enter(this);
368 if (s != visit_continue)
369 return (s == visit_continue_with_parent) ? visit_continue : s;
371 if (this->condition != NULL) {
372 s = this->condition->accept(v);
373 if (s != visit_continue)
374 return (s == visit_continue_with_parent) ? visit_continue : s;
377 return v->visit_leave(this);
382 ir_if::accept(ir_hierarchical_visitor *v)
384 ir_visitor_status s = v->visit_enter(this);
385 if (s != visit_continue)
386 return (s == visit_continue_with_parent) ? visit_continue : s;
388 s = this->condition->accept(v);
389 if (s != visit_continue)
390 return (s == visit_continue_with_parent) ? visit_continue : s;
392 if (s != visit_continue_with_parent) {
393 s = visit_list_elements(v, &this->then_instructions);
398 if (s != visit_continue_with_parent) {
399 s = visit_list_elements(v, &this->else_instructions);
404 return v->visit_leave(this);
408 ir_emit_vertex::accept(ir_hierarchical_visitor *v)
410 ir_visitor_status s = v->visit_enter(this);
411 if (s != visit_continue)
412 return (s == visit_continue_with_parent) ? visit_continue : s;
414 s = this->stream->accept(v);
415 if (s != visit_continue)
416 return (s == visit_continue_with_parent) ? visit_continue : s;
418 assert(s == visit_continue);
419 return v->visit_leave(this);
424 ir_end_primitive::accept(ir_hierarchical_visitor *v)
426 ir_visitor_status s = v->visit_enter(this);
427 if (s != visit_continue)
428 return (s == visit_continue_with_parent) ? visit_continue : s;
430 s = this->stream->accept(v);
431 if (s != visit_continue)
432 return (s == visit_continue_with_parent) ? visit_continue : s;
434 assert(s == visit_continue);
435 return v->visit_leave(this);
439 ir_barrier::accept(ir_hierarchical_visitor *v)
441 return v->visit(this);