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 "util/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         case nir_op_f2f16:
 383         case nir_op_f2f32:
 384         case nir_op_f2f64:
 385         case nir_op_f2fmp:
 386                 return BI_CONVERT;
 387
 388         case nir_op_vec2:
 389         case nir_op_vec3:
 390         case nir_op_vec4:
 391                 return BI_COMBINE;
 392
 393         case nir_op_vec8:
 394         case nir_op_vec16:
 395                 unreachable("should've been lowered");
 396
 397         case nir_op_ffma:
 398         case nir_op_fmul:
 399                 return BI_FMA;
 400
 401         case nir_op_imin:
 402         case nir_op_imax:
 403         case nir_op_umin:
 404         case nir_op_umax:
 405         case nir_op_fmin:
 406         case nir_op_fmax:
 407                 return BI_MINMAX;
 408
 409         case nir_op_fsat:
 410         case nir_op_fneg:
 411         case nir_op_fabs:
 412                 return BI_FMOV;
 413         case nir_op_mov:
 414                 return BI_MOV;
 415
 416         case nir_op_frcp:
 417         case nir_op_frsq:
 418         case nir_op_fsin:
 419         case nir_op_fcos:
 420                 return BI_SPECIAL;
 421
 422         default:
 423                 unreachable("Unknown ALU op");
 424         }
 425 }
 426
 427 /* Gets a bi_cond for a given NIR comparison opcode. In soft mode, it will
 428  * return BI_COND_ALWAYS as a sentinel if it fails to do so (when used for
 429  * optimizations). Otherwise it will bail (when used for primary code
 430  * generation). */
 431
 432 static enum bi_cond
 433 bi_cond_for_nir(nir_op op, bool soft)
 434 {
 435         switch (op) {
 436         BI_CASE_CMP(nir_op_flt)
 437         BI_CASE_CMP(nir_op_ilt)
 438                 return BI_COND_LT;
 439
 440         BI_CASE_CMP(nir_op_fge)
 441         BI_CASE_CMP(nir_op_ige)
 442                 return BI_COND_GE;
 443
 444         BI_CASE_CMP(nir_op_feq)
 445         BI_CASE_CMP(nir_op_ieq)
 446                 return BI_COND_EQ;
 447
 448         BI_CASE_CMP(nir_op_fne)
 449         BI_CASE_CMP(nir_op_ine)
 450                 return BI_COND_NE;
 451         default:
 452                 if (soft)
 453                         return BI_COND_ALWAYS;
 454                 else
 455                         unreachable("Invalid compare");
 456         }
 457 }
 458
 459 static void
 460 bi_copy_src(bi_instruction *alu, nir_alu_instr *instr, unsigned i, unsigned to,
 461                 unsigned *constants_left, unsigned *constant_shift)
 462 {
 463         unsigned bits = nir_src_bit_size(instr->src[i].src);
 464         unsigned dest_bits = nir_dest_bit_size(instr->dest.dest);
 465
 466         alu->src_types[to] = nir_op_infos[instr->op].input_types[i]
 467                 | bits;
 468
 469         /* Try to inline a constant */
 470         if (nir_src_is_const(instr->src[i].src) && *constants_left && (dest_bits == bits)) {
 471                 alu->constant.u64 |=
 472                         (nir_src_as_uint(instr->src[i].src)) << *constant_shift;
 473
 474                 alu->src[to] = BIR_INDEX_CONSTANT | (*constant_shift);
 475                 --(*constants_left);
 476                 (*constant_shift) += dest_bits;
 477                 return;
 478         }
 479
 480         alu->src[to] = bir_src_index(&instr->src[i].src);
 481
 482         /* We assert scalarization above */
 483         alu->swizzle[to][0] = instr->src[i].swizzle[0];
 484 }
 485
 486 static void
 487 bi_fuse_csel_cond(bi_instruction *csel, nir_alu_src cond,
 488                 unsigned *constants_left, unsigned *constant_shift)
 489 {
 490         /* Bail for vector weirdness */
 491         if (cond.swizzle[0] != 0)
 492                 return;
 493
 494         if (!cond.src.is_ssa)
 495                 return;
 496
 497         nir_ssa_def *def = cond.src.ssa;
 498         nir_instr *parent = def->parent_instr;
 499
 500         if (parent->type != nir_instr_type_alu)
 501                 return;
 502
 503         nir_alu_instr *alu = nir_instr_as_alu(parent);
 504
 505         /* Try to match a condition */
 506         enum bi_cond bcond = bi_cond_for_nir(alu->op, true);
 507
 508         if (bcond == BI_COND_ALWAYS)
 509                 return;
 510
 511         /* We found one, let's fuse it in */
 512         csel->csel_cond = bcond;
 513         bi_copy_src(csel, alu, 0, 0, constants_left, constant_shift);
 514         bi_copy_src(csel, alu, 1, 3, constants_left, constant_shift);
 515 }
 516
 517 static void
 518 emit_alu(bi_context *ctx, nir_alu_instr *instr)
 519 {
 520         /* Assume it's something we can handle normally */
 521         bi_instruction alu = {
 522                 .type = bi_class_for_nir_alu(instr->op),
 523                 .dest = bir_dest_index(&instr->dest.dest),
 524                 .dest_type = nir_op_infos[instr->op].output_type
 525                         | nir_dest_bit_size(instr->dest.dest),
 526         };
 527
 528         /* TODO: Implement lowering of special functions for older Bifrost */
 529         assert((alu.type != BI_SPECIAL) || !(ctx->quirks & BIFROST_NO_FAST_OP));
 530
 531         if (instr->dest.dest.is_ssa) {
 532                 /* Construct a writemask */
 533                 unsigned bits_per_comp = instr->dest.dest.ssa.bit_size;
 534                 unsigned comps = instr->dest.dest.ssa.num_components;
 535
 536                 if (alu.type != BI_COMBINE)
 537                         assert(comps == 1);
 538
 539                 unsigned bits = bits_per_comp * comps;
 540                 unsigned bytes = bits / 8;
 541                 alu.writemask = (1 << bytes) - 1;
 542         } else {
 543                 unsigned comp_mask = instr->dest.write_mask;
 544
 545                 alu.writemask = pan_to_bytemask(nir_dest_bit_size(instr->dest.dest),
 546                                 comp_mask);
 547         }
 548
 549         /* We inline constants as we go. This tracks how many constants have
 550          * been inlined, since we're limited to 64-bits of constants per
 551          * instruction */
 552
 553         unsigned dest_bits = nir_dest_bit_size(instr->dest.dest);
 554         unsigned constants_left = (64 / dest_bits);
 555         unsigned constant_shift = 0;
 556
 557         /* Copy sources */
 558
 559         unsigned num_inputs = nir_op_infos[instr->op].num_inputs;
 560         assert(num_inputs <= ARRAY_SIZE(alu.src));
 561
 562         for (unsigned i = 0; i < num_inputs; ++i)
 563                 bi_copy_src(&alu, instr, i, i, &constants_left, &constant_shift);
 564
 565         /* Op-specific fixup */
 566         switch (instr->op) {
 567         case nir_op_fmul:
 568                 alu.src[2] = BIR_INDEX_ZERO; /* FMA */
 569                 break;
 570         case nir_op_fsat:
 571                 alu.outmod = BIFROST_SAT; /* FMOV */
 572                 break;
 573         case nir_op_fneg:
 574                 alu.src_neg[0] = true; /* FMOV */
 575                 break;
 576         case nir_op_fabs:
 577                 alu.src_abs[0] = true; /* FMOV */
 578                 break;
 579         case nir_op_fsub:
 580                 alu.src_neg[1] = true; /* FADD */
 581                 break;
 582         case nir_op_fmax:
 583         case nir_op_imax:
 584         case nir_op_umax:
 585                 alu.op.minmax = BI_MINMAX_MAX; /* MINMAX */
 586                 break;
 587         case nir_op_frcp:
 588                 alu.op.special = BI_SPECIAL_FRCP;
 589                 break;
 590         case nir_op_frsq:
 591                 alu.op.special = BI_SPECIAL_FRSQ;
 592                 break;
 593         case nir_op_fsin:
 594                 alu.op.special = BI_SPECIAL_FSIN;
 595                 break;
 596         case nir_op_fcos:
 597                 alu.op.special = BI_SPECIAL_FCOS;
 598                 break;
 599         BI_CASE_CMP(nir_op_flt)
 600         BI_CASE_CMP(nir_op_ilt)
 601         BI_CASE_CMP(nir_op_fge)
 602         BI_CASE_CMP(nir_op_ige)
 603         BI_CASE_CMP(nir_op_feq)
 604         BI_CASE_CMP(nir_op_ieq)
 605         BI_CASE_CMP(nir_op_fne)
 606         BI_CASE_CMP(nir_op_ine)
 607                 alu.op.compare = bi_cond_for_nir(instr->op, false);
 608                 break;
 609         default:
 610                 break;
 611         }
 612
 613         if (alu.type == BI_CSEL) {
 614                 /* Default to csel3 */
 615                 alu.csel_cond = BI_COND_NE;
 616                 alu.src[3] = BIR_INDEX_ZERO;
 617                 alu.src_types[3] = alu.src_types[0];
 618
 619                 bi_fuse_csel_cond(&alu, instr->src[0],
 620                                 &constants_left, &constant_shift);
 621         }
 622
 623         bi_emit(ctx, alu);
 624 }
 625
 626 static void
 627 emit_instr(bi_context *ctx, struct nir_instr *instr)
 628 {
 629         switch (instr->type) {
 630         case nir_instr_type_load_const:
 631                 emit_load_const(ctx, nir_instr_as_load_const(instr));
 632                 break;
 633
 634         case nir_instr_type_intrinsic:
 635                 emit_intrinsic(ctx, nir_instr_as_intrinsic(instr));
 636                 break;
 637
 638         case nir_instr_type_alu:
 639                 emit_alu(ctx, nir_instr_as_alu(instr));
 640                 break;
 641
 642 #if 0
 643         case nir_instr_type_tex:
 644                 emit_tex(ctx, nir_instr_as_tex(instr));
 645                 break;
 646 #endif
 647
 648         case nir_instr_type_jump:
 649                 emit_jump(ctx, nir_instr_as_jump(instr));
 650                 break;
 651
 652         case nir_instr_type_ssa_undef:
 653                 /* Spurious */
 654                 break;
 655
 656         default:
 657                 //unreachable("Unhandled instruction type");
 658                 break;
 659         }
 660 }
 661
 662
 663
 664 static bi_block *
 665 create_empty_block(bi_context *ctx)
 666 {
 667         bi_block *blk = rzalloc(ctx, bi_block);
 668
 669         blk->base.predecessors = _mesa_set_create(blk,
 670                         _mesa_hash_pointer,
 671                         _mesa_key_pointer_equal);
 672
 673         blk->base.name = ctx->block_name_count++;
 674
 675         return blk;
 676 }
 677
 678 static void
 679 bi_schedule_barrier(bi_context *ctx)
 680 {
 681         bi_block *temp = ctx->after_block;
 682         ctx->after_block = create_empty_block(ctx);
 683         list_addtail(&ctx->after_block->base.link, &ctx->blocks);
 684         list_inithead(&ctx->after_block->base.instructions);
 685         pan_block_add_successor(&ctx->current_block->base, &ctx->after_block->base);
 686         ctx->current_block = ctx->after_block;
 687         ctx->after_block = temp;
 688 }
 689
 690 static bi_block *
 691 emit_block(bi_context *ctx, nir_block *block)
 692 {
 693         if (ctx->after_block) {
 694                 ctx->current_block = ctx->after_block;
 695                 ctx->after_block = NULL;
 696         } else {
 697                 ctx->current_block = create_empty_block(ctx);
 698         }
 699
 700         list_addtail(&ctx->current_block->base.link, &ctx->blocks);
 701         list_inithead(&ctx->current_block->base.instructions);
 702
 703         nir_foreach_instr(instr, block) {
 704                 emit_instr(ctx, instr);
 705                 ++ctx->instruction_count;
 706         }
 707
 708         return ctx->current_block;
 709 }
 710
 711 /* Emits an unconditional branch to the end of the current block, returning a
 712  * pointer so the user can fill in details */
 713
 714 static bi_instruction *
 715 bi_emit_branch(bi_context *ctx)
 716 {
 717         bi_instruction branch = {
 718                 .type = BI_BRANCH,
 719                 .branch = {
 720                         .cond = BI_COND_ALWAYS
 721                 }
 722         };
 723
 724         return bi_emit(ctx, branch);
 725 }
 726
 727 /* Sets a condition for a branch by examing the NIR condition. If we're
 728  * familiar with the condition, we unwrap it to fold it into the branch
 729  * instruction. Otherwise, we consume the condition directly. We
 730  * generally use 1-bit booleans which allows us to use small types for
 731  * the conditions.
 732  */
 733
 734 static void
 735 bi_set_branch_cond(bi_instruction *branch, nir_src *cond, bool invert)
 736 {
 737         /* TODO: Try to unwrap instead of always bailing */
 738         branch->src[0] = bir_src_index(cond);
 739         branch->src[1] = BIR_INDEX_ZERO;
 740         branch->src_types[0] = branch->src_types[1] = nir_type_uint16;
 741         branch->branch.cond = invert ? BI_COND_EQ : BI_COND_NE;
 742 }
 743
 744 static void
 745 emit_if(bi_context *ctx, nir_if *nif)
 746 {
 747         bi_block *before_block = ctx->current_block;
 748
 749         /* Speculatively emit the branch, but we can't fill it in until later */
 750         bi_instruction *then_branch = bi_emit_branch(ctx);
 751         bi_set_branch_cond(then_branch, &nif->condition, true);
 752
 753         /* Emit the two subblocks. */
 754         bi_block *then_block = emit_cf_list(ctx, &nif->then_list);
 755         bi_block *end_then_block = ctx->current_block;
 756
 757         /* Emit a jump from the end of the then block to the end of the else */
 758         bi_instruction *then_exit = bi_emit_branch(ctx);
 759
 760         /* Emit second block, and check if it's empty */
 761
 762         int count_in = ctx->instruction_count;
 763         bi_block *else_block = emit_cf_list(ctx, &nif->else_list);
 764         bi_block *end_else_block = ctx->current_block;
 765         ctx->after_block = create_empty_block(ctx);
 766
 767         /* Now that we have the subblocks emitted, fix up the branches */
 768
 769         assert(then_block);
 770         assert(else_block);
 771
 772         if (ctx->instruction_count == count_in) {
 773                 /* The else block is empty, so don't emit an exit jump */
 774                 bi_remove_instruction(then_exit);
 775                 then_branch->branch.target = ctx->after_block;
 776         } else {
 777                 then_branch->branch.target = else_block;
 778                 then_exit->branch.target = ctx->after_block;
 779                 pan_block_add_successor(&end_then_block->base, &then_exit->branch.target->base);
 780         }
 781
 782         /* Wire up the successors */
 783
 784         pan_block_add_successor(&before_block->base, &then_branch->branch.target->base); /* then_branch */
 785
 786         pan_block_add_successor(&before_block->base, &then_block->base); /* fallthrough */
 787         pan_block_add_successor(&end_else_block->base, &ctx->after_block->base); /* fallthrough */
 788 }
 789
 790 static void
 791 emit_loop(bi_context *ctx, nir_loop *nloop)
 792 {
 793         /* Remember where we are */
 794         bi_block *start_block = ctx->current_block;
 795
 796         bi_block *saved_break = ctx->break_block;
 797         bi_block *saved_continue = ctx->continue_block;
 798
 799         ctx->continue_block = create_empty_block(ctx);
 800         ctx->break_block = create_empty_block(ctx);
 801         ctx->after_block = ctx->continue_block;
 802
 803         /* Emit the body itself */
 804         emit_cf_list(ctx, &nloop->body);
 805
 806         /* Branch back to loop back */
 807         bi_instruction *br_back = bi_emit_branch(ctx);
 808         br_back->branch.target = ctx->continue_block;
 809         pan_block_add_successor(&start_block->base, &ctx->continue_block->base);
 810         pan_block_add_successor(&ctx->current_block->base, &ctx->continue_block->base);
 811
 812         ctx->after_block = ctx->break_block;
 813
 814         /* Pop off */
 815         ctx->break_block = saved_break;
 816         ctx->continue_block = saved_continue;
 817         ++ctx->loop_count;
 818 }
 819
 820 static bi_block *
 821 emit_cf_list(bi_context *ctx, struct exec_list *list)
 822 {
 823         bi_block *start_block = NULL;
 824
 825         foreach_list_typed(nir_cf_node, node, node, list) {
 826                 switch (node->type) {
 827                 case nir_cf_node_block: {
 828                         bi_block *block = emit_block(ctx, nir_cf_node_as_block(node));
 829
 830                         if (!start_block)
 831                                 start_block = block;
 832
 833                         break;
 834                 }
 835
 836                 case nir_cf_node_if:
 837                         emit_if(ctx, nir_cf_node_as_if(node));
 838                         break;
 839
 840                 case nir_cf_node_loop:
 841                         emit_loop(ctx, nir_cf_node_as_loop(node));
 842                         break;
 843
 844                 default:
 845                         unreachable("Unknown control flow");
 846                 }
 847         }
 848
 849         return start_block;
 850 }
 851
 852 static int
 853 glsl_type_size(const struct glsl_type *type, bool bindless)
 854 {
 855         return glsl_count_attribute_slots(type, false);
 856 }
 857
 858 static void
 859 bi_optimize_nir(nir_shader *nir)
 860 {
 861         bool progress;
 862         unsigned lower_flrp = 16 | 32 | 64;
 863
 864         NIR_PASS(progress, nir, nir_lower_regs_to_ssa);
 865         NIR_PASS(progress, nir, nir_lower_idiv, nir_lower_idiv_fast);
 866
 867         nir_lower_tex_options lower_tex_options = {
 868                 .lower_txs_lod = true,
 869                 .lower_txp = ~0,
 870                 .lower_tex_without_implicit_lod = true,
 871                 .lower_txd = true,
 872         };
 873
 874         NIR_PASS(progress, nir, nir_lower_tex, &lower_tex_options);
 875         NIR_PASS(progress, nir, nir_lower_alu_to_scalar, NULL, NULL);
 876         NIR_PASS(progress, nir, nir_lower_load_const_to_scalar);
 877
 878         do {
 879                 progress = false;
 880
 881                 NIR_PASS(progress, nir, nir_lower_var_copies);
 882                 NIR_PASS(progress, nir, nir_lower_vars_to_ssa);
 883
 884                 NIR_PASS(progress, nir, nir_copy_prop);
 885                 NIR_PASS(progress, nir, nir_opt_remove_phis);
 886                 NIR_PASS(progress, nir, nir_opt_dce);
 887                 NIR_PASS(progress, nir, nir_opt_dead_cf);
 888                 NIR_PASS(progress, nir, nir_opt_cse);
 889                 NIR_PASS(progress, nir, nir_opt_peephole_select, 64, false, true);
 890                 NIR_PASS(progress, nir, nir_opt_algebraic);
 891                 NIR_PASS(progress, nir, nir_opt_constant_folding);
 892
 893                 if (lower_flrp != 0) {
 894                         bool lower_flrp_progress = false;
 895                         NIR_PASS(lower_flrp_progress,
 896                                  nir,
 897                                  nir_lower_flrp,
 898                                  lower_flrp,
 899                                  false /* always_precise */,
 900                                  nir->options->lower_ffma);
 901                         if (lower_flrp_progress) {
 902                                 NIR_PASS(progress, nir,
 903                                          nir_opt_constant_folding);
 904                                 progress = true;
 905                         }
 906
 907                         /* Nothing should rematerialize any flrps, so we only
 908                          * need to do this lowering once.
 909                          */
 910                         lower_flrp = 0;
 911                 }
 912
 913                 NIR_PASS(progress, nir, nir_opt_undef);
 914                 NIR_PASS(progress, nir, nir_opt_loop_unroll,
 915                          nir_var_shader_in |
 916                          nir_var_shader_out |
 917                          nir_var_function_temp);
 918         } while (progress);
 919
 920         NIR_PASS(progress, nir, nir_opt_algebraic_late);
 921         NIR_PASS(progress, nir, nir_lower_bool_to_int32);
 922         NIR_PASS(progress, nir, bifrost_nir_lower_algebraic_late);
 923         NIR_PASS(progress, nir, nir_lower_alu_to_scalar, NULL, NULL);
 924         NIR_PASS(progress, nir, nir_lower_load_const_to_scalar);
 925
 926         /* Take us out of SSA */
 927         NIR_PASS(progress, nir, nir_lower_locals_to_regs);
 928         NIR_PASS(progress, nir, nir_move_vec_src_uses_to_dest);
 929         NIR_PASS(progress, nir, nir_convert_from_ssa, true);
 930 }
 931
 932 void
 933 bifrost_compile_shader_nir(nir_shader *nir, panfrost_program *program, unsigned product_id)
 934 {
 935         bi_context *ctx = rzalloc(NULL, bi_context);
 936         ctx->nir = nir;
 937         ctx->stage = nir->info.stage;
 938         ctx->quirks = bifrost_get_quirks(product_id);
 939         list_inithead(&ctx->blocks);
 940
 941         /* Lower gl_Position pre-optimisation, but after lowering vars to ssa
 942          * (so we don't accidentally duplicate the epilogue since mesa/st has
 943          * messed with our I/O quite a bit already) */
 944
 945         NIR_PASS_V(nir, nir_lower_vars_to_ssa);
 946
 947         if (ctx->stage == MESA_SHADER_VERTEX) {
 948                 NIR_PASS_V(nir, nir_lower_viewport_transform);
 949                 NIR_PASS_V(nir, nir_lower_point_size, 1.0, 1024.0);
 950         }
 951
 952         NIR_PASS_V(nir, nir_split_var_copies);
 953         NIR_PASS_V(nir, nir_lower_global_vars_to_local);
 954         NIR_PASS_V(nir, nir_lower_var_copies);
 955         NIR_PASS_V(nir, nir_lower_vars_to_ssa);
 956         NIR_PASS_V(nir, nir_lower_io, nir_var_all, glsl_type_size, 0);
 957         NIR_PASS_V(nir, nir_lower_ssbo);
 958
 959         bi_optimize_nir(nir);
 960         nir_print_shader(nir, stdout);
 961
 962         panfrost_nir_assign_sysvals(&ctx->sysvals, nir);
 963         program->sysval_count = ctx->sysvals.sysval_count;
 964         memcpy(program->sysvals, ctx->sysvals.sysvals, sizeof(ctx->sysvals.sysvals[0]) * ctx->sysvals.sysval_count);
 965
 966         nir_foreach_function(func, nir) {
 967                 if (!func->impl)
 968                         continue;
 969
 970                 ctx->impl = func->impl;
 971                 emit_cf_list(ctx, &func->impl->body);
 972                 break; /* TODO: Multi-function shaders */
 973         }
 974
 975         bi_foreach_block(ctx, _block) {
 976                 bi_block *block = (bi_block *) _block;
 977                 bi_lower_combine(ctx, block);
 978         }
 979
 980         bool progress = false;
 981
 982         do {
 983                 progress = false;
 984
 985                 bi_foreach_block(ctx, _block) {
 986                         bi_block *block = (bi_block *) _block;
 987                         progress |= bi_opt_dead_code_eliminate(ctx, block);
 988                 }
 989         } while(progress);
 990
 991         bi_print_shader(ctx, stdout);
 992         bi_schedule(ctx);
 993         bi_register_allocate(ctx);
 994         bi_print_shader(ctx, stdout);
 995         bi_pack(ctx, &program->compiled);
 996         disassemble_bifrost(stdout, program->compiled.data, program->compiled.size, true);
 997
 998         ralloc_free(ctx);
 999 }