src/panfrost/bifrost/bifrost_compile.c

   1 /*
   2  * Copyright (C) 2020 Collabora Ltd.
   3  *
   4  * Permission is hereby granted, free of charge, to any person obtaining a
   5  * copy of this software and associated documentation files (the "Software"),
   6  * to deal in the Software without restriction, including without limitation
   7  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   8  * and/or sell copies of the Software, and to permit persons to whom the
   9  * Software is furnished to do so, subject to the following conditions:
  10  *
  11  * The above copyright notice and this permission notice (including the next
  12  * paragraph) shall be included in all copies or substantial portions of the
  13  * Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  18  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  21  * SOFTWARE.
  22  *
  23  * Authors (Collabora):
  24  *      Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
  25  */
  26
  27 #include "main/mtypes.h"
  28 #include "compiler/glsl/glsl_to_nir.h"
  29 #include "compiler/nir_types.h"
  30 #include "main/imports.h"
  31 #include "compiler/nir/nir_builder.h"
  32
  33 #include "disassemble.h"
  34 #include "bifrost_compile.h"
  35 #include "bifrost_nir.h"
  36 #include "compiler.h"
  37 #include "bi_quirks.h"
  38 #include "bi_print.h"
  39
  40 static bi_block *emit_cf_list(bi_context *ctx, struct exec_list *list);
  41 static bi_instruction *bi_emit_branch(bi_context *ctx);
  42 static void bi_schedule_barrier(bi_context *ctx);
  43
  44 static void
  45 emit_jump(bi_context *ctx, nir_jump_instr *instr)
  46 {
  47         bi_instruction *branch = bi_emit_branch(ctx);
  48
  49         switch (instr->type) {
  50         case nir_jump_break:
  51                 branch->branch.target = ctx->break_block;
  52                 break;
  53         case nir_jump_continue:
  54                 branch->branch.target = ctx->continue_block;
  55                 break;
  56         default:
  57                 unreachable("Unhandled jump type");
  58         }
  59
  60         pan_block_add_successor(&ctx->current_block->base, &branch->branch.target->base);
  61 }
  62
  63 /* Gets a bytemask for a complete vecN write */
  64 static unsigned
  65 bi_mask_for_channels_32(unsigned i)
  66 {
  67         return (1 << (4 * i)) - 1;
  68 }
  69
  70 static bi_instruction
  71 bi_load(enum bi_class T, nir_intrinsic_instr *instr)
  72 {
  73         bi_instruction load = {
  74                 .type = T,
  75                 .writemask = bi_mask_for_channels_32(instr->num_components),
  76                 .src = { BIR_INDEX_CONSTANT },
  77                 .constant = { .u64 = nir_intrinsic_base(instr) },
  78         };
  79
  80         const nir_intrinsic_info *info = &nir_intrinsic_infos[instr->intrinsic];
  81
  82         if (info->has_dest)
  83                 load.dest = bir_dest_index(&instr->dest);
  84
  85         if (info->has_dest && info->index_map[NIR_INTRINSIC_TYPE] > 0)
  86                 load.dest_type = nir_intrinsic_type(instr);
  87
  88         nir_src *offset = nir_get_io_offset_src(instr);
  89
  90         if (nir_src_is_const(*offset))
  91                 load.constant.u64 += nir_src_as_uint(*offset);
  92         else
  93                 load.src[0] = bir_src_index(offset);
  94
  95         return load;
  96 }
  97
  98 static void
  99 bi_emit_ld_vary(bi_context *ctx, nir_intrinsic_instr *instr)
 100 {
 101         bi_instruction ins = bi_load(BI_LOAD_VAR, instr);
 102         ins.load_vary.interp_mode = BIFROST_INTERP_DEFAULT; /* TODO */
 103         ins.load_vary.reuse = false; /* TODO */
 104         ins.load_vary.flat = instr->intrinsic != nir_intrinsic_load_interpolated_input;
 105         ins.dest_type = nir_type_float | nir_dest_bit_size(instr->dest);
 106
 107         if (nir_src_is_const(*nir_get_io_offset_src(instr))) {
 108                 /* Zero it out for direct */
 109                 ins.src[1] = BIR_INDEX_ZERO;
 110         } else {
 111                 /* R61 contains sample mask stuff, TODO RA XXX */
 112                 ins.src[1] = BIR_INDEX_REGISTER | 61;
 113         }
 114
 115         bi_emit(ctx, ins);
 116 }
 117
 118 static void
 119 bi_emit_frag_out(bi_context *ctx, nir_intrinsic_instr *instr)
 120 {
 121         if (!ctx->emitted_atest) {
 122                 bi_instruction ins = {
 123                         .type = BI_ATEST,
 124                         .src = {
 125                                 BIR_INDEX_REGISTER | 60 /* TODO: RA */,
 126                                 bir_src_index(&instr->src[0])
 127                         },
 128                         .src_types = {
 129                                 nir_type_uint32,
 130                                 nir_type_float32
 131                         },
 132                         .swizzle = {
 133                                 { 0 },
 134                                 { 3, 0 } /* swizzle out the alpha */
 135                         },
 136                         .dest = BIR_INDEX_REGISTER | 60 /* TODO: RA */,
 137                         .dest_type = nir_type_uint32,
 138                         .writemask = 0xF
 139                 };
 140
 141                 bi_emit(ctx, ins);
 142                 bi_schedule_barrier(ctx);
 143                 ctx->emitted_atest = true;
 144         }
 145
 146         bi_instruction blend = {
 147                 .type = BI_BLEND,
 148                 .blend_location = nir_intrinsic_base(instr),
 149                 .src = {
 150                         BIR_INDEX_REGISTER | 60 /* Can this be arbitrary? */,
 151                         bir_src_index(&instr->src[0])
 152                 },
 153                 .src_types = {
 154                         nir_type_uint32,
 155                         nir_type_float32,
 156                 },
 157                 .swizzle = {
 158                         { 0 },
 159                         { 0, 1, 2, 3 }
 160                 },
 161                 .dest = BIR_INDEX_REGISTER | 48 /* Looks like magic */,
 162                 .dest_type = nir_type_uint32,
 163                 .writemask = 0xF
 164         };
 165
 166         bi_emit(ctx, blend);
 167         bi_schedule_barrier(ctx);
 168 }
 169
 170 static bi_instruction
 171 bi_load_with_r61(enum bi_class T, nir_intrinsic_instr *instr)
 172 {
 173         bi_instruction ld = bi_load(T, instr);
 174         ld.src[1] = BIR_INDEX_REGISTER | 61; /* TODO: RA */
 175         ld.src[2] = BIR_INDEX_REGISTER | 62;
 176         ld.src[3] = 0;
 177         ld.src_types[1] = nir_type_uint32;
 178         ld.src_types[2] = nir_type_uint32;
 179         ld.src_types[3] = nir_intrinsic_type(instr);
 180         return ld;
 181 }
 182
 183 static void
 184 bi_emit_st_vary(bi_context *ctx, nir_intrinsic_instr *instr)
 185 {
 186         bi_instruction address = bi_load_with_r61(BI_LOAD_VAR_ADDRESS, instr);
 187         address.dest = bi_make_temp(ctx);
 188         address.dest_type = nir_type_uint32;
 189         address.writemask = (1 << 12) - 1;
 190
 191         bi_instruction st = {
 192                 .type = BI_STORE_VAR,
 193                 .src = {
 194                         bir_src_index(&instr->src[0]),
 195                         address.dest, address.dest, address.dest,
 196                 },
 197                 .src_types = {
 198                         nir_type_uint32,
 199                         nir_type_uint32, nir_type_uint32, nir_type_uint32,
 200                 },
 201                 .swizzle = {
 202                         { 0, 1, 2, 3 },
 203                         { 0 }, { 1 }, { 2}
 204                 },
 205                 .store_channels = 4, /* TODO: WRITEMASK */
 206         };
 207
 208         bi_emit(ctx, address);
 209         bi_emit(ctx, st);
 210 }
 211
 212 static void
 213 bi_emit_ld_uniform(bi_context *ctx, nir_intrinsic_instr *instr)
 214 {
 215         bi_instruction ld = bi_load(BI_LOAD_UNIFORM, instr);
 216         ld.src[1] = BIR_INDEX_ZERO; /* TODO: UBO index */
 217
 218         /* TODO: Indirect access, since we need to multiply by the element
 219          * size. I believe we can get this lowering automatically via
 220          * nir_lower_io (as mul instructions) with the proper options, but this
 221          * is TODO */
 222         assert(ld.src[0] & BIR_INDEX_CONSTANT);
 223         ld.constant.u64 += ctx->sysvals.sysval_count;
 224         ld.constant.u64 *= 16;
 225
 226         bi_emit(ctx, ld);
 227 }
 228
 229 static void
 230 bi_emit_sysval(bi_context *ctx, nir_instr *instr,
 231                 unsigned nr_components, unsigned offset)
 232 {
 233         nir_dest nir_dest;
 234
 235         /* Figure out which uniform this is */
 236         int sysval = panfrost_sysval_for_instr(instr, &nir_dest);
 237         void *val = _mesa_hash_table_u64_search(ctx->sysvals.sysval_to_id, sysval);
 238
 239         /* Sysvals are prefix uniforms */
 240         unsigned uniform = ((uintptr_t) val) - 1;
 241
 242         /* Emit the read itself -- this is never indirect */
 243
 244         bi_instruction load = {
 245                 .type = BI_LOAD_UNIFORM,
 246                 .writemask = (1 << (nr_components * 4)) - 1,
 247                 .src = { BIR_INDEX_CONSTANT, BIR_INDEX_ZERO },
 248                 .constant = { (uniform * 16) + offset },
 249                 .dest = bir_dest_index(&nir_dest),
 250                 .dest_type = nir_type_uint32, /* TODO */
 251         };
 252
 253         bi_emit(ctx, load);
 254 }
 255
 256 static void
 257 emit_intrinsic(bi_context *ctx, nir_intrinsic_instr *instr)
 258 {
 259
 260         switch (instr->intrinsic) {
 261         case nir_intrinsic_load_barycentric_pixel:
 262                 /* stub */
 263                 break;
 264         case nir_intrinsic_load_interpolated_input:
 265         case nir_intrinsic_load_input:
 266                 if (ctx->stage == MESA_SHADER_FRAGMENT)
 267                         bi_emit_ld_vary(ctx, instr);
 268                 else if (ctx->stage == MESA_SHADER_VERTEX)
 269                         bi_emit(ctx, bi_load_with_r61(BI_LOAD_ATTR, instr));
 270                 else {
 271                         unreachable("Unsupported shader stage");
 272                 }
 273                 break;
 274
 275         case nir_intrinsic_store_output:
 276                 if (ctx->stage == MESA_SHADER_FRAGMENT)
 277                         bi_emit_frag_out(ctx, instr);
 278                 else if (ctx->stage == MESA_SHADER_VERTEX)
 279                         bi_emit_st_vary(ctx, instr);
 280                 else
 281                         unreachable("Unsupported shader stage");
 282                 break;
 283
 284         case nir_intrinsic_load_uniform:
 285                 bi_emit_ld_uniform(ctx, instr);
 286                 break;
 287
 288         case nir_intrinsic_load_ssbo_address:
 289                 bi_emit_sysval(ctx, &instr->instr, 1, 0);
 290                 break;
 291
 292         case nir_intrinsic_get_buffer_size:
 293                 bi_emit_sysval(ctx, &instr->instr, 1, 8);
 294                 break;
 295
 296         case nir_intrinsic_load_viewport_scale:
 297         case nir_intrinsic_load_viewport_offset:
 298         case nir_intrinsic_load_num_work_groups:
 299         case nir_intrinsic_load_sampler_lod_parameters_pan:
 300                 bi_emit_sysval(ctx, &instr->instr, 3, 0);
 301                 break;
 302
 303         default:
 304                 /* todo */
 305                 break;
 306         }
 307 }
 308
 309 static void
 310 emit_load_const(bi_context *ctx, nir_load_const_instr *instr)
 311 {
 312         /* Make sure we've been lowered */
 313         assert(instr->def.num_components == 1);
 314
 315         bi_instruction move = {
 316                 .type = BI_MOV,
 317                 .dest = bir_ssa_index(&instr->def),
 318                 .dest_type = instr->def.bit_size | nir_type_uint,
 319                 .writemask = (1 << (instr->def.bit_size / 8)) - 1,
 320                 .src = {
 321                         BIR_INDEX_CONSTANT
 322                 },
 323                 .constant = {
 324                         .u64 = nir_const_value_as_uint(instr->value[0], instr->def.bit_size)
 325                 }
 326         };
 327
 328         bi_emit(ctx, move);
 329 }
 330
 331 #define BI_CASE_CMP(op) \
 332         case op##8: \
 333         case op##16: \
 334         case op##32: \
 335
 336 static enum bi_class
 337 bi_class_for_nir_alu(nir_op op)
 338 {
 339         switch (op) {
 340         case nir_op_iadd:
 341         case nir_op_fadd:
 342         case nir_op_fsub:
 343                 return BI_ADD;
 344         case nir_op_isub:
 345                 return BI_ISUB;
 346
 347         BI_CASE_CMP(nir_op_flt)
 348         BI_CASE_CMP(nir_op_fge)
 349         BI_CASE_CMP(nir_op_feq)
 350         BI_CASE_CMP(nir_op_fne)
 351         BI_CASE_CMP(nir_op_ilt)
 352         BI_CASE_CMP(nir_op_ige)
 353         BI_CASE_CMP(nir_op_ieq)
 354         BI_CASE_CMP(nir_op_ine)
 355                 return BI_CMP;
 356
 357         case nir_op_b8csel:
 358         case nir_op_b16csel:
 359         case nir_op_b32csel:
 360                 return BI_CSEL;
 361
 362         case nir_op_i2i8:
 363         case nir_op_i2i16:
 364         case nir_op_i2i32:
 365         case nir_op_i2i64:
 366         case nir_op_u2u8:
 367         case nir_op_u2u16:
 368         case nir_op_u2u32:
 369         case nir_op_u2u64:
 370         case nir_op_f2i16:
 371         case nir_op_f2i32:
 372         case nir_op_f2i64:
 373         case nir_op_f2u16:
 374         case nir_op_f2u32:
 375         case nir_op_f2u64:
 376         case nir_op_i2f16:
 377         case nir_op_i2f32:
 378         case nir_op_i2f64:
 379         case nir_op_u2f16:
 380         case nir_op_u2f32:
 381         case nir_op_u2f64:
 382                 return BI_CONVERT;
 383
 384         case nir_op_ffma:
 385         case nir_op_fmul:
 386                 return BI_FMA;
 387
 388         case nir_op_imin:
 389         case nir_op_imax:
 390         case nir_op_umin:
 391         case nir_op_umax:
 392         case nir_op_fmin:
 393         case nir_op_fmax:
 394                 return BI_MINMAX;
 395
 396         case nir_op_fsat:
 397         case nir_op_fneg:
 398         case nir_op_fabs:
 399                 return BI_FMOV;
 400         case nir_op_mov:
 401                 return BI_MOV;
 402
 403         case nir_op_frcp:
 404         case nir_op_frsq:
 405         case nir_op_fsin:
 406         case nir_op_fcos:
 407                 return BI_SPECIAL;
 408
 409         default:
 410                 unreachable("Unknown ALU op");
 411         }
 412 }
 413
 414 static enum bi_cond
 415 bi_cond_for_nir(nir_op op)
 416 {
 417         switch (op) {
 418         BI_CASE_CMP(nir_op_flt)
 419         BI_CASE_CMP(nir_op_ilt)
 420                 return BI_COND_LT;
 421
 422         BI_CASE_CMP(nir_op_fge)
 423         BI_CASE_CMP(nir_op_ige)
 424                 return BI_COND_GE;
 425
 426         BI_CASE_CMP(nir_op_feq)
 427         BI_CASE_CMP(nir_op_ieq)
 428                 return BI_COND_EQ;
 429
 430         BI_CASE_CMP(nir_op_fne)
 431         BI_CASE_CMP(nir_op_ine)
 432                 return BI_COND_NE;
 433         default:
 434                 unreachable("Invalid compare");
 435         }
 436 }
 437
 438 static void
 439 emit_alu(bi_context *ctx, nir_alu_instr *instr)
 440 {
 441         /* Assume it's something we can handle normally */
 442         bi_instruction alu = {
 443                 .type = bi_class_for_nir_alu(instr->op),
 444                 .dest = bir_dest_index(&instr->dest.dest),
 445                 .dest_type = nir_op_infos[instr->op].output_type
 446                         | nir_dest_bit_size(instr->dest.dest),
 447         };
 448
 449         /* TODO: Implement lowering of special functions for older Bifrost */
 450         assert((alu.type != BI_SPECIAL) || !(ctx->quirks & BIFROST_NO_FAST_OP));
 451
 452         if (instr->dest.dest.is_ssa) {
 453                 /* Construct a writemask */
 454                 unsigned bits_per_comp = instr->dest.dest.ssa.bit_size;
 455                 unsigned comps = instr->dest.dest.ssa.num_components;
 456                 assert(comps == 1);
 457                 unsigned bits = bits_per_comp * comps;
 458                 unsigned bytes = bits / 8;
 459                 alu.writemask = (1 << bytes) - 1;
 460         } else {
 461                 unsigned comp_mask = instr->dest.write_mask;
 462
 463                 alu.writemask = pan_to_bytemask(nir_dest_bit_size(instr->dest.dest),
 464                                 comp_mask);
 465         }
 466
 467         /* We inline constants as we go. This tracks how many constants have
 468          * been inlined, since we're limited to 64-bits of constants per
 469          * instruction */
 470
 471         unsigned dest_bits = nir_dest_bit_size(instr->dest.dest);
 472         unsigned constants_left = (64 / dest_bits);
 473         unsigned constant_shift = 0;
 474
 475         /* Copy sources */
 476
 477         unsigned num_inputs = nir_op_infos[instr->op].num_inputs;
 478         assert(num_inputs <= ARRAY_SIZE(alu.src));
 479
 480         for (unsigned i = 0; i < num_inputs; ++i) {
 481                 unsigned bits = nir_src_bit_size(instr->src[i].src);
 482                 alu.src_types[i] = nir_op_infos[instr->op].input_types[i]
 483                         | bits;
 484
 485                 /* Try to inline a constant */
 486                 if (nir_src_is_const(instr->src[i].src) && constants_left && (dest_bits == bits)) {
 487                         alu.constant.u64 |=
 488                                 (nir_src_as_uint(instr->src[i].src)) << constant_shift;
 489
 490                         alu.src[i] = BIR_INDEX_CONSTANT | constant_shift;
 491                         --constants_left;
 492                         constant_shift += dest_bits;
 493                         continue;
 494                 }
 495
 496                 alu.src[i] = bir_src_index(&instr->src[i].src);
 497
 498                 /* We assert scalarization above */
 499                 alu.swizzle[i][0] = instr->src[i].swizzle[0];
 500         }
 501
 502         /* Op-specific fixup */
 503         switch (instr->op) {
 504         case nir_op_fmul:
 505                 alu.src[2] = BIR_INDEX_ZERO; /* FMA */
 506                 break;
 507         case nir_op_fsat:
 508                 alu.outmod = BIFROST_SAT; /* FMOV */
 509                 break;
 510         case nir_op_fneg:
 511                 alu.src_neg[0] = true; /* FMOV */
 512                 break;
 513         case nir_op_fabs:
 514                 alu.src_abs[0] = true; /* FMOV */
 515                 break;
 516         case nir_op_fsub:
 517                 alu.src_neg[1] = true; /* FADD */
 518                 break;
 519         case nir_op_fmax:
 520         case nir_op_imax:
 521         case nir_op_umax:
 522                 alu.op.minmax = BI_MINMAX_MAX; /* MINMAX */
 523                 break;
 524         case nir_op_frcp:
 525                 alu.op.special = BI_SPECIAL_FRCP;
 526                 break;
 527         case nir_op_frsq:
 528                 alu.op.special = BI_SPECIAL_FRSQ;
 529                 break;
 530         case nir_op_fsin:
 531                 alu.op.special = BI_SPECIAL_FSIN;
 532                 break;
 533         case nir_op_fcos:
 534                 alu.op.special = BI_SPECIAL_FCOS;
 535                 break;
 536         BI_CASE_CMP(nir_op_flt)
 537         BI_CASE_CMP(nir_op_ilt)
 538         BI_CASE_CMP(nir_op_fge)
 539         BI_CASE_CMP(nir_op_ige)
 540         BI_CASE_CMP(nir_op_feq)
 541         BI_CASE_CMP(nir_op_ieq)
 542         BI_CASE_CMP(nir_op_fne)
 543         BI_CASE_CMP(nir_op_ine)
 544                 alu.op.compare = bi_cond_for_nir(instr->op);
 545                 break;
 546         default:
 547                 break;
 548         }
 549
 550         bi_emit(ctx, alu);
 551 }
 552
 553 static void
 554 emit_instr(bi_context *ctx, struct nir_instr *instr)
 555 {
 556         switch (instr->type) {
 557         case nir_instr_type_load_const:
 558                 emit_load_const(ctx, nir_instr_as_load_const(instr));
 559                 break;
 560
 561         case nir_instr_type_intrinsic:
 562                 emit_intrinsic(ctx, nir_instr_as_intrinsic(instr));
 563                 break;
 564
 565         case nir_instr_type_alu:
 566                 emit_alu(ctx, nir_instr_as_alu(instr));
 567                 break;
 568
 569 #if 0
 570         case nir_instr_type_tex:
 571                 emit_tex(ctx, nir_instr_as_tex(instr));
 572                 break;
 573 #endif
 574
 575         case nir_instr_type_jump:
 576                 emit_jump(ctx, nir_instr_as_jump(instr));
 577                 break;
 578
 579         case nir_instr_type_ssa_undef:
 580                 /* Spurious */
 581                 break;
 582
 583         default:
 584                 //unreachable("Unhandled instruction type");
 585                 break;
 586         }
 587 }
 588
 589
 590
 591 static bi_block *
 592 create_empty_block(bi_context *ctx)
 593 {
 594         bi_block *blk = rzalloc(ctx, bi_block);
 595
 596         blk->base.predecessors = _mesa_set_create(blk,
 597                         _mesa_hash_pointer,
 598                         _mesa_key_pointer_equal);
 599
 600         blk->base.name = ctx->block_name_count++;
 601
 602         return blk;
 603 }
 604
 605 static void
 606 bi_schedule_barrier(bi_context *ctx)
 607 {
 608         bi_block *temp = ctx->after_block;
 609         ctx->after_block = create_empty_block(ctx);
 610         list_addtail(&ctx->after_block->base.link, &ctx->blocks);
 611         list_inithead(&ctx->after_block->base.instructions);
 612         pan_block_add_successor(&ctx->current_block->base, &ctx->after_block->base);
 613         ctx->current_block = ctx->after_block;
 614         ctx->after_block = temp;
 615 }
 616
 617 static bi_block *
 618 emit_block(bi_context *ctx, nir_block *block)
 619 {
 620         if (ctx->after_block) {
 621                 ctx->current_block = ctx->after_block;
 622                 ctx->after_block = NULL;
 623         } else {
 624                 ctx->current_block = create_empty_block(ctx);
 625         }
 626
 627         list_addtail(&ctx->current_block->base.link, &ctx->blocks);
 628         list_inithead(&ctx->current_block->base.instructions);
 629
 630         nir_foreach_instr(instr, block) {
 631                 emit_instr(ctx, instr);
 632                 ++ctx->instruction_count;
 633         }
 634
 635         return ctx->current_block;
 636 }
 637
 638 /* Emits an unconditional branch to the end of the current block, returning a
 639  * pointer so the user can fill in details */
 640
 641 static bi_instruction *
 642 bi_emit_branch(bi_context *ctx)
 643 {
 644         bi_instruction branch = {
 645                 .type = BI_BRANCH,
 646                 .branch = {
 647                         .cond = BI_COND_ALWAYS
 648                 }
 649         };
 650
 651         return bi_emit(ctx, branch);
 652 }
 653
 654 /* Sets a condition for a branch by examing the NIR condition. If we're
 655  * familiar with the condition, we unwrap it to fold it into the branch
 656  * instruction. Otherwise, we consume the condition directly. We
 657  * generally use 1-bit booleans which allows us to use small types for
 658  * the conditions.
 659  */
 660
 661 static void
 662 bi_set_branch_cond(bi_instruction *branch, nir_src *cond, bool invert)
 663 {
 664         /* TODO: Try to unwrap instead of always bailing */
 665         branch->src[0] = bir_src_index(cond);
 666         branch->src[1] = BIR_INDEX_ZERO;
 667         branch->src_types[0] = branch->src_types[1] = nir_type_uint16;
 668         branch->branch.cond = invert ? BI_COND_EQ : BI_COND_NE;
 669 }
 670
 671 static void
 672 emit_if(bi_context *ctx, nir_if *nif)
 673 {
 674         bi_block *before_block = ctx->current_block;
 675
 676         /* Speculatively emit the branch, but we can't fill it in until later */
 677         bi_instruction *then_branch = bi_emit_branch(ctx);
 678         bi_set_branch_cond(then_branch, &nif->condition, true);
 679
 680         /* Emit the two subblocks. */
 681         bi_block *then_block = emit_cf_list(ctx, &nif->then_list);
 682         bi_block *end_then_block = ctx->current_block;
 683
 684         /* Emit a jump from the end of the then block to the end of the else */
 685         bi_instruction *then_exit = bi_emit_branch(ctx);
 686
 687         /* Emit second block, and check if it's empty */
 688
 689         int count_in = ctx->instruction_count;
 690         bi_block *else_block = emit_cf_list(ctx, &nif->else_list);
 691         bi_block *end_else_block = ctx->current_block;
 692         ctx->after_block = create_empty_block(ctx);
 693
 694         /* Now that we have the subblocks emitted, fix up the branches */
 695
 696         assert(then_block);
 697         assert(else_block);
 698
 699         if (ctx->instruction_count == count_in) {
 700                 /* The else block is empty, so don't emit an exit jump */
 701                 bi_remove_instruction(then_exit);
 702                 then_branch->branch.target = ctx->after_block;
 703         } else {
 704                 then_branch->branch.target = else_block;
 705                 then_exit->branch.target = ctx->after_block;
 706                 pan_block_add_successor(&end_then_block->base, &then_exit->branch.target->base);
 707         }
 708
 709         /* Wire up the successors */
 710
 711         pan_block_add_successor(&before_block->base, &then_branch->branch.target->base); /* then_branch */
 712
 713         pan_block_add_successor(&before_block->base, &then_block->base); /* fallthrough */
 714         pan_block_add_successor(&end_else_block->base, &ctx->after_block->base); /* fallthrough */
 715 }
 716
 717 static void
 718 emit_loop(bi_context *ctx, nir_loop *nloop)
 719 {
 720         /* Remember where we are */
 721         bi_block *start_block = ctx->current_block;
 722
 723         bi_block *saved_break = ctx->break_block;
 724         bi_block *saved_continue = ctx->continue_block;
 725
 726         ctx->continue_block = create_empty_block(ctx);
 727         ctx->break_block = create_empty_block(ctx);
 728         ctx->after_block = ctx->continue_block;
 729
 730         /* Emit the body itself */
 731         emit_cf_list(ctx, &nloop->body);
 732
 733         /* Branch back to loop back */
 734         bi_instruction *br_back = bi_emit_branch(ctx);
 735         br_back->branch.target = ctx->continue_block;
 736         pan_block_add_successor(&start_block->base, &ctx->continue_block->base);
 737         pan_block_add_successor(&ctx->current_block->base, &ctx->continue_block->base);
 738
 739         ctx->after_block = ctx->break_block;
 740
 741         /* Pop off */
 742         ctx->break_block = saved_break;
 743         ctx->continue_block = saved_continue;
 744         ++ctx->loop_count;
 745 }
 746
 747 static bi_block *
 748 emit_cf_list(bi_context *ctx, struct exec_list *list)
 749 {
 750         bi_block *start_block = NULL;
 751
 752         foreach_list_typed(nir_cf_node, node, node, list) {
 753                 switch (node->type) {
 754                 case nir_cf_node_block: {
 755                         bi_block *block = emit_block(ctx, nir_cf_node_as_block(node));
 756
 757                         if (!start_block)
 758                                 start_block = block;
 759
 760                         break;
 761                 }
 762
 763                 case nir_cf_node_if:
 764                         emit_if(ctx, nir_cf_node_as_if(node));
 765                         break;
 766
 767                 case nir_cf_node_loop:
 768                         emit_loop(ctx, nir_cf_node_as_loop(node));
 769                         break;
 770
 771                 default:
 772                         unreachable("Unknown control flow");
 773                 }
 774         }
 775
 776         return start_block;
 777 }
 778
 779 static int
 780 glsl_type_size(const struct glsl_type *type, bool bindless)
 781 {
 782         return glsl_count_attribute_slots(type, false);
 783 }
 784
 785 static void
 786 bi_optimize_nir(nir_shader *nir)
 787 {
 788         bool progress;
 789         unsigned lower_flrp = 16 | 32 | 64;
 790
 791         NIR_PASS(progress, nir, nir_lower_regs_to_ssa);
 792         NIR_PASS(progress, nir, nir_lower_idiv, nir_lower_idiv_fast);
 793
 794         nir_lower_tex_options lower_tex_options = {
 795                 .lower_txs_lod = true,
 796                 .lower_txp = ~0,
 797                 .lower_tex_without_implicit_lod = true,
 798                 .lower_txd = true,
 799         };
 800
 801         NIR_PASS(progress, nir, nir_lower_tex, &lower_tex_options);
 802         NIR_PASS(progress, nir, nir_lower_alu_to_scalar, NULL, NULL);
 803         NIR_PASS(progress, nir, nir_lower_load_const_to_scalar);
 804
 805         do {
 806                 progress = false;
 807
 808                 NIR_PASS(progress, nir, nir_lower_var_copies);
 809                 NIR_PASS(progress, nir, nir_lower_vars_to_ssa);
 810
 811                 NIR_PASS(progress, nir, nir_copy_prop);
 812                 NIR_PASS(progress, nir, nir_opt_remove_phis);
 813                 NIR_PASS(progress, nir, nir_opt_dce);
 814                 NIR_PASS(progress, nir, nir_opt_dead_cf);
 815                 NIR_PASS(progress, nir, nir_opt_cse);
 816                 NIR_PASS(progress, nir, nir_opt_peephole_select, 64, false, true);
 817                 NIR_PASS(progress, nir, nir_opt_algebraic);
 818                 NIR_PASS(progress, nir, nir_opt_constant_folding);
 819
 820                 if (lower_flrp != 0) {
 821                         bool lower_flrp_progress = false;
 822                         NIR_PASS(lower_flrp_progress,
 823                                  nir,
 824                                  nir_lower_flrp,
 825                                  lower_flrp,
 826                                  false /* always_precise */,
 827                                  nir->options->lower_ffma);
 828                         if (lower_flrp_progress) {
 829                                 NIR_PASS(progress, nir,
 830                                          nir_opt_constant_folding);
 831                                 progress = true;
 832                         }
 833
 834                         /* Nothing should rematerialize any flrps, so we only
 835                          * need to do this lowering once.
 836                          */
 837                         lower_flrp = 0;
 838                 }
 839
 840                 NIR_PASS(progress, nir, nir_opt_undef);
 841                 NIR_PASS(progress, nir, nir_opt_loop_unroll,
 842                          nir_var_shader_in |
 843                          nir_var_shader_out |
 844                          nir_var_function_temp);
 845         } while (progress);
 846
 847         NIR_PASS(progress, nir, nir_opt_algebraic_late);
 848         NIR_PASS(progress, nir, nir_lower_bool_to_int32);
 849         NIR_PASS(progress, nir, bifrost_nir_lower_algebraic_late);
 850         NIR_PASS(progress, nir, nir_lower_alu_to_scalar, NULL, NULL);
 851         NIR_PASS(progress, nir, nir_lower_load_const_to_scalar);
 852
 853         /* Take us out of SSA */
 854         NIR_PASS(progress, nir, nir_lower_locals_to_regs);
 855         NIR_PASS(progress, nir, nir_convert_from_ssa, true);
 856
 857         /* We're a primary scalar architecture but there's enough vector that
 858          * we use a vector IR so let's not also deal with scalar hacks on top
 859          * of the vector hacks */
 860
 861         NIR_PASS(progress, nir, nir_move_vec_src_uses_to_dest);
 862         NIR_PASS(progress, nir, nir_lower_vec_to_movs);
 863         NIR_PASS(progress, nir, nir_opt_dce);
 864 }
 865
 866 static void
 867 bi_insert_mov32(bi_context *ctx, bi_instruction *parent, unsigned comp)
 868 {
 869         bi_instruction move = {
 870                 .type = BI_MOV,
 871                 .dest = parent->dest,
 872                 .dest_type = nir_type_uint32,
 873                 .writemask = (0xF << (4 * comp)),
 874                 .src = { parent->src[0] },
 875                 .src_types = { nir_type_uint32 },
 876                 .swizzle = { { comp } }
 877         };
 878
 879         bi_emit_before(ctx, parent, move);
 880 }
 881
 882 static void
 883 bi_lower_mov(bi_context *ctx, bi_block *block)
 884 {
 885         bi_foreach_instr_in_block_safe(block, ins) {
 886                 if (ins->type != BI_MOV) continue;
 887                 if (util_bitcount(ins->writemask) <= 4) continue;
 888
 889                 for (unsigned i = 0; i < 4; ++i) {
 890                         unsigned quad = (ins->writemask >> (4 * i)) & 0xF;
 891
 892                         if (quad == 0)
 893                                 continue;
 894                         else if (quad == 0xF)
 895                                 bi_insert_mov32(ctx, ins, i);
 896                         else
 897                                 unreachable("TODO: Lowering <32bit moves");
 898                 }
 899
 900                 bi_remove_instruction(ins);
 901         }
 902 }
 903
 904 void
 905 bifrost_compile_shader_nir(nir_shader *nir, panfrost_program *program, unsigned product_id)
 906 {
 907         bi_context *ctx = rzalloc(NULL, bi_context);
 908         ctx->nir = nir;
 909         ctx->stage = nir->info.stage;
 910         ctx->quirks = bifrost_get_quirks(product_id);
 911         list_inithead(&ctx->blocks);
 912
 913         /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
 914          * (so we don't accidentally duplicate the epilogue since mesa/st has
 915          * messed with our I/O quite a bit already) */
 916
 917         NIR_PASS_V(nir, nir_lower_vars_to_ssa);
 918
 919         if (ctx->stage == MESA_SHADER_VERTEX) {
 920                 NIR_PASS_V(nir, nir_lower_viewport_transform);
 921                 NIR_PASS_V(nir, nir_lower_point_size, 1.0, 1024.0);
 922         }
 923
 924         NIR_PASS_V(nir, nir_split_var_copies);
 925         NIR_PASS_V(nir, nir_lower_global_vars_to_local);
 926         NIR_PASS_V(nir, nir_lower_var_copies);
 927         NIR_PASS_V(nir, nir_lower_vars_to_ssa);
 928         NIR_PASS_V(nir, nir_lower_io, nir_var_all, glsl_type_size, 0);
 929         NIR_PASS_V(nir, nir_lower_ssbo);
 930
 931         bi_optimize_nir(nir);
 932         nir_print_shader(nir, stdout);
 933
 934         panfrost_nir_assign_sysvals(&ctx->sysvals, nir);
 935         program->sysval_count = ctx->sysvals.sysval_count;
 936         memcpy(program->sysvals, ctx->sysvals.sysvals, sizeof(ctx->sysvals.sysvals[0]) * ctx->sysvals.sysval_count);
 937
 938         nir_foreach_function(func, nir) {
 939                 if (!func->impl)
 940                         continue;
 941
 942                 ctx->impl = func->impl;
 943                 emit_cf_list(ctx, &func->impl->body);
 944                 break; /* TODO: Multi-function shaders */
 945         }
 946
 947         bi_foreach_block(ctx, _block) {
 948                 bi_block *block = (bi_block *) _block;
 949                 bi_lower_mov(ctx, block);
 950         }
 951
 952         bool progress = false;
 953
 954         do {
 955                 progress = false;
 956
 957                 bi_foreach_block(ctx, _block) {
 958                         bi_block *block = (bi_block *) _block;
 959                         progress |= bi_opt_dead_code_eliminate(ctx, block);
 960                 }
 961         } while(progress);
 962
 963         bi_print_shader(ctx, stdout);
 964         bi_schedule(ctx);
 965         bi_register_allocate(ctx);
 966         bi_print_shader(ctx, stdout);
 967         bi_pack(ctx, &program->compiled);
 968         disassemble_bifrost(stdout, program->compiled.data, program->compiled.size, true);
 969
 970         ralloc_free(ctx);
 971 }