8066 lines
271 KiB
C++
8066 lines
271 KiB
C++
/*
|
||
* Copyright © 2010 Intel Corporation
|
||
*
|
||
* Permission is hereby granted, free of charge, to any person obtaining a
|
||
* copy of this software and associated documentation files (the "Software"),
|
||
* to deal in the Software without restriction, including without limitation
|
||
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
||
* and/or sell copies of the Software, and to permit persons to whom the
|
||
* Software is furnished to do so, subject to the following conditions:
|
||
*
|
||
* The above copyright notice and this permission notice (including the next
|
||
* paragraph) shall be included in all copies or substantial portions of the
|
||
* Software.
|
||
*
|
||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
||
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||
* IN THE SOFTWARE.
|
||
*/
|
||
|
||
/** @file brw_fs.cpp
|
||
*
|
||
* This file drives the GLSL IR -> LIR translation, contains the
|
||
* optimizations on the LIR, and drives the generation of native code
|
||
* from the LIR.
|
||
*/
|
||
|
||
#include "main/macros.h"
|
||
#include "brw_eu.h"
|
||
#include "brw_fs.h"
|
||
#include "brw_fs_live_variables.h"
|
||
#include "brw_nir.h"
|
||
#include "brw_vec4_gs_visitor.h"
|
||
#include "brw_cfg.h"
|
||
#include "brw_dead_control_flow.h"
|
||
#include "brw_private.h"
|
||
#include "dev/intel_debug.h"
|
||
#include "compiler/glsl_types.h"
|
||
#include "compiler/nir/nir_builder.h"
|
||
#include "program/prog_parameter.h"
|
||
#include "util/u_math.h"
|
||
|
||
using namespace brw;
|
||
|
||
static unsigned get_lowered_simd_width(const struct brw_compiler *compiler,
|
||
const fs_inst *inst);
|
||
|
||
void
|
||
fs_inst::init(enum opcode opcode, uint8_t exec_size, const fs_reg &dst,
|
||
const fs_reg *src, unsigned sources)
|
||
{
|
||
memset((void*)this, 0, sizeof(*this));
|
||
|
||
this->src = new fs_reg[MAX2(sources, 3)];
|
||
for (unsigned i = 0; i < sources; i++)
|
||
this->src[i] = src[i];
|
||
|
||
this->opcode = opcode;
|
||
this->dst = dst;
|
||
this->sources = sources;
|
||
this->exec_size = exec_size;
|
||
this->base_mrf = -1;
|
||
|
||
assert(dst.file != IMM && dst.file != UNIFORM);
|
||
|
||
assert(this->exec_size != 0);
|
||
|
||
this->conditional_mod = BRW_CONDITIONAL_NONE;
|
||
|
||
/* This will be the case for almost all instructions. */
|
||
switch (dst.file) {
|
||
case VGRF:
|
||
case ARF:
|
||
case FIXED_GRF:
|
||
case MRF:
|
||
case ATTR:
|
||
this->size_written = dst.component_size(exec_size);
|
||
break;
|
||
case BAD_FILE:
|
||
this->size_written = 0;
|
||
break;
|
||
case IMM:
|
||
case UNIFORM:
|
||
unreachable("Invalid destination register file");
|
||
}
|
||
|
||
this->writes_accumulator = false;
|
||
}
|
||
|
||
fs_inst::fs_inst()
|
||
{
|
||
init(BRW_OPCODE_NOP, 8, dst, NULL, 0);
|
||
}
|
||
|
||
fs_inst::fs_inst(enum opcode opcode, uint8_t exec_size)
|
||
{
|
||
init(opcode, exec_size, reg_undef, NULL, 0);
|
||
}
|
||
|
||
fs_inst::fs_inst(enum opcode opcode, uint8_t exec_size, const fs_reg &dst)
|
||
{
|
||
init(opcode, exec_size, dst, NULL, 0);
|
||
}
|
||
|
||
fs_inst::fs_inst(enum opcode opcode, uint8_t exec_size, const fs_reg &dst,
|
||
const fs_reg &src0)
|
||
{
|
||
const fs_reg src[1] = { src0 };
|
||
init(opcode, exec_size, dst, src, 1);
|
||
}
|
||
|
||
fs_inst::fs_inst(enum opcode opcode, uint8_t exec_size, const fs_reg &dst,
|
||
const fs_reg &src0, const fs_reg &src1)
|
||
{
|
||
const fs_reg src[2] = { src0, src1 };
|
||
init(opcode, exec_size, dst, src, 2);
|
||
}
|
||
|
||
fs_inst::fs_inst(enum opcode opcode, uint8_t exec_size, const fs_reg &dst,
|
||
const fs_reg &src0, const fs_reg &src1, const fs_reg &src2)
|
||
{
|
||
const fs_reg src[3] = { src0, src1, src2 };
|
||
init(opcode, exec_size, dst, src, 3);
|
||
}
|
||
|
||
fs_inst::fs_inst(enum opcode opcode, uint8_t exec_width, const fs_reg &dst,
|
||
const fs_reg src[], unsigned sources)
|
||
{
|
||
init(opcode, exec_width, dst, src, sources);
|
||
}
|
||
|
||
fs_inst::fs_inst(const fs_inst &that)
|
||
{
|
||
memcpy((void*)this, &that, sizeof(that));
|
||
|
||
this->src = new fs_reg[MAX2(that.sources, 3)];
|
||
|
||
for (unsigned i = 0; i < that.sources; i++)
|
||
this->src[i] = that.src[i];
|
||
}
|
||
|
||
fs_inst::~fs_inst()
|
||
{
|
||
delete[] this->src;
|
||
}
|
||
|
||
void
|
||
fs_inst::resize_sources(uint8_t num_sources)
|
||
{
|
||
if (this->sources != num_sources) {
|
||
fs_reg *src = new fs_reg[MAX2(num_sources, 3)];
|
||
|
||
for (unsigned i = 0; i < MIN2(this->sources, num_sources); ++i)
|
||
src[i] = this->src[i];
|
||
|
||
delete[] this->src;
|
||
this->src = src;
|
||
this->sources = num_sources;
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::VARYING_PULL_CONSTANT_LOAD(const fs_builder &bld,
|
||
const fs_reg &dst,
|
||
const fs_reg &surf_index,
|
||
const fs_reg &varying_offset,
|
||
uint32_t const_offset,
|
||
uint8_t alignment)
|
||
{
|
||
/* We have our constant surface use a pitch of 4 bytes, so our index can
|
||
* be any component of a vector, and then we load 4 contiguous
|
||
* components starting from that.
|
||
*
|
||
* We break down the const_offset to a portion added to the variable offset
|
||
* and a portion done using fs_reg::offset, which means that if you have
|
||
* GLSL using something like "uniform vec4 a[20]; gl_FragColor = a[i]",
|
||
* we'll temporarily generate 4 vec4 loads from offset i * 4, and CSE can
|
||
* later notice that those loads are all the same and eliminate the
|
||
* redundant ones.
|
||
*/
|
||
fs_reg vec4_offset = vgrf(glsl_type::uint_type);
|
||
bld.ADD(vec4_offset, varying_offset, brw_imm_ud(const_offset & ~0xf));
|
||
|
||
/* The pull load message will load a vec4 (16 bytes). If we are loading
|
||
* a double this means we are only loading 2 elements worth of data.
|
||
* We also want to use a 32-bit data type for the dst of the load operation
|
||
* so other parts of the driver don't get confused about the size of the
|
||
* result.
|
||
*/
|
||
fs_reg vec4_result = bld.vgrf(BRW_REGISTER_TYPE_F, 4);
|
||
fs_inst *inst = bld.emit(FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_LOGICAL,
|
||
vec4_result, surf_index, vec4_offset,
|
||
brw_imm_ud(alignment));
|
||
inst->size_written = 4 * vec4_result.component_size(inst->exec_size);
|
||
|
||
shuffle_from_32bit_read(bld, dst, vec4_result,
|
||
(const_offset & 0xf) / type_sz(dst.type), 1);
|
||
}
|
||
|
||
/**
|
||
* A helper for MOV generation for fixing up broken hardware SEND dependency
|
||
* handling.
|
||
*/
|
||
void
|
||
fs_visitor::DEP_RESOLVE_MOV(const fs_builder &bld, int grf)
|
||
{
|
||
/* The caller always wants uncompressed to emit the minimal extra
|
||
* dependencies, and to avoid having to deal with aligning its regs to 2.
|
||
*/
|
||
const fs_builder ubld = bld.annotate("send dependency resolve")
|
||
.quarter(0);
|
||
|
||
ubld.MOV(ubld.null_reg_f(), fs_reg(VGRF, grf, BRW_REGISTER_TYPE_F));
|
||
}
|
||
|
||
bool
|
||
fs_inst::is_send_from_grf() const
|
||
{
|
||
switch (opcode) {
|
||
case SHADER_OPCODE_SEND:
|
||
case FS_OPCODE_INTERPOLATE_AT_SAMPLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET:
|
||
case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET:
|
||
case SHADER_OPCODE_INTERLOCK:
|
||
case SHADER_OPCODE_MEMORY_FENCE:
|
||
case SHADER_OPCODE_BARRIER:
|
||
return true;
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD:
|
||
return src[1].file == VGRF;
|
||
case FS_OPCODE_FB_WRITE:
|
||
case FS_OPCODE_FB_READ:
|
||
return src[0].file == VGRF;
|
||
default:
|
||
if (is_tex())
|
||
return src[0].file == VGRF;
|
||
|
||
return false;
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_inst::is_control_source(unsigned arg) const
|
||
{
|
||
switch (opcode) {
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD:
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GFX7:
|
||
case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GFX4:
|
||
return arg == 0;
|
||
|
||
case SHADER_OPCODE_BROADCAST:
|
||
case SHADER_OPCODE_SHUFFLE:
|
||
case SHADER_OPCODE_QUAD_SWIZZLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SAMPLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET:
|
||
case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET:
|
||
case SHADER_OPCODE_GET_BUFFER_SIZE:
|
||
return arg == 1;
|
||
|
||
case SHADER_OPCODE_MOV_INDIRECT:
|
||
case SHADER_OPCODE_CLUSTER_BROADCAST:
|
||
case SHADER_OPCODE_TEX:
|
||
case FS_OPCODE_TXB:
|
||
case SHADER_OPCODE_TXD:
|
||
case SHADER_OPCODE_TXF:
|
||
case SHADER_OPCODE_TXF_LZ:
|
||
case SHADER_OPCODE_TXF_CMS:
|
||
case SHADER_OPCODE_TXF_CMS_W:
|
||
case SHADER_OPCODE_TXF_UMS:
|
||
case SHADER_OPCODE_TXF_MCS:
|
||
case SHADER_OPCODE_TXL:
|
||
case SHADER_OPCODE_TXL_LZ:
|
||
case SHADER_OPCODE_TXS:
|
||
case SHADER_OPCODE_LOD:
|
||
case SHADER_OPCODE_TG4:
|
||
case SHADER_OPCODE_TG4_OFFSET:
|
||
case SHADER_OPCODE_SAMPLEINFO:
|
||
return arg == 1 || arg == 2;
|
||
|
||
case SHADER_OPCODE_SEND:
|
||
return arg == 0 || arg == 1;
|
||
|
||
default:
|
||
return false;
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_inst::is_payload(unsigned arg) const
|
||
{
|
||
switch (opcode) {
|
||
case FS_OPCODE_FB_WRITE:
|
||
case FS_OPCODE_FB_READ:
|
||
case VEC4_OPCODE_UNTYPED_ATOMIC:
|
||
case VEC4_OPCODE_UNTYPED_SURFACE_READ:
|
||
case VEC4_OPCODE_UNTYPED_SURFACE_WRITE:
|
||
case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET:
|
||
case FS_OPCODE_INTERPOLATE_AT_SAMPLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET:
|
||
case SHADER_OPCODE_INTERLOCK:
|
||
case SHADER_OPCODE_MEMORY_FENCE:
|
||
case SHADER_OPCODE_BARRIER:
|
||
return arg == 0;
|
||
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GFX7:
|
||
return arg == 1;
|
||
|
||
case SHADER_OPCODE_SEND:
|
||
return arg == 2 || arg == 3;
|
||
|
||
default:
|
||
if (is_tex())
|
||
return arg == 0;
|
||
else
|
||
return false;
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Returns true if this instruction's sources and destinations cannot
|
||
* safely be the same register.
|
||
*
|
||
* In most cases, a register can be written over safely by the same
|
||
* instruction that is its last use. For a single instruction, the
|
||
* sources are dereferenced before writing of the destination starts
|
||
* (naturally).
|
||
*
|
||
* However, there are a few cases where this can be problematic:
|
||
*
|
||
* - Virtual opcodes that translate to multiple instructions in the
|
||
* code generator: if src == dst and one instruction writes the
|
||
* destination before a later instruction reads the source, then
|
||
* src will have been clobbered.
|
||
*
|
||
* - SIMD16 compressed instructions with certain regioning (see below).
|
||
*
|
||
* The register allocator uses this information to set up conflicts between
|
||
* GRF sources and the destination.
|
||
*/
|
||
bool
|
||
fs_inst::has_source_and_destination_hazard() const
|
||
{
|
||
switch (opcode) {
|
||
case FS_OPCODE_PACK_HALF_2x16_SPLIT:
|
||
/* Multiple partial writes to the destination */
|
||
return true;
|
||
case SHADER_OPCODE_SHUFFLE:
|
||
/* This instruction returns an arbitrary channel from the source and
|
||
* gets split into smaller instructions in the generator. It's possible
|
||
* that one of the instructions will read from a channel corresponding
|
||
* to an earlier instruction.
|
||
*/
|
||
case SHADER_OPCODE_SEL_EXEC:
|
||
/* This is implemented as
|
||
*
|
||
* mov(16) g4<1>D 0D { align1 WE_all 1H };
|
||
* mov(16) g4<1>D g5<8,8,1>D { align1 1H }
|
||
*
|
||
* Because the source is only read in the second instruction, the first
|
||
* may stomp all over it.
|
||
*/
|
||
return true;
|
||
case SHADER_OPCODE_QUAD_SWIZZLE:
|
||
switch (src[1].ud) {
|
||
case BRW_SWIZZLE_XXXX:
|
||
case BRW_SWIZZLE_YYYY:
|
||
case BRW_SWIZZLE_ZZZZ:
|
||
case BRW_SWIZZLE_WWWW:
|
||
case BRW_SWIZZLE_XXZZ:
|
||
case BRW_SWIZZLE_YYWW:
|
||
case BRW_SWIZZLE_XYXY:
|
||
case BRW_SWIZZLE_ZWZW:
|
||
/* These can be implemented as a single Align1 region on all
|
||
* platforms, so there's never a hazard between source and
|
||
* destination. C.f. fs_generator::generate_quad_swizzle().
|
||
*/
|
||
return false;
|
||
default:
|
||
return !is_uniform(src[0]);
|
||
}
|
||
default:
|
||
/* The SIMD16 compressed instruction
|
||
*
|
||
* add(16) g4<1>F g4<8,8,1>F g6<8,8,1>F
|
||
*
|
||
* is actually decoded in hardware as:
|
||
*
|
||
* add(8) g4<1>F g4<8,8,1>F g6<8,8,1>F
|
||
* add(8) g5<1>F g5<8,8,1>F g7<8,8,1>F
|
||
*
|
||
* Which is safe. However, if we have uniform accesses
|
||
* happening, we get into trouble:
|
||
*
|
||
* add(8) g4<1>F g4<0,1,0>F g6<8,8,1>F
|
||
* add(8) g5<1>F g4<0,1,0>F g7<8,8,1>F
|
||
*
|
||
* Now our destination for the first instruction overwrote the
|
||
* second instruction's src0, and we get garbage for those 8
|
||
* pixels. There's a similar issue for the pre-gfx6
|
||
* pixel_x/pixel_y, which are registers of 16-bit values and thus
|
||
* would get stomped by the first decode as well.
|
||
*/
|
||
if (exec_size == 16) {
|
||
for (int i = 0; i < sources; i++) {
|
||
if (src[i].file == VGRF && (src[i].stride == 0 ||
|
||
src[i].type == BRW_REGISTER_TYPE_UW ||
|
||
src[i].type == BRW_REGISTER_TYPE_W ||
|
||
src[i].type == BRW_REGISTER_TYPE_UB ||
|
||
src[i].type == BRW_REGISTER_TYPE_B)) {
|
||
return true;
|
||
}
|
||
}
|
||
}
|
||
return false;
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_inst::can_do_source_mods(const struct intel_device_info *devinfo) const
|
||
{
|
||
if (devinfo->ver == 6 && is_math())
|
||
return false;
|
||
|
||
if (is_send_from_grf())
|
||
return false;
|
||
|
||
/* From Wa_1604601757:
|
||
*
|
||
* "When multiplying a DW and any lower precision integer, source modifier
|
||
* is not supported."
|
||
*/
|
||
if (devinfo->ver >= 12 && (opcode == BRW_OPCODE_MUL ||
|
||
opcode == BRW_OPCODE_MAD)) {
|
||
const brw_reg_type exec_type = get_exec_type(this);
|
||
const unsigned min_type_sz = opcode == BRW_OPCODE_MAD ?
|
||
MIN2(type_sz(src[1].type), type_sz(src[2].type)) :
|
||
MIN2(type_sz(src[0].type), type_sz(src[1].type));
|
||
|
||
if (brw_reg_type_is_integer(exec_type) &&
|
||
type_sz(exec_type) >= 4 &&
|
||
type_sz(exec_type) != min_type_sz)
|
||
return false;
|
||
}
|
||
|
||
if (!backend_instruction::can_do_source_mods())
|
||
return false;
|
||
|
||
return true;
|
||
}
|
||
|
||
bool
|
||
fs_inst::can_do_cmod()
|
||
{
|
||
if (!backend_instruction::can_do_cmod())
|
||
return false;
|
||
|
||
/* The accumulator result appears to get used for the conditional modifier
|
||
* generation. When negating a UD value, there is a 33rd bit generated for
|
||
* the sign in the accumulator value, so now you can't check, for example,
|
||
* equality with a 32-bit value. See piglit fs-op-neg-uvec4.
|
||
*/
|
||
for (unsigned i = 0; i < sources; i++) {
|
||
if (brw_reg_type_is_unsigned_integer(src[i].type) && src[i].negate)
|
||
return false;
|
||
}
|
||
|
||
return true;
|
||
}
|
||
|
||
bool
|
||
fs_inst::can_change_types() const
|
||
{
|
||
return dst.type == src[0].type &&
|
||
!src[0].abs && !src[0].negate && !saturate &&
|
||
(opcode == BRW_OPCODE_MOV ||
|
||
(opcode == BRW_OPCODE_SEL &&
|
||
dst.type == src[1].type &&
|
||
predicate != BRW_PREDICATE_NONE &&
|
||
!src[1].abs && !src[1].negate));
|
||
}
|
||
|
||
void
|
||
fs_reg::init()
|
||
{
|
||
memset((void*)this, 0, sizeof(*this));
|
||
type = BRW_REGISTER_TYPE_UD;
|
||
stride = 1;
|
||
}
|
||
|
||
/** Generic unset register constructor. */
|
||
fs_reg::fs_reg()
|
||
{
|
||
init();
|
||
this->file = BAD_FILE;
|
||
}
|
||
|
||
fs_reg::fs_reg(struct ::brw_reg reg) :
|
||
backend_reg(reg)
|
||
{
|
||
this->offset = 0;
|
||
this->stride = 1;
|
||
if (this->file == IMM &&
|
||
(this->type != BRW_REGISTER_TYPE_V &&
|
||
this->type != BRW_REGISTER_TYPE_UV &&
|
||
this->type != BRW_REGISTER_TYPE_VF)) {
|
||
this->stride = 0;
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_reg::equals(const fs_reg &r) const
|
||
{
|
||
return (this->backend_reg::equals(r) &&
|
||
stride == r.stride);
|
||
}
|
||
|
||
bool
|
||
fs_reg::negative_equals(const fs_reg &r) const
|
||
{
|
||
return (this->backend_reg::negative_equals(r) &&
|
||
stride == r.stride);
|
||
}
|
||
|
||
bool
|
||
fs_reg::is_contiguous() const
|
||
{
|
||
switch (file) {
|
||
case ARF:
|
||
case FIXED_GRF:
|
||
return hstride == BRW_HORIZONTAL_STRIDE_1 &&
|
||
vstride == width + hstride;
|
||
case MRF:
|
||
case VGRF:
|
||
case ATTR:
|
||
return stride == 1;
|
||
case UNIFORM:
|
||
case IMM:
|
||
case BAD_FILE:
|
||
return true;
|
||
}
|
||
|
||
unreachable("Invalid register file");
|
||
}
|
||
|
||
unsigned
|
||
fs_reg::component_size(unsigned width) const
|
||
{
|
||
const unsigned stride = ((file != ARF && file != FIXED_GRF) ? this->stride :
|
||
hstride == 0 ? 0 :
|
||
1 << (hstride - 1));
|
||
return MAX2(width * stride, 1) * type_sz(type);
|
||
}
|
||
|
||
/**
|
||
* Create a MOV to read the timestamp register.
|
||
*/
|
||
fs_reg
|
||
fs_visitor::get_timestamp(const fs_builder &bld)
|
||
{
|
||
assert(devinfo->ver >= 7);
|
||
|
||
fs_reg ts = fs_reg(retype(brw_vec4_reg(BRW_ARCHITECTURE_REGISTER_FILE,
|
||
BRW_ARF_TIMESTAMP,
|
||
0),
|
||
BRW_REGISTER_TYPE_UD));
|
||
|
||
fs_reg dst = fs_reg(VGRF, alloc.allocate(1), BRW_REGISTER_TYPE_UD);
|
||
|
||
/* We want to read the 3 fields we care about even if it's not enabled in
|
||
* the dispatch.
|
||
*/
|
||
bld.group(4, 0).exec_all().MOV(dst, ts);
|
||
|
||
return dst;
|
||
}
|
||
|
||
void
|
||
fs_visitor::vfail(const char *format, va_list va)
|
||
{
|
||
char *msg;
|
||
|
||
if (failed)
|
||
return;
|
||
|
||
failed = true;
|
||
|
||
msg = ralloc_vasprintf(mem_ctx, format, va);
|
||
msg = ralloc_asprintf(mem_ctx, "SIMD%d %s compile failed: %s\n",
|
||
dispatch_width, stage_abbrev, msg);
|
||
|
||
this->fail_msg = msg;
|
||
|
||
if (unlikely(debug_enabled)) {
|
||
fprintf(stderr, "%s", msg);
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::fail(const char *format, ...)
|
||
{
|
||
va_list va;
|
||
|
||
va_start(va, format);
|
||
vfail(format, va);
|
||
va_end(va);
|
||
}
|
||
|
||
/**
|
||
* Mark this program as impossible to compile with dispatch width greater
|
||
* than n.
|
||
*
|
||
* During the SIMD8 compile (which happens first), we can detect and flag
|
||
* things that are unsupported in SIMD16+ mode, so the compiler can skip the
|
||
* SIMD16+ compile altogether.
|
||
*
|
||
* During a compile of dispatch width greater than n (if one happens anyway),
|
||
* this just calls fail().
|
||
*/
|
||
void
|
||
fs_visitor::limit_dispatch_width(unsigned n, const char *msg)
|
||
{
|
||
if (dispatch_width > n) {
|
||
fail("%s", msg);
|
||
} else {
|
||
max_dispatch_width = MIN2(max_dispatch_width, n);
|
||
brw_shader_perf_log(compiler, log_data,
|
||
"Shader dispatch width limited to SIMD%d: %s\n",
|
||
n, msg);
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Returns true if the instruction has a flag that means it won't
|
||
* update an entire destination register.
|
||
*
|
||
* For example, dead code elimination and live variable analysis want to know
|
||
* when a write to a variable screens off any preceding values that were in
|
||
* it.
|
||
*/
|
||
bool
|
||
fs_inst::is_partial_write() const
|
||
{
|
||
return ((this->predicate && this->opcode != BRW_OPCODE_SEL) ||
|
||
(this->exec_size * type_sz(this->dst.type)) < 32 ||
|
||
!this->dst.is_contiguous() ||
|
||
this->dst.offset % REG_SIZE != 0);
|
||
}
|
||
|
||
unsigned
|
||
fs_inst::components_read(unsigned i) const
|
||
{
|
||
/* Return zero if the source is not present. */
|
||
if (src[i].file == BAD_FILE)
|
||
return 0;
|
||
|
||
switch (opcode) {
|
||
case FS_OPCODE_LINTERP:
|
||
if (i == 0)
|
||
return 2;
|
||
else
|
||
return 1;
|
||
|
||
case FS_OPCODE_PIXEL_X:
|
||
case FS_OPCODE_PIXEL_Y:
|
||
assert(i < 2);
|
||
if (i == 0)
|
||
return 2;
|
||
else
|
||
return 1;
|
||
|
||
case FS_OPCODE_FB_WRITE_LOGICAL:
|
||
assert(src[FB_WRITE_LOGICAL_SRC_COMPONENTS].file == IMM);
|
||
/* First/second FB write color. */
|
||
if (i < 2)
|
||
return src[FB_WRITE_LOGICAL_SRC_COMPONENTS].ud;
|
||
else
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_TEX_LOGICAL:
|
||
case SHADER_OPCODE_TXD_LOGICAL:
|
||
case SHADER_OPCODE_TXF_LOGICAL:
|
||
case SHADER_OPCODE_TXL_LOGICAL:
|
||
case SHADER_OPCODE_TXS_LOGICAL:
|
||
case SHADER_OPCODE_IMAGE_SIZE_LOGICAL:
|
||
case FS_OPCODE_TXB_LOGICAL:
|
||
case SHADER_OPCODE_TXF_CMS_LOGICAL:
|
||
case SHADER_OPCODE_TXF_CMS_W_LOGICAL:
|
||
case SHADER_OPCODE_TXF_CMS_W_GFX12_LOGICAL:
|
||
case SHADER_OPCODE_TXF_UMS_LOGICAL:
|
||
case SHADER_OPCODE_TXF_MCS_LOGICAL:
|
||
case SHADER_OPCODE_LOD_LOGICAL:
|
||
case SHADER_OPCODE_TG4_LOGICAL:
|
||
case SHADER_OPCODE_TG4_OFFSET_LOGICAL:
|
||
case SHADER_OPCODE_SAMPLEINFO_LOGICAL:
|
||
assert(src[TEX_LOGICAL_SRC_COORD_COMPONENTS].file == IMM &&
|
||
src[TEX_LOGICAL_SRC_GRAD_COMPONENTS].file == IMM);
|
||
/* Texture coordinates. */
|
||
if (i == TEX_LOGICAL_SRC_COORDINATE)
|
||
return src[TEX_LOGICAL_SRC_COORD_COMPONENTS].ud;
|
||
/* Texture derivatives. */
|
||
else if ((i == TEX_LOGICAL_SRC_LOD || i == TEX_LOGICAL_SRC_LOD2) &&
|
||
opcode == SHADER_OPCODE_TXD_LOGICAL)
|
||
return src[TEX_LOGICAL_SRC_GRAD_COMPONENTS].ud;
|
||
/* Texture offset. */
|
||
else if (i == TEX_LOGICAL_SRC_TG4_OFFSET)
|
||
return 2;
|
||
/* MCS */
|
||
else if (i == TEX_LOGICAL_SRC_MCS) {
|
||
if (opcode == SHADER_OPCODE_TXF_CMS_W_LOGICAL)
|
||
return 2;
|
||
else if (opcode == SHADER_OPCODE_TXF_CMS_W_GFX12_LOGICAL)
|
||
return 4;
|
||
else
|
||
return 1;
|
||
} else
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_UNTYPED_SURFACE_READ_LOGICAL:
|
||
case SHADER_OPCODE_TYPED_SURFACE_READ_LOGICAL:
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_DIMS].file == IMM);
|
||
/* Surface coordinates. */
|
||
if (i == SURFACE_LOGICAL_SRC_ADDRESS)
|
||
return src[SURFACE_LOGICAL_SRC_IMM_DIMS].ud;
|
||
/* Surface operation source (ignored for reads). */
|
||
else if (i == SURFACE_LOGICAL_SRC_DATA)
|
||
return 0;
|
||
else
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_UNTYPED_SURFACE_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_TYPED_SURFACE_WRITE_LOGICAL:
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_DIMS].file == IMM &&
|
||
src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
/* Surface coordinates. */
|
||
if (i == SURFACE_LOGICAL_SRC_ADDRESS)
|
||
return src[SURFACE_LOGICAL_SRC_IMM_DIMS].ud;
|
||
/* Surface operation source. */
|
||
else if (i == SURFACE_LOGICAL_SRC_DATA)
|
||
return src[SURFACE_LOGICAL_SRC_IMM_ARG].ud;
|
||
else
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_A64_UNTYPED_READ_LOGICAL:
|
||
case SHADER_OPCODE_A64_OWORD_BLOCK_READ_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNALIGNED_OWORD_BLOCK_READ_LOGICAL:
|
||
assert(src[2].file == IMM);
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_A64_OWORD_BLOCK_WRITE_LOGICAL:
|
||
assert(src[2].file == IMM);
|
||
if (i == 1) { /* data to write */
|
||
const unsigned comps = src[2].ud / exec_size;
|
||
assert(comps > 0);
|
||
return comps;
|
||
} else {
|
||
return 1;
|
||
}
|
||
|
||
case SHADER_OPCODE_OWORD_BLOCK_READ_LOGICAL:
|
||
case SHADER_OPCODE_UNALIGNED_OWORD_BLOCK_READ_LOGICAL:
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_OWORD_BLOCK_WRITE_LOGICAL:
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
if (i == SURFACE_LOGICAL_SRC_DATA) {
|
||
const unsigned comps = src[SURFACE_LOGICAL_SRC_IMM_ARG].ud / exec_size;
|
||
assert(comps > 0);
|
||
return comps;
|
||
} else {
|
||
return 1;
|
||
}
|
||
|
||
case SHADER_OPCODE_A64_UNTYPED_WRITE_LOGICAL:
|
||
assert(src[2].file == IMM);
|
||
return i == 1 ? src[2].ud : 1;
|
||
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_INT16_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_INT64_LOGICAL:
|
||
assert(src[2].file == IMM);
|
||
if (i == 1) {
|
||
/* Data source */
|
||
const unsigned op = src[2].ud;
|
||
switch (op) {
|
||
case BRW_AOP_INC:
|
||
case BRW_AOP_DEC:
|
||
case BRW_AOP_PREDEC:
|
||
return 0;
|
||
case BRW_AOP_CMPWR:
|
||
return 2;
|
||
default:
|
||
return 1;
|
||
}
|
||
} else {
|
||
return 1;
|
||
}
|
||
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_FLOAT16_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_FLOAT32_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_FLOAT64_LOGICAL:
|
||
assert(src[2].file == IMM);
|
||
if (i == 1) {
|
||
/* Data source */
|
||
const unsigned op = src[2].ud;
|
||
return op == BRW_AOP_FCMPWR ? 2 : 1;
|
||
} else {
|
||
return 1;
|
||
}
|
||
|
||
case SHADER_OPCODE_BYTE_SCATTERED_READ_LOGICAL:
|
||
case SHADER_OPCODE_DWORD_SCATTERED_READ_LOGICAL:
|
||
/* Scattered logical opcodes use the following params:
|
||
* src[0] Surface coordinates
|
||
* src[1] Surface operation source (ignored for reads)
|
||
* src[2] Surface
|
||
* src[3] IMM with always 1 dimension.
|
||
* src[4] IMM with arg bitsize for scattered read/write 8, 16, 32
|
||
*/
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_DIMS].file == IMM &&
|
||
src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
return i == SURFACE_LOGICAL_SRC_DATA ? 0 : 1;
|
||
|
||
case SHADER_OPCODE_BYTE_SCATTERED_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_DWORD_SCATTERED_WRITE_LOGICAL:
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_DIMS].file == IMM &&
|
||
src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
return 1;
|
||
|
||
case SHADER_OPCODE_UNTYPED_ATOMIC_LOGICAL:
|
||
case SHADER_OPCODE_TYPED_ATOMIC_LOGICAL: {
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_DIMS].file == IMM &&
|
||
src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
const unsigned op = src[SURFACE_LOGICAL_SRC_IMM_ARG].ud;
|
||
/* Surface coordinates. */
|
||
if (i == SURFACE_LOGICAL_SRC_ADDRESS)
|
||
return src[SURFACE_LOGICAL_SRC_IMM_DIMS].ud;
|
||
/* Surface operation source. */
|
||
else if (i == SURFACE_LOGICAL_SRC_DATA && op == BRW_AOP_CMPWR)
|
||
return 2;
|
||
else if (i == SURFACE_LOGICAL_SRC_DATA &&
|
||
(op == BRW_AOP_INC || op == BRW_AOP_DEC || op == BRW_AOP_PREDEC))
|
||
return 0;
|
||
else
|
||
return 1;
|
||
}
|
||
case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET:
|
||
return (i == 0 ? 2 : 1);
|
||
|
||
case SHADER_OPCODE_UNTYPED_ATOMIC_FLOAT_LOGICAL: {
|
||
assert(src[SURFACE_LOGICAL_SRC_IMM_DIMS].file == IMM &&
|
||
src[SURFACE_LOGICAL_SRC_IMM_ARG].file == IMM);
|
||
const unsigned op = src[SURFACE_LOGICAL_SRC_IMM_ARG].ud;
|
||
/* Surface coordinates. */
|
||
if (i == SURFACE_LOGICAL_SRC_ADDRESS)
|
||
return src[SURFACE_LOGICAL_SRC_IMM_DIMS].ud;
|
||
/* Surface operation source. */
|
||
else if (i == SURFACE_LOGICAL_SRC_DATA && op == BRW_AOP_FCMPWR)
|
||
return 2;
|
||
else
|
||
return 1;
|
||
}
|
||
|
||
case SHADER_OPCODE_URB_WRITE_LOGICAL:
|
||
if (i == URB_LOGICAL_SRC_DATA)
|
||
return mlen - 1 -
|
||
unsigned(src[URB_LOGICAL_SRC_PER_SLOT_OFFSETS].file != BAD_FILE) -
|
||
unsigned(src[URB_LOGICAL_SRC_CHANNEL_MASK].file != BAD_FILE);
|
||
else
|
||
return 1;
|
||
|
||
default:
|
||
return 1;
|
||
}
|
||
}
|
||
|
||
unsigned
|
||
fs_inst::size_read(int arg) const
|
||
{
|
||
switch (opcode) {
|
||
case SHADER_OPCODE_SEND:
|
||
if (arg == 2) {
|
||
return mlen * REG_SIZE;
|
||
} else if (arg == 3) {
|
||
return ex_mlen * REG_SIZE;
|
||
}
|
||
break;
|
||
|
||
case FS_OPCODE_FB_WRITE:
|
||
case FS_OPCODE_REP_FB_WRITE:
|
||
if (arg == 0) {
|
||
if (base_mrf >= 0)
|
||
return src[0].file == BAD_FILE ? 0 : 2 * REG_SIZE;
|
||
else
|
||
return mlen * REG_SIZE;
|
||
}
|
||
break;
|
||
|
||
case FS_OPCODE_FB_READ:
|
||
case FS_OPCODE_INTERPOLATE_AT_SAMPLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET:
|
||
if (arg == 0)
|
||
return mlen * REG_SIZE;
|
||
break;
|
||
|
||
case FS_OPCODE_SET_SAMPLE_ID:
|
||
if (arg == 1)
|
||
return 1;
|
||
break;
|
||
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GFX7:
|
||
/* The payload is actually stored in src1 */
|
||
if (arg == 1)
|
||
return mlen * REG_SIZE;
|
||
break;
|
||
|
||
case FS_OPCODE_LINTERP:
|
||
if (arg == 1)
|
||
return 16;
|
||
break;
|
||
|
||
case SHADER_OPCODE_LOAD_PAYLOAD:
|
||
if (arg < this->header_size)
|
||
return REG_SIZE;
|
||
break;
|
||
|
||
case CS_OPCODE_CS_TERMINATE:
|
||
case SHADER_OPCODE_BARRIER:
|
||
return REG_SIZE;
|
||
|
||
case SHADER_OPCODE_MOV_INDIRECT:
|
||
if (arg == 0) {
|
||
assert(src[2].file == IMM);
|
||
return src[2].ud;
|
||
}
|
||
break;
|
||
|
||
default:
|
||
if (is_tex() && arg == 0 && src[0].file == VGRF)
|
||
return mlen * REG_SIZE;
|
||
break;
|
||
}
|
||
|
||
switch (src[arg].file) {
|
||
case UNIFORM:
|
||
case IMM:
|
||
return components_read(arg) * type_sz(src[arg].type);
|
||
case BAD_FILE:
|
||
case ARF:
|
||
case FIXED_GRF:
|
||
case VGRF:
|
||
case ATTR:
|
||
return components_read(arg) * src[arg].component_size(exec_size);
|
||
case MRF:
|
||
unreachable("MRF registers are not allowed as sources");
|
||
}
|
||
return 0;
|
||
}
|
||
|
||
namespace {
|
||
unsigned
|
||
predicate_width(brw_predicate predicate)
|
||
{
|
||
switch (predicate) {
|
||
case BRW_PREDICATE_NONE: return 1;
|
||
case BRW_PREDICATE_NORMAL: return 1;
|
||
case BRW_PREDICATE_ALIGN1_ANY2H: return 2;
|
||
case BRW_PREDICATE_ALIGN1_ALL2H: return 2;
|
||
case BRW_PREDICATE_ALIGN1_ANY4H: return 4;
|
||
case BRW_PREDICATE_ALIGN1_ALL4H: return 4;
|
||
case BRW_PREDICATE_ALIGN1_ANY8H: return 8;
|
||
case BRW_PREDICATE_ALIGN1_ALL8H: return 8;
|
||
case BRW_PREDICATE_ALIGN1_ANY16H: return 16;
|
||
case BRW_PREDICATE_ALIGN1_ALL16H: return 16;
|
||
case BRW_PREDICATE_ALIGN1_ANY32H: return 32;
|
||
case BRW_PREDICATE_ALIGN1_ALL32H: return 32;
|
||
default: unreachable("Unsupported predicate");
|
||
}
|
||
}
|
||
|
||
/* Return the subset of flag registers that an instruction could
|
||
* potentially read or write based on the execution controls and flag
|
||
* subregister number of the instruction.
|
||
*/
|
||
unsigned
|
||
flag_mask(const fs_inst *inst, unsigned width)
|
||
{
|
||
assert(util_is_power_of_two_nonzero(width));
|
||
const unsigned start = (inst->flag_subreg * 16 + inst->group) &
|
||
~(width - 1);
|
||
const unsigned end = start + ALIGN(inst->exec_size, width);
|
||
return ((1 << DIV_ROUND_UP(end, 8)) - 1) & ~((1 << (start / 8)) - 1);
|
||
}
|
||
|
||
unsigned
|
||
bit_mask(unsigned n)
|
||
{
|
||
return (n >= CHAR_BIT * sizeof(bit_mask(n)) ? ~0u : (1u << n) - 1);
|
||
}
|
||
|
||
unsigned
|
||
flag_mask(const fs_reg &r, unsigned sz)
|
||
{
|
||
if (r.file == ARF) {
|
||
const unsigned start = (r.nr - BRW_ARF_FLAG) * 4 + r.subnr;
|
||
const unsigned end = start + sz;
|
||
return bit_mask(end) & ~bit_mask(start);
|
||
} else {
|
||
return 0;
|
||
}
|
||
}
|
||
}
|
||
|
||
unsigned
|
||
fs_inst::flags_read(const intel_device_info *devinfo) const
|
||
{
|
||
if (predicate == BRW_PREDICATE_ALIGN1_ANYV ||
|
||
predicate == BRW_PREDICATE_ALIGN1_ALLV) {
|
||
/* The vertical predication modes combine corresponding bits from
|
||
* f0.0 and f1.0 on Gfx7+, and f0.0 and f0.1 on older hardware.
|
||
*/
|
||
const unsigned shift = devinfo->ver >= 7 ? 4 : 2;
|
||
return flag_mask(this, 1) << shift | flag_mask(this, 1);
|
||
} else if (predicate) {
|
||
return flag_mask(this, predicate_width(predicate));
|
||
} else {
|
||
unsigned mask = 0;
|
||
for (int i = 0; i < sources; i++) {
|
||
mask |= flag_mask(src[i], size_read(i));
|
||
}
|
||
return mask;
|
||
}
|
||
}
|
||
|
||
unsigned
|
||
fs_inst::flags_written(const intel_device_info *devinfo) const
|
||
{
|
||
/* On Gfx4 and Gfx5, sel.l (for min) and sel.ge (for max) are implemented
|
||
* using a separate cmpn and sel instruction. This lowering occurs in
|
||
* fs_vistor::lower_minmax which is called very, very late.
|
||
*/
|
||
if ((conditional_mod && ((opcode != BRW_OPCODE_SEL || devinfo->ver <= 5) &&
|
||
opcode != BRW_OPCODE_CSEL &&
|
||
opcode != BRW_OPCODE_IF &&
|
||
opcode != BRW_OPCODE_WHILE)) ||
|
||
opcode == FS_OPCODE_FB_WRITE) {
|
||
return flag_mask(this, 1);
|
||
} else if (opcode == SHADER_OPCODE_FIND_LIVE_CHANNEL ||
|
||
opcode == SHADER_OPCODE_FIND_LAST_LIVE_CHANNEL ||
|
||
opcode == FS_OPCODE_LOAD_LIVE_CHANNELS) {
|
||
return flag_mask(this, 32);
|
||
} else {
|
||
return flag_mask(dst, size_written);
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Returns how many MRFs an FS opcode will write over.
|
||
*
|
||
* Note that this is not the 0 or 1 implied writes in an actual gen
|
||
* instruction -- the FS opcodes often generate MOVs in addition.
|
||
*/
|
||
unsigned
|
||
fs_inst::implied_mrf_writes() const
|
||
{
|
||
if (mlen == 0)
|
||
return 0;
|
||
|
||
if (base_mrf == -1)
|
||
return 0;
|
||
|
||
switch (opcode) {
|
||
case SHADER_OPCODE_RCP:
|
||
case SHADER_OPCODE_RSQ:
|
||
case SHADER_OPCODE_SQRT:
|
||
case SHADER_OPCODE_EXP2:
|
||
case SHADER_OPCODE_LOG2:
|
||
case SHADER_OPCODE_SIN:
|
||
case SHADER_OPCODE_COS:
|
||
return 1 * exec_size / 8;
|
||
case SHADER_OPCODE_POW:
|
||
case SHADER_OPCODE_INT_QUOTIENT:
|
||
case SHADER_OPCODE_INT_REMAINDER:
|
||
return 2 * exec_size / 8;
|
||
case SHADER_OPCODE_TEX:
|
||
case FS_OPCODE_TXB:
|
||
case SHADER_OPCODE_TXD:
|
||
case SHADER_OPCODE_TXF:
|
||
case SHADER_OPCODE_TXF_CMS:
|
||
case SHADER_OPCODE_TXF_MCS:
|
||
case SHADER_OPCODE_TG4:
|
||
case SHADER_OPCODE_TG4_OFFSET:
|
||
case SHADER_OPCODE_TXL:
|
||
case SHADER_OPCODE_TXS:
|
||
case SHADER_OPCODE_LOD:
|
||
case SHADER_OPCODE_SAMPLEINFO:
|
||
return 1;
|
||
case FS_OPCODE_FB_WRITE:
|
||
case FS_OPCODE_REP_FB_WRITE:
|
||
return src[0].file == BAD_FILE ? 0 : 2;
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD:
|
||
case SHADER_OPCODE_GFX4_SCRATCH_READ:
|
||
return 1;
|
||
case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_GFX4:
|
||
return mlen;
|
||
case SHADER_OPCODE_GFX4_SCRATCH_WRITE:
|
||
return mlen;
|
||
default:
|
||
unreachable("not reached");
|
||
}
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::vgrf(const glsl_type *const type)
|
||
{
|
||
int reg_width = dispatch_width / 8;
|
||
return fs_reg(VGRF,
|
||
alloc.allocate(glsl_count_dword_slots(type, false) * reg_width),
|
||
brw_type_for_base_type(type));
|
||
}
|
||
|
||
fs_reg::fs_reg(enum brw_reg_file file, int nr)
|
||
{
|
||
init();
|
||
this->file = file;
|
||
this->nr = nr;
|
||
this->type = BRW_REGISTER_TYPE_F;
|
||
this->stride = (file == UNIFORM ? 0 : 1);
|
||
}
|
||
|
||
fs_reg::fs_reg(enum brw_reg_file file, int nr, enum brw_reg_type type)
|
||
{
|
||
init();
|
||
this->file = file;
|
||
this->nr = nr;
|
||
this->type = type;
|
||
this->stride = (file == UNIFORM ? 0 : 1);
|
||
}
|
||
|
||
/* For SIMD16, we need to follow from the uniform setup of SIMD8 dispatch.
|
||
* This brings in those uniform definitions
|
||
*/
|
||
void
|
||
fs_visitor::import_uniforms(fs_visitor *v)
|
||
{
|
||
this->push_constant_loc = v->push_constant_loc;
|
||
this->uniforms = v->uniforms;
|
||
this->subgroup_id = v->subgroup_id;
|
||
for (unsigned i = 0; i < ARRAY_SIZE(this->group_size); i++)
|
||
this->group_size[i] = v->group_size[i];
|
||
}
|
||
|
||
void
|
||
fs_visitor::emit_fragcoord_interpolation(fs_reg wpos)
|
||
{
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
|
||
/* gl_FragCoord.x */
|
||
bld.MOV(wpos, this->pixel_x);
|
||
wpos = offset(wpos, bld, 1);
|
||
|
||
/* gl_FragCoord.y */
|
||
bld.MOV(wpos, this->pixel_y);
|
||
wpos = offset(wpos, bld, 1);
|
||
|
||
/* gl_FragCoord.z */
|
||
if (devinfo->ver >= 6) {
|
||
bld.MOV(wpos, this->pixel_z);
|
||
} else {
|
||
bld.emit(FS_OPCODE_LINTERP, wpos,
|
||
this->delta_xy[BRW_BARYCENTRIC_PERSPECTIVE_PIXEL],
|
||
component(interp_reg(VARYING_SLOT_POS, 2), 0));
|
||
}
|
||
wpos = offset(wpos, bld, 1);
|
||
|
||
/* gl_FragCoord.w: Already set up in emit_interpolation */
|
||
bld.MOV(wpos, this->wpos_w);
|
||
}
|
||
|
||
enum brw_barycentric_mode
|
||
brw_barycentric_mode(nir_intrinsic_instr *intr)
|
||
{
|
||
const glsl_interp_mode mode =
|
||
(enum glsl_interp_mode) nir_intrinsic_interp_mode(intr);
|
||
|
||
/* Barycentric modes don't make sense for flat inputs. */
|
||
assert(mode != INTERP_MODE_FLAT);
|
||
|
||
unsigned bary;
|
||
switch (intr->intrinsic) {
|
||
case nir_intrinsic_load_barycentric_pixel:
|
||
case nir_intrinsic_load_barycentric_at_offset:
|
||
bary = BRW_BARYCENTRIC_PERSPECTIVE_PIXEL;
|
||
break;
|
||
case nir_intrinsic_load_barycentric_centroid:
|
||
bary = BRW_BARYCENTRIC_PERSPECTIVE_CENTROID;
|
||
break;
|
||
case nir_intrinsic_load_barycentric_sample:
|
||
case nir_intrinsic_load_barycentric_at_sample:
|
||
bary = BRW_BARYCENTRIC_PERSPECTIVE_SAMPLE;
|
||
break;
|
||
default:
|
||
unreachable("invalid intrinsic");
|
||
}
|
||
|
||
if (mode == INTERP_MODE_NOPERSPECTIVE)
|
||
bary += 3;
|
||
|
||
return (enum brw_barycentric_mode) bary;
|
||
}
|
||
|
||
/**
|
||
* Turn one of the two CENTROID barycentric modes into PIXEL mode.
|
||
*/
|
||
static enum brw_barycentric_mode
|
||
centroid_to_pixel(enum brw_barycentric_mode bary)
|
||
{
|
||
assert(bary == BRW_BARYCENTRIC_PERSPECTIVE_CENTROID ||
|
||
bary == BRW_BARYCENTRIC_NONPERSPECTIVE_CENTROID);
|
||
return (enum brw_barycentric_mode) ((unsigned) bary - 1);
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::emit_frontfacing_interpolation()
|
||
{
|
||
fs_reg ff = bld.vgrf(BRW_REGISTER_TYPE_D);
|
||
|
||
if (devinfo->ver >= 12) {
|
||
fs_reg g1 = fs_reg(retype(brw_vec1_grf(1, 1), BRW_REGISTER_TYPE_W));
|
||
|
||
fs_reg tmp = bld.vgrf(BRW_REGISTER_TYPE_W);
|
||
bld.ASR(tmp, g1, brw_imm_d(15));
|
||
bld.NOT(ff, tmp);
|
||
} else if (devinfo->ver >= 6) {
|
||
/* Bit 15 of g0.0 is 0 if the polygon is front facing. We want to create
|
||
* a boolean result from this (~0/true or 0/false).
|
||
*
|
||
* We can use the fact that bit 15 is the MSB of g0.0:W to accomplish
|
||
* this task in only one instruction:
|
||
* - a negation source modifier will flip the bit; and
|
||
* - a W -> D type conversion will sign extend the bit into the high
|
||
* word of the destination.
|
||
*
|
||
* An ASR 15 fills the low word of the destination.
|
||
*/
|
||
fs_reg g0 = fs_reg(retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_W));
|
||
g0.negate = true;
|
||
|
||
bld.ASR(ff, g0, brw_imm_d(15));
|
||
} else {
|
||
/* Bit 31 of g1.6 is 0 if the polygon is front facing. We want to create
|
||
* a boolean result from this (1/true or 0/false).
|
||
*
|
||
* Like in the above case, since the bit is the MSB of g1.6:UD we can use
|
||
* the negation source modifier to flip it. Unfortunately the SHR
|
||
* instruction only operates on UD (or D with an abs source modifier)
|
||
* sources without negation.
|
||
*
|
||
* Instead, use ASR (which will give ~0/true or 0/false).
|
||
*/
|
||
fs_reg g1_6 = fs_reg(retype(brw_vec1_grf(1, 6), BRW_REGISTER_TYPE_D));
|
||
g1_6.negate = true;
|
||
|
||
bld.ASR(ff, g1_6, brw_imm_d(31));
|
||
}
|
||
|
||
return ff;
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::emit_samplepos_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
struct brw_wm_prog_data *wm_prog_data = brw_wm_prog_data(this->prog_data);
|
||
assert(devinfo->ver >= 6);
|
||
|
||
const fs_builder abld = bld.annotate("compute sample position");
|
||
fs_reg pos = abld.vgrf(BRW_REGISTER_TYPE_F, 2);
|
||
|
||
if (!wm_prog_data->persample_dispatch) {
|
||
/* From ARB_sample_shading specification:
|
||
* "When rendering to a non-multisample buffer, or if multisample
|
||
* rasterization is disabled, gl_SamplePosition will always be
|
||
* (0.5, 0.5).
|
||
*/
|
||
bld.MOV(offset(pos, bld, 0), brw_imm_f(0.5f));
|
||
bld.MOV(offset(pos, bld, 1), brw_imm_f(0.5f));
|
||
return pos;
|
||
}
|
||
|
||
/* WM will be run in MSDISPMODE_PERSAMPLE. So, only one of SIMD8 or SIMD16
|
||
* mode will be enabled.
|
||
*
|
||
* From the Ivy Bridge PRM, volume 2 part 1, page 344:
|
||
* R31.1:0 Position Offset X/Y for Slot[3:0]
|
||
* R31.3:2 Position Offset X/Y for Slot[7:4]
|
||
* .....
|
||
*
|
||
* The X, Y sample positions come in as bytes in thread payload. So, read
|
||
* the positions using vstride=16, width=8, hstride=2.
|
||
*/
|
||
const fs_reg sample_pos_reg =
|
||
fetch_payload_reg(abld, payload.sample_pos_reg, BRW_REGISTER_TYPE_W);
|
||
|
||
for (unsigned i = 0; i < 2; i++) {
|
||
fs_reg tmp_d = bld.vgrf(BRW_REGISTER_TYPE_D);
|
||
abld.MOV(tmp_d, subscript(sample_pos_reg, BRW_REGISTER_TYPE_B, i));
|
||
/* Convert int_sample_pos to floating point */
|
||
fs_reg tmp_f = bld.vgrf(BRW_REGISTER_TYPE_F);
|
||
abld.MOV(tmp_f, tmp_d);
|
||
/* Scale to the range [0, 1] */
|
||
abld.MUL(offset(pos, abld, i), tmp_f, brw_imm_f(1 / 16.0f));
|
||
}
|
||
|
||
return pos;
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::emit_sampleid_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
brw_wm_prog_key *key = (brw_wm_prog_key*) this->key;
|
||
assert(devinfo->ver >= 6);
|
||
|
||
const fs_builder abld = bld.annotate("compute sample id");
|
||
fs_reg sample_id = abld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
|
||
assert(key->multisample_fbo);
|
||
|
||
if (devinfo->ver >= 8) {
|
||
/* Sample ID comes in as 4-bit numbers in g1.0:
|
||
*
|
||
* 15:12 Slot 3 SampleID (only used in SIMD16)
|
||
* 11:8 Slot 2 SampleID (only used in SIMD16)
|
||
* 7:4 Slot 1 SampleID
|
||
* 3:0 Slot 0 SampleID
|
||
*
|
||
* Each slot corresponds to four channels, so we want to replicate each
|
||
* half-byte value to 4 channels in a row:
|
||
*
|
||
* dst+0: .7 .6 .5 .4 .3 .2 .1 .0
|
||
* 7:4 7:4 7:4 7:4 3:0 3:0 3:0 3:0
|
||
*
|
||
* dst+1: .7 .6 .5 .4 .3 .2 .1 .0 (if SIMD16)
|
||
* 15:12 15:12 15:12 15:12 11:8 11:8 11:8 11:8
|
||
*
|
||
* First, we read g1.0 with a <1,8,0>UB region, causing the first 8
|
||
* channels to read the first byte (7:0), and the second group of 8
|
||
* channels to read the second byte (15:8). Then, we shift right by
|
||
* a vector immediate of <4, 4, 4, 4, 0, 0, 0, 0>, moving the slot 1 / 3
|
||
* values into place. Finally, we AND with 0xf to keep the low nibble.
|
||
*
|
||
* shr(16) tmp<1>W g1.0<1,8,0>B 0x44440000:V
|
||
* and(16) dst<1>D tmp<8,8,1>W 0xf:W
|
||
*
|
||
* TODO: These payload bits exist on Gfx7 too, but they appear to always
|
||
* be zero, so this code fails to work. We should find out why.
|
||
*/
|
||
const fs_reg tmp = abld.vgrf(BRW_REGISTER_TYPE_UW);
|
||
|
||
for (unsigned i = 0; i < DIV_ROUND_UP(dispatch_width, 16); i++) {
|
||
const fs_builder hbld = abld.group(MIN2(16, dispatch_width), i);
|
||
hbld.SHR(offset(tmp, hbld, i),
|
||
stride(retype(brw_vec1_grf(1 + i, 0), BRW_REGISTER_TYPE_UB),
|
||
1, 8, 0),
|
||
brw_imm_v(0x44440000));
|
||
}
|
||
|
||
abld.AND(sample_id, tmp, brw_imm_w(0xf));
|
||
} else {
|
||
const fs_reg t1 = component(abld.vgrf(BRW_REGISTER_TYPE_UD), 0);
|
||
const fs_reg t2 = abld.vgrf(BRW_REGISTER_TYPE_UW);
|
||
|
||
/* The PS will be run in MSDISPMODE_PERSAMPLE. For example with
|
||
* 8x multisampling, subspan 0 will represent sample N (where N
|
||
* is 0, 2, 4 or 6), subspan 1 will represent sample 1, 3, 5 or
|
||
* 7. We can find the value of N by looking at R0.0 bits 7:6
|
||
* ("Starting Sample Pair Index (SSPI)") and multiplying by two
|
||
* (since samples are always delivered in pairs). That is, we
|
||
* compute 2*((R0.0 & 0xc0) >> 6) == (R0.0 & 0xc0) >> 5. Then
|
||
* we need to add N to the sequence (0, 0, 0, 0, 1, 1, 1, 1) in
|
||
* case of SIMD8 and sequence (0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2,
|
||
* 2, 3, 3, 3, 3) in case of SIMD16. We compute this sequence by
|
||
* populating a temporary variable with the sequence (0, 1, 2, 3),
|
||
* and then reading from it using vstride=1, width=4, hstride=0.
|
||
* These computations hold good for 4x multisampling as well.
|
||
*
|
||
* For 2x MSAA and SIMD16, we want to use the sequence (0, 1, 0, 1):
|
||
* the first four slots are sample 0 of subspan 0; the next four
|
||
* are sample 1 of subspan 0; the third group is sample 0 of
|
||
* subspan 1, and finally sample 1 of subspan 1.
|
||
*/
|
||
|
||
/* SKL+ has an extra bit for the Starting Sample Pair Index to
|
||
* accommodate 16x MSAA.
|
||
*/
|
||
abld.exec_all().group(1, 0)
|
||
.AND(t1, fs_reg(retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_UD)),
|
||
brw_imm_ud(0xc0));
|
||
abld.exec_all().group(1, 0).SHR(t1, t1, brw_imm_d(5));
|
||
|
||
/* This works for SIMD8-SIMD16. It also works for SIMD32 but only if we
|
||
* can assume 4x MSAA. Disallow it on IVB+
|
||
*
|
||
* FINISHME: One day, we could come up with a way to do this that
|
||
* actually works on gfx7.
|
||
*/
|
||
if (devinfo->ver >= 7)
|
||
limit_dispatch_width(16, "gl_SampleId is unsupported in SIMD32 on gfx7");
|
||
abld.exec_all().group(8, 0).MOV(t2, brw_imm_v(0x32103210));
|
||
|
||
/* This special instruction takes care of setting vstride=1,
|
||
* width=4, hstride=0 of t2 during an ADD instruction.
|
||
*/
|
||
abld.emit(FS_OPCODE_SET_SAMPLE_ID, sample_id, t1, t2);
|
||
}
|
||
|
||
return sample_id;
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::emit_samplemaskin_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
struct brw_wm_prog_data *wm_prog_data = brw_wm_prog_data(this->prog_data);
|
||
assert(devinfo->ver >= 6);
|
||
|
||
fs_reg mask = bld.vgrf(BRW_REGISTER_TYPE_D);
|
||
|
||
/* The HW doesn't provide us with expected values. */
|
||
assert(!wm_prog_data->per_coarse_pixel_dispatch);
|
||
|
||
fs_reg coverage_mask =
|
||
fetch_payload_reg(bld, payload.sample_mask_in_reg, BRW_REGISTER_TYPE_D);
|
||
|
||
if (wm_prog_data->persample_dispatch) {
|
||
/* gl_SampleMaskIn[] comes from two sources: the input coverage mask,
|
||
* and a mask representing which sample is being processed by the
|
||
* current shader invocation.
|
||
*
|
||
* From the OES_sample_variables specification:
|
||
* "When per-sample shading is active due to the use of a fragment input
|
||
* qualified by "sample" or due to the use of the gl_SampleID or
|
||
* gl_SamplePosition variables, only the bit for the current sample is
|
||
* set in gl_SampleMaskIn."
|
||
*/
|
||
const fs_builder abld = bld.annotate("compute gl_SampleMaskIn");
|
||
|
||
if (nir_system_values[SYSTEM_VALUE_SAMPLE_ID].file == BAD_FILE)
|
||
nir_system_values[SYSTEM_VALUE_SAMPLE_ID] = emit_sampleid_setup();
|
||
|
||
fs_reg one = vgrf(glsl_type::int_type);
|
||
fs_reg enabled_mask = vgrf(glsl_type::int_type);
|
||
abld.MOV(one, brw_imm_d(1));
|
||
abld.SHL(enabled_mask, one, nir_system_values[SYSTEM_VALUE_SAMPLE_ID]);
|
||
abld.AND(mask, enabled_mask, coverage_mask);
|
||
} else {
|
||
/* In per-pixel mode, the coverage mask is sufficient. */
|
||
mask = coverage_mask;
|
||
}
|
||
return mask;
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::emit_shading_rate_setup()
|
||
{
|
||
assert(devinfo->ver >= 11);
|
||
|
||
const fs_builder abld = bld.annotate("compute fragment shading rate");
|
||
fs_reg rate = abld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
|
||
struct brw_wm_prog_data *wm_prog_data =
|
||
brw_wm_prog_data(bld.shader->stage_prog_data);
|
||
|
||
/* Coarse pixel shading size fields overlap with other fields of not in
|
||
* coarse pixel dispatch mode, so report 0 when that's not the case.
|
||
*/
|
||
if (wm_prog_data->per_coarse_pixel_dispatch) {
|
||
/* The shading rates provided in the shader are the actual 2D shading
|
||
* rate while the SPIR-V built-in is the enum value that has the shading
|
||
* rate encoded as a bitfield. Fortunately, the bitfield value is just
|
||
* the shading rate divided by two and shifted.
|
||
*/
|
||
|
||
/* r1.0 - 0:7 ActualCoarsePixelShadingSize.X */
|
||
fs_reg actual_x = fs_reg(retype(brw_vec1_grf(1, 0), BRW_REGISTER_TYPE_UB));
|
||
/* r1.0 - 15:8 ActualCoarsePixelShadingSize.Y */
|
||
fs_reg actual_y = byte_offset(actual_x, 1);
|
||
|
||
fs_reg int_rate_x = bld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
fs_reg int_rate_y = bld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
|
||
abld.SHR(int_rate_y, actual_y, brw_imm_ud(1));
|
||
abld.SHR(int_rate_x, actual_x, brw_imm_ud(1));
|
||
abld.SHL(int_rate_x, int_rate_x, brw_imm_ud(2));
|
||
abld.OR(rate, int_rate_x, int_rate_y);
|
||
} else {
|
||
abld.MOV(rate, brw_imm_ud(0));
|
||
}
|
||
|
||
return rate;
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::resolve_source_modifiers(const fs_reg &src)
|
||
{
|
||
if (!src.abs && !src.negate)
|
||
return src;
|
||
|
||
fs_reg temp = bld.vgrf(src.type);
|
||
bld.MOV(temp, src);
|
||
|
||
return temp;
|
||
}
|
||
|
||
void
|
||
fs_visitor::emit_gs_thread_end()
|
||
{
|
||
assert(stage == MESA_SHADER_GEOMETRY);
|
||
|
||
struct brw_gs_prog_data *gs_prog_data = brw_gs_prog_data(prog_data);
|
||
|
||
if (gs_compile->control_data_header_size_bits > 0) {
|
||
emit_gs_control_data_bits(this->final_gs_vertex_count);
|
||
}
|
||
|
||
const fs_builder abld = bld.annotate("thread end");
|
||
fs_inst *inst;
|
||
|
||
if (gs_prog_data->static_vertex_count != -1) {
|
||
foreach_in_list_reverse(fs_inst, prev, &this->instructions) {
|
||
if (prev->opcode == SHADER_OPCODE_URB_WRITE_LOGICAL) {
|
||
prev->eot = true;
|
||
|
||
/* Delete now dead instructions. */
|
||
foreach_in_list_reverse_safe(exec_node, dead, &this->instructions) {
|
||
if (dead == prev)
|
||
break;
|
||
dead->remove();
|
||
}
|
||
return;
|
||
} else if (prev->is_control_flow() || prev->has_side_effects()) {
|
||
break;
|
||
}
|
||
}
|
||
fs_reg srcs[URB_LOGICAL_NUM_SRCS];
|
||
srcs[URB_LOGICAL_SRC_HANDLE] = fs_reg(retype(brw_vec8_grf(1, 0), BRW_REGISTER_TYPE_UD));
|
||
inst = abld.emit(SHADER_OPCODE_URB_WRITE_LOGICAL, reg_undef,
|
||
srcs, ARRAY_SIZE(srcs));
|
||
inst->mlen = 1;
|
||
} else {
|
||
fs_reg srcs[URB_LOGICAL_NUM_SRCS];
|
||
srcs[URB_LOGICAL_SRC_HANDLE] = fs_reg(retype(brw_vec8_grf(1, 0), BRW_REGISTER_TYPE_UD));
|
||
srcs[URB_LOGICAL_SRC_DATA] = this->final_gs_vertex_count;
|
||
inst = abld.emit(SHADER_OPCODE_URB_WRITE_LOGICAL, reg_undef,
|
||
srcs, ARRAY_SIZE(srcs));
|
||
inst->mlen = 2;
|
||
}
|
||
inst->eot = true;
|
||
inst->offset = 0;
|
||
}
|
||
|
||
void
|
||
fs_visitor::assign_curb_setup()
|
||
{
|
||
unsigned uniform_push_length = DIV_ROUND_UP(stage_prog_data->nr_params, 8);
|
||
|
||
unsigned ubo_push_length = 0;
|
||
unsigned ubo_push_start[4];
|
||
for (int i = 0; i < 4; i++) {
|
||
ubo_push_start[i] = 8 * (ubo_push_length + uniform_push_length);
|
||
ubo_push_length += stage_prog_data->ubo_ranges[i].length;
|
||
}
|
||
|
||
prog_data->curb_read_length = uniform_push_length + ubo_push_length;
|
||
|
||
uint64_t used = 0;
|
||
bool is_compute = gl_shader_stage_is_compute(stage);
|
||
|
||
if (is_compute && brw_cs_prog_data(prog_data)->uses_inline_data) {
|
||
/* With COMPUTE_WALKER, we can push up to one register worth of data via
|
||
* the inline data parameter in the COMPUTE_WALKER command itself.
|
||
*
|
||
* TODO: Support inline data and push at the same time.
|
||
*/
|
||
assert(devinfo->verx10 >= 125);
|
||
assert(uniform_push_length <= 1);
|
||
} else if (is_compute && devinfo->verx10 >= 125) {
|
||
fs_builder ubld = bld.exec_all().group(8, 0).at(
|
||
cfg->first_block(), cfg->first_block()->start());
|
||
|
||
/* The base address for our push data is passed in as R0.0[31:6]. We
|
||
* have to mask off the bottom 6 bits.
|
||
*/
|
||
fs_reg base_addr = ubld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
ubld.group(1, 0).AND(base_addr,
|
||
retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_UD),
|
||
brw_imm_ud(INTEL_MASK(31, 6)));
|
||
|
||
fs_reg header0 = ubld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
ubld.MOV(header0, brw_imm_ud(0));
|
||
ubld.group(1, 0).SHR(component(header0, 2), base_addr, brw_imm_ud(4));
|
||
|
||
/* On Gfx12-HP we load constants at the start of the program using A32
|
||
* stateless messages.
|
||
*/
|
||
for (unsigned i = 0; i < uniform_push_length;) {
|
||
/* Limit ourselves to HW limit of 8 Owords (8 * 16bytes = 128 bytes
|
||
* or 4 registers).
|
||
*/
|
||
unsigned num_regs = MIN2(uniform_push_length - i, 4);
|
||
assert(num_regs > 0);
|
||
num_regs = 1 << util_logbase2(num_regs);
|
||
|
||
fs_reg header;
|
||
if (i == 0) {
|
||
header = header0;
|
||
} else {
|
||
header = ubld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
ubld.MOV(header, brw_imm_ud(0));
|
||
ubld.group(1, 0).ADD(component(header, 2),
|
||
component(header0, 2),
|
||
brw_imm_ud(i * 2));
|
||
}
|
||
|
||
fs_reg srcs[4] = {
|
||
brw_imm_ud(0), /* desc */
|
||
brw_imm_ud(0), /* ex_desc */
|
||
header, /* payload */
|
||
fs_reg(), /* payload2 */
|
||
};
|
||
|
||
fs_reg dest = retype(brw_vec8_grf(payload.num_regs + i, 0),
|
||
BRW_REGISTER_TYPE_UD);
|
||
|
||
/* This instruction has to be run SIMD16 if we're filling more than a
|
||
* single register.
|
||
*/
|
||
unsigned send_width = MIN2(16, num_regs * 8);
|
||
|
||
fs_inst *send = ubld.group(send_width, 0).emit(SHADER_OPCODE_SEND,
|
||
dest, srcs, 4);
|
||
send->sfid = GFX7_SFID_DATAPORT_DATA_CACHE;
|
||
send->desc = brw_dp_desc(devinfo, GFX8_BTI_STATELESS_NON_COHERENT,
|
||
GFX7_DATAPORT_DC_OWORD_BLOCK_READ,
|
||
BRW_DATAPORT_OWORD_BLOCK_OWORDS(num_regs * 2));
|
||
send->header_size = 1;
|
||
send->mlen = 1;
|
||
send->size_written = num_regs * REG_SIZE;
|
||
send->send_is_volatile = true;
|
||
|
||
i += num_regs;
|
||
}
|
||
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
}
|
||
|
||
/* Map the offsets in the UNIFORM file to fixed HW regs. */
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
for (unsigned int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == UNIFORM) {
|
||
int uniform_nr = inst->src[i].nr + inst->src[i].offset / 4;
|
||
int constant_nr;
|
||
if (inst->src[i].nr >= UBO_START) {
|
||
/* constant_nr is in 32-bit units, the rest are in bytes */
|
||
constant_nr = ubo_push_start[inst->src[i].nr - UBO_START] +
|
||
inst->src[i].offset / 4;
|
||
} else if (uniform_nr >= 0 && uniform_nr < (int) uniforms) {
|
||
constant_nr = push_constant_loc[uniform_nr];
|
||
} else {
|
||
/* Section 5.11 of the OpenGL 4.1 spec says:
|
||
* "Out-of-bounds reads return undefined values, which include
|
||
* values from other variables of the active program or zero."
|
||
* Just return the first push constant.
|
||
*/
|
||
constant_nr = 0;
|
||
}
|
||
|
||
assert(constant_nr / 8 < 64);
|
||
used |= BITFIELD64_BIT(constant_nr / 8);
|
||
|
||
struct brw_reg brw_reg = brw_vec1_grf(payload.num_regs +
|
||
constant_nr / 8,
|
||
constant_nr % 8);
|
||
brw_reg.abs = inst->src[i].abs;
|
||
brw_reg.negate = inst->src[i].negate;
|
||
|
||
assert(inst->src[i].stride == 0);
|
||
inst->src[i] = byte_offset(
|
||
retype(brw_reg, inst->src[i].type),
|
||
inst->src[i].offset % 4);
|
||
}
|
||
}
|
||
}
|
||
|
||
uint64_t want_zero = used & stage_prog_data->zero_push_reg;
|
||
if (want_zero) {
|
||
fs_builder ubld = bld.exec_all().group(8, 0).at(
|
||
cfg->first_block(), cfg->first_block()->start());
|
||
|
||
/* push_reg_mask_param is in 32-bit units */
|
||
unsigned mask_param = stage_prog_data->push_reg_mask_param;
|
||
struct brw_reg mask = brw_vec1_grf(payload.num_regs + mask_param / 8,
|
||
mask_param % 8);
|
||
|
||
fs_reg b32;
|
||
for (unsigned i = 0; i < 64; i++) {
|
||
if (i % 16 == 0 && (want_zero & BITFIELD64_RANGE(i, 16))) {
|
||
fs_reg shifted = ubld.vgrf(BRW_REGISTER_TYPE_W, 2);
|
||
ubld.SHL(horiz_offset(shifted, 8),
|
||
byte_offset(retype(mask, BRW_REGISTER_TYPE_W), i / 8),
|
||
brw_imm_v(0x01234567));
|
||
ubld.SHL(shifted, horiz_offset(shifted, 8), brw_imm_w(8));
|
||
|
||
fs_builder ubld16 = ubld.group(16, 0);
|
||
b32 = ubld16.vgrf(BRW_REGISTER_TYPE_D);
|
||
ubld16.group(16, 0).ASR(b32, shifted, brw_imm_w(15));
|
||
}
|
||
|
||
if (want_zero & BITFIELD64_BIT(i)) {
|
||
assert(i < prog_data->curb_read_length);
|
||
struct brw_reg push_reg =
|
||
retype(brw_vec8_grf(payload.num_regs + i, 0),
|
||
BRW_REGISTER_TYPE_D);
|
||
|
||
ubld.AND(push_reg, push_reg, component(b32, i % 16));
|
||
}
|
||
}
|
||
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
}
|
||
|
||
/* This may be updated in assign_urb_setup or assign_vs_urb_setup. */
|
||
this->first_non_payload_grf = payload.num_regs + prog_data->curb_read_length;
|
||
}
|
||
|
||
/*
|
||
* Build up an array of indices into the urb_setup array that
|
||
* references the active entries of the urb_setup array.
|
||
* Used to accelerate walking the active entries of the urb_setup array
|
||
* on each upload.
|
||
*/
|
||
void
|
||
brw_compute_urb_setup_index(struct brw_wm_prog_data *wm_prog_data)
|
||
{
|
||
/* TODO(mesh): Review usage of this in the context of Mesh, we may want to
|
||
* skip per-primitive attributes here.
|
||
*/
|
||
|
||
/* Make sure uint8_t is sufficient */
|
||
STATIC_ASSERT(VARYING_SLOT_MAX <= 0xff);
|
||
uint8_t index = 0;
|
||
for (uint8_t attr = 0; attr < VARYING_SLOT_MAX; attr++) {
|
||
if (wm_prog_data->urb_setup[attr] >= 0) {
|
||
wm_prog_data->urb_setup_attribs[index++] = attr;
|
||
}
|
||
}
|
||
wm_prog_data->urb_setup_attribs_count = index;
|
||
}
|
||
|
||
static void
|
||
calculate_urb_setup(const struct intel_device_info *devinfo,
|
||
const struct brw_wm_prog_key *key,
|
||
struct brw_wm_prog_data *prog_data,
|
||
const nir_shader *nir,
|
||
const struct brw_mue_map *mue_map)
|
||
{
|
||
memset(prog_data->urb_setup, -1,
|
||
sizeof(prog_data->urb_setup[0]) * VARYING_SLOT_MAX);
|
||
|
||
int urb_next = 0;
|
||
|
||
const uint64_t inputs_read =
|
||
nir->info.inputs_read & ~nir->info.per_primitive_inputs;
|
||
|
||
/* Figure out where each of the incoming setup attributes lands. */
|
||
if (mue_map) {
|
||
/* Per-Primitive Attributes are laid out by Hardware before the regular
|
||
* attributes, so order them like this to make easy later to map setup
|
||
* into real HW registers.
|
||
*/
|
||
if (nir->info.per_primitive_inputs) {
|
||
uint64_t per_prim_inputs_read =
|
||
nir->info.inputs_read & nir->info.per_primitive_inputs;
|
||
|
||
/* In Mesh, PRIMITIVE_SHADING_RATE, VIEWPORT and LAYER slots
|
||
* are always at the beginning, because they come from MUE
|
||
* Primitive Header, not Per-Primitive Attributes.
|
||
*/
|
||
const uint64_t primitive_header_bits = VARYING_BIT_VIEWPORT |
|
||
VARYING_BIT_LAYER |
|
||
VARYING_BIT_PRIMITIVE_SHADING_RATE;
|
||
|
||
if (per_prim_inputs_read & primitive_header_bits) {
|
||
/* Primitive Shading Rate, Layer and Viewport live in the same
|
||
* 4-dwords slot (psr is dword 0, layer is dword 1, and viewport
|
||
* is dword 2).
|
||
*/
|
||
if (per_prim_inputs_read & VARYING_BIT_PRIMITIVE_SHADING_RATE)
|
||
prog_data->urb_setup[VARYING_SLOT_PRIMITIVE_SHADING_RATE] = 0;
|
||
|
||
if (per_prim_inputs_read & VARYING_BIT_LAYER)
|
||
prog_data->urb_setup[VARYING_SLOT_LAYER] = 0;
|
||
|
||
if (per_prim_inputs_read & VARYING_BIT_VIEWPORT)
|
||
prog_data->urb_setup[VARYING_SLOT_VIEWPORT] = 0;
|
||
|
||
/* 3DSTATE_SBE_MESH.Per[Primitive|Vertex]URBEntryOutputRead[Offset|Length]
|
||
* are in full GRFs (8 dwords) and MUE Primitive Header is 8 dwords,
|
||
* so next per-primitive attribute must be placed in slot 2 (each slot
|
||
* is 4 dwords long).
|
||
*/
|
||
urb_next = 2;
|
||
per_prim_inputs_read &= ~primitive_header_bits;
|
||
}
|
||
|
||
for (unsigned i = 0; i < VARYING_SLOT_MAX; i++) {
|
||
if (per_prim_inputs_read & BITFIELD64_BIT(i)) {
|
||
prog_data->urb_setup[i] = urb_next++;
|
||
}
|
||
}
|
||
|
||
/* The actual setup attributes later must be aligned to a full GRF. */
|
||
urb_next = ALIGN(urb_next, 2);
|
||
|
||
prog_data->num_per_primitive_inputs = urb_next;
|
||
}
|
||
|
||
const uint64_t clip_dist_bits = VARYING_BIT_CLIP_DIST0 |
|
||
VARYING_BIT_CLIP_DIST1;
|
||
|
||
uint64_t unique_fs_attrs = inputs_read & BRW_FS_VARYING_INPUT_MASK;
|
||
|
||
if (inputs_read & clip_dist_bits) {
|
||
assert(mue_map->per_vertex_header_size_dw > 8);
|
||
unique_fs_attrs &= ~clip_dist_bits;
|
||
}
|
||
|
||
/* In Mesh, CLIP_DIST slots are always at the beginning, because
|
||
* they come from MUE Vertex Header, not Per-Vertex Attributes.
|
||
*/
|
||
if (inputs_read & clip_dist_bits) {
|
||
prog_data->urb_setup[VARYING_SLOT_CLIP_DIST0] = urb_next++;
|
||
prog_data->urb_setup[VARYING_SLOT_CLIP_DIST1] = urb_next++;
|
||
}
|
||
|
||
/* Per-Vertex attributes are laid out ordered. Because we always link
|
||
* Mesh and Fragment shaders, the which slots are written and read by
|
||
* each of them will match. */
|
||
for (unsigned int i = 0; i < VARYING_SLOT_MAX; i++) {
|
||
if (unique_fs_attrs & BITFIELD64_BIT(i))
|
||
prog_data->urb_setup[i] = urb_next++;
|
||
}
|
||
} else if (devinfo->ver >= 6) {
|
||
uint64_t vue_header_bits =
|
||
VARYING_BIT_PSIZ | VARYING_BIT_LAYER | VARYING_BIT_VIEWPORT;
|
||
|
||
uint64_t unique_fs_attrs = inputs_read & BRW_FS_VARYING_INPUT_MASK;
|
||
|
||
/* VUE header fields all live in the same URB slot, so we pass them
|
||
* as a single FS input attribute. We want to only count them once.
|
||
*/
|
||
if (inputs_read & vue_header_bits) {
|
||
unique_fs_attrs &= ~vue_header_bits;
|
||
unique_fs_attrs |= VARYING_BIT_PSIZ;
|
||
}
|
||
|
||
if (util_bitcount64(unique_fs_attrs) <= 16) {
|
||
/* The SF/SBE pipeline stage can do arbitrary rearrangement of the
|
||
* first 16 varying inputs, so we can put them wherever we want.
|
||
* Just put them in order.
|
||
*
|
||
* This is useful because it means that (a) inputs not used by the
|
||
* fragment shader won't take up valuable register space, and (b) we
|
||
* won't have to recompile the fragment shader if it gets paired with
|
||
* a different vertex (or geometry) shader.
|
||
*
|
||
* VUE header fields share the same FS input attribute.
|
||
*/
|
||
if (inputs_read & vue_header_bits) {
|
||
if (inputs_read & VARYING_BIT_PSIZ)
|
||
prog_data->urb_setup[VARYING_SLOT_PSIZ] = urb_next;
|
||
if (inputs_read & VARYING_BIT_LAYER)
|
||
prog_data->urb_setup[VARYING_SLOT_LAYER] = urb_next;
|
||
if (inputs_read & VARYING_BIT_VIEWPORT)
|
||
prog_data->urb_setup[VARYING_SLOT_VIEWPORT] = urb_next;
|
||
|
||
urb_next++;
|
||
}
|
||
|
||
for (unsigned int i = 0; i < VARYING_SLOT_MAX; i++) {
|
||
if (inputs_read & BRW_FS_VARYING_INPUT_MASK & ~vue_header_bits &
|
||
BITFIELD64_BIT(i)) {
|
||
prog_data->urb_setup[i] = urb_next++;
|
||
}
|
||
}
|
||
} else {
|
||
/* We have enough input varyings that the SF/SBE pipeline stage can't
|
||
* arbitrarily rearrange them to suit our whim; we have to put them
|
||
* in an order that matches the output of the previous pipeline stage
|
||
* (geometry or vertex shader).
|
||
*/
|
||
|
||
/* Re-compute the VUE map here in the case that the one coming from
|
||
* geometry has more than one position slot (used for Primitive
|
||
* Replication).
|
||
*/
|
||
struct brw_vue_map prev_stage_vue_map;
|
||
brw_compute_vue_map(devinfo, &prev_stage_vue_map,
|
||
key->input_slots_valid,
|
||
nir->info.separate_shader, 1);
|
||
|
||
int first_slot =
|
||
brw_compute_first_urb_slot_required(inputs_read,
|
||
&prev_stage_vue_map);
|
||
|
||
assert(prev_stage_vue_map.num_slots <= first_slot + 32);
|
||
for (int slot = first_slot; slot < prev_stage_vue_map.num_slots;
|
||
slot++) {
|
||
int varying = prev_stage_vue_map.slot_to_varying[slot];
|
||
if (varying != BRW_VARYING_SLOT_PAD &&
|
||
(inputs_read & BRW_FS_VARYING_INPUT_MASK &
|
||
BITFIELD64_BIT(varying))) {
|
||
prog_data->urb_setup[varying] = slot - first_slot;
|
||
}
|
||
}
|
||
urb_next = prev_stage_vue_map.num_slots - first_slot;
|
||
}
|
||
} else {
|
||
/* FINISHME: The sf doesn't map VS->FS inputs for us very well. */
|
||
for (unsigned int i = 0; i < VARYING_SLOT_MAX; i++) {
|
||
/* Point size is packed into the header, not as a general attribute */
|
||
if (i == VARYING_SLOT_PSIZ)
|
||
continue;
|
||
|
||
if (key->input_slots_valid & BITFIELD64_BIT(i)) {
|
||
/* The back color slot is skipped when the front color is
|
||
* also written to. In addition, some slots can be
|
||
* written in the vertex shader and not read in the
|
||
* fragment shader. So the register number must always be
|
||
* incremented, mapped or not.
|
||
*/
|
||
if (_mesa_varying_slot_in_fs((gl_varying_slot) i))
|
||
prog_data->urb_setup[i] = urb_next;
|
||
urb_next++;
|
||
}
|
||
}
|
||
|
||
/*
|
||
* It's a FS only attribute, and we did interpolation for this attribute
|
||
* in SF thread. So, count it here, too.
|
||
*
|
||
* See compile_sf_prog() for more info.
|
||
*/
|
||
if (inputs_read & BITFIELD64_BIT(VARYING_SLOT_PNTC))
|
||
prog_data->urb_setup[VARYING_SLOT_PNTC] = urb_next++;
|
||
}
|
||
|
||
prog_data->num_varying_inputs = urb_next - prog_data->num_per_primitive_inputs;
|
||
prog_data->inputs = inputs_read;
|
||
|
||
brw_compute_urb_setup_index(prog_data);
|
||
}
|
||
|
||
void
|
||
fs_visitor::assign_urb_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
struct brw_wm_prog_data *prog_data = brw_wm_prog_data(this->prog_data);
|
||
|
||
int urb_start = payload.num_regs + prog_data->base.curb_read_length;
|
||
|
||
/* Offset all the urb_setup[] index by the actual position of the
|
||
* setup regs, now that the location of the constants has been chosen.
|
||
*/
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == ATTR) {
|
||
/* ATTR regs in the FS are in units of logical scalar inputs each
|
||
* of which consumes half of a GRF register.
|
||
*/
|
||
assert(inst->src[i].offset < REG_SIZE / 2);
|
||
const unsigned grf = urb_start + inst->src[i].nr / 2;
|
||
const unsigned offset = (inst->src[i].nr % 2) * (REG_SIZE / 2) +
|
||
inst->src[i].offset;
|
||
const unsigned width = inst->src[i].stride == 0 ?
|
||
1 : MIN2(inst->exec_size, 8);
|
||
struct brw_reg reg = stride(
|
||
byte_offset(retype(brw_vec8_grf(grf, 0), inst->src[i].type),
|
||
offset),
|
||
width * inst->src[i].stride,
|
||
width, inst->src[i].stride);
|
||
reg.abs = inst->src[i].abs;
|
||
reg.negate = inst->src[i].negate;
|
||
inst->src[i] = reg;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Each attribute is 4 setup channels, each of which is half a reg. */
|
||
this->first_non_payload_grf += prog_data->num_varying_inputs * 2;
|
||
|
||
/* Unlike regular attributes, per-primitive attributes have all 4 channels
|
||
* in the same slot, so each GRF can store two slots.
|
||
*/
|
||
assert(prog_data->num_per_primitive_inputs % 2 == 0);
|
||
this->first_non_payload_grf += prog_data->num_per_primitive_inputs / 2;
|
||
}
|
||
|
||
void
|
||
fs_visitor::convert_attr_sources_to_hw_regs(fs_inst *inst)
|
||
{
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == ATTR) {
|
||
int grf = payload.num_regs +
|
||
prog_data->curb_read_length +
|
||
inst->src[i].nr +
|
||
inst->src[i].offset / REG_SIZE;
|
||
|
||
/* As explained at brw_reg_from_fs_reg, From the Haswell PRM:
|
||
*
|
||
* VertStride must be used to cross GRF register boundaries. This
|
||
* rule implies that elements within a 'Width' cannot cross GRF
|
||
* boundaries.
|
||
*
|
||
* So, for registers that are large enough, we have to split the exec
|
||
* size in two and trust the compression state to sort it out.
|
||
*/
|
||
unsigned total_size = inst->exec_size *
|
||
inst->src[i].stride *
|
||
type_sz(inst->src[i].type);
|
||
|
||
assert(total_size <= 2 * REG_SIZE);
|
||
const unsigned exec_size =
|
||
(total_size <= REG_SIZE) ? inst->exec_size : inst->exec_size / 2;
|
||
|
||
unsigned width = inst->src[i].stride == 0 ? 1 : exec_size;
|
||
struct brw_reg reg =
|
||
stride(byte_offset(retype(brw_vec8_grf(grf, 0), inst->src[i].type),
|
||
inst->src[i].offset % REG_SIZE),
|
||
exec_size * inst->src[i].stride,
|
||
width, inst->src[i].stride);
|
||
reg.abs = inst->src[i].abs;
|
||
reg.negate = inst->src[i].negate;
|
||
|
||
inst->src[i] = reg;
|
||
}
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::assign_vs_urb_setup()
|
||
{
|
||
struct brw_vs_prog_data *vs_prog_data = brw_vs_prog_data(prog_data);
|
||
|
||
assert(stage == MESA_SHADER_VERTEX);
|
||
|
||
/* Each attribute is 4 regs. */
|
||
this->first_non_payload_grf += 4 * vs_prog_data->nr_attribute_slots;
|
||
|
||
assert(vs_prog_data->base.urb_read_length <= 15);
|
||
|
||
/* Rewrite all ATTR file references to the hw grf that they land in. */
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
convert_attr_sources_to_hw_regs(inst);
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::assign_tcs_urb_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_TESS_CTRL);
|
||
|
||
/* Rewrite all ATTR file references to HW_REGs. */
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
convert_attr_sources_to_hw_regs(inst);
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::assign_tes_urb_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_TESS_EVAL);
|
||
|
||
struct brw_vue_prog_data *vue_prog_data = brw_vue_prog_data(prog_data);
|
||
|
||
first_non_payload_grf += 8 * vue_prog_data->urb_read_length;
|
||
|
||
/* Rewrite all ATTR file references to HW_REGs. */
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
convert_attr_sources_to_hw_regs(inst);
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::assign_gs_urb_setup()
|
||
{
|
||
assert(stage == MESA_SHADER_GEOMETRY);
|
||
|
||
struct brw_vue_prog_data *vue_prog_data = brw_vue_prog_data(prog_data);
|
||
|
||
first_non_payload_grf +=
|
||
8 * vue_prog_data->urb_read_length * nir->info.gs.vertices_in;
|
||
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
/* Rewrite all ATTR file references to GRFs. */
|
||
convert_attr_sources_to_hw_regs(inst);
|
||
}
|
||
}
|
||
|
||
|
||
/**
|
||
* Split large virtual GRFs into separate components if we can.
|
||
*
|
||
* This pass aggressively splits VGRFs into as small a chunks as possible,
|
||
* down to single registers if it can. If no VGRFs can be split, we return
|
||
* false so this pass can safely be used inside an optimization loop. We
|
||
* want to split, because virtual GRFs are what we register allocate and
|
||
* spill (due to contiguousness requirements for some instructions), and
|
||
* they're what we naturally generate in the codegen process, but most
|
||
* virtual GRFs don't actually need to be contiguous sets of GRFs. If we
|
||
* split, we'll end up with reduced live intervals and better dead code
|
||
* elimination and coalescing.
|
||
*/
|
||
bool
|
||
fs_visitor::split_virtual_grfs()
|
||
{
|
||
/* Compact the register file so we eliminate dead vgrfs. This
|
||
* only defines split points for live registers, so if we have
|
||
* too large dead registers they will hit assertions later.
|
||
*/
|
||
compact_virtual_grfs();
|
||
|
||
int num_vars = this->alloc.count;
|
||
|
||
/* Count the total number of registers */
|
||
int reg_count = 0;
|
||
int vgrf_to_reg[num_vars];
|
||
for (int i = 0; i < num_vars; i++) {
|
||
vgrf_to_reg[i] = reg_count;
|
||
reg_count += alloc.sizes[i];
|
||
}
|
||
|
||
/* An array of "split points". For each register slot, this indicates
|
||
* if this slot can be separated from the previous slot. Every time an
|
||
* instruction uses multiple elements of a register (as a source or
|
||
* destination), we mark the used slots as inseparable. Then we go
|
||
* through and split the registers into the smallest pieces we can.
|
||
*/
|
||
bool *split_points = new bool[reg_count];
|
||
memset(split_points, 0, reg_count * sizeof(*split_points));
|
||
|
||
/* Mark all used registers as fully splittable */
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (inst->dst.file == VGRF) {
|
||
int reg = vgrf_to_reg[inst->dst.nr];
|
||
for (unsigned j = 1; j < this->alloc.sizes[inst->dst.nr]; j++)
|
||
split_points[reg + j] = true;
|
||
}
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == VGRF) {
|
||
int reg = vgrf_to_reg[inst->src[i].nr];
|
||
for (unsigned j = 1; j < this->alloc.sizes[inst->src[i].nr]; j++)
|
||
split_points[reg + j] = true;
|
||
}
|
||
}
|
||
}
|
||
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
/* We fix up undef instructions later */
|
||
if (inst->opcode == SHADER_OPCODE_UNDEF) {
|
||
/* UNDEF instructions are currently only used to undef entire
|
||
* registers. We need this invariant later when we split them.
|
||
*/
|
||
assert(inst->dst.file == VGRF);
|
||
assert(inst->dst.offset == 0);
|
||
assert(inst->size_written == alloc.sizes[inst->dst.nr] * REG_SIZE);
|
||
continue;
|
||
}
|
||
|
||
if (inst->dst.file == VGRF) {
|
||
int reg = vgrf_to_reg[inst->dst.nr] + inst->dst.offset / REG_SIZE;
|
||
for (unsigned j = 1; j < regs_written(inst); j++)
|
||
split_points[reg + j] = false;
|
||
}
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == VGRF) {
|
||
int reg = vgrf_to_reg[inst->src[i].nr] + inst->src[i].offset / REG_SIZE;
|
||
for (unsigned j = 1; j < regs_read(inst, i); j++)
|
||
split_points[reg + j] = false;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Bitset of which registers have been split */
|
||
bool *vgrf_has_split = new bool[num_vars];
|
||
memset(vgrf_has_split, 0, num_vars * sizeof(*vgrf_has_split));
|
||
|
||
int *new_virtual_grf = new int[reg_count];
|
||
int *new_reg_offset = new int[reg_count];
|
||
|
||
int reg = 0;
|
||
bool has_splits = false;
|
||
for (int i = 0; i < num_vars; i++) {
|
||
/* The first one should always be 0 as a quick sanity check. */
|
||
assert(split_points[reg] == false);
|
||
|
||
/* j = 0 case */
|
||
new_reg_offset[reg] = 0;
|
||
reg++;
|
||
int offset = 1;
|
||
|
||
/* j > 0 case */
|
||
for (unsigned j = 1; j < alloc.sizes[i]; j++) {
|
||
/* If this is a split point, reset the offset to 0 and allocate a
|
||
* new virtual GRF for the previous offset many registers
|
||
*/
|
||
if (split_points[reg]) {
|
||
has_splits = true;
|
||
vgrf_has_split[i] = true;
|
||
assert(offset <= MAX_VGRF_SIZE);
|
||
int grf = alloc.allocate(offset);
|
||
for (int k = reg - offset; k < reg; k++)
|
||
new_virtual_grf[k] = grf;
|
||
offset = 0;
|
||
}
|
||
new_reg_offset[reg] = offset;
|
||
offset++;
|
||
reg++;
|
||
}
|
||
|
||
/* The last one gets the original register number */
|
||
assert(offset <= MAX_VGRF_SIZE);
|
||
alloc.sizes[i] = offset;
|
||
for (int k = reg - offset; k < reg; k++)
|
||
new_virtual_grf[k] = i;
|
||
}
|
||
assert(reg == reg_count);
|
||
|
||
bool progress;
|
||
if (!has_splits) {
|
||
progress = false;
|
||
goto cleanup;
|
||
}
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
if (inst->opcode == SHADER_OPCODE_UNDEF) {
|
||
assert(inst->dst.file == VGRF);
|
||
if (vgrf_has_split[inst->dst.nr]) {
|
||
const fs_builder ibld(this, block, inst);
|
||
assert(inst->size_written % REG_SIZE == 0);
|
||
unsigned reg_offset = 0;
|
||
while (reg_offset < inst->size_written / REG_SIZE) {
|
||
reg = vgrf_to_reg[inst->dst.nr] + reg_offset;
|
||
ibld.UNDEF(fs_reg(VGRF, new_virtual_grf[reg], inst->dst.type));
|
||
reg_offset += alloc.sizes[new_virtual_grf[reg]];
|
||
}
|
||
inst->remove(block);
|
||
} else {
|
||
reg = vgrf_to_reg[inst->dst.nr];
|
||
assert(new_reg_offset[reg] == 0);
|
||
assert(new_virtual_grf[reg] == (int)inst->dst.nr);
|
||
}
|
||
continue;
|
||
}
|
||
|
||
if (inst->dst.file == VGRF) {
|
||
reg = vgrf_to_reg[inst->dst.nr] + inst->dst.offset / REG_SIZE;
|
||
if (vgrf_has_split[inst->dst.nr]) {
|
||
inst->dst.nr = new_virtual_grf[reg];
|
||
inst->dst.offset = new_reg_offset[reg] * REG_SIZE +
|
||
inst->dst.offset % REG_SIZE;
|
||
assert((unsigned)new_reg_offset[reg] <
|
||
alloc.sizes[new_virtual_grf[reg]]);
|
||
} else {
|
||
assert(new_reg_offset[reg] == inst->dst.offset / REG_SIZE);
|
||
assert(new_virtual_grf[reg] == (int)inst->dst.nr);
|
||
}
|
||
}
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file != VGRF)
|
||
continue;
|
||
|
||
reg = vgrf_to_reg[inst->src[i].nr] + inst->src[i].offset / REG_SIZE;
|
||
if (vgrf_has_split[inst->src[i].nr]) {
|
||
inst->src[i].nr = new_virtual_grf[reg];
|
||
inst->src[i].offset = new_reg_offset[reg] * REG_SIZE +
|
||
inst->src[i].offset % REG_SIZE;
|
||
assert((unsigned)new_reg_offset[reg] <
|
||
alloc.sizes[new_virtual_grf[reg]]);
|
||
} else {
|
||
assert(new_reg_offset[reg] == inst->src[i].offset / REG_SIZE);
|
||
assert(new_virtual_grf[reg] == (int)inst->src[i].nr);
|
||
}
|
||
}
|
||
}
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DETAIL | DEPENDENCY_VARIABLES);
|
||
|
||
progress = true;
|
||
|
||
cleanup:
|
||
delete[] split_points;
|
||
delete[] vgrf_has_split;
|
||
delete[] new_virtual_grf;
|
||
delete[] new_reg_offset;
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Remove unused virtual GRFs and compact the vgrf_* arrays.
|
||
*
|
||
* During code generation, we create tons of temporary variables, many of
|
||
* which get immediately killed and are never used again. Yet, in later
|
||
* optimization and analysis passes, such as compute_live_intervals, we need
|
||
* to loop over all the virtual GRFs. Compacting them can save a lot of
|
||
* overhead.
|
||
*/
|
||
bool
|
||
fs_visitor::compact_virtual_grfs()
|
||
{
|
||
bool progress = false;
|
||
int *remap_table = new int[this->alloc.count];
|
||
memset(remap_table, -1, this->alloc.count * sizeof(int));
|
||
|
||
/* Mark which virtual GRFs are used. */
|
||
foreach_block_and_inst(block, const fs_inst, inst, cfg) {
|
||
if (inst->dst.file == VGRF)
|
||
remap_table[inst->dst.nr] = 0;
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == VGRF)
|
||
remap_table[inst->src[i].nr] = 0;
|
||
}
|
||
}
|
||
|
||
/* Compact the GRF arrays. */
|
||
int new_index = 0;
|
||
for (unsigned i = 0; i < this->alloc.count; i++) {
|
||
if (remap_table[i] == -1) {
|
||
/* We just found an unused register. This means that we are
|
||
* actually going to compact something.
|
||
*/
|
||
progress = true;
|
||
} else {
|
||
remap_table[i] = new_index;
|
||
alloc.sizes[new_index] = alloc.sizes[i];
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DETAIL | DEPENDENCY_VARIABLES);
|
||
++new_index;
|
||
}
|
||
}
|
||
|
||
this->alloc.count = new_index;
|
||
|
||
/* Patch all the instructions to use the newly renumbered registers */
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (inst->dst.file == VGRF)
|
||
inst->dst.nr = remap_table[inst->dst.nr];
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == VGRF)
|
||
inst->src[i].nr = remap_table[inst->src[i].nr];
|
||
}
|
||
}
|
||
|
||
/* Patch all the references to delta_xy, since they're used in register
|
||
* allocation. If they're unused, switch them to BAD_FILE so we don't
|
||
* think some random VGRF is delta_xy.
|
||
*/
|
||
for (unsigned i = 0; i < ARRAY_SIZE(delta_xy); i++) {
|
||
if (delta_xy[i].file == VGRF) {
|
||
if (remap_table[delta_xy[i].nr] != -1) {
|
||
delta_xy[i].nr = remap_table[delta_xy[i].nr];
|
||
} else {
|
||
delta_xy[i].file = BAD_FILE;
|
||
}
|
||
}
|
||
}
|
||
|
||
delete[] remap_table;
|
||
|
||
return progress;
|
||
}
|
||
|
||
static int
|
||
get_subgroup_id_param_index(const intel_device_info *devinfo,
|
||
const brw_stage_prog_data *prog_data)
|
||
{
|
||
if (prog_data->nr_params == 0)
|
||
return -1;
|
||
|
||
if (devinfo->verx10 >= 125)
|
||
return -1;
|
||
|
||
/* The local thread id is always the last parameter in the list */
|
||
uint32_t last_param = prog_data->param[prog_data->nr_params - 1];
|
||
if (last_param == BRW_PARAM_BUILTIN_SUBGROUP_ID)
|
||
return prog_data->nr_params - 1;
|
||
|
||
return -1;
|
||
}
|
||
|
||
/**
|
||
* Assign UNIFORM file registers to either push constants or pull constants.
|
||
*
|
||
* We allow a fragment shader to have more than the specified minimum
|
||
* maximum number of fragment shader uniform components (64). If
|
||
* there are too many of these, they'd fill up all of register space.
|
||
* So, this will push some of them out to the pull constant buffer and
|
||
* update the program to load them.
|
||
*/
|
||
void
|
||
fs_visitor::assign_constant_locations()
|
||
{
|
||
/* Only the first compile gets to decide on locations. */
|
||
if (push_constant_loc)
|
||
return;
|
||
|
||
push_constant_loc = ralloc_array(mem_ctx, int, uniforms);
|
||
for (unsigned u = 0; u < uniforms; u++)
|
||
push_constant_loc[u] = u;
|
||
|
||
/* Now that we know how many regular uniforms we'll push, reduce the
|
||
* UBO push ranges so we don't exceed the 3DSTATE_CONSTANT limits.
|
||
*/
|
||
/* For gen4/5:
|
||
* Only allow 16 registers (128 uniform components) as push constants.
|
||
*
|
||
* If changing this value, note the limitation about total_regs in
|
||
* brw_curbe.c/crocus_state.c
|
||
*/
|
||
const unsigned max_push_length = compiler->devinfo->ver < 6 ? 16 : 64;
|
||
unsigned push_length = DIV_ROUND_UP(stage_prog_data->nr_params, 8);
|
||
for (int i = 0; i < 4; i++) {
|
||
struct brw_ubo_range *range = &prog_data->ubo_ranges[i];
|
||
|
||
if (push_length + range->length > max_push_length)
|
||
range->length = max_push_length - push_length;
|
||
|
||
push_length += range->length;
|
||
}
|
||
assert(push_length <= max_push_length);
|
||
}
|
||
|
||
bool
|
||
fs_visitor::get_pull_locs(const fs_reg &src,
|
||
unsigned *out_surf_index,
|
||
unsigned *out_pull_index)
|
||
{
|
||
assert(src.file == UNIFORM);
|
||
|
||
if (src.nr < UBO_START)
|
||
return false;
|
||
|
||
const struct brw_ubo_range *range =
|
||
&prog_data->ubo_ranges[src.nr - UBO_START];
|
||
|
||
/* If this access is in our (reduced) range, use the push data. */
|
||
if (src.offset / 32 < range->length)
|
||
return false;
|
||
|
||
*out_surf_index = range->block;
|
||
*out_pull_index = (32 * range->start + src.offset) / 4;
|
||
|
||
prog_data->has_ubo_pull = true;
|
||
|
||
return true;
|
||
}
|
||
|
||
/**
|
||
* Replace UNIFORM register file access with either UNIFORM_PULL_CONSTANT_LOAD
|
||
* or VARYING_PULL_CONSTANT_LOAD instructions which load values into VGRFs.
|
||
*/
|
||
void
|
||
fs_visitor::lower_constant_loads()
|
||
{
|
||
unsigned index, pull_index;
|
||
|
||
foreach_block_and_inst_safe (block, fs_inst, inst, cfg) {
|
||
/* Set up the annotation tracking for new generated instructions. */
|
||
const fs_builder ibld(this, block, inst);
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file != UNIFORM)
|
||
continue;
|
||
|
||
/* We'll handle this case later */
|
||
if (inst->opcode == SHADER_OPCODE_MOV_INDIRECT && i == 0)
|
||
continue;
|
||
|
||
if (!get_pull_locs(inst->src[i], &index, &pull_index))
|
||
continue;
|
||
|
||
assert(inst->src[i].stride == 0);
|
||
|
||
const unsigned block_sz = 64; /* Fetch one cacheline at a time. */
|
||
const fs_builder ubld = ibld.exec_all().group(block_sz / 4, 0);
|
||
const fs_reg dst = ubld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
const unsigned base = pull_index * 4;
|
||
|
||
ubld.emit(FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD,
|
||
dst, brw_imm_ud(index), brw_imm_ud(base & ~(block_sz - 1)));
|
||
|
||
/* Rewrite the instruction to use the temporary VGRF. */
|
||
inst->src[i].file = VGRF;
|
||
inst->src[i].nr = dst.nr;
|
||
inst->src[i].offset = (base & (block_sz - 1)) +
|
||
inst->src[i].offset % 4;
|
||
}
|
||
|
||
if (inst->opcode == SHADER_OPCODE_MOV_INDIRECT &&
|
||
inst->src[0].file == UNIFORM) {
|
||
|
||
if (!get_pull_locs(inst->src[0], &index, &pull_index))
|
||
continue;
|
||
|
||
VARYING_PULL_CONSTANT_LOAD(ibld, inst->dst,
|
||
brw_imm_ud(index),
|
||
inst->src[1],
|
||
pull_index * 4, 4);
|
||
inst->remove(block);
|
||
}
|
||
}
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
}
|
||
|
||
bool
|
||
fs_visitor::opt_algebraic()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
switch (inst->opcode) {
|
||
case BRW_OPCODE_MOV:
|
||
if (!devinfo->has_64bit_float &&
|
||
inst->dst.type == BRW_REGISTER_TYPE_DF) {
|
||
assert(inst->dst.type == inst->src[0].type);
|
||
assert(!inst->saturate);
|
||
assert(!inst->src[0].abs);
|
||
assert(!inst->src[0].negate);
|
||
const brw::fs_builder ibld(this, block, inst);
|
||
|
||
ibld.MOV(subscript(inst->dst, BRW_REGISTER_TYPE_F, 1),
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_F, 1));
|
||
ibld.MOV(subscript(inst->dst, BRW_REGISTER_TYPE_F, 0),
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_F, 0));
|
||
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
|
||
if (!devinfo->has_64bit_int &&
|
||
(inst->dst.type == BRW_REGISTER_TYPE_UQ ||
|
||
inst->dst.type == BRW_REGISTER_TYPE_Q)) {
|
||
assert(inst->dst.type == inst->src[0].type);
|
||
assert(!inst->saturate);
|
||
assert(!inst->src[0].abs);
|
||
assert(!inst->src[0].negate);
|
||
const brw::fs_builder ibld(this, block, inst);
|
||
|
||
ibld.MOV(subscript(inst->dst, BRW_REGISTER_TYPE_UD, 1),
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 1));
|
||
ibld.MOV(subscript(inst->dst, BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 0));
|
||
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
|
||
if ((inst->conditional_mod == BRW_CONDITIONAL_Z ||
|
||
inst->conditional_mod == BRW_CONDITIONAL_NZ) &&
|
||
inst->dst.is_null() &&
|
||
(inst->src[0].abs || inst->src[0].negate)) {
|
||
inst->src[0].abs = false;
|
||
inst->src[0].negate = false;
|
||
progress = true;
|
||
break;
|
||
}
|
||
|
||
if (inst->src[0].file != IMM)
|
||
break;
|
||
|
||
if (inst->saturate) {
|
||
/* Full mixed-type saturates don't happen. However, we can end up
|
||
* with things like:
|
||
*
|
||
* mov.sat(8) g21<1>DF -1F
|
||
*
|
||
* Other mixed-size-but-same-base-type cases may also be possible.
|
||
*/
|
||
if (inst->dst.type != inst->src[0].type &&
|
||
inst->dst.type != BRW_REGISTER_TYPE_DF &&
|
||
inst->src[0].type != BRW_REGISTER_TYPE_F)
|
||
assert(!"unimplemented: saturate mixed types");
|
||
|
||
if (brw_saturate_immediate(inst->src[0].type,
|
||
&inst->src[0].as_brw_reg())) {
|
||
inst->saturate = false;
|
||
progress = true;
|
||
}
|
||
}
|
||
break;
|
||
|
||
case BRW_OPCODE_MUL:
|
||
if (inst->src[1].file != IMM)
|
||
continue;
|
||
|
||
if (brw_reg_type_is_floating_point(inst->src[1].type))
|
||
break;
|
||
|
||
/* a * 1.0 = a */
|
||
if (inst->src[1].is_one()) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[1] = reg_undef;
|
||
progress = true;
|
||
break;
|
||
}
|
||
|
||
/* a * -1.0 = -a */
|
||
if (inst->src[1].is_negative_one()) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[0].negate = !inst->src[0].negate;
|
||
inst->src[1] = reg_undef;
|
||
progress = true;
|
||
break;
|
||
}
|
||
|
||
break;
|
||
case BRW_OPCODE_ADD:
|
||
if (inst->src[1].file != IMM)
|
||
continue;
|
||
|
||
if (brw_reg_type_is_integer(inst->src[1].type) &&
|
||
inst->src[1].is_zero()) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[1] = reg_undef;
|
||
progress = true;
|
||
break;
|
||
}
|
||
|
||
if (inst->src[0].file == IMM) {
|
||
assert(inst->src[0].type == BRW_REGISTER_TYPE_F);
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[0].f += inst->src[1].f;
|
||
inst->src[1] = reg_undef;
|
||
progress = true;
|
||
break;
|
||
}
|
||
break;
|
||
case BRW_OPCODE_OR:
|
||
if (inst->src[0].equals(inst->src[1]) ||
|
||
inst->src[1].is_zero()) {
|
||
/* On Gfx8+, the OR instruction can have a source modifier that
|
||
* performs logical not on the operand. Cases of 'OR r0, ~r1, 0'
|
||
* or 'OR r0, ~r1, ~r1' should become a NOT instead of a MOV.
|
||
*/
|
||
if (inst->src[0].negate) {
|
||
inst->opcode = BRW_OPCODE_NOT;
|
||
inst->src[0].negate = false;
|
||
} else {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
}
|
||
inst->src[1] = reg_undef;
|
||
progress = true;
|
||
break;
|
||
}
|
||
break;
|
||
case BRW_OPCODE_CMP:
|
||
if ((inst->conditional_mod == BRW_CONDITIONAL_Z ||
|
||
inst->conditional_mod == BRW_CONDITIONAL_NZ) &&
|
||
inst->src[1].is_zero() &&
|
||
(inst->src[0].abs || inst->src[0].negate)) {
|
||
inst->src[0].abs = false;
|
||
inst->src[0].negate = false;
|
||
progress = true;
|
||
break;
|
||
}
|
||
break;
|
||
case BRW_OPCODE_SEL:
|
||
if (!devinfo->has_64bit_float &&
|
||
!devinfo->has_64bit_int &&
|
||
(inst->dst.type == BRW_REGISTER_TYPE_DF ||
|
||
inst->dst.type == BRW_REGISTER_TYPE_UQ ||
|
||
inst->dst.type == BRW_REGISTER_TYPE_Q)) {
|
||
assert(inst->dst.type == inst->src[0].type);
|
||
assert(!inst->saturate);
|
||
assert(!inst->src[0].abs && !inst->src[0].negate);
|
||
assert(!inst->src[1].abs && !inst->src[1].negate);
|
||
const brw::fs_builder ibld(this, block, inst);
|
||
|
||
set_predicate(inst->predicate,
|
||
ibld.SEL(subscript(inst->dst, BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UD, 0)));
|
||
set_predicate(inst->predicate,
|
||
ibld.SEL(subscript(inst->dst, BRW_REGISTER_TYPE_UD, 1),
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 1),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UD, 1)));
|
||
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
if (inst->src[0].equals(inst->src[1])) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[1] = reg_undef;
|
||
inst->predicate = BRW_PREDICATE_NONE;
|
||
inst->predicate_inverse = false;
|
||
progress = true;
|
||
} else if (inst->saturate && inst->src[1].file == IMM) {
|
||
switch (inst->conditional_mod) {
|
||
case BRW_CONDITIONAL_LE:
|
||
case BRW_CONDITIONAL_L:
|
||
switch (inst->src[1].type) {
|
||
case BRW_REGISTER_TYPE_F:
|
||
if (inst->src[1].f >= 1.0f) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[1] = reg_undef;
|
||
inst->conditional_mod = BRW_CONDITIONAL_NONE;
|
||
progress = true;
|
||
}
|
||
break;
|
||
default:
|
||
break;
|
||
}
|
||
break;
|
||
case BRW_CONDITIONAL_GE:
|
||
case BRW_CONDITIONAL_G:
|
||
switch (inst->src[1].type) {
|
||
case BRW_REGISTER_TYPE_F:
|
||
if (inst->src[1].f <= 0.0f) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[1] = reg_undef;
|
||
inst->conditional_mod = BRW_CONDITIONAL_NONE;
|
||
progress = true;
|
||
}
|
||
break;
|
||
default:
|
||
break;
|
||
}
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
break;
|
||
case BRW_OPCODE_MAD:
|
||
if (inst->src[0].type != BRW_REGISTER_TYPE_F ||
|
||
inst->src[1].type != BRW_REGISTER_TYPE_F ||
|
||
inst->src[2].type != BRW_REGISTER_TYPE_F)
|
||
break;
|
||
if (inst->src[1].is_one()) {
|
||
inst->opcode = BRW_OPCODE_ADD;
|
||
inst->src[1] = inst->src[2];
|
||
inst->src[2] = reg_undef;
|
||
progress = true;
|
||
} else if (inst->src[2].is_one()) {
|
||
inst->opcode = BRW_OPCODE_ADD;
|
||
inst->src[2] = reg_undef;
|
||
progress = true;
|
||
}
|
||
break;
|
||
case SHADER_OPCODE_BROADCAST:
|
||
if (is_uniform(inst->src[0])) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->sources = 1;
|
||
inst->force_writemask_all = true;
|
||
progress = true;
|
||
} else if (inst->src[1].file == IMM) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
/* It's possible that the selected component will be too large and
|
||
* overflow the register. This can happen if someone does a
|
||
* readInvocation() from GLSL or SPIR-V and provides an OOB
|
||
* invocationIndex. If this happens and we some how manage
|
||
* to constant fold it in and get here, then component() may cause
|
||
* us to start reading outside of the VGRF which will lead to an
|
||
* assert later. Instead, just let it wrap around if it goes over
|
||
* exec_size.
|
||
*/
|
||
const unsigned comp = inst->src[1].ud & (inst->exec_size - 1);
|
||
inst->src[0] = component(inst->src[0], comp);
|
||
inst->sources = 1;
|
||
inst->force_writemask_all = true;
|
||
progress = true;
|
||
}
|
||
break;
|
||
|
||
case SHADER_OPCODE_SHUFFLE:
|
||
if (is_uniform(inst->src[0])) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->sources = 1;
|
||
progress = true;
|
||
} else if (inst->src[1].file == IMM) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[0] = component(inst->src[0],
|
||
inst->src[1].ud);
|
||
inst->sources = 1;
|
||
progress = true;
|
||
}
|
||
break;
|
||
|
||
default:
|
||
break;
|
||
}
|
||
|
||
/* Swap if src[0] is immediate. */
|
||
if (progress && inst->is_commutative()) {
|
||
if (inst->src[0].file == IMM) {
|
||
fs_reg tmp = inst->src[1];
|
||
inst->src[1] = inst->src[0];
|
||
inst->src[0] = tmp;
|
||
}
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DATA_FLOW |
|
||
DEPENDENCY_INSTRUCTION_DETAIL);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Optimize sample messages that have constant zero values for the trailing
|
||
* texture coordinates. We can just reduce the message length for these
|
||
* instructions instead of reserving a register for it. Trailing parameters
|
||
* that aren't sent default to zero anyway. This will cause the dead code
|
||
* eliminator to remove the MOV instruction that would otherwise be emitted to
|
||
* set up the zero value.
|
||
*/
|
||
bool
|
||
fs_visitor::opt_zero_samples()
|
||
{
|
||
/* Gfx4 infers the texturing opcode based on the message length so we can't
|
||
* change it. Gfx12.5 has restrictions on the number of coordinate
|
||
* parameters that have to be provided for some texture types
|
||
* (Wa_14013363432).
|
||
*/
|
||
if (devinfo->ver < 5 || devinfo->verx10 == 125)
|
||
return false;
|
||
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (!inst->is_tex())
|
||
continue;
|
||
|
||
fs_inst *load_payload = (fs_inst *) inst->prev;
|
||
|
||
if (load_payload->is_head_sentinel() ||
|
||
load_payload->opcode != SHADER_OPCODE_LOAD_PAYLOAD)
|
||
continue;
|
||
|
||
/* We don't want to remove the message header or the first parameter.
|
||
* Removing the first parameter is not allowed, see the Haswell PRM
|
||
* volume 7, page 149:
|
||
*
|
||
* "Parameter 0 is required except for the sampleinfo message, which
|
||
* has no parameter 0"
|
||
*/
|
||
while (inst->mlen > inst->header_size + inst->exec_size / 8 &&
|
||
load_payload->src[(inst->mlen - inst->header_size) /
|
||
(inst->exec_size / 8) +
|
||
inst->header_size - 1].is_zero()) {
|
||
inst->mlen -= inst->exec_size / 8;
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DETAIL);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Opportunistically split SEND message payloads.
|
||
*
|
||
* Gfx9+ supports "split" SEND messages, which take two payloads that are
|
||
* implicitly concatenated. If we find a SEND message with a single payload,
|
||
* we can split that payload in two. This results in smaller contiguous
|
||
* register blocks for us to allocate. But it can help beyond that, too.
|
||
*
|
||
* We try and split a LOAD_PAYLOAD between sources which change registers.
|
||
* For example, a sampler message often contains a x/y/z coordinate that may
|
||
* already be in a contiguous VGRF, combined with an LOD, shadow comparitor,
|
||
* or array index, which comes from elsewhere. In this case, the first few
|
||
* sources will be different offsets of the same VGRF, then a later source
|
||
* will be a different VGRF. So we split there, possibly eliminating the
|
||
* payload concatenation altogether.
|
||
*/
|
||
bool
|
||
fs_visitor::opt_split_sends()
|
||
{
|
||
if (devinfo->ver < 9)
|
||
return false;
|
||
|
||
bool progress = false;
|
||
|
||
const fs_live_variables &live = live_analysis.require();
|
||
|
||
int next_ip = 0;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, send, cfg) {
|
||
int ip = next_ip;
|
||
next_ip++;
|
||
|
||
if (send->opcode != SHADER_OPCODE_SEND ||
|
||
send->mlen == 1 || send->ex_mlen > 0)
|
||
continue;
|
||
|
||
/* Don't split payloads which are also read later. */
|
||
assert(send->src[2].file == VGRF);
|
||
if (live.vgrf_end[send->src[2].nr] > ip)
|
||
continue;
|
||
|
||
fs_inst *lp = (fs_inst *) send->prev;
|
||
|
||
if (lp->is_head_sentinel() || lp->opcode != SHADER_OPCODE_LOAD_PAYLOAD)
|
||
continue;
|
||
|
||
if (lp->dst.file != send->src[2].file || lp->dst.nr != send->src[2].nr)
|
||
continue;
|
||
|
||
/* Split either after the header (if present), or when consecutive
|
||
* sources switch from one VGRF to a different one.
|
||
*/
|
||
unsigned i = lp->header_size;
|
||
if (lp->header_size == 0) {
|
||
for (i = 1; i < lp->sources; i++) {
|
||
if (lp->src[i].file == BAD_FILE)
|
||
continue;
|
||
|
||
if (lp->src[0].file != lp->src[i].file ||
|
||
lp->src[0].nr != lp->src[i].nr)
|
||
break;
|
||
}
|
||
}
|
||
|
||
if (i != lp->sources) {
|
||
const fs_builder ibld(this, block, lp);
|
||
fs_inst *lp2 =
|
||
ibld.LOAD_PAYLOAD(lp->dst, &lp->src[i], lp->sources - i, 0);
|
||
|
||
lp->resize_sources(i);
|
||
lp->size_written -= lp2->size_written;
|
||
|
||
lp->dst = fs_reg(VGRF, alloc.allocate(lp->size_written / REG_SIZE), lp->dst.type);
|
||
lp2->dst = fs_reg(VGRF, alloc.allocate(lp2->size_written / REG_SIZE), lp2->dst.type);
|
||
|
||
send->resize_sources(4);
|
||
send->src[2] = lp->dst;
|
||
send->src[3] = lp2->dst;
|
||
send->ex_mlen = lp2->size_written / REG_SIZE;
|
||
send->mlen -= send->ex_mlen;
|
||
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
|
||
bool
|
||
fs_visitor::opt_register_renaming()
|
||
{
|
||
bool progress = false;
|
||
int depth = 0;
|
||
|
||
unsigned remap[alloc.count];
|
||
memset(remap, ~0u, sizeof(unsigned) * alloc.count);
|
||
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (inst->opcode == BRW_OPCODE_IF || inst->opcode == BRW_OPCODE_DO) {
|
||
depth++;
|
||
} else if (inst->opcode == BRW_OPCODE_ENDIF ||
|
||
inst->opcode == BRW_OPCODE_WHILE) {
|
||
depth--;
|
||
}
|
||
|
||
/* Rewrite instruction sources. */
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == VGRF &&
|
||
remap[inst->src[i].nr] != ~0u &&
|
||
remap[inst->src[i].nr] != inst->src[i].nr) {
|
||
inst->src[i].nr = remap[inst->src[i].nr];
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
const unsigned dst = inst->dst.nr;
|
||
|
||
if (depth == 0 &&
|
||
inst->dst.file == VGRF &&
|
||
alloc.sizes[inst->dst.nr] * REG_SIZE == inst->size_written &&
|
||
!inst->is_partial_write()) {
|
||
if (remap[dst] == ~0u) {
|
||
remap[dst] = dst;
|
||
} else {
|
||
remap[dst] = alloc.allocate(regs_written(inst));
|
||
inst->dst.nr = remap[dst];
|
||
progress = true;
|
||
}
|
||
} else if (inst->dst.file == VGRF &&
|
||
remap[dst] != ~0u &&
|
||
remap[dst] != dst) {
|
||
inst->dst.nr = remap[dst];
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress) {
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DETAIL |
|
||
DEPENDENCY_VARIABLES);
|
||
|
||
for (unsigned i = 0; i < ARRAY_SIZE(delta_xy); i++) {
|
||
if (delta_xy[i].file == VGRF && remap[delta_xy[i].nr] != ~0u) {
|
||
delta_xy[i].nr = remap[delta_xy[i].nr];
|
||
}
|
||
}
|
||
}
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Remove redundant or useless halts.
|
||
*
|
||
* For example, we can eliminate halts in the following sequence:
|
||
*
|
||
* halt (redundant with the next halt)
|
||
* halt (useless; jumps to the next instruction)
|
||
* halt-target
|
||
*/
|
||
bool
|
||
fs_visitor::opt_redundant_halt()
|
||
{
|
||
bool progress = false;
|
||
|
||
unsigned halt_count = 0;
|
||
fs_inst *halt_target = NULL;
|
||
bblock_t *halt_target_block = NULL;
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (inst->opcode == BRW_OPCODE_HALT)
|
||
halt_count++;
|
||
|
||
if (inst->opcode == SHADER_OPCODE_HALT_TARGET) {
|
||
halt_target = inst;
|
||
halt_target_block = block;
|
||
break;
|
||
}
|
||
}
|
||
|
||
if (!halt_target) {
|
||
assert(halt_count == 0);
|
||
return false;
|
||
}
|
||
|
||
/* Delete any HALTs immediately before the halt target. */
|
||
for (fs_inst *prev = (fs_inst *) halt_target->prev;
|
||
!prev->is_head_sentinel() && prev->opcode == BRW_OPCODE_HALT;
|
||
prev = (fs_inst *) halt_target->prev) {
|
||
prev->remove(halt_target_block);
|
||
halt_count--;
|
||
progress = true;
|
||
}
|
||
|
||
if (halt_count == 0) {
|
||
halt_target->remove(halt_target_block);
|
||
progress = true;
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Compute a bitmask with GRF granularity with a bit set for each GRF starting
|
||
* from \p r.offset which overlaps the region starting at \p s.offset and
|
||
* spanning \p ds bytes.
|
||
*/
|
||
static inline unsigned
|
||
mask_relative_to(const fs_reg &r, const fs_reg &s, unsigned ds)
|
||
{
|
||
const int rel_offset = reg_offset(s) - reg_offset(r);
|
||
const int shift = rel_offset / REG_SIZE;
|
||
const unsigned n = DIV_ROUND_UP(rel_offset % REG_SIZE + ds, REG_SIZE);
|
||
assert(reg_space(r) == reg_space(s) &&
|
||
shift >= 0 && shift < int(8 * sizeof(unsigned)));
|
||
return ((1 << n) - 1) << shift;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::compute_to_mrf()
|
||
{
|
||
bool progress = false;
|
||
int next_ip = 0;
|
||
|
||
/* No MRFs on Gen >= 7. */
|
||
if (devinfo->ver >= 7)
|
||
return false;
|
||
|
||
const fs_live_variables &live = live_analysis.require();
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
int ip = next_ip;
|
||
next_ip++;
|
||
|
||
if (inst->opcode != BRW_OPCODE_MOV ||
|
||
inst->is_partial_write() ||
|
||
inst->dst.file != MRF || inst->src[0].file != VGRF ||
|
||
inst->dst.type != inst->src[0].type ||
|
||
inst->src[0].abs || inst->src[0].negate ||
|
||
!inst->src[0].is_contiguous() ||
|
||
inst->src[0].offset % REG_SIZE != 0)
|
||
continue;
|
||
|
||
/* Can't compute-to-MRF this GRF if someone else was going to
|
||
* read it later.
|
||
*/
|
||
if (live.vgrf_end[inst->src[0].nr] > ip)
|
||
continue;
|
||
|
||
/* Found a move of a GRF to a MRF. Let's see if we can go rewrite the
|
||
* things that computed the value of all GRFs of the source region. The
|
||
* regs_left bitset keeps track of the registers we haven't yet found a
|
||
* generating instruction for.
|
||
*/
|
||
unsigned regs_left = (1 << regs_read(inst, 0)) - 1;
|
||
|
||
foreach_inst_in_block_reverse_starting_from(fs_inst, scan_inst, inst) {
|
||
if (regions_overlap(scan_inst->dst, scan_inst->size_written,
|
||
inst->src[0], inst->size_read(0))) {
|
||
/* Found the last thing to write our reg we want to turn
|
||
* into a compute-to-MRF.
|
||
*/
|
||
|
||
/* If this one instruction didn't populate all the
|
||
* channels, bail. We might be able to rewrite everything
|
||
* that writes that reg, but it would require smarter
|
||
* tracking.
|
||
*/
|
||
if (scan_inst->is_partial_write())
|
||
break;
|
||
|
||
/* Handling things not fully contained in the source of the copy
|
||
* would need us to understand coalescing out more than one MOV at
|
||
* a time.
|
||
*/
|
||
if (!region_contained_in(scan_inst->dst, scan_inst->size_written,
|
||
inst->src[0], inst->size_read(0)))
|
||
break;
|
||
|
||
/* SEND instructions can't have MRF as a destination. */
|
||
if (scan_inst->mlen)
|
||
break;
|
||
|
||
if (devinfo->ver == 6) {
|
||
/* gfx6 math instructions must have the destination be
|
||
* GRF, so no compute-to-MRF for them.
|
||
*/
|
||
if (scan_inst->is_math()) {
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Clear the bits for any registers this instruction overwrites. */
|
||
regs_left &= ~mask_relative_to(
|
||
inst->src[0], scan_inst->dst, scan_inst->size_written);
|
||
if (!regs_left)
|
||
break;
|
||
}
|
||
|
||
/* We don't handle control flow here. Most computation of
|
||
* values that end up in MRFs are shortly before the MRF
|
||
* write anyway.
|
||
*/
|
||
if (block->start() == scan_inst)
|
||
break;
|
||
|
||
/* You can't read from an MRF, so if someone else reads our
|
||
* MRF's source GRF that we wanted to rewrite, that stops us.
|
||
*/
|
||
bool interfered = false;
|
||
for (int i = 0; i < scan_inst->sources; i++) {
|
||
if (regions_overlap(scan_inst->src[i], scan_inst->size_read(i),
|
||
inst->src[0], inst->size_read(0))) {
|
||
interfered = true;
|
||
}
|
||
}
|
||
if (interfered)
|
||
break;
|
||
|
||
if (regions_overlap(scan_inst->dst, scan_inst->size_written,
|
||
inst->dst, inst->size_written)) {
|
||
/* If somebody else writes our MRF here, we can't
|
||
* compute-to-MRF before that.
|
||
*/
|
||
break;
|
||
}
|
||
|
||
if (scan_inst->mlen > 0 && scan_inst->base_mrf != -1 &&
|
||
regions_overlap(fs_reg(MRF, scan_inst->base_mrf), scan_inst->mlen * REG_SIZE,
|
||
inst->dst, inst->size_written)) {
|
||
/* Found a SEND instruction, which means that there are
|
||
* live values in MRFs from base_mrf to base_mrf +
|
||
* scan_inst->mlen - 1. Don't go pushing our MRF write up
|
||
* above it.
|
||
*/
|
||
break;
|
||
}
|
||
}
|
||
|
||
if (regs_left)
|
||
continue;
|
||
|
||
/* Found all generating instructions of our MRF's source value, so it
|
||
* should be safe to rewrite them to point to the MRF directly.
|
||
*/
|
||
regs_left = (1 << regs_read(inst, 0)) - 1;
|
||
|
||
foreach_inst_in_block_reverse_starting_from(fs_inst, scan_inst, inst) {
|
||
if (regions_overlap(scan_inst->dst, scan_inst->size_written,
|
||
inst->src[0], inst->size_read(0))) {
|
||
/* Clear the bits for any registers this instruction overwrites. */
|
||
regs_left &= ~mask_relative_to(
|
||
inst->src[0], scan_inst->dst, scan_inst->size_written);
|
||
|
||
const unsigned rel_offset = reg_offset(scan_inst->dst) -
|
||
reg_offset(inst->src[0]);
|
||
|
||
if (inst->dst.nr & BRW_MRF_COMPR4) {
|
||
/* Apply the same address transformation done by the hardware
|
||
* for COMPR4 MRF writes.
|
||
*/
|
||
assert(rel_offset < 2 * REG_SIZE);
|
||
scan_inst->dst.nr = inst->dst.nr + rel_offset / REG_SIZE * 4;
|
||
|
||
/* Clear the COMPR4 bit if the generating instruction is not
|
||
* compressed.
|
||
*/
|
||
if (scan_inst->size_written < 2 * REG_SIZE)
|
||
scan_inst->dst.nr &= ~BRW_MRF_COMPR4;
|
||
|
||
} else {
|
||
/* Calculate the MRF number the result of this instruction is
|
||
* ultimately written to.
|
||
*/
|
||
scan_inst->dst.nr = inst->dst.nr + rel_offset / REG_SIZE;
|
||
}
|
||
|
||
scan_inst->dst.file = MRF;
|
||
scan_inst->dst.offset = inst->dst.offset + rel_offset % REG_SIZE;
|
||
scan_inst->saturate |= inst->saturate;
|
||
if (!regs_left)
|
||
break;
|
||
}
|
||
}
|
||
|
||
assert(!regs_left);
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Eliminate FIND_LIVE_CHANNEL instructions occurring outside any control
|
||
* flow. We could probably do better here with some form of divergence
|
||
* analysis.
|
||
*/
|
||
bool
|
||
fs_visitor::eliminate_find_live_channel()
|
||
{
|
||
bool progress = false;
|
||
unsigned depth = 0;
|
||
|
||
if (!brw_stage_has_packed_dispatch(devinfo, stage, stage_prog_data)) {
|
||
/* The optimization below assumes that channel zero is live on thread
|
||
* dispatch, which may not be the case if the fixed function dispatches
|
||
* threads sparsely.
|
||
*/
|
||
return false;
|
||
}
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
switch (inst->opcode) {
|
||
case BRW_OPCODE_IF:
|
||
case BRW_OPCODE_DO:
|
||
depth++;
|
||
break;
|
||
|
||
case BRW_OPCODE_ENDIF:
|
||
case BRW_OPCODE_WHILE:
|
||
depth--;
|
||
break;
|
||
|
||
case BRW_OPCODE_HALT:
|
||
/* This can potentially make control flow non-uniform until the end
|
||
* of the program.
|
||
*/
|
||
goto out;
|
||
|
||
case SHADER_OPCODE_FIND_LIVE_CHANNEL:
|
||
if (depth == 0) {
|
||
inst->opcode = BRW_OPCODE_MOV;
|
||
inst->src[0] = brw_imm_ud(0u);
|
||
inst->sources = 1;
|
||
inst->force_writemask_all = true;
|
||
progress = true;
|
||
}
|
||
break;
|
||
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
out:
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DETAIL);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Once we've generated code, try to convert normal FS_OPCODE_FB_WRITE
|
||
* instructions to FS_OPCODE_REP_FB_WRITE.
|
||
*/
|
||
void
|
||
fs_visitor::emit_repclear_shader()
|
||
{
|
||
brw_wm_prog_key *key = (brw_wm_prog_key*) this->key;
|
||
int base_mrf = 0;
|
||
int color_mrf = base_mrf + 2;
|
||
fs_inst *mov;
|
||
|
||
if (uniforms > 0) {
|
||
mov = bld.exec_all().group(4, 0)
|
||
.MOV(brw_message_reg(color_mrf),
|
||
fs_reg(UNIFORM, 0, BRW_REGISTER_TYPE_F));
|
||
} else {
|
||
struct brw_reg reg =
|
||
brw_reg(BRW_GENERAL_REGISTER_FILE, 2, 3, 0, 0, BRW_REGISTER_TYPE_UD,
|
||
BRW_VERTICAL_STRIDE_8, BRW_WIDTH_2, BRW_HORIZONTAL_STRIDE_4,
|
||
BRW_SWIZZLE_XYZW, WRITEMASK_XYZW);
|
||
|
||
mov = bld.exec_all().group(4, 0)
|
||
.MOV(brw_uvec_mrf(4, color_mrf, 0), fs_reg(reg));
|
||
}
|
||
|
||
fs_inst *write = NULL;
|
||
if (key->nr_color_regions == 1) {
|
||
write = bld.emit(FS_OPCODE_REP_FB_WRITE);
|
||
write->saturate = key->clamp_fragment_color;
|
||
write->base_mrf = color_mrf;
|
||
write->target = 0;
|
||
write->header_size = 0;
|
||
write->mlen = 1;
|
||
} else {
|
||
assume(key->nr_color_regions > 0);
|
||
|
||
struct brw_reg header =
|
||
retype(brw_message_reg(base_mrf), BRW_REGISTER_TYPE_UD);
|
||
bld.exec_all().group(16, 0)
|
||
.MOV(header, retype(brw_vec8_grf(0, 0), BRW_REGISTER_TYPE_UD));
|
||
|
||
for (int i = 0; i < key->nr_color_regions; ++i) {
|
||
if (i > 0) {
|
||
bld.exec_all().group(1, 0)
|
||
.MOV(component(header, 2), brw_imm_ud(i));
|
||
}
|
||
|
||
write = bld.emit(FS_OPCODE_REP_FB_WRITE);
|
||
write->saturate = key->clamp_fragment_color;
|
||
write->base_mrf = base_mrf;
|
||
write->target = i;
|
||
write->header_size = 2;
|
||
write->mlen = 3;
|
||
}
|
||
}
|
||
write->eot = true;
|
||
write->last_rt = true;
|
||
|
||
calculate_cfg();
|
||
|
||
assign_constant_locations();
|
||
assign_curb_setup();
|
||
|
||
/* Now that we have the uniform assigned, go ahead and force it to a vec4. */
|
||
if (uniforms > 0) {
|
||
assert(mov->src[0].file == FIXED_GRF);
|
||
mov->src[0] = brw_vec4_grf(mov->src[0].nr, 0);
|
||
}
|
||
|
||
lower_scoreboard();
|
||
}
|
||
|
||
/**
|
||
* Walks through basic blocks, looking for repeated MRF writes and
|
||
* removing the later ones.
|
||
*/
|
||
bool
|
||
fs_visitor::remove_duplicate_mrf_writes()
|
||
{
|
||
fs_inst *last_mrf_move[BRW_MAX_MRF(devinfo->ver)];
|
||
bool progress = false;
|
||
|
||
/* Need to update the MRF tracking for compressed instructions. */
|
||
if (dispatch_width >= 16)
|
||
return false;
|
||
|
||
memset(last_mrf_move, 0, sizeof(last_mrf_move));
|
||
|
||
foreach_block_and_inst_safe (block, fs_inst, inst, cfg) {
|
||
if (inst->is_control_flow()) {
|
||
memset(last_mrf_move, 0, sizeof(last_mrf_move));
|
||
}
|
||
|
||
if (inst->opcode == BRW_OPCODE_MOV &&
|
||
inst->dst.file == MRF) {
|
||
fs_inst *prev_inst = last_mrf_move[inst->dst.nr];
|
||
if (prev_inst && prev_inst->opcode == BRW_OPCODE_MOV &&
|
||
inst->dst.equals(prev_inst->dst) &&
|
||
inst->src[0].equals(prev_inst->src[0]) &&
|
||
inst->saturate == prev_inst->saturate &&
|
||
inst->predicate == prev_inst->predicate &&
|
||
inst->conditional_mod == prev_inst->conditional_mod &&
|
||
inst->exec_size == prev_inst->exec_size) {
|
||
inst->remove(block);
|
||
progress = true;
|
||
continue;
|
||
}
|
||
}
|
||
|
||
/* Clear out the last-write records for MRFs that were overwritten. */
|
||
if (inst->dst.file == MRF) {
|
||
last_mrf_move[inst->dst.nr] = NULL;
|
||
}
|
||
|
||
if (inst->mlen > 0 && inst->base_mrf != -1) {
|
||
/* Found a SEND instruction, which will include two or fewer
|
||
* implied MRF writes. We could do better here.
|
||
*/
|
||
for (unsigned i = 0; i < inst->implied_mrf_writes(); i++) {
|
||
last_mrf_move[inst->base_mrf + i] = NULL;
|
||
}
|
||
}
|
||
|
||
/* Clear out any MRF move records whose sources got overwritten. */
|
||
for (unsigned i = 0; i < ARRAY_SIZE(last_mrf_move); i++) {
|
||
if (last_mrf_move[i] &&
|
||
regions_overlap(inst->dst, inst->size_written,
|
||
last_mrf_move[i]->src[0],
|
||
last_mrf_move[i]->size_read(0))) {
|
||
last_mrf_move[i] = NULL;
|
||
}
|
||
}
|
||
|
||
if (inst->opcode == BRW_OPCODE_MOV &&
|
||
inst->dst.file == MRF &&
|
||
inst->src[0].file != ARF &&
|
||
!inst->is_partial_write()) {
|
||
last_mrf_move[inst->dst.nr] = inst;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Rounding modes for conversion instructions are included for each
|
||
* conversion, but right now it is a state. So once it is set,
|
||
* we don't need to call it again for subsequent calls.
|
||
*
|
||
* This is useful for vector/matrices conversions, as setting the
|
||
* mode once is enough for the full vector/matrix
|
||
*/
|
||
bool
|
||
fs_visitor::remove_extra_rounding_modes()
|
||
{
|
||
bool progress = false;
|
||
unsigned execution_mode = this->nir->info.float_controls_execution_mode;
|
||
|
||
brw_rnd_mode base_mode = BRW_RND_MODE_UNSPECIFIED;
|
||
if ((FLOAT_CONTROLS_ROUNDING_MODE_RTE_FP16 |
|
||
FLOAT_CONTROLS_ROUNDING_MODE_RTE_FP32 |
|
||
FLOAT_CONTROLS_ROUNDING_MODE_RTE_FP64) &
|
||
execution_mode)
|
||
base_mode = BRW_RND_MODE_RTNE;
|
||
if ((FLOAT_CONTROLS_ROUNDING_MODE_RTZ_FP16 |
|
||
FLOAT_CONTROLS_ROUNDING_MODE_RTZ_FP32 |
|
||
FLOAT_CONTROLS_ROUNDING_MODE_RTZ_FP64) &
|
||
execution_mode)
|
||
base_mode = BRW_RND_MODE_RTZ;
|
||
|
||
foreach_block (block, cfg) {
|
||
brw_rnd_mode prev_mode = base_mode;
|
||
|
||
foreach_inst_in_block_safe (fs_inst, inst, block) {
|
||
if (inst->opcode == SHADER_OPCODE_RND_MODE) {
|
||
assert(inst->src[0].file == BRW_IMMEDIATE_VALUE);
|
||
const brw_rnd_mode mode = (brw_rnd_mode) inst->src[0].d;
|
||
if (mode == prev_mode) {
|
||
inst->remove(block);
|
||
progress = true;
|
||
} else {
|
||
prev_mode = mode;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
|
||
return progress;
|
||
}
|
||
|
||
static void
|
||
clear_deps_for_inst_src(fs_inst *inst, bool *deps, int first_grf, int grf_len)
|
||
{
|
||
/* Clear the flag for registers that actually got read (as expected). */
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
int grf;
|
||
if (inst->src[i].file == VGRF || inst->src[i].file == FIXED_GRF) {
|
||
grf = inst->src[i].nr;
|
||
} else {
|
||
continue;
|
||
}
|
||
|
||
if (grf >= first_grf &&
|
||
grf < first_grf + grf_len) {
|
||
deps[grf - first_grf] = false;
|
||
if (inst->exec_size == 16)
|
||
deps[grf - first_grf + 1] = false;
|
||
}
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Implements this workaround for the original 965:
|
||
*
|
||
* "[DevBW, DevCL] Implementation Restrictions: As the hardware does not
|
||
* check for post destination dependencies on this instruction, software
|
||
* must ensure that there is no destination hazard for the case of ‘write
|
||
* followed by a posted write’ shown in the following example.
|
||
*
|
||
* 1. mov r3 0
|
||
* 2. send r3.xy <rest of send instruction>
|
||
* 3. mov r2 r3
|
||
*
|
||
* Due to no post-destination dependency check on the ‘send’, the above
|
||
* code sequence could have two instructions (1 and 2) in flight at the
|
||
* same time that both consider ‘r3’ as the target of their final writes.
|
||
*/
|
||
void
|
||
fs_visitor::insert_gfx4_pre_send_dependency_workarounds(bblock_t *block,
|
||
fs_inst *inst)
|
||
{
|
||
int write_len = regs_written(inst);
|
||
int first_write_grf = inst->dst.nr;
|
||
bool needs_dep[BRW_MAX_MRF(devinfo->ver)];
|
||
assert(write_len < (int)sizeof(needs_dep) - 1);
|
||
|
||
memset(needs_dep, false, sizeof(needs_dep));
|
||
memset(needs_dep, true, write_len);
|
||
|
||
clear_deps_for_inst_src(inst, needs_dep, first_write_grf, write_len);
|
||
|
||
/* Walk backwards looking for writes to registers we're writing which
|
||
* aren't read since being written. If we hit the start of the program,
|
||
* we assume that there are no outstanding dependencies on entry to the
|
||
* program.
|
||
*/
|
||
foreach_inst_in_block_reverse_starting_from(fs_inst, scan_inst, inst) {
|
||
/* If we hit control flow, assume that there *are* outstanding
|
||
* dependencies, and force their cleanup before our instruction.
|
||
*/
|
||
if (block->start() == scan_inst && block->num != 0) {
|
||
for (int i = 0; i < write_len; i++) {
|
||
if (needs_dep[i])
|
||
DEP_RESOLVE_MOV(fs_builder(this, block, inst),
|
||
first_write_grf + i);
|
||
}
|
||
return;
|
||
}
|
||
|
||
/* We insert our reads as late as possible on the assumption that any
|
||
* instruction but a MOV that might have left us an outstanding
|
||
* dependency has more latency than a MOV.
|
||
*/
|
||
if (scan_inst->dst.file == VGRF) {
|
||
for (unsigned i = 0; i < regs_written(scan_inst); i++) {
|
||
int reg = scan_inst->dst.nr + i;
|
||
|
||
if (reg >= first_write_grf &&
|
||
reg < first_write_grf + write_len &&
|
||
needs_dep[reg - first_write_grf]) {
|
||
DEP_RESOLVE_MOV(fs_builder(this, block, inst), reg);
|
||
needs_dep[reg - first_write_grf] = false;
|
||
if (scan_inst->exec_size == 16)
|
||
needs_dep[reg - first_write_grf + 1] = false;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Clear the flag for registers that actually got read (as expected). */
|
||
clear_deps_for_inst_src(scan_inst, needs_dep, first_write_grf, write_len);
|
||
|
||
/* Continue the loop only if we haven't resolved all the dependencies */
|
||
int i;
|
||
for (i = 0; i < write_len; i++) {
|
||
if (needs_dep[i])
|
||
break;
|
||
}
|
||
if (i == write_len)
|
||
return;
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Implements this workaround for the original 965:
|
||
*
|
||
* "[DevBW, DevCL] Errata: A destination register from a send can not be
|
||
* used as a destination register until after it has been sourced by an
|
||
* instruction with a different destination register.
|
||
*/
|
||
void
|
||
fs_visitor::insert_gfx4_post_send_dependency_workarounds(bblock_t *block, fs_inst *inst)
|
||
{
|
||
int write_len = regs_written(inst);
|
||
unsigned first_write_grf = inst->dst.nr;
|
||
bool needs_dep[BRW_MAX_MRF(devinfo->ver)];
|
||
assert(write_len < (int)sizeof(needs_dep) - 1);
|
||
|
||
memset(needs_dep, false, sizeof(needs_dep));
|
||
memset(needs_dep, true, write_len);
|
||
/* Walk forwards looking for writes to registers we're writing which aren't
|
||
* read before being written.
|
||
*/
|
||
foreach_inst_in_block_starting_from(fs_inst, scan_inst, inst) {
|
||
/* If we hit control flow, force resolve all remaining dependencies. */
|
||
if (block->end() == scan_inst && block->num != cfg->num_blocks - 1) {
|
||
for (int i = 0; i < write_len; i++) {
|
||
if (needs_dep[i])
|
||
DEP_RESOLVE_MOV(fs_builder(this, block, scan_inst),
|
||
first_write_grf + i);
|
||
}
|
||
return;
|
||
}
|
||
|
||
/* Clear the flag for registers that actually got read (as expected). */
|
||
clear_deps_for_inst_src(scan_inst, needs_dep, first_write_grf, write_len);
|
||
|
||
/* We insert our reads as late as possible since they're reading the
|
||
* result of a SEND, which has massive latency.
|
||
*/
|
||
if (scan_inst->dst.file == VGRF &&
|
||
scan_inst->dst.nr >= first_write_grf &&
|
||
scan_inst->dst.nr < first_write_grf + write_len &&
|
||
needs_dep[scan_inst->dst.nr - first_write_grf]) {
|
||
DEP_RESOLVE_MOV(fs_builder(this, block, scan_inst),
|
||
scan_inst->dst.nr);
|
||
needs_dep[scan_inst->dst.nr - first_write_grf] = false;
|
||
}
|
||
|
||
/* Continue the loop only if we haven't resolved all the dependencies */
|
||
int i;
|
||
for (i = 0; i < write_len; i++) {
|
||
if (needs_dep[i])
|
||
break;
|
||
}
|
||
if (i == write_len)
|
||
return;
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::insert_gfx4_send_dependency_workarounds()
|
||
{
|
||
if (devinfo->ver != 4 || devinfo->platform == INTEL_PLATFORM_G4X)
|
||
return;
|
||
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (inst->mlen != 0 && inst->dst.file == VGRF) {
|
||
insert_gfx4_pre_send_dependency_workarounds(block, inst);
|
||
insert_gfx4_post_send_dependency_workarounds(block, inst);
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
}
|
||
|
||
/**
|
||
* Turns the generic expression-style uniform pull constant load instruction
|
||
* into a hardware-specific series of instructions for loading a pull
|
||
* constant.
|
||
*
|
||
* The expression style allows the CSE pass before this to optimize out
|
||
* repeated loads from the same offset, and gives the pre-register-allocation
|
||
* scheduling full flexibility, while the conversion to native instructions
|
||
* allows the post-register-allocation scheduler the best information
|
||
* possible.
|
||
*
|
||
* Note that execution masking for setting up pull constant loads is special:
|
||
* the channels that need to be written are unrelated to the current execution
|
||
* mask, since a later instruction will use one of the result channels as a
|
||
* source operand for all 8 or 16 of its channels.
|
||
*/
|
||
void
|
||
fs_visitor::lower_uniform_pull_constant_loads()
|
||
{
|
||
foreach_block_and_inst (block, fs_inst, inst, cfg) {
|
||
if (inst->opcode != FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD)
|
||
continue;
|
||
|
||
const fs_reg& surface = inst->src[0];
|
||
const fs_reg& offset_B = inst->src[1];
|
||
assert(offset_B.file == IMM);
|
||
|
||
if (devinfo->has_lsc) {
|
||
const fs_builder ubld =
|
||
fs_builder(this, block, inst).group(8, 0).exec_all();
|
||
|
||
const fs_reg payload = ubld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
ubld.MOV(payload, offset_B);
|
||
|
||
inst->sfid = GFX12_SFID_UGM;
|
||
inst->desc = lsc_msg_desc(devinfo, LSC_OP_LOAD,
|
||
1 /* simd_size */,
|
||
LSC_ADDR_SURFTYPE_BTI,
|
||
LSC_ADDR_SIZE_A32,
|
||
1 /* num_coordinates */,
|
||
LSC_DATA_SIZE_D32,
|
||
inst->size_written / 4,
|
||
true /* transpose */,
|
||
LSC_CACHE_LOAD_L1STATE_L3MOCS,
|
||
true /* has_dest */);
|
||
|
||
fs_reg ex_desc;
|
||
if (surface.file == IMM) {
|
||
ex_desc = brw_imm_ud(lsc_bti_ex_desc(devinfo, surface.ud));
|
||
} else {
|
||
/* We only need the first component for the payload so we can use
|
||
* one of the other components for the extended descriptor
|
||
*/
|
||
ex_desc = component(payload, 1);
|
||
ubld.group(1, 0).SHL(ex_desc, surface, brw_imm_ud(24));
|
||
}
|
||
|
||
/* Update the original instruction. */
|
||
inst->opcode = SHADER_OPCODE_SEND;
|
||
inst->mlen = lsc_msg_desc_src0_len(devinfo, inst->desc);
|
||
inst->ex_mlen = 0;
|
||
inst->header_size = 0;
|
||
inst->send_has_side_effects = false;
|
||
inst->send_is_volatile = true;
|
||
inst->exec_size = 1;
|
||
|
||
/* Finally, the payload */
|
||
inst->resize_sources(3);
|
||
inst->src[0] = brw_imm_ud(0); /* desc */
|
||
inst->src[1] = ex_desc;
|
||
inst->src[2] = payload;
|
||
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
} else if (devinfo->ver >= 7) {
|
||
const fs_builder ubld = fs_builder(this, block, inst).exec_all();
|
||
const fs_reg payload = ubld.group(8, 0).vgrf(BRW_REGISTER_TYPE_UD);
|
||
|
||
ubld.group(8, 0).MOV(payload,
|
||
retype(brw_vec8_grf(0, 0), BRW_REGISTER_TYPE_UD));
|
||
ubld.group(1, 0).MOV(component(payload, 2),
|
||
brw_imm_ud(offset_B.ud / 16));
|
||
|
||
inst->opcode = FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD_GFX7;
|
||
inst->src[1] = payload;
|
||
inst->header_size = 1;
|
||
inst->mlen = 1;
|
||
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
} else {
|
||
/* Before register allocation, we didn't tell the scheduler about the
|
||
* MRF we use. We know it's safe to use this MRF because nothing
|
||
* else does except for register spill/unspill, which generates and
|
||
* uses its MRF within a single IR instruction.
|
||
*/
|
||
inst->base_mrf = FIRST_PULL_LOAD_MRF(devinfo->ver) + 1;
|
||
inst->mlen = 1;
|
||
}
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_visitor::lower_load_payload()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe (block, fs_inst, inst, cfg) {
|
||
if (inst->opcode != SHADER_OPCODE_LOAD_PAYLOAD)
|
||
continue;
|
||
|
||
assert(inst->dst.file == MRF || inst->dst.file == VGRF);
|
||
assert(inst->saturate == false);
|
||
fs_reg dst = inst->dst;
|
||
|
||
/* Get rid of COMPR4. We'll add it back in if we need it */
|
||
if (dst.file == MRF)
|
||
dst.nr = dst.nr & ~BRW_MRF_COMPR4;
|
||
|
||
const fs_builder ibld(this, block, inst);
|
||
const fs_builder ubld = ibld.exec_all();
|
||
|
||
for (uint8_t i = 0; i < inst->header_size;) {
|
||
/* Number of header GRFs to initialize at once with a single MOV
|
||
* instruction.
|
||
*/
|
||
const unsigned n =
|
||
(i + 1 < inst->header_size && inst->src[i].stride == 1 &&
|
||
inst->src[i + 1].equals(byte_offset(inst->src[i], REG_SIZE))) ?
|
||
2 : 1;
|
||
|
||
if (inst->src[i].file != BAD_FILE)
|
||
ubld.group(8 * n, 0).MOV(retype(dst, BRW_REGISTER_TYPE_UD),
|
||
retype(inst->src[i], BRW_REGISTER_TYPE_UD));
|
||
|
||
dst = byte_offset(dst, n * REG_SIZE);
|
||
i += n;
|
||
}
|
||
|
||
if (inst->dst.file == MRF && (inst->dst.nr & BRW_MRF_COMPR4) &&
|
||
inst->exec_size > 8) {
|
||
/* In this case, the payload portion of the LOAD_PAYLOAD isn't
|
||
* a straightforward copy. Instead, the result of the
|
||
* LOAD_PAYLOAD is treated as interleaved and the first four
|
||
* non-header sources are unpacked as:
|
||
*
|
||
* m + 0: r0
|
||
* m + 1: g0
|
||
* m + 2: b0
|
||
* m + 3: a0
|
||
* m + 4: r1
|
||
* m + 5: g1
|
||
* m + 6: b1
|
||
* m + 7: a1
|
||
*
|
||
* This is used for gen <= 5 fb writes.
|
||
*/
|
||
assert(inst->exec_size == 16);
|
||
assert(inst->header_size + 4 <= inst->sources);
|
||
for (uint8_t i = inst->header_size; i < inst->header_size + 4; i++) {
|
||
if (inst->src[i].file != BAD_FILE) {
|
||
if (devinfo->has_compr4) {
|
||
fs_reg compr4_dst = retype(dst, inst->src[i].type);
|
||
compr4_dst.nr |= BRW_MRF_COMPR4;
|
||
ibld.MOV(compr4_dst, inst->src[i]);
|
||
} else {
|
||
/* Platform doesn't have COMPR4. We have to fake it */
|
||
fs_reg mov_dst = retype(dst, inst->src[i].type);
|
||
ibld.quarter(0).MOV(mov_dst, quarter(inst->src[i], 0));
|
||
mov_dst.nr += 4;
|
||
ibld.quarter(1).MOV(mov_dst, quarter(inst->src[i], 1));
|
||
}
|
||
}
|
||
|
||
dst.nr++;
|
||
}
|
||
|
||
/* The loop above only ever incremented us through the first set
|
||
* of 4 registers. However, thanks to the magic of COMPR4, we
|
||
* actually wrote to the first 8 registers, so we need to take
|
||
* that into account now.
|
||
*/
|
||
dst.nr += 4;
|
||
|
||
/* The COMPR4 code took care of the first 4 sources. We'll let
|
||
* the regular path handle any remaining sources. Yes, we are
|
||
* modifying the instruction but we're about to delete it so
|
||
* this really doesn't hurt anything.
|
||
*/
|
||
inst->header_size += 4;
|
||
}
|
||
|
||
for (uint8_t i = inst->header_size; i < inst->sources; i++) {
|
||
dst.type = inst->src[i].type;
|
||
if (inst->src[i].file != BAD_FILE) {
|
||
ibld.MOV(dst, inst->src[i]);
|
||
}
|
||
dst = offset(dst, ibld, 1);
|
||
}
|
||
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
|
||
return progress;
|
||
}
|
||
|
||
void
|
||
fs_visitor::lower_mul_dword_inst(fs_inst *inst, bblock_t *block)
|
||
{
|
||
const fs_builder ibld(this, block, inst);
|
||
|
||
const bool ud = (inst->src[1].type == BRW_REGISTER_TYPE_UD);
|
||
if (inst->src[1].file == IMM &&
|
||
(( ud && inst->src[1].ud <= UINT16_MAX) ||
|
||
(!ud && inst->src[1].d <= INT16_MAX && inst->src[1].d >= INT16_MIN))) {
|
||
/* The MUL instruction isn't commutative. On Gen <= 6, only the low
|
||
* 16-bits of src0 are read, and on Gen >= 7 only the low 16-bits of
|
||
* src1 are used.
|
||
*
|
||
* If multiplying by an immediate value that fits in 16-bits, do a
|
||
* single MUL instruction with that value in the proper location.
|
||
*/
|
||
if (devinfo->ver < 7) {
|
||
fs_reg imm(VGRF, alloc.allocate(dispatch_width / 8), inst->dst.type);
|
||
ibld.MOV(imm, inst->src[1]);
|
||
ibld.MUL(inst->dst, imm, inst->src[0]);
|
||
} else {
|
||
ibld.MUL(inst->dst, inst->src[0],
|
||
ud ? brw_imm_uw(inst->src[1].ud)
|
||
: brw_imm_w(inst->src[1].d));
|
||
}
|
||
} else {
|
||
/* Gen < 8 (and some Gfx8+ low-power parts like Cherryview) cannot
|
||
* do 32-bit integer multiplication in one instruction, but instead
|
||
* must do a sequence (which actually calculates a 64-bit result):
|
||
*
|
||
* mul(8) acc0<1>D g3<8,8,1>D g4<8,8,1>D
|
||
* mach(8) null g3<8,8,1>D g4<8,8,1>D
|
||
* mov(8) g2<1>D acc0<8,8,1>D
|
||
*
|
||
* But on Gen > 6, the ability to use second accumulator register
|
||
* (acc1) for non-float data types was removed, preventing a simple
|
||
* implementation in SIMD16. A 16-channel result can be calculated by
|
||
* executing the three instructions twice in SIMD8, once with quarter
|
||
* control of 1Q for the first eight channels and again with 2Q for
|
||
* the second eight channels.
|
||
*
|
||
* Which accumulator register is implicitly accessed (by AccWrEnable
|
||
* for instance) is determined by the quarter control. Unfortunately
|
||
* Ivybridge (and presumably Baytrail) has a hardware bug in which an
|
||
* implicit accumulator access by an instruction with 2Q will access
|
||
* acc1 regardless of whether the data type is usable in acc1.
|
||
*
|
||
* Specifically, the 2Q mach(8) writes acc1 which does not exist for
|
||
* integer data types.
|
||
*
|
||
* Since we only want the low 32-bits of the result, we can do two
|
||
* 32-bit x 16-bit multiplies (like the mul and mach are doing), and
|
||
* adjust the high result and add them (like the mach is doing):
|
||
*
|
||
* mul(8) g7<1>D g3<8,8,1>D g4.0<8,8,1>UW
|
||
* mul(8) g8<1>D g3<8,8,1>D g4.1<8,8,1>UW
|
||
* shl(8) g9<1>D g8<8,8,1>D 16D
|
||
* add(8) g2<1>D g7<8,8,1>D g8<8,8,1>D
|
||
*
|
||
* We avoid the shl instruction by realizing that we only want to add
|
||
* the low 16-bits of the "high" result to the high 16-bits of the
|
||
* "low" result and using proper regioning on the add:
|
||
*
|
||
* mul(8) g7<1>D g3<8,8,1>D g4.0<16,8,2>UW
|
||
* mul(8) g8<1>D g3<8,8,1>D g4.1<16,8,2>UW
|
||
* add(8) g7.1<2>UW g7.1<16,8,2>UW g8<16,8,2>UW
|
||
*
|
||
* Since it does not use the (single) accumulator register, we can
|
||
* schedule multi-component multiplications much better.
|
||
*/
|
||
|
||
bool needs_mov = false;
|
||
fs_reg orig_dst = inst->dst;
|
||
|
||
/* Get a new VGRF for the "low" 32x16-bit multiplication result if
|
||
* reusing the original destination is impossible due to hardware
|
||
* restrictions, source/destination overlap, or it being the null
|
||
* register.
|
||
*/
|
||
fs_reg low = inst->dst;
|
||
if (orig_dst.is_null() || orig_dst.file == MRF ||
|
||
regions_overlap(inst->dst, inst->size_written,
|
||
inst->src[0], inst->size_read(0)) ||
|
||
regions_overlap(inst->dst, inst->size_written,
|
||
inst->src[1], inst->size_read(1)) ||
|
||
inst->dst.stride >= 4) {
|
||
needs_mov = true;
|
||
low = fs_reg(VGRF, alloc.allocate(regs_written(inst)),
|
||
inst->dst.type);
|
||
}
|
||
|
||
/* Get a new VGRF but keep the same stride as inst->dst */
|
||
fs_reg high(VGRF, alloc.allocate(regs_written(inst)), inst->dst.type);
|
||
high.stride = inst->dst.stride;
|
||
high.offset = inst->dst.offset % REG_SIZE;
|
||
|
||
if (devinfo->ver >= 7) {
|
||
/* From Wa_1604601757:
|
||
*
|
||
* "When multiplying a DW and any lower precision integer, source modifier
|
||
* is not supported."
|
||
*
|
||
* An unsupported negate modifier on src[1] would ordinarily be
|
||
* lowered by the subsequent lower_regioning pass. In this case that
|
||
* pass would spawn another dword multiply. Instead, lower the
|
||
* modifier first.
|
||
*/
|
||
const bool source_mods_unsupported = (devinfo->ver >= 12);
|
||
|
||
if (inst->src[1].abs || (inst->src[1].negate &&
|
||
source_mods_unsupported))
|
||
lower_src_modifiers(this, block, inst, 1);
|
||
|
||
if (inst->src[1].file == IMM) {
|
||
ibld.MUL(low, inst->src[0],
|
||
brw_imm_uw(inst->src[1].ud & 0xffff));
|
||
ibld.MUL(high, inst->src[0],
|
||
brw_imm_uw(inst->src[1].ud >> 16));
|
||
} else {
|
||
ibld.MUL(low, inst->src[0],
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UW, 0));
|
||
ibld.MUL(high, inst->src[0],
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UW, 1));
|
||
}
|
||
} else {
|
||
if (inst->src[0].abs)
|
||
lower_src_modifiers(this, block, inst, 0);
|
||
|
||
ibld.MUL(low, subscript(inst->src[0], BRW_REGISTER_TYPE_UW, 0),
|
||
inst->src[1]);
|
||
ibld.MUL(high, subscript(inst->src[0], BRW_REGISTER_TYPE_UW, 1),
|
||
inst->src[1]);
|
||
}
|
||
|
||
ibld.ADD(subscript(low, BRW_REGISTER_TYPE_UW, 1),
|
||
subscript(low, BRW_REGISTER_TYPE_UW, 1),
|
||
subscript(high, BRW_REGISTER_TYPE_UW, 0));
|
||
|
||
if (needs_mov || inst->conditional_mod)
|
||
set_condmod(inst->conditional_mod, ibld.MOV(orig_dst, low));
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::lower_mul_qword_inst(fs_inst *inst, bblock_t *block)
|
||
{
|
||
const fs_builder ibld(this, block, inst);
|
||
|
||
/* Considering two 64-bit integers ab and cd where each letter ab
|
||
* corresponds to 32 bits, we get a 128-bit result WXYZ. We * cd
|
||
* only need to provide the YZ part of the result. -------
|
||
* BD
|
||
* Only BD needs to be 64 bits. For AD and BC we only care + AD
|
||
* about the lower 32 bits (since they are part of the upper + BC
|
||
* 32 bits of our result). AC is not needed since it starts + AC
|
||
* on the 65th bit of the result. -------
|
||
* WXYZ
|
||
*/
|
||
unsigned int q_regs = regs_written(inst);
|
||
unsigned int d_regs = (q_regs + 1) / 2;
|
||
|
||
fs_reg bd(VGRF, alloc.allocate(q_regs), BRW_REGISTER_TYPE_UQ);
|
||
fs_reg ad(VGRF, alloc.allocate(d_regs), BRW_REGISTER_TYPE_UD);
|
||
fs_reg bc(VGRF, alloc.allocate(d_regs), BRW_REGISTER_TYPE_UD);
|
||
|
||
/* Here we need the full 64 bit result for 32b * 32b. */
|
||
if (devinfo->has_integer_dword_mul) {
|
||
ibld.MUL(bd, subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UD, 0));
|
||
} else {
|
||
fs_reg bd_high(VGRF, alloc.allocate(d_regs), BRW_REGISTER_TYPE_UD);
|
||
fs_reg bd_low(VGRF, alloc.allocate(d_regs), BRW_REGISTER_TYPE_UD);
|
||
fs_reg acc = retype(brw_acc_reg(inst->exec_size), BRW_REGISTER_TYPE_UD);
|
||
|
||
fs_inst *mul = ibld.MUL(acc,
|
||
subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UW, 0));
|
||
mul->writes_accumulator = true;
|
||
|
||
ibld.MACH(bd_high, subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UD, 0));
|
||
ibld.MOV(bd_low, acc);
|
||
|
||
ibld.MOV(subscript(bd, BRW_REGISTER_TYPE_UD, 0), bd_low);
|
||
ibld.MOV(subscript(bd, BRW_REGISTER_TYPE_UD, 1), bd_high);
|
||
}
|
||
|
||
ibld.MUL(ad, subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 1),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UD, 0));
|
||
ibld.MUL(bc, subscript(inst->src[0], BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(inst->src[1], BRW_REGISTER_TYPE_UD, 1));
|
||
|
||
ibld.ADD(ad, ad, bc);
|
||
ibld.ADD(subscript(bd, BRW_REGISTER_TYPE_UD, 1),
|
||
subscript(bd, BRW_REGISTER_TYPE_UD, 1), ad);
|
||
|
||
if (devinfo->has_64bit_int) {
|
||
ibld.MOV(inst->dst, bd);
|
||
} else {
|
||
ibld.MOV(subscript(inst->dst, BRW_REGISTER_TYPE_UD, 0),
|
||
subscript(bd, BRW_REGISTER_TYPE_UD, 0));
|
||
ibld.MOV(subscript(inst->dst, BRW_REGISTER_TYPE_UD, 1),
|
||
subscript(bd, BRW_REGISTER_TYPE_UD, 1));
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::lower_mulh_inst(fs_inst *inst, bblock_t *block)
|
||
{
|
||
const fs_builder ibld(this, block, inst);
|
||
|
||
/* According to the BDW+ BSpec page for the "Multiply Accumulate
|
||
* High" instruction:
|
||
*
|
||
* "An added preliminary mov is required for source modification on
|
||
* src1:
|
||
* mov (8) r3.0<1>:d -r3<8;8,1>:d
|
||
* mul (8) acc0:d r2.0<8;8,1>:d r3.0<16;8,2>:uw
|
||
* mach (8) r5.0<1>:d r2.0<8;8,1>:d r3.0<8;8,1>:d"
|
||
*/
|
||
if (devinfo->ver >= 8 && (inst->src[1].negate || inst->src[1].abs))
|
||
lower_src_modifiers(this, block, inst, 1);
|
||
|
||
/* Should have been lowered to 8-wide. */
|
||
assert(inst->exec_size <= get_lowered_simd_width(compiler, inst));
|
||
const fs_reg acc = retype(brw_acc_reg(inst->exec_size), inst->dst.type);
|
||
fs_inst *mul = ibld.MUL(acc, inst->src[0], inst->src[1]);
|
||
fs_inst *mach = ibld.MACH(inst->dst, inst->src[0], inst->src[1]);
|
||
|
||
if (devinfo->ver >= 8) {
|
||
/* Until Gfx8, integer multiplies read 32-bits from one source,
|
||
* and 16-bits from the other, and relying on the MACH instruction
|
||
* to generate the high bits of the result.
|
||
*
|
||
* On Gfx8, the multiply instruction does a full 32x32-bit
|
||
* multiply, but in order to do a 64-bit multiply we can simulate
|
||
* the previous behavior and then use a MACH instruction.
|
||
*/
|
||
assert(mul->src[1].type == BRW_REGISTER_TYPE_D ||
|
||
mul->src[1].type == BRW_REGISTER_TYPE_UD);
|
||
mul->src[1].type = BRW_REGISTER_TYPE_UW;
|
||
mul->src[1].stride *= 2;
|
||
|
||
if (mul->src[1].file == IMM) {
|
||
mul->src[1] = brw_imm_uw(mul->src[1].ud);
|
||
}
|
||
} else if (devinfo->verx10 == 70 &&
|
||
inst->group > 0) {
|
||
/* Among other things the quarter control bits influence which
|
||
* accumulator register is used by the hardware for instructions
|
||
* that access the accumulator implicitly (e.g. MACH). A
|
||
* second-half instruction would normally map to acc1, which
|
||
* doesn't exist on Gfx7 and up (the hardware does emulate it for
|
||
* floating-point instructions *only* by taking advantage of the
|
||
* extra precision of acc0 not normally used for floating point
|
||
* arithmetic).
|
||
*
|
||
* HSW and up are careful enough not to try to access an
|
||
* accumulator register that doesn't exist, but on earlier Gfx7
|
||
* hardware we need to make sure that the quarter control bits are
|
||
* zero to avoid non-deterministic behaviour and emit an extra MOV
|
||
* to get the result masked correctly according to the current
|
||
* channel enables.
|
||
*/
|
||
mach->group = 0;
|
||
mach->force_writemask_all = true;
|
||
mach->dst = ibld.vgrf(inst->dst.type);
|
||
ibld.MOV(inst->dst, mach->dst);
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_visitor::lower_integer_multiplication()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
if (inst->opcode == BRW_OPCODE_MUL) {
|
||
/* If the instruction is already in a form that does not need lowering,
|
||
* return early.
|
||
*/
|
||
if (devinfo->ver >= 7) {
|
||
if (type_sz(inst->src[1].type) < 4 && type_sz(inst->src[0].type) <= 4)
|
||
continue;
|
||
} else {
|
||
if (type_sz(inst->src[0].type) < 4 && type_sz(inst->src[1].type) <= 4)
|
||
continue;
|
||
}
|
||
|
||
if ((inst->dst.type == BRW_REGISTER_TYPE_Q ||
|
||
inst->dst.type == BRW_REGISTER_TYPE_UQ) &&
|
||
(inst->src[0].type == BRW_REGISTER_TYPE_Q ||
|
||
inst->src[0].type == BRW_REGISTER_TYPE_UQ) &&
|
||
(inst->src[1].type == BRW_REGISTER_TYPE_Q ||
|
||
inst->src[1].type == BRW_REGISTER_TYPE_UQ)) {
|
||
lower_mul_qword_inst(inst, block);
|
||
inst->remove(block);
|
||
progress = true;
|
||
} else if (!inst->dst.is_accumulator() &&
|
||
(inst->dst.type == BRW_REGISTER_TYPE_D ||
|
||
inst->dst.type == BRW_REGISTER_TYPE_UD) &&
|
||
(!devinfo->has_integer_dword_mul ||
|
||
devinfo->verx10 >= 125)) {
|
||
lower_mul_dword_inst(inst, block);
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
} else if (inst->opcode == SHADER_OPCODE_MULH) {
|
||
lower_mulh_inst(inst, block);
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::lower_minmax()
|
||
{
|
||
assert(devinfo->ver < 6);
|
||
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
const fs_builder ibld(this, block, inst);
|
||
|
||
if (inst->opcode == BRW_OPCODE_SEL &&
|
||
inst->predicate == BRW_PREDICATE_NONE) {
|
||
/* If src1 is an immediate value that is not NaN, then it can't be
|
||
* NaN. In that case, emit CMP because it is much better for cmod
|
||
* propagation. Likewise if src1 is not float. Gfx4 and Gfx5 don't
|
||
* support HF or DF, so it is not necessary to check for those.
|
||
*/
|
||
if (inst->src[1].type != BRW_REGISTER_TYPE_F ||
|
||
(inst->src[1].file == IMM && !isnan(inst->src[1].f))) {
|
||
ibld.CMP(ibld.null_reg_d(), inst->src[0], inst->src[1],
|
||
inst->conditional_mod);
|
||
} else {
|
||
ibld.CMPN(ibld.null_reg_d(), inst->src[0], inst->src[1],
|
||
inst->conditional_mod);
|
||
}
|
||
inst->predicate = BRW_PREDICATE_NORMAL;
|
||
inst->conditional_mod = BRW_CONDITIONAL_NONE;
|
||
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
|
||
return progress;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::lower_sub_sat()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
const fs_builder ibld(this, block, inst);
|
||
|
||
if (inst->opcode == SHADER_OPCODE_USUB_SAT ||
|
||
inst->opcode == SHADER_OPCODE_ISUB_SAT) {
|
||
/* The fundamental problem is the hardware performs source negation
|
||
* at the bit width of the source. If the source is 0x80000000D, the
|
||
* negation is 0x80000000D. As a result, subtractSaturate(0,
|
||
* 0x80000000) will produce 0x80000000 instead of 0x7fffffff. There
|
||
* are at least three ways to resolve this:
|
||
*
|
||
* 1. Use the accumulator for the negated source. The accumulator is
|
||
* 33 bits, so our source 0x80000000 is sign-extended to
|
||
* 0x1800000000. The negation of which is 0x080000000. This
|
||
* doesn't help for 64-bit integers (which are already bigger than
|
||
* 33 bits). There are also only 8 accumulators, so SIMD16 or
|
||
* SIMD32 instructions would have to be split into multiple SIMD8
|
||
* instructions.
|
||
*
|
||
* 2. Use slightly different math. For any n-bit value x, we know (x
|
||
* >> 1) != -(x >> 1). We can use this fact to only do
|
||
* subtractions involving (x >> 1). subtractSaturate(a, b) ==
|
||
* subtractSaturate(subtractSaturate(a, (b >> 1)), b - (b >> 1)).
|
||
*
|
||
* 3. For unsigned sources, it is sufficient to replace the
|
||
* subtractSaturate with (a > b) ? a - b : 0.
|
||
*
|
||
* It may also be possible to use the SUBB instruction. This
|
||
* implicitly writes the accumulator, so it could only be used in the
|
||
* same situations as #1 above. It is further limited by only
|
||
* allowing UD sources.
|
||
*/
|
||
if (inst->exec_size == 8 && inst->src[0].type != BRW_REGISTER_TYPE_Q &&
|
||
inst->src[0].type != BRW_REGISTER_TYPE_UQ) {
|
||
fs_reg acc(ARF, BRW_ARF_ACCUMULATOR, inst->src[1].type);
|
||
|
||
ibld.MOV(acc, inst->src[1]);
|
||
fs_inst *add = ibld.ADD(inst->dst, acc, inst->src[0]);
|
||
add->saturate = true;
|
||
add->src[0].negate = true;
|
||
} else if (inst->opcode == SHADER_OPCODE_ISUB_SAT) {
|
||
/* tmp = src1 >> 1;
|
||
* dst = add.sat(add.sat(src0, -tmp), -(src1 - tmp));
|
||
*/
|
||
fs_reg tmp1 = ibld.vgrf(inst->src[0].type);
|
||
fs_reg tmp2 = ibld.vgrf(inst->src[0].type);
|
||
fs_reg tmp3 = ibld.vgrf(inst->src[0].type);
|
||
fs_inst *add;
|
||
|
||
ibld.SHR(tmp1, inst->src[1], brw_imm_d(1));
|
||
|
||
add = ibld.ADD(tmp2, inst->src[1], tmp1);
|
||
add->src[1].negate = true;
|
||
|
||
add = ibld.ADD(tmp3, inst->src[0], tmp1);
|
||
add->src[1].negate = true;
|
||
add->saturate = true;
|
||
|
||
add = ibld.ADD(inst->dst, tmp3, tmp2);
|
||
add->src[1].negate = true;
|
||
add->saturate = true;
|
||
} else {
|
||
/* a > b ? a - b : 0 */
|
||
ibld.CMP(ibld.null_reg_d(), inst->src[0], inst->src[1],
|
||
BRW_CONDITIONAL_G);
|
||
|
||
fs_inst *add = ibld.ADD(inst->dst, inst->src[0], inst->src[1]);
|
||
add->src[1].negate = !add->src[1].negate;
|
||
|
||
ibld.SEL(inst->dst, inst->dst, brw_imm_ud(0))
|
||
->predicate = BRW_PREDICATE_NORMAL;
|
||
}
|
||
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Get the mask of SIMD channels enabled during dispatch and not yet disabled
|
||
* by discard. Due to the layout of the sample mask in the fragment shader
|
||
* thread payload, \p bld is required to have a dispatch_width() not greater
|
||
* than 16 for fragment shaders.
|
||
*/
|
||
fs_reg
|
||
brw_sample_mask_reg(const fs_builder &bld)
|
||
{
|
||
const fs_visitor *v = static_cast<const fs_visitor *>(bld.shader);
|
||
|
||
if (v->stage != MESA_SHADER_FRAGMENT) {
|
||
return brw_imm_ud(0xffffffff);
|
||
} else if (brw_wm_prog_data(v->stage_prog_data)->uses_kill) {
|
||
assert(bld.dispatch_width() <= 16);
|
||
return brw_flag_subreg(sample_mask_flag_subreg(v) + bld.group() / 16);
|
||
} else {
|
||
assert(v->devinfo->ver >= 6 && bld.dispatch_width() <= 16);
|
||
return retype(brw_vec1_grf((bld.group() >= 16 ? 2 : 1), 7),
|
||
BRW_REGISTER_TYPE_UW);
|
||
}
|
||
}
|
||
|
||
uint32_t
|
||
brw_fb_write_msg_control(const fs_inst *inst,
|
||
const struct brw_wm_prog_data *prog_data)
|
||
{
|
||
uint32_t mctl;
|
||
|
||
if (inst->opcode == FS_OPCODE_REP_FB_WRITE) {
|
||
assert(inst->group == 0 && inst->exec_size == 16);
|
||
mctl = BRW_DATAPORT_RENDER_TARGET_WRITE_SIMD16_SINGLE_SOURCE_REPLICATED;
|
||
} else if (prog_data->dual_src_blend) {
|
||
assert(inst->exec_size == 8);
|
||
|
||
if (inst->group % 16 == 0)
|
||
mctl = BRW_DATAPORT_RENDER_TARGET_WRITE_SIMD8_DUAL_SOURCE_SUBSPAN01;
|
||
else if (inst->group % 16 == 8)
|
||
mctl = BRW_DATAPORT_RENDER_TARGET_WRITE_SIMD8_DUAL_SOURCE_SUBSPAN23;
|
||
else
|
||
unreachable("Invalid dual-source FB write instruction group");
|
||
} else {
|
||
assert(inst->group == 0 || (inst->group == 16 && inst->exec_size == 16));
|
||
|
||
if (inst->exec_size == 16)
|
||
mctl = BRW_DATAPORT_RENDER_TARGET_WRITE_SIMD16_SINGLE_SOURCE;
|
||
else if (inst->exec_size == 8)
|
||
mctl = BRW_DATAPORT_RENDER_TARGET_WRITE_SIMD8_SINGLE_SOURCE_SUBSPAN01;
|
||
else
|
||
unreachable("Invalid FB write execution size");
|
||
}
|
||
|
||
return mctl;
|
||
}
|
||
|
||
/**
|
||
* Predicate the specified instruction on the sample mask.
|
||
*/
|
||
void
|
||
brw_emit_predicate_on_sample_mask(const fs_builder &bld, fs_inst *inst)
|
||
{
|
||
assert(bld.shader->stage == MESA_SHADER_FRAGMENT &&
|
||
bld.group() == inst->group &&
|
||
bld.dispatch_width() == inst->exec_size);
|
||
|
||
const fs_visitor *v = static_cast<const fs_visitor *>(bld.shader);
|
||
const fs_reg sample_mask = brw_sample_mask_reg(bld);
|
||
const unsigned subreg = sample_mask_flag_subreg(v);
|
||
|
||
if (brw_wm_prog_data(v->stage_prog_data)->uses_kill) {
|
||
assert(sample_mask.file == ARF &&
|
||
sample_mask.nr == brw_flag_subreg(subreg).nr &&
|
||
sample_mask.subnr == brw_flag_subreg(
|
||
subreg + inst->group / 16).subnr);
|
||
} else {
|
||
bld.group(1, 0).exec_all()
|
||
.MOV(brw_flag_subreg(subreg + inst->group / 16), sample_mask);
|
||
}
|
||
|
||
if (inst->predicate) {
|
||
assert(inst->predicate == BRW_PREDICATE_NORMAL);
|
||
assert(!inst->predicate_inverse);
|
||
assert(inst->flag_subreg == 0);
|
||
/* Combine the sample mask with the existing predicate by using a
|
||
* vertical predication mode.
|
||
*/
|
||
inst->predicate = BRW_PREDICATE_ALIGN1_ALLV;
|
||
} else {
|
||
inst->flag_subreg = subreg;
|
||
inst->predicate = BRW_PREDICATE_NORMAL;
|
||
inst->predicate_inverse = false;
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::emit_is_helper_invocation(fs_reg result)
|
||
{
|
||
/* Unlike the regular gl_HelperInvocation, that is defined at dispatch,
|
||
* the helperInvocationEXT() (aka SpvOpIsHelperInvocationEXT) takes into
|
||
* consideration demoted invocations.
|
||
*/
|
||
result.type = BRW_REGISTER_TYPE_UD;
|
||
|
||
bld.MOV(result, brw_imm_ud(0));
|
||
|
||
/* See brw_sample_mask_reg() for why we split SIMD32 into SIMD16 here. */
|
||
unsigned width = bld.dispatch_width();
|
||
for (unsigned i = 0; i < DIV_ROUND_UP(width, 16); i++) {
|
||
const fs_builder b = bld.group(MIN2(width, 16), i);
|
||
|
||
fs_inst *mov = b.MOV(offset(result, b, i), brw_imm_ud(~0));
|
||
|
||
/* The at() ensures that any code emitted to get the predicate happens
|
||
* before the mov right above. This is not an issue elsewhere because
|
||
* lowering code already set up the builder this way.
|
||
*/
|
||
brw_emit_predicate_on_sample_mask(b.at(NULL, mov), mov);
|
||
mov->predicate_inverse = true;
|
||
}
|
||
}
|
||
|
||
static bool
|
||
is_mixed_float_with_fp32_dst(const fs_inst *inst)
|
||
{
|
||
/* This opcode sometimes uses :W type on the source even if the operand is
|
||
* a :HF, because in gfx7 there is no support for :HF, and thus it uses :W.
|
||
*/
|
||
if (inst->opcode == BRW_OPCODE_F16TO32)
|
||
return true;
|
||
|
||
if (inst->dst.type != BRW_REGISTER_TYPE_F)
|
||
return false;
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].type == BRW_REGISTER_TYPE_HF)
|
||
return true;
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
static bool
|
||
is_mixed_float_with_packed_fp16_dst(const fs_inst *inst)
|
||
{
|
||
/* This opcode sometimes uses :W type on the destination even if the
|
||
* destination is a :HF, because in gfx7 there is no support for :HF, and
|
||
* thus it uses :W.
|
||
*/
|
||
if (inst->opcode == BRW_OPCODE_F32TO16 &&
|
||
inst->dst.stride == 1)
|
||
return true;
|
||
|
||
if (inst->dst.type != BRW_REGISTER_TYPE_HF ||
|
||
inst->dst.stride != 1)
|
||
return false;
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].type == BRW_REGISTER_TYPE_F)
|
||
return true;
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
/**
|
||
* Get the closest allowed SIMD width for instruction \p inst accounting for
|
||
* some common regioning and execution control restrictions that apply to FPU
|
||
* instructions. These restrictions don't necessarily have any relevance to
|
||
* instructions not executed by the FPU pipeline like extended math, control
|
||
* flow or send message instructions.
|
||
*
|
||
* For virtual opcodes it's really up to the instruction -- In some cases
|
||
* (e.g. where a virtual instruction unrolls into a simple sequence of FPU
|
||
* instructions) it may simplify virtual instruction lowering if we can
|
||
* enforce FPU-like regioning restrictions already on the virtual instruction,
|
||
* in other cases (e.g. virtual send-like instructions) this may be
|
||
* excessively restrictive.
|
||
*/
|
||
static unsigned
|
||
get_fpu_lowered_simd_width(const struct brw_compiler *compiler,
|
||
const fs_inst *inst)
|
||
{
|
||
const struct intel_device_info *devinfo = compiler->devinfo;
|
||
|
||
/* Maximum execution size representable in the instruction controls. */
|
||
unsigned max_width = MIN2(32, inst->exec_size);
|
||
|
||
/* According to the PRMs:
|
||
* "A. In Direct Addressing mode, a source cannot span more than 2
|
||
* adjacent GRF registers.
|
||
* B. A destination cannot span more than 2 adjacent GRF registers."
|
||
*
|
||
* Look for the source or destination with the largest register region
|
||
* which is the one that is going to limit the overall execution size of
|
||
* the instruction due to this rule.
|
||
*/
|
||
unsigned reg_count = DIV_ROUND_UP(inst->size_written, REG_SIZE);
|
||
|
||
for (unsigned i = 0; i < inst->sources; i++)
|
||
reg_count = MAX2(reg_count, DIV_ROUND_UP(inst->size_read(i), REG_SIZE));
|
||
|
||
/* Calculate the maximum execution size of the instruction based on the
|
||
* factor by which it goes over the hardware limit of 2 GRFs.
|
||
*/
|
||
if (reg_count > 2)
|
||
max_width = MIN2(max_width, inst->exec_size / DIV_ROUND_UP(reg_count, 2));
|
||
|
||
/* According to the IVB PRMs:
|
||
* "When destination spans two registers, the source MUST span two
|
||
* registers. The exception to the above rule:
|
||
*
|
||
* - When source is scalar, the source registers are not incremented.
|
||
* - When source is packed integer Word and destination is packed
|
||
* integer DWord, the source register is not incremented but the
|
||
* source sub register is incremented."
|
||
*
|
||
* The hardware specs from Gfx4 to Gfx7.5 mention similar regioning
|
||
* restrictions. The code below intentionally doesn't check whether the
|
||
* destination type is integer because empirically the hardware doesn't
|
||
* seem to care what the actual type is as long as it's dword-aligned.
|
||
*/
|
||
if (devinfo->ver < 8) {
|
||
for (unsigned i = 0; i < inst->sources; i++) {
|
||
/* IVB implements DF scalars as <0;2,1> regions. */
|
||
const bool is_scalar_exception = is_uniform(inst->src[i]) &&
|
||
(devinfo->platform == INTEL_PLATFORM_HSW || type_sz(inst->src[i].type) != 8);
|
||
const bool is_packed_word_exception =
|
||
type_sz(inst->dst.type) == 4 && inst->dst.stride == 1 &&
|
||
type_sz(inst->src[i].type) == 2 && inst->src[i].stride == 1;
|
||
|
||
/* We check size_read(i) against size_written instead of REG_SIZE
|
||
* because we want to properly handle SIMD32. In SIMD32, you can end
|
||
* up with writes to 4 registers and a source that reads 2 registers
|
||
* and we may still need to lower all the way to SIMD8 in that case.
|
||
*/
|
||
if (inst->size_written > REG_SIZE &&
|
||
inst->size_read(i) != 0 &&
|
||
inst->size_read(i) < inst->size_written &&
|
||
!is_scalar_exception && !is_packed_word_exception) {
|
||
const unsigned reg_count = DIV_ROUND_UP(inst->size_written, REG_SIZE);
|
||
max_width = MIN2(max_width, inst->exec_size / reg_count);
|
||
}
|
||
}
|
||
}
|
||
|
||
if (devinfo->ver < 6) {
|
||
/* From the G45 PRM, Volume 4 Page 361:
|
||
*
|
||
* "Operand Alignment Rule: With the exceptions listed below, a
|
||
* source/destination operand in general should be aligned to even
|
||
* 256-bit physical register with a region size equal to two 256-bit
|
||
* physical registers."
|
||
*
|
||
* Normally we enforce this by allocating virtual registers to the
|
||
* even-aligned class. But we need to handle payload registers.
|
||
*/
|
||
for (unsigned i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].file == FIXED_GRF && (inst->src[i].nr & 1) &&
|
||
inst->size_read(i) > REG_SIZE) {
|
||
max_width = MIN2(max_width, 8);
|
||
}
|
||
}
|
||
}
|
||
|
||
/* From the IVB PRMs:
|
||
* "When an instruction is SIMD32, the low 16 bits of the execution mask
|
||
* are applied for both halves of the SIMD32 instruction. If different
|
||
* execution mask channels are required, split the instruction into two
|
||
* SIMD16 instructions."
|
||
*
|
||
* There is similar text in the HSW PRMs. Gfx4-6 don't even implement
|
||
* 32-wide control flow support in hardware and will behave similarly.
|
||
*/
|
||
if (devinfo->ver < 8 && !inst->force_writemask_all)
|
||
max_width = MIN2(max_width, 16);
|
||
|
||
/* From the IVB PRMs (applies to HSW too):
|
||
* "Instructions with condition modifiers must not use SIMD32."
|
||
*
|
||
* From the BDW PRMs (applies to later hardware too):
|
||
* "Ternary instruction with condition modifiers must not use SIMD32."
|
||
*/
|
||
if (inst->conditional_mod && (devinfo->ver < 8 || inst->is_3src(compiler)))
|
||
max_width = MIN2(max_width, 16);
|
||
|
||
/* From the IVB PRMs (applies to other devices that don't have the
|
||
* intel_device_info::supports_simd16_3src flag set):
|
||
* "In Align16 access mode, SIMD16 is not allowed for DW operations and
|
||
* SIMD8 is not allowed for DF operations."
|
||
*/
|
||
if (inst->is_3src(compiler) && !devinfo->supports_simd16_3src)
|
||
max_width = MIN2(max_width, inst->exec_size / reg_count);
|
||
|
||
/* Pre-Gfx8 EUs are hardwired to use the QtrCtrl+1 (where QtrCtrl is
|
||
* the 8-bit quarter of the execution mask signals specified in the
|
||
* instruction control fields) for the second compressed half of any
|
||
* single-precision instruction (for double-precision instructions
|
||
* it's hardwired to use NibCtrl+1, at least on HSW), which means that
|
||
* the EU will apply the wrong execution controls for the second
|
||
* sequential GRF write if the number of channels per GRF is not exactly
|
||
* eight in single-precision mode (or four in double-float mode).
|
||
*
|
||
* In this situation we calculate the maximum size of the split
|
||
* instructions so they only ever write to a single register.
|
||
*/
|
||
if (devinfo->ver < 8 && inst->size_written > REG_SIZE &&
|
||
!inst->force_writemask_all) {
|
||
const unsigned channels_per_grf = inst->exec_size /
|
||
DIV_ROUND_UP(inst->size_written, REG_SIZE);
|
||
const unsigned exec_type_size = get_exec_type_size(inst);
|
||
assert(exec_type_size);
|
||
|
||
/* The hardware shifts exactly 8 channels per compressed half of the
|
||
* instruction in single-precision mode and exactly 4 in double-precision.
|
||
*/
|
||
if (channels_per_grf != (exec_type_size == 8 ? 4 : 8))
|
||
max_width = MIN2(max_width, channels_per_grf);
|
||
|
||
/* Lower all non-force_writemask_all DF instructions to SIMD4 on IVB/BYT
|
||
* because HW applies the same channel enable signals to both halves of
|
||
* the compressed instruction which will be just wrong under
|
||
* non-uniform control flow.
|
||
*/
|
||
if (devinfo->verx10 == 70 &&
|
||
(exec_type_size == 8 || type_sz(inst->dst.type) == 8))
|
||
max_width = MIN2(max_width, 4);
|
||
}
|
||
|
||
/* From the SKL PRM, Special Restrictions for Handling Mixed Mode
|
||
* Float Operations:
|
||
*
|
||
* "No SIMD16 in mixed mode when destination is f32. Instruction
|
||
* execution size must be no more than 8."
|
||
*
|
||
* FIXME: the simulator doesn't seem to complain if we don't do this and
|
||
* empirical testing with existing CTS tests show that they pass just fine
|
||
* without implementing this, however, since our interpretation of the PRM
|
||
* is that conversion MOVs between HF and F are still mixed-float
|
||
* instructions (and therefore subject to this restriction) we decided to
|
||
* split them to be safe. Might be useful to do additional investigation to
|
||
* lift the restriction if we can ensure that it is safe though, since these
|
||
* conversions are common when half-float types are involved since many
|
||
* instructions do not support HF types and conversions from/to F are
|
||
* required.
|
||
*/
|
||
if (is_mixed_float_with_fp32_dst(inst))
|
||
max_width = MIN2(max_width, 8);
|
||
|
||
/* From the SKL PRM, Special Restrictions for Handling Mixed Mode
|
||
* Float Operations:
|
||
*
|
||
* "No SIMD16 in mixed mode when destination is packed f16 for both
|
||
* Align1 and Align16."
|
||
*/
|
||
if (is_mixed_float_with_packed_fp16_dst(inst))
|
||
max_width = MIN2(max_width, 8);
|
||
|
||
/* Only power-of-two execution sizes are representable in the instruction
|
||
* control fields.
|
||
*/
|
||
return 1 << util_logbase2(max_width);
|
||
}
|
||
|
||
/**
|
||
* Get the maximum allowed SIMD width for instruction \p inst accounting for
|
||
* various payload size restrictions that apply to sampler message
|
||
* instructions.
|
||
*
|
||
* This is only intended to provide a maximum theoretical bound for the
|
||
* execution size of the message based on the number of argument components
|
||
* alone, which in most cases will determine whether the SIMD8 or SIMD16
|
||
* variant of the message can be used, though some messages may have
|
||
* additional restrictions not accounted for here (e.g. pre-ILK hardware uses
|
||
* the message length to determine the exact SIMD width and argument count,
|
||
* which makes a number of sampler message combinations impossible to
|
||
* represent).
|
||
*/
|
||
static unsigned
|
||
get_sampler_lowered_simd_width(const struct intel_device_info *devinfo,
|
||
const fs_inst *inst)
|
||
{
|
||
/* If we have a min_lod parameter on anything other than a simple sample
|
||
* message, it will push it over 5 arguments and we have to fall back to
|
||
* SIMD8.
|
||
*/
|
||
if (inst->opcode != SHADER_OPCODE_TEX &&
|
||
inst->components_read(TEX_LOGICAL_SRC_MIN_LOD))
|
||
return 8;
|
||
|
||
/* Calculate the number of coordinate components that have to be present
|
||
* assuming that additional arguments follow the texel coordinates in the
|
||
* message payload. On IVB+ there is no need for padding, on ILK-SNB we
|
||
* need to pad to four or three components depending on the message,
|
||
* pre-ILK we need to pad to at most three components.
|
||
*/
|
||
const unsigned req_coord_components =
|
||
(devinfo->ver >= 7 ||
|
||
!inst->components_read(TEX_LOGICAL_SRC_COORDINATE)) ? 0 :
|
||
(devinfo->ver >= 5 && inst->opcode != SHADER_OPCODE_TXF_LOGICAL &&
|
||
inst->opcode != SHADER_OPCODE_TXF_CMS_LOGICAL) ? 4 :
|
||
3;
|
||
|
||
/* On Gfx9+ the LOD argument is for free if we're able to use the LZ
|
||
* variant of the TXL or TXF message.
|
||
*/
|
||
const bool implicit_lod = devinfo->ver >= 9 &&
|
||
(inst->opcode == SHADER_OPCODE_TXL ||
|
||
inst->opcode == SHADER_OPCODE_TXF) &&
|
||
inst->src[TEX_LOGICAL_SRC_LOD].is_zero();
|
||
|
||
/* Calculate the total number of argument components that need to be passed
|
||
* to the sampler unit.
|
||
*/
|
||
const unsigned num_payload_components =
|
||
MAX2(inst->components_read(TEX_LOGICAL_SRC_COORDINATE),
|
||
req_coord_components) +
|
||
inst->components_read(TEX_LOGICAL_SRC_SHADOW_C) +
|
||
(implicit_lod ? 0 : inst->components_read(TEX_LOGICAL_SRC_LOD)) +
|
||
inst->components_read(TEX_LOGICAL_SRC_LOD2) +
|
||
inst->components_read(TEX_LOGICAL_SRC_SAMPLE_INDEX) +
|
||
(inst->opcode == SHADER_OPCODE_TG4_OFFSET_LOGICAL ?
|
||
inst->components_read(TEX_LOGICAL_SRC_TG4_OFFSET) : 0) +
|
||
inst->components_read(TEX_LOGICAL_SRC_MCS);
|
||
|
||
/* SIMD16 messages with more than five arguments exceed the maximum message
|
||
* size supported by the sampler, regardless of whether a header is
|
||
* provided or not.
|
||
*/
|
||
return MIN2(inst->exec_size,
|
||
num_payload_components > MAX_SAMPLER_MESSAGE_SIZE / 2 ? 8 : 16);
|
||
}
|
||
|
||
/**
|
||
* Get the closest native SIMD width supported by the hardware for instruction
|
||
* \p inst. The instruction will be left untouched by
|
||
* fs_visitor::lower_simd_width() if the returned value is equal to the
|
||
* original execution size.
|
||
*/
|
||
static unsigned
|
||
get_lowered_simd_width(const struct brw_compiler *compiler,
|
||
const fs_inst *inst)
|
||
{
|
||
const struct intel_device_info *devinfo = compiler->devinfo;
|
||
|
||
switch (inst->opcode) {
|
||
case BRW_OPCODE_MOV:
|
||
case BRW_OPCODE_SEL:
|
||
case BRW_OPCODE_NOT:
|
||
case BRW_OPCODE_AND:
|
||
case BRW_OPCODE_OR:
|
||
case BRW_OPCODE_XOR:
|
||
case BRW_OPCODE_SHR:
|
||
case BRW_OPCODE_SHL:
|
||
case BRW_OPCODE_ASR:
|
||
case BRW_OPCODE_ROR:
|
||
case BRW_OPCODE_ROL:
|
||
case BRW_OPCODE_CMPN:
|
||
case BRW_OPCODE_CSEL:
|
||
case BRW_OPCODE_F32TO16:
|
||
case BRW_OPCODE_F16TO32:
|
||
case BRW_OPCODE_BFREV:
|
||
case BRW_OPCODE_BFE:
|
||
case BRW_OPCODE_ADD:
|
||
case BRW_OPCODE_MUL:
|
||
case BRW_OPCODE_AVG:
|
||
case BRW_OPCODE_FRC:
|
||
case BRW_OPCODE_RNDU:
|
||
case BRW_OPCODE_RNDD:
|
||
case BRW_OPCODE_RNDE:
|
||
case BRW_OPCODE_RNDZ:
|
||
case BRW_OPCODE_LZD:
|
||
case BRW_OPCODE_FBH:
|
||
case BRW_OPCODE_FBL:
|
||
case BRW_OPCODE_CBIT:
|
||
case BRW_OPCODE_SAD2:
|
||
case BRW_OPCODE_MAD:
|
||
case BRW_OPCODE_LRP:
|
||
case BRW_OPCODE_ADD3:
|
||
case FS_OPCODE_PACK:
|
||
case SHADER_OPCODE_SEL_EXEC:
|
||
case SHADER_OPCODE_CLUSTER_BROADCAST:
|
||
case SHADER_OPCODE_MOV_RELOC_IMM:
|
||
return get_fpu_lowered_simd_width(compiler, inst);
|
||
|
||
case BRW_OPCODE_CMP: {
|
||
/* The Ivybridge/BayTrail WaCMPInstFlagDepClearedEarly workaround says that
|
||
* when the destination is a GRF the dependency-clear bit on the flag
|
||
* register is cleared early.
|
||
*
|
||
* Suggested workarounds are to disable coissuing CMP instructions
|
||
* or to split CMP(16) instructions into two CMP(8) instructions.
|
||
*
|
||
* We choose to split into CMP(8) instructions since disabling
|
||
* coissuing would affect CMP instructions not otherwise affected by
|
||
* the errata.
|
||
*/
|
||
const unsigned max_width = (devinfo->verx10 == 70 &&
|
||
!inst->dst.is_null() ? 8 : ~0);
|
||
return MIN2(max_width, get_fpu_lowered_simd_width(compiler, inst));
|
||
}
|
||
case BRW_OPCODE_BFI1:
|
||
case BRW_OPCODE_BFI2:
|
||
/* The Haswell WaForceSIMD8ForBFIInstruction workaround says that we
|
||
* should
|
||
* "Force BFI instructions to be executed always in SIMD8."
|
||
*/
|
||
return MIN2(devinfo->platform == INTEL_PLATFORM_HSW ? 8 : ~0u,
|
||
get_fpu_lowered_simd_width(compiler, inst));
|
||
|
||
case BRW_OPCODE_IF:
|
||
assert(inst->src[0].file == BAD_FILE || inst->exec_size <= 16);
|
||
return inst->exec_size;
|
||
|
||
case SHADER_OPCODE_RCP:
|
||
case SHADER_OPCODE_RSQ:
|
||
case SHADER_OPCODE_SQRT:
|
||
case SHADER_OPCODE_EXP2:
|
||
case SHADER_OPCODE_LOG2:
|
||
case SHADER_OPCODE_SIN:
|
||
case SHADER_OPCODE_COS: {
|
||
/* Unary extended math instructions are limited to SIMD8 on Gfx4 and
|
||
* Gfx6. Extended Math Function is limited to SIMD8 with half-float.
|
||
*/
|
||
if (devinfo->ver == 6 || devinfo->verx10 == 40)
|
||
return MIN2(8, inst->exec_size);
|
||
if (inst->dst.type == BRW_REGISTER_TYPE_HF)
|
||
return MIN2(8, inst->exec_size);
|
||
return MIN2(16, inst->exec_size);
|
||
}
|
||
|
||
case SHADER_OPCODE_POW: {
|
||
/* SIMD16 is only allowed on Gfx7+. Extended Math Function is limited
|
||
* to SIMD8 with half-float
|
||
*/
|
||
if (devinfo->ver < 7)
|
||
return MIN2(8, inst->exec_size);
|
||
if (inst->dst.type == BRW_REGISTER_TYPE_HF)
|
||
return MIN2(8, inst->exec_size);
|
||
return MIN2(16, inst->exec_size);
|
||
}
|
||
|
||
case SHADER_OPCODE_USUB_SAT:
|
||
case SHADER_OPCODE_ISUB_SAT:
|
||
return get_fpu_lowered_simd_width(compiler, inst);
|
||
|
||
case SHADER_OPCODE_INT_QUOTIENT:
|
||
case SHADER_OPCODE_INT_REMAINDER:
|
||
/* Integer division is limited to SIMD8 on all generations. */
|
||
return MIN2(8, inst->exec_size);
|
||
|
||
case FS_OPCODE_LINTERP:
|
||
case SHADER_OPCODE_GET_BUFFER_SIZE:
|
||
case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD:
|
||
case FS_OPCODE_PACK_HALF_2x16_SPLIT:
|
||
case FS_OPCODE_INTERPOLATE_AT_SAMPLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET:
|
||
case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET:
|
||
return MIN2(16, inst->exec_size);
|
||
|
||
case FS_OPCODE_VARYING_PULL_CONSTANT_LOAD_LOGICAL:
|
||
/* Pre-ILK hardware doesn't have a SIMD8 variant of the texel fetch
|
||
* message used to implement varying pull constant loads, so expand it
|
||
* to SIMD16. An alternative with longer message payload length but
|
||
* shorter return payload would be to use the SIMD8 sampler message that
|
||
* takes (header, u, v, r) as parameters instead of (header, u).
|
||
*/
|
||
return (devinfo->ver == 4 ? 16 : MIN2(16, inst->exec_size));
|
||
|
||
case FS_OPCODE_DDX_COARSE:
|
||
case FS_OPCODE_DDX_FINE:
|
||
case FS_OPCODE_DDY_COARSE:
|
||
case FS_OPCODE_DDY_FINE:
|
||
/* The implementation of this virtual opcode may require emitting
|
||
* compressed Align16 instructions, which are severely limited on some
|
||
* generations.
|
||
*
|
||
* From the Ivy Bridge PRM, volume 4 part 3, section 3.3.9 (Register
|
||
* Region Restrictions):
|
||
*
|
||
* "In Align16 access mode, SIMD16 is not allowed for DW operations
|
||
* and SIMD8 is not allowed for DF operations."
|
||
*
|
||
* In this context, "DW operations" means "operations acting on 32-bit
|
||
* values", so it includes operations on floats.
|
||
*
|
||
* Gfx4 has a similar restriction. From the i965 PRM, section 11.5.3
|
||
* (Instruction Compression -> Rules and Restrictions):
|
||
*
|
||
* "A compressed instruction must be in Align1 access mode. Align16
|
||
* mode instructions cannot be compressed."
|
||
*
|
||
* Similar text exists in the g45 PRM.
|
||
*
|
||
* Empirically, compressed align16 instructions using odd register
|
||
* numbers don't appear to work on Sandybridge either.
|
||
*/
|
||
return (devinfo->ver == 4 || devinfo->ver == 6 ||
|
||
(devinfo->verx10 == 70) ?
|
||
MIN2(8, inst->exec_size) : MIN2(16, inst->exec_size));
|
||
|
||
case SHADER_OPCODE_MULH:
|
||
/* MULH is lowered to the MUL/MACH sequence using the accumulator, which
|
||
* is 8-wide on Gfx7+.
|
||
*/
|
||
return (devinfo->ver >= 7 ? 8 :
|
||
get_fpu_lowered_simd_width(compiler, inst));
|
||
|
||
case FS_OPCODE_FB_WRITE_LOGICAL:
|
||
/* Gfx6 doesn't support SIMD16 depth writes but we cannot handle them
|
||
* here.
|
||
*/
|
||
assert(devinfo->ver != 6 ||
|
||
inst->src[FB_WRITE_LOGICAL_SRC_SRC_DEPTH].file == BAD_FILE ||
|
||
inst->exec_size == 8);
|
||
/* Dual-source FB writes are unsupported in SIMD16 mode. */
|
||
return (inst->src[FB_WRITE_LOGICAL_SRC_COLOR1].file != BAD_FILE ?
|
||
8 : MIN2(16, inst->exec_size));
|
||
|
||
case FS_OPCODE_FB_READ_LOGICAL:
|
||
return MIN2(16, inst->exec_size);
|
||
|
||
case SHADER_OPCODE_TEX_LOGICAL:
|
||
case SHADER_OPCODE_TXF_CMS_LOGICAL:
|
||
case SHADER_OPCODE_TXF_UMS_LOGICAL:
|
||
case SHADER_OPCODE_TXF_MCS_LOGICAL:
|
||
case SHADER_OPCODE_LOD_LOGICAL:
|
||
case SHADER_OPCODE_TG4_LOGICAL:
|
||
case SHADER_OPCODE_SAMPLEINFO_LOGICAL:
|
||
case SHADER_OPCODE_TXF_CMS_W_LOGICAL:
|
||
case SHADER_OPCODE_TG4_OFFSET_LOGICAL:
|
||
return get_sampler_lowered_simd_width(devinfo, inst);
|
||
|
||
/* On gfx12 parameters are fixed to 16-bit values and therefore they all
|
||
* always fit regardless of the execution size.
|
||
*/
|
||
case SHADER_OPCODE_TXF_CMS_W_GFX12_LOGICAL:
|
||
return MIN2(16, inst->exec_size);
|
||
|
||
case SHADER_OPCODE_TXD_LOGICAL:
|
||
/* TXD is unsupported in SIMD16 mode. */
|
||
return 8;
|
||
|
||
case SHADER_OPCODE_TXL_LOGICAL:
|
||
case FS_OPCODE_TXB_LOGICAL:
|
||
/* Only one execution size is representable pre-ILK depending on whether
|
||
* the shadow reference argument is present.
|
||
*/
|
||
if (devinfo->ver == 4)
|
||
return inst->src[TEX_LOGICAL_SRC_SHADOW_C].file == BAD_FILE ? 16 : 8;
|
||
else
|
||
return get_sampler_lowered_simd_width(devinfo, inst);
|
||
|
||
case SHADER_OPCODE_TXF_LOGICAL:
|
||
case SHADER_OPCODE_TXS_LOGICAL:
|
||
/* Gfx4 doesn't have SIMD8 variants for the RESINFO and LD-with-LOD
|
||
* messages. Use SIMD16 instead.
|
||
*/
|
||
if (devinfo->ver == 4)
|
||
return 16;
|
||
else
|
||
return get_sampler_lowered_simd_width(devinfo, inst);
|
||
|
||
case SHADER_OPCODE_TYPED_ATOMIC_LOGICAL:
|
||
case SHADER_OPCODE_TYPED_SURFACE_READ_LOGICAL:
|
||
case SHADER_OPCODE_TYPED_SURFACE_WRITE_LOGICAL:
|
||
return 8;
|
||
|
||
case SHADER_OPCODE_UNTYPED_ATOMIC_LOGICAL:
|
||
case SHADER_OPCODE_UNTYPED_ATOMIC_FLOAT_LOGICAL:
|
||
case SHADER_OPCODE_UNTYPED_SURFACE_READ_LOGICAL:
|
||
case SHADER_OPCODE_UNTYPED_SURFACE_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_BYTE_SCATTERED_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_BYTE_SCATTERED_READ_LOGICAL:
|
||
case SHADER_OPCODE_DWORD_SCATTERED_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_DWORD_SCATTERED_READ_LOGICAL:
|
||
return MIN2(16, inst->exec_size);
|
||
|
||
case SHADER_OPCODE_A64_UNTYPED_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_READ_LOGICAL:
|
||
case SHADER_OPCODE_A64_BYTE_SCATTERED_WRITE_LOGICAL:
|
||
case SHADER_OPCODE_A64_BYTE_SCATTERED_READ_LOGICAL:
|
||
return devinfo->ver <= 8 ? 8 : MIN2(16, inst->exec_size);
|
||
|
||
case SHADER_OPCODE_A64_OWORD_BLOCK_READ_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNALIGNED_OWORD_BLOCK_READ_LOGICAL:
|
||
case SHADER_OPCODE_A64_OWORD_BLOCK_WRITE_LOGICAL:
|
||
assert(inst->exec_size <= 16);
|
||
return inst->exec_size;
|
||
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_INT16_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_INT64_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_FLOAT16_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_FLOAT32_LOGICAL:
|
||
case SHADER_OPCODE_A64_UNTYPED_ATOMIC_FLOAT64_LOGICAL:
|
||
return 8;
|
||
|
||
case SHADER_OPCODE_URB_READ_LOGICAL:
|
||
case SHADER_OPCODE_URB_WRITE_LOGICAL:
|
||
return MIN2(8, inst->exec_size);
|
||
|
||
case SHADER_OPCODE_QUAD_SWIZZLE: {
|
||
const unsigned swiz = inst->src[1].ud;
|
||
return (is_uniform(inst->src[0]) ?
|
||
get_fpu_lowered_simd_width(compiler, inst) :
|
||
devinfo->ver < 11 && type_sz(inst->src[0].type) == 4 ? 8 :
|
||
swiz == BRW_SWIZZLE_XYXY || swiz == BRW_SWIZZLE_ZWZW ? 4 :
|
||
get_fpu_lowered_simd_width(compiler, inst));
|
||
}
|
||
case SHADER_OPCODE_MOV_INDIRECT: {
|
||
/* From IVB and HSW PRMs:
|
||
*
|
||
* "2.When the destination requires two registers and the sources are
|
||
* indirect, the sources must use 1x1 regioning mode.
|
||
*
|
||
* In case of DF instructions in HSW/IVB, the exec_size is limited by
|
||
* the EU decompression logic not handling VxH indirect addressing
|
||
* correctly.
|
||
*/
|
||
const unsigned max_size = (devinfo->ver >= 8 ? 2 : 1) * REG_SIZE;
|
||
/* Prior to Broadwell, we only have 8 address subregisters. */
|
||
return MIN3(devinfo->ver >= 8 ? 16 : 8,
|
||
max_size / (inst->dst.stride * type_sz(inst->dst.type)),
|
||
inst->exec_size);
|
||
}
|
||
|
||
case SHADER_OPCODE_LOAD_PAYLOAD: {
|
||
const unsigned reg_count =
|
||
DIV_ROUND_UP(inst->dst.component_size(inst->exec_size), REG_SIZE);
|
||
|
||
if (reg_count > 2) {
|
||
/* Only LOAD_PAYLOAD instructions with per-channel destination region
|
||
* can be easily lowered (which excludes headers and heterogeneous
|
||
* types).
|
||
*/
|
||
assert(!inst->header_size);
|
||
for (unsigned i = 0; i < inst->sources; i++)
|
||
assert(type_sz(inst->dst.type) == type_sz(inst->src[i].type) ||
|
||
inst->src[i].file == BAD_FILE);
|
||
|
||
return inst->exec_size / DIV_ROUND_UP(reg_count, 2);
|
||
} else {
|
||
return inst->exec_size;
|
||
}
|
||
}
|
||
default:
|
||
return inst->exec_size;
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Return true if splitting out the group of channels of instruction \p inst
|
||
* given by lbld.group() requires allocating a temporary for the i-th source
|
||
* of the lowered instruction.
|
||
*/
|
||
static inline bool
|
||
needs_src_copy(const fs_builder &lbld, const fs_inst *inst, unsigned i)
|
||
{
|
||
return !(is_periodic(inst->src[i], lbld.dispatch_width()) ||
|
||
(inst->components_read(i) == 1 &&
|
||
lbld.dispatch_width() <= inst->exec_size)) ||
|
||
(inst->flags_written(lbld.shader->devinfo) &
|
||
flag_mask(inst->src[i], type_sz(inst->src[i].type)));
|
||
}
|
||
|
||
/**
|
||
* Extract the data that would be consumed by the channel group given by
|
||
* lbld.group() from the i-th source region of instruction \p inst and return
|
||
* it as result in packed form.
|
||
*/
|
||
static fs_reg
|
||
emit_unzip(const fs_builder &lbld, fs_inst *inst, unsigned i)
|
||
{
|
||
assert(lbld.group() >= inst->group);
|
||
|
||
/* Specified channel group from the source region. */
|
||
const fs_reg src = horiz_offset(inst->src[i], lbld.group() - inst->group);
|
||
|
||
if (needs_src_copy(lbld, inst, i)) {
|
||
/* Builder of the right width to perform the copy avoiding uninitialized
|
||
* data if the lowered execution size is greater than the original
|
||
* execution size of the instruction.
|
||
*/
|
||
const fs_builder cbld = lbld.group(MIN2(lbld.dispatch_width(),
|
||
inst->exec_size), 0);
|
||
const fs_reg tmp = lbld.vgrf(inst->src[i].type, inst->components_read(i));
|
||
|
||
for (unsigned k = 0; k < inst->components_read(i); ++k)
|
||
cbld.MOV(offset(tmp, lbld, k), offset(src, inst->exec_size, k));
|
||
|
||
return tmp;
|
||
|
||
} else if (is_periodic(inst->src[i], lbld.dispatch_width())) {
|
||
/* The source is invariant for all dispatch_width-wide groups of the
|
||
* original region.
|
||
*/
|
||
return inst->src[i];
|
||
|
||
} else {
|
||
/* We can just point the lowered instruction at the right channel group
|
||
* from the original region.
|
||
*/
|
||
return src;
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Return true if splitting out the group of channels of instruction \p inst
|
||
* given by lbld.group() requires allocating a temporary for the destination
|
||
* of the lowered instruction and copying the data back to the original
|
||
* destination region.
|
||
*/
|
||
static inline bool
|
||
needs_dst_copy(const fs_builder &lbld, const fs_inst *inst)
|
||
{
|
||
/* If the instruction writes more than one component we'll have to shuffle
|
||
* the results of multiple lowered instructions in order to make sure that
|
||
* they end up arranged correctly in the original destination region.
|
||
*/
|
||
if (inst->size_written > inst->dst.component_size(inst->exec_size))
|
||
return true;
|
||
|
||
/* If the lowered execution size is larger than the original the result of
|
||
* the instruction won't fit in the original destination, so we'll have to
|
||
* allocate a temporary in any case.
|
||
*/
|
||
if (lbld.dispatch_width() > inst->exec_size)
|
||
return true;
|
||
|
||
for (unsigned i = 0; i < inst->sources; i++) {
|
||
/* If we already made a copy of the source for other reasons there won't
|
||
* be any overlap with the destination.
|
||
*/
|
||
if (needs_src_copy(lbld, inst, i))
|
||
continue;
|
||
|
||
/* In order to keep the logic simple we emit a copy whenever the
|
||
* destination region doesn't exactly match an overlapping source, which
|
||
* may point at the source and destination not being aligned group by
|
||
* group which could cause one of the lowered instructions to overwrite
|
||
* the data read from the same source by other lowered instructions.
|
||
*/
|
||
if (regions_overlap(inst->dst, inst->size_written,
|
||
inst->src[i], inst->size_read(i)) &&
|
||
!inst->dst.equals(inst->src[i]))
|
||
return true;
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
/**
|
||
* Insert data from a packed temporary into the channel group given by
|
||
* lbld.group() of the destination region of instruction \p inst and return
|
||
* the temporary as result. Any copy instructions that are required for
|
||
* unzipping the previous value (in the case of partial writes) will be
|
||
* inserted using \p lbld_before and any copy instructions required for
|
||
* zipping up the destination of \p inst will be inserted using \p lbld_after.
|
||
*/
|
||
static fs_reg
|
||
emit_zip(const fs_builder &lbld_before, const fs_builder &lbld_after,
|
||
fs_inst *inst)
|
||
{
|
||
assert(lbld_before.dispatch_width() == lbld_after.dispatch_width());
|
||
assert(lbld_before.group() == lbld_after.group());
|
||
assert(lbld_after.group() >= inst->group);
|
||
|
||
/* Specified channel group from the destination region. */
|
||
const fs_reg dst = horiz_offset(inst->dst, lbld_after.group() - inst->group);
|
||
const unsigned dst_size = inst->size_written /
|
||
inst->dst.component_size(inst->exec_size);
|
||
|
||
if (needs_dst_copy(lbld_after, inst)) {
|
||
const fs_reg tmp = lbld_after.vgrf(inst->dst.type, dst_size);
|
||
|
||
if (inst->predicate) {
|
||
/* Handle predication by copying the original contents of
|
||
* the destination into the temporary before emitting the
|
||
* lowered instruction.
|
||
*/
|
||
const fs_builder gbld_before =
|
||
lbld_before.group(MIN2(lbld_before.dispatch_width(),
|
||
inst->exec_size), 0);
|
||
for (unsigned k = 0; k < dst_size; ++k) {
|
||
gbld_before.MOV(offset(tmp, lbld_before, k),
|
||
offset(dst, inst->exec_size, k));
|
||
}
|
||
}
|
||
|
||
const fs_builder gbld_after =
|
||
lbld_after.group(MIN2(lbld_after.dispatch_width(),
|
||
inst->exec_size), 0);
|
||
for (unsigned k = 0; k < dst_size; ++k) {
|
||
/* Use a builder of the right width to perform the copy avoiding
|
||
* uninitialized data if the lowered execution size is greater than
|
||
* the original execution size of the instruction.
|
||
*/
|
||
gbld_after.MOV(offset(dst, inst->exec_size, k),
|
||
offset(tmp, lbld_after, k));
|
||
}
|
||
|
||
return tmp;
|
||
|
||
} else {
|
||
/* No need to allocate a temporary for the lowered instruction, just
|
||
* take the right group of channels from the original region.
|
||
*/
|
||
return dst;
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_visitor::lower_simd_width()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
const unsigned lower_width = get_lowered_simd_width(compiler, inst);
|
||
|
||
if (lower_width != inst->exec_size) {
|
||
/* Builder matching the original instruction. We may also need to
|
||
* emit an instruction of width larger than the original, set the
|
||
* execution size of the builder to the highest of both for now so
|
||
* we're sure that both cases can be handled.
|
||
*/
|
||
const unsigned max_width = MAX2(inst->exec_size, lower_width);
|
||
const fs_builder ibld = bld.at(block, inst)
|
||
.exec_all(inst->force_writemask_all)
|
||
.group(max_width, inst->group / max_width);
|
||
|
||
/* Split the copies in chunks of the execution width of either the
|
||
* original or the lowered instruction, whichever is lower.
|
||
*/
|
||
const unsigned n = DIV_ROUND_UP(inst->exec_size, lower_width);
|
||
const unsigned dst_size = inst->size_written /
|
||
inst->dst.component_size(inst->exec_size);
|
||
|
||
assert(!inst->writes_accumulator && !inst->mlen);
|
||
|
||
/* Inserting the zip, unzip, and duplicated instructions in all of
|
||
* the right spots is somewhat tricky. All of the unzip and any
|
||
* instructions from the zip which unzip the destination prior to
|
||
* writing need to happen before all of the per-group instructions
|
||
* and the zip instructions need to happen after. In order to sort
|
||
* this all out, we insert the unzip instructions before \p inst,
|
||
* insert the per-group instructions after \p inst (i.e. before
|
||
* inst->next), and insert the zip instructions before the
|
||
* instruction after \p inst. Since we are inserting instructions
|
||
* after \p inst, inst->next is a moving target and we need to save
|
||
* it off here so that we insert the zip instructions in the right
|
||
* place.
|
||
*
|
||
* Since we're inserting split instructions after after_inst, the
|
||
* instructions will end up in the reverse order that we insert them.
|
||
* However, certain render target writes require that the low group
|
||
* instructions come before the high group. From the Ivy Bridge PRM
|
||
* Vol. 4, Pt. 1, Section 3.9.11:
|
||
*
|
||
* "If multiple SIMD8 Dual Source messages are delivered by the
|
||
* pixel shader thread, each SIMD8_DUALSRC_LO message must be
|
||
* issued before the SIMD8_DUALSRC_HI message with the same Slot
|
||
* Group Select setting."
|
||
*
|
||
* And, from Section 3.9.11.1 of the same PRM:
|
||
*
|
||
* "When SIMD32 or SIMD16 PS threads send render target writes
|
||
* with multiple SIMD8 and SIMD16 messages, the following must
|
||
* hold:
|
||
*
|
||
* All the slots (as described above) must have a corresponding
|
||
* render target write irrespective of the slot's validity. A slot
|
||
* is considered valid when at least one sample is enabled. For
|
||
* example, a SIMD16 PS thread must send two SIMD8 render target
|
||
* writes to cover all the slots.
|
||
*
|
||
* PS thread must send SIMD render target write messages with
|
||
* increasing slot numbers. For example, SIMD16 thread has
|
||
* Slot[15:0] and if two SIMD8 render target writes are used, the
|
||
* first SIMD8 render target write must send Slot[7:0] and the
|
||
* next one must send Slot[15:8]."
|
||
*
|
||
* In order to make low group instructions come before high group
|
||
* instructions (this is required for some render target writes), we
|
||
* split from the highest group to lowest.
|
||
*/
|
||
exec_node *const after_inst = inst->next;
|
||
for (int i = n - 1; i >= 0; i--) {
|
||
/* Emit a copy of the original instruction with the lowered width.
|
||
* If the EOT flag was set throw it away except for the last
|
||
* instruction to avoid killing the thread prematurely.
|
||
*/
|
||
fs_inst split_inst = *inst;
|
||
split_inst.exec_size = lower_width;
|
||
split_inst.eot = inst->eot && i == int(n - 1);
|
||
|
||
/* Select the correct channel enables for the i-th group, then
|
||
* transform the sources and destination and emit the lowered
|
||
* instruction.
|
||
*/
|
||
const fs_builder lbld = ibld.group(lower_width, i);
|
||
|
||
for (unsigned j = 0; j < inst->sources; j++)
|
||
split_inst.src[j] = emit_unzip(lbld.at(block, inst), inst, j);
|
||
|
||
split_inst.dst = emit_zip(lbld.at(block, inst),
|
||
lbld.at(block, after_inst), inst);
|
||
split_inst.size_written =
|
||
split_inst.dst.component_size(lower_width) * dst_size;
|
||
|
||
lbld.at(block, inst->next).emit(split_inst);
|
||
}
|
||
|
||
inst->remove(block);
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Transform barycentric vectors into the interleaved form expected by the PLN
|
||
* instruction and returned by the Gfx7+ PI shared function.
|
||
*
|
||
* For channels 0-15 in SIMD16 mode they are expected to be laid out as
|
||
* follows in the register file:
|
||
*
|
||
* rN+0: X[0-7]
|
||
* rN+1: Y[0-7]
|
||
* rN+2: X[8-15]
|
||
* rN+3: Y[8-15]
|
||
*
|
||
* There is no need to handle SIMD32 here -- This is expected to be run after
|
||
* SIMD lowering, since SIMD lowering relies on vectors having the standard
|
||
* component layout.
|
||
*/
|
||
bool
|
||
fs_visitor::lower_barycentrics()
|
||
{
|
||
const bool has_interleaved_layout = devinfo->has_pln || devinfo->ver >= 7;
|
||
bool progress = false;
|
||
|
||
if (stage != MESA_SHADER_FRAGMENT || !has_interleaved_layout)
|
||
return false;
|
||
|
||
foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
|
||
if (inst->exec_size < 16)
|
||
continue;
|
||
|
||
const fs_builder ibld(this, block, inst);
|
||
const fs_builder ubld = ibld.exec_all().group(8, 0);
|
||
|
||
switch (inst->opcode) {
|
||
case FS_OPCODE_LINTERP : {
|
||
assert(inst->exec_size == 16);
|
||
const fs_reg tmp = ibld.vgrf(inst->src[0].type, 2);
|
||
fs_reg srcs[4];
|
||
|
||
for (unsigned i = 0; i < ARRAY_SIZE(srcs); i++)
|
||
srcs[i] = horiz_offset(offset(inst->src[0], ibld, i % 2),
|
||
8 * (i / 2));
|
||
|
||
ubld.LOAD_PAYLOAD(tmp, srcs, ARRAY_SIZE(srcs), ARRAY_SIZE(srcs));
|
||
|
||
inst->src[0] = tmp;
|
||
progress = true;
|
||
break;
|
||
}
|
||
case FS_OPCODE_INTERPOLATE_AT_SAMPLE:
|
||
case FS_OPCODE_INTERPOLATE_AT_SHARED_OFFSET:
|
||
case FS_OPCODE_INTERPOLATE_AT_PER_SLOT_OFFSET: {
|
||
assert(inst->exec_size == 16);
|
||
const fs_reg tmp = ibld.vgrf(inst->dst.type, 2);
|
||
|
||
for (unsigned i = 0; i < 2; i++) {
|
||
for (unsigned g = 0; g < inst->exec_size / 8; g++) {
|
||
fs_inst *mov = ibld.at(block, inst->next).group(8, g)
|
||
.MOV(horiz_offset(offset(inst->dst, ibld, i),
|
||
8 * g),
|
||
offset(tmp, ubld, 2 * g + i));
|
||
mov->predicate = inst->predicate;
|
||
mov->predicate_inverse = inst->predicate_inverse;
|
||
mov->flag_subreg = inst->flag_subreg;
|
||
}
|
||
}
|
||
|
||
inst->dst = tmp;
|
||
progress = true;
|
||
break;
|
||
}
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Lower a derivative instruction as the floating-point difference of two
|
||
* swizzles of the source, specified as \p swz0 and \p swz1.
|
||
*/
|
||
static bool
|
||
lower_derivative(fs_visitor *v, bblock_t *block, fs_inst *inst,
|
||
unsigned swz0, unsigned swz1)
|
||
{
|
||
const fs_builder ibld(v, block, inst);
|
||
const fs_reg tmp0 = ibld.vgrf(inst->src[0].type);
|
||
const fs_reg tmp1 = ibld.vgrf(inst->src[0].type);
|
||
|
||
ibld.emit(SHADER_OPCODE_QUAD_SWIZZLE, tmp0, inst->src[0], brw_imm_ud(swz0));
|
||
ibld.emit(SHADER_OPCODE_QUAD_SWIZZLE, tmp1, inst->src[0], brw_imm_ud(swz1));
|
||
|
||
inst->resize_sources(2);
|
||
inst->src[0] = negate(tmp0);
|
||
inst->src[1] = tmp1;
|
||
inst->opcode = BRW_OPCODE_ADD;
|
||
|
||
return true;
|
||
}
|
||
|
||
/**
|
||
* Lower derivative instructions on platforms where codegen cannot implement
|
||
* them efficiently (i.e. XeHP).
|
||
*/
|
||
bool
|
||
fs_visitor::lower_derivatives()
|
||
{
|
||
bool progress = false;
|
||
|
||
if (devinfo->verx10 < 125)
|
||
return false;
|
||
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
if (inst->opcode == FS_OPCODE_DDX_COARSE)
|
||
progress |= lower_derivative(this, block, inst,
|
||
BRW_SWIZZLE_XXXX, BRW_SWIZZLE_YYYY);
|
||
|
||
else if (inst->opcode == FS_OPCODE_DDX_FINE)
|
||
progress |= lower_derivative(this, block, inst,
|
||
BRW_SWIZZLE_XXZZ, BRW_SWIZZLE_YYWW);
|
||
|
||
else if (inst->opcode == FS_OPCODE_DDY_COARSE)
|
||
progress |= lower_derivative(this, block, inst,
|
||
BRW_SWIZZLE_XXXX, BRW_SWIZZLE_ZZZZ);
|
||
|
||
else if (inst->opcode == FS_OPCODE_DDY_FINE)
|
||
progress |= lower_derivative(this, block, inst,
|
||
BRW_SWIZZLE_XYXY, BRW_SWIZZLE_ZWZW);
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
void
|
||
fs_visitor::dump_instructions() const
|
||
{
|
||
dump_instructions(NULL);
|
||
}
|
||
|
||
void
|
||
fs_visitor::dump_instructions(const char *name) const
|
||
{
|
||
FILE *file = stderr;
|
||
if (name && geteuid() != 0) {
|
||
file = fopen(name, "w");
|
||
if (!file)
|
||
file = stderr;
|
||
}
|
||
|
||
if (cfg) {
|
||
const register_pressure &rp = regpressure_analysis.require();
|
||
unsigned ip = 0, max_pressure = 0;
|
||
foreach_block_and_inst(block, backend_instruction, inst, cfg) {
|
||
max_pressure = MAX2(max_pressure, rp.regs_live_at_ip[ip]);
|
||
fprintf(file, "{%3d} %4d: ", rp.regs_live_at_ip[ip], ip);
|
||
dump_instruction(inst, file);
|
||
ip++;
|
||
}
|
||
fprintf(file, "Maximum %3d registers live at once.\n", max_pressure);
|
||
} else {
|
||
int ip = 0;
|
||
foreach_in_list(backend_instruction, inst, &instructions) {
|
||
fprintf(file, "%4d: ", ip++);
|
||
dump_instruction(inst, file);
|
||
}
|
||
}
|
||
|
||
if (file != stderr) {
|
||
fclose(file);
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::dump_instruction(const backend_instruction *be_inst) const
|
||
{
|
||
dump_instruction(be_inst, stderr);
|
||
}
|
||
|
||
void
|
||
fs_visitor::dump_instruction(const backend_instruction *be_inst, FILE *file) const
|
||
{
|
||
const fs_inst *inst = (const fs_inst *)be_inst;
|
||
|
||
if (inst->predicate) {
|
||
fprintf(file, "(%cf%d.%d) ",
|
||
inst->predicate_inverse ? '-' : '+',
|
||
inst->flag_subreg / 2,
|
||
inst->flag_subreg % 2);
|
||
}
|
||
|
||
fprintf(file, "%s", brw_instruction_name(&compiler->isa, inst->opcode));
|
||
if (inst->saturate)
|
||
fprintf(file, ".sat");
|
||
if (inst->conditional_mod) {
|
||
fprintf(file, "%s", conditional_modifier[inst->conditional_mod]);
|
||
if (!inst->predicate &&
|
||
(devinfo->ver < 5 || (inst->opcode != BRW_OPCODE_SEL &&
|
||
inst->opcode != BRW_OPCODE_CSEL &&
|
||
inst->opcode != BRW_OPCODE_IF &&
|
||
inst->opcode != BRW_OPCODE_WHILE))) {
|
||
fprintf(file, ".f%d.%d", inst->flag_subreg / 2,
|
||
inst->flag_subreg % 2);
|
||
}
|
||
}
|
||
fprintf(file, "(%d) ", inst->exec_size);
|
||
|
||
if (inst->mlen) {
|
||
fprintf(file, "(mlen: %d) ", inst->mlen);
|
||
}
|
||
|
||
if (inst->ex_mlen) {
|
||
fprintf(file, "(ex_mlen: %d) ", inst->ex_mlen);
|
||
}
|
||
|
||
if (inst->eot) {
|
||
fprintf(file, "(EOT) ");
|
||
}
|
||
|
||
switch (inst->dst.file) {
|
||
case VGRF:
|
||
fprintf(file, "vgrf%d", inst->dst.nr);
|
||
break;
|
||
case FIXED_GRF:
|
||
fprintf(file, "g%d", inst->dst.nr);
|
||
break;
|
||
case MRF:
|
||
fprintf(file, "m%d", inst->dst.nr);
|
||
break;
|
||
case BAD_FILE:
|
||
fprintf(file, "(null)");
|
||
break;
|
||
case UNIFORM:
|
||
fprintf(file, "***u%d***", inst->dst.nr);
|
||
break;
|
||
case ATTR:
|
||
fprintf(file, "***attr%d***", inst->dst.nr);
|
||
break;
|
||
case ARF:
|
||
switch (inst->dst.nr) {
|
||
case BRW_ARF_NULL:
|
||
fprintf(file, "null");
|
||
break;
|
||
case BRW_ARF_ADDRESS:
|
||
fprintf(file, "a0.%d", inst->dst.subnr);
|
||
break;
|
||
case BRW_ARF_ACCUMULATOR:
|
||
fprintf(file, "acc%d", inst->dst.subnr);
|
||
break;
|
||
case BRW_ARF_FLAG:
|
||
fprintf(file, "f%d.%d", inst->dst.nr & 0xf, inst->dst.subnr);
|
||
break;
|
||
default:
|
||
fprintf(file, "arf%d.%d", inst->dst.nr & 0xf, inst->dst.subnr);
|
||
break;
|
||
}
|
||
break;
|
||
case IMM:
|
||
unreachable("not reached");
|
||
}
|
||
|
||
if (inst->dst.offset ||
|
||
(inst->dst.file == VGRF &&
|
||
alloc.sizes[inst->dst.nr] * REG_SIZE != inst->size_written)) {
|
||
const unsigned reg_size = (inst->dst.file == UNIFORM ? 4 : REG_SIZE);
|
||
fprintf(file, "+%d.%d", inst->dst.offset / reg_size,
|
||
inst->dst.offset % reg_size);
|
||
}
|
||
|
||
if (inst->dst.stride != 1)
|
||
fprintf(file, "<%u>", inst->dst.stride);
|
||
fprintf(file, ":%s, ", brw_reg_type_to_letters(inst->dst.type));
|
||
|
||
for (int i = 0; i < inst->sources; i++) {
|
||
if (inst->src[i].negate)
|
||
fprintf(file, "-");
|
||
if (inst->src[i].abs)
|
||
fprintf(file, "|");
|
||
switch (inst->src[i].file) {
|
||
case VGRF:
|
||
fprintf(file, "vgrf%d", inst->src[i].nr);
|
||
break;
|
||
case FIXED_GRF:
|
||
fprintf(file, "g%d", inst->src[i].nr);
|
||
break;
|
||
case MRF:
|
||
fprintf(file, "***m%d***", inst->src[i].nr);
|
||
break;
|
||
case ATTR:
|
||
fprintf(file, "attr%d", inst->src[i].nr);
|
||
break;
|
||
case UNIFORM:
|
||
fprintf(file, "u%d", inst->src[i].nr);
|
||
break;
|
||
case BAD_FILE:
|
||
fprintf(file, "(null)");
|
||
break;
|
||
case IMM:
|
||
switch (inst->src[i].type) {
|
||
case BRW_REGISTER_TYPE_HF:
|
||
fprintf(file, "%-ghf", _mesa_half_to_float(inst->src[i].ud & 0xffff));
|
||
break;
|
||
case BRW_REGISTER_TYPE_F:
|
||
fprintf(file, "%-gf", inst->src[i].f);
|
||
break;
|
||
case BRW_REGISTER_TYPE_DF:
|
||
fprintf(file, "%fdf", inst->src[i].df);
|
||
break;
|
||
case BRW_REGISTER_TYPE_W:
|
||
case BRW_REGISTER_TYPE_D:
|
||
fprintf(file, "%dd", inst->src[i].d);
|
||
break;
|
||
case BRW_REGISTER_TYPE_UW:
|
||
case BRW_REGISTER_TYPE_UD:
|
||
fprintf(file, "%uu", inst->src[i].ud);
|
||
break;
|
||
case BRW_REGISTER_TYPE_Q:
|
||
fprintf(file, "%" PRId64 "q", inst->src[i].d64);
|
||
break;
|
||
case BRW_REGISTER_TYPE_UQ:
|
||
fprintf(file, "%" PRIu64 "uq", inst->src[i].u64);
|
||
break;
|
||
case BRW_REGISTER_TYPE_VF:
|
||
fprintf(file, "[%-gF, %-gF, %-gF, %-gF]",
|
||
brw_vf_to_float((inst->src[i].ud >> 0) & 0xff),
|
||
brw_vf_to_float((inst->src[i].ud >> 8) & 0xff),
|
||
brw_vf_to_float((inst->src[i].ud >> 16) & 0xff),
|
||
brw_vf_to_float((inst->src[i].ud >> 24) & 0xff));
|
||
break;
|
||
case BRW_REGISTER_TYPE_V:
|
||
case BRW_REGISTER_TYPE_UV:
|
||
fprintf(file, "%08x%s", inst->src[i].ud,
|
||
inst->src[i].type == BRW_REGISTER_TYPE_V ? "V" : "UV");
|
||
break;
|
||
default:
|
||
fprintf(file, "???");
|
||
break;
|
||
}
|
||
break;
|
||
case ARF:
|
||
switch (inst->src[i].nr) {
|
||
case BRW_ARF_NULL:
|
||
fprintf(file, "null");
|
||
break;
|
||
case BRW_ARF_ADDRESS:
|
||
fprintf(file, "a0.%d", inst->src[i].subnr);
|
||
break;
|
||
case BRW_ARF_ACCUMULATOR:
|
||
fprintf(file, "acc%d", inst->src[i].subnr);
|
||
break;
|
||
case BRW_ARF_FLAG:
|
||
fprintf(file, "f%d.%d", inst->src[i].nr & 0xf, inst->src[i].subnr);
|
||
break;
|
||
default:
|
||
fprintf(file, "arf%d.%d", inst->src[i].nr & 0xf, inst->src[i].subnr);
|
||
break;
|
||
}
|
||
break;
|
||
}
|
||
|
||
if (inst->src[i].offset ||
|
||
(inst->src[i].file == VGRF &&
|
||
alloc.sizes[inst->src[i].nr] * REG_SIZE != inst->size_read(i))) {
|
||
const unsigned reg_size = (inst->src[i].file == UNIFORM ? 4 : REG_SIZE);
|
||
fprintf(file, "+%d.%d", inst->src[i].offset / reg_size,
|
||
inst->src[i].offset % reg_size);
|
||
}
|
||
|
||
if (inst->src[i].abs)
|
||
fprintf(file, "|");
|
||
|
||
if (inst->src[i].file != IMM) {
|
||
unsigned stride;
|
||
if (inst->src[i].file == ARF || inst->src[i].file == FIXED_GRF) {
|
||
unsigned hstride = inst->src[i].hstride;
|
||
stride = (hstride == 0 ? 0 : (1 << (hstride - 1)));
|
||
} else {
|
||
stride = inst->src[i].stride;
|
||
}
|
||
if (stride != 1)
|
||
fprintf(file, "<%u>", stride);
|
||
|
||
fprintf(file, ":%s", brw_reg_type_to_letters(inst->src[i].type));
|
||
}
|
||
|
||
if (i < inst->sources - 1 && inst->src[i + 1].file != BAD_FILE)
|
||
fprintf(file, ", ");
|
||
}
|
||
|
||
fprintf(file, " ");
|
||
|
||
if (inst->force_writemask_all)
|
||
fprintf(file, "NoMask ");
|
||
|
||
if (inst->exec_size != dispatch_width)
|
||
fprintf(file, "group%d ", inst->group);
|
||
|
||
fprintf(file, "\n");
|
||
}
|
||
|
||
void
|
||
fs_visitor::setup_fs_payload_gfx6()
|
||
{
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
struct brw_wm_prog_data *prog_data = brw_wm_prog_data(this->prog_data);
|
||
const unsigned payload_width = MIN2(16, dispatch_width);
|
||
assert(dispatch_width % payload_width == 0);
|
||
assert(devinfo->ver >= 6);
|
||
|
||
/* R0: PS thread payload header. */
|
||
payload.num_regs++;
|
||
|
||
for (unsigned j = 0; j < dispatch_width / payload_width; j++) {
|
||
/* R1: masks, pixel X/Y coordinates. */
|
||
payload.subspan_coord_reg[j] = payload.num_regs++;
|
||
}
|
||
|
||
for (unsigned j = 0; j < dispatch_width / payload_width; j++) {
|
||
/* R3-26: barycentric interpolation coordinates. These appear in the
|
||
* same order that they appear in the brw_barycentric_mode enum. Each
|
||
* set of coordinates occupies 2 registers if dispatch width == 8 and 4
|
||
* registers if dispatch width == 16. Coordinates only appear if they
|
||
* were enabled using the "Barycentric Interpolation Mode" bits in
|
||
* WM_STATE.
|
||
*/
|
||
for (int i = 0; i < BRW_BARYCENTRIC_MODE_COUNT; ++i) {
|
||
if (prog_data->barycentric_interp_modes & (1 << i)) {
|
||
payload.barycentric_coord_reg[i][j] = payload.num_regs;
|
||
payload.num_regs += payload_width / 4;
|
||
}
|
||
}
|
||
|
||
/* R27-28: interpolated depth if uses source depth */
|
||
if (prog_data->uses_src_depth) {
|
||
payload.source_depth_reg[j] = payload.num_regs;
|
||
payload.num_regs += payload_width / 8;
|
||
}
|
||
|
||
/* R29-30: interpolated W set if GFX6_WM_USES_SOURCE_W. */
|
||
if (prog_data->uses_src_w) {
|
||
payload.source_w_reg[j] = payload.num_regs;
|
||
payload.num_regs += payload_width / 8;
|
||
}
|
||
|
||
/* R31: MSAA position offsets. */
|
||
if (prog_data->uses_pos_offset) {
|
||
payload.sample_pos_reg[j] = payload.num_regs;
|
||
payload.num_regs++;
|
||
}
|
||
|
||
/* R32-33: MSAA input coverage mask */
|
||
if (prog_data->uses_sample_mask) {
|
||
assert(devinfo->ver >= 7);
|
||
payload.sample_mask_in_reg[j] = payload.num_regs;
|
||
payload.num_regs += payload_width / 8;
|
||
}
|
||
|
||
/* R66: Source Depth and/or W Attribute Vertex Deltas */
|
||
if (prog_data->uses_depth_w_coefficients) {
|
||
payload.depth_w_coef_reg[j] = payload.num_regs;
|
||
payload.num_regs++;
|
||
}
|
||
}
|
||
|
||
if (nir->info.outputs_written & BITFIELD64_BIT(FRAG_RESULT_DEPTH)) {
|
||
source_depth_to_render_target = true;
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::setup_vs_payload()
|
||
{
|
||
/* R0: thread header, R1: urb handles */
|
||
payload.num_regs = 2;
|
||
}
|
||
|
||
void
|
||
fs_visitor::setup_gs_payload()
|
||
{
|
||
assert(stage == MESA_SHADER_GEOMETRY);
|
||
|
||
struct brw_gs_prog_data *gs_prog_data = brw_gs_prog_data(prog_data);
|
||
struct brw_vue_prog_data *vue_prog_data = brw_vue_prog_data(prog_data);
|
||
|
||
/* R0: thread header, R1: output URB handles */
|
||
payload.num_regs = 2;
|
||
|
||
if (gs_prog_data->include_primitive_id) {
|
||
/* R2: Primitive ID 0..7 */
|
||
payload.num_regs++;
|
||
}
|
||
|
||
/* Always enable VUE handles so we can safely use pull model if needed.
|
||
*
|
||
* The push model for a GS uses a ton of register space even for trivial
|
||
* scenarios with just a few inputs, so just make things easier and a bit
|
||
* safer by always having pull model available.
|
||
*/
|
||
gs_prog_data->base.include_vue_handles = true;
|
||
|
||
/* R3..RN: ICP Handles for each incoming vertex (when using pull model) */
|
||
payload.num_regs += nir->info.gs.vertices_in;
|
||
|
||
/* Use a maximum of 24 registers for push-model inputs. */
|
||
const unsigned max_push_components = 24;
|
||
|
||
/* If pushing our inputs would take too many registers, reduce the URB read
|
||
* length (which is in HWords, or 8 registers), and resort to pulling.
|
||
*
|
||
* Note that the GS reads <URB Read Length> HWords for every vertex - so we
|
||
* have to multiply by VerticesIn to obtain the total storage requirement.
|
||
*/
|
||
if (8 * vue_prog_data->urb_read_length * nir->info.gs.vertices_in >
|
||
max_push_components) {
|
||
vue_prog_data->urb_read_length =
|
||
ROUND_DOWN_TO(max_push_components / nir->info.gs.vertices_in, 8) / 8;
|
||
}
|
||
}
|
||
|
||
void
|
||
fs_visitor::setup_cs_payload()
|
||
{
|
||
assert(devinfo->ver >= 7);
|
||
/* TODO: Fill out uses_btd_stack_ids automatically */
|
||
payload.num_regs = 1 + brw_cs_prog_data(prog_data)->uses_btd_stack_ids;
|
||
}
|
||
|
||
brw::register_pressure::register_pressure(const fs_visitor *v)
|
||
{
|
||
const fs_live_variables &live = v->live_analysis.require();
|
||
const unsigned num_instructions = v->cfg->num_blocks ?
|
||
v->cfg->blocks[v->cfg->num_blocks - 1]->end_ip + 1 : 0;
|
||
|
||
regs_live_at_ip = new unsigned[num_instructions]();
|
||
|
||
for (unsigned reg = 0; reg < v->alloc.count; reg++) {
|
||
for (int ip = live.vgrf_start[reg]; ip <= live.vgrf_end[reg]; ip++)
|
||
regs_live_at_ip[ip] += v->alloc.sizes[reg];
|
||
}
|
||
}
|
||
|
||
brw::register_pressure::~register_pressure()
|
||
{
|
||
delete[] regs_live_at_ip;
|
||
}
|
||
|
||
void
|
||
fs_visitor::invalidate_analysis(brw::analysis_dependency_class c)
|
||
{
|
||
backend_shader::invalidate_analysis(c);
|
||
live_analysis.invalidate(c);
|
||
regpressure_analysis.invalidate(c);
|
||
}
|
||
|
||
void
|
||
fs_visitor::optimize()
|
||
{
|
||
/* Start by validating the shader we currently have. */
|
||
validate();
|
||
|
||
/* bld is the common builder object pointing at the end of the program we
|
||
* used to translate it into i965 IR. For the optimization and lowering
|
||
* passes coming next, any code added after the end of the program without
|
||
* having explicitly called fs_builder::at() clearly points at a mistake.
|
||
* Ideally optimization passes wouldn't be part of the visitor so they
|
||
* wouldn't have access to bld at all, but they do, so just in case some
|
||
* pass forgets to ask for a location explicitly set it to NULL here to
|
||
* make it trip. The dispatch width is initialized to a bogus value to
|
||
* make sure that optimizations set the execution controls explicitly to
|
||
* match the code they are manipulating instead of relying on the defaults.
|
||
*/
|
||
bld = fs_builder(this, 64);
|
||
|
||
assign_constant_locations();
|
||
lower_constant_loads();
|
||
|
||
validate();
|
||
|
||
#define OPT(pass, args...) ({ \
|
||
pass_num++; \
|
||
bool this_progress = pass(args); \
|
||
\
|
||
if (INTEL_DEBUG(DEBUG_OPTIMIZER) && this_progress) { \
|
||
char filename[64]; \
|
||
snprintf(filename, 64, "%s%d-%s-%02d-%02d-" #pass, \
|
||
stage_abbrev, dispatch_width, nir->info.name, iteration, pass_num); \
|
||
\
|
||
backend_shader::dump_instructions(filename); \
|
||
} \
|
||
\
|
||
validate(); \
|
||
\
|
||
progress = progress || this_progress; \
|
||
this_progress; \
|
||
})
|
||
|
||
if (INTEL_DEBUG(DEBUG_OPTIMIZER)) {
|
||
char filename[64];
|
||
snprintf(filename, 64, "%s%d-%s-00-00-start",
|
||
stage_abbrev, dispatch_width, nir->info.name);
|
||
|
||
backend_shader::dump_instructions(filename);
|
||
}
|
||
|
||
bool progress = false;
|
||
int iteration = 0;
|
||
int pass_num = 0;
|
||
|
||
OPT(split_virtual_grfs);
|
||
|
||
/* Before anything else, eliminate dead code. The results of some NIR
|
||
* instructions may effectively be calculated twice. Once when the
|
||
* instruction is encountered, and again when the user of that result is
|
||
* encountered. Wipe those away before algebraic optimizations and
|
||
* especially copy propagation can mix things up.
|
||
*/
|
||
OPT(dead_code_eliminate);
|
||
|
||
OPT(remove_extra_rounding_modes);
|
||
|
||
do {
|
||
progress = false;
|
||
pass_num = 0;
|
||
iteration++;
|
||
|
||
OPT(remove_duplicate_mrf_writes);
|
||
|
||
OPT(opt_algebraic);
|
||
OPT(opt_cse);
|
||
OPT(opt_copy_propagation);
|
||
OPT(opt_predicated_break, this);
|
||
OPT(opt_cmod_propagation);
|
||
OPT(dead_code_eliminate);
|
||
OPT(opt_peephole_sel);
|
||
OPT(dead_control_flow_eliminate, this);
|
||
OPT(opt_register_renaming);
|
||
OPT(opt_saturate_propagation);
|
||
OPT(register_coalesce);
|
||
OPT(compute_to_mrf);
|
||
OPT(eliminate_find_live_channel);
|
||
|
||
OPT(compact_virtual_grfs);
|
||
} while (progress);
|
||
|
||
progress = false;
|
||
pass_num = 0;
|
||
|
||
if (OPT(lower_pack)) {
|
||
OPT(register_coalesce);
|
||
OPT(dead_code_eliminate);
|
||
}
|
||
|
||
OPT(lower_simd_width);
|
||
OPT(lower_barycentrics);
|
||
OPT(lower_logical_sends);
|
||
|
||
/* After logical SEND lowering. */
|
||
OPT(opt_copy_propagation);
|
||
OPT(opt_split_sends);
|
||
OPT(fixup_nomask_control_flow);
|
||
|
||
if (progress) {
|
||
OPT(opt_copy_propagation);
|
||
/* Only run after logical send lowering because it's easier to implement
|
||
* in terms of physical sends.
|
||
*/
|
||
if (OPT(opt_zero_samples))
|
||
OPT(opt_copy_propagation);
|
||
/* Run after logical send lowering to give it a chance to CSE the
|
||
* LOAD_PAYLOAD instructions created to construct the payloads of
|
||
* e.g. texturing messages in cases where it wasn't possible to CSE the
|
||
* whole logical instruction.
|
||
*/
|
||
OPT(opt_cse);
|
||
OPT(register_coalesce);
|
||
OPT(compute_to_mrf);
|
||
OPT(dead_code_eliminate);
|
||
OPT(remove_duplicate_mrf_writes);
|
||
OPT(opt_peephole_sel);
|
||
}
|
||
|
||
OPT(opt_redundant_halt);
|
||
|
||
if (OPT(lower_load_payload)) {
|
||
OPT(split_virtual_grfs);
|
||
|
||
/* Lower 64 bit MOVs generated by payload lowering. */
|
||
if (!devinfo->has_64bit_float && !devinfo->has_64bit_int)
|
||
OPT(opt_algebraic);
|
||
|
||
OPT(register_coalesce);
|
||
OPT(lower_simd_width);
|
||
OPT(compute_to_mrf);
|
||
OPT(dead_code_eliminate);
|
||
}
|
||
|
||
OPT(opt_combine_constants);
|
||
if (OPT(lower_integer_multiplication)) {
|
||
/* If lower_integer_multiplication made progress, it may have produced
|
||
* some 32x32-bit MULs in the process of lowering 64-bit MULs. Run it
|
||
* one more time to clean those up if they exist.
|
||
*/
|
||
OPT(lower_integer_multiplication);
|
||
}
|
||
OPT(lower_sub_sat);
|
||
|
||
if (devinfo->ver <= 5 && OPT(lower_minmax)) {
|
||
OPT(opt_cmod_propagation);
|
||
OPT(opt_cse);
|
||
OPT(opt_copy_propagation);
|
||
OPT(dead_code_eliminate);
|
||
}
|
||
|
||
progress = false;
|
||
OPT(lower_derivatives);
|
||
OPT(lower_regioning);
|
||
if (progress) {
|
||
OPT(opt_copy_propagation);
|
||
OPT(dead_code_eliminate);
|
||
OPT(lower_simd_width);
|
||
}
|
||
|
||
OPT(fixup_sends_duplicate_payload);
|
||
|
||
lower_uniform_pull_constant_loads();
|
||
|
||
validate();
|
||
}
|
||
|
||
/**
|
||
* From the Skylake PRM Vol. 2a docs for sends:
|
||
*
|
||
* "It is required that the second block of GRFs does not overlap with the
|
||
* first block."
|
||
*
|
||
* There are plenty of cases where we may accidentally violate this due to
|
||
* having, for instance, both sources be the constant 0. This little pass
|
||
* just adds a new vgrf for the second payload and copies it over.
|
||
*/
|
||
bool
|
||
fs_visitor::fixup_sends_duplicate_payload()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe (block, fs_inst, inst, cfg) {
|
||
if (inst->opcode == SHADER_OPCODE_SEND && inst->ex_mlen > 0 &&
|
||
regions_overlap(inst->src[2], inst->mlen * REG_SIZE,
|
||
inst->src[3], inst->ex_mlen * REG_SIZE)) {
|
||
fs_reg tmp = fs_reg(VGRF, alloc.allocate(inst->ex_mlen),
|
||
BRW_REGISTER_TYPE_UD);
|
||
/* Sadly, we've lost all notion of channels and bit sizes at this
|
||
* point. Just WE_all it.
|
||
*/
|
||
const fs_builder ibld = bld.at(block, inst).exec_all().group(16, 0);
|
||
fs_reg copy_src = retype(inst->src[3], BRW_REGISTER_TYPE_UD);
|
||
fs_reg copy_dst = tmp;
|
||
for (unsigned i = 0; i < inst->ex_mlen; i += 2) {
|
||
if (inst->ex_mlen == i + 1) {
|
||
/* Only one register left; do SIMD8 */
|
||
ibld.group(8, 0).MOV(copy_dst, copy_src);
|
||
} else {
|
||
ibld.MOV(copy_dst, copy_src);
|
||
}
|
||
copy_src = offset(copy_src, ibld, 1);
|
||
copy_dst = offset(copy_dst, ibld, 1);
|
||
}
|
||
inst->src[3] = tmp;
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
/**
|
||
* Three source instruction must have a GRF/MRF destination register.
|
||
* ARF NULL is not allowed. Fix that up by allocating a temporary GRF.
|
||
*/
|
||
void
|
||
fs_visitor::fixup_3src_null_dest()
|
||
{
|
||
bool progress = false;
|
||
|
||
foreach_block_and_inst_safe (block, fs_inst, inst, cfg) {
|
||
if (inst->is_3src(compiler) && inst->dst.is_null()) {
|
||
inst->dst = fs_reg(VGRF, alloc.allocate(dispatch_width / 8),
|
||
inst->dst.type);
|
||
progress = true;
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTION_DETAIL |
|
||
DEPENDENCY_VARIABLES);
|
||
}
|
||
|
||
static bool
|
||
needs_dummy_fence(const intel_device_info *devinfo, fs_inst *inst)
|
||
{
|
||
/* This workaround is about making sure that any instruction writing
|
||
* through UGM has completed before we hit EOT.
|
||
*
|
||
* The workaround talks about UGM writes or atomic message but what is
|
||
* important is anything that hasn't completed. Usually any SEND
|
||
* instruction that has a destination register will be read by something
|
||
* else so we don't need to care about those as they will be synchronized
|
||
* by other parts of the shader or optimized away. What is left are
|
||
* instructions that don't have a destination register.
|
||
*/
|
||
if (inst->sfid != GFX12_SFID_UGM)
|
||
return false;
|
||
|
||
return inst->dst.file == BAD_FILE;
|
||
}
|
||
|
||
/* Wa_22013689345
|
||
*
|
||
* We need to emit UGM fence message before EOT, if shader has any UGM write
|
||
* or atomic message.
|
||
*
|
||
* TODO/FINISHME: According to Curro we could avoid the fence in some cases.
|
||
* We probably need a better criteria in needs_dummy_fence().
|
||
*/
|
||
void
|
||
fs_visitor::emit_dummy_memory_fence_before_eot()
|
||
{
|
||
bool progress = false;
|
||
bool has_ugm_write_or_atomic = false;
|
||
|
||
if (!intel_device_info_is_dg2(devinfo))
|
||
return;
|
||
|
||
foreach_block_and_inst_safe (block, fs_inst, inst, cfg) {
|
||
if (!inst->eot) {
|
||
if (needs_dummy_fence(devinfo, inst))
|
||
has_ugm_write_or_atomic = true;
|
||
continue;
|
||
}
|
||
|
||
if (!has_ugm_write_or_atomic)
|
||
break;
|
||
|
||
const fs_builder ibld(this, block, inst);
|
||
const fs_builder ubld = ibld.exec_all().group(1, 0);
|
||
|
||
fs_reg dst = ubld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
fs_inst *dummy_fence = ubld.emit(SHADER_OPCODE_MEMORY_FENCE,
|
||
dst, brw_vec8_grf(0, 0),
|
||
/* commit enable */ brw_imm_ud(1),
|
||
/* bti */ brw_imm_ud(0));
|
||
dummy_fence->sfid = GFX12_SFID_UGM;
|
||
dummy_fence->desc = lsc_fence_msg_desc(devinfo, LSC_FENCE_TILE,
|
||
LSC_FLUSH_TYPE_NONE_6, false);
|
||
ubld.emit(FS_OPCODE_SCHEDULING_FENCE, ubld.null_reg_ud(), dst);
|
||
progress = true;
|
||
/* TODO: remove this break if we ever have shader with multiple EOT. */
|
||
break;
|
||
}
|
||
|
||
if (progress) {
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS |
|
||
DEPENDENCY_VARIABLES);
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Find the first instruction in the program that might start a region of
|
||
* divergent control flow due to a HALT jump. There is no
|
||
* find_halt_control_flow_region_end(), the region of divergence extends until
|
||
* the only SHADER_OPCODE_HALT_TARGET in the program.
|
||
*/
|
||
static const fs_inst *
|
||
find_halt_control_flow_region_start(const fs_visitor *v)
|
||
{
|
||
foreach_block_and_inst(block, fs_inst, inst, v->cfg) {
|
||
if (inst->opcode == BRW_OPCODE_HALT ||
|
||
inst->opcode == SHADER_OPCODE_HALT_TARGET)
|
||
return inst;
|
||
}
|
||
|
||
return NULL;
|
||
}
|
||
|
||
/**
|
||
* Work around the Gfx12 hardware bug filed as Wa_1407528679. EU fusion
|
||
* can cause a BB to be executed with all channels disabled, which will lead
|
||
* to the execution of any NoMask instructions in it, even though any
|
||
* execution-masked instructions will be correctly shot down. This may break
|
||
* assumptions of some NoMask SEND messages whose descriptor depends on data
|
||
* generated by live invocations of the shader.
|
||
*
|
||
* This avoids the problem by predicating certain instructions on an ANY
|
||
* horizontal predicate that makes sure that their execution is omitted when
|
||
* all channels of the program are disabled.
|
||
*/
|
||
bool
|
||
fs_visitor::fixup_nomask_control_flow()
|
||
{
|
||
if (devinfo->ver != 12)
|
||
return false;
|
||
|
||
const brw_predicate pred = dispatch_width > 16 ? BRW_PREDICATE_ALIGN1_ANY32H :
|
||
dispatch_width > 8 ? BRW_PREDICATE_ALIGN1_ANY16H :
|
||
BRW_PREDICATE_ALIGN1_ANY8H;
|
||
const fs_inst *halt_start = find_halt_control_flow_region_start(this);
|
||
unsigned depth = 0;
|
||
bool progress = false;
|
||
|
||
const fs_live_variables &live_vars = live_analysis.require();
|
||
|
||
/* Scan the program backwards in order to be able to easily determine
|
||
* whether the flag register is live at any point.
|
||
*/
|
||
foreach_block_reverse_safe(block, cfg) {
|
||
BITSET_WORD flag_liveout = live_vars.block_data[block->num]
|
||
.flag_liveout[0];
|
||
STATIC_ASSERT(ARRAY_SIZE(live_vars.block_data[0].flag_liveout) == 1);
|
||
|
||
foreach_inst_in_block_reverse_safe(fs_inst, inst, block) {
|
||
if (!inst->predicate && inst->exec_size >= 8)
|
||
flag_liveout &= ~inst->flags_written(devinfo);
|
||
|
||
switch (inst->opcode) {
|
||
case BRW_OPCODE_DO:
|
||
case BRW_OPCODE_IF:
|
||
/* Note that this doesn't handle BRW_OPCODE_HALT since only
|
||
* the first one in the program closes the region of divergent
|
||
* control flow due to any HALT instructions -- Instead this is
|
||
* handled with the halt_start check below.
|
||
*/
|
||
depth--;
|
||
break;
|
||
|
||
case BRW_OPCODE_WHILE:
|
||
case BRW_OPCODE_ENDIF:
|
||
case SHADER_OPCODE_HALT_TARGET:
|
||
depth++;
|
||
break;
|
||
|
||
default:
|
||
/* Note that the vast majority of NoMask SEND instructions in the
|
||
* program are harmless while executed in a block with all
|
||
* channels disabled, since any instructions with side effects we
|
||
* could hit here should be execution-masked.
|
||
*
|
||
* The main concern is NoMask SEND instructions where the message
|
||
* descriptor or header depends on data generated by live
|
||
* invocations of the shader (RESINFO and
|
||
* FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD with a dynamically
|
||
* computed surface index seem to be the only examples right now
|
||
* where this could easily lead to GPU hangs). Unfortunately we
|
||
* have no straightforward way to detect that currently, so just
|
||
* predicate any NoMask SEND instructions we find under control
|
||
* flow.
|
||
*
|
||
* If this proves to have a measurable performance impact it can
|
||
* be easily extended with a whitelist of messages we know we can
|
||
* safely omit the predication for.
|
||
*/
|
||
if (depth && inst->force_writemask_all &&
|
||
is_send(inst) && !inst->predicate) {
|
||
/* We need to load the execution mask into the flag register by
|
||
* using a builder with channel group matching the whole shader
|
||
* (rather than the default which is derived from the original
|
||
* instruction), in order to avoid getting a right-shifted
|
||
* value.
|
||
*/
|
||
const fs_builder ubld = fs_builder(this, block, inst)
|
||
.exec_all().group(dispatch_width, 0);
|
||
const fs_reg flag = retype(brw_flag_reg(0, 0),
|
||
BRW_REGISTER_TYPE_UD);
|
||
|
||
/* Due to the lack of flag register allocation we need to save
|
||
* and restore the flag register if it's live.
|
||
*/
|
||
const bool save_flag = flag_liveout &
|
||
flag_mask(flag, dispatch_width / 8);
|
||
const fs_reg tmp = ubld.group(1, 0).vgrf(flag.type);
|
||
|
||
if (save_flag)
|
||
ubld.group(1, 0).MOV(tmp, flag);
|
||
|
||
ubld.emit(FS_OPCODE_LOAD_LIVE_CHANNELS);
|
||
|
||
set_predicate(pred, inst);
|
||
inst->flag_subreg = 0;
|
||
|
||
if (save_flag)
|
||
ubld.group(1, 0).at(block, inst->next).MOV(flag, tmp);
|
||
|
||
progress = true;
|
||
}
|
||
break;
|
||
}
|
||
|
||
if (inst == halt_start)
|
||
depth--;
|
||
|
||
flag_liveout |= inst->flags_read(devinfo);
|
||
}
|
||
}
|
||
|
||
if (progress)
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS | DEPENDENCY_VARIABLES);
|
||
|
||
return progress;
|
||
}
|
||
|
||
void
|
||
fs_visitor::allocate_registers(bool allow_spilling)
|
||
{
|
||
bool allocated;
|
||
|
||
static const enum instruction_scheduler_mode pre_modes[] = {
|
||
SCHEDULE_PRE,
|
||
SCHEDULE_PRE_NON_LIFO,
|
||
SCHEDULE_NONE,
|
||
SCHEDULE_PRE_LIFO,
|
||
};
|
||
|
||
static const char *scheduler_mode_name[] = {
|
||
"top-down",
|
||
"non-lifo",
|
||
"none",
|
||
"lifo"
|
||
};
|
||
|
||
bool spill_all = allow_spilling && INTEL_DEBUG(DEBUG_SPILL_FS);
|
||
|
||
/* Before we schedule anything, stash off the instruction order as an array
|
||
* of fs_inst *. This way, we can reset it between scheduling passes to
|
||
* prevent dependencies between the different scheduling modes.
|
||
*/
|
||
int num_insts = cfg->last_block()->end_ip + 1;
|
||
fs_inst **inst_arr = ralloc_array(mem_ctx, fs_inst *, num_insts);
|
||
|
||
int ip = 0;
|
||
foreach_block_and_inst(block, fs_inst, inst, cfg) {
|
||
assert(ip >= block->start_ip && ip <= block->end_ip);
|
||
inst_arr[ip++] = inst;
|
||
}
|
||
assert(ip == num_insts);
|
||
|
||
/* Try each scheduling heuristic to see if it can successfully register
|
||
* allocate without spilling. They should be ordered by decreasing
|
||
* performance but increasing likelihood of allocating.
|
||
*/
|
||
for (unsigned i = 0; i < ARRAY_SIZE(pre_modes); i++) {
|
||
if (i > 0) {
|
||
/* Unless we're the first pass, reset back to the original order */
|
||
ip = 0;
|
||
foreach_block (block, cfg) {
|
||
block->instructions.make_empty();
|
||
|
||
assert(ip == block->start_ip);
|
||
for (; ip <= block->end_ip; ip++)
|
||
block->instructions.push_tail(inst_arr[ip]);
|
||
}
|
||
assert(ip == num_insts);
|
||
|
||
invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
|
||
}
|
||
|
||
if (pre_modes[i] != SCHEDULE_NONE)
|
||
schedule_instructions(pre_modes[i]);
|
||
this->shader_stats.scheduler_mode = scheduler_mode_name[i];
|
||
|
||
if (0) {
|
||
assign_regs_trivial();
|
||
allocated = true;
|
||
break;
|
||
}
|
||
|
||
bool can_spill = allow_spilling &&
|
||
(i == ARRAY_SIZE(pre_modes) - 1);
|
||
|
||
/* We should only spill registers on the last scheduling. */
|
||
assert(!spilled_any_registers);
|
||
|
||
allocated = assign_regs(can_spill, spill_all);
|
||
if (allocated)
|
||
break;
|
||
}
|
||
|
||
if (!allocated) {
|
||
fail("Failure to register allocate. Reduce number of "
|
||
"live scalar values to avoid this.");
|
||
} else if (spilled_any_registers) {
|
||
brw_shader_perf_log(compiler, log_data,
|
||
"%s shader triggered register spilling. "
|
||
"Try reducing the number of live scalar "
|
||
"values to improve performance.\n",
|
||
stage_name);
|
||
}
|
||
|
||
/* This must come after all optimization and register allocation, since
|
||
* it inserts dead code that happens to have side effects, and it does
|
||
* so based on the actual physical registers in use.
|
||
*/
|
||
insert_gfx4_send_dependency_workarounds();
|
||
|
||
if (failed)
|
||
return;
|
||
|
||
opt_bank_conflicts();
|
||
|
||
schedule_instructions(SCHEDULE_POST);
|
||
|
||
if (last_scratch > 0) {
|
||
ASSERTED unsigned max_scratch_size = 2 * 1024 * 1024;
|
||
|
||
/* Take the max of any previously compiled variant of the shader. In the
|
||
* case of bindless shaders with return parts, this will also take the
|
||
* max of all parts.
|
||
*/
|
||
prog_data->total_scratch = MAX2(brw_get_scratch_size(last_scratch),
|
||
prog_data->total_scratch);
|
||
|
||
if (gl_shader_stage_is_compute(stage)) {
|
||
if (devinfo->platform == INTEL_PLATFORM_HSW) {
|
||
/* According to the MEDIA_VFE_STATE's "Per Thread Scratch Space"
|
||
* field documentation, Haswell supports a minimum of 2kB of
|
||
* scratch space for compute shaders, unlike every other stage
|
||
* and platform.
|
||
*/
|
||
prog_data->total_scratch = MAX2(prog_data->total_scratch, 2048);
|
||
} else if (devinfo->ver <= 7) {
|
||
/* According to the MEDIA_VFE_STATE's "Per Thread Scratch Space"
|
||
* field documentation, platforms prior to Haswell measure scratch
|
||
* size linearly with a range of [1kB, 12kB] and 1kB granularity.
|
||
*/
|
||
prog_data->total_scratch = ALIGN(last_scratch, 1024);
|
||
max_scratch_size = 12 * 1024;
|
||
}
|
||
}
|
||
|
||
/* We currently only support up to 2MB of scratch space. If we
|
||
* need to support more eventually, the documentation suggests
|
||
* that we could allocate a larger buffer, and partition it out
|
||
* ourselves. We'd just have to undo the hardware's address
|
||
* calculation by subtracting (FFTID * Per Thread Scratch Space)
|
||
* and then add FFTID * (Larger Per Thread Scratch Space).
|
||
*
|
||
* See 3D-Media-GPGPU Engine > Media GPGPU Pipeline >
|
||
* Thread Group Tracking > Local Memory/Scratch Space.
|
||
*/
|
||
assert(prog_data->total_scratch < max_scratch_size);
|
||
}
|
||
|
||
lower_scoreboard();
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_vs()
|
||
{
|
||
assert(stage == MESA_SHADER_VERTEX);
|
||
|
||
setup_vs_payload();
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
emit_urb_writes();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
assign_vs_urb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(true /* allow_spilling */);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
void
|
||
fs_visitor::set_tcs_invocation_id()
|
||
{
|
||
struct brw_tcs_prog_data *tcs_prog_data = brw_tcs_prog_data(prog_data);
|
||
struct brw_vue_prog_data *vue_prog_data = &tcs_prog_data->base;
|
||
|
||
const bool dg2_plus =
|
||
devinfo->ver > 12 || intel_device_info_is_dg2(devinfo);
|
||
const unsigned instance_id_mask =
|
||
dg2_plus ? INTEL_MASK(7, 0) :
|
||
(devinfo->ver >= 11) ? INTEL_MASK(22, 16) : INTEL_MASK(23, 17);
|
||
const unsigned instance_id_shift =
|
||
dg2_plus ? 0 : (devinfo->ver >= 11) ? 16 : 17;
|
||
|
||
/* Get instance number from g0.2 bits:
|
||
* * 7:0 on DG2+
|
||
* * 22:16 on gfx11+
|
||
* * 23:17 otherwise
|
||
*/
|
||
fs_reg t = bld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
bld.AND(t, fs_reg(retype(brw_vec1_grf(0, 2), BRW_REGISTER_TYPE_UD)),
|
||
brw_imm_ud(instance_id_mask));
|
||
|
||
invocation_id = bld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
|
||
if (vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_8_PATCH) {
|
||
/* gl_InvocationID is just the thread number */
|
||
bld.SHR(invocation_id, t, brw_imm_ud(instance_id_shift));
|
||
return;
|
||
}
|
||
|
||
assert(vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_SINGLE_PATCH);
|
||
|
||
fs_reg channels_uw = bld.vgrf(BRW_REGISTER_TYPE_UW);
|
||
fs_reg channels_ud = bld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
bld.MOV(channels_uw, fs_reg(brw_imm_uv(0x76543210)));
|
||
bld.MOV(channels_ud, channels_uw);
|
||
|
||
if (tcs_prog_data->instances == 1) {
|
||
invocation_id = channels_ud;
|
||
} else {
|
||
fs_reg instance_times_8 = bld.vgrf(BRW_REGISTER_TYPE_UD);
|
||
bld.SHR(instance_times_8, t, brw_imm_ud(instance_id_shift - 3));
|
||
bld.ADD(invocation_id, instance_times_8, channels_ud);
|
||
}
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_tcs()
|
||
{
|
||
assert(stage == MESA_SHADER_TESS_CTRL);
|
||
|
||
struct brw_vue_prog_data *vue_prog_data = brw_vue_prog_data(prog_data);
|
||
struct brw_tcs_prog_data *tcs_prog_data = brw_tcs_prog_data(prog_data);
|
||
struct brw_tcs_prog_key *tcs_key = (struct brw_tcs_prog_key *) key;
|
||
|
||
assert(vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_SINGLE_PATCH ||
|
||
vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_8_PATCH);
|
||
|
||
if (vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_SINGLE_PATCH) {
|
||
/* r1-r4 contain the ICP handles. */
|
||
payload.num_regs = 5;
|
||
} else {
|
||
assert(vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_8_PATCH);
|
||
assert(tcs_key->input_vertices > 0);
|
||
/* r1 contains output handles, r2 may contain primitive ID, then the
|
||
* ICP handles occupy the next 1-32 registers.
|
||
*/
|
||
payload.num_regs = 2 + tcs_prog_data->include_primitive_id +
|
||
tcs_key->input_vertices;
|
||
}
|
||
|
||
/* Initialize gl_InvocationID */
|
||
set_tcs_invocation_id();
|
||
|
||
const bool fix_dispatch_mask =
|
||
vue_prog_data->dispatch_mode == DISPATCH_MODE_TCS_SINGLE_PATCH &&
|
||
(nir->info.tess.tcs_vertices_out % 8) != 0;
|
||
|
||
/* Fix the disptach mask */
|
||
if (fix_dispatch_mask) {
|
||
bld.CMP(bld.null_reg_ud(), invocation_id,
|
||
brw_imm_ud(nir->info.tess.tcs_vertices_out), BRW_CONDITIONAL_L);
|
||
bld.IF(BRW_PREDICATE_NORMAL);
|
||
}
|
||
|
||
emit_nir_code();
|
||
|
||
if (fix_dispatch_mask) {
|
||
bld.emit(BRW_OPCODE_ENDIF);
|
||
}
|
||
|
||
/* Emit EOT write; set TR DS Cache bit */
|
||
fs_reg srcs[URB_LOGICAL_NUM_SRCS];
|
||
srcs[URB_LOGICAL_SRC_HANDLE] = get_tcs_output_urb_handle();
|
||
srcs[URB_LOGICAL_SRC_CHANNEL_MASK] = brw_imm_ud(WRITEMASK_X << 16);
|
||
srcs[URB_LOGICAL_SRC_DATA] = brw_imm_ud(0);
|
||
fs_inst *inst = bld.emit(SHADER_OPCODE_URB_WRITE_LOGICAL,
|
||
reg_undef, srcs, ARRAY_SIZE(srcs));
|
||
inst->mlen = 3;
|
||
inst->eot = true;
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
assign_tcs_urb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(true /* allow_spilling */);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_tes()
|
||
{
|
||
assert(stage == MESA_SHADER_TESS_EVAL);
|
||
|
||
/* R0: thread header, R1-3: gl_TessCoord.xyz, R4: URB handles */
|
||
payload.num_regs = 5;
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
emit_urb_writes();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
assign_tes_urb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(true /* allow_spilling */);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_gs()
|
||
{
|
||
assert(stage == MESA_SHADER_GEOMETRY);
|
||
|
||
setup_gs_payload();
|
||
|
||
this->final_gs_vertex_count = vgrf(glsl_type::uint_type);
|
||
|
||
if (gs_compile->control_data_header_size_bits > 0) {
|
||
/* Create a VGRF to store accumulated control data bits. */
|
||
this->control_data_bits = vgrf(glsl_type::uint_type);
|
||
|
||
/* If we're outputting more than 32 control data bits, then EmitVertex()
|
||
* will set control_data_bits to 0 after emitting the first vertex.
|
||
* Otherwise, we need to initialize it to 0 here.
|
||
*/
|
||
if (gs_compile->control_data_header_size_bits <= 32) {
|
||
const fs_builder abld = bld.annotate("initialize control data bits");
|
||
abld.MOV(this->control_data_bits, brw_imm_ud(0u));
|
||
}
|
||
}
|
||
|
||
emit_nir_code();
|
||
|
||
emit_gs_thread_end();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
assign_gs_urb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(true /* allow_spilling */);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
/* From the SKL PRM, Volume 16, Workarounds:
|
||
*
|
||
* 0877 3D Pixel Shader Hang possible when pixel shader dispatched with
|
||
* only header phases (R0-R2)
|
||
*
|
||
* WA: Enable a non-header phase (e.g. push constant) when dispatch would
|
||
* have been header only.
|
||
*
|
||
* Instead of enabling push constants one can alternatively enable one of the
|
||
* inputs. Here one simply chooses "layer" which shouldn't impose much
|
||
* overhead.
|
||
*/
|
||
static void
|
||
gfx9_ps_header_only_workaround(struct brw_wm_prog_data *wm_prog_data)
|
||
{
|
||
if (wm_prog_data->num_varying_inputs)
|
||
return;
|
||
|
||
if (wm_prog_data->base.curb_read_length)
|
||
return;
|
||
|
||
wm_prog_data->urb_setup[VARYING_SLOT_LAYER] = 0;
|
||
wm_prog_data->num_varying_inputs = 1;
|
||
|
||
brw_compute_urb_setup_index(wm_prog_data);
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_fs(bool allow_spilling, bool do_rep_send)
|
||
{
|
||
struct brw_wm_prog_data *wm_prog_data = brw_wm_prog_data(this->prog_data);
|
||
brw_wm_prog_key *wm_key = (brw_wm_prog_key *) this->key;
|
||
|
||
assert(stage == MESA_SHADER_FRAGMENT);
|
||
|
||
if (devinfo->ver >= 6)
|
||
setup_fs_payload_gfx6();
|
||
else
|
||
setup_fs_payload_gfx4();
|
||
|
||
if (0) {
|
||
emit_dummy_fs();
|
||
} else if (do_rep_send) {
|
||
assert(dispatch_width == 16);
|
||
emit_repclear_shader();
|
||
} else {
|
||
if (nir->info.inputs_read > 0 ||
|
||
BITSET_TEST(nir->info.system_values_read, SYSTEM_VALUE_FRAG_COORD) ||
|
||
(nir->info.outputs_read > 0 && !wm_key->coherent_fb_fetch)) {
|
||
if (devinfo->ver < 6)
|
||
emit_interpolation_setup_gfx4();
|
||
else
|
||
emit_interpolation_setup_gfx6();
|
||
}
|
||
|
||
/* We handle discards by keeping track of the still-live pixels in f0.1.
|
||
* Initialize it with the dispatched pixels.
|
||
*/
|
||
if (wm_prog_data->uses_kill) {
|
||
const unsigned lower_width = MIN2(dispatch_width, 16);
|
||
for (unsigned i = 0; i < dispatch_width / lower_width; i++) {
|
||
const fs_reg dispatch_mask =
|
||
devinfo->ver >= 6 ? brw_vec1_grf((i ? 2 : 1), 7) :
|
||
brw_vec1_grf(0, 0);
|
||
bld.exec_all().group(1, 0)
|
||
.MOV(brw_sample_mask_reg(bld.group(lower_width, i)),
|
||
retype(dispatch_mask, BRW_REGISTER_TYPE_UW));
|
||
}
|
||
}
|
||
|
||
if (nir->info.writes_memory)
|
||
wm_prog_data->has_side_effects = true;
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
if (wm_key->emit_alpha_test)
|
||
emit_alpha_test();
|
||
|
||
emit_fb_writes();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
|
||
if (devinfo->ver == 9)
|
||
gfx9_ps_header_only_workaround(wm_prog_data);
|
||
|
||
assign_urb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
|
||
allocate_registers(allow_spilling);
|
||
}
|
||
|
||
return !failed;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_cs(bool allow_spilling)
|
||
{
|
||
assert(gl_shader_stage_is_compute(stage));
|
||
|
||
setup_cs_payload();
|
||
|
||
if (devinfo->platform == INTEL_PLATFORM_HSW && prog_data->total_shared > 0) {
|
||
/* Move SLM index from g0.0[27:24] to sr0.1[11:8] */
|
||
const fs_builder abld = bld.exec_all().group(1, 0);
|
||
abld.MOV(retype(brw_sr0_reg(1), BRW_REGISTER_TYPE_UW),
|
||
suboffset(retype(brw_vec1_grf(0, 0), BRW_REGISTER_TYPE_UW), 1));
|
||
}
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
emit_cs_terminate();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(allow_spilling);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_bs(bool allow_spilling)
|
||
{
|
||
assert(stage >= MESA_SHADER_RAYGEN && stage <= MESA_SHADER_CALLABLE);
|
||
|
||
/* R0: thread header, R1: stack IDs, R2: argument addresses */
|
||
payload.num_regs = 3;
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
/* TODO(RT): Perhaps rename this? */
|
||
emit_cs_terminate();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(allow_spilling);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_task(bool allow_spilling)
|
||
{
|
||
assert(stage == MESA_SHADER_TASK);
|
||
|
||
/* Task Shader Payloads (SIMD8 and SIMD16)
|
||
*
|
||
* R0: Header
|
||
* R1: Local_ID.X[0-7 or 0-15]
|
||
* R2: Inline Parameter
|
||
*
|
||
* Task Shader Payloads (SIMD32)
|
||
*
|
||
* R0: Header
|
||
* R1: Local_ID.X[0-15]
|
||
* R2: Local_ID.X[16-31]
|
||
* R3: Inline Parameter
|
||
*
|
||
* Local_ID.X values are 16 bits.
|
||
*
|
||
* Inline parameter is optional but always present since we use it to pass
|
||
* the address to descriptors.
|
||
*/
|
||
payload.num_regs = dispatch_width == 32 ? 4 : 3;
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
emit_cs_terminate();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(allow_spilling);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
bool
|
||
fs_visitor::run_mesh(bool allow_spilling)
|
||
{
|
||
assert(stage == MESA_SHADER_MESH);
|
||
|
||
/* Mesh Shader Payloads (SIMD8 and SIMD16)
|
||
*
|
||
* R0: Header
|
||
* R1: Local_ID.X[0-7 or 0-15]
|
||
* R2: Inline Parameter
|
||
*
|
||
* Mesh Shader Payloads (SIMD32)
|
||
*
|
||
* R0: Header
|
||
* R1: Local_ID.X[0-15]
|
||
* R2: Local_ID.X[16-31]
|
||
* R3: Inline Parameter
|
||
*
|
||
* Local_ID.X values are 16 bits.
|
||
*
|
||
* Inline parameter is optional but always present since we use it to pass
|
||
* the address to descriptors.
|
||
*/
|
||
payload.num_regs = dispatch_width == 32 ? 4 : 3;
|
||
|
||
emit_nir_code();
|
||
|
||
if (failed)
|
||
return false;
|
||
|
||
emit_cs_terminate();
|
||
|
||
calculate_cfg();
|
||
|
||
optimize();
|
||
|
||
assign_curb_setup();
|
||
|
||
fixup_3src_null_dest();
|
||
emit_dummy_memory_fence_before_eot();
|
||
allocate_registers(allow_spilling);
|
||
|
||
return !failed;
|
||
}
|
||
|
||
static bool
|
||
is_used_in_not_interp_frag_coord(nir_ssa_def *def)
|
||
{
|
||
nir_foreach_use(src, def) {
|
||
if (src->parent_instr->type != nir_instr_type_intrinsic)
|
||
return true;
|
||
|
||
nir_intrinsic_instr *intrin = nir_instr_as_intrinsic(src->parent_instr);
|
||
if (intrin->intrinsic != nir_intrinsic_load_frag_coord)
|
||
return true;
|
||
}
|
||
|
||
nir_foreach_if_use(src, def)
|
||
return true;
|
||
|
||
return false;
|
||
}
|
||
|
||
/**
|
||
* Return a bitfield where bit n is set if barycentric interpolation mode n
|
||
* (see enum brw_barycentric_mode) is needed by the fragment shader.
|
||
*
|
||
* We examine the load_barycentric intrinsics rather than looking at input
|
||
* variables so that we catch interpolateAtCentroid() messages too, which
|
||
* also need the BRW_BARYCENTRIC_[NON]PERSPECTIVE_CENTROID mode set up.
|
||
*/
|
||
static unsigned
|
||
brw_compute_barycentric_interp_modes(const struct intel_device_info *devinfo,
|
||
const nir_shader *shader)
|
||
{
|
||
unsigned barycentric_interp_modes = 0;
|
||
|
||
nir_foreach_function(f, shader) {
|
||
if (!f->impl)
|
||
continue;
|
||
|
||
nir_foreach_block(block, f->impl) {
|
||
nir_foreach_instr(instr, block) {
|
||
if (instr->type != nir_instr_type_intrinsic)
|
||
continue;
|
||
|
||
nir_intrinsic_instr *intrin = nir_instr_as_intrinsic(instr);
|
||
switch (intrin->intrinsic) {
|
||
case nir_intrinsic_load_barycentric_pixel:
|
||
case nir_intrinsic_load_barycentric_centroid:
|
||
case nir_intrinsic_load_barycentric_sample:
|
||
break;
|
||
default:
|
||
continue;
|
||
}
|
||
|
||
/* Ignore WPOS; it doesn't require interpolation. */
|
||
assert(intrin->dest.is_ssa);
|
||
if (!is_used_in_not_interp_frag_coord(&intrin->dest.ssa))
|
||
continue;
|
||
|
||
nir_intrinsic_op bary_op = intrin->intrinsic;
|
||
enum brw_barycentric_mode bary =
|
||
brw_barycentric_mode(intrin);
|
||
|
||
barycentric_interp_modes |= 1 << bary;
|
||
|
||
if (devinfo->needs_unlit_centroid_workaround &&
|
||
bary_op == nir_intrinsic_load_barycentric_centroid)
|
||
barycentric_interp_modes |= 1 << centroid_to_pixel(bary);
|
||
}
|
||
}
|
||
}
|
||
|
||
return barycentric_interp_modes;
|
||
}
|
||
|
||
static void
|
||
brw_compute_flat_inputs(struct brw_wm_prog_data *prog_data,
|
||
const nir_shader *shader)
|
||
{
|
||
prog_data->flat_inputs = 0;
|
||
|
||
nir_foreach_shader_in_variable(var, shader) {
|
||
/* flat shading */
|
||
if (var->data.interpolation != INTERP_MODE_FLAT)
|
||
continue;
|
||
|
||
if (var->data.per_primitive)
|
||
continue;
|
||
|
||
unsigned slots = glsl_count_attribute_slots(var->type, false);
|
||
for (unsigned s = 0; s < slots; s++) {
|
||
int input_index = prog_data->urb_setup[var->data.location + s];
|
||
|
||
if (input_index >= 0)
|
||
prog_data->flat_inputs |= 1 << input_index;
|
||
}
|
||
}
|
||
}
|
||
|
||
static uint8_t
|
||
computed_depth_mode(const nir_shader *shader)
|
||
{
|
||
if (shader->info.outputs_written & BITFIELD64_BIT(FRAG_RESULT_DEPTH)) {
|
||
switch (shader->info.fs.depth_layout) {
|
||
case FRAG_DEPTH_LAYOUT_NONE:
|
||
case FRAG_DEPTH_LAYOUT_ANY:
|
||
return BRW_PSCDEPTH_ON;
|
||
case FRAG_DEPTH_LAYOUT_GREATER:
|
||
return BRW_PSCDEPTH_ON_GE;
|
||
case FRAG_DEPTH_LAYOUT_LESS:
|
||
return BRW_PSCDEPTH_ON_LE;
|
||
case FRAG_DEPTH_LAYOUT_UNCHANGED:
|
||
return BRW_PSCDEPTH_OFF;
|
||
}
|
||
}
|
||
return BRW_PSCDEPTH_OFF;
|
||
}
|
||
|
||
/**
|
||
* Move load_interpolated_input with simple (payload-based) barycentric modes
|
||
* to the top of the program so we don't emit multiple PLNs for the same input.
|
||
*
|
||
* This works around CSE not being able to handle non-dominating cases
|
||
* such as:
|
||
*
|
||
* if (...) {
|
||
* interpolate input
|
||
* } else {
|
||
* interpolate the same exact input
|
||
* }
|
||
*
|
||
* This should be replaced by global value numbering someday.
|
||
*/
|
||
bool
|
||
brw_nir_move_interpolation_to_top(nir_shader *nir)
|
||
{
|
||
bool progress = false;
|
||
|
||
nir_foreach_function(f, nir) {
|
||
if (!f->impl)
|
||
continue;
|
||
|
||
nir_block *top = nir_start_block(f->impl);
|
||
exec_node *cursor_node = NULL;
|
||
|
||
nir_foreach_block(block, f->impl) {
|
||
if (block == top)
|
||
continue;
|
||
|
||
nir_foreach_instr_safe(instr, block) {
|
||
if (instr->type != nir_instr_type_intrinsic)
|
||
continue;
|
||
|
||
nir_intrinsic_instr *intrin = nir_instr_as_intrinsic(instr);
|
||
if (intrin->intrinsic != nir_intrinsic_load_interpolated_input)
|
||
continue;
|
||
nir_intrinsic_instr *bary_intrinsic =
|
||
nir_instr_as_intrinsic(intrin->src[0].ssa->parent_instr);
|
||
nir_intrinsic_op op = bary_intrinsic->intrinsic;
|
||
|
||
/* Leave interpolateAtSample/Offset() where they are. */
|
||
if (op == nir_intrinsic_load_barycentric_at_sample ||
|
||
op == nir_intrinsic_load_barycentric_at_offset)
|
||
continue;
|
||
|
||
nir_instr *move[3] = {
|
||
&bary_intrinsic->instr,
|
||
intrin->src[1].ssa->parent_instr,
|
||
instr
|
||
};
|
||
|
||
for (unsigned i = 0; i < ARRAY_SIZE(move); i++) {
|
||
if (move[i]->block != top) {
|
||
move[i]->block = top;
|
||
exec_node_remove(&move[i]->node);
|
||
if (cursor_node) {
|
||
exec_node_insert_after(cursor_node, &move[i]->node);
|
||
} else {
|
||
exec_list_push_head(&top->instr_list, &move[i]->node);
|
||
}
|
||
cursor_node = &move[i]->node;
|
||
progress = true;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
nir_metadata_preserve(f->impl, nir_metadata_block_index |
|
||
nir_metadata_dominance);
|
||
}
|
||
|
||
return progress;
|
||
}
|
||
|
||
static void
|
||
brw_nir_populate_wm_prog_data(const nir_shader *shader,
|
||
const struct intel_device_info *devinfo,
|
||
const struct brw_wm_prog_key *key,
|
||
struct brw_wm_prog_data *prog_data,
|
||
const struct brw_mue_map *mue_map)
|
||
{
|
||
/* key->alpha_test_func means simulating alpha testing via discards,
|
||
* so the shader definitely kills pixels.
|
||
*/
|
||
prog_data->uses_kill = shader->info.fs.uses_discard ||
|
||
shader->info.fs.uses_demote ||
|
||
key->emit_alpha_test;
|
||
prog_data->uses_omask = !key->ignore_sample_mask_out &&
|
||
(shader->info.outputs_written & BITFIELD64_BIT(FRAG_RESULT_SAMPLE_MASK));
|
||
prog_data->color_outputs_written = key->color_outputs_valid;
|
||
prog_data->computed_depth_mode = computed_depth_mode(shader);
|
||
prog_data->computed_stencil =
|
||
shader->info.outputs_written & BITFIELD64_BIT(FRAG_RESULT_STENCIL);
|
||
|
||
prog_data->persample_dispatch =
|
||
key->multisample_fbo &&
|
||
(key->persample_interp ||
|
||
shader->info.fs.uses_sample_shading);
|
||
|
||
if (devinfo->ver >= 6) {
|
||
prog_data->uses_sample_mask =
|
||
BITSET_TEST(shader->info.system_values_read, SYSTEM_VALUE_SAMPLE_MASK_IN);
|
||
|
||
/* From the Ivy Bridge PRM documentation for 3DSTATE_PS:
|
||
*
|
||
* "MSDISPMODE_PERSAMPLE is required in order to select
|
||
* POSOFFSET_SAMPLE"
|
||
*
|
||
* So we can only really get sample positions if we are doing real
|
||
* per-sample dispatch. If we need gl_SamplePosition and we don't have
|
||
* persample dispatch, we hard-code it to 0.5.
|
||
*/
|
||
prog_data->uses_pos_offset = prog_data->persample_dispatch &&
|
||
(BITSET_TEST(shader->info.system_values_read,
|
||
SYSTEM_VALUE_SAMPLE_POS) ||
|
||
BITSET_TEST(shader->info.system_values_read,
|
||
SYSTEM_VALUE_SAMPLE_POS_OR_CENTER));
|
||
}
|
||
|
||
prog_data->has_render_target_reads = shader->info.outputs_read != 0ull;
|
||
|
||
prog_data->early_fragment_tests = shader->info.fs.early_fragment_tests;
|
||
prog_data->post_depth_coverage = shader->info.fs.post_depth_coverage;
|
||
prog_data->inner_coverage = shader->info.fs.inner_coverage;
|
||
|
||
prog_data->barycentric_interp_modes =
|
||
brw_compute_barycentric_interp_modes(devinfo, shader);
|
||
prog_data->uses_nonperspective_interp_modes |=
|
||
(prog_data->barycentric_interp_modes &
|
||
BRW_BARYCENTRIC_NONPERSPECTIVE_BITS) != 0;
|
||
|
||
/* You can't be coarse and per-sample */
|
||
assert(!key->coarse_pixel || !key->persample_interp);
|
||
prog_data->per_coarse_pixel_dispatch =
|
||
key->coarse_pixel &&
|
||
!shader->info.fs.uses_sample_shading &&
|
||
!prog_data->uses_omask &&
|
||
!prog_data->uses_sample_mask &&
|
||
(prog_data->computed_depth_mode == BRW_PSCDEPTH_OFF) &&
|
||
!prog_data->computed_stencil;
|
||
|
||
/* We choose to always enable VMask prior to XeHP, as it would cause
|
||
* us to lose out on the eliminate_find_live_channel() optimization.
|
||
*/
|
||
prog_data->uses_vmask = devinfo->verx10 < 125 ||
|
||
shader->info.fs.needs_quad_helper_invocations ||
|
||
shader->info.fs.needs_all_helper_invocations ||
|
||
prog_data->per_coarse_pixel_dispatch;
|
||
|
||
prog_data->uses_src_w =
|
||
BITSET_TEST(shader->info.system_values_read, SYSTEM_VALUE_FRAG_COORD);
|
||
prog_data->uses_src_depth =
|
||
BITSET_TEST(shader->info.system_values_read, SYSTEM_VALUE_FRAG_COORD) &&
|
||
!prog_data->per_coarse_pixel_dispatch;
|
||
prog_data->uses_depth_w_coefficients =
|
||
BITSET_TEST(shader->info.system_values_read, SYSTEM_VALUE_FRAG_COORD) &&
|
||
prog_data->per_coarse_pixel_dispatch;
|
||
|
||
calculate_urb_setup(devinfo, key, prog_data, shader, mue_map);
|
||
brw_compute_flat_inputs(prog_data, shader);
|
||
}
|
||
|
||
/**
|
||
* Pre-gfx6, the register file of the EUs was shared between threads,
|
||
* and each thread used some subset allocated on a 16-register block
|
||
* granularity. The unit states wanted these block counts.
|
||
*/
|
||
static inline int
|
||
brw_register_blocks(int reg_count)
|
||
{
|
||
return ALIGN(reg_count, 16) / 16 - 1;
|
||
}
|
||
|
||
const unsigned *
|
||
brw_compile_fs(const struct brw_compiler *compiler,
|
||
void *mem_ctx,
|
||
struct brw_compile_fs_params *params)
|
||
{
|
||
struct nir_shader *nir = params->nir;
|
||
const struct brw_wm_prog_key *key = params->key;
|
||
struct brw_wm_prog_data *prog_data = params->prog_data;
|
||
bool allow_spilling = params->allow_spilling;
|
||
const bool debug_enabled =
|
||
INTEL_DEBUG(params->debug_flag ? params->debug_flag : DEBUG_WM);
|
||
|
||
prog_data->base.stage = MESA_SHADER_FRAGMENT;
|
||
prog_data->base.ray_queries = nir->info.ray_queries;
|
||
prog_data->base.total_scratch = 0;
|
||
|
||
const struct intel_device_info *devinfo = compiler->devinfo;
|
||
const unsigned max_subgroup_size = compiler->devinfo->ver >= 6 ? 32 : 16;
|
||
|
||
brw_nir_apply_key(nir, compiler, &key->base, max_subgroup_size, true);
|
||
brw_nir_lower_fs_inputs(nir, devinfo, key);
|
||
brw_nir_lower_fs_outputs(nir);
|
||
|
||
if (devinfo->ver < 6)
|
||
brw_setup_vue_interpolation(params->vue_map, nir, prog_data);
|
||
|
||
/* From the SKL PRM, Volume 7, "Alpha Coverage":
|
||
* "If Pixel Shader outputs oMask, AlphaToCoverage is disabled in
|
||
* hardware, regardless of the state setting for this feature."
|
||
*/
|
||
if (devinfo->ver > 6 && key->alpha_to_coverage) {
|
||
/* Run constant fold optimization in order to get the correct source
|
||
* offset to determine render target 0 store instruction in
|
||
* emit_alpha_to_coverage pass.
|
||
*/
|
||
NIR_PASS_V(nir, nir_opt_constant_folding);
|
||
NIR_PASS_V(nir, brw_nir_lower_alpha_to_coverage);
|
||
}
|
||
|
||
NIR_PASS_V(nir, brw_nir_move_interpolation_to_top);
|
||
brw_postprocess_nir(nir, compiler, true, debug_enabled,
|
||
key->base.robust_buffer_access);
|
||
|
||
brw_nir_populate_wm_prog_data(nir, compiler->devinfo, key, prog_data,
|
||
params->mue_map);
|
||
|
||
fs_visitor *v8 = NULL, *v16 = NULL, *v32 = NULL;
|
||
cfg_t *simd8_cfg = NULL, *simd16_cfg = NULL, *simd32_cfg = NULL;
|
||
float throughput = 0;
|
||
bool has_spilled = false;
|
||
|
||
v8 = new fs_visitor(compiler, params->log_data, mem_ctx, &key->base,
|
||
&prog_data->base, nir, 8,
|
||
debug_enabled);
|
||
if (!v8->run_fs(allow_spilling, false /* do_rep_send */)) {
|
||
params->error_str = ralloc_strdup(mem_ctx, v8->fail_msg);
|
||
delete v8;
|
||
return NULL;
|
||
} else if (!INTEL_DEBUG(DEBUG_NO8)) {
|
||
simd8_cfg = v8->cfg;
|
||
prog_data->base.dispatch_grf_start_reg = v8->payload.num_regs;
|
||
prog_data->reg_blocks_8 = brw_register_blocks(v8->grf_used);
|
||
const performance &perf = v8->performance_analysis.require();
|
||
throughput = MAX2(throughput, perf.throughput);
|
||
has_spilled = v8->spilled_any_registers;
|
||
allow_spilling = false;
|
||
}
|
||
|
||
/* Limit dispatch width to simd8 with dual source blending on gfx8.
|
||
* See: https://gitlab.freedesktop.org/mesa/mesa/-/issues/1917
|
||
*/
|
||
if (devinfo->ver == 8 && prog_data->dual_src_blend &&
|
||
!INTEL_DEBUG(DEBUG_NO8)) {
|
||
assert(!params->use_rep_send);
|
||
v8->limit_dispatch_width(8, "gfx8 workaround: "
|
||
"using SIMD8 when dual src blending.\n");
|
||
}
|
||
|
||
if (key->coarse_pixel) {
|
||
if (prog_data->dual_src_blend) {
|
||
v8->limit_dispatch_width(8, "SIMD16 coarse pixel shading cannot"
|
||
" use SIMD8 messages.\n");
|
||
}
|
||
v8->limit_dispatch_width(16, "SIMD32 not supported with coarse"
|
||
" pixel shading.\n");
|
||
}
|
||
|
||
if (nir->info.ray_queries > 0)
|
||
v8->limit_dispatch_width(16, "SIMD32 with ray queries.\n");
|
||
|
||
if (!has_spilled &&
|
||
v8->max_dispatch_width >= 16 &&
|
||
(!INTEL_DEBUG(DEBUG_NO16) || params->use_rep_send)) {
|
||
/* Try a SIMD16 compile */
|
||
v16 = new fs_visitor(compiler, params->log_data, mem_ctx, &key->base,
|
||
&prog_data->base, nir, 16,
|
||
debug_enabled);
|
||
v16->import_uniforms(v8);
|
||
if (!v16->run_fs(allow_spilling, params->use_rep_send)) {
|
||
brw_shader_perf_log(compiler, params->log_data,
|
||
"SIMD16 shader failed to compile: %s\n",
|
||
v16->fail_msg);
|
||
} else {
|
||
simd16_cfg = v16->cfg;
|
||
prog_data->dispatch_grf_start_reg_16 = v16->payload.num_regs;
|
||
prog_data->reg_blocks_16 = brw_register_blocks(v16->grf_used);
|
||
const performance &perf = v16->performance_analysis.require();
|
||
throughput = MAX2(throughput, perf.throughput);
|
||
has_spilled = v16->spilled_any_registers;
|
||
allow_spilling = false;
|
||
}
|
||
}
|
||
|
||
const bool simd16_failed = v16 && !simd16_cfg;
|
||
|
||
/* Currently, the compiler only supports SIMD32 on SNB+ */
|
||
if (!has_spilled &&
|
||
v8->max_dispatch_width >= 32 && !params->use_rep_send &&
|
||
devinfo->ver >= 6 && !simd16_failed &&
|
||
!INTEL_DEBUG(DEBUG_NO32)) {
|
||
/* Try a SIMD32 compile */
|
||
v32 = new fs_visitor(compiler, params->log_data, mem_ctx, &key->base,
|
||
&prog_data->base, nir, 32,
|
||
debug_enabled);
|
||
v32->import_uniforms(v8);
|
||
if (!v32->run_fs(allow_spilling, false)) {
|
||
brw_shader_perf_log(compiler, params->log_data,
|
||
"SIMD32 shader failed to compile: %s\n",
|
||
v32->fail_msg);
|
||
} else {
|
||
const performance &perf = v32->performance_analysis.require();
|
||
|
||
if (!INTEL_DEBUG(DEBUG_DO32) && throughput >= perf.throughput) {
|
||
brw_shader_perf_log(compiler, params->log_data,
|
||
"SIMD32 shader inefficient\n");
|
||
} else {
|
||
simd32_cfg = v32->cfg;
|
||
prog_data->dispatch_grf_start_reg_32 = v32->payload.num_regs;
|
||
prog_data->reg_blocks_32 = brw_register_blocks(v32->grf_used);
|
||
throughput = MAX2(throughput, perf.throughput);
|
||
}
|
||
}
|
||
}
|
||
|
||
/* When the caller requests a repclear shader, they want SIMD16-only */
|
||
if (params->use_rep_send)
|
||
simd8_cfg = NULL;
|
||
|
||
/* Prior to Iron Lake, the PS had a single shader offset with a jump table
|
||
* at the top to select the shader. We've never implemented that.
|
||
* Instead, we just give them exactly one shader and we pick the widest one
|
||
* available.
|
||
*/
|
||
if (compiler->devinfo->ver < 5) {
|
||
if (simd32_cfg || simd16_cfg)
|
||
simd8_cfg = NULL;
|
||
if (simd32_cfg)
|
||
simd16_cfg = NULL;
|
||
}
|
||
|
||
/* If computed depth is enabled SNB only allows SIMD8. */
|
||
if (compiler->devinfo->ver == 6 &&
|
||
prog_data->computed_depth_mode != BRW_PSCDEPTH_OFF)
|
||
assert(simd16_cfg == NULL && simd32_cfg == NULL);
|
||
|
||
if (compiler->devinfo->ver <= 5 && !simd8_cfg) {
|
||
/* Iron lake and earlier only have one Dispatch GRF start field. Make
|
||
* the data available in the base prog data struct for convenience.
|
||
*/
|
||
if (simd16_cfg) {
|
||
prog_data->base.dispatch_grf_start_reg =
|
||
prog_data->dispatch_grf_start_reg_16;
|
||
} else if (simd32_cfg) {
|
||
prog_data->base.dispatch_grf_start_reg =
|
||
prog_data->dispatch_grf_start_reg_32;
|
||
}
|
||
}
|
||
|
||
if (prog_data->persample_dispatch) {
|
||
/* Starting with SandyBridge (where we first get MSAA), the different
|
||
* pixel dispatch combinations are grouped into classifications A
|
||
* through F (SNB PRM Vol. 2 Part 1 Section 7.7.1). On most hardware
|
||
* generations, the only configurations supporting persample dispatch
|
||
* are those in which only one dispatch width is enabled.
|
||
*
|
||
* The Gfx12 hardware spec has a similar dispatch grouping table, but
|
||
* the following conflicting restriction applies (from the page on
|
||
* "Structure_3DSTATE_PS_BODY"), so we need to keep the SIMD16 shader:
|
||
*
|
||
* "SIMD32 may only be enabled if SIMD16 or (dual)SIMD8 is also
|
||
* enabled."
|
||
*/
|
||
if (simd32_cfg || simd16_cfg)
|
||
simd8_cfg = NULL;
|
||
if (simd32_cfg && devinfo->ver < 12)
|
||
simd16_cfg = NULL;
|
||
}
|
||
|
||
fs_generator g(compiler, params->log_data, mem_ctx, &prog_data->base,
|
||
v8->runtime_check_aads_emit, MESA_SHADER_FRAGMENT);
|
||
|
||
if (unlikely(debug_enabled)) {
|
||
g.enable_debug(ralloc_asprintf(mem_ctx, "%s fragment shader %s",
|
||
nir->info.label ?
|
||
nir->info.label : "unnamed",
|
||
nir->info.name));
|
||
}
|
||
|
||
struct brw_compile_stats *stats = params->stats;
|
||
|
||
if (simd8_cfg) {
|
||
prog_data->dispatch_8 = true;
|
||
g.generate_code(simd8_cfg, 8, v8->shader_stats,
|
||
v8->performance_analysis.require(), stats);
|
||
stats = stats ? stats + 1 : NULL;
|
||
}
|
||
|
||
if (simd16_cfg) {
|
||
prog_data->dispatch_16 = true;
|
||
prog_data->prog_offset_16 = g.generate_code(
|
||
simd16_cfg, 16, v16->shader_stats,
|
||
v16->performance_analysis.require(), stats);
|
||
stats = stats ? stats + 1 : NULL;
|
||
}
|
||
|
||
if (simd32_cfg) {
|
||
prog_data->dispatch_32 = true;
|
||
prog_data->prog_offset_32 = g.generate_code(
|
||
simd32_cfg, 32, v32->shader_stats,
|
||
v32->performance_analysis.require(), stats);
|
||
stats = stats ? stats + 1 : NULL;
|
||
}
|
||
|
||
g.add_const_data(nir->constant_data, nir->constant_data_size);
|
||
|
||
delete v8;
|
||
delete v16;
|
||
delete v32;
|
||
|
||
return g.get_assembly();
|
||
}
|
||
|
||
fs_reg
|
||
fs_visitor::emit_work_group_id_setup()
|
||
{
|
||
assert(gl_shader_stage_uses_workgroup(stage));
|
||
|
||
fs_reg id = bld.vgrf(BRW_REGISTER_TYPE_UD, 3);
|
||
|
||
struct brw_reg r0_1(retype(brw_vec1_grf(0, 1), BRW_REGISTER_TYPE_UD));
|
||
bld.MOV(id, r0_1);
|
||
|
||
if (gl_shader_stage_is_compute(stage)) {
|
||
struct brw_reg r0_6(retype(brw_vec1_grf(0, 6), BRW_REGISTER_TYPE_UD));
|
||
struct brw_reg r0_7(retype(brw_vec1_grf(0, 7), BRW_REGISTER_TYPE_UD));
|
||
bld.MOV(offset(id, bld, 1), r0_6);
|
||
bld.MOV(offset(id, bld, 2), r0_7);
|
||
} else {
|
||
/* Task/Mesh have a single Workgroup ID dimension in the HW. */
|
||
bld.MOV(offset(id, bld, 1), brw_imm_ud(0));
|
||
bld.MOV(offset(id, bld, 2), brw_imm_ud(0));
|
||
}
|
||
|
||
return id;
|
||
}
|
||
|
||
unsigned
|
||
brw_cs_push_const_total_size(const struct brw_cs_prog_data *cs_prog_data,
|
||
unsigned threads)
|
||
{
|
||
assert(cs_prog_data->push.per_thread.size % REG_SIZE == 0);
|
||
assert(cs_prog_data->push.cross_thread.size % REG_SIZE == 0);
|
||
return cs_prog_data->push.per_thread.size * threads +
|
||
cs_prog_data->push.cross_thread.size;
|
||
}
|
||
|
||
static void
|
||
fill_push_const_block_info(struct brw_push_const_block *block, unsigned dwords)
|
||
{
|
||
block->dwords = dwords;
|
||
block->regs = DIV_ROUND_UP(dwords, 8);
|
||
block->size = block->regs * 32;
|
||
}
|
||
|
||
static void
|
||
cs_fill_push_const_info(const struct intel_device_info *devinfo,
|
||
struct brw_cs_prog_data *cs_prog_data)
|
||
{
|
||
const struct brw_stage_prog_data *prog_data = &cs_prog_data->base;
|
||
int subgroup_id_index = get_subgroup_id_param_index(devinfo, prog_data);
|
||
bool cross_thread_supported = devinfo->verx10 >= 75;
|
||
|
||
/* The thread ID should be stored in the last param dword */
|
||
assert(subgroup_id_index == -1 ||
|
||
subgroup_id_index == (int)prog_data->nr_params - 1);
|
||
|
||
unsigned cross_thread_dwords, per_thread_dwords;
|
||
if (!cross_thread_supported) {
|
||
cross_thread_dwords = 0u;
|
||
per_thread_dwords = prog_data->nr_params;
|
||
} else if (subgroup_id_index >= 0) {
|
||
/* Fill all but the last register with cross-thread payload */
|
||
cross_thread_dwords = 8 * (subgroup_id_index / 8);
|
||
per_thread_dwords = prog_data->nr_params - cross_thread_dwords;
|
||
assert(per_thread_dwords > 0 && per_thread_dwords <= 8);
|
||
} else {
|
||
/* Fill all data using cross-thread payload */
|
||
cross_thread_dwords = prog_data->nr_params;
|
||
per_thread_dwords = 0u;
|
||
}
|
||
|
||
fill_push_const_block_info(&cs_prog_data->push.cross_thread, cross_thread_dwords);
|
||
fill_push_const_block_info(&cs_prog_data->push.per_thread, per_thread_dwords);
|
||
|
||
assert(cs_prog_data->push.cross_thread.dwords % 8 == 0 ||
|
||
cs_prog_data->push.per_thread.size == 0);
|
||
assert(cs_prog_data->push.cross_thread.dwords +
|
||
cs_prog_data->push.per_thread.dwords ==
|
||
prog_data->nr_params);
|
||
}
|
||
|
||
static bool
|
||
filter_simd(const nir_instr *instr, const void * /* options */)
|
||
{
|
||
if (instr->type != nir_instr_type_intrinsic)
|
||
return false;
|
||
|
||
switch (nir_instr_as_intrinsic(instr)->intrinsic) {
|
||
case nir_intrinsic_load_simd_width_intel:
|
||
case nir_intrinsic_load_subgroup_id:
|
||
return true;
|
||
|
||
default:
|
||
return false;
|
||
}
|
||
}
|
||
|
||
static nir_ssa_def *
|
||
lower_simd(nir_builder *b, nir_instr *instr, void *options)
|
||
{
|
||
uintptr_t simd_width = (uintptr_t)options;
|
||
|
||
switch (nir_instr_as_intrinsic(instr)->intrinsic) {
|
||
case nir_intrinsic_load_simd_width_intel:
|
||
return nir_imm_int(b, simd_width);
|
||
|
||
case nir_intrinsic_load_subgroup_id:
|
||
/* If the whole workgroup fits in one thread, we can lower subgroup_id
|
||
* to a constant zero.
|
||
*/
|
||
if (!b->shader->info.workgroup_size_variable) {
|
||
unsigned local_workgroup_size = b->shader->info.workgroup_size[0] *
|
||
b->shader->info.workgroup_size[1] *
|
||
b->shader->info.workgroup_size[2];
|
||
if (local_workgroup_size <= simd_width)
|
||
return nir_imm_int(b, 0);
|
||
}
|
||
return NULL;
|
||
|
||
default:
|
||
return NULL;
|
||
}
|
||
}
|
||
|
||
void
|
||
brw_nir_lower_simd(nir_shader *nir, unsigned dispatch_width)
|
||
{
|
||
nir_shader_lower_instructions(nir, filter_simd, lower_simd,
|
||
(void *)(uintptr_t)dispatch_width);
|
||
}
|
||
|
||
const unsigned *
|
||
brw_compile_cs(const struct brw_compiler *compiler,
|
||
void *mem_ctx,
|
||
struct brw_compile_cs_params *params)
|
||
{
|
||
const nir_shader *nir = params->nir;
|
||
const struct brw_cs_prog_key *key = params->key;
|
||
struct brw_cs_prog_data *prog_data = params->prog_data;
|
||
|
||
const bool debug_enabled =
|
||
INTEL_DEBUG(params->debug_flag ? params->debug_flag : DEBUG_CS);
|
||
|
||
prog_data->base.stage = MESA_SHADER_COMPUTE;
|
||
prog_data->base.total_shared = nir->info.shared_size;
|
||
prog_data->base.ray_queries = nir->info.ray_queries;
|
||
prog_data->base.total_scratch = 0;
|
||
|
||
if (!nir->info.workgroup_size_variable) {
|
||
prog_data->local_size[0] = nir->info.workgroup_size[0];
|
||
prog_data->local_size[1] = nir->info.workgroup_size[1];
|
||
prog_data->local_size[2] = nir->info.workgroup_size[2];
|
||
}
|
||
|
||
const unsigned required_dispatch_width =
|
||
brw_required_dispatch_width(&nir->info);
|
||
|
||
fs_visitor *v[3] = {0};
|
||
const char *error[3] = {0};
|
||
|
||
for (unsigned simd = 0; simd < 3; simd++) {
|
||
if (!brw_simd_should_compile(mem_ctx, simd, compiler->devinfo, prog_data,
|
||
required_dispatch_width, &error[simd]))
|
||
continue;
|
||
|
||
const unsigned dispatch_width = 8u << simd;
|
||
|
||
nir_shader *shader = nir_shader_clone(mem_ctx, nir);
|
||
brw_nir_apply_key(shader, compiler, &key->base,
|
||
dispatch_width, true /* is_scalar */);
|
||
|
||
NIR_PASS_V(shader, brw_nir_lower_simd, dispatch_width);
|
||
|
||
/* Clean up after the local index and ID calculations. */
|
||
NIR_PASS_V(shader, nir_opt_constant_folding);
|
||
NIR_PASS_V(shader, nir_opt_dce);
|
||
|
||
brw_postprocess_nir(shader, compiler, true, debug_enabled,
|
||
key->base.robust_buffer_access);
|
||
|
||
v[simd] = new fs_visitor(compiler, params->log_data, mem_ctx, &key->base,
|
||
&prog_data->base, shader, dispatch_width,
|
||
debug_enabled);
|
||
|
||
if (prog_data->prog_mask) {
|
||
unsigned first = ffs(prog_data->prog_mask) - 1;
|
||
v[simd]->import_uniforms(v[first]);
|
||
}
|
||
|
||
const bool allow_spilling = !prog_data->prog_mask ||
|
||
nir->info.workgroup_size_variable;
|
||
|
||
if (v[simd]->run_cs(allow_spilling)) {
|
||
/* We should always be able to do SIMD32 for compute shaders. */
|
||
assert(v[simd]->max_dispatch_width >= 32);
|
||
|
||
cs_fill_push_const_info(compiler->devinfo, prog_data);
|
||
|
||
brw_simd_mark_compiled(simd, prog_data, v[simd]->spilled_any_registers);
|
||
} else {
|
||
error[simd] = ralloc_strdup(mem_ctx, v[simd]->fail_msg);
|
||
if (simd > 0) {
|
||
brw_shader_perf_log(compiler, params->log_data,
|
||
"SIMD%u shader failed to compile: %s\n",
|
||
dispatch_width, v[simd]->fail_msg);
|
||
}
|
||
}
|
||
}
|
||
|
||
const int selected_simd = brw_simd_select(prog_data);
|
||
if (selected_simd < 0) {
|
||
params->error_str = ralloc_asprintf(mem_ctx, "Can't compile shader: %s, %s and %s.\n",
|
||
error[0], error[1], error[2]);;
|
||
return NULL;
|
||
}
|
||
|
||
assert(selected_simd < 3);
|
||
fs_visitor *selected = v[selected_simd];
|
||
|
||
if (!nir->info.workgroup_size_variable)
|
||
prog_data->prog_mask = 1 << selected_simd;
|
||
|
||
const unsigned *ret = NULL;
|
||
|
||
fs_generator g(compiler, params->log_data, mem_ctx, &prog_data->base,
|
||
selected->runtime_check_aads_emit, MESA_SHADER_COMPUTE);
|
||
if (unlikely(debug_enabled)) {
|
||
char *name = ralloc_asprintf(mem_ctx, "%s compute shader %s",
|
||
nir->info.label ?
|
||
nir->info.label : "unnamed",
|
||
nir->info.name);
|
||
g.enable_debug(name);
|
||
}
|
||
|
||
struct brw_compile_stats *stats = params->stats;
|
||
for (unsigned simd = 0; simd < 3; simd++) {
|
||
if (prog_data->prog_mask & (1u << simd)) {
|
||
assert(v[simd]);
|
||
prog_data->prog_offset[simd] =
|
||
g.generate_code(v[simd]->cfg, 8u << simd, v[simd]->shader_stats,
|
||
v[simd]->performance_analysis.require(), stats);
|
||
stats = stats ? stats + 1 : NULL;
|
||
}
|
||
}
|
||
|
||
g.add_const_data(nir->constant_data, nir->constant_data_size);
|
||
|
||
ret = g.get_assembly();
|
||
|
||
delete v[0];
|
||
delete v[1];
|
||
delete v[2];
|
||
|
||
return ret;
|
||
}
|
||
|
||
struct brw_cs_dispatch_info
|
||
brw_cs_get_dispatch_info(const struct intel_device_info *devinfo,
|
||
const struct brw_cs_prog_data *prog_data,
|
||
const unsigned *override_local_size)
|
||
{
|
||
struct brw_cs_dispatch_info info = {};
|
||
|
||
const unsigned *sizes =
|
||
override_local_size ? override_local_size :
|
||
prog_data->local_size;
|
||
|
||
const int simd =
|
||
override_local_size ? brw_simd_select_for_workgroup_size(devinfo, prog_data, sizes) :
|
||
brw_simd_select(prog_data);
|
||
assert(simd >= 0 && simd < 3);
|
||
|
||
info.group_size = sizes[0] * sizes[1] * sizes[2];
|
||
info.simd_size = 8u << simd;
|
||
info.threads = DIV_ROUND_UP(info.group_size, info.simd_size);
|
||
|
||
const uint32_t remainder = info.group_size & (info.simd_size - 1);
|
||
if (remainder > 0)
|
||
info.right_mask = ~0u >> (32 - remainder);
|
||
else
|
||
info.right_mask = ~0u >> (32 - info.simd_size);
|
||
|
||
return info;
|
||
}
|
||
|
||
static uint8_t
|
||
compile_single_bs(const struct brw_compiler *compiler, void *log_data,
|
||
void *mem_ctx,
|
||
const struct brw_bs_prog_key *key,
|
||
struct brw_bs_prog_data *prog_data,
|
||
nir_shader *shader,
|
||
fs_generator *g,
|
||
struct brw_compile_stats *stats,
|
||
int *prog_offset,
|
||
char **error_str)
|
||
{
|
||
const bool debug_enabled = INTEL_DEBUG(DEBUG_RT);
|
||
|
||
prog_data->base.stage = shader->info.stage;
|
||
prog_data->max_stack_size = MAX2(prog_data->max_stack_size,
|
||
shader->scratch_size);
|
||
|
||
const unsigned max_dispatch_width = 16;
|
||
brw_nir_apply_key(shader, compiler, &key->base, max_dispatch_width, true);
|
||
brw_postprocess_nir(shader, compiler, true, debug_enabled,
|
||
key->base.robust_buffer_access);
|
||
|
||
fs_visitor *v = NULL, *v8 = NULL, *v16 = NULL;
|
||
bool has_spilled = false;
|
||
|
||
uint8_t simd_size = 0;
|
||
if (!INTEL_DEBUG(DEBUG_NO8)) {
|
||
v8 = new fs_visitor(compiler, log_data, mem_ctx, &key->base,
|
||
&prog_data->base, shader,
|
||
8, debug_enabled);
|
||
const bool allow_spilling = true;
|
||
if (!v8->run_bs(allow_spilling)) {
|
||
if (error_str)
|
||
*error_str = ralloc_strdup(mem_ctx, v8->fail_msg);
|
||
delete v8;
|
||
return 0;
|
||
} else {
|
||
v = v8;
|
||
simd_size = 8;
|
||
if (v8->spilled_any_registers)
|
||
has_spilled = true;
|
||
}
|
||
}
|
||
|
||
if (!has_spilled && !INTEL_DEBUG(DEBUG_NO16)) {
|
||
v16 = new fs_visitor(compiler, log_data, mem_ctx, &key->base,
|
||
&prog_data->base, shader,
|
||
16, debug_enabled);
|
||
const bool allow_spilling = (v == NULL);
|
||
if (!v16->run_bs(allow_spilling)) {
|
||
brw_shader_perf_log(compiler, log_data,
|
||
"SIMD16 shader failed to compile: %s\n",
|
||
v16->fail_msg);
|
||
if (v == NULL) {
|
||
assert(v8 == NULL);
|
||
if (error_str) {
|
||
*error_str = ralloc_asprintf(
|
||
mem_ctx, "SIMD8 disabled and couldn't generate SIMD16: %s",
|
||
v16->fail_msg);
|
||
}
|
||
delete v16;
|
||
return 0;
|
||
}
|
||
} else {
|
||
v = v16;
|
||
simd_size = 16;
|
||
if (v16->spilled_any_registers)
|
||
has_spilled = true;
|
||
}
|
||
}
|
||
|
||
if (unlikely(v == NULL)) {
|
||
assert(INTEL_DEBUG(DEBUG_NO8 | DEBUG_NO16));
|
||
if (error_str) {
|
||
*error_str = ralloc_strdup(mem_ctx,
|
||
"Cannot satisfy INTEL_DEBUG flags SIMD restrictions");
|
||
}
|
||
return false;
|
||
}
|
||
|
||
assert(v);
|
||
|
||
int offset = g->generate_code(v->cfg, simd_size, v->shader_stats,
|
||
v->performance_analysis.require(), stats);
|
||
if (prog_offset)
|
||
*prog_offset = offset;
|
||
else
|
||
assert(offset == 0);
|
||
|
||
delete v8;
|
||
delete v16;
|
||
|
||
return simd_size;
|
||
}
|
||
|
||
uint64_t
|
||
brw_bsr(const struct intel_device_info *devinfo,
|
||
uint32_t offset, uint8_t simd_size, uint8_t local_arg_offset)
|
||
{
|
||
assert(offset % 64 == 0);
|
||
assert(simd_size == 8 || simd_size == 16);
|
||
assert(local_arg_offset % 8 == 0);
|
||
|
||
return offset |
|
||
SET_BITS(simd_size == 8, 4, 4) |
|
||
SET_BITS(local_arg_offset / 8, 2, 0);
|
||
}
|
||
|
||
const unsigned *
|
||
brw_compile_bs(const struct brw_compiler *compiler,
|
||
void *mem_ctx,
|
||
struct brw_compile_bs_params *params)
|
||
{
|
||
nir_shader *shader = params->nir;
|
||
struct brw_bs_prog_data *prog_data = params->prog_data;
|
||
unsigned num_resume_shaders = params->num_resume_shaders;
|
||
nir_shader **resume_shaders = params->resume_shaders;
|
||
const bool debug_enabled = INTEL_DEBUG(DEBUG_RT);
|
||
|
||
prog_data->base.stage = shader->info.stage;
|
||
prog_data->base.ray_queries = shader->info.ray_queries;
|
||
prog_data->base.total_scratch = 0;
|
||
|
||
prog_data->max_stack_size = 0;
|
||
|
||
fs_generator g(compiler, params->log_data, mem_ctx, &prog_data->base,
|
||
false, shader->info.stage);
|
||
if (unlikely(debug_enabled)) {
|
||
char *name = ralloc_asprintf(mem_ctx, "%s %s shader %s",
|
||
shader->info.label ?
|
||
shader->info.label : "unnamed",
|
||
gl_shader_stage_name(shader->info.stage),
|
||
shader->info.name);
|
||
g.enable_debug(name);
|
||
}
|
||
|
||
prog_data->simd_size =
|
||
compile_single_bs(compiler, params->log_data, mem_ctx,
|
||
params->key, prog_data,
|
||
shader, &g, params->stats, NULL, ¶ms->error_str);
|
||
if (prog_data->simd_size == 0)
|
||
return NULL;
|
||
|
||
uint64_t *resume_sbt = ralloc_array(mem_ctx, uint64_t, num_resume_shaders);
|
||
for (unsigned i = 0; i < num_resume_shaders; i++) {
|
||
if (INTEL_DEBUG(DEBUG_RT)) {
|
||
char *name = ralloc_asprintf(mem_ctx, "%s %s resume(%u) shader %s",
|
||
shader->info.label ?
|
||
shader->info.label : "unnamed",
|
||
gl_shader_stage_name(shader->info.stage),
|
||
i, shader->info.name);
|
||
g.enable_debug(name);
|
||
}
|
||
|
||
/* TODO: Figure out shader stats etc. for resume shaders */
|
||
int offset = 0;
|
||
uint8_t simd_size =
|
||
compile_single_bs(compiler, params->log_data, mem_ctx, params->key,
|
||
prog_data, resume_shaders[i], &g, NULL, &offset,
|
||
¶ms->error_str);
|
||
if (simd_size == 0)
|
||
return NULL;
|
||
|
||
assert(offset > 0);
|
||
resume_sbt[i] = brw_bsr(compiler->devinfo, offset, simd_size, 0);
|
||
}
|
||
|
||
/* We only have one constant data so we want to make sure they're all the
|
||
* same.
|
||
*/
|
||
for (unsigned i = 0; i < num_resume_shaders; i++) {
|
||
assert(resume_shaders[i]->constant_data_size ==
|
||
shader->constant_data_size);
|
||
assert(memcmp(resume_shaders[i]->constant_data,
|
||
shader->constant_data,
|
||
shader->constant_data_size) == 0);
|
||
}
|
||
|
||
g.add_const_data(shader->constant_data, shader->constant_data_size);
|
||
g.add_resume_sbt(num_resume_shaders, resume_sbt);
|
||
|
||
return g.get_assembly();
|
||
}
|
||
|
||
/**
|
||
* Test the dispatch mask packing assumptions of
|
||
* brw_stage_has_packed_dispatch(). Call this from e.g. the top of
|
||
* fs_visitor::emit_nir_code() to cause a GPU hang if any shader invocation is
|
||
* executed with an unexpected dispatch mask.
|
||
*/
|
||
static UNUSED void
|
||
brw_fs_test_dispatch_packing(const fs_builder &bld)
|
||
{
|
||
const gl_shader_stage stage = bld.shader->stage;
|
||
const bool uses_vmask =
|
||
stage == MESA_SHADER_FRAGMENT &&
|
||
brw_wm_prog_data(bld.shader->stage_prog_data)->uses_vmask;
|
||
|
||
if (brw_stage_has_packed_dispatch(bld.shader->devinfo, stage,
|
||
bld.shader->stage_prog_data)) {
|
||
const fs_builder ubld = bld.exec_all().group(1, 0);
|
||
const fs_reg tmp = component(bld.vgrf(BRW_REGISTER_TYPE_UD), 0);
|
||
const fs_reg mask = uses_vmask ? brw_vmask_reg() : brw_dmask_reg();
|
||
|
||
ubld.ADD(tmp, mask, brw_imm_ud(1));
|
||
ubld.AND(tmp, mask, tmp);
|
||
|
||
/* This will loop forever if the dispatch mask doesn't have the expected
|
||
* form '2^n-1', in which case tmp will be non-zero.
|
||
*/
|
||
bld.emit(BRW_OPCODE_DO);
|
||
bld.CMP(bld.null_reg_ud(), tmp, brw_imm_ud(0), BRW_CONDITIONAL_NZ);
|
||
set_predicate(BRW_PREDICATE_NORMAL, bld.emit(BRW_OPCODE_WHILE));
|
||
}
|
||
}
|
||
|
||
unsigned
|
||
fs_visitor::workgroup_size() const
|
||
{
|
||
assert(gl_shader_stage_uses_workgroup(stage));
|
||
const struct brw_cs_prog_data *cs = brw_cs_prog_data(prog_data);
|
||
return cs->local_size[0] * cs->local_size[1] * cs->local_size[2];
|
||
}
|