Decoder.cs 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762
  1. using Ryujinx.Graphics.Shader.Translation;
  2. using System;
  3. using System.Collections.Generic;
  4. using System.Linq;
  5. using System.Runtime.CompilerServices;
  6. using static Ryujinx.Graphics.Shader.IntermediateRepresentation.OperandHelper;
  7. namespace Ryujinx.Graphics.Shader.Decoders
  8. {
  9. static class Decoder
  10. {
  11. public static DecodedProgram Decode(ShaderConfig config, ulong startAddress)
  12. {
  13. Queue<DecodedFunction> functionsQueue = new Queue<DecodedFunction>();
  14. Dictionary<ulong, DecodedFunction> functionsVisited = new Dictionary<ulong, DecodedFunction>();
  15. DecodedFunction EnqueueFunction(ulong address)
  16. {
  17. if (!functionsVisited.TryGetValue(address, out DecodedFunction function))
  18. {
  19. functionsVisited.Add(address, function = new DecodedFunction(address));
  20. functionsQueue.Enqueue(function);
  21. }
  22. return function;
  23. }
  24. DecodedFunction mainFunction = EnqueueFunction(0);
  25. while (functionsQueue.TryDequeue(out DecodedFunction currentFunction))
  26. {
  27. List<Block> blocks = new List<Block>();
  28. Queue<Block> workQueue = new Queue<Block>();
  29. Dictionary<ulong, Block> visited = new Dictionary<ulong, Block>();
  30. Block GetBlock(ulong blkAddress)
  31. {
  32. if (!visited.TryGetValue(blkAddress, out Block block))
  33. {
  34. block = new Block(blkAddress);
  35. workQueue.Enqueue(block);
  36. visited.Add(blkAddress, block);
  37. }
  38. return block;
  39. }
  40. GetBlock(currentFunction.Address);
  41. bool hasNewTarget;
  42. do
  43. {
  44. while (workQueue.TryDequeue(out Block currBlock))
  45. {
  46. // Check if the current block is inside another block.
  47. if (BinarySearch(blocks, currBlock.Address, out int nBlkIndex))
  48. {
  49. Block nBlock = blocks[nBlkIndex];
  50. if (nBlock.Address == currBlock.Address)
  51. {
  52. throw new InvalidOperationException("Found duplicate block address on the list.");
  53. }
  54. nBlock.Split(currBlock);
  55. blocks.Insert(nBlkIndex + 1, currBlock);
  56. continue;
  57. }
  58. // If we have a block after the current one, set the limit address.
  59. ulong limitAddress = ulong.MaxValue;
  60. if (nBlkIndex != blocks.Count)
  61. {
  62. Block nBlock = blocks[nBlkIndex];
  63. int nextIndex = nBlkIndex + 1;
  64. if (nBlock.Address < currBlock.Address && nextIndex < blocks.Count)
  65. {
  66. limitAddress = blocks[nextIndex].Address;
  67. }
  68. else if (nBlock.Address > currBlock.Address)
  69. {
  70. limitAddress = blocks[nBlkIndex].Address;
  71. }
  72. }
  73. FillBlock(config, currBlock, limitAddress, startAddress);
  74. if (currBlock.OpCodes.Count != 0)
  75. {
  76. // We should have blocks for all possible branch targets,
  77. // including those from PBK/PCNT/SSY instructions.
  78. foreach (PushOpInfo pushOp in currBlock.PushOpCodes)
  79. {
  80. GetBlock(pushOp.Op.GetAbsoluteAddress());
  81. }
  82. // Set child blocks. "Branch" is the block the branch instruction
  83. // points to (when taken), "Next" is the block at the next address,
  84. // executed when the branch is not taken. For Unconditional Branches
  85. // or end of program, Next is null.
  86. InstOp lastOp = currBlock.GetLastOp();
  87. if (lastOp.Name == InstName.Cal)
  88. {
  89. EnqueueFunction(lastOp.GetAbsoluteAddress()).AddCaller(currentFunction);
  90. }
  91. else if (lastOp.Name == InstName.Bra)
  92. {
  93. Block succBlock = GetBlock(lastOp.GetAbsoluteAddress());
  94. currBlock.Successors.Add(succBlock);
  95. succBlock.Predecessors.Add(currBlock);
  96. }
  97. if (!IsUnconditionalBranch(ref lastOp))
  98. {
  99. Block succBlock = GetBlock(currBlock.EndAddress);
  100. currBlock.Successors.Insert(0, succBlock);
  101. succBlock.Predecessors.Add(currBlock);
  102. }
  103. }
  104. // Insert the new block on the list (sorted by address).
  105. if (blocks.Count != 0)
  106. {
  107. Block nBlock = blocks[nBlkIndex];
  108. blocks.Insert(nBlkIndex + (nBlock.Address < currBlock.Address ? 1 : 0), currBlock);
  109. }
  110. else
  111. {
  112. blocks.Add(currBlock);
  113. }
  114. }
  115. // Propagate SSY/PBK addresses into their uses (SYNC/BRK).
  116. foreach (Block block in blocks.Where(x => x.PushOpCodes.Count != 0))
  117. {
  118. for (int pushOpIndex = 0; pushOpIndex < block.PushOpCodes.Count; pushOpIndex++)
  119. {
  120. PropagatePushOp(visited, block, pushOpIndex);
  121. }
  122. }
  123. // Try to find targets for BRX (indirect branch) instructions.
  124. hasNewTarget = FindBrxTargets(config, blocks, GetBlock);
  125. // If we discovered new branch targets from the BRX instruction,
  126. // we need another round of decoding to decode the new blocks.
  127. // Additionally, we may have more SSY/PBK targets to propagate,
  128. // and new BRX instructions.
  129. }
  130. while (hasNewTarget);
  131. currentFunction.SetBlocks(blocks.ToArray());
  132. }
  133. return new DecodedProgram(mainFunction, functionsVisited);
  134. }
  135. private static bool BinarySearch(List<Block> blocks, ulong address, out int index)
  136. {
  137. index = 0;
  138. int left = 0;
  139. int right = blocks.Count - 1;
  140. while (left <= right)
  141. {
  142. int size = right - left;
  143. int middle = left + (size >> 1);
  144. Block block = blocks[middle];
  145. index = middle;
  146. if (address >= block.Address && address < block.EndAddress)
  147. {
  148. return true;
  149. }
  150. if (address < block.Address)
  151. {
  152. right = middle - 1;
  153. }
  154. else
  155. {
  156. left = middle + 1;
  157. }
  158. }
  159. return false;
  160. }
  161. private static void FillBlock(ShaderConfig config, Block block, ulong limitAddress, ulong startAddress)
  162. {
  163. IGpuAccessor gpuAccessor = config.GpuAccessor;
  164. ulong address = block.Address;
  165. int bufferOffset = 0;
  166. ReadOnlySpan<ulong> buffer = ReadOnlySpan<ulong>.Empty;
  167. InstOp op = default;
  168. do
  169. {
  170. if (address + 7 >= limitAddress)
  171. {
  172. break;
  173. }
  174. // Ignore scheduling instructions, which are written every 32 bytes.
  175. if ((address & 0x1f) == 0)
  176. {
  177. address += 8;
  178. bufferOffset++;
  179. continue;
  180. }
  181. if (bufferOffset >= buffer.Length)
  182. {
  183. buffer = gpuAccessor.GetCode(startAddress + address, 8);
  184. bufferOffset = 0;
  185. }
  186. ulong opCode = buffer[bufferOffset++];
  187. op = InstTable.GetOp(address, opCode);
  188. if (op.Props.HasFlag(InstProps.TexB))
  189. {
  190. config.SetUsedFeature(FeatureFlags.Bindless);
  191. }
  192. if (op.Name == InstName.Ald || op.Name == InstName.Ast || op.Name == InstName.Ipa)
  193. {
  194. SetUserAttributeUses(config, op.Name, opCode);
  195. }
  196. else if (op.Name == InstName.Pbk || op.Name == InstName.Pcnt || op.Name == InstName.Ssy)
  197. {
  198. block.AddPushOp(op);
  199. }
  200. block.OpCodes.Add(op);
  201. address += 8;
  202. }
  203. while (!op.Props.HasFlag(InstProps.Bra));
  204. block.EndAddress = address;
  205. }
  206. private static void SetUserAttributeUses(ShaderConfig config, InstName name, ulong opCode)
  207. {
  208. int offset;
  209. int count = 1;
  210. bool isStore = false;
  211. bool indexed = false;
  212. bool perPatch = false;
  213. if (name == InstName.Ast)
  214. {
  215. InstAst opAst = new InstAst(opCode);
  216. count = (int)opAst.AlSize + 1;
  217. offset = opAst.Imm11;
  218. indexed = opAst.Phys;
  219. perPatch = opAst.P;
  220. isStore = true;
  221. }
  222. else if (name == InstName.Ald)
  223. {
  224. InstAld opAld = new InstAld(opCode);
  225. count = (int)opAld.AlSize + 1;
  226. offset = opAld.Imm11;
  227. indexed = opAld.Phys;
  228. perPatch = opAld.P;
  229. isStore = opAld.O;
  230. }
  231. else /* if (name == InstName.Ipa) */
  232. {
  233. InstIpa opIpa = new InstIpa(opCode);
  234. offset = opIpa.Imm10;
  235. indexed = opIpa.Idx;
  236. }
  237. if (indexed)
  238. {
  239. if (isStore)
  240. {
  241. config.SetAllOutputUserAttributes();
  242. }
  243. else
  244. {
  245. config.SetAllInputUserAttributes();
  246. }
  247. }
  248. else
  249. {
  250. for (int elemIndex = 0; elemIndex < count; elemIndex++)
  251. {
  252. int attr = offset + elemIndex * 4;
  253. if (perPatch)
  254. {
  255. if (attr >= AttributeConsts.UserAttributePerPatchBase && attr < AttributeConsts.UserAttributePerPatchEnd)
  256. {
  257. int userAttr = attr - AttributeConsts.UserAttributePerPatchBase;
  258. int index = userAttr / 16;
  259. if (isStore)
  260. {
  261. config.SetOutputUserAttributePerPatch(index);
  262. }
  263. else
  264. {
  265. config.SetInputUserAttributePerPatch(index);
  266. }
  267. }
  268. }
  269. else if (attr >= AttributeConsts.UserAttributeBase && attr < AttributeConsts.UserAttributeEnd)
  270. {
  271. int userAttr = attr - AttributeConsts.UserAttributeBase;
  272. int index = userAttr / 16;
  273. if (isStore)
  274. {
  275. config.SetOutputUserAttribute(index);
  276. }
  277. else
  278. {
  279. config.SetInputUserAttribute(index, (userAttr >> 2) & 3);
  280. }
  281. }
  282. if (!isStore &&
  283. ((attr >= AttributeConsts.FrontColorDiffuseR && attr < AttributeConsts.ClipDistance0) ||
  284. (attr >= AttributeConsts.TexCoordBase && attr < AttributeConsts.TexCoordEnd)))
  285. {
  286. config.SetUsedFeature(FeatureFlags.FixedFuncAttr);
  287. }
  288. }
  289. }
  290. }
  291. public static bool IsUnconditionalBranch(ref InstOp op)
  292. {
  293. return IsUnconditional(ref op) && op.Props.HasFlag(InstProps.Bra);
  294. }
  295. private static bool IsUnconditional(ref InstOp op)
  296. {
  297. InstConditional condOp = new InstConditional(op.RawOpCode);
  298. if ((op.Name == InstName.Bra || op.Name == InstName.Exit) && condOp.Ccc != Ccc.T)
  299. {
  300. return false;
  301. }
  302. return condOp.Pred == RegisterConsts.PredicateTrueIndex && !condOp.PredInv;
  303. }
  304. private static bool FindBrxTargets(ShaderConfig config, IEnumerable<Block> blocks, Func<ulong, Block> getBlock)
  305. {
  306. bool hasNewTarget = false;
  307. foreach (Block block in blocks)
  308. {
  309. InstOp lastOp = block.GetLastOp();
  310. bool hasNext = block.HasNext();
  311. if (lastOp.Name == InstName.Brx && block.Successors.Count == (hasNext ? 1 : 0))
  312. {
  313. HashSet<ulong> visited = new HashSet<ulong>();
  314. InstBrx opBrx = new InstBrx(lastOp.RawOpCode);
  315. ulong baseOffset = lastOp.GetAbsoluteAddress();
  316. // An indirect branch could go anywhere,
  317. // try to get the possible target offsets from the constant buffer.
  318. (int cbBaseOffset, int cbOffsetsCount) = FindBrxTargetRange(block, opBrx.SrcA);
  319. if (cbOffsetsCount != 0)
  320. {
  321. hasNewTarget = true;
  322. }
  323. for (int i = 0; i < cbOffsetsCount; i++)
  324. {
  325. uint targetOffset = config.ConstantBuffer1Read(cbBaseOffset + i * 4);
  326. ulong targetAddress = baseOffset + targetOffset;
  327. if (visited.Add(targetAddress))
  328. {
  329. Block target = getBlock(targetAddress);
  330. target.Predecessors.Add(block);
  331. block.Successors.Add(target);
  332. }
  333. }
  334. }
  335. }
  336. return hasNewTarget;
  337. }
  338. private static (int, int) FindBrxTargetRange(Block block, int brxReg)
  339. {
  340. // Try to match the following pattern:
  341. //
  342. // IMNMX.U32 Rx, Rx, UpperBound, PT
  343. // SHL Rx, Rx, 0x2
  344. // LDC Rx, c[0x1][Rx+BaseOffset]
  345. //
  346. // Here, Rx is an arbitrary register, "UpperBound" and "BaseOffset" are constants.
  347. // The above pattern is assumed to be generated by the compiler before BRX,
  348. // as the instruction is usually used to implement jump tables for switch statement optimizations.
  349. // On a successful match, "BaseOffset" is the offset in bytes where the jump offsets are
  350. // located on the constant buffer, and "UpperBound" is the total number of offsets for the BRX, minus 1.
  351. HashSet<Block> visited = new HashSet<Block>();
  352. var ldcLocation = FindFirstRegWrite(visited, new BlockLocation(block, block.OpCodes.Count - 1), brxReg);
  353. if (ldcLocation.Block == null || ldcLocation.Block.OpCodes[ldcLocation.Index].Name != InstName.Ldc)
  354. {
  355. return (0, 0);
  356. }
  357. GetOp<InstLdc>(ldcLocation, out var opLdc);
  358. if (opLdc.CbufSlot != 1 || opLdc.AddressMode != 0)
  359. {
  360. return (0, 0);
  361. }
  362. var shlLocation = FindFirstRegWrite(visited, ldcLocation, opLdc.SrcA);
  363. if (shlLocation.Block == null || !shlLocation.IsImmInst(InstName.Shl))
  364. {
  365. return (0, 0);
  366. }
  367. GetOp<InstShlI>(shlLocation, out var opShl);
  368. if (opShl.Imm20 != 2)
  369. {
  370. return (0, 0);
  371. }
  372. var imnmxLocation = FindFirstRegWrite(visited, shlLocation, opShl.SrcA);
  373. if (imnmxLocation.Block == null || !imnmxLocation.IsImmInst(InstName.Imnmx))
  374. {
  375. return (0, 0);
  376. }
  377. GetOp<InstImnmxI>(imnmxLocation, out var opImnmx);
  378. if (opImnmx.Signed || opImnmx.SrcPred != RegisterConsts.PredicateTrueIndex || opImnmx.SrcPredInv)
  379. {
  380. return (0, 0);
  381. }
  382. return (opLdc.CbufOffset, opImnmx.Imm20 + 1);
  383. }
  384. private static void GetOp<T>(BlockLocation location, out T op) where T : unmanaged
  385. {
  386. ulong rawOp = location.Block.OpCodes[location.Index].RawOpCode;
  387. op = Unsafe.As<ulong, T>(ref rawOp);
  388. }
  389. private struct BlockLocation
  390. {
  391. public Block Block { get; }
  392. public int Index { get; }
  393. public BlockLocation(Block block, int index)
  394. {
  395. Block = block;
  396. Index = index;
  397. }
  398. public bool IsImmInst(InstName name)
  399. {
  400. InstOp op = Block.OpCodes[Index];
  401. return op.Name == name && op.Props.HasFlag(InstProps.Ib);
  402. }
  403. }
  404. private static BlockLocation FindFirstRegWrite(HashSet<Block> visited, BlockLocation location, int regIndex)
  405. {
  406. Queue<BlockLocation> toVisit = new Queue<BlockLocation>();
  407. toVisit.Enqueue(location);
  408. visited.Add(location.Block);
  409. while (toVisit.TryDequeue(out var currentLocation))
  410. {
  411. Block block = currentLocation.Block;
  412. for (int i = currentLocation.Index - 1; i >= 0; i--)
  413. {
  414. if (WritesToRegister(block.OpCodes[i], regIndex))
  415. {
  416. return new BlockLocation(block, i);
  417. }
  418. }
  419. foreach (Block predecessor in block.Predecessors)
  420. {
  421. if (visited.Add(predecessor))
  422. {
  423. toVisit.Enqueue(new BlockLocation(predecessor, predecessor.OpCodes.Count));
  424. }
  425. }
  426. }
  427. return new BlockLocation(null, 0);
  428. }
  429. private static bool WritesToRegister(InstOp op, int regIndex)
  430. {
  431. // Predicate instruction only ever writes to predicate, so we shouldn't check those.
  432. if ((op.Props & (InstProps.Rd | InstProps.Rd2)) == 0)
  433. {
  434. return false;
  435. }
  436. if (op.Props.HasFlag(InstProps.Rd2) && (byte)(op.RawOpCode >> 28) == regIndex)
  437. {
  438. return true;
  439. }
  440. return (byte)op.RawOpCode == regIndex;
  441. }
  442. private enum MergeType
  443. {
  444. Brk,
  445. Cont,
  446. Sync
  447. }
  448. private struct PathBlockState
  449. {
  450. public Block Block { get; }
  451. private enum RestoreType
  452. {
  453. None,
  454. PopPushOp,
  455. PushBranchOp
  456. }
  457. private RestoreType _restoreType;
  458. private ulong _restoreValue;
  459. private MergeType _restoreMergeType;
  460. public bool ReturningFromVisit => _restoreType != RestoreType.None;
  461. public PathBlockState(Block block)
  462. {
  463. Block = block;
  464. _restoreType = RestoreType.None;
  465. _restoreValue = 0;
  466. _restoreMergeType = default;
  467. }
  468. public PathBlockState(int oldStackSize)
  469. {
  470. Block = null;
  471. _restoreType = RestoreType.PopPushOp;
  472. _restoreValue = (ulong)oldStackSize;
  473. _restoreMergeType = default;
  474. }
  475. public PathBlockState(ulong syncAddress, MergeType mergeType)
  476. {
  477. Block = null;
  478. _restoreType = RestoreType.PushBranchOp;
  479. _restoreValue = syncAddress;
  480. _restoreMergeType = mergeType;
  481. }
  482. public void RestoreStackState(Stack<(ulong, MergeType)> branchStack)
  483. {
  484. if (_restoreType == RestoreType.PushBranchOp)
  485. {
  486. branchStack.Push((_restoreValue, _restoreMergeType));
  487. }
  488. else if (_restoreType == RestoreType.PopPushOp)
  489. {
  490. while (branchStack.Count > (uint)_restoreValue)
  491. {
  492. branchStack.Pop();
  493. }
  494. }
  495. }
  496. }
  497. private static void PropagatePushOp(Dictionary<ulong, Block> blocks, Block currBlock, int pushOpIndex)
  498. {
  499. PushOpInfo pushOpInfo = currBlock.PushOpCodes[pushOpIndex];
  500. InstOp pushOp = pushOpInfo.Op;
  501. Block target = blocks[pushOp.GetAbsoluteAddress()];
  502. Stack<PathBlockState> workQueue = new Stack<PathBlockState>();
  503. HashSet<Block> visited = new HashSet<Block>();
  504. Stack<(ulong, MergeType)> branchStack = new Stack<(ulong, MergeType)>();
  505. void Push(PathBlockState pbs)
  506. {
  507. // When block is null, this means we are pushing a restore operation.
  508. // Restore operations are used to undo the work done inside a block
  509. // when we return from it, for example it pops addresses pushed by
  510. // SSY/PBK instructions inside the block, and pushes addresses poped
  511. // by SYNC/BRK.
  512. // For blocks, if it's already visited, we just ignore to avoid going
  513. // around in circles and getting stuck here.
  514. if (pbs.Block == null || !visited.Contains(pbs.Block))
  515. {
  516. workQueue.Push(pbs);
  517. }
  518. }
  519. Push(new PathBlockState(currBlock));
  520. while (workQueue.TryPop(out PathBlockState pbs))
  521. {
  522. if (pbs.ReturningFromVisit)
  523. {
  524. pbs.RestoreStackState(branchStack);
  525. continue;
  526. }
  527. Block current = pbs.Block;
  528. // If the block was already processed, we just ignore it, otherwise
  529. // we would push the same child blocks of an already processed block,
  530. // and go around in circles until memory is exhausted.
  531. if (!visited.Add(current))
  532. {
  533. continue;
  534. }
  535. int pushOpsCount = current.PushOpCodes.Count;
  536. if (pushOpsCount != 0)
  537. {
  538. Push(new PathBlockState(branchStack.Count));
  539. for (int index = pushOpIndex; index < pushOpsCount; index++)
  540. {
  541. InstOp currentPushOp = current.PushOpCodes[index].Op;
  542. MergeType pushMergeType = GetMergeTypeFromPush(currentPushOp.Name);
  543. branchStack.Push((currentPushOp.GetAbsoluteAddress(), pushMergeType));
  544. }
  545. }
  546. pushOpIndex = 0;
  547. bool hasNext = current.HasNext();
  548. if (hasNext)
  549. {
  550. Push(new PathBlockState(current.Successors[0]));
  551. }
  552. InstOp lastOp = current.GetLastOp();
  553. if (IsPopBranch(lastOp.Name))
  554. {
  555. MergeType popMergeType = GetMergeTypeFromPop(lastOp.Name);
  556. bool found = true;
  557. ulong targetAddress = 0UL;
  558. MergeType mergeType;
  559. do
  560. {
  561. if (branchStack.Count == 0)
  562. {
  563. found = false;
  564. break;
  565. }
  566. (targetAddress, mergeType) = branchStack.Pop();
  567. // Push the target address (this will be used to push the address
  568. // back into the PBK/PCNT/SSY stack when we return from that block),
  569. Push(new PathBlockState(targetAddress, mergeType));
  570. }
  571. while (mergeType != popMergeType);
  572. // Make sure we found the correct address,
  573. // the push and pop instruction types must match, so:
  574. // - BRK can only consume addresses pushed by PBK.
  575. // - CONT can only consume addresses pushed by PCNT.
  576. // - SYNC can only consume addresses pushed by SSY.
  577. if (found)
  578. {
  579. if (branchStack.Count == 0)
  580. {
  581. // If the entire stack was consumed, then the current pop instruction
  582. // just consumed the address from our push instruction.
  583. if (current.SyncTargets.TryAdd(pushOp.Address, new SyncTarget(pushOpInfo, current.SyncTargets.Count)))
  584. {
  585. pushOpInfo.Consumers.Add(current, Local());
  586. target.Predecessors.Add(current);
  587. current.Successors.Add(target);
  588. }
  589. }
  590. else
  591. {
  592. // Push the block itself into the work queue for processing.
  593. Push(new PathBlockState(blocks[targetAddress]));
  594. }
  595. }
  596. }
  597. else
  598. {
  599. // By adding them in descending order (sorted by address), we process the blocks
  600. // in order (of ascending address), since we work with a LIFO.
  601. foreach (Block possibleTarget in current.Successors.OrderByDescending(x => x.Address))
  602. {
  603. if (!hasNext || possibleTarget != current.Successors[0])
  604. {
  605. Push(new PathBlockState(possibleTarget));
  606. }
  607. }
  608. }
  609. }
  610. }
  611. public static bool IsPopBranch(InstName name)
  612. {
  613. return name == InstName.Brk || name == InstName.Cont || name == InstName.Sync;
  614. }
  615. private static MergeType GetMergeTypeFromPush(InstName name)
  616. {
  617. return name switch
  618. {
  619. InstName.Pbk => MergeType.Brk,
  620. InstName.Pcnt => MergeType.Cont,
  621. _ => MergeType.Sync
  622. };
  623. }
  624. private static MergeType GetMergeTypeFromPop(InstName name)
  625. {
  626. return name switch
  627. {
  628. InstName.Brk => MergeType.Brk,
  629. InstName.Cont => MergeType.Cont,
  630. _ => MergeType.Sync
  631. };
  632. }
  633. }
  634. }