3 * Copyright © 2010-2015 Intel Corporation
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice (including the next
13 * paragraph) shall be included in all copies or substantial portions of the
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
28 #include "brw_shader.h"
32 class fs_reg
: public backend_reg
{
34 DECLARE_RALLOC_CXX_OPERATORS(fs_reg
)
39 fs_reg(struct ::brw_reg reg
);
40 fs_reg(enum brw_reg_file file
, int nr
);
41 fs_reg(enum brw_reg_file file
, int nr
, enum brw_reg_type type
);
43 bool equals(const fs_reg
&r
) const;
44 bool is_contiguous() const;
47 * Return the size in bytes of a single logical component of the
48 * register assuming the given execution width.
50 unsigned component_size(unsigned width
) const;
52 /** Smear a channel of the reg to all channels. */
53 fs_reg
&set_smear(unsigned subreg
);
55 /** Register region horizontal stride */
62 assert(reg
.file
!= IMM
);
63 reg
.negate
= !reg
.negate
;
68 retype(fs_reg reg
, enum brw_reg_type type
)
75 byte_offset(fs_reg reg
, unsigned delta
)
83 const unsigned reg_size
= (reg
.file
== UNIFORM
? 4 : REG_SIZE
);
84 const unsigned suboffset
= reg
.offset
% reg_size
+ delta
;
85 reg
.offset
+= ROUND_DOWN_TO(suboffset
, reg_size
);
86 reg
.offset
= ROUND_DOWN_TO(reg
.offset
, reg_size
) + suboffset
% reg_size
;
90 const unsigned suboffset
= reg
.offset
% REG_SIZE
+ delta
;
91 reg
.nr
+= suboffset
/ REG_SIZE
;
92 reg
.offset
= ROUND_DOWN_TO(reg
.offset
, REG_SIZE
) + suboffset
% REG_SIZE
;
97 const unsigned suboffset
= reg
.subnr
+ delta
;
98 reg
.nr
+= suboffset
/ REG_SIZE
;
99 reg
.subnr
= suboffset
% REG_SIZE
;
110 horiz_offset(const fs_reg
®
, unsigned delta
)
116 /* These only have a single component that is implicitly splatted. A
117 * horizontal offset should be a harmless no-op.
118 * XXX - Handle vector immediates correctly.
124 return byte_offset(reg
, delta
* reg
.stride
* type_sz(reg
.type
));
130 const unsigned stride
= reg
.hstride
? 1 << (reg
.hstride
- 1) : 0;
131 return byte_offset(reg
, delta
* stride
* type_sz(reg
.type
));
134 unreachable("Invalid register file");
138 offset(fs_reg reg
, unsigned width
, unsigned delta
)
149 return byte_offset(reg
, delta
* reg
.component_size(width
));
157 * Get the scalar channel of \p reg given by \p idx and replicate it to all
158 * channels of the result.
161 component(fs_reg reg
, unsigned idx
)
163 reg
= horiz_offset(reg
, idx
);
169 * Return an integer identifying the discrete address space a register is
170 * contained in. A register is by definition fully contained in the single
171 * reg_space it belongs to, so two registers with different reg_space ids are
172 * guaranteed not to overlap. Most register files are a single reg_space of
173 * its own, only the VGRF file is composed of multiple discrete address
174 * spaces, one for each VGRF allocation.
176 static inline uint32_t
177 reg_space(const fs_reg
&r
)
179 return r
.file
<< 16 | (r
.file
== VGRF
? r
.nr
: 0);
183 * Return the base offset in bytes of a register relative to the start of its
186 static inline unsigned
187 reg_offset(const fs_reg
&r
)
189 return (r
.file
== VGRF
|| r
.file
== IMM
? 0 : r
.nr
) *
190 (r
.file
== UNIFORM
? 4 : REG_SIZE
) + r
.offset
;
194 * Return whether the register region starting at \p r and spanning \p dr
195 * bytes could potentially overlap the register region starting at \p s and
196 * spanning \p ds bytes.
199 regions_overlap(const fs_reg
&r
, unsigned dr
, const fs_reg
&s
, unsigned ds
)
201 if (r
.file
== MRF
&& (r
.nr
& BRW_MRF_COMPR4
)) {
203 t
.nr
&= ~BRW_MRF_COMPR4
;
204 /* COMPR4 regions are translated by the hardware during decompression
205 * into two separate half-regions 4 MRFs apart from each other.
207 return regions_overlap(t
, dr
/ 2, s
, ds
) ||
208 regions_overlap(byte_offset(t
, 4 * REG_SIZE
), dr
/ 2, s
, ds
);
210 } else if (s
.file
== MRF
&& (s
.nr
& BRW_MRF_COMPR4
)) {
211 return regions_overlap(s
, ds
, r
, dr
);
214 return reg_space(r
) == reg_space(s
) &&
215 !(reg_offset(r
) + dr
<= reg_offset(s
) ||
216 reg_offset(s
) + ds
<= reg_offset(r
));
221 * Return whether the given register region is n-periodic, i.e. whether the
222 * original region remains invariant after shifting it by \p n scalar
226 is_periodic(const fs_reg
®
, unsigned n
)
228 if (reg
.file
== BAD_FILE
|| reg
.is_null()) {
231 } else if (reg
.file
== IMM
) {
232 const unsigned period
= (reg
.type
== BRW_REGISTER_TYPE_UV
||
233 reg
.type
== BRW_REGISTER_TYPE_V
? 8 :
234 reg
.type
== BRW_REGISTER_TYPE_VF
? 4 :
236 return n
% period
== 0;
238 } else if (reg
.file
== ARF
|| reg
.file
== FIXED_GRF
) {
239 const unsigned period
= (reg
.hstride
== 0 && reg
.vstride
== 0 ? 1 :
240 reg
.vstride
== 0 ? 1 << reg
.width
:
242 return n
% period
== 0;
245 return reg
.stride
== 0;
250 is_uniform(const fs_reg
®
)
252 return is_periodic(reg
, 1);
256 * Get the specified 8-component quarter of a register.
257 * XXX - Maybe come up with a less misleading name for this (e.g. quarter())?
260 half(const fs_reg
®
, unsigned idx
)
263 return horiz_offset(reg
, 8 * idx
);
267 * Reinterpret each channel of register \p reg as a vector of values of the
268 * given smaller type and take the i-th subcomponent from each.
271 subscript(fs_reg reg
, brw_reg_type type
, unsigned i
)
273 assert((i
+ 1) * type_sz(type
) <= type_sz(reg
.type
));
275 if (reg
.file
== ARF
|| reg
.file
== FIXED_GRF
) {
276 /* The stride is encoded inconsistently for fixed GRF and ARF registers
277 * as the log2 of the actual vertical and horizontal strides.
279 const int delta
= _mesa_logbase2(type_sz(reg
.type
)) -
280 _mesa_logbase2(type_sz(type
));
281 reg
.hstride
+= (reg
.hstride
? delta
: 0);
282 reg
.vstride
+= (reg
.vstride
? delta
: 0);
284 } else if (reg
.file
== IMM
) {
285 assert(reg
.type
== type
);
288 reg
.stride
*= type_sz(reg
.type
) / type_sz(type
);
291 return byte_offset(retype(reg
, type
), i
* type_sz(type
));
294 static const fs_reg reg_undef
;
296 class fs_inst
: public backend_instruction
{
297 fs_inst
&operator=(const fs_inst
&);
299 void init(enum opcode opcode
, uint8_t exec_width
, const fs_reg
&dst
,
300 const fs_reg
*src
, unsigned sources
);
303 DECLARE_RALLOC_CXX_OPERATORS(fs_inst
)
306 fs_inst(enum opcode opcode
, uint8_t exec_size
);
307 fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
);
308 fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
310 fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
311 const fs_reg
&src0
, const fs_reg
&src1
);
312 fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
313 const fs_reg
&src0
, const fs_reg
&src1
, const fs_reg
&src2
);
314 fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
315 const fs_reg src
[], unsigned sources
);
316 fs_inst(const fs_inst
&that
);
319 void resize_sources(uint8_t num_sources
);
321 bool equals(fs_inst
*inst
) const;
322 bool overwrites_reg(const fs_reg
®
) const;
323 bool is_send_from_grf() const;
324 bool is_partial_write() const;
325 bool is_copy_payload(const brw::simple_allocator
&grf_alloc
) const;
326 unsigned components_read(unsigned i
) const;
327 int regs_read(int arg
) const;
328 bool can_do_source_mods(const struct gen_device_info
*devinfo
);
329 bool can_change_types() const;
330 bool has_side_effects() const;
331 bool has_source_and_destination_hazard() const;
334 * Return the subset of flag registers read by the instruction as a bitset
335 * with byte granularity.
337 unsigned flags_read(const gen_device_info
*devinfo
) const;
340 * Return the subset of flag registers updated by the instruction (either
341 * partially or fully) as a bitset with byte granularity.
343 unsigned flags_written() const;
348 uint8_t sources
; /**< Number of fs_reg sources. */
351 * Execution size of the instruction. This is used by the generator to
352 * generate the correct binary for the given fs_inst. Current valid
353 * values are 1, 8, 16.
358 * Channel group from the hardware execution and predication mask that
359 * should be applied to the instruction. The subset of channel enable
360 * signals (calculated from the EU control flow and predication state)
361 * given by [group, group + exec_size) will be used to mask GRF writes and
362 * any other side effects of the instruction.
367 bool pi_noperspective
:1; /**< Pixel interpolator noperspective flag */
371 * Make the execution of \p inst dependent on the evaluation of a possibly
372 * inverted predicate.
374 static inline fs_inst
*
375 set_predicate_inv(enum brw_predicate pred
, bool inverse
,
378 inst
->predicate
= pred
;
379 inst
->predicate_inverse
= inverse
;
384 * Make the execution of \p inst dependent on the evaluation of a predicate.
386 static inline fs_inst
*
387 set_predicate(enum brw_predicate pred
, fs_inst
*inst
)
389 return set_predicate_inv(pred
, false, inst
);
393 * Write the result of evaluating the condition given by \p mod to a flag
396 static inline fs_inst
*
397 set_condmod(enum brw_conditional_mod mod
, fs_inst
*inst
)
399 inst
->conditional_mod
= mod
;
404 * Clamp the result of \p inst to the saturation range of its destination
407 static inline fs_inst
*
408 set_saturate(bool saturate
, fs_inst
*inst
)
410 inst
->saturate
= saturate
;