mirror of
https://github.com/space-wizards/RobustToolbox.git
synced 2026-09-15 23:02:34 +02:00
* Removed the Interfaces folder. * All objects inside the GameObjects subfolders are now in the GameObjects namespace. * Added a Resharper DotSettings file to mark the GameObjects subfolders as not providing namespaces. * Simplified Robust.client.Graphics namespace. * Automated remove redundant using statements.
266 lines
10 KiB
C#
266 lines
10 KiB
C#
using Moq;
|
|
using NUnit.Framework;
|
|
using Robust.Client.GameStates;
|
|
using Robust.Shared.GameStates;
|
|
using Robust.Shared.Timing;
|
|
|
|
namespace Robust.UnitTesting.Client.GameStates
|
|
{
|
|
[TestFixture, Parallelizable, TestOf(typeof(GameStateProcessor))]
|
|
class GameStateProcessor_Tests
|
|
{
|
|
[Test]
|
|
public void FillBufferBlocksProcessing()
|
|
{
|
|
var timingMock = new Mock<IGameTiming>();
|
|
timingMock.SetupProperty(p => p.CurTick);
|
|
|
|
var timing = timingMock.Object;
|
|
var processor = new GameStateProcessor(timing);
|
|
|
|
processor.AddNewState(GameStateFactory(0, 1));
|
|
processor.AddNewState(GameStateFactory(1, 2)); // buffer is at 2/3, so processing should be blocked
|
|
|
|
// calculate states for first tick
|
|
timing.CurTick = new GameTick(3);
|
|
var result = processor.ProcessTickStates(new GameTick(1), out _, out _);
|
|
|
|
Assert.That(result, Is.False);
|
|
Assert.That(timing.CurTick.Value, Is.EqualTo(1));
|
|
}
|
|
|
|
[Test]
|
|
public void FillBufferAndCalculateFirstState()
|
|
{
|
|
var timingMock = new Mock<IGameTiming>();
|
|
timingMock.SetupProperty(p => p.CurTick);
|
|
|
|
var timing = timingMock.Object;
|
|
var processor = new GameStateProcessor(timing);
|
|
|
|
processor.AddNewState(GameStateFactory(0, 1));
|
|
processor.AddNewState(GameStateFactory(1, 2));
|
|
processor.AddNewState(GameStateFactory(2, 3)); // buffer is now full, otherwise cannot calculate states.
|
|
|
|
// calculate states for first tick
|
|
timing.CurTick = new GameTick(1);
|
|
var result = processor.ProcessTickStates(new GameTick(1), out var curState, out var nextState);
|
|
|
|
Assert.That(result, Is.True);
|
|
Assert.That(curState, Is.Not.Null);
|
|
Assert.That(curState!.Extrapolated, Is.False);
|
|
Assert.That(curState.ToSequence.Value, Is.EqualTo(1));
|
|
Assert.That(nextState, Is.Null);
|
|
}
|
|
|
|
/// <summary>
|
|
/// When a full state is in the queue (fromSequence = 0), it will modify CurTick to the states' toSequence,
|
|
/// then return the state as curState.
|
|
/// </summary>
|
|
[Test]
|
|
public void FullStateResyncsCurTick()
|
|
{
|
|
var timingMock = new Mock<IGameTiming>();
|
|
timingMock.SetupProperty(p => p.CurTick);
|
|
|
|
var timing = timingMock.Object;
|
|
var processor = new GameStateProcessor(timing);
|
|
|
|
processor.AddNewState(GameStateFactory(0, 1));
|
|
processor.AddNewState(GameStateFactory(1, 2));
|
|
processor.AddNewState(GameStateFactory(2, 3)); // buffer is now full, otherwise cannot calculate states.
|
|
|
|
// calculate states for first tick
|
|
timing.CurTick = new GameTick(3);
|
|
processor.ProcessTickStates(timing.CurTick, out _, out _);
|
|
|
|
Assert.That(timing.CurTick.Value, Is.EqualTo(1));
|
|
}
|
|
|
|
[Test]
|
|
public void StatesReceivedPastCurTickAreDropped()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.Extrapolation = false;
|
|
|
|
// a few moments later...
|
|
timing.CurTick = new GameTick(5); // current clock is ahead of server
|
|
processor.AddNewState(GameStateFactory(3, 4)); // received a late state
|
|
var result = processor.ProcessTickStates(timing.CurTick, out _, out _);
|
|
|
|
Assert.That(result, Is.False);
|
|
}
|
|
|
|
/// <summary>
|
|
/// The server fell behind the client, so the client clock is now ahead of the incoming states.
|
|
/// Without extrapolation, processing blocks.
|
|
/// </summary>
|
|
[Test]
|
|
public void ServerLagsWithoutExtrapolation()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.Extrapolation = false;
|
|
|
|
// a few moments later...
|
|
timing.CurTick = new GameTick(5); // current clock is ahead of server
|
|
var result = processor.ProcessTickStates(timing.CurTick, out _, out _);
|
|
|
|
Assert.That(result, Is.False);
|
|
}
|
|
|
|
/// <summary>
|
|
/// When processing is blocked because the client is ahead of the server, reset CurTick to the last
|
|
/// received state.
|
|
/// </summary>
|
|
[Test]
|
|
public void ServerLagsWithoutExtrapolationSetsCurTick()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.Extrapolation = false;
|
|
|
|
// a few moments later...
|
|
timing.CurTick = new GameTick(4); // current clock is ahead of server (server=1, client=5)
|
|
var result = processor.ProcessTickStates(timing.CurTick, out _, out _);
|
|
|
|
Assert.That(result, Is.False);
|
|
Assert.That(timing.CurTick.Value, Is.EqualTo(1));
|
|
}
|
|
|
|
/// <summary>
|
|
/// The server fell behind the client, so the client clock is now ahead of the incoming states.
|
|
/// With extrapolation, processing returns a fake extrapolated state for the current tick.
|
|
/// </summary>
|
|
[Test]
|
|
public void ServerLagsWithExtrapolation()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.Extrapolation = true;
|
|
|
|
// a few moments later...
|
|
timing.CurTick = new GameTick(5); // current clock is ahead of server
|
|
|
|
var result = processor.ProcessTickStates(timing.CurTick, out var curState, out var nextState);
|
|
|
|
Assert.That(result, Is.True);
|
|
Assert.That(curState, Is.Not.Null);
|
|
Assert.That(curState!.Extrapolated, Is.True);
|
|
Assert.That(curState.ToSequence.Value, Is.EqualTo(5));
|
|
Assert.That(nextState, Is.Null);
|
|
}
|
|
|
|
/// <summary>
|
|
/// There is a hole in the state buffer, we have a future state but their FromSequence is too high!
|
|
/// In this case we stop and wait for the server to get us the missing link.
|
|
/// </summary>
|
|
[Test]
|
|
public void Hole()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.AddNewState(GameStateFactory(4, 5));
|
|
processor.LastProcessedRealState = new GameTick(3);
|
|
|
|
timing.CurTick = new GameTick(4);
|
|
|
|
var result = processor.ProcessTickStates(timing.CurTick, out _, out _);
|
|
|
|
Assert.That(result, Is.False);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Test that the game state manager goes into extrapolation mode *temporarily*,
|
|
/// if we are missing the curState, but we have a future state that we can apply to skip it.
|
|
/// </summary>
|
|
[Test]
|
|
public void ExtrapolateAdvanceWithFutureState()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.Interpolation = true;
|
|
|
|
timing.CurTick = new GameTick(4);
|
|
|
|
processor.LastProcessedRealState = new GameTick(3);
|
|
processor.AddNewState(GameStateFactory(3, 5));
|
|
|
|
// We're missing the state for this tick so go into extrap.
|
|
var result = processor.ProcessTickStates(timing.CurTick, out var curState, out _);
|
|
|
|
Assert.That(result, Is.True);
|
|
Assert.That(curState, Is.Not.Null);
|
|
Assert.That(curState!.Extrapolated, Is.True);
|
|
|
|
timing.CurTick = new GameTick(5);
|
|
|
|
// But we DO have the state for the tick after so apply away!
|
|
result = processor.ProcessTickStates(timing.CurTick, out curState, out _);
|
|
|
|
Assert.That(result, Is.True);
|
|
Assert.That(curState, Is.Not.Null);
|
|
Assert.That(curState!.Extrapolated, Is.False);
|
|
}
|
|
|
|
/// <summary>
|
|
/// The client started extrapolating and now received the state it needs to "continue as normal".
|
|
/// In this scenario the CurTick passed to the game state processor
|
|
/// is higher than the real next tick to apply, IF it went into extrapolation.
|
|
/// The processor needs to go back to the next REAL tick.
|
|
/// </summary>
|
|
[Test, Ignore("Extrapolation is currently non functional anyways")]
|
|
public void UndoExtrapolation()
|
|
{
|
|
var (timing, processor) = SetupProcessorFactory();
|
|
|
|
processor.Extrapolation = true;
|
|
|
|
processor.AddNewState(GameStateFactory(4, 5));
|
|
processor.AddNewState(GameStateFactory(3, 4));
|
|
processor.LastProcessedRealState = new GameTick(3);
|
|
|
|
timing.CurTick = new GameTick(5);
|
|
|
|
var result = processor.ProcessTickStates(timing.CurTick, out var curState, out _);
|
|
|
|
Assert.That(result, Is.True);
|
|
Assert.That(curState, Is.Not.Null);
|
|
Assert.That(curState!.ToSequence, Is.EqualTo(new GameTick(4)));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Creates a new empty GameState with the given to and from properties.
|
|
/// </summary>
|
|
private static GameState GameStateFactory(uint from, uint to)
|
|
{
|
|
return new(new GameTick(@from), new GameTick(to), 0, null, null, null, null);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Creates a new GameTiming and GameStateProcessor, fills the processor with enough states, and calculate the first tick.
|
|
/// CurTick = 1, states 1 - 3 are in the buffer.
|
|
/// </summary>
|
|
private static (IGameTiming timing, GameStateProcessor processor) SetupProcessorFactory()
|
|
{
|
|
var timingMock = new Mock<IGameTiming>();
|
|
timingMock.SetupProperty(p => p.CurTick);
|
|
timingMock.SetupProperty(p => p.TickTimingAdjustment);
|
|
|
|
var timing = timingMock.Object;
|
|
var processor = new GameStateProcessor(timing);
|
|
|
|
processor.AddNewState(GameStateFactory(0, 1));
|
|
processor.AddNewState(GameStateFactory(1, 2));
|
|
processor.AddNewState(GameStateFactory(2, 3)); // buffer is now full, otherwise cannot calculate states.
|
|
|
|
// calculate states for first tick
|
|
timing.CurTick = new GameTick(1);
|
|
processor.ProcessTickStates(timing.CurTick, out _, out _);
|
|
|
|
return (timing, processor);
|
|
}
|
|
}
|
|
}
|