de_net: Separate (non)reliable datagram counters (DigitalExtinction#604)

This will simplify reliable datagram deduplication because it could be
assumed that there is only a small number of holes before the highest
received ID.

crates/net/src/tasks/usender.rs

@@ -20,15 +20,22 @@ pub(super) async fn run(
 ) {
  info!("Starting package sender on port {port}...");
 
- let mut counter = PackageId::zero();
+ let mut counter_reliable = PackageId::zero();
+ let mut counter_unreliable = PackageId::zero();
 
  loop {
  let Ok(package) = packages.recv().await else {
  break;
  };
 
- let header = DatagramHeader::new_package(package.reliable(), package.peers(), counter);
- counter = counter.incremented();
+ let counter = if package.reliable() {
+ &mut counter_reliable
+ } else {
+ &mut counter_unreliable
+ };
+
+ let header = DatagramHeader::new_package(package.reliable(), package.peers(), *counter);
+ *counter = counter.incremented();
 
  if let DatagramHeader::Package(package_header) = header {
  if package_header.reliable() {

docs/src/multiplayer/connector/protocol.md

@@ -23,7 +23,8 @@ by the mask `0b1000_0000`).
 
 Each user package has an ID, encoded within the last three bytes of the
 datagram header. These IDs increment until they reach the maximum value that
-can be encoded within three bytes, after which the counter resets to 0.
+can be encoded within three bytes, after which the counter resets to 0. The ID
+sequence for reliable and unreliable packages are independent.
 
 Packages can be transmitted in either reliable or non-reliable mode.
 Reliability is signaled by the second highest bit of the flags byte