1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
|
/*
* 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.
*/
/**
* \file opt_tree_grafting.cpp
*
* Takes assignments to variables that are dereferenced only once and
* pastes the RHS expression into where the variable is dereferenced.
*
* In the process of various operations like function inlining and
* tertiary op handling, we'll end up with our expression trees having
* been chopped up into a series of assignments of short expressions
* to temps. Other passes like ir_algebraic.cpp would prefer to see
* the deepest expression trees they can to try to optimize them.
*
* This is a lot like copy propagaton. In comparison, copy
* propagation only acts on plain copies, not arbitrary expressions on
* the RHS. Generally, we wouldn't want to go pasting some
* complicated expression everywhere it got used, though, so we don't
* handle expressions in that pass.
*
* The hard part is making sure we don't move an expression across
* some other assignments that would change the value of the
* expression. So we split this into two passes: First, find the
* variables in our scope which are written to once and read once, and
* then go through basic blocks seeing if we find an opportunity to
* move those expressions safely.
*/
#include "ir.h"
#include "ir_visitor.h"
#include "ir_variable_refcount.h"
#include "ir_basic_block.h"
#include "ir_optimization.h"
#include "glsl_types.h"
namespace {
static bool debug = false;
class ir_tree_grafting_visitor : public ir_hierarchical_visitor {
public:
ir_tree_grafting_visitor(ir_assignment *graft_assign,
ir_variable *graft_var)
{
this->progress = false;
this->graft_assign = graft_assign;
this->graft_var = graft_var;
}
virtual ir_visitor_status visit_leave(class ir_assignment *);
virtual ir_visitor_status visit_enter(class ir_call *);
virtual ir_visitor_status visit_enter(class ir_expression *);
virtual ir_visitor_status visit_enter(class ir_function *);
virtual ir_visitor_status visit_enter(class ir_function_signature *);
virtual ir_visitor_status visit_enter(class ir_if *);
virtual ir_visitor_status visit_enter(class ir_loop *);
virtual ir_visitor_status visit_enter(class ir_swizzle *);
virtual ir_visitor_status visit_enter(class ir_texture *);
ir_visitor_status check_graft(ir_instruction *ir, ir_variable *var);
bool do_graft(ir_rvalue **rvalue);
bool progress;
ir_variable *graft_var;
ir_assignment *graft_assign;
};
struct find_deref_info {
ir_variable *var;
bool found;
};
void
dereferences_variable_callback(ir_instruction *ir, void *data)
{
struct find_deref_info *info = (struct find_deref_info *)data;
ir_dereference_variable *deref = ir->as_dereference_variable();
if (deref && deref->var == info->var)
info->found = true;
}
static bool
dereferences_variable(ir_instruction *ir, ir_variable *var)
{
struct find_deref_info info;
info.var = var;
info.found = false;
visit_tree(ir, dereferences_variable_callback, &info);
return info.found;
}
bool
ir_tree_grafting_visitor::do_graft(ir_rvalue **rvalue)
{
if (!*rvalue)
return false;
ir_dereference_variable *deref = (*rvalue)->as_dereference_variable();
if (!deref || deref->var != this->graft_var)
return false;
if (debug) {
printf("GRAFTING:\n");
this->graft_assign->print();
printf("\n");
printf("TO:\n");
(*rvalue)->print();
printf("\n");
}
this->graft_assign->remove();
*rvalue = this->graft_assign->rhs;
this->progress = true;
return true;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_loop *ir)
{
(void)ir;
/* Do not traverse into the body of the loop since that is a
* different basic block.
*/
return visit_stop;
}
/**
* Check if we can continue grafting after writing to a variable. If the
* expression we're trying to graft references the variable, we must stop.
*
* \param ir An instruction that writes to a variable.
* \param var The variable being updated.
*/
ir_visitor_status
ir_tree_grafting_visitor::check_graft(ir_instruction *ir, ir_variable *var)
{
if (dereferences_variable(this->graft_assign->rhs, var)) {
if (debug) {
printf("graft killed by: ");
ir->print();
printf("\n");
}
return visit_stop;
}
return visit_continue;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_leave(ir_assignment *ir)
{
if (do_graft(&ir->rhs) ||
do_graft(&ir->condition))
return visit_stop;
/* If this assignment updates a variable used in the assignment
* we're trying to graft, then we're done.
*/
return check_graft(ir, ir->lhs->variable_referenced());
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_function *ir)
{
(void) ir;
return visit_continue_with_parent;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_function_signature *ir)
{
(void)ir;
return visit_continue_with_parent;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_call *ir)
{
exec_list_iterator sig_iter = ir->callee->parameters.iterator();
/* Reminder: iterating ir_call iterates its parameters. */
foreach_iter(exec_list_iterator, iter, *ir) {
ir_variable *sig_param = (ir_variable *)sig_iter.get();
ir_rvalue *ir = (ir_rvalue *)iter.get();
ir_rvalue *new_ir = ir;
if (sig_param->mode != ir_var_function_in
&& sig_param->mode != ir_var_const_in) {
if (check_graft(ir, sig_param) == visit_stop)
return visit_stop;
continue;
}
if (do_graft(&new_ir)) {
ir->replace_with(new_ir);
return visit_stop;
}
sig_iter.next();
}
if (ir->return_deref && check_graft(ir, ir->return_deref->var) == visit_stop)
return visit_stop;
return visit_continue;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_expression *ir)
{
for (unsigned int i = 0; i < ir->get_num_operands(); i++) {
if (do_graft(&ir->operands[i]))
return visit_stop;
}
return visit_continue;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_if *ir)
{
if (do_graft(&ir->condition))
return visit_stop;
/* Do not traverse into the body of the if-statement since that is a
* different basic block.
*/
return visit_continue_with_parent;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_swizzle *ir)
{
if (do_graft(&ir->val))
return visit_stop;
return visit_continue;
}
ir_visitor_status
ir_tree_grafting_visitor::visit_enter(ir_texture *ir)
{
if (do_graft(&ir->coordinate) ||
do_graft(&ir->projector) ||
do_graft(&ir->offset) ||
do_graft(&ir->shadow_comparitor))
return visit_stop;
switch (ir->op) {
case ir_tex:
case ir_lod:
case ir_tg4:
break;
case ir_txb:
if (do_graft(&ir->lod_info.bias))
return visit_stop;
break;
case ir_txf:
case ir_txl:
case ir_txs:
if (do_graft(&ir->lod_info.lod))
return visit_stop;
break;
case ir_txf_ms:
if (do_graft(&ir->lod_info.sample_index))
return visit_stop;
break;
case ir_txd:
if (do_graft(&ir->lod_info.grad.dPdx) ||
do_graft(&ir->lod_info.grad.dPdy))
return visit_stop;
break;
}
return visit_continue;
}
struct tree_grafting_info {
ir_variable_refcount_visitor *refs;
bool progress;
};
static bool
try_tree_grafting(ir_assignment *start,
ir_variable *lhs_var,
ir_instruction *bb_last)
{
ir_tree_grafting_visitor v(start, lhs_var);
if (debug) {
printf("trying to graft: ");
lhs_var->print();
printf("\n");
}
for (ir_instruction *ir = (ir_instruction *)start->next;
ir != bb_last->next;
ir = (ir_instruction *)ir->next) {
if (debug) {
printf("- ");
ir->print();
printf("\n");
}
ir_visitor_status s = ir->accept(&v);
if (s == visit_stop)
return v.progress;
}
return false;
}
static void
tree_grafting_basic_block(ir_instruction *bb_first,
ir_instruction *bb_last,
void *data)
{
struct tree_grafting_info *info = (struct tree_grafting_info *)data;
ir_instruction *ir, *next;
for (ir = bb_first, next = (ir_instruction *)ir->next;
ir != bb_last->next;
ir = next, next = (ir_instruction *)ir->next) {
ir_assignment *assign = ir->as_assignment();
if (!assign)
continue;
ir_variable *lhs_var = assign->whole_variable_written();
if (!lhs_var)
continue;
if (lhs_var->mode == ir_var_function_out ||
lhs_var->mode == ir_var_function_inout ||
lhs_var->mode == ir_var_shader_out)
continue;
ir_variable_refcount_entry *entry = info->refs->get_variable_entry(lhs_var);
if (!entry->declaration ||
entry->assigned_count != 1 ||
entry->referenced_count != 2)
continue;
assert(assign == entry->assign);
/* Found a possibly graftable assignment. Now, walk through the
* rest of the BB seeing if the deref is here, and if nothing interfered with
* pasting its expression's values in between.
*/
info->progress |= try_tree_grafting(assign, lhs_var, bb_last);
}
}
} /* unnamed namespace */
/**
* Does a copy propagation pass on the code present in the instruction stream.
*/
bool
do_tree_grafting(exec_list *instructions)
{
ir_variable_refcount_visitor refs;
struct tree_grafting_info info;
info.progress = false;
info.refs = &refs;
visit_list_elements(info.refs, instructions);
call_for_basic_blocks(instructions, tree_grafting_basic_block, &info);
return info.progress;
}
|