mirror of
https://github.com/kwsch/PKHeX
synced 2024-11-27 06:20:25 +00:00
552676ed3a
Never will happen, but not worth arguing over because this is essentially what the ROM does. Entry to this method requires both OK.
91c040b081/src/save.c (L587-L605)
Closes #3805
43 lines
1.4 KiB
C#
43 lines
1.4 KiB
C#
using System;
|
|
using System.Buffers.Binary;
|
|
|
|
namespace PKHeX.Core;
|
|
|
|
/// <summary>
|
|
/// Finds the index of the most recent save block for <see cref="SAV3"/> blocks.
|
|
/// </summary>
|
|
public static class SAV3BlockDetection
|
|
{
|
|
private const int First = 0;
|
|
private const int Second = 1;
|
|
private const int Same = 2;
|
|
|
|
/// <summary>
|
|
/// Compares the footers of the two blocks to determine which is newest.
|
|
/// </summary>
|
|
/// <returns>0=Primary, 1=Secondary.</returns>
|
|
public static int CompareFooters(ReadOnlySpan<byte> data, int offset1, int offset2)
|
|
{
|
|
var counter1 = BinaryPrimitives.ReadUInt32LittleEndian(data[(offset1 + 0x0FFC)..]);
|
|
var counter2 = BinaryPrimitives.ReadUInt32LittleEndian(data[(offset2 + 0x0FFC)..]);
|
|
var result = CompareCounters(counter1, counter2);
|
|
return result == Second ? Second : First; // Same -> First, shouldn't happen for valid saves.
|
|
}
|
|
|
|
private static int CompareCounters(uint counter1, uint counter2)
|
|
{
|
|
// Uninitialized -- only continue if a rollover case (humanly impossible)
|
|
if (counter1 == uint.MaxValue && counter2 != uint.MaxValue - 1)
|
|
return Second;
|
|
if (counter2 == uint.MaxValue && counter1 != uint.MaxValue - 1)
|
|
return First;
|
|
|
|
// Different
|
|
if (counter1 > counter2)
|
|
return First;
|
|
if (counter1 < counter2)
|
|
return Second;
|
|
|
|
return Same;
|
|
}
|
|
}
|