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_ATEST
: return "atest";
41 case BIFROST_CLAUSE_64BIT
: return "64";
47 bi_output_mod_name(enum bifrost_outmod mod
)
50 case BIFROST_NONE
: return "";
51 case BIFROST_POS
: return ".pos";
52 case BIFROST_SAT_SIGNED
: return ".sat_signed";
53 case BIFROST_SAT
: return ".sat";
54 default: return "invalid";
59 bi_minmax_mode_name(enum bifrost_minmax_mode mod
)
62 case BIFROST_MINMAX_NONE
: return "";
63 case BIFROST_NAN_WINS
: return ".nan_wins";
64 case BIFROST_SRC1_WINS
: return ".src1_wins";
65 case BIFROST_SRC0_WINS
: return ".src0_wins";
66 default: return "invalid";
71 bi_round_mode_name(enum bifrost_roundmode mod
)
74 case BIFROST_RTE
: return "";
75 case BIFROST_RTP
: return ".rtp";
76 case BIFROST_RTN
: return ".rtn";
77 case BIFROST_RTZ
: return ".rtz";
78 default: return "invalid";
83 bi_csel_cond_name(enum bifrost_csel_cond cond
)
86 case BIFROST_FEQ_F
: return "feq.f";
87 case BIFROST_FGT_F
: return "fgt.f";
88 case BIFROST_FGE_F
: return "fge.f";
89 case BIFROST_IEQ_F
: return "ieq.f";
90 case BIFROST_IGT_I
: return "igt.i";
91 case BIFROST_IGE_I
: return "uge.i";
92 case BIFROST_UGT_I
: return "ugt.i";
93 case BIFROST_UGE_I
: return "uge.i";
94 default: return "invalid";
99 bi_interp_mode_name(enum bifrost_interp_mode mode
)
102 case BIFROST_INTERP_PER_FRAG
: return ".per_frag";
103 case BIFROST_INTERP_CENTROID
: return ".centroid";
104 case BIFROST_INTERP_DEFAULT
: return "";
105 case BIFROST_INTERP_EXPLICIT
: return ".explicit";
106 default: return ".unknown";
111 bi_ldst_type_name(enum bifrost_ldst_type type
)
114 case BIFROST_LDST_F16
: return "f16";
115 case BIFROST_LDST_F32
: return "f32";
116 case BIFROST_LDST_I32
: return "i32";
117 case BIFROST_LDST_U32
: return "u32";
118 default: return "invalid";
122 /* The remaining functions in this file are for IR-internal
123 * structures; the disassembler doesn't use them */
126 bi_class_name(enum bi_class cl
)
129 case BI_ADD
: return "add";
130 case BI_ATEST
: return "atest";
131 case BI_BRANCH
: return "branch";
132 case BI_CMP
: return "cmp";
133 case BI_BLEND
: return "blend";
134 case BI_BITWISE
: return "bitwise";
135 case BI_CONVERT
: return "convert";
136 case BI_CSEL
: return "csel";
137 case BI_DISCARD
: return "discard";
138 case BI_FMA
: return "fma";
139 case BI_FREXP
: return "frexp";
140 case BI_ISUB
: return "isub";
141 case BI_LOAD
: return "load";
142 case BI_LOAD_UNIFORM
: return "load_uniform";
143 case BI_LOAD_ATTR
: return "load_attr";
144 case BI_LOAD_VAR
: return "load_var";
145 case BI_LOAD_VAR_ADDRESS
: return "load_var_address";
146 case BI_MINMAX
: return "minmax";
147 case BI_MOV
: return "mov";
148 case BI_SHIFT
: return "shift";
149 case BI_STORE
: return "store";
150 case BI_STORE_VAR
: return "store_var";
151 case BI_SPECIAL
: return "special";
152 case BI_SWIZZLE
: return "swizzle";
153 case BI_TEX
: return "tex";
154 case BI_ROUND
: return "round";
155 default: return "unknown_class";
160 bi_print_index(FILE *fp
, bi_instruction
*ins
, unsigned index
)
164 else if (index
& BIR_INDEX_REGISTER
)
165 fprintf(fp
, "br%u", index
& ~BIR_INDEX_REGISTER
);
166 else if (index
& BIR_INDEX_UNIFORM
)
167 fprintf(fp
, "u%u", index
& ~BIR_INDEX_UNIFORM
);
168 else if (index
& BIR_INDEX_CONSTANT
)
169 fprintf(fp
, "#0x%" PRIx64
, bi_get_immediate(ins
, index
));
170 else if (index
& BIR_INDEX_ZERO
)
172 else if (index
& BIR_IS_REG
)
173 fprintf(fp
, "r%u", index
>> 1);
175 fprintf(fp
, "%u", (index
>> 1) - 1);
179 bi_print_src(FILE *fp
, bi_instruction
*ins
, unsigned s
)
181 unsigned src
= ins
->src
[s
];
182 bool mods
= bi_has_source_mods(ins
);
183 bool abs
= ins
->src_abs
[s
] && mods
;
184 bool neg
= ins
->src_neg
[s
] && mods
;
192 bi_print_index(fp
, ins
, src
);
198 /* Prints a NIR ALU type in Bifrost-style ".f32" ".i8" etc */
201 bi_print_alu_type(nir_alu_type t
, FILE *fp
)
203 unsigned size
= nir_alu_type_get_type_size(t
);
204 nir_alu_type base
= nir_alu_type_get_base_type(t
);
220 fprintf(fp
, ".unknown");
224 fprintf(fp
, "%u", size
);
228 bi_print_swizzle(bi_instruction
*ins
, unsigned src
, FILE *fp
)
230 unsigned size
= nir_alu_type_get_type_size(ins
->dest_type
);
231 unsigned count
= (size
== 64) ? 1 : (32 / size
);
235 for (unsigned u
= 0; u
< count
; ++u
) {
236 assert(ins
->swizzle
[src
][u
] < 4);
237 fputc("xyzw"[ins
->swizzle
[src
][u
]], fp
);
242 bi_bitwise_op_name(enum bi_bitwise_op op
)
245 case BI_BITWISE_AND
: return "and";
246 case BI_BITWISE_OR
: return "or";
247 case BI_BITWISE_XOR
: return "xor";
248 default: return "invalid";
253 bi_special_op_name(enum bi_special_op op
)
256 case BI_SPECIAL_FRCP
: return "frcp";
257 case BI_SPECIAL_FRSQ
: return "frsq";
258 case BI_SPECIAL_FATAN
: return "fatan";
259 case BI_SPECIAL_FSIN
: return "fsin";
260 case BI_SPECIAL_FCOS
: return "fcos";
261 case BI_SPECIAL_FEXP
: return "fexp";
262 case BI_SPECIAL_FLOG2
: return "flog2";
263 case BI_SPECIAL_FLOGE
: return "flog";
264 default: return "invalid";
269 bi_print_load_vary(struct bi_load_vary
*load
, FILE *fp
)
271 fprintf(fp
, "%s", bi_interp_mode_name(load
->interp_mode
));
274 fprintf(fp
, ".reuse");
277 fprintf(fp
, ".flat");
281 bi_cond_name(enum bi_cond cond
)
284 case BI_COND_ALWAYS
: return "always";
285 case BI_COND_LT
: return "lt";
286 case BI_COND_LE
: return "le";
287 case BI_COND_GE
: return "ge";
288 case BI_COND_GT
: return "gt";
289 case BI_COND_EQ
: return "eq";
290 case BI_COND_NE
: return "ne";
291 default: return "invalid";
296 bi_print_branch(struct bi_branch
*branch
, FILE *fp
)
298 fprintf(fp
, ".%s", bi_cond_name(branch
->cond
));
302 bi_print_writemask(bi_instruction
*ins
, FILE *fp
)
304 unsigned bits_per_comp
= nir_alu_type_get_type_size(ins
->dest_type
);
305 assert(bits_per_comp
);
306 unsigned bytes_per_comp
= bits_per_comp
/ 8;
307 unsigned comps
= 16 / bytes_per_comp
;
308 unsigned smask
= (1 << bytes_per_comp
) - 1;
311 for (unsigned i
= 0; i
< comps
; ++i
) {
312 unsigned masked
= (ins
->writemask
>> (i
* bytes_per_comp
)) & smask
;
316 assert(masked
== smask
);
318 fputc("xyzw"[i
], fp
);
323 bi_print_instruction(bi_instruction
*ins
, FILE *fp
)
325 if (ins
->type
== BI_MINMAX
)
326 fprintf(fp
, "%s", ins
->op
.minmax
== BI_MINMAX_MIN
? "min" : "max");
327 else if (ins
->type
== BI_BITWISE
)
328 fprintf(fp
, "%s", bi_bitwise_op_name(ins
->op
.bitwise
));
329 else if (ins
->type
== BI_ROUND
)
330 fprintf(fp
, ins
->op
.round
== BI_ROUND_MODE
? "roundMode": "round");
331 else if (ins
->type
== BI_SPECIAL
)
332 fprintf(fp
, "%s", bi_special_op_name(ins
->op
.special
));
333 else if (ins
->type
== BI_CMP
)
334 fprintf(fp
, "%s", bi_cond_name(ins
->op
.compare
));
336 fprintf(fp
, "%s", bi_class_name(ins
->type
));
338 if (ins
->type
== BI_MINMAX
)
339 fprintf(fp
, "%s", bi_minmax_mode_name(ins
->minmax
));
340 else if (ins
->type
== BI_LOAD_VAR
)
341 bi_print_load_vary(&ins
->load_vary
, fp
);
342 else if (ins
->type
== BI_BRANCH
)
343 bi_print_branch(&ins
->branch
, fp
);
344 else if (ins
->type
== BI_CSEL
)
345 fprintf(fp
, ".%s", bi_cond_name(ins
->csel_cond
));
346 else if (ins
->type
== BI_BLEND
)
347 fprintf(fp
, ".loc%u", ins
->blend_location
);
348 else if (ins
->type
== BI_STORE
|| ins
->type
== BI_STORE_VAR
)
349 fprintf(fp
, ".v%u", ins
->store_channels
);
352 bi_print_alu_type(ins
->dest_type
, fp
);
354 if (bi_has_outmod(ins
))
355 fprintf(fp
, "%s", bi_output_mod_name(ins
->outmod
));
357 if (bi_class_props
[ins
->type
] & BI_ROUNDMODE
)
358 fprintf(fp
, "%s", bi_round_mode_name(ins
->roundmode
));
361 bi_print_index(fp
, ins
, ins
->dest
);
364 bi_print_writemask(ins
, fp
);
368 bi_foreach_src(ins
, s
) {
369 bi_print_src(fp
, ins
, s
);
371 if (ins
->src
[s
] && !(ins
->src
[s
] & (BIR_INDEX_CONSTANT
| BIR_INDEX_ZERO
))) {
372 bi_print_alu_type(ins
->src_types
[s
], fp
);
373 bi_print_swizzle(ins
, s
, fp
);
376 if (s
< BIR_SRC_COUNT
)
380 if (ins
->type
== BI_BRANCH
) {
381 if (ins
->branch
.target
)
382 fprintf(fp
, "-> block%u", ins
->branch
.target
->base
.name
);
384 fprintf(fp
, "-> blockhole");
391 bi_print_bundle(bi_bundle
*bundle
, FILE *fp
)
393 bi_instruction
*ins
[2] = { bundle
->fma
, bundle
->add
};
395 for (unsigned i
= 0; i
< 2; ++i
) {
397 bi_print_instruction(ins
[i
], fp
);
399 fprintf(fp
, "nop\n");
404 bi_print_clause(bi_clause
*clause
, FILE *fp
)
406 fprintf(fp
, "\tid(%u)", clause
->scoreboard_id
);
408 if (clause
->dependencies
) {
409 fprintf(fp
, ", wait(");
411 for (unsigned i
= 0; i
< 8; ++i
) {
412 if (clause
->dependencies
& (1 << i
))
413 fprintf(fp
, "%u ", i
);
419 if (!clause
->back_to_back
)
420 fprintf(fp
, " nbb %s", clause
->branch_conditional
? "branch-cond" : "branch-uncond");
422 if (clause
->data_register_write_barrier
)
423 fprintf(fp
, " drwb");
427 if (clause
->instruction_count
) {
428 assert(!clause
->bundle_count
);
430 for (unsigned i
= 0; i
< clause
->instruction_count
; ++i
)
431 bi_print_instruction(clause
->instructions
[i
], fp
);
433 assert(clause
->bundle_count
);
435 for (unsigned i
= 0; i
< clause
->bundle_count
; ++i
)
436 bi_print_bundle(&clause
->bundles
[i
], fp
);
439 if (clause
->constant_count
) {
440 for (unsigned i
= 0; i
< clause
->constant_count
; ++i
)
441 fprintf(fp
, "%" PRIx64
" ", clause
->constants
[i
]);
448 bi_print_block(bi_block
*block
, FILE *fp
)
450 fprintf(fp
, "block%u {\n", block
->base
.name
);
452 if (block
->scheduled
) {
453 bi_foreach_clause_in_block(block
, clause
)
454 bi_print_clause(clause
, fp
);
456 bi_foreach_instr_in_block(block
, ins
)
457 bi_print_instruction(ins
, fp
);
462 if (block
->base
.successors
[0]) {
465 pan_foreach_successor((&block
->base
), succ
)
466 fprintf(fp
, "block%u ", succ
->name
);
469 if (block
->base
.predecessors
->entries
) {
470 fprintf(fp
, " from");
472 bi_foreach_predecessor(block
, pred
)
473 fprintf(fp
, " block%u", pred
->base
.name
);
480 bi_print_shader(bi_context
*ctx
, FILE *fp
)
482 bi_foreach_block(ctx
, block
)
483 bi_print_block((bi_block
*) block
, fp
);