SEDSnet 4.2.0

A memory safe, no_std-capable networking stack with routing, discovery, reliability, and Rust/C/Python bindings.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
use super::*;
use std::sync::{
    Mutex,
    atomic::{AtomicU64, Ordering},
};

#[test]
fn lost_chunk_cannot_poison_later_frames_from_same_router() {
    crate::tests::ensure_common_test_schema();
    let rf = Router::new_with_clock(RouterConfig::new([]).with_sender("RF"), Box::new(|| 0));
    let fc = Router::new_with_clock(RouterConfig::new([]).with_sender("FC"), Box::new(|| 0));
    let side = fc.add_side_packed_with_options("CAN", |_| Ok(()), RouterSideOptions::default());
    let first = wrap_side_transport_frame(SIDE_TRANSPORT_KIND_FULL, &[1; 180]);
    let second = wrap_side_transport_frame(SIDE_TRANSPORT_KIND_FULL, &[2; 180]);
    // CRC including the appended CRC has a constant residue: it is NOT an ID.
    assert_eq!(
        crate::side_transport::crc32_bytes(&first),
        crate::side_transport::crc32_bytes(&second)
    );
    let a = rf
        .split_side_transport_frame(0, first, 128)
        .unwrap()
        .collect::<Vec<_>>();
    let b = rf
        .split_side_transport_frame(0, second, 128)
        .unwrap()
        .collect::<Vec<_>>();
    assert_ne!(
        &a[0][4..8],
        &b[0][4..8],
        "different packets need different transfer IDs"
    );
    assert!(
        fc.decode_side_transport_frame(side, &a[0])
            .unwrap()
            .is_none()
    );
    // Drop A's tail; all of B must still be decodable.
    let mut result = None;
    for frame in b {
        result = fc.decode_side_transport_frame(side, &frame).unwrap();
    }
    assert_eq!(result.unwrap().as_ref(), &[2; 180]);
}

#[test]
fn incomplete_side_transfers_stay_bounded_under_repeated_loss() {
    crate::tests::ensure_common_test_schema();
    let router = Router::new_with_clock(RouterConfig::new([]).with_sender("RF"), Box::new(|| 0));
    let side = router.add_side_packed_with_options("CAN", |_| Ok(()), RouterSideOptions::default());
    for i in 0..1000u32 {
        let mut data = vec![0; 180];
        data[..4].copy_from_slice(&i.to_le_bytes());
        let frame = wrap_side_transport_frame(SIDE_TRANSPORT_KIND_FULL, &data);
        let chunks = router
            .split_side_transport_frame(side, frame, 128)
            .unwrap()
            .collect::<Vec<_>>();
        assert!(
            router
                .decode_side_transport_frame(side, &chunks[0])
                .unwrap()
                .is_none()
        );
        assert!(router.state.lock().side_transport[&side].rx_chunks.len() <= 4);
    }
}

#[test]
fn unacknowledged_topology_does_not_silence_discovery_liveness() {
    crate::tests::ensure_common_test_schema();
    let now = Arc::new(AtomicU64::new(0));
    let clock = now.clone();
    let emitted = Arc::new(Mutex::new(Vec::<Vec<u8>>::new()));
    let output = emitted.clone();
    let rf = Router::new_with_clock(
        RouterConfig::new([]).with_sender("RF"),
        Box::new(move || clock.load(Ordering::Relaxed)),
    );
    let side = rf.add_side_packed_with_options(
        "CAN",
        move |packet| {
            output.lock().unwrap().push(packet.to_vec());
            Ok(())
        },
        RouterSideOptions {
            reliable_enabled: true,
            ..Default::default()
        },
    );
    rf.announce_discovery().unwrap();
    rf.process_tx_queue().unwrap();
    // Deliberately withhold the hop ACK for a transmitted topology baseline.
    assert!(
        rf.state
            .lock()
            .reliable_tx
            .iter()
            .any(|((s, ty), tx)| *s == side
                && *ty == DataType::DiscoveryTopology.as_u32()
                && !tx.sent.is_empty())
    );
    emitted.lock().unwrap().clear();
    let fc_clock = now.clone();
    let fc = Router::new_with_clock(
        RouterConfig::new([]).with_sender("FC"),
        Box::new(move || fc_clock.load(Ordering::Relaxed)),
    );
    let endpoint = DataEndpoint::named("RADIO");
    let sensor_type = crate::config::register_data_type_with_description(
        "DISCOVERY_LIVENESS_SENSOR",
        "live sensor across RF",
        MessageElement::Static(1, crate::MessageDataType::UInt8, crate::MessageClass::Data),
        &[endpoint],
        crate::ReliableMode::None,
        1,
    )
    .unwrap();
    let sensor_count = Arc::new(AtomicU64::new(0));
    let sent = sensor_count.clone();
    let ingress = fc.add_side_packet("CAN", move |packet| {
        if packet.data_type() == sensor_type {
            sent.fetch_add(1, Ordering::Relaxed);
        }
        Ok(())
    });
    fc.rx_from_side(
        &discovery::build_discovery_topology(
            "RF",
            0,
            &[
                TopologyBoardNode {
                    sender_id: "RF".into(),
                    reachable_endpoints: vec![],
                    reachable_timesync_sources: vec![],
                    connections: vec!["GS".into()],
                },
                TopologyBoardNode {
                    sender_id: "GS".into(),
                    reachable_endpoints: vec![endpoint],
                    reachable_timesync_sources: vec![],
                    connections: vec!["RF".into()],
                },
            ],
        )
        .unwrap(),
        ingress,
    )
    .unwrap();
    let mut delivered = 0;
    for ms in (1_000..=60_000).step_by(1_000) {
        now.store(ms, Ordering::Relaxed);
        rf.poll_discovery().unwrap();
        // Drain newly queued advertisements without running timeout/retry
        // maintenance: keep the original pending ACK outstanding throughout.
        loop {
            let queued = Router::pop_transmit_queue_locked(&mut rf.state.lock(), rf.clock.now_ms());
            let Some(queued) = queued else {
                break;
            };
            rf.tx_item_impl(queued.item, queued.ignore_local, true)
                .unwrap();
        }
        let frames = emitted.lock().unwrap();
        for frame in &frames[delivered..] {
            let packet = crate::wire_format::unpack_packet(frame).unwrap();
            fc.rx_from_side(&packet, ingress).unwrap();
        }
        delivered = frames.len();
        drop(frames);
        // PB continues to announce on the same CAN segment but is not a
        // GroundStation subscriber. Its liveness must not hide loss of RF.
        fc.rx_from_side(
            &discovery::build_discovery_announce("PB", ms, &[]).unwrap(),
            ingress,
        )
        .unwrap();
        assert!(
            fc.export_topology()
                .routes
                .iter()
                .any(|route| route.reachable_endpoints.contains(&endpoint)),
            "FC must retain GS reachability while RF keepalives continue at {ms} ms"
        );
        let before = sensor_count.load(Ordering::Relaxed);
        fc.log(sensor_type, &[1u8]).unwrap();
        assert_eq!(
            sensor_count.load(Ordering::Relaxed),
            before + 1,
            "FC must actually transmit each sensor packet, not just return success at {ms} ms"
        );
    }
    let frames = emitted.lock().unwrap();
    let types: Vec<_> = frames
        .iter()
        .map(|p| crate::wire_format::peek_envelope(p).unwrap().ty)
        .collect();
    let pings: Vec<_> = types
        .iter()
        .filter(|ty| **ty == DataType::DiscoveryAnnounce)
        .collect();
    assert!(
        pings.len() >= 3,
        "a lost topology ACK must not suppress bounded keepalives for an entire route TTL"
    );
    assert!(
        pings.len() <= 5,
        "keepalives must not run at the firmware polling rate"
    );
    assert!(
        types.iter().all(|ty| *ty != DataType::DiscoveryTopology),
        "do not retransmit full topology just to refresh liveness"
    );
    let expired = 60_000 + DISCOVERY_ROUTE_TTL_MS + 1;
    now.store(expired, Ordering::Relaxed);
    fc.rx_from_side(
        &discovery::build_discovery_announce("PB", expired, &[]).unwrap(),
        ingress,
    )
    .unwrap();
    assert!(
        !fc.export_topology()
            .routes
            .iter()
            .any(|route| route.reachable_endpoints.contains(&endpoint)),
        "a genuinely silent RF must still expire even with PB present"
    );
}

#[test]
fn queue_service_expires_incomplete_transfers_without_new_fragments() {
    crate::tests::ensure_common_test_schema();
    let now = Arc::new(AtomicU64::new(0));
    let clock = now.clone();
    let router = Router::new_with_clock(
        RouterConfig::new([]),
        Box::new(move || clock.load(Ordering::Relaxed)),
    );
    let side = router.add_side_packed("CAN", |_| Ok(()));
    let retained = Arc::<[u8]>::from([42; 128]);
    let witness = Arc::downgrade(&retained);
    router
        .state
        .lock()
        .side_transport
        .get_mut(&side)
        .unwrap()
        .rx_chunks
        .insert(
            7,
            SideChunkAssembly {
                last_seen_ms: 0,
                total: 2,
                received: [(0, crate::shared_bytes::convert(retained))]
                    .into_iter()
                    .collect(),
            },
        );
    now.store(2000, Ordering::Relaxed);
    router.dispatch_tx_queue_with_timeout(1).unwrap();
    assert!(witness.upgrade().is_some(), "live transfer expired early");
    extern "C" fn deny_new_work(_: usize, _: usize) -> bool {
        false
    }
    struct Reset;
    impl Drop for Reset {
        fn drop(&mut self) {
            crate::memory_admission::set_probe(None);
        }
    }
    let _reset = Reset;
    crate::memory_admission::set_probe(Some(deny_new_work));
    now.store(2001, Ordering::Relaxed);
    router.dispatch_tx_queue_with_timeout(1).unwrap();
    assert!(
        witness.upgrade().is_none(),
        "abandoned transfer pinned its payload without new ingress"
    );
    assert!(
        router.state.lock().side_transport[&side]
            .rx_chunks
            .is_empty()
    );
}

#[test]
fn discovery_growth_drops_telemetry_before_live_routes() {
    crate::tests::ensure_common_test_schema();
    let router = Router::new_with_clock(RouterConfig::new([]), Box::new(|| 1));
    let side = router.add_side_packed("CAN", |_| Ok(()));
    let endpoint = crate::DataEndpoint::named("RADIO");
    let mut route = DiscoverySideState {
        reachable: vec![endpoint],
        ..Default::default()
    };
    for name in ["AB", "VB"] {
        route.announcers.insert(
            name.into(),
            DiscoverySenderState {
                last_seen_ms: 1,
                reachable: vec![endpoint],
                advertised_reachable: vec![endpoint],
                ..Default::default()
            },
        );
    }
    let mut st = router.state.lock();
    st.discovery_routes.insert(side, route.clone());
    st.push_transmit(TxQueued {
        item: RouterTxItem::ToSide {
            src: None,
            dst: side,
            data: RouterItem::Packed(crate::shared_bytes::convert(Arc::<[u8]>::from([0; 512]))),
        },
        ignore_local: true,
        priority: 1,
        retry_after_ms: 0,
    })
    .unwrap();
    st.push_transmit(TxQueued {
        item: RouterTxItem::ToSide {
            src: None,
            dst: side,
            data: RouterItem::Packed(crate::shared_bytes::convert(Arc::<[u8]>::from([0; 32]))),
        },
        ignore_local: true,
        priority: 255,
        retry_after_ms: 0,
    })
    .unwrap();
    st.memory.max_queue_budget = st.shared_queue_bytes_used();
    // Simulate new discovery metadata arriving while the shared queue is full.
    st.discovery_routes
        .get_mut(&side)
        .unwrap()
        .reachable_timesync_sources
        .push("x".repeat(128));
    let expected = st.discovery_routes[&side].clone();
    st.fit_discovery_budget();
    assert_eq!(
        st.discovery_routes.get(&side),
        Some(&expected),
        "a telemetry backlog erased AB and VB routes"
    );
    assert!(st.shared_queue_bytes_used() <= st.memory.max_queue_budget);
    assert_eq!(st.transmit_queue.len(), 1);
    assert_eq!(
        st.transmit_queue.lowest_priority(|item| item.priority),
        Some(255),
        "discard low-priority telemetry before control"
    );
}

#[test]
fn known_discovery_survives_snapshot_memory_pressure() {
    crate::tests::ensure_common_test_schema();
    let now = Arc::new(core::sync::atomic::AtomicU64::new(1));
    let clock = now.clone();
    let node = Router::new_with_clock(
        RouterConfig::new([]).with_sender("GB"),
        Box::new(move || clock.load(core::sync::atomic::Ordering::Relaxed)),
    );
    let sent = Arc::new(std::sync::Mutex::new(Vec::new()));
    let output = sent.clone();
    let side = node.add_side_packet("CAN", move |pkt| {
        output.lock().unwrap().push(pkt.clone());
        Ok(())
    });
    let endpoint = crate::DataEndpoint::named("RADIO");
    let ad = discovery::AddressAdvertisement {
        hostname: "AB".into(),
        address: 42,
        requested_address: 42,
        mode: discovery::ADDRESS_MODE_REQUESTED,
        state: discovery::ADDRESS_STATE_REQUEST,
        birth_ms: 1,
        owner_hash: 42,
        reachable_endpoints: vec![endpoint],
        reachable_network_variables: vec![],
        reachable_timesync_sources: vec![],
        link_capabilities: RouterSideOptions::default().link_capabilities(),
    };
    let baseline = discovery::build_discovery_address("AB", 1, &ad).unwrap();
    node.learn_discovery_packet(&baseline, Some(side), true)
        .unwrap();
    {
        let mut st = node.state.lock();
        let peer = st
            .discovery_routes
            .get_mut(&side)
            .unwrap()
            .announcers
            .get_mut("AB")
            .unwrap();
        peer.has_full_topology = true;
        peer.has_schema = true;
        let throttle = st.discovery_side_throttle.entry(side).or_default();
        throttle.has_sent_full = true;
        throttle.next_ping_ms = 0;
    }
    extern "C" fn only_small_work(additional: usize, _: usize) -> bool {
        additional < 2048
    }
    struct Reset;
    impl Drop for Reset {
        fn drop(&mut self) {
            crate::memory_admission::set_probe(None);
        }
    }
    let _reset = Reset;
    crate::memory_admission::set_probe(Some(only_small_work));
    for ms in (5_000..=300_000).step_by(5_000) {
        now.store(ms, core::sync::atomic::Ordering::Relaxed);
        // A restart request invalidates the TX baseline. A refused full reply
        // must not disable small liveness traffic for the rest of the run.
        if ms == 150_000 {
            node.state
                .lock()
                .discovery_side_throttle
                .entry(side)
                .or_default()
                .has_sent_full = false;
        }
        let repeated = discovery::build_discovery_address("AB", ms, &ad).unwrap();
        node.learn_discovery_packet(&repeated, Some(side), true)
            .unwrap();
        let ping = discovery::build_discovery_announce("AB", ms, &[]).unwrap();
        node.learn_discovery_packet(&ping, Some(side), true)
            .unwrap();
        node.queue_discovery_announce(false, true).unwrap();
        node.process_tx_queue().unwrap();
        let st = node.state.lock();
        let peer = &st.discovery_routes[&side].announcers["AB"];
        assert_eq!(peer.last_seen_ms, ms);
        assert_eq!(peer.advertised_reachable, vec![endpoint]);
    }
    let packets = sent.lock().unwrap();
    assert!(
        packets
            .last()
            .is_some_and(|packet| packet.timestamp() >= 295_000),
        "a refused restart baseline must not permanently stop keepalives"
    );
    let pings = packets
        .iter()
        .filter(|pkt| {
            matches!(
                pkt.data_type(),
                crate::DataType::DiscoveryAnnounce | crate::DataType::DiscoveryAddress
            )
        })
        .count();
    assert!(
        (20..=60).contains(&pings),
        "keepalives must be bounded but outlive the 30-second route TTL: {pings}"
    );
    assert!(packets.iter().all(|pkt| matches!(
        pkt.data_type(),
        crate::DataType::DiscoveryAnnounce | crate::DataType::DiscoveryAddress
    )));
    drop(packets);
    let before = node.state.lock().discovery_routes[&side].clone();
    let unknown = discovery::build_discovery_announce("UNKNOWN", 300_001, &[]).unwrap();
    assert!(
        node.learn_discovery_packet(&unknown, Some(side), true)
            .is_err()
    );
    let mut changed = ad.clone();
    changed
        .reachable_endpoints
        .push(crate::DataEndpoint::named("SD_CARD"));
    let update = discovery::build_discovery_address("AB", 300_001, &changed).unwrap();
    assert!(
        node.learn_discovery_packet(&update, Some(side), true)
            .is_err()
    );
    assert_eq!(
        node.state.lock().discovery_routes[&side],
        before,
        "pressure liveness must not admit new peers or changed endpoint claims"
    );
    now.store(
        300_000 + discovery::DISCOVERY_ROUTE_TTL_MS + 1,
        core::sync::atomic::Ordering::Relaxed,
    );
    let mut st = node.state.lock();
    Router::prune_discovery_routes_locked(&mut st, now.load(core::sync::atomic::Ordering::Relaxed));
    assert!(
        !st.discovery_routes.contains_key(&side),
        "a silent peer must still expire"
    );
}

#[test]
fn compact_address_and_topology_bootstrap_fit_bounded_headroom() {
    crate::tests::ensure_common_test_schema();
    extern "C" fn summaries_only(additional: usize, _: usize) -> bool {
        additional < 8192
    }
    struct Reset;
    impl Drop for Reset {
        fn drop(&mut self) {
            crate::memory_admission::set_probe(None);
        }
    }
    let node = Router::new_with_clock(RouterConfig::new([]).with_sender("GB"), Box::new(|| 1));
    let sent = Arc::new(std::sync::Mutex::new(Vec::new()));
    let output = sent.clone();
    let side = node.add_side_packet("CAN", |_| Ok(()));
    let _upstream = node.add_side_packet("UART", move |packet| {
        output.lock().unwrap().push(packet.clone());
        Ok(())
    });
    let _reset = Reset;
    crate::memory_admission::set_probe(Some(summaries_only));
    for (i, name) in ["AB", "VB", "DAQ"].into_iter().enumerate() {
        let ad = discovery::AddressAdvertisement {
            hostname: name.into(),
            address: 42 + i as u32,
            requested_address: 42 + i as u32,
            mode: discovery::ADDRESS_MODE_REQUESTED,
            state: discovery::ADDRESS_STATE_REQUEST,
            birth_ms: 1,
            owner_hash: 42 + i as u64,
            reachable_endpoints: vec![crate::DataEndpoint::named("RADIO")],
            reachable_network_variables: vec![],
            reachable_timesync_sources: vec![],
            link_capabilities: RouterSideOptions::default().link_capabilities(),
        };
        let packet = discovery::build_discovery_address(name, 1, &ad).unwrap();
        node.learn_discovery_packet(&packet, Some(side), true)
            .unwrap();
        let st = node.state.lock();
        assert!(st.discovery_routes[&side].announcers.contains_key(name));
    }
    assert_eq!(
        node.state.lock().discovery_routes[&side].announcers.len(),
        3
    );
    node.queue_discovery_announce(false, true).unwrap();
    node.process_tx_queue().unwrap();
    let packets = sent.lock().unwrap();
    let summary = packets
        .iter()
        .find(|packet| packet.data_type() == crate::DataType::DiscoveryAddress)
        .expect("compact reachability must reach GroundStation without a full snapshot");
    assert!(
        discovery::decode_discovery_address(summary)
            .unwrap()
            .reachable_endpoints
            .contains(&crate::DataEndpoint::named("RADIO"))
    );
    let topology = packets
        .iter()
        .find(|packet| packet.data_type() == crate::DataType::DiscoveryTopology)
        .expect("a schema-free topology must fit the bounded recovery headroom");
    let boards = discovery::decode_discovery_topology(topology).unwrap();
    for name in ["AB", "VB", "DAQ", "GB"] {
        assert!(
            boards.iter().any(|board| board.sender_id == name),
            "missing {name}"
        );
    }
    drop(packets);
    let unknown = discovery::build_discovery_announce("UNKNOWN", 1, &[]).unwrap();
    assert!(
        node.learn_discovery_packet(&unknown, Some(side), true)
            .is_err(),
        "full discovery admission remains guarded"
    );
}

#[test]
fn chunked_schema_resumes_after_transport_backpressure() {
    crate::tests::ensure_common_test_schema();
    for packed_input in [false, true] {
        let allowance = Arc::new(core::sync::atomic::AtomicUsize::new(0));
        let callback_allowance = allowance.clone();
        let accepted = Arc::new(std::sync::Mutex::new(Vec::new()));
        let callback_accepted = accepted.clone();
        let node = Router::new_with_clock(RouterConfig::new([]).with_sender("GB"), Box::new(|| 1));
        let side = node.add_side_packed_with_options(
            "bounded CAN",
            move |bytes| {
                if callback_allowance
                    .try_update(
                        core::sync::atomic::Ordering::Relaxed,
                        core::sync::atomic::Ordering::Relaxed,
                        |left| left.checked_sub(1),
                    )
                    .is_err()
                {
                    return Err(crate::TelemetryError::Io("CAN queue full"));
                }
                callback_accepted
                    .lock()
                    .unwrap()
                    .push(Arc::<[u8]>::from(bytes));
                Ok(())
            },
            RouterSideOptions::default().with_small_packet_transport(128),
        );
        let packet = crate::packet::Packet::new(
            crate::DataType::DiscoverySchema,
            &[crate::DataEndpoint::Discovery],
            "GB",
            100,
            Arc::from((0..3600).map(|i| (i % 251) as u8).collect::<Vec<_>>()),
        )
        .unwrap();
        let raw = crate::wire_format::pack_packet(&packet);
        let expected = crate::side_transport::SideTransportFrames::split(
            crate::shared_bytes::convert(raw.clone()),
            128,
            b"GB",
        )
        .unwrap()
        .collect::<Vec<_>>();
        let item = if packed_input {
            RouterItem::Packed(crate::shared_bytes::convert(raw))
        } else {
            RouterItem::Packet(packet)
        };
        let handler = node.state.lock().sides[side]
            .as_ref()
            .unwrap()
            .tx_handler
            .clone();
        let mut complete = false;
        for _ in 0..100 {
            allowance.store(1, core::sync::atomic::Ordering::Relaxed);
            match node.call_side_tx_handler(side, &handler, &item, false) {
                Ok(()) => {
                    complete = true;
                    break;
                }
                Err(crate::TelemetryError::Io(_)) => {}
                other => panic!("unexpected chunk dispatch result: {other:?}"),
            }
        }
        assert!(
            complete,
            "partial acceptance must complete instead of replaying chunk zero forever"
        );
        let received = accepted.lock().unwrap();
        assert_eq!(
            received
                .iter()
                .map(|frame| frame.as_ref())
                .collect::<Vec<_>>(),
            expected
                .iter()
                .map(|frame| frame.as_ref())
                .collect::<Vec<_>>(),
            "every accepted chunk is sent once, in order, with one transfer identity"
        );
    }
}

#[test]
fn new_peer_and_schema_cannot_evict_existing_routes() {
    crate::tests::ensure_common_test_schema();
    let node = Router::new_with_clock(RouterConfig::new([]).with_sender("GB"), Box::new(|| 1));
    let side = node.add_side_packet("CAN", |_| Ok(()));
    let ad = discovery::AddressAdvertisement {
        hostname: "AB".into(),
        address: 42,
        requested_address: 42,
        mode: discovery::ADDRESS_MODE_REQUESTED,
        state: discovery::ADDRESS_STATE_REQUEST,
        birth_ms: 1,
        owner_hash: 42,
        reachable_endpoints: vec![crate::DataEndpoint::named("RADIO")],
        reachable_network_variables: vec![],
        reachable_timesync_sources: vec![],
        link_capabilities: RouterSideOptions::default().link_capabilities(),
    };
    let packet = discovery::build_discovery_address("AB", 1, &ad).unwrap();
    node.learn_discovery_packet(&packet, Some(side), true)
        .unwrap();
    let before = {
        let mut st = node.state.lock();
        st.memory.max_queue_budget = st.shared_queue_bytes_used() + 64;
        st.discovery_routes[&side].clone()
    };
    let mut new_peer = ad.clone();
    new_peer.hostname = "VB".into();
    new_peer.address = 43;
    new_peer.requested_address = 43;
    new_peer.owner_hash = 43;
    let packet = discovery::build_discovery_address("VB", 2, &new_peer).unwrap();
    assert!(
        node.learn_discovery_packet(&packet, Some(side), true)
            .is_err()
    );
    assert_eq!(node.state.lock().discovery_routes[&side], before);
    let schema_before = crate::config::schema_bytes_used();
    let schema = crate::config::OwnedRuntimeSchemaSnapshot {
        endpoints: vec![crate::config::OwnedEndpointDefinition {
            id: crate::DataEndpoint(8888),
            name: "PROTECTED_ROUTE_PRESSURE_ENDPOINT".into(),
            description: "x".repeat(4096),
            link_local_only: false,
        }],
        types: vec![],
    };
    let packet =
        discovery::build_discovery_schema_from_owned_snapshot("NEW_BOARD", 3, schema).unwrap();
    assert!(
        node.learn_discovery_packet(&packet, Some(side), true)
            .is_err()
    );
    assert_eq!(
        crate::config::schema_bytes_used(),
        schema_before,
        "a refused schema must leave the registry unchanged"
    );
    let st = node.state.lock();
    assert_eq!(st.discovery_routes[&side], before);
    assert!(st.shared_queue_bytes_used() <= st.memory.max_queue_budget);
}

#[test]
fn schema_reclaims_queued_data_before_refusing_update() {
    crate::tests::ensure_common_test_schema();
    let node = Router::new_with_clock(RouterConfig::new([]).with_sender("GB"), Box::new(|| 1));
    let side = node.add_side_packet("CAN", |_| Ok(()));
    {
        let mut st = node.state.lock();
        st.push_transmit(TxQueued {
            item: RouterTxItem::ToSide {
                src: None,
                dst: side,
                data: RouterItem::Packed(crate::shared_bytes::convert(Arc::<[u8]>::from(vec![
                    0;
                    2048
                ]))),
            },
            ignore_local: true,
            priority: 254,
            retry_after_ms: 0,
        })
        .unwrap();
        st.memory.max_queue_budget = st.shared_queue_bytes_used();
    }
    let schema = crate::config::OwnedRuntimeSchemaSnapshot {
        endpoints: vec![crate::config::OwnedEndpointDefinition {
            id: crate::DataEndpoint(8890),
            name: "SCHEMA_RECLAIM_router".into(),
            description: "x".repeat(512),
            link_local_only: false,
        }],
        types: vec![],
    };
    let packet =
        discovery::build_discovery_schema_from_owned_snapshot("NEW_BOARD", 3, schema).unwrap();
    node.learn_discovery_packet(&packet, Some(side), true)
        .unwrap();
    let st = node.state.lock();
    assert!(
        st.transmit_queue.is_empty(),
        "queued data must give way to the new schema"
    );
    assert!(st.shared_queue_bytes_used() <= st.memory.max_queue_budget);
    assert_eq!(
        crate::DataEndpoint::try_from_u32(8890),
        Some(crate::DataEndpoint(8890))
    );
    drop(st);
    crate::config::remove_endpoint(crate::DataEndpoint(8890)).unwrap();
}

#[test]
fn keepalive_fits_reserved_control_headroom() {
    crate::tests::ensure_common_test_schema();
    let node = Router::new_with_clock(RouterConfig::new([]).with_sender("GB"), Box::new(|| 5000));
    let sent = Arc::new(core::sync::atomic::AtomicUsize::new(0));
    let output = sent.clone();
    let side = node.add_side_packet("UART", move |pkt| {
        if pkt.data_type() == crate::DataType::DiscoveryAnnounce && pkt.payload().is_empty() {
            output.fetch_add(1, core::sync::atomic::Ordering::Relaxed);
        }
        Ok(())
    });
    node.state
        .lock()
        .discovery_side_throttle
        .entry(side)
        .or_default()
        .has_sent_full = true;
    extern "C" fn control_only(additional: usize, _: usize) -> bool {
        additional <= 512
    }
    struct Reset;
    impl Drop for Reset {
        fn drop(&mut self) {
            crate::memory_admission::set_probe(None);
        }
    }
    let _reset = Reset;
    crate::memory_admission::set_probe(Some(control_only));
    node.queue_discovery_announce(false, true).unwrap();
    node.process_tx_queue().unwrap();
    assert_eq!(sent.load(core::sync::atomic::Ordering::Relaxed), 1);
    node.queue_discovery_announce(false, true).unwrap();
    node.process_tx_queue().unwrap();
    assert_eq!(
        sent.load(core::sync::atomic::Ordering::Relaxed),
        1,
        "keepalives were not rate limited"
    );
}

#[test]
fn discovery_snapshot_reclaims_telemetry_but_preserves_commands_and_acks() {
    crate::tests::ensure_common_test_schema();
    static REFUSALS: core::sync::atomic::AtomicUsize = core::sync::atomic::AtomicUsize::new(0);
    extern "C" fn scratch_after_reclaim(additional: usize, _: usize) -> bool {
        additional < 2048 || REFUSALS.fetch_add(1, core::sync::atomic::Ordering::SeqCst) >= 2
    }
    struct Reset;
    impl Drop for Reset {
        fn drop(&mut self) {
            crate::memory_admission::set_probe(None);
        }
    }
    let node = Router::new_with_clock(RouterConfig::new([]).with_sender("GB"), Box::new(|| 1));
    let side = node.add_side_packet("CAN", |_| Ok(()));
    for priority in [1, 2, 200, 254, 255] {
        node.state
            .lock()
            .push_transmit(TxQueued {
                item: RouterTxItem::ToSide {
                    src: None,
                    dst: side,
                    data: RouterItem::Packed(crate::shared_bytes::convert(Arc::<[u8]>::from(
                        [0; 32],
                    ))),
                },
                ignore_local: true,
                priority,
                retry_after_ms: 0,
            })
            .unwrap();
    }
    REFUSALS.store(0, core::sync::atomic::Ordering::SeqCst);
    let _reset = Reset;
    crate::memory_admission::set_probe(Some(scratch_after_reclaim));
    node.queue_discovery_announce(false, true).unwrap();
    let st = node.state.lock();
    assert_eq!(
        st.transmit_queue.lowest_priority(|item| item.priority),
        Some(200)
    );
    for priority in [200, 254] {
        assert_eq!(
            st.transmit_queue
                .iter()
                .filter(|item| item.priority == priority)
                .count(),
            1
        );
    }
    assert!(
        st.transmit_queue.iter().any(|item| matches!(
            &item.item, RouterTxItem::ToSide { data: RouterItem::Packet(pkt), .. }
                if pkt.data_type() == DataType::DiscoveryAddress
        )),
        "scratch refusal left a late-joining valve without a return-route baseline"
    );
}