/*
* Copyright © 2014 Broadcom
*
* 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 vc4_opt_algebraic.c
*
* This is the optimization pass for miscellaneous changes to instructions
* where we can simplify the operation by some knowledge about the specific
* operations.
*
* Mostly this will be a matter of turning things into MOVs so that they can
* later be copy-propagated out.
*/
#include "vc4_qir.h"
#include "util/u_math.h"
static bool debug;
static void
dump_from(struct vc4_compile *c, struct qinst *inst)
{
if (!debug)
return;
qir_dump_inst(c, inst);
}
static void
dump_to(struct vc4_compile *c, struct qinst *inst)
{
if (!debug)
return;
qir_dump_inst(c, inst);
}
static bool
is_constant_value(struct vc4_compile *c, struct qreg reg,
uint32_t val)
{
if (reg.file == QFILE_UNIF &&
c->uniform_contents[reg.index] == QUNIFORM_CONSTANT &&
c->uniform_data[reg.index] == val) {
return true;
}
if (reg.file == QFILE_SMALL_IMM && reg.index == val)
return true;
return false;
}
static bool
is_zero(struct vc4_compile *c, struct qreg reg)
{
reg = qir_follow_movs(c, reg);
return is_constant_value(c, reg, 0);
}
static bool
is_1f(struct vc4_compile *c, struct qreg reg)
{
reg = qir_follow_movs(c, reg);
return is_constant_value(c, reg, fui(1.0));
}
static void
replace_with_mov(struct vc4_compile *c, struct qinst *inst, struct qreg arg)
{
dump_from(c, inst);
inst->op = QOP_MOV;
inst->src[0] = arg;
inst->src[1] = c->undef;
dump_to(c, inst);
}
static bool
replace_x_0_with_x(struct vc4_compile *c,
struct qinst *inst,
int arg)
{
if (!is_zero(c, inst->src[arg]))
return false;
replace_with_mov(c, inst, inst->src[1 - arg]);
return true;
}
static bool
replace_x_0_with_0(struct vc4_compile *c,
struct qinst *inst,
int arg)
{
if (!is_zero(c, inst->src[arg]))
return false;
replace_with_mov(c, inst, inst->src[arg]);
return true;
}
static bool
fmul_replace_one(struct vc4_compile *c,
struct qinst *inst,
int arg)
{
if (!is_1f(c, inst->src[arg]))
return false;
replace_with_mov(c, inst, inst->src[1 - arg]);
return true;
}
bool
qir_opt_algebraic(struct vc4_compile *c)
{
bool progress = false;
struct simple_node *node;
foreach(node, &c->instructions) {
struct qinst *inst = (struct qinst *)node;
switch (inst->op) {
case QOP_SEL_X_Y_ZS:
case QOP_SEL_X_Y_ZC:
case QOP_SEL_X_Y_NS:
case QOP_SEL_X_Y_NC:
if (qir_reg_equals(inst->src[0], inst->src[1])) {
/* Turn "dst = (sf == x) ? a : a)" into
* "dst = a"
*/
replace_with_mov(c, inst, inst->src[1]);
progress = true;
break;
}
if (is_zero(c, inst->src[1])) {
/* Replace references to a 0 uniform value
* with the SEL_X_0 equivalent.
*/
dump_from(c, inst);
inst->op -= (QOP_SEL_X_Y_ZS - QOP_SEL_X_0_ZS);
inst->src[1] = c->undef;
progress = true;
dump_to(c, inst);
break;
}
if (is_zero(c, inst->src[0])) {
/* Replace references to a 0 uniform value
* with the SEL_X_0 equivalent, flipping the
* condition being evaluated since the operand
* order is flipped.
*/
dump_from(c, inst);
inst->op -= QOP_SEL_X_Y_ZS;
inst->op ^= 1;
inst->op += QOP_SEL_X_0_ZS;
inst->src[0] = inst->src[1];
inst->src[1] = c->undef;
progress = true;
dump_to(c, inst);
break;
}
break;
case QOP_FSUB:
case QOP_SUB:
if (is_zero(c, inst->src[1])) {
replace_with_mov(c, inst, inst->src[0]);
}
break;
case QOP_ADD:
if (replace_x_0_with_x(c, inst, 0) ||
replace_x_0_with_x(c, inst, 1)) {
progress = true;
break;
}
break;
case QOP_FADD:
if (replace_x_0_with_x(c, inst, 0) ||
replace_x_0_with_x(c, inst, 1)) {
progress = true;
break;
}
/* FADD(a, FSUB(0, b)) -> FSUB(a, b) */
if (inst->src[1].file == QFILE_TEMP &&
c->defs[inst->src[1].index]->op == QOP_FSUB) {
struct qinst *fsub = c->defs[inst->src[1].index];
if (is_zero(c, fsub->src[0])) {
dump_from(c, inst);
inst->op = QOP_FSUB;
inst->src[1] = fsub->src[1];
progress = true;
dump_to(c, inst);
break;
}
}
/* FADD(FSUB(0, b), a) -> FSUB(a, b) */
if (inst->src[0].file == QFILE_TEMP &&
c->defs[inst->src[0].index]->op == QOP_FSUB) {
struct qinst *fsub = c->defs[inst->src[0].index];
if (is_zero(c, fsub->src[0])) {
dump_from(c, inst);
inst->op = QOP_FSUB;
inst->src[0] = inst->src[1];
inst->src[1] = fsub->src[1];
dump_to(c, inst);
progress = true;
break;
}
}
break;
case QOP_FMUL:
if (replace_x_0_with_0(c, inst, 0) ||
replace_x_0_with_0(c, inst, 1) ||
fmul_replace_one(c, inst, 0) ||
fmul_replace_one(c, inst, 1)) {
progress = true;
break;
}
break;
case QOP_MUL24:
if (replace_x_0_with_0(c, inst, 0) ||
replace_x_0_with_0(c, inst, 1)) {
progress = true;
break;
}
break;
case QOP_AND:
if (replace_x_0_with_0(c, inst, 0) ||
replace_x_0_with_0(c, inst, 1)) {
progress = true;
break;
}
if (is_constant_value(c, inst->src[0], ~0)) {
replace_with_mov(c, inst, inst->src[1]);
progress = true;
break;
}
if (is_constant_value(c, inst->src[1], ~0)) {
replace_with_mov(c, inst, inst->src[0]);
progress = true;
break;
}
break;
case QOP_OR:
if (replace_x_0_with_x(c, inst, 0) ||
replace_x_0_with_x(c, inst, 1)) {
progress = true;
break;
}
break;
default:
break;
}
}
return progress;
}