xref: /aosp_15_r20/external/mesa3d/src/intel/compiler/brw_fs_register_coalesce.cpp (revision 6104692788411f58d303aa86923a9ff6ecaded22)
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 /** @file
25  *
26  * Implements register coalescing: Checks if the two registers involved in a
27  * raw move don't interfere, in which case they can both be stored in the same
28  * place and the MOV removed.
29  *
30  * To do this, all uses of the source of the MOV in the shader are replaced
31  * with the destination of the MOV. For example:
32  *
33  * add vgrf3:F, vgrf1:F, vgrf2:F
34  * mov vgrf4:F, vgrf3:F
35  * mul vgrf5:F, vgrf5:F, vgrf4:F
36  *
37  * becomes
38  *
39  * add vgrf4:F, vgrf1:F, vgrf2:F
40  * mul vgrf5:F, vgrf5:F, vgrf4:F
41  */
42 
43 #include "brw_fs.h"
44 #include "brw_cfg.h"
45 #include "brw_fs_live_variables.h"
46 
47 using namespace brw;
48 
49 static bool
is_nop_mov(const fs_inst * inst)50 is_nop_mov(const fs_inst *inst)
51 {
52    if (inst->opcode == SHADER_OPCODE_LOAD_PAYLOAD) {
53       brw_reg dst = inst->dst;
54       for (int i = 0; i < inst->sources; i++) {
55          if (!dst.equals(inst->src[i])) {
56             return false;
57          }
58          dst.offset += (i < inst->header_size ? REG_SIZE :
59                         inst->exec_size * dst.stride *
60                         brw_type_size_bytes(inst->src[i].type));
61       }
62       return true;
63    } else if (inst->opcode == BRW_OPCODE_MOV) {
64       return inst->dst.equals(inst->src[0]);
65    }
66 
67    return false;
68 }
69 
70 static bool
is_coalesce_candidate(const fs_visitor * v,const fs_inst * inst)71 is_coalesce_candidate(const fs_visitor *v, const fs_inst *inst)
72 {
73    if ((inst->opcode != BRW_OPCODE_MOV &&
74         inst->opcode != SHADER_OPCODE_LOAD_PAYLOAD) ||
75        inst->is_partial_write() ||
76        inst->saturate ||
77        inst->src[0].file != VGRF ||
78        inst->src[0].negate ||
79        inst->src[0].abs ||
80        !inst->src[0].is_contiguous() ||
81        inst->dst.file != VGRF ||
82        inst->dst.type != inst->src[0].type) {
83       return false;
84    }
85 
86    if (v->alloc.sizes[inst->src[0].nr] >
87        v->alloc.sizes[inst->dst.nr])
88       return false;
89 
90    if (inst->opcode == SHADER_OPCODE_LOAD_PAYLOAD) {
91       if (!is_coalescing_payload(v->alloc, inst)) {
92          return false;
93       }
94    }
95 
96    return true;
97 }
98 
99 static bool
can_coalesce_vars(const fs_live_variables & live,const cfg_t * cfg,const bblock_t * block,const fs_inst * inst,int dst_var,int src_var)100 can_coalesce_vars(const fs_live_variables &live, const cfg_t *cfg,
101                   const bblock_t *block, const fs_inst *inst,
102                   int dst_var, int src_var)
103 {
104    if (!live.vars_interfere(src_var, dst_var))
105       return true;
106 
107    int dst_start = live.start[dst_var];
108    int dst_end = live.end[dst_var];
109    int src_start = live.start[src_var];
110    int src_end = live.end[src_var];
111 
112    /* Variables interfere and one line range isn't a subset of the other. */
113    if ((dst_end > src_end && src_start < dst_start) ||
114        (src_end > dst_end && dst_start < src_start))
115       return false;
116 
117    /* Check for a write to either register in the intersection of their live
118     * ranges.
119     */
120    int start_ip = MAX2(dst_start, src_start);
121    int end_ip = MIN2(dst_end, src_end);
122 
123    foreach_block(scan_block, cfg) {
124       if (scan_block->end_ip < start_ip)
125          continue;
126 
127       int scan_ip = scan_block->start_ip - 1;
128 
129       bool seen_src_write = false;
130       bool seen_copy = false;
131       foreach_inst_in_block(fs_inst, scan_inst, scan_block) {
132          scan_ip++;
133 
134          /* Ignore anything before the intersection of the live ranges */
135          if (scan_ip < start_ip)
136             continue;
137 
138          /* Ignore the copying instruction itself */
139          if (scan_inst == inst) {
140             seen_copy = true;
141             continue;
142          }
143 
144          if (scan_ip > end_ip)
145             return true; /* registers do not interfere */
146 
147          if (seen_src_write && !seen_copy) {
148             /* In order to satisfy the guarantee of register coalescing, we
149              * must ensure that the two registers always have the same value
150              * during the intersection of their live ranges.  One way to do
151              * this is to simply ensure that neither is ever written apart
152              * from the one copy which syncs up the two registers.  However,
153              * this can be overly conservative and only works in the case
154              * where the destination live range is entirely contained in the
155              * source live range.
156              *
157              * To handle the other case where the source is contained in the
158              * destination, we allow writes to the source register as long as
159              * they happen before the copy, in the same block as the copy, and
160              * the destination is never read between first such write and the
161              * copy.  This effectively moves the write from the copy up.
162              */
163             for (int j = 0; j < scan_inst->sources; j++) {
164                if (regions_overlap(scan_inst->src[j], scan_inst->size_read(j),
165                                    inst->dst, inst->size_written))
166                   return false; /* registers interfere */
167             }
168          }
169 
170          /* The MOV being coalesced had better be the only instruction which
171           * writes to the coalesce destination in the intersection.
172           */
173          if (regions_overlap(scan_inst->dst, scan_inst->size_written,
174                              inst->dst, inst->size_written))
175             return false; /* registers interfere */
176 
177          /* See the big comment above */
178          if (regions_overlap(scan_inst->dst, scan_inst->size_written,
179                              inst->src[0], inst->size_read(0))) {
180             if (seen_copy || scan_block != block ||
181                 (scan_inst->force_writemask_all && !inst->force_writemask_all))
182                return false;
183             seen_src_write = true;
184          }
185       }
186    }
187 
188    return true;
189 }
190 
191 /**
192  * Check if coalescing this register would expand the size of the last
193  * SEND instruction's payload to more than would fit in g112-g127.
194  */
195 static bool
would_violate_eot_restriction(const brw::simple_allocator & alloc,const cfg_t * cfg,unsigned dst_reg,unsigned src_reg)196 would_violate_eot_restriction(const brw::simple_allocator &alloc,
197                               const cfg_t *cfg,
198                               unsigned dst_reg, unsigned src_reg)
199 {
200    if (alloc.sizes[dst_reg] > alloc.sizes[src_reg]) {
201       foreach_inst_in_block_reverse(fs_inst, send, cfg->last_block()) {
202          if (send->opcode != SHADER_OPCODE_SEND || !send->eot)
203             continue;
204 
205          if ((send->src[2].file == VGRF && send->src[2].nr == src_reg) ||
206              (send->sources >= 4 &&
207               send->src[3].file == VGRF && send->src[3].nr == src_reg)) {
208             const unsigned s2 =
209                send->src[2].file == VGRF ? alloc.sizes[send->src[2].nr] : 0;
210             const unsigned s3 = send->sources >= 4 &&
211                send->src[3].file == VGRF ?
212                alloc.sizes[send->src[3].nr] : 0;
213 
214             const unsigned increase =
215                alloc.sizes[dst_reg] - alloc.sizes[src_reg];
216 
217             if (s2 + s3 + increase > 15)
218                return true;
219          }
220          break;
221       }
222    }
223 
224    return false;
225 }
226 
227 bool
brw_fs_opt_register_coalesce(fs_visitor & s)228 brw_fs_opt_register_coalesce(fs_visitor &s)
229 {
230    const intel_device_info *devinfo = s.devinfo;
231 
232    bool progress = false;
233    fs_live_variables &live = s.live_analysis.require();
234    int src_size = 0;
235    int channels_remaining = 0;
236    unsigned src_reg = ~0u, dst_reg = ~0u;
237    int *dst_reg_offset = new int[MAX_VGRF_SIZE(devinfo)];
238    fs_inst **mov = new fs_inst *[MAX_VGRF_SIZE(devinfo)];
239    int *dst_var = new int[MAX_VGRF_SIZE(devinfo)];
240    int *src_var = new int[MAX_VGRF_SIZE(devinfo)];
241 
242    foreach_block_and_inst(block, fs_inst, inst, s.cfg) {
243       if (!is_coalesce_candidate(&s, inst))
244          continue;
245 
246       if (is_nop_mov(inst)) {
247          inst->opcode = BRW_OPCODE_NOP;
248          progress = true;
249          continue;
250       }
251 
252       if (src_reg != inst->src[0].nr) {
253          src_reg = inst->src[0].nr;
254 
255          src_size = s.alloc.sizes[inst->src[0].nr];
256          assert(src_size <= MAX_VGRF_SIZE(devinfo));
257 
258          channels_remaining = src_size;
259          memset(mov, 0, sizeof(*mov) * MAX_VGRF_SIZE(devinfo));
260 
261          dst_reg = inst->dst.nr;
262       }
263 
264       if (dst_reg != inst->dst.nr)
265          continue;
266 
267       if (inst->opcode == SHADER_OPCODE_LOAD_PAYLOAD) {
268          for (int i = 0; i < src_size; i++) {
269             dst_reg_offset[i] = inst->dst.offset / REG_SIZE + i;
270          }
271          mov[0] = inst;
272          channels_remaining -= regs_written(inst);
273       } else {
274          const int offset = inst->src[0].offset / REG_SIZE;
275          if (mov[offset]) {
276             /* This is the second time that this offset in the register has
277              * been set.  This means, in particular, that inst->dst was
278              * live before this instruction and that the live ranges of
279              * inst->dst and inst->src[0] overlap and we can't coalesce the
280              * two variables.  Let's ensure that doesn't happen.
281              */
282             channels_remaining = -1;
283             continue;
284          }
285          for (unsigned i = 0; i < MAX2(inst->size_written / REG_SIZE, 1); i++)
286             dst_reg_offset[offset + i] = inst->dst.offset / REG_SIZE + i;
287          mov[offset] = inst;
288          channels_remaining -= regs_written(inst);
289       }
290 
291       if (channels_remaining)
292          continue;
293 
294       bool can_coalesce = true;
295       for (int i = 0; i < src_size; i++) {
296          if (dst_reg_offset[i] != dst_reg_offset[0] + i) {
297             /* Registers are out-of-order. */
298             can_coalesce = false;
299             src_reg = ~0u;
300             break;
301          }
302 
303          dst_var[i] = live.var_from_vgrf[dst_reg] + dst_reg_offset[i];
304          src_var[i] = live.var_from_vgrf[src_reg] + i;
305 
306          if (!can_coalesce_vars(live, s.cfg, block, inst, dst_var[i], src_var[i]) ||
307              would_violate_eot_restriction(s.alloc, s.cfg, dst_reg, src_reg)) {
308             can_coalesce = false;
309             src_reg = ~0u;
310             break;
311          }
312       }
313 
314       if (!can_coalesce)
315          continue;
316 
317       progress = true;
318 
319       for (int i = 0; i < src_size; i++) {
320          if (!mov[i])
321             continue;
322 
323          if (mov[i]->conditional_mod == BRW_CONDITIONAL_NONE) {
324             mov[i]->opcode = BRW_OPCODE_NOP;
325             mov[i]->dst = reg_undef;
326             for (int j = 0; j < mov[i]->sources; j++) {
327                mov[i]->src[j] = reg_undef;
328             }
329          } else {
330             /* If we have a conditional modifier, rewrite the MOV to be a
331              * MOV.cmod from the coalesced register.  Hopefully, cmod
332              * propagation will clean this up and move it to the instruction
333              * that writes the register.  If not, this keeps things correct
334              * while still letting us coalesce.
335              */
336             assert(mov[i]->opcode == BRW_OPCODE_MOV);
337             assert(mov[i]->sources == 1);
338             mov[i]->src[0] = mov[i]->dst;
339             mov[i]->dst = retype(brw_null_reg(), mov[i]->dst.type);
340          }
341       }
342 
343       foreach_block_and_inst(block, fs_inst, scan_inst, s.cfg) {
344          if (scan_inst->dst.file == VGRF &&
345              scan_inst->dst.nr == src_reg) {
346             scan_inst->dst.nr = dst_reg;
347             scan_inst->dst.offset = scan_inst->dst.offset % REG_SIZE +
348                dst_reg_offset[scan_inst->dst.offset / REG_SIZE] * REG_SIZE;
349          }
350 
351          for (int j = 0; j < scan_inst->sources; j++) {
352             if (scan_inst->src[j].file == VGRF &&
353                 scan_inst->src[j].nr == src_reg) {
354                scan_inst->src[j].nr = dst_reg;
355                scan_inst->src[j].offset = scan_inst->src[j].offset % REG_SIZE +
356                   dst_reg_offset[scan_inst->src[j].offset / REG_SIZE] * REG_SIZE;
357             }
358          }
359       }
360 
361       for (int i = 0; i < src_size; i++) {
362          live.start[dst_var[i]] = MIN2(live.start[dst_var[i]],
363                                        live.start[src_var[i]]);
364          live.end[dst_var[i]] = MAX2(live.end[dst_var[i]],
365                                      live.end[src_var[i]]);
366       }
367       src_reg = ~0u;
368    }
369 
370    if (progress) {
371       foreach_block_and_inst_safe (block, fs_inst, inst, s.cfg) {
372          if (inst->opcode == BRW_OPCODE_NOP) {
373             inst->remove(block, true);
374          }
375       }
376 
377       s.cfg->adjust_block_ips();
378 
379       s.invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
380    }
381 
382    delete[] src_var;
383    delete[] dst_var;
384    delete[] mov;
385    delete[] dst_reg_offset;
386 
387    return progress;
388 }
389