804180e571a18bb9cebf809cedb6ad607039ce70
[mesa.git] / src / panfrost / midgard / compiler.h
1 /*
2 * Copyright (C) 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 #ifndef _MDG_COMPILER_H
25 #define _MDG_COMPILER_H
26
27 #include "midgard.h"
28 #include "helpers.h"
29 #include "midgard_compile.h"
30
31 #include "util/hash_table.h"
32 #include "util/u_dynarray.h"
33 #include "util/set.h"
34 #include "util/list.h"
35
36 #include "main/mtypes.h"
37 #include "compiler/nir_types.h"
38 #include "compiler/nir/nir.h"
39
40 /* Forward declare */
41 struct midgard_block;
42
43 /* Target types. Defaults to TARGET_GOTO (the type corresponding directly to
44 * the hardware), hence why that must be zero. TARGET_DISCARD signals this
45 * instruction is actually a discard op. */
46
47 #define TARGET_GOTO 0
48 #define TARGET_BREAK 1
49 #define TARGET_CONTINUE 2
50 #define TARGET_DISCARD 3
51
52 typedef struct midgard_branch {
53 /* If conditional, the condition is specified in r31.w */
54 bool conditional;
55
56 /* For conditionals, if this is true, we branch on FALSE. If false, we branch on TRUE. */
57 bool invert_conditional;
58
59 /* Branch targets: the start of a block, the start of a loop (continue), the end of a loop (break). Value is one of TARGET_ */
60 unsigned target_type;
61
62 /* The actual target */
63 union {
64 int target_block;
65 int target_break;
66 int target_continue;
67 };
68 } midgard_branch;
69
70 /* Instruction arguments represented as block-local SSA indices, rather than
71 * registers. Negative values mean unused. */
72
73 typedef struct {
74 int src0;
75 int src1;
76 int dest;
77
78 /* src1 is -not- SSA but instead a 16-bit inline constant to be smudged
79 * in. Only valid for ALU ops. */
80 bool inline_constant;
81 } ssa_args;
82
83 /* Generic in-memory data type repesenting a single logical instruction, rather
84 * than a single instruction group. This is the preferred form for code gen.
85 * Multiple midgard_insturctions will later be combined during scheduling,
86 * though this is not represented in this structure. Its format bridges
87 * the low-level binary representation with the higher level semantic meaning.
88 *
89 * Notably, it allows registers to be specified as block local SSA, for code
90 * emitted before the register allocation pass.
91 */
92
93 typedef struct midgard_instruction {
94 /* Must be first for casting */
95 struct list_head link;
96
97 unsigned type; /* ALU, load/store, texture */
98
99 /* If the register allocator has not run yet... */
100 ssa_args ssa_args;
101
102 /* Special fields for an ALU instruction */
103 midgard_reg_info registers;
104
105 /* I.e. (1 << alu_bit) */
106 int unit;
107
108 /* When emitting bundle, should this instruction have a break forced
109 * before it? Used for r31 writes which are valid only within a single
110 * bundle and *need* to happen as early as possible... this is a hack,
111 * TODO remove when we have a scheduler */
112 bool precede_break;
113
114 bool has_constants;
115 float constants[4];
116 uint16_t inline_constant;
117 bool has_blend_constant;
118
119 bool compact_branch;
120 bool writeout;
121 bool prepacked_branch;
122
123 /* Masks in a saneish format. One bit per channel, not packed fancy.
124 * Use this instead of the op specific ones, and switch over at emit
125 * time */
126 uint16_t mask;
127
128 union {
129 midgard_load_store_word load_store;
130 midgard_vector_alu alu;
131 midgard_texture_word texture;
132 midgard_branch_extended branch_extended;
133 uint16_t br_compact;
134
135 /* General branch, rather than packed br_compact. Higher level
136 * than the other components */
137 midgard_branch branch;
138 };
139 } midgard_instruction;
140
141 typedef struct midgard_block {
142 /* Link to next block. Must be first for mir_get_block */
143 struct list_head link;
144
145 /* List of midgard_instructions emitted for the current block */
146 struct list_head instructions;
147
148 bool is_scheduled;
149
150 /* List of midgard_bundles emitted (after the scheduler has run) */
151 struct util_dynarray bundles;
152
153 /* Number of quadwords _actually_ emitted, as determined after scheduling */
154 unsigned quadword_count;
155
156 /* Successors: always one forward (the block after us), maybe
157 * one backwards (for a backward branch). No need for a second
158 * forward, since graph traversal would get there eventually
159 * anyway */
160 struct midgard_block *successors[2];
161 unsigned nr_successors;
162
163 /* The successors pointer form a graph, and in the case of
164 * complex control flow, this graph has a cycles. To aid
165 * traversal during liveness analysis, we have a visited?
166 * boolean for passes to use as they see fit, provided they
167 * clean up later */
168 bool visited;
169 } midgard_block;
170
171 typedef struct midgard_bundle {
172 /* Tag for the overall bundle */
173 int tag;
174
175 /* Instructions contained by the bundle */
176 int instruction_count;
177 midgard_instruction *instructions[5];
178
179 /* Bundle-wide ALU configuration */
180 int padding;
181 int control;
182 bool has_embedded_constants;
183 float constants[4];
184 bool has_blend_constant;
185 } midgard_bundle;
186
187 typedef struct compiler_context {
188 nir_shader *nir;
189 gl_shader_stage stage;
190
191 /* The screen we correspond to */
192 struct midgard_screen *screen;
193
194 /* Is internally a blend shader? Depends on stage == FRAGMENT */
195 bool is_blend;
196
197 /* Tracking for blend constant patching */
198 int blend_constant_offset;
199
200 /* Number of bytes used for Thread Local Storage */
201 unsigned tls_size;
202
203 /* Count of spills and fills for shaderdb */
204 unsigned spills;
205 unsigned fills;
206
207 /* Current NIR function */
208 nir_function *func;
209
210 /* Unordered list of midgard_blocks */
211 int block_count;
212 struct list_head blocks;
213
214 midgard_block *initial_block;
215 midgard_block *previous_source_block;
216 midgard_block *final_block;
217
218 /* List of midgard_instructions emitted for the current block */
219 midgard_block *current_block;
220
221 /* The current "depth" of the loop, for disambiguating breaks/continues
222 * when using nested loops */
223 int current_loop_depth;
224
225 /* Total number of loops for shader-db */
226 unsigned loop_count;
227
228 /* Constants which have been loaded, for later inlining */
229 struct hash_table_u64 *ssa_constants;
230
231 /* Mapping of hashes computed from NIR indices to the sequential temp indices ultimately used in MIR */
232 struct hash_table_u64 *hash_to_temp;
233 int temp_count;
234 int max_hash;
235
236 /* Just the count of the max register used. Higher count => higher
237 * register pressure */
238 int work_registers;
239
240 /* Used for cont/last hinting. Increase when a tex op is added.
241 * Decrease when a tex op is removed. */
242 int texture_op_count;
243
244 /* Mapping of texture register -> SSA index for unaliasing */
245 int texture_index[2];
246
247 /* The number of uniforms allowable for the fast path */
248 int uniform_cutoff;
249
250 /* Count of instructions emitted from NIR overall, across all blocks */
251 int instruction_count;
252
253 /* Alpha ref value passed in */
254 float alpha_ref;
255
256 /* The index corresponding to the fragment output */
257 unsigned fragment_output;
258
259 /* The mapping of sysvals to uniforms, the count, and the off-by-one inverse */
260 unsigned sysvals[MAX_SYSVAL_COUNT];
261 unsigned sysval_count;
262 struct hash_table_u64 *sysval_to_id;
263 } compiler_context;
264
265 /* Helpers for manipulating the above structures (forming the driver IR) */
266
267 /* Append instruction to end of current block */
268
269 static inline midgard_instruction *
270 mir_upload_ins(struct midgard_instruction ins)
271 {
272 midgard_instruction *heap = malloc(sizeof(ins));
273 memcpy(heap, &ins, sizeof(ins));
274 return heap;
275 }
276
277 static inline void
278 emit_mir_instruction(struct compiler_context *ctx, struct midgard_instruction ins)
279 {
280 list_addtail(&(mir_upload_ins(ins))->link, &ctx->current_block->instructions);
281 }
282
283 static inline void
284 mir_insert_instruction_before(struct midgard_instruction *tag, struct midgard_instruction ins)
285 {
286 list_addtail(&(mir_upload_ins(ins))->link, &tag->link);
287 }
288
289 static inline void
290 mir_remove_instruction(struct midgard_instruction *ins)
291 {
292 list_del(&ins->link);
293 }
294
295 static inline midgard_instruction*
296 mir_prev_op(struct midgard_instruction *ins)
297 {
298 return list_last_entry(&(ins->link), midgard_instruction, link);
299 }
300
301 static inline midgard_instruction*
302 mir_next_op(struct midgard_instruction *ins)
303 {
304 return list_first_entry(&(ins->link), midgard_instruction, link);
305 }
306
307 #define mir_foreach_block(ctx, v) \
308 list_for_each_entry(struct midgard_block, v, &ctx->blocks, link)
309
310 #define mir_foreach_block_from(ctx, from, v) \
311 list_for_each_entry_from(struct midgard_block, v, from, &ctx->blocks, link)
312
313 #define mir_foreach_instr(ctx, v) \
314 list_for_each_entry(struct midgard_instruction, v, &ctx->current_block->instructions, link)
315
316 #define mir_foreach_instr_safe(ctx, v) \
317 list_for_each_entry_safe(struct midgard_instruction, v, &ctx->current_block->instructions, link)
318
319 #define mir_foreach_instr_in_block(block, v) \
320 list_for_each_entry(struct midgard_instruction, v, &block->instructions, link)
321
322 #define mir_foreach_instr_in_block_safe(block, v) \
323 list_for_each_entry_safe(struct midgard_instruction, v, &block->instructions, link)
324
325 #define mir_foreach_instr_in_block_safe_rev(block, v) \
326 list_for_each_entry_safe_rev(struct midgard_instruction, v, &block->instructions, link)
327
328 #define mir_foreach_instr_in_block_from(block, v, from) \
329 list_for_each_entry_from(struct midgard_instruction, v, from, &block->instructions, link)
330
331 #define mir_foreach_instr_in_block_from_rev(block, v, from) \
332 list_for_each_entry_from_rev(struct midgard_instruction, v, from, &block->instructions, link)
333
334 #define mir_foreach_bundle_in_block(block, v) \
335 util_dynarray_foreach(&block->bundles, midgard_bundle, v)
336
337 #define mir_foreach_instr_global(ctx, v) \
338 mir_foreach_block(ctx, v_block) \
339 mir_foreach_instr_in_block(v_block, v)
340
341 #define mir_foreach_instr_global_safe(ctx, v) \
342 mir_foreach_block(ctx, v_block) \
343 mir_foreach_instr_in_block_safe(v_block, v)
344
345
346
347 static inline midgard_instruction *
348 mir_last_in_block(struct midgard_block *block)
349 {
350 return list_last_entry(&block->instructions, struct midgard_instruction, link);
351 }
352
353 static inline midgard_block *
354 mir_get_block(compiler_context *ctx, int idx)
355 {
356 struct list_head *lst = &ctx->blocks;
357
358 while ((idx--) + 1)
359 lst = lst->next;
360
361 return (struct midgard_block *) lst;
362 }
363
364 static inline bool
365 mir_is_alu_bundle(midgard_bundle *bundle)
366 {
367 return IS_ALU(bundle->tag);
368 }
369
370 /* MIR manipulation */
371
372 void mir_rewrite_index(compiler_context *ctx, unsigned old, unsigned new);
373 void mir_rewrite_index_src(compiler_context *ctx, unsigned old, unsigned new);
374 void mir_rewrite_index_dst(compiler_context *ctx, unsigned old, unsigned new);
375 void mir_rewrite_index_src_single(midgard_instruction *ins, unsigned old, unsigned new);
376 void mir_rewrite_index_src_tag(compiler_context *ctx, unsigned old, unsigned new, unsigned tag);
377 bool mir_single_use(compiler_context *ctx, unsigned value);
378 bool mir_special_index(compiler_context *ctx, unsigned idx);
379
380 /* MIR printing */
381
382 void mir_print_instruction(midgard_instruction *ins);
383 void mir_print_bundle(midgard_bundle *ctx);
384 void mir_print_block(midgard_block *block);
385 void mir_print_shader(compiler_context *ctx);
386 bool mir_nontrivial_source2_mod(midgard_instruction *ins);
387 bool mir_nontrivial_mod(midgard_vector_alu_src src, bool is_int, unsigned mask);
388
389 /* MIR goodies */
390
391 static const midgard_vector_alu_src blank_alu_src = {
392 .swizzle = SWIZZLE(COMPONENT_X, COMPONENT_Y, COMPONENT_Z, COMPONENT_W),
393 };
394
395 static const midgard_vector_alu_src blank_alu_src_xxxx = {
396 .swizzle = SWIZZLE(COMPONENT_X, COMPONENT_X, COMPONENT_X, COMPONENT_X),
397 };
398
399 static const midgard_scalar_alu_src blank_scalar_alu_src = {
400 .full = true
401 };
402
403 /* Used for encoding the unused source of 1-op instructions */
404 static const midgard_vector_alu_src zero_alu_src = { 0 };
405
406 /* 'Intrinsic' move for aliasing */
407
408 static inline midgard_instruction
409 v_mov(unsigned src, midgard_vector_alu_src mod, unsigned dest)
410 {
411 midgard_instruction ins = {
412 .type = TAG_ALU_4,
413 .mask = 0xF,
414 .ssa_args = {
415 .src0 = SSA_UNUSED_1,
416 .src1 = src,
417 .dest = dest,
418 },
419 .alu = {
420 .op = midgard_alu_op_imov,
421 .reg_mode = midgard_reg_mode_32,
422 .dest_override = midgard_dest_override_none,
423 .outmod = midgard_outmod_int_wrap,
424 .src1 = vector_alu_srco_unsigned(zero_alu_src),
425 .src2 = vector_alu_srco_unsigned(mod)
426 },
427 };
428
429 return ins;
430 }
431
432 static inline bool
433 mir_has_arg(midgard_instruction *ins, unsigned arg)
434 {
435 if (ins->ssa_args.src0 == arg)
436 return true;
437
438 if (ins->ssa_args.src1 == arg && !ins->ssa_args.inline_constant)
439 return true;
440
441 return false;
442 }
443
444 /* Scheduling */
445
446 void schedule_program(compiler_context *ctx);
447
448 /* Register allocation */
449
450 struct ra_graph;
451
452 /* Broad types of register classes so we can handle special
453 * registers */
454
455 #define NR_REG_CLASSES 3
456
457 #define REG_CLASS_WORK 0
458 #define REG_CLASS_LDST 1
459 #define REG_CLASS_LDST27 2
460 #define REG_CLASS_TEX 3
461
462 void mir_lower_special_reads(compiler_context *ctx);
463 struct ra_graph* allocate_registers(compiler_context *ctx, bool *spilled);
464 void install_registers(compiler_context *ctx, struct ra_graph *g);
465 bool mir_is_live_after(compiler_context *ctx, midgard_block *block, midgard_instruction *start, int src);
466 bool mir_has_multiple_writes(compiler_context *ctx, int src);
467
468 void mir_create_pipeline_registers(compiler_context *ctx);
469
470 void
471 midgard_promote_uniforms(compiler_context *ctx, unsigned pressure);
472
473 void
474 emit_ubo_read(
475 compiler_context *ctx,
476 unsigned dest,
477 unsigned offset,
478 nir_src *indirect_offset,
479 unsigned index);
480
481
482 /* Final emission */
483
484 void emit_binary_bundle(
485 compiler_context *ctx,
486 midgard_bundle *bundle,
487 struct util_dynarray *emission,
488 int next_tag);
489
490 /* NIR stuff. TODO: Move? Share? Something? */
491
492 bool
493 nir_undef_to_zero(nir_shader *shader);
494
495 void
496 nir_clamp_psiz(nir_shader *shader, float min_size, float max_size);
497
498 /* Optimizations */
499
500 bool midgard_opt_copy_prop(compiler_context *ctx, midgard_block *block);
501
502 #endif