2 * Copyright © 2010 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
26 * This file drives the GLSL IR -> LIR translation, contains the
27 * optimizations on the LIR, and drives the generation of native code
31 #include <sys/types.h>
33 #include "util/hash_table.h"
34 #include "main/macros.h"
35 #include "main/shaderobj.h"
36 #include "main/fbobject.h"
37 #include "program/prog_parameter.h"
38 #include "program/prog_print.h"
39 #include "util/register_allocate.h"
40 #include "program/hash_table.h"
41 #include "brw_context.h"
46 #include "brw_dead_control_flow.h"
47 #include "main/uniforms.h"
48 #include "brw_fs_live_variables.h"
49 #include "glsl/glsl_types.h"
50 #include "program/sampler.h"
55 fs_inst::init(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
56 const fs_reg
*src
, unsigned sources
)
58 memset(this, 0, sizeof(*this));
60 this->src
= new fs_reg
[MAX2(sources
, 3)];
61 for (unsigned i
= 0; i
< sources
; i
++)
62 this->src
[i
] = src
[i
];
64 this->opcode
= opcode
;
66 this->sources
= sources
;
67 this->exec_size
= exec_size
;
69 assert(dst
.file
!= IMM
&& dst
.file
!= UNIFORM
);
71 /* If exec_size == 0, try to guess it from the registers. Since all
72 * manner of things may use hardware registers, we first try to guess
73 * based on GRF registers. If this fails, we will go ahead and take the
74 * width from the destination register.
76 if (this->exec_size
== 0) {
77 if (dst
.file
== GRF
) {
78 this->exec_size
= dst
.width
;
80 for (unsigned i
= 0; i
< sources
; ++i
) {
81 if (src
[i
].file
!= GRF
&& src
[i
].file
!= ATTR
)
84 if (this->exec_size
<= 1)
85 this->exec_size
= src
[i
].width
;
86 assert(src
[i
].width
== 1 || src
[i
].width
== this->exec_size
);
90 if (this->exec_size
== 0 && dst
.file
!= BAD_FILE
)
91 this->exec_size
= dst
.width
;
93 assert(this->exec_size
!= 0);
95 this->conditional_mod
= BRW_CONDITIONAL_NONE
;
97 /* This will be the case for almost all instructions. */
104 DIV_ROUND_UP(MAX2(dst
.width
* dst
.stride
, 1) * type_sz(dst
.type
), 32);
107 this->regs_written
= 0;
111 unreachable("Invalid destination register file");
113 unreachable("Invalid register file");
116 this->writes_accumulator
= false;
121 init(BRW_OPCODE_NOP
, 8, dst
, NULL
, 0);
124 fs_inst::fs_inst(enum opcode opcode
, uint8_t exec_size
)
126 init(opcode
, exec_size
, reg_undef
, NULL
, 0);
129 fs_inst::fs_inst(enum opcode opcode
, const fs_reg
&dst
)
131 init(opcode
, 0, dst
, NULL
, 0);
134 fs_inst::fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
137 const fs_reg src
[1] = { src0
};
138 init(opcode
, exec_size
, dst
, src
, 1);
141 fs_inst::fs_inst(enum opcode opcode
, const fs_reg
&dst
, const fs_reg
&src0
)
143 const fs_reg src
[1] = { src0
};
144 init(opcode
, 0, dst
, src
, 1);
147 fs_inst::fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
148 const fs_reg
&src0
, const fs_reg
&src1
)
150 const fs_reg src
[2] = { src0
, src1
};
151 init(opcode
, exec_size
, dst
, src
, 2);
154 fs_inst::fs_inst(enum opcode opcode
, const fs_reg
&dst
, const fs_reg
&src0
,
157 const fs_reg src
[2] = { src0
, src1
};
158 init(opcode
, 0, dst
, src
, 2);
161 fs_inst::fs_inst(enum opcode opcode
, uint8_t exec_size
, const fs_reg
&dst
,
162 const fs_reg
&src0
, const fs_reg
&src1
, const fs_reg
&src2
)
164 const fs_reg src
[3] = { src0
, src1
, src2
};
165 init(opcode
, exec_size
, dst
, src
, 3);
168 fs_inst::fs_inst(enum opcode opcode
, const fs_reg
&dst
, const fs_reg
&src0
,
169 const fs_reg
&src1
, const fs_reg
&src2
)
171 const fs_reg src
[3] = { src0
, src1
, src2
};
172 init(opcode
, 0, dst
, src
, 3);
175 fs_inst::fs_inst(enum opcode opcode
, const fs_reg
&dst
,
176 const fs_reg src
[], unsigned sources
)
178 init(opcode
, 0, dst
, src
, sources
);
181 fs_inst::fs_inst(enum opcode opcode
, uint8_t exec_width
, const fs_reg
&dst
,
182 const fs_reg src
[], unsigned sources
)
184 init(opcode
, exec_width
, dst
, src
, sources
);
187 fs_inst::fs_inst(const fs_inst
&that
)
189 memcpy(this, &that
, sizeof(that
));
191 this->src
= new fs_reg
[MAX2(that
.sources
, 3)];
193 for (unsigned i
= 0; i
< that
.sources
; i
++)
194 this->src
[i
] = that
.src
[i
];
203 fs_inst::resize_sources(uint8_t num_sources
)
205 if (this->sources
!= num_sources
) {
206 fs_reg
*src
= new fs_reg
[MAX2(num_sources
, 3)];
208 for (unsigned i
= 0; i
< MIN2(this->sources
, num_sources
); ++i
)
209 src
[i
] = this->src
[i
];
213 this->sources
= num_sources
;
218 fs_visitor::VARYING_PULL_CONSTANT_LOAD(const fs_builder
&bld
,
220 const fs_reg
&surf_index
,
221 const fs_reg
&varying_offset
,
222 uint32_t const_offset
)
224 /* We have our constant surface use a pitch of 4 bytes, so our index can
225 * be any component of a vector, and then we load 4 contiguous
226 * components starting from that.
228 * We break down the const_offset to a portion added to the variable
229 * offset and a portion done using reg_offset, which means that if you
230 * have GLSL using something like "uniform vec4 a[20]; gl_FragColor =
231 * a[i]", we'll temporarily generate 4 vec4 loads from offset i * 4, and
232 * CSE can later notice that those loads are all the same and eliminate
233 * the redundant ones.
235 fs_reg vec4_offset
= vgrf(glsl_type::int_type
);
236 bld
.ADD(vec4_offset
, varying_offset
, fs_reg(const_offset
& ~3));
239 if (devinfo
->gen
== 4 && dst
.width
== 8) {
240 /* Pre-gen5, we can either use a SIMD8 message that requires (header,
241 * u, v, r) as parameters, or we can just use the SIMD16 message
242 * consisting of (header, u). We choose the second, at the cost of a
243 * longer return length.
249 if (devinfo
->gen
>= 7)
250 op
= FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GEN7
;
252 op
= FS_OPCODE_VARYING_PULL_CONSTANT_LOAD
;
254 assert(dst
.width
% 8 == 0);
255 int regs_written
= 4 * (dst
.width
/ 8) * scale
;
256 fs_reg vec4_result
= fs_reg(GRF
, alloc
.allocate(regs_written
),
257 dst
.type
, dst
.width
);
258 fs_inst
*inst
= bld
.emit(op
, vec4_result
, surf_index
, vec4_offset
);
259 inst
->regs_written
= regs_written
;
261 if (devinfo
->gen
< 7) {
263 inst
->header_size
= 1;
264 if (devinfo
->gen
== 4)
267 inst
->mlen
= 1 + dispatch_width
/ 8;
270 bld
.MOV(dst
, offset(vec4_result
, bld
, (const_offset
& 3) * scale
));
274 * A helper for MOV generation for fixing up broken hardware SEND dependency
278 fs_visitor::DEP_RESOLVE_MOV(const fs_builder
&bld
, int grf
)
280 /* The caller always wants uncompressed to emit the minimal extra
281 * dependencies, and to avoid having to deal with aligning its regs to 2.
283 const fs_builder ubld
= bld
.annotate("send dependency resolve")
286 ubld
.MOV(ubld
.null_reg_f(), fs_reg(GRF
, grf
, BRW_REGISTER_TYPE_F
));
290 fs_inst::equals(fs_inst
*inst
) const
292 return (opcode
== inst
->opcode
&&
293 dst
.equals(inst
->dst
) &&
294 src
[0].equals(inst
->src
[0]) &&
295 src
[1].equals(inst
->src
[1]) &&
296 src
[2].equals(inst
->src
[2]) &&
297 saturate
== inst
->saturate
&&
298 predicate
== inst
->predicate
&&
299 conditional_mod
== inst
->conditional_mod
&&
300 mlen
== inst
->mlen
&&
301 base_mrf
== inst
->base_mrf
&&
302 target
== inst
->target
&&
304 header_size
== inst
->header_size
&&
305 shadow_compare
== inst
->shadow_compare
&&
306 exec_size
== inst
->exec_size
&&
307 offset
== inst
->offset
);
311 fs_inst::overwrites_reg(const fs_reg
®
) const
313 return reg
.in_range(dst
, regs_written
);
317 fs_inst::is_send_from_grf() const
320 case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GEN7
:
321 case SHADER_OPCODE_SHADER_TIME_ADD
:
322 case FS_OPCODE_INTERPOLATE_AT_CENTROID
:
323 case FS_OPCODE_INTERPOLATE_AT_SAMPLE
:
324 case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET
:
325 case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET
:
326 case SHADER_OPCODE_UNTYPED_ATOMIC
:
327 case SHADER_OPCODE_UNTYPED_SURFACE_READ
:
328 case SHADER_OPCODE_UNTYPED_SURFACE_WRITE
:
329 case SHADER_OPCODE_TYPED_ATOMIC
:
330 case SHADER_OPCODE_TYPED_SURFACE_READ
:
331 case SHADER_OPCODE_TYPED_SURFACE_WRITE
:
332 case SHADER_OPCODE_URB_WRITE_SIMD8
:
334 case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
:
335 return src
[1].file
== GRF
;
336 case FS_OPCODE_FB_WRITE
:
337 return src
[0].file
== GRF
;
340 return src
[0].file
== GRF
;
347 fs_inst::is_copy_payload(const brw::simple_allocator
&grf_alloc
) const
349 if (this->opcode
!= SHADER_OPCODE_LOAD_PAYLOAD
)
352 fs_reg reg
= this->src
[0];
353 if (reg
.file
!= GRF
|| reg
.reg_offset
!= 0 || reg
.stride
== 0)
356 if (grf_alloc
.sizes
[reg
.reg
] != this->regs_written
)
359 for (int i
= 0; i
< this->sources
; i
++) {
360 reg
.type
= this->src
[i
].type
;
361 reg
.width
= this->src
[i
].width
;
362 if (!this->src
[i
].equals(reg
))
365 if (i
< this->header_size
) {
368 reg
.reg_offset
+= this->exec_size
/ 8;
376 fs_inst::can_do_source_mods(const struct brw_device_info
*devinfo
)
378 if (devinfo
->gen
== 6 && is_math())
381 if (is_send_from_grf())
384 if (!backend_instruction::can_do_source_mods())
391 fs_inst::has_side_effects() const
393 return this->eot
|| backend_instruction::has_side_effects();
399 memset(this, 0, sizeof(*this));
403 /** Generic unset register constructor. */
407 this->file
= BAD_FILE
;
410 /** Immediate value constructor. */
411 fs_reg::fs_reg(float f
)
415 this->type
= BRW_REGISTER_TYPE_F
;
416 this->fixed_hw_reg
.dw1
.f
= f
;
420 /** Immediate value constructor. */
421 fs_reg::fs_reg(int32_t i
)
425 this->type
= BRW_REGISTER_TYPE_D
;
426 this->fixed_hw_reg
.dw1
.d
= i
;
430 /** Immediate value constructor. */
431 fs_reg::fs_reg(uint32_t u
)
435 this->type
= BRW_REGISTER_TYPE_UD
;
436 this->fixed_hw_reg
.dw1
.ud
= u
;
440 /** Vector float immediate value constructor. */
441 fs_reg::fs_reg(uint8_t vf
[4])
445 this->type
= BRW_REGISTER_TYPE_VF
;
446 memcpy(&this->fixed_hw_reg
.dw1
.ud
, vf
, sizeof(unsigned));
449 /** Vector float immediate value constructor. */
450 fs_reg::fs_reg(uint8_t vf0
, uint8_t vf1
, uint8_t vf2
, uint8_t vf3
)
454 this->type
= BRW_REGISTER_TYPE_VF
;
455 this->fixed_hw_reg
.dw1
.ud
= (vf0
<< 0) |
461 /** Fixed brw_reg. */
462 fs_reg::fs_reg(struct brw_reg fixed_hw_reg
)
466 this->fixed_hw_reg
= fixed_hw_reg
;
467 this->type
= fixed_hw_reg
.type
;
468 this->width
= 1 << fixed_hw_reg
.width
;
472 fs_reg::equals(const fs_reg
&r
) const
474 return (file
== r
.file
&&
476 reg_offset
== r
.reg_offset
&&
477 subreg_offset
== r
.subreg_offset
&&
479 negate
== r
.negate
&&
481 !reladdr
&& !r
.reladdr
&&
482 memcmp(&fixed_hw_reg
, &r
.fixed_hw_reg
, sizeof(fixed_hw_reg
)) == 0 &&
488 fs_reg::set_smear(unsigned subreg
)
490 assert(file
!= HW_REG
&& file
!= IMM
);
491 subreg_offset
= subreg
* type_sz(type
);
497 fs_reg::is_contiguous() const
503 fs_visitor::type_size(const struct glsl_type
*type
)
505 unsigned int size
, i
;
507 switch (type
->base_type
) {
510 case GLSL_TYPE_FLOAT
:
512 return type
->components();
513 case GLSL_TYPE_ARRAY
:
514 return type_size(type
->fields
.array
) * type
->length
;
515 case GLSL_TYPE_STRUCT
:
517 for (i
= 0; i
< type
->length
; i
++) {
518 size
+= type_size(type
->fields
.structure
[i
].type
);
521 case GLSL_TYPE_SAMPLER
:
522 /* Samplers take up no register space, since they're baked in at
526 case GLSL_TYPE_ATOMIC_UINT
:
528 case GLSL_TYPE_IMAGE
:
530 case GLSL_TYPE_ERROR
:
531 case GLSL_TYPE_INTERFACE
:
532 case GLSL_TYPE_DOUBLE
:
533 unreachable("not reached");
540 * Create a MOV to read the timestamp register.
542 * The caller is responsible for emitting the MOV. The return value is
543 * the destination of the MOV, with extra parameters set.
546 fs_visitor::get_timestamp(const fs_builder
&bld
)
548 assert(devinfo
->gen
>= 7);
550 fs_reg ts
= fs_reg(retype(brw_vec4_reg(BRW_ARCHITECTURE_REGISTER_FILE
,
553 BRW_REGISTER_TYPE_UD
));
555 fs_reg dst
= fs_reg(GRF
, alloc
.allocate(1), BRW_REGISTER_TYPE_UD
, 4);
557 /* We want to read the 3 fields we care about even if it's not enabled in
560 bld
.group(4, 0).exec_all().MOV(dst
, ts
);
562 /* The caller wants the low 32 bits of the timestamp. Since it's running
563 * at the GPU clock rate of ~1.2ghz, it will roll over every ~3 seconds,
564 * which is plenty of time for our purposes. It is identical across the
565 * EUs, but since it's tracking GPU core speed it will increment at a
566 * varying rate as render P-states change.
568 * The caller could also check if render P-states have changed (or anything
569 * else that might disrupt timing) by setting smear to 2 and checking if
570 * that field is != 0.
578 fs_visitor::emit_shader_time_begin()
580 shader_start_time
= get_timestamp(bld
.annotate("shader time start"));
584 fs_visitor::emit_shader_time_end()
586 /* Insert our code just before the final SEND with EOT. */
587 exec_node
*end
= this->instructions
.get_tail();
588 assert(end
&& ((fs_inst
*) end
)->eot
);
589 const fs_builder ibld
= bld
.annotate("shader time end")
590 .exec_all().at(NULL
, end
);
592 fs_reg shader_end_time
= get_timestamp(ibld
);
594 /* Check that there weren't any timestamp reset events (assuming these
595 * were the only two timestamp reads that happened).
597 fs_reg reset
= shader_end_time
;
599 set_condmod(BRW_CONDITIONAL_Z
,
600 ibld
.AND(ibld
.null_reg_ud(), reset
, fs_reg(1u)));
601 ibld
.IF(BRW_PREDICATE_NORMAL
);
603 fs_reg start
= shader_start_time
;
605 fs_reg diff
= fs_reg(GRF
, alloc
.allocate(1), BRW_REGISTER_TYPE_UD
, 1);
608 const fs_builder cbld
= ibld
.group(1, 0);
609 cbld
.group(1, 0).ADD(diff
, start
, shader_end_time
);
611 /* If there were no instructions between the two timestamp gets, the diff
612 * is 2 cycles. Remove that overhead, so I can forget about that when
613 * trying to determine the time taken for single instructions.
615 cbld
.ADD(diff
, diff
, fs_reg(-2u));
616 SHADER_TIME_ADD(cbld
, 0, diff
);
617 SHADER_TIME_ADD(cbld
, 1, fs_reg(1u));
618 ibld
.emit(BRW_OPCODE_ELSE
);
619 SHADER_TIME_ADD(cbld
, 2, fs_reg(1u));
620 ibld
.emit(BRW_OPCODE_ENDIF
);
624 fs_visitor::SHADER_TIME_ADD(const fs_builder
&bld
,
625 int shader_time_subindex
,
628 int index
= shader_time_index
* 3 + shader_time_subindex
;
629 fs_reg offset
= fs_reg(index
* SHADER_TIME_STRIDE
);
632 if (dispatch_width
== 8)
633 payload
= vgrf(glsl_type::uvec2_type
);
635 payload
= vgrf(glsl_type::uint_type
);
637 bld
.emit(SHADER_OPCODE_SHADER_TIME_ADD
, fs_reg(), payload
, offset
, value
);
641 fs_visitor::vfail(const char *format
, va_list va
)
650 msg
= ralloc_vasprintf(mem_ctx
, format
, va
);
651 msg
= ralloc_asprintf(mem_ctx
, "%s compile failed: %s\n", stage_abbrev
, msg
);
653 this->fail_msg
= msg
;
656 fprintf(stderr
, "%s", msg
);
661 fs_visitor::fail(const char *format
, ...)
665 va_start(va
, format
);
671 * Mark this program as impossible to compile in SIMD16 mode.
673 * During the SIMD8 compile (which happens first), we can detect and flag
674 * things that are unsupported in SIMD16 mode, so the compiler can skip
675 * the SIMD16 compile altogether.
677 * During a SIMD16 compile (if one happens anyway), this just calls fail().
680 fs_visitor::no16(const char *msg
)
682 if (dispatch_width
== 16) {
685 simd16_unsupported
= true;
687 compiler
->shader_perf_log(log_data
,
688 "SIMD16 shader failed to compile: %s", msg
);
693 * Returns true if the instruction has a flag that means it won't
694 * update an entire destination register.
696 * For example, dead code elimination and live variable analysis want to know
697 * when a write to a variable screens off any preceding values that were in
701 fs_inst::is_partial_write() const
703 return ((this->predicate
&& this->opcode
!= BRW_OPCODE_SEL
) ||
704 (this->dst
.width
* type_sz(this->dst
.type
)) < 32 ||
705 !this->dst
.is_contiguous());
709 fs_inst::regs_read(int arg
) const
711 unsigned components
= 1;
713 case FS_OPCODE_FB_WRITE
:
714 case SHADER_OPCODE_URB_WRITE_SIMD8
:
715 case SHADER_OPCODE_UNTYPED_ATOMIC
:
716 case SHADER_OPCODE_UNTYPED_SURFACE_READ
:
717 case SHADER_OPCODE_UNTYPED_SURFACE_WRITE
:
718 case SHADER_OPCODE_TYPED_ATOMIC
:
719 case SHADER_OPCODE_TYPED_SURFACE_READ
:
720 case SHADER_OPCODE_TYPED_SURFACE_WRITE
:
721 case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET
:
726 case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GEN7
:
727 /* The payload is actually stored in src1 */
732 case FS_OPCODE_LINTERP
:
734 return exec_size
/ 4;
737 case FS_OPCODE_PIXEL_X
:
738 case FS_OPCODE_PIXEL_Y
:
743 case SHADER_OPCODE_LOAD_PAYLOAD
:
744 if (arg
< this->header_size
)
749 if (is_tex() && arg
== 0 && src
[0].file
== GRF
)
754 switch (src
[arg
].file
) {
761 if (src
[arg
].stride
== 0) {
764 int size
= components
* src
[arg
].width
* type_sz(src
[arg
].type
);
765 return DIV_ROUND_UP(size
* src
[arg
].stride
, 32);
768 unreachable("MRF registers are not allowed as sources");
770 unreachable("Invalid register file");
775 fs_inst::reads_flag() const
781 fs_inst::writes_flag() const
783 return (conditional_mod
&& (opcode
!= BRW_OPCODE_SEL
&&
784 opcode
!= BRW_OPCODE_IF
&&
785 opcode
!= BRW_OPCODE_WHILE
)) ||
786 opcode
== FS_OPCODE_MOV_DISPATCH_TO_FLAGS
;
790 * Returns how many MRFs an FS opcode will write over.
792 * Note that this is not the 0 or 1 implied writes in an actual gen
793 * instruction -- the FS opcodes often generate MOVs in addition.
796 fs_visitor::implied_mrf_writes(fs_inst
*inst
)
801 if (inst
->base_mrf
== -1)
804 switch (inst
->opcode
) {
805 case SHADER_OPCODE_RCP
:
806 case SHADER_OPCODE_RSQ
:
807 case SHADER_OPCODE_SQRT
:
808 case SHADER_OPCODE_EXP2
:
809 case SHADER_OPCODE_LOG2
:
810 case SHADER_OPCODE_SIN
:
811 case SHADER_OPCODE_COS
:
812 return 1 * dispatch_width
/ 8;
813 case SHADER_OPCODE_POW
:
814 case SHADER_OPCODE_INT_QUOTIENT
:
815 case SHADER_OPCODE_INT_REMAINDER
:
816 return 2 * dispatch_width
/ 8;
817 case SHADER_OPCODE_TEX
:
819 case SHADER_OPCODE_TXD
:
820 case SHADER_OPCODE_TXF
:
821 case SHADER_OPCODE_TXF_CMS
:
822 case SHADER_OPCODE_TXF_MCS
:
823 case SHADER_OPCODE_TG4
:
824 case SHADER_OPCODE_TG4_OFFSET
:
825 case SHADER_OPCODE_TXL
:
826 case SHADER_OPCODE_TXS
:
827 case SHADER_OPCODE_LOD
:
829 case FS_OPCODE_FB_WRITE
:
831 case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
:
832 case SHADER_OPCODE_GEN4_SCRATCH_READ
:
834 case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD
:
836 case SHADER_OPCODE_GEN4_SCRATCH_WRITE
:
838 case SHADER_OPCODE_UNTYPED_ATOMIC
:
839 case SHADER_OPCODE_UNTYPED_SURFACE_READ
:
840 case SHADER_OPCODE_UNTYPED_SURFACE_WRITE
:
841 case SHADER_OPCODE_TYPED_ATOMIC
:
842 case SHADER_OPCODE_TYPED_SURFACE_READ
:
843 case SHADER_OPCODE_TYPED_SURFACE_WRITE
:
844 case SHADER_OPCODE_URB_WRITE_SIMD8
:
845 case FS_OPCODE_INTERPOLATE_AT_CENTROID
:
846 case FS_OPCODE_INTERPOLATE_AT_SAMPLE
:
847 case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET
:
848 case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET
:
851 unreachable("not reached");
856 fs_visitor::vgrf(const glsl_type
*const type
)
858 int reg_width
= dispatch_width
/ 8;
859 return fs_reg(GRF
, alloc
.allocate(type_size(type
) * reg_width
),
860 brw_type_for_base_type(type
), dispatch_width
);
863 /** Fixed HW reg constructor. */
864 fs_reg::fs_reg(enum register_file file
, int reg
)
869 this->type
= BRW_REGISTER_TYPE_F
;
880 /** Fixed HW reg constructor. */
881 fs_reg::fs_reg(enum register_file file
, int reg
, enum brw_reg_type type
)
897 /** Fixed HW reg constructor. */
898 fs_reg::fs_reg(enum register_file file
, int reg
, enum brw_reg_type type
,
908 /* For SIMD16, we need to follow from the uniform setup of SIMD8 dispatch.
909 * This brings in those uniform definitions
912 fs_visitor::import_uniforms(fs_visitor
*v
)
914 this->push_constant_loc
= v
->push_constant_loc
;
915 this->pull_constant_loc
= v
->pull_constant_loc
;
916 this->uniforms
= v
->uniforms
;
917 this->param_size
= v
->param_size
;
921 fs_visitor::emit_fragcoord_interpolation(bool pixel_center_integer
,
922 bool origin_upper_left
)
924 assert(stage
== MESA_SHADER_FRAGMENT
);
925 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
926 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(vgrf(glsl_type::vec4_type
));
928 bool flip
= !origin_upper_left
^ key
->render_to_fbo
;
931 if (pixel_center_integer
) {
932 bld
.MOV(wpos
, this->pixel_x
);
934 bld
.ADD(wpos
, this->pixel_x
, fs_reg(0.5f
));
936 wpos
= offset(wpos
, bld
, 1);
939 if (!flip
&& pixel_center_integer
) {
940 bld
.MOV(wpos
, this->pixel_y
);
942 fs_reg pixel_y
= this->pixel_y
;
943 float offset
= (pixel_center_integer
? 0.0 : 0.5);
946 pixel_y
.negate
= true;
947 offset
+= key
->drawable_height
- 1.0;
950 bld
.ADD(wpos
, pixel_y
, fs_reg(offset
));
952 wpos
= offset(wpos
, bld
, 1);
955 if (devinfo
->gen
>= 6) {
956 bld
.MOV(wpos
, fs_reg(brw_vec8_grf(payload
.source_depth_reg
, 0)));
958 bld
.emit(FS_OPCODE_LINTERP
, wpos
,
959 this->delta_xy
[BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
],
960 interp_reg(VARYING_SLOT_POS
, 2));
962 wpos
= offset(wpos
, bld
, 1);
964 /* gl_FragCoord.w: Already set up in emit_interpolation */
965 bld
.MOV(wpos
, this->wpos_w
);
971 fs_visitor::emit_linterp(const fs_reg
&attr
, const fs_reg
&interp
,
972 glsl_interp_qualifier interpolation_mode
,
973 bool is_centroid
, bool is_sample
)
975 brw_wm_barycentric_interp_mode barycoord_mode
;
976 if (devinfo
->gen
>= 6) {
978 if (interpolation_mode
== INTERP_QUALIFIER_SMOOTH
)
979 barycoord_mode
= BRW_WM_PERSPECTIVE_CENTROID_BARYCENTRIC
;
981 barycoord_mode
= BRW_WM_NONPERSPECTIVE_CENTROID_BARYCENTRIC
;
982 } else if (is_sample
) {
983 if (interpolation_mode
== INTERP_QUALIFIER_SMOOTH
)
984 barycoord_mode
= BRW_WM_PERSPECTIVE_SAMPLE_BARYCENTRIC
;
986 barycoord_mode
= BRW_WM_NONPERSPECTIVE_SAMPLE_BARYCENTRIC
;
988 if (interpolation_mode
== INTERP_QUALIFIER_SMOOTH
)
989 barycoord_mode
= BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
;
991 barycoord_mode
= BRW_WM_NONPERSPECTIVE_PIXEL_BARYCENTRIC
;
994 /* On Ironlake and below, there is only one interpolation mode.
995 * Centroid interpolation doesn't mean anything on this hardware --
996 * there is no multisampling.
998 barycoord_mode
= BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
;
1000 return bld
.emit(FS_OPCODE_LINTERP
, attr
,
1001 this->delta_xy
[barycoord_mode
], interp
);
1005 fs_visitor::emit_general_interpolation(fs_reg attr
, const char *name
,
1006 const glsl_type
*type
,
1007 glsl_interp_qualifier interpolation_mode
,
1008 int location
, bool mod_centroid
,
1011 attr
.type
= brw_type_for_base_type(type
->get_scalar_type());
1013 assert(stage
== MESA_SHADER_FRAGMENT
);
1014 brw_wm_prog_data
*prog_data
= (brw_wm_prog_data
*) this->prog_data
;
1015 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
1017 unsigned int array_elements
;
1019 if (type
->is_array()) {
1020 array_elements
= type
->length
;
1021 if (array_elements
== 0) {
1022 fail("dereferenced array '%s' has length 0\n", name
);
1024 type
= type
->fields
.array
;
1029 if (interpolation_mode
== INTERP_QUALIFIER_NONE
) {
1031 location
== VARYING_SLOT_COL0
|| location
== VARYING_SLOT_COL1
;
1032 if (key
->flat_shade
&& is_gl_Color
) {
1033 interpolation_mode
= INTERP_QUALIFIER_FLAT
;
1035 interpolation_mode
= INTERP_QUALIFIER_SMOOTH
;
1039 for (unsigned int i
= 0; i
< array_elements
; i
++) {
1040 for (unsigned int j
= 0; j
< type
->matrix_columns
; j
++) {
1041 if (prog_data
->urb_setup
[location
] == -1) {
1042 /* If there's no incoming setup data for this slot, don't
1043 * emit interpolation for it.
1045 attr
= offset(attr
, bld
, type
->vector_elements
);
1050 if (interpolation_mode
== INTERP_QUALIFIER_FLAT
) {
1051 /* Constant interpolation (flat shading) case. The SF has
1052 * handed us defined values in only the constant offset
1053 * field of the setup reg.
1055 for (unsigned int k
= 0; k
< type
->vector_elements
; k
++) {
1056 struct brw_reg interp
= interp_reg(location
, k
);
1057 interp
= suboffset(interp
, 3);
1058 interp
.type
= attr
.type
;
1059 bld
.emit(FS_OPCODE_CINTERP
, attr
, fs_reg(interp
));
1060 attr
= offset(attr
, bld
, 1);
1063 /* Smooth/noperspective interpolation case. */
1064 for (unsigned int k
= 0; k
< type
->vector_elements
; k
++) {
1065 struct brw_reg interp
= interp_reg(location
, k
);
1066 if (devinfo
->needs_unlit_centroid_workaround
&& mod_centroid
) {
1067 /* Get the pixel/sample mask into f0 so that we know
1068 * which pixels are lit. Then, for each channel that is
1069 * unlit, replace the centroid data with non-centroid
1072 bld
.emit(FS_OPCODE_MOV_DISPATCH_TO_FLAGS
);
1075 inst
= emit_linterp(attr
, fs_reg(interp
), interpolation_mode
,
1077 inst
->predicate
= BRW_PREDICATE_NORMAL
;
1078 inst
->predicate_inverse
= true;
1079 if (devinfo
->has_pln
)
1080 inst
->no_dd_clear
= true;
1082 inst
= emit_linterp(attr
, fs_reg(interp
), interpolation_mode
,
1083 mod_centroid
&& !key
->persample_shading
,
1084 mod_sample
|| key
->persample_shading
);
1085 inst
->predicate
= BRW_PREDICATE_NORMAL
;
1086 inst
->predicate_inverse
= false;
1087 if (devinfo
->has_pln
)
1088 inst
->no_dd_check
= true;
1091 emit_linterp(attr
, fs_reg(interp
), interpolation_mode
,
1092 mod_centroid
&& !key
->persample_shading
,
1093 mod_sample
|| key
->persample_shading
);
1095 if (devinfo
->gen
< 6 && interpolation_mode
== INTERP_QUALIFIER_SMOOTH
) {
1096 bld
.MUL(attr
, attr
, this->pixel_w
);
1098 attr
= offset(attr
, bld
, 1);
1108 fs_visitor::emit_frontfacing_interpolation()
1110 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(vgrf(glsl_type::bool_type
));
1112 if (devinfo
->gen
>= 6) {
1113 /* Bit 15 of g0.0 is 0 if the polygon is front facing. We want to create
1114 * a boolean result from this (~0/true or 0/false).
1116 * We can use the fact that bit 15 is the MSB of g0.0:W to accomplish
1117 * this task in only one instruction:
1118 * - a negation source modifier will flip the bit; and
1119 * - a W -> D type conversion will sign extend the bit into the high
1120 * word of the destination.
1122 * An ASR 15 fills the low word of the destination.
1124 fs_reg g0
= fs_reg(retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_W
));
1127 bld
.ASR(*reg
, g0
, fs_reg(15));
1129 /* Bit 31 of g1.6 is 0 if the polygon is front facing. We want to create
1130 * a boolean result from this (1/true or 0/false).
1132 * Like in the above case, since the bit is the MSB of g1.6:UD we can use
1133 * the negation source modifier to flip it. Unfortunately the SHR
1134 * instruction only operates on UD (or D with an abs source modifier)
1135 * sources without negation.
1137 * Instead, use ASR (which will give ~0/true or 0/false).
1139 fs_reg g1_6
= fs_reg(retype(brw_vec1_grf(1, 6), BRW_REGISTER_TYPE_D
));
1142 bld
.ASR(*reg
, g1_6
, fs_reg(31));
1149 fs_visitor::compute_sample_position(fs_reg dst
, fs_reg int_sample_pos
)
1151 assert(stage
== MESA_SHADER_FRAGMENT
);
1152 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
1153 assert(dst
.type
== BRW_REGISTER_TYPE_F
);
1155 if (key
->compute_pos_offset
) {
1156 /* Convert int_sample_pos to floating point */
1157 bld
.MOV(dst
, int_sample_pos
);
1158 /* Scale to the range [0, 1] */
1159 bld
.MUL(dst
, dst
, fs_reg(1 / 16.0f
));
1162 /* From ARB_sample_shading specification:
1163 * "When rendering to a non-multisample buffer, or if multisample
1164 * rasterization is disabled, gl_SamplePosition will always be
1167 bld
.MOV(dst
, fs_reg(0.5f
));
1172 fs_visitor::emit_samplepos_setup()
1174 assert(devinfo
->gen
>= 6);
1176 const fs_builder abld
= bld
.annotate("compute sample position");
1177 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(vgrf(glsl_type::vec2_type
));
1179 fs_reg int_sample_x
= vgrf(glsl_type::int_type
);
1180 fs_reg int_sample_y
= vgrf(glsl_type::int_type
);
1182 /* WM will be run in MSDISPMODE_PERSAMPLE. So, only one of SIMD8 or SIMD16
1183 * mode will be enabled.
1185 * From the Ivy Bridge PRM, volume 2 part 1, page 344:
1186 * R31.1:0 Position Offset X/Y for Slot[3:0]
1187 * R31.3:2 Position Offset X/Y for Slot[7:4]
1190 * The X, Y sample positions come in as bytes in thread payload. So, read
1191 * the positions using vstride=16, width=8, hstride=2.
1193 struct brw_reg sample_pos_reg
=
1194 stride(retype(brw_vec1_grf(payload
.sample_pos_reg
, 0),
1195 BRW_REGISTER_TYPE_B
), 16, 8, 2);
1197 if (dispatch_width
== 8) {
1198 abld
.MOV(int_sample_x
, fs_reg(sample_pos_reg
));
1200 abld
.half(0).MOV(half(int_sample_x
, 0), fs_reg(sample_pos_reg
));
1201 abld
.half(1).MOV(half(int_sample_x
, 1),
1202 fs_reg(suboffset(sample_pos_reg
, 16)));
1204 /* Compute gl_SamplePosition.x */
1205 compute_sample_position(pos
, int_sample_x
);
1206 pos
= offset(pos
, abld
, 1);
1207 if (dispatch_width
== 8) {
1208 abld
.MOV(int_sample_y
, fs_reg(suboffset(sample_pos_reg
, 1)));
1210 abld
.half(0).MOV(half(int_sample_y
, 0),
1211 fs_reg(suboffset(sample_pos_reg
, 1)));
1212 abld
.half(1).MOV(half(int_sample_y
, 1),
1213 fs_reg(suboffset(sample_pos_reg
, 17)));
1215 /* Compute gl_SamplePosition.y */
1216 compute_sample_position(pos
, int_sample_y
);
1221 fs_visitor::emit_sampleid_setup()
1223 assert(stage
== MESA_SHADER_FRAGMENT
);
1224 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
1225 assert(devinfo
->gen
>= 6);
1227 const fs_builder abld
= bld
.annotate("compute sample id");
1228 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(vgrf(glsl_type::int_type
));
1230 if (key
->compute_sample_id
) {
1231 fs_reg t1
= vgrf(glsl_type::int_type
);
1232 fs_reg t2
= vgrf(glsl_type::int_type
);
1233 t2
.type
= BRW_REGISTER_TYPE_UW
;
1235 /* The PS will be run in MSDISPMODE_PERSAMPLE. For example with
1236 * 8x multisampling, subspan 0 will represent sample N (where N
1237 * is 0, 2, 4 or 6), subspan 1 will represent sample 1, 3, 5 or
1238 * 7. We can find the value of N by looking at R0.0 bits 7:6
1239 * ("Starting Sample Pair Index (SSPI)") and multiplying by two
1240 * (since samples are always delivered in pairs). That is, we
1241 * compute 2*((R0.0 & 0xc0) >> 6) == (R0.0 & 0xc0) >> 5. Then
1242 * we need to add N to the sequence (0, 0, 0, 0, 1, 1, 1, 1) in
1243 * case of SIMD8 and sequence (0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2,
1244 * 2, 3, 3, 3, 3) in case of SIMD16. We compute this sequence by
1245 * populating a temporary variable with the sequence (0, 1, 2, 3),
1246 * and then reading from it using vstride=1, width=4, hstride=0.
1247 * These computations hold good for 4x multisampling as well.
1249 * For 2x MSAA and SIMD16, we want to use the sequence (0, 1, 0, 1):
1250 * the first four slots are sample 0 of subspan 0; the next four
1251 * are sample 1 of subspan 0; the third group is sample 0 of
1252 * subspan 1, and finally sample 1 of subspan 1.
1255 .AND(t1
, fs_reg(retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_UD
)),
1257 abld
.exec_all().SHR(t1
, t1
, fs_reg(5));
1259 /* This works for both SIMD8 and SIMD16 */
1261 .MOV(t2
, brw_imm_v(key
->persample_2x
? 0x1010 : 0x3210));
1263 /* This special instruction takes care of setting vstride=1,
1264 * width=4, hstride=0 of t2 during an ADD instruction.
1266 abld
.emit(FS_OPCODE_SET_SAMPLE_ID
, *reg
, t1
, t2
);
1268 /* As per GL_ARB_sample_shading specification:
1269 * "When rendering to a non-multisample buffer, or if multisample
1270 * rasterization is disabled, gl_SampleID will always be zero."
1272 abld
.MOV(*reg
, fs_reg(0));
1279 fs_visitor::resolve_source_modifiers(fs_reg
*src
)
1281 if (!src
->abs
&& !src
->negate
)
1284 fs_reg temp
= bld
.vgrf(src
->type
);
1285 bld
.MOV(temp
, *src
);
1290 fs_visitor::emit_discard_jump()
1292 assert(((brw_wm_prog_data
*) this->prog_data
)->uses_kill
);
1294 /* For performance, after a discard, jump to the end of the
1295 * shader if all relevant channels have been discarded.
1297 fs_inst
*discard_jump
= bld
.emit(FS_OPCODE_DISCARD_JUMP
);
1298 discard_jump
->flag_subreg
= 1;
1300 discard_jump
->predicate
= (dispatch_width
== 8)
1301 ? BRW_PREDICATE_ALIGN1_ANY8H
1302 : BRW_PREDICATE_ALIGN1_ANY16H
;
1303 discard_jump
->predicate_inverse
= true;
1307 fs_visitor::assign_curb_setup()
1309 if (dispatch_width
== 8) {
1310 prog_data
->dispatch_grf_start_reg
= payload
.num_regs
;
1312 if (stage
== MESA_SHADER_FRAGMENT
) {
1313 brw_wm_prog_data
*prog_data
= (brw_wm_prog_data
*) this->prog_data
;
1314 prog_data
->dispatch_grf_start_reg_16
= payload
.num_regs
;
1315 } else if (stage
== MESA_SHADER_COMPUTE
) {
1316 brw_cs_prog_data
*prog_data
= (brw_cs_prog_data
*) this->prog_data
;
1317 prog_data
->dispatch_grf_start_reg_16
= payload
.num_regs
;
1319 unreachable("Unsupported shader type!");
1323 prog_data
->curb_read_length
= ALIGN(stage_prog_data
->nr_params
, 8) / 8;
1325 /* Map the offsets in the UNIFORM file to fixed HW regs. */
1326 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1327 for (unsigned int i
= 0; i
< inst
->sources
; i
++) {
1328 if (inst
->src
[i
].file
== UNIFORM
) {
1329 int uniform_nr
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
;
1331 if (uniform_nr
>= 0 && uniform_nr
< (int) uniforms
) {
1332 constant_nr
= push_constant_loc
[uniform_nr
];
1334 /* Section 5.11 of the OpenGL 4.1 spec says:
1335 * "Out-of-bounds reads return undefined values, which include
1336 * values from other variables of the active program or zero."
1337 * Just return the first push constant.
1342 struct brw_reg brw_reg
= brw_vec1_grf(payload
.num_regs
+
1346 inst
->src
[i
].file
= HW_REG
;
1347 inst
->src
[i
].fixed_hw_reg
= byte_offset(
1348 retype(brw_reg
, inst
->src
[i
].type
),
1349 inst
->src
[i
].subreg_offset
);
1356 fs_visitor::calculate_urb_setup()
1358 assert(stage
== MESA_SHADER_FRAGMENT
);
1359 brw_wm_prog_data
*prog_data
= (brw_wm_prog_data
*) this->prog_data
;
1360 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
1362 memset(prog_data
->urb_setup
, -1,
1363 sizeof(prog_data
->urb_setup
[0]) * VARYING_SLOT_MAX
);
1366 /* Figure out where each of the incoming setup attributes lands. */
1367 if (devinfo
->gen
>= 6) {
1368 if (_mesa_bitcount_64(prog
->InputsRead
&
1369 BRW_FS_VARYING_INPUT_MASK
) <= 16) {
1370 /* The SF/SBE pipeline stage can do arbitrary rearrangement of the
1371 * first 16 varying inputs, so we can put them wherever we want.
1372 * Just put them in order.
1374 * This is useful because it means that (a) inputs not used by the
1375 * fragment shader won't take up valuable register space, and (b) we
1376 * won't have to recompile the fragment shader if it gets paired with
1377 * a different vertex (or geometry) shader.
1379 for (unsigned int i
= 0; i
< VARYING_SLOT_MAX
; i
++) {
1380 if (prog
->InputsRead
& BRW_FS_VARYING_INPUT_MASK
&
1381 BITFIELD64_BIT(i
)) {
1382 prog_data
->urb_setup
[i
] = urb_next
++;
1386 /* We have enough input varyings that the SF/SBE pipeline stage can't
1387 * arbitrarily rearrange them to suit our whim; we have to put them
1388 * in an order that matches the output of the previous pipeline stage
1389 * (geometry or vertex shader).
1391 struct brw_vue_map prev_stage_vue_map
;
1392 brw_compute_vue_map(devinfo
, &prev_stage_vue_map
,
1393 key
->input_slots_valid
);
1394 int first_slot
= 2 * BRW_SF_URB_ENTRY_READ_OFFSET
;
1395 assert(prev_stage_vue_map
.num_slots
<= first_slot
+ 32);
1396 for (int slot
= first_slot
; slot
< prev_stage_vue_map
.num_slots
;
1398 int varying
= prev_stage_vue_map
.slot_to_varying
[slot
];
1399 /* Note that varying == BRW_VARYING_SLOT_COUNT when a slot is
1402 if (varying
!= BRW_VARYING_SLOT_COUNT
&&
1403 (prog
->InputsRead
& BRW_FS_VARYING_INPUT_MASK
&
1404 BITFIELD64_BIT(varying
))) {
1405 prog_data
->urb_setup
[varying
] = slot
- first_slot
;
1408 urb_next
= prev_stage_vue_map
.num_slots
- first_slot
;
1411 /* FINISHME: The sf doesn't map VS->FS inputs for us very well. */
1412 for (unsigned int i
= 0; i
< VARYING_SLOT_MAX
; i
++) {
1413 /* Point size is packed into the header, not as a general attribute */
1414 if (i
== VARYING_SLOT_PSIZ
)
1417 if (key
->input_slots_valid
& BITFIELD64_BIT(i
)) {
1418 /* The back color slot is skipped when the front color is
1419 * also written to. In addition, some slots can be
1420 * written in the vertex shader and not read in the
1421 * fragment shader. So the register number must always be
1422 * incremented, mapped or not.
1424 if (_mesa_varying_slot_in_fs((gl_varying_slot
) i
))
1425 prog_data
->urb_setup
[i
] = urb_next
;
1431 * It's a FS only attribute, and we did interpolation for this attribute
1432 * in SF thread. So, count it here, too.
1434 * See compile_sf_prog() for more info.
1436 if (prog
->InputsRead
& BITFIELD64_BIT(VARYING_SLOT_PNTC
))
1437 prog_data
->urb_setup
[VARYING_SLOT_PNTC
] = urb_next
++;
1440 prog_data
->num_varying_inputs
= urb_next
;
1444 fs_visitor::assign_urb_setup()
1446 assert(stage
== MESA_SHADER_FRAGMENT
);
1447 brw_wm_prog_data
*prog_data
= (brw_wm_prog_data
*) this->prog_data
;
1449 int urb_start
= payload
.num_regs
+ prog_data
->base
.curb_read_length
;
1451 /* Offset all the urb_setup[] index by the actual position of the
1452 * setup regs, now that the location of the constants has been chosen.
1454 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1455 if (inst
->opcode
== FS_OPCODE_LINTERP
) {
1456 assert(inst
->src
[1].file
== HW_REG
);
1457 inst
->src
[1].fixed_hw_reg
.nr
+= urb_start
;
1460 if (inst
->opcode
== FS_OPCODE_CINTERP
) {
1461 assert(inst
->src
[0].file
== HW_REG
);
1462 inst
->src
[0].fixed_hw_reg
.nr
+= urb_start
;
1466 /* Each attribute is 4 setup channels, each of which is half a reg. */
1467 this->first_non_payload_grf
=
1468 urb_start
+ prog_data
->num_varying_inputs
* 2;
1472 fs_visitor::assign_vs_urb_setup()
1474 brw_vs_prog_data
*vs_prog_data
= (brw_vs_prog_data
*) prog_data
;
1475 int grf
, count
, slot
, channel
, attr
;
1477 assert(stage
== MESA_SHADER_VERTEX
);
1478 count
= _mesa_bitcount_64(vs_prog_data
->inputs_read
);
1479 if (vs_prog_data
->uses_vertexid
|| vs_prog_data
->uses_instanceid
)
1482 /* Each attribute is 4 regs. */
1483 this->first_non_payload_grf
=
1484 payload
.num_regs
+ prog_data
->curb_read_length
+ count
* 4;
1486 unsigned vue_entries
=
1487 MAX2(count
, vs_prog_data
->base
.vue_map
.num_slots
);
1489 vs_prog_data
->base
.urb_entry_size
= ALIGN(vue_entries
, 4) / 4;
1490 vs_prog_data
->base
.urb_read_length
= (count
+ 1) / 2;
1492 assert(vs_prog_data
->base
.urb_read_length
<= 15);
1494 /* Rewrite all ATTR file references to the hw grf that they land in. */
1495 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1496 for (int i
= 0; i
< inst
->sources
; i
++) {
1497 if (inst
->src
[i
].file
== ATTR
) {
1499 if (inst
->src
[i
].reg
== VERT_ATTRIB_MAX
) {
1502 /* Attributes come in in a contiguous block, ordered by their
1503 * gl_vert_attrib value. That means we can compute the slot
1504 * number for an attribute by masking out the enabled
1505 * attributes before it and counting the bits.
1507 attr
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
/ 4;
1508 slot
= _mesa_bitcount_64(vs_prog_data
->inputs_read
&
1509 BITFIELD64_MASK(attr
));
1512 channel
= inst
->src
[i
].reg_offset
& 3;
1514 grf
= payload
.num_regs
+
1515 prog_data
->curb_read_length
+
1518 inst
->src
[i
].file
= HW_REG
;
1519 inst
->src
[i
].fixed_hw_reg
=
1520 retype(brw_vec8_grf(grf
, 0), inst
->src
[i
].type
);
1527 * Split large virtual GRFs into separate components if we can.
1529 * This is mostly duplicated with what brw_fs_vector_splitting does,
1530 * but that's really conservative because it's afraid of doing
1531 * splitting that doesn't result in real progress after the rest of
1532 * the optimization phases, which would cause infinite looping in
1533 * optimization. We can do it once here, safely. This also has the
1534 * opportunity to split interpolated values, or maybe even uniforms,
1535 * which we don't have at the IR level.
1537 * We want to split, because virtual GRFs are what we register
1538 * allocate and spill (due to contiguousness requirements for some
1539 * instructions), and they're what we naturally generate in the
1540 * codegen process, but most virtual GRFs don't actually need to be
1541 * contiguous sets of GRFs. If we split, we'll end up with reduced
1542 * live intervals and better dead code elimination and coalescing.
1545 fs_visitor::split_virtual_grfs()
1547 int num_vars
= this->alloc
.count
;
1549 /* Count the total number of registers */
1551 int vgrf_to_reg
[num_vars
];
1552 for (int i
= 0; i
< num_vars
; i
++) {
1553 vgrf_to_reg
[i
] = reg_count
;
1554 reg_count
+= alloc
.sizes
[i
];
1557 /* An array of "split points". For each register slot, this indicates
1558 * if this slot can be separated from the previous slot. Every time an
1559 * instruction uses multiple elements of a register (as a source or
1560 * destination), we mark the used slots as inseparable. Then we go
1561 * through and split the registers into the smallest pieces we can.
1563 bool split_points
[reg_count
];
1564 memset(split_points
, 0, sizeof(split_points
));
1566 /* Mark all used registers as fully splittable */
1567 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1568 if (inst
->dst
.file
== GRF
) {
1569 int reg
= vgrf_to_reg
[inst
->dst
.reg
];
1570 for (unsigned j
= 1; j
< this->alloc
.sizes
[inst
->dst
.reg
]; j
++)
1571 split_points
[reg
+ j
] = true;
1574 for (int i
= 0; i
< inst
->sources
; i
++) {
1575 if (inst
->src
[i
].file
== GRF
) {
1576 int reg
= vgrf_to_reg
[inst
->src
[i
].reg
];
1577 for (unsigned j
= 1; j
< this->alloc
.sizes
[inst
->src
[i
].reg
]; j
++)
1578 split_points
[reg
+ j
] = true;
1583 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1584 if (inst
->dst
.file
== GRF
) {
1585 int reg
= vgrf_to_reg
[inst
->dst
.reg
] + inst
->dst
.reg_offset
;
1586 for (int j
= 1; j
< inst
->regs_written
; j
++)
1587 split_points
[reg
+ j
] = false;
1589 for (int i
= 0; i
< inst
->sources
; i
++) {
1590 if (inst
->src
[i
].file
== GRF
) {
1591 int reg
= vgrf_to_reg
[inst
->src
[i
].reg
] + inst
->src
[i
].reg_offset
;
1592 for (int j
= 1; j
< inst
->regs_read(i
); j
++)
1593 split_points
[reg
+ j
] = false;
1598 int new_virtual_grf
[reg_count
];
1599 int new_reg_offset
[reg_count
];
1602 for (int i
= 0; i
< num_vars
; i
++) {
1603 /* The first one should always be 0 as a quick sanity check. */
1604 assert(split_points
[reg
] == false);
1607 new_reg_offset
[reg
] = 0;
1612 for (unsigned j
= 1; j
< alloc
.sizes
[i
]; j
++) {
1613 /* If this is a split point, reset the offset to 0 and allocate a
1614 * new virtual GRF for the previous offset many registers
1616 if (split_points
[reg
]) {
1617 assert(offset
<= MAX_VGRF_SIZE
);
1618 int grf
= alloc
.allocate(offset
);
1619 for (int k
= reg
- offset
; k
< reg
; k
++)
1620 new_virtual_grf
[k
] = grf
;
1623 new_reg_offset
[reg
] = offset
;
1628 /* The last one gets the original register number */
1629 assert(offset
<= MAX_VGRF_SIZE
);
1630 alloc
.sizes
[i
] = offset
;
1631 for (int k
= reg
- offset
; k
< reg
; k
++)
1632 new_virtual_grf
[k
] = i
;
1634 assert(reg
== reg_count
);
1636 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1637 if (inst
->dst
.file
== GRF
) {
1638 reg
= vgrf_to_reg
[inst
->dst
.reg
] + inst
->dst
.reg_offset
;
1639 inst
->dst
.reg
= new_virtual_grf
[reg
];
1640 inst
->dst
.reg_offset
= new_reg_offset
[reg
];
1641 assert((unsigned)new_reg_offset
[reg
] < alloc
.sizes
[new_virtual_grf
[reg
]]);
1643 for (int i
= 0; i
< inst
->sources
; i
++) {
1644 if (inst
->src
[i
].file
== GRF
) {
1645 reg
= vgrf_to_reg
[inst
->src
[i
].reg
] + inst
->src
[i
].reg_offset
;
1646 inst
->src
[i
].reg
= new_virtual_grf
[reg
];
1647 inst
->src
[i
].reg_offset
= new_reg_offset
[reg
];
1648 assert((unsigned)new_reg_offset
[reg
] < alloc
.sizes
[new_virtual_grf
[reg
]]);
1652 invalidate_live_intervals();
1656 * Remove unused virtual GRFs and compact the virtual_grf_* arrays.
1658 * During code generation, we create tons of temporary variables, many of
1659 * which get immediately killed and are never used again. Yet, in later
1660 * optimization and analysis passes, such as compute_live_intervals, we need
1661 * to loop over all the virtual GRFs. Compacting them can save a lot of
1665 fs_visitor::compact_virtual_grfs()
1667 bool progress
= false;
1668 int remap_table
[this->alloc
.count
];
1669 memset(remap_table
, -1, sizeof(remap_table
));
1671 /* Mark which virtual GRFs are used. */
1672 foreach_block_and_inst(block
, const fs_inst
, inst
, cfg
) {
1673 if (inst
->dst
.file
== GRF
)
1674 remap_table
[inst
->dst
.reg
] = 0;
1676 for (int i
= 0; i
< inst
->sources
; i
++) {
1677 if (inst
->src
[i
].file
== GRF
)
1678 remap_table
[inst
->src
[i
].reg
] = 0;
1682 /* Compact the GRF arrays. */
1684 for (unsigned i
= 0; i
< this->alloc
.count
; i
++) {
1685 if (remap_table
[i
] == -1) {
1686 /* We just found an unused register. This means that we are
1687 * actually going to compact something.
1691 remap_table
[i
] = new_index
;
1692 alloc
.sizes
[new_index
] = alloc
.sizes
[i
];
1693 invalidate_live_intervals();
1698 this->alloc
.count
= new_index
;
1700 /* Patch all the instructions to use the newly renumbered registers */
1701 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1702 if (inst
->dst
.file
== GRF
)
1703 inst
->dst
.reg
= remap_table
[inst
->dst
.reg
];
1705 for (int i
= 0; i
< inst
->sources
; i
++) {
1706 if (inst
->src
[i
].file
== GRF
)
1707 inst
->src
[i
].reg
= remap_table
[inst
->src
[i
].reg
];
1711 /* Patch all the references to delta_xy, since they're used in register
1712 * allocation. If they're unused, switch them to BAD_FILE so we don't
1713 * think some random VGRF is delta_xy.
1715 for (unsigned i
= 0; i
< ARRAY_SIZE(delta_xy
); i
++) {
1716 if (delta_xy
[i
].file
== GRF
) {
1717 if (remap_table
[delta_xy
[i
].reg
] != -1) {
1718 delta_xy
[i
].reg
= remap_table
[delta_xy
[i
].reg
];
1720 delta_xy
[i
].file
= BAD_FILE
;
1729 * Implements array access of uniforms by inserting a
1730 * PULL_CONSTANT_LOAD instruction.
1732 * Unlike temporary GRF array access (where we don't support it due to
1733 * the difficulty of doing relative addressing on instruction
1734 * destinations), we could potentially do array access of uniforms
1735 * that were loaded in GRF space as push constants. In real-world
1736 * usage we've seen, though, the arrays being used are always larger
1737 * than we could load as push constants, so just always move all
1738 * uniform array access out to a pull constant buffer.
1741 fs_visitor::move_uniform_array_access_to_pull_constants()
1743 if (dispatch_width
!= 8)
1746 pull_constant_loc
= ralloc_array(mem_ctx
, int, uniforms
);
1747 memset(pull_constant_loc
, -1, sizeof(pull_constant_loc
[0]) * uniforms
);
1749 /* Walk through and find array access of uniforms. Put a copy of that
1750 * uniform in the pull constant buffer.
1752 * Note that we don't move constant-indexed accesses to arrays. No
1753 * testing has been done of the performance impact of this choice.
1755 foreach_block_and_inst_safe(block
, fs_inst
, inst
, cfg
) {
1756 for (int i
= 0 ; i
< inst
->sources
; i
++) {
1757 if (inst
->src
[i
].file
!= UNIFORM
|| !inst
->src
[i
].reladdr
)
1760 int uniform
= inst
->src
[i
].reg
;
1762 /* If this array isn't already present in the pull constant buffer,
1765 if (pull_constant_loc
[uniform
] == -1) {
1766 const gl_constant_value
**values
= &stage_prog_data
->param
[uniform
];
1768 assert(param_size
[uniform
]);
1770 for (int j
= 0; j
< param_size
[uniform
]; j
++) {
1771 pull_constant_loc
[uniform
+ j
] = stage_prog_data
->nr_pull_params
;
1773 stage_prog_data
->pull_param
[stage_prog_data
->nr_pull_params
++] =
1782 * Assign UNIFORM file registers to either push constants or pull constants.
1784 * We allow a fragment shader to have more than the specified minimum
1785 * maximum number of fragment shader uniform components (64). If
1786 * there are too many of these, they'd fill up all of register space.
1787 * So, this will push some of them out to the pull constant buffer and
1788 * update the program to load them.
1791 fs_visitor::assign_constant_locations()
1793 /* Only the first compile (SIMD8 mode) gets to decide on locations. */
1794 if (dispatch_width
!= 8)
1797 /* Find which UNIFORM registers are still in use. */
1798 bool is_live
[uniforms
];
1799 for (unsigned int i
= 0; i
< uniforms
; i
++) {
1803 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1804 for (int i
= 0; i
< inst
->sources
; i
++) {
1805 if (inst
->src
[i
].file
!= UNIFORM
)
1808 int constant_nr
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
;
1809 if (constant_nr
>= 0 && constant_nr
< (int) uniforms
)
1810 is_live
[constant_nr
] = true;
1814 /* Only allow 16 registers (128 uniform components) as push constants.
1816 * Just demote the end of the list. We could probably do better
1817 * here, demoting things that are rarely used in the program first.
1819 * If changing this value, note the limitation about total_regs in
1822 unsigned int max_push_components
= 16 * 8;
1823 unsigned int num_push_constants
= 0;
1825 push_constant_loc
= ralloc_array(mem_ctx
, int, uniforms
);
1827 for (unsigned int i
= 0; i
< uniforms
; i
++) {
1828 if (!is_live
[i
] || pull_constant_loc
[i
] != -1) {
1829 /* This UNIFORM register is either dead, or has already been demoted
1830 * to a pull const. Mark it as no longer living in the param[] array.
1832 push_constant_loc
[i
] = -1;
1836 if (num_push_constants
< max_push_components
) {
1837 /* Retain as a push constant. Record the location in the params[]
1840 push_constant_loc
[i
] = num_push_constants
++;
1842 /* Demote to a pull constant. */
1843 push_constant_loc
[i
] = -1;
1845 int pull_index
= stage_prog_data
->nr_pull_params
++;
1846 stage_prog_data
->pull_param
[pull_index
] = stage_prog_data
->param
[i
];
1847 pull_constant_loc
[i
] = pull_index
;
1851 stage_prog_data
->nr_params
= num_push_constants
;
1853 /* Up until now, the param[] array has been indexed by reg + reg_offset
1854 * of UNIFORM registers. Condense it to only contain the uniforms we
1855 * chose to upload as push constants.
1857 for (unsigned int i
= 0; i
< uniforms
; i
++) {
1858 int remapped
= push_constant_loc
[i
];
1863 assert(remapped
<= (int)i
);
1864 stage_prog_data
->param
[remapped
] = stage_prog_data
->param
[i
];
1869 * Replace UNIFORM register file access with either UNIFORM_PULL_CONSTANT_LOAD
1870 * or VARYING_PULL_CONSTANT_LOAD instructions which load values into VGRFs.
1873 fs_visitor::demote_pull_constants()
1875 foreach_block_and_inst (block
, fs_inst
, inst
, cfg
) {
1876 for (int i
= 0; i
< inst
->sources
; i
++) {
1877 if (inst
->src
[i
].file
!= UNIFORM
)
1881 unsigned location
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
;
1882 if (location
>= uniforms
) /* Out of bounds access */
1885 pull_index
= pull_constant_loc
[location
];
1887 if (pull_index
== -1)
1890 /* Set up the annotation tracking for new generated instructions. */
1891 const fs_builder ibld
= bld
.annotate(inst
->annotation
, inst
->ir
)
1893 fs_reg
surf_index(stage_prog_data
->binding_table
.pull_constants_start
);
1894 fs_reg dst
= vgrf(glsl_type::float_type
);
1896 /* Generate a pull load into dst. */
1897 if (inst
->src
[i
].reladdr
) {
1898 VARYING_PULL_CONSTANT_LOAD(ibld
, dst
,
1900 *inst
->src
[i
].reladdr
,
1902 inst
->src
[i
].reladdr
= NULL
;
1904 fs_reg offset
= fs_reg((unsigned)(pull_index
* 4) & ~15);
1905 ibld
.emit(FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
,
1906 dst
, surf_index
, offset
);
1907 inst
->src
[i
].set_smear(pull_index
& 3);
1910 /* Rewrite the instruction to use the temporary VGRF. */
1911 inst
->src
[i
].file
= GRF
;
1912 inst
->src
[i
].reg
= dst
.reg
;
1913 inst
->src
[i
].reg_offset
= 0;
1914 inst
->src
[i
].width
= dispatch_width
;
1917 invalidate_live_intervals();
1921 fs_visitor::opt_algebraic()
1923 bool progress
= false;
1925 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
1926 switch (inst
->opcode
) {
1927 case BRW_OPCODE_MOV
:
1928 if (inst
->src
[0].file
!= IMM
)
1931 if (inst
->saturate
) {
1932 if (inst
->dst
.type
!= inst
->src
[0].type
)
1933 assert(!"unimplemented: saturate mixed types");
1935 if (brw_saturate_immediate(inst
->dst
.type
,
1936 &inst
->src
[0].fixed_hw_reg
)) {
1937 inst
->saturate
= false;
1943 case BRW_OPCODE_MUL
:
1944 if (inst
->src
[1].file
!= IMM
)
1948 if (inst
->src
[1].is_one()) {
1949 inst
->opcode
= BRW_OPCODE_MOV
;
1950 inst
->src
[1] = reg_undef
;
1956 if (inst
->src
[1].is_negative_one()) {
1957 inst
->opcode
= BRW_OPCODE_MOV
;
1958 inst
->src
[0].negate
= !inst
->src
[0].negate
;
1959 inst
->src
[1] = reg_undef
;
1965 if (inst
->src
[1].is_zero()) {
1966 inst
->opcode
= BRW_OPCODE_MOV
;
1967 inst
->src
[0] = inst
->src
[1];
1968 inst
->src
[1] = reg_undef
;
1973 if (inst
->src
[0].file
== IMM
) {
1974 assert(inst
->src
[0].type
== BRW_REGISTER_TYPE_F
);
1975 inst
->opcode
= BRW_OPCODE_MOV
;
1976 inst
->src
[0].fixed_hw_reg
.dw1
.f
*= inst
->src
[1].fixed_hw_reg
.dw1
.f
;
1977 inst
->src
[1] = reg_undef
;
1982 case BRW_OPCODE_ADD
:
1983 if (inst
->src
[1].file
!= IMM
)
1987 if (inst
->src
[1].is_zero()) {
1988 inst
->opcode
= BRW_OPCODE_MOV
;
1989 inst
->src
[1] = reg_undef
;
1994 if (inst
->src
[0].file
== IMM
) {
1995 assert(inst
->src
[0].type
== BRW_REGISTER_TYPE_F
);
1996 inst
->opcode
= BRW_OPCODE_MOV
;
1997 inst
->src
[0].fixed_hw_reg
.dw1
.f
+= inst
->src
[1].fixed_hw_reg
.dw1
.f
;
1998 inst
->src
[1] = reg_undef
;
2004 if (inst
->src
[0].equals(inst
->src
[1])) {
2005 inst
->opcode
= BRW_OPCODE_MOV
;
2006 inst
->src
[1] = reg_undef
;
2011 case BRW_OPCODE_LRP
:
2012 if (inst
->src
[1].equals(inst
->src
[2])) {
2013 inst
->opcode
= BRW_OPCODE_MOV
;
2014 inst
->src
[0] = inst
->src
[1];
2015 inst
->src
[1] = reg_undef
;
2016 inst
->src
[2] = reg_undef
;
2021 case BRW_OPCODE_CMP
:
2022 if (inst
->conditional_mod
== BRW_CONDITIONAL_GE
&&
2024 inst
->src
[0].negate
&&
2025 inst
->src
[1].is_zero()) {
2026 inst
->src
[0].abs
= false;
2027 inst
->src
[0].negate
= false;
2028 inst
->conditional_mod
= BRW_CONDITIONAL_Z
;
2033 case BRW_OPCODE_SEL
:
2034 if (inst
->src
[0].equals(inst
->src
[1])) {
2035 inst
->opcode
= BRW_OPCODE_MOV
;
2036 inst
->src
[1] = reg_undef
;
2037 inst
->predicate
= BRW_PREDICATE_NONE
;
2038 inst
->predicate_inverse
= false;
2040 } else if (inst
->saturate
&& inst
->src
[1].file
== IMM
) {
2041 switch (inst
->conditional_mod
) {
2042 case BRW_CONDITIONAL_LE
:
2043 case BRW_CONDITIONAL_L
:
2044 switch (inst
->src
[1].type
) {
2045 case BRW_REGISTER_TYPE_F
:
2046 if (inst
->src
[1].fixed_hw_reg
.dw1
.f
>= 1.0f
) {
2047 inst
->opcode
= BRW_OPCODE_MOV
;
2048 inst
->src
[1] = reg_undef
;
2049 inst
->conditional_mod
= BRW_CONDITIONAL_NONE
;
2057 case BRW_CONDITIONAL_GE
:
2058 case BRW_CONDITIONAL_G
:
2059 switch (inst
->src
[1].type
) {
2060 case BRW_REGISTER_TYPE_F
:
2061 if (inst
->src
[1].fixed_hw_reg
.dw1
.f
<= 0.0f
) {
2062 inst
->opcode
= BRW_OPCODE_MOV
;
2063 inst
->src
[1] = reg_undef
;
2064 inst
->conditional_mod
= BRW_CONDITIONAL_NONE
;
2076 case BRW_OPCODE_MAD
:
2077 if (inst
->src
[1].is_zero() || inst
->src
[2].is_zero()) {
2078 inst
->opcode
= BRW_OPCODE_MOV
;
2079 inst
->src
[1] = reg_undef
;
2080 inst
->src
[2] = reg_undef
;
2082 } else if (inst
->src
[0].is_zero()) {
2083 inst
->opcode
= BRW_OPCODE_MUL
;
2084 inst
->src
[0] = inst
->src
[2];
2085 inst
->src
[2] = reg_undef
;
2087 } else if (inst
->src
[1].is_one()) {
2088 inst
->opcode
= BRW_OPCODE_ADD
;
2089 inst
->src
[1] = inst
->src
[2];
2090 inst
->src
[2] = reg_undef
;
2092 } else if (inst
->src
[2].is_one()) {
2093 inst
->opcode
= BRW_OPCODE_ADD
;
2094 inst
->src
[2] = reg_undef
;
2096 } else if (inst
->src
[1].file
== IMM
&& inst
->src
[2].file
== IMM
) {
2097 inst
->opcode
= BRW_OPCODE_ADD
;
2098 inst
->src
[1].fixed_hw_reg
.dw1
.f
*= inst
->src
[2].fixed_hw_reg
.dw1
.f
;
2099 inst
->src
[2] = reg_undef
;
2103 case SHADER_OPCODE_RCP
: {
2104 fs_inst
*prev
= (fs_inst
*)inst
->prev
;
2105 if (prev
->opcode
== SHADER_OPCODE_SQRT
) {
2106 if (inst
->src
[0].equals(prev
->dst
)) {
2107 inst
->opcode
= SHADER_OPCODE_RSQ
;
2108 inst
->src
[0] = prev
->src
[0];
2114 case SHADER_OPCODE_BROADCAST
:
2115 if (is_uniform(inst
->src
[0])) {
2116 inst
->opcode
= BRW_OPCODE_MOV
;
2118 inst
->force_writemask_all
= true;
2120 } else if (inst
->src
[1].file
== IMM
) {
2121 inst
->opcode
= BRW_OPCODE_MOV
;
2122 inst
->src
[0] = component(inst
->src
[0],
2123 inst
->src
[1].fixed_hw_reg
.dw1
.ud
);
2125 inst
->force_writemask_all
= true;
2134 /* Swap if src[0] is immediate. */
2135 if (progress
&& inst
->is_commutative()) {
2136 if (inst
->src
[0].file
== IMM
) {
2137 fs_reg tmp
= inst
->src
[1];
2138 inst
->src
[1] = inst
->src
[0];
2147 * Optimize sample messages that have constant zero values for the trailing
2148 * texture coordinates. We can just reduce the message length for these
2149 * instructions instead of reserving a register for it. Trailing parameters
2150 * that aren't sent default to zero anyway. This will cause the dead code
2151 * eliminator to remove the MOV instruction that would otherwise be emitted to
2152 * set up the zero value.
2155 fs_visitor::opt_zero_samples()
2157 /* Gen4 infers the texturing opcode based on the message length so we can't
2160 if (devinfo
->gen
< 5)
2163 bool progress
= false;
2165 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
2166 if (!inst
->is_tex())
2169 fs_inst
*load_payload
= (fs_inst
*) inst
->prev
;
2171 if (load_payload
->is_head_sentinel() ||
2172 load_payload
->opcode
!= SHADER_OPCODE_LOAD_PAYLOAD
)
2175 /* We don't want to remove the message header or the first parameter.
2176 * Removing the first parameter is not allowed, see the Haswell PRM
2177 * volume 7, page 149:
2179 * "Parameter 0 is required except for the sampleinfo message, which
2180 * has no parameter 0"
2182 while (inst
->mlen
> inst
->header_size
+ dispatch_width
/ 8 &&
2183 load_payload
->src
[(inst
->mlen
- inst
->header_size
) /
2184 (dispatch_width
/ 8) +
2185 inst
->header_size
- 1].is_zero()) {
2186 inst
->mlen
-= dispatch_width
/ 8;
2192 invalidate_live_intervals();
2198 * Optimize sample messages which are followed by the final RT write.
2200 * CHV, and GEN9+ can mark a texturing SEND instruction with EOT to have its
2201 * results sent directly to the framebuffer, bypassing the EU. Recognize the
2202 * final texturing results copied to the framebuffer write payload and modify
2203 * them to write to the framebuffer directly.
2206 fs_visitor::opt_sampler_eot()
2208 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
2210 if (stage
!= MESA_SHADER_FRAGMENT
)
2213 if (devinfo
->gen
< 9 && !devinfo
->is_cherryview
)
2216 /* FINISHME: It should be possible to implement this optimization when there
2217 * are multiple drawbuffers.
2219 if (key
->nr_color_regions
!= 1)
2222 /* Look for a texturing instruction immediately before the final FB_WRITE. */
2223 fs_inst
*fb_write
= (fs_inst
*) cfg
->blocks
[cfg
->num_blocks
- 1]->end();
2224 assert(fb_write
->eot
);
2225 assert(fb_write
->opcode
== FS_OPCODE_FB_WRITE
);
2227 fs_inst
*tex_inst
= (fs_inst
*) fb_write
->prev
;
2229 /* There wasn't one; nothing to do. */
2230 if (unlikely(tex_inst
->is_head_sentinel()) || !tex_inst
->is_tex())
2233 /* This optimisation doesn't seem to work for textureGather for some
2234 * reason. I can't find any documentation or known workarounds to indicate
2235 * that this is expected, but considering that it is probably pretty
2236 * unlikely that a shader would directly write out the results from
2237 * textureGather we might as well just disable it.
2239 if (tex_inst
->opcode
== SHADER_OPCODE_TG4
||
2240 tex_inst
->opcode
== SHADER_OPCODE_TG4_OFFSET
)
2243 /* If there's no header present, we need to munge the LOAD_PAYLOAD as well.
2244 * It's very likely to be the previous instruction.
2246 fs_inst
*load_payload
= (fs_inst
*) tex_inst
->prev
;
2247 if (load_payload
->is_head_sentinel() ||
2248 load_payload
->opcode
!= SHADER_OPCODE_LOAD_PAYLOAD
)
2251 assert(!tex_inst
->eot
); /* We can't get here twice */
2252 assert((tex_inst
->offset
& (0xff << 24)) == 0);
2254 tex_inst
->offset
|= fb_write
->target
<< 24;
2255 tex_inst
->eot
= true;
2256 tex_inst
->dst
= bld
.null_reg_ud();
2257 fb_write
->remove(cfg
->blocks
[cfg
->num_blocks
- 1]);
2259 /* If a header is present, marking the eot is sufficient. Otherwise, we need
2260 * to create a new LOAD_PAYLOAD command with the same sources and a space
2261 * saved for the header. Using a new destination register not only makes sure
2262 * we have enough space, but it will make sure the dead code eliminator kills
2263 * the instruction that this will replace.
2265 if (tex_inst
->header_size
!= 0)
2268 fs_reg send_header
= bld
.vgrf(BRW_REGISTER_TYPE_F
,
2269 load_payload
->sources
+ 1);
2270 fs_reg
*new_sources
=
2271 ralloc_array(mem_ctx
, fs_reg
, load_payload
->sources
+ 1);
2273 new_sources
[0] = fs_reg();
2274 for (int i
= 0; i
< load_payload
->sources
; i
++)
2275 new_sources
[i
+1] = load_payload
->src
[i
];
2277 /* The LOAD_PAYLOAD helper seems like the obvious choice here. However, it
2278 * requires a lot of information about the sources to appropriately figure
2279 * out the number of registers needed to be used. Given this stage in our
2280 * optimization, we may not have the appropriate GRFs required by
2281 * LOAD_PAYLOAD at this point (copy propagation). Therefore, we need to
2282 * manually emit the instruction.
2284 fs_inst
*new_load_payload
= new(mem_ctx
) fs_inst(SHADER_OPCODE_LOAD_PAYLOAD
,
2285 load_payload
->exec_size
,
2288 load_payload
->sources
+ 1);
2290 new_load_payload
->regs_written
= load_payload
->regs_written
+ 1;
2291 new_load_payload
->header_size
= 1;
2293 tex_inst
->header_size
= 1;
2294 tex_inst
->insert_before(cfg
->blocks
[cfg
->num_blocks
- 1], new_load_payload
);
2295 tex_inst
->src
[0] = send_header
;
2301 fs_visitor::opt_register_renaming()
2303 bool progress
= false;
2306 int remap
[alloc
.count
];
2307 memset(remap
, -1, sizeof(int) * alloc
.count
);
2309 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
2310 if (inst
->opcode
== BRW_OPCODE_IF
|| inst
->opcode
== BRW_OPCODE_DO
) {
2312 } else if (inst
->opcode
== BRW_OPCODE_ENDIF
||
2313 inst
->opcode
== BRW_OPCODE_WHILE
) {
2317 /* Rewrite instruction sources. */
2318 for (int i
= 0; i
< inst
->sources
; i
++) {
2319 if (inst
->src
[i
].file
== GRF
&&
2320 remap
[inst
->src
[i
].reg
] != -1 &&
2321 remap
[inst
->src
[i
].reg
] != inst
->src
[i
].reg
) {
2322 inst
->src
[i
].reg
= remap
[inst
->src
[i
].reg
];
2327 const int dst
= inst
->dst
.reg
;
2330 inst
->dst
.file
== GRF
&&
2331 alloc
.sizes
[inst
->dst
.reg
] == inst
->dst
.width
/ 8 &&
2332 !inst
->is_partial_write()) {
2333 if (remap
[dst
] == -1) {
2336 remap
[dst
] = alloc
.allocate(inst
->dst
.width
/ 8);
2337 inst
->dst
.reg
= remap
[dst
];
2340 } else if (inst
->dst
.file
== GRF
&&
2342 remap
[dst
] != dst
) {
2343 inst
->dst
.reg
= remap
[dst
];
2349 invalidate_live_intervals();
2351 for (unsigned i
= 0; i
< ARRAY_SIZE(delta_xy
); i
++) {
2352 if (delta_xy
[i
].file
== GRF
&& remap
[delta_xy
[i
].reg
] != -1) {
2353 delta_xy
[i
].reg
= remap
[delta_xy
[i
].reg
];
2362 * Remove redundant or useless discard jumps.
2364 * For example, we can eliminate jumps in the following sequence:
2366 * discard-jump (redundant with the next jump)
2367 * discard-jump (useless; jumps to the next instruction)
2371 fs_visitor::opt_redundant_discard_jumps()
2373 bool progress
= false;
2375 bblock_t
*last_bblock
= cfg
->blocks
[cfg
->num_blocks
- 1];
2377 fs_inst
*placeholder_halt
= NULL
;
2378 foreach_inst_in_block_reverse(fs_inst
, inst
, last_bblock
) {
2379 if (inst
->opcode
== FS_OPCODE_PLACEHOLDER_HALT
) {
2380 placeholder_halt
= inst
;
2385 if (!placeholder_halt
)
2388 /* Delete any HALTs immediately before the placeholder halt. */
2389 for (fs_inst
*prev
= (fs_inst
*) placeholder_halt
->prev
;
2390 !prev
->is_head_sentinel() && prev
->opcode
== FS_OPCODE_DISCARD_JUMP
;
2391 prev
= (fs_inst
*) placeholder_halt
->prev
) {
2392 prev
->remove(last_bblock
);
2397 invalidate_live_intervals();
2403 fs_visitor::compute_to_mrf()
2405 bool progress
= false;
2408 /* No MRFs on Gen >= 7. */
2409 if (devinfo
->gen
>= 7)
2412 calculate_live_intervals();
2414 foreach_block_and_inst_safe(block
, fs_inst
, inst
, cfg
) {
2418 if (inst
->opcode
!= BRW_OPCODE_MOV
||
2419 inst
->is_partial_write() ||
2420 inst
->dst
.file
!= MRF
|| inst
->src
[0].file
!= GRF
||
2421 inst
->dst
.type
!= inst
->src
[0].type
||
2422 inst
->src
[0].abs
|| inst
->src
[0].negate
||
2423 !inst
->src
[0].is_contiguous() ||
2424 inst
->src
[0].subreg_offset
)
2427 /* Work out which hardware MRF registers are written by this
2430 int mrf_low
= inst
->dst
.reg
& ~BRW_MRF_COMPR4
;
2432 if (inst
->dst
.reg
& BRW_MRF_COMPR4
) {
2433 mrf_high
= mrf_low
+ 4;
2434 } else if (inst
->exec_size
== 16) {
2435 mrf_high
= mrf_low
+ 1;
2440 /* Can't compute-to-MRF this GRF if someone else was going to
2443 if (this->virtual_grf_end
[inst
->src
[0].reg
] > ip
)
2446 /* Found a move of a GRF to a MRF. Let's see if we can go
2447 * rewrite the thing that made this GRF to write into the MRF.
2449 foreach_inst_in_block_reverse_starting_from(fs_inst
, scan_inst
, inst
, block
) {
2450 if (scan_inst
->dst
.file
== GRF
&&
2451 scan_inst
->dst
.reg
== inst
->src
[0].reg
) {
2452 /* Found the last thing to write our reg we want to turn
2453 * into a compute-to-MRF.
2456 /* If this one instruction didn't populate all the
2457 * channels, bail. We might be able to rewrite everything
2458 * that writes that reg, but it would require smarter
2459 * tracking to delay the rewriting until complete success.
2461 if (scan_inst
->is_partial_write())
2464 /* Things returning more than one register would need us to
2465 * understand coalescing out more than one MOV at a time.
2467 if (scan_inst
->regs_written
> scan_inst
->dst
.width
/ 8)
2470 /* SEND instructions can't have MRF as a destination. */
2471 if (scan_inst
->mlen
)
2474 if (devinfo
->gen
== 6) {
2475 /* gen6 math instructions must have the destination be
2476 * GRF, so no compute-to-MRF for them.
2478 if (scan_inst
->is_math()) {
2483 if (scan_inst
->dst
.reg_offset
== inst
->src
[0].reg_offset
) {
2484 /* Found the creator of our MRF's source value. */
2485 scan_inst
->dst
.file
= MRF
;
2486 scan_inst
->dst
.reg
= inst
->dst
.reg
;
2487 scan_inst
->saturate
|= inst
->saturate
;
2488 inst
->remove(block
);
2494 /* We don't handle control flow here. Most computation of
2495 * values that end up in MRFs are shortly before the MRF
2498 if (block
->start() == scan_inst
)
2501 /* You can't read from an MRF, so if someone else reads our
2502 * MRF's source GRF that we wanted to rewrite, that stops us.
2504 bool interfered
= false;
2505 for (int i
= 0; i
< scan_inst
->sources
; i
++) {
2506 if (scan_inst
->src
[i
].file
== GRF
&&
2507 scan_inst
->src
[i
].reg
== inst
->src
[0].reg
&&
2508 scan_inst
->src
[i
].reg_offset
== inst
->src
[0].reg_offset
) {
2515 if (scan_inst
->dst
.file
== MRF
) {
2516 /* If somebody else writes our MRF here, we can't
2517 * compute-to-MRF before that.
2519 int scan_mrf_low
= scan_inst
->dst
.reg
& ~BRW_MRF_COMPR4
;
2522 if (scan_inst
->dst
.reg
& BRW_MRF_COMPR4
) {
2523 scan_mrf_high
= scan_mrf_low
+ 4;
2524 } else if (scan_inst
->exec_size
== 16) {
2525 scan_mrf_high
= scan_mrf_low
+ 1;
2527 scan_mrf_high
= scan_mrf_low
;
2530 if (mrf_low
== scan_mrf_low
||
2531 mrf_low
== scan_mrf_high
||
2532 mrf_high
== scan_mrf_low
||
2533 mrf_high
== scan_mrf_high
) {
2538 if (scan_inst
->mlen
> 0 && scan_inst
->base_mrf
!= -1) {
2539 /* Found a SEND instruction, which means that there are
2540 * live values in MRFs from base_mrf to base_mrf +
2541 * scan_inst->mlen - 1. Don't go pushing our MRF write up
2544 if (mrf_low
>= scan_inst
->base_mrf
&&
2545 mrf_low
< scan_inst
->base_mrf
+ scan_inst
->mlen
) {
2548 if (mrf_high
>= scan_inst
->base_mrf
&&
2549 mrf_high
< scan_inst
->base_mrf
+ scan_inst
->mlen
) {
2557 invalidate_live_intervals();
2563 * Eliminate FIND_LIVE_CHANNEL instructions occurring outside any control
2564 * flow. We could probably do better here with some form of divergence
2568 fs_visitor::eliminate_find_live_channel()
2570 bool progress
= false;
2573 foreach_block_and_inst_safe(block
, fs_inst
, inst
, cfg
) {
2574 switch (inst
->opcode
) {
2580 case BRW_OPCODE_ENDIF
:
2581 case BRW_OPCODE_WHILE
:
2585 case FS_OPCODE_DISCARD_JUMP
:
2586 /* This can potentially make control flow non-uniform until the end
2591 case SHADER_OPCODE_FIND_LIVE_CHANNEL
:
2593 inst
->opcode
= BRW_OPCODE_MOV
;
2594 inst
->src
[0] = fs_reg(0);
2596 inst
->force_writemask_all
= true;
2610 * Once we've generated code, try to convert normal FS_OPCODE_FB_WRITE
2611 * instructions to FS_OPCODE_REP_FB_WRITE.
2614 fs_visitor::emit_repclear_shader()
2616 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
2618 int color_mrf
= base_mrf
+ 2;
2620 fs_inst
*mov
= bld
.exec_all().MOV(vec4(brw_message_reg(color_mrf
)),
2621 fs_reg(UNIFORM
, 0, BRW_REGISTER_TYPE_F
));
2624 if (key
->nr_color_regions
== 1) {
2625 write
= bld
.emit(FS_OPCODE_REP_FB_WRITE
);
2626 write
->saturate
= key
->clamp_fragment_color
;
2627 write
->base_mrf
= color_mrf
;
2629 write
->header_size
= 0;
2632 assume(key
->nr_color_regions
> 0);
2633 for (int i
= 0; i
< key
->nr_color_regions
; ++i
) {
2634 write
= bld
.emit(FS_OPCODE_REP_FB_WRITE
);
2635 write
->saturate
= key
->clamp_fragment_color
;
2636 write
->base_mrf
= base_mrf
;
2638 write
->header_size
= 2;
2646 assign_constant_locations();
2647 assign_curb_setup();
2649 /* Now that we have the uniform assigned, go ahead and force it to a vec4. */
2650 assert(mov
->src
[0].file
== HW_REG
);
2651 mov
->src
[0] = brw_vec4_grf(mov
->src
[0].fixed_hw_reg
.nr
, 0);
2655 * Walks through basic blocks, looking for repeated MRF writes and
2656 * removing the later ones.
2659 fs_visitor::remove_duplicate_mrf_writes()
2661 fs_inst
*last_mrf_move
[16];
2662 bool progress
= false;
2664 /* Need to update the MRF tracking for compressed instructions. */
2665 if (dispatch_width
== 16)
2668 memset(last_mrf_move
, 0, sizeof(last_mrf_move
));
2670 foreach_block_and_inst_safe (block
, fs_inst
, inst
, cfg
) {
2671 if (inst
->is_control_flow()) {
2672 memset(last_mrf_move
, 0, sizeof(last_mrf_move
));
2675 if (inst
->opcode
== BRW_OPCODE_MOV
&&
2676 inst
->dst
.file
== MRF
) {
2677 fs_inst
*prev_inst
= last_mrf_move
[inst
->dst
.reg
];
2678 if (prev_inst
&& inst
->equals(prev_inst
)) {
2679 inst
->remove(block
);
2685 /* Clear out the last-write records for MRFs that were overwritten. */
2686 if (inst
->dst
.file
== MRF
) {
2687 last_mrf_move
[inst
->dst
.reg
] = NULL
;
2690 if (inst
->mlen
> 0 && inst
->base_mrf
!= -1) {
2691 /* Found a SEND instruction, which will include two or fewer
2692 * implied MRF writes. We could do better here.
2694 for (int i
= 0; i
< implied_mrf_writes(inst
); i
++) {
2695 last_mrf_move
[inst
->base_mrf
+ i
] = NULL
;
2699 /* Clear out any MRF move records whose sources got overwritten. */
2700 if (inst
->dst
.file
== GRF
) {
2701 for (unsigned int i
= 0; i
< ARRAY_SIZE(last_mrf_move
); i
++) {
2702 if (last_mrf_move
[i
] &&
2703 last_mrf_move
[i
]->src
[0].reg
== inst
->dst
.reg
) {
2704 last_mrf_move
[i
] = NULL
;
2709 if (inst
->opcode
== BRW_OPCODE_MOV
&&
2710 inst
->dst
.file
== MRF
&&
2711 inst
->src
[0].file
== GRF
&&
2712 !inst
->is_partial_write()) {
2713 last_mrf_move
[inst
->dst
.reg
] = inst
;
2718 invalidate_live_intervals();
2724 clear_deps_for_inst_src(fs_inst
*inst
, bool *deps
, int first_grf
, int grf_len
)
2726 /* Clear the flag for registers that actually got read (as expected). */
2727 for (int i
= 0; i
< inst
->sources
; i
++) {
2729 if (inst
->src
[i
].file
== GRF
) {
2730 grf
= inst
->src
[i
].reg
;
2731 } else if (inst
->src
[i
].file
== HW_REG
&&
2732 inst
->src
[i
].fixed_hw_reg
.file
== BRW_GENERAL_REGISTER_FILE
) {
2733 grf
= inst
->src
[i
].fixed_hw_reg
.nr
;
2738 if (grf
>= first_grf
&&
2739 grf
< first_grf
+ grf_len
) {
2740 deps
[grf
- first_grf
] = false;
2741 if (inst
->exec_size
== 16)
2742 deps
[grf
- first_grf
+ 1] = false;
2748 * Implements this workaround for the original 965:
2750 * "[DevBW, DevCL] Implementation Restrictions: As the hardware does not
2751 * check for post destination dependencies on this instruction, software
2752 * must ensure that there is no destination hazard for the case of ‘write
2753 * followed by a posted write’ shown in the following example.
2756 * 2. send r3.xy <rest of send instruction>
2759 * Due to no post-destination dependency check on the ‘send’, the above
2760 * code sequence could have two instructions (1 and 2) in flight at the
2761 * same time that both consider ‘r3’ as the target of their final writes.
2764 fs_visitor::insert_gen4_pre_send_dependency_workarounds(bblock_t
*block
,
2767 int write_len
= inst
->regs_written
;
2768 int first_write_grf
= inst
->dst
.reg
;
2769 bool needs_dep
[BRW_MAX_MRF
];
2770 assert(write_len
< (int)sizeof(needs_dep
) - 1);
2772 memset(needs_dep
, false, sizeof(needs_dep
));
2773 memset(needs_dep
, true, write_len
);
2775 clear_deps_for_inst_src(inst
, needs_dep
, first_write_grf
, write_len
);
2777 /* Walk backwards looking for writes to registers we're writing which
2778 * aren't read since being written. If we hit the start of the program,
2779 * we assume that there are no outstanding dependencies on entry to the
2782 foreach_inst_in_block_reverse_starting_from(fs_inst
, scan_inst
, inst
, block
) {
2783 /* If we hit control flow, assume that there *are* outstanding
2784 * dependencies, and force their cleanup before our instruction.
2786 if (block
->start() == scan_inst
) {
2787 for (int i
= 0; i
< write_len
; i
++) {
2789 DEP_RESOLVE_MOV(bld
.at(block
, inst
), first_write_grf
+ i
);
2794 /* We insert our reads as late as possible on the assumption that any
2795 * instruction but a MOV that might have left us an outstanding
2796 * dependency has more latency than a MOV.
2798 if (scan_inst
->dst
.file
== GRF
) {
2799 for (int i
= 0; i
< scan_inst
->regs_written
; i
++) {
2800 int reg
= scan_inst
->dst
.reg
+ i
;
2802 if (reg
>= first_write_grf
&&
2803 reg
< first_write_grf
+ write_len
&&
2804 needs_dep
[reg
- first_write_grf
]) {
2805 DEP_RESOLVE_MOV(bld
.at(block
, inst
), reg
);
2806 needs_dep
[reg
- first_write_grf
] = false;
2807 if (scan_inst
->exec_size
== 16)
2808 needs_dep
[reg
- first_write_grf
+ 1] = false;
2813 /* Clear the flag for registers that actually got read (as expected). */
2814 clear_deps_for_inst_src(scan_inst
, needs_dep
, first_write_grf
, write_len
);
2816 /* Continue the loop only if we haven't resolved all the dependencies */
2818 for (i
= 0; i
< write_len
; i
++) {
2828 * Implements this workaround for the original 965:
2830 * "[DevBW, DevCL] Errata: A destination register from a send can not be
2831 * used as a destination register until after it has been sourced by an
2832 * instruction with a different destination register.
2835 fs_visitor::insert_gen4_post_send_dependency_workarounds(bblock_t
*block
, fs_inst
*inst
)
2837 int write_len
= inst
->regs_written
;
2838 int first_write_grf
= inst
->dst
.reg
;
2839 bool needs_dep
[BRW_MAX_MRF
];
2840 assert(write_len
< (int)sizeof(needs_dep
) - 1);
2842 memset(needs_dep
, false, sizeof(needs_dep
));
2843 memset(needs_dep
, true, write_len
);
2844 /* Walk forwards looking for writes to registers we're writing which aren't
2845 * read before being written.
2847 foreach_inst_in_block_starting_from(fs_inst
, scan_inst
, inst
, block
) {
2848 /* If we hit control flow, force resolve all remaining dependencies. */
2849 if (block
->end() == scan_inst
) {
2850 for (int i
= 0; i
< write_len
; i
++) {
2852 DEP_RESOLVE_MOV(bld
.at(block
, scan_inst
), first_write_grf
+ i
);
2857 /* Clear the flag for registers that actually got read (as expected). */
2858 clear_deps_for_inst_src(scan_inst
, needs_dep
, first_write_grf
, write_len
);
2860 /* We insert our reads as late as possible since they're reading the
2861 * result of a SEND, which has massive latency.
2863 if (scan_inst
->dst
.file
== GRF
&&
2864 scan_inst
->dst
.reg
>= first_write_grf
&&
2865 scan_inst
->dst
.reg
< first_write_grf
+ write_len
&&
2866 needs_dep
[scan_inst
->dst
.reg
- first_write_grf
]) {
2867 DEP_RESOLVE_MOV(bld
.at(block
, scan_inst
), scan_inst
->dst
.reg
);
2868 needs_dep
[scan_inst
->dst
.reg
- first_write_grf
] = false;
2871 /* Continue the loop only if we haven't resolved all the dependencies */
2873 for (i
= 0; i
< write_len
; i
++) {
2883 fs_visitor::insert_gen4_send_dependency_workarounds()
2885 if (devinfo
->gen
!= 4 || devinfo
->is_g4x
)
2888 bool progress
= false;
2890 /* Note that we're done with register allocation, so GRF fs_regs always
2891 * have a .reg_offset of 0.
2894 foreach_block_and_inst(block
, fs_inst
, inst
, cfg
) {
2895 if (inst
->mlen
!= 0 && inst
->dst
.file
== GRF
) {
2896 insert_gen4_pre_send_dependency_workarounds(block
, inst
);
2897 insert_gen4_post_send_dependency_workarounds(block
, inst
);
2903 invalidate_live_intervals();
2907 * Turns the generic expression-style uniform pull constant load instruction
2908 * into a hardware-specific series of instructions for loading a pull
2911 * The expression style allows the CSE pass before this to optimize out
2912 * repeated loads from the same offset, and gives the pre-register-allocation
2913 * scheduling full flexibility, while the conversion to native instructions
2914 * allows the post-register-allocation scheduler the best information
2917 * Note that execution masking for setting up pull constant loads is special:
2918 * the channels that need to be written are unrelated to the current execution
2919 * mask, since a later instruction will use one of the result channels as a
2920 * source operand for all 8 or 16 of its channels.
2923 fs_visitor::lower_uniform_pull_constant_loads()
2925 foreach_block_and_inst (block
, fs_inst
, inst
, cfg
) {
2926 if (inst
->opcode
!= FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
)
2929 if (devinfo
->gen
>= 7) {
2930 /* The offset arg before was a vec4-aligned byte offset. We need to
2931 * turn it into a dword offset.
2933 fs_reg const_offset_reg
= inst
->src
[1];
2934 assert(const_offset_reg
.file
== IMM
&&
2935 const_offset_reg
.type
== BRW_REGISTER_TYPE_UD
);
2936 const_offset_reg
.fixed_hw_reg
.dw1
.ud
/= 4;
2938 fs_reg payload
, offset
;
2939 if (devinfo
->gen
>= 9) {
2940 /* We have to use a message header on Skylake to get SIMD4x2
2941 * mode. Reserve space for the register.
2943 offset
= payload
= fs_reg(GRF
, alloc
.allocate(2));
2944 offset
.reg_offset
++;
2947 offset
= payload
= fs_reg(GRF
, alloc
.allocate(1));
2951 /* This is actually going to be a MOV, but since only the first dword
2952 * is accessed, we have a special opcode to do just that one. Note
2953 * that this needs to be an operation that will be considered a def
2954 * by live variable analysis, or register allocation will explode.
2956 fs_inst
*setup
= new(mem_ctx
) fs_inst(FS_OPCODE_SET_SIMD4X2_OFFSET
,
2957 8, offset
, const_offset_reg
);
2958 setup
->force_writemask_all
= true;
2960 setup
->ir
= inst
->ir
;
2961 setup
->annotation
= inst
->annotation
;
2962 inst
->insert_before(block
, setup
);
2964 /* Similarly, this will only populate the first 4 channels of the
2965 * result register (since we only use smear values from 0-3), but we
2966 * don't tell the optimizer.
2968 inst
->opcode
= FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GEN7
;
2969 inst
->src
[1] = payload
;
2970 inst
->base_mrf
= -1;
2972 invalidate_live_intervals();
2974 /* Before register allocation, we didn't tell the scheduler about the
2975 * MRF we use. We know it's safe to use this MRF because nothing
2976 * else does except for register spill/unspill, which generates and
2977 * uses its MRF within a single IR instruction.
2979 inst
->base_mrf
= 14;
2986 fs_visitor::lower_load_payload()
2988 bool progress
= false;
2990 foreach_block_and_inst_safe (block
, fs_inst
, inst
, cfg
) {
2991 if (inst
->opcode
!= SHADER_OPCODE_LOAD_PAYLOAD
)
2994 assert(inst
->dst
.file
== MRF
|| inst
->dst
.file
== GRF
);
2995 assert(inst
->saturate
== false);
2996 fs_reg dst
= inst
->dst
;
2998 /* Get rid of COMPR4. We'll add it back in if we need it */
2999 if (dst
.file
== MRF
)
3000 dst
.reg
= dst
.reg
& ~BRW_MRF_COMPR4
;
3003 const fs_builder hbld
= bld
.group(8, 0).exec_all().at(block
, inst
);
3005 for (uint8_t i
= 0; i
< inst
->header_size
; i
++) {
3006 if (inst
->src
[i
].file
!= BAD_FILE
) {
3007 fs_reg mov_dst
= retype(dst
, BRW_REGISTER_TYPE_UD
);
3008 fs_reg mov_src
= retype(inst
->src
[i
], BRW_REGISTER_TYPE_UD
);
3010 hbld
.MOV(mov_dst
, mov_src
);
3012 dst
= offset(dst
, hbld
, 1);
3015 dst
.width
= inst
->exec_size
;
3016 const fs_builder ibld
= bld
.group(inst
->exec_size
, inst
->force_sechalf
)
3017 .exec_all(inst
->force_writemask_all
)
3020 if (inst
->dst
.file
== MRF
&& (inst
->dst
.reg
& BRW_MRF_COMPR4
) &&
3021 inst
->exec_size
> 8) {
3022 /* In this case, the payload portion of the LOAD_PAYLOAD isn't
3023 * a straightforward copy. Instead, the result of the
3024 * LOAD_PAYLOAD is treated as interleaved and the first four
3025 * non-header sources are unpacked as:
3036 * This is used for gen <= 5 fb writes.
3038 assert(inst
->exec_size
== 16);
3039 assert(inst
->header_size
+ 4 <= inst
->sources
);
3040 for (uint8_t i
= inst
->header_size
; i
< inst
->header_size
+ 4; i
++) {
3041 if (inst
->src
[i
].file
!= BAD_FILE
) {
3042 if (devinfo
->has_compr4
) {
3043 fs_reg compr4_dst
= retype(dst
, inst
->src
[i
].type
);
3044 compr4_dst
.reg
|= BRW_MRF_COMPR4
;
3045 ibld
.MOV(compr4_dst
, inst
->src
[i
]);
3047 /* Platform doesn't have COMPR4. We have to fake it */
3048 fs_reg mov_dst
= retype(dst
, inst
->src
[i
].type
);
3050 ibld
.half(0).MOV(mov_dst
, half(inst
->src
[i
], 0));
3052 ibld
.half(1).MOV(mov_dst
, half(inst
->src
[i
], 1));
3059 /* The loop above only ever incremented us through the first set
3060 * of 4 registers. However, thanks to the magic of COMPR4, we
3061 * actually wrote to the first 8 registers, so we need to take
3062 * that into account now.
3066 /* The COMPR4 code took care of the first 4 sources. We'll let
3067 * the regular path handle any remaining sources. Yes, we are
3068 * modifying the instruction but we're about to delete it so
3069 * this really doesn't hurt anything.
3071 inst
->header_size
+= 4;
3074 for (uint8_t i
= inst
->header_size
; i
< inst
->sources
; i
++) {
3075 if (inst
->src
[i
].file
!= BAD_FILE
)
3076 ibld
.MOV(retype(dst
, inst
->src
[i
].type
), inst
->src
[i
]);
3077 dst
= offset(dst
, ibld
, 1);
3080 inst
->remove(block
);
3085 invalidate_live_intervals();
3091 fs_visitor::lower_integer_multiplication()
3093 bool progress
= false;
3095 /* Gen8's MUL instruction can do a 32-bit x 32-bit -> 32-bit operation
3096 * directly, but Cherryview cannot.
3098 if (devinfo
->gen
>= 8 && !devinfo
->is_cherryview
)
3101 foreach_block_and_inst_safe(block
, fs_inst
, inst
, cfg
) {
3102 if (inst
->opcode
!= BRW_OPCODE_MUL
||
3103 inst
->dst
.is_accumulator() ||
3104 (inst
->dst
.type
!= BRW_REGISTER_TYPE_D
&&
3105 inst
->dst
.type
!= BRW_REGISTER_TYPE_UD
))
3108 const fs_builder ibld
= bld
.at(block
, inst
);
3110 /* The MUL instruction isn't commutative. On Gen <= 6, only the low
3111 * 16-bits of src0 are read, and on Gen >= 7 only the low 16-bits of
3114 * If multiplying by an immediate value that fits in 16-bits, do a
3115 * single MUL instruction with that value in the proper location.
3117 if (inst
->src
[1].file
== IMM
&&
3118 inst
->src
[1].fixed_hw_reg
.dw1
.ud
< (1 << 16)) {
3119 if (devinfo
->gen
< 7) {
3120 fs_reg
imm(GRF
, alloc
.allocate(dispatch_width
/ 8),
3121 inst
->dst
.type
, dispatch_width
);
3122 ibld
.MOV(imm
, inst
->src
[1]);
3123 ibld
.MUL(inst
->dst
, imm
, inst
->src
[0]);
3125 ibld
.MUL(inst
->dst
, inst
->src
[0], inst
->src
[1]);
3128 /* Gen < 8 (and some Gen8+ low-power parts like Cherryview) cannot
3129 * do 32-bit integer multiplication in one instruction, but instead
3130 * must do a sequence (which actually calculates a 64-bit result):
3132 * mul(8) acc0<1>D g3<8,8,1>D g4<8,8,1>D
3133 * mach(8) null g3<8,8,1>D g4<8,8,1>D
3134 * mov(8) g2<1>D acc0<8,8,1>D
3136 * But on Gen > 6, the ability to use second accumulator register
3137 * (acc1) for non-float data types was removed, preventing a simple
3138 * implementation in SIMD16. A 16-channel result can be calculated by
3139 * executing the three instructions twice in SIMD8, once with quarter
3140 * control of 1Q for the first eight channels and again with 2Q for
3141 * the second eight channels.
3143 * Which accumulator register is implicitly accessed (by AccWrEnable
3144 * for instance) is determined by the quarter control. Unfortunately
3145 * Ivybridge (and presumably Baytrail) has a hardware bug in which an
3146 * implicit accumulator access by an instruction with 2Q will access
3147 * acc1 regardless of whether the data type is usable in acc1.
3149 * Specifically, the 2Q mach(8) writes acc1 which does not exist for
3150 * integer data types.
3152 * Since we only want the low 32-bits of the result, we can do two
3153 * 32-bit x 16-bit multiplies (like the mul and mach are doing), and
3154 * adjust the high result and add them (like the mach is doing):
3156 * mul(8) g7<1>D g3<8,8,1>D g4.0<8,8,1>UW
3157 * mul(8) g8<1>D g3<8,8,1>D g4.1<8,8,1>UW
3158 * shl(8) g9<1>D g8<8,8,1>D 16D
3159 * add(8) g2<1>D g7<8,8,1>D g8<8,8,1>D
3161 * We avoid the shl instruction by realizing that we only want to add
3162 * the low 16-bits of the "high" result to the high 16-bits of the
3163 * "low" result and using proper regioning on the add:
3165 * mul(8) g7<1>D g3<8,8,1>D g4.0<16,8,2>UW
3166 * mul(8) g8<1>D g3<8,8,1>D g4.1<16,8,2>UW
3167 * add(8) g7.1<2>UW g7.1<16,8,2>UW g8<16,8,2>UW
3169 * Since it does not use the (single) accumulator register, we can
3170 * schedule multi-component multiplications much better.
3173 if (inst
->conditional_mod
&& inst
->dst
.is_null()) {
3174 inst
->dst
= fs_reg(GRF
, alloc
.allocate(dispatch_width
/ 8),
3175 inst
->dst
.type
, dispatch_width
);
3177 fs_reg low
= inst
->dst
;
3178 fs_reg
high(GRF
, alloc
.allocate(dispatch_width
/ 8),
3179 inst
->dst
.type
, dispatch_width
);
3181 if (devinfo
->gen
>= 7) {
3182 fs_reg src1_0_w
= inst
->src
[1];
3183 fs_reg src1_1_w
= inst
->src
[1];
3185 if (inst
->src
[1].file
== IMM
) {
3186 src1_0_w
.fixed_hw_reg
.dw1
.ud
&= 0xffff;
3187 src1_1_w
.fixed_hw_reg
.dw1
.ud
>>= 16;
3189 src1_0_w
.type
= BRW_REGISTER_TYPE_UW
;
3190 if (src1_0_w
.stride
!= 0) {
3191 assert(src1_0_w
.stride
== 1);
3192 src1_0_w
.stride
= 2;
3195 src1_1_w
.type
= BRW_REGISTER_TYPE_UW
;
3196 if (src1_1_w
.stride
!= 0) {
3197 assert(src1_1_w
.stride
== 1);
3198 src1_1_w
.stride
= 2;
3200 src1_1_w
.subreg_offset
+= type_sz(BRW_REGISTER_TYPE_UW
);
3202 ibld
.MUL(low
, inst
->src
[0], src1_0_w
);
3203 ibld
.MUL(high
, inst
->src
[0], src1_1_w
);
3205 fs_reg src0_0_w
= inst
->src
[0];
3206 fs_reg src0_1_w
= inst
->src
[0];
3208 src0_0_w
.type
= BRW_REGISTER_TYPE_UW
;
3209 if (src0_0_w
.stride
!= 0) {
3210 assert(src0_0_w
.stride
== 1);
3211 src0_0_w
.stride
= 2;
3214 src0_1_w
.type
= BRW_REGISTER_TYPE_UW
;
3215 if (src0_1_w
.stride
!= 0) {
3216 assert(src0_1_w
.stride
== 1);
3217 src0_1_w
.stride
= 2;
3219 src0_1_w
.subreg_offset
+= type_sz(BRW_REGISTER_TYPE_UW
);
3221 ibld
.MUL(low
, src0_0_w
, inst
->src
[1]);
3222 ibld
.MUL(high
, src0_1_w
, inst
->src
[1]);
3225 fs_reg dst
= inst
->dst
;
3226 dst
.type
= BRW_REGISTER_TYPE_UW
;
3227 dst
.subreg_offset
= 2;
3230 high
.type
= BRW_REGISTER_TYPE_UW
;
3233 low
.type
= BRW_REGISTER_TYPE_UW
;
3234 low
.subreg_offset
= 2;
3237 ibld
.ADD(dst
, low
, high
);
3239 if (inst
->conditional_mod
) {
3240 fs_reg
null(retype(ibld
.null_reg_f(), inst
->dst
.type
));
3241 set_condmod(inst
->conditional_mod
,
3242 ibld
.MOV(null
, inst
->dst
));
3246 inst
->remove(block
);
3251 invalidate_live_intervals();
3257 fs_visitor::dump_instructions()
3259 dump_instructions(NULL
);
3263 fs_visitor::dump_instructions(const char *name
)
3265 FILE *file
= stderr
;
3266 if (name
&& geteuid() != 0) {
3267 file
= fopen(name
, "w");
3273 calculate_register_pressure();
3274 int ip
= 0, max_pressure
= 0;
3275 foreach_block_and_inst(block
, backend_instruction
, inst
, cfg
) {
3276 max_pressure
= MAX2(max_pressure
, regs_live_at_ip
[ip
]);
3277 fprintf(file
, "{%3d} %4d: ", regs_live_at_ip
[ip
], ip
);
3278 dump_instruction(inst
, file
);
3281 fprintf(file
, "Maximum %3d registers live at once.\n", max_pressure
);
3284 foreach_in_list(backend_instruction
, inst
, &instructions
) {
3285 fprintf(file
, "%4d: ", ip
++);
3286 dump_instruction(inst
, file
);
3290 if (file
!= stderr
) {
3296 fs_visitor::dump_instruction(backend_instruction
*be_inst
)
3298 dump_instruction(be_inst
, stderr
);
3302 fs_visitor::dump_instruction(backend_instruction
*be_inst
, FILE *file
)
3304 fs_inst
*inst
= (fs_inst
*)be_inst
;
3306 if (inst
->predicate
) {
3307 fprintf(file
, "(%cf0.%d) ",
3308 inst
->predicate_inverse
? '-' : '+',
3312 fprintf(file
, "%s", brw_instruction_name(inst
->opcode
));
3314 fprintf(file
, ".sat");
3315 if (inst
->conditional_mod
) {
3316 fprintf(file
, "%s", conditional_modifier
[inst
->conditional_mod
]);
3317 if (!inst
->predicate
&&
3318 (devinfo
->gen
< 5 || (inst
->opcode
!= BRW_OPCODE_SEL
&&
3319 inst
->opcode
!= BRW_OPCODE_IF
&&
3320 inst
->opcode
!= BRW_OPCODE_WHILE
))) {
3321 fprintf(file
, ".f0.%d", inst
->flag_subreg
);
3324 fprintf(file
, "(%d) ", inst
->exec_size
);
3327 fprintf(file
, "(mlen: %d) ", inst
->mlen
);
3330 switch (inst
->dst
.file
) {
3332 fprintf(file
, "vgrf%d", inst
->dst
.reg
);
3333 if (inst
->dst
.width
!= dispatch_width
)
3334 fprintf(file
, "@%d", inst
->dst
.width
);
3335 if (alloc
.sizes
[inst
->dst
.reg
] != inst
->dst
.width
/ 8 ||
3336 inst
->dst
.subreg_offset
)
3337 fprintf(file
, "+%d.%d",
3338 inst
->dst
.reg_offset
, inst
->dst
.subreg_offset
);
3341 fprintf(file
, "m%d", inst
->dst
.reg
);
3344 fprintf(file
, "(null)");
3347 fprintf(file
, "***u%d***", inst
->dst
.reg
+ inst
->dst
.reg_offset
);
3350 fprintf(file
, "***attr%d***", inst
->dst
.reg
+ inst
->dst
.reg_offset
);
3353 if (inst
->dst
.fixed_hw_reg
.file
== BRW_ARCHITECTURE_REGISTER_FILE
) {
3354 switch (inst
->dst
.fixed_hw_reg
.nr
) {
3356 fprintf(file
, "null");
3358 case BRW_ARF_ADDRESS
:
3359 fprintf(file
, "a0.%d", inst
->dst
.fixed_hw_reg
.subnr
);
3361 case BRW_ARF_ACCUMULATOR
:
3362 fprintf(file
, "acc%d", inst
->dst
.fixed_hw_reg
.subnr
);
3365 fprintf(file
, "f%d.%d", inst
->dst
.fixed_hw_reg
.nr
& 0xf,
3366 inst
->dst
.fixed_hw_reg
.subnr
);
3369 fprintf(file
, "arf%d.%d", inst
->dst
.fixed_hw_reg
.nr
& 0xf,
3370 inst
->dst
.fixed_hw_reg
.subnr
);
3374 fprintf(file
, "hw_reg%d", inst
->dst
.fixed_hw_reg
.nr
);
3376 if (inst
->dst
.fixed_hw_reg
.subnr
)
3377 fprintf(file
, "+%d", inst
->dst
.fixed_hw_reg
.subnr
);
3380 fprintf(file
, "???");
3383 fprintf(file
, ":%s, ", brw_reg_type_letters(inst
->dst
.type
));
3385 for (int i
= 0; i
< inst
->sources
; i
++) {
3386 if (inst
->src
[i
].negate
)
3388 if (inst
->src
[i
].abs
)
3390 switch (inst
->src
[i
].file
) {
3392 fprintf(file
, "vgrf%d", inst
->src
[i
].reg
);
3393 if (inst
->src
[i
].width
!= dispatch_width
)
3394 fprintf(file
, "@%d", inst
->src
[i
].width
);
3395 if (alloc
.sizes
[inst
->src
[i
].reg
] != inst
->src
[i
].width
/ 8 ||
3396 inst
->src
[i
].subreg_offset
)
3397 fprintf(file
, "+%d.%d", inst
->src
[i
].reg_offset
,
3398 inst
->src
[i
].subreg_offset
);
3401 fprintf(file
, "***m%d***", inst
->src
[i
].reg
);
3404 fprintf(file
, "attr%d", inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
);
3407 fprintf(file
, "u%d", inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
);
3408 if (inst
->src
[i
].reladdr
) {
3409 fprintf(file
, "+reladdr");
3410 } else if (inst
->src
[i
].subreg_offset
) {
3411 fprintf(file
, "+%d.%d", inst
->src
[i
].reg_offset
,
3412 inst
->src
[i
].subreg_offset
);
3416 fprintf(file
, "(null)");
3419 switch (inst
->src
[i
].type
) {
3420 case BRW_REGISTER_TYPE_F
:
3421 fprintf(file
, "%ff", inst
->src
[i
].fixed_hw_reg
.dw1
.f
);
3423 case BRW_REGISTER_TYPE_W
:
3424 case BRW_REGISTER_TYPE_D
:
3425 fprintf(file
, "%dd", inst
->src
[i
].fixed_hw_reg
.dw1
.d
);
3427 case BRW_REGISTER_TYPE_UW
:
3428 case BRW_REGISTER_TYPE_UD
:
3429 fprintf(file
, "%uu", inst
->src
[i
].fixed_hw_reg
.dw1
.ud
);
3431 case BRW_REGISTER_TYPE_VF
:
3432 fprintf(file
, "[%-gF, %-gF, %-gF, %-gF]",
3433 brw_vf_to_float((inst
->src
[i
].fixed_hw_reg
.dw1
.ud
>> 0) & 0xff),
3434 brw_vf_to_float((inst
->src
[i
].fixed_hw_reg
.dw1
.ud
>> 8) & 0xff),
3435 brw_vf_to_float((inst
->src
[i
].fixed_hw_reg
.dw1
.ud
>> 16) & 0xff),
3436 brw_vf_to_float((inst
->src
[i
].fixed_hw_reg
.dw1
.ud
>> 24) & 0xff));
3439 fprintf(file
, "???");
3444 if (inst
->src
[i
].fixed_hw_reg
.negate
)
3446 if (inst
->src
[i
].fixed_hw_reg
.abs
)
3448 if (inst
->src
[i
].fixed_hw_reg
.file
== BRW_ARCHITECTURE_REGISTER_FILE
) {
3449 switch (inst
->src
[i
].fixed_hw_reg
.nr
) {
3451 fprintf(file
, "null");
3453 case BRW_ARF_ADDRESS
:
3454 fprintf(file
, "a0.%d", inst
->src
[i
].fixed_hw_reg
.subnr
);
3456 case BRW_ARF_ACCUMULATOR
:
3457 fprintf(file
, "acc%d", inst
->src
[i
].fixed_hw_reg
.subnr
);
3460 fprintf(file
, "f%d.%d", inst
->src
[i
].fixed_hw_reg
.nr
& 0xf,
3461 inst
->src
[i
].fixed_hw_reg
.subnr
);
3464 fprintf(file
, "arf%d.%d", inst
->src
[i
].fixed_hw_reg
.nr
& 0xf,
3465 inst
->src
[i
].fixed_hw_reg
.subnr
);
3469 fprintf(file
, "hw_reg%d", inst
->src
[i
].fixed_hw_reg
.nr
);
3471 if (inst
->src
[i
].fixed_hw_reg
.subnr
)
3472 fprintf(file
, "+%d", inst
->src
[i
].fixed_hw_reg
.subnr
);
3473 if (inst
->src
[i
].fixed_hw_reg
.abs
)
3477 fprintf(file
, "???");
3480 if (inst
->src
[i
].abs
)
3483 if (inst
->src
[i
].file
!= IMM
) {
3484 fprintf(file
, ":%s", brw_reg_type_letters(inst
->src
[i
].type
));
3487 if (i
< inst
->sources
- 1 && inst
->src
[i
+ 1].file
!= BAD_FILE
)
3488 fprintf(file
, ", ");
3493 if (dispatch_width
== 16 && inst
->exec_size
== 8) {
3494 if (inst
->force_sechalf
)
3495 fprintf(file
, "2ndhalf ");
3497 fprintf(file
, "1sthalf ");
3500 fprintf(file
, "\n");
3504 * Possibly returns an instruction that set up @param reg.
3506 * Sometimes we want to take the result of some expression/variable
3507 * dereference tree and rewrite the instruction generating the result
3508 * of the tree. When processing the tree, we know that the
3509 * instructions generated are all writing temporaries that are dead
3510 * outside of this tree. So, if we have some instructions that write
3511 * a temporary, we're free to point that temp write somewhere else.
3513 * Note that this doesn't guarantee that the instruction generated
3514 * only reg -- it might be the size=4 destination of a texture instruction.
3517 fs_visitor::get_instruction_generating_reg(fs_inst
*start
,
3522 end
->is_partial_write() ||
3524 !reg
.equals(end
->dst
)) {
3532 fs_visitor::setup_payload_gen6()
3535 (prog
->InputsRead
& (1 << VARYING_SLOT_POS
)) != 0;
3536 unsigned barycentric_interp_modes
=
3537 (stage
== MESA_SHADER_FRAGMENT
) ?
3538 ((brw_wm_prog_data
*) this->prog_data
)->barycentric_interp_modes
: 0;
3540 assert(devinfo
->gen
>= 6);
3542 /* R0-1: masks, pixel X/Y coordinates. */
3543 payload
.num_regs
= 2;
3544 /* R2: only for 32-pixel dispatch.*/
3546 /* R3-26: barycentric interpolation coordinates. These appear in the
3547 * same order that they appear in the brw_wm_barycentric_interp_mode
3548 * enum. Each set of coordinates occupies 2 registers if dispatch width
3549 * == 8 and 4 registers if dispatch width == 16. Coordinates only
3550 * appear if they were enabled using the "Barycentric Interpolation
3551 * Mode" bits in WM_STATE.
3553 for (int i
= 0; i
< BRW_WM_BARYCENTRIC_INTERP_MODE_COUNT
; ++i
) {
3554 if (barycentric_interp_modes
& (1 << i
)) {
3555 payload
.barycentric_coord_reg
[i
] = payload
.num_regs
;
3556 payload
.num_regs
+= 2;
3557 if (dispatch_width
== 16) {
3558 payload
.num_regs
+= 2;
3563 /* R27: interpolated depth if uses source depth */
3565 payload
.source_depth_reg
= payload
.num_regs
;
3567 if (dispatch_width
== 16) {
3568 /* R28: interpolated depth if not SIMD8. */
3572 /* R29: interpolated W set if GEN6_WM_USES_SOURCE_W. */
3574 payload
.source_w_reg
= payload
.num_regs
;
3576 if (dispatch_width
== 16) {
3577 /* R30: interpolated W if not SIMD8. */
3582 if (stage
== MESA_SHADER_FRAGMENT
) {
3583 brw_wm_prog_data
*prog_data
= (brw_wm_prog_data
*) this->prog_data
;
3584 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
3585 prog_data
->uses_pos_offset
= key
->compute_pos_offset
;
3586 /* R31: MSAA position offsets. */
3587 if (prog_data
->uses_pos_offset
) {
3588 payload
.sample_pos_reg
= payload
.num_regs
;
3593 /* R32: MSAA input coverage mask */
3594 if (prog
->SystemValuesRead
& SYSTEM_BIT_SAMPLE_MASK_IN
) {
3595 assert(devinfo
->gen
>= 7);
3596 payload
.sample_mask_in_reg
= payload
.num_regs
;
3598 if (dispatch_width
== 16) {
3599 /* R33: input coverage mask if not SIMD8. */
3604 /* R34-: bary for 32-pixel. */
3605 /* R58-59: interp W for 32-pixel. */
3607 if (prog
->OutputsWritten
& BITFIELD64_BIT(FRAG_RESULT_DEPTH
)) {
3608 source_depth_to_render_target
= true;
3613 fs_visitor::setup_vs_payload()
3615 /* R0: thread header, R1: urb handles */
3616 payload
.num_regs
= 2;
3620 fs_visitor::setup_cs_payload()
3622 assert(devinfo
->gen
>= 7);
3624 payload
.num_regs
= 1;
3628 fs_visitor::assign_binding_table_offsets()
3630 assert(stage
== MESA_SHADER_FRAGMENT
);
3631 brw_wm_prog_data
*prog_data
= (brw_wm_prog_data
*) this->prog_data
;
3632 brw_wm_prog_key
*key
= (brw_wm_prog_key
*) this->key
;
3633 uint32_t next_binding_table_offset
= 0;
3635 /* If there are no color regions, we still perform an FB write to a null
3636 * renderbuffer, which we place at surface index 0.
3638 prog_data
->binding_table
.render_target_start
= next_binding_table_offset
;
3639 next_binding_table_offset
+= MAX2(key
->nr_color_regions
, 1);
3641 assign_common_binding_table_offsets(next_binding_table_offset
);
3645 fs_visitor::calculate_register_pressure()
3647 invalidate_live_intervals();
3648 calculate_live_intervals();
3650 unsigned num_instructions
= 0;
3651 foreach_block(block
, cfg
)
3652 num_instructions
+= block
->instructions
.length();
3654 regs_live_at_ip
= rzalloc_array(mem_ctx
, int, num_instructions
);
3656 for (unsigned reg
= 0; reg
< alloc
.count
; reg
++) {
3657 for (int ip
= virtual_grf_start
[reg
]; ip
<= virtual_grf_end
[reg
]; ip
++)
3658 regs_live_at_ip
[ip
] += alloc
.sizes
[reg
];
3663 fs_visitor::optimize()
3665 /* bld is the common builder object pointing at the end of the program we
3666 * used to translate it into i965 IR. For the optimization and lowering
3667 * passes coming next, any code added after the end of the program without
3668 * having explicitly called fs_builder::at() clearly points at a mistake.
3669 * Ideally optimization passes wouldn't be part of the visitor so they
3670 * wouldn't have access to bld at all, but they do, so just in case some
3671 * pass forgets to ask for a location explicitly set it to NULL here to
3674 bld
= bld
.at(NULL
, NULL
);
3676 split_virtual_grfs();
3678 move_uniform_array_access_to_pull_constants();
3679 assign_constant_locations();
3680 demote_pull_constants();
3682 #define OPT(pass, args...) ({ \
3684 bool this_progress = pass(args); \
3686 if (unlikely(INTEL_DEBUG & DEBUG_OPTIMIZER) && this_progress) { \
3687 char filename[64]; \
3688 snprintf(filename, 64, "%s%d-%04d-%02d-%02d-" #pass, \
3689 stage_abbrev, dispatch_width, shader_prog ? shader_prog->Name : 0, iteration, pass_num); \
3691 backend_shader::dump_instructions(filename); \
3694 progress = progress || this_progress; \
3698 if (unlikely(INTEL_DEBUG
& DEBUG_OPTIMIZER
)) {
3700 snprintf(filename
, 64, "%s%d-%04d-00-start",
3701 stage_abbrev
, dispatch_width
,
3702 shader_prog
? shader_prog
->Name
: 0);
3704 backend_shader::dump_instructions(filename
);
3715 OPT(remove_duplicate_mrf_writes
);
3719 OPT(opt_copy_propagate
);
3720 OPT(opt_peephole_predicated_break
);
3721 OPT(opt_cmod_propagation
);
3722 OPT(dead_code_eliminate
);
3723 OPT(opt_peephole_sel
);
3724 OPT(dead_control_flow_eliminate
, this);
3725 OPT(opt_register_renaming
);
3726 OPT(opt_redundant_discard_jumps
);
3727 OPT(opt_saturate_propagation
);
3728 OPT(opt_zero_samples
);
3729 OPT(register_coalesce
);
3730 OPT(compute_to_mrf
);
3731 OPT(eliminate_find_live_channel
);
3733 OPT(compact_virtual_grfs
);
3738 OPT(opt_sampler_eot
);
3740 if (OPT(lower_load_payload
)) {
3741 split_virtual_grfs();
3742 OPT(register_coalesce
);
3743 OPT(compute_to_mrf
);
3744 OPT(dead_code_eliminate
);
3747 OPT(opt_combine_constants
);
3748 OPT(lower_integer_multiplication
);
3750 lower_uniform_pull_constant_loads();
3754 * Three source instruction must have a GRF/MRF destination register.
3755 * ARF NULL is not allowed. Fix that up by allocating a temporary GRF.
3758 fs_visitor::fixup_3src_null_dest()
3760 foreach_block_and_inst_safe (block
, fs_inst
, inst
, cfg
) {
3761 if (inst
->is_3src() && inst
->dst
.is_null()) {
3762 inst
->dst
= fs_reg(GRF
, alloc
.allocate(dispatch_width
/ 8),
3769 fs_visitor::allocate_registers()
3771 bool allocated_without_spills
;
3773 static const enum instruction_scheduler_mode pre_modes
[] = {
3775 SCHEDULE_PRE_NON_LIFO
,
3779 /* Try each scheduling heuristic to see if it can successfully register
3780 * allocate without spilling. They should be ordered by decreasing
3781 * performance but increasing likelihood of allocating.
3783 for (unsigned i
= 0; i
< ARRAY_SIZE(pre_modes
); i
++) {
3784 schedule_instructions(pre_modes
[i
]);
3787 assign_regs_trivial();
3788 allocated_without_spills
= true;
3790 allocated_without_spills
= assign_regs(false);
3792 if (allocated_without_spills
)
3796 if (!allocated_without_spills
) {
3797 /* We assume that any spilling is worse than just dropping back to
3798 * SIMD8. There's probably actually some intermediate point where
3799 * SIMD16 with a couple of spills is still better.
3801 if (dispatch_width
== 16) {
3802 fail("Failure to register allocate. Reduce number of "
3803 "live scalar values to avoid this.");
3805 compiler
->shader_perf_log(log_data
,
3806 "%s shader triggered register spilling. "
3807 "Try reducing the number of live scalar "
3808 "values to improve performance.\n",
3812 /* Since we're out of heuristics, just go spill registers until we
3813 * get an allocation.
3815 while (!assign_regs(true)) {
3821 /* This must come after all optimization and register allocation, since
3822 * it inserts dead code that happens to have side effects, and it does
3823 * so based on the actual physical registers in use.
3825 insert_gen4_send_dependency_workarounds();
3830 if (!allocated_without_spills
)
3831 schedule_instructions(SCHEDULE_POST
);
3833 if (last_scratch
> 0)
3834 prog_data
->total_scratch
= brw_get_scratch_size(last_scratch
);
3838 fs_visitor::run_vs(gl_clip_plane
*clip_planes
)
3840 assert(stage
== MESA_SHADER_VERTEX
);
3842 assign_common_binding_table_offsets(0);
3845 if (shader_time_index
>= 0)
3846 emit_shader_time_begin();
3853 compute_clip_distance(clip_planes
);
3857 if (shader_time_index
>= 0)
3858 emit_shader_time_end();
3864 assign_curb_setup();
3865 assign_vs_urb_setup();
3867 fixup_3src_null_dest();
3868 allocate_registers();
3874 fs_visitor::run_fs(bool do_rep_send
)
3876 brw_wm_prog_data
*wm_prog_data
= (brw_wm_prog_data
*) this->prog_data
;
3877 brw_wm_prog_key
*wm_key
= (brw_wm_prog_key
*) this->key
;
3879 assert(stage
== MESA_SHADER_FRAGMENT
);
3881 sanity_param_count
= prog
->Parameters
->NumParameters
;
3883 assign_binding_table_offsets();
3885 if (devinfo
->gen
>= 6)
3886 setup_payload_gen6();
3888 setup_payload_gen4();
3892 } else if (do_rep_send
) {
3893 assert(dispatch_width
== 16);
3894 emit_repclear_shader();
3896 if (shader_time_index
>= 0)
3897 emit_shader_time_begin();
3899 calculate_urb_setup();
3900 if (prog
->InputsRead
> 0) {
3901 if (devinfo
->gen
< 6)
3902 emit_interpolation_setup_gen4();
3904 emit_interpolation_setup_gen6();
3907 /* We handle discards by keeping track of the still-live pixels in f0.1.
3908 * Initialize it with the dispatched pixels.
3910 if (wm_prog_data
->uses_kill
) {
3911 fs_inst
*discard_init
= bld
.emit(FS_OPCODE_MOV_DISPATCH_TO_FLAGS
);
3912 discard_init
->flag_subreg
= 1;
3915 /* Generate FS IR for main(). (the visitor only descends into
3916 * functions called "main").
3923 if (wm_prog_data
->uses_kill
)
3924 bld
.emit(FS_OPCODE_PLACEHOLDER_HALT
);
3926 if (wm_key
->alpha_test_func
)
3931 if (shader_time_index
>= 0)
3932 emit_shader_time_end();
3938 assign_curb_setup();
3941 fixup_3src_null_dest();
3942 allocate_registers();
3948 if (dispatch_width
== 8)
3949 wm_prog_data
->reg_blocks
= brw_register_blocks(grf_used
);
3951 wm_prog_data
->reg_blocks_16
= brw_register_blocks(grf_used
);
3953 /* If any state parameters were appended, then ParameterValues could have
3954 * been realloced, in which case the driver uniform storage set up by
3955 * _mesa_associate_uniform_storage() would point to freed memory. Make
3956 * sure that didn't happen.
3958 assert(sanity_param_count
== prog
->Parameters
->NumParameters
);
3964 fs_visitor::run_cs()
3966 assert(stage
== MESA_SHADER_COMPUTE
);
3969 sanity_param_count
= prog
->Parameters
->NumParameters
;
3971 assign_common_binding_table_offsets(0);
3975 if (shader_time_index
>= 0)
3976 emit_shader_time_begin();
3983 emit_cs_terminate();
3985 if (shader_time_index
>= 0)
3986 emit_shader_time_end();
3992 assign_curb_setup();
3994 fixup_3src_null_dest();
3995 allocate_registers();
4000 /* If any state parameters were appended, then ParameterValues could have
4001 * been realloced, in which case the driver uniform storage set up by
4002 * _mesa_associate_uniform_storage() would point to freed memory. Make
4003 * sure that didn't happen.
4005 assert(sanity_param_count
== prog
->Parameters
->NumParameters
);
4011 brw_wm_fs_emit(struct brw_context
*brw
,
4013 const struct brw_wm_prog_key
*key
,
4014 struct brw_wm_prog_data
*prog_data
,
4015 struct gl_fragment_program
*fp
,
4016 struct gl_shader_program
*prog
,
4017 unsigned *final_assembly_size
)
4019 bool start_busy
= false;
4020 double start_time
= 0;
4022 if (unlikely(brw
->perf_debug
)) {
4023 start_busy
= (brw
->batch
.last_bo
&&
4024 drm_intel_bo_busy(brw
->batch
.last_bo
));
4025 start_time
= get_time();
4028 struct brw_shader
*shader
= NULL
;
4030 shader
= (brw_shader
*) prog
->_LinkedShaders
[MESA_SHADER_FRAGMENT
];
4032 if (unlikely(INTEL_DEBUG
& DEBUG_WM
))
4033 brw_dump_ir("fragment", prog
, &shader
->base
, &fp
->Base
);
4035 int st_index8
= -1, st_index16
= -1;
4036 if (INTEL_DEBUG
& DEBUG_SHADER_TIME
) {
4037 st_index8
= brw_get_shader_time_index(brw
, prog
, &fp
->Base
, ST_FS8
);
4038 st_index16
= brw_get_shader_time_index(brw
, prog
, &fp
->Base
, ST_FS16
);
4041 /* Now the main event: Visit the shader IR and generate our FS IR for it.
4043 fs_visitor
v(brw
->intelScreen
->compiler
, brw
,
4044 mem_ctx
, MESA_SHADER_FRAGMENT
, key
, &prog_data
->base
,
4045 prog
, &fp
->Base
, 8, st_index8
);
4046 if (!v
.run_fs(false /* do_rep_send */)) {
4048 prog
->LinkStatus
= false;
4049 ralloc_strcat(&prog
->InfoLog
, v
.fail_msg
);
4052 _mesa_problem(NULL
, "Failed to compile fragment shader: %s\n",
4058 cfg_t
*simd16_cfg
= NULL
;
4059 fs_visitor
v2(brw
->intelScreen
->compiler
, brw
,
4060 mem_ctx
, MESA_SHADER_FRAGMENT
, key
, &prog_data
->base
,
4061 prog
, &fp
->Base
, 16, st_index16
);
4062 if (likely(!(INTEL_DEBUG
& DEBUG_NO16
) || brw
->use_rep_send
)) {
4063 if (!v
.simd16_unsupported
) {
4064 /* Try a SIMD16 compile */
4065 v2
.import_uniforms(&v
);
4066 if (!v2
.run_fs(brw
->use_rep_send
)) {
4067 perf_debug("SIMD16 shader failed to compile: %s", v2
.fail_msg
);
4069 simd16_cfg
= v2
.cfg
;
4075 int no_simd8
= (INTEL_DEBUG
& DEBUG_NO8
) || brw
->no_simd8
;
4076 if ((no_simd8
|| brw
->gen
< 5) && simd16_cfg
) {
4078 prog_data
->no_8
= true;
4081 prog_data
->no_8
= false;
4084 fs_generator
g(brw
->intelScreen
->compiler
, brw
,
4085 mem_ctx
, (void *) key
, &prog_data
->base
,
4086 &fp
->Base
, v
.promoted_constants
, v
.runtime_check_aads_emit
, "FS");
4088 if (unlikely(INTEL_DEBUG
& DEBUG_WM
)) {
4091 name
= ralloc_asprintf(mem_ctx
, "%s fragment shader %d",
4092 prog
->Label
? prog
->Label
: "unnamed",
4095 name
= ralloc_asprintf(mem_ctx
, "fragment program %d", fp
->Base
.Id
);
4097 g
.enable_debug(name
);
4101 g
.generate_code(simd8_cfg
, 8);
4103 prog_data
->prog_offset_16
= g
.generate_code(simd16_cfg
, 16);
4105 if (unlikely(brw
->perf_debug
) && shader
) {
4106 if (shader
->compiled_once
)
4107 brw_wm_debug_recompile(brw
, prog
, key
);
4108 shader
->compiled_once
= true;
4110 if (start_busy
&& !drm_intel_bo_busy(brw
->batch
.last_bo
)) {
4111 perf_debug("FS compile took %.03f ms and stalled the GPU\n",
4112 (get_time() - start_time
) * 1000);
4116 return g
.get_assembly(final_assembly_size
);
4120 brw_fs_precompile(struct gl_context
*ctx
,
4121 struct gl_shader_program
*shader_prog
,
4122 struct gl_program
*prog
)
4124 struct brw_context
*brw
= brw_context(ctx
);
4125 struct brw_wm_prog_key key
;
4127 struct gl_fragment_program
*fp
= (struct gl_fragment_program
*) prog
;
4128 struct brw_fragment_program
*bfp
= brw_fragment_program(fp
);
4129 bool program_uses_dfdy
= fp
->UsesDFdy
;
4131 memset(&key
, 0, sizeof(key
));
4135 key
.iz_lookup
|= IZ_PS_KILL_ALPHATEST_BIT
;
4137 if (fp
->Base
.OutputsWritten
& BITFIELD64_BIT(FRAG_RESULT_DEPTH
))
4138 key
.iz_lookup
|= IZ_PS_COMPUTES_DEPTH_BIT
;
4140 /* Just assume depth testing. */
4141 key
.iz_lookup
|= IZ_DEPTH_TEST_ENABLE_BIT
;
4142 key
.iz_lookup
|= IZ_DEPTH_WRITE_ENABLE_BIT
;
4145 if (brw
->gen
< 6 || _mesa_bitcount_64(fp
->Base
.InputsRead
&
4146 BRW_FS_VARYING_INPUT_MASK
) > 16)
4147 key
.input_slots_valid
= fp
->Base
.InputsRead
| VARYING_BIT_POS
;
4149 brw_setup_tex_for_precompile(brw
, &key
.tex
, &fp
->Base
);
4151 if (fp
->Base
.InputsRead
& VARYING_BIT_POS
) {
4152 key
.drawable_height
= ctx
->DrawBuffer
->Height
;
4155 key
.nr_color_regions
= _mesa_bitcount_64(fp
->Base
.OutputsWritten
&
4156 ~(BITFIELD64_BIT(FRAG_RESULT_DEPTH
) |
4157 BITFIELD64_BIT(FRAG_RESULT_SAMPLE_MASK
)));
4159 if ((fp
->Base
.InputsRead
& VARYING_BIT_POS
) || program_uses_dfdy
) {
4160 key
.render_to_fbo
= _mesa_is_user_fbo(ctx
->DrawBuffer
) ||
4161 key
.nr_color_regions
> 1;
4164 key
.program_string_id
= bfp
->id
;
4166 uint32_t old_prog_offset
= brw
->wm
.base
.prog_offset
;
4167 struct brw_wm_prog_data
*old_prog_data
= brw
->wm
.prog_data
;
4169 bool success
= brw_codegen_wm_prog(brw
, shader_prog
, bfp
, &key
);
4171 brw
->wm
.base
.prog_offset
= old_prog_offset
;
4172 brw
->wm
.prog_data
= old_prog_data
;
4178 brw_setup_tex_for_precompile(struct brw_context
*brw
,
4179 struct brw_sampler_prog_key_data
*tex
,
4180 struct gl_program
*prog
)
4182 const bool has_shader_channel_select
= brw
->is_haswell
|| brw
->gen
>= 8;
4183 unsigned sampler_count
= _mesa_fls(prog
->SamplersUsed
);
4184 for (unsigned i
= 0; i
< sampler_count
; i
++) {
4185 if (!has_shader_channel_select
&& (prog
->ShadowSamplers
& (1 << i
))) {
4186 /* Assume DEPTH_TEXTURE_MODE is the default: X, X, X, 1 */
4188 MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_X
, SWIZZLE_X
, SWIZZLE_ONE
);
4190 /* Color sampler: assume no swizzling. */
4191 tex
->swizzles
[i
] = SWIZZLE_XYZW
;