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_output_mod_name(enum bifrost_outmod mod
)
33 case BIFROST_NONE
: return "";
34 case BIFROST_POS
: return ".pos";
35 case BIFROST_SAT_SIGNED
: return ".sat_signed";
36 case BIFROST_SAT
: return ".sat";
37 default: return "invalid";
42 bi_minmax_mode_name(enum bifrost_minmax_mode mod
)
45 case BIFROST_MINMAX_NONE
: return "";
46 case BIFROST_NAN_WINS
: return ".nan_wins";
47 case BIFROST_SRC1_WINS
: return ".src1_wins";
48 case BIFROST_SRC0_WINS
: return ".src0_wins";
49 default: return "invalid";
54 bi_round_mode_name(enum bifrost_roundmode mod
)
57 case BIFROST_RTE
: return "";
58 case BIFROST_RTP
: return ".rtp";
59 case BIFROST_RTN
: return ".rtn";
60 case BIFROST_RTZ
: return ".rtz";
61 default: return "invalid";
66 bi_csel_cond_name(enum bifrost_csel_cond cond
)
69 case BIFROST_FEQ_F
: return "feq.f";
70 case BIFROST_FGT_F
: return "fgt.f";
71 case BIFROST_FGE_F
: return "fge.f";
72 case BIFROST_IEQ_F
: return "ieq.f";
73 case BIFROST_IGT_I
: return "igt.i";
74 case BIFROST_IGE_I
: return "uge.i";
75 case BIFROST_UGT_I
: return "ugt.i";
76 case BIFROST_UGE_I
: return "uge.i";
77 default: return "invalid";
82 bi_interp_mode_name(enum bifrost_interp_mode mode
)
85 case BIFROST_INTERP_PER_FRAG
: return ".per_frag";
86 case BIFROST_INTERP_CENTROID
: return ".centroid";
87 case BIFROST_INTERP_DEFAULT
: return "";
88 case BIFROST_INTERP_EXPLICIT
: return ".explicit";
89 default: return ".unknown";
94 bi_ldst_type_name(enum bifrost_ldst_type type
)
97 case BIFROST_LDST_F16
: return "f16";
98 case BIFROST_LDST_F32
: return "f32";
99 case BIFROST_LDST_I32
: return "i32";
100 case BIFROST_LDST_U32
: return "u32";
101 default: return "invalid";
105 /* The remaining functions in this file are for IR-internal
106 * structures; the disassembler doesn't use them */
109 bi_class_name(enum bi_class cl
)
112 case BI_ADD
: return "add";
113 case BI_ATEST
: return "atest";
114 case BI_BRANCH
: return "branch";
115 case BI_CMP
: return "cmp";
116 case BI_BLEND
: return "blend";
117 case BI_BITWISE
: return "bitwise";
118 case BI_CONVERT
: return "convert";
119 case BI_CSEL
: return "csel";
120 case BI_DISCARD
: return "discard";
121 case BI_FMA
: return "fma";
122 case BI_FREXP
: return "frexp";
123 case BI_LOAD
: return "load";
124 case BI_LOAD_UNIFORM
: return "load_uniform";
125 case BI_LOAD_ATTR
: return "load_attr";
126 case BI_LOAD_VAR
: return "load_var";
127 case BI_LOAD_VAR_ADDRESS
: return "load_var_address";
128 case BI_MAKE_VEC
: return "make_vec";
129 case BI_MINMAX
: return "minmax";
130 case BI_MOV
: return "mov";
131 case BI_SHIFT
: return "shift";
132 case BI_STORE
: return "store";
133 case BI_STORE_VAR
: return "store_var";
134 case BI_SPECIAL
: return "special";
135 case BI_SWIZZLE
: return "swizzle";
136 case BI_TEX
: return "tex";
137 case BI_ROUND
: return "round";
138 default: return "unknown_class";
143 bi_print_index(FILE *fp
, bi_instruction
*ins
, unsigned index
)
147 else if (index
& BIR_INDEX_REGISTER
)
148 fprintf(fp
, "br%u", index
& ~BIR_INDEX_REGISTER
);
149 else if (index
& BIR_INDEX_UNIFORM
)
150 fprintf(fp
, "u%u", index
& ~BIR_INDEX_UNIFORM
);
151 else if (index
& BIR_INDEX_CONSTANT
)
152 fprintf(fp
, "#0x%" PRIx64
, ins
->constant
.u64
);
153 else if (index
& BIR_INDEX_ZERO
)
155 else if (index
& BIR_IS_REG
)
156 fprintf(fp
, "r%u", index
>> 1);
158 fprintf(fp
, "%u", (index
>> 1) - 1);
162 bi_print_src(FILE *fp
, bi_instruction
*ins
, unsigned s
)
164 unsigned src
= ins
->src
[s
];
165 bool mods
= bi_has_source_mods(ins
);
166 bool abs
= ins
->src_abs
[s
] && mods
;
167 bool neg
= ins
->src_neg
[s
] && mods
;
175 bi_print_index(fp
, ins
, src
);
181 /* Prints a NIR ALU type in Bifrost-style ".f32" ".i8" etc */
184 bi_print_alu_type(nir_alu_type t
, FILE *fp
)
186 unsigned size
= nir_alu_type_get_type_size(t
);
187 nir_alu_type base
= nir_alu_type_get_base_type(t
);
203 fprintf(fp
, ".unknown");
207 fprintf(fp
, "%u", size
);
211 bi_print_swizzle(bi_instruction
*ins
, unsigned src
, FILE *fp
)
213 unsigned size
= MAX2(nir_alu_type_get_type_size(ins
->dest_type
), 8);
214 unsigned count
= (size
== 64) ? 1 : (32 / size
);
218 for (unsigned u
= 0; u
< count
; ++u
) {
219 assert(ins
->swizzle
[src
][u
] < 4);
220 fputc("xyzw"[ins
->swizzle
[src
][u
]], fp
);
225 bi_bitwise_op_name(enum bi_bitwise_op op
)
228 case BI_BITWISE_AND
: return "and";
229 case BI_BITWISE_OR
: return "or";
230 case BI_BITWISE_XOR
: return "xor";
231 default: return "invalid";
236 bi_print_load(struct bi_load
*load
, FILE *fp
)
238 fprintf(fp
, ".loc%u", load
->location
);
240 if (load
->channels
!= 1)
241 fprintf(fp
, ".v%u", load
->channels
);
245 bi_print_load_vary(struct bi_load_vary
*load
, FILE *fp
)
247 bi_print_load(&load
->load
, fp
);
248 fprintf(fp
, "%s", bi_interp_mode_name(load
->interp_mode
));
251 fprintf(fp
, ".reuse");
254 fprintf(fp
, ".flat");
258 bi_cond_name(enum bi_cond cond
)
261 case BI_COND_ALWAYS
: return ".always";
262 case BI_COND_LT
: return ".lt";
263 case BI_COND_LE
: return ".le";
264 case BI_COND_GE
: return ".ge";
265 case BI_COND_GT
: return ".gt";
266 case BI_COND_EQ
: return ".eq";
267 case BI_COND_NE
: return ".ne";
268 default: return "invalid";
273 bi_print_branch(struct bi_branch
*branch
, FILE *fp
)
275 fprintf(fp
, "%s", bi_cond_name(branch
->cond
));
279 bi_print_instruction(bi_instruction
*ins
, FILE *fp
)
281 if (ins
->type
== BI_MINMAX
)
282 fprintf(fp
, "%s", ins
->op
.minmax
== BI_MINMAX_MIN
? "min" : "max");
283 else if (ins
->type
== BI_BITWISE
)
284 fprintf(fp
, "%s", bi_bitwise_op_name(ins
->op
.bitwise
));
285 else if (ins
->type
== BI_ROUND
)
286 fprintf(fp
, ins
->op
.round
== BI_ROUND_MODE
? "roundMode": "round");
288 fprintf(fp
, "%s", bi_class_name(ins
->type
));
290 if (ins
->type
== BI_MINMAX
)
291 fprintf(fp
, "%s", bi_minmax_mode_name(ins
->minmax
));
292 else if (ins
->type
== BI_LOAD_ATTR
|| ins
->type
== BI_LOAD_VAR_ADDRESS
|| ins
->type
== BI_LOAD_UNIFORM
)
293 bi_print_load(&ins
->load
, fp
);
294 else if (ins
->type
== BI_LOAD_VAR
)
295 bi_print_load_vary(&ins
->load_vary
, fp
);
296 else if (ins
->type
== BI_BRANCH
)
297 bi_print_branch(&ins
->branch
, fp
);
298 else if (ins
->type
== BI_CSEL
)
299 fprintf(fp
, "%s", bi_cond_name(ins
->csel_cond
));
300 else if (ins
->type
== BI_BLEND
)
301 fprintf(fp
, ".loc%u", ins
->blend_location
);
304 bi_print_alu_type(ins
->dest_type
, fp
);
306 if (bi_has_outmod(ins
))
307 fprintf(fp
, "%s", bi_output_mod_name(ins
->outmod
));
309 if (bi_class_props
[ins
->type
] & BI_ROUNDMODE
)
310 fprintf(fp
, "%s", bi_round_mode_name(ins
->roundmode
));
313 bi_print_index(fp
, ins
, ins
->dest
);
316 bi_foreach_src(ins
, s
) {
317 bi_print_src(fp
, ins
, s
);
319 if (ins
->src
[s
] && !(ins
->src
[s
] & (BIR_INDEX_CONSTANT
| BIR_INDEX_ZERO
)))
320 bi_print_swizzle(ins
, s
, fp
);
322 bool is_convert
= ins
->type
== BI_CONVERT
&& s
== 0;
323 bool is_branch
= ins
->type
== BI_BRANCH
&& s
< 2 && ins
->branch
.cond
!= BI_COND_ALWAYS
;
324 bool is_csel
= ins
->type
== BI_CSEL
&& s
< 2;
326 if (is_convert
|| is_branch
|| is_csel
)
327 bi_print_alu_type(ins
->src_types
[s
], fp
);
329 if (s
< BIR_SRC_COUNT
)
333 if (ins
->type
== BI_BRANCH
) {
334 if (ins
->branch
.target
)
335 fprintf(fp
, "-> block%u", ins
->branch
.target
->name
);
337 fprintf(fp
, "-> blockhole");
344 bi_print_bundle(bi_bundle
*bundle
, FILE *fp
)
346 bi_instruction
*ins
[2] = { bundle
->fma
, bundle
->add
};
348 for (unsigned i
= 0; i
< 2; ++i
) {
350 bi_print_instruction(ins
[i
], fp
);
352 fprintf(fp
, "nop\n");
357 bi_print_clause(bi_clause
*clause
, FILE *fp
)
359 fprintf(fp
, "\tid(%u)", clause
->scoreboard_id
);
361 if (clause
->dependencies
) {
362 fprintf(fp
, ", wait(");
364 for (unsigned i
= 0; i
< 8; ++i
) {
365 if (clause
->dependencies
& (1 << i
))
366 fprintf(fp
, "%u ", i
);
372 if (!clause
->back_to_back
)
373 fprintf(fp
, " nbb %s", clause
->branch_conditional
? "branch-cond" : "branch-uncond");
375 if (clause
->data_register_write_barrier
)
376 fprintf(fp
, " drwb");
380 if (clause
->instruction_count
) {
381 assert(!clause
->bundle_count
);
383 for (unsigned i
= 0; i
< clause
->instruction_count
; ++i
)
384 bi_print_instruction(clause
->instructions
[i
], fp
);
386 assert(clause
->bundle_count
);
388 for (unsigned i
= 0; i
< clause
->bundle_count
; ++i
)
389 bi_print_bundle(&clause
->bundles
[i
], fp
);
392 if (clause
->constant_count
) {
393 for (unsigned i
= 0; i
< clause
->constant_count
; ++i
)
394 fprintf(fp
, "%" PRIx64
" ", clause
->constants
[i
]);
401 bi_print_block(bi_block
*block
, FILE *fp
)
403 fprintf(fp
, "block%u {\n", block
->name
);
405 if (block
->scheduled
) {
406 bi_foreach_clause_in_block(block
, clause
)
407 bi_print_clause(clause
, fp
);
409 bi_foreach_instr_in_block(block
, ins
)
410 bi_print_instruction(ins
, fp
);
415 if (block
->successors
[0]) {
418 for (unsigned i
= 0; i
< ARRAY_SIZE(block
->successors
); ++i
) {
419 if (block
->successors
[i
])
420 fprintf(fp
, "block%u ", block
->successors
[i
]->name
);
424 if (block
->predecessors
->entries
) {
425 fprintf(fp
, " from");
427 bi_foreach_predecessor(block
, pred
)
428 fprintf(fp
, " block%u", pred
->name
);
435 bi_print_shader(bi_context
*ctx
, FILE *fp
)
437 bi_foreach_block(ctx
, block
)
438 bi_print_block(block
, fp
);