22b2cb39af
* 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)`.
67 lines
2.1 KiB
C#
67 lines
2.1 KiB
C#
using ARMeilleure.Decoders;
|
|
using ARMeilleure.IntermediateRepresentation;
|
|
using ARMeilleure.Translation;
|
|
|
|
using static ARMeilleure.Instructions.InstEmitHelper;
|
|
using static ARMeilleure.IntermediateRepresentation.Operand.Factory;
|
|
|
|
namespace ARMeilleure.Instructions
|
|
{
|
|
static partial class InstEmit
|
|
{
|
|
public static void Sdiv(ArmEmitterContext context) => EmitDiv(context, unsigned: false);
|
|
public static void Udiv(ArmEmitterContext context) => EmitDiv(context, unsigned: true);
|
|
|
|
private static void EmitDiv(ArmEmitterContext context, bool unsigned)
|
|
{
|
|
OpCodeAluBinary op = (OpCodeAluBinary)context.CurrOp;
|
|
|
|
// If Rm == 0, Rd = 0 (division by zero).
|
|
Operand n = GetIntOrZR(context, op.Rn);
|
|
Operand m = GetIntOrZR(context, op.Rm);
|
|
|
|
Operand divisorIsZero = context.ICompareEqual(m, Const(m.Type, 0));
|
|
|
|
Operand lblBadDiv = Label();
|
|
Operand lblEnd = Label();
|
|
|
|
context.BranchIfTrue(lblBadDiv, divisorIsZero);
|
|
|
|
if (!unsigned)
|
|
{
|
|
// If Rn == INT_MIN && Rm == -1, Rd = INT_MIN (overflow).
|
|
bool is32Bits = op.RegisterSize == RegisterSize.Int32;
|
|
|
|
Operand intMin = is32Bits ? Const(int.MinValue) : Const(long.MinValue);
|
|
Operand minus1 = is32Bits ? Const(-1) : Const(-1L);
|
|
|
|
Operand nIsIntMin = context.ICompareEqual(n, intMin);
|
|
Operand mIsMinus1 = context.ICompareEqual(m, minus1);
|
|
|
|
Operand lblGoodDiv = Label();
|
|
|
|
context.BranchIfFalse(lblGoodDiv, context.BitwiseAnd(nIsIntMin, mIsMinus1));
|
|
|
|
SetAluDOrZR(context, intMin);
|
|
|
|
context.Branch(lblEnd);
|
|
|
|
context.MarkLabel(lblGoodDiv);
|
|
}
|
|
|
|
Operand d = unsigned
|
|
? context.DivideUI(n, m)
|
|
: context.Divide (n, m);
|
|
|
|
SetAluDOrZR(context, d);
|
|
|
|
context.Branch(lblEnd);
|
|
|
|
context.MarkLabel(lblBadDiv);
|
|
|
|
SetAluDOrZR(context, Const(op.GetOperandType(), 0));
|
|
|
|
context.MarkLabel(lblEnd);
|
|
}
|
|
}
|
|
}
|