2 * Copyright (C) 2018-2019 Alyssa Rosenzweig <alyssa@rosenzweig.io>
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 FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
24 #include <sys/types.h>
33 #include "main/mtypes.h"
34 #include "compiler/glsl/glsl_to_nir.h"
35 #include "compiler/nir_types.h"
36 #include "main/imports.h"
37 #include "compiler/nir/nir_builder.h"
38 #include "util/half_float.h"
39 #include "util/u_math.h"
40 #include "util/u_debug.h"
41 #include "util/u_dynarray.h"
42 #include "util/list.h"
43 #include "main/mtypes.h"
46 #include "midgard_nir.h"
47 #include "midgard_compile.h"
48 #include "midgard_ops.h"
52 #include "disassemble.h"
54 static const struct debug_named_value debug_options
[] = {
55 {"msgs", MIDGARD_DBG_MSGS
, "Print debug messages"},
56 {"shaders", MIDGARD_DBG_SHADERS
, "Dump shaders in NIR and MIR"},
57 {"shaderdb", MIDGARD_DBG_SHADERDB
, "Prints shader-db statistics"},
61 DEBUG_GET_ONCE_FLAGS_OPTION(midgard_debug
, "MIDGARD_MESA_DEBUG", debug_options
, 0)
63 unsigned SHADER_DB_COUNT
= 0;
65 int midgard_debug
= 0;
67 #define DBG(fmt, ...) \
68 do { if (midgard_debug & MIDGARD_DBG_MSGS) \
69 fprintf(stderr, "%s:%d: "fmt, \
70 __FUNCTION__, __LINE__, ##__VA_ARGS__); } while (0)
73 midgard_is_branch_unit(unsigned unit
)
75 return (unit
== ALU_ENAB_BRANCH
) || (unit
== ALU_ENAB_BR_COMPACT
);
79 midgard_block_add_successor(midgard_block
*block
, midgard_block
*successor
)
81 block
->successors
[block
->nr_successors
++] = successor
;
82 assert(block
->nr_successors
<= ARRAY_SIZE(block
->successors
));
85 /* Helpers to generate midgard_instruction's using macro magic, since every
86 * driver seems to do it that way */
88 #define EMIT(op, ...) emit_mir_instruction(ctx, v_##op(__VA_ARGS__));
90 #define M_LOAD_STORE(name, rname, uname) \
91 static midgard_instruction m_##name(unsigned ssa, unsigned address) { \
92 midgard_instruction i = { \
93 .type = TAG_LOAD_STORE_4, \
101 .op = midgard_op_##name, \
102 .swizzle = SWIZZLE_XYZW, \
110 #define M_LOAD(name) M_LOAD_STORE(name, dest, src0)
111 #define M_STORE(name) M_LOAD_STORE(name, src0, dest)
113 /* Inputs a NIR ALU source, with modifiers attached if necessary, and outputs
114 * the corresponding Midgard source */
116 static midgard_vector_alu_src
117 vector_alu_modifiers(nir_alu_src
*src
, bool is_int
, unsigned broadcast_count
,
118 bool half
, bool sext
)
120 if (!src
) return blank_alu_src
;
122 /* Figure out how many components there are so we can adjust the
123 * swizzle. Specifically we want to broadcast the last channel so
124 * things like ball2/3 work
127 if (broadcast_count
) {
128 uint8_t last_component
= src
->swizzle
[broadcast_count
- 1];
130 for (unsigned c
= broadcast_count
; c
< NIR_MAX_VEC_COMPONENTS
; ++c
) {
131 src
->swizzle
[c
] = last_component
;
135 midgard_vector_alu_src alu_src
= {
139 .swizzle
= SWIZZLE_FROM_ARRAY(src
->swizzle
)
143 alu_src
.mod
= midgard_int_normal
;
145 /* Sign/zero-extend if needed */
149 midgard_int_sign_extend
150 : midgard_int_zero_extend
;
153 /* These should have been lowered away */
154 assert(!(src
->abs
|| src
->negate
));
156 alu_src
.mod
= (src
->abs
<< 0) | (src
->negate
<< 1);
162 /* load/store instructions have both 32-bit and 16-bit variants, depending on
163 * whether we are using vectors composed of highp or mediump. At the moment, we
164 * don't support half-floats -- this requires changes in other parts of the
165 * compiler -- therefore the 16-bit versions are commented out. */
167 //M_LOAD(ld_attr_16);
169 //M_LOAD(ld_vary_16);
171 //M_LOAD(ld_uniform_16);
172 M_LOAD(ld_uniform_32
);
173 M_LOAD(ld_color_buffer_8
);
174 //M_STORE(st_vary_16);
176 M_LOAD(st_cubemap_coords
);
178 static midgard_instruction
179 v_alu_br_compact_cond(midgard_jmp_writeout_op op
, unsigned tag
, signed offset
, unsigned cond
)
181 midgard_branch_cond branch
= {
189 memcpy(&compact
, &branch
, sizeof(branch
));
191 midgard_instruction ins
= {
193 .unit
= ALU_ENAB_BR_COMPACT
,
194 .prepacked_branch
= true,
195 .compact_branch
= true,
196 .br_compact
= compact
199 if (op
== midgard_jmp_writeout_op_writeout
)
205 static midgard_instruction
206 v_branch(bool conditional
, bool invert
)
208 midgard_instruction ins
= {
210 .unit
= ALU_ENAB_BRANCH
,
211 .compact_branch
= true,
213 .conditional
= conditional
,
214 .invert_conditional
= invert
221 static midgard_branch_extended
222 midgard_create_branch_extended( midgard_condition cond
,
223 midgard_jmp_writeout_op op
,
225 signed quadword_offset
)
227 /* For unclear reasons, the condition code is repeated 8 times */
228 uint16_t duplicated_cond
=
238 midgard_branch_extended branch
= {
240 .dest_tag
= dest_tag
,
241 .offset
= quadword_offset
,
242 .cond
= duplicated_cond
249 attach_constants(compiler_context
*ctx
, midgard_instruction
*ins
, void *constants
, int name
)
251 ins
->has_constants
= true;
252 memcpy(&ins
->constants
, constants
, 16);
256 glsl_type_size(const struct glsl_type
*type
, bool bindless
)
258 return glsl_count_attribute_slots(type
, false);
261 /* Lower fdot2 to a vector multiplication followed by channel addition */
263 midgard_nir_lower_fdot2_body(nir_builder
*b
, nir_alu_instr
*alu
)
265 if (alu
->op
!= nir_op_fdot2
)
268 b
->cursor
= nir_before_instr(&alu
->instr
);
270 nir_ssa_def
*src0
= nir_ssa_for_alu_src(b
, alu
, 0);
271 nir_ssa_def
*src1
= nir_ssa_for_alu_src(b
, alu
, 1);
273 nir_ssa_def
*product
= nir_fmul(b
, src0
, src1
);
275 nir_ssa_def
*sum
= nir_fadd(b
,
276 nir_channel(b
, product
, 0),
277 nir_channel(b
, product
, 1));
279 /* Replace the fdot2 with this sum */
280 nir_ssa_def_rewrite_uses(&alu
->dest
.dest
.ssa
, nir_src_for_ssa(sum
));
284 midgard_nir_sysval_for_intrinsic(nir_intrinsic_instr
*instr
)
286 switch (instr
->intrinsic
) {
287 case nir_intrinsic_load_viewport_scale
:
288 return PAN_SYSVAL_VIEWPORT_SCALE
;
289 case nir_intrinsic_load_viewport_offset
:
290 return PAN_SYSVAL_VIEWPORT_OFFSET
;
297 nir_dest_index(compiler_context
*ctx
, nir_dest
*dst
)
300 return (dst
->ssa
.index
<< 1) | 0;
302 assert(!dst
->reg
.indirect
);
303 return (dst
->reg
.reg
->index
<< 1) | IS_REG
;
307 static int sysval_for_instr(compiler_context
*ctx
, nir_instr
*instr
,
310 nir_intrinsic_instr
*intr
;
311 nir_dest
*dst
= NULL
;
315 switch (instr
->type
) {
316 case nir_instr_type_intrinsic
:
317 intr
= nir_instr_as_intrinsic(instr
);
318 sysval
= midgard_nir_sysval_for_intrinsic(intr
);
321 case nir_instr_type_tex
:
322 tex
= nir_instr_as_tex(instr
);
323 if (tex
->op
!= nir_texop_txs
)
326 sysval
= PAN_SYSVAL(TEXTURE_SIZE
,
327 PAN_TXS_SYSVAL_ID(tex
->texture_index
,
328 nir_tex_instr_dest_size(tex
) -
329 (tex
->is_array
? 1 : 0),
338 *dest
= nir_dest_index(ctx
, dst
);
344 midgard_nir_assign_sysval_body(compiler_context
*ctx
, nir_instr
*instr
)
348 sysval
= sysval_for_instr(ctx
, instr
, NULL
);
352 /* We have a sysval load; check if it's already been assigned */
354 if (_mesa_hash_table_u64_search(ctx
->sysval_to_id
, sysval
))
357 /* It hasn't -- so assign it now! */
359 unsigned id
= ctx
->sysval_count
++;
360 _mesa_hash_table_u64_insert(ctx
->sysval_to_id
, sysval
, (void *) ((uintptr_t) id
+ 1));
361 ctx
->sysvals
[id
] = sysval
;
365 midgard_nir_assign_sysvals(compiler_context
*ctx
, nir_shader
*shader
)
367 ctx
->sysval_count
= 0;
369 nir_foreach_function(function
, shader
) {
370 if (!function
->impl
) continue;
372 nir_foreach_block(block
, function
->impl
) {
373 nir_foreach_instr_safe(instr
, block
) {
374 midgard_nir_assign_sysval_body(ctx
, instr
);
381 midgard_nir_lower_fdot2(nir_shader
*shader
)
383 bool progress
= false;
385 nir_foreach_function(function
, shader
) {
386 if (!function
->impl
) continue;
389 nir_builder
*b
= &_b
;
390 nir_builder_init(b
, function
->impl
);
392 nir_foreach_block(block
, function
->impl
) {
393 nir_foreach_instr_safe(instr
, block
) {
394 if (instr
->type
!= nir_instr_type_alu
) continue;
396 nir_alu_instr
*alu
= nir_instr_as_alu(instr
);
397 midgard_nir_lower_fdot2_body(b
, alu
);
403 nir_metadata_preserve(function
->impl
, nir_metadata_block_index
| nir_metadata_dominance
);
410 /* Flushes undefined values to zero */
413 optimise_nir(nir_shader
*nir
)
416 unsigned lower_flrp
=
417 (nir
->options
->lower_flrp16
? 16 : 0) |
418 (nir
->options
->lower_flrp32
? 32 : 0) |
419 (nir
->options
->lower_flrp64
? 64 : 0);
421 NIR_PASS(progress
, nir
, nir_lower_regs_to_ssa
);
422 NIR_PASS(progress
, nir
, midgard_nir_lower_fdot2
);
423 NIR_PASS(progress
, nir
, nir_lower_idiv
);
425 nir_lower_tex_options lower_tex_1st_pass_options
= {
430 nir_lower_tex_options lower_tex_2nd_pass_options
= {
431 .lower_txs_lod
= true,
434 NIR_PASS(progress
, nir
, nir_lower_tex
, &lower_tex_1st_pass_options
);
435 NIR_PASS(progress
, nir
, nir_lower_tex
, &lower_tex_2nd_pass_options
);
440 NIR_PASS(progress
, nir
, nir_lower_var_copies
);
441 NIR_PASS(progress
, nir
, nir_lower_vars_to_ssa
);
443 NIR_PASS(progress
, nir
, nir_copy_prop
);
444 NIR_PASS(progress
, nir
, nir_opt_dce
);
445 NIR_PASS(progress
, nir
, nir_opt_dead_cf
);
446 NIR_PASS(progress
, nir
, nir_opt_cse
);
447 NIR_PASS(progress
, nir
, nir_opt_peephole_select
, 64, false, true);
448 NIR_PASS(progress
, nir
, nir_opt_algebraic
);
449 NIR_PASS(progress
, nir
, nir_opt_constant_folding
);
451 if (lower_flrp
!= 0) {
452 bool lower_flrp_progress
= false;
453 NIR_PASS(lower_flrp_progress
,
457 false /* always_precise */,
458 nir
->options
->lower_ffma
);
459 if (lower_flrp_progress
) {
460 NIR_PASS(progress
, nir
,
461 nir_opt_constant_folding
);
465 /* Nothing should rematerialize any flrps, so we only
466 * need to do this lowering once.
471 NIR_PASS(progress
, nir
, nir_opt_undef
);
472 NIR_PASS(progress
, nir
, nir_undef_to_zero
);
474 NIR_PASS(progress
, nir
, nir_opt_loop_unroll
,
477 nir_var_function_temp
);
479 NIR_PASS(progress
, nir
, nir_opt_vectorize
);
482 /* Must be run at the end to prevent creation of fsin/fcos ops */
483 NIR_PASS(progress
, nir
, midgard_nir_scale_trig
);
488 NIR_PASS(progress
, nir
, nir_opt_dce
);
489 NIR_PASS(progress
, nir
, nir_opt_algebraic
);
490 NIR_PASS(progress
, nir
, nir_opt_constant_folding
);
491 NIR_PASS(progress
, nir
, nir_copy_prop
);
494 NIR_PASS(progress
, nir
, nir_opt_algebraic_late
);
496 /* We implement booleans as 32-bit 0/~0 */
497 NIR_PASS(progress
, nir
, nir_lower_bool_to_int32
);
499 /* Now that booleans are lowered, we can run out late opts */
500 NIR_PASS(progress
, nir
, midgard_nir_lower_algebraic_late
);
502 /* Lower mods for float ops only. Integer ops don't support modifiers
503 * (saturate doesn't make sense on integers, neg/abs require dedicated
506 NIR_PASS(progress
, nir
, nir_lower_to_source_mods
, nir_lower_float_source_mods
);
507 NIR_PASS(progress
, nir
, nir_copy_prop
);
508 NIR_PASS(progress
, nir
, nir_opt_dce
);
510 /* Take us out of SSA */
511 NIR_PASS(progress
, nir
, nir_lower_locals_to_regs
);
512 NIR_PASS(progress
, nir
, nir_convert_from_ssa
, true);
514 /* We are a vector architecture; write combine where possible */
515 NIR_PASS(progress
, nir
, nir_move_vec_src_uses_to_dest
);
516 NIR_PASS(progress
, nir
, nir_lower_vec_to_movs
);
518 NIR_PASS(progress
, nir
, nir_opt_dce
);
521 /* Do not actually emit a load; instead, cache the constant for inlining */
524 emit_load_const(compiler_context
*ctx
, nir_load_const_instr
*instr
)
526 nir_ssa_def def
= instr
->def
;
528 float *v
= rzalloc_array(NULL
, float, 4);
529 nir_const_load_to_arr(v
, instr
, f32
);
531 /* Shifted for SSA, +1 for off-by-one */
532 _mesa_hash_table_u64_insert(ctx
->ssa_constants
, (def
.index
<< 1) + 1, v
);
535 /* Normally constants are embedded implicitly, but for I/O and such we have to
536 * explicitly emit a move with the constant source */
539 emit_explicit_constant(compiler_context
*ctx
, unsigned node
, unsigned to
)
541 void *constant_value
= _mesa_hash_table_u64_search(ctx
->ssa_constants
, node
+ 1);
543 if (constant_value
) {
544 midgard_instruction ins
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
), blank_alu_src
, to
);
545 attach_constants(ctx
, &ins
, constant_value
, node
+ 1);
546 emit_mir_instruction(ctx
, ins
);
551 nir_src_index(compiler_context
*ctx
, nir_src
*src
)
554 return (src
->ssa
->index
<< 1) | 0;
556 assert(!src
->reg
.indirect
);
557 return (src
->reg
.reg
->index
<< 1) | IS_REG
;
562 nir_alu_src_index(compiler_context
*ctx
, nir_alu_src
*src
)
564 return nir_src_index(ctx
, &src
->src
);
568 nir_is_non_scalar_swizzle(nir_alu_src
*src
, unsigned nr_components
)
570 unsigned comp
= src
->swizzle
[0];
572 for (unsigned c
= 1; c
< nr_components
; ++c
) {
573 if (src
->swizzle
[c
] != comp
)
580 /* Midgard puts scalar conditionals in r31.w; move an arbitrary source (the
581 * output of a conditional test) into that register */
584 emit_condition(compiler_context
*ctx
, nir_src
*src
, bool for_branch
, unsigned component
)
586 int condition
= nir_src_index(ctx
, src
);
588 /* Source to swizzle the desired component into w */
590 const midgard_vector_alu_src alu_src
= {
591 .swizzle
= SWIZZLE(component
, component
, component
, component
),
594 /* There is no boolean move instruction. Instead, we simulate a move by
595 * ANDing the condition with itself to get it into r31.w */
597 midgard_instruction ins
= {
600 /* We need to set the conditional as close as possible */
601 .precede_break
= true,
602 .unit
= for_branch
? UNIT_SMUL
: UNIT_SADD
,
603 .mask
= 1 << COMPONENT_W
,
608 .dest
= SSA_FIXED_REGISTER(31),
612 .op
= midgard_alu_op_iand
,
613 .outmod
= midgard_outmod_int_wrap
,
614 .reg_mode
= midgard_reg_mode_32
,
615 .dest_override
= midgard_dest_override_none
,
616 .src1
= vector_alu_srco_unsigned(alu_src
),
617 .src2
= vector_alu_srco_unsigned(alu_src
)
621 emit_mir_instruction(ctx
, ins
);
624 /* Or, for mixed conditions (with csel_v), here's a vector version using all of
628 emit_condition_mixed(compiler_context
*ctx
, nir_alu_src
*src
, unsigned nr_comp
)
630 int condition
= nir_src_index(ctx
, &src
->src
);
632 /* Source to swizzle the desired component into w */
634 const midgard_vector_alu_src alu_src
= {
635 .swizzle
= SWIZZLE_FROM_ARRAY(src
->swizzle
),
638 /* There is no boolean move instruction. Instead, we simulate a move by
639 * ANDing the condition with itself to get it into r31.w */
641 midgard_instruction ins
= {
643 .precede_break
= true,
644 .mask
= mask_of(nr_comp
),
648 .dest
= SSA_FIXED_REGISTER(31),
651 .op
= midgard_alu_op_iand
,
652 .outmod
= midgard_outmod_int_wrap
,
653 .reg_mode
= midgard_reg_mode_32
,
654 .dest_override
= midgard_dest_override_none
,
655 .src1
= vector_alu_srco_unsigned(alu_src
),
656 .src2
= vector_alu_srco_unsigned(alu_src
)
660 emit_mir_instruction(ctx
, ins
);
665 /* Likewise, indirect offsets are put in r27.w. TODO: Allow componentwise
666 * pinning to eliminate this move in all known cases */
669 emit_indirect_offset(compiler_context
*ctx
, nir_src
*src
)
671 int offset
= nir_src_index(ctx
, src
);
673 midgard_instruction ins
= {
675 .mask
= 1 << COMPONENT_W
,
677 .src0
= SSA_UNUSED_1
,
679 .dest
= SSA_FIXED_REGISTER(REGISTER_OFFSET
),
682 .op
= midgard_alu_op_imov
,
683 .outmod
= midgard_outmod_int_wrap
,
684 .reg_mode
= midgard_reg_mode_32
,
685 .dest_override
= midgard_dest_override_none
,
686 .src1
= vector_alu_srco_unsigned(zero_alu_src
),
687 .src2
= vector_alu_srco_unsigned(blank_alu_src_xxxx
)
691 emit_mir_instruction(ctx
, ins
);
694 #define ALU_CASE(nir, _op) \
696 op = midgard_alu_op_##_op; \
697 assert(src_bitsize == dst_bitsize); \
700 #define ALU_CASE_BCAST(nir, _op, count) \
702 op = midgard_alu_op_##_op; \
703 broadcast_swizzle = count; \
704 assert(src_bitsize == dst_bitsize); \
707 nir_is_fzero_constant(nir_src src
)
709 if (!nir_src_is_const(src
))
712 for (unsigned c
= 0; c
< nir_src_num_components(src
); ++c
) {
713 if (nir_src_comp_as_float(src
, c
) != 0.0)
720 /* Analyze the sizes of the inputs to determine which reg mode. Ops needed
721 * special treatment override this anyway. */
723 static midgard_reg_mode
724 reg_mode_for_nir(nir_alu_instr
*instr
)
726 unsigned src_bitsize
= nir_src_bit_size(instr
->src
[0].src
);
728 switch (src_bitsize
) {
730 return midgard_reg_mode_8
;
732 return midgard_reg_mode_16
;
734 return midgard_reg_mode_32
;
736 return midgard_reg_mode_64
;
738 unreachable("Invalid bit size");
743 emit_alu(compiler_context
*ctx
, nir_alu_instr
*instr
)
745 bool is_ssa
= instr
->dest
.dest
.is_ssa
;
747 unsigned dest
= nir_dest_index(ctx
, &instr
->dest
.dest
);
748 unsigned nr_components
= nir_dest_num_components(instr
->dest
.dest
);
749 unsigned nr_inputs
= nir_op_infos
[instr
->op
].num_inputs
;
751 /* Most Midgard ALU ops have a 1:1 correspondance to NIR ops; these are
752 * supported. A few do not and are commented for now. Also, there are a
753 * number of NIR ops which Midgard does not support and need to be
754 * lowered, also TODO. This switch block emits the opcode and calling
755 * convention of the Midgard instruction; actual packing is done in
760 /* Number of components valid to check for the instruction (the rest
761 * will be forced to the last), or 0 to use as-is. Relevant as
762 * ball-type instructions have a channel count in NIR but are all vec4
765 unsigned broadcast_swizzle
= 0;
767 /* What register mode should we operate in? */
768 midgard_reg_mode reg_mode
=
769 reg_mode_for_nir(instr
);
771 /* Do we need a destination override? Used for inline
774 midgard_dest_override dest_override
=
775 midgard_dest_override_none
;
777 /* Should we use a smaller respective source and sign-extend? */
779 bool half_1
= false, sext_1
= false;
780 bool half_2
= false, sext_2
= false;
782 unsigned src_bitsize
= nir_src_bit_size(instr
->src
[0].src
);
783 unsigned dst_bitsize
= nir_dest_bit_size(instr
->dest
.dest
);
786 ALU_CASE(fadd
, fadd
);
787 ALU_CASE(fmul
, fmul
);
788 ALU_CASE(fmin
, fmin
);
789 ALU_CASE(fmax
, fmax
);
790 ALU_CASE(imin
, imin
);
791 ALU_CASE(imax
, imax
);
792 ALU_CASE(umin
, umin
);
793 ALU_CASE(umax
, umax
);
794 ALU_CASE(ffloor
, ffloor
);
795 ALU_CASE(fround_even
, froundeven
);
796 ALU_CASE(ftrunc
, ftrunc
);
797 ALU_CASE(fceil
, fceil
);
798 ALU_CASE(fdot3
, fdot3
);
799 ALU_CASE(fdot4
, fdot4
);
800 ALU_CASE(iadd
, iadd
);
801 ALU_CASE(isub
, isub
);
802 ALU_CASE(imul
, imul
);
804 /* Zero shoved as second-arg */
805 ALU_CASE(iabs
, iabsdiff
);
809 ALU_CASE(feq32
, feq
);
810 ALU_CASE(fne32
, fne
);
811 ALU_CASE(flt32
, flt
);
812 ALU_CASE(ieq32
, ieq
);
813 ALU_CASE(ine32
, ine
);
814 ALU_CASE(ilt32
, ilt
);
815 ALU_CASE(ult32
, ult
);
817 /* We don't have a native b2f32 instruction. Instead, like many
818 * GPUs, we exploit booleans as 0/~0 for false/true, and
819 * correspondingly AND
820 * by 1.0 to do the type conversion. For the moment, prime us
823 * iand [whatever], #0
825 * At the end of emit_alu (as MIR), we'll fix-up the constant
828 ALU_CASE(b2f32
, iand
);
829 ALU_CASE(b2i32
, iand
);
831 /* Likewise, we don't have a dedicated f2b32 instruction, but
832 * we can do a "not equal to 0.0" test. */
834 ALU_CASE(f2b32
, fne
);
835 ALU_CASE(i2b32
, ine
);
837 ALU_CASE(frcp
, frcp
);
838 ALU_CASE(frsq
, frsqrt
);
839 ALU_CASE(fsqrt
, fsqrt
);
840 ALU_CASE(fexp2
, fexp2
);
841 ALU_CASE(flog2
, flog2
);
843 ALU_CASE(f2i32
, f2i_rtz
);
844 ALU_CASE(f2u32
, f2u_rtz
);
845 ALU_CASE(i2f32
, i2f_rtz
);
846 ALU_CASE(u2f32
, u2f_rtz
);
848 ALU_CASE(f2i16
, f2i_rtz
);
849 ALU_CASE(f2u16
, f2u_rtz
);
850 ALU_CASE(i2f16
, i2f_rtz
);
851 ALU_CASE(u2f16
, u2f_rtz
);
853 ALU_CASE(fsin
, fsin
);
854 ALU_CASE(fcos
, fcos
);
856 /* We'll set invert */
857 ALU_CASE(inot
, imov
);
858 ALU_CASE(iand
, iand
);
860 ALU_CASE(ixor
, ixor
);
861 ALU_CASE(ishl
, ishl
);
862 ALU_CASE(ishr
, iasr
);
863 ALU_CASE(ushr
, ilsr
);
865 ALU_CASE_BCAST(b32all_fequal2
, fball_eq
, 2);
866 ALU_CASE_BCAST(b32all_fequal3
, fball_eq
, 3);
867 ALU_CASE(b32all_fequal4
, fball_eq
);
869 ALU_CASE_BCAST(b32any_fnequal2
, fbany_neq
, 2);
870 ALU_CASE_BCAST(b32any_fnequal3
, fbany_neq
, 3);
871 ALU_CASE(b32any_fnequal4
, fbany_neq
);
873 ALU_CASE_BCAST(b32all_iequal2
, iball_eq
, 2);
874 ALU_CASE_BCAST(b32all_iequal3
, iball_eq
, 3);
875 ALU_CASE(b32all_iequal4
, iball_eq
);
877 ALU_CASE_BCAST(b32any_inequal2
, ibany_neq
, 2);
878 ALU_CASE_BCAST(b32any_inequal3
, ibany_neq
, 3);
879 ALU_CASE(b32any_inequal4
, ibany_neq
);
881 /* Source mods will be shoved in later */
882 ALU_CASE(fabs
, fmov
);
883 ALU_CASE(fneg
, fmov
);
884 ALU_CASE(fsat
, fmov
);
886 /* For size conversion, we use a move. Ideally though we would squash
887 * these ops together; maybe that has to happen after in NIR as part of
888 * propagation...? An earlier algebraic pass ensured we step down by
889 * only / exactly one size. If stepping down, we use a dest override to
890 * reduce the size; if stepping up, we use a larger-sized move with a
891 * half source and a sign/zero-extension modifier */
896 /* If we end up upscale, we'll need a sign-extend on the
897 * operand (the second argument) */
903 op
= midgard_alu_op_imov
;
905 if (dst_bitsize
== (src_bitsize
* 2)) {
909 /* Use a greater register mode */
911 } else if (src_bitsize
== (dst_bitsize
* 2)) {
912 /* Converting down */
913 dest_override
= midgard_dest_override_lower
;
920 assert(src_bitsize
== 32);
922 op
= midgard_alu_op_fmov
;
923 dest_override
= midgard_dest_override_lower
;
928 assert(src_bitsize
== 16);
930 op
= midgard_alu_op_fmov
;
937 /* For greater-or-equal, we lower to less-or-equal and flip the
945 instr
->op
== nir_op_fge
? midgard_alu_op_fle
:
946 instr
->op
== nir_op_fge32
? midgard_alu_op_fle
:
947 instr
->op
== nir_op_ige32
? midgard_alu_op_ile
:
948 instr
->op
== nir_op_uge32
? midgard_alu_op_ule
:
951 /* Swap via temporary */
952 nir_alu_src temp
= instr
->src
[1];
953 instr
->src
[1] = instr
->src
[0];
954 instr
->src
[0] = temp
;
959 case nir_op_b32csel
: {
960 /* Midgard features both fcsel and icsel, depending on
961 * the type of the arguments/output. However, as long
962 * as we're careful we can _always_ use icsel and
963 * _never_ need fcsel, since the latter does additional
964 * floating-point-specific processing whereas the
965 * former just moves bits on the wire. It's not obvious
966 * why these are separate opcodes, save for the ability
967 * to do things like sat/pos/abs/neg for free */
969 bool mixed
= nir_is_non_scalar_swizzle(&instr
->src
[0], nr_components
);
970 op
= mixed
? midgard_alu_op_icsel_v
: midgard_alu_op_icsel
;
972 /* csel works as a two-arg in Midgard, since the condition is hardcoded in r31.w */
975 /* Emit the condition into r31 */
978 emit_condition_mixed(ctx
, &instr
->src
[0], nr_components
);
980 emit_condition(ctx
, &instr
->src
[0].src
, false, instr
->src
[0].swizzle
[0]);
982 /* The condition is the first argument; move the other
983 * arguments up one to be a binary instruction for
986 memmove(instr
->src
, instr
->src
+ 1, 2 * sizeof(nir_alu_src
));
991 DBG("Unhandled ALU op %s\n", nir_op_infos
[instr
->op
].name
);
996 /* Midgard can perform certain modifiers on output of an ALU op */
999 if (midgard_is_integer_out_op(op
)) {
1000 outmod
= midgard_outmod_int_wrap
;
1002 bool sat
= instr
->dest
.saturate
|| instr
->op
== nir_op_fsat
;
1003 outmod
= sat
? midgard_outmod_sat
: midgard_outmod_none
;
1006 /* fmax(a, 0.0) can turn into a .pos modifier as an optimization */
1008 if (instr
->op
== nir_op_fmax
) {
1009 if (nir_is_fzero_constant(instr
->src
[0].src
)) {
1010 op
= midgard_alu_op_fmov
;
1012 outmod
= midgard_outmod_pos
;
1013 instr
->src
[0] = instr
->src
[1];
1014 } else if (nir_is_fzero_constant(instr
->src
[1].src
)) {
1015 op
= midgard_alu_op_fmov
;
1017 outmod
= midgard_outmod_pos
;
1021 /* Fetch unit, quirks, etc information */
1022 unsigned opcode_props
= alu_opcode_props
[op
].props
;
1023 bool quirk_flipped_r24
= opcode_props
& QUIRK_FLIPPED_R24
;
1025 /* src0 will always exist afaik, but src1 will not for 1-argument
1026 * instructions. The latter can only be fetched if the instruction
1027 * needs it, or else we may segfault. */
1029 unsigned src0
= nir_alu_src_index(ctx
, &instr
->src
[0]);
1030 unsigned src1
= nr_inputs
== 2 ? nir_alu_src_index(ctx
, &instr
->src
[1]) : SSA_UNUSED_0
;
1032 /* Rather than use the instruction generation helpers, we do it
1033 * ourselves here to avoid the mess */
1035 midgard_instruction ins
= {
1038 .src0
= quirk_flipped_r24
? SSA_UNUSED_1
: src0
,
1039 .src1
= quirk_flipped_r24
? src0
: src1
,
1044 nir_alu_src
*nirmods
[2] = { NULL
};
1046 if (nr_inputs
== 2) {
1047 nirmods
[0] = &instr
->src
[0];
1048 nirmods
[1] = &instr
->src
[1];
1049 } else if (nr_inputs
== 1) {
1050 nirmods
[quirk_flipped_r24
] = &instr
->src
[0];
1055 /* These were lowered to a move, so apply the corresponding mod */
1057 if (instr
->op
== nir_op_fneg
|| instr
->op
== nir_op_fabs
) {
1058 nir_alu_src
*s
= nirmods
[quirk_flipped_r24
];
1060 if (instr
->op
== nir_op_fneg
)
1061 s
->negate
= !s
->negate
;
1063 if (instr
->op
== nir_op_fabs
)
1067 bool is_int
= midgard_is_integer_op(op
);
1069 ins
.mask
= mask_of(nr_components
);
1071 midgard_vector_alu alu
= {
1073 .reg_mode
= reg_mode
,
1074 .dest_override
= dest_override
,
1077 .src1
= vector_alu_srco_unsigned(vector_alu_modifiers(nirmods
[0], is_int
, broadcast_swizzle
, half_1
, sext_1
)),
1078 .src2
= vector_alu_srco_unsigned(vector_alu_modifiers(nirmods
[1], is_int
, broadcast_swizzle
, half_2
, sext_2
)),
1081 /* Apply writemask if non-SSA, keeping in mind that we can't write to components that don't exist */
1084 ins
.mask
&= instr
->dest
.write_mask
;
1088 /* Late fixup for emulated instructions */
1090 if (instr
->op
== nir_op_b2f32
|| instr
->op
== nir_op_b2i32
) {
1091 /* Presently, our second argument is an inline #0 constant.
1092 * Switch over to an embedded 1.0 constant (that can't fit
1093 * inline, since we're 32-bit, not 16-bit like the inline
1096 ins
.ssa_args
.inline_constant
= false;
1097 ins
.ssa_args
.src1
= SSA_FIXED_REGISTER(REGISTER_CONSTANT
);
1098 ins
.has_constants
= true;
1100 if (instr
->op
== nir_op_b2f32
) {
1101 ins
.constants
[0] = 1.0f
;
1103 /* Type pun it into place */
1105 memcpy(&ins
.constants
[0], &one
, sizeof(uint32_t));
1108 ins
.alu
.src2
= vector_alu_srco_unsigned(blank_alu_src_xxxx
);
1109 } else if (nr_inputs
== 1 && !quirk_flipped_r24
) {
1110 /* Lots of instructions need a 0 plonked in */
1111 ins
.ssa_args
.inline_constant
= false;
1112 ins
.ssa_args
.src1
= SSA_FIXED_REGISTER(REGISTER_CONSTANT
);
1113 ins
.has_constants
= true;
1114 ins
.constants
[0] = 0.0f
;
1115 ins
.alu
.src2
= vector_alu_srco_unsigned(blank_alu_src_xxxx
);
1116 } else if (instr
->op
== nir_op_inot
) {
1120 if ((opcode_props
& UNITS_ALL
) == UNIT_VLUT
) {
1121 /* To avoid duplicating the lookup tables (probably), true LUT
1122 * instructions can only operate as if they were scalars. Lower
1123 * them here by changing the component. */
1125 uint8_t original_swizzle
[4];
1126 memcpy(original_swizzle
, nirmods
[0]->swizzle
, sizeof(nirmods
[0]->swizzle
));
1127 unsigned orig_mask
= ins
.mask
;
1129 for (int i
= 0; i
< nr_components
; ++i
) {
1130 /* Mask the associated component, dropping the
1131 * instruction if needed */
1134 ins
.mask
&= orig_mask
;
1139 for (int j
= 0; j
< 4; ++j
)
1140 nirmods
[0]->swizzle
[j
] = original_swizzle
[i
]; /* Pull from the correct component */
1142 ins
.alu
.src1
= vector_alu_srco_unsigned(vector_alu_modifiers(nirmods
[0], is_int
, broadcast_swizzle
, half_1
, false));
1143 emit_mir_instruction(ctx
, ins
);
1146 emit_mir_instruction(ctx
, ins
);
1152 /* Uniforms and UBOs use a shared code path, as uniforms are just (slightly
1153 * optimized) versions of UBO #0 */
1157 compiler_context
*ctx
,
1160 nir_src
*indirect_offset
,
1163 /* TODO: half-floats */
1165 midgard_instruction ins
= m_ld_uniform_32(dest
, offset
);
1167 /* TODO: Don't split */
1168 ins
.load_store
.varying_parameters
= (offset
& 7) << 7;
1169 ins
.load_store
.address
= offset
>> 3;
1171 if (indirect_offset
) {
1172 emit_indirect_offset(ctx
, indirect_offset
);
1173 ins
.load_store
.unknown
= 0x8700 | index
; /* xxx: what is this? */
1175 ins
.load_store
.unknown
= 0x1E00 | index
; /* xxx: what is this? */
1178 emit_mir_instruction(ctx
, ins
);
1183 compiler_context
*ctx
,
1184 unsigned dest
, unsigned offset
,
1185 unsigned nr_comp
, unsigned component
,
1186 nir_src
*indirect_offset
, nir_alu_type type
)
1188 /* XXX: Half-floats? */
1189 /* TODO: swizzle, mask */
1191 midgard_instruction ins
= m_ld_vary_32(dest
, offset
);
1192 ins
.mask
= mask_of(nr_comp
);
1193 ins
.load_store
.swizzle
= SWIZZLE_XYZW
>> (2 * component
);
1195 midgard_varying_parameter p
= {
1197 .interpolation
= midgard_interp_default
,
1198 .flat
= /*var->data.interpolation == INTERP_MODE_FLAT*/ 0
1202 memcpy(&u
, &p
, sizeof(p
));
1203 ins
.load_store
.varying_parameters
= u
;
1205 if (indirect_offset
) {
1206 /* We need to add in the dynamic index, moved to r27.w */
1207 emit_indirect_offset(ctx
, indirect_offset
);
1208 ins
.load_store
.unknown
= 0x79e; /* xxx: what is this? */
1210 /* Just a direct load */
1211 ins
.load_store
.unknown
= 0x1e9e; /* xxx: what is this? */
1214 /* Use the type appropriate load */
1218 ins
.load_store
.op
= midgard_op_ld_vary_32u
;
1221 ins
.load_store
.op
= midgard_op_ld_vary_32i
;
1223 case nir_type_float
:
1224 ins
.load_store
.op
= midgard_op_ld_vary_32
;
1227 unreachable("Attempted to load unknown type");
1231 emit_mir_instruction(ctx
, ins
);
1235 emit_sysval_read(compiler_context
*ctx
, nir_instr
*instr
)
1239 /* Figure out which uniform this is */
1240 int sysval
= sysval_for_instr(ctx
, instr
, &dest
);
1241 void *val
= _mesa_hash_table_u64_search(ctx
->sysval_to_id
, sysval
);
1243 /* Sysvals are prefix uniforms */
1244 unsigned uniform
= ((uintptr_t) val
) - 1;
1246 /* Emit the read itself -- this is never indirect */
1247 emit_ubo_read(ctx
, dest
, uniform
, NULL
, 0);
1251 emit_intrinsic(compiler_context
*ctx
, nir_intrinsic_instr
*instr
)
1253 unsigned offset
= 0, reg
;
1255 switch (instr
->intrinsic
) {
1256 case nir_intrinsic_discard_if
:
1257 emit_condition(ctx
, &instr
->src
[0], true, COMPONENT_X
);
1261 case nir_intrinsic_discard
: {
1262 bool conditional
= instr
->intrinsic
== nir_intrinsic_discard_if
;
1263 struct midgard_instruction discard
= v_branch(conditional
, false);
1264 discard
.branch
.target_type
= TARGET_DISCARD
;
1265 emit_mir_instruction(ctx
, discard
);
1269 case nir_intrinsic_load_uniform
:
1270 case nir_intrinsic_load_ubo
:
1271 case nir_intrinsic_load_input
: {
1272 bool is_uniform
= instr
->intrinsic
== nir_intrinsic_load_uniform
;
1273 bool is_ubo
= instr
->intrinsic
== nir_intrinsic_load_ubo
;
1275 /* Get the base type of the intrinsic */
1276 /* TODO: Infer type? Does it matter? */
1278 is_ubo
? nir_type_uint
: nir_intrinsic_type(instr
);
1279 t
= nir_alu_type_get_base_type(t
);
1282 offset
= nir_intrinsic_base(instr
);
1285 unsigned nr_comp
= nir_intrinsic_dest_components(instr
);
1287 nir_src
*src_offset
= nir_get_io_offset_src(instr
);
1289 bool direct
= nir_src_is_const(*src_offset
);
1292 offset
+= nir_src_as_uint(*src_offset
);
1294 /* We may need to apply a fractional offset */
1295 int component
= instr
->intrinsic
== nir_intrinsic_load_input
?
1296 nir_intrinsic_component(instr
) : 0;
1297 reg
= nir_dest_index(ctx
, &instr
->dest
);
1299 if (is_uniform
&& !ctx
->is_blend
) {
1300 emit_ubo_read(ctx
, reg
, ctx
->sysval_count
+ offset
, !direct
? &instr
->src
[0] : NULL
, 0);
1301 } else if (is_ubo
) {
1302 nir_src index
= instr
->src
[0];
1304 /* We don't yet support indirect UBOs. For indirect
1305 * block numbers (if that's possible), we don't know
1306 * enough about the hardware yet. For indirect sources,
1307 * we know what we need but we need to add some NIR
1308 * support for lowering correctly with respect to
1311 assert(nir_src_is_const(index
));
1312 assert(nir_src_is_const(*src_offset
));
1314 /* TODO: Alignment */
1315 assert((offset
& 0xF) == 0);
1317 uint32_t uindex
= nir_src_as_uint(index
) + 1;
1318 emit_ubo_read(ctx
, reg
, offset
/ 16, NULL
, uindex
);
1319 } else if (ctx
->stage
== MESA_SHADER_FRAGMENT
&& !ctx
->is_blend
) {
1320 emit_varying_read(ctx
, reg
, offset
, nr_comp
, component
, !direct
? &instr
->src
[0] : NULL
, t
);
1321 } else if (ctx
->is_blend
) {
1322 /* For blend shaders, load the input color, which is
1323 * preloaded to r0 */
1325 midgard_instruction move
= v_mov(SSA_FIXED_REGISTER(0), blank_alu_src
, reg
);
1326 emit_mir_instruction(ctx
, move
);
1327 } else if (ctx
->stage
== MESA_SHADER_VERTEX
) {
1328 midgard_instruction ins
= m_ld_attr_32(reg
, offset
);
1329 ins
.load_store
.unknown
= 0x1E1E; /* XXX: What is this? */
1330 ins
.mask
= mask_of(nr_comp
);
1332 /* Use the type appropriate load */
1336 ins
.load_store
.op
= midgard_op_ld_attr_32u
;
1339 ins
.load_store
.op
= midgard_op_ld_attr_32i
;
1341 case nir_type_float
:
1342 ins
.load_store
.op
= midgard_op_ld_attr_32
;
1345 unreachable("Attempted to load unknown type");
1349 emit_mir_instruction(ctx
, ins
);
1351 DBG("Unknown load\n");
1358 /* Reads 128-bit value raw off the tilebuffer during blending, tasty */
1360 case nir_intrinsic_load_raw_output_pan
:
1361 reg
= nir_dest_index(ctx
, &instr
->dest
);
1362 assert(ctx
->is_blend
);
1364 midgard_instruction ins
= m_ld_color_buffer_8(reg
, 0);
1365 emit_mir_instruction(ctx
, ins
);
1368 case nir_intrinsic_load_blend_const_color_rgba
: {
1369 assert(ctx
->is_blend
);
1370 reg
= nir_dest_index(ctx
, &instr
->dest
);
1372 /* Blend constants are embedded directly in the shader and
1373 * patched in, so we use some magic routing */
1375 midgard_instruction ins
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
), blank_alu_src
, reg
);
1376 ins
.has_constants
= true;
1377 ins
.has_blend_constant
= true;
1378 emit_mir_instruction(ctx
, ins
);
1382 case nir_intrinsic_store_output
:
1383 assert(nir_src_is_const(instr
->src
[1]) && "no indirect outputs");
1385 offset
= nir_intrinsic_base(instr
) + nir_src_as_uint(instr
->src
[1]);
1387 reg
= nir_src_index(ctx
, &instr
->src
[0]);
1389 if (ctx
->stage
== MESA_SHADER_FRAGMENT
) {
1390 /* gl_FragColor is not emitted with load/store
1391 * instructions. Instead, it gets plonked into
1392 * r0 at the end of the shader and we do the
1393 * framebuffer writeout dance. TODO: Defer
1396 midgard_instruction move
= v_mov(reg
, blank_alu_src
, SSA_FIXED_REGISTER(0));
1397 emit_mir_instruction(ctx
, move
);
1399 /* Save the index we're writing to for later reference
1400 * in the epilogue */
1402 ctx
->fragment_output
= reg
;
1403 } else if (ctx
->stage
== MESA_SHADER_VERTEX
) {
1404 /* We should have been vectorized, though we don't
1405 * currently check that st_vary is emitted only once
1406 * per slot (this is relevant, since there's not a mask
1407 * parameter available on the store [set to 0 by the
1408 * blob]). We do respect the component by adjusting the
1409 * swizzle. If this is a constant source, we'll need to
1410 * emit that explicitly. */
1412 emit_explicit_constant(ctx
, reg
, reg
);
1414 unsigned component
= nir_intrinsic_component(instr
);
1416 midgard_instruction st
= m_st_vary_32(reg
, offset
);
1417 st
.load_store
.unknown
= 0x1E9E; /* XXX: What is this? */
1418 st
.load_store
.swizzle
= SWIZZLE_XYZW
<< (2*component
);
1419 emit_mir_instruction(ctx
, st
);
1421 DBG("Unknown store\n");
1427 /* Special case of store_output for lowered blend shaders */
1428 case nir_intrinsic_store_raw_output_pan
:
1429 assert (ctx
->stage
== MESA_SHADER_FRAGMENT
);
1430 reg
= nir_src_index(ctx
, &instr
->src
[0]);
1432 midgard_instruction move
= v_mov(reg
, blank_alu_src
, SSA_FIXED_REGISTER(0));
1433 emit_mir_instruction(ctx
, move
);
1434 ctx
->fragment_output
= reg
;
1438 case nir_intrinsic_load_alpha_ref_float
:
1439 assert(instr
->dest
.is_ssa
);
1441 float ref_value
= ctx
->alpha_ref
;
1443 /* See emit_load_const */
1444 float *v
= ralloc_array(NULL
, float, 4);
1445 memcpy(v
, &ref_value
, sizeof(float));
1446 _mesa_hash_table_u64_insert(ctx
->ssa_constants
, (instr
->dest
.ssa
.index
<< 1) + 1, v
);
1449 case nir_intrinsic_load_viewport_scale
:
1450 case nir_intrinsic_load_viewport_offset
:
1451 emit_sysval_read(ctx
, &instr
->instr
);
1455 printf ("Unhandled intrinsic\n");
1462 midgard_tex_format(enum glsl_sampler_dim dim
)
1465 case GLSL_SAMPLER_DIM_1D
:
1466 case GLSL_SAMPLER_DIM_BUF
:
1469 case GLSL_SAMPLER_DIM_2D
:
1470 case GLSL_SAMPLER_DIM_EXTERNAL
:
1473 case GLSL_SAMPLER_DIM_3D
:
1476 case GLSL_SAMPLER_DIM_CUBE
:
1477 return MALI_TEX_CUBE
;
1480 DBG("Unknown sampler dim type\n");
1486 /* Tries to attach an explicit LOD / bias as a constant. Returns whether this
1490 pan_attach_constant_bias(
1491 compiler_context
*ctx
,
1493 midgard_texture_word
*word
)
1495 /* To attach as constant, it has to *be* constant */
1497 if (!nir_src_is_const(lod
))
1500 float f
= nir_src_as_float(lod
);
1502 /* Break into fixed-point */
1504 float lod_frac
= f
- lod_int
;
1506 /* Carry over negative fractions */
1507 if (lod_frac
< 0.0) {
1513 word
->bias
= float_to_ubyte(lod_frac
);
1514 word
->bias_int
= lod_int
;
1519 static enum mali_sampler_type
1520 midgard_sampler_type(nir_alu_type t
) {
1521 switch (nir_alu_type_get_base_type(t
))
1523 case nir_type_float
:
1524 return MALI_SAMPLER_FLOAT
;
1526 return MALI_SAMPLER_SIGNED
;
1528 return MALI_SAMPLER_UNSIGNED
;
1530 unreachable("Unknown sampler type");
1535 emit_texop_native(compiler_context
*ctx
, nir_tex_instr
*instr
,
1536 unsigned midgard_texop
)
1539 //assert (!instr->sampler);
1540 //assert (!instr->texture_array_size);
1542 int texture_index
= instr
->texture_index
;
1543 int sampler_index
= texture_index
;
1545 /* No helper to build texture words -- we do it all here */
1546 midgard_instruction ins
= {
1547 .type
= TAG_TEXTURE_4
,
1550 .dest
= nir_dest_index(ctx
, &instr
->dest
),
1555 .op
= midgard_texop
,
1556 .format
= midgard_tex_format(instr
->sampler_dim
),
1557 .texture_handle
= texture_index
,
1558 .sampler_handle
= sampler_index
,
1559 .swizzle
= SWIZZLE_XYZW
,
1560 .in_reg_swizzle
= SWIZZLE_XYZW
,
1566 .sampler_type
= midgard_sampler_type(instr
->dest_type
),
1570 for (unsigned i
= 0; i
< instr
->num_srcs
; ++i
) {
1571 int index
= nir_src_index(ctx
, &instr
->src
[i
].src
);
1572 midgard_vector_alu_src alu_src
= blank_alu_src
;
1574 switch (instr
->src
[i
].src_type
) {
1575 case nir_tex_src_coord
: {
1576 emit_explicit_constant(ctx
, index
, index
);
1578 /* Texelfetch coordinates uses all four elements
1579 * (xyz/index) regardless of texture dimensionality,
1580 * which means it's necessary to zero the unused
1581 * components to keep everything happy */
1583 if (midgard_texop
== TEXTURE_OP_TEXEL_FETCH
) {
1584 unsigned old_index
= index
;
1586 index
= make_compiler_temp(ctx
);
1588 /* mov index, old_index */
1589 midgard_instruction mov
= v_mov(old_index
, blank_alu_src
, index
);
1591 emit_mir_instruction(ctx
, mov
);
1593 /* mov index.zw, #0 */
1594 mov
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
),
1595 blank_alu_src
, index
);
1596 mov
.has_constants
= true;
1597 mov
.mask
= (1 << COMPONENT_Z
) | (1 << COMPONENT_W
);
1598 emit_mir_instruction(ctx
, mov
);
1601 if (instr
->sampler_dim
== GLSL_SAMPLER_DIM_CUBE
) {
1602 /* texelFetch is undefined on samplerCube */
1603 assert(midgard_texop
!= TEXTURE_OP_TEXEL_FETCH
);
1605 /* For cubemaps, we use a special ld/st op to
1606 * select the face and copy the xy into the
1607 * texture register */
1609 unsigned temp
= make_compiler_temp(ctx
);
1611 midgard_instruction st
= m_st_cubemap_coords(temp
, 0);
1612 st
.ssa_args
.src0
= index
;
1613 st
.load_store
.unknown
= 0x24; /* XXX: What is this? */
1614 st
.mask
= 0x3; /* xy */
1615 st
.load_store
.swizzle
= alu_src
.swizzle
;
1616 emit_mir_instruction(ctx
, st
);
1618 ins
.ssa_args
.src0
= temp
;
1620 ins
.ssa_args
.src0
= index
;
1623 if (instr
->sampler_dim
== GLSL_SAMPLER_DIM_2D
) {
1624 /* Array component in w but NIR wants it in z */
1625 ins
.texture
.in_reg_swizzle
= SWIZZLE_XYZZ
;
1631 case nir_tex_src_bias
:
1632 case nir_tex_src_lod
: {
1633 /* Try as a constant if we can */
1635 bool is_txf
= midgard_texop
== TEXTURE_OP_TEXEL_FETCH
;
1636 if (!is_txf
&& pan_attach_constant_bias(ctx
, instr
->src
[i
].src
, &ins
.texture
))
1639 ins
.texture
.lod_register
= true;
1640 ins
.ssa_args
.src1
= index
;
1641 emit_explicit_constant(ctx
, index
, index
);
1647 unreachable("Unknown texture source type\n");
1651 emit_mir_instruction(ctx
, ins
);
1653 /* Used for .cont and .last hinting */
1654 ctx
->texture_op_count
++;
1658 emit_tex(compiler_context
*ctx
, nir_tex_instr
*instr
)
1660 /* Fixup op, since only textureLod is permitted in VS but NIR can give
1661 * generic tex in some cases (which confuses the hardware) */
1663 bool is_vertex
= ctx
->stage
== MESA_SHADER_VERTEX
;
1665 if (is_vertex
&& instr
->op
== nir_texop_tex
)
1666 instr
->op
= nir_texop_txl
;
1668 switch (instr
->op
) {
1671 emit_texop_native(ctx
, instr
, TEXTURE_OP_NORMAL
);
1674 emit_texop_native(ctx
, instr
, TEXTURE_OP_LOD
);
1677 emit_texop_native(ctx
, instr
, TEXTURE_OP_TEXEL_FETCH
);
1680 emit_sysval_read(ctx
, &instr
->instr
);
1683 unreachable("Unhanlded texture op");
1688 emit_jump(compiler_context
*ctx
, nir_jump_instr
*instr
)
1690 switch (instr
->type
) {
1691 case nir_jump_break
: {
1692 /* Emit a branch out of the loop */
1693 struct midgard_instruction br
= v_branch(false, false);
1694 br
.branch
.target_type
= TARGET_BREAK
;
1695 br
.branch
.target_break
= ctx
->current_loop_depth
;
1696 emit_mir_instruction(ctx
, br
);
1701 DBG("Unknown jump type %d\n", instr
->type
);
1707 emit_instr(compiler_context
*ctx
, struct nir_instr
*instr
)
1709 switch (instr
->type
) {
1710 case nir_instr_type_load_const
:
1711 emit_load_const(ctx
, nir_instr_as_load_const(instr
));
1714 case nir_instr_type_intrinsic
:
1715 emit_intrinsic(ctx
, nir_instr_as_intrinsic(instr
));
1718 case nir_instr_type_alu
:
1719 emit_alu(ctx
, nir_instr_as_alu(instr
));
1722 case nir_instr_type_tex
:
1723 emit_tex(ctx
, nir_instr_as_tex(instr
));
1726 case nir_instr_type_jump
:
1727 emit_jump(ctx
, nir_instr_as_jump(instr
));
1730 case nir_instr_type_ssa_undef
:
1735 DBG("Unhandled instruction type\n");
1741 /* ALU instructions can inline or embed constants, which decreases register
1742 * pressure and saves space. */
1744 #define CONDITIONAL_ATTACH(src) { \
1745 void *entry = _mesa_hash_table_u64_search(ctx->ssa_constants, alu->ssa_args.src + 1); \
1748 attach_constants(ctx, alu, entry, alu->ssa_args.src + 1); \
1749 alu->ssa_args.src = SSA_FIXED_REGISTER(REGISTER_CONSTANT); \
1754 inline_alu_constants(compiler_context
*ctx
)
1756 mir_foreach_instr(ctx
, alu
) {
1757 /* Other instructions cannot inline constants */
1758 if (alu
->type
!= TAG_ALU_4
) continue;
1760 /* If there is already a constant here, we can do nothing */
1761 if (alu
->has_constants
) continue;
1763 /* It makes no sense to inline constants on a branch */
1764 if (alu
->compact_branch
|| alu
->prepacked_branch
) continue;
1766 CONDITIONAL_ATTACH(src0
);
1768 if (!alu
->has_constants
) {
1769 CONDITIONAL_ATTACH(src1
)
1770 } else if (!alu
->inline_constant
) {
1771 /* Corner case: _two_ vec4 constants, for instance with a
1772 * csel. For this case, we can only use a constant
1773 * register for one, we'll have to emit a move for the
1774 * other. Note, if both arguments are constants, then
1775 * necessarily neither argument depends on the value of
1776 * any particular register. As the destination register
1777 * will be wiped, that means we can spill the constant
1778 * to the destination register.
1781 void *entry
= _mesa_hash_table_u64_search(ctx
->ssa_constants
, alu
->ssa_args
.src1
+ 1);
1782 unsigned scratch
= alu
->ssa_args
.dest
;
1785 midgard_instruction ins
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
), blank_alu_src
, scratch
);
1786 attach_constants(ctx
, &ins
, entry
, alu
->ssa_args
.src1
+ 1);
1788 /* Force a break XXX Defer r31 writes */
1789 ins
.unit
= UNIT_VLUT
;
1791 /* Set the source */
1792 alu
->ssa_args
.src1
= scratch
;
1794 /* Inject us -before- the last instruction which set r31 */
1795 mir_insert_instruction_before(mir_prev_op(alu
), ins
);
1801 /* Midgard supports two types of constants, embedded constants (128-bit) and
1802 * inline constants (16-bit). Sometimes, especially with scalar ops, embedded
1803 * constants can be demoted to inline constants, for space savings and
1804 * sometimes a performance boost */
1807 embedded_to_inline_constant(compiler_context
*ctx
)
1809 mir_foreach_instr(ctx
, ins
) {
1810 if (!ins
->has_constants
) continue;
1812 if (ins
->ssa_args
.inline_constant
) continue;
1814 /* Blend constants must not be inlined by definition */
1815 if (ins
->has_blend_constant
) continue;
1817 /* We can inline 32-bit (sometimes) or 16-bit (usually) */
1818 bool is_16
= ins
->alu
.reg_mode
== midgard_reg_mode_16
;
1819 bool is_32
= ins
->alu
.reg_mode
== midgard_reg_mode_32
;
1821 if (!(is_16
|| is_32
))
1824 /* src1 cannot be an inline constant due to encoding
1825 * restrictions. So, if possible we try to flip the arguments
1828 int op
= ins
->alu
.op
;
1830 if (ins
->ssa_args
.src0
== SSA_FIXED_REGISTER(REGISTER_CONSTANT
)) {
1832 /* These ops require an operational change to flip
1833 * their arguments TODO */
1834 case midgard_alu_op_flt
:
1835 case midgard_alu_op_fle
:
1836 case midgard_alu_op_ilt
:
1837 case midgard_alu_op_ile
:
1838 case midgard_alu_op_fcsel
:
1839 case midgard_alu_op_icsel
:
1840 DBG("Missed non-commutative flip (%s)\n", alu_opcode_props
[op
].name
);
1845 if (alu_opcode_props
[op
].props
& OP_COMMUTES
) {
1846 /* Flip the SSA numbers */
1847 ins
->ssa_args
.src0
= ins
->ssa_args
.src1
;
1848 ins
->ssa_args
.src1
= SSA_FIXED_REGISTER(REGISTER_CONSTANT
);
1850 /* And flip the modifiers */
1854 src_temp
= ins
->alu
.src2
;
1855 ins
->alu
.src2
= ins
->alu
.src1
;
1856 ins
->alu
.src1
= src_temp
;
1860 if (ins
->ssa_args
.src1
== SSA_FIXED_REGISTER(REGISTER_CONSTANT
)) {
1861 /* Extract the source information */
1863 midgard_vector_alu_src
*src
;
1864 int q
= ins
->alu
.src2
;
1865 midgard_vector_alu_src
*m
= (midgard_vector_alu_src
*) &q
;
1868 /* Component is from the swizzle, e.g. r26.w -> w component. TODO: What if x is masked out? */
1869 int component
= src
->swizzle
& 3;
1871 /* Scale constant appropriately, if we can legally */
1872 uint16_t scaled_constant
= 0;
1874 if (midgard_is_integer_op(op
) || is_16
) {
1875 unsigned int *iconstants
= (unsigned int *) ins
->constants
;
1876 scaled_constant
= (uint16_t) iconstants
[component
];
1878 /* Constant overflow after resize */
1879 if (scaled_constant
!= iconstants
[component
])
1882 float original
= (float) ins
->constants
[component
];
1883 scaled_constant
= _mesa_float_to_half(original
);
1885 /* Check for loss of precision. If this is
1886 * mediump, we don't care, but for a highp
1887 * shader, we need to pay attention. NIR
1888 * doesn't yet tell us which mode we're in!
1889 * Practically this prevents most constants
1890 * from being inlined, sadly. */
1892 float fp32
= _mesa_half_to_float(scaled_constant
);
1894 if (fp32
!= original
)
1898 /* We don't know how to handle these with a constant */
1900 bool is_int
= midgard_is_integer_op(ins
->alu
.op
);
1901 if (mir_nontrivial_raw_mod(*src
, is_int
) || src
->half
|| src
->rep_low
|| src
->rep_high
) {
1902 DBG("Bailing inline constant...\n");
1906 /* Make sure that the constant is not itself a
1907 * vector by checking if all accessed values
1908 * (by the swizzle) are the same. */
1910 uint32_t *cons
= (uint32_t *) ins
->constants
;
1911 uint32_t value
= cons
[component
];
1913 bool is_vector
= false;
1914 unsigned mask
= effective_writemask(&ins
->alu
, ins
->mask
);
1916 for (int c
= 1; c
< 4; ++c
) {
1917 /* We only care if this component is actually used */
1918 if (!(mask
& (1 << c
)))
1921 uint32_t test
= cons
[(src
->swizzle
>> (2 * c
)) & 3];
1923 if (test
!= value
) {
1932 /* Get rid of the embedded constant */
1933 ins
->has_constants
= false;
1934 ins
->ssa_args
.src1
= SSA_UNUSED_0
;
1935 ins
->ssa_args
.inline_constant
= true;
1936 ins
->inline_constant
= scaled_constant
;
1941 /* Dead code elimination for branches at the end of a block - only one branch
1942 * per block is legal semantically */
1945 midgard_opt_cull_dead_branch(compiler_context
*ctx
, midgard_block
*block
)
1947 bool branched
= false;
1949 mir_foreach_instr_in_block_safe(block
, ins
) {
1950 if (!midgard_is_branch_unit(ins
->unit
)) continue;
1952 /* We ignore prepacked branches since the fragment epilogue is
1953 * just generally special */
1954 if (ins
->prepacked_branch
) continue;
1956 /* Discards are similarly special and may not correspond to the
1959 if (ins
->branch
.target_type
== TARGET_DISCARD
) continue;
1962 /* We already branched, so this is dead */
1963 mir_remove_instruction(ins
);
1970 /* fmov.pos is an idiom for fpos. Propoagate the .pos up to the source, so then
1971 * the move can be propagated away entirely */
1974 mir_compose_float_outmod(midgard_outmod_float
*outmod
, midgard_outmod_float comp
)
1977 if (comp
== midgard_outmod_none
)
1980 if (*outmod
== midgard_outmod_none
) {
1985 /* TODO: Compose rules */
1990 midgard_opt_pos_propagate(compiler_context
*ctx
, midgard_block
*block
)
1992 bool progress
= false;
1994 mir_foreach_instr_in_block_safe(block
, ins
) {
1995 if (ins
->type
!= TAG_ALU_4
) continue;
1996 if (ins
->alu
.op
!= midgard_alu_op_fmov
) continue;
1997 if (ins
->alu
.outmod
!= midgard_outmod_pos
) continue;
1999 /* TODO: Registers? */
2000 unsigned src
= ins
->ssa_args
.src1
;
2001 if (src
& IS_REG
) continue;
2002 assert(!mir_has_multiple_writes(ctx
, src
));
2004 /* There might be a source modifier, too */
2005 if (mir_nontrivial_source2_mod(ins
)) continue;
2007 /* Backpropagate the modifier */
2008 mir_foreach_instr_in_block_from_rev(block
, v
, mir_prev_op(ins
)) {
2009 if (v
->type
!= TAG_ALU_4
) continue;
2010 if (v
->ssa_args
.dest
!= src
) continue;
2012 /* Can we even take a float outmod? */
2013 if (midgard_is_integer_out_op(v
->alu
.op
)) continue;
2015 midgard_outmod_float temp
= v
->alu
.outmod
;
2016 progress
|= mir_compose_float_outmod(&temp
, ins
->alu
.outmod
);
2018 /* Throw in the towel.. */
2019 if (!progress
) break;
2021 /* Otherwise, transfer the modifier */
2022 v
->alu
.outmod
= temp
;
2023 ins
->alu
.outmod
= midgard_outmod_none
;
2033 emit_fragment_epilogue(compiler_context
*ctx
)
2035 emit_explicit_constant(ctx
, ctx
->fragment_output
, SSA_FIXED_REGISTER(0));
2037 /* Perform the actual fragment writeout. We have two writeout/branch
2038 * instructions, forming a loop until writeout is successful as per the
2039 * docs. TODO: gl_FragDepth */
2041 EMIT(alu_br_compact_cond
, midgard_jmp_writeout_op_writeout
, TAG_ALU_4
, 0, midgard_condition_always
);
2042 EMIT(alu_br_compact_cond
, midgard_jmp_writeout_op_writeout
, TAG_ALU_4
, -1, midgard_condition_always
);
2045 static midgard_block
*
2046 emit_block(compiler_context
*ctx
, nir_block
*block
)
2048 midgard_block
*this_block
= calloc(sizeof(midgard_block
), 1);
2049 list_addtail(&this_block
->link
, &ctx
->blocks
);
2051 this_block
->is_scheduled
= false;
2054 ctx
->texture_index
[0] = -1;
2055 ctx
->texture_index
[1] = -1;
2057 /* Add us as a successor to the block we are following */
2058 if (ctx
->current_block
)
2059 midgard_block_add_successor(ctx
->current_block
, this_block
);
2061 /* Set up current block */
2062 list_inithead(&this_block
->instructions
);
2063 ctx
->current_block
= this_block
;
2065 nir_foreach_instr(instr
, block
) {
2066 emit_instr(ctx
, instr
);
2067 ++ctx
->instruction_count
;
2070 inline_alu_constants(ctx
);
2071 embedded_to_inline_constant(ctx
);
2073 /* Append fragment shader epilogue (value writeout) */
2074 if (ctx
->stage
== MESA_SHADER_FRAGMENT
) {
2075 if (block
== nir_impl_last_block(ctx
->func
->impl
)) {
2076 emit_fragment_epilogue(ctx
);
2080 if (block
== nir_start_block(ctx
->func
->impl
))
2081 ctx
->initial_block
= this_block
;
2083 if (block
== nir_impl_last_block(ctx
->func
->impl
))
2084 ctx
->final_block
= this_block
;
2086 /* Allow the next control flow to access us retroactively, for
2088 ctx
->current_block
= this_block
;
2090 /* Document the fallthrough chain */
2091 ctx
->previous_source_block
= this_block
;
2096 static midgard_block
*emit_cf_list(struct compiler_context
*ctx
, struct exec_list
*list
);
2099 emit_if(struct compiler_context
*ctx
, nir_if
*nif
)
2101 /* Conditional branches expect the condition in r31.w; emit a move for
2102 * that in the _previous_ block (which is the current block). */
2103 emit_condition(ctx
, &nif
->condition
, true, COMPONENT_X
);
2105 /* Speculatively emit the branch, but we can't fill it in until later */
2106 EMIT(branch
, true, true);
2107 midgard_instruction
*then_branch
= mir_last_in_block(ctx
->current_block
);
2109 /* Emit the two subblocks */
2110 midgard_block
*then_block
= emit_cf_list(ctx
, &nif
->then_list
);
2112 /* Emit a jump from the end of the then block to the end of the else */
2113 EMIT(branch
, false, false);
2114 midgard_instruction
*then_exit
= mir_last_in_block(ctx
->current_block
);
2116 /* Emit second block, and check if it's empty */
2118 int else_idx
= ctx
->block_count
;
2119 int count_in
= ctx
->instruction_count
;
2120 midgard_block
*else_block
= emit_cf_list(ctx
, &nif
->else_list
);
2121 int after_else_idx
= ctx
->block_count
;
2123 /* Now that we have the subblocks emitted, fix up the branches */
2128 if (ctx
->instruction_count
== count_in
) {
2129 /* The else block is empty, so don't emit an exit jump */
2130 mir_remove_instruction(then_exit
);
2131 then_branch
->branch
.target_block
= after_else_idx
;
2133 then_branch
->branch
.target_block
= else_idx
;
2134 then_exit
->branch
.target_block
= after_else_idx
;
2139 emit_loop(struct compiler_context
*ctx
, nir_loop
*nloop
)
2141 /* Remember where we are */
2142 midgard_block
*start_block
= ctx
->current_block
;
2144 /* Allocate a loop number, growing the current inner loop depth */
2145 int loop_idx
= ++ctx
->current_loop_depth
;
2147 /* Get index from before the body so we can loop back later */
2148 int start_idx
= ctx
->block_count
;
2150 /* Emit the body itself */
2151 emit_cf_list(ctx
, &nloop
->body
);
2153 /* Branch back to loop back */
2154 struct midgard_instruction br_back
= v_branch(false, false);
2155 br_back
.branch
.target_block
= start_idx
;
2156 emit_mir_instruction(ctx
, br_back
);
2158 /* Mark down that branch in the graph. Note that we're really branching
2159 * to the block *after* we started in. TODO: Why doesn't the branch
2160 * itself have an off-by-one then...? */
2161 midgard_block_add_successor(ctx
->current_block
, start_block
->successors
[0]);
2163 /* Find the index of the block about to follow us (note: we don't add
2164 * one; blocks are 0-indexed so we get a fencepost problem) */
2165 int break_block_idx
= ctx
->block_count
;
2167 /* Fix up the break statements we emitted to point to the right place,
2168 * now that we can allocate a block number for them */
2170 list_for_each_entry_from(struct midgard_block
, block
, start_block
, &ctx
->blocks
, link
) {
2171 mir_foreach_instr_in_block(block
, ins
) {
2172 if (ins
->type
!= TAG_ALU_4
) continue;
2173 if (!ins
->compact_branch
) continue;
2174 if (ins
->prepacked_branch
) continue;
2176 /* We found a branch -- check the type to see if we need to do anything */
2177 if (ins
->branch
.target_type
!= TARGET_BREAK
) continue;
2179 /* It's a break! Check if it's our break */
2180 if (ins
->branch
.target_break
!= loop_idx
) continue;
2182 /* Okay, cool, we're breaking out of this loop.
2183 * Rewrite from a break to a goto */
2185 ins
->branch
.target_type
= TARGET_GOTO
;
2186 ins
->branch
.target_block
= break_block_idx
;
2190 /* Now that we've finished emitting the loop, free up the depth again
2191 * so we play nice with recursion amid nested loops */
2192 --ctx
->current_loop_depth
;
2194 /* Dump loop stats */
2198 static midgard_block
*
2199 emit_cf_list(struct compiler_context
*ctx
, struct exec_list
*list
)
2201 midgard_block
*start_block
= NULL
;
2203 foreach_list_typed(nir_cf_node
, node
, node
, list
) {
2204 switch (node
->type
) {
2205 case nir_cf_node_block
: {
2206 midgard_block
*block
= emit_block(ctx
, nir_cf_node_as_block(node
));
2209 start_block
= block
;
2214 case nir_cf_node_if
:
2215 emit_if(ctx
, nir_cf_node_as_if(node
));
2218 case nir_cf_node_loop
:
2219 emit_loop(ctx
, nir_cf_node_as_loop(node
));
2222 case nir_cf_node_function
:
2231 /* Due to lookahead, we need to report the first tag executed in the command
2232 * stream and in branch targets. An initial block might be empty, so iterate
2233 * until we find one that 'works' */
2236 midgard_get_first_tag_from_block(compiler_context
*ctx
, unsigned block_idx
)
2238 midgard_block
*initial_block
= mir_get_block(ctx
, block_idx
);
2240 unsigned first_tag
= 0;
2243 midgard_bundle
*initial_bundle
= util_dynarray_element(&initial_block
->bundles
, midgard_bundle
, 0);
2245 if (initial_bundle
) {
2246 first_tag
= initial_bundle
->tag
;
2250 /* Initial block is empty, try the next block */
2251 initial_block
= list_first_entry(&(initial_block
->link
), midgard_block
, link
);
2252 } while(initial_block
!= NULL
);
2259 midgard_compile_shader_nir(struct midgard_screen
*screen
, nir_shader
*nir
, midgard_program
*program
, bool is_blend
)
2261 struct util_dynarray
*compiled
= &program
->compiled
;
2263 midgard_debug
= debug_get_option_midgard_debug();
2265 compiler_context ictx
= {
2268 .stage
= nir
->info
.stage
,
2271 .is_blend
= is_blend
,
2272 .blend_constant_offset
= 0,
2274 .alpha_ref
= program
->alpha_ref
2277 compiler_context
*ctx
= &ictx
;
2279 /* Start off with a safe cutoff, allowing usage of all 16 work
2280 * registers. Later, we'll promote uniform reads to uniform registers
2281 * if we determine it is beneficial to do so */
2282 ctx
->uniform_cutoff
= 8;
2284 /* Initialize at a global (not block) level hash tables */
2286 ctx
->ssa_constants
= _mesa_hash_table_u64_create(NULL
);
2287 ctx
->hash_to_temp
= _mesa_hash_table_u64_create(NULL
);
2288 ctx
->sysval_to_id
= _mesa_hash_table_u64_create(NULL
);
2290 /* Record the varying mapping for the command stream's bookkeeping */
2292 struct exec_list
*varyings
=
2293 ctx
->stage
== MESA_SHADER_VERTEX
? &nir
->outputs
: &nir
->inputs
;
2295 unsigned max_varying
= 0;
2296 nir_foreach_variable(var
, varyings
) {
2297 unsigned loc
= var
->data
.driver_location
;
2298 unsigned sz
= glsl_type_size(var
->type
, FALSE
);
2300 for (int c
= 0; c
< sz
; ++c
) {
2301 program
->varyings
[loc
+ c
] = var
->data
.location
+ c
;
2302 max_varying
= MAX2(max_varying
, loc
+ c
);
2306 /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
2307 * (so we don't accidentally duplicate the epilogue since mesa/st has
2308 * messed with our I/O quite a bit already) */
2310 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
2312 if (ctx
->stage
== MESA_SHADER_VERTEX
) {
2313 NIR_PASS_V(nir
, nir_lower_viewport_transform
);
2314 NIR_PASS_V(nir
, nir_clamp_psiz
, 1.0, 1024.0);
2317 NIR_PASS_V(nir
, nir_lower_var_copies
);
2318 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
2319 NIR_PASS_V(nir
, nir_split_var_copies
);
2320 NIR_PASS_V(nir
, nir_lower_var_copies
);
2321 NIR_PASS_V(nir
, nir_lower_global_vars_to_local
);
2322 NIR_PASS_V(nir
, nir_lower_var_copies
);
2323 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
2325 NIR_PASS_V(nir
, nir_lower_io
, nir_var_all
, glsl_type_size
, 0);
2327 /* Optimisation passes */
2331 if (midgard_debug
& MIDGARD_DBG_SHADERS
) {
2332 nir_print_shader(nir
, stdout
);
2335 /* Assign sysvals and counts, now that we're sure
2336 * (post-optimisation) */
2338 midgard_nir_assign_sysvals(ctx
, nir
);
2340 program
->uniform_count
= nir
->num_uniforms
;
2341 program
->sysval_count
= ctx
->sysval_count
;
2342 memcpy(program
->sysvals
, ctx
->sysvals
, sizeof(ctx
->sysvals
[0]) * ctx
->sysval_count
);
2344 nir_foreach_function(func
, nir
) {
2348 list_inithead(&ctx
->blocks
);
2349 ctx
->block_count
= 0;
2352 emit_cf_list(ctx
, &func
->impl
->body
);
2353 emit_block(ctx
, func
->impl
->end_block
);
2355 break; /* TODO: Multi-function shaders */
2358 util_dynarray_init(compiled
, NULL
);
2360 /* MIR-level optimizations */
2362 bool progress
= false;
2367 mir_foreach_block(ctx
, block
) {
2368 progress
|= midgard_opt_pos_propagate(ctx
, block
);
2369 progress
|= midgard_opt_copy_prop(ctx
, block
);
2370 progress
|= midgard_opt_dead_code_eliminate(ctx
, block
);
2371 progress
|= midgard_opt_combine_projection(ctx
, block
);
2372 progress
|= midgard_opt_varying_projection(ctx
, block
);
2376 mir_foreach_block(ctx
, block
) {
2377 midgard_lower_invert(ctx
, block
);
2380 /* Nested control-flow can result in dead branches at the end of the
2381 * block. This messes with our analysis and is just dead code, so cull
2383 mir_foreach_block(ctx
, block
) {
2384 midgard_opt_cull_dead_branch(ctx
, block
);
2387 /* Ensure we were lowered */
2388 mir_foreach_instr_global(ctx
, ins
) {
2389 assert(!ins
->invert
);
2393 schedule_program(ctx
);
2395 /* Now that all the bundles are scheduled and we can calculate block
2396 * sizes, emit actual branch instructions rather than placeholders */
2398 int br_block_idx
= 0;
2400 mir_foreach_block(ctx
, block
) {
2401 util_dynarray_foreach(&block
->bundles
, midgard_bundle
, bundle
) {
2402 for (int c
= 0; c
< bundle
->instruction_count
; ++c
) {
2403 midgard_instruction
*ins
= bundle
->instructions
[c
];
2405 if (!midgard_is_branch_unit(ins
->unit
)) continue;
2407 if (ins
->prepacked_branch
) continue;
2409 /* Parse some basic branch info */
2410 bool is_compact
= ins
->unit
== ALU_ENAB_BR_COMPACT
;
2411 bool is_conditional
= ins
->branch
.conditional
;
2412 bool is_inverted
= ins
->branch
.invert_conditional
;
2413 bool is_discard
= ins
->branch
.target_type
== TARGET_DISCARD
;
2415 /* Determine the block we're jumping to */
2416 int target_number
= ins
->branch
.target_block
;
2418 /* Report the destination tag */
2419 int dest_tag
= is_discard
? 0 : midgard_get_first_tag_from_block(ctx
, target_number
);
2421 /* Count up the number of quadwords we're
2422 * jumping over = number of quadwords until
2423 * (br_block_idx, target_number) */
2425 int quadword_offset
= 0;
2428 /* Jump to the end of the shader. We
2429 * need to include not only the
2430 * following blocks, but also the
2431 * contents of our current block (since
2432 * discard can come in the middle of
2435 midgard_block
*blk
= mir_get_block(ctx
, br_block_idx
+ 1);
2437 for (midgard_bundle
*bun
= bundle
+ 1; bun
< (midgard_bundle
*)((char*) block
->bundles
.data
+ block
->bundles
.size
); ++bun
) {
2438 quadword_offset
+= quadword_size(bun
->tag
);
2441 mir_foreach_block_from(ctx
, blk
, b
) {
2442 quadword_offset
+= b
->quadword_count
;
2445 } else if (target_number
> br_block_idx
) {
2448 for (int idx
= br_block_idx
+ 1; idx
< target_number
; ++idx
) {
2449 midgard_block
*blk
= mir_get_block(ctx
, idx
);
2452 quadword_offset
+= blk
->quadword_count
;
2455 /* Jump backwards */
2457 for (int idx
= br_block_idx
; idx
>= target_number
; --idx
) {
2458 midgard_block
*blk
= mir_get_block(ctx
, idx
);
2461 quadword_offset
-= blk
->quadword_count
;
2465 /* Unconditional extended branches (far jumps)
2466 * have issues, so we always use a conditional
2467 * branch, setting the condition to always for
2468 * unconditional. For compact unconditional
2469 * branches, cond isn't used so it doesn't
2470 * matter what we pick. */
2472 midgard_condition cond
=
2473 !is_conditional
? midgard_condition_always
:
2474 is_inverted
? midgard_condition_false
:
2475 midgard_condition_true
;
2477 midgard_jmp_writeout_op op
=
2478 is_discard
? midgard_jmp_writeout_op_discard
:
2479 (is_compact
&& !is_conditional
) ? midgard_jmp_writeout_op_branch_uncond
:
2480 midgard_jmp_writeout_op_branch_cond
;
2483 midgard_branch_extended branch
=
2484 midgard_create_branch_extended(
2489 memcpy(&ins
->branch_extended
, &branch
, sizeof(branch
));
2490 } else if (is_conditional
|| is_discard
) {
2491 midgard_branch_cond branch
= {
2493 .dest_tag
= dest_tag
,
2494 .offset
= quadword_offset
,
2498 assert(branch
.offset
== quadword_offset
);
2500 memcpy(&ins
->br_compact
, &branch
, sizeof(branch
));
2502 assert(op
== midgard_jmp_writeout_op_branch_uncond
);
2504 midgard_branch_uncond branch
= {
2506 .dest_tag
= dest_tag
,
2507 .offset
= quadword_offset
,
2511 assert(branch
.offset
== quadword_offset
);
2513 memcpy(&ins
->br_compact
, &branch
, sizeof(branch
));
2521 /* Emit flat binary from the instruction arrays. Iterate each block in
2522 * sequence. Save instruction boundaries such that lookahead tags can
2523 * be assigned easily */
2525 /* Cache _all_ bundles in source order for lookahead across failed branches */
2527 int bundle_count
= 0;
2528 mir_foreach_block(ctx
, block
) {
2529 bundle_count
+= block
->bundles
.size
/ sizeof(midgard_bundle
);
2531 midgard_bundle
**source_order_bundles
= malloc(sizeof(midgard_bundle
*) * bundle_count
);
2533 mir_foreach_block(ctx
, block
) {
2534 util_dynarray_foreach(&block
->bundles
, midgard_bundle
, bundle
) {
2535 source_order_bundles
[bundle_idx
++] = bundle
;
2539 int current_bundle
= 0;
2541 /* Midgard prefetches instruction types, so during emission we
2542 * need to lookahead. Unless this is the last instruction, in
2543 * which we return 1. Or if this is the second to last and the
2544 * last is an ALU, then it's also 1... */
2546 mir_foreach_block(ctx
, block
) {
2547 mir_foreach_bundle_in_block(block
, bundle
) {
2550 if (current_bundle
+ 1 < bundle_count
) {
2551 uint8_t next
= source_order_bundles
[current_bundle
+ 1]->tag
;
2553 if (!(current_bundle
+ 2 < bundle_count
) && IS_ALU(next
)) {
2560 emit_binary_bundle(ctx
, bundle
, compiled
, lookahead
);
2564 /* TODO: Free deeper */
2565 //util_dynarray_fini(&block->instructions);
2568 free(source_order_bundles
);
2570 /* Report the very first tag executed */
2571 program
->first_tag
= midgard_get_first_tag_from_block(ctx
, 0);
2573 /* Deal with off-by-one related to the fencepost problem */
2574 program
->work_register_count
= ctx
->work_registers
+ 1;
2575 program
->uniform_cutoff
= ctx
->uniform_cutoff
;
2577 program
->blend_patch_offset
= ctx
->blend_constant_offset
;
2578 program
->tls_size
= ctx
->tls_size
;
2580 if (midgard_debug
& MIDGARD_DBG_SHADERS
)
2581 disassemble_midgard(program
->compiled
.data
, program
->compiled
.size
);
2583 if (midgard_debug
& MIDGARD_DBG_SHADERDB
) {
2584 unsigned nr_bundles
= 0, nr_ins
= 0, nr_quadwords
= 0;
2586 /* Count instructions and bundles */
2588 mir_foreach_instr_global(ctx
, ins
) {
2592 mir_foreach_block(ctx
, block
) {
2593 nr_bundles
+= util_dynarray_num_elements(
2594 &block
->bundles
, midgard_bundle
);
2596 nr_quadwords
+= block
->quadword_count
;
2599 /* Calculate thread count. There are certain cutoffs by
2600 * register count for thread count */
2602 unsigned nr_registers
= program
->work_register_count
;
2604 unsigned nr_threads
=
2605 (nr_registers
<= 4) ? 4 :
2606 (nr_registers
<= 8) ? 2 :
2611 fprintf(stderr
, "shader%d - %s shader: "
2612 "%u inst, %u bundles, %u quadwords, "
2613 "%u registers, %u threads, %u loops, "
2614 "%d:%d spills:fills\n",
2616 gl_shader_stage_name(ctx
->stage
),
2617 nr_ins
, nr_bundles
, nr_quadwords
,
2618 nr_registers
, nr_threads
,
2620 ctx
->spills
, ctx
->fills
);