2 * Copyright (C) 2020 Collabora Ltd.
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23 * Authors (Collabora):
24 * Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
27 #ifndef __BIFROST_COMPILER_H
28 #define __BIFROST_COMPILER_H
31 #include "compiler/nir/nir.h"
32 #include "panfrost/util/pan_ir.h"
34 /* Bifrost opcodes are tricky -- the same op may exist on both FMA and
35 * ADD with two completely different opcodes, and opcodes can be varying
36 * length in some cases. Then we have different opcodes for int vs float
37 * and then sometimes even for different typesizes. Further, virtually
38 * every op has a number of flags which depend on the op. In constrast
39 * to Midgard where you have a strict ALU/LDST/TEX division and within
40 * ALU you have strict int/float and that's it... here it's a *lot* more
41 * involved. As such, we use something much higher level for our IR,
42 * encoding "classes" of operations, letting the opcode details get
43 * sorted out at emit time.
45 * Please keep this list alphabetized. Please use a dictionary if you
46 * don't know how to do that.
76 BI_SPECIAL
, /* _FAST on supported GPUs */
83 /* Properties of a class... */
84 extern unsigned bi_class_props
[BI_NUM_CLASSES
];
86 /* abs/neg/outmod valid for a float op */
87 #define BI_MODS (1 << 0)
89 /* Accepts a bi_cond */
90 #define BI_CONDITIONAL (1 << 1)
92 /* Accepts a bifrost_roundmode */
93 #define BI_ROUNDMODE (1 << 2)
95 /* Can be scheduled to FMA */
96 #define BI_SCHED_FMA (1 << 3)
98 /* Can be scheduled to ADD */
99 #define BI_SCHED_ADD (1 << 4)
101 /* Most ALU ops can do either, actually */
102 #define BI_SCHED_ALL (BI_SCHED_FMA | BI_SCHED_ADD)
104 /* Along with setting BI_SCHED_ADD, eats up the entire cycle, so FMA must be
105 * nopped out. Used for _FAST operations. */
106 #define BI_SCHED_SLOW (1 << 5)
108 /* Swizzling allowed for the 8/16-bit source */
109 #define BI_SWIZZLABLE (1 << 6)
111 /* For scheduling purposes this is a high latency instruction and must be at
112 * the end of a clause. Implies ADD */
113 #define BI_SCHED_HI_LATENCY (1 << 7)
115 /* Intrinsic is vectorized and acts with `vector_channels` components */
116 #define BI_VECTOR (1 << 8)
118 /* Use a data register for src0/dest respectively, bypassing the usual
119 * register accessor. Mutually exclusive. */
120 #define BI_DATA_REG_SRC (1 << 9)
121 #define BI_DATA_REG_DEST (1 << 10)
123 /* Quirk: cannot encode multiple abs on FMA in fp16 mode */
124 #define BI_NO_ABS_ABS_FP16_FMA (1 << 11)
126 /* It can't get any worse than csel4... can it? */
127 #define BIR_SRC_COUNT 4
130 struct bi_load_vary
{
131 enum bifrost_interp_mode interp_mode
;
136 /* BI_BRANCH encoding the details of the branch itself as well as a pointer to
137 * the target. We forward declare bi_block since this is mildly circular (not
138 * strictly, but this order of the file makes more sense I think)
140 * We define our own enum of conditions since the conditions in the hardware
141 * packed in crazy ways that would make manipulation unweildly (meaning changes
142 * based on port swapping, etc), so we defer dealing with that until emit time.
143 * Likewise, we expose NIR types instead of the crazy branch types, although
144 * the restrictions do eventually apply of course. */
158 /* Opcodes within a class */
171 /* fp32 log2() with low precision, suitable for GL or half_log2() in
172 * CL. In the first argument, takes x. Letting u be such that x =
173 * 2^{-m} u with m integer and 0.75 <= u < 1.5, returns
174 * log2(u) / (u - 1). */
176 BI_TABLE_LOG2_U_OVER_U_1_LOW
,
180 /* Takes two fp32 arguments and returns x + frexp(y). Used in
181 * low-precision log2 argument reduction on newer models. */
183 BI_REDUCE_ADD_FREXPM
,
194 /* fp32 exp2() with low precision, suitable for half_exp2() in CL or
195 * exp2() in GL. In the first argument, it takes f2i_rte(x * 2^24). In
196 * the second, it takes x itself. */
208 bool rshift
; /* false for lshift */
212 /* Constant indices. Indirect would need to be in src[..] like normal,
213 * we can reserve some sentinels there for that for future. */
214 unsigned texture_index
, sampler_index
;
218 struct list_head link
; /* Must be first */
221 /* Indices, see pan_ssa_index etc. Note zero is special cased
222 * to "no argument" */
224 unsigned src
[BIR_SRC_COUNT
];
226 /* 32-bit word offset for destination, added to the register number in
227 * RA when lowering combines */
228 unsigned dest_offset
;
230 /* If one of the sources has BIR_INDEX_CONSTANT */
238 /* Floating-point modifiers, type/class permitting. If not
239 * allowed for the type/class, these are ignored. */
240 enum bifrost_outmod outmod
;
241 bool src_abs
[BIR_SRC_COUNT
];
242 bool src_neg
[BIR_SRC_COUNT
];
244 /* Round mode (requires BI_ROUNDMODE) */
245 enum bifrost_roundmode roundmode
;
247 /* Destination type. Usually the type of the instruction
248 * itself, but if sources and destination have different
249 * types, the type of the destination wins (so f2i would be
250 * int). Zero if there is no destination. Bitsize included */
251 nir_alu_type dest_type
;
253 /* Source types if required by the class */
254 nir_alu_type src_types
[BIR_SRC_COUNT
];
256 /* If the source type is 8-bit or 16-bit such that SIMD is possible,
257 * and the class has BI_SWIZZLABLE, this is a swizzle in the usual
258 * sense. On non-SIMD instructions, it can be used for component
259 * selection, so we don't have to special case extraction. */
260 uint8_t swizzle
[BIR_SRC_COUNT
][NIR_MAX_VEC_COMPONENTS
];
262 /* For VECTOR ops, how many channels are written? */
263 unsigned vector_channels
;
265 /* The comparison op. BI_COND_ALWAYS may not be valid. */
268 /* A class-specific op from which the actual opcode can be derived
269 * (along with the above information) */
272 enum bi_minmax_op minmax
;
273 enum bi_bitwise_op bitwise
;
274 enum bi_special_op special
;
275 enum bi_reduce_op reduce
;
276 enum bi_table_op table
;
277 enum bi_frexp_op frexp
;
278 enum bi_tex_op texture
;
280 /* For FMA/ADD, should we add a biased exponent? */
284 /* Union for class-specific information */
286 enum bifrost_minmax_mode minmax
;
287 struct bi_load_vary load_vary
;
288 struct bi_block
*branch_target
;
290 /* For BLEND -- the location 0-7 */
291 unsigned blend_location
;
293 struct bi_bitwise bitwise
;
294 struct bi_texture texture
;
298 /* Scheduling takes place in two steps. Step 1 groups instructions within a
299 * block into distinct clauses (bi_clause). Step 2 schedules instructions
300 * within a clause into FMA/ADD pairs (bi_bundle).
302 * A bi_bundle contains two paired instruction pointers. If a slot is unfilled,
303 * leave it NULL; the emitter will fill in a nop.
312 struct list_head link
;
314 /* A clause can have 8 instructions in bundled FMA/ADD sense, so there
315 * can be 8 bundles. But each bundle can have both an FMA and an ADD,
316 * so a clause can have up to 16 bi_instructions. Whether bundles or
317 * instructions are used depends on where in scheduling we are. */
319 unsigned instruction_count
;
320 unsigned bundle_count
;
323 bi_instruction
*instructions
[16];
324 bi_bundle bundles
[8];
327 /* For scoreboarding -- the clause ID (this is not globally unique!)
328 * and its dependencies in terms of other clauses, computed during
329 * scheduling and used when emitting code. Dependencies expressed as a
330 * bitfield matching the hardware, except shifted by a clause (the
331 * shift back to the ISA's off-by-one encoding is worked out when
332 * emitting clauses) */
333 unsigned scoreboard_id
;
334 uint8_t dependencies
;
336 /* Back-to-back corresponds directly to the back-to-back bit. Branch
337 * conditional corresponds to the branch conditional bit except that in
338 * the emitted code it's always set if back-to-bit is, whereas we use
339 * the actual value (without back-to-back so to speak) internally */
341 bool branch_conditional
;
343 /* Assigned data register */
344 unsigned data_register
;
346 /* Corresponds to the usual bit but shifted by a clause */
347 bool data_register_write_barrier
;
349 /* Constants read by this clause. ISA limit. */
350 uint64_t constants
[8];
351 unsigned constant_count
;
353 /* What type of high latency instruction is here, basically */
354 unsigned clause_type
;
357 typedef struct bi_block
{
358 pan_block base
; /* must be first */
360 /* If true, uses clauses; if false, uses instructions */
362 struct list_head clauses
; /* list of bi_clause */
367 gl_shader_stage stage
;
368 struct list_head blocks
; /* list of bi_block */
369 struct panfrost_sysvals sysvals
;
372 /* During NIR->BIR */
373 nir_function_impl
*impl
;
374 bi_block
*current_block
;
375 unsigned block_name_count
;
376 bi_block
*after_block
;
377 bi_block
*break_block
;
378 bi_block
*continue_block
;
380 nir_alu_type
*blend_types
;
382 /* For creating temporaries */
385 /* Analysis results */
388 /* Stats for shader-db */
389 unsigned instruction_count
;
393 static inline bi_instruction
*
394 bi_emit(bi_context
*ctx
, bi_instruction ins
)
396 bi_instruction
*u
= rzalloc(ctx
, bi_instruction
);
397 memcpy(u
, &ins
, sizeof(ins
));
398 list_addtail(&u
->link
, &ctx
->current_block
->base
.instructions
);
402 static inline bi_instruction
*
403 bi_emit_before(bi_context
*ctx
, bi_instruction
*tag
, bi_instruction ins
)
405 bi_instruction
*u
= rzalloc(ctx
, bi_instruction
);
406 memcpy(u
, &ins
, sizeof(ins
));
407 list_addtail(&u
->link
, &tag
->link
);
412 bi_remove_instruction(bi_instruction
*ins
)
414 list_del(&ins
->link
);
417 /* If high bits are set, instead of SSA/registers, we have specials indexed by
418 * the low bits if necessary.
420 * Fixed register: do not allocate register, do not collect $200.
421 * Uniform: access a uniform register given by low bits.
422 * Constant: access the specified constant (specifies a bit offset / shift)
423 * Zero: special cased to avoid wasting a constant
424 * Passthrough: a bifrost_packed_src to passthrough T/T0/T1
427 #define BIR_INDEX_REGISTER (1 << 31)
428 #define BIR_INDEX_UNIFORM (1 << 30)
429 #define BIR_INDEX_CONSTANT (1 << 29)
430 #define BIR_INDEX_ZERO (1 << 28)
431 #define BIR_INDEX_PASS (1 << 27)
433 /* Keep me synced please so we can check src & BIR_SPECIAL */
435 #define BIR_SPECIAL ((BIR_INDEX_REGISTER | BIR_INDEX_UNIFORM) | \
436 (BIR_INDEX_CONSTANT | BIR_INDEX_ZERO | BIR_INDEX_PASS))
438 static inline unsigned
439 bi_max_temp(bi_context
*ctx
)
441 unsigned alloc
= MAX2(ctx
->impl
->reg_alloc
, ctx
->impl
->ssa_alloc
);
442 return ((alloc
+ 2 + ctx
->temp_alloc
) << 1);
445 static inline unsigned
446 bi_make_temp(bi_context
*ctx
)
448 return (ctx
->impl
->ssa_alloc
+ 1 + ctx
->temp_alloc
++) << 1;
451 static inline unsigned
452 bi_make_temp_reg(bi_context
*ctx
)
454 return ((ctx
->impl
->reg_alloc
+ ctx
->temp_alloc
++) << 1) | PAN_IS_REG
;
457 /* Iterators for Bifrost IR */
459 #define bi_foreach_block(ctx, v) \
460 list_for_each_entry(pan_block, v, &ctx->blocks, link)
462 #define bi_foreach_block_from(ctx, from, v) \
463 list_for_each_entry_from(pan_block, v, from, &ctx->blocks, link)
465 #define bi_foreach_instr_in_block(block, v) \
466 list_for_each_entry(bi_instruction, v, &(block)->base.instructions, link)
468 #define bi_foreach_instr_in_block_rev(block, v) \
469 list_for_each_entry_rev(bi_instruction, v, &(block)->base.instructions, link)
471 #define bi_foreach_instr_in_block_safe(block, v) \
472 list_for_each_entry_safe(bi_instruction, v, &(block)->base.instructions, link)
474 #define bi_foreach_instr_in_block_safe_rev(block, v) \
475 list_for_each_entry_safe_rev(bi_instruction, v, &(block)->base.instructions, link)
477 #define bi_foreach_instr_in_block_from(block, v, from) \
478 list_for_each_entry_from(bi_instruction, v, from, &(block)->base.instructions, link)
480 #define bi_foreach_instr_in_block_from_rev(block, v, from) \
481 list_for_each_entry_from_rev(bi_instruction, v, from, &(block)->base.instructions, link)
483 #define bi_foreach_clause_in_block(block, v) \
484 list_for_each_entry(bi_clause, v, &(block)->clauses, link)
486 #define bi_foreach_instr_global(ctx, v) \
487 bi_foreach_block(ctx, v_block) \
488 bi_foreach_instr_in_block((bi_block *) v_block, v)
490 #define bi_foreach_instr_global_safe(ctx, v) \
491 bi_foreach_block(ctx, v_block) \
492 bi_foreach_instr_in_block_safe((bi_block *) v_block, v)
494 /* Based on set_foreach, expanded with automatic type casts */
496 #define bi_foreach_predecessor(blk, v) \
497 struct set_entry *_entry_##v; \
499 for (_entry_##v = _mesa_set_next_entry(blk->base.predecessors, NULL), \
500 v = (bi_block *) (_entry_##v ? _entry_##v->key : NULL); \
501 _entry_##v != NULL; \
502 _entry_##v = _mesa_set_next_entry(blk->base.predecessors, _entry_##v), \
503 v = (bi_block *) (_entry_##v ? _entry_##v->key : NULL))
505 #define bi_foreach_src(ins, v) \
506 for (unsigned v = 0; v < ARRAY_SIZE(ins->src); ++v)
508 static inline bi_instruction
*
509 bi_prev_op(bi_instruction
*ins
)
511 return list_last_entry(&(ins
->link
), bi_instruction
, link
);
514 static inline bi_instruction
*
515 bi_next_op(bi_instruction
*ins
)
517 return list_first_entry(&(ins
->link
), bi_instruction
, link
);
520 static inline pan_block
*
521 pan_next_block(pan_block
*block
)
523 return list_first_entry(&(block
->link
), pan_block
, link
);
526 /* Special functions */
528 void bi_emit_fexp2(bi_context
*ctx
, nir_alu_instr
*instr
);
529 void bi_emit_flog2(bi_context
*ctx
, nir_alu_instr
*instr
);
531 /* BIR manipulation */
533 bool bi_has_outmod(bi_instruction
*ins
);
534 bool bi_has_source_mods(bi_instruction
*ins
);
535 bool bi_is_src_swizzled(bi_instruction
*ins
, unsigned s
);
536 bool bi_has_arg(bi_instruction
*ins
, unsigned arg
);
537 uint16_t bi_from_bytemask(uint16_t bytemask
, unsigned bytes
);
538 unsigned bi_get_component_count(bi_instruction
*ins
, signed s
);
539 uint16_t bi_bytemask_of_read_components(bi_instruction
*ins
, unsigned node
);
540 uint64_t bi_get_immediate(bi_instruction
*ins
, unsigned index
);
541 bool bi_writes_component(bi_instruction
*ins
, unsigned comp
);
542 unsigned bi_writemask(bi_instruction
*ins
);
546 void bi_lower_combine(bi_context
*ctx
, bi_block
*block
);
547 bool bi_opt_dead_code_eliminate(bi_context
*ctx
, bi_block
*block
);
548 void bi_schedule(bi_context
*ctx
);
549 void bi_register_allocate(bi_context
*ctx
);
553 void bi_compute_liveness(bi_context
*ctx
);
554 void bi_liveness_ins_update(uint16_t *live
, bi_instruction
*ins
, unsigned max
);
555 void bi_invalidate_liveness(bi_context
*ctx
);
556 bool bi_is_live_after(bi_context
*ctx
, bi_block
*block
, bi_instruction
*start
, int src
);
560 void bi_pack(bi_context
*ctx
, struct util_dynarray
*emission
);