 89791ba68d
			
		
	
	
		89791ba68d
		
			
		
	
	
	
	
		
			
			* Add EntryTable<TEntry>
* Add on translation call counting
* Add Counter
* Add PPTC support
* Make Counter a generic & use a 32-bit counter instead
* Return false on overflow
* Set PPTC version
* Print more information about the rejit queue
* Make Counter<T> disposable
* Remove Block.TailCall since it is not used anymore
* Apply suggestions from code review
Address gdkchan's feedback
Co-authored-by: gdkchan <gab.dark.100@gmail.com>
* Fix more stale docs
* Remove rejit requests queue logging
* Make Counter<T> finalizable
Most certainly quite an odd use case.
* Make EntryTable<T>.TryAllocate set entry to default
* Re-trigger CI
* Dispose Counters before they hit the finalizer queue
* Re-trigger CI
Just for good measure...
* Make EntryTable<T> expandable
* EntryTable is now expandable instead of being a fixed slab.
* Remove EntryTable<T>.TryAllocate
* Remove Counter<T>.TryCreate
Address LDj3SNuD's feedback
* Apply suggestions from code review
Address LDj3SNuD's feedback
Co-authored-by: LDj3SNuD <35856442+LDj3SNuD@users.noreply.github.com>
* Remove useless return
* POH approach, but the sequel
* Revert "POH approach, but the sequel"
This reverts commit 5f5abaa247.
The sequel got shelved
* Add extra documentation
Co-authored-by: gdkchan <gab.dark.100@gmail.com>
Co-authored-by: LDj3SNuD <35856442+LDj3SNuD@users.noreply.github.com>
		
	
			
		
			
				
	
	
		
			101 lines
		
	
	
		
			No EOL
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
			
		
		
	
	
			101 lines
		
	
	
		
			No EOL
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
| using System;
 | |
| using System.Collections.Generic;
 | |
| 
 | |
| namespace ARMeilleure.Decoders
 | |
| {
 | |
|     class Block
 | |
|     {
 | |
|         public ulong Address    { get; set; }
 | |
|         public ulong EndAddress { get; set; }
 | |
| 
 | |
|         public Block Next   { get; set; }
 | |
|         public Block Branch { get; set; }
 | |
| 
 | |
|         public bool Exit { get; set; }
 | |
| 
 | |
|         public List<OpCode> OpCodes { get; }
 | |
| 
 | |
|         public Block()
 | |
|         {
 | |
|             OpCodes = new List<OpCode>();
 | |
|         }
 | |
| 
 | |
|         public Block(ulong address) : this()
 | |
|         {
 | |
|             Address = address;
 | |
|         }
 | |
| 
 | |
|         public void Split(Block rightBlock)
 | |
|         {
 | |
|             int splitIndex = BinarySearch(OpCodes, rightBlock.Address);
 | |
| 
 | |
|             if (OpCodes[splitIndex].Address < rightBlock.Address)
 | |
|             {
 | |
|                 splitIndex++;
 | |
|             }
 | |
| 
 | |
|             int splitCount = OpCodes.Count - splitIndex;
 | |
| 
 | |
|             if (splitCount <= 0)
 | |
|             {
 | |
|                 throw new ArgumentException("Can't split at right block address.");
 | |
|             }
 | |
| 
 | |
|             rightBlock.EndAddress = EndAddress;
 | |
| 
 | |
|             rightBlock.Next   = Next;
 | |
|             rightBlock.Branch = Branch;
 | |
| 
 | |
|             rightBlock.OpCodes.AddRange(OpCodes.GetRange(splitIndex, splitCount));
 | |
| 
 | |
|             EndAddress = rightBlock.Address;
 | |
| 
 | |
|             Next   = rightBlock;
 | |
|             Branch = null;
 | |
| 
 | |
|             OpCodes.RemoveRange(splitIndex, splitCount);
 | |
|         }
 | |
| 
 | |
|         private static int BinarySearch(List<OpCode> opCodes, ulong address)
 | |
|         {
 | |
|             int left   = 0;
 | |
|             int middle = 0;
 | |
|             int right  = opCodes.Count - 1;
 | |
| 
 | |
|             while (left <= right)
 | |
|             {
 | |
|                 int size = right - left;
 | |
| 
 | |
|                 middle = left + (size >> 1);
 | |
| 
 | |
|                 OpCode opCode = opCodes[middle];
 | |
| 
 | |
|                 if (address == (ulong)opCode.Address)
 | |
|                 {
 | |
|                     break;
 | |
|                 }
 | |
| 
 | |
|                 if (address < (ulong)opCode.Address)
 | |
|                 {
 | |
|                     right = middle - 1;
 | |
|                 }
 | |
|                 else
 | |
|                 {
 | |
|                     left = middle + 1;
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             return middle;
 | |
|         }
 | |
| 
 | |
|         public OpCode GetLastOp()
 | |
|         {
 | |
|             if (OpCodes.Count > 0)
 | |
|             {
 | |
|                 return OpCodes[OpCodes.Count - 1];
 | |
|             }
 | |
| 
 | |
|             return null;
 | |
|         }
 | |
|     }
 | |
| } |