Merge pull request #510 from Subv/isetp
GPU: Implemented the ISETP_R and ISETP_C instructions
This commit is contained in:
commit
f564822e78
|
@ -238,6 +238,16 @@ union Instruction {
|
||||||
BitField<56, 1, u64> neg_b;
|
BitField<56, 1, u64> neg_b;
|
||||||
} fsetp;
|
} fsetp;
|
||||||
|
|
||||||
|
union {
|
||||||
|
BitField<0, 3, u64> pred0;
|
||||||
|
BitField<3, 3, u64> pred3;
|
||||||
|
BitField<39, 3, u64> pred39;
|
||||||
|
BitField<42, 1, u64> neg_pred;
|
||||||
|
BitField<45, 2, PredOperation> op;
|
||||||
|
BitField<48, 1, u64> is_signed;
|
||||||
|
BitField<49, 3, PredCondition> cond;
|
||||||
|
} isetp;
|
||||||
|
|
||||||
union {
|
union {
|
||||||
BitField<39, 3, u64> pred39;
|
BitField<39, 3, u64> pred39;
|
||||||
BitField<42, 1, u64> neg_pred;
|
BitField<42, 1, u64> neg_pred;
|
||||||
|
|
|
@ -219,6 +219,11 @@ public:
|
||||||
return active_type == Type::Integer;
|
return active_type == Type::Integer;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Returns the current active type of the register
|
||||||
|
Type GetActiveType() const {
|
||||||
|
return active_type;
|
||||||
|
}
|
||||||
|
|
||||||
/// Returns the index of the register
|
/// Returns the index of the register
|
||||||
size_t GetIndex() const {
|
size_t GetIndex() const {
|
||||||
return index;
|
return index;
|
||||||
|
@ -350,22 +355,28 @@ public:
|
||||||
shader.AddLine(dest + " = " + src + ';');
|
shader.AddLine(dest + " = " + src + ';');
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Generates code representing a uniform (C buffer) register.
|
/// Generates code representing a uniform (C buffer) register, interpreted as the input type.
|
||||||
std::string GetUniform(const Uniform& uniform, const Register& dest_reg) {
|
std::string GetUniform(const Uniform& uniform, GLSLRegister::Type type) {
|
||||||
declr_const_buffers[uniform.index].MarkAsUsed(static_cast<unsigned>(uniform.index),
|
declr_const_buffers[uniform.index].MarkAsUsed(static_cast<unsigned>(uniform.index),
|
||||||
static_cast<unsigned>(uniform.offset), stage);
|
static_cast<unsigned>(uniform.offset), stage);
|
||||||
std::string value =
|
std::string value =
|
||||||
'c' + std::to_string(uniform.index) + '[' + std::to_string(uniform.offset) + ']';
|
'c' + std::to_string(uniform.index) + '[' + std::to_string(uniform.offset) + ']';
|
||||||
|
|
||||||
if (regs[dest_reg].IsFloat()) {
|
if (type == GLSLRegister::Type::Float) {
|
||||||
return value;
|
return value;
|
||||||
} else if (regs[dest_reg].IsInteger()) {
|
} else if (type == GLSLRegister::Type::Integer) {
|
||||||
return "floatBitsToInt(" + value + ')';
|
return "floatBitsToInt(" + value + ')';
|
||||||
} else {
|
} else {
|
||||||
UNREACHABLE();
|
UNREACHABLE();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Generates code representing a uniform (C buffer) register, interpreted as the type of the
|
||||||
|
/// destination register.
|
||||||
|
std::string GetUniform(const Uniform& uniform, const Register& dest_reg) {
|
||||||
|
return GetUniform(uniform, regs[dest_reg].GetActiveType());
|
||||||
|
}
|
||||||
|
|
||||||
/// Add declarations for registers
|
/// Add declarations for registers
|
||||||
void GenerateDeclarations() {
|
void GenerateDeclarations() {
|
||||||
for (const auto& reg : regs) {
|
for (const auto& reg : regs) {
|
||||||
|
@ -1018,7 +1029,7 @@ private:
|
||||||
if (instr.is_b_gpr) {
|
if (instr.is_b_gpr) {
|
||||||
op_b += regs.GetRegisterAsFloat(instr.gpr20);
|
op_b += regs.GetRegisterAsFloat(instr.gpr20);
|
||||||
} else {
|
} else {
|
||||||
op_b += regs.GetUniform(instr.uniform, instr.gpr0);
|
op_b += regs.GetUniform(instr.uniform, GLSLRegister::Type::Float);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1049,6 +1060,42 @@ private:
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
case OpCode::Type::IntegerSetPredicate: {
|
||||||
|
std::string op_a = regs.GetRegisterAsInteger(instr.gpr8, 0, instr.isetp.is_signed);
|
||||||
|
|
||||||
|
std::string op_b{};
|
||||||
|
|
||||||
|
ASSERT_MSG(!instr.is_b_imm, "ISETP_IMM not implemented");
|
||||||
|
|
||||||
|
if (instr.is_b_gpr) {
|
||||||
|
op_b += regs.GetRegisterAsInteger(instr.gpr20, 0, instr.isetp.is_signed);
|
||||||
|
} else {
|
||||||
|
op_b += regs.GetUniform(instr.uniform, GLSLRegister::Type::Integer);
|
||||||
|
}
|
||||||
|
|
||||||
|
using Tegra::Shader::Pred;
|
||||||
|
// We can't use the constant predicate as destination.
|
||||||
|
ASSERT(instr.isetp.pred3 != static_cast<u64>(Pred::UnusedIndex));
|
||||||
|
|
||||||
|
std::string second_pred =
|
||||||
|
GetPredicateCondition(instr.isetp.pred39, instr.isetp.neg_pred != 0);
|
||||||
|
|
||||||
|
std::string comparator = GetPredicateComparison(instr.isetp.cond);
|
||||||
|
std::string combiner = GetPredicateCombiner(instr.isetp.op);
|
||||||
|
|
||||||
|
std::string predicate = '(' + op_a + ") " + comparator + " (" + op_b + ')';
|
||||||
|
// Set the primary predicate to the result of Predicate OP SecondPredicate
|
||||||
|
SetPredicate(instr.isetp.pred3,
|
||||||
|
'(' + predicate + ") " + combiner + " (" + second_pred + ')');
|
||||||
|
|
||||||
|
if (instr.isetp.pred0 != static_cast<u64>(Pred::UnusedIndex)) {
|
||||||
|
// Set the secondary predicate to the result of !Predicate OP SecondPredicate,
|
||||||
|
// if enabled
|
||||||
|
SetPredicate(instr.isetp.pred0,
|
||||||
|
"!(" + predicate + ") " + combiner + " (" + second_pred + ')');
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
case OpCode::Type::FloatSet: {
|
case OpCode::Type::FloatSet: {
|
||||||
std::string op_a = instr.fset.neg_a ? "-" : "";
|
std::string op_a = instr.fset.neg_a ? "-" : "";
|
||||||
op_a += regs.GetRegisterAsFloat(instr.gpr8);
|
op_a += regs.GetRegisterAsFloat(instr.gpr8);
|
||||||
|
@ -1069,7 +1116,7 @@ private:
|
||||||
if (instr.is_b_gpr) {
|
if (instr.is_b_gpr) {
|
||||||
op_b += regs.GetRegisterAsFloat(instr.gpr20);
|
op_b += regs.GetRegisterAsFloat(instr.gpr20);
|
||||||
} else {
|
} else {
|
||||||
op_b += regs.GetUniform(instr.uniform, instr.gpr0);
|
op_b += regs.GetUniform(instr.uniform, GLSLRegister::Type::Float);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Reference in New Issue