Lop3Expression.cs 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  1. using Ryujinx.Graphics.Shader.IntermediateRepresentation;
  2. using Ryujinx.Graphics.Shader.Translation;
  3. using static Ryujinx.Graphics.Shader.IntermediateRepresentation.OperandHelper;
  4. namespace Ryujinx.Graphics.Shader.Instructions
  5. {
  6. static class Lop3Expression
  7. {
  8. public static Operand GetFromTruthTable(
  9. EmitterContext context,
  10. Operand srcA,
  11. Operand srcB,
  12. Operand srcC,
  13. int imm)
  14. {
  15. Operand expr = null;
  16. // Handle some simple cases, or cases where
  17. // the KMap would yield poor results (like XORs).
  18. if (imm == 0x96 || imm == 0x69)
  19. {
  20. // XOR (0x96) and XNOR (0x69).
  21. if (imm == 0x69)
  22. {
  23. srcA = context.BitwiseNot(srcA);
  24. }
  25. expr = context.BitwiseExclusiveOr(srcA, srcB);
  26. expr = context.BitwiseExclusiveOr(expr, srcC);
  27. return expr;
  28. }
  29. else if (imm == 0)
  30. {
  31. // Always false.
  32. return Const(IrConsts.False);
  33. }
  34. else if (imm == 0xff)
  35. {
  36. // Always true.
  37. return Const(IrConsts.True);
  38. }
  39. int map;
  40. // Encode into gray code.
  41. map = ((imm >> 0) & 1) << 0;
  42. map |= ((imm >> 1) & 1) << 4;
  43. map |= ((imm >> 2) & 1) << 1;
  44. map |= ((imm >> 3) & 1) << 5;
  45. map |= ((imm >> 4) & 1) << 3;
  46. map |= ((imm >> 5) & 1) << 7;
  47. map |= ((imm >> 6) & 1) << 2;
  48. map |= ((imm >> 7) & 1) << 6;
  49. // Solve KMap, get sum of products.
  50. int visited = 0;
  51. for (int index = 0; index < 8 && visited != 0xff; index++)
  52. {
  53. if ((map & (1 << index)) == 0)
  54. {
  55. continue;
  56. }
  57. int mask = 0;
  58. for (int mSize = 4; mSize != 0; mSize >>= 1)
  59. {
  60. mask = RotateLeft4((1 << mSize) - 1, index & 3) << (index & 4);
  61. if ((map & mask) == mask)
  62. {
  63. break;
  64. }
  65. }
  66. // The mask should wrap, if we are on the high row, shift to low etc.
  67. int mask2 = (index & 4) != 0 ? mask >> 4 : mask << 4;
  68. if ((map & mask2) == mask2)
  69. {
  70. mask |= mask2;
  71. }
  72. if ((mask & visited) == mask)
  73. {
  74. continue;
  75. }
  76. bool notA = (mask & 0x33) != 0;
  77. bool notB = (mask & 0x99) != 0;
  78. bool notC = (mask & 0x0f) != 0;
  79. bool aChanges = (mask & 0xcc) != 0 && notA;
  80. bool bChanges = (mask & 0x66) != 0 && notB;
  81. bool cChanges = (mask & 0xf0) != 0 && notC;
  82. Operand localExpr = null;
  83. void And(Operand source)
  84. {
  85. if (localExpr != null)
  86. {
  87. localExpr = context.BitwiseAnd(localExpr, source);
  88. }
  89. else
  90. {
  91. localExpr = source;
  92. }
  93. }
  94. if (!aChanges)
  95. {
  96. And(context.BitwiseNot(srcA, notA));
  97. }
  98. if (!bChanges)
  99. {
  100. And(context.BitwiseNot(srcB, notB));
  101. }
  102. if (!cChanges)
  103. {
  104. And(context.BitwiseNot(srcC, notC));
  105. }
  106. if (expr != null)
  107. {
  108. expr = context.BitwiseOr(expr, localExpr);
  109. }
  110. else
  111. {
  112. expr = localExpr;
  113. }
  114. visited |= mask;
  115. }
  116. return expr;
  117. }
  118. private static int RotateLeft4(int value, int shift)
  119. {
  120. return ((value << shift) | (value >> (4 - shift))) & 0xf;
  121. }
  122. }
  123. }