shader_ir.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408
  1. // Copyright 2018 yuzu Emulator Project
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include <cmath>
  5. #include <unordered_map>
  6. #include "common/assert.h"
  7. #include "common/common_types.h"
  8. #include "common/logging/log.h"
  9. #include "video_core/engines/shader_bytecode.h"
  10. #include "video_core/shader/node_helper.h"
  11. #include "video_core/shader/shader_ir.h"
  12. namespace VideoCommon::Shader {
  13. using Tegra::Shader::Attribute;
  14. using Tegra::Shader::Instruction;
  15. using Tegra::Shader::IpaMode;
  16. using Tegra::Shader::Pred;
  17. using Tegra::Shader::PredCondition;
  18. using Tegra::Shader::PredOperation;
  19. using Tegra::Shader::Register;
  20. ShaderIR::ShaderIR(const ProgramCode& program_code, u32 main_offset, const std::size_t size)
  21. : program_code{program_code}, main_offset{main_offset}, program_size{size} {
  22. Decode();
  23. }
  24. ShaderIR::~ShaderIR() = default;
  25. Node ShaderIR::GetRegister(Register reg) {
  26. if (reg != Register::ZeroIndex) {
  27. used_registers.insert(static_cast<u32>(reg));
  28. }
  29. return MakeNode<GprNode>(reg);
  30. }
  31. Node ShaderIR::GetImmediate19(Instruction instr) {
  32. return Immediate(instr.alu.GetImm20_19());
  33. }
  34. Node ShaderIR::GetImmediate32(Instruction instr) {
  35. return Immediate(instr.alu.GetImm20_32());
  36. }
  37. Node ShaderIR::GetConstBuffer(u64 index_, u64 offset_) {
  38. const auto index = static_cast<u32>(index_);
  39. const auto offset = static_cast<u32>(offset_);
  40. const auto [entry, is_new] = used_cbufs.try_emplace(index);
  41. entry->second.MarkAsUsed(offset);
  42. return MakeNode<CbufNode>(index, Immediate(offset));
  43. }
  44. Node ShaderIR::GetConstBufferIndirect(u64 index_, u64 offset_, Node node) {
  45. const auto index = static_cast<u32>(index_);
  46. const auto offset = static_cast<u32>(offset_);
  47. const auto [entry, is_new] = used_cbufs.try_emplace(index);
  48. entry->second.MarkAsUsedIndirect();
  49. Node final_offset = [&] {
  50. // Attempt to inline constant buffer without a variable offset. This is done to allow
  51. // tracking LDC calls.
  52. if (const auto gpr = std::get_if<GprNode>(&*node)) {
  53. if (gpr->GetIndex() == Register::ZeroIndex) {
  54. return Immediate(offset);
  55. }
  56. }
  57. return Operation(OperationCode::UAdd, NO_PRECISE, std::move(node), Immediate(offset));
  58. }();
  59. return MakeNode<CbufNode>(index, std::move(final_offset));
  60. }
  61. Node ShaderIR::GetPredicate(u64 pred_, bool negated) {
  62. const auto pred = static_cast<Pred>(pred_);
  63. if (pred != Pred::UnusedIndex && pred != Pred::NeverExecute) {
  64. used_predicates.insert(pred);
  65. }
  66. return MakeNode<PredicateNode>(pred, negated);
  67. }
  68. Node ShaderIR::GetPredicate(bool immediate) {
  69. return GetPredicate(static_cast<u64>(immediate ? Pred::UnusedIndex : Pred::NeverExecute));
  70. }
  71. Node ShaderIR::GetInputAttribute(Attribute::Index index, u64 element, Node buffer) {
  72. used_input_attributes.emplace(index);
  73. return MakeNode<AbufNode>(index, static_cast<u32>(element), std::move(buffer));
  74. }
  75. Node ShaderIR::GetPhysicalInputAttribute(Tegra::Shader::Register physical_address, Node buffer) {
  76. uses_physical_attributes = true;
  77. return MakeNode<AbufNode>(GetRegister(physical_address), buffer);
  78. }
  79. Node ShaderIR::GetOutputAttribute(Attribute::Index index, u64 element, Node buffer) {
  80. if (index == Attribute::Index::LayerViewportPointSize) {
  81. switch (element) {
  82. case 0:
  83. UNIMPLEMENTED();
  84. break;
  85. case 1:
  86. uses_layer = true;
  87. break;
  88. case 2:
  89. uses_viewport_index = true;
  90. break;
  91. case 3:
  92. uses_point_size = true;
  93. break;
  94. }
  95. }
  96. if (index == Attribute::Index::ClipDistances0123 ||
  97. index == Attribute::Index::ClipDistances4567) {
  98. const auto clip_index =
  99. static_cast<u32>((index == Attribute::Index::ClipDistances4567 ? 1 : 0) + element);
  100. used_clip_distances.at(clip_index) = true;
  101. }
  102. used_output_attributes.insert(index);
  103. return MakeNode<AbufNode>(index, static_cast<u32>(element), std::move(buffer));
  104. }
  105. Node ShaderIR::GetInternalFlag(InternalFlag flag, bool negated) {
  106. const Node node = MakeNode<InternalFlagNode>(flag);
  107. if (negated) {
  108. return Operation(OperationCode::LogicalNegate, node);
  109. }
  110. return node;
  111. }
  112. Node ShaderIR::GetLocalMemory(Node address) {
  113. return MakeNode<LmemNode>(std::move(address));
  114. }
  115. Node ShaderIR::GetTemporary(u32 id) {
  116. return GetRegister(Register::ZeroIndex + 1 + id);
  117. }
  118. Node ShaderIR::GetOperandAbsNegFloat(Node value, bool absolute, bool negate) {
  119. if (absolute) {
  120. value = Operation(OperationCode::FAbsolute, NO_PRECISE, std::move(value));
  121. }
  122. if (negate) {
  123. value = Operation(OperationCode::FNegate, NO_PRECISE, std::move(value));
  124. }
  125. return value;
  126. }
  127. Node ShaderIR::GetSaturatedFloat(Node value, bool saturate) {
  128. if (!saturate) {
  129. return value;
  130. }
  131. Node positive_zero = Immediate(std::copysignf(0, 1));
  132. Node positive_one = Immediate(1.0f);
  133. return Operation(OperationCode::FClamp, NO_PRECISE, std::move(value), std::move(positive_zero),
  134. std::move(positive_one));
  135. }
  136. Node ShaderIR::ConvertIntegerSize(Node value, Register::Size size, bool is_signed) {
  137. switch (size) {
  138. case Register::Size::Byte:
  139. value = SignedOperation(OperationCode::ILogicalShiftLeft, is_signed, NO_PRECISE,
  140. std::move(value), Immediate(24));
  141. value = SignedOperation(OperationCode::IArithmeticShiftRight, is_signed, NO_PRECISE,
  142. std::move(value), Immediate(24));
  143. return value;
  144. case Register::Size::Short:
  145. value = SignedOperation(OperationCode::ILogicalShiftLeft, is_signed, NO_PRECISE,
  146. std::move(value), Immediate(16));
  147. value = SignedOperation(OperationCode::IArithmeticShiftRight, is_signed, NO_PRECISE,
  148. std::move(value), Immediate(16));
  149. case Register::Size::Word:
  150. // Default - do nothing
  151. return value;
  152. default:
  153. UNREACHABLE_MSG("Unimplemented conversion size: {}", static_cast<u32>(size));
  154. return value;
  155. }
  156. }
  157. Node ShaderIR::GetOperandAbsNegInteger(Node value, bool absolute, bool negate, bool is_signed) {
  158. if (!is_signed) {
  159. // Absolute or negate on an unsigned is pointless
  160. return value;
  161. }
  162. if (absolute) {
  163. value = Operation(OperationCode::IAbsolute, NO_PRECISE, std::move(value));
  164. }
  165. if (negate) {
  166. value = Operation(OperationCode::INegate, NO_PRECISE, std::move(value));
  167. }
  168. return value;
  169. }
  170. Node ShaderIR::UnpackHalfImmediate(Instruction instr, bool has_negation) {
  171. Node value = Immediate(instr.half_imm.PackImmediates());
  172. if (!has_negation) {
  173. return value;
  174. }
  175. Node first_negate = GetPredicate(instr.half_imm.first_negate != 0);
  176. Node second_negate = GetPredicate(instr.half_imm.second_negate != 0);
  177. return Operation(OperationCode::HNegate, NO_PRECISE, std::move(value), std::move(first_negate),
  178. std::move(second_negate));
  179. }
  180. Node ShaderIR::UnpackHalfFloat(Node value, Tegra::Shader::HalfType type) {
  181. return Operation(OperationCode::HUnpack, type, std::move(value));
  182. }
  183. Node ShaderIR::HalfMerge(Node dest, Node src, Tegra::Shader::HalfMerge merge) {
  184. switch (merge) {
  185. case Tegra::Shader::HalfMerge::H0_H1:
  186. return src;
  187. case Tegra::Shader::HalfMerge::F32:
  188. return Operation(OperationCode::HMergeF32, std::move(src));
  189. case Tegra::Shader::HalfMerge::Mrg_H0:
  190. return Operation(OperationCode::HMergeH0, std::move(dest), std::move(src));
  191. case Tegra::Shader::HalfMerge::Mrg_H1:
  192. return Operation(OperationCode::HMergeH1, std::move(dest), std::move(src));
  193. }
  194. UNREACHABLE();
  195. return src;
  196. }
  197. Node ShaderIR::GetOperandAbsNegHalf(Node value, bool absolute, bool negate) {
  198. if (absolute) {
  199. value = Operation(OperationCode::HAbsolute, NO_PRECISE, std::move(value));
  200. }
  201. if (negate) {
  202. value = Operation(OperationCode::HNegate, NO_PRECISE, std::move(value), GetPredicate(true),
  203. GetPredicate(true));
  204. }
  205. return value;
  206. }
  207. Node ShaderIR::GetSaturatedHalfFloat(Node value, bool saturate) {
  208. if (!saturate) {
  209. return value;
  210. }
  211. Node positive_zero = Immediate(std::copysignf(0, 1));
  212. Node positive_one = Immediate(1.0f);
  213. return Operation(OperationCode::HClamp, NO_PRECISE, std::move(value), std::move(positive_zero),
  214. std::move(positive_one));
  215. }
  216. Node ShaderIR::GetPredicateComparisonFloat(PredCondition condition, Node op_a, Node op_b) {
  217. const std::unordered_map<PredCondition, OperationCode> PredicateComparisonTable = {
  218. {PredCondition::LessThan, OperationCode::LogicalFLessThan},
  219. {PredCondition::Equal, OperationCode::LogicalFEqual},
  220. {PredCondition::LessEqual, OperationCode::LogicalFLessEqual},
  221. {PredCondition::GreaterThan, OperationCode::LogicalFGreaterThan},
  222. {PredCondition::NotEqual, OperationCode::LogicalFNotEqual},
  223. {PredCondition::GreaterEqual, OperationCode::LogicalFGreaterEqual},
  224. {PredCondition::LessThanWithNan, OperationCode::LogicalFLessThan},
  225. {PredCondition::NotEqualWithNan, OperationCode::LogicalFNotEqual},
  226. {PredCondition::LessEqualWithNan, OperationCode::LogicalFLessEqual},
  227. {PredCondition::GreaterThanWithNan, OperationCode::LogicalFGreaterThan},
  228. {PredCondition::GreaterEqualWithNan, OperationCode::LogicalFGreaterEqual}};
  229. const auto comparison{PredicateComparisonTable.find(condition)};
  230. UNIMPLEMENTED_IF_MSG(comparison == PredicateComparisonTable.end(),
  231. "Unknown predicate comparison operation");
  232. Node predicate = Operation(comparison->second, NO_PRECISE, op_a, op_b);
  233. if (condition == PredCondition::LessThanWithNan ||
  234. condition == PredCondition::NotEqualWithNan ||
  235. condition == PredCondition::LessEqualWithNan ||
  236. condition == PredCondition::GreaterThanWithNan ||
  237. condition == PredCondition::GreaterEqualWithNan) {
  238. predicate = Operation(OperationCode::LogicalOr, predicate,
  239. Operation(OperationCode::LogicalFIsNan, op_a));
  240. predicate = Operation(OperationCode::LogicalOr, predicate,
  241. Operation(OperationCode::LogicalFIsNan, op_b));
  242. }
  243. return predicate;
  244. }
  245. Node ShaderIR::GetPredicateComparisonInteger(PredCondition condition, bool is_signed, Node op_a,
  246. Node op_b) {
  247. const std::unordered_map<PredCondition, OperationCode> PredicateComparisonTable = {
  248. {PredCondition::LessThan, OperationCode::LogicalILessThan},
  249. {PredCondition::Equal, OperationCode::LogicalIEqual},
  250. {PredCondition::LessEqual, OperationCode::LogicalILessEqual},
  251. {PredCondition::GreaterThan, OperationCode::LogicalIGreaterThan},
  252. {PredCondition::NotEqual, OperationCode::LogicalINotEqual},
  253. {PredCondition::GreaterEqual, OperationCode::LogicalIGreaterEqual},
  254. {PredCondition::LessThanWithNan, OperationCode::LogicalILessThan},
  255. {PredCondition::NotEqualWithNan, OperationCode::LogicalINotEqual},
  256. {PredCondition::LessEqualWithNan, OperationCode::LogicalILessEqual},
  257. {PredCondition::GreaterThanWithNan, OperationCode::LogicalIGreaterThan},
  258. {PredCondition::GreaterEqualWithNan, OperationCode::LogicalIGreaterEqual}};
  259. const auto comparison{PredicateComparisonTable.find(condition)};
  260. UNIMPLEMENTED_IF_MSG(comparison == PredicateComparisonTable.end(),
  261. "Unknown predicate comparison operation");
  262. Node predicate = SignedOperation(comparison->second, is_signed, NO_PRECISE, std::move(op_a),
  263. std::move(op_b));
  264. UNIMPLEMENTED_IF_MSG(condition == PredCondition::LessThanWithNan ||
  265. condition == PredCondition::NotEqualWithNan ||
  266. condition == PredCondition::LessEqualWithNan ||
  267. condition == PredCondition::GreaterThanWithNan ||
  268. condition == PredCondition::GreaterEqualWithNan,
  269. "NaN comparisons for integers are not implemented");
  270. return predicate;
  271. }
  272. Node ShaderIR::GetPredicateComparisonHalf(Tegra::Shader::PredCondition condition, Node op_a,
  273. Node op_b) {
  274. const std::unordered_map<PredCondition, OperationCode> PredicateComparisonTable = {
  275. {PredCondition::LessThan, OperationCode::Logical2HLessThan},
  276. {PredCondition::Equal, OperationCode::Logical2HEqual},
  277. {PredCondition::LessEqual, OperationCode::Logical2HLessEqual},
  278. {PredCondition::GreaterThan, OperationCode::Logical2HGreaterThan},
  279. {PredCondition::NotEqual, OperationCode::Logical2HNotEqual},
  280. {PredCondition::GreaterEqual, OperationCode::Logical2HGreaterEqual},
  281. {PredCondition::LessThanWithNan, OperationCode::Logical2HLessThanWithNan},
  282. {PredCondition::NotEqualWithNan, OperationCode::Logical2HNotEqualWithNan},
  283. {PredCondition::LessEqualWithNan, OperationCode::Logical2HLessEqualWithNan},
  284. {PredCondition::GreaterThanWithNan, OperationCode::Logical2HGreaterThanWithNan},
  285. {PredCondition::GreaterEqualWithNan, OperationCode::Logical2HGreaterEqualWithNan}};
  286. const auto comparison{PredicateComparisonTable.find(condition)};
  287. UNIMPLEMENTED_IF_MSG(comparison == PredicateComparisonTable.end(),
  288. "Unknown predicate comparison operation");
  289. return Operation(comparison->second, NO_PRECISE, std::move(op_a), std::move(op_b));
  290. }
  291. OperationCode ShaderIR::GetPredicateCombiner(PredOperation operation) {
  292. const std::unordered_map<PredOperation, OperationCode> PredicateOperationTable = {
  293. {PredOperation::And, OperationCode::LogicalAnd},
  294. {PredOperation::Or, OperationCode::LogicalOr},
  295. {PredOperation::Xor, OperationCode::LogicalXor},
  296. };
  297. const auto op = PredicateOperationTable.find(operation);
  298. UNIMPLEMENTED_IF_MSG(op == PredicateOperationTable.end(), "Unknown predicate operation");
  299. return op->second;
  300. }
  301. Node ShaderIR::GetConditionCode(Tegra::Shader::ConditionCode cc) {
  302. switch (cc) {
  303. case Tegra::Shader::ConditionCode::NEU:
  304. return GetInternalFlag(InternalFlag::Zero, true);
  305. default:
  306. UNIMPLEMENTED_MSG("Unimplemented condition code: {}", static_cast<u32>(cc));
  307. return GetPredicate(static_cast<u64>(Pred::NeverExecute));
  308. }
  309. }
  310. void ShaderIR::SetRegister(NodeBlock& bb, Register dest, Node src) {
  311. bb.push_back(Operation(OperationCode::Assign, GetRegister(dest), std::move(src)));
  312. }
  313. void ShaderIR::SetPredicate(NodeBlock& bb, u64 dest, Node src) {
  314. bb.push_back(Operation(OperationCode::LogicalAssign, GetPredicate(dest), std::move(src)));
  315. }
  316. void ShaderIR::SetInternalFlag(NodeBlock& bb, InternalFlag flag, Node value) {
  317. bb.push_back(Operation(OperationCode::LogicalAssign, GetInternalFlag(flag), std::move(value)));
  318. }
  319. void ShaderIR::SetLocalMemory(NodeBlock& bb, Node address, Node value) {
  320. bb.push_back(
  321. Operation(OperationCode::Assign, GetLocalMemory(std::move(address)), std::move(value)));
  322. }
  323. void ShaderIR::SetTemporary(NodeBlock& bb, u32 id, Node value) {
  324. SetRegister(bb, Register::ZeroIndex + 1 + id, std::move(value));
  325. }
  326. void ShaderIR::SetInternalFlagsFromFloat(NodeBlock& bb, Node value, bool sets_cc) {
  327. if (!sets_cc) {
  328. return;
  329. }
  330. Node zerop = Operation(OperationCode::LogicalFEqual, std::move(value), Immediate(0.0f));
  331. SetInternalFlag(bb, InternalFlag::Zero, std::move(zerop));
  332. LOG_WARNING(HW_GPU, "Condition codes implementation is incomplete");
  333. }
  334. void ShaderIR::SetInternalFlagsFromInteger(NodeBlock& bb, Node value, bool sets_cc) {
  335. if (!sets_cc) {
  336. return;
  337. }
  338. Node zerop = Operation(OperationCode::LogicalIEqual, std::move(value), Immediate(0));
  339. SetInternalFlag(bb, InternalFlag::Zero, std::move(zerop));
  340. LOG_WARNING(HW_GPU, "Condition codes implementation is incomplete");
  341. }
  342. Node ShaderIR::BitfieldExtract(Node value, u32 offset, u32 bits) {
  343. return Operation(OperationCode::UBitfieldExtract, NO_PRECISE, std::move(value),
  344. Immediate(offset), Immediate(bits));
  345. }
  346. } // namespace VideoCommon::Shader