glsl: Avoid excess tree walking when folding ir_dereference_arrays.
[mesa.git] / src / compiler / glsl / opt_constant_folding.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 /**
25 * \file opt_constant_folding.cpp
26 * Replace constant-valued expressions with references to constant values.
27 */
28
29 #include "ir.h"
30 #include "ir_visitor.h"
31 #include "ir_rvalue_visitor.h"
32 #include "ir_optimization.h"
33 #include "compiler/glsl_types.h"
34
35 namespace {
36
37 /**
38 * Visitor class for replacing expressions with ir_constant values.
39 */
40
41 class ir_constant_folding_visitor : public ir_rvalue_visitor {
42 public:
43 ir_constant_folding_visitor()
44 {
45 this->progress = false;
46 }
47
48 virtual ~ir_constant_folding_visitor()
49 {
50 /* empty */
51 }
52
53 virtual ir_visitor_status visit_enter(ir_discard *ir);
54 virtual ir_visitor_status visit_enter(ir_assignment *ir);
55 virtual ir_visitor_status visit_enter(ir_call *ir);
56
57 virtual void handle_rvalue(ir_rvalue **rvalue);
58
59 bool progress;
60 };
61
62 } /* unnamed namespace */
63
64 bool
65 ir_constant_fold(ir_rvalue **rvalue)
66 {
67 if (*rvalue == NULL || (*rvalue)->ir_type == ir_type_constant)
68 return false;
69
70 /* Note that we do rvalue visitoring on leaving. So if an
71 * expression has a non-constant operand, no need to go looking
72 * down it to find if it's constant. This cuts the time of this
73 * pass down drastically.
74 */
75 ir_expression *expr = (*rvalue)->as_expression();
76 if (expr) {
77 for (unsigned int i = 0; i < expr->get_num_operands(); i++) {
78 if (!expr->operands[i]->as_constant())
79 return false;
80 }
81 }
82
83 /* Ditto for swizzles. */
84 ir_swizzle *swiz = (*rvalue)->as_swizzle();
85 if (swiz && !swiz->val->as_constant())
86 return false;
87
88 /* Ditto for array dereferences */
89 ir_dereference_array *array_ref = (*rvalue)->as_dereference_array();
90 if (array_ref && (!array_ref->array->as_constant() ||
91 !array_ref->array_index->as_constant()))
92 return false;
93
94 ir_constant *constant = (*rvalue)->constant_expression_value();
95 if (constant) {
96 *rvalue = constant;
97 return true;
98 }
99 return false;
100 }
101
102 void
103 ir_constant_folding_visitor::handle_rvalue(ir_rvalue **rvalue)
104 {
105 if (ir_constant_fold(rvalue))
106 this->progress = true;
107 }
108
109 ir_visitor_status
110 ir_constant_folding_visitor::visit_enter(ir_discard *ir)
111 {
112 if (ir->condition) {
113 ir->condition->accept(this);
114 handle_rvalue(&ir->condition);
115
116 ir_constant *const_val = ir->condition->as_constant();
117 /* If the condition is constant, either remove the condition or
118 * remove the never-executed assignment.
119 */
120 if (const_val) {
121 if (const_val->value.b[0])
122 ir->condition = NULL;
123 else
124 ir->remove();
125 this->progress = true;
126 }
127 }
128
129 return visit_continue_with_parent;
130 }
131
132 ir_visitor_status
133 ir_constant_folding_visitor::visit_enter(ir_assignment *ir)
134 {
135 ir->rhs->accept(this);
136 handle_rvalue(&ir->rhs);
137
138 if (ir->condition) {
139 ir->condition->accept(this);
140 handle_rvalue(&ir->condition);
141
142 ir_constant *const_val = ir->condition->as_constant();
143 /* If the condition is constant, either remove the condition or
144 * remove the never-executed assignment.
145 */
146 if (const_val) {
147 if (const_val->value.b[0])
148 ir->condition = NULL;
149 else
150 ir->remove();
151 this->progress = true;
152 }
153 }
154
155 /* Don't descend into the LHS because we want it to stay as a
156 * variable dereference. FINISHME: We probably should to get array
157 * indices though.
158 */
159 return visit_continue_with_parent;
160 }
161
162 ir_visitor_status
163 ir_constant_folding_visitor::visit_enter(ir_call *ir)
164 {
165 /* Attempt to constant fold parameters */
166 foreach_two_lists(formal_node, &ir->callee->parameters,
167 actual_node, &ir->actual_parameters) {
168 ir_rvalue *param_rval = (ir_rvalue *) actual_node;
169 ir_variable *sig_param = (ir_variable *) formal_node;
170
171 if (sig_param->data.mode == ir_var_function_in
172 || sig_param->data.mode == ir_var_const_in) {
173 ir_rvalue *new_param = param_rval;
174
175 handle_rvalue(&new_param);
176 if (new_param != param_rval) {
177 param_rval->replace_with(new_param);
178 }
179 }
180 }
181
182 /* Next, see if the call can be replaced with an assignment of a constant */
183 ir_constant *const_val = ir->constant_expression_value();
184
185 if (const_val != NULL) {
186 ir_assignment *assignment =
187 new(ralloc_parent(ir)) ir_assignment(ir->return_deref, const_val);
188 ir->replace_with(assignment);
189 }
190
191 return visit_continue_with_parent;
192 }
193
194 bool
195 do_constant_folding(exec_list *instructions)
196 {
197 ir_constant_folding_visitor constant_folding;
198
199 visit_list_elements(&constant_folding, instructions);
200
201 return constant_folding.progress;
202 }