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
);
78 static midgard_block
*
79 create_empty_block(compiler_context
*ctx
)
81 midgard_block
*blk
= rzalloc(ctx
, midgard_block
);
83 blk
->predecessors
= _mesa_set_create(blk
,
85 _mesa_key_pointer_equal
);
87 blk
->source_id
= ctx
->block_source_count
++;
93 midgard_block_add_successor(midgard_block
*block
, midgard_block
*successor
)
99 for (unsigned i
= 0; i
< block
->nr_successors
; ++i
) {
100 if (block
->successors
[i
] == successor
)
104 block
->successors
[block
->nr_successors
++] = successor
;
105 assert(block
->nr_successors
<= ARRAY_SIZE(block
->successors
));
107 /* Note the predecessor in the other direction */
108 _mesa_set_add(successor
->predecessors
, block
);
112 schedule_barrier(compiler_context
*ctx
)
114 midgard_block
*temp
= ctx
->after_block
;
115 ctx
->after_block
= create_empty_block(ctx
);
117 list_addtail(&ctx
->after_block
->link
, &ctx
->blocks
);
118 list_inithead(&ctx
->after_block
->instructions
);
119 midgard_block_add_successor(ctx
->current_block
, ctx
->after_block
);
120 ctx
->current_block
= ctx
->after_block
;
121 ctx
->after_block
= temp
;
124 /* Helpers to generate midgard_instruction's using macro magic, since every
125 * driver seems to do it that way */
127 #define EMIT(op, ...) emit_mir_instruction(ctx, v_##op(__VA_ARGS__));
129 #define M_LOAD_STORE(name, store) \
130 static midgard_instruction m_##name(unsigned ssa, unsigned address) { \
131 midgard_instruction i = { \
132 .type = TAG_LOAD_STORE_4, \
135 .src = { ~0, ~0, ~0 }, \
136 .swizzle = SWIZZLE_IDENTITY_4, \
138 .op = midgard_op_##name, \
151 #define M_LOAD(name) M_LOAD_STORE(name, false)
152 #define M_STORE(name) M_LOAD_STORE(name, true)
154 /* Inputs a NIR ALU source, with modifiers attached if necessary, and outputs
155 * the corresponding Midgard source */
157 static midgard_vector_alu_src
158 vector_alu_modifiers(nir_alu_src
*src
, bool is_int
, unsigned broadcast_count
,
159 bool half
, bool sext
)
161 if (!src
) return blank_alu_src
;
163 /* Figure out how many components there are so we can adjust.
164 * Specifically we want to broadcast the last channel so things like
168 if (broadcast_count
) {
169 uint8_t last_component
= src
->swizzle
[broadcast_count
- 1];
171 for (unsigned c
= broadcast_count
; c
< NIR_MAX_VEC_COMPONENTS
; ++c
) {
172 src
->swizzle
[c
] = last_component
;
176 midgard_vector_alu_src alu_src
= {
183 alu_src
.mod
= midgard_int_normal
;
185 /* Sign/zero-extend if needed */
189 midgard_int_sign_extend
190 : midgard_int_zero_extend
;
193 /* These should have been lowered away */
194 assert(!(src
->abs
|| src
->negate
));
196 alu_src
.mod
= (src
->abs
<< 0) | (src
->negate
<< 1);
202 /* load/store instructions have both 32-bit and 16-bit variants, depending on
203 * whether we are using vectors composed of highp or mediump. At the moment, we
204 * don't support half-floats -- this requires changes in other parts of the
205 * compiler -- therefore the 16-bit versions are commented out. */
207 //M_LOAD(ld_attr_16);
209 //M_LOAD(ld_vary_16);
214 M_LOAD(ld_color_buffer_8
);
215 //M_STORE(st_vary_16);
217 M_LOAD(ld_cubemap_coords
);
218 M_LOAD(ld_compute_id
);
220 static midgard_instruction
221 v_alu_br_compact_cond(midgard_jmp_writeout_op op
, unsigned tag
, signed offset
, unsigned cond
)
223 midgard_branch_cond branch
= {
231 memcpy(&compact
, &branch
, sizeof(branch
));
233 midgard_instruction ins
= {
235 .unit
= ALU_ENAB_BR_COMPACT
,
236 .prepacked_branch
= true,
237 .compact_branch
= true,
238 .br_compact
= compact
,
240 .src
= { ~0, ~0, ~0 },
243 if (op
== midgard_jmp_writeout_op_writeout
)
249 static midgard_instruction
250 v_branch(bool conditional
, bool invert
)
252 midgard_instruction ins
= {
254 .unit
= ALU_ENAB_BRANCH
,
255 .compact_branch
= true,
257 .conditional
= conditional
,
258 .invert_conditional
= invert
261 .src
= { ~0, ~0, ~0 },
267 static midgard_branch_extended
268 midgard_create_branch_extended( midgard_condition cond
,
269 midgard_jmp_writeout_op op
,
271 signed quadword_offset
)
273 /* The condition code is actually a LUT describing a function to
274 * combine multiple condition codes. However, we only support a single
275 * condition code at the moment, so we just duplicate over a bunch of
278 uint16_t duplicated_cond
=
288 midgard_branch_extended branch
= {
290 .dest_tag
= dest_tag
,
291 .offset
= quadword_offset
,
292 .cond
= duplicated_cond
299 attach_constants(compiler_context
*ctx
, midgard_instruction
*ins
, void *constants
, int name
)
301 ins
->has_constants
= true;
302 memcpy(&ins
->constants
, constants
, 16);
306 glsl_type_size(const struct glsl_type
*type
, bool bindless
)
308 return glsl_count_attribute_slots(type
, false);
311 /* Lower fdot2 to a vector multiplication followed by channel addition */
313 midgard_nir_lower_fdot2_body(nir_builder
*b
, nir_alu_instr
*alu
)
315 if (alu
->op
!= nir_op_fdot2
)
318 b
->cursor
= nir_before_instr(&alu
->instr
);
320 nir_ssa_def
*src0
= nir_ssa_for_alu_src(b
, alu
, 0);
321 nir_ssa_def
*src1
= nir_ssa_for_alu_src(b
, alu
, 1);
323 nir_ssa_def
*product
= nir_fmul(b
, src0
, src1
);
325 nir_ssa_def
*sum
= nir_fadd(b
,
326 nir_channel(b
, product
, 0),
327 nir_channel(b
, product
, 1));
329 /* Replace the fdot2 with this sum */
330 nir_ssa_def_rewrite_uses(&alu
->dest
.dest
.ssa
, nir_src_for_ssa(sum
));
334 midgard_sysval_for_ssbo(nir_intrinsic_instr
*instr
)
336 /* This is way too meta */
337 bool is_store
= instr
->intrinsic
== nir_intrinsic_store_ssbo
;
338 unsigned idx_idx
= is_store
? 1 : 0;
340 nir_src index
= instr
->src
[idx_idx
];
341 assert(nir_src_is_const(index
));
342 uint32_t uindex
= nir_src_as_uint(index
);
344 return PAN_SYSVAL(SSBO
, uindex
);
348 midgard_nir_sysval_for_intrinsic(nir_intrinsic_instr
*instr
)
350 switch (instr
->intrinsic
) {
351 case nir_intrinsic_load_viewport_scale
:
352 return PAN_SYSVAL_VIEWPORT_SCALE
;
353 case nir_intrinsic_load_viewport_offset
:
354 return PAN_SYSVAL_VIEWPORT_OFFSET
;
355 case nir_intrinsic_load_num_work_groups
:
356 return PAN_SYSVAL_NUM_WORK_GROUPS
;
357 case nir_intrinsic_load_ssbo
:
358 case nir_intrinsic_store_ssbo
:
359 return midgard_sysval_for_ssbo(instr
);
365 static int sysval_for_instr(compiler_context
*ctx
, nir_instr
*instr
,
368 nir_intrinsic_instr
*intr
;
369 nir_dest
*dst
= NULL
;
373 bool is_store
= false;
375 switch (instr
->type
) {
376 case nir_instr_type_intrinsic
:
377 intr
= nir_instr_as_intrinsic(instr
);
378 sysval
= midgard_nir_sysval_for_intrinsic(intr
);
380 is_store
|= intr
->intrinsic
== nir_intrinsic_store_ssbo
;
382 case nir_instr_type_tex
:
383 tex
= nir_instr_as_tex(instr
);
384 if (tex
->op
!= nir_texop_txs
)
387 sysval
= PAN_SYSVAL(TEXTURE_SIZE
,
388 PAN_TXS_SYSVAL_ID(tex
->texture_index
,
389 nir_tex_instr_dest_size(tex
) -
390 (tex
->is_array
? 1 : 0),
398 if (dest
&& dst
&& !is_store
)
399 *dest
= nir_dest_index(ctx
, dst
);
405 midgard_nir_assign_sysval_body(compiler_context
*ctx
, nir_instr
*instr
)
409 sysval
= sysval_for_instr(ctx
, instr
, NULL
);
413 /* We have a sysval load; check if it's already been assigned */
415 if (_mesa_hash_table_u64_search(ctx
->sysval_to_id
, sysval
))
418 /* It hasn't -- so assign it now! */
420 unsigned id
= ctx
->sysval_count
++;
421 _mesa_hash_table_u64_insert(ctx
->sysval_to_id
, sysval
, (void *) ((uintptr_t) id
+ 1));
422 ctx
->sysvals
[id
] = sysval
;
426 midgard_nir_assign_sysvals(compiler_context
*ctx
, nir_shader
*shader
)
428 ctx
->sysval_count
= 0;
430 nir_foreach_function(function
, shader
) {
431 if (!function
->impl
) continue;
433 nir_foreach_block(block
, function
->impl
) {
434 nir_foreach_instr_safe(instr
, block
) {
435 midgard_nir_assign_sysval_body(ctx
, instr
);
442 midgard_nir_lower_fdot2(nir_shader
*shader
)
444 bool progress
= false;
446 nir_foreach_function(function
, shader
) {
447 if (!function
->impl
) continue;
450 nir_builder
*b
= &_b
;
451 nir_builder_init(b
, function
->impl
);
453 nir_foreach_block(block
, function
->impl
) {
454 nir_foreach_instr_safe(instr
, block
) {
455 if (instr
->type
!= nir_instr_type_alu
) continue;
457 nir_alu_instr
*alu
= nir_instr_as_alu(instr
);
458 midgard_nir_lower_fdot2_body(b
, alu
);
464 nir_metadata_preserve(function
->impl
, nir_metadata_block_index
| nir_metadata_dominance
);
471 /* Flushes undefined values to zero */
474 optimise_nir(nir_shader
*nir
)
477 unsigned lower_flrp
=
478 (nir
->options
->lower_flrp16
? 16 : 0) |
479 (nir
->options
->lower_flrp32
? 32 : 0) |
480 (nir
->options
->lower_flrp64
? 64 : 0);
482 NIR_PASS(progress
, nir
, nir_lower_regs_to_ssa
);
483 NIR_PASS(progress
, nir
, midgard_nir_lower_fdot2
);
484 NIR_PASS(progress
, nir
, nir_lower_idiv
, nir_lower_idiv_fast
);
486 nir_lower_tex_options lower_tex_options
= {
487 .lower_txs_lod
= true,
491 NIR_PASS(progress
, nir
, nir_lower_tex
, &lower_tex_options
);
496 NIR_PASS(progress
, nir
, nir_lower_var_copies
);
497 NIR_PASS(progress
, nir
, nir_lower_vars_to_ssa
);
499 NIR_PASS(progress
, nir
, nir_copy_prop
);
500 NIR_PASS(progress
, nir
, nir_opt_dce
);
501 NIR_PASS(progress
, nir
, nir_opt_dead_cf
);
502 NIR_PASS(progress
, nir
, nir_opt_cse
);
503 NIR_PASS(progress
, nir
, nir_opt_peephole_select
, 64, false, true);
504 NIR_PASS(progress
, nir
, nir_opt_algebraic
);
505 NIR_PASS(progress
, nir
, nir_opt_constant_folding
);
507 if (lower_flrp
!= 0) {
508 bool lower_flrp_progress
= false;
509 NIR_PASS(lower_flrp_progress
,
513 false /* always_precise */,
514 nir
->options
->lower_ffma
);
515 if (lower_flrp_progress
) {
516 NIR_PASS(progress
, nir
,
517 nir_opt_constant_folding
);
521 /* Nothing should rematerialize any flrps, so we only
522 * need to do this lowering once.
527 NIR_PASS(progress
, nir
, nir_opt_undef
);
528 NIR_PASS(progress
, nir
, nir_undef_to_zero
);
530 NIR_PASS(progress
, nir
, nir_opt_loop_unroll
,
533 nir_var_function_temp
);
535 NIR_PASS(progress
, nir
, nir_opt_vectorize
);
538 /* Must be run at the end to prevent creation of fsin/fcos ops */
539 NIR_PASS(progress
, nir
, midgard_nir_scale_trig
);
544 NIR_PASS(progress
, nir
, nir_opt_dce
);
545 NIR_PASS(progress
, nir
, nir_opt_algebraic
);
546 NIR_PASS(progress
, nir
, nir_opt_constant_folding
);
547 NIR_PASS(progress
, nir
, nir_copy_prop
);
550 NIR_PASS(progress
, nir
, nir_opt_algebraic_late
);
552 /* We implement booleans as 32-bit 0/~0 */
553 NIR_PASS(progress
, nir
, nir_lower_bool_to_int32
);
555 /* Now that booleans are lowered, we can run out late opts */
556 NIR_PASS(progress
, nir
, midgard_nir_lower_algebraic_late
);
558 /* Lower mods for float ops only. Integer ops don't support modifiers
559 * (saturate doesn't make sense on integers, neg/abs require dedicated
562 NIR_PASS(progress
, nir
, nir_lower_to_source_mods
, nir_lower_float_source_mods
);
563 NIR_PASS(progress
, nir
, nir_copy_prop
);
564 NIR_PASS(progress
, nir
, nir_opt_dce
);
566 /* Take us out of SSA */
567 NIR_PASS(progress
, nir
, nir_lower_locals_to_regs
);
568 NIR_PASS(progress
, nir
, nir_convert_from_ssa
, true);
570 /* We are a vector architecture; write combine where possible */
571 NIR_PASS(progress
, nir
, nir_move_vec_src_uses_to_dest
);
572 NIR_PASS(progress
, nir
, nir_lower_vec_to_movs
);
574 NIR_PASS(progress
, nir
, nir_opt_dce
);
577 /* Do not actually emit a load; instead, cache the constant for inlining */
580 emit_load_const(compiler_context
*ctx
, nir_load_const_instr
*instr
)
582 nir_ssa_def def
= instr
->def
;
584 float *v
= rzalloc_array(NULL
, float, 4);
585 nir_const_value_to_array(v
, instr
->value
, instr
->def
.num_components
, f32
);
587 /* Shifted for SSA, +1 for off-by-one */
588 _mesa_hash_table_u64_insert(ctx
->ssa_constants
, (def
.index
<< 1) + 1, v
);
591 /* Normally constants are embedded implicitly, but for I/O and such we have to
592 * explicitly emit a move with the constant source */
595 emit_explicit_constant(compiler_context
*ctx
, unsigned node
, unsigned to
)
597 void *constant_value
= _mesa_hash_table_u64_search(ctx
->ssa_constants
, node
+ 1);
599 if (constant_value
) {
600 midgard_instruction ins
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
), blank_alu_src
, to
);
601 attach_constants(ctx
, &ins
, constant_value
, node
+ 1);
602 emit_mir_instruction(ctx
, ins
);
607 nir_is_non_scalar_swizzle(nir_alu_src
*src
, unsigned nr_components
)
609 unsigned comp
= src
->swizzle
[0];
611 for (unsigned c
= 1; c
< nr_components
; ++c
) {
612 if (src
->swizzle
[c
] != comp
)
619 #define ALU_CASE(nir, _op) \
621 op = midgard_alu_op_##_op; \
622 assert(src_bitsize == dst_bitsize); \
625 #define ALU_CASE_BCAST(nir, _op, count) \
627 op = midgard_alu_op_##_op; \
628 broadcast_swizzle = count; \
629 assert(src_bitsize == dst_bitsize); \
632 nir_is_fzero_constant(nir_src src
)
634 if (!nir_src_is_const(src
))
637 for (unsigned c
= 0; c
< nir_src_num_components(src
); ++c
) {
638 if (nir_src_comp_as_float(src
, c
) != 0.0)
645 /* Analyze the sizes of the inputs to determine which reg mode. Ops needed
646 * special treatment override this anyway. */
648 static midgard_reg_mode
649 reg_mode_for_nir(nir_alu_instr
*instr
)
651 unsigned src_bitsize
= nir_src_bit_size(instr
->src
[0].src
);
653 switch (src_bitsize
) {
655 return midgard_reg_mode_8
;
657 return midgard_reg_mode_16
;
659 return midgard_reg_mode_32
;
661 return midgard_reg_mode_64
;
663 unreachable("Invalid bit size");
668 emit_alu(compiler_context
*ctx
, nir_alu_instr
*instr
)
670 /* Derivatives end up emitted on the texture pipe, not the ALUs. This
671 * is handled elsewhere */
673 if (instr
->op
== nir_op_fddx
|| instr
->op
== nir_op_fddy
) {
674 midgard_emit_derivatives(ctx
, instr
);
678 bool is_ssa
= instr
->dest
.dest
.is_ssa
;
680 unsigned dest
= nir_dest_index(ctx
, &instr
->dest
.dest
);
681 unsigned nr_components
= nir_dest_num_components(instr
->dest
.dest
);
682 unsigned nr_inputs
= nir_op_infos
[instr
->op
].num_inputs
;
684 /* Most Midgard ALU ops have a 1:1 correspondance to NIR ops; these are
685 * supported. A few do not and are commented for now. Also, there are a
686 * number of NIR ops which Midgard does not support and need to be
687 * lowered, also TODO. This switch block emits the opcode and calling
688 * convention of the Midgard instruction; actual packing is done in
693 /* Number of components valid to check for the instruction (the rest
694 * will be forced to the last), or 0 to use as-is. Relevant as
695 * ball-type instructions have a channel count in NIR but are all vec4
698 unsigned broadcast_swizzle
= 0;
700 /* What register mode should we operate in? */
701 midgard_reg_mode reg_mode
=
702 reg_mode_for_nir(instr
);
704 /* Do we need a destination override? Used for inline
707 midgard_dest_override dest_override
=
708 midgard_dest_override_none
;
710 /* Should we use a smaller respective source and sign-extend? */
712 bool half_1
= false, sext_1
= false;
713 bool half_2
= false, sext_2
= false;
715 unsigned src_bitsize
= nir_src_bit_size(instr
->src
[0].src
);
716 unsigned dst_bitsize
= nir_dest_bit_size(instr
->dest
.dest
);
719 ALU_CASE(fadd
, fadd
);
720 ALU_CASE(fmul
, fmul
);
721 ALU_CASE(fmin
, fmin
);
722 ALU_CASE(fmax
, fmax
);
723 ALU_CASE(imin
, imin
);
724 ALU_CASE(imax
, imax
);
725 ALU_CASE(umin
, umin
);
726 ALU_CASE(umax
, umax
);
727 ALU_CASE(ffloor
, ffloor
);
728 ALU_CASE(fround_even
, froundeven
);
729 ALU_CASE(ftrunc
, ftrunc
);
730 ALU_CASE(fceil
, fceil
);
731 ALU_CASE(fdot3
, fdot3
);
732 ALU_CASE(fdot4
, fdot4
);
733 ALU_CASE(iadd
, iadd
);
734 ALU_CASE(isub
, isub
);
735 ALU_CASE(imul
, imul
);
737 /* Zero shoved as second-arg */
738 ALU_CASE(iabs
, iabsdiff
);
742 ALU_CASE(feq32
, feq
);
743 ALU_CASE(fne32
, fne
);
744 ALU_CASE(flt32
, flt
);
745 ALU_CASE(ieq32
, ieq
);
746 ALU_CASE(ine32
, ine
);
747 ALU_CASE(ilt32
, ilt
);
748 ALU_CASE(ult32
, ult
);
750 /* We don't have a native b2f32 instruction. Instead, like many
751 * GPUs, we exploit booleans as 0/~0 for false/true, and
752 * correspondingly AND
753 * by 1.0 to do the type conversion. For the moment, prime us
756 * iand [whatever], #0
758 * At the end of emit_alu (as MIR), we'll fix-up the constant
761 ALU_CASE(b2f32
, iand
);
762 ALU_CASE(b2i32
, iand
);
764 /* Likewise, we don't have a dedicated f2b32 instruction, but
765 * we can do a "not equal to 0.0" test. */
767 ALU_CASE(f2b32
, fne
);
768 ALU_CASE(i2b32
, ine
);
770 ALU_CASE(frcp
, frcp
);
771 ALU_CASE(frsq
, frsqrt
);
772 ALU_CASE(fsqrt
, fsqrt
);
773 ALU_CASE(fexp2
, fexp2
);
774 ALU_CASE(flog2
, flog2
);
776 ALU_CASE(f2i32
, f2i_rtz
);
777 ALU_CASE(f2u32
, f2u_rtz
);
778 ALU_CASE(i2f32
, i2f_rtz
);
779 ALU_CASE(u2f32
, u2f_rtz
);
781 ALU_CASE(f2i16
, f2i_rtz
);
782 ALU_CASE(f2u16
, f2u_rtz
);
783 ALU_CASE(i2f16
, i2f_rtz
);
784 ALU_CASE(u2f16
, u2f_rtz
);
786 ALU_CASE(fsin
, fsin
);
787 ALU_CASE(fcos
, fcos
);
789 /* We'll set invert */
790 ALU_CASE(inot
, imov
);
791 ALU_CASE(iand
, iand
);
793 ALU_CASE(ixor
, ixor
);
794 ALU_CASE(ishl
, ishl
);
795 ALU_CASE(ishr
, iasr
);
796 ALU_CASE(ushr
, ilsr
);
798 ALU_CASE_BCAST(b32all_fequal2
, fball_eq
, 2);
799 ALU_CASE_BCAST(b32all_fequal3
, fball_eq
, 3);
800 ALU_CASE(b32all_fequal4
, fball_eq
);
802 ALU_CASE_BCAST(b32any_fnequal2
, fbany_neq
, 2);
803 ALU_CASE_BCAST(b32any_fnequal3
, fbany_neq
, 3);
804 ALU_CASE(b32any_fnequal4
, fbany_neq
);
806 ALU_CASE_BCAST(b32all_iequal2
, iball_eq
, 2);
807 ALU_CASE_BCAST(b32all_iequal3
, iball_eq
, 3);
808 ALU_CASE(b32all_iequal4
, iball_eq
);
810 ALU_CASE_BCAST(b32any_inequal2
, ibany_neq
, 2);
811 ALU_CASE_BCAST(b32any_inequal3
, ibany_neq
, 3);
812 ALU_CASE(b32any_inequal4
, ibany_neq
);
814 /* Source mods will be shoved in later */
815 ALU_CASE(fabs
, fmov
);
816 ALU_CASE(fneg
, fmov
);
817 ALU_CASE(fsat
, fmov
);
819 /* For size conversion, we use a move. Ideally though we would squash
820 * these ops together; maybe that has to happen after in NIR as part of
821 * propagation...? An earlier algebraic pass ensured we step down by
822 * only / exactly one size. If stepping down, we use a dest override to
823 * reduce the size; if stepping up, we use a larger-sized move with a
824 * half source and a sign/zero-extension modifier */
829 /* If we end up upscale, we'll need a sign-extend on the
830 * operand (the second argument) */
837 op
= midgard_alu_op_imov
;
839 if (dst_bitsize
== (src_bitsize
* 2)) {
843 /* Use a greater register mode */
845 } else if (src_bitsize
== (dst_bitsize
* 2)) {
846 /* Converting down */
847 dest_override
= midgard_dest_override_lower
;
854 assert(src_bitsize
== 32);
856 op
= midgard_alu_op_fmov
;
857 dest_override
= midgard_dest_override_lower
;
862 assert(src_bitsize
== 16);
864 op
= midgard_alu_op_fmov
;
871 /* For greater-or-equal, we lower to less-or-equal and flip the
879 instr
->op
== nir_op_fge
? midgard_alu_op_fle
:
880 instr
->op
== nir_op_fge32
? midgard_alu_op_fle
:
881 instr
->op
== nir_op_ige32
? midgard_alu_op_ile
:
882 instr
->op
== nir_op_uge32
? midgard_alu_op_ule
:
885 /* Swap via temporary */
886 nir_alu_src temp
= instr
->src
[1];
887 instr
->src
[1] = instr
->src
[0];
888 instr
->src
[0] = temp
;
893 case nir_op_b32csel
: {
894 /* Midgard features both fcsel and icsel, depending on
895 * the type of the arguments/output. However, as long
896 * as we're careful we can _always_ use icsel and
897 * _never_ need fcsel, since the latter does additional
898 * floating-point-specific processing whereas the
899 * former just moves bits on the wire. It's not obvious
900 * why these are separate opcodes, save for the ability
901 * to do things like sat/pos/abs/neg for free */
903 bool mixed
= nir_is_non_scalar_swizzle(&instr
->src
[0], nr_components
);
904 op
= mixed
? midgard_alu_op_icsel_v
: midgard_alu_op_icsel
;
906 /* The condition is the first argument; move the other
907 * arguments up one to be a binary instruction for
908 * Midgard with the condition last */
910 nir_alu_src temp
= instr
->src
[2];
912 instr
->src
[2] = instr
->src
[0];
913 instr
->src
[0] = instr
->src
[1];
914 instr
->src
[1] = temp
;
920 DBG("Unhandled ALU op %s\n", nir_op_infos
[instr
->op
].name
);
925 /* Midgard can perform certain modifiers on output of an ALU op */
928 if (midgard_is_integer_out_op(op
)) {
929 outmod
= midgard_outmod_int_wrap
;
931 bool sat
= instr
->dest
.saturate
|| instr
->op
== nir_op_fsat
;
932 outmod
= sat
? midgard_outmod_sat
: midgard_outmod_none
;
935 /* fmax(a, 0.0) can turn into a .pos modifier as an optimization */
937 if (instr
->op
== nir_op_fmax
) {
938 if (nir_is_fzero_constant(instr
->src
[0].src
)) {
939 op
= midgard_alu_op_fmov
;
941 outmod
= midgard_outmod_pos
;
942 instr
->src
[0] = instr
->src
[1];
943 } else if (nir_is_fzero_constant(instr
->src
[1].src
)) {
944 op
= midgard_alu_op_fmov
;
946 outmod
= midgard_outmod_pos
;
950 /* Fetch unit, quirks, etc information */
951 unsigned opcode_props
= alu_opcode_props
[op
].props
;
952 bool quirk_flipped_r24
= opcode_props
& QUIRK_FLIPPED_R24
;
954 /* src0 will always exist afaik, but src1 will not for 1-argument
955 * instructions. The latter can only be fetched if the instruction
956 * needs it, or else we may segfault. */
958 unsigned src0
= nir_alu_src_index(ctx
, &instr
->src
[0]);
959 unsigned src1
= nr_inputs
>= 2 ? nir_alu_src_index(ctx
, &instr
->src
[1]) : ~0;
960 unsigned src2
= nr_inputs
== 3 ? nir_alu_src_index(ctx
, &instr
->src
[2]) : ~0;
961 assert(nr_inputs
<= 3);
963 /* Rather than use the instruction generation helpers, we do it
964 * ourselves here to avoid the mess */
966 midgard_instruction ins
= {
969 quirk_flipped_r24
? ~0 : src0
,
970 quirk_flipped_r24
? src0
: src1
,
976 nir_alu_src
*nirmods
[3] = { NULL
};
978 if (nr_inputs
>= 2) {
979 nirmods
[0] = &instr
->src
[0];
980 nirmods
[1] = &instr
->src
[1];
981 } else if (nr_inputs
== 1) {
982 nirmods
[quirk_flipped_r24
] = &instr
->src
[0];
988 nirmods
[2] = &instr
->src
[2];
990 /* These were lowered to a move, so apply the corresponding mod */
992 if (instr
->op
== nir_op_fneg
|| instr
->op
== nir_op_fabs
) {
993 nir_alu_src
*s
= nirmods
[quirk_flipped_r24
];
995 if (instr
->op
== nir_op_fneg
)
996 s
->negate
= !s
->negate
;
998 if (instr
->op
== nir_op_fabs
)
1002 bool is_int
= midgard_is_integer_op(op
);
1004 ins
.mask
= mask_of(nr_components
);
1006 midgard_vector_alu alu
= {
1008 .reg_mode
= reg_mode
,
1009 .dest_override
= dest_override
,
1012 .src1
= vector_alu_srco_unsigned(vector_alu_modifiers(nirmods
[0], is_int
, broadcast_swizzle
, half_1
, sext_1
)),
1013 .src2
= vector_alu_srco_unsigned(vector_alu_modifiers(nirmods
[1], is_int
, broadcast_swizzle
, half_2
, sext_2
)),
1016 /* Apply writemask if non-SSA, keeping in mind that we can't write to components that don't exist */
1019 ins
.mask
&= instr
->dest
.write_mask
;
1021 for (unsigned m
= 0; m
< 3; ++m
) {
1025 for (unsigned c
= 0; c
< NIR_MAX_VEC_COMPONENTS
; ++c
)
1026 ins
.swizzle
[m
][c
] = nirmods
[m
]->swizzle
[c
];
1028 /* Replicate. TODO: remove when vec16 lands */
1029 for (unsigned c
= NIR_MAX_VEC_COMPONENTS
; c
< MIR_VEC_COMPONENTS
; ++c
)
1030 ins
.swizzle
[m
][c
] = nirmods
[m
]->swizzle
[NIR_MAX_VEC_COMPONENTS
- 1];
1033 if (nr_inputs
== 3) {
1034 /* Conditions can't have mods */
1035 assert(!nirmods
[2]->abs
);
1036 assert(!nirmods
[2]->negate
);
1041 /* Late fixup for emulated instructions */
1043 if (instr
->op
== nir_op_b2f32
|| instr
->op
== nir_op_b2i32
) {
1044 /* Presently, our second argument is an inline #0 constant.
1045 * Switch over to an embedded 1.0 constant (that can't fit
1046 * inline, since we're 32-bit, not 16-bit like the inline
1049 ins
.has_inline_constant
= false;
1050 ins
.src
[1] = SSA_FIXED_REGISTER(REGISTER_CONSTANT
);
1051 ins
.has_constants
= true;
1053 if (instr
->op
== nir_op_b2f32
) {
1055 memcpy(&ins
.constants
, &f
, sizeof(float));
1057 ins
.constants
[0] = 1;
1061 for (unsigned c
= 0; c
< 16; ++c
)
1062 ins
.swizzle
[1][c
] = 0;
1063 } else if (nr_inputs
== 1 && !quirk_flipped_r24
) {
1064 /* Lots of instructions need a 0 plonked in */
1065 ins
.has_inline_constant
= false;
1066 ins
.src
[1] = SSA_FIXED_REGISTER(REGISTER_CONSTANT
);
1067 ins
.has_constants
= true;
1068 ins
.constants
[0] = 0;
1070 for (unsigned c
= 0; c
< 16; ++c
)
1071 ins
.swizzle
[1][c
] = 0;
1072 } else if (instr
->op
== nir_op_inot
) {
1076 if ((opcode_props
& UNITS_ALL
) == UNIT_VLUT
) {
1077 /* To avoid duplicating the lookup tables (probably), true LUT
1078 * instructions can only operate as if they were scalars. Lower
1079 * them here by changing the component. */
1081 unsigned orig_mask
= ins
.mask
;
1083 for (int i
= 0; i
< nr_components
; ++i
) {
1084 /* Mask the associated component, dropping the
1085 * instruction if needed */
1088 ins
.mask
&= orig_mask
;
1093 for (unsigned j
= 0; j
< MIR_VEC_COMPONENTS
; ++j
)
1094 ins
.swizzle
[0][j
] = nirmods
[0]->swizzle
[i
]; /* Pull from the correct component */
1096 emit_mir_instruction(ctx
, ins
);
1099 emit_mir_instruction(ctx
, ins
);
1106 mir_mask_for_intr(nir_instr
*instr
, bool is_read
)
1108 nir_intrinsic_instr
*intr
= nir_instr_as_intrinsic(instr
);
1111 return mask_of(nir_intrinsic_dest_components(intr
));
1113 return nir_intrinsic_write_mask(intr
);
1116 /* Uniforms and UBOs use a shared code path, as uniforms are just (slightly
1117 * optimized) versions of UBO #0 */
1119 midgard_instruction
*
1121 compiler_context
*ctx
,
1125 nir_src
*indirect_offset
,
1128 /* TODO: half-floats */
1130 midgard_instruction ins
= m_ld_ubo_int4(dest
, offset
);
1132 assert((offset
& 0xF) == 0);
1135 /* TODO: Don't split */
1136 ins
.load_store
.varying_parameters
= (offset
& 7) << 7;
1137 ins
.load_store
.address
= offset
>> 3;
1138 ins
.mask
= mir_mask_for_intr(instr
, true);
1140 if (indirect_offset
) {
1141 ins
.src
[2] = nir_src_index(ctx
, indirect_offset
);
1142 ins
.load_store
.arg_2
= 0x80;
1144 ins
.load_store
.arg_2
= 0x1E;
1147 ins
.load_store
.arg_1
= index
;
1149 return emit_mir_instruction(ctx
, ins
);
1152 /* SSBO reads are like UBO reads if you squint */
1156 compiler_context
*ctx
,
1161 nir_src
*indirect_offset
,
1166 midgard_instruction ins
;
1169 ins
= m_ld_int4(srcdest
, offset
);
1171 ins
= m_st_int4(srcdest
, offset
);
1173 /* SSBO reads use a generic memory read interface, so we need the
1174 * address of the SSBO as the first argument. This is a sysval. */
1176 unsigned addr
= make_compiler_temp(ctx
);
1177 emit_sysval_read(ctx
, instr
, addr
, 2);
1179 /* The source array:
1181 * src[0] = store ? value : unused
1185 * We would like arg_1 = the address and
1186 * arg_2 = the offset.
1191 /* TODO: What is this? It looks superficially like a shift << 5, but
1192 * arg_1 doesn't take a shift Should it be E0 or A0? We also need the
1193 * indirect offset. */
1195 if (indirect_offset
) {
1196 ins
.load_store
.arg_1
|= 0xE0;
1197 ins
.src
[2] = nir_src_index(ctx
, indirect_offset
);
1199 ins
.load_store
.arg_2
= 0x7E;
1202 /* TODO: Bounds check */
1204 /* Finally, we emit the direct offset */
1206 ins
.load_store
.varying_parameters
= (offset
& 0x1FF) << 1;
1207 ins
.load_store
.address
= (offset
>> 9);
1208 ins
.mask
= mir_mask_for_intr(instr
, is_read
);
1210 emit_mir_instruction(ctx
, ins
);
1215 compiler_context
*ctx
,
1216 unsigned dest
, unsigned offset
,
1217 unsigned nr_comp
, unsigned component
,
1218 nir_src
*indirect_offset
, nir_alu_type type
)
1220 /* XXX: Half-floats? */
1221 /* TODO: swizzle, mask */
1223 midgard_instruction ins
= m_ld_vary_32(dest
, offset
);
1224 ins
.mask
= mask_of(nr_comp
);
1226 for (unsigned i
= 0; i
< ARRAY_SIZE(ins
.swizzle
[0]); ++i
)
1227 ins
.swizzle
[0][i
] = MIN2(i
+ component
, COMPONENT_W
);
1229 midgard_varying_parameter p
= {
1231 .interpolation
= midgard_interp_default
,
1232 .flat
= /*var->data.interpolation == INTERP_MODE_FLAT*/ 0
1236 memcpy(&u
, &p
, sizeof(p
));
1237 ins
.load_store
.varying_parameters
= u
;
1239 if (indirect_offset
)
1240 ins
.src
[2] = nir_src_index(ctx
, indirect_offset
);
1242 ins
.load_store
.arg_2
= 0x1E;
1244 ins
.load_store
.arg_1
= 0x9E;
1246 /* Use the type appropriate load */
1250 ins
.load_store
.op
= midgard_op_ld_vary_32u
;
1253 ins
.load_store
.op
= midgard_op_ld_vary_32i
;
1255 case nir_type_float
:
1256 ins
.load_store
.op
= midgard_op_ld_vary_32
;
1259 unreachable("Attempted to load unknown type");
1263 emit_mir_instruction(ctx
, ins
);
1267 emit_sysval_read(compiler_context
*ctx
, nir_instr
*instr
, signed dest_override
,
1268 unsigned nr_components
)
1272 /* Figure out which uniform this is */
1273 int sysval
= sysval_for_instr(ctx
, instr
, &dest
);
1274 void *val
= _mesa_hash_table_u64_search(ctx
->sysval_to_id
, sysval
);
1276 if (dest_override
>= 0)
1277 dest
= dest_override
;
1279 /* Sysvals are prefix uniforms */
1280 unsigned uniform
= ((uintptr_t) val
) - 1;
1282 /* Emit the read itself -- this is never indirect */
1283 midgard_instruction
*ins
=
1284 emit_ubo_read(ctx
, instr
, dest
, uniform
* 16, NULL
, 0);
1286 ins
->mask
= mask_of(nr_components
);
1290 compute_builtin_arg(nir_op op
)
1293 case nir_intrinsic_load_work_group_id
:
1295 case nir_intrinsic_load_local_invocation_id
:
1298 unreachable("Invalid compute paramater loaded");
1302 /* Emit store for a fragment shader, which is encoded via a fancy branch. TODO:
1303 * Handle MRT here */
1306 emit_fragment_store(compiler_context
*ctx
, unsigned src
, unsigned rt
)
1308 emit_explicit_constant(ctx
, src
, src
);
1310 /* If we're doing MRT, we need to specify the render target */
1312 midgard_instruction rt_move
= {
1317 /* We'll write to r1.z */
1318 rt_move
= v_mov(~0, blank_alu_src
, SSA_FIXED_REGISTER(1));
1319 rt_move
.mask
= 1 << COMPONENT_Z
;
1320 rt_move
.unit
= UNIT_SADD
;
1322 /* r1.z = (rt * 0x100) */
1323 rt_move
.has_inline_constant
= true;
1324 rt_move
.inline_constant
= (rt
* 0x100);
1327 ctx
->work_registers
= MAX2(ctx
->work_registers
, 1);
1330 emit_mir_instruction(ctx
, rt_move
);
1333 /* Next, generate the branch. For R render targets in the writeout, the
1334 * i'th render target jumps to pseudo-offset [2(R-1) + i] */
1336 unsigned outputs
= ctx
->is_blend
? 1 : ctx
->nir
->num_outputs
;
1337 unsigned offset
= (2 * (outputs
- 1)) + rt
;
1339 struct midgard_instruction ins
=
1340 v_alu_br_compact_cond(midgard_jmp_writeout_op_writeout
, TAG_ALU_4
, offset
, midgard_condition_always
);
1342 /* Add dependencies */
1344 ins
.src
[1] = rt_move
.dest
;
1346 /* Emit the branch */
1347 emit_mir_instruction(ctx
, ins
);
1351 emit_compute_builtin(compiler_context
*ctx
, nir_intrinsic_instr
*instr
)
1353 unsigned reg
= nir_dest_index(ctx
, &instr
->dest
);
1354 midgard_instruction ins
= m_ld_compute_id(reg
, 0);
1355 ins
.mask
= mask_of(3);
1356 ins
.load_store
.arg_1
= compute_builtin_arg(instr
->intrinsic
);
1357 emit_mir_instruction(ctx
, ins
);
1360 emit_intrinsic(compiler_context
*ctx
, nir_intrinsic_instr
*instr
)
1362 unsigned offset
= 0, reg
;
1364 switch (instr
->intrinsic
) {
1365 case nir_intrinsic_discard_if
:
1366 case nir_intrinsic_discard
: {
1367 bool conditional
= instr
->intrinsic
== nir_intrinsic_discard_if
;
1368 struct midgard_instruction discard
= v_branch(conditional
, false);
1369 discard
.branch
.target_type
= TARGET_DISCARD
;
1372 discard
.src
[0] = nir_src_index(ctx
, &instr
->src
[0]);
1374 emit_mir_instruction(ctx
, discard
);
1375 schedule_barrier(ctx
);
1380 case nir_intrinsic_load_uniform
:
1381 case nir_intrinsic_load_ubo
:
1382 case nir_intrinsic_load_ssbo
:
1383 case nir_intrinsic_load_input
: {
1384 bool is_uniform
= instr
->intrinsic
== nir_intrinsic_load_uniform
;
1385 bool is_ubo
= instr
->intrinsic
== nir_intrinsic_load_ubo
;
1386 bool is_ssbo
= instr
->intrinsic
== nir_intrinsic_load_ssbo
;
1388 /* Get the base type of the intrinsic */
1389 /* TODO: Infer type? Does it matter? */
1391 (is_ubo
|| is_ssbo
) ? nir_type_uint
: nir_intrinsic_type(instr
);
1392 t
= nir_alu_type_get_base_type(t
);
1394 if (!(is_ubo
|| is_ssbo
)) {
1395 offset
= nir_intrinsic_base(instr
);
1398 unsigned nr_comp
= nir_intrinsic_dest_components(instr
);
1400 nir_src
*src_offset
= nir_get_io_offset_src(instr
);
1402 bool direct
= nir_src_is_const(*src_offset
);
1403 nir_src
*indirect_offset
= direct
? NULL
: src_offset
;
1406 offset
+= nir_src_as_uint(*src_offset
);
1408 /* We may need to apply a fractional offset */
1409 int component
= instr
->intrinsic
== nir_intrinsic_load_input
?
1410 nir_intrinsic_component(instr
) : 0;
1411 reg
= nir_dest_index(ctx
, &instr
->dest
);
1413 if (is_uniform
&& !ctx
->is_blend
) {
1414 emit_ubo_read(ctx
, &instr
->instr
, reg
, (ctx
->sysval_count
+ offset
) * 16, indirect_offset
, 0);
1415 } else if (is_ubo
) {
1416 nir_src index
= instr
->src
[0];
1418 /* We don't yet support indirect UBOs. For indirect
1419 * block numbers (if that's possible), we don't know
1420 * enough about the hardware yet. For indirect sources,
1421 * we know what we need but we need to add some NIR
1422 * support for lowering correctly with respect to
1425 assert(nir_src_is_const(index
));
1426 assert(nir_src_is_const(*src_offset
));
1428 uint32_t uindex
= nir_src_as_uint(index
) + 1;
1429 emit_ubo_read(ctx
, &instr
->instr
, reg
, offset
, NULL
, uindex
);
1430 } else if (is_ssbo
) {
1431 nir_src index
= instr
->src
[0];
1432 assert(nir_src_is_const(index
));
1433 uint32_t uindex
= nir_src_as_uint(index
);
1435 emit_ssbo_access(ctx
, &instr
->instr
, true, reg
, offset
, indirect_offset
, uindex
);
1436 } else if (ctx
->stage
== MESA_SHADER_FRAGMENT
&& !ctx
->is_blend
) {
1437 emit_varying_read(ctx
, reg
, offset
, nr_comp
, component
, !direct
? &instr
->src
[0] : NULL
, t
);
1438 } else if (ctx
->is_blend
) {
1439 /* For blend shaders, load the input color, which is
1440 * preloaded to r0 */
1442 midgard_instruction move
= v_mov(SSA_FIXED_REGISTER(0), blank_alu_src
, reg
);
1443 emit_mir_instruction(ctx
, move
);
1444 schedule_barrier(ctx
);
1445 } else if (ctx
->stage
== MESA_SHADER_VERTEX
) {
1446 midgard_instruction ins
= m_ld_attr_32(reg
, offset
);
1447 ins
.load_store
.arg_1
= 0x1E;
1448 ins
.load_store
.arg_2
= 0x1E;
1449 ins
.mask
= mask_of(nr_comp
);
1451 /* Use the type appropriate load */
1455 ins
.load_store
.op
= midgard_op_ld_attr_32u
;
1458 ins
.load_store
.op
= midgard_op_ld_attr_32i
;
1460 case nir_type_float
:
1461 ins
.load_store
.op
= midgard_op_ld_attr_32
;
1464 unreachable("Attempted to load unknown type");
1468 emit_mir_instruction(ctx
, ins
);
1470 DBG("Unknown load\n");
1477 /* Reads 128-bit value raw off the tilebuffer during blending, tasty */
1479 case nir_intrinsic_load_raw_output_pan
:
1480 reg
= nir_dest_index(ctx
, &instr
->dest
);
1481 assert(ctx
->is_blend
);
1483 midgard_instruction ld
= m_ld_color_buffer_8(reg
, 0);
1484 emit_mir_instruction(ctx
, ld
);
1487 case nir_intrinsic_load_blend_const_color_rgba
: {
1488 assert(ctx
->is_blend
);
1489 reg
= nir_dest_index(ctx
, &instr
->dest
);
1491 /* Blend constants are embedded directly in the shader and
1492 * patched in, so we use some magic routing */
1494 midgard_instruction ins
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
), blank_alu_src
, reg
);
1495 ins
.has_constants
= true;
1496 ins
.has_blend_constant
= true;
1497 emit_mir_instruction(ctx
, ins
);
1501 case nir_intrinsic_store_output
:
1502 assert(nir_src_is_const(instr
->src
[1]) && "no indirect outputs");
1504 offset
= nir_intrinsic_base(instr
) + nir_src_as_uint(instr
->src
[1]);
1506 reg
= nir_src_index(ctx
, &instr
->src
[0]);
1508 if (ctx
->stage
== MESA_SHADER_FRAGMENT
) {
1509 /* Determine number of render targets */
1510 emit_fragment_store(ctx
, reg
, offset
);
1511 } else if (ctx
->stage
== MESA_SHADER_VERTEX
) {
1512 /* We should have been vectorized, though we don't
1513 * currently check that st_vary is emitted only once
1514 * per slot (this is relevant, since there's not a mask
1515 * parameter available on the store [set to 0 by the
1516 * blob]). We do respect the component by adjusting the
1517 * swizzle. If this is a constant source, we'll need to
1518 * emit that explicitly. */
1520 emit_explicit_constant(ctx
, reg
, reg
);
1522 unsigned component
= nir_intrinsic_component(instr
);
1523 unsigned nr_comp
= nir_src_num_components(instr
->src
[0]);
1525 midgard_instruction st
= m_st_vary_32(reg
, offset
);
1526 st
.load_store
.arg_1
= 0x9E;
1527 st
.load_store
.arg_2
= 0x1E;
1529 for (unsigned i
= 0; i
< ARRAY_SIZE(st
.swizzle
[0]); ++i
)
1530 st
.swizzle
[0][i
] = MIN2(i
+ component
, nr_comp
);
1532 emit_mir_instruction(ctx
, st
);
1534 DBG("Unknown store\n");
1540 /* Special case of store_output for lowered blend shaders */
1541 case nir_intrinsic_store_raw_output_pan
:
1542 assert (ctx
->stage
== MESA_SHADER_FRAGMENT
);
1543 reg
= nir_src_index(ctx
, &instr
->src
[0]);
1544 emit_fragment_store(ctx
, reg
, 0);
1548 case nir_intrinsic_store_ssbo
:
1549 assert(nir_src_is_const(instr
->src
[1]));
1551 bool direct_offset
= nir_src_is_const(instr
->src
[2]);
1552 offset
= direct_offset
? nir_src_as_uint(instr
->src
[2]) : 0;
1553 nir_src
*indirect_offset
= direct_offset
? NULL
: &instr
->src
[2];
1554 reg
= nir_src_index(ctx
, &instr
->src
[0]);
1556 uint32_t uindex
= nir_src_as_uint(instr
->src
[1]);
1558 emit_explicit_constant(ctx
, reg
, reg
);
1559 emit_ssbo_access(ctx
, &instr
->instr
, false, reg
, offset
, indirect_offset
, uindex
);
1562 case nir_intrinsic_load_viewport_scale
:
1563 case nir_intrinsic_load_viewport_offset
:
1564 case nir_intrinsic_load_num_work_groups
:
1565 emit_sysval_read(ctx
, &instr
->instr
, ~0, 3);
1568 case nir_intrinsic_load_work_group_id
:
1569 case nir_intrinsic_load_local_invocation_id
:
1570 emit_compute_builtin(ctx
, instr
);
1574 printf ("Unhandled intrinsic\n");
1581 midgard_tex_format(enum glsl_sampler_dim dim
)
1584 case GLSL_SAMPLER_DIM_1D
:
1585 case GLSL_SAMPLER_DIM_BUF
:
1588 case GLSL_SAMPLER_DIM_2D
:
1589 case GLSL_SAMPLER_DIM_EXTERNAL
:
1590 case GLSL_SAMPLER_DIM_RECT
:
1593 case GLSL_SAMPLER_DIM_3D
:
1596 case GLSL_SAMPLER_DIM_CUBE
:
1597 return MALI_TEX_CUBE
;
1600 DBG("Unknown sampler dim type\n");
1606 /* Tries to attach an explicit LOD / bias as a constant. Returns whether this
1610 pan_attach_constant_bias(
1611 compiler_context
*ctx
,
1613 midgard_texture_word
*word
)
1615 /* To attach as constant, it has to *be* constant */
1617 if (!nir_src_is_const(lod
))
1620 float f
= nir_src_as_float(lod
);
1622 /* Break into fixed-point */
1624 float lod_frac
= f
- lod_int
;
1626 /* Carry over negative fractions */
1627 if (lod_frac
< 0.0) {
1633 word
->bias
= float_to_ubyte(lod_frac
);
1634 word
->bias_int
= lod_int
;
1639 static enum mali_sampler_type
1640 midgard_sampler_type(nir_alu_type t
) {
1641 switch (nir_alu_type_get_base_type(t
))
1643 case nir_type_float
:
1644 return MALI_SAMPLER_FLOAT
;
1646 return MALI_SAMPLER_SIGNED
;
1648 return MALI_SAMPLER_UNSIGNED
;
1650 unreachable("Unknown sampler type");
1655 emit_texop_native(compiler_context
*ctx
, nir_tex_instr
*instr
,
1656 unsigned midgard_texop
)
1659 //assert (!instr->sampler);
1660 //assert (!instr->texture_array_size);
1662 int texture_index
= instr
->texture_index
;
1663 int sampler_index
= texture_index
;
1665 /* No helper to build texture words -- we do it all here */
1666 midgard_instruction ins
= {
1667 .type
= TAG_TEXTURE_4
,
1669 .dest
= nir_dest_index(ctx
, &instr
->dest
),
1670 .src
= { ~0, ~0, ~0 },
1671 .swizzle
= SWIZZLE_IDENTITY_4
,
1673 .op
= midgard_texop
,
1674 .format
= midgard_tex_format(instr
->sampler_dim
),
1675 .texture_handle
= texture_index
,
1676 .sampler_handle
= sampler_index
,
1682 .sampler_type
= midgard_sampler_type(instr
->dest_type
),
1686 for (unsigned i
= 0; i
< instr
->num_srcs
; ++i
) {
1687 int index
= nir_src_index(ctx
, &instr
->src
[i
].src
);
1688 unsigned nr_components
= nir_src_num_components(instr
->src
[i
].src
);
1690 switch (instr
->src
[i
].src_type
) {
1691 case nir_tex_src_coord
: {
1692 emit_explicit_constant(ctx
, index
, index
);
1694 /* Texelfetch coordinates uses all four elements
1695 * (xyz/index) regardless of texture dimensionality,
1696 * which means it's necessary to zero the unused
1697 * components to keep everything happy */
1699 if (midgard_texop
== TEXTURE_OP_TEXEL_FETCH
) {
1700 unsigned old_index
= index
;
1702 index
= make_compiler_temp(ctx
);
1704 /* mov index, old_index */
1705 midgard_instruction mov
= v_mov(old_index
, blank_alu_src
, index
);
1707 emit_mir_instruction(ctx
, mov
);
1709 /* mov index.zw, #0 */
1710 mov
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
),
1711 blank_alu_src
, index
);
1712 mov
.has_constants
= true;
1713 mov
.mask
= (1 << COMPONENT_Z
) | (1 << COMPONENT_W
);
1714 emit_mir_instruction(ctx
, mov
);
1717 if (instr
->sampler_dim
== GLSL_SAMPLER_DIM_CUBE
) {
1718 /* texelFetch is undefined on samplerCube */
1719 assert(midgard_texop
!= TEXTURE_OP_TEXEL_FETCH
);
1721 /* For cubemaps, we use a special ld/st op to
1722 * select the face and copy the xy into the
1723 * texture register */
1725 unsigned temp
= make_compiler_temp(ctx
);
1726 midgard_instruction ld
= m_ld_cubemap_coords(temp
, 0);
1728 ld
.mask
= 0x3; /* xy */
1729 ld
.load_store
.arg_1
= 0x20;
1730 ld
.swizzle
[1][3] = COMPONENT_X
;
1731 emit_mir_instruction(ctx
, ld
);
1735 ins
.swizzle
[1][2] = COMPONENT_X
;
1736 ins
.swizzle
[1][3] = COMPONENT_X
;
1741 if (instr
->sampler_dim
== GLSL_SAMPLER_DIM_2D
) {
1742 /* Array component in w but NIR wants it in z */
1743 if (nr_components
== 3) {
1744 ins
.swizzle
[1][2] = COMPONENT_Z
;
1745 ins
.swizzle
[1][3] = COMPONENT_Z
;
1746 } else if (nr_components
== 2) {
1747 ins
.swizzle
[1][2] = COMPONENT_X
;
1748 ins
.swizzle
[1][3] = COMPONENT_X
;
1750 unreachable("Invalid texture 2D components");
1756 case nir_tex_src_bias
:
1757 case nir_tex_src_lod
: {
1758 /* Try as a constant if we can */
1760 bool is_txf
= midgard_texop
== TEXTURE_OP_TEXEL_FETCH
;
1761 if (!is_txf
&& pan_attach_constant_bias(ctx
, instr
->src
[i
].src
, &ins
.texture
))
1764 ins
.texture
.lod_register
= true;
1766 emit_explicit_constant(ctx
, index
, index
);
1772 unreachable("Unknown texture source type\n");
1776 emit_mir_instruction(ctx
, ins
);
1778 /* Used for .cont and .last hinting */
1779 ctx
->texture_op_count
++;
1783 emit_tex(compiler_context
*ctx
, nir_tex_instr
*instr
)
1785 /* Fixup op, since only textureLod is permitted in VS but NIR can give
1786 * generic tex in some cases (which confuses the hardware) */
1788 bool is_vertex
= ctx
->stage
== MESA_SHADER_VERTEX
;
1790 if (is_vertex
&& instr
->op
== nir_texop_tex
)
1791 instr
->op
= nir_texop_txl
;
1793 switch (instr
->op
) {
1796 emit_texop_native(ctx
, instr
, TEXTURE_OP_NORMAL
);
1799 emit_texop_native(ctx
, instr
, TEXTURE_OP_LOD
);
1802 emit_texop_native(ctx
, instr
, TEXTURE_OP_TEXEL_FETCH
);
1805 emit_sysval_read(ctx
, &instr
->instr
, ~0, 4);
1808 unreachable("Unhanlded texture op");
1813 emit_jump(compiler_context
*ctx
, nir_jump_instr
*instr
)
1815 switch (instr
->type
) {
1816 case nir_jump_break
: {
1817 /* Emit a branch out of the loop */
1818 struct midgard_instruction br
= v_branch(false, false);
1819 br
.branch
.target_type
= TARGET_BREAK
;
1820 br
.branch
.target_break
= ctx
->current_loop_depth
;
1821 emit_mir_instruction(ctx
, br
);
1826 DBG("Unknown jump type %d\n", instr
->type
);
1832 emit_instr(compiler_context
*ctx
, struct nir_instr
*instr
)
1834 switch (instr
->type
) {
1835 case nir_instr_type_load_const
:
1836 emit_load_const(ctx
, nir_instr_as_load_const(instr
));
1839 case nir_instr_type_intrinsic
:
1840 emit_intrinsic(ctx
, nir_instr_as_intrinsic(instr
));
1843 case nir_instr_type_alu
:
1844 emit_alu(ctx
, nir_instr_as_alu(instr
));
1847 case nir_instr_type_tex
:
1848 emit_tex(ctx
, nir_instr_as_tex(instr
));
1851 case nir_instr_type_jump
:
1852 emit_jump(ctx
, nir_instr_as_jump(instr
));
1855 case nir_instr_type_ssa_undef
:
1860 DBG("Unhandled instruction type\n");
1866 /* ALU instructions can inline or embed constants, which decreases register
1867 * pressure and saves space. */
1869 #define CONDITIONAL_ATTACH(idx) { \
1870 void *entry = _mesa_hash_table_u64_search(ctx->ssa_constants, alu->src[idx] + 1); \
1873 attach_constants(ctx, alu, entry, alu->src[idx] + 1); \
1874 alu->src[idx] = SSA_FIXED_REGISTER(REGISTER_CONSTANT); \
1879 inline_alu_constants(compiler_context
*ctx
, midgard_block
*block
)
1881 mir_foreach_instr_in_block(block
, alu
) {
1882 /* Other instructions cannot inline constants */
1883 if (alu
->type
!= TAG_ALU_4
) continue;
1884 if (alu
->compact_branch
) continue;
1886 /* If there is already a constant here, we can do nothing */
1887 if (alu
->has_constants
) continue;
1889 CONDITIONAL_ATTACH(0);
1891 if (!alu
->has_constants
) {
1892 CONDITIONAL_ATTACH(1)
1893 } else if (!alu
->inline_constant
) {
1894 /* Corner case: _two_ vec4 constants, for instance with a
1895 * csel. For this case, we can only use a constant
1896 * register for one, we'll have to emit a move for the
1897 * other. Note, if both arguments are constants, then
1898 * necessarily neither argument depends on the value of
1899 * any particular register. As the destination register
1900 * will be wiped, that means we can spill the constant
1901 * to the destination register.
1904 void *entry
= _mesa_hash_table_u64_search(ctx
->ssa_constants
, alu
->src
[1] + 1);
1905 unsigned scratch
= alu
->dest
;
1908 midgard_instruction ins
= v_mov(SSA_FIXED_REGISTER(REGISTER_CONSTANT
), blank_alu_src
, scratch
);
1909 attach_constants(ctx
, &ins
, entry
, alu
->src
[1] + 1);
1911 /* Set the source */
1912 alu
->src
[1] = scratch
;
1914 /* Inject us -before- the last instruction which set r31 */
1915 mir_insert_instruction_before(ctx
, mir_prev_op(alu
), ins
);
1921 /* Being a little silly with the names, but returns the op that is the bitwise
1922 * inverse of the op with the argument switched. I.e. (f and g are
1925 * f(a, b) = ~g(b, a)
1927 * Corollary: if g is the contrapositve of f, f is the contrapositive of g:
1929 * f(a, b) = ~g(b, a)
1930 * ~f(a, b) = g(b, a)
1931 * ~f(a, b) = ~h(a, b) where h is the contrapositive of g
1934 * Thus we define this function in pairs.
1937 static inline midgard_alu_op
1938 mir_contrapositive(midgard_alu_op op
)
1941 case midgard_alu_op_flt
:
1942 return midgard_alu_op_fle
;
1943 case midgard_alu_op_fle
:
1944 return midgard_alu_op_flt
;
1946 case midgard_alu_op_ilt
:
1947 return midgard_alu_op_ile
;
1948 case midgard_alu_op_ile
:
1949 return midgard_alu_op_ilt
;
1952 unreachable("No known contrapositive");
1956 /* Midgard supports two types of constants, embedded constants (128-bit) and
1957 * inline constants (16-bit). Sometimes, especially with scalar ops, embedded
1958 * constants can be demoted to inline constants, for space savings and
1959 * sometimes a performance boost */
1962 embedded_to_inline_constant(compiler_context
*ctx
, midgard_block
*block
)
1964 mir_foreach_instr_in_block(block
, ins
) {
1965 if (!ins
->has_constants
) continue;
1966 if (ins
->has_inline_constant
) continue;
1968 /* Blend constants must not be inlined by definition */
1969 if (ins
->has_blend_constant
) continue;
1971 /* We can inline 32-bit (sometimes) or 16-bit (usually) */
1972 bool is_16
= ins
->alu
.reg_mode
== midgard_reg_mode_16
;
1973 bool is_32
= ins
->alu
.reg_mode
== midgard_reg_mode_32
;
1975 if (!(is_16
|| is_32
))
1978 /* src1 cannot be an inline constant due to encoding
1979 * restrictions. So, if possible we try to flip the arguments
1982 int op
= ins
->alu
.op
;
1984 if (ins
->src
[0] == SSA_FIXED_REGISTER(REGISTER_CONSTANT
)) {
1985 bool flip
= alu_opcode_props
[op
].props
& OP_COMMUTES
;
1988 /* Conditionals can be inverted */
1989 case midgard_alu_op_flt
:
1990 case midgard_alu_op_ilt
:
1991 case midgard_alu_op_fle
:
1992 case midgard_alu_op_ile
:
1993 ins
->alu
.op
= mir_contrapositive(ins
->alu
.op
);
1998 case midgard_alu_op_fcsel
:
1999 case midgard_alu_op_icsel
:
2000 DBG("Missed non-commutative flip (%s)\n", alu_opcode_props
[op
].name
);
2009 if (ins
->src
[1] == SSA_FIXED_REGISTER(REGISTER_CONSTANT
)) {
2010 /* Extract the source information */
2012 midgard_vector_alu_src
*src
;
2013 int q
= ins
->alu
.src2
;
2014 midgard_vector_alu_src
*m
= (midgard_vector_alu_src
*) &q
;
2017 /* Component is from the swizzle. Take a nonzero component */
2019 unsigned first_comp
= ffs(ins
->mask
) - 1;
2020 unsigned component
= ins
->swizzle
[1][first_comp
];
2022 /* Scale constant appropriately, if we can legally */
2023 uint16_t scaled_constant
= 0;
2025 if (midgard_is_integer_op(op
) || is_16
) {
2026 unsigned int *iconstants
= (unsigned int *) ins
->constants
;
2027 scaled_constant
= (uint16_t) iconstants
[component
];
2029 /* Constant overflow after resize */
2030 if (scaled_constant
!= iconstants
[component
])
2033 float *f
= (float *) ins
->constants
;
2034 float original
= f
[component
];
2035 scaled_constant
= _mesa_float_to_half(original
);
2037 /* Check for loss of precision. If this is
2038 * mediump, we don't care, but for a highp
2039 * shader, we need to pay attention. NIR
2040 * doesn't yet tell us which mode we're in!
2041 * Practically this prevents most constants
2042 * from being inlined, sadly. */
2044 float fp32
= _mesa_half_to_float(scaled_constant
);
2046 if (fp32
!= original
)
2050 /* We don't know how to handle these with a constant */
2052 if (mir_nontrivial_source2_mod_simple(ins
) || src
->rep_low
|| src
->rep_high
) {
2053 DBG("Bailing inline constant...\n");
2057 /* Make sure that the constant is not itself a vector
2058 * by checking if all accessed values are the same. */
2060 uint32_t *cons
= ins
->constants
;
2061 uint32_t value
= cons
[component
];
2063 bool is_vector
= false;
2064 unsigned mask
= effective_writemask(&ins
->alu
, ins
->mask
);
2066 for (unsigned c
= 0; c
< MIR_VEC_COMPONENTS
; ++c
) {
2067 /* We only care if this component is actually used */
2068 if (!(mask
& (1 << c
)))
2071 uint32_t test
= cons
[ins
->swizzle
[1][c
]];
2073 if (test
!= value
) {
2082 /* Get rid of the embedded constant */
2083 ins
->has_constants
= false;
2085 ins
->has_inline_constant
= true;
2086 ins
->inline_constant
= scaled_constant
;
2091 /* Dead code elimination for branches at the end of a block - only one branch
2092 * per block is legal semantically */
2095 midgard_opt_cull_dead_branch(compiler_context
*ctx
, midgard_block
*block
)
2097 bool branched
= false;
2099 mir_foreach_instr_in_block_safe(block
, ins
) {
2100 if (!midgard_is_branch_unit(ins
->unit
)) continue;
2103 mir_remove_instruction(ins
);
2109 /* fmov.pos is an idiom for fpos. Propoagate the .pos up to the source, so then
2110 * the move can be propagated away entirely */
2113 mir_compose_float_outmod(midgard_outmod_float
*outmod
, midgard_outmod_float comp
)
2116 if (comp
== midgard_outmod_none
)
2119 if (*outmod
== midgard_outmod_none
) {
2124 /* TODO: Compose rules */
2129 midgard_opt_pos_propagate(compiler_context
*ctx
, midgard_block
*block
)
2131 bool progress
= false;
2133 mir_foreach_instr_in_block_safe(block
, ins
) {
2134 if (ins
->type
!= TAG_ALU_4
) continue;
2135 if (ins
->alu
.op
!= midgard_alu_op_fmov
) continue;
2136 if (ins
->alu
.outmod
!= midgard_outmod_pos
) continue;
2138 /* TODO: Registers? */
2139 unsigned src
= ins
->src
[1];
2140 if (src
& IS_REG
) continue;
2142 /* There might be a source modifier, too */
2143 if (mir_nontrivial_source2_mod(ins
)) continue;
2145 /* Backpropagate the modifier */
2146 mir_foreach_instr_in_block_from_rev(block
, v
, mir_prev_op(ins
)) {
2147 if (v
->type
!= TAG_ALU_4
) continue;
2148 if (v
->dest
!= src
) continue;
2150 /* Can we even take a float outmod? */
2151 if (midgard_is_integer_out_op(v
->alu
.op
)) continue;
2153 midgard_outmod_float temp
= v
->alu
.outmod
;
2154 progress
|= mir_compose_float_outmod(&temp
, ins
->alu
.outmod
);
2156 /* Throw in the towel.. */
2157 if (!progress
) break;
2159 /* Otherwise, transfer the modifier */
2160 v
->alu
.outmod
= temp
;
2161 ins
->alu
.outmod
= midgard_outmod_none
;
2171 emit_fragment_epilogue(compiler_context
*ctx
)
2173 /* Just emit the last chunk with the branch */
2174 EMIT(alu_br_compact_cond
, midgard_jmp_writeout_op_writeout
, TAG_ALU_4
, ~0, midgard_condition_always
);
2177 static midgard_block
*
2178 emit_block(compiler_context
*ctx
, nir_block
*block
)
2180 midgard_block
*this_block
= ctx
->after_block
;
2181 ctx
->after_block
= NULL
;
2184 this_block
= create_empty_block(ctx
);
2186 list_addtail(&this_block
->link
, &ctx
->blocks
);
2188 this_block
->is_scheduled
= false;
2191 /* Set up current block */
2192 list_inithead(&this_block
->instructions
);
2193 ctx
->current_block
= this_block
;
2195 nir_foreach_instr(instr
, block
) {
2196 emit_instr(ctx
, instr
);
2197 ++ctx
->instruction_count
;
2203 static midgard_block
*emit_cf_list(struct compiler_context
*ctx
, struct exec_list
*list
);
2206 emit_if(struct compiler_context
*ctx
, nir_if
*nif
)
2208 midgard_block
*before_block
= ctx
->current_block
;
2210 /* Speculatively emit the branch, but we can't fill it in until later */
2211 EMIT(branch
, true, true);
2212 midgard_instruction
*then_branch
= mir_last_in_block(ctx
->current_block
);
2213 then_branch
->src
[0] = nir_src_index(ctx
, &nif
->condition
);
2215 /* Emit the two subblocks. */
2216 midgard_block
*then_block
= emit_cf_list(ctx
, &nif
->then_list
);
2217 midgard_block
*end_then_block
= ctx
->current_block
;
2219 /* Emit a jump from the end of the then block to the end of the else */
2220 EMIT(branch
, false, false);
2221 midgard_instruction
*then_exit
= mir_last_in_block(ctx
->current_block
);
2223 /* Emit second block, and check if it's empty */
2225 int else_idx
= ctx
->block_count
;
2226 int count_in
= ctx
->instruction_count
;
2227 midgard_block
*else_block
= emit_cf_list(ctx
, &nif
->else_list
);
2228 midgard_block
*end_else_block
= ctx
->current_block
;
2229 int after_else_idx
= ctx
->block_count
;
2231 /* Now that we have the subblocks emitted, fix up the branches */
2236 if (ctx
->instruction_count
== count_in
) {
2237 /* The else block is empty, so don't emit an exit jump */
2238 mir_remove_instruction(then_exit
);
2239 then_branch
->branch
.target_block
= after_else_idx
;
2241 then_branch
->branch
.target_block
= else_idx
;
2242 then_exit
->branch
.target_block
= after_else_idx
;
2245 /* Wire up the successors */
2247 ctx
->after_block
= create_empty_block(ctx
);
2249 midgard_block_add_successor(before_block
, then_block
);
2250 midgard_block_add_successor(before_block
, else_block
);
2252 midgard_block_add_successor(end_then_block
, ctx
->after_block
);
2253 midgard_block_add_successor(end_else_block
, ctx
->after_block
);
2257 emit_loop(struct compiler_context
*ctx
, nir_loop
*nloop
)
2259 /* Remember where we are */
2260 midgard_block
*start_block
= ctx
->current_block
;
2262 /* Allocate a loop number, growing the current inner loop depth */
2263 int loop_idx
= ++ctx
->current_loop_depth
;
2265 /* Get index from before the body so we can loop back later */
2266 int start_idx
= ctx
->block_count
;
2268 /* Emit the body itself */
2269 midgard_block
*loop_block
= emit_cf_list(ctx
, &nloop
->body
);
2271 /* Branch back to loop back */
2272 struct midgard_instruction br_back
= v_branch(false, false);
2273 br_back
.branch
.target_block
= start_idx
;
2274 emit_mir_instruction(ctx
, br_back
);
2276 /* Mark down that branch in the graph. */
2277 midgard_block_add_successor(start_block
, loop_block
);
2278 midgard_block_add_successor(ctx
->current_block
, loop_block
);
2280 /* Find the index of the block about to follow us (note: we don't add
2281 * one; blocks are 0-indexed so we get a fencepost problem) */
2282 int break_block_idx
= ctx
->block_count
;
2284 /* Fix up the break statements we emitted to point to the right place,
2285 * now that we can allocate a block number for them */
2286 ctx
->after_block
= create_empty_block(ctx
);
2288 list_for_each_entry_from(struct midgard_block
, block
, start_block
, &ctx
->blocks
, link
) {
2289 mir_foreach_instr_in_block(block
, ins
) {
2290 if (ins
->type
!= TAG_ALU_4
) continue;
2291 if (!ins
->compact_branch
) continue;
2292 if (ins
->prepacked_branch
) continue;
2294 /* We found a branch -- check the type to see if we need to do anything */
2295 if (ins
->branch
.target_type
!= TARGET_BREAK
) continue;
2297 /* It's a break! Check if it's our break */
2298 if (ins
->branch
.target_break
!= loop_idx
) continue;
2300 /* Okay, cool, we're breaking out of this loop.
2301 * Rewrite from a break to a goto */
2303 ins
->branch
.target_type
= TARGET_GOTO
;
2304 ins
->branch
.target_block
= break_block_idx
;
2306 midgard_block_add_successor(block
, ctx
->after_block
);
2310 /* Now that we've finished emitting the loop, free up the depth again
2311 * so we play nice with recursion amid nested loops */
2312 --ctx
->current_loop_depth
;
2314 /* Dump loop stats */
2318 static midgard_block
*
2319 emit_cf_list(struct compiler_context
*ctx
, struct exec_list
*list
)
2321 midgard_block
*start_block
= NULL
;
2323 foreach_list_typed(nir_cf_node
, node
, node
, list
) {
2324 switch (node
->type
) {
2325 case nir_cf_node_block
: {
2326 midgard_block
*block
= emit_block(ctx
, nir_cf_node_as_block(node
));
2329 start_block
= block
;
2334 case nir_cf_node_if
:
2335 emit_if(ctx
, nir_cf_node_as_if(node
));
2338 case nir_cf_node_loop
:
2339 emit_loop(ctx
, nir_cf_node_as_loop(node
));
2342 case nir_cf_node_function
:
2351 /* Due to lookahead, we need to report the first tag executed in the command
2352 * stream and in branch targets. An initial block might be empty, so iterate
2353 * until we find one that 'works' */
2356 midgard_get_first_tag_from_block(compiler_context
*ctx
, unsigned block_idx
)
2358 midgard_block
*initial_block
= mir_get_block(ctx
, block_idx
);
2360 unsigned first_tag
= 0;
2362 mir_foreach_block_from(ctx
, initial_block
, v
) {
2363 midgard_bundle
*initial_bundle
=
2364 util_dynarray_element(&v
->bundles
, midgard_bundle
, 0);
2366 if (initial_bundle
) {
2367 first_tag
= initial_bundle
->tag
;
2376 midgard_compile_shader_nir(struct midgard_screen
*screen
, nir_shader
*nir
, midgard_program
*program
, bool is_blend
)
2378 struct util_dynarray
*compiled
= &program
->compiled
;
2380 midgard_debug
= debug_get_option_midgard_debug();
2382 /* TODO: Bound against what? */
2383 compiler_context
*ctx
= rzalloc(NULL
, compiler_context
);
2386 ctx
->screen
= screen
;
2387 ctx
->stage
= nir
->info
.stage
;
2388 ctx
->is_blend
= is_blend
;
2389 ctx
->alpha_ref
= program
->alpha_ref
;
2391 /* Start off with a safe cutoff, allowing usage of all 16 work
2392 * registers. Later, we'll promote uniform reads to uniform registers
2393 * if we determine it is beneficial to do so */
2394 ctx
->uniform_cutoff
= 8;
2396 /* Initialize at a global (not block) level hash tables */
2398 ctx
->ssa_constants
= _mesa_hash_table_u64_create(NULL
);
2399 ctx
->hash_to_temp
= _mesa_hash_table_u64_create(NULL
);
2400 ctx
->sysval_to_id
= _mesa_hash_table_u64_create(NULL
);
2402 /* Record the varying mapping for the command stream's bookkeeping */
2404 struct exec_list
*varyings
=
2405 ctx
->stage
== MESA_SHADER_VERTEX
? &nir
->outputs
: &nir
->inputs
;
2407 unsigned max_varying
= 0;
2408 nir_foreach_variable(var
, varyings
) {
2409 unsigned loc
= var
->data
.driver_location
;
2410 unsigned sz
= glsl_type_size(var
->type
, FALSE
);
2412 for (int c
= 0; c
< sz
; ++c
) {
2413 program
->varyings
[loc
+ c
] = var
->data
.location
+ c
;
2414 max_varying
= MAX2(max_varying
, loc
+ c
);
2418 /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
2419 * (so we don't accidentally duplicate the epilogue since mesa/st has
2420 * messed with our I/O quite a bit already) */
2422 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
2424 if (ctx
->stage
== MESA_SHADER_VERTEX
) {
2425 NIR_PASS_V(nir
, nir_lower_viewport_transform
);
2426 NIR_PASS_V(nir
, nir_lower_point_size
, 1.0, 1024.0);
2429 NIR_PASS_V(nir
, nir_lower_var_copies
);
2430 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
2431 NIR_PASS_V(nir
, nir_split_var_copies
);
2432 NIR_PASS_V(nir
, nir_lower_var_copies
);
2433 NIR_PASS_V(nir
, nir_lower_global_vars_to_local
);
2434 NIR_PASS_V(nir
, nir_lower_var_copies
);
2435 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
2437 NIR_PASS_V(nir
, nir_lower_io
, nir_var_all
, glsl_type_size
, 0);
2439 /* Optimisation passes */
2443 if (midgard_debug
& MIDGARD_DBG_SHADERS
) {
2444 nir_print_shader(nir
, stdout
);
2447 /* Assign sysvals and counts, now that we're sure
2448 * (post-optimisation) */
2450 midgard_nir_assign_sysvals(ctx
, nir
);
2452 program
->uniform_count
= nir
->num_uniforms
;
2453 program
->sysval_count
= ctx
->sysval_count
;
2454 memcpy(program
->sysvals
, ctx
->sysvals
, sizeof(ctx
->sysvals
[0]) * ctx
->sysval_count
);
2456 nir_foreach_function(func
, nir
) {
2460 list_inithead(&ctx
->blocks
);
2461 ctx
->block_count
= 0;
2464 emit_cf_list(ctx
, &func
->impl
->body
);
2466 /* Emit empty exit block with successor */
2468 struct midgard_block
*semi_end
= ctx
->current_block
;
2470 struct midgard_block
*end
=
2471 emit_block(ctx
, func
->impl
->end_block
);
2473 if (ctx
->stage
== MESA_SHADER_FRAGMENT
)
2474 emit_fragment_epilogue(ctx
);
2476 midgard_block_add_successor(semi_end
, end
);
2478 break; /* TODO: Multi-function shaders */
2481 util_dynarray_init(compiled
, NULL
);
2483 /* Per-block lowering before opts */
2485 mir_foreach_block(ctx
, block
) {
2486 inline_alu_constants(ctx
, block
);
2487 midgard_opt_promote_fmov(ctx
, block
);
2488 embedded_to_inline_constant(ctx
, block
);
2490 /* MIR-level optimizations */
2492 bool progress
= false;
2497 mir_foreach_block(ctx
, block
) {
2498 progress
|= midgard_opt_pos_propagate(ctx
, block
);
2499 progress
|= midgard_opt_copy_prop(ctx
, block
);
2500 progress
|= midgard_opt_dead_code_eliminate(ctx
, block
);
2501 progress
|= midgard_opt_combine_projection(ctx
, block
);
2502 progress
|= midgard_opt_varying_projection(ctx
, block
);
2503 progress
|= midgard_opt_not_propagate(ctx
, block
);
2504 progress
|= midgard_opt_fuse_src_invert(ctx
, block
);
2505 progress
|= midgard_opt_fuse_dest_invert(ctx
, block
);
2506 progress
|= midgard_opt_csel_invert(ctx
, block
);
2510 mir_foreach_block(ctx
, block
) {
2511 midgard_lower_invert(ctx
, block
);
2512 midgard_lower_derivatives(ctx
, block
);
2515 /* Nested control-flow can result in dead branches at the end of the
2516 * block. This messes with our analysis and is just dead code, so cull
2518 mir_foreach_block(ctx
, block
) {
2519 midgard_opt_cull_dead_branch(ctx
, block
);
2522 /* Ensure we were lowered */
2523 mir_foreach_instr_global(ctx
, ins
) {
2524 assert(!ins
->invert
);
2528 schedule_program(ctx
);
2530 /* Now that all the bundles are scheduled and we can calculate block
2531 * sizes, emit actual branch instructions rather than placeholders */
2533 int br_block_idx
= 0;
2535 mir_foreach_block(ctx
, block
) {
2536 util_dynarray_foreach(&block
->bundles
, midgard_bundle
, bundle
) {
2537 for (int c
= 0; c
< bundle
->instruction_count
; ++c
) {
2538 midgard_instruction
*ins
= bundle
->instructions
[c
];
2540 if (!midgard_is_branch_unit(ins
->unit
)) continue;
2542 if (ins
->prepacked_branch
) continue;
2544 /* Parse some basic branch info */
2545 bool is_compact
= ins
->unit
== ALU_ENAB_BR_COMPACT
;
2546 bool is_conditional
= ins
->branch
.conditional
;
2547 bool is_inverted
= ins
->branch
.invert_conditional
;
2548 bool is_discard
= ins
->branch
.target_type
== TARGET_DISCARD
;
2550 /* Determine the block we're jumping to */
2551 int target_number
= ins
->branch
.target_block
;
2553 /* Report the destination tag */
2554 int dest_tag
= is_discard
? 0 : midgard_get_first_tag_from_block(ctx
, target_number
);
2556 /* Count up the number of quadwords we're
2557 * jumping over = number of quadwords until
2558 * (br_block_idx, target_number) */
2560 int quadword_offset
= 0;
2564 } else if (target_number
> br_block_idx
) {
2567 for (int idx
= br_block_idx
+ 1; idx
< target_number
; ++idx
) {
2568 midgard_block
*blk
= mir_get_block(ctx
, idx
);
2571 quadword_offset
+= blk
->quadword_count
;
2574 /* Jump backwards */
2576 for (int idx
= br_block_idx
; idx
>= target_number
; --idx
) {
2577 midgard_block
*blk
= mir_get_block(ctx
, idx
);
2580 quadword_offset
-= blk
->quadword_count
;
2584 /* Unconditional extended branches (far jumps)
2585 * have issues, so we always use a conditional
2586 * branch, setting the condition to always for
2587 * unconditional. For compact unconditional
2588 * branches, cond isn't used so it doesn't
2589 * matter what we pick. */
2591 midgard_condition cond
=
2592 !is_conditional
? midgard_condition_always
:
2593 is_inverted
? midgard_condition_false
:
2594 midgard_condition_true
;
2596 midgard_jmp_writeout_op op
=
2597 is_discard
? midgard_jmp_writeout_op_discard
:
2598 (is_compact
&& !is_conditional
) ? midgard_jmp_writeout_op_branch_uncond
:
2599 midgard_jmp_writeout_op_branch_cond
;
2602 midgard_branch_extended branch
=
2603 midgard_create_branch_extended(
2608 memcpy(&ins
->branch_extended
, &branch
, sizeof(branch
));
2609 } else if (is_conditional
|| is_discard
) {
2610 midgard_branch_cond branch
= {
2612 .dest_tag
= dest_tag
,
2613 .offset
= quadword_offset
,
2617 assert(branch
.offset
== quadword_offset
);
2619 memcpy(&ins
->br_compact
, &branch
, sizeof(branch
));
2621 assert(op
== midgard_jmp_writeout_op_branch_uncond
);
2623 midgard_branch_uncond branch
= {
2625 .dest_tag
= dest_tag
,
2626 .offset
= quadword_offset
,
2630 assert(branch
.offset
== quadword_offset
);
2632 memcpy(&ins
->br_compact
, &branch
, sizeof(branch
));
2640 /* Emit flat binary from the instruction arrays. Iterate each block in
2641 * sequence. Save instruction boundaries such that lookahead tags can
2642 * be assigned easily */
2644 /* Cache _all_ bundles in source order for lookahead across failed branches */
2646 int bundle_count
= 0;
2647 mir_foreach_block(ctx
, block
) {
2648 bundle_count
+= block
->bundles
.size
/ sizeof(midgard_bundle
);
2650 midgard_bundle
**source_order_bundles
= malloc(sizeof(midgard_bundle
*) * bundle_count
);
2652 mir_foreach_block(ctx
, block
) {
2653 util_dynarray_foreach(&block
->bundles
, midgard_bundle
, bundle
) {
2654 source_order_bundles
[bundle_idx
++] = bundle
;
2658 int current_bundle
= 0;
2660 /* Midgard prefetches instruction types, so during emission we
2661 * need to lookahead. Unless this is the last instruction, in
2662 * which we return 1. Or if this is the second to last and the
2663 * last is an ALU, then it's also 1... */
2665 mir_foreach_block(ctx
, block
) {
2666 mir_foreach_bundle_in_block(block
, bundle
) {
2669 if (current_bundle
+ 1 < bundle_count
) {
2670 uint8_t next
= source_order_bundles
[current_bundle
+ 1]->tag
;
2672 if (!(current_bundle
+ 2 < bundle_count
) && IS_ALU(next
)) {
2679 emit_binary_bundle(ctx
, bundle
, compiled
, lookahead
);
2683 /* TODO: Free deeper */
2684 //util_dynarray_fini(&block->instructions);
2687 free(source_order_bundles
);
2689 /* Report the very first tag executed */
2690 program
->first_tag
= midgard_get_first_tag_from_block(ctx
, 0);
2692 /* Deal with off-by-one related to the fencepost problem */
2693 program
->work_register_count
= ctx
->work_registers
+ 1;
2694 program
->uniform_cutoff
= ctx
->uniform_cutoff
;
2696 program
->blend_patch_offset
= ctx
->blend_constant_offset
;
2697 program
->tls_size
= ctx
->tls_size
;
2699 if (midgard_debug
& MIDGARD_DBG_SHADERS
)
2700 disassemble_midgard(program
->compiled
.data
, program
->compiled
.size
);
2702 if (midgard_debug
& MIDGARD_DBG_SHADERDB
) {
2703 unsigned nr_bundles
= 0, nr_ins
= 0;
2705 /* Count instructions and bundles */
2707 mir_foreach_block(ctx
, block
) {
2708 nr_bundles
+= util_dynarray_num_elements(
2709 &block
->bundles
, midgard_bundle
);
2711 mir_foreach_bundle_in_block(block
, bun
)
2712 nr_ins
+= bun
->instruction_count
;
2715 /* Calculate thread count. There are certain cutoffs by
2716 * register count for thread count */
2718 unsigned nr_registers
= program
->work_register_count
;
2720 unsigned nr_threads
=
2721 (nr_registers
<= 4) ? 4 :
2722 (nr_registers
<= 8) ? 2 :
2727 fprintf(stderr
, "shader%d - %s shader: "
2728 "%u inst, %u bundles, %u quadwords, "
2729 "%u registers, %u threads, %u loops, "
2730 "%u:%u spills:fills\n",
2732 gl_shader_stage_name(ctx
->stage
),
2733 nr_ins
, nr_bundles
, ctx
->quadword_count
,
2734 nr_registers
, nr_threads
,
2736 ctx
->spills
, ctx
->fills
);