mirror of
https://github.com/Ryujinx/Ryujinx.git
synced 2024-08-19 15:18:43 +02:00
* Turn `MemoryOperand` into a struct * Remove `IntrinsicOperation` * Remove `PhiNode` * Remove `Node` * Turn `Operand` into a struct * Turn `Operation` into a struct * Clean up pool management methods * Add `Arena` allocator * Move `OperationHelper` to `Operation.Factory` * Move `OperandHelper` to `Operand.Factory` * Optimize `Operation` a bit * Fix `Arena` initialization * Rename `NativeList<T>` to `ArenaList<T>` * Reduce `Operand` size from 88 to 56 bytes * Reduce `Operation` size from 56 to 40 bytes * Add optimistic interning of Register & Constant operands * Optimize `RegisterUsage` pass a bit * Optimize `RemoveUnusedNodes` pass a bit Iterating in reverse-order allows killing dependency chains in a single pass. * Fix PPTC symbols * Optimize `BasicBlock` a bit Reduce allocations from `_successor` & `DominanceFrontiers` * Fix `Operation` resize * Make `Arena` expandable Change the arena allocator to be expandable by allocating in pages, with some of them being pooled. Currently 32 pages are pooled. An LRU removal mechanism should probably be added to it. Apparently MHR can allocate bitmaps large enough to exceed the 16MB limit for the type. * Move `Arena` & `ArenaList` to `Common` * Remove `ThreadStaticPool` & co * Add `PhiOperation` * Reduce `Operand` size from 56 from 48 bytes * Add linear-probing to `Operand` intern table * Optimize `HybridAllocator` a bit * Add `Allocators` class * Tune `ArenaAllocator` sizes * Add page removal mechanism to `ArenaAllocator` Remove pages which have not been used for more than 5s after each reset. I am on fence if this would be better using a Gen2 callback object like the one in System.Buffers.ArrayPool<T>, to trim the pool. Because right now if a large translation happens, the pages will be freed only after a reset. This reset may not happen for a while because no new translation is hit, but the arena base sizes are rather small. * Fix `OOM` when allocating larger than page size in `ArenaAllocator` Tweak resizing mechanism for Operand.Uses and Assignemnts. * Optimize `Optimizer` a bit * Optimize `Operand.Add<T>/Remove<T>` a bit * Clean up `PreAllocator` * Fix phi insertion order Reduce codegen diffs. * Fix code alignment * Use new heuristics for degree of parallelism * Suppress warnings * Address gdkchan's feedback Renamed `GetValue()` to `GetValueUnsafe()` to make it more clear that `Operand.Value` should usually not be modified directly. * Add fast path to `ArenaAllocator` * Assembly for `ArenaAllocator.Allocate(ulong)`: .L0: mov rax, [rcx+0x18] lea r8, [rax+rdx] cmp r8, [rcx+0x10] ja short .L2 .L1: mov rdx, [rcx+8] add rax, [rdx+8] mov [rcx+0x18], r8 ret .L2: jmp ArenaAllocator.AllocateSlow(UInt64) A few variable/field had to be changed to ulong so that RyuJIT avoids emitting zero-extends. * Implement a new heuristic to free pooled pages. If an arena is used often, it is more likely that its pages will be needed, so the pages are kept for longer (e.g: during PPTC rebuild or burst sof compilations). If is not used often, then it is more likely that its pages will not be needed (e.g: after PPTC rebuild or bursts of compilations). * Address riperiperi's feedback * Use `EqualityComparer<T>` in `IntrusiveList<T>` Avoids a potential GC hole in `Equals(T, T)`.
209 lines
6 KiB
C#
209 lines
6 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
using System.Diagnostics;
|
|
using System.Runtime.CompilerServices;
|
|
|
|
namespace ARMeilleure.IntermediateRepresentation
|
|
{
|
|
/// <summary>
|
|
/// Represents a efficient linked list that stores the pointer on the object directly and does not allocate.
|
|
/// </summary>
|
|
/// <typeparam name="T">Type of the list items</typeparam>
|
|
class IntrusiveList<T> where T : IEquatable<T>, IIntrusiveListNode<T>
|
|
{
|
|
/// <summary>
|
|
/// First item of the list, or null if empty.
|
|
/// </summary>
|
|
public T First { get; private set; }
|
|
|
|
/// <summary>
|
|
/// Last item of the list, or null if empty.
|
|
/// </summary>
|
|
public T Last { get; private set; }
|
|
|
|
/// <summary>
|
|
/// Total number of items on the list.
|
|
/// </summary>
|
|
public int Count { get; private set; }
|
|
|
|
/// <summary>
|
|
/// Initializes a new instance of the <see cref="IntrusiveList{T}"/> class.
|
|
/// </summary>
|
|
/// <exception cref="ArgumentException"><typeparamref name="T"/> is not pointer sized.</exception>
|
|
public IntrusiveList()
|
|
{
|
|
if (Unsafe.SizeOf<T>() != IntPtr.Size)
|
|
{
|
|
throw new ArgumentException("T must be a reference type or a pointer sized struct.");
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds a item as the first item of the list.
|
|
/// </summary>
|
|
/// <param name="newNode">Item to be added</param>
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public T AddFirst(T newNode)
|
|
{
|
|
if (!EqualsNull(First))
|
|
{
|
|
return AddBefore(First, newNode);
|
|
}
|
|
else
|
|
{
|
|
Debug.Assert(EqualsNull(newNode.ListPrevious));
|
|
Debug.Assert(EqualsNull(newNode.ListNext));
|
|
Debug.Assert(EqualsNull(Last));
|
|
|
|
First = newNode;
|
|
Last = newNode;
|
|
|
|
Debug.Assert(Count == 0);
|
|
|
|
Count = 1;
|
|
|
|
return newNode;
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds a item as the last item of the list.
|
|
/// </summary>
|
|
/// <param name="newNode">Item to be added</param>
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public T AddLast(T newNode)
|
|
{
|
|
if (!EqualsNull(Last))
|
|
{
|
|
return AddAfter(Last, newNode);
|
|
}
|
|
else
|
|
{
|
|
Debug.Assert(EqualsNull(newNode.ListPrevious));
|
|
Debug.Assert(EqualsNull(newNode.ListNext));
|
|
Debug.Assert(EqualsNull(First));
|
|
|
|
First = newNode;
|
|
Last = newNode;
|
|
|
|
Debug.Assert(Count == 0);
|
|
|
|
Count = 1;
|
|
|
|
return newNode;
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds a item before a existing item on the list.
|
|
/// </summary>
|
|
/// <param name="node">Item on the list that will succeed the new item</param>
|
|
/// <param name="newNode">Item to be added</param>
|
|
/// <returns>New item</returns>
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public T AddBefore(T node, T newNode)
|
|
{
|
|
Debug.Assert(EqualsNull(newNode.ListPrevious));
|
|
Debug.Assert(EqualsNull(newNode.ListNext));
|
|
|
|
newNode.ListPrevious = node.ListPrevious;
|
|
newNode.ListNext = node;
|
|
|
|
node.ListPrevious = newNode;
|
|
|
|
if (!EqualsNull(newNode.ListPrevious))
|
|
{
|
|
newNode.ListPrevious.ListNext = newNode;
|
|
}
|
|
|
|
if (Equals(First, node))
|
|
{
|
|
First = newNode;
|
|
}
|
|
|
|
Count++;
|
|
|
|
return newNode;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Adds a item after a existing item on the list.
|
|
/// </summary>
|
|
/// <param name="node">Item on the list that will preceed the new item</param>
|
|
/// <param name="newNode">Item to be added</param>
|
|
/// <returns>New item</returns>
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public T AddAfter(T node, T newNode)
|
|
{
|
|
Debug.Assert(EqualsNull(newNode.ListPrevious));
|
|
Debug.Assert(EqualsNull(newNode.ListNext));
|
|
|
|
newNode.ListPrevious = node;
|
|
newNode.ListNext = node.ListNext;
|
|
|
|
node.ListNext = newNode;
|
|
|
|
if (!EqualsNull(newNode.ListNext))
|
|
{
|
|
newNode.ListNext.ListPrevious = newNode;
|
|
}
|
|
|
|
if (Equals(Last, node))
|
|
{
|
|
Last = newNode;
|
|
}
|
|
|
|
Count++;
|
|
|
|
return newNode;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Removes a item from the list.
|
|
/// </summary>
|
|
/// <param name="node">The item to be removed</param>
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public void Remove(T node)
|
|
{
|
|
if (!EqualsNull(node.ListPrevious))
|
|
{
|
|
node.ListPrevious.ListNext = node.ListNext;
|
|
}
|
|
else
|
|
{
|
|
Debug.Assert(Equals(First, node));
|
|
|
|
First = node.ListNext;
|
|
}
|
|
|
|
if (!EqualsNull(node.ListNext))
|
|
{
|
|
node.ListNext.ListPrevious = node.ListPrevious;
|
|
}
|
|
else
|
|
{
|
|
Debug.Assert(Equals(Last, node));
|
|
|
|
Last = node.ListPrevious;
|
|
}
|
|
|
|
node.ListPrevious = default;
|
|
node.ListNext = default;
|
|
|
|
Count--;
|
|
}
|
|
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
private static bool EqualsNull(T a)
|
|
{
|
|
return EqualityComparer<T>.Default.Equals(a, default);
|
|
}
|
|
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
private static bool Equals(T a, T b)
|
|
{
|
|
return EqualityComparer<T>.Default.Equals(a, b);
|
|
}
|
|
}
|
|
}
|