2 * Copyright (C) 2019 Connor Abbott <cwabbott0@gmail.com>
3 * Copyright (C) 2019 Lyude Paul <thatslyude@gmail.com>
4 * Copyright (C) 2019 Ryan Houdek <Sonicadvance1@gmail.com>
5 * Copyright (C) 2019-2020 Collabora, Ltd.
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation
10 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
11 * and/or sell copies of the Software, and to permit persons to whom the
12 * Software is furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice (including the next
15 * paragraph) shall be included in all copies or substantial portions of the
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
21 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
22 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
23 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30 bi_clause_type_name(enum bifrost_clause_type T
)
33 case BIFROST_CLAUSE_NONE
: return "";
34 case BIFROST_CLAUSE_LOAD_VARY
: return "load_vary";
35 case BIFROST_CLAUSE_UBO
: return "ubo";
36 case BIFROST_CLAUSE_TEX
: return "tex";
37 case BIFROST_CLAUSE_SSBO_LOAD
: return "load";
38 case BIFROST_CLAUSE_SSBO_STORE
: return "store";
39 case BIFROST_CLAUSE_BLEND
: return "blend";
40 case BIFROST_CLAUSE_FRAGZ
: return "fragz";
41 case BIFROST_CLAUSE_ATEST
: return "atest";
42 case BIFROST_CLAUSE_64BIT
: return "64";
48 bi_output_mod_name(enum bifrost_outmod mod
)
51 case BIFROST_NONE
: return "";
52 case BIFROST_POS
: return ".pos";
53 case BIFROST_SAT_SIGNED
: return ".sat_signed";
54 case BIFROST_SAT
: return ".sat";
55 default: return "invalid";
60 bi_minmax_mode_name(enum bifrost_minmax_mode mod
)
63 case BIFROST_MINMAX_NONE
: return "";
64 case BIFROST_NAN_WINS
: return ".nan_wins";
65 case BIFROST_SRC1_WINS
: return ".src1_wins";
66 case BIFROST_SRC0_WINS
: return ".src0_wins";
67 default: return "invalid";
72 bi_round_mode_name(enum bifrost_roundmode mod
)
75 case BIFROST_RTE
: return "";
76 case BIFROST_RTP
: return ".rtp";
77 case BIFROST_RTN
: return ".rtn";
78 case BIFROST_RTZ
: return ".rtz";
79 default: return "invalid";
84 bi_csel_cond_name(enum bifrost_csel_cond cond
)
87 case BIFROST_FEQ_F
: return "feq.f";
88 case BIFROST_FGT_F
: return "fgt.f";
89 case BIFROST_FGE_F
: return "fge.f";
90 case BIFROST_IEQ_F
: return "ieq.f";
91 case BIFROST_IGT_I
: return "igt.i";
92 case BIFROST_IGE_I
: return "uge.i";
93 case BIFROST_UGT_I
: return "ugt.i";
94 case BIFROST_UGE_I
: return "uge.i";
95 default: return "invalid";
100 bi_interp_mode_name(enum bifrost_interp_mode mode
)
103 case BIFROST_INTERP_PER_FRAG
: return ".per_frag";
104 case BIFROST_INTERP_CENTROID
: return ".centroid";
105 case BIFROST_INTERP_DEFAULT
: return "";
106 case BIFROST_INTERP_EXPLICIT
: return ".explicit";
107 default: return ".unknown";
112 bi_ldst_type_name(enum bifrost_ldst_type type
)
115 case BIFROST_LDST_F16
: return "f16";
116 case BIFROST_LDST_F32
: return "f32";
117 case BIFROST_LDST_I32
: return "i32";
118 case BIFROST_LDST_U32
: return "u32";
119 default: return "invalid";
123 /* The remaining functions in this file are for IR-internal
124 * structures; the disassembler doesn't use them */
127 bi_class_name(enum bi_class cl
)
130 case BI_ADD
: return "add";
131 case BI_ATEST
: return "atest";
132 case BI_BRANCH
: return "branch";
133 case BI_CMP
: return "cmp";
134 case BI_BLEND
: return "blend";
135 case BI_BITWISE
: return "bitwise";
136 case BI_COMBINE
: return "combine";
137 case BI_CONVERT
: return "convert";
138 case BI_CSEL
: return "csel";
139 case BI_DISCARD
: return "discard";
140 case BI_FMA
: return "fma";
141 case BI_FMOV
: return "fmov";
142 case BI_FREXP
: return "frexp";
143 case BI_IMATH
: return "imath";
144 case BI_LOAD
: return "load";
145 case BI_LOAD_UNIFORM
: return "load_uniform";
146 case BI_LOAD_ATTR
: return "load_attr";
147 case BI_LOAD_VAR
: return "load_var";
148 case BI_LOAD_VAR_ADDRESS
: return "load_var_address";
149 case BI_MINMAX
: return "minmax";
150 case BI_MOV
: return "mov";
151 case BI_SELECT
: return "select";
152 case BI_SHIFT
: return "shift";
153 case BI_STORE
: return "store";
154 case BI_STORE_VAR
: return "store_var";
155 case BI_SPECIAL
: return "special";
156 case BI_TABLE
: return "table";
157 case BI_TEX
: return "tex";
158 case BI_ROUND
: return "round";
159 default: return "unknown_class";
164 bi_print_dest_index(FILE *fp
, bi_instruction
*ins
, unsigned index
)
168 else if (index
& BIR_INDEX_REGISTER
)
169 fprintf(fp
, "br%u", index
& ~BIR_INDEX_REGISTER
);
170 else if (index
& PAN_IS_REG
)
171 fprintf(fp
, "r%u", index
>> 1);
172 else if (!(index
& BIR_SPECIAL
))
173 fprintf(fp
, "%u", (index
>> 1) - 1);
181 bi_print_index(FILE *fp
, bi_instruction
*ins
, unsigned index
, unsigned s
)
183 if (bi_print_dest_index(fp
, ins
, index
))
186 if (index
& BIR_INDEX_UNIFORM
)
187 fprintf(fp
, "u%u", index
& ~BIR_INDEX_UNIFORM
);
188 else if (index
& BIR_INDEX_CONSTANT
)
189 fprintf(fp
, "#0x%" PRIx64
, bi_get_immediate(ins
, s
));
190 else if (index
& BIR_INDEX_ZERO
)
197 bi_print_src(FILE *fp
, bi_instruction
*ins
, unsigned s
)
199 unsigned src
= ins
->src
[s
];
200 bool mods
= bi_has_source_mods(ins
);
201 bool abs
= ins
->src_abs
[s
] && mods
;
202 bool neg
= ins
->src_neg
[s
] && mods
;
210 if (ins
->type
== BI_BITWISE
&& ins
->bitwise
.src_invert
[s
])
213 bi_print_index(fp
, ins
, src
, s
);
220 bi_print_swizzle(bi_instruction
*ins
, unsigned src
, FILE *fp
)
224 for (unsigned u
= 0; u
< bi_get_component_count(ins
, src
); ++u
) {
225 assert(ins
->swizzle
[src
][u
] < 4);
226 fputc("xyzw"[ins
->swizzle
[src
][u
]], fp
);
231 bi_bitwise_op_name(enum bi_bitwise_op op
)
234 case BI_BITWISE_AND
: return "and";
235 case BI_BITWISE_OR
: return "or";
236 case BI_BITWISE_XOR
: return "xor";
237 default: return "invalid";
242 bi_imath_op_name(enum bi_imath_op op
)
245 case BI_IMATH_ADD
: return "iadd";
246 case BI_IMATH_SUB
: return "isub";
247 default: return "invalid";
252 bi_table_op_name(enum bi_table_op op
)
255 case BI_TABLE_LOG2_U_OVER_U_1_LOW
: return "log2.help";
256 default: return "invalid";
261 bi_special_op_name(enum bi_special_op op
)
264 case BI_SPECIAL_FRCP
: return "frcp";
265 case BI_SPECIAL_FRSQ
: return "frsq";
266 case BI_SPECIAL_EXP2_LOW
: return "exp2_low";
267 default: return "invalid";
272 bi_reduce_op_name(enum bi_reduce_op op
)
275 case BI_REDUCE_ADD_FREXPM
: return "add_frexpm";
276 default: return "invalid";
281 bi_frexp_op_name(enum bi_frexp_op op
)
284 case BI_FREXPE_LOG
: return "frexpe_log";
285 default: return "invalid";
290 bi_tex_op_name(enum bi_tex_op op
)
293 case BI_TEX_NORMAL
: return "normal";
294 case BI_TEX_COMPACT
: return "compact";
295 case BI_TEX_DUAL
: return "dual";
296 default: return "invalid";
301 bi_print_load_vary(struct bi_load_vary
*load
, FILE *fp
)
303 fprintf(fp
, "%s", bi_interp_mode_name(load
->interp_mode
));
306 fprintf(fp
, ".reuse");
309 fprintf(fp
, ".flat");
313 bi_cond_name(enum bi_cond cond
)
316 case BI_COND_ALWAYS
: return "always";
317 case BI_COND_LT
: return "lt";
318 case BI_COND_LE
: return "le";
319 case BI_COND_GE
: return "ge";
320 case BI_COND_GT
: return "gt";
321 case BI_COND_EQ
: return "eq";
322 case BI_COND_NE
: return "ne";
323 default: return "invalid";
328 bi_print_texture(struct bi_texture
*tex
, FILE *fp
)
330 fprintf(fp
, " - texture %u, sampler %u",
331 tex
->texture_index
, tex
->sampler_index
);
335 bi_print_instruction(bi_instruction
*ins
, FILE *fp
)
337 if (ins
->type
== BI_MINMAX
)
338 fprintf(fp
, "%s", ins
->op
.minmax
== BI_MINMAX_MIN
? "min" : "max");
339 else if (ins
->type
== BI_BITWISE
)
340 fprintf(fp
, "%s", bi_bitwise_op_name(ins
->op
.bitwise
));
341 else if (ins
->type
== BI_IMATH
)
342 fprintf(fp
, "%s", bi_imath_op_name(ins
->op
.imath
));
343 else if (ins
->type
== BI_SPECIAL
)
344 fprintf(fp
, "%s", bi_special_op_name(ins
->op
.special
));
345 else if (ins
->type
== BI_TABLE
)
346 fprintf(fp
, "%s", bi_table_op_name(ins
->op
.table
));
347 else if (ins
->type
== BI_REDUCE_FMA
)
348 fprintf(fp
, "%s", bi_reduce_op_name(ins
->op
.reduce
));
349 else if (ins
->type
== BI_FREXP
)
350 fprintf(fp
, "%s", bi_frexp_op_name(ins
->op
.frexp
));
352 fprintf(fp
, "%s", bi_class_name(ins
->type
));
354 if ((ins
->type
== BI_ADD
|| ins
->type
== BI_FMA
) && ins
->op
.mscale
)
355 fprintf(fp
, ".mscale");
357 if (ins
->type
== BI_MINMAX
)
358 fprintf(fp
, "%s", bi_minmax_mode_name(ins
->minmax
));
359 else if (ins
->type
== BI_LOAD_VAR
)
360 bi_print_load_vary(&ins
->load_vary
, fp
);
361 else if (ins
->type
== BI_BLEND
)
362 fprintf(fp
, ".loc%u", ins
->blend_location
);
363 else if (ins
->type
== BI_TEX
) {
364 fprintf(fp
, ".%s", bi_tex_op_name(ins
->op
.texture
));
365 } else if (ins
->type
== BI_BITWISE
)
366 fprintf(fp
, ".%cshift", ins
->bitwise
.rshift
? 'r' : 'l');
368 if (bi_class_props
[ins
->type
] & BI_CONDITIONAL
)
369 fprintf(fp
, ".%s", bi_cond_name(ins
->cond
));
371 if (ins
->vector_channels
)
372 fprintf(fp
, ".v%u", ins
->vector_channels
);
375 pan_print_alu_type(ins
->dest_type
, fp
);
377 if (bi_has_outmod(ins
))
378 fprintf(fp
, "%s", bi_output_mod_name(ins
->outmod
));
380 if (bi_class_props
[ins
->type
] & BI_ROUNDMODE
)
381 fprintf(fp
, "%s", bi_round_mode_name(ins
->roundmode
));
384 bool succ
= bi_print_dest_index(fp
, ins
, ins
->dest
);
387 if (ins
->dest_offset
)
388 fprintf(fp
, "+%u", ins
->dest_offset
);
392 bi_foreach_src(ins
, s
) {
393 bi_print_src(fp
, ins
, s
);
395 if (ins
->src
[s
] && !(ins
->src
[s
] & (BIR_INDEX_CONSTANT
| BIR_INDEX_ZERO
))) {
396 pan_print_alu_type(ins
->src_types
[s
], fp
);
397 bi_print_swizzle(ins
, s
, fp
);
400 if (s
< BIR_SRC_COUNT
)
404 if (ins
->type
== BI_BRANCH
) {
405 assert(ins
->branch_target
);
406 fprintf(fp
, "-> block%u", ins
->branch_target
->base
.name
);
407 } else if (ins
->type
== BI_TEX
) {
408 bi_print_texture(&ins
->texture
, fp
);
415 bi_print_ports(struct bi_registers
*regs
)
417 for (unsigned i
= 0; i
< 2; ++i
) {
418 if (regs
->enabled
[i
])
419 printf("port %u: %u\n", i
, regs
->port
[i
]);
422 if (regs
->write_fma
|| regs
->write_add
) {
423 printf("port 2 (%s): %u\n",
424 regs
->write_add
? "ADD" : "FMA",
428 if ((regs
->write_fma
&& regs
->write_add
) || regs
->read_port3
) {
429 printf("port 3 (%s): %u\n",
430 regs
->read_port3
? "read" : "FMA",
436 bi_print_bundle(bi_bundle
*bundle
, FILE *fp
)
438 bi_instruction
*ins
[2] = { bundle
->fma
, bundle
->add
};
440 for (unsigned i
= 0; i
< 2; ++i
) {
442 bi_print_instruction(ins
[i
], fp
);
444 fprintf(fp
, "nop\n");
449 bi_print_clause(bi_clause
*clause
, FILE *fp
)
451 fprintf(fp
, "\tid(%u)", clause
->scoreboard_id
);
453 if (clause
->dependencies
) {
454 fprintf(fp
, ", wait(");
456 for (unsigned i
= 0; i
< 8; ++i
) {
457 if (clause
->dependencies
& (1 << i
))
458 fprintf(fp
, "%u ", i
);
464 if (!clause
->back_to_back
)
465 fprintf(fp
, " nbb %s", clause
->branch_conditional
? "branch-cond" : "branch-uncond");
467 if (clause
->data_register_write_barrier
)
468 fprintf(fp
, " drwb");
472 if (clause
->instruction_count
) {
473 assert(!clause
->bundle_count
);
475 for (unsigned i
= 0; i
< clause
->instruction_count
; ++i
)
476 bi_print_instruction(clause
->instructions
[i
], fp
);
478 assert(clause
->bundle_count
);
480 for (unsigned i
= 0; i
< clause
->bundle_count
; ++i
)
481 bi_print_bundle(&clause
->bundles
[i
], fp
);
484 if (clause
->constant_count
) {
485 for (unsigned i
= 0; i
< clause
->constant_count
; ++i
)
486 fprintf(fp
, "%" PRIx64
" ", clause
->constants
[i
]);
493 bi_print_block(bi_block
*block
, FILE *fp
)
495 fprintf(fp
, "block%u {\n", block
->base
.name
);
497 if (block
->scheduled
) {
498 bi_foreach_clause_in_block(block
, clause
)
499 bi_print_clause(clause
, fp
);
501 bi_foreach_instr_in_block(block
, ins
)
502 bi_print_instruction(ins
, fp
);
507 if (block
->base
.successors
[0]) {
510 pan_foreach_successor((&block
->base
), succ
)
511 fprintf(fp
, "block%u ", succ
->name
);
514 if (block
->base
.predecessors
->entries
) {
515 fprintf(fp
, " from");
517 bi_foreach_predecessor(block
, pred
)
518 fprintf(fp
, " block%u", pred
->base
.name
);
525 bi_print_shader(bi_context
*ctx
, FILE *fp
)
527 bi_foreach_block(ctx
, block
)
528 bi_print_block((bi_block
*) block
, fp
);