src/panfrost/bifrost/bi_print.c

   1 /*
   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.
   6  *
   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:
  13  *
  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
  16  * Software.
  17  *
  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
  24  * SOFTWARE.
  25  */
  26
  27 #include "bi_print.h"
  28
  29 const char *
  30 bi_clause_type_name(enum bifrost_clause_type T)
  31 {
  32         switch (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";
  42         default: return "??";
  43         }
  44 }
  45
  46 const char *
  47 bi_output_mod_name(enum bifrost_outmod mod)
  48 {
  49         switch (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";
  55         }
  56 }
  57
  58 const char *
  59 bi_minmax_mode_name(enum bifrost_minmax_mode mod)
  60 {
  61         switch (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";
  67         }
  68 }
  69
  70 const char *
  71 bi_round_mode_name(enum bifrost_roundmode mod)
  72 {
  73         switch (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";
  79         }
  80 }
  81
  82 const char *
  83 bi_csel_cond_name(enum bifrost_csel_cond cond)
  84 {
  85         switch (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";
  95         }
  96 }
  97
  98 const char *
  99 bi_interp_mode_name(enum bifrost_interp_mode mode)
 100 {
 101         switch (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";
 107         }
 108 }
 109
 110 const char *
 111 bi_ldst_type_name(enum bifrost_ldst_type type)
 112 {
 113         switch (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";
 119         }
 120 }
 121
 122 /* The remaining functions in this file are for IR-internal
 123  * structures; the disassembler doesn't use them */
 124
 125 static const char *
 126 bi_class_name(enum bi_class cl)
 127 {
 128         switch (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_COMBINE: return "combine";
 136         case BI_CONVERT: return "convert";
 137         case BI_CSEL: return "csel";
 138         case BI_DISCARD: return "discard";
 139         case BI_FMA: return "fma";
 140         case BI_FREXP: return "frexp";
 141         case BI_ISUB: return "isub";
 142         case BI_LOAD: return "load";
 143         case BI_LOAD_UNIFORM: return "load_uniform";
 144         case BI_LOAD_ATTR: return "load_attr";
 145         case BI_LOAD_VAR: return "load_var";
 146         case BI_LOAD_VAR_ADDRESS: return "load_var_address";
 147         case BI_MINMAX: return "minmax";
 148         case BI_MOV: return "mov";
 149         case BI_SHIFT: return "shift";
 150         case BI_STORE: return "store";
 151         case BI_STORE_VAR: return "store_var";
 152         case BI_SPECIAL: return "special";
 153         case BI_SWIZZLE: return "swizzle";
 154         case BI_TEX: return "tex";
 155         case BI_ROUND: return "round";
 156         default: return "unknown_class";
 157         }
 158 }
 159
 160 static void
 161 bi_print_index(FILE *fp, bi_instruction *ins, unsigned index)
 162 {
 163         if (!index)
 164                 fprintf(fp, "_");
 165         else if (index & BIR_INDEX_REGISTER)
 166                 fprintf(fp, "br%u", index & ~BIR_INDEX_REGISTER);
 167         else if (index & BIR_INDEX_UNIFORM)
 168                 fprintf(fp, "u%u", index & ~BIR_INDEX_UNIFORM);
 169         else if (index & BIR_INDEX_CONSTANT)
 170                 fprintf(fp, "#0x%" PRIx64, bi_get_immediate(ins, index));
 171         else if (index & BIR_INDEX_ZERO)
 172                 fprintf(fp, "#0");
 173         else if (index & BIR_IS_REG)
 174                 fprintf(fp, "r%u", index >> 1);
 175         else
 176                 fprintf(fp, "%u", (index >> 1) - 1);
 177 }
 178
 179 static void
 180 bi_print_src(FILE *fp, bi_instruction *ins, unsigned s)
 181 {
 182         unsigned src = ins->src[s];
 183         bool mods = bi_has_source_mods(ins);
 184         bool abs = ins->src_abs[s] && mods;
 185         bool neg = ins->src_neg[s] && mods;
 186
 187         if (neg)
 188                 fprintf(fp, "-");
 189
 190         if (abs)
 191                 fprintf(fp, "abs(");
 192
 193         bi_print_index(fp, ins, src);
 194
 195         if (abs)
 196                 fprintf(fp, ")");
 197 }
 198
 199 /* Prints a NIR ALU type in Bifrost-style ".f32" ".i8" etc */
 200
 201 static void
 202 bi_print_alu_type(nir_alu_type t, FILE *fp)
 203 {
 204         unsigned size = nir_alu_type_get_type_size(t);
 205         nir_alu_type base = nir_alu_type_get_base_type(t);
 206
 207         switch (base) {
 208         case nir_type_int:
 209                 fprintf(fp, ".i");
 210                 break;
 211         case nir_type_uint:
 212                 fprintf(fp, ".u");
 213                 break;
 214         case nir_type_bool:
 215                 fprintf(fp, ".b");
 216                 break;
 217         case nir_type_float:
 218                 fprintf(fp, ".f");
 219                 break;
 220         default:
 221                 fprintf(fp, ".unknown");
 222                 break;
 223         }
 224
 225         fprintf(fp, "%u", size);
 226 }
 227
 228 static void
 229 bi_print_swizzle(bi_instruction *ins, unsigned src, FILE *fp)
 230 {
 231         unsigned size = nir_alu_type_get_type_size(ins->dest_type);
 232         unsigned count = (size == 64) ? 1 : (32 / size);
 233
 234         fprintf(fp, ".");
 235
 236         for (unsigned u = 0; u < count; ++u) {
 237                 assert(ins->swizzle[src][u] < 4);
 238                 fputc("xyzw"[ins->swizzle[src][u]], fp);
 239         }
 240 }
 241
 242 static const char *
 243 bi_bitwise_op_name(enum bi_bitwise_op op)
 244 {
 245         switch (op) {
 246         case BI_BITWISE_AND: return "and";
 247         case BI_BITWISE_OR: return "or";
 248         case BI_BITWISE_XOR: return "xor";
 249         default: return "invalid";
 250         }
 251 }
 252
 253 static const char *
 254 bi_special_op_name(enum bi_special_op op)
 255 {
 256         switch (op) {
 257         case BI_SPECIAL_FRCP: return "frcp";
 258         case BI_SPECIAL_FRSQ: return "frsq";
 259         case BI_SPECIAL_FATAN: return "fatan";
 260         case BI_SPECIAL_FSIN: return "fsin";
 261         case BI_SPECIAL_FCOS: return "fcos";
 262         case BI_SPECIAL_FEXP: return "fexp";
 263         case BI_SPECIAL_FLOG2: return "flog2";
 264         case BI_SPECIAL_FLOGE: return "flog";
 265         default: return "invalid";
 266         }
 267 }
 268
 269 static void
 270 bi_print_load_vary(struct bi_load_vary *load, FILE *fp)
 271 {
 272         fprintf(fp, "%s", bi_interp_mode_name(load->interp_mode));
 273
 274         if (load->reuse)
 275                 fprintf(fp, ".reuse");
 276
 277         if (load->flat)
 278                 fprintf(fp, ".flat");
 279 }
 280
 281 static const char *
 282 bi_cond_name(enum bi_cond cond)
 283 {
 284         switch (cond) {
 285         case BI_COND_ALWAYS: return "always";
 286         case BI_COND_LT: return "lt";
 287         case BI_COND_LE: return "le";
 288         case BI_COND_GE: return "ge";
 289         case BI_COND_GT: return "gt";
 290         case BI_COND_EQ: return "eq";
 291         case BI_COND_NE: return "ne";
 292         default: return "invalid";
 293         }
 294 }
 295
 296 static void
 297 bi_print_branch(struct bi_branch *branch, FILE *fp)
 298 {
 299         fprintf(fp, ".%s", bi_cond_name(branch->cond));
 300 }
 301
 302 static void
 303 bi_print_writemask(bi_instruction *ins, FILE *fp)
 304 {
 305         unsigned bits_per_comp = nir_alu_type_get_type_size(ins->dest_type);
 306         assert(bits_per_comp);
 307         unsigned bytes_per_comp = bits_per_comp / 8;
 308         unsigned comps = 16 / bytes_per_comp;
 309         unsigned smask = (1 << bytes_per_comp) - 1;
 310         fprintf(fp, ".");
 311
 312         for (unsigned i = 0; i < comps; ++i) {
 313                 unsigned masked = (ins->writemask >> (i * bytes_per_comp)) & smask;
 314                 if (!masked)
 315                         continue;
 316
 317                 assert(masked == smask);
 318                 assert(i < 4);
 319                 fputc("xyzw"[i], fp);
 320         }
 321 }
 322
 323 void
 324 bi_print_instruction(bi_instruction *ins, FILE *fp)
 325 {
 326         if (ins->type == BI_MINMAX)
 327                 fprintf(fp, "%s", ins->op.minmax == BI_MINMAX_MIN ? "min" : "max");
 328         else if (ins->type == BI_BITWISE)
 329                 fprintf(fp, "%s", bi_bitwise_op_name(ins->op.bitwise));
 330         else if (ins->type == BI_ROUND)
 331                 fprintf(fp, ins->op.round == BI_ROUND_MODE ? "roundMode": "round");
 332         else if (ins->type == BI_SPECIAL)
 333                 fprintf(fp, "%s", bi_special_op_name(ins->op.special));
 334         else if (ins->type == BI_CMP)
 335                 fprintf(fp, "%s", bi_cond_name(ins->op.compare));
 336         else
 337                 fprintf(fp, "%s", bi_class_name(ins->type));
 338
 339         if (ins->type == BI_MINMAX)
 340                 fprintf(fp, "%s", bi_minmax_mode_name(ins->minmax));
 341         else if (ins->type == BI_LOAD_VAR)
 342                 bi_print_load_vary(&ins->load_vary, fp);
 343         else if (ins->type == BI_BRANCH)
 344                 bi_print_branch(&ins->branch, fp);
 345         else if (ins->type == BI_CSEL)
 346                 fprintf(fp, ".%s", bi_cond_name(ins->csel_cond));
 347         else if (ins->type == BI_BLEND)
 348                 fprintf(fp, ".loc%u", ins->blend_location);
 349         else if (ins->type == BI_STORE || ins->type == BI_STORE_VAR)
 350                 fprintf(fp, ".v%u", ins->store_channels);
 351
 352         if (ins->dest)
 353                 bi_print_alu_type(ins->dest_type, fp);
 354
 355         if (bi_has_outmod(ins))
 356                 fprintf(fp, "%s", bi_output_mod_name(ins->outmod));
 357
 358         if (bi_class_props[ins->type] & BI_ROUNDMODE)
 359                 fprintf(fp, "%s", bi_round_mode_name(ins->roundmode));
 360
 361         fprintf(fp, " ");
 362         bi_print_index(fp, ins, ins->dest);
 363
 364         if (ins->dest)
 365                 bi_print_writemask(ins, fp);
 366
 367         fprintf(fp, ", ");
 368
 369         bi_foreach_src(ins, s) {
 370                 bi_print_src(fp, ins, s);
 371
 372                 if (ins->src[s] && !(ins->src[s] & (BIR_INDEX_CONSTANT | BIR_INDEX_ZERO))) {
 373                         bi_print_alu_type(ins->src_types[s], fp);
 374                         bi_print_swizzle(ins, s, fp);
 375                 }
 376
 377                 if (s < BIR_SRC_COUNT)
 378                         fprintf(fp, ", ");
 379         }
 380
 381         if (ins->type == BI_BRANCH) {
 382                 if (ins->branch.target)
 383                         fprintf(fp, "-> block%u", ins->branch.target->base.name);
 384                 else
 385                         fprintf(fp, "-> blockhole");
 386         }
 387
 388         fprintf(fp, "\n");
 389 }
 390
 391 void
 392 bi_print_bundle(bi_bundle *bundle, FILE *fp)
 393 {
 394         bi_instruction *ins[2] = { bundle->fma, bundle->add };
 395
 396         for (unsigned i = 0; i < 2; ++i) {
 397                 if (ins[i])
 398                         bi_print_instruction(ins[i], fp);
 399                 else
 400                         fprintf(fp, "nop\n");
 401         }
 402 }
 403
 404 void
 405 bi_print_clause(bi_clause *clause, FILE *fp)
 406 {
 407         fprintf(fp, "\tid(%u)", clause->scoreboard_id);
 408
 409         if (clause->dependencies) {
 410                 fprintf(fp, ", wait(");
 411
 412                 for (unsigned i = 0; i < 8; ++i) {
 413                         if (clause->dependencies & (1 << i))
 414                                 fprintf(fp, "%u ", i);
 415                 }
 416
 417                 fprintf(fp, ")");
 418         }
 419
 420         if (!clause->back_to_back)
 421                 fprintf(fp, " nbb %s", clause->branch_conditional ? "branch-cond" : "branch-uncond");
 422
 423         if (clause->data_register_write_barrier)
 424                 fprintf(fp, " drwb");
 425
 426         fprintf(fp, "\n");
 427
 428         if (clause->instruction_count) {
 429                 assert(!clause->bundle_count);
 430
 431                 for (unsigned i = 0; i < clause->instruction_count; ++i)
 432                         bi_print_instruction(clause->instructions[i], fp);
 433         } else {
 434                 assert(clause->bundle_count);
 435
 436                 for (unsigned i = 0; i < clause->bundle_count; ++i)
 437                         bi_print_bundle(&clause->bundles[i], fp);
 438         }
 439
 440         if (clause->constant_count) {
 441                 for (unsigned i = 0; i < clause->constant_count; ++i)
 442                         fprintf(fp, "%" PRIx64 " ", clause->constants[i]);
 443
 444                 fprintf(fp, "\n");
 445         }
 446 }
 447
 448 void
 449 bi_print_block(bi_block *block, FILE *fp)
 450 {
 451         fprintf(fp, "block%u {\n", block->base.name);
 452
 453         if (block->scheduled) {
 454                 bi_foreach_clause_in_block(block, clause)
 455                         bi_print_clause(clause, fp);
 456         } else {
 457                 bi_foreach_instr_in_block(block, ins)
 458                         bi_print_instruction(ins, fp);
 459         }
 460
 461         fprintf(fp, "}");
 462
 463         if (block->base.successors[0]) {
 464                 fprintf(fp, " -> ");
 465
 466                 pan_foreach_successor((&block->base), succ)
 467                         fprintf(fp, "block%u ", succ->name);
 468         }
 469
 470         if (block->base.predecessors->entries) {
 471                 fprintf(fp, " from");
 472
 473                 bi_foreach_predecessor(block, pred)
 474                         fprintf(fp, " block%u", pred->base.name);
 475         }
 476
 477         fprintf(fp, "\n\n");
 478 }
 479
 480 void
 481 bi_print_shader(bi_context *ctx, FILE *fp)
 482 {
 483         bi_foreach_block(ctx, block)
 484                 bi_print_block((bi_block *) block, fp);
 485 }