8226997bc7
* Start of JIT garbage collection improvements - thread static pool for Operand, MemoryOperand, Operation - Operands and Operations are always to be constructed via their static helper classes, so they can be pooled. - removing LinkedList from Node for sources/destinations (replaced with List<>s for now, but probably could do arrays since size is bounded) - removing params constructors from Node - LinkedList<> to List<> with Clear() for Operand assignments/uses - ThreadStaticPool is very simple and basically just exists for the purpose of our specific translation allocation problem. Right now it will stay at the worst case allocation count for that thread (so far) - the pool can never shrink. - Still some cases of Operand[] that haven't been removed yet. Will need to evaluate them (eg. is there a reasonable max number of params for Calls?) * ConcurrentStack instead of ConcurrentQueue for Rejit * Optimize some parts of LSRA - BitMap now operates on 64-bit int rather than 32-bit - BitMap is now pooled in a ThreadStatic pool (within lrsa) - BitMap now is now its own iterator. Marginally speeds up iterating through the bits. - A few cases where enumerators were generated have been converted to forms that generate less garbage. - New data structure for sorting _usePositions in LiveIntervals. Much faster split, NextUseAfter, initial insertion. Random insertion is slightly slower. - That last one is WIP since you need to insert the values backwards. It would be ideal if it just flipped it for you, uncomplicating things on the caller side. * Use a static pool of thread static pools. (yes.) Prevents each execution thread creating its own lowCq pool and making me cry. * Move constant value to top, change naming convention. * Fix iteration of memory operands. * Increase max thread count. * Address Feedback
39 lines
No EOL
889 B
C#
39 lines
No EOL
889 B
C#
using System.Collections.Concurrent;
|
|
|
|
namespace ARMeilleure.Translation
|
|
{
|
|
class PriorityQueue<T>
|
|
{
|
|
private ConcurrentStack<T>[] _queues;
|
|
|
|
public PriorityQueue(int priorities)
|
|
{
|
|
_queues = new ConcurrentStack<T>[priorities];
|
|
|
|
for (int index = 0; index < priorities; index++)
|
|
{
|
|
_queues[index] = new ConcurrentStack<T>();
|
|
}
|
|
}
|
|
|
|
public void Enqueue(int priority, T value)
|
|
{
|
|
_queues[priority].Push(value);
|
|
}
|
|
|
|
public bool TryDequeue(out T value)
|
|
{
|
|
for (int index = 0; index < _queues.Length; index++)
|
|
{
|
|
if (_queues[index].TryPop(out value))
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
value = default(T);
|
|
|
|
return false;
|
|
}
|
|
}
|
|
} |