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 emit_intrinsic(bi_context
*ctx
, nir_intrinsic_instr
*instr
)
358 switch (instr
->intrinsic
) {
359 case nir_intrinsic_load_barycentric_pixel
:
362 case nir_intrinsic_load_interpolated_input
:
363 case nir_intrinsic_load_input
:
364 if (ctx
->stage
== MESA_SHADER_FRAGMENT
)
365 bi_emit_ld_vary(ctx
, instr
);
366 else if (ctx
->stage
== MESA_SHADER_VERTEX
)
367 bi_emit(ctx
, bi_load_with_r61(BI_LOAD_ATTR
, instr
));
369 unreachable("Unsupported shader stage");
373 case nir_intrinsic_store_output
:
374 if (ctx
->stage
== MESA_SHADER_FRAGMENT
)
375 bi_emit_frag_out(ctx
, instr
);
376 else if (ctx
->stage
== MESA_SHADER_VERTEX
)
377 bi_emit_st_vary(ctx
, instr
);
379 unreachable("Unsupported shader stage");
382 case nir_intrinsic_load_uniform
:
383 bi_emit_ld_uniform(ctx
, instr
);
386 case nir_intrinsic_load_frag_coord
:
387 bi_emit_ld_frag_coord(ctx
, instr
);
390 case nir_intrinsic_load_ssbo_address
:
391 bi_emit_sysval(ctx
, &instr
->instr
, 1, 0);
394 case nir_intrinsic_get_buffer_size
:
395 bi_emit_sysval(ctx
, &instr
->instr
, 1, 8);
398 case nir_intrinsic_load_viewport_scale
:
399 case nir_intrinsic_load_viewport_offset
:
400 case nir_intrinsic_load_num_work_groups
:
401 case nir_intrinsic_load_sampler_lod_parameters_pan
:
402 bi_emit_sysval(ctx
, &instr
->instr
, 3, 0);
406 unreachable("Unknown intrinsic");
412 emit_load_const(bi_context
*ctx
, nir_load_const_instr
*instr
)
414 /* Make sure we've been lowered */
415 assert(instr
->def
.num_components
== 1);
417 bi_instruction move
= {
419 .dest
= pan_ssa_index(&instr
->def
),
420 .dest_type
= instr
->def
.bit_size
| nir_type_uint
,
425 instr
->def
.bit_size
| nir_type_uint
,
428 .u64
= nir_const_value_as_uint(instr
->value
[0], instr
->def
.bit_size
)
435 #define BI_CASE_CMP(op) \
441 bi_class_for_nir_alu(nir_op op
)
456 BI_CASE_CMP(nir_op_flt
)
457 BI_CASE_CMP(nir_op_fge
)
458 BI_CASE_CMP(nir_op_feq
)
459 BI_CASE_CMP(nir_op_fne
)
460 BI_CASE_CMP(nir_op_ilt
)
461 BI_CASE_CMP(nir_op_ige
)
462 BI_CASE_CMP(nir_op_ieq
)
463 BI_CASE_CMP(nir_op_ine
)
504 unreachable("should've been lowered");
525 case nir_op_fround_even
:
536 unreachable("Unknown ALU op");
540 /* Gets a bi_cond for a given NIR comparison opcode. In soft mode, it will
541 * return BI_COND_ALWAYS as a sentinel if it fails to do so (when used for
542 * optimizations). Otherwise it will bail (when used for primary code
546 bi_cond_for_nir(nir_op op
, bool soft
)
549 BI_CASE_CMP(nir_op_flt
)
550 BI_CASE_CMP(nir_op_ilt
)
553 BI_CASE_CMP(nir_op_fge
)
554 BI_CASE_CMP(nir_op_ige
)
557 BI_CASE_CMP(nir_op_feq
)
558 BI_CASE_CMP(nir_op_ieq
)
561 BI_CASE_CMP(nir_op_fne
)
562 BI_CASE_CMP(nir_op_ine
)
566 return BI_COND_ALWAYS
;
568 unreachable("Invalid compare");
573 bi_copy_src(bi_instruction
*alu
, nir_alu_instr
*instr
, unsigned i
, unsigned to
,
574 unsigned *constants_left
, unsigned *constant_shift
, unsigned comps
)
576 unsigned bits
= nir_src_bit_size(instr
->src
[i
].src
);
577 unsigned dest_bits
= nir_dest_bit_size(instr
->dest
.dest
);
579 alu
->src_types
[to
] = nir_op_infos
[instr
->op
].input_types
[i
]
582 /* Try to inline a constant */
583 if (nir_src_is_const(instr
->src
[i
].src
) && *constants_left
&& (dest_bits
== bits
)) {
584 uint64_t mask
= (1ull << dest_bits
) - 1;
585 uint64_t cons
= nir_src_as_uint(instr
->src
[i
].src
);
587 /* Try to reuse a constant */
588 for (unsigned i
= 0; i
< (*constant_shift
); i
+= dest_bits
) {
589 if (((alu
->constant
.u64
>> i
) & mask
) == cons
) {
590 alu
->src
[to
] = BIR_INDEX_CONSTANT
| i
;
595 alu
->constant
.u64
|= cons
<< *constant_shift
;
596 alu
->src
[to
] = BIR_INDEX_CONSTANT
| (*constant_shift
);
598 (*constant_shift
) += MAX2(dest_bits
, 32); /* lo/hi */
602 alu
->src
[to
] = pan_src_index(&instr
->src
[i
].src
);
604 /* Copy swizzle for all vectored components, replicating last component
605 * to fill undersized */
607 unsigned vec
= alu
->type
== BI_COMBINE
? 1 :
608 MAX2(1, 32 / dest_bits
);
610 for (unsigned j
= 0; j
< vec
; ++j
)
611 alu
->swizzle
[to
][j
] = instr
->src
[i
].swizzle
[MIN2(j
, comps
- 1)];
615 bi_fuse_csel_cond(bi_instruction
*csel
, nir_alu_src cond
,
616 unsigned *constants_left
, unsigned *constant_shift
, unsigned comps
)
618 /* Bail for vector weirdness */
619 if (cond
.swizzle
[0] != 0)
622 if (!cond
.src
.is_ssa
)
625 nir_ssa_def
*def
= cond
.src
.ssa
;
626 nir_instr
*parent
= def
->parent_instr
;
628 if (parent
->type
!= nir_instr_type_alu
)
631 nir_alu_instr
*alu
= nir_instr_as_alu(parent
);
633 /* Try to match a condition */
634 enum bi_cond bcond
= bi_cond_for_nir(alu
->op
, true);
636 if (bcond
== BI_COND_ALWAYS
)
639 /* We found one, let's fuse it in */
641 bi_copy_src(csel
, alu
, 0, 0, constants_left
, constant_shift
, comps
);
642 bi_copy_src(csel
, alu
, 1, 1, constants_left
, constant_shift
, comps
);
646 emit_alu(bi_context
*ctx
, nir_alu_instr
*instr
)
648 /* Try some special functions */
651 bi_emit_fexp2(ctx
, instr
);
654 bi_emit_flog2(ctx
, instr
);
660 /* Otherwise, assume it's something we can handle normally */
661 bi_instruction alu
= {
662 .type
= bi_class_for_nir_alu(instr
->op
),
663 .dest
= pan_dest_index(&instr
->dest
.dest
),
664 .dest_type
= nir_op_infos
[instr
->op
].output_type
665 | nir_dest_bit_size(instr
->dest
.dest
),
668 /* TODO: Implement lowering of special functions for older Bifrost */
669 assert((alu
.type
!= BI_SPECIAL
) || !(ctx
->quirks
& BIFROST_NO_FAST_OP
));
671 unsigned comps
= nir_dest_num_components(instr
->dest
.dest
);
673 if (alu
.type
!= BI_COMBINE
)
674 assert(comps
<= MAX2(1, 32 / comps
));
676 if (!instr
->dest
.dest
.is_ssa
) {
677 for (unsigned i
= 0; i
< comps
; ++i
)
678 assert(instr
->dest
.write_mask
);
681 /* We inline constants as we go. This tracks how many constants have
682 * been inlined, since we're limited to 64-bits of constants per
685 unsigned dest_bits
= nir_dest_bit_size(instr
->dest
.dest
);
686 unsigned constants_left
= (64 / dest_bits
);
687 unsigned constant_shift
= 0;
689 if (alu
.type
== BI_COMBINE
)
694 unsigned num_inputs
= nir_op_infos
[instr
->op
].num_inputs
;
695 assert(num_inputs
<= ARRAY_SIZE(alu
.src
));
697 for (unsigned i
= 0; i
< num_inputs
; ++i
) {
700 if (i
&& alu
.type
== BI_CSEL
)
703 bi_copy_src(&alu
, instr
, i
, i
+ f
, &constants_left
, &constant_shift
, comps
);
706 /* Op-specific fixup */
709 alu
.src
[2] = BIR_INDEX_ZERO
; /* FMA */
710 alu
.src_types
[2] = alu
.src_types
[1];
713 alu
.outmod
= BIFROST_SAT
; /* FMOV */
716 alu
.src_neg
[0] = true; /* FMOV */
719 alu
.src_abs
[0] = true; /* FMOV */
722 alu
.src_neg
[1] = true; /* FADD */
727 alu
.op
.minmax
= BI_MINMAX_MAX
; /* MINMAX */
730 alu
.op
.special
= BI_SPECIAL_FRCP
;
733 alu
.op
.special
= BI_SPECIAL_FRSQ
;
735 BI_CASE_CMP(nir_op_flt
)
736 BI_CASE_CMP(nir_op_ilt
)
737 BI_CASE_CMP(nir_op_fge
)
738 BI_CASE_CMP(nir_op_ige
)
739 BI_CASE_CMP(nir_op_feq
)
740 BI_CASE_CMP(nir_op_ieq
)
741 BI_CASE_CMP(nir_op_fne
)
742 BI_CASE_CMP(nir_op_ine
)
743 alu
.cond
= bi_cond_for_nir(instr
->op
, false);
745 case nir_op_fround_even
:
746 alu
.roundmode
= BIFROST_RTE
;
749 alu
.roundmode
= BIFROST_RTP
;
752 alu
.roundmode
= BIFROST_RTN
;
755 alu
.roundmode
= BIFROST_RTZ
;
758 alu
.op
.bitwise
= BI_BITWISE_AND
;
761 alu
.op
.bitwise
= BI_BITWISE_OR
;
764 alu
.op
.bitwise
= BI_BITWISE_XOR
;
770 if (alu
.type
== BI_CSEL
) {
771 /* Default to csel3 */
772 alu
.cond
= BI_COND_NE
;
773 alu
.src
[1] = BIR_INDEX_ZERO
;
774 alu
.src_types
[1] = alu
.src_types
[0];
776 /* TODO: Reenable cond fusing when we can split up registers
779 bi_fuse_csel_cond(&alu
, instr
->src
[0],
780 &constants_left
, &constant_shift
, comps
);
782 } else if (alu
.type
== BI_BITWISE
) {
783 /* Implicit shift argument... at some point we should fold */
784 alu
.src
[2] = BIR_INDEX_ZERO
;
785 alu
.src_types
[2] = alu
.src_types
[1];
791 /* TEX_COMPACT instructions assume normal 2D f32 operation but are more
792 * space-efficient and with simpler RA/scheduling requirements*/
795 emit_tex_compact(bi_context
*ctx
, nir_tex_instr
*instr
)
797 bi_instruction tex
= {
799 .op
= { .texture
= BI_TEX_COMPACT
},
801 .texture_index
= instr
->texture_index
,
802 .sampler_index
= instr
->sampler_index
,
804 .dest
= pan_dest_index(&instr
->dest
),
805 .dest_type
= instr
->dest_type
,
806 .src_types
= { nir_type_float32
, nir_type_float32
},
810 for (unsigned i
= 0; i
< instr
->num_srcs
; ++i
) {
811 int index
= pan_src_index(&instr
->src
[i
].src
);
812 assert (instr
->src
[i
].src_type
== nir_tex_src_coord
);
816 tex
.swizzle
[0][0] = 0;
817 tex
.swizzle
[1][0] = 1;
824 emit_tex_full(bi_context
*ctx
, nir_tex_instr
*instr
)
830 emit_tex(bi_context
*ctx
, nir_tex_instr
*instr
)
832 nir_alu_type base
= nir_alu_type_get_base_type(instr
->dest_type
);
833 unsigned sz
= nir_dest_bit_size(instr
->dest
);
834 instr
->dest_type
= base
| sz
;
836 bool is_normal
= instr
->op
== nir_texop_tex
;
837 bool is_2d
= instr
->sampler_dim
== GLSL_SAMPLER_DIM_2D
||
838 instr
->sampler_dim
== GLSL_SAMPLER_DIM_EXTERNAL
;
839 bool is_f
= base
== nir_type_float
&& (sz
== 16 || sz
== 32);
841 bool is_compact
= is_normal
&& is_2d
&& is_f
&& !instr
->is_shadow
;
844 emit_tex_compact(ctx
, instr
);
846 emit_tex_full(ctx
, instr
);
850 emit_instr(bi_context
*ctx
, struct nir_instr
*instr
)
852 switch (instr
->type
) {
853 case nir_instr_type_load_const
:
854 emit_load_const(ctx
, nir_instr_as_load_const(instr
));
857 case nir_instr_type_intrinsic
:
858 emit_intrinsic(ctx
, nir_instr_as_intrinsic(instr
));
861 case nir_instr_type_alu
:
862 emit_alu(ctx
, nir_instr_as_alu(instr
));
865 case nir_instr_type_tex
:
866 emit_tex(ctx
, nir_instr_as_tex(instr
));
869 case nir_instr_type_jump
:
870 emit_jump(ctx
, nir_instr_as_jump(instr
));
873 case nir_instr_type_ssa_undef
:
878 unreachable("Unhandled instruction type");
886 create_empty_block(bi_context
*ctx
)
888 bi_block
*blk
= rzalloc(ctx
, bi_block
);
890 blk
->base
.predecessors
= _mesa_set_create(blk
,
892 _mesa_key_pointer_equal
);
894 blk
->base
.name
= ctx
->block_name_count
++;
900 bi_schedule_barrier(bi_context
*ctx
)
902 bi_block
*temp
= ctx
->after_block
;
903 ctx
->after_block
= create_empty_block(ctx
);
904 list_addtail(&ctx
->after_block
->base
.link
, &ctx
->blocks
);
905 list_inithead(&ctx
->after_block
->base
.instructions
);
906 pan_block_add_successor(&ctx
->current_block
->base
, &ctx
->after_block
->base
);
907 ctx
->current_block
= ctx
->after_block
;
908 ctx
->after_block
= temp
;
912 emit_block(bi_context
*ctx
, nir_block
*block
)
914 if (ctx
->after_block
) {
915 ctx
->current_block
= ctx
->after_block
;
916 ctx
->after_block
= NULL
;
918 ctx
->current_block
= create_empty_block(ctx
);
921 list_addtail(&ctx
->current_block
->base
.link
, &ctx
->blocks
);
922 list_inithead(&ctx
->current_block
->base
.instructions
);
924 nir_foreach_instr(instr
, block
) {
925 emit_instr(ctx
, instr
);
926 ++ctx
->instruction_count
;
929 return ctx
->current_block
;
932 /* Emits an unconditional branch to the end of the current block, returning a
933 * pointer so the user can fill in details */
935 static bi_instruction
*
936 bi_emit_branch(bi_context
*ctx
)
938 bi_instruction branch
= {
941 .cond
= BI_COND_ALWAYS
945 return bi_emit(ctx
, branch
);
948 /* Sets a condition for a branch by examing the NIR condition. If we're
949 * familiar with the condition, we unwrap it to fold it into the branch
950 * instruction. Otherwise, we consume the condition directly. We
951 * generally use 1-bit booleans which allows us to use small types for
956 bi_set_branch_cond(bi_instruction
*branch
, nir_src
*cond
, bool invert
)
958 /* TODO: Try to unwrap instead of always bailing */
959 branch
->src
[0] = pan_src_index(cond
);
960 branch
->src
[1] = BIR_INDEX_ZERO
;
961 branch
->src_types
[0] = branch
->src_types
[1] = nir_type_uint16
;
962 branch
->branch
.cond
= invert
? BI_COND_EQ
: BI_COND_NE
;
966 emit_if(bi_context
*ctx
, nir_if
*nif
)
968 bi_block
*before_block
= ctx
->current_block
;
970 /* Speculatively emit the branch, but we can't fill it in until later */
971 bi_instruction
*then_branch
= bi_emit_branch(ctx
);
972 bi_set_branch_cond(then_branch
, &nif
->condition
, true);
974 /* Emit the two subblocks. */
975 bi_block
*then_block
= emit_cf_list(ctx
, &nif
->then_list
);
976 bi_block
*end_then_block
= ctx
->current_block
;
978 /* Emit a jump from the end of the then block to the end of the else */
979 bi_instruction
*then_exit
= bi_emit_branch(ctx
);
981 /* Emit second block, and check if it's empty */
983 int count_in
= ctx
->instruction_count
;
984 bi_block
*else_block
= emit_cf_list(ctx
, &nif
->else_list
);
985 bi_block
*end_else_block
= ctx
->current_block
;
986 ctx
->after_block
= create_empty_block(ctx
);
988 /* Now that we have the subblocks emitted, fix up the branches */
993 if (ctx
->instruction_count
== count_in
) {
994 /* The else block is empty, so don't emit an exit jump */
995 bi_remove_instruction(then_exit
);
996 then_branch
->branch
.target
= ctx
->after_block
;
998 then_branch
->branch
.target
= else_block
;
999 then_exit
->branch
.target
= ctx
->after_block
;
1000 pan_block_add_successor(&end_then_block
->base
, &then_exit
->branch
.target
->base
);
1003 /* Wire up the successors */
1005 pan_block_add_successor(&before_block
->base
, &then_branch
->branch
.target
->base
); /* then_branch */
1007 pan_block_add_successor(&before_block
->base
, &then_block
->base
); /* fallthrough */
1008 pan_block_add_successor(&end_else_block
->base
, &ctx
->after_block
->base
); /* fallthrough */
1012 emit_loop(bi_context
*ctx
, nir_loop
*nloop
)
1014 /* Remember where we are */
1015 bi_block
*start_block
= ctx
->current_block
;
1017 bi_block
*saved_break
= ctx
->break_block
;
1018 bi_block
*saved_continue
= ctx
->continue_block
;
1020 ctx
->continue_block
= create_empty_block(ctx
);
1021 ctx
->break_block
= create_empty_block(ctx
);
1022 ctx
->after_block
= ctx
->continue_block
;
1024 /* Emit the body itself */
1025 emit_cf_list(ctx
, &nloop
->body
);
1027 /* Branch back to loop back */
1028 bi_instruction
*br_back
= bi_emit_branch(ctx
);
1029 br_back
->branch
.target
= ctx
->continue_block
;
1030 pan_block_add_successor(&start_block
->base
, &ctx
->continue_block
->base
);
1031 pan_block_add_successor(&ctx
->current_block
->base
, &ctx
->continue_block
->base
);
1033 ctx
->after_block
= ctx
->break_block
;
1036 ctx
->break_block
= saved_break
;
1037 ctx
->continue_block
= saved_continue
;
1042 emit_cf_list(bi_context
*ctx
, struct exec_list
*list
)
1044 bi_block
*start_block
= NULL
;
1046 foreach_list_typed(nir_cf_node
, node
, node
, list
) {
1047 switch (node
->type
) {
1048 case nir_cf_node_block
: {
1049 bi_block
*block
= emit_block(ctx
, nir_cf_node_as_block(node
));
1052 start_block
= block
;
1057 case nir_cf_node_if
:
1058 emit_if(ctx
, nir_cf_node_as_if(node
));
1061 case nir_cf_node_loop
:
1062 emit_loop(ctx
, nir_cf_node_as_loop(node
));
1066 unreachable("Unknown control flow");
1074 glsl_type_size(const struct glsl_type
*type
, bool bindless
)
1076 return glsl_count_attribute_slots(type
, false);
1080 bi_optimize_nir(nir_shader
*nir
)
1083 unsigned lower_flrp
= 16 | 32 | 64;
1085 NIR_PASS(progress
, nir
, nir_lower_regs_to_ssa
);
1086 NIR_PASS(progress
, nir
, nir_lower_idiv
, nir_lower_idiv_fast
);
1088 nir_lower_tex_options lower_tex_options
= {
1089 .lower_txs_lod
= true,
1091 .lower_tex_without_implicit_lod
= true,
1095 NIR_PASS(progress
, nir
, nir_lower_tex
, &lower_tex_options
);
1096 NIR_PASS(progress
, nir
, nir_lower_alu_to_scalar
, NULL
, NULL
);
1097 NIR_PASS(progress
, nir
, nir_lower_load_const_to_scalar
);
1102 NIR_PASS(progress
, nir
, nir_lower_var_copies
);
1103 NIR_PASS(progress
, nir
, nir_lower_vars_to_ssa
);
1105 NIR_PASS(progress
, nir
, nir_copy_prop
);
1106 NIR_PASS(progress
, nir
, nir_opt_remove_phis
);
1107 NIR_PASS(progress
, nir
, nir_opt_dce
);
1108 NIR_PASS(progress
, nir
, nir_opt_dead_cf
);
1109 NIR_PASS(progress
, nir
, nir_opt_cse
);
1110 NIR_PASS(progress
, nir
, nir_opt_peephole_select
, 64, false, true);
1111 NIR_PASS(progress
, nir
, nir_opt_algebraic
);
1112 NIR_PASS(progress
, nir
, nir_opt_constant_folding
);
1114 if (lower_flrp
!= 0) {
1115 bool lower_flrp_progress
= false;
1116 NIR_PASS(lower_flrp_progress
,
1120 false /* always_precise */,
1121 nir
->options
->lower_ffma
);
1122 if (lower_flrp_progress
) {
1123 NIR_PASS(progress
, nir
,
1124 nir_opt_constant_folding
);
1128 /* Nothing should rematerialize any flrps, so we only
1129 * need to do this lowering once.
1134 NIR_PASS(progress
, nir
, nir_opt_undef
);
1135 NIR_PASS(progress
, nir
, nir_opt_loop_unroll
,
1137 nir_var_shader_out
|
1138 nir_var_function_temp
);
1141 NIR_PASS(progress
, nir
, nir_opt_algebraic_late
);
1142 NIR_PASS(progress
, nir
, nir_lower_bool_to_int32
);
1143 NIR_PASS(progress
, nir
, bifrost_nir_lower_algebraic_late
);
1144 NIR_PASS(progress
, nir
, nir_lower_alu_to_scalar
, NULL
, NULL
);
1145 NIR_PASS(progress
, nir
, nir_lower_load_const_to_scalar
);
1147 /* Take us out of SSA */
1148 NIR_PASS(progress
, nir
, nir_lower_locals_to_regs
);
1149 NIR_PASS(progress
, nir
, nir_move_vec_src_uses_to_dest
);
1150 NIR_PASS(progress
, nir
, nir_convert_from_ssa
, true);
1154 bifrost_compile_shader_nir(nir_shader
*nir
, panfrost_program
*program
, unsigned product_id
)
1156 bifrost_debug
= debug_get_option_bifrost_debug();
1158 bi_context
*ctx
= rzalloc(NULL
, bi_context
);
1160 ctx
->stage
= nir
->info
.stage
;
1161 ctx
->quirks
= bifrost_get_quirks(product_id
);
1162 list_inithead(&ctx
->blocks
);
1164 /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
1165 * (so we don't accidentally duplicate the epilogue since mesa/st has
1166 * messed with our I/O quite a bit already) */
1168 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
1170 if (ctx
->stage
== MESA_SHADER_VERTEX
) {
1171 NIR_PASS_V(nir
, nir_lower_viewport_transform
);
1172 NIR_PASS_V(nir
, nir_lower_point_size
, 1.0, 1024.0);
1175 NIR_PASS_V(nir
, nir_split_var_copies
);
1176 NIR_PASS_V(nir
, nir_lower_global_vars_to_local
);
1177 NIR_PASS_V(nir
, nir_lower_var_copies
);
1178 NIR_PASS_V(nir
, nir_lower_vars_to_ssa
);
1179 NIR_PASS_V(nir
, nir_lower_io
, nir_var_all
, glsl_type_size
, 0);
1180 NIR_PASS_V(nir
, nir_lower_ssbo
);
1181 NIR_PASS_V(nir
, nir_lower_mediump_outputs
);
1183 bi_optimize_nir(nir
);
1185 if (bifrost_debug
& BIFROST_DBG_SHADERS
) {
1186 nir_print_shader(nir
, stdout
);
1189 panfrost_nir_assign_sysvals(&ctx
->sysvals
, nir
);
1190 program
->sysval_count
= ctx
->sysvals
.sysval_count
;
1191 memcpy(program
->sysvals
, ctx
->sysvals
.sysvals
, sizeof(ctx
->sysvals
.sysvals
[0]) * ctx
->sysvals
.sysval_count
);
1192 ctx
->blend_types
= program
->blend_types
;
1194 nir_foreach_function(func
, nir
) {
1198 ctx
->impl
= func
->impl
;
1199 emit_cf_list(ctx
, &func
->impl
->body
);
1200 break; /* TODO: Multi-function shaders */
1203 bi_foreach_block(ctx
, _block
) {
1204 bi_block
*block
= (bi_block
*) _block
;
1205 bi_lower_combine(ctx
, block
);
1208 bool progress
= false;
1213 bi_foreach_block(ctx
, _block
) {
1214 bi_block
*block
= (bi_block
*) _block
;
1215 progress
|= bi_opt_dead_code_eliminate(ctx
, block
);
1219 if (bifrost_debug
& BIFROST_DBG_SHADERS
)
1220 bi_print_shader(ctx
, stdout
);
1222 bi_register_allocate(ctx
);
1223 if (bifrost_debug
& BIFROST_DBG_SHADERS
)
1224 bi_print_shader(ctx
, stdout
);
1225 bi_pack(ctx
, &program
->compiled
);
1227 if (bifrost_debug
& BIFROST_DBG_SHADERS
)
1228 disassemble_bifrost(stdout
, program
->compiled
.data
, program
->compiled
.size
, true);