mirror of
				https://github.com/Ryujinx/Ryujinx.git
				synced 2025-10-25 20:33:56 -07:00 
			
		
		
		
	* Initial cache memory allocator implementation * Get rid of CallFlag * Perform cache cleanup on exit * Basic cache invalidation * Thats not how conditionals works in C# it seems * Set PTC version to PR number * Address PR feedback * Update InstEmitFlowHelper.cs * Flag clear on address is no longer needed * Do not include exit block in function size calculation * Dispose jump table * For future use * InternalVersion = 1519 (force retest). Co-authored-by: LDj3SNuD <35856442+LDj3SNuD@users.noreply.github.com>
		
			
				
	
	
		
			97 lines
		
	
	
		
			2.5 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
			
		
		
	
	
			97 lines
		
	
	
		
			2.5 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
| using System;
 | |
| using System.Collections.Generic;
 | |
| using System.Diagnostics.CodeAnalysis;
 | |
| 
 | |
| namespace ARMeilleure.Translation.Cache
 | |
| {
 | |
|     class CacheMemoryAllocator
 | |
|     {
 | |
|         private struct MemoryBlock : IComparable<MemoryBlock>
 | |
|         {
 | |
|             public int Offset { get; }
 | |
|             public int Size { get; }
 | |
| 
 | |
|             public MemoryBlock(int offset, int size)
 | |
|             {
 | |
|                 Offset = offset;
 | |
|                 Size = size;
 | |
|             }
 | |
| 
 | |
|             public int CompareTo([AllowNull] MemoryBlock other)
 | |
|             {
 | |
|                 return Offset.CompareTo(other.Offset);
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         private readonly List<MemoryBlock> _blocks = new List<MemoryBlock>();
 | |
| 
 | |
|         public CacheMemoryAllocator(int capacity)
 | |
|         {
 | |
|             _blocks.Add(new MemoryBlock(0, capacity));
 | |
|         }
 | |
| 
 | |
|         public int Allocate(int size)
 | |
|         {
 | |
|             for (int i = 0; i < _blocks.Count; i++)
 | |
|             {
 | |
|                 MemoryBlock block = _blocks[i];
 | |
| 
 | |
|                 if (block.Size > size)
 | |
|                 {
 | |
|                     _blocks[i] = new MemoryBlock(block.Offset + size, block.Size - size);
 | |
|                     return block.Offset;
 | |
|                 }
 | |
|                 else if (block.Size == size)
 | |
|                 {
 | |
|                     _blocks.RemoveAt(i);
 | |
|                     return block.Offset;
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             // We don't have enough free memory to perform the allocation.
 | |
|             return -1;
 | |
|         }
 | |
| 
 | |
|         public void Free(int offset, int size)
 | |
|         {
 | |
|             Insert(new MemoryBlock(offset, size));
 | |
|         }
 | |
| 
 | |
|         private void Insert(MemoryBlock block)
 | |
|         {
 | |
|             int index = _blocks.BinarySearch(block);
 | |
| 
 | |
|             if (index < 0)
 | |
|             {
 | |
|                 index = ~index;
 | |
|             }
 | |
| 
 | |
|             if (index < _blocks.Count)
 | |
|             {
 | |
|                 MemoryBlock next = _blocks[index];
 | |
| 
 | |
|                 int endOffs = block.Offset + block.Size;
 | |
| 
 | |
|                 if (next.Offset == endOffs)
 | |
|                 {
 | |
|                     block = new MemoryBlock(block.Offset, block.Size + next.Size);
 | |
|                     _blocks.RemoveAt(index);
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             if (index > 0)
 | |
|             {
 | |
|                 MemoryBlock prev = _blocks[index - 1];
 | |
| 
 | |
|                 if (prev.Offset + prev.Size == block.Offset)
 | |
|                 {
 | |
|                     block = new MemoryBlock(block.Offset - prev.Size, block.Size + prev.Size);
 | |
|                     _blocks.RemoveAt(--index);
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             _blocks.Insert(index, block);
 | |
|         }
 | |
|     }
 | |
| }
 |