erik/acdream
1
0
Fork 0
Code Issues Pull requests Projects Releases 6 Packages Wiki Activity Actions

test: stabilize load-sensitive release contracts

Browse source
This commit is contained in:
Erik 2026-08-18 11:50:23 +02:00
parent c8c764a40e
commit dfc841b779
8 changed files with 199 additions and 43 deletions
Download patch file Download diff file Expand all files Collapse all files

68
tests/AcDream.App.Tests/Rendering/PortalProjectionTests.cs
View file

@ -478,25 +478,44 @@ public class PortalProjectionTests
Assert.Equal(4, warm.Count);
}
long before = GC.GetAllocatedBytesForCurrentThread();
int totalVertices = 0;
for (int i = 0; i < 1_000; i++)
// Cross the tiered-JIT/PGO thresholds before measuring. A single
// warm call does not make a 1,000-call loop a warmed hot path.
for (int i = 0; i < 2_000; i++)
{
using PortalProjection.ClipPolygonLease lease =
PortalProjection.ProjectToClipLease(
opening,
Matrix4x4.Identity,
viewProjection);
totalVertices += lease.Count;
_ = lease.Count;
}
long allocated = GC.GetAllocatedBytesForCurrentThread() - before;
Assert.Equal(4_000, totalVertices);
int totalVertices = 0;
long minimumAllocated = long.MaxValue;
for (int sample = 0; sample < 5; sample++)
{
long before = GC.GetAllocatedBytesForCurrentThread();
for (int i = 0; i < 1_000; i++)
{
using PortalProjection.ClipPolygonLease lease =
PortalProjection.ProjectToClipLease(
opening,
Matrix4x4.Identity,
viewProjection);
totalVertices += lease.Count;
}
long allocated = GC.GetAllocatedBytesForCurrentThread() - before;
minimumAllocated = Math.Min(minimumAllocated, allocated);
}
Assert.Equal(20_000, totalVertices);
// A tiered-JIT/ArrayPool bookkeeping transition can contribute a few hundred fixed bytes
// to the first measured batch on some runtimes. Keep the ceiling far below the former
// per-call result-array regression (~448 KB / 1,000 calls), while accepting that fixed
// process noise so this test measures linear hot-path allocation rather than JIT timing.
Assert.True(allocated <= 1_024, $"pooled projections allocated {allocated:N0} bytes");
// to an individual batch on some runtimes. At least one of five warmed batches must stay
// far below the former per-call result-array regression (~448 KB / 1,000 calls), which
// measures linear hot-path allocation without treating JIT timing as product allocation.
Assert.True(
minimumAllocated <= 1_024,
$"best warmed pooled-projection batch allocated {minimumAllocated:N0} bytes");
}
[Fact]
@ -529,20 +548,31 @@ public class PortalProjectionTests
Assert.Equal(expected, firstSnapshot);
Assert.Equal(expected, second);
long before = GC.GetAllocatedBytesForCurrentThread();
float checksum = 0f;
for (int i = 0; i < 1_000; i++)
for (int i = 0; i < 2_000; i++)
{
store.ResetUsage();
Vector2[] reused = PortalProjection.ClipToRegion(
subject.AsSpan(), region, store);
checksum += reused[0].X;
_ = PortalProjection.ClipToRegion(subject.AsSpan(), region, store);
}
float checksum = 0f;
long minimumAllocated = long.MaxValue;
for (int sample = 0; sample < 5; sample++)
{
long before = GC.GetAllocatedBytesForCurrentThread();
for (int i = 0; i < 1_000; i++)
{
store.ResetUsage();
Vector2[] reused = PortalProjection.ClipToRegion(
subject.AsSpan(), region, store);
checksum += reused[0].X;
}
long allocated = GC.GetAllocatedBytesForCurrentThread() - before;
minimumAllocated = Math.Min(minimumAllocated, allocated);
}
long allocated = GC.GetAllocatedBytesForCurrentThread() - before;
Assert.True(float.IsFinite(checksum));
Assert.True(allocated <= 4_096,
$"frame-owned portal clipping allocated {allocated:N0} bytes");
Assert.True(minimumAllocated <= 4_096,
$"best warmed frame-owned clip batch allocated {minimumAllocated:N0} bytes");
}
[Fact]