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 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_FMOV: return "fmov";
 141         case BI_FREXP: return "frexp";
 142         case BI_ISUB: return "isub";
 143         case BI_LOAD: return "load";
 144         case BI_LOAD_UNIFORM: return "load_uniform";
 145         case BI_LOAD_ATTR: return "load_attr";
 146         case BI_LOAD_VAR: return "load_var";
 147         case BI_LOAD_VAR_ADDRESS: return "load_var_address";
 148         case BI_MINMAX: return "minmax";
 149         case BI_MOV: return "mov";
 150         case BI_SHIFT: return "shift";
 151         case BI_STORE: return "store";
 152         case BI_STORE_VAR: return "store_var";
 153         case BI_SPECIAL: return "special";
 154         case BI_SWIZZLE: return "swizzle";
 155         case BI_TABLE: return "table";
 156         case BI_TEX: return "tex";
 157         case BI_ROUND: return "round";
 158         default: return "unknown_class";
 159         }
 160 }
 161
 162 static void
 163 bi_print_index(FILE *fp, bi_instruction *ins, unsigned index)
 164 {
 165         if (!index)
 166                 fprintf(fp, "_");
 167         else if (index & BIR_INDEX_REGISTER)
 168                 fprintf(fp, "br%u", index & ~BIR_INDEX_REGISTER);
 169         else if (index & BIR_INDEX_UNIFORM)
 170                 fprintf(fp, "u%u", index & ~BIR_INDEX_UNIFORM);
 171         else if (index & BIR_INDEX_CONSTANT)
 172                 fprintf(fp, "#0x%" PRIx64, bi_get_immediate(ins, index));
 173         else if (index & BIR_INDEX_ZERO)
 174                 fprintf(fp, "#0");
 175         else if (index & BIR_IS_REG)
 176                 fprintf(fp, "r%u", index >> 1);
 177         else
 178                 fprintf(fp, "%u", (index >> 1) - 1);
 179 }
 180
 181 static void
 182 bi_print_src(FILE *fp, bi_instruction *ins, unsigned s)
 183 {
 184         unsigned src = ins->src[s];
 185         bool mods = bi_has_source_mods(ins);
 186         bool abs = ins->src_abs[s] && mods;
 187         bool neg = ins->src_neg[s] && mods;
 188
 189         if (neg)
 190                 fprintf(fp, "-");
 191
 192         if (abs)
 193                 fprintf(fp, "abs(");
 194
 195         bi_print_index(fp, ins, src);
 196
 197         if (abs)
 198                 fprintf(fp, ")");
 199 }
 200
 201 /* Prints a NIR ALU type in Bifrost-style ".f32" ".i8" etc */
 202
 203 static void
 204 bi_print_alu_type(nir_alu_type t, FILE *fp)
 205 {
 206         unsigned size = nir_alu_type_get_type_size(t);
 207         nir_alu_type base = nir_alu_type_get_base_type(t);
 208
 209         switch (base) {
 210         case nir_type_int:
 211                 fprintf(fp, ".i");
 212                 break;
 213         case nir_type_uint:
 214                 fprintf(fp, ".u");
 215                 break;
 216         case nir_type_bool:
 217                 fprintf(fp, ".b");
 218                 break;
 219         case nir_type_float:
 220                 fprintf(fp, ".f");
 221                 break;
 222         default:
 223                 fprintf(fp, ".unknown");
 224                 break;
 225         }
 226
 227         fprintf(fp, "%u", size);
 228 }
 229
 230 static void
 231 bi_print_swizzle(bi_instruction *ins, unsigned src, FILE *fp)
 232 {
 233         unsigned size = nir_alu_type_get_type_size(ins->dest_type);
 234         unsigned count = (size == 64) ? 1 : (32 / size);
 235
 236         fprintf(fp, ".");
 237
 238         for (unsigned u = 0; u < count; ++u) {
 239                 assert(ins->swizzle[src][u] < 4);
 240                 fputc("xyzw"[ins->swizzle[src][u]], fp);
 241         }
 242 }
 243
 244 static const char *
 245 bi_bitwise_op_name(enum bi_bitwise_op op)
 246 {
 247         switch (op) {
 248         case BI_BITWISE_AND: return "and";
 249         case BI_BITWISE_OR: return "or";
 250         case BI_BITWISE_XOR: return "xor";
 251         default: return "invalid";
 252         }
 253 }
 254
 255 const char *
 256 bi_table_op_name(enum bi_table_op op)
 257 {
 258         switch (op) {
 259         case BI_TABLE_LOG2_U_OVER_U_1_LOW: return "log2.help";
 260         default: return "invalid";
 261         }
 262 }
 263
 264 const char *
 265 bi_special_op_name(enum bi_special_op op)
 266 {
 267         switch (op) {
 268         case BI_SPECIAL_FRCP: return "frcp";
 269         case BI_SPECIAL_FRSQ: return "frsq";
 270         case BI_SPECIAL_EXP2_LOW: return "exp2_low";
 271         default: return "invalid";
 272         }
 273 }
 274
 275 const char *
 276 bi_reduce_op_name(enum bi_reduce_op op)
 277 {
 278         switch (op) {
 279         case BI_REDUCE_ADD_FREXPM: return "add_frexpm";
 280         default: return "invalid";
 281         }
 282 }
 283
 284 static void
 285 bi_print_load_vary(struct bi_load_vary *load, FILE *fp)
 286 {
 287         fprintf(fp, "%s", bi_interp_mode_name(load->interp_mode));
 288
 289         if (load->reuse)
 290                 fprintf(fp, ".reuse");
 291
 292         if (load->flat)
 293                 fprintf(fp, ".flat");
 294 }
 295
 296 const char *
 297 bi_cond_name(enum bi_cond cond)
 298 {
 299         switch (cond) {
 300         case BI_COND_ALWAYS: return "always";
 301         case BI_COND_LT: return "lt";
 302         case BI_COND_LE: return "le";
 303         case BI_COND_GE: return "ge";
 304         case BI_COND_GT: return "gt";
 305         case BI_COND_EQ: return "eq";
 306         case BI_COND_NE: return "ne";
 307         default: return "invalid";
 308         }
 309 }
 310
 311 static void
 312 bi_print_branch(struct bi_branch *branch, FILE *fp)
 313 {
 314         fprintf(fp, ".%s", bi_cond_name(branch->cond));
 315 }
 316
 317 static void
 318 bi_print_writemask(bi_instruction *ins, FILE *fp)
 319 {
 320         unsigned bits_per_comp = nir_alu_type_get_type_size(ins->dest_type);
 321         assert(bits_per_comp);
 322         unsigned bytes_per_comp = bits_per_comp / 8;
 323         unsigned comps = 16 / bytes_per_comp;
 324         unsigned smask = (1 << bytes_per_comp) - 1;
 325         fprintf(fp, ".");
 326
 327         for (unsigned i = 0; i < comps; ++i) {
 328                 unsigned masked = (ins->writemask >> (i * bytes_per_comp)) & smask;
 329                 if (!masked)
 330                         continue;
 331
 332                 assert(masked == smask);
 333                 assert(i < 4);
 334                 fputc("xyzw"[i], fp);
 335         }
 336 }
 337
 338 void
 339 bi_print_instruction(bi_instruction *ins, FILE *fp)
 340 {
 341         if (ins->type == BI_MINMAX)
 342                 fprintf(fp, "%s", ins->op.minmax == BI_MINMAX_MIN ? "min" : "max");
 343         else if (ins->type == BI_BITWISE)
 344                 fprintf(fp, "%s", bi_bitwise_op_name(ins->op.bitwise));
 345         else if (ins->type == BI_ROUND)
 346                 fprintf(fp, ins->op.round == BI_ROUND_MODE ? "roundMode": "round");
 347         else if (ins->type == BI_SPECIAL)
 348                 fprintf(fp, "%s", bi_special_op_name(ins->op.special));
 349         else if (ins->type == BI_TABLE)
 350                 fprintf(fp, "%s", bi_table_op_name(ins->op.table));
 351         else if (ins->type == BI_REDUCE_FMA)
 352                 fprintf(fp, "%s", bi_reduce_op_name(ins->op.reduce));
 353         else if (ins->type == BI_CMP)
 354                 fprintf(fp, "%s", bi_cond_name(ins->op.compare));
 355         else
 356                 fprintf(fp, "%s", bi_class_name(ins->type));
 357
 358         if (ins->type == BI_MINMAX)
 359                 fprintf(fp, "%s", bi_minmax_mode_name(ins->minmax));
 360         else if (ins->type == BI_LOAD_VAR)
 361                 bi_print_load_vary(&ins->load_vary, fp);
 362         else if (ins->type == BI_BRANCH)
 363                 bi_print_branch(&ins->branch, fp);
 364         else if (ins->type == BI_CSEL)
 365                 fprintf(fp, ".%s", bi_cond_name(ins->csel_cond));
 366         else if (ins->type == BI_BLEND)
 367                 fprintf(fp, ".loc%u", ins->blend_location);
 368         else if (ins->type == BI_STORE || ins->type == BI_STORE_VAR)
 369                 fprintf(fp, ".v%u", ins->store_channels);
 370
 371         if (ins->dest)
 372                 bi_print_alu_type(ins->dest_type, fp);
 373
 374         if (bi_has_outmod(ins))
 375                 fprintf(fp, "%s", bi_output_mod_name(ins->outmod));
 376
 377         if (bi_class_props[ins->type] & BI_ROUNDMODE)
 378                 fprintf(fp, "%s", bi_round_mode_name(ins->roundmode));
 379
 380         fprintf(fp, " ");
 381         bi_print_index(fp, ins, ins->dest);
 382
 383         if (ins->dest)
 384                 bi_print_writemask(ins, fp);
 385
 386         fprintf(fp, ", ");
 387
 388         bi_foreach_src(ins, s) {
 389                 bi_print_src(fp, ins, s);
 390
 391                 if (ins->src[s] && !(ins->src[s] & (BIR_INDEX_CONSTANT | BIR_INDEX_ZERO))) {
 392                         bi_print_alu_type(ins->src_types[s], fp);
 393                         bi_print_swizzle(ins, s, fp);
 394                 }
 395
 396                 if (s < BIR_SRC_COUNT)
 397                         fprintf(fp, ", ");
 398         }
 399
 400         if (ins->type == BI_BRANCH) {
 401                 if (ins->branch.target)
 402                         fprintf(fp, "-> block%u", ins->branch.target->base.name);
 403                 else
 404                         fprintf(fp, "-> blockhole");
 405         }
 406
 407         fprintf(fp, "\n");
 408 }
 409
 410 void
 411 bi_print_bundle(bi_bundle *bundle, FILE *fp)
 412 {
 413         bi_instruction *ins[2] = { bundle->fma, bundle->add };
 414
 415         for (unsigned i = 0; i < 2; ++i) {
 416                 if (ins[i])
 417                         bi_print_instruction(ins[i], fp);
 418                 else
 419                         fprintf(fp, "nop\n");
 420         }
 421 }
 422
 423 void
 424 bi_print_clause(bi_clause *clause, FILE *fp)
 425 {
 426         fprintf(fp, "\tid(%u)", clause->scoreboard_id);
 427
 428         if (clause->dependencies) {
 429                 fprintf(fp, ", wait(");
 430
 431                 for (unsigned i = 0; i < 8; ++i) {
 432                         if (clause->dependencies & (1 << i))
 433                                 fprintf(fp, "%u ", i);
 434                 }
 435
 436                 fprintf(fp, ")");
 437         }
 438
 439         if (!clause->back_to_back)
 440                 fprintf(fp, " nbb %s", clause->branch_conditional ? "branch-cond" : "branch-uncond");
 441
 442         if (clause->data_register_write_barrier)
 443                 fprintf(fp, " drwb");
 444
 445         fprintf(fp, "\n");
 446
 447         if (clause->instruction_count) {
 448                 assert(!clause->bundle_count);
 449
 450                 for (unsigned i = 0; i < clause->instruction_count; ++i)
 451                         bi_print_instruction(clause->instructions[i], fp);
 452         } else {
 453                 assert(clause->bundle_count);
 454
 455                 for (unsigned i = 0; i < clause->bundle_count; ++i)
 456                         bi_print_bundle(&clause->bundles[i], fp);
 457         }
 458
 459         if (clause->constant_count) {
 460                 for (unsigned i = 0; i < clause->constant_count; ++i)
 461                         fprintf(fp, "%" PRIx64 " ", clause->constants[i]);
 462
 463                 fprintf(fp, "\n");
 464         }
 465 }
 466
 467 void
 468 bi_print_block(bi_block *block, FILE *fp)
 469 {
 470         fprintf(fp, "block%u {\n", block->base.name);
 471
 472         if (block->scheduled) {
 473                 bi_foreach_clause_in_block(block, clause)
 474                         bi_print_clause(clause, fp);
 475         } else {
 476                 bi_foreach_instr_in_block(block, ins)
 477                         bi_print_instruction(ins, fp);
 478         }
 479
 480         fprintf(fp, "}");
 481
 482         if (block->base.successors[0]) {
 483                 fprintf(fp, " -> ");
 484
 485                 pan_foreach_successor((&block->base), succ)
 486                         fprintf(fp, "block%u ", succ->name);
 487         }
 488
 489         if (block->base.predecessors->entries) {
 490                 fprintf(fp, " from");
 491
 492                 bi_foreach_predecessor(block, pred)
 493                         fprintf(fp, " block%u", pred->base.name);
 494         }
 495
 496         fprintf(fp, "\n\n");
 497 }
 498
 499 void
 500 bi_print_shader(bi_context *ctx, FILE *fp)
 501 {
 502         bi_foreach_block(ctx, block)
 503                 bi_print_block((bi_block *) block, fp);
 504 }