panfrost/midgard: Assert on unknown texture source
[mesa.git] / src / gallium / drivers / panfrost / midgard / midgard_compile.c
1 /*
2 * Copyright (C) 2018-2019 Alyssa Rosenzweig <alyssa@rosenzweig.io>
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
24 #include <sys/types.h>
25 #include <sys/stat.h>
26 #include <sys/mman.h>
27 #include <fcntl.h>
28 #include <stdint.h>
29 #include <stdlib.h>
30 #include <stdio.h>
31 #include <err.h>
32
33 #include "main/mtypes.h"
34 #include "compiler/glsl/glsl_to_nir.h"
35 #include "compiler/nir_types.h"
36 #include "main/imports.h"
37 #include "compiler/nir/nir_builder.h"
38 #include "util/half_float.h"
39 #include "util/u_debug.h"
40 #include "util/u_dynarray.h"
41 #include "util/list.h"
42 #include "main/mtypes.h"
43
44 #include "midgard.h"
45 #include "midgard_nir.h"
46 #include "midgard_compile.h"
47 #include "midgard_ops.h"
48 #include "helpers.h"
49 #include "compiler.h"
50
51 #include "disassemble.h"
52
53 static const struct debug_named_value debug_options[] = {
54 {"msgs", MIDGARD_DBG_MSGS, "Print debug messages"},
55 {"shaders", MIDGARD_DBG_SHADERS, "Dump shaders in NIR and MIR"},
56 DEBUG_NAMED_VALUE_END
57 };
58
59 DEBUG_GET_ONCE_FLAGS_OPTION(midgard_debug, "MIDGARD_MESA_DEBUG", debug_options, 0)
60
61 int midgard_debug = 0;
62
63 #define DBG(fmt, ...) \
64 do { if (midgard_debug & MIDGARD_DBG_MSGS) \
65 fprintf(stderr, "%s:%d: "fmt, \
66 __FUNCTION__, __LINE__, ##__VA_ARGS__); } while (0)
67
68 static bool
69 midgard_is_branch_unit(unsigned unit)
70 {
71 return (unit == ALU_ENAB_BRANCH) || (unit == ALU_ENAB_BR_COMPACT);
72 }
73
74 static void
75 midgard_block_add_successor(midgard_block *block, midgard_block *successor)
76 {
77 block->successors[block->nr_successors++] = successor;
78 assert(block->nr_successors <= ARRAY_SIZE(block->successors));
79 }
80
81 /* Helpers to generate midgard_instruction's using macro magic, since every
82 * driver seems to do it that way */
83
84 #define EMIT(op, ...) emit_mir_instruction(ctx, v_##op(__VA_ARGS__));
85 #define SWIZZLE_XYZW SWIZZLE(COMPONENT_X, COMPONENT_Y, COMPONENT_Z, COMPONENT_W)
86 #define SWIZZLE_XYXX SWIZZLE(COMPONENT_X, COMPONENT_Y, COMPONENT_X, COMPONENT_X)
87 #define SWIZZLE_XXXX SWIZZLE(COMPONENT_X, COMPONENT_X, COMPONENT_X, COMPONENT_X)
88 #define SWIZZLE_WWWW SWIZZLE(COMPONENT_W, COMPONENT_W, COMPONENT_W, COMPONENT_W)
89
90 #define M_LOAD_STORE(name, rname, uname) \
91 static midgard_instruction m_##name(unsigned ssa, unsigned address) { \
92 midgard_instruction i = { \
93 .type = TAG_LOAD_STORE_4, \
94 .ssa_args = { \
95 .rname = ssa, \
96 .uname = -1, \
97 .src1 = -1 \
98 }, \
99 .load_store = { \
100 .op = midgard_op_##name, \
101 .mask = 0xF, \
102 .swizzle = SWIZZLE_XYZW, \
103 .address = address \
104 } \
105 }; \
106 \
107 return i; \
108 }
109
110 #define M_LOAD(name) M_LOAD_STORE(name, dest, src0)
111 #define M_STORE(name) M_LOAD_STORE(name, src0, dest)
112
113 /* Inputs a NIR ALU source, with modifiers attached if necessary, and outputs
114 * the corresponding Midgard source */
115
116 static midgard_vector_alu_src
117 vector_alu_modifiers(nir_alu_src *src, bool is_int)
118 {
119 if (!src) return blank_alu_src;
120
121 midgard_vector_alu_src alu_src = {
122 .rep_low = 0,
123 .rep_high = 0,
124 .half = 0, /* TODO */
125 .swizzle = SWIZZLE_FROM_ARRAY(src->swizzle)
126 };
127
128 if (is_int) {
129 /* TODO: sign-extend/zero-extend */
130 alu_src.mod = midgard_int_normal;
131
132 /* These should have been lowered away */
133 assert(!(src->abs || src->negate));
134 } else {
135 alu_src.mod = (src->abs << 0) | (src->negate << 1);
136 }
137
138 return alu_src;
139 }
140
141 /* load/store instructions have both 32-bit and 16-bit variants, depending on
142 * whether we are using vectors composed of highp or mediump. At the moment, we
143 * don't support half-floats -- this requires changes in other parts of the
144 * compiler -- therefore the 16-bit versions are commented out. */
145
146 //M_LOAD(ld_attr_16);
147 M_LOAD(ld_attr_32);
148 //M_LOAD(ld_vary_16);
149 M_LOAD(ld_vary_32);
150 //M_LOAD(ld_uniform_16);
151 M_LOAD(ld_uniform_32);
152 M_LOAD(ld_color_buffer_8);
153 //M_STORE(st_vary_16);
154 M_STORE(st_vary_32);
155 M_STORE(st_cubemap_coords);
156
157 static midgard_instruction
158 v_alu_br_compact_cond(midgard_jmp_writeout_op op, unsigned tag, signed offset, unsigned cond)
159 {
160 midgard_branch_cond branch = {
161 .op = op,
162 .dest_tag = tag,
163 .offset = offset,
164 .cond = cond
165 };
166
167 uint16_t compact;
168 memcpy(&compact, &branch, sizeof(branch));
169
170 midgard_instruction ins = {
171 .type = TAG_ALU_4,
172 .unit = ALU_ENAB_BR_COMPACT,
173 .prepacked_branch = true,
174 .compact_branch = true,
175 .br_compact = compact
176 };
177
178 if (op == midgard_jmp_writeout_op_writeout)
179 ins.writeout = true;
180
181 return ins;
182 }
183
184 static midgard_instruction
185 v_branch(bool conditional, bool invert)
186 {
187 midgard_instruction ins = {
188 .type = TAG_ALU_4,
189 .unit = ALU_ENAB_BRANCH,
190 .compact_branch = true,
191 .branch = {
192 .conditional = conditional,
193 .invert_conditional = invert
194 }
195 };
196
197 return ins;
198 }
199
200 static midgard_branch_extended
201 midgard_create_branch_extended( midgard_condition cond,
202 midgard_jmp_writeout_op op,
203 unsigned dest_tag,
204 signed quadword_offset)
205 {
206 /* For unclear reasons, the condition code is repeated 8 times */
207 uint16_t duplicated_cond =
208 (cond << 14) |
209 (cond << 12) |
210 (cond << 10) |
211 (cond << 8) |
212 (cond << 6) |
213 (cond << 4) |
214 (cond << 2) |
215 (cond << 0);
216
217 midgard_branch_extended branch = {
218 .op = op,
219 .dest_tag = dest_tag,
220 .offset = quadword_offset,
221 .cond = duplicated_cond
222 };
223
224 return branch;
225 }
226
227 static void
228 attach_constants(compiler_context *ctx, midgard_instruction *ins, void *constants, int name)
229 {
230 ins->has_constants = true;
231 memcpy(&ins->constants, constants, 16);
232 }
233
234 static int
235 glsl_type_size(const struct glsl_type *type, bool bindless)
236 {
237 return glsl_count_attribute_slots(type, false);
238 }
239
240 /* Lower fdot2 to a vector multiplication followed by channel addition */
241 static void
242 midgard_nir_lower_fdot2_body(nir_builder *b, nir_alu_instr *alu)
243 {
244 if (alu->op != nir_op_fdot2)
245 return;
246
247 b->cursor = nir_before_instr(&alu->instr);
248
249 nir_ssa_def *src0 = nir_ssa_for_alu_src(b, alu, 0);
250 nir_ssa_def *src1 = nir_ssa_for_alu_src(b, alu, 1);
251
252 nir_ssa_def *product = nir_fmul(b, src0, src1);
253
254 nir_ssa_def *sum = nir_fadd(b,
255 nir_channel(b, product, 0),
256 nir_channel(b, product, 1));
257
258 /* Replace the fdot2 with this sum */
259 nir_ssa_def_rewrite_uses(&alu->dest.dest.ssa, nir_src_for_ssa(sum));
260 }
261
262 static int
263 midgard_nir_sysval_for_intrinsic(nir_intrinsic_instr *instr)
264 {
265 switch (instr->intrinsic) {
266 case nir_intrinsic_load_viewport_scale:
267 return PAN_SYSVAL_VIEWPORT_SCALE;
268 case nir_intrinsic_load_viewport_offset:
269 return PAN_SYSVAL_VIEWPORT_OFFSET;
270 default:
271 return -1;
272 }
273 }
274
275 static void
276 midgard_nir_assign_sysval_body(compiler_context *ctx, nir_instr *instr)
277 {
278 int sysval = -1;
279
280 if (instr->type == nir_instr_type_intrinsic) {
281 nir_intrinsic_instr *intr = nir_instr_as_intrinsic(instr);
282 sysval = midgard_nir_sysval_for_intrinsic(intr);
283 }
284
285 if (sysval < 0)
286 return;
287
288 /* We have a sysval load; check if it's already been assigned */
289
290 if (_mesa_hash_table_u64_search(ctx->sysval_to_id, sysval))
291 return;
292
293 /* It hasn't -- so assign it now! */
294
295 unsigned id = ctx->sysval_count++;
296 _mesa_hash_table_u64_insert(ctx->sysval_to_id, sysval, (void *) ((uintptr_t) id + 1));
297 ctx->sysvals[id] = sysval;
298 }
299
300 static void
301 midgard_nir_assign_sysvals(compiler_context *ctx, nir_shader *shader)
302 {
303 ctx->sysval_count = 0;
304
305 nir_foreach_function(function, shader) {
306 if (!function->impl) continue;
307
308 nir_foreach_block(block, function->impl) {
309 nir_foreach_instr_safe(instr, block) {
310 midgard_nir_assign_sysval_body(ctx, instr);
311 }
312 }
313 }
314 }
315
316 static bool
317 midgard_nir_lower_fdot2(nir_shader *shader)
318 {
319 bool progress = false;
320
321 nir_foreach_function(function, shader) {
322 if (!function->impl) continue;
323
324 nir_builder _b;
325 nir_builder *b = &_b;
326 nir_builder_init(b, function->impl);
327
328 nir_foreach_block(block, function->impl) {
329 nir_foreach_instr_safe(instr, block) {
330 if (instr->type != nir_instr_type_alu) continue;
331
332 nir_alu_instr *alu = nir_instr_as_alu(instr);
333 midgard_nir_lower_fdot2_body(b, alu);
334
335 progress |= true;
336 }
337 }
338
339 nir_metadata_preserve(function->impl, nir_metadata_block_index | nir_metadata_dominance);
340
341 }
342
343 return progress;
344 }
345
346 static void
347 optimise_nir(nir_shader *nir)
348 {
349 bool progress;
350 unsigned lower_flrp =
351 (nir->options->lower_flrp16 ? 16 : 0) |
352 (nir->options->lower_flrp32 ? 32 : 0) |
353 (nir->options->lower_flrp64 ? 64 : 0);
354
355 NIR_PASS(progress, nir, nir_lower_regs_to_ssa);
356 NIR_PASS(progress, nir, midgard_nir_lower_fdot2);
357 NIR_PASS(progress, nir, nir_lower_idiv);
358
359 nir_lower_tex_options lower_tex_options = {
360 .lower_rect = true,
361 .lower_txp = ~0
362 };
363
364 NIR_PASS(progress, nir, nir_lower_tex, &lower_tex_options);
365
366 do {
367 progress = false;
368
369 NIR_PASS(progress, nir, nir_lower_var_copies);
370 NIR_PASS(progress, nir, nir_lower_vars_to_ssa);
371
372 NIR_PASS(progress, nir, nir_copy_prop);
373 NIR_PASS(progress, nir, nir_opt_dce);
374 NIR_PASS(progress, nir, nir_opt_dead_cf);
375 NIR_PASS(progress, nir, nir_opt_cse);
376 NIR_PASS(progress, nir, nir_opt_peephole_select, 64, false, true);
377 NIR_PASS(progress, nir, nir_opt_algebraic);
378 NIR_PASS(progress, nir, nir_opt_constant_folding);
379
380 if (lower_flrp != 0) {
381 bool lower_flrp_progress = false;
382 NIR_PASS(lower_flrp_progress,
383 nir,
384 nir_lower_flrp,
385 lower_flrp,
386 false /* always_precise */,
387 nir->options->lower_ffma);
388 if (lower_flrp_progress) {
389 NIR_PASS(progress, nir,
390 nir_opt_constant_folding);
391 progress = true;
392 }
393
394 /* Nothing should rematerialize any flrps, so we only
395 * need to do this lowering once.
396 */
397 lower_flrp = 0;
398 }
399
400 NIR_PASS(progress, nir, nir_opt_undef);
401 NIR_PASS(progress, nir, nir_opt_loop_unroll,
402 nir_var_shader_in |
403 nir_var_shader_out |
404 nir_var_function_temp);
405
406 /* TODO: Enable vectorize when merged upstream */
407 // NIR_PASS(progress, nir, nir_opt_vectorize);
408 } while (progress);
409
410 /* Must be run at the end to prevent creation of fsin/fcos ops */
411 NIR_PASS(progress, nir, midgard_nir_scale_trig);
412
413 do {
414 progress = false;
415
416 NIR_PASS(progress, nir, nir_opt_dce);
417 NIR_PASS(progress, nir, nir_opt_algebraic);
418 NIR_PASS(progress, nir, nir_opt_constant_folding);
419 NIR_PASS(progress, nir, nir_copy_prop);
420 } while (progress);
421
422 NIR_PASS(progress, nir, nir_opt_algebraic_late);
423
424 /* We implement booleans as 32-bit 0/~0 */
425 NIR_PASS(progress, nir, nir_lower_bool_to_int32);
426
427 /* Now that booleans are lowered, we can run out late opts */
428 NIR_PASS(progress, nir, midgard_nir_lower_algebraic_late);
429
430 /* Lower mods for float ops only. Integer ops don't support modifiers
431 * (saturate doesn't make sense on integers, neg/abs require dedicated
432 * instructions) */
433
434 NIR_PASS(progress, nir, nir_lower_to_source_mods, nir_lower_float_source_mods);
435 NIR_PASS(progress, nir, nir_copy_prop);
436 NIR_PASS(progress, nir, nir_opt_dce);
437
438 /* Take us out of SSA */
439 NIR_PASS(progress, nir, nir_lower_locals_to_regs);
440 NIR_PASS(progress, nir, nir_convert_from_ssa, true);
441
442 /* We are a vector architecture; write combine where possible */
443 NIR_PASS(progress, nir, nir_move_vec_src_uses_to_dest);
444 NIR_PASS(progress, nir, nir_lower_vec_to_movs);
445
446 NIR_PASS(progress, nir, nir_opt_dce);
447 }
448
449 /* Front-half of aliasing the SSA slots, merely by inserting the flag in the
450 * appropriate hash table. Intentional off-by-one to avoid confusing NULL with
451 * r0. See the comments in compiler_context */
452
453 static void
454 alias_ssa(compiler_context *ctx, int dest, int src)
455 {
456 _mesa_hash_table_u64_insert(ctx->ssa_to_alias, dest + 1, (void *) ((uintptr_t) src + 1));
457 _mesa_set_add(ctx->leftover_ssa_to_alias, (void *) (uintptr_t) (dest + 1));
458 }
459
460 /* ...or undo it, after which the original index will be used (dummy move should be emitted alongside this) */
461
462 static void
463 unalias_ssa(compiler_context *ctx, int dest)
464 {
465 _mesa_hash_table_u64_remove(ctx->ssa_to_alias, dest + 1);
466 /* TODO: Remove from leftover or no? */
467 }
468
469 /* Do not actually emit a load; instead, cache the constant for inlining */
470
471 static void
472 emit_load_const(compiler_context *ctx, nir_load_const_instr *instr)
473 {
474 nir_ssa_def def = instr->def;
475
476 float *v = rzalloc_array(NULL, float, 4);
477 nir_const_load_to_arr(v, instr, f32);
478 _mesa_hash_table_u64_insert(ctx->ssa_constants, def.index + 1, v);
479 }
480
481 static unsigned
482 nir_src_index(compiler_context *ctx, nir_src *src)
483 {
484 if (src->is_ssa)
485 return src->ssa->index;
486 else {
487 assert(!src->reg.indirect);
488 return ctx->func->impl->ssa_alloc + src->reg.reg->index;
489 }
490 }
491
492 static unsigned
493 nir_dest_index(compiler_context *ctx, nir_dest *dst)
494 {
495 if (dst->is_ssa)
496 return dst->ssa.index;
497 else {
498 assert(!dst->reg.indirect);
499 return ctx->func->impl->ssa_alloc + dst->reg.reg->index;
500 }
501 }
502
503 static unsigned
504 nir_alu_src_index(compiler_context *ctx, nir_alu_src *src)
505 {
506 return nir_src_index(ctx, &src->src);
507 }
508
509 static bool
510 nir_is_non_scalar_swizzle(nir_alu_src *src, unsigned nr_components)
511 {
512 unsigned comp = src->swizzle[0];
513
514 for (unsigned c = 1; c < nr_components; ++c) {
515 if (src->swizzle[c] != comp)
516 return true;
517 }
518
519 return false;
520 }
521
522 /* Midgard puts scalar conditionals in r31.w; move an arbitrary source (the
523 * output of a conditional test) into that register */
524
525 static void
526 emit_condition(compiler_context *ctx, nir_src *src, bool for_branch, unsigned component)
527 {
528 int condition = nir_src_index(ctx, src);
529
530 /* Source to swizzle the desired component into w */
531
532 const midgard_vector_alu_src alu_src = {
533 .swizzle = SWIZZLE(component, component, component, component),
534 };
535
536 /* There is no boolean move instruction. Instead, we simulate a move by
537 * ANDing the condition with itself to get it into r31.w */
538
539 midgard_instruction ins = {
540 .type = TAG_ALU_4,
541
542 /* We need to set the conditional as close as possible */
543 .precede_break = true,
544 .unit = for_branch ? UNIT_SMUL : UNIT_SADD,
545
546 .ssa_args = {
547 .src0 = condition,
548 .src1 = condition,
549 .dest = SSA_FIXED_REGISTER(31),
550 },
551
552 .alu = {
553 .op = midgard_alu_op_iand,
554 .outmod = midgard_outmod_int_wrap,
555 .reg_mode = midgard_reg_mode_32,
556 .dest_override = midgard_dest_override_none,
557 .mask = (0x3 << 6), /* w */
558 .src1 = vector_alu_srco_unsigned(alu_src),
559 .src2 = vector_alu_srco_unsigned(alu_src)
560 },
561 };
562
563 emit_mir_instruction(ctx, ins);
564 }
565
566 /* Or, for mixed conditions (with csel_v), here's a vector version using all of
567 * r31 instead */
568
569 static void
570 emit_condition_mixed(compiler_context *ctx, nir_alu_src *src, unsigned nr_comp)
571 {
572 int condition = nir_src_index(ctx, &src->src);
573
574 /* Source to swizzle the desired component into w */
575
576 const midgard_vector_alu_src alu_src = {
577 .swizzle = SWIZZLE_FROM_ARRAY(src->swizzle),
578 };
579
580 /* There is no boolean move instruction. Instead, we simulate a move by
581 * ANDing the condition with itself to get it into r31.w */
582
583 midgard_instruction ins = {
584 .type = TAG_ALU_4,
585 .precede_break = true,
586 .ssa_args = {
587 .src0 = condition,
588 .src1 = condition,
589 .dest = SSA_FIXED_REGISTER(31),
590 },
591 .alu = {
592 .op = midgard_alu_op_iand,
593 .outmod = midgard_outmod_int_wrap,
594 .reg_mode = midgard_reg_mode_32,
595 .dest_override = midgard_dest_override_none,
596 .mask = expand_writemask((1 << nr_comp) - 1),
597 .src1 = vector_alu_srco_unsigned(alu_src),
598 .src2 = vector_alu_srco_unsigned(alu_src)
599 },
600 };
601
602 emit_mir_instruction(ctx, ins);
603 }
604
605
606
607 /* Likewise, indirect offsets are put in r27.w. TODO: Allow componentwise
608 * pinning to eliminate this move in all known cases */
609
610 static void
611 emit_indirect_offset(compiler_context *ctx, nir_src *src)
612 {
613 int offset = nir_src_index(ctx, src);
614
615 midgard_instruction ins = {
616 .type = TAG_ALU_4,
617 .ssa_args = {
618 .src0 = SSA_UNUSED_1,
619 .src1 = offset,
620 .dest = SSA_FIXED_REGISTER(REGISTER_OFFSET),
621 },
622 .alu = {
623 .op = midgard_alu_op_imov,
624 .outmod = midgard_outmod_int_wrap,
625 .reg_mode = midgard_reg_mode_32,
626 .dest_override = midgard_dest_override_none,
627 .mask = (0x3 << 6), /* w */
628 .src1 = vector_alu_srco_unsigned(zero_alu_src),
629 .src2 = vector_alu_srco_unsigned(blank_alu_src_xxxx)
630 },
631 };
632
633 emit_mir_instruction(ctx, ins);
634 }
635
636 #define ALU_CASE(nir, _op) \
637 case nir_op_##nir: \
638 op = midgard_alu_op_##_op; \
639 break;
640 static bool
641 nir_is_fzero_constant(nir_src src)
642 {
643 if (!nir_src_is_const(src))
644 return false;
645
646 for (unsigned c = 0; c < nir_src_num_components(src); ++c) {
647 if (nir_src_comp_as_float(src, c) != 0.0)
648 return false;
649 }
650
651 return true;
652 }
653
654 static void
655 emit_alu(compiler_context *ctx, nir_alu_instr *instr)
656 {
657 bool is_ssa = instr->dest.dest.is_ssa;
658
659 unsigned dest = nir_dest_index(ctx, &instr->dest.dest);
660 unsigned nr_components = is_ssa ? instr->dest.dest.ssa.num_components : instr->dest.dest.reg.reg->num_components;
661 unsigned nr_inputs = nir_op_infos[instr->op].num_inputs;
662
663 /* Most Midgard ALU ops have a 1:1 correspondance to NIR ops; these are
664 * supported. A few do not and are commented for now. Also, there are a
665 * number of NIR ops which Midgard does not support and need to be
666 * lowered, also TODO. This switch block emits the opcode and calling
667 * convention of the Midgard instruction; actual packing is done in
668 * emit_alu below */
669
670 unsigned op;
671
672 switch (instr->op) {
673 ALU_CASE(fadd, fadd);
674 ALU_CASE(fmul, fmul);
675 ALU_CASE(fmin, fmin);
676 ALU_CASE(fmax, fmax);
677 ALU_CASE(imin, imin);
678 ALU_CASE(imax, imax);
679 ALU_CASE(umin, umin);
680 ALU_CASE(umax, umax);
681 ALU_CASE(ffloor, ffloor);
682 ALU_CASE(fround_even, froundeven);
683 ALU_CASE(ftrunc, ftrunc);
684 ALU_CASE(fceil, fceil);
685 ALU_CASE(fdot3, fdot3);
686 ALU_CASE(fdot4, fdot4);
687 ALU_CASE(iadd, iadd);
688 ALU_CASE(isub, isub);
689 ALU_CASE(imul, imul);
690
691 /* Zero shoved as second-arg */
692 ALU_CASE(iabs, iabsdiff);
693
694 ALU_CASE(mov, imov);
695
696 ALU_CASE(feq32, feq);
697 ALU_CASE(fne32, fne);
698 ALU_CASE(flt32, flt);
699 ALU_CASE(ieq32, ieq);
700 ALU_CASE(ine32, ine);
701 ALU_CASE(ilt32, ilt);
702 ALU_CASE(ult32, ult);
703
704 /* We don't have a native b2f32 instruction. Instead, like many
705 * GPUs, we exploit booleans as 0/~0 for false/true, and
706 * correspondingly AND
707 * by 1.0 to do the type conversion. For the moment, prime us
708 * to emit:
709 *
710 * iand [whatever], #0
711 *
712 * At the end of emit_alu (as MIR), we'll fix-up the constant
713 */
714
715 ALU_CASE(b2f32, iand);
716 ALU_CASE(b2i32, iand);
717
718 /* Likewise, we don't have a dedicated f2b32 instruction, but
719 * we can do a "not equal to 0.0" test. */
720
721 ALU_CASE(f2b32, fne);
722 ALU_CASE(i2b32, ine);
723
724 ALU_CASE(frcp, frcp);
725 ALU_CASE(frsq, frsqrt);
726 ALU_CASE(fsqrt, fsqrt);
727 ALU_CASE(fexp2, fexp2);
728 ALU_CASE(flog2, flog2);
729
730 ALU_CASE(f2i32, f2i);
731 ALU_CASE(f2u32, f2u);
732 ALU_CASE(i2f32, i2f);
733 ALU_CASE(u2f32, u2f);
734
735 ALU_CASE(fsin, fsin);
736 ALU_CASE(fcos, fcos);
737
738 /* Second op implicit #0 */
739 ALU_CASE(inot, inor);
740 ALU_CASE(iand, iand);
741 ALU_CASE(ior, ior);
742 ALU_CASE(ixor, ixor);
743 ALU_CASE(ishl, ishl);
744 ALU_CASE(ishr, iasr);
745 ALU_CASE(ushr, ilsr);
746
747 ALU_CASE(b32all_fequal2, fball_eq);
748 ALU_CASE(b32all_fequal3, fball_eq);
749 ALU_CASE(b32all_fequal4, fball_eq);
750
751 ALU_CASE(b32any_fnequal2, fbany_neq);
752 ALU_CASE(b32any_fnequal3, fbany_neq);
753 ALU_CASE(b32any_fnequal4, fbany_neq);
754
755 ALU_CASE(b32all_iequal2, iball_eq);
756 ALU_CASE(b32all_iequal3, iball_eq);
757 ALU_CASE(b32all_iequal4, iball_eq);
758
759 ALU_CASE(b32any_inequal2, ibany_neq);
760 ALU_CASE(b32any_inequal3, ibany_neq);
761 ALU_CASE(b32any_inequal4, ibany_neq);
762
763 /* Source mods will be shoved in later */
764 ALU_CASE(fabs, fmov);
765 ALU_CASE(fneg, fmov);
766 ALU_CASE(fsat, fmov);
767
768 /* For greater-or-equal, we lower to less-or-equal and flip the
769 * arguments */
770
771 case nir_op_fge:
772 case nir_op_fge32:
773 case nir_op_ige32:
774 case nir_op_uge32: {
775 op =
776 instr->op == nir_op_fge ? midgard_alu_op_fle :
777 instr->op == nir_op_fge32 ? midgard_alu_op_fle :
778 instr->op == nir_op_ige32 ? midgard_alu_op_ile :
779 instr->op == nir_op_uge32 ? midgard_alu_op_ule :
780 0;
781
782 /* Swap via temporary */
783 nir_alu_src temp = instr->src[1];
784 instr->src[1] = instr->src[0];
785 instr->src[0] = temp;
786
787 break;
788 }
789
790 case nir_op_b32csel: {
791 /* Midgard features both fcsel and icsel, depending on
792 * the type of the arguments/output. However, as long
793 * as we're careful we can _always_ use icsel and
794 * _never_ need fcsel, since the latter does additional
795 * floating-point-specific processing whereas the
796 * former just moves bits on the wire. It's not obvious
797 * why these are separate opcodes, save for the ability
798 * to do things like sat/pos/abs/neg for free */
799
800 bool mixed = nir_is_non_scalar_swizzle(&instr->src[0], nr_components);
801 op = mixed ? midgard_alu_op_icsel_v : midgard_alu_op_icsel;
802
803 /* csel works as a two-arg in Midgard, since the condition is hardcoded in r31.w */
804 nr_inputs = 2;
805
806 /* Emit the condition into r31 */
807
808 if (mixed)
809 emit_condition_mixed(ctx, &instr->src[0], nr_components);
810 else
811 emit_condition(ctx, &instr->src[0].src, false, instr->src[0].swizzle[0]);
812
813 /* The condition is the first argument; move the other
814 * arguments up one to be a binary instruction for
815 * Midgard */
816
817 memmove(instr->src, instr->src + 1, 2 * sizeof(nir_alu_src));
818 break;
819 }
820
821 default:
822 DBG("Unhandled ALU op %s\n", nir_op_infos[instr->op].name);
823 assert(0);
824 return;
825 }
826
827 /* Midgard can perform certain modifiers on output of an ALU op */
828 unsigned outmod;
829
830 if (midgard_is_integer_out_op(op)) {
831 outmod = midgard_outmod_int_wrap;
832 } else {
833 bool sat = instr->dest.saturate || instr->op == nir_op_fsat;
834 outmod = sat ? midgard_outmod_sat : midgard_outmod_none;
835 }
836
837 /* fmax(a, 0.0) can turn into a .pos modifier as an optimization */
838
839 if (instr->op == nir_op_fmax) {
840 if (nir_is_fzero_constant(instr->src[0].src)) {
841 op = midgard_alu_op_fmov;
842 nr_inputs = 1;
843 outmod = midgard_outmod_pos;
844 instr->src[0] = instr->src[1];
845 } else if (nir_is_fzero_constant(instr->src[1].src)) {
846 op = midgard_alu_op_fmov;
847 nr_inputs = 1;
848 outmod = midgard_outmod_pos;
849 }
850 }
851
852 /* Fetch unit, quirks, etc information */
853 unsigned opcode_props = alu_opcode_props[op].props;
854 bool quirk_flipped_r24 = opcode_props & QUIRK_FLIPPED_R24;
855
856 /* src0 will always exist afaik, but src1 will not for 1-argument
857 * instructions. The latter can only be fetched if the instruction
858 * needs it, or else we may segfault. */
859
860 unsigned src0 = nir_alu_src_index(ctx, &instr->src[0]);
861 unsigned src1 = nr_inputs == 2 ? nir_alu_src_index(ctx, &instr->src[1]) : SSA_UNUSED_0;
862
863 /* Rather than use the instruction generation helpers, we do it
864 * ourselves here to avoid the mess */
865
866 midgard_instruction ins = {
867 .type = TAG_ALU_4,
868 .ssa_args = {
869 .src0 = quirk_flipped_r24 ? SSA_UNUSED_1 : src0,
870 .src1 = quirk_flipped_r24 ? src0 : src1,
871 .dest = dest,
872 }
873 };
874
875 nir_alu_src *nirmods[2] = { NULL };
876
877 if (nr_inputs == 2) {
878 nirmods[0] = &instr->src[0];
879 nirmods[1] = &instr->src[1];
880 } else if (nr_inputs == 1) {
881 nirmods[quirk_flipped_r24] = &instr->src[0];
882 } else {
883 assert(0);
884 }
885
886 /* These were lowered to a move, so apply the corresponding mod */
887
888 if (instr->op == nir_op_fneg || instr->op == nir_op_fabs) {
889 nir_alu_src *s = nirmods[quirk_flipped_r24];
890
891 if (instr->op == nir_op_fneg)
892 s->negate = !s->negate;
893
894 if (instr->op == nir_op_fabs)
895 s->abs = !s->abs;
896 }
897
898 bool is_int = midgard_is_integer_op(op);
899
900 midgard_vector_alu alu = {
901 .op = op,
902 .reg_mode = midgard_reg_mode_32,
903 .dest_override = midgard_dest_override_none,
904 .outmod = outmod,
905
906 /* Writemask only valid for non-SSA NIR */
907 .mask = expand_writemask((1 << nr_components) - 1),
908
909 .src1 = vector_alu_srco_unsigned(vector_alu_modifiers(nirmods[0], is_int)),
910 .src2 = vector_alu_srco_unsigned(vector_alu_modifiers(nirmods[1], is_int)),
911 };
912
913 /* Apply writemask if non-SSA, keeping in mind that we can't write to components that don't exist */
914
915 if (!is_ssa)
916 alu.mask &= expand_writemask(instr->dest.write_mask);
917
918 ins.alu = alu;
919
920 /* Late fixup for emulated instructions */
921
922 if (instr->op == nir_op_b2f32 || instr->op == nir_op_b2i32) {
923 /* Presently, our second argument is an inline #0 constant.
924 * Switch over to an embedded 1.0 constant (that can't fit
925 * inline, since we're 32-bit, not 16-bit like the inline
926 * constants) */
927
928 ins.ssa_args.inline_constant = false;
929 ins.ssa_args.src1 = SSA_FIXED_REGISTER(REGISTER_CONSTANT);
930 ins.has_constants = true;
931
932 if (instr->op == nir_op_b2f32) {
933 ins.constants[0] = 1.0f;
934 } else {
935 /* Type pun it into place */
936 uint32_t one = 0x1;
937 memcpy(&ins.constants[0], &one, sizeof(uint32_t));
938 }
939
940 ins.alu.src2 = vector_alu_srco_unsigned(blank_alu_src_xxxx);
941 } else if (nr_inputs == 1 && !quirk_flipped_r24) {
942 /* Lots of instructions need a 0 plonked in */
943 ins.ssa_args.inline_constant = false;
944 ins.ssa_args.src1 = SSA_FIXED_REGISTER(REGISTER_CONSTANT);
945 ins.has_constants = true;
946 ins.constants[0] = 0.0f;
947 ins.alu.src2 = vector_alu_srco_unsigned(blank_alu_src_xxxx);
948 } else if (instr->op == nir_op_inot) {
949 /* ~b = ~(b & b), so duplicate the source */
950 ins.ssa_args.src1 = ins.ssa_args.src0;
951 ins.alu.src2 = ins.alu.src1;
952 }
953
954 if ((opcode_props & UNITS_ALL) == UNIT_VLUT) {
955 /* To avoid duplicating the lookup tables (probably), true LUT
956 * instructions can only operate as if they were scalars. Lower
957 * them here by changing the component. */
958
959 uint8_t original_swizzle[4];
960 memcpy(original_swizzle, nirmods[0]->swizzle, sizeof(nirmods[0]->swizzle));
961
962 for (int i = 0; i < nr_components; ++i) {
963 ins.alu.mask = (0x3) << (2 * i); /* Mask the associated component */
964
965 for (int j = 0; j < 4; ++j)
966 nirmods[0]->swizzle[j] = original_swizzle[i]; /* Pull from the correct component */
967
968 ins.alu.src1 = vector_alu_srco_unsigned(vector_alu_modifiers(nirmods[0], is_int));
969 emit_mir_instruction(ctx, ins);
970 }
971 } else {
972 emit_mir_instruction(ctx, ins);
973 }
974 }
975
976 #undef ALU_CASE
977
978 static void
979 emit_uniform_read(compiler_context *ctx, unsigned dest, unsigned offset, nir_src *indirect_offset)
980 {
981 /* TODO: half-floats */
982
983 if (!indirect_offset && offset < ctx->uniform_cutoff) {
984 /* Fast path: For the first 16 uniforms, direct accesses are
985 * 0-cycle, since they're just a register fetch in the usual
986 * case. So, we alias the registers while we're still in
987 * SSA-space */
988
989 int reg_slot = 23 - offset;
990 alias_ssa(ctx, dest, SSA_FIXED_REGISTER(reg_slot));
991 } else {
992 /* Otherwise, read from the 'special' UBO to access
993 * higher-indexed uniforms, at a performance cost. More
994 * generally, we're emitting a UBO read instruction. */
995
996 midgard_instruction ins = m_ld_uniform_32(dest, offset);
997
998 /* TODO: Don't split */
999 ins.load_store.varying_parameters = (offset & 7) << 7;
1000 ins.load_store.address = offset >> 3;
1001
1002 if (indirect_offset) {
1003 emit_indirect_offset(ctx, indirect_offset);
1004 ins.load_store.unknown = 0x8700; /* xxx: what is this? */
1005 } else {
1006 ins.load_store.unknown = 0x1E00; /* xxx: what is this? */
1007 }
1008
1009 emit_mir_instruction(ctx, ins);
1010 }
1011 }
1012
1013 static void
1014 emit_varying_read(
1015 compiler_context *ctx,
1016 unsigned dest, unsigned offset,
1017 unsigned nr_comp, unsigned component,
1018 nir_src *indirect_offset)
1019 {
1020 /* XXX: Half-floats? */
1021 /* TODO: swizzle, mask */
1022
1023 midgard_instruction ins = m_ld_vary_32(dest, offset);
1024 ins.load_store.mask = (1 << nr_comp) - 1;
1025 ins.load_store.swizzle = SWIZZLE_XYZW >> (2 * component);
1026
1027 midgard_varying_parameter p = {
1028 .is_varying = 1,
1029 .interpolation = midgard_interp_default,
1030 .flat = /*var->data.interpolation == INTERP_MODE_FLAT*/ 0
1031 };
1032
1033 unsigned u;
1034 memcpy(&u, &p, sizeof(p));
1035 ins.load_store.varying_parameters = u;
1036
1037 if (indirect_offset) {
1038 /* We need to add in the dynamic index, moved to r27.w */
1039 emit_indirect_offset(ctx, indirect_offset);
1040 ins.load_store.unknown = 0x79e; /* xxx: what is this? */
1041 } else {
1042 /* Just a direct load */
1043 ins.load_store.unknown = 0x1e9e; /* xxx: what is this? */
1044 }
1045
1046 emit_mir_instruction(ctx, ins);
1047 }
1048
1049 static void
1050 emit_sysval_read(compiler_context *ctx, nir_intrinsic_instr *instr)
1051 {
1052 /* First, pull out the destination */
1053 unsigned dest = nir_dest_index(ctx, &instr->dest);
1054
1055 /* Now, figure out which uniform this is */
1056 int sysval = midgard_nir_sysval_for_intrinsic(instr);
1057 void *val = _mesa_hash_table_u64_search(ctx->sysval_to_id, sysval);
1058
1059 /* Sysvals are prefix uniforms */
1060 unsigned uniform = ((uintptr_t) val) - 1;
1061
1062 /* Emit the read itself -- this is never indirect */
1063 emit_uniform_read(ctx, dest, uniform, NULL);
1064 }
1065
1066 /* Reads RGBA8888 value from the tilebuffer and converts to a RGBA32F register,
1067 * using scalar ops functional on earlier Midgard generations. Newer Midgard
1068 * generations have faster vectorized reads. This operation is for blend
1069 * shaders in particular; reading the tilebuffer from the fragment shader
1070 * remains an open problem. */
1071
1072 static void
1073 emit_fb_read_blend_scalar(compiler_context *ctx, unsigned reg)
1074 {
1075 midgard_instruction ins = m_ld_color_buffer_8(reg, 0);
1076 ins.load_store.swizzle = 0; /* xxxx */
1077
1078 /* Read each component sequentially */
1079
1080 for (unsigned c = 0; c < 4; ++c) {
1081 ins.load_store.mask = (1 << c);
1082 ins.load_store.unknown = c;
1083 emit_mir_instruction(ctx, ins);
1084 }
1085
1086 /* vadd.u2f hr2, zext(hr2), #0 */
1087
1088 midgard_vector_alu_src alu_src = blank_alu_src;
1089 alu_src.mod = midgard_int_zero_extend;
1090 alu_src.half = true;
1091
1092 midgard_instruction u2f = {
1093 .type = TAG_ALU_4,
1094 .ssa_args = {
1095 .src0 = reg,
1096 .src1 = SSA_UNUSED_0,
1097 .dest = reg,
1098 .inline_constant = true
1099 },
1100 .alu = {
1101 .op = midgard_alu_op_u2f,
1102 .reg_mode = midgard_reg_mode_16,
1103 .dest_override = midgard_dest_override_none,
1104 .mask = 0xF,
1105 .src1 = vector_alu_srco_unsigned(alu_src),
1106 .src2 = vector_alu_srco_unsigned(blank_alu_src),
1107 }
1108 };
1109
1110 emit_mir_instruction(ctx, u2f);
1111
1112 /* vmul.fmul.sat r1, hr2, #0.00392151 */
1113
1114 alu_src.mod = 0;
1115
1116 midgard_instruction fmul = {
1117 .type = TAG_ALU_4,
1118 .inline_constant = _mesa_float_to_half(1.0 / 255.0),
1119 .ssa_args = {
1120 .src0 = reg,
1121 .dest = reg,
1122 .src1 = SSA_UNUSED_0,
1123 .inline_constant = true
1124 },
1125 .alu = {
1126 .op = midgard_alu_op_fmul,
1127 .reg_mode = midgard_reg_mode_32,
1128 .dest_override = midgard_dest_override_none,
1129 .outmod = midgard_outmod_sat,
1130 .mask = 0xFF,
1131 .src1 = vector_alu_srco_unsigned(alu_src),
1132 .src2 = vector_alu_srco_unsigned(blank_alu_src),
1133 }
1134 };
1135
1136 emit_mir_instruction(ctx, fmul);
1137 }
1138
1139 static void
1140 emit_intrinsic(compiler_context *ctx, nir_intrinsic_instr *instr)
1141 {
1142 unsigned offset, reg;
1143
1144 switch (instr->intrinsic) {
1145 case nir_intrinsic_discard_if:
1146 emit_condition(ctx, &instr->src[0], true, COMPONENT_X);
1147
1148 /* fallthrough */
1149
1150 case nir_intrinsic_discard: {
1151 bool conditional = instr->intrinsic == nir_intrinsic_discard_if;
1152 struct midgard_instruction discard = v_branch(conditional, false);
1153 discard.branch.target_type = TARGET_DISCARD;
1154 emit_mir_instruction(ctx, discard);
1155
1156 ctx->can_discard = true;
1157 break;
1158 }
1159
1160 case nir_intrinsic_load_uniform:
1161 case nir_intrinsic_load_input:
1162 offset = nir_intrinsic_base(instr);
1163
1164 unsigned nr_comp = nir_intrinsic_dest_components(instr);
1165 bool direct = nir_src_is_const(instr->src[0]);
1166
1167 if (direct) {
1168 offset += nir_src_as_uint(instr->src[0]);
1169 }
1170
1171 /* We may need to apply a fractional offset */
1172 int component = instr->intrinsic == nir_intrinsic_load_input ?
1173 nir_intrinsic_component(instr) : 0;
1174 reg = nir_dest_index(ctx, &instr->dest);
1175
1176 if (instr->intrinsic == nir_intrinsic_load_uniform && !ctx->is_blend) {
1177 emit_uniform_read(ctx, reg, ctx->sysval_count + offset, !direct ? &instr->src[0] : NULL);
1178 } else if (ctx->stage == MESA_SHADER_FRAGMENT && !ctx->is_blend) {
1179 emit_varying_read(ctx, reg, offset, nr_comp, component, !direct ? &instr->src[0] : NULL);
1180 } else if (ctx->is_blend) {
1181 /* For blend shaders, load the input color, which is
1182 * preloaded to r0 */
1183
1184 midgard_instruction move = v_fmov(reg, blank_alu_src, SSA_FIXED_REGISTER(0));
1185 emit_mir_instruction(ctx, move);
1186 } else if (ctx->stage == MESA_SHADER_VERTEX) {
1187 midgard_instruction ins = m_ld_attr_32(reg, offset);
1188 ins.load_store.unknown = 0x1E1E; /* XXX: What is this? */
1189 ins.load_store.mask = (1 << nr_comp) - 1;
1190 emit_mir_instruction(ctx, ins);
1191 } else {
1192 DBG("Unknown load\n");
1193 assert(0);
1194 }
1195
1196 break;
1197
1198 case nir_intrinsic_load_output:
1199 assert(nir_src_is_const(instr->src[0]));
1200 reg = nir_dest_index(ctx, &instr->dest);
1201
1202 if (ctx->is_blend) {
1203 /* TODO: MRT */
1204 emit_fb_read_blend_scalar(ctx, reg);
1205 } else {
1206 DBG("Unknown output load\n");
1207 assert(0);
1208 }
1209
1210 break;
1211
1212 case nir_intrinsic_load_blend_const_color_rgba: {
1213 assert(ctx->is_blend);
1214 reg = nir_dest_index(ctx, &instr->dest);
1215
1216 /* Blend constants are embedded directly in the shader and
1217 * patched in, so we use some magic routing */
1218
1219 midgard_instruction ins = v_fmov(SSA_FIXED_REGISTER(REGISTER_CONSTANT), blank_alu_src, reg);
1220 ins.has_constants = true;
1221 ins.has_blend_constant = true;
1222 emit_mir_instruction(ctx, ins);
1223 break;
1224 }
1225
1226 case nir_intrinsic_store_output:
1227 assert(nir_src_is_const(instr->src[1]) && "no indirect outputs");
1228
1229 offset = nir_intrinsic_base(instr) + nir_src_as_uint(instr->src[1]);
1230
1231 reg = nir_src_index(ctx, &instr->src[0]);
1232
1233 if (ctx->stage == MESA_SHADER_FRAGMENT) {
1234 /* gl_FragColor is not emitted with load/store
1235 * instructions. Instead, it gets plonked into
1236 * r0 at the end of the shader and we do the
1237 * framebuffer writeout dance. TODO: Defer
1238 * writes */
1239
1240 midgard_instruction move = v_fmov(reg, blank_alu_src, SSA_FIXED_REGISTER(0));
1241 emit_mir_instruction(ctx, move);
1242
1243 /* Save the index we're writing to for later reference
1244 * in the epilogue */
1245
1246 ctx->fragment_output = reg;
1247 } else if (ctx->stage == MESA_SHADER_VERTEX) {
1248 /* Varyings are written into one of two special
1249 * varying register, r26 or r27. The register itself is
1250 * selected as the register in the st_vary instruction,
1251 * minus the base of 26. E.g. write into r27 and then
1252 * call st_vary(1) */
1253
1254 midgard_instruction ins = v_fmov(reg, blank_alu_src, SSA_FIXED_REGISTER(26));
1255 emit_mir_instruction(ctx, ins);
1256
1257 /* We should have been vectorized. That also lets us
1258 * ignore the mask. because the mask component on
1259 * st_vary is (as far as I can tell) ignored [the blob
1260 * sets it to zero] */
1261 assert(nir_intrinsic_component(instr) == 0);
1262
1263 midgard_instruction st = m_st_vary_32(SSA_FIXED_REGISTER(0), offset);
1264 st.load_store.unknown = 0x1E9E; /* XXX: What is this? */
1265 emit_mir_instruction(ctx, st);
1266 } else {
1267 DBG("Unknown store\n");
1268 assert(0);
1269 }
1270
1271 break;
1272
1273 case nir_intrinsic_load_alpha_ref_float:
1274 assert(instr->dest.is_ssa);
1275
1276 float ref_value = ctx->alpha_ref;
1277
1278 float *v = ralloc_array(NULL, float, 4);
1279 memcpy(v, &ref_value, sizeof(float));
1280 _mesa_hash_table_u64_insert(ctx->ssa_constants, instr->dest.ssa.index + 1, v);
1281 break;
1282
1283 case nir_intrinsic_load_viewport_scale:
1284 case nir_intrinsic_load_viewport_offset:
1285 emit_sysval_read(ctx, instr);
1286 break;
1287
1288 default:
1289 printf ("Unhandled intrinsic\n");
1290 assert(0);
1291 break;
1292 }
1293 }
1294
1295 static unsigned
1296 midgard_tex_format(enum glsl_sampler_dim dim)
1297 {
1298 switch (dim) {
1299 case GLSL_SAMPLER_DIM_2D:
1300 case GLSL_SAMPLER_DIM_EXTERNAL:
1301 return TEXTURE_2D;
1302
1303 case GLSL_SAMPLER_DIM_3D:
1304 return TEXTURE_3D;
1305
1306 case GLSL_SAMPLER_DIM_CUBE:
1307 return TEXTURE_CUBE;
1308
1309 default:
1310 DBG("Unknown sampler dim type\n");
1311 assert(0);
1312 return 0;
1313 }
1314 }
1315
1316 static unsigned
1317 midgard_tex_op(nir_texop op)
1318 {
1319 switch (op) {
1320 case nir_texop_tex:
1321 case nir_texop_txb:
1322 return TEXTURE_OP_NORMAL;
1323 case nir_texop_txl:
1324 return TEXTURE_OP_LOD;
1325 default:
1326 unreachable("Unhanlded texture op");
1327 }
1328 }
1329
1330 static void
1331 emit_tex(compiler_context *ctx, nir_tex_instr *instr)
1332 {
1333 /* TODO */
1334 //assert (!instr->sampler);
1335 //assert (!instr->texture_array_size);
1336
1337 /* Allocate registers via a round robin scheme to alternate between the two registers */
1338 int reg = ctx->texture_op_count & 1;
1339 int in_reg = reg, out_reg = reg;
1340
1341 /* Make room for the reg */
1342
1343 if (ctx->texture_index[reg] > -1)
1344 unalias_ssa(ctx, ctx->texture_index[reg]);
1345
1346 int texture_index = instr->texture_index;
1347 int sampler_index = texture_index;
1348
1349 for (unsigned i = 0; i < instr->num_srcs; ++i) {
1350 int reg = SSA_FIXED_REGISTER(REGISTER_TEXTURE_BASE + in_reg);
1351 int index = nir_src_index(ctx, &instr->src[i].src);
1352 midgard_vector_alu_src alu_src = blank_alu_src;
1353
1354 switch (instr->src[i].src_type) {
1355 case nir_tex_src_coord: {
1356 if (instr->sampler_dim == GLSL_SAMPLER_DIM_CUBE) {
1357 /* For cubemaps, we need to load coords into
1358 * special r27, and then use a special ld/st op
1359 * to select the face and copy the xy into the
1360 * texture register */
1361
1362 alu_src.swizzle = SWIZZLE(COMPONENT_X, COMPONENT_Y, COMPONENT_Z, COMPONENT_X);
1363
1364 midgard_instruction move = v_fmov(index, alu_src, SSA_FIXED_REGISTER(27));
1365 emit_mir_instruction(ctx, move);
1366
1367 midgard_instruction st = m_st_cubemap_coords(reg, 0);
1368 st.load_store.unknown = 0x24; /* XXX: What is this? */
1369 st.load_store.mask = 0x3; /* xy */
1370 st.load_store.swizzle = alu_src.swizzle;
1371 emit_mir_instruction(ctx, st);
1372
1373 } else {
1374 alu_src.swizzle = SWIZZLE(COMPONENT_X, COMPONENT_Y, COMPONENT_X, COMPONENT_X);
1375
1376 midgard_instruction ins = v_fmov(index, alu_src, reg);
1377 ins.alu.mask = expand_writemask(0x3); /* xy */
1378 emit_mir_instruction(ctx, ins);
1379 }
1380
1381 break;
1382 }
1383
1384 case nir_tex_src_bias:
1385 case nir_tex_src_lod: {
1386 /* To keep RA simple, we put the bias/LOD into the w
1387 * component of the input source, which is otherwise in xy */
1388
1389 alu_src.swizzle = SWIZZLE_XXXX;
1390
1391 midgard_instruction ins = v_fmov(index, alu_src, reg);
1392 ins.alu.mask = expand_writemask(1 << COMPONENT_W);
1393 emit_mir_instruction(ctx, ins);
1394 break;
1395 };
1396
1397 default:
1398 unreachable("Unknown texture source type\n");
1399 }
1400 }
1401
1402 /* No helper to build texture words -- we do it all here */
1403 midgard_instruction ins = {
1404 .type = TAG_TEXTURE_4,
1405 .texture = {
1406 .op = midgard_tex_op(instr->op),
1407 .format = midgard_tex_format(instr->sampler_dim),
1408 .texture_handle = texture_index,
1409 .sampler_handle = sampler_index,
1410
1411 /* TODO: Regalloc it in */
1412 .swizzle = SWIZZLE_XYZW,
1413 .mask = 0xF,
1414
1415 /* TODO: half */
1416 .in_reg_full = 1,
1417 .in_reg_swizzle = SWIZZLE_XYXX,
1418 .out_full = 1,
1419
1420 /* Always 1 */
1421 .unknown7 = 1,
1422 }
1423 };
1424
1425 /* Set registers to read and write from the same place */
1426 ins.texture.in_reg_select = in_reg;
1427 ins.texture.out_reg_select = out_reg;
1428
1429 /* Setup bias/LOD if necessary. Only register mode support right now.
1430 * TODO: Immediate mode for performance gains */
1431
1432 if (instr->op == nir_texop_txb || instr->op == nir_texop_txl) {
1433 ins.texture.lod_register = true;
1434
1435 midgard_tex_register_select sel = {
1436 .select = in_reg,
1437 .full = 1,
1438
1439 /* w */
1440 .component_lo = 1,
1441 .component_hi = 1
1442 };
1443
1444 uint8_t packed;
1445 memcpy(&packed, &sel, sizeof(packed));
1446 ins.texture.bias = packed;
1447 }
1448
1449 emit_mir_instruction(ctx, ins);
1450
1451 /* Simultaneously alias the destination and emit a move for it. The move will be eliminated if possible */
1452
1453 int o_reg = REGISTER_TEXTURE_BASE + out_reg, o_index = nir_dest_index(ctx, &instr->dest);
1454 alias_ssa(ctx, o_index, SSA_FIXED_REGISTER(o_reg));
1455 ctx->texture_index[reg] = o_index;
1456
1457 midgard_instruction ins2 = v_fmov(SSA_FIXED_REGISTER(o_reg), blank_alu_src, o_index);
1458 emit_mir_instruction(ctx, ins2);
1459
1460 /* Used for .cont and .last hinting */
1461 ctx->texture_op_count++;
1462 }
1463
1464 static void
1465 emit_jump(compiler_context *ctx, nir_jump_instr *instr)
1466 {
1467 switch (instr->type) {
1468 case nir_jump_break: {
1469 /* Emit a branch out of the loop */
1470 struct midgard_instruction br = v_branch(false, false);
1471 br.branch.target_type = TARGET_BREAK;
1472 br.branch.target_break = ctx->current_loop_depth;
1473 emit_mir_instruction(ctx, br);
1474
1475 DBG("break..\n");
1476 break;
1477 }
1478
1479 default:
1480 DBG("Unknown jump type %d\n", instr->type);
1481 break;
1482 }
1483 }
1484
1485 static void
1486 emit_instr(compiler_context *ctx, struct nir_instr *instr)
1487 {
1488 switch (instr->type) {
1489 case nir_instr_type_load_const:
1490 emit_load_const(ctx, nir_instr_as_load_const(instr));
1491 break;
1492
1493 case nir_instr_type_intrinsic:
1494 emit_intrinsic(ctx, nir_instr_as_intrinsic(instr));
1495 break;
1496
1497 case nir_instr_type_alu:
1498 emit_alu(ctx, nir_instr_as_alu(instr));
1499 break;
1500
1501 case nir_instr_type_tex:
1502 emit_tex(ctx, nir_instr_as_tex(instr));
1503 break;
1504
1505 case nir_instr_type_jump:
1506 emit_jump(ctx, nir_instr_as_jump(instr));
1507 break;
1508
1509 case nir_instr_type_ssa_undef:
1510 /* Spurious */
1511 break;
1512
1513 default:
1514 DBG("Unhandled instruction type\n");
1515 break;
1516 }
1517 }
1518
1519
1520 /* ALU instructions can inline or embed constants, which decreases register
1521 * pressure and saves space. */
1522
1523 #define CONDITIONAL_ATTACH(src) { \
1524 void *entry = _mesa_hash_table_u64_search(ctx->ssa_constants, alu->ssa_args.src + 1); \
1525 \
1526 if (entry) { \
1527 attach_constants(ctx, alu, entry, alu->ssa_args.src + 1); \
1528 alu->ssa_args.src = SSA_FIXED_REGISTER(REGISTER_CONSTANT); \
1529 } \
1530 }
1531
1532 static void
1533 inline_alu_constants(compiler_context *ctx)
1534 {
1535 mir_foreach_instr(ctx, alu) {
1536 /* Other instructions cannot inline constants */
1537 if (alu->type != TAG_ALU_4) continue;
1538
1539 /* If there is already a constant here, we can do nothing */
1540 if (alu->has_constants) continue;
1541
1542 /* It makes no sense to inline constants on a branch */
1543 if (alu->compact_branch || alu->prepacked_branch) continue;
1544
1545 CONDITIONAL_ATTACH(src0);
1546
1547 if (!alu->has_constants) {
1548 CONDITIONAL_ATTACH(src1)
1549 } else if (!alu->inline_constant) {
1550 /* Corner case: _two_ vec4 constants, for instance with a
1551 * csel. For this case, we can only use a constant
1552 * register for one, we'll have to emit a move for the
1553 * other. Note, if both arguments are constants, then
1554 * necessarily neither argument depends on the value of
1555 * any particular register. As the destination register
1556 * will be wiped, that means we can spill the constant
1557 * to the destination register.
1558 */
1559
1560 void *entry = _mesa_hash_table_u64_search(ctx->ssa_constants, alu->ssa_args.src1 + 1);
1561 unsigned scratch = alu->ssa_args.dest;
1562
1563 if (entry) {
1564 midgard_instruction ins = v_fmov(SSA_FIXED_REGISTER(REGISTER_CONSTANT), blank_alu_src, scratch);
1565 attach_constants(ctx, &ins, entry, alu->ssa_args.src1 + 1);
1566
1567 /* Force a break XXX Defer r31 writes */
1568 ins.unit = UNIT_VLUT;
1569
1570 /* Set the source */
1571 alu->ssa_args.src1 = scratch;
1572
1573 /* Inject us -before- the last instruction which set r31 */
1574 mir_insert_instruction_before(mir_prev_op(alu), ins);
1575 }
1576 }
1577 }
1578 }
1579
1580 /* Midgard supports two types of constants, embedded constants (128-bit) and
1581 * inline constants (16-bit). Sometimes, especially with scalar ops, embedded
1582 * constants can be demoted to inline constants, for space savings and
1583 * sometimes a performance boost */
1584
1585 static void
1586 embedded_to_inline_constant(compiler_context *ctx)
1587 {
1588 mir_foreach_instr(ctx, ins) {
1589 if (!ins->has_constants) continue;
1590
1591 if (ins->ssa_args.inline_constant) continue;
1592
1593 /* Blend constants must not be inlined by definition */
1594 if (ins->has_blend_constant) continue;
1595
1596 /* src1 cannot be an inline constant due to encoding
1597 * restrictions. So, if possible we try to flip the arguments
1598 * in that case */
1599
1600 int op = ins->alu.op;
1601
1602 if (ins->ssa_args.src0 == SSA_FIXED_REGISTER(REGISTER_CONSTANT)) {
1603 switch (op) {
1604 /* These ops require an operational change to flip
1605 * their arguments TODO */
1606 case midgard_alu_op_flt:
1607 case midgard_alu_op_fle:
1608 case midgard_alu_op_ilt:
1609 case midgard_alu_op_ile:
1610 case midgard_alu_op_fcsel:
1611 case midgard_alu_op_icsel:
1612 DBG("Missed non-commutative flip (%s)\n", alu_opcode_props[op].name);
1613 default:
1614 break;
1615 }
1616
1617 if (alu_opcode_props[op].props & OP_COMMUTES) {
1618 /* Flip the SSA numbers */
1619 ins->ssa_args.src0 = ins->ssa_args.src1;
1620 ins->ssa_args.src1 = SSA_FIXED_REGISTER(REGISTER_CONSTANT);
1621
1622 /* And flip the modifiers */
1623
1624 unsigned src_temp;
1625
1626 src_temp = ins->alu.src2;
1627 ins->alu.src2 = ins->alu.src1;
1628 ins->alu.src1 = src_temp;
1629 }
1630 }
1631
1632 if (ins->ssa_args.src1 == SSA_FIXED_REGISTER(REGISTER_CONSTANT)) {
1633 /* Extract the source information */
1634
1635 midgard_vector_alu_src *src;
1636 int q = ins->alu.src2;
1637 midgard_vector_alu_src *m = (midgard_vector_alu_src *) &q;
1638 src = m;
1639
1640 /* Component is from the swizzle, e.g. r26.w -> w component. TODO: What if x is masked out? */
1641 int component = src->swizzle & 3;
1642
1643 /* Scale constant appropriately, if we can legally */
1644 uint16_t scaled_constant = 0;
1645
1646 if (midgard_is_integer_op(op)) {
1647 unsigned int *iconstants = (unsigned int *) ins->constants;
1648 scaled_constant = (uint16_t) iconstants[component];
1649
1650 /* Constant overflow after resize */
1651 if (scaled_constant != iconstants[component])
1652 continue;
1653 } else {
1654 float original = (float) ins->constants[component];
1655 scaled_constant = _mesa_float_to_half(original);
1656
1657 /* Check for loss of precision. If this is
1658 * mediump, we don't care, but for a highp
1659 * shader, we need to pay attention. NIR
1660 * doesn't yet tell us which mode we're in!
1661 * Practically this prevents most constants
1662 * from being inlined, sadly. */
1663
1664 float fp32 = _mesa_half_to_float(scaled_constant);
1665
1666 if (fp32 != original)
1667 continue;
1668 }
1669
1670 /* We don't know how to handle these with a constant */
1671
1672 if (src->mod || src->half || src->rep_low || src->rep_high) {
1673 DBG("Bailing inline constant...\n");
1674 continue;
1675 }
1676
1677 /* Make sure that the constant is not itself a
1678 * vector by checking if all accessed values
1679 * (by the swizzle) are the same. */
1680
1681 uint32_t *cons = (uint32_t *) ins->constants;
1682 uint32_t value = cons[component];
1683
1684 bool is_vector = false;
1685 unsigned mask = effective_writemask(&ins->alu);
1686
1687 for (int c = 1; c < 4; ++c) {
1688 /* We only care if this component is actually used */
1689 if (!(mask & (1 << c)))
1690 continue;
1691
1692 uint32_t test = cons[(src->swizzle >> (2 * c)) & 3];
1693
1694 if (test != value) {
1695 is_vector = true;
1696 break;
1697 }
1698 }
1699
1700 if (is_vector)
1701 continue;
1702
1703 /* Get rid of the embedded constant */
1704 ins->has_constants = false;
1705 ins->ssa_args.src1 = SSA_UNUSED_0;
1706 ins->ssa_args.inline_constant = true;
1707 ins->inline_constant = scaled_constant;
1708 }
1709 }
1710 }
1711
1712 /* Map normal SSA sources to other SSA sources / fixed registers (like
1713 * uniforms) */
1714
1715 static void
1716 map_ssa_to_alias(compiler_context *ctx, int *ref)
1717 {
1718 /* Sign is used quite deliberately for unused */
1719 if (*ref < 0)
1720 return;
1721
1722 unsigned int alias = (uintptr_t) _mesa_hash_table_u64_search(ctx->ssa_to_alias, *ref + 1);
1723
1724 if (alias) {
1725 /* Remove entry in leftovers to avoid a redunant fmov */
1726
1727 struct set_entry *leftover = _mesa_set_search(ctx->leftover_ssa_to_alias, ((void *) (uintptr_t) (*ref + 1)));
1728
1729 if (leftover)
1730 _mesa_set_remove(ctx->leftover_ssa_to_alias, leftover);
1731
1732 /* Assign the alias map */
1733 *ref = alias - 1;
1734 return;
1735 }
1736 }
1737
1738 /* Basic dead code elimination on the MIR itself, which cleans up e.g. the
1739 * texture pipeline */
1740
1741 static bool
1742 midgard_opt_dead_code_eliminate(compiler_context *ctx, midgard_block *block)
1743 {
1744 bool progress = false;
1745
1746 mir_foreach_instr_in_block_safe(block, ins) {
1747 if (ins->type != TAG_ALU_4) continue;
1748 if (ins->compact_branch) continue;
1749
1750 if (ins->ssa_args.dest >= SSA_FIXED_MINIMUM) continue;
1751 if (mir_is_live_after(ctx, block, ins, ins->ssa_args.dest)) continue;
1752
1753 mir_remove_instruction(ins);
1754 progress = true;
1755 }
1756
1757 return progress;
1758 }
1759
1760 /* Dead code elimination for branches at the end of a block - only one branch
1761 * per block is legal semantically */
1762
1763 static void
1764 midgard_opt_cull_dead_branch(compiler_context *ctx, midgard_block *block)
1765 {
1766 bool branched = false;
1767
1768 mir_foreach_instr_in_block_safe(block, ins) {
1769 if (!midgard_is_branch_unit(ins->unit)) continue;
1770
1771 /* We ignore prepacked branches since the fragment epilogue is
1772 * just generally special */
1773 if (ins->prepacked_branch) continue;
1774
1775 /* Discards are similarly special and may not correspond to the
1776 * end of a block */
1777
1778 if (ins->branch.target_type == TARGET_DISCARD) continue;
1779
1780 if (branched) {
1781 /* We already branched, so this is dead */
1782 mir_remove_instruction(ins);
1783 }
1784
1785 branched = true;
1786 }
1787 }
1788
1789 static bool
1790 mir_nontrivial_mod(midgard_vector_alu_src src, bool is_int, unsigned mask)
1791 {
1792 /* abs or neg */
1793 if (!is_int && src.mod) return true;
1794
1795 /* swizzle */
1796 for (unsigned c = 0; c < 4; ++c) {
1797 if (!(mask & (1 << c))) continue;
1798 if (((src.swizzle >> (2*c)) & 3) != c) return true;
1799 }
1800
1801 return false;
1802 }
1803
1804 static bool
1805 mir_nontrivial_source2_mod(midgard_instruction *ins)
1806 {
1807 unsigned mask = squeeze_writemask(ins->alu.mask);
1808 bool is_int = midgard_is_integer_op(ins->alu.op);
1809
1810 midgard_vector_alu_src src2 =
1811 vector_alu_from_unsigned(ins->alu.src2);
1812
1813 return mir_nontrivial_mod(src2, is_int, mask);
1814 }
1815
1816 static bool
1817 mir_nontrivial_outmod(midgard_instruction *ins)
1818 {
1819 bool is_int = midgard_is_integer_op(ins->alu.op);
1820 unsigned mod = ins->alu.outmod;
1821
1822 if (is_int)
1823 return mod != midgard_outmod_int_wrap;
1824 else
1825 return mod != midgard_outmod_none;
1826 }
1827
1828 static bool
1829 midgard_opt_copy_prop(compiler_context *ctx, midgard_block *block)
1830 {
1831 bool progress = false;
1832
1833 mir_foreach_instr_in_block_safe(block, ins) {
1834 if (ins->type != TAG_ALU_4) continue;
1835 if (!OP_IS_MOVE(ins->alu.op)) continue;
1836
1837 unsigned from = ins->ssa_args.src1;
1838 unsigned to = ins->ssa_args.dest;
1839
1840 /* We only work on pure SSA */
1841
1842 if (to >= SSA_FIXED_MINIMUM) continue;
1843 if (from >= SSA_FIXED_MINIMUM) continue;
1844 if (to >= ctx->func->impl->ssa_alloc) continue;
1845 if (from >= ctx->func->impl->ssa_alloc) continue;
1846
1847 /* Constant propagation is not handled here, either */
1848 if (ins->ssa_args.inline_constant) continue;
1849 if (ins->has_constants) continue;
1850
1851 if (mir_nontrivial_source2_mod(ins)) continue;
1852 if (mir_nontrivial_outmod(ins)) continue;
1853
1854 /* We're clear -- rewrite */
1855 mir_rewrite_index_src(ctx, to, from);
1856 mir_remove_instruction(ins);
1857 progress |= true;
1858 }
1859
1860 return progress;
1861 }
1862
1863 /* fmov.pos is an idiom for fpos. Propoagate the .pos up to the source, so then
1864 * the move can be propagated away entirely */
1865
1866 static bool
1867 mir_compose_float_outmod(midgard_outmod_float *outmod, midgard_outmod_float comp)
1868 {
1869 /* Nothing to do */
1870 if (comp == midgard_outmod_none)
1871 return true;
1872
1873 if (*outmod == midgard_outmod_none) {
1874 *outmod = comp;
1875 return true;
1876 }
1877
1878 /* TODO: Compose rules */
1879 return false;
1880 }
1881
1882 static bool
1883 midgard_opt_pos_propagate(compiler_context *ctx, midgard_block *block)
1884 {
1885 bool progress = false;
1886
1887 mir_foreach_instr_in_block_safe(block, ins) {
1888 if (ins->type != TAG_ALU_4) continue;
1889 if (ins->alu.op != midgard_alu_op_fmov) continue;
1890 if (ins->alu.outmod != midgard_outmod_pos) continue;
1891
1892 /* TODO: Registers? */
1893 unsigned src = ins->ssa_args.src1;
1894 if (src >= ctx->func->impl->ssa_alloc) continue;
1895 assert(!mir_has_multiple_writes(ctx, src));
1896
1897 /* There might be a source modifier, too */
1898 if (mir_nontrivial_source2_mod(ins)) continue;
1899
1900 /* Backpropagate the modifier */
1901 mir_foreach_instr_in_block_from_rev(block, v, mir_prev_op(ins)) {
1902 if (v->type != TAG_ALU_4) continue;
1903 if (v->ssa_args.dest != src) continue;
1904
1905 /* Can we even take a float outmod? */
1906 if (midgard_is_integer_out_op(v->alu.op)) continue;
1907
1908 midgard_outmod_float temp = v->alu.outmod;
1909 progress |= mir_compose_float_outmod(&temp, ins->alu.outmod);
1910
1911 /* Throw in the towel.. */
1912 if (!progress) break;
1913
1914 /* Otherwise, transfer the modifier */
1915 v->alu.outmod = temp;
1916 ins->alu.outmod = midgard_outmod_none;
1917
1918 break;
1919 }
1920 }
1921
1922 return progress;
1923 }
1924
1925 static bool
1926 midgard_opt_copy_prop_tex(compiler_context *ctx, midgard_block *block)
1927 {
1928 bool progress = false;
1929
1930 mir_foreach_instr_in_block_safe(block, ins) {
1931 if (ins->type != TAG_ALU_4) continue;
1932 if (!OP_IS_MOVE(ins->alu.op)) continue;
1933
1934 unsigned from = ins->ssa_args.src1;
1935 unsigned to = ins->ssa_args.dest;
1936
1937 /* Make sure it's simple enough for us to handle */
1938
1939 if (from >= SSA_FIXED_MINIMUM) continue;
1940 if (from >= ctx->func->impl->ssa_alloc) continue;
1941 if (to < SSA_FIXED_REGISTER(REGISTER_TEXTURE_BASE)) continue;
1942 if (to > SSA_FIXED_REGISTER(REGISTER_TEXTURE_BASE + 1)) continue;
1943
1944 bool eliminated = false;
1945
1946 mir_foreach_instr_in_block_from_rev(block, v, mir_prev_op(ins)) {
1947 /* The texture registers are not SSA so be careful.
1948 * Conservatively, just stop if we hit a texture op
1949 * (even if it may not write) to where we are */
1950
1951 if (v->type != TAG_ALU_4)
1952 break;
1953
1954 if (v->ssa_args.dest == from) {
1955 /* We don't want to track partial writes ... */
1956 if (v->alu.mask == 0xF) {
1957 v->ssa_args.dest = to;
1958 eliminated = true;
1959 }
1960
1961 break;
1962 }
1963 }
1964
1965 if (eliminated)
1966 mir_remove_instruction(ins);
1967
1968 progress |= eliminated;
1969 }
1970
1971 return progress;
1972 }
1973
1974 /* The following passes reorder MIR instructions to enable better scheduling */
1975
1976 static void
1977 midgard_pair_load_store(compiler_context *ctx, midgard_block *block)
1978 {
1979 mir_foreach_instr_in_block_safe(block, ins) {
1980 if (ins->type != TAG_LOAD_STORE_4) continue;
1981
1982 /* We've found a load/store op. Check if next is also load/store. */
1983 midgard_instruction *next_op = mir_next_op(ins);
1984 if (&next_op->link != &block->instructions) {
1985 if (next_op->type == TAG_LOAD_STORE_4) {
1986 /* If so, we're done since we're a pair */
1987 ins = mir_next_op(ins);
1988 continue;
1989 }
1990
1991 /* Maximum search distance to pair, to avoid register pressure disasters */
1992 int search_distance = 8;
1993
1994 /* Otherwise, we have an orphaned load/store -- search for another load */
1995 mir_foreach_instr_in_block_from(block, c, mir_next_op(ins)) {
1996 /* Terminate search if necessary */
1997 if (!(search_distance--)) break;
1998
1999 if (c->type != TAG_LOAD_STORE_4) continue;
2000
2001 /* Stores cannot be reordered, since they have
2002 * dependencies. For the same reason, indirect
2003 * loads cannot be reordered as their index is
2004 * loaded in r27.w */
2005
2006 if (OP_IS_STORE(c->load_store.op)) continue;
2007
2008 /* It appears the 0x800 bit is set whenever a
2009 * load is direct, unset when it is indirect.
2010 * Skip indirect loads. */
2011
2012 if (!(c->load_store.unknown & 0x800)) continue;
2013
2014 /* We found one! Move it up to pair and remove it from the old location */
2015
2016 mir_insert_instruction_before(ins, *c);
2017 mir_remove_instruction(c);
2018
2019 break;
2020 }
2021 }
2022 }
2023 }
2024
2025 /* If there are leftovers after the below pass, emit actual fmov
2026 * instructions for the slow-but-correct path */
2027
2028 static void
2029 emit_leftover_move(compiler_context *ctx)
2030 {
2031 set_foreach(ctx->leftover_ssa_to_alias, leftover) {
2032 int base = ((uintptr_t) leftover->key) - 1;
2033 int mapped = base;
2034
2035 map_ssa_to_alias(ctx, &mapped);
2036 EMIT(fmov, mapped, blank_alu_src, base);
2037 }
2038 }
2039
2040 static void
2041 actualise_ssa_to_alias(compiler_context *ctx)
2042 {
2043 mir_foreach_instr(ctx, ins) {
2044 map_ssa_to_alias(ctx, &ins->ssa_args.src0);
2045 map_ssa_to_alias(ctx, &ins->ssa_args.src1);
2046 }
2047
2048 emit_leftover_move(ctx);
2049 }
2050
2051 static void
2052 emit_fragment_epilogue(compiler_context *ctx)
2053 {
2054 /* Special case: writing out constants requires us to include the move
2055 * explicitly now, so shove it into r0 */
2056
2057 void *constant_value = _mesa_hash_table_u64_search(ctx->ssa_constants, ctx->fragment_output + 1);
2058
2059 if (constant_value) {
2060 midgard_instruction ins = v_fmov(SSA_FIXED_REGISTER(REGISTER_CONSTANT), blank_alu_src, SSA_FIXED_REGISTER(0));
2061 attach_constants(ctx, &ins, constant_value, ctx->fragment_output + 1);
2062 emit_mir_instruction(ctx, ins);
2063 }
2064
2065 /* Perform the actual fragment writeout. We have two writeout/branch
2066 * instructions, forming a loop until writeout is successful as per the
2067 * docs. TODO: gl_FragDepth */
2068
2069 EMIT(alu_br_compact_cond, midgard_jmp_writeout_op_writeout, TAG_ALU_4, 0, midgard_condition_always);
2070 EMIT(alu_br_compact_cond, midgard_jmp_writeout_op_writeout, TAG_ALU_4, -1, midgard_condition_always);
2071 }
2072
2073 /* For the blend epilogue, we need to convert the blended fragment vec4 (stored
2074 * in r0) to a RGBA8888 value by scaling and type converting. We then output it
2075 * with the int8 analogue to the fragment epilogue */
2076
2077 static void
2078 emit_blend_epilogue(compiler_context *ctx)
2079 {
2080 /* vmul.fmul.none.fulllow hr48, r0, #255 */
2081
2082 midgard_instruction scale = {
2083 .type = TAG_ALU_4,
2084 .unit = UNIT_VMUL,
2085 .inline_constant = _mesa_float_to_half(255.0),
2086 .ssa_args = {
2087 .src0 = SSA_FIXED_REGISTER(0),
2088 .src1 = SSA_UNUSED_0,
2089 .dest = SSA_FIXED_REGISTER(24),
2090 .inline_constant = true
2091 },
2092 .alu = {
2093 .op = midgard_alu_op_fmul,
2094 .reg_mode = midgard_reg_mode_32,
2095 .dest_override = midgard_dest_override_lower,
2096 .mask = 0xFF,
2097 .src1 = vector_alu_srco_unsigned(blank_alu_src),
2098 .src2 = vector_alu_srco_unsigned(blank_alu_src),
2099 }
2100 };
2101
2102 emit_mir_instruction(ctx, scale);
2103
2104 /* vadd.f2u8.pos.low hr0, hr48, #0 */
2105
2106 midgard_vector_alu_src alu_src = blank_alu_src;
2107 alu_src.half = true;
2108
2109 midgard_instruction f2u8 = {
2110 .type = TAG_ALU_4,
2111 .ssa_args = {
2112 .src0 = SSA_FIXED_REGISTER(24),
2113 .src1 = SSA_UNUSED_0,
2114 .dest = SSA_FIXED_REGISTER(0),
2115 .inline_constant = true
2116 },
2117 .alu = {
2118 .op = midgard_alu_op_f2u8,
2119 .reg_mode = midgard_reg_mode_16,
2120 .dest_override = midgard_dest_override_lower,
2121 .outmod = midgard_outmod_pos,
2122 .mask = 0xF,
2123 .src1 = vector_alu_srco_unsigned(alu_src),
2124 .src2 = vector_alu_srco_unsigned(blank_alu_src),
2125 }
2126 };
2127
2128 emit_mir_instruction(ctx, f2u8);
2129
2130 /* vmul.imov.quarter r0, r0, r0 */
2131
2132 midgard_instruction imov_8 = {
2133 .type = TAG_ALU_4,
2134 .ssa_args = {
2135 .src0 = SSA_UNUSED_1,
2136 .src1 = SSA_FIXED_REGISTER(0),
2137 .dest = SSA_FIXED_REGISTER(0),
2138 },
2139 .alu = {
2140 .op = midgard_alu_op_imov,
2141 .reg_mode = midgard_reg_mode_8,
2142 .dest_override = midgard_dest_override_none,
2143 .outmod = midgard_outmod_int_wrap,
2144 .mask = 0xFF,
2145 .src1 = vector_alu_srco_unsigned(blank_alu_src),
2146 .src2 = vector_alu_srco_unsigned(blank_alu_src),
2147 }
2148 };
2149
2150 /* Emit branch epilogue with the 8-bit move as the source */
2151
2152 emit_mir_instruction(ctx, imov_8);
2153 EMIT(alu_br_compact_cond, midgard_jmp_writeout_op_writeout, TAG_ALU_4, 0, midgard_condition_always);
2154
2155 emit_mir_instruction(ctx, imov_8);
2156 EMIT(alu_br_compact_cond, midgard_jmp_writeout_op_writeout, TAG_ALU_4, -1, midgard_condition_always);
2157 }
2158
2159 static midgard_block *
2160 emit_block(compiler_context *ctx, nir_block *block)
2161 {
2162 midgard_block *this_block = calloc(sizeof(midgard_block), 1);
2163 list_addtail(&this_block->link, &ctx->blocks);
2164
2165 this_block->is_scheduled = false;
2166 ++ctx->block_count;
2167
2168 ctx->texture_index[0] = -1;
2169 ctx->texture_index[1] = -1;
2170
2171 /* Add us as a successor to the block we are following */
2172 if (ctx->current_block)
2173 midgard_block_add_successor(ctx->current_block, this_block);
2174
2175 /* Set up current block */
2176 list_inithead(&this_block->instructions);
2177 ctx->current_block = this_block;
2178
2179 nir_foreach_instr(instr, block) {
2180 emit_instr(ctx, instr);
2181 ++ctx->instruction_count;
2182 }
2183
2184 inline_alu_constants(ctx);
2185 embedded_to_inline_constant(ctx);
2186
2187 /* Perform heavylifting for aliasing */
2188 actualise_ssa_to_alias(ctx);
2189
2190 midgard_pair_load_store(ctx, this_block);
2191
2192 /* Append fragment shader epilogue (value writeout) */
2193 if (ctx->stage == MESA_SHADER_FRAGMENT) {
2194 if (block == nir_impl_last_block(ctx->func->impl)) {
2195 if (ctx->is_blend)
2196 emit_blend_epilogue(ctx);
2197 else
2198 emit_fragment_epilogue(ctx);
2199 }
2200 }
2201
2202 if (block == nir_start_block(ctx->func->impl))
2203 ctx->initial_block = this_block;
2204
2205 if (block == nir_impl_last_block(ctx->func->impl))
2206 ctx->final_block = this_block;
2207
2208 /* Allow the next control flow to access us retroactively, for
2209 * branching etc */
2210 ctx->current_block = this_block;
2211
2212 /* Document the fallthrough chain */
2213 ctx->previous_source_block = this_block;
2214
2215 return this_block;
2216 }
2217
2218 static midgard_block *emit_cf_list(struct compiler_context *ctx, struct exec_list *list);
2219
2220 static void
2221 emit_if(struct compiler_context *ctx, nir_if *nif)
2222 {
2223 /* Conditional branches expect the condition in r31.w; emit a move for
2224 * that in the _previous_ block (which is the current block). */
2225 emit_condition(ctx, &nif->condition, true, COMPONENT_X);
2226
2227 /* Speculatively emit the branch, but we can't fill it in until later */
2228 EMIT(branch, true, true);
2229 midgard_instruction *then_branch = mir_last_in_block(ctx->current_block);
2230
2231 /* Emit the two subblocks */
2232 midgard_block *then_block = emit_cf_list(ctx, &nif->then_list);
2233
2234 /* Emit a jump from the end of the then block to the end of the else */
2235 EMIT(branch, false, false);
2236 midgard_instruction *then_exit = mir_last_in_block(ctx->current_block);
2237
2238 /* Emit second block, and check if it's empty */
2239
2240 int else_idx = ctx->block_count;
2241 int count_in = ctx->instruction_count;
2242 midgard_block *else_block = emit_cf_list(ctx, &nif->else_list);
2243 int after_else_idx = ctx->block_count;
2244
2245 /* Now that we have the subblocks emitted, fix up the branches */
2246
2247 assert(then_block);
2248 assert(else_block);
2249
2250 if (ctx->instruction_count == count_in) {
2251 /* The else block is empty, so don't emit an exit jump */
2252 mir_remove_instruction(then_exit);
2253 then_branch->branch.target_block = after_else_idx;
2254 } else {
2255 then_branch->branch.target_block = else_idx;
2256 then_exit->branch.target_block = after_else_idx;
2257 }
2258 }
2259
2260 static void
2261 emit_loop(struct compiler_context *ctx, nir_loop *nloop)
2262 {
2263 /* Remember where we are */
2264 midgard_block *start_block = ctx->current_block;
2265
2266 /* Allocate a loop number, growing the current inner loop depth */
2267 int loop_idx = ++ctx->current_loop_depth;
2268
2269 /* Get index from before the body so we can loop back later */
2270 int start_idx = ctx->block_count;
2271
2272 /* Emit the body itself */
2273 emit_cf_list(ctx, &nloop->body);
2274
2275 /* Branch back to loop back */
2276 struct midgard_instruction br_back = v_branch(false, false);
2277 br_back.branch.target_block = start_idx;
2278 emit_mir_instruction(ctx, br_back);
2279
2280 /* Mark down that branch in the graph. Note that we're really branching
2281 * to the block *after* we started in. TODO: Why doesn't the branch
2282 * itself have an off-by-one then...? */
2283 midgard_block_add_successor(ctx->current_block, start_block->successors[0]);
2284
2285 /* Find the index of the block about to follow us (note: we don't add
2286 * one; blocks are 0-indexed so we get a fencepost problem) */
2287 int break_block_idx = ctx->block_count;
2288
2289 /* Fix up the break statements we emitted to point to the right place,
2290 * now that we can allocate a block number for them */
2291
2292 list_for_each_entry_from(struct midgard_block, block, start_block, &ctx->blocks, link) {
2293 mir_foreach_instr_in_block(block, ins) {
2294 if (ins->type != TAG_ALU_4) continue;
2295 if (!ins->compact_branch) continue;
2296 if (ins->prepacked_branch) continue;
2297
2298 /* We found a branch -- check the type to see if we need to do anything */
2299 if (ins->branch.target_type != TARGET_BREAK) continue;
2300
2301 /* It's a break! Check if it's our break */
2302 if (ins->branch.target_break != loop_idx) continue;
2303
2304 /* Okay, cool, we're breaking out of this loop.
2305 * Rewrite from a break to a goto */
2306
2307 ins->branch.target_type = TARGET_GOTO;
2308 ins->branch.target_block = break_block_idx;
2309 }
2310 }
2311
2312 /* Now that we've finished emitting the loop, free up the depth again
2313 * so we play nice with recursion amid nested loops */
2314 --ctx->current_loop_depth;
2315 }
2316
2317 static midgard_block *
2318 emit_cf_list(struct compiler_context *ctx, struct exec_list *list)
2319 {
2320 midgard_block *start_block = NULL;
2321
2322 foreach_list_typed(nir_cf_node, node, node, list) {
2323 switch (node->type) {
2324 case nir_cf_node_block: {
2325 midgard_block *block = emit_block(ctx, nir_cf_node_as_block(node));
2326
2327 if (!start_block)
2328 start_block = block;
2329
2330 break;
2331 }
2332
2333 case nir_cf_node_if:
2334 emit_if(ctx, nir_cf_node_as_if(node));
2335 break;
2336
2337 case nir_cf_node_loop:
2338 emit_loop(ctx, nir_cf_node_as_loop(node));
2339 break;
2340
2341 case nir_cf_node_function:
2342 assert(0);
2343 break;
2344 }
2345 }
2346
2347 return start_block;
2348 }
2349
2350 /* Due to lookahead, we need to report the first tag executed in the command
2351 * stream and in branch targets. An initial block might be empty, so iterate
2352 * until we find one that 'works' */
2353
2354 static unsigned
2355 midgard_get_first_tag_from_block(compiler_context *ctx, unsigned block_idx)
2356 {
2357 midgard_block *initial_block = mir_get_block(ctx, block_idx);
2358
2359 unsigned first_tag = 0;
2360
2361 do {
2362 midgard_bundle *initial_bundle = util_dynarray_element(&initial_block->bundles, midgard_bundle, 0);
2363
2364 if (initial_bundle) {
2365 first_tag = initial_bundle->tag;
2366 break;
2367 }
2368
2369 /* Initial block is empty, try the next block */
2370 initial_block = list_first_entry(&(initial_block->link), midgard_block, link);
2371 } while(initial_block != NULL);
2372
2373 assert(first_tag);
2374 return first_tag;
2375 }
2376
2377 int
2378 midgard_compile_shader_nir(nir_shader *nir, midgard_program *program, bool is_blend)
2379 {
2380 struct util_dynarray *compiled = &program->compiled;
2381
2382 midgard_debug = debug_get_option_midgard_debug();
2383
2384 compiler_context ictx = {
2385 .nir = nir,
2386 .stage = nir->info.stage,
2387
2388 .is_blend = is_blend,
2389 .blend_constant_offset = -1,
2390
2391 .alpha_ref = program->alpha_ref
2392 };
2393
2394 compiler_context *ctx = &ictx;
2395
2396 /* TODO: Decide this at runtime */
2397 ctx->uniform_cutoff = 8;
2398
2399 /* Initialize at a global (not block) level hash tables */
2400
2401 ctx->ssa_constants = _mesa_hash_table_u64_create(NULL);
2402 ctx->ssa_to_alias = _mesa_hash_table_u64_create(NULL);
2403 ctx->hash_to_temp = _mesa_hash_table_u64_create(NULL);
2404 ctx->sysval_to_id = _mesa_hash_table_u64_create(NULL);
2405 ctx->leftover_ssa_to_alias = _mesa_set_create(NULL, _mesa_hash_pointer, _mesa_key_pointer_equal);
2406
2407 /* Record the varying mapping for the command stream's bookkeeping */
2408
2409 struct exec_list *varyings =
2410 ctx->stage == MESA_SHADER_VERTEX ? &nir->outputs : &nir->inputs;
2411
2412 unsigned max_varying = 0;
2413 nir_foreach_variable(var, varyings) {
2414 unsigned loc = var->data.driver_location;
2415 unsigned sz = glsl_type_size(var->type, FALSE);
2416
2417 for (int c = loc; c < (loc + sz); ++c) {
2418 program->varyings[c] = var->data.location;
2419 max_varying = MAX2(max_varying, c);
2420 }
2421 }
2422
2423 /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
2424 * (so we don't accidentally duplicate the epilogue since mesa/st has
2425 * messed with our I/O quite a bit already) */
2426
2427 NIR_PASS_V(nir, nir_lower_vars_to_ssa);
2428
2429 if (ctx->stage == MESA_SHADER_VERTEX)
2430 NIR_PASS_V(nir, nir_lower_viewport_transform);
2431
2432 NIR_PASS_V(nir, nir_lower_var_copies);
2433 NIR_PASS_V(nir, nir_lower_vars_to_ssa);
2434 NIR_PASS_V(nir, nir_split_var_copies);
2435 NIR_PASS_V(nir, nir_lower_var_copies);
2436 NIR_PASS_V(nir, nir_lower_global_vars_to_local);
2437 NIR_PASS_V(nir, nir_lower_var_copies);
2438 NIR_PASS_V(nir, nir_lower_vars_to_ssa);
2439
2440 NIR_PASS_V(nir, nir_lower_io, nir_var_all, glsl_type_size, 0);
2441
2442 /* Optimisation passes */
2443
2444 optimise_nir(nir);
2445
2446 if (midgard_debug & MIDGARD_DBG_SHADERS) {
2447 nir_print_shader(nir, stdout);
2448 }
2449
2450 /* Assign sysvals and counts, now that we're sure
2451 * (post-optimisation) */
2452
2453 midgard_nir_assign_sysvals(ctx, nir);
2454
2455 program->uniform_count = nir->num_uniforms;
2456 program->sysval_count = ctx->sysval_count;
2457 memcpy(program->sysvals, ctx->sysvals, sizeof(ctx->sysvals[0]) * ctx->sysval_count);
2458
2459 program->attribute_count = (ctx->stage == MESA_SHADER_VERTEX) ? nir->num_inputs : 0;
2460 program->varying_count = max_varying + 1; /* Fencepost off-by-one */
2461
2462 nir_foreach_function(func, nir) {
2463 if (!func->impl)
2464 continue;
2465
2466 list_inithead(&ctx->blocks);
2467 ctx->block_count = 0;
2468 ctx->func = func;
2469
2470 emit_cf_list(ctx, &func->impl->body);
2471 emit_block(ctx, func->impl->end_block);
2472
2473 break; /* TODO: Multi-function shaders */
2474 }
2475
2476 util_dynarray_init(compiled, NULL);
2477
2478 /* MIR-level optimizations */
2479
2480 bool progress = false;
2481
2482 do {
2483 progress = false;
2484
2485 mir_foreach_block(ctx, block) {
2486 progress |= midgard_opt_pos_propagate(ctx, block);
2487 progress |= midgard_opt_copy_prop(ctx, block);
2488 progress |= midgard_opt_copy_prop_tex(ctx, block);
2489 progress |= midgard_opt_dead_code_eliminate(ctx, block);
2490 }
2491 } while (progress);
2492
2493 /* Nested control-flow can result in dead branches at the end of the
2494 * block. This messes with our analysis and is just dead code, so cull
2495 * them */
2496 mir_foreach_block(ctx, block) {
2497 midgard_opt_cull_dead_branch(ctx, block);
2498 }
2499
2500 /* Schedule! */
2501 schedule_program(ctx);
2502
2503 /* Now that all the bundles are scheduled and we can calculate block
2504 * sizes, emit actual branch instructions rather than placeholders */
2505
2506 int br_block_idx = 0;
2507
2508 mir_foreach_block(ctx, block) {
2509 util_dynarray_foreach(&block->bundles, midgard_bundle, bundle) {
2510 for (int c = 0; c < bundle->instruction_count; ++c) {
2511 midgard_instruction *ins = bundle->instructions[c];
2512
2513 if (!midgard_is_branch_unit(ins->unit)) continue;
2514
2515 if (ins->prepacked_branch) continue;
2516
2517 /* Parse some basic branch info */
2518 bool is_compact = ins->unit == ALU_ENAB_BR_COMPACT;
2519 bool is_conditional = ins->branch.conditional;
2520 bool is_inverted = ins->branch.invert_conditional;
2521 bool is_discard = ins->branch.target_type == TARGET_DISCARD;
2522
2523 /* Determine the block we're jumping to */
2524 int target_number = ins->branch.target_block;
2525
2526 /* Report the destination tag */
2527 int dest_tag = is_discard ? 0 : midgard_get_first_tag_from_block(ctx, target_number);
2528
2529 /* Count up the number of quadwords we're
2530 * jumping over = number of quadwords until
2531 * (br_block_idx, target_number) */
2532
2533 int quadword_offset = 0;
2534
2535 if (is_discard) {
2536 /* Jump to the end of the shader. We
2537 * need to include not only the
2538 * following blocks, but also the
2539 * contents of our current block (since
2540 * discard can come in the middle of
2541 * the block) */
2542
2543 midgard_block *blk = mir_get_block(ctx, br_block_idx + 1);
2544
2545 for (midgard_bundle *bun = bundle + 1; bun < (midgard_bundle *)((char*) block->bundles.data + block->bundles.size); ++bun) {
2546 quadword_offset += quadword_size(bun->tag);
2547 }
2548
2549 mir_foreach_block_from(ctx, blk, b) {
2550 quadword_offset += b->quadword_count;
2551 }
2552
2553 } else if (target_number > br_block_idx) {
2554 /* Jump forward */
2555
2556 for (int idx = br_block_idx + 1; idx < target_number; ++idx) {
2557 midgard_block *blk = mir_get_block(ctx, idx);
2558 assert(blk);
2559
2560 quadword_offset += blk->quadword_count;
2561 }
2562 } else {
2563 /* Jump backwards */
2564
2565 for (int idx = br_block_idx; idx >= target_number; --idx) {
2566 midgard_block *blk = mir_get_block(ctx, idx);
2567 assert(blk);
2568
2569 quadword_offset -= blk->quadword_count;
2570 }
2571 }
2572
2573 /* Unconditional extended branches (far jumps)
2574 * have issues, so we always use a conditional
2575 * branch, setting the condition to always for
2576 * unconditional. For compact unconditional
2577 * branches, cond isn't used so it doesn't
2578 * matter what we pick. */
2579
2580 midgard_condition cond =
2581 !is_conditional ? midgard_condition_always :
2582 is_inverted ? midgard_condition_false :
2583 midgard_condition_true;
2584
2585 midgard_jmp_writeout_op op =
2586 is_discard ? midgard_jmp_writeout_op_discard :
2587 (is_compact && !is_conditional) ? midgard_jmp_writeout_op_branch_uncond :
2588 midgard_jmp_writeout_op_branch_cond;
2589
2590 if (!is_compact) {
2591 midgard_branch_extended branch =
2592 midgard_create_branch_extended(
2593 cond, op,
2594 dest_tag,
2595 quadword_offset);
2596
2597 memcpy(&ins->branch_extended, &branch, sizeof(branch));
2598 } else if (is_conditional || is_discard) {
2599 midgard_branch_cond branch = {
2600 .op = op,
2601 .dest_tag = dest_tag,
2602 .offset = quadword_offset,
2603 .cond = cond
2604 };
2605
2606 assert(branch.offset == quadword_offset);
2607
2608 memcpy(&ins->br_compact, &branch, sizeof(branch));
2609 } else {
2610 assert(op == midgard_jmp_writeout_op_branch_uncond);
2611
2612 midgard_branch_uncond branch = {
2613 .op = op,
2614 .dest_tag = dest_tag,
2615 .offset = quadword_offset,
2616 .unknown = 1
2617 };
2618
2619 assert(branch.offset == quadword_offset);
2620
2621 memcpy(&ins->br_compact, &branch, sizeof(branch));
2622 }
2623 }
2624 }
2625
2626 ++br_block_idx;
2627 }
2628
2629 /* Emit flat binary from the instruction arrays. Iterate each block in
2630 * sequence. Save instruction boundaries such that lookahead tags can
2631 * be assigned easily */
2632
2633 /* Cache _all_ bundles in source order for lookahead across failed branches */
2634
2635 int bundle_count = 0;
2636 mir_foreach_block(ctx, block) {
2637 bundle_count += block->bundles.size / sizeof(midgard_bundle);
2638 }
2639 midgard_bundle **source_order_bundles = malloc(sizeof(midgard_bundle *) * bundle_count);
2640 int bundle_idx = 0;
2641 mir_foreach_block(ctx, block) {
2642 util_dynarray_foreach(&block->bundles, midgard_bundle, bundle) {
2643 source_order_bundles[bundle_idx++] = bundle;
2644 }
2645 }
2646
2647 int current_bundle = 0;
2648
2649 /* Midgard prefetches instruction types, so during emission we
2650 * need to lookahead. Unless this is the last instruction, in
2651 * which we return 1. Or if this is the second to last and the
2652 * last is an ALU, then it's also 1... */
2653
2654 mir_foreach_block(ctx, block) {
2655 mir_foreach_bundle_in_block(block, bundle) {
2656 int lookahead = 1;
2657
2658 if (current_bundle + 1 < bundle_count) {
2659 uint8_t next = source_order_bundles[current_bundle + 1]->tag;
2660
2661 if (!(current_bundle + 2 < bundle_count) && IS_ALU(next)) {
2662 lookahead = 1;
2663 } else {
2664 lookahead = next;
2665 }
2666 }
2667
2668 emit_binary_bundle(ctx, bundle, compiled, lookahead);
2669 ++current_bundle;
2670 }
2671
2672 /* TODO: Free deeper */
2673 //util_dynarray_fini(&block->instructions);
2674 }
2675
2676 free(source_order_bundles);
2677
2678 /* Report the very first tag executed */
2679 program->first_tag = midgard_get_first_tag_from_block(ctx, 0);
2680
2681 /* Deal with off-by-one related to the fencepost problem */
2682 program->work_register_count = ctx->work_registers + 1;
2683
2684 program->can_discard = ctx->can_discard;
2685 program->uniform_cutoff = ctx->uniform_cutoff;
2686
2687 program->blend_patch_offset = ctx->blend_constant_offset;
2688
2689 if (midgard_debug & MIDGARD_DBG_SHADERS)
2690 disassemble_midgard(program->compiled.data, program->compiled.size);
2691
2692 return 0;
2693 }