|
| 1 | +using BenchmarkDotNet.Attributes; |
| 2 | +using System.Buffers.Binary; |
| 3 | +using System.Runtime.InteropServices; |
| 4 | + |
| 5 | +namespace TACTBench |
| 6 | +{ |
| 7 | + [MemoryDiagnoser] |
| 8 | + public class GroupIndexBlockBench |
| 9 | + { |
| 10 | + private List<Entry> Entries = []; |
| 11 | + private const int outputEntriesPerBlock = 157; |
| 12 | + |
| 13 | + /* On .NET 9: |
| 14 | +| Method | Mean | Error | StdDev | Gen0 | Allocated | |
| 15 | +|---------------------- |---------:|----------:|----------:|---------:|----------:| |
| 16 | +| LINQ | 4.294 ms | 0.0396 ms | 0.0370 ms | 7.8125 | 611520 B | |
| 17 | +| EnumerableChunk | 6.672 ms | 0.0760 ms | 0.0674 ms | 156.2500 | 8156433 B | |
| 18 | +| CollectionMarshalSpan | 2.199 ms | 0.0224 ms | 0.0199 ms | - | - | |
| 19 | + */ |
| 20 | + |
| 21 | + // Someone figure out how to run this on .NET 10 :) |
| 22 | + |
| 23 | + [GlobalSetup] |
| 24 | + public void Setup() |
| 25 | + { |
| 26 | + Entries = []; |
| 27 | + var random = new Random(); |
| 28 | + for (var i = 0; i < 1_000_000; i++) |
| 29 | + { |
| 30 | + var entry = new Entry() |
| 31 | + { |
| 32 | + Size = i, |
| 33 | + ArchiveIndex = (short)(i / 10000), |
| 34 | + Offset = i |
| 35 | + }; |
| 36 | + |
| 37 | + random.NextBytes(entry.EKey); |
| 38 | + |
| 39 | + Entries.Add(entry); |
| 40 | + } |
| 41 | + } |
| 42 | + |
| 43 | + [Benchmark] |
| 44 | + public void LINQ() |
| 45 | + { |
| 46 | + var totalBlocks = (Entries.Count + outputEntriesPerBlock - 1) / outputEntriesPerBlock; |
| 47 | + for (int i = 0; i < totalBlocks; i++) |
| 48 | + { |
| 49 | + var block = Entries.Skip(i * outputEntriesPerBlock).Take(outputEntriesPerBlock); |
| 50 | + foreach (var entry in block) |
| 51 | + { |
| 52 | + Process(entry); |
| 53 | + } |
| 54 | + } |
| 55 | + } |
| 56 | + |
| 57 | + [Benchmark] |
| 58 | + public void EnumerableChunk() |
| 59 | + { |
| 60 | + foreach (var block in Entries.Chunk(outputEntriesPerBlock)) |
| 61 | + { |
| 62 | + foreach (var entry in block) |
| 63 | + { |
| 64 | + Process(entry); |
| 65 | + } |
| 66 | + } |
| 67 | + } |
| 68 | + |
| 69 | + [Benchmark] |
| 70 | + public void CollectionMarshalSpan() |
| 71 | + { |
| 72 | + var span = CollectionsMarshal.AsSpan(Entries); |
| 73 | + int totalBlocks = (span.Length + outputEntriesPerBlock - 1) / outputEntriesPerBlock; |
| 74 | + |
| 75 | + for (int i = 0; i < totalBlocks; i++) |
| 76 | + { |
| 77 | + int start = i * outputEntriesPerBlock; |
| 78 | + int length = Math.Min(outputEntriesPerBlock, span.Length - start); |
| 79 | + var block = span.Slice(start, length); |
| 80 | + |
| 81 | + foreach (var entry in block) |
| 82 | + { |
| 83 | + Process(entry); |
| 84 | + } |
| 85 | + } |
| 86 | + } |
| 87 | + |
| 88 | + private static void Process(Entry entry) |
| 89 | + { |
| 90 | + // Close enough |
| 91 | + BinaryPrimitives.ReverseEndianness(entry.Size); |
| 92 | + BinaryPrimitives.ReverseEndianness((short)entry.ArchiveIndex); |
| 93 | + BinaryPrimitives.ReverseEndianness(entry.Offset); |
| 94 | + } |
| 95 | + |
| 96 | + public class Entry |
| 97 | + { |
| 98 | + public byte[] EKey = new byte[16]; |
| 99 | + public int Size; |
| 100 | + public short ArchiveIndex; |
| 101 | + public int Offset; |
| 102 | + } |
| 103 | + } |
| 104 | +} |
0 commit comments