17
0
mirror of https://github.com/MaSzyna-EU07/maszyna.git synced 2026-10-17 14:29:20 +02:00
Files
maszyna/network/statehash.cpp
Hirek193 b255c8120a multiplayer stage 6: a logical simulation tick and a real state digest
The protocol hung off whatever frame the renderer happened to be drawing, and
the only thing standing in for synchronisation was the sum of every vehicle's
coordinates with a random number added on top - a value that cannot be equal on
two machines and therefore reported a desync on every single step.

- Global.simulation_tick: the authority counts the steps, a client takes the
  number from the authoritative frame it is executing. FRAME_INFO and the
  command requests carry it, so the network timeline has one unambiguous order
  independent of frame rates
- network/statehash: a versioned FNV digest of the gameplay critical state -
  vehicle position, speed, direction, brake pipe and cylinder pressure, plus the
  clock. Values are quantized so that float noise is not mistaken for drift, and
  vehicles are folded in under their own identity and summed, so the digest does
  not depend on the order the scenario created them in. Switches, memcells and
  the event queue are the next candidates; they go in when stage 7 pins down
  what a snapshot contains
- a client compares its own digest against the authoritative one and reports the
  drift when it starts and then only now and then, rather than every step; the
  overlay says how long it has been out of step and at which tick
- refusing to compare at all when the two builds disagree on the digest layout

EU07_NETWORK_VERSION is now 4.
2026-09-06 19:21:12 +00:00

90 lines
2.2 KiB
C++

/*
This Source Code Form is subject to the
terms of the Mozilla Public License, v.
2.0. If a copy of the MPL was not
distributed with this file, You can
obtain one at
http://mozilla.org/MPL/2.0/.
*/
#include "stdafx.h"
#include "network/statehash.h"
#include "McZapkie/MOVER.h"
#include "simulation/simulation.h"
#include "simulation/simulationtime.h"
#include "vehicle/DynObj.h"
namespace
{
uint64_t const FNV_OFFSET{14695981039346656037ull};
uint64_t const FNV_PRIME{1099511628211ull};
uint64_t fold(uint64_t Hash, uint64_t Value)
{
for (int i = 0; i < 8; ++i)
{
Hash ^= (Value >> (i * 8)) & 0xff;
Hash *= FNV_PRIME;
}
return Hash;
}
uint64_t fold(uint64_t Hash, std::string const &Text)
{
for (char const character : Text)
{
Hash ^= (uint64_t)(unsigned char)character;
Hash *= FNV_PRIME;
}
return Hash;
}
// rounding to a fixed step keeps the digest from reacting to the last bits of a float
int64_t quantize(double Value, double Step)
{
if (!std::isfinite(Value))
return std::numeric_limits<int64_t>::min();
return (int64_t)std::llround(Value / Step);
}
} // namespace
uint64_t network::state_hash()
{
uint64_t digest{0};
uint64_t counted{0};
for (TDynamicObject const *vehicle : simulation::Vehicles.sequence())
{
if (vehicle == nullptr || vehicle->MoverParameters == nullptr)
continue;
auto const &mover = *vehicle->MoverParameters;
auto const position = vehicle->GetPosition();
uint64_t entry{FNV_OFFSET};
entry = fold(entry, vehicle->name());
entry = fold(entry, (uint64_t)quantize(position.x, 0.01));
entry = fold(entry, (uint64_t)quantize(position.y, 0.01));
entry = fold(entry, (uint64_t)quantize(position.z, 0.01));
entry = fold(entry, (uint64_t)quantize(mover.V, 0.001));
entry = fold(entry, (uint64_t)(int64_t)mover.DirActive);
entry = fold(entry, (uint64_t)quantize(mover.PipePress, 0.001));
entry = fold(entry, (uint64_t)quantize(mover.BrakePress, 0.001));
// summing keeps the whole thing independent of iteration order
digest += entry;
++counted;
}
digest = fold(digest, counted);
auto const &time = simulation::Time.data();
digest = fold(digest, (uint64_t)(time.wHour * 3600 + time.wMinute * 60 + time.wSecond));
return digest;
}