projects / mesa.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
pan/bi: Passthrough second argument of F32_TO_F16
[mesa.git] / src / panfrost / bifrost / bifrost_compile.c
1 /*
2 * Copyright (C) 2020 Collabora Ltd.
3 *
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:
10 *
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
13 * Software.
14 *
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
21 * SOFTWARE.
22 *
23 * Authors (Collabora):
24 * Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
25 */
26
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"
32
33 #include "disassemble.h"
34 #include "bifrost_compile.h"
35 #include "bifrost_nir.h"
36 #include "compiler.h"
37 #include "bi_quirks.h"
38 #include "bi_print.h"
39
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"},
43 DEBUG_NAMED_VALUE_END
44 };
45
46 DEBUG_GET_ONCE_FLAGS_OPTION(bifrost_debug, "BIFROST_MESA_DEBUG", debug_options, 0)
47
48 int bifrost_debug = 0;
49
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)
54
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
58 static void
59 emit_jump(bi_context *ctx, nir_jump_instr *instr)
60 {
61 bi_instruction *branch = bi_emit_branch(ctx);
62
63 switch (instr->type) {
64 case nir_jump_break:
65 branch->branch_target = ctx->break_block;
66 break;
67 case nir_jump_continue:
68 branch->branch_target = ctx->continue_block;
69 break;
70 default:
71 unreachable("Unhandled jump type");
72 }
73
74 pan_block_add_successor(&ctx->current_block->base, &branch->branch_target->base);
75 }
76
77 static bi_instruction
78 bi_load(enum bi_class T, nir_intrinsic_instr *instr)
79 {
80 bi_instruction load = {
81 .type = T,
82 .vector_channels = instr->num_components,
83 .src = { BIR_INDEX_CONSTANT },
84 .src_types = { nir_type_uint32 },
85 .constant = { .u64 = nir_intrinsic_base(instr) },
86 };
87
88 const nir_intrinsic_info *info = &nir_intrinsic_infos[instr->intrinsic];
89
90 if (info->has_dest)
91 load.dest = pan_dest_index(&instr->dest);
92
93 if (info->has_dest && info->index_map[NIR_INTRINSIC_TYPE] > 0)
94 load.dest_type = nir_intrinsic_type(instr);
95
96 nir_src *offset = nir_get_io_offset_src(instr);
97
98 if (nir_src_is_const(*offset))
99 load.constant.u64 += nir_src_as_uint(*offset);
100 else
101 load.src[0] = pan_src_index(offset);
102
103 return load;
104 }
105
106 static void
107 bi_emit_ld_vary(bi_context *ctx, nir_intrinsic_instr *instr)
108 {
109 bi_instruction ins = bi_load(BI_LOAD_VAR, instr);
110 ins.load_vary.interp_mode = BIFROST_INTERP_DEFAULT; /* TODO */
111 ins.load_vary.reuse = false; /* TODO */
112 ins.load_vary.flat = instr->intrinsic != nir_intrinsic_load_interpolated_input;
113 ins.dest_type = nir_type_float | nir_dest_bit_size(instr->dest);
114
115 if (nir_src_is_const(*nir_get_io_offset_src(instr))) {
116 /* Zero it out for direct */
117 ins.src[1] = BIR_INDEX_ZERO;
118 } else {
119 /* R61 contains sample mask stuff, TODO RA XXX */
120 ins.src[1] = BIR_INDEX_REGISTER | 61;
121 }
122
123 bi_emit(ctx, ins);
124 }
125
126 static void
127 bi_emit_frag_out(bi_context *ctx, nir_intrinsic_instr *instr)
128 {
129 if (!ctx->emitted_atest) {
130 bi_instruction ins = {
131 .type = BI_ATEST,
132 .src = {
133 BIR_INDEX_REGISTER | 60 /* TODO: RA */,
134 pan_src_index(&instr->src[0])
135 },
136 .src_types = {
137 nir_type_uint32,
138 nir_intrinsic_type(instr)
139 },
140 .swizzle = {
141 { 0 },
142 { 3, 0 } /* swizzle out the alpha */
143 },
144 .dest = BIR_INDEX_REGISTER | 60 /* TODO: RA */,
145 .dest_type = nir_type_uint32,
146 };
147
148 bi_emit(ctx, ins);
149 ctx->emitted_atest = true;
150 }
151
152 bi_instruction blend = {
153 .type = BI_BLEND,
154 .blend_location = nir_intrinsic_base(instr),
155 .src = {
156 pan_src_index(&instr->src[0]),
157 BIR_INDEX_REGISTER | 60 /* Can this be arbitrary? */,
158 },
159 .src_types = {
160 nir_intrinsic_type(instr),
161 nir_type_uint32
162 },
163 .swizzle = {
164 { 0, 1, 2, 3 },
165 { 0 }
166 },
167 .dest = BIR_INDEX_REGISTER | 48 /* Looks like magic */,
168 .dest_type = nir_type_uint32,
169 .vector_channels = 4
170 };
171
172 assert(blend.blend_location < BIFROST_MAX_RENDER_TARGET_COUNT);
173 assert(ctx->blend_types);
174 assert(blend.src_types[0]);
175 ctx->blend_types[blend.blend_location] = blend.src_types[0];
176
177 bi_emit(ctx, blend);
178 }
179
180 static bi_instruction
181 bi_load_with_r61(enum bi_class T, nir_intrinsic_instr *instr)
182 {
183 bi_instruction ld = bi_load(T, instr);
184 ld.src[1] = BIR_INDEX_REGISTER | 61; /* TODO: RA */
185 ld.src[2] = BIR_INDEX_REGISTER | 62;
186 ld.src[3] = 0;
187 ld.src_types[1] = nir_type_uint32;
188 ld.src_types[2] = nir_type_uint32;
189 ld.src_types[3] = nir_intrinsic_type(instr);
190 return ld;
191 }
192
193 static void
194 bi_emit_st_vary(bi_context *ctx, nir_intrinsic_instr *instr)
195 {
196 bi_instruction address = bi_load_with_r61(BI_LOAD_VAR_ADDRESS, instr);
197 address.dest = bi_make_temp(ctx);
198 address.dest_type = nir_type_uint32;
199 address.vector_channels = 3;
200
201 unsigned nr = nir_intrinsic_src_components(instr, 0);
202 assert(nir_intrinsic_write_mask(instr) == ((1 << nr) - 1));
203
204 bi_instruction st = {
205 .type = BI_STORE_VAR,
206 .src = {
207 pan_src_index(&instr->src[0]),
208 address.dest, address.dest, address.dest,
209 },
210 .src_types = {
211 nir_type_uint32,
212 nir_type_uint32, nir_type_uint32, nir_type_uint32,
213 },
214 .swizzle = {
215 { 0 },
216 { 0 }, { 1 }, { 2}
217 },
218 .vector_channels = nr,
219 };
220
221 for (unsigned i = 0; i < nr; ++i)
222 st.swizzle[0][i] = i;
223
224 bi_emit(ctx, address);
225 bi_emit(ctx, st);
226 }
227
228 static void
229 bi_emit_ld_uniform(bi_context *ctx, nir_intrinsic_instr *instr)
230 {
231 bi_instruction ld = bi_load(BI_LOAD_UNIFORM, instr);
232 ld.src[1] = BIR_INDEX_ZERO; /* TODO: UBO index */
233
234 /* TODO: Indirect access, since we need to multiply by the element
235 * size. I believe we can get this lowering automatically via
236 * nir_lower_io (as mul instructions) with the proper options, but this
237 * is TODO */
238 assert(ld.src[0] & BIR_INDEX_CONSTANT);
239 ld.constant.u64 += ctx->sysvals.sysval_count;
240 ld.constant.u64 *= 16;
241
242 bi_emit(ctx, ld);
243 }
244
245 static void
246 bi_emit_sysval(bi_context *ctx, nir_instr *instr,
247 unsigned nr_components, unsigned offset)
248 {
249 nir_dest nir_dest;
250
251 /* Figure out which uniform this is */
252 int sysval = panfrost_sysval_for_instr(instr, &nir_dest);
253 void *val = _mesa_hash_table_u64_search(ctx->sysvals.sysval_to_id, sysval);
254
255 /* Sysvals are prefix uniforms */
256 unsigned uniform = ((uintptr_t) val) - 1;
257
258 /* Emit the read itself -- this is never indirect */
259
260 bi_instruction load = {
261 .type = BI_LOAD_UNIFORM,
262 .vector_channels = nr_components,
263 .src = { BIR_INDEX_CONSTANT, BIR_INDEX_ZERO },
264 .src_types = { nir_type_uint32, nir_type_uint32 },
265 .constant = { (uniform * 16) + offset },
266 .dest = pan_dest_index(&nir_dest),
267 .dest_type = nir_type_uint32, /* TODO */
268 };
269
270 bi_emit(ctx, load);
271 }
272
273 /* gl_FragCoord.xy = u16_to_f32(R59.xy) + 0.5
274 * gl_FragCoord.z = ld_vary(fragz)
275 * gl_FragCoord.w = ld_vary(fragw)
276 */
277
278 static void
279 bi_emit_ld_frag_coord(bi_context *ctx, nir_intrinsic_instr *instr)
280 {
281 /* Future proofing for mediump fragcoord at some point.. */
282 nir_alu_type T = nir_type_float32;
283
284 /* First, sketch a combine */
285 bi_instruction combine = {
286 .type = BI_COMBINE,
287 .dest_type = nir_type_uint32,
288 .dest = pan_dest_index(&instr->dest),
289 .src_types = { T, T, T, T },
290 };
291
292 /* Second, handle xy */
293 for (unsigned i = 0; i < 2; ++i) {
294 bi_instruction conv = {
295 .type = BI_CONVERT,
296 .dest_type = T,
297 .dest = bi_make_temp(ctx),
298 .src = {
299 /* TODO: RA XXX */
300 BIR_INDEX_REGISTER | 59
301 },
302 .src_types = { nir_type_uint16 },
303 .swizzle = { { i } }
304 };
305
306 bi_instruction add = {
307 .type = BI_ADD,
308 .dest_type = T,
309 .dest = bi_make_temp(ctx),
310 .src = { conv.dest, BIR_INDEX_CONSTANT },
311 .src_types = { T, T },
312 };
313
314 float half = 0.5;
315 memcpy(&add.constant.u32, &half, sizeof(float));
316
317 bi_emit(ctx, conv);
318 bi_emit(ctx, add);
319
320 combine.src[i] = add.dest;
321 }
322
323 /* Third, zw */
324 for (unsigned i = 0; i < 2; ++i) {
325 bi_instruction load = {
326 .type = BI_LOAD_VAR,
327 .load_vary = {
328 .interp_mode = BIFROST_INTERP_DEFAULT,
329 .reuse = false,
330 .flat = true
331 },
332 .vector_channels = 1,
333 .dest_type = nir_type_float32,
334 .dest = bi_make_temp(ctx),
335 .src = { BIR_INDEX_CONSTANT, BIR_INDEX_ZERO },
336 .src_types = { nir_type_uint32, nir_type_uint32 },
337 .constant = {
338 .u32 = (i == 0) ? BIFROST_FRAGZ : BIFROST_FRAGW
339 }
340 };
341
342 bi_emit(ctx, load);
343
344 combine.src[i + 2] = load.dest;
345 }
346
347 /* Finally, emit the combine */
348 bi_emit(ctx, combine);
349 }
350
351 static void
352 bi_emit_discard(bi_context *ctx, nir_intrinsic_instr *instr)
353 {
354 /* Goofy lowering */
355 bi_instruction discard = {
356 .type = BI_DISCARD,
357 .cond = BI_COND_EQ,
358 .src_types = { nir_type_uint32, nir_type_uint32 },
359 .src = { BIR_INDEX_ZERO, BIR_INDEX_ZERO },
360 };
361
362 bi_emit(ctx, discard);
363 }
364
365 static void
366 bi_fuse_cond(bi_instruction *csel, nir_alu_src cond,
367 unsigned *constants_left, unsigned *constant_shift,
368 unsigned comps, bool float_only);
369
370 static void
371 bi_emit_discard_if(bi_context *ctx, nir_intrinsic_instr *instr)
372 {
373 nir_src cond = instr->src[0];
374 nir_alu_type T = nir_type_uint | nir_src_bit_size(cond);
375
376 bi_instruction discard = {
377 .type = BI_DISCARD,
378 .cond = BI_COND_NE,
379 .src_types = { T, T },
380 .src = {
381 pan_src_index(&cond),
382 BIR_INDEX_ZERO
383 },
384 };
385
386 /* Try to fuse in the condition */
387 unsigned constants_left = 1, constant_shift = 0;
388
389 /* Scalar so no swizzle */
390 nir_alu_src wrap = {
391 .src = instr->src[0]
392 };
393
394 /* May or may not succeed but we're optimistic */
395 bi_fuse_cond(&discard, wrap, &constants_left, &constant_shift, 1, true);
396
397 bi_emit(ctx, discard);
398 }
399
400 static void
401 emit_intrinsic(bi_context *ctx, nir_intrinsic_instr *instr)
402 {
403
404 switch (instr->intrinsic) {
405 case nir_intrinsic_load_barycentric_pixel:
406 /* stub */
407 break;
408 case nir_intrinsic_load_interpolated_input:
409 case nir_intrinsic_load_input:
410 if (ctx->stage == MESA_SHADER_FRAGMENT)
411 bi_emit_ld_vary(ctx, instr);
412 else if (ctx->stage == MESA_SHADER_VERTEX)
413 bi_emit(ctx, bi_load_with_r61(BI_LOAD_ATTR, instr));
414 else {
415 unreachable("Unsupported shader stage");
416 }
417 break;
418
419 case nir_intrinsic_store_output:
420 if (ctx->stage == MESA_SHADER_FRAGMENT)
421 bi_emit_frag_out(ctx, instr);
422 else if (ctx->stage == MESA_SHADER_VERTEX)
423 bi_emit_st_vary(ctx, instr);
424 else
425 unreachable("Unsupported shader stage");
426 break;
427
428 case nir_intrinsic_load_uniform:
429 bi_emit_ld_uniform(ctx, instr);
430 break;
431
432 case nir_intrinsic_load_frag_coord:
433 bi_emit_ld_frag_coord(ctx, instr);
434 break;
435
436 case nir_intrinsic_discard:
437 bi_emit_discard(ctx, instr);
438 break;
439
440 case nir_intrinsic_discard_if:
441 bi_emit_discard_if(ctx, instr);
442 break;
443
444 case nir_intrinsic_load_ssbo_address:
445 bi_emit_sysval(ctx, &instr->instr, 1, 0);
446 break;
447
448 case nir_intrinsic_get_buffer_size:
449 bi_emit_sysval(ctx, &instr->instr, 1, 8);
450 break;
451
452 case nir_intrinsic_load_viewport_scale:
453 case nir_intrinsic_load_viewport_offset:
454 case nir_intrinsic_load_num_work_groups:
455 case nir_intrinsic_load_sampler_lod_parameters_pan:
456 bi_emit_sysval(ctx, &instr->instr, 3, 0);
457 break;
458
459 default:
460 unreachable("Unknown intrinsic");
461 break;
462 }
463 }
464
465 static void
466 emit_load_const(bi_context *ctx, nir_load_const_instr *instr)
467 {
468 /* Make sure we've been lowered */
469 assert(instr->def.num_components == 1);
470
471 bi_instruction move = {
472 .type = BI_MOV,
473 .dest = pan_ssa_index(&instr->def),
474 .dest_type = instr->def.bit_size | nir_type_uint,
475 .src = {
476 BIR_INDEX_CONSTANT
477 },
478 .src_types = {
479 instr->def.bit_size | nir_type_uint,
480 },
481 .constant = {
482 .u64 = nir_const_value_as_uint(instr->value[0], instr->def.bit_size)
483 }
484 };
485
486 bi_emit(ctx, move);
487 }
488
489 #define BI_CASE_CMP(op) \
490 case op##8: \
491 case op##16: \
492 case op##32: \
493
494 static enum bi_class
495 bi_class_for_nir_alu(nir_op op)
496 {
497 switch (op) {
498 case nir_op_fadd:
499 case nir_op_fsub:
500 return BI_ADD;
501
502 case nir_op_iadd:
503 case nir_op_isub:
504 return BI_IMATH;
505
506 case nir_op_iand:
507 case nir_op_ior:
508 case nir_op_ixor:
509 return BI_BITWISE;
510
511 BI_CASE_CMP(nir_op_flt)
512 BI_CASE_CMP(nir_op_fge)
513 BI_CASE_CMP(nir_op_feq)
514 BI_CASE_CMP(nir_op_fne)
515 BI_CASE_CMP(nir_op_ilt)
516 BI_CASE_CMP(nir_op_ige)
517 BI_CASE_CMP(nir_op_ieq)
518 BI_CASE_CMP(nir_op_ine)
519 return BI_CMP;
520
521 case nir_op_b8csel:
522 case nir_op_b16csel:
523 case nir_op_b32csel:
524 return BI_CSEL;
525
526 case nir_op_i2i8:
527 case nir_op_i2i16:
528 case nir_op_i2i32:
529 case nir_op_i2i64:
530 case nir_op_u2u8:
531 case nir_op_u2u16:
532 case nir_op_u2u32:
533 case nir_op_u2u64:
534 case nir_op_f2i16:
535 case nir_op_f2i32:
536 case nir_op_f2i64:
537 case nir_op_f2u16:
538 case nir_op_f2u32:
539 case nir_op_f2u64:
540 case nir_op_i2f16:
541 case nir_op_i2f32:
542 case nir_op_i2f64:
543 case nir_op_u2f16:
544 case nir_op_u2f32:
545 case nir_op_u2f64:
546 case nir_op_f2f16:
547 case nir_op_f2f32:
548 case nir_op_f2f64:
549 case nir_op_f2fmp:
550 return BI_CONVERT;
551
552 case nir_op_vec2:
553 case nir_op_vec3:
554 case nir_op_vec4:
555 return BI_COMBINE;
556
557 case nir_op_vec8:
558 case nir_op_vec16:
559 unreachable("should've been lowered");
560
561 case nir_op_ffma:
562 case nir_op_fmul:
563 return BI_FMA;
564
565 case nir_op_imin:
566 case nir_op_imax:
567 case nir_op_umin:
568 case nir_op_umax:
569 case nir_op_fmin:
570 case nir_op_fmax:
571 return BI_MINMAX;
572
573 case nir_op_fsat:
574 case nir_op_fneg:
575 case nir_op_fabs:
576 return BI_FMOV;
577 case nir_op_mov:
578 return BI_MOV;
579
580 case nir_op_fround_even:
581 case nir_op_fceil:
582 case nir_op_ffloor:
583 case nir_op_ftrunc:
584 return BI_ROUND;
585
586 case nir_op_frcp:
587 case nir_op_frsq:
588 return BI_SPECIAL;
589
590 default:
591 unreachable("Unknown ALU op");
592 }
593 }
594
595 /* Gets a bi_cond for a given NIR comparison opcode. In soft mode, it will
596 * return BI_COND_ALWAYS as a sentinel if it fails to do so (when used for
597 * optimizations). Otherwise it will bail (when used for primary code
598 * generation). */
599
600 static enum bi_cond
601 bi_cond_for_nir(nir_op op, bool soft)
602 {
603 switch (op) {
604 BI_CASE_CMP(nir_op_flt)
605 BI_CASE_CMP(nir_op_ilt)
606 return BI_COND_LT;
607
608 BI_CASE_CMP(nir_op_fge)
609 BI_CASE_CMP(nir_op_ige)
610 return BI_COND_GE;
611
612 BI_CASE_CMP(nir_op_feq)
613 BI_CASE_CMP(nir_op_ieq)
614 return BI_COND_EQ;
615
616 BI_CASE_CMP(nir_op_fne)
617 BI_CASE_CMP(nir_op_ine)
618 return BI_COND_NE;
619 default:
620 if (soft)
621 return BI_COND_ALWAYS;
622 else
623 unreachable("Invalid compare");
624 }
625 }
626
627 static void
628 bi_copy_src(bi_instruction *alu, nir_alu_instr *instr, unsigned i, unsigned to,
629 unsigned *constants_left, unsigned *constant_shift, unsigned comps)
630 {
631 unsigned bits = nir_src_bit_size(instr->src[i].src);
632 unsigned dest_bits = nir_dest_bit_size(instr->dest.dest);
633
634 alu->src_types[to] = nir_op_infos[instr->op].input_types[i]
635 | bits;
636
637 /* Try to inline a constant */
638 if (nir_src_is_const(instr->src[i].src) && *constants_left && (dest_bits == bits)) {
639 uint64_t mask = (1ull << dest_bits) - 1;
640 uint64_t cons = nir_src_as_uint(instr->src[i].src);
641
642 /* Try to reuse a constant */
643 for (unsigned i = 0; i < (*constant_shift); i += dest_bits) {
644 if (((alu->constant.u64 >> i) & mask) == cons) {
645 alu->src[to] = BIR_INDEX_CONSTANT | i;
646 return;
647 }
648 }
649
650 alu->constant.u64 |= cons << *constant_shift;
651 alu->src[to] = BIR_INDEX_CONSTANT | (*constant_shift);
652 --(*constants_left);
653 (*constant_shift) += MAX2(dest_bits, 32); /* lo/hi */
654 return;
655 }
656
657 alu->src[to] = pan_src_index(&instr->src[i].src);
658
659 /* Copy swizzle for all vectored components, replicating last component
660 * to fill undersized */
661
662 unsigned vec = alu->type == BI_COMBINE ? 1 :
663 MAX2(1, 32 / dest_bits);
664
665 for (unsigned j = 0; j < vec; ++j)
666 alu->swizzle[to][j] = instr->src[i].swizzle[MIN2(j, comps - 1)];
667 }
668
669 static void
670 bi_fuse_cond(bi_instruction *csel, nir_alu_src cond,
671 unsigned *constants_left, unsigned *constant_shift,
672 unsigned comps, bool float_only)
673 {
674 /* Bail for vector weirdness */
675 if (cond.swizzle[0] != 0)
676 return;
677
678 if (!cond.src.is_ssa)
679 return;
680
681 nir_ssa_def *def = cond.src.ssa;
682 nir_instr *parent = def->parent_instr;
683
684 if (parent->type != nir_instr_type_alu)
685 return;
686
687 nir_alu_instr *alu = nir_instr_as_alu(parent);
688
689 /* Try to match a condition */
690 enum bi_cond bcond = bi_cond_for_nir(alu->op, true);
691
692 if (bcond == BI_COND_ALWAYS)
693 return;
694
695 /* Some instructions can't compare ints */
696 if (float_only) {
697 nir_alu_type T = nir_op_infos[alu->op].input_types[0];
698 T = nir_alu_type_get_base_type(T);
699
700 if (T != nir_type_float)
701 return;
702 }
703
704 /* We found one, let's fuse it in */
705 csel->cond = bcond;
706 bi_copy_src(csel, alu, 0, 0, constants_left, constant_shift, comps);
707 bi_copy_src(csel, alu, 1, 1, constants_left, constant_shift, comps);
708 }
709
710 static void
711 emit_alu(bi_context *ctx, nir_alu_instr *instr)
712 {
713 /* Try some special functions */
714 switch (instr->op) {
715 case nir_op_fexp2:
716 bi_emit_fexp2(ctx, instr);
717 return;
718 case nir_op_flog2:
719 bi_emit_flog2(ctx, instr);
720 return;
721 default:
722 break;
723 }
724
725 /* Otherwise, assume it's something we can handle normally */
726 bi_instruction alu = {
727 .type = bi_class_for_nir_alu(instr->op),
728 .dest = pan_dest_index(&instr->dest.dest),
729 .dest_type = nir_op_infos[instr->op].output_type
730 | nir_dest_bit_size(instr->dest.dest),
731 };
732
733 /* TODO: Implement lowering of special functions for older Bifrost */
734 assert((alu.type != BI_SPECIAL) || !(ctx->quirks & BIFROST_NO_FAST_OP));
735
736 unsigned comps = nir_dest_num_components(instr->dest.dest);
737
738 if (alu.type != BI_COMBINE)
739 assert(comps <= MAX2(1, 32 / comps));
740
741 if (!instr->dest.dest.is_ssa) {
742 for (unsigned i = 0; i < comps; ++i)
743 assert(instr->dest.write_mask);
744 }
745
746 /* We inline constants as we go. This tracks how many constants have
747 * been inlined, since we're limited to 64-bits of constants per
748 * instruction */
749
750 unsigned dest_bits = nir_dest_bit_size(instr->dest.dest);
751 unsigned constants_left = (64 / dest_bits);
752 unsigned constant_shift = 0;
753
754 if (alu.type == BI_COMBINE)
755 constants_left = 0;
756
757 /* Copy sources */
758
759 unsigned num_inputs = nir_op_infos[instr->op].num_inputs;
760 assert(num_inputs <= ARRAY_SIZE(alu.src));
761
762 for (unsigned i = 0; i < num_inputs; ++i) {
763 unsigned f = 0;
764
765 if (i && alu.type == BI_CSEL)
766 f++;
767
768 bi_copy_src(&alu, instr, i, i + f, &constants_left, &constant_shift, comps);
769 }
770
771 /* Op-specific fixup */
772 switch (instr->op) {
773 case nir_op_fmul:
774 alu.src[2] = BIR_INDEX_ZERO; /* FMA */
775 alu.src_types[2] = alu.src_types[1];
776 break;
777 case nir_op_fsat:
778 alu.outmod = BIFROST_SAT; /* FMOV */
779 break;
780 case nir_op_fneg:
781 alu.src_neg[0] = true; /* FMOV */
782 break;
783 case nir_op_fabs:
784 alu.src_abs[0] = true; /* FMOV */
785 break;
786 case nir_op_fsub:
787 alu.src_neg[1] = true; /* FADD */
788 break;
789 case nir_op_iadd:
790 alu.op.imath = BI_IMATH_ADD;
791 break;
792 case nir_op_isub:
793 alu.op.imath = BI_IMATH_SUB;
794 break;
795 case nir_op_fmax:
796 case nir_op_imax:
797 case nir_op_umax:
798 alu.op.minmax = BI_MINMAX_MAX; /* MINMAX */
799 break;
800 case nir_op_frcp:
801 alu.op.special = BI_SPECIAL_FRCP;
802 break;
803 case nir_op_frsq:
804 alu.op.special = BI_SPECIAL_FRSQ;
805 break;
806 BI_CASE_CMP(nir_op_flt)
807 BI_CASE_CMP(nir_op_ilt)
808 BI_CASE_CMP(nir_op_fge)
809 BI_CASE_CMP(nir_op_ige)
810 BI_CASE_CMP(nir_op_feq)
811 BI_CASE_CMP(nir_op_ieq)
812 BI_CASE_CMP(nir_op_fne)
813 BI_CASE_CMP(nir_op_ine)
814 alu.cond = bi_cond_for_nir(instr->op, false);
815 break;
816 case nir_op_fround_even:
817 alu.roundmode = BIFROST_RTE;
818 break;
819 case nir_op_fceil:
820 alu.roundmode = BIFROST_RTP;
821 break;
822 case nir_op_ffloor:
823 alu.roundmode = BIFROST_RTN;
824 break;
825 case nir_op_ftrunc:
826 alu.roundmode = BIFROST_RTZ;
827 break;
828 case nir_op_iand:
829 alu.op.bitwise = BI_BITWISE_AND;
830 break;
831 case nir_op_ior:
832 alu.op.bitwise = BI_BITWISE_OR;
833 break;
834 case nir_op_ixor:
835 alu.op.bitwise = BI_BITWISE_XOR;
836 break;
837
838 case nir_op_f2f16:
839 case nir_op_i2i16:
840 case nir_op_u2u16: {
841 if (nir_src_bit_size(instr->src[0].src) != 32)
842 break;
843
844 /* Should have been const folded */
845 assert(!nir_src_is_const(instr->src[0].src));
846
847 alu.src_types[1] = alu.src_types[0];
848 alu.src[1] = alu.src[0];
849
850 unsigned last = nir_dest_num_components(instr->dest.dest) - 1;
851 assert(last <= 1);
852
853 alu.swizzle[1][0] = instr->src[0].swizzle[last];
854 break;
855 }
856
857 default:
858 break;
859 }
860
861 if (alu.type == BI_CSEL) {
862 /* Default to csel3 */
863 alu.cond = BI_COND_NE;
864 alu.src[1] = BIR_INDEX_ZERO;
865 alu.src_types[1] = alu.src_types[0];
866
867 /* TODO: Reenable cond fusing when we can split up registers
868 * when scheduling */
869 #if 0
870 bi_fuse_cond(&alu, instr->src[0],
871 &constants_left, &constant_shift, comps, false);
872 #endif
873 } else if (alu.type == BI_BITWISE) {
874 /* Implicit shift argument... at some point we should fold */
875 alu.src[2] = BIR_INDEX_ZERO;
876 alu.src_types[2] = alu.src_types[1];
877 }
878
879 bi_emit(ctx, alu);
880 }
881
882 /* TEX_COMPACT instructions assume normal 2D f32 operation but are more
883 * space-efficient and with simpler RA/scheduling requirements*/
884
885 static void
886 emit_tex_compact(bi_context *ctx, nir_tex_instr *instr)
887 {
888 bi_instruction tex = {
889 .type = BI_TEX,
890 .op = { .texture = BI_TEX_COMPACT },
891 .texture = {
892 .texture_index = instr->texture_index,
893 .sampler_index = instr->sampler_index,
894 },
895 .dest = pan_dest_index(&instr->dest),
896 .dest_type = instr->dest_type,
897 .src_types = { nir_type_float32, nir_type_float32 },
898 .vector_channels = 4
899 };
900
901 for (unsigned i = 0; i < instr->num_srcs; ++i) {
902 int index = pan_src_index(&instr->src[i].src);
903
904 /* We were checked ahead-of-time */
905 if (instr->src[i].src_type == nir_tex_src_lod)
906 continue;
907
908 assert (instr->src[i].src_type == nir_tex_src_coord);
909
910 tex.src[0] = index;
911 tex.src[1] = index;
912 tex.swizzle[0][0] = 0;
913 tex.swizzle[1][0] = 1;
914 }
915
916 bi_emit(ctx, tex);
917 }
918
919 static void
920 emit_tex_full(bi_context *ctx, nir_tex_instr *instr)
921 {
922 unreachable("stub");
923 }
924
925 /* Normal textures ops are tex for frag shaders and txl for vertex shaders with
926 * lod a constant 0. Anything else needs a full texture op. */
927
928 static bool
929 bi_is_normal_tex(gl_shader_stage stage, nir_tex_instr *instr)
930 {
931 if (stage == MESA_SHADER_FRAGMENT)
932 return instr->op == nir_texop_tex;
933
934 if (instr->op != nir_texop_txl)
935 return false;
936
937 for (unsigned i = 0; i < instr->num_srcs; ++i) {
938 if (instr->src[i].src_type != nir_tex_src_lod)
939 continue;
940
941 nir_src src = instr->src[i].src;
942
943 if (!nir_src_is_const(src))
944 continue;
945
946 if (nir_src_as_uint(src) != 0)
947 continue;
948 }
949
950 return true;
951 }
952
953 static void
954 emit_tex(bi_context *ctx, nir_tex_instr *instr)
955 {
956 nir_alu_type base = nir_alu_type_get_base_type(instr->dest_type);
957 unsigned sz = nir_dest_bit_size(instr->dest);
958 instr->dest_type = base | sz;
959
960 bool is_normal = bi_is_normal_tex(ctx->stage, instr);
961 bool is_2d = instr->sampler_dim == GLSL_SAMPLER_DIM_2D ||
962 instr->sampler_dim == GLSL_SAMPLER_DIM_EXTERNAL;
963 bool is_f = base == nir_type_float && (sz == 16 || sz == 32);
964
965 bool is_compact = is_normal && is_2d && is_f && !instr->is_shadow;
966
967 if (is_compact)
968 emit_tex_compact(ctx, instr);
969 else
970 emit_tex_full(ctx, instr);
971 }
972
973 static void
974 emit_instr(bi_context *ctx, struct nir_instr *instr)
975 {
976 switch (instr->type) {
977 case nir_instr_type_load_const:
978 emit_load_const(ctx, nir_instr_as_load_const(instr));
979 break;
980
981 case nir_instr_type_intrinsic:
982 emit_intrinsic(ctx, nir_instr_as_intrinsic(instr));
983 break;
984
985 case nir_instr_type_alu:
986 emit_alu(ctx, nir_instr_as_alu(instr));
987 break;
988
989 case nir_instr_type_tex:
990 emit_tex(ctx, nir_instr_as_tex(instr));
991 break;
992
993 case nir_instr_type_jump:
994 emit_jump(ctx, nir_instr_as_jump(instr));
995 break;
996
997 case nir_instr_type_ssa_undef:
998 /* Spurious */
999 break;
1000
1001 default:
1002 unreachable("Unhandled instruction type");
1003 break;
1004 }
1005 }
1006
1007
1008
1009 static bi_block *
1010 create_empty_block(bi_context *ctx)
1011 {
1012 bi_block *blk = rzalloc(ctx, bi_block);
1013
1014 blk->base.predecessors = _mesa_set_create(blk,
1015 _mesa_hash_pointer,
1016 _mesa_key_pointer_equal);
1017
1018 return blk;
1019 }
1020
1021 static bi_block *
1022 emit_block(bi_context *ctx, nir_block *block)
1023 {
1024 if (ctx->after_block) {
1025 ctx->current_block = ctx->after_block;
1026 ctx->after_block = NULL;
1027 } else {
1028 ctx->current_block = create_empty_block(ctx);
1029 }
1030
1031 list_addtail(&ctx->current_block->base.link, &ctx->blocks);
1032 list_inithead(&ctx->current_block->base.instructions);
1033
1034 nir_foreach_instr(instr, block) {
1035 emit_instr(ctx, instr);
1036 ++ctx->instruction_count;
1037 }
1038
1039 return ctx->current_block;
1040 }
1041
1042 /* Emits an unconditional branch to the end of the current block, returning a
1043 * pointer so the user can fill in details */
1044
1045 static bi_instruction *
1046 bi_emit_branch(bi_context *ctx)
1047 {
1048 bi_instruction branch = {
1049 .type = BI_BRANCH,
1050 .cond = BI_COND_ALWAYS
1051 };
1052
1053 return bi_emit(ctx, branch);
1054 }
1055
1056 /* Sets a condition for a branch by examing the NIR condition. If we're
1057 * familiar with the condition, we unwrap it to fold it into the branch
1058 * instruction. Otherwise, we consume the condition directly. We
1059 * generally use 1-bit booleans which allows us to use small types for
1060 * the conditions.
1061 */
1062
1063 static void
1064 bi_set_branch_cond(bi_instruction *branch, nir_src *cond, bool invert)
1065 {
1066 /* TODO: Try to unwrap instead of always bailing */
1067 branch->src[0] = pan_src_index(cond);
1068 branch->src[1] = BIR_INDEX_ZERO;
1069 branch->src_types[0] = branch->src_types[1] = nir_type_uint |
1070 nir_src_bit_size(*cond);
1071 branch->cond = invert ? BI_COND_EQ : BI_COND_NE;
1072 }
1073
1074 static void
1075 emit_if(bi_context *ctx, nir_if *nif)
1076 {
1077 bi_block *before_block = ctx->current_block;
1078
1079 /* Speculatively emit the branch, but we can't fill it in until later */
1080 bi_instruction *then_branch = bi_emit_branch(ctx);
1081 bi_set_branch_cond(then_branch, &nif->condition, true);
1082
1083 /* Emit the two subblocks. */
1084 bi_block *then_block = emit_cf_list(ctx, &nif->then_list);
1085 bi_block *end_then_block = ctx->current_block;
1086
1087 /* Emit a jump from the end of the then block to the end of the else */
1088 bi_instruction *then_exit = bi_emit_branch(ctx);
1089
1090 /* Emit second block, and check if it's empty */
1091
1092 int count_in = ctx->instruction_count;
1093 bi_block *else_block = emit_cf_list(ctx, &nif->else_list);
1094 bi_block *end_else_block = ctx->current_block;
1095 ctx->after_block = create_empty_block(ctx);
1096
1097 /* Now that we have the subblocks emitted, fix up the branches */
1098
1099 assert(then_block);
1100 assert(else_block);
1101
1102 if (ctx->instruction_count == count_in) {
1103 /* The else block is empty, so don't emit an exit jump */
1104 bi_remove_instruction(then_exit);
1105 then_branch->branch_target = ctx->after_block;
1106 pan_block_add_successor(&end_then_block->base, &ctx->after_block->base); /* fallthrough */
1107 } else {
1108 then_branch->branch_target = else_block;
1109 then_exit->branch_target = ctx->after_block;
1110 pan_block_add_successor(&end_then_block->base, &then_exit->branch_target->base);
1111 pan_block_add_successor(&end_else_block->base, &ctx->after_block->base); /* fallthrough */
1112 }
1113
1114 pan_block_add_successor(&before_block->base, &then_branch->branch_target->base); /* then_branch */
1115 pan_block_add_successor(&before_block->base, &then_block->base); /* fallthrough */
1116 }
1117
1118 static void
1119 emit_loop(bi_context *ctx, nir_loop *nloop)
1120 {
1121 /* Remember where we are */
1122 bi_block *start_block = ctx->current_block;
1123
1124 bi_block *saved_break = ctx->break_block;
1125 bi_block *saved_continue = ctx->continue_block;
1126
1127 ctx->continue_block = create_empty_block(ctx);
1128 ctx->break_block = create_empty_block(ctx);
1129 ctx->after_block = ctx->continue_block;
1130
1131 /* Emit the body itself */
1132 emit_cf_list(ctx, &nloop->body);
1133
1134 /* Branch back to loop back */
1135 bi_instruction *br_back = bi_emit_branch(ctx);
1136 br_back->branch_target = ctx->continue_block;
1137 pan_block_add_successor(&start_block->base, &ctx->continue_block->base);
1138 pan_block_add_successor(&ctx->current_block->base, &ctx->continue_block->base);
1139
1140 ctx->after_block = ctx->break_block;
1141
1142 /* Pop off */
1143 ctx->break_block = saved_break;
1144 ctx->continue_block = saved_continue;
1145 ++ctx->loop_count;
1146 }
1147
1148 static bi_block *
1149 emit_cf_list(bi_context *ctx, struct exec_list *list)
1150 {
1151 bi_block *start_block = NULL;
1152
1153 foreach_list_typed(nir_cf_node, node, node, list) {
1154 switch (node->type) {
1155 case nir_cf_node_block: {
1156 bi_block *block = emit_block(ctx, nir_cf_node_as_block(node));
1157
1158 if (!start_block)
1159 start_block = block;
1160
1161 break;
1162 }
1163
1164 case nir_cf_node_if:
1165 emit_if(ctx, nir_cf_node_as_if(node));
1166 break;
1167
1168 case nir_cf_node_loop:
1169 emit_loop(ctx, nir_cf_node_as_loop(node));
1170 break;
1171
1172 default:
1173 unreachable("Unknown control flow");
1174 }
1175 }
1176
1177 return start_block;
1178 }
1179
1180 static int
1181 glsl_type_size(const struct glsl_type *type, bool bindless)
1182 {
1183 return glsl_count_attribute_slots(type, false);
1184 }
1185
1186 static void
1187 bi_optimize_nir(nir_shader *nir)
1188 {
1189 bool progress;
1190 unsigned lower_flrp = 16 | 32 | 64;
1191
1192 NIR_PASS(progress, nir, nir_lower_regs_to_ssa);
1193 NIR_PASS(progress, nir, nir_lower_idiv, nir_lower_idiv_fast);
1194
1195 nir_lower_tex_options lower_tex_options = {
1196 .lower_txs_lod = true,
1197 .lower_txp = ~0,
1198 .lower_tex_without_implicit_lod = true,
1199 .lower_txd = true,
1200 };
1201
1202 NIR_PASS(progress, nir, nir_lower_tex, &lower_tex_options);
1203 NIR_PASS(progress, nir, nir_lower_alu_to_scalar, NULL, NULL);
1204 NIR_PASS(progress, nir, nir_lower_load_const_to_scalar);
1205
1206 do {
1207 progress = false;
1208
1209 NIR_PASS(progress, nir, nir_lower_var_copies);
1210 NIR_PASS(progress, nir, nir_lower_vars_to_ssa);
1211
1212 NIR_PASS(progress, nir, nir_copy_prop);
1213 NIR_PASS(progress, nir, nir_opt_remove_phis);
1214 NIR_PASS(progress, nir, nir_opt_dce);
1215 NIR_PASS(progress, nir, nir_opt_dead_cf);
1216 NIR_PASS(progress, nir, nir_opt_cse);
1217 NIR_PASS(progress, nir, nir_opt_peephole_select, 64, false, true);
1218 NIR_PASS(progress, nir, nir_opt_algebraic);
1219 NIR_PASS(progress, nir, nir_opt_constant_folding);
1220
1221 if (lower_flrp != 0) {
1222 bool lower_flrp_progress = false;
1223 NIR_PASS(lower_flrp_progress,
1224 nir,
1225 nir_lower_flrp,
1226 lower_flrp,
1227 false /* always_precise */,
1228 nir->options->lower_ffma);
1229 if (lower_flrp_progress) {
1230 NIR_PASS(progress, nir,
1231 nir_opt_constant_folding);
1232 progress = true;
1233 }
1234
1235 /* Nothing should rematerialize any flrps, so we only
1236 * need to do this lowering once.
1237 */
1238 lower_flrp = 0;
1239 }
1240
1241 NIR_PASS(progress, nir, nir_opt_undef);
1242 NIR_PASS(progress, nir, nir_opt_loop_unroll,
1243 nir_var_shader_in |
1244 nir_var_shader_out |
1245 nir_var_function_temp);
1246 } while (progress);
1247
1248 NIR_PASS(progress, nir, nir_opt_algebraic_late);
1249 NIR_PASS(progress, nir, nir_lower_bool_to_int32);
1250 NIR_PASS(progress, nir, bifrost_nir_lower_algebraic_late);
1251 NIR_PASS(progress, nir, nir_lower_alu_to_scalar, NULL, NULL);
1252 NIR_PASS(progress, nir, nir_lower_load_const_to_scalar);
1253
1254 /* Take us out of SSA */
1255 NIR_PASS(progress, nir, nir_lower_locals_to_regs);
1256 NIR_PASS(progress, nir, nir_move_vec_src_uses_to_dest);
1257 NIR_PASS(progress, nir, nir_convert_from_ssa, true);
1258 }
1259
1260 void
1261 bifrost_compile_shader_nir(nir_shader *nir, panfrost_program *program, unsigned product_id)
1262 {
1263 bifrost_debug = debug_get_option_bifrost_debug();
1264
1265 bi_context *ctx = rzalloc(NULL, bi_context);
1266 ctx->nir = nir;
1267 ctx->stage = nir->info.stage;
1268 ctx->quirks = bifrost_get_quirks(product_id);
1269 list_inithead(&ctx->blocks);
1270
1271 /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
1272 * (so we don't accidentally duplicate the epilogue since mesa/st has
1273 * messed with our I/O quite a bit already) */
1274
1275 NIR_PASS_V(nir, nir_lower_vars_to_ssa);
1276
1277 if (ctx->stage == MESA_SHADER_VERTEX) {
1278 NIR_PASS_V(nir, nir_lower_viewport_transform);
1279 NIR_PASS_V(nir, nir_lower_point_size, 1.0, 1024.0);
1280 }
1281
1282 NIR_PASS_V(nir, nir_split_var_copies);
1283 NIR_PASS_V(nir, nir_lower_global_vars_to_local);
1284 NIR_PASS_V(nir, nir_lower_var_copies);
1285 NIR_PASS_V(nir, nir_lower_vars_to_ssa);
1286 NIR_PASS_V(nir, nir_lower_io, nir_var_all, glsl_type_size, 0);
1287 NIR_PASS_V(nir, nir_lower_ssbo);
1288 NIR_PASS_V(nir, nir_lower_mediump_outputs);
1289
1290 bi_optimize_nir(nir);
1291
1292 if (bifrost_debug & BIFROST_DBG_SHADERS) {
1293 nir_print_shader(nir, stdout);
1294 }
1295
1296 panfrost_nir_assign_sysvals(&ctx->sysvals, nir);
1297 program->sysval_count = ctx->sysvals.sysval_count;
1298 memcpy(program->sysvals, ctx->sysvals.sysvals, sizeof(ctx->sysvals.sysvals[0]) * ctx->sysvals.sysval_count);
1299 ctx->blend_types = program->blend_types;
1300
1301 nir_foreach_function(func, nir) {
1302 if (!func->impl)
1303 continue;
1304
1305 ctx->impl = func->impl;
1306 emit_cf_list(ctx, &func->impl->body);
1307 break; /* TODO: Multi-function shaders */
1308 }
1309
1310 unsigned block_source_count = 0;
1311
1312 bi_foreach_block(ctx, _block) {
1313 bi_block *block = (bi_block *) _block;
1314
1315 /* Name blocks now that we're done emitting so the order is
1316 * consistent */
1317 block->base.name = block_source_count++;
1318
1319 bi_lower_combine(ctx, block);
1320 }
1321
1322 bool progress = false;
1323
1324 do {
1325 progress = false;
1326
1327 bi_foreach_block(ctx, _block) {
1328 bi_block *block = (bi_block *) _block;
1329 progress |= bi_opt_dead_code_eliminate(ctx, block);
1330 }
1331 } while(progress);
1332
1333 if (bifrost_debug & BIFROST_DBG_SHADERS)
1334 bi_print_shader(ctx, stdout);
1335 bi_schedule(ctx);
1336 bi_register_allocate(ctx);
1337 if (bifrost_debug & BIFROST_DBG_SHADERS)
1338 bi_print_shader(ctx, stdout);
1339 bi_pack(ctx, &program->compiled);
1340
1341 if (bifrost_debug & BIFROST_DBG_SHADERS)
1342 disassemble_bifrost(stdout, program->compiled.data, program->compiled.size, true);
1343
1344 ralloc_free(ctx);
1345 }