 4da44e09cb
			
		
	
	
		4da44e09cb
		
			
		
	
	
	
	
		
			
			* Make all structs readonly when applicable. It should reduce amount of needless defensive copies * Make structs with trivial boilerplate equality code record structs * Remove unnecessary readonly modifiers from TextureCreateInfo * Make BitMap structs readonly too
		
			
				
	
	
		
			157 lines
		
	
	
		
			No EOL
		
	
	
		
			3.6 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
			
		
		
	
	
			157 lines
		
	
	
		
			No EOL
		
	
	
		
			3.6 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
| namespace Ryujinx.Graphics.Vulkan
 | |
| {
 | |
|     readonly struct BitMap
 | |
|     {
 | |
|         public const int IntSize = 64;
 | |
| 
 | |
|         private const int IntShift = 6;
 | |
|         private const int IntMask = IntSize - 1;
 | |
| 
 | |
|         private readonly long[] _masks;
 | |
| 
 | |
|         public BitMap(int count)
 | |
|         {
 | |
|             _masks = new long[(count + IntMask) / IntSize];
 | |
|         }
 | |
| 
 | |
|         public bool AnySet()
 | |
|         {
 | |
|             for (int i = 0; i < _masks.Length; i++)
 | |
|             {
 | |
|                 if (_masks[i] != 0)
 | |
|                 {
 | |
|                     return true;
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             return false;
 | |
|         }
 | |
| 
 | |
|         public bool IsSet(int bit)
 | |
|         {
 | |
|             int wordIndex = bit >> IntShift;
 | |
|             int wordBit = bit & IntMask;
 | |
| 
 | |
|             long wordMask = 1L << wordBit;
 | |
| 
 | |
|             return (_masks[wordIndex] & wordMask) != 0;
 | |
|         }
 | |
| 
 | |
|         public bool IsSet(int start, int end)
 | |
|         {
 | |
|             if (start == end)
 | |
|             {
 | |
|                 return IsSet(start);
 | |
|             }
 | |
| 
 | |
|             int startIndex = start >> IntShift;
 | |
|             int startBit = start & IntMask;
 | |
|             long startMask = -1L << startBit;
 | |
| 
 | |
|             int endIndex = end >> IntShift;
 | |
|             int endBit = end & IntMask;
 | |
|             long endMask = (long)(ulong.MaxValue >> (IntMask - endBit));
 | |
| 
 | |
|             if (startIndex == endIndex)
 | |
|             {
 | |
|                 return (_masks[startIndex] & startMask & endMask) != 0;
 | |
|             }
 | |
| 
 | |
|             if ((_masks[startIndex] & startMask) != 0)
 | |
|             {
 | |
|                 return true;
 | |
|             }
 | |
| 
 | |
|             for (int i = startIndex + 1; i < endIndex; i++)
 | |
|             {
 | |
|                 if (_masks[i] != 0)
 | |
|                 {
 | |
|                     return true;
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             if ((_masks[endIndex] & endMask) != 0)
 | |
|             {
 | |
|                 return true;
 | |
|             }
 | |
| 
 | |
|             return false;
 | |
|         }
 | |
| 
 | |
|         public bool Set(int bit)
 | |
|         {
 | |
|             int wordIndex = bit >> IntShift;
 | |
|             int wordBit = bit & IntMask;
 | |
| 
 | |
|             long wordMask = 1L << wordBit;
 | |
| 
 | |
|             if ((_masks[wordIndex] & wordMask) != 0)
 | |
|             {
 | |
|                 return false;
 | |
|             }
 | |
| 
 | |
|             _masks[wordIndex] |= wordMask;
 | |
| 
 | |
|             return true;
 | |
|         }
 | |
| 
 | |
|         public void SetRange(int start, int end)
 | |
|         {
 | |
|             if (start == end)
 | |
|             {
 | |
|                 Set(start);
 | |
|                 return;
 | |
|             }
 | |
| 
 | |
|             int startIndex = start >> IntShift;
 | |
|             int startBit = start & IntMask;
 | |
|             long startMask = -1L << startBit;
 | |
| 
 | |
|             int endIndex = end >> IntShift;
 | |
|             int endBit = end & IntMask;
 | |
|             long endMask = (long)(ulong.MaxValue >> (IntMask - endBit));
 | |
| 
 | |
|             if (startIndex == endIndex)
 | |
|             {
 | |
|                 _masks[startIndex] |= startMask & endMask;
 | |
|             }
 | |
|             else
 | |
|             {
 | |
|                 _masks[startIndex] |= startMask;
 | |
| 
 | |
|                 for (int i = startIndex + 1; i < endIndex; i++)
 | |
|                 {
 | |
|                     _masks[i] |= -1;
 | |
|                 }
 | |
| 
 | |
|                 _masks[endIndex] |= endMask;
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         public void Clear(int bit)
 | |
|         {
 | |
|             int wordIndex = bit >> IntShift;
 | |
|             int wordBit   = bit & IntMask;
 | |
| 
 | |
|             long wordMask = 1L << wordBit;
 | |
| 
 | |
|             _masks[wordIndex] &= ~wordMask;
 | |
|         }
 | |
| 
 | |
|         public void Clear()
 | |
|         {
 | |
|             for (int i = 0; i < _masks.Length; i++)
 | |
|             {
 | |
|                 _masks[i] = 0;
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         public void ClearInt(int start, int end)
 | |
|         {
 | |
|             for (int i = start; i <= end; i++)
 | |
|             {
 | |
|                 _masks[i] = 0;
 | |
|             }
 | |
|         }
 | |
|     }
 | |
| } |