2 * Copyright © 2012 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 DEALINGS
27 /** @file brw_fs_cse.cpp
29 * Support for local common subexpression elimination.
31 * See Muchnick's Advanced Compiler Design and Implementation, section
38 struct aeb_entry
: public exec_node
{
39 /** The instruction that generates the expression value. */
42 /** The temporary where the value is stored. */
48 is_expression(const fs_visitor
*v
, const fs_inst
*const inst
)
50 switch (inst
->opcode
) {
64 case SHADER_OPCODE_MULH
:
74 case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
:
75 case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_LOGICAL
:
76 case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GEN7
:
77 case FS_OPCODE_CINTERP
:
78 case FS_OPCODE_LINTERP
:
79 case SHADER_OPCODE_FIND_LIVE_CHANNEL
:
80 case SHADER_OPCODE_BROADCAST
:
81 case SHADER_OPCODE_MOV_INDIRECT
:
82 case SHADER_OPCODE_TEX_LOGICAL
:
83 case SHADER_OPCODE_TXD_LOGICAL
:
84 case SHADER_OPCODE_TXF_LOGICAL
:
85 case SHADER_OPCODE_TXL_LOGICAL
:
86 case SHADER_OPCODE_TXS_LOGICAL
:
87 case FS_OPCODE_TXB_LOGICAL
:
88 case SHADER_OPCODE_TXF_CMS_LOGICAL
:
89 case SHADER_OPCODE_TXF_CMS_W_LOGICAL
:
90 case SHADER_OPCODE_TXF_UMS_LOGICAL
:
91 case SHADER_OPCODE_TXF_MCS_LOGICAL
:
92 case SHADER_OPCODE_LOD_LOGICAL
:
93 case SHADER_OPCODE_TG4_LOGICAL
:
94 case SHADER_OPCODE_TG4_OFFSET_LOGICAL
:
97 case SHADER_OPCODE_RCP
:
98 case SHADER_OPCODE_RSQ
:
99 case SHADER_OPCODE_SQRT
:
100 case SHADER_OPCODE_EXP2
:
101 case SHADER_OPCODE_LOG2
:
102 case SHADER_OPCODE_POW
:
103 case SHADER_OPCODE_INT_QUOTIENT
:
104 case SHADER_OPCODE_INT_REMAINDER
:
105 case SHADER_OPCODE_SIN
:
106 case SHADER_OPCODE_COS
:
107 return inst
->mlen
< 2;
108 case SHADER_OPCODE_LOAD_PAYLOAD
:
109 return !inst
->is_copy_payload(v
->alloc
);
111 return inst
->is_send_from_grf() && !inst
->has_side_effects() &&
112 !inst
->is_volatile();
117 operands_match(const fs_inst
*a
, const fs_inst
*b
, bool *negate
)
122 if (a
->opcode
== BRW_OPCODE_MAD
) {
123 return xs
[0].equals(ys
[0]) &&
124 ((xs
[1].equals(ys
[1]) && xs
[2].equals(ys
[2])) ||
125 (xs
[2].equals(ys
[1]) && xs
[1].equals(ys
[2])));
126 } else if (a
->opcode
== BRW_OPCODE_MUL
&& a
->dst
.type
== BRW_REGISTER_TYPE_F
) {
127 bool xs0_negate
= xs
[0].negate
;
128 bool xs1_negate
= xs
[1].file
== IMM
? xs
[1].f
< 0.0f
130 bool ys0_negate
= ys
[0].negate
;
131 bool ys1_negate
= ys
[1].file
== IMM
? ys
[1].f
< 0.0f
133 float xs1_imm
= xs
[1].f
;
134 float ys1_imm
= ys
[1].f
;
136 xs
[0].negate
= false;
137 xs
[1].negate
= false;
138 ys
[0].negate
= false;
139 ys
[1].negate
= false;
140 xs
[1].f
= fabsf(xs
[1].f
);
141 ys
[1].f
= fabsf(ys
[1].f
);
143 bool ret
= (xs
[0].equals(ys
[0]) && xs
[1].equals(ys
[1])) ||
144 (xs
[1].equals(ys
[0]) && xs
[0].equals(ys
[1]));
146 xs
[0].negate
= xs0_negate
;
147 xs
[1].negate
= xs
[1].file
== IMM
? false : xs1_negate
;
148 ys
[0].negate
= ys0_negate
;
149 ys
[1].negate
= ys
[1].file
== IMM
? false : ys1_negate
;
153 *negate
= (xs0_negate
!= xs1_negate
) != (ys0_negate
!= ys1_negate
);
154 if (*negate
&& (a
->saturate
|| b
->saturate
))
157 } else if (!a
->is_commutative()) {
159 for (int i
= 0; i
< a
->sources
; i
++) {
160 if (!xs
[i
].equals(ys
[i
])) {
167 return (xs
[0].equals(ys
[0]) && xs
[1].equals(ys
[1])) ||
168 (xs
[1].equals(ys
[0]) && xs
[0].equals(ys
[1]));
173 instructions_match(fs_inst
*a
, fs_inst
*b
, bool *negate
)
175 return a
->opcode
== b
->opcode
&&
176 a
->force_writemask_all
== b
->force_writemask_all
&&
177 a
->exec_size
== b
->exec_size
&&
178 a
->group
== b
->group
&&
179 a
->saturate
== b
->saturate
&&
180 a
->predicate
== b
->predicate
&&
181 a
->predicate_inverse
== b
->predicate_inverse
&&
182 a
->conditional_mod
== b
->conditional_mod
&&
183 a
->flag_subreg
== b
->flag_subreg
&&
184 a
->dst
.type
== b
->dst
.type
&&
185 a
->offset
== b
->offset
&&
186 a
->mlen
== b
->mlen
&&
187 a
->regs_written
== b
->regs_written
&&
188 a
->base_mrf
== b
->base_mrf
&&
190 a
->header_size
== b
->header_size
&&
191 a
->shadow_compare
== b
->shadow_compare
&&
192 a
->pi_noperspective
== b
->pi_noperspective
&&
193 a
->sources
== b
->sources
&&
194 operands_match(a
, b
, negate
);
198 create_copy_instr(const fs_builder
&bld
, fs_inst
*inst
, fs_reg src
, bool negate
)
200 int written
= inst
->regs_written
;
202 DIV_ROUND_UP(inst
->dst
.component_size(inst
->exec_size
), REG_SIZE
);
205 if (inst
->opcode
== SHADER_OPCODE_LOAD_PAYLOAD
||
206 written
!= dst_width
) {
208 int sources
, header_size
;
209 if (inst
->opcode
== SHADER_OPCODE_LOAD_PAYLOAD
) {
210 sources
= inst
->sources
;
211 header_size
= inst
->header_size
;
213 assert(written
% dst_width
== 0);
214 sources
= written
/ dst_width
;
218 assert(src
.file
== VGRF
);
219 payload
= ralloc_array(bld
.shader
->mem_ctx
, fs_reg
, sources
);
220 for (int i
= 0; i
< header_size
; i
++) {
224 for (int i
= header_size
; i
< sources
; i
++) {
226 src
= offset(src
, bld
, 1);
228 copy
= bld
.LOAD_PAYLOAD(inst
->dst
, payload
, sources
, header_size
);
230 copy
= bld
.MOV(inst
->dst
, src
);
231 copy
->group
= inst
->group
;
232 copy
->force_writemask_all
= inst
->force_writemask_all
;
233 copy
->src
[0].negate
= negate
;
235 assert(copy
->regs_written
== written
);
239 fs_visitor::opt_cse_local(bblock_t
*block
)
241 bool progress
= false;
244 void *cse_ctx
= ralloc_context(NULL
);
246 int ip
= block
->start_ip
;
247 foreach_inst_in_block(fs_inst
, inst
, block
) {
248 /* Skip some cases. */
249 if (is_expression(this, inst
) && !inst
->is_partial_write() &&
250 ((inst
->dst
.file
!= ARF
&& inst
->dst
.file
!= FIXED_GRF
) ||
251 inst
->dst
.is_null()))
256 foreach_in_list_use_after(aeb_entry
, entry
, &aeb
) {
257 /* Match current instruction's expression against those in AEB. */
258 if (!(entry
->generator
->dst
.is_null() && !inst
->dst
.is_null()) &&
259 instructions_match(inst
, entry
->generator
, &negate
)) {
267 if (inst
->opcode
!= BRW_OPCODE_MOV
||
268 (inst
->opcode
== BRW_OPCODE_MOV
&&
269 inst
->src
[0].file
== IMM
&&
270 inst
->src
[0].type
== BRW_REGISTER_TYPE_VF
)) {
271 /* Our first sighting of this expression. Create an entry. */
272 aeb_entry
*entry
= ralloc(cse_ctx
, aeb_entry
);
273 entry
->tmp
= reg_undef
;
274 entry
->generator
= inst
;
275 aeb
.push_tail(entry
);
278 /* This is at least our second sighting of this expression.
279 * If we don't have a temporary already, make one.
281 bool no_existing_temp
= entry
->tmp
.file
== BAD_FILE
;
282 if (no_existing_temp
&& !entry
->generator
->dst
.is_null()) {
283 const fs_builder ibld
= fs_builder(this, block
, entry
->generator
)
284 .at(block
, entry
->generator
->next
);
285 int written
= entry
->generator
->regs_written
;
287 entry
->tmp
= fs_reg(VGRF
, alloc
.allocate(written
),
288 entry
->generator
->dst
.type
);
290 create_copy_instr(ibld
, entry
->generator
, entry
->tmp
, false);
292 entry
->generator
->dst
= entry
->tmp
;
296 if (!inst
->dst
.is_null()) {
297 assert(inst
->regs_written
== entry
->generator
->regs_written
);
298 assert(inst
->dst
.type
== entry
->tmp
.type
);
299 const fs_builder
ibld(this, block
, inst
);
301 create_copy_instr(ibld
, inst
, entry
->tmp
, negate
);
304 /* Set our iterator so that next time through the loop inst->next
305 * will get the instruction in the basic block after the one we've
308 fs_inst
*prev
= (fs_inst
*)inst
->prev
;
315 foreach_in_list_safe(aeb_entry
, entry
, &aeb
) {
316 /* Kill all AEB entries that write a different value to or read from
317 * the flag register if we just wrote it.
319 if (inst
->flags_written()) {
320 bool negate
; /* dummy */
321 if (entry
->generator
->flags_read(devinfo
) ||
322 (entry
->generator
->flags_written() &&
323 !instructions_match(inst
, entry
->generator
, &negate
))) {
330 for (int i
= 0; i
< entry
->generator
->sources
; i
++) {
331 fs_reg
*src_reg
= &entry
->generator
->src
[i
];
333 /* Kill all AEB entries that use the destination we just
336 if (inst
->overwrites_reg(entry
->generator
->src
[i
])) {
342 /* Kill any AEB entries using registers that don't get reused any
343 * more -- a sure sign they'll fail operands_match().
345 if (src_reg
->file
== VGRF
&& virtual_grf_end
[src_reg
->nr
] < ip
) {
356 ralloc_free(cse_ctx
);
362 fs_visitor::opt_cse()
364 bool progress
= false;
366 calculate_live_intervals();
368 foreach_block (block
, cfg
) {
369 progress
= opt_cse_local(block
) || progress
;
373 invalidate_live_intervals();