2 * Copyright (C) 2020 Collabora Ltd.
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
23 * Authors (Collabora):
24 * Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
27 #include "main/mtypes.h"
28 #include "compiler/glsl/glsl_to_nir.h"
29 #include "compiler/nir_types.h"
30 #include "compiler/nir/nir_builder.h"
31 #include "util/u_debug.h"
33 #include "disassemble.h"
34 #include "bifrost_compile.h"
35 #include "bifrost_nir.h"
37 #include "bi_quirks.h"
40 static const struct debug_named_value debug_options
[] = {
41 {"msgs", BIFROST_DBG_MSGS
, "Print debug messages"},
42 {"shaders", BIFROST_DBG_SHADERS
, "Dump shaders in NIR and MIR"},
46 DEBUG_GET_ONCE_FLAGS_OPTION(bifrost_debug
, "BIFROST_MESA_DEBUG", debug_options
, 0)
48 int bifrost_debug
= 0;
50 #define DBG(fmt, ...) \
51 do { if (bifrost_debug & BIFROST_DBG_MSGS) \
52 fprintf(stderr, "%s:%d: "fmt, \
53 __FUNCTION__, __LINE__, ##__VA_ARGS__); } while (0)
55 static bi_block
*emit_cf_list(bi_context
*ctx
, struct exec_list
*list
);
56 static bi_instruction
*bi_emit_branch(bi_context
*ctx
);
57 static void bi_schedule_barrier(bi_context
*ctx
);
60 emit_jump(bi_context
*ctx
, nir_jump_instr
*instr
)
62 bi_instruction
*branch
= bi_emit_branch(ctx
);
64 switch (instr
->type
) {
66 branch
->branch_target
= ctx
->break_block
;
68 case nir_jump_continue
:
69 branch
->branch_target
= ctx
->continue_block
;
72 unreachable("Unhandled jump type");
75 pan_block_add_successor(&ctx
->current_block
->base
, &branch
->branch_target
->base
);
79 bi_load(enum bi_class T
, nir_intrinsic_instr
*instr
)
81 bi_instruction load
= {
83 .vector_channels
= instr
->num_components
,
84 .src
= { BIR_INDEX_CONSTANT
},
85 .src_types
= { nir_type_uint32
},
86 .constant
= { .u64
= nir_intrinsic_base(instr
) },
89 const nir_intrinsic_info
*info
= &nir_intrinsic_infos
[instr
->intrinsic
];
92 load
.dest
= pan_dest_index(&instr
->dest
);
94 if (info
->has_dest
&& info
->index_map
[NIR_INTRINSIC_TYPE
] > 0)
95 load
.dest_type
= nir_intrinsic_type(instr
);
97 nir_src
*offset
= nir_get_io_offset_src(instr
);
99 if (nir_src_is_const(*offset
))
100 load
.constant
.u64
+= nir_src_as_uint(*offset
);
102 load
.src
[0] = pan_src_index(offset
);
108 bi_emit_ld_vary(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
110 bi_instruction ins
= bi_load(BI_LOAD_VAR
, instr
);
111 ins
.load_vary
.interp_mode
= BIFROST_INTERP_DEFAULT
; /* TODO */
112 ins
.load_vary
.reuse
= false; /* TODO */
113 ins
.load_vary
.flat
= instr
->intrinsic
!= nir_intrinsic_load_interpolated_input
;
114 ins
.dest_type
= nir_type_float
| nir_dest_bit_size(instr
->dest
);
116 if (nir_src_is_const(*nir_get_io_offset_src(instr
))) {
117 /* Zero it out for direct */
118 ins
.src
[1] = BIR_INDEX_ZERO
;
120 /* R61 contains sample mask stuff, TODO RA XXX */
121 ins
.src
[1] = BIR_INDEX_REGISTER
| 61;
128 bi_emit_frag_out(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
130 if (!ctx
->emitted_atest
) {
131 bi_instruction ins
= {
134 BIR_INDEX_REGISTER
| 60 /* TODO: RA */,
135 pan_src_index(&instr
->src
[0])
139 nir_intrinsic_type(instr
)
143 { 3, 0 } /* swizzle out the alpha */
145 .dest
= BIR_INDEX_REGISTER
| 60 /* TODO: RA */,
146 .dest_type
= nir_type_uint32
,
150 bi_schedule_barrier(ctx
);
151 ctx
->emitted_atest
= true;
154 bi_instruction blend
= {
156 .blend_location
= nir_intrinsic_base(instr
),
158 pan_src_index(&instr
->src
[0]),
159 BIR_INDEX_REGISTER
| 60 /* Can this be arbitrary? */,
162 nir_intrinsic_type(instr
),
169 .dest
= BIR_INDEX_REGISTER
| 48 /* Looks like magic */,
170 .dest_type
= nir_type_uint32
,
174 assert(blend
.blend_location
< BIFROST_MAX_RENDER_TARGET_COUNT
);
175 assert(ctx
->blend_types
);
176 assert(blend
.src_types
[0]);
177 ctx
->blend_types
[blend
.blend_location
] = blend
.src_types
[0];
180 bi_schedule_barrier(ctx
);
183 static bi_instruction
184 bi_load_with_r61(enum bi_class T
, nir_intrinsic_instr
*instr
)
186 bi_instruction ld
= bi_load(T
, instr
);
187 ld
.src
[1] = BIR_INDEX_REGISTER
| 61; /* TODO: RA */
188 ld
.src
[2] = BIR_INDEX_REGISTER
| 62;
190 ld
.src_types
[1] = nir_type_uint32
;
191 ld
.src_types
[2] = nir_type_uint32
;
192 ld
.src_types
[3] = nir_intrinsic_type(instr
);
197 bi_emit_st_vary(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
199 bi_instruction address
= bi_load_with_r61(BI_LOAD_VAR_ADDRESS
, instr
);
200 address
.dest
= bi_make_temp(ctx
);
201 address
.dest_type
= nir_type_uint32
;
202 address
.vector_channels
= 3;
204 unsigned nr
= nir_intrinsic_src_components(instr
, 0);
205 assert(nir_intrinsic_write_mask(instr
) == ((1 << nr
) - 1));
207 bi_instruction st
= {
208 .type
= BI_STORE_VAR
,
210 pan_src_index(&instr
->src
[0]),
211 address
.dest
, address
.dest
, address
.dest
,
215 nir_type_uint32
, nir_type_uint32
, nir_type_uint32
,
221 .vector_channels
= nr
,
224 for (unsigned i
= 0; i
< nr
; ++i
)
225 st
.swizzle
[0][i
] = i
;
227 bi_emit(ctx
, address
);
232 bi_emit_ld_uniform(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
234 bi_instruction ld
= bi_load(BI_LOAD_UNIFORM
, instr
);
235 ld
.src
[1] = BIR_INDEX_ZERO
; /* TODO: UBO index */
237 /* TODO: Indirect access, since we need to multiply by the element
238 * size. I believe we can get this lowering automatically via
239 * nir_lower_io (as mul instructions) with the proper options, but this
241 assert(ld
.src
[0] & BIR_INDEX_CONSTANT
);
242 ld
.constant
.u64
+= ctx
->sysvals
.sysval_count
;
243 ld
.constant
.u64
*= 16;
249 bi_emit_sysval(bi_context
*ctx
, nir_instr
*instr
,
250 unsigned nr_components
, unsigned offset
)
254 /* Figure out which uniform this is */
255 int sysval
= panfrost_sysval_for_instr(instr
, &nir_dest
);
256 void *val
= _mesa_hash_table_u64_search(ctx
->sysvals
.sysval_to_id
, sysval
);
258 /* Sysvals are prefix uniforms */
259 unsigned uniform
= ((uintptr_t) val
) - 1;
261 /* Emit the read itself -- this is never indirect */
263 bi_instruction load
= {
264 .type
= BI_LOAD_UNIFORM
,
265 .vector_channels
= nr_components
,
266 .src
= { BIR_INDEX_CONSTANT
, BIR_INDEX_ZERO
},
267 .src_types
= { nir_type_uint32
, nir_type_uint32
},
268 .constant
= { (uniform
* 16) + offset
},
269 .dest
= pan_dest_index(&nir_dest
),
270 .dest_type
= nir_type_uint32
, /* TODO */
276 /* gl_FragCoord.xy = u16_to_f32(R59.xy) + 0.5
277 * gl_FragCoord.z = ld_vary(fragz)
278 * gl_FragCoord.w = ld_vary(fragw)
282 bi_emit_ld_frag_coord(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
284 /* Future proofing for mediump fragcoord at some point.. */
285 nir_alu_type T
= nir_type_float32
;
287 /* First, sketch a combine */
288 bi_instruction combine
= {
290 .dest_type
= nir_type_uint32
,
291 .dest
= pan_dest_index(&instr
->dest
),
292 .src_types
= { T
, T
, T
, T
},
295 /* Second, handle xy */
296 for (unsigned i
= 0; i
< 2; ++i
) {
297 bi_instruction conv
= {
300 .dest
= bi_make_temp(ctx
),
303 BIR_INDEX_REGISTER
| 59
305 .src_types
= { nir_type_uint16
},
309 bi_instruction add
= {
312 .dest
= bi_make_temp(ctx
),
313 .src
= { conv
.dest
, BIR_INDEX_CONSTANT
},
314 .src_types
= { T
, T
},
318 memcpy(&add
.constant
.u32
, &half
, sizeof(float));
323 combine
.src
[i
] = add
.dest
;
327 for (unsigned i
= 0; i
< 2; ++i
) {
328 bi_instruction load
= {
331 .interp_mode
= BIFROST_INTERP_DEFAULT
,
335 .vector_channels
= 1,
336 .dest_type
= nir_type_float32
,
337 .dest
= bi_make_temp(ctx
),
338 .src
= { BIR_INDEX_CONSTANT
, BIR_INDEX_ZERO
},
339 .src_types
= { nir_type_uint32
, nir_type_uint32
},
341 .u32
= (i
== 0) ? BIFROST_FRAGZ
: BIFROST_FRAGW
347 combine
.src
[i
+ 2] = load
.dest
;
350 /* Finally, emit the combine */
351 bi_emit(ctx
, combine
);
355 bi_emit_discard(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
358 bi_instruction discard
= {
361 .src_types
= { nir_type_uint32
, nir_type_uint32
},
362 .src
= { BIR_INDEX_ZERO
, BIR_INDEX_ZERO
},
365 bi_emit(ctx
, discard
);
369 bi_fuse_cond(bi_instruction
*csel
, nir_alu_src cond
,
370 unsigned *constants_left
, unsigned *constant_shift
,
371 unsigned comps
, bool float_only
);
374 bi_emit_discard_if(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
376 nir_src cond
= instr
->src
[0];
377 nir_alu_type T
= nir_type_uint
| nir_src_bit_size(cond
);
379 bi_instruction discard
= {
382 .src_types
= { T
, T
},
384 pan_src_index(&cond
),
389 /* Try to fuse in the condition */
390 unsigned constants_left
= 1, constant_shift
= 0;
392 /* Scalar so no swizzle */
397 /* May or may not succeed but we're optimistic */
398 bi_fuse_cond(&discard
, wrap
, &constants_left
, &constant_shift
, 1, true);
400 bi_emit(ctx
, discard
);
404 emit_intrinsic(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
407 switch (instr
->intrinsic
) {
408 case nir_intrinsic_load_barycentric_pixel
:
411 case nir_intrinsic_load_interpolated_input
:
412 case nir_intrinsic_load_input
:
413 if (ctx
->stage
== MESA_SHADER_FRAGMENT
)
414 bi_emit_ld_vary(ctx
, instr
);
415 else if (ctx
->stage
== MESA_SHADER_VERTEX
)
416 bi_emit(ctx
, bi_load_with_r61(BI_LOAD_ATTR
, instr
));
418 unreachable("Unsupported shader stage");
422 case nir_intrinsic_store_output
:
423 if (ctx
->stage
== MESA_SHADER_FRAGMENT
)
424 bi_emit_frag_out(ctx
, instr
);
425 else if (ctx
->stage
== MESA_SHADER_VERTEX
)
426 bi_emit_st_vary(ctx
, instr
);
428 unreachable("Unsupported shader stage");
431 case nir_intrinsic_load_uniform
:
432 bi_emit_ld_uniform(ctx
, instr
);
435 case nir_intrinsic_load_frag_coord
:
436 bi_emit_ld_frag_coord(ctx
, instr
);
439 case nir_intrinsic_discard
:
440 bi_emit_discard(ctx
, instr
);
443 case nir_intrinsic_discard_if
:
444 bi_emit_discard_if(ctx
, instr
);
447 case nir_intrinsic_load_ssbo_address
:
448 bi_emit_sysval(ctx
, &instr
->instr
, 1, 0);
451 case nir_intrinsic_get_buffer_size
:
452 bi_emit_sysval(ctx
, &instr
->instr
, 1, 8);
455 case nir_intrinsic_load_viewport_scale
:
456 case nir_intrinsic_load_viewport_offset
:
457 case nir_intrinsic_load_num_work_groups
:
458 case nir_intrinsic_load_sampler_lod_parameters_pan
:
459 bi_emit_sysval(ctx
, &instr
->instr
, 3, 0);
463 unreachable("Unknown intrinsic");
469 emit_load_const(bi_context
*ctx
, nir_load_const_instr
*instr
)
471 /* Make sure we've been lowered */
472 assert(instr
->def
.num_components
== 1);
474 bi_instruction move
= {
476 .dest
= pan_ssa_index(&instr
->def
),
477 .dest_type
= instr
->def
.bit_size
| nir_type_uint
,
482 instr
->def
.bit_size
| nir_type_uint
,
485 .u64
= nir_const_value_as_uint(instr
->value
[0], instr
->def
.bit_size
)
492 #define BI_CASE_CMP(op) \
498 bi_class_for_nir_alu(nir_op op
)
513 BI_CASE_CMP(nir_op_flt
)
514 BI_CASE_CMP(nir_op_fge
)
515 BI_CASE_CMP(nir_op_feq
)
516 BI_CASE_CMP(nir_op_fne
)
517 BI_CASE_CMP(nir_op_ilt
)
518 BI_CASE_CMP(nir_op_ige
)
519 BI_CASE_CMP(nir_op_ieq
)
520 BI_CASE_CMP(nir_op_ine
)
561 unreachable("should've been lowered");
582 case nir_op_fround_even
:
593 unreachable("Unknown ALU op");
597 /* Gets a bi_cond for a given NIR comparison opcode. In soft mode, it will
598 * return BI_COND_ALWAYS as a sentinel if it fails to do so (when used for
599 * optimizations). Otherwise it will bail (when used for primary code
603 bi_cond_for_nir(nir_op op
, bool soft
)
606 BI_CASE_CMP(nir_op_flt
)
607 BI_CASE_CMP(nir_op_ilt
)
610 BI_CASE_CMP(nir_op_fge
)
611 BI_CASE_CMP(nir_op_ige
)
614 BI_CASE_CMP(nir_op_feq
)
615 BI_CASE_CMP(nir_op_ieq
)
618 BI_CASE_CMP(nir_op_fne
)
619 BI_CASE_CMP(nir_op_ine
)
623 return BI_COND_ALWAYS
;
625 unreachable("Invalid compare");
630 bi_copy_src(bi_instruction
*alu
, nir_alu_instr
*instr
, unsigned i
, unsigned to
,
631 unsigned *constants_left
, unsigned *constant_shift
, unsigned comps
)
633 unsigned bits
= nir_src_bit_size(instr
->src
[i
].src
);
634 unsigned dest_bits
= nir_dest_bit_size(instr
->dest
.dest
);
636 alu
->src_types
[to
] = nir_op_infos
[instr
->op
].input_types
[i
]
639 /* Try to inline a constant */
640 if (nir_src_is_const(instr
->src
[i
].src
) && *constants_left
&& (dest_bits
== bits
)) {
641 uint64_t mask
= (1ull << dest_bits
) - 1;
642 uint64_t cons
= nir_src_as_uint(instr
->src
[i
].src
);
644 /* Try to reuse a constant */
645 for (unsigned i
= 0; i
< (*constant_shift
); i
+= dest_bits
) {
646 if (((alu
->constant
.u64
>> i
) & mask
) == cons
) {
647 alu
->src
[to
] = BIR_INDEX_CONSTANT
| i
;
652 alu
->constant
.u64
|= cons
<< *constant_shift
;
653 alu
->src
[to
] = BIR_INDEX_CONSTANT
| (*constant_shift
);
655 (*constant_shift
) += MAX2(dest_bits
, 32); /* lo/hi */
659 alu
->src
[to
] = pan_src_index(&instr
->src
[i
].src
);
661 /* Copy swizzle for all vectored components, replicating last component
662 * to fill undersized */
664 unsigned vec
= alu
->type
== BI_COMBINE
? 1 :
665 MAX2(1, 32 / dest_bits
);
667 for (unsigned j
= 0; j
< vec
; ++j
)
668 alu
->swizzle
[to
][j
] = instr
->src
[i
].swizzle
[MIN2(j
, comps
- 1)];
672 bi_fuse_cond(bi_instruction
*csel
, nir_alu_src cond
,
673 unsigned *constants_left
, unsigned *constant_shift
,
674 unsigned comps
, bool float_only
)
676 /* Bail for vector weirdness */
677 if (cond
.swizzle
[0] != 0)
680 if (!cond
.src
.is_ssa
)
683 nir_ssa_def
*def
= cond
.src
.ssa
;
684 nir_instr
*parent
= def
->parent_instr
;
686 if (parent
->type
!= nir_instr_type_alu
)
689 nir_alu_instr
*alu
= nir_instr_as_alu(parent
);
691 /* Try to match a condition */
692 enum bi_cond bcond
= bi_cond_for_nir(alu
->op
, true);
694 if (bcond
== BI_COND_ALWAYS
)
697 /* Some instructions can't compare ints */
699 nir_alu_type T
= nir_op_infos
[alu
->op
].input_types
[0];
700 T
= nir_alu_type_get_base_type(T
);
702 if (T
!= nir_type_float
)
706 /* We found one, let's fuse it in */
708 bi_copy_src(csel
, alu
, 0, 0, constants_left
, constant_shift
, comps
);
709 bi_copy_src(csel
, alu
, 1, 1, constants_left
, constant_shift
, comps
);
713 emit_alu(bi_context
*ctx
, nir_alu_instr
*instr
)
715 /* Try some special functions */
718 bi_emit_fexp2(ctx
, instr
);
721 bi_emit_flog2(ctx
, instr
);
727 /* Otherwise, assume it's something we can handle normally */
728 bi_instruction alu
= {
729 .type
= bi_class_for_nir_alu(instr
->op
),
730 .dest
= pan_dest_index(&instr
->dest
.dest
),
731 .dest_type
= nir_op_infos
[instr
->op
].output_type
732 | nir_dest_bit_size(instr
->dest
.dest
),
735 /* TODO: Implement lowering of special functions for older Bifrost */
736 assert((alu
.type
!= BI_SPECIAL
) || !(ctx
->quirks
& BIFROST_NO_FAST_OP
));
738 unsigned comps
= nir_dest_num_components(instr
->dest
.dest
);
740 if (alu
.type
!= BI_COMBINE
)
741 assert(comps
<= MAX2(1, 32 / comps
));
743 if (!instr
->dest
.dest
.is_ssa
) {
744 for (unsigned i
= 0; i
< comps
; ++i
)
745 assert(instr
->dest
.write_mask
);
748 /* We inline constants as we go. This tracks how many constants have
749 * been inlined, since we're limited to 64-bits of constants per
752 unsigned dest_bits
= nir_dest_bit_size(instr
->dest
.dest
);
753 unsigned constants_left
= (64 / dest_bits
);
754 unsigned constant_shift
= 0;
756 if (alu
.type
== BI_COMBINE
)
761 unsigned num_inputs
= nir_op_infos
[instr
->op
].num_inputs
;
762 assert(num_inputs
<= ARRAY_SIZE(alu
.src
));
764 for (unsigned i
= 0; i
< num_inputs
; ++i
) {
767 if (i
&& alu
.type
== BI_CSEL
)
770 bi_copy_src(&alu
, instr
, i
, i
+ f
, &constants_left
, &constant_shift
, comps
);
773 /* Op-specific fixup */
776 alu
.src
[2] = BIR_INDEX_ZERO
; /* FMA */
777 alu
.src_types
[2] = alu
.src_types
[1];
780 alu
.outmod
= BIFROST_SAT
; /* FMOV */
783 alu
.src_neg
[0] = true; /* FMOV */
786 alu
.src_abs
[0] = true; /* FMOV */
789 alu
.src_neg
[1] = true; /* FADD */
794 alu
.op
.minmax
= BI_MINMAX_MAX
; /* MINMAX */
797 alu
.op
.special
= BI_SPECIAL_FRCP
;
800 alu
.op
.special
= BI_SPECIAL_FRSQ
;
802 BI_CASE_CMP(nir_op_flt
)
803 BI_CASE_CMP(nir_op_ilt
)
804 BI_CASE_CMP(nir_op_fge
)
805 BI_CASE_CMP(nir_op_ige
)
806 BI_CASE_CMP(nir_op_feq
)
807 BI_CASE_CMP(nir_op_ieq
)
808 BI_CASE_CMP(nir_op_fne
)
809 BI_CASE_CMP(nir_op_ine
)
810 alu
.cond
= bi_cond_for_nir(instr
->op
, false);
812 case nir_op_fround_even
:
813 alu
.roundmode
= BIFROST_RTE
;
816 alu
.roundmode
= BIFROST_RTP
;
819 alu
.roundmode
= BIFROST_RTN
;
822 alu
.roundmode
= BIFROST_RTZ
;
825 alu
.op
.bitwise
= BI_BITWISE_AND
;
828 alu
.op
.bitwise
= BI_BITWISE_OR
;
831 alu
.op
.bitwise
= BI_BITWISE_XOR
;
837 if (alu
.type
== BI_CSEL
) {
838 /* Default to csel3 */
839 alu
.cond
= BI_COND_NE
;
840 alu
.src
[1] = BIR_INDEX_ZERO
;
841 alu
.src_types
[1] = alu
.src_types
[0];
843 /* TODO: Reenable cond fusing when we can split up registers
846 bi_fuse_cond(&alu
, instr
->src
[0],
847 &constants_left
, &constant_shift
, comps
, false);
849 } else if (alu
.type
== BI_BITWISE
) {
850 /* Implicit shift argument... at some point we should fold */
851 alu
.src
[2] = BIR_INDEX_ZERO
;
852 alu
.src_types
[2] = alu
.src_types
[1];
858 /* TEX_COMPACT instructions assume normal 2D f32 operation but are more
859 * space-efficient and with simpler RA/scheduling requirements*/
862 emit_tex_compact(bi_context
*ctx
, nir_tex_instr
*instr
)
864 bi_instruction tex
= {
866 .op
= { .texture
= BI_TEX_COMPACT
},
868 .texture_index
= instr
->texture_index
,
869 .sampler_index
= instr
->sampler_index
,
871 .dest
= pan_dest_index(&instr
->dest
),
872 .dest_type
= instr
->dest_type
,
873 .src_types
= { nir_type_float32
, nir_type_float32
},
877 for (unsigned i
= 0; i
< instr
->num_srcs
; ++i
) {
878 int index
= pan_src_index(&instr
->src
[i
].src
);
879 assert (instr
->src
[i
].src_type
== nir_tex_src_coord
);
883 tex
.swizzle
[0][0] = 0;
884 tex
.swizzle
[1][0] = 1;
891 emit_tex_full(bi_context
*ctx
, nir_tex_instr
*instr
)
897 emit_tex(bi_context
*ctx
, nir_tex_instr
*instr
)
899 nir_alu_type base
= nir_alu_type_get_base_type(instr
->dest_type
);
900 unsigned sz
= nir_dest_bit_size(instr
->dest
);
901 instr
->dest_type
= base
| sz
;
903 bool is_normal
= instr
->op
== nir_texop_tex
;
904 bool is_2d
= instr
->sampler_dim
== GLSL_SAMPLER_DIM_2D
||
905 instr
->sampler_dim
== GLSL_SAMPLER_DIM_EXTERNAL
;
906 bool is_f
= base
== nir_type_float
&& (sz
== 16 || sz
== 32);
908 bool is_compact
= is_normal
&& is_2d
&& is_f
&& !instr
->is_shadow
;
911 emit_tex_compact(ctx
, instr
);
913 emit_tex_full(ctx
, instr
);
917 emit_instr(bi_context
*ctx
, struct nir_instr
*instr
)
919 switch (instr
->type
) {
920 case nir_instr_type_load_const
:
921 emit_load_const(ctx
, nir_instr_as_load_const(instr
));
924 case nir_instr_type_intrinsic
:
925 emit_intrinsic(ctx
, nir_instr_as_intrinsic(instr
));
928 case nir_instr_type_alu
:
929 emit_alu(ctx
, nir_instr_as_alu(instr
));
932 case nir_instr_type_tex
:
933 emit_tex(ctx
, nir_instr_as_tex(instr
));
936 case nir_instr_type_jump
:
937 emit_jump(ctx
, nir_instr_as_jump(instr
));
940 case nir_instr_type_ssa_undef
:
945 unreachable("Unhandled instruction type");
953 create_empty_block(bi_context
*ctx
)
955 bi_block
*blk
= rzalloc(ctx
, bi_block
);
957 blk
->base
.predecessors
= _mesa_set_create(blk
,
959 _mesa_key_pointer_equal
);
961 blk
->base
.name
= ctx
->block_name_count
++;
967 bi_schedule_barrier(bi_context
*ctx
)
969 bi_block
*temp
= ctx
->after_block
;
970 ctx
->after_block
= create_empty_block(ctx
);
971 list_addtail(&ctx
->after_block
->base
.link
, &ctx
->blocks
);
972 list_inithead(&ctx
->after_block
->base
.instructions
);
973 pan_block_add_successor(&ctx
->current_block
->base
, &ctx
->after_block
->base
);
974 ctx
->current_block
= ctx
->after_block
;
975 ctx
->after_block
= temp
;
979 emit_block(bi_context
*ctx
, nir_block
*block
)
981 if (ctx
->after_block
) {
982 ctx
->current_block
= ctx
->after_block
;
983 ctx
->after_block
= NULL
;
985 ctx
->current_block
= create_empty_block(ctx
);
988 list_addtail(&ctx
->current_block
->base
.link
, &ctx
->blocks
);
989 list_inithead(&ctx
->current_block
->base
.instructions
);
991 nir_foreach_instr(instr
, block
) {
992 emit_instr(ctx
, instr
);
993 ++ctx
->instruction_count
;
996 return ctx
->current_block
;
999 /* Emits an unconditional branch to the end of the current block, returning a
1000 * pointer so the user can fill in details */
1002 static bi_instruction
*
1003 bi_emit_branch(bi_context
*ctx
)
1005 bi_instruction branch
= {
1007 .cond
= BI_COND_ALWAYS
1010 return bi_emit(ctx
, branch
);
1013 /* Sets a condition for a branch by examing the NIR condition. If we're
1014 * familiar with the condition, we unwrap it to fold it into the branch
1015 * instruction. Otherwise, we consume the condition directly. We
1016 * generally use 1-bit booleans which allows us to use small types for
1021 bi_set_branch_cond(bi_instruction
*branch
, nir_src
*cond
, bool invert
)
1023 /* TODO: Try to unwrap instead of always bailing */
1024 branch
->src
[0] = pan_src_index(cond
);
1025 branch
->src
[1] = BIR_INDEX_ZERO
;
1026 branch
->src_types
[0] = branch
->src_types
[1] = nir_type_uint16
;
1027 branch
->cond
= invert
? BI_COND_EQ
: BI_COND_NE
;
1031 emit_if(bi_context
*ctx
, nir_if
*nif
)
1033 bi_block
*before_block
= ctx
->current_block
;
1035 /* Speculatively emit the branch, but we can't fill it in until later */
1036 bi_instruction
*then_branch
= bi_emit_branch(ctx
);
1037 bi_set_branch_cond(then_branch
, &nif
->condition
, true);
1039 /* Emit the two subblocks. */
1040 bi_block
*then_block
= emit_cf_list(ctx
, &nif
->then_list
);
1041 bi_block
*end_then_block
= ctx
->current_block
;
1043 /* Emit a jump from the end of the then block to the end of the else */
1044 bi_instruction
*then_exit
= bi_emit_branch(ctx
);
1046 /* Emit second block, and check if it's empty */
1048 int count_in
= ctx
->instruction_count
;
1049 bi_block
*else_block
= emit_cf_list(ctx
, &nif
->else_list
);
1050 bi_block
*end_else_block
= ctx
->current_block
;
1051 ctx
->after_block
= create_empty_block(ctx
);
1053 /* Now that we have the subblocks emitted, fix up the branches */
1058 if (ctx
->instruction_count
== count_in
) {
1059 /* The else block is empty, so don't emit an exit jump */
1060 bi_remove_instruction(then_exit
);
1061 then_branch
->branch_target
= ctx
->after_block
;
1063 then_branch
->branch_target
= else_block
;
1064 then_exit
->branch_target
= ctx
->after_block
;
1065 pan_block_add_successor(&end_then_block
->base
, &then_exit
->branch_target
->base
);
1068 /* Wire up the successors */
1070 pan_block_add_successor(&before_block
->base
, &then_branch
->branch_target
->base
); /* then_branch */
1072 pan_block_add_successor(&before_block
->base
, &then_block
->base
); /* fallthrough */
1073 pan_block_add_successor(&end_else_block
->base
, &ctx
->after_block
->base
); /* fallthrough */
1077 emit_loop(bi_context
*ctx
, nir_loop
*nloop
)
1079 /* Remember where we are */
1080 bi_block
*start_block
= ctx
->current_block
;
1082 bi_block
*saved_break
= ctx
->break_block
;
1083 bi_block
*saved_continue
= ctx
->continue_block
;
1085 ctx
->continue_block
= create_empty_block(ctx
);
1086 ctx
->break_block
= create_empty_block(ctx
);
1087 ctx
->after_block
= ctx
->continue_block
;
1089 /* Emit the body itself */
1090 emit_cf_list(ctx
, &nloop
->body
);
1092 /* Branch back to loop back */
1093 bi_instruction
*br_back
= bi_emit_branch(ctx
);
1094 br_back
->branch_target
= ctx
->continue_block
;
1095 pan_block_add_successor(&start_block
->base
, &ctx
->continue_block
->base
);
1096 pan_block_add_successor(&ctx
->current_block
->base
, &ctx
->continue_block
->base
);
1098 ctx
->after_block
= ctx
->break_block
;
1101 ctx
->break_block
= saved_break
;
1102 ctx
->continue_block
= saved_continue
;
1107 emit_cf_list(bi_context
*ctx
, struct exec_list
*list
)
1109 bi_block
*start_block
= NULL
;
1111 foreach_list_typed(nir_cf_node
, node
, node
, list
) {
1112 switch (node
->type
) {
1113 case nir_cf_node_block
: {
1114 bi_block
*block
= emit_block(ctx
, nir_cf_node_as_block(node
));
1117 start_block
= block
;
1122 case nir_cf_node_if
:
1123 emit_if(ctx
, nir_cf_node_as_if(node
));
1126 case nir_cf_node_loop
:
1127 emit_loop(ctx
, nir_cf_node_as_loop(node
));
1131 unreachable("Unknown control flow");
1139 glsl_type_size(const struct glsl_type
*type
, bool bindless
)
1141 return glsl_count_attribute_slots(type
, false);
1145 bi_optimize_nir(nir_shader
*nir
)
1148 unsigned lower_flrp
= 16 | 32 | 64;
1150 NIR_PASS(progress
, nir
, nir_lower_regs_to_ssa
);
1151 NIR_PASS(progress
, nir
, nir_lower_idiv
, nir_lower_idiv_fast
);
1153 nir_lower_tex_options lower_tex_options
= {
1154 .lower_txs_lod
= true,
1156 .lower_tex_without_implicit_lod
= true,
1160 NIR_PASS(progress
, nir
, nir_lower_tex
, &lower_tex_options
);
1161 NIR_PASS(progress
, nir
, nir_lower_alu_to_scalar
, NULL
, NULL
);
1162 NIR_PASS(progress
, nir
, nir_lower_load_const_to_scalar
);
1167 NIR_PASS(progress
, nir
, nir_lower_var_copies
);
1168 NIR_PASS(progress
, nir
, nir_lower_vars_to_ssa
);
1170 NIR_PASS(progress
, nir
, nir_copy_prop
);
1171 NIR_PASS(progress
, nir
, nir_opt_remove_phis
);
1172 NIR_PASS(progress
, nir
, nir_opt_dce
);
1173 NIR_PASS(progress
, nir
, nir_opt_dead_cf
);
1174 NIR_PASS(progress
, nir
, nir_opt_cse
);
1175 NIR_PASS(progress
, nir
, nir_opt_peephole_select
, 64, false, true);
1176 NIR_PASS(progress
, nir
, nir_opt_algebraic
);
1177 NIR_PASS(progress
, nir
, nir_opt_constant_folding
);
1179 if (lower_flrp
!= 0) {
1180 bool lower_flrp_progress
= false;
1181 NIR_PASS(lower_flrp_progress
,
1185 false /* always_precise */,
1186 nir
->options
->lower_ffma
);
1187 if (lower_flrp_progress
) {
1188 NIR_PASS(progress
, nir
,
1189 nir_opt_constant_folding
);
1193 /* Nothing should rematerialize any flrps, so we only
1194 * need to do this lowering once.
1199 NIR_PASS(progress
, nir
, nir_opt_undef
);
1200 NIR_PASS(progress
, nir
, nir_opt_loop_unroll
,
1202 nir_var_shader_out
|
1203 nir_var_function_temp
);
1206 NIR_PASS(progress
, nir
, nir_opt_algebraic_late
);
1207 NIR_PASS(progress
, nir
, nir_lower_bool_to_int32
);
1208 NIR_PASS(progress
, nir
, bifrost_nir_lower_algebraic_late
);
1209 NIR_PASS(progress
, nir
, nir_lower_alu_to_scalar
, NULL
, NULL
);
1210 NIR_PASS(progress
, nir
, nir_lower_load_const_to_scalar
);
1212 /* Take us out of SSA */
1213 NIR_PASS(progress
, nir
, nir_lower_locals_to_regs
);
1214 NIR_PASS(progress
, nir
, nir_move_vec_src_uses_to_dest
);
1215 NIR_PASS(progress
, nir
, nir_convert_from_ssa
, true);
1219 bifrost_compile_shader_nir(nir_shader
*nir
, panfrost_program
*program
, unsigned product_id
)
1221 bifrost_debug
= debug_get_option_bifrost_debug();
1223 bi_context
*ctx
= rzalloc(NULL
, bi_context
);
1225 ctx
->stage
= nir
->info
.stage
;
1226 ctx
->quirks
= bifrost_get_quirks(product_id
);
1227 list_inithead(&ctx
->blocks
);
1229 /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
1230 * (so we don't accidentally duplicate the epilogue since mesa/st has
1231 * messed with our I/O quite a bit already) */
1233 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
1235 if (ctx
->stage
== MESA_SHADER_VERTEX
) {
1236 NIR_PASS_V(nir
, nir_lower_viewport_transform
);
1237 NIR_PASS_V(nir
, nir_lower_point_size
, 1.0, 1024.0);
1240 NIR_PASS_V(nir
, nir_split_var_copies
);
1241 NIR_PASS_V(nir
, nir_lower_global_vars_to_local
);
1242 NIR_PASS_V(nir
, nir_lower_var_copies
);
1243 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
1244 NIR_PASS_V(nir
, nir_lower_io
, nir_var_all
, glsl_type_size
, 0);
1245 NIR_PASS_V(nir
, nir_lower_ssbo
);
1246 NIR_PASS_V(nir
, nir_lower_mediump_outputs
);
1248 bi_optimize_nir(nir
);
1250 if (bifrost_debug
& BIFROST_DBG_SHADERS
) {
1251 nir_print_shader(nir
, stdout
);
1254 panfrost_nir_assign_sysvals(&ctx
->sysvals
, nir
);
1255 program
->sysval_count
= ctx
->sysvals
.sysval_count
;
1256 memcpy(program
->sysvals
, ctx
->sysvals
.sysvals
, sizeof(ctx
->sysvals
.sysvals
[0]) * ctx
->sysvals
.sysval_count
);
1257 ctx
->blend_types
= program
->blend_types
;
1259 nir_foreach_function(func
, nir
) {
1263 ctx
->impl
= func
->impl
;
1264 emit_cf_list(ctx
, &func
->impl
->body
);
1265 break; /* TODO: Multi-function shaders */
1268 bi_foreach_block(ctx
, _block
) {
1269 bi_block
*block
= (bi_block
*) _block
;
1270 bi_lower_combine(ctx
, block
);
1273 bool progress
= false;
1278 bi_foreach_block(ctx
, _block
) {
1279 bi_block
*block
= (bi_block
*) _block
;
1280 progress
|= bi_opt_dead_code_eliminate(ctx
, block
);
1284 if (bifrost_debug
& BIFROST_DBG_SHADERS
)
1285 bi_print_shader(ctx
, stdout
);
1287 bi_register_allocate(ctx
);
1288 if (bifrost_debug
& BIFROST_DBG_SHADERS
)
1289 bi_print_shader(ctx
, stdout
);
1290 bi_pack(ctx
, &program
->compiled
);
1292 if (bifrost_debug
& BIFROST_DBG_SHADERS
)
1293 disassemble_bifrost(stdout
, program
->compiled
.data
, program
->compiled
.size
, true);