Block.cs 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  1. using System;
  2. using System.Collections.Generic;
  3. namespace Ryujinx.Graphics.Shader.Decoders
  4. {
  5. class Block
  6. {
  7. public ulong Address { get; set; }
  8. public ulong EndAddress { get; set; }
  9. private Block _next;
  10. private Block _branch;
  11. public Block Next
  12. {
  13. get
  14. {
  15. return _next;
  16. }
  17. set
  18. {
  19. _next?.Predecessors.Remove(this);
  20. value?.Predecessors.Add(this);
  21. _next = value;
  22. }
  23. }
  24. public Block Branch
  25. {
  26. get
  27. {
  28. return _branch;
  29. }
  30. set
  31. {
  32. _branch?.Predecessors.Remove(this);
  33. value?.Predecessors.Add(this);
  34. _branch = value;
  35. }
  36. }
  37. public HashSet<Block> Predecessors { get; }
  38. public List<OpCode> OpCodes { get; }
  39. public List<OpCodePush> PushOpCodes { get; }
  40. public Block(ulong address)
  41. {
  42. Address = address;
  43. Predecessors = new HashSet<Block>();
  44. OpCodes = new List<OpCode>();
  45. PushOpCodes = new List<OpCodePush>();
  46. }
  47. public void Split(Block rightBlock)
  48. {
  49. int splitIndex = BinarySearch(OpCodes, rightBlock.Address);
  50. if (OpCodes[splitIndex].Address < rightBlock.Address)
  51. {
  52. splitIndex++;
  53. }
  54. int splitCount = OpCodes.Count - splitIndex;
  55. if (splitCount <= 0)
  56. {
  57. throw new ArgumentException("Can't split at right block address.");
  58. }
  59. rightBlock.EndAddress = EndAddress;
  60. rightBlock.Next = Next;
  61. rightBlock.Branch = Branch;
  62. rightBlock.OpCodes.AddRange(OpCodes.GetRange(splitIndex, splitCount));
  63. rightBlock.UpdatePushOps();
  64. EndAddress = rightBlock.Address;
  65. Next = rightBlock;
  66. Branch = null;
  67. OpCodes.RemoveRange(splitIndex, splitCount);
  68. UpdatePushOps();
  69. }
  70. private static int BinarySearch(List<OpCode> opCodes, ulong address)
  71. {
  72. int left = 0;
  73. int middle = 0;
  74. int right = opCodes.Count - 1;
  75. while (left <= right)
  76. {
  77. int size = right - left;
  78. middle = left + (size >> 1);
  79. OpCode opCode = opCodes[middle];
  80. if (address == opCode.Address)
  81. {
  82. break;
  83. }
  84. if (address < opCode.Address)
  85. {
  86. right = middle - 1;
  87. }
  88. else
  89. {
  90. left = middle + 1;
  91. }
  92. }
  93. return middle;
  94. }
  95. public OpCode GetLastOp()
  96. {
  97. if (OpCodes.Count != 0)
  98. {
  99. return OpCodes[OpCodes.Count - 1];
  100. }
  101. return null;
  102. }
  103. public void UpdatePushOps()
  104. {
  105. PushOpCodes.Clear();
  106. for (int index = 0; index < OpCodes.Count; index++)
  107. {
  108. if (!(OpCodes[index] is OpCodePush op))
  109. {
  110. continue;
  111. }
  112. PushOpCodes.Add(op);
  113. }
  114. }
  115. }
  116. }