brw_fs_cse.cpp revision 01e04c3f
1/*
2 * Copyright © 2012 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 DEALINGS
21 * IN THE SOFTWARE.
22 */
23
24#include "brw_fs.h"
25#include "brw_cfg.h"
26
27/** @file brw_fs_cse.cpp
28 *
29 * Support for local common subexpression elimination.
30 *
31 * See Muchnick's Advanced Compiler Design and Implementation, section
32 * 13.1 (p378).
33 */
34
35using namespace brw;
36
37namespace {
38struct aeb_entry : public exec_node {
39   /** The instruction that generates the expression value. */
40   fs_inst *generator;
41
42   /** The temporary where the value is stored. */
43   fs_reg tmp;
44};
45}
46
47static bool
48is_expression(const fs_visitor *v, const fs_inst *const inst)
49{
50   switch (inst->opcode) {
51   case BRW_OPCODE_MOV:
52   case BRW_OPCODE_SEL:
53   case BRW_OPCODE_NOT:
54   case BRW_OPCODE_AND:
55   case BRW_OPCODE_OR:
56   case BRW_OPCODE_XOR:
57   case BRW_OPCODE_SHR:
58   case BRW_OPCODE_SHL:
59   case BRW_OPCODE_ASR:
60   case BRW_OPCODE_CMP:
61   case BRW_OPCODE_CMPN:
62   case BRW_OPCODE_ADD:
63   case BRW_OPCODE_MUL:
64   case SHADER_OPCODE_MULH:
65   case BRW_OPCODE_FRC:
66   case BRW_OPCODE_RNDU:
67   case BRW_OPCODE_RNDD:
68   case BRW_OPCODE_RNDE:
69   case BRW_OPCODE_RNDZ:
70   case BRW_OPCODE_LINE:
71   case BRW_OPCODE_PLN:
72   case BRW_OPCODE_MAD:
73   case BRW_OPCODE_LRP:
74   case FS_OPCODE_FB_READ_LOGICAL:
75   case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD:
76   case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_LOGICAL:
77   case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GEN7:
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:
95   case FS_OPCODE_PACK:
96      return true;
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);
110   default:
111      return inst->is_send_from_grf() && !inst->has_side_effects() &&
112         !inst->is_volatile();
113   }
114}
115
116static bool
117operands_match(const fs_inst *a, const fs_inst *b, bool *negate)
118{
119   fs_reg *xs = a->src;
120   fs_reg *ys = b->src;
121
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
129                                          : xs[1].negate;
130      bool ys0_negate = ys[0].negate;
131      bool ys1_negate = ys[1].file == IMM ? ys[1].f < 0.0f
132                                          : ys[1].negate;
133      float xs1_imm = xs[1].f;
134      float ys1_imm = ys[1].f;
135
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);
142
143      bool ret = (xs[0].equals(ys[0]) && xs[1].equals(ys[1])) ||
144                 (xs[1].equals(ys[0]) && xs[0].equals(ys[1]));
145
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;
150      xs[1].f = xs1_imm;
151      ys[1].f = ys1_imm;
152
153      *negate = (xs0_negate != xs1_negate) != (ys0_negate != ys1_negate);
154      if (*negate && (a->saturate || b->saturate))
155         return false;
156      return ret;
157   } else if (!a->is_commutative()) {
158      bool match = true;
159      for (int i = 0; i < a->sources; i++) {
160         if (!xs[i].equals(ys[i])) {
161            match = false;
162            break;
163         }
164      }
165      return match;
166   } else {
167      return (xs[0].equals(ys[0]) && xs[1].equals(ys[1])) ||
168             (xs[1].equals(ys[0]) && xs[0].equals(ys[1]));
169   }
170}
171
172static bool
173instructions_match(fs_inst *a, fs_inst *b, bool *negate)
174{
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->size_written == b->size_written &&
188          a->base_mrf == b->base_mrf &&
189          a->eot == b->eot &&
190          a->header_size == b->header_size &&
191          a->shadow_compare == b->shadow_compare &&
192          a->pi_noperspective == b->pi_noperspective &&
193          a->target == b->target &&
194          a->sources == b->sources &&
195          operands_match(a, b, negate);
196}
197
198static void
199create_copy_instr(const fs_builder &bld, fs_inst *inst, fs_reg src, bool negate)
200{
201   unsigned written = regs_written(inst);
202   unsigned dst_width =
203      DIV_ROUND_UP(inst->dst.component_size(inst->exec_size), REG_SIZE);
204   fs_inst *copy;
205
206   if (inst->opcode == SHADER_OPCODE_LOAD_PAYLOAD ||
207       written != dst_width) {
208      fs_reg *payload;
209      int sources, header_size;
210      if (inst->opcode == SHADER_OPCODE_LOAD_PAYLOAD) {
211         sources = inst->sources;
212         header_size = inst->header_size;
213      } else {
214         assert(written % dst_width == 0);
215         sources = written / dst_width;
216         header_size = 0;
217      }
218
219      assert(src.file == VGRF);
220      payload = ralloc_array(bld.shader->mem_ctx, fs_reg, sources);
221      for (int i = 0; i < header_size; i++) {
222         payload[i] = src;
223         src.offset += REG_SIZE;
224      }
225      for (int i = header_size; i < sources; i++) {
226         payload[i] = src;
227         src = offset(src, bld, 1);
228      }
229      copy = bld.LOAD_PAYLOAD(inst->dst, payload, sources, header_size);
230   } else {
231      copy = bld.MOV(inst->dst, src);
232      copy->group = inst->group;
233      copy->force_writemask_all = inst->force_writemask_all;
234      copy->src[0].negate = negate;
235   }
236   assert(regs_written(copy) == written);
237}
238
239bool
240fs_visitor::opt_cse_local(bblock_t *block)
241{
242   bool progress = false;
243   exec_list aeb;
244
245   void *cse_ctx = ralloc_context(NULL);
246
247   int ip = block->start_ip;
248   foreach_inst_in_block(fs_inst, inst, block) {
249      /* Skip some cases. */
250      if (is_expression(this, inst) && !inst->is_partial_write() &&
251          ((inst->dst.file != ARF && inst->dst.file != FIXED_GRF) ||
252           inst->dst.is_null()))
253      {
254         bool found = false;
255         bool negate = false;
256
257         foreach_in_list_use_after(aeb_entry, entry, &aeb) {
258            /* Match current instruction's expression against those in AEB. */
259            if (!(entry->generator->dst.is_null() && !inst->dst.is_null()) &&
260                instructions_match(inst, entry->generator, &negate)) {
261               found = true;
262               progress = true;
263               break;
264            }
265         }
266
267         if (!found) {
268            if (inst->opcode != BRW_OPCODE_MOV ||
269                (inst->opcode == BRW_OPCODE_MOV &&
270                 inst->src[0].file == IMM &&
271                 inst->src[0].type == BRW_REGISTER_TYPE_VF)) {
272               /* Our first sighting of this expression.  Create an entry. */
273               aeb_entry *entry = ralloc(cse_ctx, aeb_entry);
274               entry->tmp = reg_undef;
275               entry->generator = inst;
276               aeb.push_tail(entry);
277            }
278         } else {
279            /* This is at least our second sighting of this expression.
280             * If we don't have a temporary already, make one.
281             */
282            bool no_existing_temp = entry->tmp.file == BAD_FILE;
283            if (no_existing_temp && !entry->generator->dst.is_null()) {
284               const fs_builder ibld = fs_builder(this, block, entry->generator)
285                                       .at(block, entry->generator->next);
286               int written = regs_written(entry->generator);
287
288               entry->tmp = fs_reg(VGRF, alloc.allocate(written),
289                                   entry->generator->dst.type);
290
291               create_copy_instr(ibld, entry->generator, entry->tmp, false);
292
293               entry->generator->dst = entry->tmp;
294            }
295
296            /* dest <- temp */
297            if (!inst->dst.is_null()) {
298               assert(inst->size_written == entry->generator->size_written);
299               assert(inst->dst.type == entry->tmp.type);
300               const fs_builder ibld(this, block, inst);
301
302               create_copy_instr(ibld, inst, entry->tmp, negate);
303            }
304
305            /* Set our iterator so that next time through the loop inst->next
306             * will get the instruction in the basic block after the one we've
307             * removed.
308             */
309            fs_inst *prev = (fs_inst *)inst->prev;
310
311            inst->remove(block);
312            inst = prev;
313         }
314      }
315
316      foreach_in_list_safe(aeb_entry, entry, &aeb) {
317         /* Kill all AEB entries that write a different value to or read from
318          * the flag register if we just wrote it.
319          */
320         if (inst->flags_written()) {
321            bool negate; /* dummy */
322            if (entry->generator->flags_read(devinfo) ||
323                (entry->generator->flags_written() &&
324                 !instructions_match(inst, entry->generator, &negate))) {
325               entry->remove();
326               ralloc_free(entry);
327               continue;
328            }
329         }
330
331         for (int i = 0; i < entry->generator->sources; i++) {
332            fs_reg *src_reg = &entry->generator->src[i];
333
334            /* Kill all AEB entries that use the destination we just
335             * overwrote.
336             */
337            if (regions_overlap(inst->dst, inst->size_written,
338                                entry->generator->src[i],
339                                entry->generator->size_read(i))) {
340               entry->remove();
341               ralloc_free(entry);
342               break;
343            }
344
345            /* Kill any AEB entries using registers that don't get reused any
346             * more -- a sure sign they'll fail operands_match().
347             */
348            if (src_reg->file == VGRF && virtual_grf_end[src_reg->nr] < ip) {
349               entry->remove();
350               ralloc_free(entry);
351               break;
352            }
353         }
354      }
355
356      ip++;
357   }
358
359   ralloc_free(cse_ctx);
360
361   return progress;
362}
363
364bool
365fs_visitor::opt_cse()
366{
367   bool progress = false;
368
369   calculate_live_intervals();
370
371   foreach_block (block, cfg) {
372      progress = opt_cse_local(block) || progress;
373   }
374
375   if (progress)
376      invalidate_live_intervals();
377
378   return progress;
379}
380