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
33 #include <sys/types.h>
35 #include "main/hash_table.h"
36 #include "main/macros.h"
37 #include "main/shaderobj.h"
38 #include "main/fbobject.h"
39 #include "program/prog_parameter.h"
40 #include "program/prog_print.h"
41 #include "program/register_allocate.h"
42 #include "program/sampler.h"
43 #include "program/hash_table.h"
44 #include "brw_context.h"
49 #include "main/uniforms.h"
50 #include "brw_fs_live_variables.h"
51 #include "glsl/glsl_types.h"
56 memset(this, 0, sizeof(*this));
57 this->opcode
= BRW_OPCODE_NOP
;
58 this->conditional_mod
= BRW_CONDITIONAL_NONE
;
60 this->dst
= reg_undef
;
61 this->src
[0] = reg_undef
;
62 this->src
[1] = reg_undef
;
63 this->src
[2] = reg_undef
;
65 /* This will be the case for almost all instructions. */
66 this->regs_written
= 1;
74 fs_inst::fs_inst(enum opcode opcode
)
77 this->opcode
= opcode
;
80 fs_inst::fs_inst(enum opcode opcode
, fs_reg dst
)
83 this->opcode
= opcode
;
87 assert(dst
.reg_offset
>= 0);
90 fs_inst::fs_inst(enum opcode opcode
, fs_reg dst
, fs_reg src0
)
93 this->opcode
= opcode
;
98 assert(dst
.reg_offset
>= 0);
99 if (src
[0].file
== GRF
)
100 assert(src
[0].reg_offset
>= 0);
103 fs_inst::fs_inst(enum opcode opcode
, fs_reg dst
, fs_reg src0
, fs_reg src1
)
106 this->opcode
= opcode
;
112 assert(dst
.reg_offset
>= 0);
113 if (src
[0].file
== GRF
)
114 assert(src
[0].reg_offset
>= 0);
115 if (src
[1].file
== GRF
)
116 assert(src
[1].reg_offset
>= 0);
119 fs_inst::fs_inst(enum opcode opcode
, fs_reg dst
,
120 fs_reg src0
, fs_reg src1
, fs_reg src2
)
123 this->opcode
= opcode
;
130 assert(dst
.reg_offset
>= 0);
131 if (src
[0].file
== GRF
)
132 assert(src
[0].reg_offset
>= 0);
133 if (src
[1].file
== GRF
)
134 assert(src
[1].reg_offset
>= 0);
135 if (src
[2].file
== GRF
)
136 assert(src
[2].reg_offset
>= 0);
141 fs_visitor::op(fs_reg dst, fs_reg src0) \
143 return new(mem_ctx) fs_inst(BRW_OPCODE_##op, dst, src0); \
148 fs_visitor::op(fs_reg dst, fs_reg src0, fs_reg src1) \
150 return new(mem_ctx) fs_inst(BRW_OPCODE_##op, dst, src0, src1); \
155 fs_visitor::op(fs_reg dst, fs_reg src0, fs_reg src1, fs_reg src2) \
157 return new(mem_ctx) fs_inst(BRW_OPCODE_##op, dst, src0, src1, src2);\
187 /** Gen4 predicated IF. */
189 fs_visitor::IF(uint32_t predicate
)
191 fs_inst
*inst
= new(mem_ctx
) fs_inst(BRW_OPCODE_IF
);
192 inst
->predicate
= predicate
;
196 /** Gen6+ IF with embedded comparison. */
198 fs_visitor::IF(fs_reg src0
, fs_reg src1
, uint32_t condition
)
200 assert(brw
->gen
>= 6);
201 fs_inst
*inst
= new(mem_ctx
) fs_inst(BRW_OPCODE_IF
,
202 reg_null_d
, src0
, src1
);
203 inst
->conditional_mod
= condition
;
208 * CMP: Sets the low bit of the destination channels with the result
209 * of the comparison, while the upper bits are undefined, and updates
210 * the flag register with the packed 16 bits of the result.
213 fs_visitor::CMP(fs_reg dst
, fs_reg src0
, fs_reg src1
, uint32_t condition
)
217 /* Take the instruction:
219 * CMP null<d> src0<f> src1<f>
221 * Original gen4 does type conversion to the destination type before
222 * comparison, producing garbage results for floating point comparisons.
223 * gen5 does the comparison on the execution type (resolved source types),
224 * so dst type doesn't matter. gen6 does comparison and then uses the
225 * result as if it was the dst type with no conversion, which happens to
226 * mostly work out for float-interpreted-as-int since our comparisons are
230 dst
.type
= src0
.type
;
231 if (dst
.file
== HW_REG
)
232 dst
.fixed_hw_reg
.type
= dst
.type
;
235 resolve_ud_negate(&src0
);
236 resolve_ud_negate(&src1
);
238 inst
= new(mem_ctx
) fs_inst(BRW_OPCODE_CMP
, dst
, src0
, src1
);
239 inst
->conditional_mod
= condition
;
245 fs_visitor::VARYING_PULL_CONSTANT_LOAD(fs_reg dst
, fs_reg surf_index
,
246 fs_reg varying_offset
,
247 uint32_t const_offset
)
249 exec_list instructions
;
252 /* We have our constant surface use a pitch of 4 bytes, so our index can
253 * be any component of a vector, and then we load 4 contiguous
254 * components starting from that.
256 * We break down the const_offset to a portion added to the variable
257 * offset and a portion done using reg_offset, which means that if you
258 * have GLSL using something like "uniform vec4 a[20]; gl_FragColor =
259 * a[i]", we'll temporarily generate 4 vec4 loads from offset i * 4, and
260 * CSE can later notice that those loads are all the same and eliminate
261 * the redundant ones.
263 fs_reg vec4_offset
= fs_reg(this, glsl_type::int_type
);
264 instructions
.push_tail(ADD(vec4_offset
,
265 varying_offset
, const_offset
& ~3));
268 if (brw
->gen
== 4 && dispatch_width
== 8) {
269 /* Pre-gen5, we can either use a SIMD8 message that requires (header,
270 * u, v, r) as parameters, or we can just use the SIMD16 message
271 * consisting of (header, u). We choose the second, at the cost of a
272 * longer return length.
279 op
= FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GEN7
;
281 op
= FS_OPCODE_VARYING_PULL_CONSTANT_LOAD
;
282 fs_reg vec4_result
= fs_reg(GRF
, virtual_grf_alloc(4 * scale
), dst
.type
);
283 inst
= new(mem_ctx
) fs_inst(op
, vec4_result
, surf_index
, vec4_offset
);
284 inst
->regs_written
= 4 * scale
;
285 instructions
.push_tail(inst
);
289 inst
->header_present
= true;
293 inst
->mlen
= 1 + dispatch_width
/ 8;
296 vec4_result
.reg_offset
+= (const_offset
& 3) * scale
;
297 instructions
.push_tail(MOV(dst
, vec4_result
));
303 * A helper for MOV generation for fixing up broken hardware SEND dependency
307 fs_visitor::DEP_RESOLVE_MOV(int grf
)
309 fs_inst
*inst
= MOV(brw_null_reg(), fs_reg(GRF
, grf
, BRW_REGISTER_TYPE_F
));
312 inst
->annotation
= "send dependency resolve";
314 /* The caller always wants uncompressed to emit the minimal extra
315 * dependencies, and to avoid having to deal with aligning its regs to 2.
317 inst
->force_uncompressed
= true;
323 fs_inst::equals(fs_inst
*inst
)
325 return (opcode
== inst
->opcode
&&
326 dst
.equals(inst
->dst
) &&
327 src
[0].equals(inst
->src
[0]) &&
328 src
[1].equals(inst
->src
[1]) &&
329 src
[2].equals(inst
->src
[2]) &&
330 saturate
== inst
->saturate
&&
331 predicate
== inst
->predicate
&&
332 conditional_mod
== inst
->conditional_mod
&&
333 mlen
== inst
->mlen
&&
334 base_mrf
== inst
->base_mrf
&&
335 sampler
== inst
->sampler
&&
336 target
== inst
->target
&&
338 header_present
== inst
->header_present
&&
339 shadow_compare
== inst
->shadow_compare
&&
340 offset
== inst
->offset
);
344 fs_inst::overwrites_reg(const fs_reg
®
)
346 return (reg
.file
== dst
.file
&&
347 reg
.reg
== dst
.reg
&&
348 reg
.reg_offset
>= dst
.reg_offset
&&
349 reg
.reg_offset
< dst
.reg_offset
+ regs_written
);
353 fs_inst::is_send_from_grf()
355 return (opcode
== FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GEN7
||
356 opcode
== SHADER_OPCODE_SHADER_TIME_ADD
||
357 (opcode
== FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
&&
358 src
[1].file
== GRF
) ||
359 (is_tex() && src
[0].file
== GRF
));
363 fs_visitor::can_do_source_mods(fs_inst
*inst
)
365 if (brw
->gen
== 6 && inst
->is_math())
368 if (inst
->is_send_from_grf())
371 if (!inst
->can_do_source_mods())
380 memset(this, 0, sizeof(*this));
384 /** Generic unset register constructor. */
388 this->file
= BAD_FILE
;
391 /** Immediate value constructor. */
392 fs_reg::fs_reg(float f
)
396 this->type
= BRW_REGISTER_TYPE_F
;
400 /** Immediate value constructor. */
401 fs_reg::fs_reg(int32_t i
)
405 this->type
= BRW_REGISTER_TYPE_D
;
409 /** Immediate value constructor. */
410 fs_reg::fs_reg(uint32_t u
)
414 this->type
= BRW_REGISTER_TYPE_UD
;
418 /** Fixed brw_reg Immediate value constructor. */
419 fs_reg::fs_reg(struct brw_reg fixed_hw_reg
)
423 this->fixed_hw_reg
= fixed_hw_reg
;
424 this->type
= fixed_hw_reg
.type
;
428 fs_reg::equals(const fs_reg
&r
) const
430 return (file
== r
.file
&&
432 reg_offset
== r
.reg_offset
&&
434 negate
== r
.negate
&&
436 !reladdr
&& !r
.reladdr
&&
437 memcmp(&fixed_hw_reg
, &r
.fixed_hw_reg
,
438 sizeof(fixed_hw_reg
)) == 0 &&
444 fs_reg::retype(uint32_t type
)
446 fs_reg result
= *this;
452 fs_reg::is_zero() const
457 return type
== BRW_REGISTER_TYPE_F
? imm
.f
== 0.0 : imm
.i
== 0;
461 fs_reg::is_one() const
466 return type
== BRW_REGISTER_TYPE_F
? imm
.f
== 1.0 : imm
.i
== 1;
470 fs_reg::is_null() const
472 return file
== HW_REG
&&
473 fixed_hw_reg
.file
== BRW_ARCHITECTURE_REGISTER_FILE
&&
474 fixed_hw_reg
.nr
== BRW_ARF_NULL
;
478 fs_reg::is_valid_3src() const
480 return file
== GRF
|| file
== UNIFORM
;
484 fs_visitor::type_size(const struct glsl_type
*type
)
486 unsigned int size
, i
;
488 switch (type
->base_type
) {
491 case GLSL_TYPE_FLOAT
:
493 return type
->components();
494 case GLSL_TYPE_ARRAY
:
495 return type_size(type
->fields
.array
) * type
->length
;
496 case GLSL_TYPE_STRUCT
:
498 for (i
= 0; i
< type
->length
; i
++) {
499 size
+= type_size(type
->fields
.structure
[i
].type
);
502 case GLSL_TYPE_SAMPLER
:
503 /* Samplers take up no register space, since they're baked in at
507 case GLSL_TYPE_ATOMIC_UINT
:
510 case GLSL_TYPE_ERROR
:
511 case GLSL_TYPE_INTERFACE
:
512 assert(!"not reached");
520 fs_visitor::get_timestamp()
522 assert(brw
->gen
>= 7);
524 fs_reg ts
= fs_reg(retype(brw_vec1_reg(BRW_ARCHITECTURE_REGISTER_FILE
,
527 BRW_REGISTER_TYPE_UD
));
529 fs_reg dst
= fs_reg(this, glsl_type::uint_type
);
531 fs_inst
*mov
= emit(MOV(dst
, ts
));
532 /* We want to read the 3 fields we care about (mostly field 0, but also 2)
533 * even if it's not enabled in the dispatch.
535 mov
->force_writemask_all
= true;
536 mov
->force_uncompressed
= true;
538 /* The caller wants the low 32 bits of the timestamp. Since it's running
539 * at the GPU clock rate of ~1.2ghz, it will roll over every ~3 seconds,
540 * which is plenty of time for our purposes. It is identical across the
541 * EUs, but since it's tracking GPU core speed it will increment at a
542 * varying rate as render P-states change.
544 * The caller could also check if render P-states have changed (or anything
545 * else that might disrupt timing) by setting smear to 2 and checking if
546 * that field is != 0.
554 fs_visitor::emit_shader_time_begin()
556 current_annotation
= "shader time start";
557 shader_start_time
= get_timestamp();
561 fs_visitor::emit_shader_time_end()
563 current_annotation
= "shader time end";
565 enum shader_time_shader_type type
, written_type
, reset_type
;
566 if (dispatch_width
== 8) {
568 written_type
= ST_FS8_WRITTEN
;
569 reset_type
= ST_FS8_RESET
;
571 assert(dispatch_width
== 16);
573 written_type
= ST_FS16_WRITTEN
;
574 reset_type
= ST_FS16_RESET
;
577 fs_reg shader_end_time
= get_timestamp();
579 /* Check that there weren't any timestamp reset events (assuming these
580 * were the only two timestamp reads that happened).
582 fs_reg reset
= shader_end_time
;
584 fs_inst
*test
= emit(AND(reg_null_d
, reset
, fs_reg(1u)));
585 test
->conditional_mod
= BRW_CONDITIONAL_Z
;
586 emit(IF(BRW_PREDICATE_NORMAL
));
588 push_force_uncompressed();
589 fs_reg start
= shader_start_time
;
591 fs_reg diff
= fs_reg(this, glsl_type::uint_type
);
592 emit(ADD(diff
, start
, shader_end_time
));
594 /* If there were no instructions between the two timestamp gets, the diff
595 * is 2 cycles. Remove that overhead, so I can forget about that when
596 * trying to determine the time taken for single instructions.
598 emit(ADD(diff
, diff
, fs_reg(-2u)));
600 emit_shader_time_write(type
, diff
);
601 emit_shader_time_write(written_type
, fs_reg(1u));
602 emit(BRW_OPCODE_ELSE
);
603 emit_shader_time_write(reset_type
, fs_reg(1u));
604 emit(BRW_OPCODE_ENDIF
);
606 pop_force_uncompressed();
610 fs_visitor::emit_shader_time_write(enum shader_time_shader_type type
,
613 int shader_time_index
=
614 brw_get_shader_time_index(brw
, shader_prog
, &fp
->Base
, type
);
615 fs_reg offset
= fs_reg(shader_time_index
* SHADER_TIME_STRIDE
);
618 if (dispatch_width
== 8)
619 payload
= fs_reg(this, glsl_type::uvec2_type
);
621 payload
= fs_reg(this, glsl_type::uint_type
);
623 emit(fs_inst(SHADER_OPCODE_SHADER_TIME_ADD
,
624 fs_reg(), payload
, offset
, value
));
628 fs_visitor::fail(const char *format
, ...)
638 va_start(va
, format
);
639 msg
= ralloc_vasprintf(mem_ctx
, format
, va
);
641 msg
= ralloc_asprintf(mem_ctx
, "FS compile failed: %s\n", msg
);
643 this->fail_msg
= msg
;
645 if (INTEL_DEBUG
& DEBUG_WM
) {
646 fprintf(stderr
, "%s", msg
);
651 fs_visitor::emit(enum opcode opcode
)
653 return emit(fs_inst(opcode
));
657 fs_visitor::emit(enum opcode opcode
, fs_reg dst
)
659 return emit(fs_inst(opcode
, dst
));
663 fs_visitor::emit(enum opcode opcode
, fs_reg dst
, fs_reg src0
)
665 return emit(fs_inst(opcode
, dst
, src0
));
669 fs_visitor::emit(enum opcode opcode
, fs_reg dst
, fs_reg src0
, fs_reg src1
)
671 return emit(fs_inst(opcode
, dst
, src0
, src1
));
675 fs_visitor::emit(enum opcode opcode
, fs_reg dst
,
676 fs_reg src0
, fs_reg src1
, fs_reg src2
)
678 return emit(fs_inst(opcode
, dst
, src0
, src1
, src2
));
682 fs_visitor::push_force_uncompressed()
684 force_uncompressed_stack
++;
688 fs_visitor::pop_force_uncompressed()
690 force_uncompressed_stack
--;
691 assert(force_uncompressed_stack
>= 0);
695 fs_visitor::push_force_sechalf()
697 force_sechalf_stack
++;
701 fs_visitor::pop_force_sechalf()
703 force_sechalf_stack
--;
704 assert(force_sechalf_stack
>= 0);
708 * Returns true if the instruction has a flag that means it won't
709 * update an entire destination register.
711 * For example, dead code elimination and live variable analysis want to know
712 * when a write to a variable screens off any preceding values that were in
716 fs_inst::is_partial_write()
718 return ((this->predicate
&& this->opcode
!= BRW_OPCODE_SEL
) ||
719 this->force_uncompressed
||
720 this->force_sechalf
);
724 fs_inst::regs_read(fs_visitor
*v
, int arg
)
726 if (is_tex() && arg
== 0 && src
[0].file
== GRF
) {
727 if (v
->dispatch_width
== 16)
728 return (mlen
+ 1) / 2;
736 fs_inst::reads_flag()
742 fs_inst::writes_flag()
744 return (conditional_mod
&& opcode
!= BRW_OPCODE_SEL
) ||
745 opcode
== FS_OPCODE_MOV_DISPATCH_TO_FLAGS
;
749 * Returns how many MRFs an FS opcode will write over.
751 * Note that this is not the 0 or 1 implied writes in an actual gen
752 * instruction -- the FS opcodes often generate MOVs in addition.
755 fs_visitor::implied_mrf_writes(fs_inst
*inst
)
760 if (inst
->base_mrf
== -1)
763 switch (inst
->opcode
) {
764 case SHADER_OPCODE_RCP
:
765 case SHADER_OPCODE_RSQ
:
766 case SHADER_OPCODE_SQRT
:
767 case SHADER_OPCODE_EXP2
:
768 case SHADER_OPCODE_LOG2
:
769 case SHADER_OPCODE_SIN
:
770 case SHADER_OPCODE_COS
:
771 return 1 * dispatch_width
/ 8;
772 case SHADER_OPCODE_POW
:
773 case SHADER_OPCODE_INT_QUOTIENT
:
774 case SHADER_OPCODE_INT_REMAINDER
:
775 return 2 * dispatch_width
/ 8;
776 case SHADER_OPCODE_TEX
:
778 case SHADER_OPCODE_TXD
:
779 case SHADER_OPCODE_TXF
:
780 case SHADER_OPCODE_TXF_MS
:
781 case SHADER_OPCODE_TG4
:
782 case SHADER_OPCODE_TG4_OFFSET
:
783 case SHADER_OPCODE_TXL
:
784 case SHADER_OPCODE_TXS
:
785 case SHADER_OPCODE_LOD
:
787 case FS_OPCODE_FB_WRITE
:
789 case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
:
790 case SHADER_OPCODE_GEN4_SCRATCH_READ
:
792 case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD
:
794 case SHADER_OPCODE_GEN4_SCRATCH_WRITE
:
796 case SHADER_OPCODE_UNTYPED_ATOMIC
:
797 case SHADER_OPCODE_UNTYPED_SURFACE_READ
:
800 assert(!"not reached");
806 fs_visitor::virtual_grf_alloc(int size
)
808 if (virtual_grf_array_size
<= virtual_grf_count
) {
809 if (virtual_grf_array_size
== 0)
810 virtual_grf_array_size
= 16;
812 virtual_grf_array_size
*= 2;
813 virtual_grf_sizes
= reralloc(mem_ctx
, virtual_grf_sizes
, int,
814 virtual_grf_array_size
);
816 virtual_grf_sizes
[virtual_grf_count
] = size
;
817 return virtual_grf_count
++;
820 /** Fixed HW reg constructor. */
821 fs_reg::fs_reg(enum register_file file
, int reg
)
826 this->type
= BRW_REGISTER_TYPE_F
;
829 /** Fixed HW reg constructor. */
830 fs_reg::fs_reg(enum register_file file
, int reg
, uint32_t type
)
838 /** Automatic reg constructor. */
839 fs_reg::fs_reg(class fs_visitor
*v
, const struct glsl_type
*type
)
844 this->reg
= v
->virtual_grf_alloc(v
->type_size(type
));
845 this->reg_offset
= 0;
846 this->type
= brw_type_for_base_type(type
);
850 fs_visitor::variable_storage(ir_variable
*var
)
852 return (fs_reg
*)hash_table_find(this->variable_ht
, var
);
856 import_uniforms_callback(const void *key
,
860 struct hash_table
*dst_ht
= (struct hash_table
*)closure
;
861 const fs_reg
*reg
= (const fs_reg
*)data
;
863 if (reg
->file
!= UNIFORM
)
866 hash_table_insert(dst_ht
, data
, key
);
869 /* For 16-wide, we need to follow from the uniform setup of 8-wide dispatch.
870 * This brings in those uniform definitions
873 fs_visitor::import_uniforms(fs_visitor
*v
)
875 hash_table_call_foreach(v
->variable_ht
,
876 import_uniforms_callback
,
878 this->params_remap
= v
->params_remap
;
879 this->nr_params_remap
= v
->nr_params_remap
;
882 /* Our support for uniforms is piggy-backed on the struct
883 * gl_fragment_program, because that's where the values actually
884 * get stored, rather than in some global gl_shader_program uniform
888 fs_visitor::setup_uniform_values(ir_variable
*ir
)
890 int namelen
= strlen(ir
->name
);
892 /* The data for our (non-builtin) uniforms is stored in a series of
893 * gl_uniform_driver_storage structs for each subcomponent that
894 * glGetUniformLocation() could name. We know it's been set up in the same
895 * order we'd walk the type, so walk the list of storage and find anything
896 * with our name, or the prefix of a component that starts with our name.
898 unsigned params_before
= c
->prog_data
.nr_params
;
899 for (unsigned u
= 0; u
< shader_prog
->NumUserUniformStorage
; u
++) {
900 struct gl_uniform_storage
*storage
= &shader_prog
->UniformStorage
[u
];
902 if (strncmp(ir
->name
, storage
->name
, namelen
) != 0 ||
903 (storage
->name
[namelen
] != 0 &&
904 storage
->name
[namelen
] != '.' &&
905 storage
->name
[namelen
] != '[')) {
909 unsigned slots
= storage
->type
->component_slots();
910 if (storage
->array_elements
)
911 slots
*= storage
->array_elements
;
913 for (unsigned i
= 0; i
< slots
; i
++) {
914 c
->prog_data
.param
[c
->prog_data
.nr_params
++] =
915 &storage
->storage
[i
].f
;
919 /* Make sure we actually initialized the right amount of stuff here. */
920 assert(params_before
+ ir
->type
->component_slots() ==
921 c
->prog_data
.nr_params
);
926 /* Our support for builtin uniforms is even scarier than non-builtin.
927 * It sits on top of the PROG_STATE_VAR parameters that are
928 * automatically updated from GL context state.
931 fs_visitor::setup_builtin_uniform_values(ir_variable
*ir
)
933 const ir_state_slot
*const slots
= ir
->state_slots
;
934 assert(ir
->state_slots
!= NULL
);
936 for (unsigned int i
= 0; i
< ir
->num_state_slots
; i
++) {
937 /* This state reference has already been setup by ir_to_mesa, but we'll
938 * get the same index back here.
940 int index
= _mesa_add_state_reference(this->fp
->Base
.Parameters
,
941 (gl_state_index
*)slots
[i
].tokens
);
943 /* Add each of the unique swizzles of the element as a parameter.
944 * This'll end up matching the expected layout of the
945 * array/matrix/structure we're trying to fill in.
948 for (unsigned int j
= 0; j
< 4; j
++) {
949 int swiz
= GET_SWZ(slots
[i
].swizzle
, j
);
950 if (swiz
== last_swiz
)
954 c
->prog_data
.param
[c
->prog_data
.nr_params
++] =
955 &fp
->Base
.Parameters
->ParameterValues
[index
][swiz
].f
;
961 fs_visitor::emit_fragcoord_interpolation(ir_variable
*ir
)
963 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(this, ir
->type
);
965 bool flip
= !ir
->origin_upper_left
^ c
->key
.render_to_fbo
;
968 if (ir
->pixel_center_integer
) {
969 emit(MOV(wpos
, this->pixel_x
));
971 emit(ADD(wpos
, this->pixel_x
, fs_reg(0.5f
)));
976 if (!flip
&& ir
->pixel_center_integer
) {
977 emit(MOV(wpos
, this->pixel_y
));
979 fs_reg pixel_y
= this->pixel_y
;
980 float offset
= (ir
->pixel_center_integer
? 0.0 : 0.5);
983 pixel_y
.negate
= true;
984 offset
+= c
->key
.drawable_height
- 1.0;
987 emit(ADD(wpos
, pixel_y
, fs_reg(offset
)));
993 emit(MOV(wpos
, fs_reg(brw_vec8_grf(c
->source_depth_reg
, 0))));
995 emit(FS_OPCODE_LINTERP
, wpos
,
996 this->delta_x
[BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
],
997 this->delta_y
[BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
],
998 interp_reg(VARYING_SLOT_POS
, 2));
1002 /* gl_FragCoord.w: Already set up in emit_interpolation */
1003 emit(BRW_OPCODE_MOV
, wpos
, this->wpos_w
);
1009 fs_visitor::emit_linterp(const fs_reg
&attr
, const fs_reg
&interp
,
1010 glsl_interp_qualifier interpolation_mode
,
1013 brw_wm_barycentric_interp_mode barycoord_mode
;
1014 if (brw
->gen
>= 6) {
1016 if (interpolation_mode
== INTERP_QUALIFIER_SMOOTH
)
1017 barycoord_mode
= BRW_WM_PERSPECTIVE_CENTROID_BARYCENTRIC
;
1019 barycoord_mode
= BRW_WM_NONPERSPECTIVE_CENTROID_BARYCENTRIC
;
1021 if (interpolation_mode
== INTERP_QUALIFIER_SMOOTH
)
1022 barycoord_mode
= BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
;
1024 barycoord_mode
= BRW_WM_NONPERSPECTIVE_PIXEL_BARYCENTRIC
;
1027 /* On Ironlake and below, there is only one interpolation mode.
1028 * Centroid interpolation doesn't mean anything on this hardware --
1029 * there is no multisampling.
1031 barycoord_mode
= BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
;
1033 return emit(FS_OPCODE_LINTERP
, attr
,
1034 this->delta_x
[barycoord_mode
],
1035 this->delta_y
[barycoord_mode
], interp
);
1039 fs_visitor::emit_general_interpolation(ir_variable
*ir
)
1041 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(this, ir
->type
);
1042 reg
->type
= brw_type_for_base_type(ir
->type
->get_scalar_type());
1045 unsigned int array_elements
;
1046 const glsl_type
*type
;
1048 if (ir
->type
->is_array()) {
1049 array_elements
= ir
->type
->length
;
1050 if (array_elements
== 0) {
1051 fail("dereferenced array '%s' has length 0\n", ir
->name
);
1053 type
= ir
->type
->fields
.array
;
1059 glsl_interp_qualifier interpolation_mode
=
1060 ir
->determine_interpolation_mode(c
->key
.flat_shade
);
1062 int location
= ir
->location
;
1063 for (unsigned int i
= 0; i
< array_elements
; i
++) {
1064 for (unsigned int j
= 0; j
< type
->matrix_columns
; j
++) {
1065 if (c
->prog_data
.urb_setup
[location
] == -1) {
1066 /* If there's no incoming setup data for this slot, don't
1067 * emit interpolation for it.
1069 attr
.reg_offset
+= type
->vector_elements
;
1074 if (interpolation_mode
== INTERP_QUALIFIER_FLAT
) {
1075 /* Constant interpolation (flat shading) case. The SF has
1076 * handed us defined values in only the constant offset
1077 * field of the setup reg.
1079 for (unsigned int k
= 0; k
< type
->vector_elements
; k
++) {
1080 struct brw_reg interp
= interp_reg(location
, k
);
1081 interp
= suboffset(interp
, 3);
1082 interp
.type
= reg
->type
;
1083 emit(FS_OPCODE_CINTERP
, attr
, fs_reg(interp
));
1087 /* Smooth/noperspective interpolation case. */
1088 for (unsigned int k
= 0; k
< type
->vector_elements
; k
++) {
1089 /* FINISHME: At some point we probably want to push
1090 * this farther by giving similar treatment to the
1091 * other potentially constant components of the
1092 * attribute, as well as making brw_vs_constval.c
1093 * handle varyings other than gl_TexCoord.
1095 struct brw_reg interp
= interp_reg(location
, k
);
1096 emit_linterp(attr
, fs_reg(interp
), interpolation_mode
,
1098 if (brw
->needs_unlit_centroid_workaround
&& ir
->centroid
) {
1099 /* Get the pixel/sample mask into f0 so that we know
1100 * which pixels are lit. Then, for each channel that is
1101 * unlit, replace the centroid data with non-centroid
1104 emit(FS_OPCODE_MOV_DISPATCH_TO_FLAGS
);
1105 fs_inst
*inst
= emit_linterp(attr
, fs_reg(interp
),
1106 interpolation_mode
, false);
1107 inst
->predicate
= BRW_PREDICATE_NORMAL
;
1108 inst
->predicate_inverse
= true;
1110 if (brw
->gen
< 6 && interpolation_mode
== INTERP_QUALIFIER_SMOOTH
) {
1111 emit(BRW_OPCODE_MUL
, attr
, attr
, this->pixel_w
);
1125 fs_visitor::emit_frontfacing_interpolation(ir_variable
*ir
)
1127 fs_reg
*reg
= new(this->mem_ctx
) fs_reg(this, ir
->type
);
1129 /* The frontfacing comes in as a bit in the thread payload. */
1130 if (brw
->gen
>= 6) {
1131 emit(BRW_OPCODE_ASR
, *reg
,
1132 fs_reg(retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_D
)),
1134 emit(BRW_OPCODE_NOT
, *reg
, *reg
);
1135 emit(BRW_OPCODE_AND
, *reg
, *reg
, fs_reg(1));
1137 struct brw_reg r1_6ud
= retype(brw_vec1_grf(1, 6), BRW_REGISTER_TYPE_UD
);
1138 /* bit 31 is "primitive is back face", so checking < (1 << 31) gives
1141 emit(CMP(*reg
, fs_reg(r1_6ud
), fs_reg(1u << 31), BRW_CONDITIONAL_L
));
1142 emit(BRW_OPCODE_AND
, *reg
, *reg
, fs_reg(1u));
1149 fs_visitor::fix_math_operand(fs_reg src
)
1151 /* Can't do hstride == 0 args on gen6 math, so expand it out. We
1152 * might be able to do better by doing execsize = 1 math and then
1153 * expanding that result out, but we would need to be careful with
1156 * The hardware ignores source modifiers (negate and abs) on math
1157 * instructions, so we also move to a temp to set those up.
1159 if (brw
->gen
== 6 && src
.file
!= UNIFORM
&& src
.file
!= IMM
&&
1160 !src
.abs
&& !src
.negate
)
1163 /* Gen7 relaxes most of the above restrictions, but still can't use IMM
1166 if (brw
->gen
>= 7 && src
.file
!= IMM
)
1169 fs_reg expanded
= fs_reg(this, glsl_type::float_type
);
1170 expanded
.type
= src
.type
;
1171 emit(BRW_OPCODE_MOV
, expanded
, src
);
1176 fs_visitor::emit_math(enum opcode opcode
, fs_reg dst
, fs_reg src
)
1179 case SHADER_OPCODE_RCP
:
1180 case SHADER_OPCODE_RSQ
:
1181 case SHADER_OPCODE_SQRT
:
1182 case SHADER_OPCODE_EXP2
:
1183 case SHADER_OPCODE_LOG2
:
1184 case SHADER_OPCODE_SIN
:
1185 case SHADER_OPCODE_COS
:
1188 assert(!"not reached: bad math opcode");
1192 /* Can't do hstride == 0 args to gen6 math, so expand it out. We
1193 * might be able to do better by doing execsize = 1 math and then
1194 * expanding that result out, but we would need to be careful with
1197 * Gen 6 hardware ignores source modifiers (negate and abs) on math
1198 * instructions, so we also move to a temp to set those up.
1201 src
= fix_math_operand(src
);
1203 fs_inst
*inst
= emit(opcode
, dst
, src
);
1207 inst
->mlen
= dispatch_width
/ 8;
1214 fs_visitor::emit_math(enum opcode opcode
, fs_reg dst
, fs_reg src0
, fs_reg src1
)
1220 case SHADER_OPCODE_INT_QUOTIENT
:
1221 case SHADER_OPCODE_INT_REMAINDER
:
1222 if (brw
->gen
>= 7 && dispatch_width
== 16)
1223 fail("16-wide INTDIV unsupported\n");
1225 case SHADER_OPCODE_POW
:
1228 assert(!"not reached: unsupported binary math opcode.");
1232 if (brw
->gen
>= 6) {
1233 src0
= fix_math_operand(src0
);
1234 src1
= fix_math_operand(src1
);
1236 inst
= emit(opcode
, dst
, src0
, src1
);
1238 /* From the Ironlake PRM, Volume 4, Part 1, Section 6.1.13
1239 * "Message Payload":
1241 * "Operand0[7]. For the INT DIV functions, this operand is the
1244 * "Operand1[7]. For the INT DIV functions, this operand is the
1247 bool is_int_div
= opcode
!= SHADER_OPCODE_POW
;
1248 fs_reg
&op0
= is_int_div
? src1
: src0
;
1249 fs_reg
&op1
= is_int_div
? src0
: src1
;
1251 emit(BRW_OPCODE_MOV
, fs_reg(MRF
, base_mrf
+ 1, op1
.type
), op1
);
1252 inst
= emit(opcode
, dst
, op0
, reg_null_f
);
1254 inst
->base_mrf
= base_mrf
;
1255 inst
->mlen
= 2 * dispatch_width
/ 8;
1261 fs_visitor::assign_curb_setup()
1263 c
->prog_data
.curb_read_length
= ALIGN(c
->prog_data
.nr_params
, 8) / 8;
1264 if (dispatch_width
== 8) {
1265 c
->prog_data
.first_curbe_grf
= c
->nr_payload_regs
;
1267 c
->prog_data
.first_curbe_grf_16
= c
->nr_payload_regs
;
1270 /* Map the offsets in the UNIFORM file to fixed HW regs. */
1271 foreach_list(node
, &this->instructions
) {
1272 fs_inst
*inst
= (fs_inst
*)node
;
1274 for (unsigned int i
= 0; i
< 3; i
++) {
1275 if (inst
->src
[i
].file
== UNIFORM
) {
1276 int constant_nr
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
;
1277 struct brw_reg brw_reg
= brw_vec1_grf(c
->nr_payload_regs
+
1281 inst
->src
[i
].file
= HW_REG
;
1282 inst
->src
[i
].fixed_hw_reg
= retype(brw_reg
, inst
->src
[i
].type
);
1289 fs_visitor::calculate_urb_setup()
1291 for (unsigned int i
= 0; i
< VARYING_SLOT_MAX
; i
++) {
1292 c
->prog_data
.urb_setup
[i
] = -1;
1296 /* Figure out where each of the incoming setup attributes lands. */
1297 if (brw
->gen
>= 6) {
1298 if (_mesa_bitcount_64(fp
->Base
.InputsRead
&
1299 BRW_FS_VARYING_INPUT_MASK
) <= 16) {
1300 /* The SF/SBE pipeline stage can do arbitrary rearrangement of the
1301 * first 16 varying inputs, so we can put them wherever we want.
1302 * Just put them in order.
1304 * This is useful because it means that (a) inputs not used by the
1305 * fragment shader won't take up valuable register space, and (b) we
1306 * won't have to recompile the fragment shader if it gets paired with
1307 * a different vertex (or geometry) shader.
1309 for (unsigned int i
= 0; i
< VARYING_SLOT_MAX
; i
++) {
1310 if (fp
->Base
.InputsRead
& BRW_FS_VARYING_INPUT_MASK
&
1311 BITFIELD64_BIT(i
)) {
1312 c
->prog_data
.urb_setup
[i
] = urb_next
++;
1316 /* We have enough input varyings that the SF/SBE pipeline stage can't
1317 * arbitrarily rearrange them to suit our whim; we have to put them
1318 * in an order that matches the output of the previous pipeline stage
1319 * (geometry or vertex shader).
1321 struct brw_vue_map prev_stage_vue_map
;
1322 brw_compute_vue_map(brw
, &prev_stage_vue_map
,
1323 c
->key
.input_slots_valid
);
1324 int first_slot
= 2 * BRW_SF_URB_ENTRY_READ_OFFSET
;
1325 assert(prev_stage_vue_map
.num_slots
<= first_slot
+ 32);
1326 for (int slot
= first_slot
; slot
< prev_stage_vue_map
.num_slots
;
1328 int varying
= prev_stage_vue_map
.slot_to_varying
[slot
];
1329 /* Note that varying == BRW_VARYING_SLOT_COUNT when a slot is
1332 if (varying
!= BRW_VARYING_SLOT_COUNT
&&
1333 (fp
->Base
.InputsRead
& BRW_FS_VARYING_INPUT_MASK
&
1334 BITFIELD64_BIT(varying
))) {
1335 c
->prog_data
.urb_setup
[varying
] = slot
- first_slot
;
1338 urb_next
= prev_stage_vue_map
.num_slots
- first_slot
;
1341 /* FINISHME: The sf doesn't map VS->FS inputs for us very well. */
1342 for (unsigned int i
= 0; i
< VARYING_SLOT_MAX
; i
++) {
1343 /* Point size is packed into the header, not as a general attribute */
1344 if (i
== VARYING_SLOT_PSIZ
)
1347 if (c
->key
.input_slots_valid
& BITFIELD64_BIT(i
)) {
1348 /* The back color slot is skipped when the front color is
1349 * also written to. In addition, some slots can be
1350 * written in the vertex shader and not read in the
1351 * fragment shader. So the register number must always be
1352 * incremented, mapped or not.
1354 if (_mesa_varying_slot_in_fs((gl_varying_slot
) i
))
1355 c
->prog_data
.urb_setup
[i
] = urb_next
;
1361 * It's a FS only attribute, and we did interpolation for this attribute
1362 * in SF thread. So, count it here, too.
1364 * See compile_sf_prog() for more info.
1366 if (fp
->Base
.InputsRead
& BITFIELD64_BIT(VARYING_SLOT_PNTC
))
1367 c
->prog_data
.urb_setup
[VARYING_SLOT_PNTC
] = urb_next
++;
1370 c
->prog_data
.num_varying_inputs
= urb_next
;
1374 fs_visitor::assign_urb_setup()
1376 int urb_start
= c
->nr_payload_regs
+ c
->prog_data
.curb_read_length
;
1378 /* Offset all the urb_setup[] index by the actual position of the
1379 * setup regs, now that the location of the constants has been chosen.
1381 foreach_list(node
, &this->instructions
) {
1382 fs_inst
*inst
= (fs_inst
*)node
;
1384 if (inst
->opcode
== FS_OPCODE_LINTERP
) {
1385 assert(inst
->src
[2].file
== HW_REG
);
1386 inst
->src
[2].fixed_hw_reg
.nr
+= urb_start
;
1389 if (inst
->opcode
== FS_OPCODE_CINTERP
) {
1390 assert(inst
->src
[0].file
== HW_REG
);
1391 inst
->src
[0].fixed_hw_reg
.nr
+= urb_start
;
1395 /* Each attribute is 4 setup channels, each of which is half a reg. */
1396 this->first_non_payload_grf
=
1397 urb_start
+ c
->prog_data
.num_varying_inputs
* 2;
1401 * Split large virtual GRFs into separate components if we can.
1403 * This is mostly duplicated with what brw_fs_vector_splitting does,
1404 * but that's really conservative because it's afraid of doing
1405 * splitting that doesn't result in real progress after the rest of
1406 * the optimization phases, which would cause infinite looping in
1407 * optimization. We can do it once here, safely. This also has the
1408 * opportunity to split interpolated values, or maybe even uniforms,
1409 * which we don't have at the IR level.
1411 * We want to split, because virtual GRFs are what we register
1412 * allocate and spill (due to contiguousness requirements for some
1413 * instructions), and they're what we naturally generate in the
1414 * codegen process, but most virtual GRFs don't actually need to be
1415 * contiguous sets of GRFs. If we split, we'll end up with reduced
1416 * live intervals and better dead code elimination and coalescing.
1419 fs_visitor::split_virtual_grfs()
1421 int num_vars
= this->virtual_grf_count
;
1422 bool split_grf
[num_vars
];
1423 int new_virtual_grf
[num_vars
];
1425 /* Try to split anything > 0 sized. */
1426 for (int i
= 0; i
< num_vars
; i
++) {
1427 if (this->virtual_grf_sizes
[i
] != 1)
1428 split_grf
[i
] = true;
1430 split_grf
[i
] = false;
1434 this->delta_x
[BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
].file
== GRF
) {
1435 /* PLN opcodes rely on the delta_xy being contiguous. We only have to
1436 * check this for BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC, because prior to
1437 * Gen6, that was the only supported interpolation mode, and since Gen6,
1438 * delta_x and delta_y are in fixed hardware registers.
1440 split_grf
[this->delta_x
[BRW_WM_PERSPECTIVE_PIXEL_BARYCENTRIC
].reg
] =
1444 foreach_list(node
, &this->instructions
) {
1445 fs_inst
*inst
= (fs_inst
*)node
;
1447 /* If there's a SEND message that requires contiguous destination
1448 * registers, no splitting is allowed.
1450 if (inst
->regs_written
> 1) {
1451 split_grf
[inst
->dst
.reg
] = false;
1454 /* If we're sending from a GRF, don't split it, on the assumption that
1455 * the send is reading the whole thing.
1457 if (inst
->is_send_from_grf()) {
1458 for (int i
= 0; i
< 3; i
++) {
1459 if (inst
->src
[i
].file
== GRF
) {
1460 split_grf
[inst
->src
[i
].reg
] = false;
1466 /* Allocate new space for split regs. Note that the virtual
1467 * numbers will be contiguous.
1469 for (int i
= 0; i
< num_vars
; i
++) {
1471 new_virtual_grf
[i
] = virtual_grf_alloc(1);
1472 for (int j
= 2; j
< this->virtual_grf_sizes
[i
]; j
++) {
1473 int reg
= virtual_grf_alloc(1);
1474 assert(reg
== new_virtual_grf
[i
] + j
- 1);
1477 this->virtual_grf_sizes
[i
] = 1;
1481 foreach_list(node
, &this->instructions
) {
1482 fs_inst
*inst
= (fs_inst
*)node
;
1484 if (inst
->dst
.file
== GRF
&&
1485 split_grf
[inst
->dst
.reg
] &&
1486 inst
->dst
.reg_offset
!= 0) {
1487 inst
->dst
.reg
= (new_virtual_grf
[inst
->dst
.reg
] +
1488 inst
->dst
.reg_offset
- 1);
1489 inst
->dst
.reg_offset
= 0;
1491 for (int i
= 0; i
< 3; i
++) {
1492 if (inst
->src
[i
].file
== GRF
&&
1493 split_grf
[inst
->src
[i
].reg
] &&
1494 inst
->src
[i
].reg_offset
!= 0) {
1495 inst
->src
[i
].reg
= (new_virtual_grf
[inst
->src
[i
].reg
] +
1496 inst
->src
[i
].reg_offset
- 1);
1497 inst
->src
[i
].reg_offset
= 0;
1501 invalidate_live_intervals();
1505 * Remove unused virtual GRFs and compact the virtual_grf_* arrays.
1507 * During code generation, we create tons of temporary variables, many of
1508 * which get immediately killed and are never used again. Yet, in later
1509 * optimization and analysis passes, such as compute_live_intervals, we need
1510 * to loop over all the virtual GRFs. Compacting them can save a lot of
1514 fs_visitor::compact_virtual_grfs()
1516 /* Mark which virtual GRFs are used, and count how many. */
1517 int remap_table
[this->virtual_grf_count
];
1518 memset(remap_table
, -1, sizeof(remap_table
));
1520 foreach_list(node
, &this->instructions
) {
1521 const fs_inst
*inst
= (const fs_inst
*) node
;
1523 if (inst
->dst
.file
== GRF
)
1524 remap_table
[inst
->dst
.reg
] = 0;
1526 for (int i
= 0; i
< 3; i
++) {
1527 if (inst
->src
[i
].file
== GRF
)
1528 remap_table
[inst
->src
[i
].reg
] = 0;
1532 /* In addition to registers used in instructions, fs_visitor keeps
1533 * direct references to certain special values which must be patched:
1535 fs_reg
*special
[] = {
1536 &frag_depth
, &pixel_x
, &pixel_y
, &pixel_w
, &wpos_w
, &dual_src_output
,
1537 &outputs
[0], &outputs
[1], &outputs
[2], &outputs
[3],
1538 &outputs
[4], &outputs
[5], &outputs
[6], &outputs
[7],
1539 &delta_x
[0], &delta_x
[1], &delta_x
[2],
1540 &delta_x
[3], &delta_x
[4], &delta_x
[5],
1541 &delta_y
[0], &delta_y
[1], &delta_y
[2],
1542 &delta_y
[3], &delta_y
[4], &delta_y
[5],
1544 STATIC_ASSERT(BRW_WM_BARYCENTRIC_INTERP_MODE_COUNT
== 6);
1545 STATIC_ASSERT(BRW_MAX_DRAW_BUFFERS
== 8);
1547 /* Treat all special values as used, to be conservative */
1548 for (unsigned i
= 0; i
< ARRAY_SIZE(special
); i
++) {
1549 if (special
[i
]->file
== GRF
)
1550 remap_table
[special
[i
]->reg
] = 0;
1553 /* Compact the GRF arrays. */
1555 for (int i
= 0; i
< this->virtual_grf_count
; i
++) {
1556 if (remap_table
[i
] != -1) {
1557 remap_table
[i
] = new_index
;
1558 virtual_grf_sizes
[new_index
] = virtual_grf_sizes
[i
];
1559 invalidate_live_intervals();
1564 this->virtual_grf_count
= new_index
;
1566 /* Patch all the instructions to use the newly renumbered registers */
1567 foreach_list(node
, &this->instructions
) {
1568 fs_inst
*inst
= (fs_inst
*) node
;
1570 if (inst
->dst
.file
== GRF
)
1571 inst
->dst
.reg
= remap_table
[inst
->dst
.reg
];
1573 for (int i
= 0; i
< 3; i
++) {
1574 if (inst
->src
[i
].file
== GRF
)
1575 inst
->src
[i
].reg
= remap_table
[inst
->src
[i
].reg
];
1579 /* Patch all the references to special values */
1580 for (unsigned i
= 0; i
< ARRAY_SIZE(special
); i
++) {
1581 if (special
[i
]->file
== GRF
&& remap_table
[special
[i
]->reg
] != -1)
1582 special
[i
]->reg
= remap_table
[special
[i
]->reg
];
1587 fs_visitor::remove_dead_constants()
1589 if (dispatch_width
== 8) {
1590 this->params_remap
= ralloc_array(mem_ctx
, int, c
->prog_data
.nr_params
);
1591 this->nr_params_remap
= c
->prog_data
.nr_params
;
1593 for (unsigned int i
= 0; i
< c
->prog_data
.nr_params
; i
++)
1594 this->params_remap
[i
] = -1;
1596 /* Find which params are still in use. */
1597 foreach_list(node
, &this->instructions
) {
1598 fs_inst
*inst
= (fs_inst
*)node
;
1600 for (int i
= 0; i
< 3; i
++) {
1601 int constant_nr
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
;
1603 if (inst
->src
[i
].file
!= UNIFORM
)
1606 /* Section 5.11 of the OpenGL 4.3 spec says:
1608 * "Out-of-bounds reads return undefined values, which include
1609 * values from other variables of the active program or zero."
1611 if (constant_nr
< 0 || constant_nr
>= (int)c
->prog_data
.nr_params
) {
1615 /* For now, set this to non-negative. We'll give it the
1616 * actual new number in a moment, in order to keep the
1617 * register numbers nicely ordered.
1619 this->params_remap
[constant_nr
] = 0;
1623 /* Figure out what the new numbers for the params will be. At some
1624 * point when we're doing uniform array access, we're going to want
1625 * to keep the distinction between .reg and .reg_offset, but for
1626 * now we don't care.
1628 unsigned int new_nr_params
= 0;
1629 for (unsigned int i
= 0; i
< c
->prog_data
.nr_params
; i
++) {
1630 if (this->params_remap
[i
] != -1) {
1631 this->params_remap
[i
] = new_nr_params
++;
1635 /* Update the list of params to be uploaded to match our new numbering. */
1636 for (unsigned int i
= 0; i
< c
->prog_data
.nr_params
; i
++) {
1637 int remapped
= this->params_remap
[i
];
1642 c
->prog_data
.param
[remapped
] = c
->prog_data
.param
[i
];
1645 c
->prog_data
.nr_params
= new_nr_params
;
1647 /* This should have been generated in the 8-wide pass already. */
1648 assert(this->params_remap
);
1651 /* Now do the renumbering of the shader to remove unused params. */
1652 foreach_list(node
, &this->instructions
) {
1653 fs_inst
*inst
= (fs_inst
*)node
;
1655 for (int i
= 0; i
< 3; i
++) {
1656 int constant_nr
= inst
->src
[i
].reg
+ inst
->src
[i
].reg_offset
;
1658 if (inst
->src
[i
].file
!= UNIFORM
)
1661 /* as above alias to 0 */
1662 if (constant_nr
< 0 || constant_nr
>= (int)this->nr_params_remap
) {
1665 assert(this->params_remap
[constant_nr
] != -1);
1666 inst
->src
[i
].reg
= this->params_remap
[constant_nr
];
1667 inst
->src
[i
].reg_offset
= 0;
1675 * Implements array access of uniforms by inserting a
1676 * PULL_CONSTANT_LOAD instruction.
1678 * Unlike temporary GRF array access (where we don't support it due to
1679 * the difficulty of doing relative addressing on instruction
1680 * destinations), we could potentially do array access of uniforms
1681 * that were loaded in GRF space as push constants. In real-world
1682 * usage we've seen, though, the arrays being used are always larger
1683 * than we could load as push constants, so just always move all
1684 * uniform array access out to a pull constant buffer.
1687 fs_visitor::move_uniform_array_access_to_pull_constants()
1689 int pull_constant_loc
[c
->prog_data
.nr_params
];
1691 for (unsigned int i
= 0; i
< c
->prog_data
.nr_params
; i
++) {
1692 pull_constant_loc
[i
] = -1;
1695 /* Walk through and find array access of uniforms. Put a copy of that
1696 * uniform in the pull constant buffer.
1698 * Note that we don't move constant-indexed accesses to arrays. No
1699 * testing has been done of the performance impact of this choice.
1701 foreach_list_safe(node
, &this->instructions
) {
1702 fs_inst
*inst
= (fs_inst
*)node
;
1704 for (int i
= 0 ; i
< 3; i
++) {
1705 if (inst
->src
[i
].file
!= UNIFORM
|| !inst
->src
[i
].reladdr
)
1708 int uniform
= inst
->src
[i
].reg
;
1710 /* If this array isn't already present in the pull constant buffer,
1713 if (pull_constant_loc
[uniform
] == -1) {
1714 const float **values
= &c
->prog_data
.param
[uniform
];
1716 pull_constant_loc
[uniform
] = c
->prog_data
.nr_pull_params
;
1718 assert(param_size
[uniform
]);
1720 for (int j
= 0; j
< param_size
[uniform
]; j
++) {
1721 c
->prog_data
.pull_param
[c
->prog_data
.nr_pull_params
++] =
1726 /* Set up the annotation tracking for new generated instructions. */
1728 current_annotation
= inst
->annotation
;
1730 fs_reg surf_index
= fs_reg(c
->prog_data
.base
.binding_table
.pull_constants_start
);
1731 fs_reg temp
= fs_reg(this, glsl_type::float_type
);
1732 exec_list list
= VARYING_PULL_CONSTANT_LOAD(temp
,
1734 *inst
->src
[i
].reladdr
,
1735 pull_constant_loc
[uniform
] +
1736 inst
->src
[i
].reg_offset
);
1737 inst
->insert_before(&list
);
1739 inst
->src
[i
].file
= temp
.file
;
1740 inst
->src
[i
].reg
= temp
.reg
;
1741 inst
->src
[i
].reg_offset
= temp
.reg_offset
;
1742 inst
->src
[i
].reladdr
= NULL
;
1748 * Choose accesses from the UNIFORM file to demote to using the pull
1751 * We allow a fragment shader to have more than the specified minimum
1752 * maximum number of fragment shader uniform components (64). If
1753 * there are too many of these, they'd fill up all of register space.
1754 * So, this will push some of them out to the pull constant buffer and
1755 * update the program to load them.
1758 fs_visitor::setup_pull_constants()
1760 /* Only allow 16 registers (128 uniform components) as push constants. */
1761 unsigned int max_uniform_components
= 16 * 8;
1762 if (c
->prog_data
.nr_params
<= max_uniform_components
)
1765 if (dispatch_width
== 16) {
1766 fail("Pull constants not supported in 16-wide\n");
1770 /* Just demote the end of the list. We could probably do better
1771 * here, demoting things that are rarely used in the program first.
1773 unsigned int pull_uniform_base
= max_uniform_components
;
1775 int pull_constant_loc
[c
->prog_data
.nr_params
];
1776 for (unsigned int i
= 0; i
< c
->prog_data
.nr_params
; i
++) {
1777 if (i
< pull_uniform_base
) {
1778 pull_constant_loc
[i
] = -1;
1780 pull_constant_loc
[i
] = -1;
1781 /* If our constant is already being uploaded for reladdr purposes,
1784 for (unsigned int j
= 0; j
< c
->prog_data
.nr_pull_params
; j
++) {
1785 if (c
->prog_data
.pull_param
[j
] == c
->prog_data
.param
[i
]) {
1786 pull_constant_loc
[i
] = j
;
1790 if (pull_constant_loc
[i
] == -1) {
1791 int pull_index
= c
->prog_data
.nr_pull_params
++;
1792 c
->prog_data
.pull_param
[pull_index
] = c
->prog_data
.param
[i
];
1793 pull_constant_loc
[i
] = pull_index
;;
1797 c
->prog_data
.nr_params
= pull_uniform_base
;
1799 foreach_list(node
, &this->instructions
) {
1800 fs_inst
*inst
= (fs_inst
*)node
;
1802 for (int i
= 0; i
< 3; i
++) {
1803 if (inst
->src
[i
].file
!= UNIFORM
)
1806 int pull_index
= pull_constant_loc
[inst
->src
[i
].reg
+
1807 inst
->src
[i
].reg_offset
];
1808 if (pull_index
== -1)
1811 assert(!inst
->src
[i
].reladdr
);
1813 fs_reg dst
= fs_reg(this, glsl_type::float_type
);
1814 fs_reg index
= fs_reg(c
->prog_data
.base
.binding_table
.pull_constants_start
);
1815 fs_reg offset
= fs_reg((unsigned)(pull_index
* 4) & ~15);
1817 new(mem_ctx
) fs_inst(FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
,
1818 dst
, index
, offset
);
1819 pull
->ir
= inst
->ir
;
1820 pull
->annotation
= inst
->annotation
;
1822 inst
->insert_before(pull
);
1824 inst
->src
[i
].file
= GRF
;
1825 inst
->src
[i
].reg
= dst
.reg
;
1826 inst
->src
[i
].reg_offset
= 0;
1827 inst
->src
[i
].smear
= pull_index
& 3;
1833 fs_visitor::opt_algebraic()
1835 bool progress
= false;
1837 foreach_list(node
, &this->instructions
) {
1838 fs_inst
*inst
= (fs_inst
*)node
;
1840 switch (inst
->opcode
) {
1841 case BRW_OPCODE_MUL
:
1842 if (inst
->src
[1].file
!= IMM
)
1846 if (inst
->src
[1].is_one()) {
1847 inst
->opcode
= BRW_OPCODE_MOV
;
1848 inst
->src
[1] = reg_undef
;
1854 if (inst
->src
[1].is_zero()) {
1855 inst
->opcode
= BRW_OPCODE_MOV
;
1856 inst
->src
[0] = inst
->src
[1];
1857 inst
->src
[1] = reg_undef
;
1863 case BRW_OPCODE_ADD
:
1864 if (inst
->src
[1].file
!= IMM
)
1868 if (inst
->src
[1].is_zero()) {
1869 inst
->opcode
= BRW_OPCODE_MOV
;
1870 inst
->src
[1] = reg_undef
;
1876 if (inst
->src
[0].equals(inst
->src
[1])) {
1877 inst
->opcode
= BRW_OPCODE_MOV
;
1878 inst
->src
[1] = reg_undef
;
1892 * Removes any instructions writing a VGRF where that VGRF is not used by any
1893 * later instruction.
1896 fs_visitor::dead_code_eliminate()
1898 bool progress
= false;
1901 calculate_live_intervals();
1903 foreach_list_safe(node
, &this->instructions
) {
1904 fs_inst
*inst
= (fs_inst
*)node
;
1906 if (inst
->dst
.file
== GRF
) {
1909 for (int i
= 0; i
< inst
->regs_written
; i
++) {
1910 int var
= live_intervals
->var_from_vgrf
[inst
->dst
.reg
];
1911 assert(live_intervals
->end
[var
+ inst
->dst
.reg_offset
+ i
] >= pc
);
1912 if (live_intervals
->end
[var
+ inst
->dst
.reg_offset
+ i
] != pc
) {
1919 /* Don't dead code eliminate instructions that write to the
1920 * accumulator as a side-effect. Instead just set the destination
1921 * to the null register to free it.
1923 switch (inst
->opcode
) {
1924 case BRW_OPCODE_ADDC
:
1925 case BRW_OPCODE_SUBB
:
1926 case BRW_OPCODE_MACH
:
1927 inst
->dst
= fs_reg(retype(brw_null_reg(), inst
->dst
.type
));
1941 invalidate_live_intervals();
1946 struct dead_code_hash_key
1953 dead_code_hash_compare(const void *a
, const void *b
)
1955 return memcmp(a
, b
, sizeof(struct dead_code_hash_key
)) == 0;
1959 clear_dead_code_hash(struct hash_table
*ht
)
1961 struct hash_entry
*entry
;
1963 hash_table_foreach(ht
, entry
) {
1964 _mesa_hash_table_remove(ht
, entry
);
1969 insert_dead_code_hash(struct hash_table
*ht
,
1970 int vgrf
, int reg_offset
, fs_inst
*inst
)
1972 /* We don't bother freeing keys, because they'll be GCed with the ht. */
1973 struct dead_code_hash_key
*key
= ralloc(ht
, struct dead_code_hash_key
);
1976 key
->reg_offset
= reg_offset
;
1978 _mesa_hash_table_insert(ht
, _mesa_hash_data(key
, sizeof(*key
)), key
, inst
);
1981 static struct hash_entry
*
1982 get_dead_code_hash_entry(struct hash_table
*ht
, int vgrf
, int reg_offset
)
1984 struct dead_code_hash_key key
;
1987 key
.reg_offset
= reg_offset
;
1989 return _mesa_hash_table_search(ht
, _mesa_hash_data(&key
, sizeof(key
)), &key
);
1993 remove_dead_code_hash(struct hash_table
*ht
,
1994 int vgrf
, int reg_offset
)
1996 struct hash_entry
*entry
= get_dead_code_hash_entry(ht
, vgrf
, reg_offset
);
2000 _mesa_hash_table_remove(ht
, entry
);
2004 * Walks basic blocks, removing any regs that are written but not read before
2007 * The dead_code_eliminate() function implements a global dead code
2008 * elimination, but it only handles the removing the last write to a register
2009 * if it's never read. This one can handle intermediate writes, but only
2010 * within a basic block.
2013 fs_visitor::dead_code_eliminate_local()
2015 struct hash_table
*ht
;
2016 bool progress
= false;
2018 ht
= _mesa_hash_table_create(mem_ctx
, dead_code_hash_compare
);
2020 foreach_list_safe(node
, &this->instructions
) {
2021 fs_inst
*inst
= (fs_inst
*)node
;
2023 /* At a basic block, empty the HT since we don't understand dataflow
2026 if (inst
->is_control_flow()) {
2027 clear_dead_code_hash(ht
);
2031 /* Clear the HT of any instructions that got read. */
2032 for (int i
= 0; i
< 3; i
++) {
2033 fs_reg src
= inst
->src
[i
];
2034 if (src
.file
!= GRF
)
2038 if (inst
->is_send_from_grf())
2039 read
= virtual_grf_sizes
[src
.reg
] - src
.reg_offset
;
2041 for (int reg_offset
= src
.reg_offset
;
2042 reg_offset
< src
.reg_offset
+ read
;
2044 remove_dead_code_hash(ht
, src
.reg
, reg_offset
);
2048 /* Add any update of a GRF to the HT, removing a previous write if it
2051 if (inst
->dst
.file
== GRF
) {
2052 if (inst
->regs_written
> 1) {
2053 /* We don't know how to trim channels from an instruction's
2054 * writes, so we can't incrementally remove unread channels from
2055 * it. Just remove whatever it overwrites from the table
2057 for (int i
= 0; i
< inst
->regs_written
; i
++) {
2058 remove_dead_code_hash(ht
,
2060 inst
->dst
.reg_offset
+ i
);
2063 struct hash_entry
*entry
=
2064 get_dead_code_hash_entry(ht
, inst
->dst
.reg
,
2065 inst
->dst
.reg_offset
);
2067 if (inst
->is_partial_write()) {
2068 /* For a partial write, we can't remove any previous dead code
2069 * candidate, since we're just modifying their result, but we can
2070 * be dead code eliminiated ourselves.
2075 insert_dead_code_hash(ht
, inst
->dst
.reg
, inst
->dst
.reg_offset
,
2080 /* We're completely updating a channel, and there was a
2081 * previous write to the channel that wasn't read. Kill it!
2083 fs_inst
*inst
= (fs_inst
*)entry
->data
;
2086 _mesa_hash_table_remove(ht
, entry
);
2089 insert_dead_code_hash(ht
, inst
->dst
.reg
, inst
->dst
.reg_offset
,
2096 _mesa_hash_table_destroy(ht
, NULL
);
2099 invalidate_live_intervals();
2105 * Implements a second type of register coalescing: This one checks if
2106 * the two regs involved in a raw move don't interfere, in which case
2107 * they can both by stored in the same place and the MOV removed.
2110 fs_visitor::register_coalesce_2()
2112 bool progress
= false;
2114 calculate_live_intervals();
2116 foreach_list_safe(node
, &this->instructions
) {
2117 fs_inst
*inst
= (fs_inst
*)node
;
2119 if (inst
->opcode
!= BRW_OPCODE_MOV
||
2120 inst
->is_partial_write() ||
2122 inst
->src
[0].file
!= GRF
||
2123 inst
->src
[0].negate
||
2125 inst
->src
[0].smear
!= -1 ||
2126 inst
->dst
.file
!= GRF
||
2127 inst
->dst
.type
!= inst
->src
[0].type
||
2128 virtual_grf_sizes
[inst
->src
[0].reg
] != 1) {
2132 int var_from
= live_intervals
->var_from_reg(&inst
->src
[0]);
2133 int var_to
= live_intervals
->var_from_reg(&inst
->dst
);
2135 if (live_intervals
->vars_interfere(var_from
, var_to
))
2138 int reg_from
= inst
->src
[0].reg
;
2139 assert(inst
->src
[0].reg_offset
== 0);
2140 int reg_to
= inst
->dst
.reg
;
2141 int reg_to_offset
= inst
->dst
.reg_offset
;
2143 foreach_list(node
, &this->instructions
) {
2144 fs_inst
*scan_inst
= (fs_inst
*)node
;
2146 if (scan_inst
->dst
.file
== GRF
&&
2147 scan_inst
->dst
.reg
== reg_from
) {
2148 scan_inst
->dst
.reg
= reg_to
;
2149 scan_inst
->dst
.reg_offset
= reg_to_offset
;
2151 for (int i
= 0; i
< 3; i
++) {
2152 if (scan_inst
->src
[i
].file
== GRF
&&
2153 scan_inst
->src
[i
].reg
== reg_from
) {
2154 scan_inst
->src
[i
].reg
= reg_to
;
2155 scan_inst
->src
[i
].reg_offset
= reg_to_offset
;
2166 invalidate_live_intervals();
2172 fs_visitor::register_coalesce()
2174 bool progress
= false;
2178 foreach_list_safe(node
, &this->instructions
) {
2179 fs_inst
*inst
= (fs_inst
*)node
;
2181 /* Make sure that we dominate the instructions we're going to
2182 * scan for interfering with our coalescing, or we won't have
2183 * scanned enough to see if anything interferes with our
2184 * coalescing. We don't dominate the following instructions if
2185 * we're in a loop or an if block.
2187 switch (inst
->opcode
) {
2191 case BRW_OPCODE_WHILE
:
2197 case BRW_OPCODE_ENDIF
:
2203 if (loop_depth
|| if_depth
)
2206 if (inst
->opcode
!= BRW_OPCODE_MOV
||
2207 inst
->is_partial_write() ||
2209 inst
->dst
.file
!= GRF
|| (inst
->src
[0].file
!= GRF
&&
2210 inst
->src
[0].file
!= UNIFORM
)||
2211 inst
->dst
.type
!= inst
->src
[0].type
)
2214 bool has_source_modifiers
= (inst
->src
[0].abs
||
2215 inst
->src
[0].negate
||
2216 inst
->src
[0].smear
!= -1 ||
2217 inst
->src
[0].file
== UNIFORM
);
2219 /* Found a move of a GRF to a GRF. Let's see if we can coalesce
2220 * them: check for no writes to either one until the exit of the
2223 bool interfered
= false;
2225 for (fs_inst
*scan_inst
= (fs_inst
*)inst
->next
;
2226 !scan_inst
->is_tail_sentinel();
2227 scan_inst
= (fs_inst
*)scan_inst
->next
) {
2228 if (scan_inst
->dst
.file
== GRF
) {
2229 if (scan_inst
->overwrites_reg(inst
->dst
) ||
2230 scan_inst
->overwrites_reg(inst
->src
[0])) {
2236 if (has_source_modifiers
) {
2237 for (int i
= 0; i
< 3; i
++) {
2238 if (scan_inst
->src
[i
].file
== GRF
&&
2239 scan_inst
->src
[i
].reg
== inst
->dst
.reg
&&
2240 scan_inst
->src
[i
].reg_offset
== inst
->dst
.reg_offset
&&
2241 inst
->dst
.type
!= scan_inst
->src
[i
].type
)
2250 /* The gen6 MATH instruction can't handle source modifiers or
2251 * unusual register regions, so avoid coalescing those for
2252 * now. We should do something more specific.
2254 if (has_source_modifiers
&& !can_do_source_mods(scan_inst
)) {
2259 if (scan_inst
->mlen
> 0 && scan_inst
->base_mrf
== -1 &&
2260 scan_inst
->src
[0].file
== GRF
&&
2261 scan_inst
->src
[0].reg
== inst
->dst
.reg
) {
2266 /* The accumulator result appears to get used for the
2267 * conditional modifier generation. When negating a UD
2268 * value, there is a 33rd bit generated for the sign in the
2269 * accumulator value, so now you can't check, for example,
2270 * equality with a 32-bit value. See piglit fs-op-neg-uint.
2272 if (scan_inst
->conditional_mod
&&
2273 inst
->src
[0].negate
&&
2274 inst
->src
[0].type
== BRW_REGISTER_TYPE_UD
) {
2283 /* Rewrite the later usage to point at the source of the move to
2286 for (fs_inst
*scan_inst
= inst
;
2287 !scan_inst
->is_tail_sentinel();
2288 scan_inst
= (fs_inst
*)scan_inst
->next
) {
2289 for (int i
= 0; i
< 3; i
++) {
2290 if (scan_inst
->src
[i
].file
== GRF
&&
2291 scan_inst
->src
[i
].reg
== inst
->dst
.reg
&&
2292 scan_inst
->src
[i
].reg_offset
== inst
->dst
.reg_offset
) {
2293 fs_reg new_src
= inst
->src
[0];
2294 if (scan_inst
->src
[i
].abs
) {
2298 new_src
.negate
^= scan_inst
->src
[i
].negate
;
2299 new_src
.sechalf
= scan_inst
->src
[i
].sechalf
;
2300 scan_inst
->src
[i
] = new_src
;
2310 invalidate_live_intervals();
2317 fs_visitor::compute_to_mrf()
2319 bool progress
= false;
2322 calculate_live_intervals();
2324 foreach_list_safe(node
, &this->instructions
) {
2325 fs_inst
*inst
= (fs_inst
*)node
;
2330 if (inst
->opcode
!= BRW_OPCODE_MOV
||
2331 inst
->is_partial_write() ||
2332 inst
->dst
.file
!= MRF
|| inst
->src
[0].file
!= GRF
||
2333 inst
->dst
.type
!= inst
->src
[0].type
||
2334 inst
->src
[0].abs
|| inst
->src
[0].negate
|| inst
->src
[0].smear
!= -1)
2337 /* Work out which hardware MRF registers are written by this
2340 int mrf_low
= inst
->dst
.reg
& ~BRW_MRF_COMPR4
;
2342 if (inst
->dst
.reg
& BRW_MRF_COMPR4
) {
2343 mrf_high
= mrf_low
+ 4;
2344 } else if (dispatch_width
== 16 &&
2345 (!inst
->force_uncompressed
&& !inst
->force_sechalf
)) {
2346 mrf_high
= mrf_low
+ 1;
2351 /* Can't compute-to-MRF this GRF if someone else was going to
2354 if (this->virtual_grf_end
[inst
->src
[0].reg
] > ip
)
2357 /* Found a move of a GRF to a MRF. Let's see if we can go
2358 * rewrite the thing that made this GRF to write into the MRF.
2361 for (scan_inst
= (fs_inst
*)inst
->prev
;
2362 scan_inst
->prev
!= NULL
;
2363 scan_inst
= (fs_inst
*)scan_inst
->prev
) {
2364 if (scan_inst
->dst
.file
== GRF
&&
2365 scan_inst
->dst
.reg
== inst
->src
[0].reg
) {
2366 /* Found the last thing to write our reg we want to turn
2367 * into a compute-to-MRF.
2370 /* If this one instruction didn't populate all the
2371 * channels, bail. We might be able to rewrite everything
2372 * that writes that reg, but it would require smarter
2373 * tracking to delay the rewriting until complete success.
2375 if (scan_inst
->is_partial_write())
2378 /* Things returning more than one register would need us to
2379 * understand coalescing out more than one MOV at a time.
2381 if (scan_inst
->regs_written
> 1)
2384 /* SEND instructions can't have MRF as a destination. */
2385 if (scan_inst
->mlen
)
2388 if (brw
->gen
== 6) {
2389 /* gen6 math instructions must have the destination be
2390 * GRF, so no compute-to-MRF for them.
2392 if (scan_inst
->is_math()) {
2397 if (scan_inst
->dst
.reg_offset
== inst
->src
[0].reg_offset
) {
2398 /* Found the creator of our MRF's source value. */
2399 scan_inst
->dst
.file
= MRF
;
2400 scan_inst
->dst
.reg
= inst
->dst
.reg
;
2401 scan_inst
->saturate
|= inst
->saturate
;
2408 /* We don't handle control flow here. Most computation of
2409 * values that end up in MRFs are shortly before the MRF
2412 if (scan_inst
->is_control_flow() && scan_inst
->opcode
!= BRW_OPCODE_IF
)
2415 /* You can't read from an MRF, so if someone else reads our
2416 * MRF's source GRF that we wanted to rewrite, that stops us.
2418 bool interfered
= false;
2419 for (int i
= 0; i
< 3; i
++) {
2420 if (scan_inst
->src
[i
].file
== GRF
&&
2421 scan_inst
->src
[i
].reg
== inst
->src
[0].reg
&&
2422 scan_inst
->src
[i
].reg_offset
== inst
->src
[0].reg_offset
) {
2429 if (scan_inst
->dst
.file
== MRF
) {
2430 /* If somebody else writes our MRF here, we can't
2431 * compute-to-MRF before that.
2433 int scan_mrf_low
= scan_inst
->dst
.reg
& ~BRW_MRF_COMPR4
;
2436 if (scan_inst
->dst
.reg
& BRW_MRF_COMPR4
) {
2437 scan_mrf_high
= scan_mrf_low
+ 4;
2438 } else if (dispatch_width
== 16 &&
2439 (!scan_inst
->force_uncompressed
&&
2440 !scan_inst
->force_sechalf
)) {
2441 scan_mrf_high
= scan_mrf_low
+ 1;
2443 scan_mrf_high
= scan_mrf_low
;
2446 if (mrf_low
== scan_mrf_low
||
2447 mrf_low
== scan_mrf_high
||
2448 mrf_high
== scan_mrf_low
||
2449 mrf_high
== scan_mrf_high
) {
2454 if (scan_inst
->mlen
> 0 && scan_inst
->base_mrf
!= -1) {
2455 /* Found a SEND instruction, which means that there are
2456 * live values in MRFs from base_mrf to base_mrf +
2457 * scan_inst->mlen - 1. Don't go pushing our MRF write up
2460 if (mrf_low
>= scan_inst
->base_mrf
&&
2461 mrf_low
< scan_inst
->base_mrf
+ scan_inst
->mlen
) {
2464 if (mrf_high
>= scan_inst
->base_mrf
&&
2465 mrf_high
< scan_inst
->base_mrf
+ scan_inst
->mlen
) {
2473 invalidate_live_intervals();
2479 * Walks through basic blocks, looking for repeated MRF writes and
2480 * removing the later ones.
2483 fs_visitor::remove_duplicate_mrf_writes()
2485 fs_inst
*last_mrf_move
[16];
2486 bool progress
= false;
2488 /* Need to update the MRF tracking for compressed instructions. */
2489 if (dispatch_width
== 16)
2492 memset(last_mrf_move
, 0, sizeof(last_mrf_move
));
2494 foreach_list_safe(node
, &this->instructions
) {
2495 fs_inst
*inst
= (fs_inst
*)node
;
2497 if (inst
->is_control_flow()) {
2498 memset(last_mrf_move
, 0, sizeof(last_mrf_move
));
2501 if (inst
->opcode
== BRW_OPCODE_MOV
&&
2502 inst
->dst
.file
== MRF
) {
2503 fs_inst
*prev_inst
= last_mrf_move
[inst
->dst
.reg
];
2504 if (prev_inst
&& inst
->equals(prev_inst
)) {
2511 /* Clear out the last-write records for MRFs that were overwritten. */
2512 if (inst
->dst
.file
== MRF
) {
2513 last_mrf_move
[inst
->dst
.reg
] = NULL
;
2516 if (inst
->mlen
> 0 && inst
->base_mrf
!= -1) {
2517 /* Found a SEND instruction, which will include two or fewer
2518 * implied MRF writes. We could do better here.
2520 for (int i
= 0; i
< implied_mrf_writes(inst
); i
++) {
2521 last_mrf_move
[inst
->base_mrf
+ i
] = NULL
;
2525 /* Clear out any MRF move records whose sources got overwritten. */
2526 if (inst
->dst
.file
== GRF
) {
2527 for (unsigned int i
= 0; i
< Elements(last_mrf_move
); i
++) {
2528 if (last_mrf_move
[i
] &&
2529 last_mrf_move
[i
]->src
[0].reg
== inst
->dst
.reg
) {
2530 last_mrf_move
[i
] = NULL
;
2535 if (inst
->opcode
== BRW_OPCODE_MOV
&&
2536 inst
->dst
.file
== MRF
&&
2537 inst
->src
[0].file
== GRF
&&
2538 !inst
->is_partial_write()) {
2539 last_mrf_move
[inst
->dst
.reg
] = inst
;
2544 invalidate_live_intervals();
2550 clear_deps_for_inst_src(fs_inst
*inst
, int dispatch_width
, bool *deps
,
2551 int first_grf
, int grf_len
)
2553 bool inst_16wide
= (dispatch_width
> 8 &&
2554 !inst
->force_uncompressed
&&
2555 !inst
->force_sechalf
);
2557 /* Clear the flag for registers that actually got read (as expected). */
2558 for (int i
= 0; i
< 3; i
++) {
2560 if (inst
->src
[i
].file
== GRF
) {
2561 grf
= inst
->src
[i
].reg
;
2562 } else if (inst
->src
[i
].file
== HW_REG
&&
2563 inst
->src
[i
].fixed_hw_reg
.file
== BRW_GENERAL_REGISTER_FILE
) {
2564 grf
= inst
->src
[i
].fixed_hw_reg
.nr
;
2569 if (grf
>= first_grf
&&
2570 grf
< first_grf
+ grf_len
) {
2571 deps
[grf
- first_grf
] = false;
2573 deps
[grf
- first_grf
+ 1] = false;
2579 * Implements this workaround for the original 965:
2581 * "[DevBW, DevCL] Implementation Restrictions: As the hardware does not
2582 * check for post destination dependencies on this instruction, software
2583 * must ensure that there is no destination hazard for the case of ‘write
2584 * followed by a posted write’ shown in the following example.
2587 * 2. send r3.xy <rest of send instruction>
2590 * Due to no post-destination dependency check on the ‘send’, the above
2591 * code sequence could have two instructions (1 and 2) in flight at the
2592 * same time that both consider ‘r3’ as the target of their final writes.
2595 fs_visitor::insert_gen4_pre_send_dependency_workarounds(fs_inst
*inst
)
2597 int reg_size
= dispatch_width
/ 8;
2598 int write_len
= inst
->regs_written
* reg_size
;
2599 int first_write_grf
= inst
->dst
.reg
;
2600 bool needs_dep
[BRW_MAX_MRF
];
2601 assert(write_len
< (int)sizeof(needs_dep
) - 1);
2603 memset(needs_dep
, false, sizeof(needs_dep
));
2604 memset(needs_dep
, true, write_len
);
2606 clear_deps_for_inst_src(inst
, dispatch_width
,
2607 needs_dep
, first_write_grf
, write_len
);
2609 /* Walk backwards looking for writes to registers we're writing which
2610 * aren't read since being written. If we hit the start of the program,
2611 * we assume that there are no outstanding dependencies on entry to the
2614 for (fs_inst
*scan_inst
= (fs_inst
*)inst
->prev
;
2616 scan_inst
= (fs_inst
*)scan_inst
->prev
) {
2618 /* If we hit control flow, assume that there *are* outstanding
2619 * dependencies, and force their cleanup before our instruction.
2621 if (scan_inst
->is_control_flow()) {
2622 for (int i
= 0; i
< write_len
; i
++) {
2624 inst
->insert_before(DEP_RESOLVE_MOV(first_write_grf
+ i
));
2630 bool scan_inst_16wide
= (dispatch_width
> 8 &&
2631 !scan_inst
->force_uncompressed
&&
2632 !scan_inst
->force_sechalf
);
2634 /* We insert our reads as late as possible on the assumption that any
2635 * instruction but a MOV that might have left us an outstanding
2636 * dependency has more latency than a MOV.
2638 if (scan_inst
->dst
.file
== GRF
) {
2639 for (int i
= 0; i
< scan_inst
->regs_written
; i
++) {
2640 int reg
= scan_inst
->dst
.reg
+ i
* reg_size
;
2642 if (reg
>= first_write_grf
&&
2643 reg
< first_write_grf
+ write_len
&&
2644 needs_dep
[reg
- first_write_grf
]) {
2645 inst
->insert_before(DEP_RESOLVE_MOV(reg
));
2646 needs_dep
[reg
- first_write_grf
] = false;
2647 if (scan_inst_16wide
)
2648 needs_dep
[reg
- first_write_grf
+ 1] = false;
2653 /* Clear the flag for registers that actually got read (as expected). */
2654 clear_deps_for_inst_src(scan_inst
, dispatch_width
,
2655 needs_dep
, first_write_grf
, write_len
);
2657 /* Continue the loop only if we haven't resolved all the dependencies */
2659 for (i
= 0; i
< write_len
; i
++) {
2669 * Implements this workaround for the original 965:
2671 * "[DevBW, DevCL] Errata: A destination register from a send can not be
2672 * used as a destination register until after it has been sourced by an
2673 * instruction with a different destination register.
2676 fs_visitor::insert_gen4_post_send_dependency_workarounds(fs_inst
*inst
)
2678 int write_len
= inst
->regs_written
* dispatch_width
/ 8;
2679 int first_write_grf
= inst
->dst
.reg
;
2680 bool needs_dep
[BRW_MAX_MRF
];
2681 assert(write_len
< (int)sizeof(needs_dep
) - 1);
2683 memset(needs_dep
, false, sizeof(needs_dep
));
2684 memset(needs_dep
, true, write_len
);
2685 /* Walk forwards looking for writes to registers we're writing which aren't
2686 * read before being written.
2688 for (fs_inst
*scan_inst
= (fs_inst
*)inst
->next
;
2689 !scan_inst
->is_tail_sentinel();
2690 scan_inst
= (fs_inst
*)scan_inst
->next
) {
2691 /* If we hit control flow, force resolve all remaining dependencies. */
2692 if (scan_inst
->is_control_flow()) {
2693 for (int i
= 0; i
< write_len
; i
++) {
2695 scan_inst
->insert_before(DEP_RESOLVE_MOV(first_write_grf
+ i
));
2700 /* Clear the flag for registers that actually got read (as expected). */
2701 clear_deps_for_inst_src(scan_inst
, dispatch_width
,
2702 needs_dep
, first_write_grf
, write_len
);
2704 /* We insert our reads as late as possible since they're reading the
2705 * result of a SEND, which has massive latency.
2707 if (scan_inst
->dst
.file
== GRF
&&
2708 scan_inst
->dst
.reg
>= first_write_grf
&&
2709 scan_inst
->dst
.reg
< first_write_grf
+ write_len
&&
2710 needs_dep
[scan_inst
->dst
.reg
- first_write_grf
]) {
2711 scan_inst
->insert_before(DEP_RESOLVE_MOV(scan_inst
->dst
.reg
));
2712 needs_dep
[scan_inst
->dst
.reg
- first_write_grf
] = false;
2715 /* Continue the loop only if we haven't resolved all the dependencies */
2717 for (i
= 0; i
< write_len
; i
++) {
2725 /* If we hit the end of the program, resolve all remaining dependencies out
2728 fs_inst
*last_inst
= (fs_inst
*)this->instructions
.get_tail();
2729 assert(last_inst
->eot
);
2730 for (int i
= 0; i
< write_len
; i
++) {
2732 last_inst
->insert_before(DEP_RESOLVE_MOV(first_write_grf
+ i
));
2737 fs_visitor::insert_gen4_send_dependency_workarounds()
2739 if (brw
->gen
!= 4 || brw
->is_g4x
)
2742 /* Note that we're done with register allocation, so GRF fs_regs always
2743 * have a .reg_offset of 0.
2746 foreach_list_safe(node
, &this->instructions
) {
2747 fs_inst
*inst
= (fs_inst
*)node
;
2749 if (inst
->mlen
!= 0 && inst
->dst
.file
== GRF
) {
2750 insert_gen4_pre_send_dependency_workarounds(inst
);
2751 insert_gen4_post_send_dependency_workarounds(inst
);
2757 * Turns the generic expression-style uniform pull constant load instruction
2758 * into a hardware-specific series of instructions for loading a pull
2761 * The expression style allows the CSE pass before this to optimize out
2762 * repeated loads from the same offset, and gives the pre-register-allocation
2763 * scheduling full flexibility, while the conversion to native instructions
2764 * allows the post-register-allocation scheduler the best information
2767 * Note that execution masking for setting up pull constant loads is special:
2768 * the channels that need to be written are unrelated to the current execution
2769 * mask, since a later instruction will use one of the result channels as a
2770 * source operand for all 8 or 16 of its channels.
2773 fs_visitor::lower_uniform_pull_constant_loads()
2775 foreach_list(node
, &this->instructions
) {
2776 fs_inst
*inst
= (fs_inst
*)node
;
2778 if (inst
->opcode
!= FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD
)
2781 if (brw
->gen
>= 7) {
2782 /* The offset arg before was a vec4-aligned byte offset. We need to
2783 * turn it into a dword offset.
2785 fs_reg const_offset_reg
= inst
->src
[1];
2786 assert(const_offset_reg
.file
== IMM
&&
2787 const_offset_reg
.type
== BRW_REGISTER_TYPE_UD
);
2788 const_offset_reg
.imm
.u
/= 4;
2789 fs_reg payload
= fs_reg(this, glsl_type::uint_type
);
2791 /* This is actually going to be a MOV, but since only the first dword
2792 * is accessed, we have a special opcode to do just that one. Note
2793 * that this needs to be an operation that will be considered a def
2794 * by live variable analysis, or register allocation will explode.
2796 fs_inst
*setup
= new(mem_ctx
) fs_inst(FS_OPCODE_SET_SIMD4X2_OFFSET
,
2797 payload
, const_offset_reg
);
2798 setup
->force_writemask_all
= true;
2800 setup
->ir
= inst
->ir
;
2801 setup
->annotation
= inst
->annotation
;
2802 inst
->insert_before(setup
);
2804 /* Similarly, this will only populate the first 4 channels of the
2805 * result register (since we only use smear values from 0-3), but we
2806 * don't tell the optimizer.
2808 inst
->opcode
= FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GEN7
;
2809 inst
->src
[1] = payload
;
2811 invalidate_live_intervals();
2813 /* Before register allocation, we didn't tell the scheduler about the
2814 * MRF we use. We know it's safe to use this MRF because nothing
2815 * else does except for register spill/unspill, which generates and
2816 * uses its MRF within a single IR instruction.
2818 inst
->base_mrf
= 14;
2825 fs_visitor::dump_instruction(backend_instruction
*be_inst
)
2827 fs_inst
*inst
= (fs_inst
*)be_inst
;
2829 if (inst
->predicate
) {
2830 printf("(%cf0.%d) ",
2831 inst
->predicate_inverse
? '-' : '+',
2835 printf("%s", brw_instruction_name(inst
->opcode
));
2838 if (inst
->conditional_mod
) {
2840 if (!inst
->predicate
&&
2841 (brw
->gen
< 5 || (inst
->opcode
!= BRW_OPCODE_SEL
&&
2842 inst
->opcode
!= BRW_OPCODE_IF
&&
2843 inst
->opcode
!= BRW_OPCODE_WHILE
))) {
2844 printf(".f0.%d", inst
->flag_subreg
);
2850 switch (inst
->dst
.file
) {
2852 printf("vgrf%d", inst
->dst
.reg
);
2853 if (inst
->dst
.reg_offset
)
2854 printf("+%d", inst
->dst
.reg_offset
);
2857 printf("m%d", inst
->dst
.reg
);
2863 printf("***u%d***", inst
->dst
.reg
);
2866 printf("hw_reg%d", inst
->dst
.fixed_hw_reg
.nr
);
2867 if (inst
->dst
.fixed_hw_reg
.subnr
)
2868 printf("+%d", inst
->dst
.fixed_hw_reg
.subnr
);
2876 for (int i
= 0; i
< 3; i
++) {
2877 if (inst
->src
[i
].negate
)
2879 if (inst
->src
[i
].abs
)
2881 switch (inst
->src
[i
].file
) {
2883 printf("vgrf%d", inst
->src
[i
].reg
);
2884 if (inst
->src
[i
].reg_offset
)
2885 printf("+%d", inst
->src
[i
].reg_offset
);
2888 printf("***m%d***", inst
->src
[i
].reg
);
2891 printf("u%d", inst
->src
[i
].reg
);
2892 if (inst
->src
[i
].reg_offset
)
2893 printf(".%d", inst
->src
[i
].reg_offset
);
2899 switch (inst
->src
[i
].type
) {
2900 case BRW_REGISTER_TYPE_F
:
2901 printf("%ff", inst
->src
[i
].imm
.f
);
2903 case BRW_REGISTER_TYPE_D
:
2904 printf("%dd", inst
->src
[i
].imm
.i
);
2906 case BRW_REGISTER_TYPE_UD
:
2907 printf("%uu", inst
->src
[i
].imm
.u
);
2915 if (inst
->src
[i
].fixed_hw_reg
.negate
)
2917 if (inst
->src
[i
].fixed_hw_reg
.abs
)
2919 printf("hw_reg%d", inst
->src
[i
].fixed_hw_reg
.nr
);
2920 if (inst
->src
[i
].fixed_hw_reg
.subnr
)
2921 printf("+%d", inst
->src
[i
].fixed_hw_reg
.subnr
);
2922 if (inst
->src
[i
].fixed_hw_reg
.abs
)
2929 if (inst
->src
[i
].abs
)
2938 if (inst
->force_uncompressed
)
2941 if (inst
->force_sechalf
)
2948 * Possibly returns an instruction that set up @param reg.
2950 * Sometimes we want to take the result of some expression/variable
2951 * dereference tree and rewrite the instruction generating the result
2952 * of the tree. When processing the tree, we know that the
2953 * instructions generated are all writing temporaries that are dead
2954 * outside of this tree. So, if we have some instructions that write
2955 * a temporary, we're free to point that temp write somewhere else.
2957 * Note that this doesn't guarantee that the instruction generated
2958 * only reg -- it might be the size=4 destination of a texture instruction.
2961 fs_visitor::get_instruction_generating_reg(fs_inst
*start
,
2966 end
->is_partial_write() ||
2968 !reg
.equals(end
->dst
)) {
2976 fs_visitor::setup_payload_gen6()
2979 (fp
->Base
.InputsRead
& (1 << VARYING_SLOT_POS
)) != 0;
2980 unsigned barycentric_interp_modes
= c
->prog_data
.barycentric_interp_modes
;
2982 assert(brw
->gen
>= 6);
2984 /* R0-1: masks, pixel X/Y coordinates. */
2985 c
->nr_payload_regs
= 2;
2986 /* R2: only for 32-pixel dispatch.*/
2988 /* R3-26: barycentric interpolation coordinates. These appear in the
2989 * same order that they appear in the brw_wm_barycentric_interp_mode
2990 * enum. Each set of coordinates occupies 2 registers if dispatch width
2991 * == 8 and 4 registers if dispatch width == 16. Coordinates only
2992 * appear if they were enabled using the "Barycentric Interpolation
2993 * Mode" bits in WM_STATE.
2995 for (int i
= 0; i
< BRW_WM_BARYCENTRIC_INTERP_MODE_COUNT
; ++i
) {
2996 if (barycentric_interp_modes
& (1 << i
)) {
2997 c
->barycentric_coord_reg
[i
] = c
->nr_payload_regs
;
2998 c
->nr_payload_regs
+= 2;
2999 if (dispatch_width
== 16) {
3000 c
->nr_payload_regs
+= 2;
3005 /* R27: interpolated depth if uses source depth */
3007 c
->source_depth_reg
= c
->nr_payload_regs
;
3008 c
->nr_payload_regs
++;
3009 if (dispatch_width
== 16) {
3010 /* R28: interpolated depth if not 8-wide. */
3011 c
->nr_payload_regs
++;
3014 /* R29: interpolated W set if GEN6_WM_USES_SOURCE_W. */
3016 c
->source_w_reg
= c
->nr_payload_regs
;
3017 c
->nr_payload_regs
++;
3018 if (dispatch_width
== 16) {
3019 /* R30: interpolated W if not 8-wide. */
3020 c
->nr_payload_regs
++;
3023 /* R31: MSAA position offsets. */
3024 /* R32-: bary for 32-pixel. */
3025 /* R58-59: interp W for 32-pixel. */
3027 if (fp
->Base
.OutputsWritten
& BITFIELD64_BIT(FRAG_RESULT_DEPTH
)) {
3028 c
->source_depth_to_render_target
= true;
3033 fs_visitor::assign_binding_table_offsets()
3035 uint32_t next_binding_table_offset
= 0;
3037 c
->prog_data
.binding_table
.render_target_start
= next_binding_table_offset
;
3038 next_binding_table_offset
+= c
->key
.nr_color_regions
;
3040 assign_common_binding_table_offsets(next_binding_table_offset
);
3046 sanity_param_count
= fp
->Base
.Parameters
->NumParameters
;
3047 uint32_t orig_nr_params
= c
->prog_data
.nr_params
;
3049 assign_binding_table_offsets();
3052 setup_payload_gen6();
3054 setup_payload_gen4();
3059 if (INTEL_DEBUG
& DEBUG_SHADER_TIME
)
3060 emit_shader_time_begin();
3062 calculate_urb_setup();
3063 if (fp
->Base
.InputsRead
> 0) {
3065 emit_interpolation_setup_gen4();
3067 emit_interpolation_setup_gen6();
3070 /* We handle discards by keeping track of the still-live pixels in f0.1.
3071 * Initialize it with the dispatched pixels.
3074 fs_inst
*discard_init
= emit(FS_OPCODE_MOV_DISPATCH_TO_FLAGS
);
3075 discard_init
->flag_subreg
= 1;
3078 /* Generate FS IR for main(). (the visitor only descends into
3079 * functions called "main").
3082 foreach_list(node
, &*shader
->ir
) {
3083 ir_instruction
*ir
= (ir_instruction
*)node
;
3085 this->result
= reg_undef
;
3089 emit_fragment_program_code();
3095 emit(FS_OPCODE_PLACEHOLDER_HALT
);
3099 split_virtual_grfs();
3101 move_uniform_array_access_to_pull_constants();
3102 remove_dead_constants();
3103 setup_pull_constants();
3109 compact_virtual_grfs();
3111 progress
= remove_duplicate_mrf_writes() || progress
;
3113 progress
= opt_algebraic() || progress
;
3114 progress
= opt_cse() || progress
;
3115 progress
= opt_copy_propagate() || progress
;
3116 progress
= dead_code_eliminate() || progress
;
3117 progress
= dead_code_eliminate_local() || progress
;
3118 progress
= register_coalesce() || progress
;
3119 progress
= register_coalesce_2() || progress
;
3120 progress
= compute_to_mrf() || progress
;
3123 schedule_instructions(false);
3125 lower_uniform_pull_constant_loads();
3127 assign_curb_setup();
3131 assign_regs_trivial();
3133 while (!assign_regs()) {
3139 assert(force_uncompressed_stack
== 0);
3140 assert(force_sechalf_stack
== 0);
3142 /* This must come after all optimization and register allocation, since
3143 * it inserts dead code that happens to have side effects, and it does
3144 * so based on the actual physical registers in use.
3146 insert_gen4_send_dependency_workarounds();
3151 schedule_instructions(true);
3153 if (dispatch_width
== 8) {
3154 c
->prog_data
.reg_blocks
= brw_register_blocks(grf_used
);
3156 c
->prog_data
.reg_blocks_16
= brw_register_blocks(grf_used
);
3158 /* Make sure we didn't try to sneak in an extra uniform */
3159 assert(orig_nr_params
== c
->prog_data
.nr_params
);
3160 (void) orig_nr_params
;
3163 /* If any state parameters were appended, then ParameterValues could have
3164 * been realloced, in which case the driver uniform storage set up by
3165 * _mesa_associate_uniform_storage() would point to freed memory. Make
3166 * sure that didn't happen.
3168 assert(sanity_param_count
== fp
->Base
.Parameters
->NumParameters
);
3174 brw_wm_fs_emit(struct brw_context
*brw
, struct brw_wm_compile
*c
,
3175 struct gl_fragment_program
*fp
,
3176 struct gl_shader_program
*prog
,
3177 unsigned *final_assembly_size
)
3179 bool start_busy
= false;
3180 float start_time
= 0;
3182 if (unlikely(brw
->perf_debug
)) {
3183 start_busy
= (brw
->batch
.last_bo
&&
3184 drm_intel_bo_busy(brw
->batch
.last_bo
));
3185 start_time
= get_time();
3188 struct brw_shader
*shader
= NULL
;
3190 shader
= (brw_shader
*) prog
->_LinkedShaders
[MESA_SHADER_FRAGMENT
];
3192 if (unlikely(INTEL_DEBUG
& DEBUG_WM
)) {
3194 printf("GLSL IR for native fragment shader %d:\n", prog
->Name
);
3195 _mesa_print_ir(shader
->ir
, NULL
);
3198 printf("ARB_fragment_program %d ir for native fragment shader\n",
3200 _mesa_print_program(&fp
->Base
);
3204 /* Now the main event: Visit the shader IR and generate our FS IR for it.
3206 fs_visitor
v(brw
, c
, prog
, fp
, 8);
3209 prog
->LinkStatus
= false;
3210 ralloc_strcat(&prog
->InfoLog
, v
.fail_msg
);
3213 _mesa_problem(NULL
, "Failed to compile fragment shader: %s\n",
3219 exec_list
*simd16_instructions
= NULL
;
3220 fs_visitor
v2(brw
, c
, prog
, fp
, 16);
3221 if (brw
->gen
>= 5 && likely(!(INTEL_DEBUG
& DEBUG_NO16
))) {
3222 if (c
->prog_data
.nr_pull_params
== 0) {
3223 /* Try a 16-wide compile */
3224 v2
.import_uniforms(&v
);
3226 perf_debug("16-wide shader failed to compile, falling back to "
3227 "8-wide at a 10-20%% performance cost: %s", v2
.fail_msg
);
3229 simd16_instructions
= &v2
.instructions
;
3232 perf_debug("Skipping 16-wide due to pull parameters.\n");
3236 fs_generator
g(brw
, c
, prog
, fp
, v
.dual_src_output
.file
!= BAD_FILE
);
3237 const unsigned *generated
= g
.generate_assembly(&v
.instructions
,
3238 simd16_instructions
,
3239 final_assembly_size
);
3241 if (unlikely(brw
->perf_debug
) && shader
) {
3242 if (shader
->compiled_once
)
3243 brw_wm_debug_recompile(brw
, prog
, &c
->key
);
3244 shader
->compiled_once
= true;
3246 if (start_busy
&& !drm_intel_bo_busy(brw
->batch
.last_bo
)) {
3247 perf_debug("FS compile took %.03f ms and stalled the GPU\n",
3248 (get_time() - start_time
) * 1000);
3256 brw_fs_precompile(struct gl_context
*ctx
, struct gl_shader_program
*prog
)
3258 struct brw_context
*brw
= brw_context(ctx
);
3259 struct brw_wm_prog_key key
;
3261 if (!prog
->_LinkedShaders
[MESA_SHADER_FRAGMENT
])
3264 struct gl_fragment_program
*fp
= (struct gl_fragment_program
*)
3265 prog
->_LinkedShaders
[MESA_SHADER_FRAGMENT
]->Program
;
3266 struct brw_fragment_program
*bfp
= brw_fragment_program(fp
);
3267 bool program_uses_dfdy
= fp
->UsesDFdy
;
3269 memset(&key
, 0, sizeof(key
));
3273 key
.iz_lookup
|= IZ_PS_KILL_ALPHATEST_BIT
;
3275 if (fp
->Base
.OutputsWritten
& BITFIELD64_BIT(FRAG_RESULT_DEPTH
))
3276 key
.iz_lookup
|= IZ_PS_COMPUTES_DEPTH_BIT
;
3278 /* Just assume depth testing. */
3279 key
.iz_lookup
|= IZ_DEPTH_TEST_ENABLE_BIT
;
3280 key
.iz_lookup
|= IZ_DEPTH_WRITE_ENABLE_BIT
;
3283 if (brw
->gen
< 6 || _mesa_bitcount_64(fp
->Base
.InputsRead
&
3284 BRW_FS_VARYING_INPUT_MASK
) > 16)
3285 key
.input_slots_valid
= fp
->Base
.InputsRead
| VARYING_BIT_POS
;
3287 key
.clamp_fragment_color
= ctx
->API
== API_OPENGL_COMPAT
;
3289 unsigned sampler_count
= _mesa_fls(fp
->Base
.SamplersUsed
);
3290 for (unsigned i
= 0; i
< sampler_count
; i
++) {
3291 if (fp
->Base
.ShadowSamplers
& (1 << i
)) {
3292 /* Assume DEPTH_TEXTURE_MODE is the default: X, X, X, 1 */
3293 key
.tex
.swizzles
[i
] =
3294 MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_X
, SWIZZLE_X
, SWIZZLE_ONE
);
3296 /* Color sampler: assume no swizzling. */
3297 key
.tex
.swizzles
[i
] = SWIZZLE_XYZW
;
3301 if (fp
->Base
.InputsRead
& VARYING_BIT_POS
) {
3302 key
.drawable_height
= ctx
->DrawBuffer
->Height
;
3305 if ((fp
->Base
.InputsRead
& VARYING_BIT_POS
) || program_uses_dfdy
) {
3306 key
.render_to_fbo
= _mesa_is_user_fbo(ctx
->DrawBuffer
);
3309 key
.nr_color_regions
= 1;
3311 /* GL_FRAGMENT_SHADER_DERIVATIVE_HINT is almost always GL_DONT_CARE. The
3312 * quality of the derivatives is likely to be determined by the driconf
3315 key
.high_quality_derivatives
= brw
->disable_derivative_optimization
;
3317 key
.program_string_id
= bfp
->id
;
3319 uint32_t old_prog_offset
= brw
->wm
.base
.prog_offset
;
3320 struct brw_wm_prog_data
*old_prog_data
= brw
->wm
.prog_data
;
3322 bool success
= do_wm_prog(brw
, prog
, bfp
, &key
);
3324 brw
->wm
.base
.prog_offset
= old_prog_offset
;
3325 brw
->wm
.prog_data
= old_prog_data
;