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
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
//! Heartbeat window tracking and lost-worker failure surfacing.
use chrono::{DateTime, Utc};
use std::collections::{HashMap, HashSet};
use std::sync::{Arc, Mutex, MutexGuard};
use std::time::{Duration, Instant};
use tokio::sync::{Notify, watch};
use tracing::{error, info, warn};
use aion_core::{ActivityId, Payload, WorkflowId};
use aion_proto::{ProtoHeartbeat, WireError};
use crate::error::ServerError;
use crate::shutdown::DrainState;
use crate::worker::dispatch::{
ActivityCompletion, ActivityCompletionOutcome, ActivityCompletionSink,
};
use crate::worker::envelope::CompletionToken;
use crate::worker::registry::{ConnectedWorkerRegistry, WorkerId};
mod handover;
mod sweep;
use sweep::is_expired;
/// In-flight activity assigned to a connected worker.
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct InFlightActivity {
/// Owning workflow id.
pub workflow_id: WorkflowId,
/// Correlating activity id.
pub activity_id: ActivityId,
/// One-based delivery attempt this dispatch carries — the third axis of the
/// `(workflow, activity, attempt)` identity the transcript, the intervention
/// index, and history all key on.
///
/// It is NOT part of the tracker's key: a completion is addressed by the
/// worker, workflow, and activity together, and widening the key would
/// break that addressing. It is carried so a reader asking about a SPECIFIC
/// attempt — the live describe join asking whose progress note this is —
/// can tell a tracked entry for the attempt it asked about from a lingering
/// entry for a superseded one, instead of attributing one attempt's note to
/// another.
pub attempt: u32,
/// Generation authorized to receive a result or synthesized loss.
pub completion_token: CompletionToken,
}
/// Observable liveness state for a single in-flight activity.
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct TaskLiveness {
/// Worker currently responsible for the task.
pub worker_id: WorkerId,
/// Owning workflow id.
pub workflow_id: WorkflowId,
/// Correlating activity id.
pub activity_id: ActivityId,
/// One-based delivery attempt this tracked dispatch carries (see
/// [`InFlightActivity::attempt`]).
pub attempt: u32,
/// Generation authorized to receive a result or synthesized loss.
pub completion_token: CompletionToken,
/// Operator-configured heartbeat window used for expiry checks.
pub heartbeat_window: Duration,
/// Monotonic timestamp of assignment or the most recent heartbeat.
pub last_heartbeat_at: Instant,
/// Optional worker progress from the most recent heartbeat.
pub last_progress: Option<Payload>,
/// Wall-clock instant this process received the heartbeat that carried
/// [`Self::last_progress`]. `None` while no progress has been reported.
///
/// A wall clock rather than the tracked [`Instant`] because this one is
/// REPORTED to operators, and a monotonic instant means nothing outside the
/// process that minted it. Server-side observability stamping only — the
/// determinism boundary governs workflow-visible time, and nothing here is
/// workflow-visible.
pub last_progress_at: Option<DateTime<Utc>>,
}
/// Result of accepting a heartbeat for an in-flight task.
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct HeartbeatUpdate {
/// Updated liveness after recording the heartbeat.
pub liveness: TaskLiveness,
}
/// Tasks removed from tracking because a worker was declared lost.
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct LostWorkerReport {
/// Lost worker removed from the connected-worker registry.
pub worker_id: WorkerId,
/// In-flight activities swept off the tracker: surfaced to the engine as
/// retryable failures on the `fail_*` paths, or parked for restart
/// recovery (nothing recorded, nothing delivered) on the graceful-drain
/// `park_*` paths (#207).
pub tasks: Vec<InFlightActivity>,
/// Task queue the lost worker was serving, captured from the registry
/// BEFORE deregistration (afterwards the handle is gone and the queue is
/// unknowable). `None` when the worker was already absent from the registry.
///
/// This is what lets the deregistration log name the queue an operator has
/// to act on, rather than an opaque worker id.
pub task_queue: Option<String>,
}
#[derive(Clone, Debug, Eq, Hash, PartialEq)]
struct TaskKey(WorkerId, WorkflowId, ActivityId);
#[derive(Debug, Default)]
struct HeartbeatState {
tasks: HashMap<TaskKey, TaskLiveness>,
/// Last frame observed on each live worker connection.
///
/// This is the PROCESS-IS-ALIVE fact, and only that. It is advanced by
/// anything the worker sends — including the worker-side liveness pump,
/// which beats from a background task regardless of what its serve loop is
/// doing. A fresh entry here means "that process is running and its
/// worker-to-server direction works". It does NOT mean the server can
/// reach it.
connections: HashMap<WorkerId, Instant>,
/// Last time the server PROVED it can reach this worker's dispatch path,
/// i.e. the last answered liveness ping.
///
/// This is the SERVER-CAN-REACH-THE-WORKER fact, and it is the only one
/// that is a dispatch precondition. It is advanced ONLY by an answered
/// ping, never by an inbound frame, because only the ping rides the same
/// server-to-worker leg a dispatch does.
///
/// The two facts are separate because collapsing them hid a total outage:
/// on run `dfd2117c` the server could not push to a worker for fifteen
/// minutes while the worker's pump kept the single old lease perfectly
/// fresh, so the dead-man switch could not fire for the one failure it
/// exists to detect. `liminal_transport`'s own doc already forbids this —
/// the ping proves "the exact path a dispatch would take, not a parallel
/// one that could be healthy while the real one is not" — and the pump
/// feeding the same lease was exactly that parallel channel.
reachability: HashMap<WorkerId, Reachability>,
}
/// How many CONSECUTIVE answered pings re-admit a worker to dispatch.
///
/// A connection is a channel to prove reachability ON, never proof of it: the
/// registration handshake's ack is SENT by the server, and a sent ack is not a
/// received one — exactly the inference this whole lane exists to stop making.
/// So eligibility is earned by measurement, on every connection including the
/// first, and a redial re-seeds the measurement OPPORTUNITY rather than the
/// verdict.
///
/// Why two and not one: one success re-admits a link that answered once by luck
/// — a race, a buffer that happened to drain — so a link answering one probe in
/// three would flap in and out of eligibility indefinitely, which is the defect
/// this constant exists to remove rather than slow down. Two consecutive
/// successes is the smallest number that distinguishes "answered" from
/// "answering".
///
/// Why not three or more: the cost is paid on EVERY connect, in probe cadences.
/// At the probe's cadence a fresh worker is undispatchable for `K` cadences
/// while its first dispatches park, and that latency is charged to every honest
/// worker to catch a dishonest one. Two buys the discrimination; three buys
/// only delay.
pub(crate) const DISPATCH_PROBATION_PINGS: u32 = 2;
/// A worker's dispatch-path standing: how many consecutive pings it has
/// answered, and when the most recent one landed.
///
/// `proved_at` is `None` until the probation is served, so a worker on
/// probation is not merely stale — it has no proof at all, which is the honest
/// description of a connection nothing has been measured on yet.
#[derive(Clone, Copy, Debug, Default)]
struct Reachability {
consecutive_answers: u32,
proved_at: Option<Instant>,
/// Whether this worker has EVER held dispatch eligibility on this
/// connection. Not a duplicate of the two fields above: they describe the
/// current standing, this describes the connection's history, and only the
/// history separates a worker still serving its opening probation from one
/// that earned eligibility and then lost it.
///
/// Deliberately NOT cleared by [`HeartbeatTracker::record_dispatch_unreachable`]
/// — a failed ping ends the current proof, it does not un-happen the proof
/// that came before it. Cleared only by
/// [`HeartbeatTracker::register_connection`], because a new connection is a
/// new measurement and nothing earned on the old one carries across.
ever_proved: bool,
}
impl Reachability {
/// Whether the probation is served and the proof is still inside `window`.
fn is_proved(self, now: Instant, window: Duration) -> bool {
self.consecutive_answers >= DISPATCH_PROBATION_PINGS
&& self.proved_at.is_some_and(|proved_at| {
now.checked_duration_since(proved_at)
.is_none_or(|elapsed| elapsed <= window)
})
}
/// Why this standing does not currently permit dispatch.
///
/// Only meaningful when [`Self::is_proved`] is false; the caller pairs them
/// so the classification and the membership test can never disagree about
/// which workers are excluded.
fn exclusion(self) -> DispatchExclusion {
if self.ever_proved {
DispatchExclusion::ReachabilityLost
} else {
DispatchExclusion::OpeningProbation {
answers: self.consecutive_answers,
}
}
}
}
/// Why a worker is currently excluded from dispatch selection.
///
/// These are DIFFERENT FACTS and an operator must be able to tell them apart —
/// the same standard this module already holds the two ping failures to. One is
/// the ordinary cost of connecting; the other is an incident. Reported as one
/// value alongside the exclusion itself so nothing has to re-derive the reason
/// from a second reading of the same state.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum DispatchExclusion {
/// The worker registered and has not yet answered
/// [`DISPATCH_PROBATION_PINGS`] consecutive pings, so eligibility has never
/// been earned on this connection. Expected on EVERY connect, including a
/// perfectly healthy one — this is the probation being served, not a fault.
OpeningProbation {
/// Consecutive answers banked so far, out of [`DISPATCH_PROBATION_PINGS`].
answers: u32,
},
/// The worker held dispatch eligibility on this connection and no longer
/// does: either a ping failed and restarted its probation, or the last
/// proof aged out of the heartbeat window. This one is an incident.
ReachabilityLost,
}
/// One worker excluded from dispatch, with the reason it is excluded.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct ExcludedWorker {
/// The worker selection must skip.
pub worker_id: WorkerId,
/// Why it is being skipped.
pub exclusion: DispatchExclusion,
}
/// Per-task liveness tracker for remote-worker streams.
///
/// It is also the server's ONLY store of worker progress notes, and that store
/// is VOLATILE: notes live here and nowhere else, so a restart loses every note
/// ever reported. [`Self::notes_held_since`] is the evidence a reader needs to
/// tell "this worker has said nothing" from "this process was not running when
/// the attempt began" — see `crate::worker::attempt_progress`.
#[derive(Clone, Debug)]
pub struct HeartbeatTracker {
heartbeat_window: Duration,
inner: Arc<Mutex<HeartbeatState>>,
empty: Arc<Notify>,
notes_held_since: DateTime<Utc>,
}
impl HeartbeatTracker {
/// Build a tracker using the operator-supplied heartbeat window.
#[must_use]
pub fn new(heartbeat_window: Duration) -> Self {
Self {
heartbeat_window,
inner: Arc::new(Mutex::new(HeartbeatState::default())),
empty: Arc::new(Notify::new()),
// The instant this volatile note store began holding notes. Read
// here rather than injected because it is exactly the tracker's own
// construction instant — there is no other value it could be, and a
// caller passing a different one would be reporting a fiction.
notes_held_since: Utc::now(),
}
}
/// When this tracker began holding progress notes.
///
/// An attempt dispatched before this instant left its notes in a process
/// that no longer exists, so their absence here says nothing about what the
/// worker reported.
#[must_use]
pub const fn notes_held_since(&self) -> DateTime<Utc> {
self.notes_held_since
}
/// Start the connection-level lease for a newly registered worker, and open
/// its dispatch probation.
///
/// The connection lease starts fresh — the worker's process is plainly
/// alive, it just registered. Dispatch reachability does NOT: a new
/// connection is a channel to prove reachability on, not proof of it.
///
/// This deliberately reverses an earlier reading of mine, that the
/// registration handshake is "itself a completed server-to-worker round
/// trip". The ack is SENT by the server; nothing reports that it was
/// RECEIVED. Treating a send as a delivery is the same inference this lane
/// exists to stop making, and left unfixed it meant a worker the server
/// could never reach would re-seed itself on every redial and cycle in and
/// out of eligibility forever instead of settling out.
///
/// See [`DISPATCH_PROBATION_PINGS`].
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn register_connection(
&self,
worker_id: WorkerId,
now: Instant,
) -> Result<(), ServerError> {
let mut state = self.state()?;
state.connections.insert(worker_id, now);
// A fresh, UNSERVED probation: zero answers, no proof. Inserted rather
// than left absent so the worker is carried by `unreachable_workers`
// and is therefore explicitly excluded, not merely unknown.
state
.reachability
.insert(worker_id, Reachability::default());
Ok(())
}
/// Advance a worker's connection lease after receiving any frame.
///
/// Records ONLY that the worker's process is alive. It deliberately does
/// NOT advance dispatch reachability: an inbound frame — a heartbeat, a
/// pump beat, a completion — proves the worker-to-server direction and
/// says nothing about whether the server can push to it. Use
/// [`Self::record_dispatch_reachability`] for the fact that gates dispatch.
///
/// Returns `false` if the worker has already been removed from lease tracking;
/// a frame racing deregistration must not resurrect it.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn record_connection_activity(
&self,
worker_id: WorkerId,
now: Instant,
) -> Result<bool, ServerError> {
let mut state = self.state()?;
let Some(last_activity) = state.connections.get_mut(&worker_id) else {
return Ok(false);
};
*last_activity = now;
Ok(true)
}
/// Record proof that the server can reach this worker's dispatch path — an
/// ANSWERED liveness ping, and nothing else.
///
/// Advances both facts, because an answered ping proves both: the worker
/// received a server push (reachability) and replied to it (alive). It also
/// serves one ping of the dispatch probation; eligibility returns once
/// [`DISPATCH_PROBATION_PINGS`] consecutive answers have landed.
///
/// Returns `false` if the worker has already been removed from lease
/// tracking; a pong racing a reap must not resurrect it.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn record_dispatch_reachability(
&self,
worker_id: WorkerId,
now: Instant,
) -> Result<bool, ServerError> {
let mut state = self.state()?;
let Some(last_activity) = state.connections.get_mut(&worker_id) else {
return Ok(false);
};
*last_activity = now;
let standing = state.reachability.entry(worker_id).or_default();
standing.consecutive_answers = standing.consecutive_answers.saturating_add(1);
standing.proved_at = Some(now);
if standing.consecutive_answers >= DISPATCH_PROBATION_PINGS {
// The probation is served. Recording it here — at the one place a
// probation can complete — is what lets a later exclusion say
// whether eligibility was ever held, without a second copy of the
// threshold anywhere else.
standing.ever_proved = true;
}
Ok(true)
}
/// Record that a liveness ping went UNANSWERED: the probation restarts.
///
/// This is what makes the probation consecutive rather than cumulative. A
/// link answering one probe in three would otherwise accumulate its way to
/// eligibility and keep it, which is the flapping this design removes.
///
/// Returns `false` if the worker has already been removed from lease
/// tracking.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn record_dispatch_unreachable(&self, worker_id: WorkerId) -> Result<bool, ServerError> {
let mut state = self.state()?;
if !state.connections.contains_key(&worker_id) {
return Ok(false);
}
let standing = state.reachability.entry(worker_id).or_default();
standing.consecutive_answers = 0;
standing.proved_at = None;
// `ever_proved` deliberately survives: this connection DID earn
// eligibility once, and that is what makes the loss an incident rather
// than the ordinary cost of connecting.
Ok(true)
}
/// Whether the server has proved, within the heartbeat window, that it can
/// reach this worker's dispatch path — probation served AND the proof still
/// fresh.
///
/// An untracked worker is not reachable: absence of proof is not proof.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn is_dispatch_reachable(
&self,
worker_id: WorkerId,
now: Instant,
) -> Result<bool, ServerError> {
let state = self.state()?;
Ok(state
.reachability
.get(&worker_id)
.is_some_and(|standing| standing.is_proved(now, self.heartbeat_window)))
}
/// Every tracked worker the server has NOT been able to reach within the
/// heartbeat window, regardless of how alive its process looks, each paired
/// with WHY it is excluded.
///
/// The reason travels with the membership rather than being recomputed by
/// the caller, so the set that gates dispatch and the reason an operator is
/// told can never describe different states.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn unreachable_workers(&self, now: Instant) -> Result<Vec<ExcludedWorker>, ServerError> {
let state = self.state()?;
let mut workers = state
.reachability
.iter()
.filter(|(_, standing)| !standing.is_proved(now, self.heartbeat_window))
.map(|(worker_id, standing)| ExcludedWorker {
worker_id: *worker_id,
exclusion: standing.exclusion(),
})
.collect::<Vec<_>>();
workers.sort_unstable_by_key(|excluded| excluded.worker_id);
Ok(workers)
}
/// End connection-lease tracking when a transport closes normally.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn unregister_connection(&self, worker_id: WorkerId) -> Result<(), ServerError> {
let mut state = self.state()?;
state.connections.remove(&worker_id);
state.reachability.remove(&worker_id);
Ok(())
}
/// Track a newly accepted in-flight activity for heartbeat expiry.
///
/// # The reservation, and why it is taken by value
///
/// `reservation` is the capacity slot the caller claimed at selection.
/// Passing it here is how the slot is HANDED OVER rather than re-counted:
/// this call commits it and skips its own increment, so the worker's
/// `in_flight` goes 1 → 1 instead of 1 → 2 → 1.
///
/// That intermediate value was not harmless. The tracker incremented under
/// one registry lock and the reservation released under another, and a
/// concurrent leg landing between them was refused a slot the worker
/// demonstrably had — measured at `in_flight = 5` on a worker advertising 4,
/// on a fan sized exactly to its pool.
///
/// Taken BY VALUE so the transfer cannot be half-done: this call either
/// commits the reservation or drops it, and a dropped one still releases.
/// `None` is for callers that never reserved — the in-process façades, and
/// any path tracking work it did not select.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn track_task(
&self,
worker_id: WorkerId,
task: InFlightActivity,
now: Instant,
registry: &ConnectedWorkerRegistry,
reservation: Option<crate::worker::registry::DispatchReservation>,
) -> Result<(), ServerError> {
let key = TaskKey::new(
worker_id,
task.workflow_id.clone(),
task.activity_id.clone(),
);
let liveness = TaskLiveness {
worker_id,
workflow_id: task.workflow_id,
activity_id: task.activity_id,
attempt: task.attempt,
completion_token: task.completion_token,
heartbeat_window: self.heartbeat_window,
last_heartbeat_at: now,
last_progress: None,
last_progress_at: None,
};
// A DISPATCH IS NOT EVIDENCE THE WORKER IS ALIVE, so this no longer
// refreshes `state.connections`.
//
// It used to. That made the server's own act of pushing work advance the
// clock it later reads to decide whether the worker is still there: a
// worker that had stopped answering could be kept out of the expiry
// sweep indefinitely by nothing more than the server continuing to
// dispatch to it. Liveness is proven by what the WORKER does — a
// heartbeat (`record_heartbeat`) or a liveness answer
// (`record_liveness`) — and by nothing the server does to it.
let first_tracking = {
let mut state = self.state()?;
state.tasks.insert(key, liveness).is_none()
};
// GATED ON THE INSERT, because the two writes have different
// idempotencies. `tasks` is keyed by `(worker, workflow, activity)` and
// an insert over a live key OVERWRITES — one entry before, one entry
// after — while the registry count increments unconditionally. Tracking
// the same key twice without an intervening `complete_task` therefore
// used to leak a slot permanently: the count went up twice and could
// only ever come down once, so the worker's usable capacity shrank until
// it deregistered.
//
// `registry` is an argument precisely so the liveness record and the
// number selection reads are written by ONE call and cannot be updated
// apart. Gating keeps that property and makes them agree on how many
// times one dispatch counts.
handover::settle_reserved_slot(first_tracking, worker_id, registry, reservation)
}
/// Stop tracking a completed activity and wake drain waiters if this was the last task.
///
/// Returns whether the task was still tracked when this ran: `true` means
/// THIS call retired the in-flight entry, `false` means another path (the
/// expiry sweep, a disconnect teardown, shutdown, or a completed dispatch)
/// already did. The liminal reply router uses that bool as its structural
/// gate for synthesizing a lost-worker failure — the exact mirror of the
/// gRPC sweep failing only still-tracked tasks.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn complete_task(
&self,
worker_id: WorkerId,
workflow_id: &WorkflowId,
activity_id: &ActivityId,
registry: &ConnectedWorkerRegistry,
) -> Result<bool, ServerError> {
let key = TaskKey::new(worker_id, workflow_id.clone(), activity_id.clone());
let (was_tracked, became_empty) = {
let mut state = self.state()?;
let was_tracked = state.tasks.remove(&key).is_some();
(was_tracked, state.tasks.is_empty())
};
if was_tracked {
// Only THIS call's removal frees a slot. A second caller finding
// the entry already gone must not decrement again, or a worker
// would be credited with capacity it does not have. The liminal
// delivery guard (`AbandonedDispatchGuard`) leans on exactly this
// when it fires beside the caller's own untrack. The registry
// side also wakes every dispatch parked on a full pool — the freed
// slot is the only event such a dispatch is waiting for.
registry.record_dispatch_finished(worker_id)?;
}
if became_empty {
self.empty.notify_waiters();
}
Ok(was_tracked)
}
/// Whether the given in-flight task is still tracked (not yet completed,
/// swept, or drained). The liminal reply router polls this to bound its
/// wait: once the entry is gone the dispatch was resolved by another path,
/// so the router exits instead of parking on the connection forever.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn is_tracked(
&self,
worker_id: WorkerId,
workflow_id: &WorkflowId,
activity_id: &ActivityId,
) -> Result<bool, ServerError> {
let key = TaskKey::new(worker_id, workflow_id.clone(), activity_id.clone());
Ok(self.state()?.tasks.contains_key(&key))
}
/// Refresh the liveness stamp of an in-flight task from a transport-level
/// liveness beat that carries no progress payload (the liminal worker's
/// automatic pump). Returns `true` when the task was tracked and refreshed,
/// `false` when it is not in flight — a benign outcome for a beat racing a
/// completion or covering an outbox dispatch the tracker never held.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn record_liveness(
&self,
worker_id: WorkerId,
workflow_id: &WorkflowId,
activity_id: &ActivityId,
now: Instant,
) -> Result<bool, ServerError> {
let key = TaskKey::new(worker_id, workflow_id.clone(), activity_id.clone());
let mut state = self.state()?;
if !state.tasks.contains_key(&key) {
return Ok(false);
}
if let Some(last_activity) = state.connections.get_mut(&worker_id) {
*last_activity = now;
}
let Some(liveness) = state.tasks.get_mut(&key) else {
return Ok(false);
};
liveness.last_heartbeat_at = now;
Ok(true)
}
/// The operator-configured heartbeat window this tracker expires against.
/// The bridge stamps it onto each liminal dispatch so the worker's
/// automatic liveness pump beats at the matching quarter-window cadence.
#[must_use]
pub const fn heartbeat_window(&self) -> Duration {
self.heartbeat_window
}
/// Number of currently tracked in-flight activities.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn in_flight_count(&self) -> Result<usize, ServerError> {
Ok(self.state()?.tasks.len())
}
/// Number of in-flight activities tracked for ONE worker.
///
/// Beside [`Self::in_flight_count`] rather than replacing it: that answer is
/// deliberately global (the drain gate asks "is anything still running"),
/// and widening it to mean per-worker would make every existing caller read
/// a different question than the one it asked.
///
/// This is the tracker's own count, derived from the task map it owns. The
/// registry keeps a projection of the same fact for selection to read
/// without taking this lock, and the two are written by one call
/// ([`Self::track_task`] / [`Self::complete_task`]). This accessor is what
/// lets a test hold them against each other instead of trusting that.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn in_flight_for_worker(&self, worker_id: WorkerId) -> Result<usize, ServerError> {
Ok(self
.state()?
.tasks
.keys()
.filter(|key| key.worker_id() == worker_id)
.count())
}
/// Record a worker heartbeat without completing the activity.
///
/// Every heartbeat refreshes the task's liveness stamp. The progress
/// payload is only overwritten when the heartbeat CARRIES one: the worker
/// runtime's automatic liveness beats are payload-free and interleave
/// with explicit handler progress heartbeats, and a liveness beat must
/// never erase the handler's most recent progress report.
///
/// # Errors
///
/// Returns a stable wire error for malformed heartbeats or unknown in-flight tasks.
pub fn record_heartbeat(
&self,
worker_id: WorkerId,
heartbeat: ProtoHeartbeat,
now: Instant,
) -> Result<HeartbeatUpdate, ServerError> {
let decoded = DecodedHeartbeat::try_from(heartbeat)?;
let key = TaskKey::new(worker_id, decoded.workflow_id, decoded.activity_id);
let mut state = self.state()?;
if !state.tasks.contains_key(&key) {
return Err(wire_error("heartbeat task is not in flight"));
}
if let Some(last_activity) = state.connections.get_mut(&worker_id) {
*last_activity = now;
}
let Some(liveness) = state.tasks.get_mut(&key) else {
return Err(wire_error("heartbeat task is not in flight"));
};
liveness.last_heartbeat_at = now;
if decoded.progress.is_some() {
liveness.last_progress = decoded.progress;
liveness.last_progress_at = Some(Utc::now());
}
Ok(HeartbeatUpdate {
liveness: liveness.clone(),
})
}
/// Return whether an in-flight task is still within its configured heartbeat window.
///
/// # Errors
///
/// Returns a stable wire error if the task is not tracked, or lock poison if state cannot be trusted.
pub fn is_live(
&self,
worker_id: WorkerId,
workflow_id: &WorkflowId,
activity_id: &ActivityId,
now: Instant,
) -> Result<bool, ServerError> {
let key = TaskKey::new(worker_id, workflow_id.clone(), activity_id.clone());
let state = self.state()?;
let Some(liveness) = state.tasks.get(&key) else {
return Err(wire_error("heartbeat task is not in flight"));
};
Ok(!is_expired(liveness, now))
}
/// Mark all currently expired workers lost and fail their in-flight tasks through the engine sink.
///
/// # Errors
///
/// Returns registry, tracker, or sink errors without retrying or rescheduling activities.
pub fn fail_expired_workers(
&self,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
now: Instant,
) -> Result<Vec<LostWorkerReport>, ServerError> {
let mut reports = Vec::new();
for worker_id in self.expired_workers(registry, now)? {
let report = self.fail_lost_worker(worker_id, registry, sink)?;
reports.push(report);
}
Ok(reports)
}
/// Mark a disconnected worker lost and fail its in-flight tasks through the engine sink.
///
/// # Errors
///
/// Returns registry, tracker, or sink errors without retrying or rescheduling activities.
pub fn fail_disconnected_worker(
&self,
worker_id: WorkerId,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
) -> Result<LostWorkerReport, ServerError> {
self.fail_lost_worker(worker_id, registry, sink)
}
/// Mark every currently in-flight worker lost and fail all remaining tasks through the sink.
///
/// # Errors
///
/// Returns registry, tracker, or sink errors without retrying or rescheduling activities.
pub fn fail_all_in_flight_workers(
&self,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
) -> Result<Vec<LostWorkerReport>, ServerError> {
let worker_ids = {
let state = self.state()?;
let mut worker_ids = state
.tasks
.values()
.map(|liveness| liveness.worker_id)
.collect::<HashSet<_>>()
.into_iter()
.collect::<Vec<_>>();
worker_ids.sort_unstable();
worker_ids
};
let mut reports = Vec::new();
for worker_id in worker_ids {
let report = self.fail_lost_worker(worker_id, registry, sink)?;
if !report.tasks.is_empty() {
reports.push(report);
}
}
self.empty.notify_waiters();
Ok(reports)
}
/// Park a drain-disconnected worker's in-flight tasks for restart recovery
/// (#207): deregister the worker, remove its tracked tasks, and resolve
/// each pending waiter through [`ActivityCompletionSink::park_activity`].
///
/// The graceful-drain counterpart of [`Self::fail_disconnected_worker`]:
/// same deregister-before-collect ordering (same closed dispatch/disconnect
/// race), but NO completion is synthesized — the durable log keeps its
/// dangling scheduled/started trail, byte-equivalent to a kill -9, and
/// restart recovery re-dispatches it. Deregistered with the honest
/// [`WorkerDeathReason::Disconnect`](aion_core::WorkerDeathReason::Disconnect):
/// the transport genuinely dropped (the worker obeyed the drain request).
///
/// # Errors
///
/// Returns registry, tracker, or sink errors without retrying or rescheduling activities.
pub fn park_disconnected_worker(
&self,
worker_id: WorkerId,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
) -> Result<LostWorkerReport, ServerError> {
self.park_lost_worker(
worker_id,
registry,
sink,
aion_core::WorkerDeathReason::Disconnect,
)
}
/// Park EVERY currently in-flight worker's tasks for restart recovery
/// (#207) — the drain-timeout backstop's bulk counterpart of
/// [`Self::fail_all_in_flight_workers`].
///
/// Deregistered with the honest
/// [`WorkerDeathReason::Timeout`](aion_core::WorkerDeathReason::Timeout):
/// the drain window genuinely expired on these workers. Wakes drain waiters
/// after the sweep so `wait_for_empty` observes the emptied tracker.
///
/// # Errors
///
/// Returns registry, tracker, or sink errors without retrying or rescheduling activities.
pub fn park_all_in_flight_workers(
&self,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
) -> Result<Vec<LostWorkerReport>, ServerError> {
let worker_ids = {
let state = self.state()?;
let mut worker_ids = state
.tasks
.values()
.map(|liveness| liveness.worker_id)
.collect::<HashSet<_>>()
.into_iter()
.collect::<Vec<_>>();
worker_ids.sort_unstable();
worker_ids
};
let mut reports = Vec::new();
for worker_id in worker_ids {
let report = self.park_lost_worker(
worker_id,
registry,
sink,
aion_core::WorkerDeathReason::Timeout,
)?;
if !report.tasks.is_empty() {
reports.push(report);
}
}
self.empty.notify_waiters();
Ok(reports)
}
/// Shared park core (#207), structured exactly like [`Self::fail_lost_worker`]
/// — deregister BEFORE collecting tasks (see that method's race note) — but
/// resolving each waiter with the ephemeral parked sentinel instead of
/// synthesizing a lost-worker `ActivityFailed`. Idempotent for the same
/// reasons: `deregister_with_reason` no-ops on an already-removed worker and
/// each task is removed as it parks, so a second sweep (park or fail) sees
/// an empty report and resolves nothing.
fn park_lost_worker(
&self,
worker_id: WorkerId,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
reason: aion_core::WorkerDeathReason,
) -> Result<LostWorkerReport, ServerError> {
let task_queue = task_queue_of(registry, worker_id);
registry.deregister_with_reason(worker_id, reason)?;
self.state()?.connections.remove(&worker_id);
let tasks = self.remove_worker_tasks(worker_id)?;
for task in &tasks {
sink.park_activity(&task.workflow_id, &task.activity_id)?;
info!(
worker_id = ?worker_id,
workflow_id = %task.workflow_id,
activity_id = %task.activity_id,
"activity parked for restart recovery"
);
}
Ok(LostWorkerReport {
worker_id,
tasks,
task_queue,
})
}
fn fail_lost_worker(
&self,
worker_id: WorkerId,
registry: &ConnectedWorkerRegistry,
sink: &impl ActivityCompletionSink,
) -> Result<LostWorkerReport, ServerError> {
// Deregister BEFORE collecting tasks: the dispatch path tracks its
// task, sends, and then checks `registry.is_registered`. With this
// ordering, a dispatch that still sees the worker registered is
// guaranteed its tracked task is visible to any later sweep, so the
// unbounded completion wait always gets a lost-worker failure. (The
// reverse order leaves a window where a task tracked between the
// collection and the deregistration is never failed by anyone.)
// This is the liveness-timeout sweep: the proven reason is Timeout, the
// one finer-grained WS3 distinction this call site can honestly assert.
// The queue is read BEFORE the deregistration below, because afterwards
// the handle is gone and the log could no longer name it.
let task_queue = task_queue_of(registry, worker_id);
registry.deregister_with_reason(worker_id, aion_core::WorkerDeathReason::Timeout)?;
self.state()?.connections.remove(&worker_id);
let tasks = self.remove_worker_tasks(worker_id)?;
for task in &tasks {
sink.complete_activity(ActivityCompletion {
workflow_id: task.workflow_id.clone(),
activity_id: task.activity_id.clone(),
run_id: None,
completion_token: task.completion_token.clone(),
// A TRANSPORT-domain loss, not an activity failure: the
// activity never executed to a result. The sink classifies it
// (and applies the transport's own re-dispatch budget); this
// sweep only reports what it observed.
outcome: ActivityCompletionOutcome::WorkerLost { worker_id },
})?;
}
Ok(LostWorkerReport {
worker_id,
tasks,
task_queue,
})
}
fn remove_worker_tasks(
&self,
worker_id: WorkerId,
) -> Result<Vec<InFlightActivity>, ServerError> {
let mut state = self.state()?;
let keys = state
.tasks
.keys()
.filter(|key| key.worker_id() == worker_id)
.cloned()
.collect::<Vec<_>>();
let mut tasks = Vec::with_capacity(keys.len());
for key in keys {
if let Some(liveness) = state.tasks.remove(&key) {
tasks.push(InFlightActivity {
workflow_id: liveness.workflow_id,
activity_id: liveness.activity_id,
attempt: liveness.attempt,
completion_token: liveness.completion_token,
});
}
}
Ok(tasks)
}
/// Every tracked in-flight entry for `(workflow, activity, attempt)`.
///
/// Read from the SAME map the heartbeat path writes, so what a reader is
/// told and what the dispatch path knows cannot drift. Usually zero or one
/// entry; a within-attempt failover can briefly have a dying owner and its
/// adopter both tracked, which is why this returns them all and leaves the
/// choice to the caller (`crate::worker::attempt_progress`) rather than
/// silently picking one here.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub(in crate::worker) fn attempt_entries(
&self,
workflow_id: &WorkflowId,
activity_id: &ActivityId,
attempt: u32,
) -> Result<Vec<TaskLiveness>, ServerError> {
Ok(self
.state()?
.tasks
.values()
.filter(|liveness| {
&liveness.workflow_id == workflow_id
&& &liveness.activity_id == activity_id
&& liveness.attempt == attempt
})
.cloned()
.collect())
}
/// Every activity of `workflow_id` a connected worker is holding RIGHT NOW
/// (#233).
///
/// A tracked entry means a live worker owns that activity: entries are
/// added at dispatch ([`Self::track_task`]) and removed on completion,
/// disconnect, or heartbeat expiry. That is what makes this — rather than
/// the durable outbox row, which records no worker at all — the authority
/// on where a cancellation has to be sent. The worker id here is present
/// membership, not a recorded historical fact, so it cannot go stale the
/// way a worker id written down at claim time would.
///
/// A within-attempt failover can briefly show a dying owner AND its adopter
/// for one activity. Both are returned: a cancel is addressed to a
/// `(workflow, activity)` key that either worker may or may not still hold,
/// and a worker that does not hold it ignores the message, so asking both
/// is correct and asking one would be a guess.
///
/// # Errors
///
/// Returns [`ServerError::LockPoisoned`] if tracker state cannot be trusted.
pub fn in_flight_for_workflow(
&self,
workflow_id: &WorkflowId,
) -> Result<Vec<TaskLiveness>, ServerError> {
Ok(self
.state()?
.tasks
.values()
.filter(|liveness| &liveness.workflow_id == workflow_id)
.cloned()
.collect())
}
fn state(&self) -> Result<MutexGuard<'_, HeartbeatState>, ServerError> {
self.inner
.lock()
.map_err(|_| ServerError::lock_poisoned("worker heartbeat tracker"))
}
/// Poisons the tracker's state lock, for tests that pin the fail-open
/// contract of paths that must never let a poisoned tracker withhold a
/// completion. Unwinds across a held guard inside `catch_unwind`, which is
/// exactly what real poison is.
#[cfg(test)]
pub(crate) fn poison_for_tests(&self) {
let inner = Arc::clone(&self.inner);
let _ = std::panic::catch_unwind(std::panic::AssertUnwindSafe(move || {
let _guard = inner.lock();
// `resume_unwind` raises the unwind directly (no panic hook, no
// panic machinery in a non-test path): the guard drops while the
// thread is unwinding, which is precisely how a mutex is poisoned.
std::panic::resume_unwind(Box::new(
"poisoning the heartbeat tracker for a fail-open test",
));
}));
}
}
/// Sweep cadence derived from the operator's `worker.heartbeat_window`: a
/// quarter of the window, clamped to `[1s, window]` (the default 30s window
/// sweeps every 7.5s).
///
/// Deliberately derived rather than a separate config knob: the window is the
/// operational contract ("a silent worker is dead after this long"), and the
/// sweep cadence is an implementation detail of enforcing it — a quarter-window
/// cadence bounds detection latency at `window + window/4` while keeping the
/// sweep cheap. A window shorter than one second (test configurations) sweeps
/// once per window rather than sub-second-spinning, and a zero window is
/// floored at one millisecond because `tokio::time::interval` rejects a zero
/// period.
#[must_use]
pub fn sweep_interval(heartbeat_window: Duration) -> Duration {
/// `tokio::time::interval` panics on a zero period, so even a
/// (misconfigured) zero window gets a positive cadence.
const MINIMUM_PERIOD: Duration = Duration::from_millis(1);
/// Target lower bound: sweeping more often than once a second buys no
/// meaningful detection latency against real heartbeat windows.
const TARGET_FLOOR: Duration = Duration::from_secs(1);
let ceiling = heartbeat_window.max(MINIMUM_PERIOD);
// The floor never exceeds the ceiling, so `clamp` cannot panic.
(heartbeat_window / 4).clamp(TARGET_FLOOR.min(ceiling), ceiling)
}
/// Production driver of [`HeartbeatTracker::fail_expired_workers`] (#176).
///
/// The tracker records connection and per-task liveness, while the stream-teardown
/// sweep fails a worker whose stream ENDS. A worker whose stream stays open while
/// its process wedges is caught by the connection lease even when it is idle.
/// This interval task expires every silent connection or task, deregistering it
/// with the provable
/// [`WorkerDeathReason::Timeout`](aion_core::WorkerDeathReason::Timeout) and
/// surfacing its tasks as TRANSPORT losses through the shared completion sink
/// — the `lost:` class the engine re-dispatches attempt-neutrally, never the
/// action's retry vocabulary. It shares the server's shutdown watch, so it drains with
/// the transports (mirroring
/// [`OutboxDispatcher::run`](crate::worker::OutboxDispatcher::run)).
///
/// Double-fail safety: this sweep and the stream-teardown path
/// ([`HeartbeatTracker::fail_disconnected_worker`]) can both observe the same
/// dead worker. Both funnel into the same idempotent core —
/// `deregister_with_reason` is a no-op for an already-removed worker (no
/// duplicate WS3 delta, no metrics double-count) and the tracker removes each
/// task as it fails it — so whichever path runs second sees an empty report and
/// never double-completes an activity.
pub struct HeartbeatSweeper<S> {
tracker: HeartbeatTracker,
registry: ConnectedWorkerRegistry,
sink: S,
drain: DrainState,
heartbeat_window: Duration,
interval: Duration,
/// Live unserved-queue state, read only to state the CONSEQUENCE of a
/// deregistration in the same log line as its cause: how many dispatches are
/// already parked on the queue the reaped worker was serving. Default-empty
/// in wirings that have no queue service, where the count reads zero.
queue_state: crate::worker::QueueServiceState,
}
impl<S> HeartbeatSweeper<S>
where
S: ActivityCompletionSink + Send + Sync + 'static,
{
/// Build a sweeper over the server's shared liveness tracker, worker
/// registry, completion sink, and drain gate. The cadence is derived from
/// `heartbeat_window` by [`sweep_interval`].
#[must_use]
pub fn new(
tracker: HeartbeatTracker,
registry: ConnectedWorkerRegistry,
sink: S,
drain: DrainState,
heartbeat_window: Duration,
) -> Self {
let interval = sweep_interval(heartbeat_window);
Self {
tracker,
registry,
sink,
drain,
heartbeat_window,
interval,
queue_state: crate::worker::QueueServiceState::default(),
}
}
/// Share the live unserved-queue state so a deregistration log can state how
/// many dispatches are already parked on the queue the reaped worker served.
///
/// Without it the count reads zero — honest for a wiring with no queue
/// service, and never a reason to withhold the deregistration itself.
#[must_use]
pub fn with_queue_state(mut self, queue_state: crate::worker::QueueServiceState) -> Self {
self.queue_state = queue_state;
self
}
/// Run the expiry sweep until `shutdown` flips to `true`.
///
/// A tracker/registry error during a sweep is logged and retried next tick
/// rather than tearing the task down — a transient failure must not
/// silently stop dead-worker detection. Shutdown is observed both while
/// waiting for the next tick and re-checked before each sweep, exactly like
/// the outbox dispatcher's run loop.
pub async fn run(self, mut shutdown: watch::Receiver<bool>) {
info!(
sweep_interval_ms = self.interval.as_millis(),
heartbeat_window_ms = self.heartbeat_window.as_millis(),
"worker heartbeat sweeper started"
);
let mut ticks = tokio::time::interval(self.interval);
ticks.set_missed_tick_behavior(tokio::time::MissedTickBehavior::Skip);
loop {
tokio::select! {
_ = ticks.tick() => {
if *shutdown.borrow() {
break;
}
self.sweep_once(Instant::now());
}
changed = shutdown.changed() => {
// A receive error means every sender dropped; treat that as
// a shutdown request rather than spinning.
if changed.is_err() || *shutdown.borrow() {
break;
}
}
}
}
info!("worker heartbeat sweeper stopped");
}
/// Fail every currently-expired worker once, logging each lost-worker
/// report at warn (mirroring the stream-teardown sweep's logging).
fn sweep_once(&self, now: Instant) {
let reports = match self
.tracker
.fail_expired_workers(&self.registry, &self.sink, now)
{
Ok(reports) => reports,
Err(sweep_error) => {
error!(
error = %sweep_error,
"heartbeat expiry sweep failed; retrying next tick"
);
return;
}
};
for report in &reports {
let task_queue = report.task_queue.as_deref().unwrap_or("<unregistered>");
// The consequence, stated with the cause: a queue whose worker just
// died and which already holds parked dispatches is an alertable
// condition, and the operator should not have to join two log lines
// to see it. A read failure reports `None` rather than suppressing
// the deregistration line.
let parked = report
.task_queue
.as_deref()
.map(|queue| self.queue_state.parked_on_queue(queue))
.transpose()
.unwrap_or_else(|error| {
error!(%error, "could not read parked-dispatch count for a reaped worker");
None
})
.unwrap_or(0);
if report.tasks.is_empty() {
warn!(
worker_id = ?report.worker_id,
task_queue,
parked_dispatches = parked,
heartbeat_window_ms = self.heartbeat_window.as_millis(),
"idle worker connection lease expired; worker deregistered"
);
} else {
warn!(
worker_id = ?report.worker_id,
task_queue,
parked_dispatches = parked,
failed_tasks = report.tasks.len(),
heartbeat_window_ms = self.heartbeat_window.as_millis(),
"worker heartbeat window expired with in-flight activities; \
deregistered and surfaced as transport losses, to be \
re-dispatched attempt-neutrally"
);
}
}
if !reports.is_empty() {
// In-flight accounting may have just reached zero; wake any drain
// waiter so shutdown does not sit out its full timeout (mirrors
// the stream-teardown sweep).
self.drain.notify_activity_drained();
}
}
}
impl TaskKey {
fn new(worker_id: WorkerId, workflow_id: WorkflowId, activity_id: ActivityId) -> Self {
Self(worker_id, workflow_id, activity_id)
}
const fn worker_id(&self) -> WorkerId {
self.0
}
}
struct DecodedHeartbeat {
workflow_id: WorkflowId,
activity_id: ActivityId,
progress: Option<Payload>,
}
impl TryFrom<ProtoHeartbeat> for DecodedHeartbeat {
type Error = ServerError;
fn try_from(value: ProtoHeartbeat) -> Result<Self, Self::Error> {
let workflow_id = value
.workflow_id
.ok_or_else(|| wire_error("heartbeat workflow id is missing"))
.and_then(|id| WorkflowId::try_from(id).map_err(ServerError::from))?;
let activity_id = value
.activity_id
.ok_or_else(|| wire_error("heartbeat activity id is missing"))
.map(ActivityId::from)?;
let progress = value
.progress
.map(Payload::try_from)
.transpose()
.map_err(ServerError::from)?;
Ok(Self {
workflow_id,
activity_id,
progress,
})
}
}
/// The task queue a still-registered worker serves, for the deregistration log.
///
/// A registry read failure (poisoned lock) yields `None` rather than aborting
/// the sweep: losing the queue NAME must never stop a dead worker being reaped.
fn task_queue_of(registry: &ConnectedWorkerRegistry, worker_id: WorkerId) -> Option<String> {
registry
.worker_by_id(worker_id)
.ok()
.flatten()
.map(|handle| handle.task_queue().to_owned())
}
fn wire_error(message: &'static str) -> ServerError {
ServerError::Wire {
wire: WireError::backend(message),
}
}
#[cfg(test)]
mod reachability_tests {
use std::time::{Duration, Instant};
use super::{
DISPATCH_PROBATION_PINGS, DispatchExclusion, ExcludedWorker, HeartbeatTracker, ServerError,
WorkerId,
};
const WINDOW: Duration = Duration::from_secs(30);
/// Every test returns `Result` and uses `?` rather than unwrapping: a lock
/// fault inside the tracker is a real failure mode of the code under test,
/// and it should surface as a failed test carrying the typed error, not as a
/// panic message written by the test.
type TestResult = Result<(), ServerError>;
fn tracker_with_worker(now: Instant) -> Result<(HeartbeatTracker, WorkerId), ServerError> {
let tracker = HeartbeatTracker::new(WINDOW);
let worker = WorkerId::from_value(1);
tracker.register_connection(worker, now)?;
Ok((tracker, worker))
}
/// Answer the full probation, so the worker is genuinely eligible. Tests
/// about staleness, pump beats, or withdrawal must start from a worker that
/// HAS eligibility — otherwise they pass on a worker that never had any and
/// prove nothing about the behaviour they name.
fn serve_probation(
tracker: &HeartbeatTracker,
worker: WorkerId,
at: Instant,
) -> Result<(), ServerError> {
for _ in 0..DISPATCH_PROBATION_PINGS {
assert!(
tracker.record_dispatch_reachability(worker, at)?,
"the worker must still be tracked while it serves its probation"
);
}
Ok(())
}
/// THE REGRESSION. This is the defect that made run `dfd2117c` invisible:
/// the worker's liveness pump beat from a background task, refreshed the one
/// shared lease, and the dead-man switch could not fire while the server had
/// been unable to push to that worker for fifteen minutes.
///
/// An inbound frame must prove the worker is ALIVE and must NOT prove the
/// server can REACH it.
#[test]
fn an_inbound_frame_cannot_prove_dispatch_reachability() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
// The worker STARTS eligible, earned honestly. Without this the test
// would pass on a worker that never had eligibility to lose, which says
// nothing about whether a pump beat can preserve it.
serve_probation(&tracker, worker, start)?;
assert!(
tracker.is_dispatch_reachable(worker, start)?,
"precondition: the worker is eligible before the connection goes one-way"
);
// Well past the window, with the pump beating throughout — exactly what
// a busy worker on a poisoned connection looks like.
let much_later = start + WINDOW * 4;
assert!(
tracker.record_connection_activity(worker, much_later)?,
"the worker is still tracked"
);
assert!(
!tracker.is_dispatch_reachable(worker, much_later)?,
"a pump beat must NOT make a worker the server cannot push to look reachable"
);
assert_eq!(
tracker.unreachable_workers(much_later)?,
vec![ExcludedWorker {
worker_id: worker,
// It HELD eligibility (served above) and lost it to a stale
// proof. Classifying this as an opening probation would tell an
// operator a poisoned connection is an ordinary worker start.
exclusion: DispatchExclusion::ReachabilityLost,
}],
"the worker must be named unreachable however alive its process looks"
);
Ok(())
}
/// The control for the test above: without it, a tracker that reported
/// EVERYTHING unreachable would satisfy that assertion and prove nothing.
#[test]
fn an_answered_ping_does_prove_dispatch_reachability() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
let much_later = start + WINDOW * 4;
serve_probation(&tracker, worker, much_later)?;
assert!(
tracker.is_dispatch_reachable(worker, much_later)?,
"answered pings are the one thing that proves the push leg works"
);
assert!(
tracker.unreachable_workers(much_later)?.is_empty(),
"a worker answering pings is never unreachable"
);
Ok(())
}
/// Registration opens a PROBATION and grants nothing. The handshake ack is
/// SENT by this server; nothing reports that it was RECEIVED, so a
/// connection is a channel, not proof that the channel carries. Eligibility
/// is earned by answered pings only.
#[test]
fn registration_opens_a_probation_and_does_not_grant_eligibility() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
assert!(
!tracker.is_dispatch_reachable(worker, start)?,
"a brand-new connection has proved nothing about the push leg"
);
assert_eq!(
tracker.unreachable_workers(start)?,
vec![ExcludedWorker {
worker_id: worker,
// And it is carried as a PROBATION, not as a reachability
// failure. This is the distinction that stopped an ordinary
// worker start from being announced to the operator as an
// unreachable dispatch path.
exclusion: DispatchExclusion::OpeningProbation { answers: 0 },
}],
"a worker serving its probation is carried in the census as unreachable"
);
Ok(())
}
/// The case that produced a FALSE ALARM on every healthy worker start.
///
/// One answer banked out of two: the server has demonstrably reached this
/// worker — moments ago — and is merely waiting for the second consecutive
/// answer. Reporting that as a reachability failure told Tom's operator log
/// his worker's dispatch path was dead when the opposite had just been
/// measured. The exclusion is real; the REASON is an opening probation.
#[test]
fn a_part_served_probation_is_a_probation_and_not_a_reachability_failure() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
const {
assert!(
DISPATCH_PROBATION_PINGS > 1,
"this test is only meaningful while the probation takes more than one answer"
);
}
assert!(tracker.record_dispatch_reachability(worker, start)?);
assert_eq!(
tracker.unreachable_workers(start)?,
vec![ExcludedWorker {
worker_id: worker,
exclusion: DispatchExclusion::OpeningProbation { answers: 1 },
}],
"a worker that has answered part of its opening probation is still excluded, but it \
must not be described as one the server cannot reach — it answered"
);
Ok(())
}
/// The other side of the same discrimination, and the control for the test
/// above: once eligibility has actually been HELD, losing it is an incident
/// and must classify differently. Without this, a classifier that answered
/// `OpeningProbation` unconditionally would satisfy the test above.
#[test]
fn losing_held_eligibility_is_reported_as_a_loss_not_as_a_fresh_probation() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
serve_probation(&tracker, worker, start)?;
assert!(
tracker.is_dispatch_reachable(worker, start)?,
"precondition: eligibility was genuinely held before it was lost"
);
assert!(
tracker.record_dispatch_unreachable(worker)?,
"the worker is still tracked when its ping fails"
);
assert_eq!(
tracker.unreachable_workers(start)?,
vec![ExcludedWorker {
worker_id: worker,
exclusion: DispatchExclusion::ReachabilityLost,
}],
"a failed ping on a worker that HAD eligibility is an incident, and must not be \
filed as the ordinary probation every fresh connection serves"
);
Ok(())
}
/// A REDIAL is a new measurement. The previous connection's proof must not
/// make the new connection's ordinary probation look like an incident —
/// otherwise every reconnect of a healthy worker would raise the alarm that
/// is supposed to mean something has gone wrong.
#[test]
fn a_reconnect_starts_a_fresh_probation_not_a_lost_eligibility() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
serve_probation(&tracker, worker, start)?;
tracker.unregister_connection(worker)?;
tracker.register_connection(worker, start)?;
assert_eq!(
tracker.unreachable_workers(start)?,
vec![ExcludedWorker {
worker_id: worker,
exclusion: DispatchExclusion::OpeningProbation { answers: 0 },
}],
"nothing earned on the old connection carries across to the new one"
);
Ok(())
}
/// The probation must be SERVED IN FULL. One answered ping can be luck — a
/// link that answers one probe in three would otherwise accrue eligibility
/// and then flap. This pins the boundary from below: K-1 answers is not
/// enough, and the very next one is.
#[test]
fn one_ping_short_of_the_probation_earns_nothing() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
for _ in 0..DISPATCH_PROBATION_PINGS - 1 {
assert!(tracker.record_dispatch_reachability(worker, start)?);
assert!(
!tracker.is_dispatch_reachable(worker, start)?,
"eligibility must not be granted before the probation is served in full"
);
}
assert!(tracker.record_dispatch_reachability(worker, start)?);
assert!(
tracker.is_dispatch_reachable(worker, start)?,
"the ping that completes the probation must grant eligibility — otherwise this test \
would pass on a tracker that never grants it at all"
);
Ok(())
}
/// A failed probe RESETS the run. Eligibility is withdrawn immediately, not
/// when the window later expires: an unanswered probe is direct evidence
/// about the push leg, and direct negative evidence must weigh at least as
/// much as silence.
#[test]
fn a_failed_probe_withdraws_eligibility_at_once_and_restarts_the_probation() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
serve_probation(&tracker, worker, start)?;
assert!(
tracker.is_dispatch_reachable(worker, start)?,
"precondition"
);
assert!(
tracker.record_dispatch_unreachable(worker)?,
"the worker is still tracked"
);
assert!(
!tracker.is_dispatch_reachable(worker, start)?,
"a failed probe withdraws eligibility on the spot, inside the window"
);
// And the run restarts from zero rather than resuming: one answer does
// not restore what a full probation earned.
assert!(tracker.record_dispatch_reachability(worker, start)?);
assert!(
!tracker.is_dispatch_reachable(worker, start)?,
"a single answer after a failure must not restore eligibility"
);
Ok(())
}
/// 🔴 THE FLAPPING PIN. A link that answers every other probe must NEVER
/// become eligible. Cumulative counting would let it accrue, and eligibility
/// would switch on and off under a running fleet — the intermittent evidence
/// that costs hours to attribute. Consecutiveness is what forbids it.
#[test]
fn a_link_that_answers_every_other_probe_never_becomes_eligible() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
// Far more probes than the probation demands, alternating.
for probe in 0..DISPATCH_PROBATION_PINGS * 10 {
let now = start + Duration::from_millis(u64::from(probe));
if probe % 2 == 0 {
assert!(tracker.record_dispatch_reachability(worker, now)?);
} else {
assert!(tracker.record_dispatch_unreachable(worker)?);
}
assert!(
!tracker.is_dispatch_reachable(worker, now)?,
"a flapping link must never hold dispatch eligibility, at any probe (probe {probe})"
);
}
// The control: the same worker, answering consecutively, DOES become
// eligible — so this test cannot pass on a tracker that grants nothing.
let now = start + Duration::from_secs(1);
serve_probation(&tracker, worker, now)?;
assert!(
tracker.is_dispatch_reachable(worker, now)?,
"consecutive answers must still earn eligibility"
);
Ok(())
}
/// Reachability must EXPIRE on its own clock. If it were only ever advanced
/// and never allowed to go stale, eligibility could never be withdrawn.
#[test]
fn reachability_goes_stale_once_the_window_passes() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
serve_probation(&tracker, worker, start)?;
assert!(
tracker.is_dispatch_reachable(worker, start + WINDOW)?,
"still inside the window"
);
assert!(
!tracker.is_dispatch_reachable(worker, start + WINDOW + Duration::from_millis(1))?,
"one millisecond past the window is stale"
);
Ok(())
}
/// An untracked worker is not reachable: absence of proof is not proof. A
/// pong racing a reap must not resurrect it either.
#[test]
fn an_unregistered_worker_is_never_reachable_and_cannot_be_resurrected() -> TestResult {
let start = Instant::now();
let (tracker, worker) = tracker_with_worker(start)?;
tracker.unregister_connection(worker)?;
assert!(
!tracker.is_dispatch_reachable(worker, start)?,
"a deregistered worker is not reachable"
);
assert!(
!tracker.record_dispatch_reachability(worker, start)?,
"a late pong must not resurrect a deregistered worker"
);
assert!(
!tracker.record_dispatch_unreachable(worker)?,
"a late probe FAILURE must not resurrect a deregistered worker either — the reset \
path allocates an entry, so it has to refuse an untracked worker as firmly as the \
success path does"
);
assert!(
tracker.unreachable_workers(start)?.is_empty(),
"an untracked worker is not carried in the census either"
);
Ok(())
}
}
#[cfg(test)]
mod tests {
use std::sync::Mutex;
use aion_core::ContentType;
use aion_proto::{ProtoActivityId, ProtoPayload, ProtoWorkflowId};
use serde_json::json;
use uuid::Uuid;
use crate::worker::registry::WorkerRegistration;
use super::*;
/// aion#204 D1: the reservation→tracker handover never publishes a count
/// higher than the work the worker is holding.
///
/// The handover used to be two acts under two separate registry locks —
/// `track_task` incremented, then the caller dropped the reservation and
/// decremented — so between them `in_flight` read ONE HIGHER than the truth.
/// `reserve_worker` refuses on `held >= advertised`, so a concurrent leg
/// landing in that window was told the pool was full when it was not.
/// Measured in the field at `in_flight = 5` on a worker advertising 4, on a
/// fan sized exactly to its pool — where the margin is zero and one
/// collision is enough.
///
/// One dispatch is in flight at a time here, so a correct handover can never
/// publish more than 1. An observer hammers the count throughout; under the
/// old two-act handover it sees 2. The observer is a free-running thread, so
/// under a loaded suite it may not be scheduled during the microseconds a
/// round holds its slot and see nothing at all — a peak of 0 is a starved
/// observer, not a finding (measured 2026-09-01 on a 16-core box: 2 of 4
/// full-suite runs). So the two halves are pinned separately: the observer
/// proves the count never exceeds 1, and the round itself reads the count
/// after its handover and requires exactly 1 — the published truth.
#[tokio::test(flavor = "multi_thread", worker_threads = 4)]
async fn the_handover_never_publishes_a_count_above_the_real_work() -> Result<(), ServerError> {
/// Enough rounds that the two-lock window is hit; it is microseconds
/// wide, so a handful would prove nothing.
const ROUNDS: usize = 400;
let worker = RegisteredTestWorker::connected()?;
let tracker = HeartbeatTracker::new(Duration::from_secs(30));
let registry = worker.registry.clone();
let worker_id = worker.worker_id;
let stop = Arc::new(std::sync::atomic::AtomicBool::new(false));
let peak = Arc::new(std::sync::atomic::AtomicU32::new(0));
let observer = {
let (registry, stop, peak) = (registry.clone(), Arc::clone(&stop), Arc::clone(&peak));
std::thread::spawn(move || {
while !stop.load(std::sync::atomic::Ordering::SeqCst) {
if let Ok(held) = registry.in_flight_for_worker(worker_id) {
peak.fetch_max(held, std::sync::atomic::Ordering::SeqCst);
}
}
})
};
for round in 0..ROUNDS {
let activity_id = activity_id(u64::try_from(round).unwrap_or(0));
let reservation = registry
.reserve_worker(worker_id)?
.ok_or_else(|| wire_error("a worker with a free slot must reserve"))?;
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id(),
activity_id: activity_id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
Instant::now(),
®istry,
Some(reservation),
)?;
assert_eq!(
registry.in_flight_for_worker(worker_id)?,
1,
"after the handover the count must read exactly the one dispatch in flight"
);
assert!(tracker.complete_task(worker_id, &workflow_id(), &activity_id, ®istry)?);
}
stop.store(true, std::sync::atomic::Ordering::SeqCst);
observer
.join()
.map_err(|_| wire_error("the observing thread panicked"))?;
let observed_peak = peak.load(std::sync::atomic::Ordering::SeqCst);
assert!(
observed_peak <= 1,
"the count passed through {observed_peak}, higher than the one dispatch in flight; a \
concurrent selection landing in that window is refused a slot the worker has"
);
assert_eq!(
registry.in_flight_for_worker(worker_id)?,
0,
"and every round must have given its slot back"
);
Ok(())
}
/// Item 9: tracking ONE dispatch twice must not spend TWO slots.
///
/// `state.tasks` is keyed by `(worker, workflow, activity)` and an insert
/// over a live key OVERWRITES — one entry before, one entry after — while
/// the registry's capacity count increments. Ungated, tracking the same key
/// twice without an intervening `complete_task` therefore counted twice and
/// could only ever be decremented once, so the worker's usable capacity
/// shrank by one permanently: the entry is cleared only when the worker
/// deregisters.
///
/// The release half is the vacuity control. If the second track had been
/// dropped entirely rather than merely not double-counted, one completion
/// would still have to return the count to zero — and it does.
#[tokio::test]
async fn tracking_one_dispatch_twice_spends_one_slot() -> Result<(), ServerError> {
let worker = RegisteredTestWorker::connected()?;
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let workflow_id = workflow_id();
let activity_id = activity_id(21);
let now = Instant::now();
let task = || InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
};
tracker.track_task(worker.worker_id, task(), now, &worker.registry, None)?;
tracker.track_task(worker.worker_id, task(), now, &worker.registry, None)?;
assert_eq!(
worker.registry.in_flight_for_worker(worker.worker_id)?,
1,
"one tracked dispatch is one spent slot however many times it is tracked; counting \
the redelivery again leaks a slot for the life of the registration"
);
assert!(tracker.complete_task(
worker.worker_id,
&workflow_id,
&activity_id,
&worker.registry
)?);
assert_eq!(
worker.registry.in_flight_for_worker(worker.worker_id)?,
0,
"and one completion must return the slot: the counts agree on how many times one \
dispatch counts"
);
Ok(())
}
#[derive(Default)]
struct RecordingSink {
completions: Mutex<Vec<ActivityCompletion>>,
parks: Mutex<Vec<(WorkflowId, ActivityId)>>,
}
impl ActivityCompletionSink for RecordingSink {
fn complete_activity(&self, completion: ActivityCompletion) -> Result<(), ServerError> {
self.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.push(completion);
Ok(())
}
fn park_activity(
&self,
workflow_id: &WorkflowId,
activity_id: &ActivityId,
) -> Result<(), ServerError> {
self.parks
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.push((workflow_id.clone(), activity_id.clone()));
Ok(())
}
}
fn workflow_id() -> WorkflowId {
WorkflowId::new(Uuid::nil())
}
fn activity_id(position: u64) -> ActivityId {
ActivityId::from_sequence_position(position)
}
fn payload(value: &serde_json::Value) -> Result<Payload, Box<dyn std::error::Error>> {
Ok(Payload::from_json(value)?)
}
fn heartbeat(
workflow_id: WorkflowId,
activity_id: ActivityId,
progress: Option<Payload>,
) -> ProtoHeartbeat {
ProtoHeartbeat {
workflow_id: Some(ProtoWorkflowId::from(workflow_id)),
activity_id: Some(ProtoActivityId::from(activity_id)),
progress: progress.map(ProtoPayload::from),
}
}
/// A registered worker holding everything that keeps it ALIVE: the
/// registry it is in, the registration guard, its worker id, and — the
/// input the expiry sweep now reads — the stream receiver whose presence
/// is the connected fact.
///
/// The receiver is held rather than dropped at construction because the
/// two are now different worlds. A worker with a live receiver is
/// CONNECTED, and silence from it means busy or wedged, never gone; one
/// whose receiver has been dropped has no push leg left, and silence from
/// it means exactly what the sweep used to assume of both. A test that
/// wants the second says so with [`Self::disconnect`], instead of getting
/// it for free from a helper that happened to drop the receiver.
struct RegisteredTestWorker {
registry: ConnectedWorkerRegistry,
/// Held for its Drop: dropping it deregisters the worker.
_registration: WorkerRegistration,
/// `None` once the push leg has been closed on purpose.
receiver: Option<tokio::sync::mpsc::Receiver<crate::worker::registry::WorkerMessage>>,
worker_id: WorkerId,
}
impl RegisteredTestWorker {
/// A worker registered and CONNECTED: the server still holds an open
/// channel to it.
fn connected() -> Result<Self, ServerError> {
let registry = ConnectedWorkerRegistry::default();
let (tx, rx) = tokio::sync::mpsc::channel(1);
let activity_types = [String::from("charge-card")];
let registration = registry.register(
"tenant-a",
activity_types.iter(),
tx,
crate::worker::UNBOUNDED_SENDER_WORKER_CONCURRENCY,
)?;
let worker_id = registration
.worker_id()
.ok_or_else(|| ServerError::lock_poisoned("test worker registration"))?;
Ok(Self {
registry,
_registration: registration,
receiver: Some(rx),
worker_id,
})
}
/// Close the push leg without touching the registration — the shape of
/// a worker whose process is genuinely gone while the server has not
/// noticed yet.
fn disconnect(&mut self) {
self.receiver = None;
}
}
#[test]
fn heartbeat_refresh_keeps_task_live_across_window() -> Result<(), Box<dyn std::error::Error>> {
let window = Duration::from_secs(5);
let tracker = HeartbeatTracker::new(window);
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let workflow_id = workflow_id();
let activity_id = activity_id(10);
let start = Instant::now();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
assert!(tracker.is_live(worker_id, &workflow_id, &activity_id, start + window)?);
let progress = payload(&json!({"percent": 50}))?;
let update = tracker.record_heartbeat(
worker_id,
heartbeat(
workflow_id.clone(),
activity_id.clone(),
Some(progress.clone()),
),
start + window,
)?;
assert_eq!(update.liveness.last_progress, Some(progress));
assert!(tracker.is_live(
worker_id,
&workflow_id,
&activity_id,
start + window + window
)?);
assert!(
tracker
.expired_workers(registry, start + window + window)?
.is_empty()
);
Ok(())
}
#[test]
fn missed_heartbeat_deregisters_worker_and_fails_in_flight_once()
-> Result<(), Box<dyn std::error::Error>> {
let mut worker = RegisteredTestWorker::connected()?;
// This sweep's subject is a worker that is GONE, so its push leg is
// closed on purpose: a worker whose channel is still open and whose
// silence is merely saturation is no longer reaped, and a test that
// left the leg open would be asserting the behaviour this landing
// removes.
worker.disconnect();
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let sink = RecordingSink::default();
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let workflow_id = workflow_id();
let activity_id = activity_id(11);
let start = Instant::now();
// REGISTERED, explicitly. `track_task` used to create this entry as a
// side effect, which meant the server's own act of dispatching started
// the clock it later read to decide whether the worker was still there.
// It no longer does, so the connection is recorded where it actually
// happens in production: when the worker registers, before anything is
// dispatched to it.
tracker.register_connection(worker_id, start)?;
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
let reports =
tracker.fail_expired_workers(registry, &sink, start + Duration::from_secs(6))?;
assert_eq!(reports.len(), 1);
assert_eq!(reports[0].worker_id, worker_id);
assert_eq!(reports[0].tasks.len(), 1);
assert!(
registry
.workers_for("tenant-a", "default", "charge-card", None)?
.is_empty()
);
let second = tracker.fail_disconnected_worker(worker_id, registry, &sink)?;
assert!(second.tasks.is_empty());
let completions = sink
.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?;
assert_eq!(completions.len(), 1);
assert_eq!(completions[0].workflow_id, workflow_id);
assert_eq!(completions[0].activity_id, activity_id);
// The sweep reports a TRANSPORT-domain loss, not an activity failure:
// the activity never executed to a result, so the sink (not this sweep)
// classifies it and applies the transport's own re-dispatch budget.
// Before this distinction existed the sweep synthesized a `Retryable`
// `ActivityError` that the engine then delivered as a TERMINAL failure
// whenever the activity carried no authored retry policy.
match &completions[0].outcome {
ActivityCompletionOutcome::WorkerLost { worker_id: lost } => {
assert_eq!(*lost, worker_id);
}
other => {
return Err(format!("expected a lost-worker outcome, got {other:?}").into());
}
}
Ok(())
}
#[test]
fn disconnected_worker_fails_each_in_flight_task_once() -> Result<(), Box<dyn std::error::Error>>
{
let mut worker = RegisteredTestWorker::connected()?;
// This sweep's subject is a worker that is GONE, so its push leg is
// closed on purpose: a worker whose channel is still open and whose
// silence is merely saturation is no longer reaped, and a test that
// left the leg open would be asserting the behaviour this landing
// removes.
worker.disconnect();
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let sink = RecordingSink::default();
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let workflow_id = workflow_id();
let start = Instant::now();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id(21),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id,
activity_id: activity_id(22),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
let report = tracker.fail_disconnected_worker(worker_id, registry, &sink)?;
assert_eq!(report.tasks.len(), 2);
assert!(
registry
.workers_for("tenant-a", "default", "charge-card", None)?
.is_empty()
);
let completions = sink
.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?;
assert_eq!(completions.len(), 2);
assert!(completions.iter().all(|completion| matches!(
&completion.outcome,
ActivityCompletionOutcome::WorkerLost { .. }
)));
Ok(())
}
/// #207: parking a drain-disconnected worker removes its tasks, deregisters
/// it, and PARKS each task through the sink — zero completions synthesized,
/// so the durable log stays byte-equivalent to a kill -9. A second park (or
/// a later fail sweep) finds nothing: the idempotent-deregister discipline
/// the fail path already proves holds for parks too.
#[test]
fn park_disconnected_worker_parks_tasks_without_synthesizing_completions()
-> Result<(), Box<dyn std::error::Error>> {
let mut worker = RegisteredTestWorker::connected()?;
// This sweep's subject is a worker that is GONE, so its push leg is
// closed on purpose: a worker whose channel is still open and whose
// silence is merely saturation is no longer reaped, and a test that
// left the leg open would be asserting the behaviour this landing
// removes.
worker.disconnect();
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let sink = RecordingSink::default();
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let workflow_id = workflow_id();
let start = Instant::now();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id(60),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id(61),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
let report = tracker.park_disconnected_worker(worker_id, registry, &sink)?;
assert_eq!(report.tasks.len(), 2);
assert_eq!(
tracker.in_flight_count()?,
0,
"parking must remove every tracked task so drain accounting reaches zero"
);
assert!(
registry
.workers_for("tenant-a", "default", "charge-card", None)?
.is_empty(),
"the parked worker must be deregistered from routing"
);
let parks = sink
.parks
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?;
assert_eq!(parks.len(), 2, "each task must be parked exactly once");
drop(parks);
assert!(
sink.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.is_empty(),
"parking must never synthesize an activity completion"
);
// Double-park and park-after-fail are no-ops: the idempotent core.
let second = tracker.park_disconnected_worker(worker_id, registry, &sink)?;
assert!(second.tasks.is_empty());
let third = tracker.fail_disconnected_worker(worker_id, registry, &sink)?;
assert!(third.tasks.is_empty());
assert_eq!(
sink.parks
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.len(),
2,
"re-sweeping a parked worker must park nothing further"
);
assert!(
sink.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.is_empty(),
"a fail sweep after the park must fail nothing"
);
Ok(())
}
/// #207 drain-timeout backstop: the bulk park removes every worker's tasks,
/// parks each through the sink, and wakes drain waiters — never
/// synthesizing a completion.
#[tokio::test]
async fn park_all_in_flight_workers_parks_everything_and_wakes_drain_waiters()
-> Result<(), Box<dyn std::error::Error>> {
let mut worker = RegisteredTestWorker::connected()?;
// This sweep's subject is a worker that is GONE, so its push leg is
// closed on purpose: a worker whose channel is still open and whose
// silence is merely saturation is no longer reaped, and a test that
// left the leg open would be asserting the behaviour this landing
// removes.
worker.disconnect();
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let sink = RecordingSink::default();
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let workflow_id = workflow_id();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id(70),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
Instant::now(),
registry,
None,
)?;
// Arm a waiter on the tracker's empty notify BEFORE the bulk park.
let notified = tracker.empty.notified();
tokio::pin!(notified);
let reports = tracker.park_all_in_flight_workers(registry, &sink)?;
assert_eq!(reports.len(), 1);
assert_eq!(reports[0].worker_id, worker_id);
assert_eq!(reports[0].tasks.len(), 1);
assert_eq!(tracker.in_flight_count()?, 0);
assert_eq!(
sink.parks
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.len(),
1
);
assert!(
sink.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?
.is_empty(),
"the bulk park must never synthesize a completion"
);
tokio::time::timeout(Duration::from_millis(200), notified)
.await
.map_err(|_| "the bulk park must wake drain waiters")?;
Ok(())
}
/// The worker runtime's AUTOMATIC liveness beats carry no payload and
/// interleave with explicit handler progress heartbeats: a payload-free
/// beat must refresh the liveness stamp WITHOUT erasing the handler's
/// most recent progress report.
#[test]
fn payload_free_heartbeat_refreshes_liveness_without_clearing_progress()
-> Result<(), Box<dyn std::error::Error>> {
let window = Duration::from_secs(5);
let tracker = HeartbeatTracker::new(window);
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let workflow_id = workflow_id();
let activity_id = activity_id(12);
let start = Instant::now();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
let progress = payload(&json!({"percent": 80}))?;
tracker.record_heartbeat(
worker_id,
heartbeat(
workflow_id.clone(),
activity_id.clone(),
Some(progress.clone()),
),
start + Duration::from_secs(1),
)?;
// An automatic liveness beat: no payload, later timestamp.
let update = tracker.record_heartbeat(
worker_id,
heartbeat(workflow_id.clone(), activity_id.clone(), None),
start + Duration::from_secs(4),
)?;
assert_eq!(
update.liveness.last_progress,
Some(progress),
"a payload-free liveness beat must not erase handler progress"
);
assert!(
tracker.is_live(
worker_id,
&workflow_id,
&activity_id,
start + Duration::from_secs(8)
)?,
"the payload-free beat must still refresh the liveness stamp"
);
Ok(())
}
#[test]
fn malformed_heartbeat_missing_ids_is_wire_error() -> Result<(), Box<dyn std::error::Error>> {
let worker = RegisteredTestWorker::connected()?;
let worker_id = worker.worker_id;
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let missing = ProtoHeartbeat {
workflow_id: None,
activity_id: Some(ProtoActivityId::from(activity_id(30))),
progress: None,
};
let result = tracker.record_heartbeat(worker_id, missing, Instant::now());
assert!(matches!(result, Err(ServerError::Wire { .. })));
Ok(())
}
#[test]
fn heartbeat_progress_is_not_reported_as_activity_result()
-> Result<(), Box<dyn std::error::Error>> {
let sink = RecordingSink::default();
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let workflow_id = workflow_id();
let activity_id = activity_id(40);
let now = Instant::now();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: activity_id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
now,
registry,
None,
)?;
tracker.record_heartbeat(
worker_id,
heartbeat(
workflow_id,
activity_id,
Some(Payload::new(
ContentType::Json,
b"{\"progress\":1}".to_vec(),
)),
),
now,
)?;
let completions = sink
.completions
.lock()
.map_err(|_| ServerError::lock_poisoned("recording completion sink"))?;
assert!(completions.is_empty());
Ok(())
}
/// 🔴 aion#204's ARM ONE: a worker whose per-task beat has lapsed, whose
/// push leg is OPEN, and whose dispatch path the server has PROVED it can
/// reach, is NOT deregistered. It is busy.
///
/// This is the case the sweep used to get wrong, and getting it wrong cost
/// a thirty-seven minute outage. A gRPC worker running at its full
/// concurrency stopped reading its stream, so its per-task beats lapsed;
/// the sweep read that lapse as death, deregistered a connected worker
/// holding live work, surfaced its in-flight activities as transport
/// losses, and left the queue census reporting an empty pool that was
/// never empty.
///
/// `is_expired` is a PER-TASK predicate. One lapsed beat says something
/// about one activity; it has never been a statement about the worker.
#[test]
fn a_reachable_connected_worker_is_not_reaped_for_a_lapsed_beat()
-> Result<(), Box<dyn std::error::Error>> {
let window = Duration::from_secs(5);
let tracker = HeartbeatTracker::new(window);
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let start = Instant::now();
tracker.register_connection(worker_id, start)?;
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id(),
activity_id: activity_id(60),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
// The worker answers its probation, and keeps answering — which is what
// a busy worker now does, because its receive loop no longer parks on
// admission. The proof has a window of its own, so a probe answered
// only once at the start would age out and this test would be
// measuring staleness rather than saturation.
let later = start + window + window;
for answered_at in [start, later] {
for _ in 0..DISPATCH_PROBATION_PINGS {
assert!(tracker.record_dispatch_reachability(worker_id, answered_at)?);
}
}
// Well past the per-task window, and past the connection window too.
assert!(
tracker.expired_workers(registry, later)?.is_empty(),
"a worker with an open push leg the server can PROVE it reaches is busy, not lost: \
deregistering it is what emptied a pool that was never empty"
);
assert!(
registry.is_registered(worker_id)?,
"and it must still be in the registry, keeping its in-flight work"
);
Ok(())
}
/// 🔴 aion#204's ARM TWO, and the reason the fix is not simply "stop
/// reaping": a worker whose leg is open but which the server CANNOT prove
/// it reaches is still reaped.
///
/// This is #176's wedged process — stream open, nothing moving, in-flight
/// work that will never complete — and an open `mpsc` sender says nothing
/// about it. Gating the sweep on connection alone would have re-opened that
/// failure while closing the other one, and on gRPC it would have disabled
/// the sweep entirely: a sender closes only when the stream task ends, and
/// that is already the teardown sweep's business.
#[test]
fn a_connected_worker_the_server_cannot_reach_is_still_reaped()
-> Result<(), Box<dyn std::error::Error>> {
let window = Duration::from_secs(5);
let tracker = HeartbeatTracker::new(window);
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let start = Instant::now();
tracker.register_connection(worker_id, start)?;
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id(),
activity_id: activity_id(61),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
// No answered ping: the leg is open and nothing has come back on it.
let later = start + window + window;
assert_eq!(
tracker.expired_workers(registry, later)?,
vec![worker_id],
"a wedged process holds a healthy-looking channel indefinitely; if silence on an \
unproved leg did not reap, its in-flight work would wait for ever"
);
Ok(())
}
/// The third arm, and the control for the first two: a worker with NO push
/// leg left is reaped whatever its reachability history says.
///
/// Without this, the first test would be equally satisfied by a sweep that
/// had simply stopped reaping.
#[test]
fn a_disconnected_worker_is_reaped_even_after_proving_reachability()
-> Result<(), Box<dyn std::error::Error>> {
let window = Duration::from_secs(5);
let tracker = HeartbeatTracker::new(window);
let mut worker = RegisteredTestWorker::connected()?;
let worker_id = worker.worker_id;
let start = Instant::now();
let later = start + window + window;
tracker.register_connection(worker_id, start)?;
// Proved, at `start` and NOT at the sweep instant — and that is forced,
// not a preference. `record_dispatch_reachability` refreshes the
// CONNECTION clock as well as the proof, so a worker proved at `later`
// is not silent at `later` and is never nominated in the first place.
// "Provably reachable right now AND overdue right now" is not a
// reachable state: one call advances both clocks together.
//
// What this test can still say, and does, is that a worker which HAS
// proved reachability is reaped once it goes quiet and its leg closes —
// a past proof is not a standing acquittal.
for _ in 0..DISPATCH_PROBATION_PINGS {
assert!(tracker.record_dispatch_reachability(worker_id, start)?);
}
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id(),
activity_id: activity_id(62),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
&worker.registry,
None,
)?;
// Still connected and still inside its window at `start + window`: the
// connection clock has not lapsed, so nothing nominates it.
assert!(
tracker
.expired_workers(&worker.registry, start + window)?
.is_empty(),
"a worker inside its window is not a candidate at all"
);
worker.disconnect();
assert_eq!(
tracker.expired_workers(&worker.registry, later)?,
vec![worker_id],
"once the push leg is gone there is nothing left to hear a beat on, and the proof \
that used to hold is about a link that no longer exists"
);
Ok(())
}
/// `complete_task` reports whether THIS call retired the entry — the
/// structural gate the liminal reply router uses to synthesize a
/// lost-worker failure only for a dispatch nobody else resolved.
#[test]
fn complete_task_reports_whether_the_entry_was_tracked()
-> Result<(), Box<dyn std::error::Error>> {
let tracker = HeartbeatTracker::new(Duration::from_secs(5));
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let workflow_id = workflow_id();
let id = activity_id(50);
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
Instant::now(),
registry,
None,
)?;
assert!(tracker.is_tracked(worker_id, &workflow_id, &id)?);
assert!(
tracker.complete_task(worker_id, &workflow_id, &id, registry)?,
"the first completion retires the tracked entry"
);
assert!(!tracker.is_tracked(worker_id, &workflow_id, &id)?);
assert!(
!tracker.complete_task(worker_id, &workflow_id, &id, registry)?,
"a second completion finds nothing to retire"
);
Ok(())
}
/// A liveness beat (the liminal worker's automatic pump) refreshes the
/// task's expiry stamp — keeping a genuinely-running over-window activity
/// out of the sweep — and reports an untracked task benignly.
#[test]
fn record_liveness_refreshes_stamp_and_ignores_untracked_tasks()
-> Result<(), Box<dyn std::error::Error>> {
let window = Duration::from_secs(5);
let tracker = HeartbeatTracker::new(window);
let worker = RegisteredTestWorker::connected()?;
let (registry, worker_id) = (&worker.registry, worker.worker_id);
let workflow_id = workflow_id();
let id = activity_id(51);
let start = Instant::now();
tracker.track_task(
worker_id,
InFlightActivity {
workflow_id: workflow_id.clone(),
activity_id: id.clone(),
attempt: 1,
completion_token: crate::worker::CompletionToken::for_test(),
},
start,
registry,
None,
)?;
// Beaten at the window edge, the task survives past the original expiry.
assert!(tracker.record_liveness(worker_id, &workflow_id, &id, start + window)?);
assert!(tracker.is_live(worker_id, &workflow_id, &id, start + window + window)?);
assert!(
tracker
.expired_workers(registry, start + window + window)?
.is_empty()
);
// An untracked beat (an outbox dispatch, or a beat racing completion)
// is a benign false, never an error.
assert!(!tracker.record_liveness(
worker_id,
&workflow_id,
&activity_id(52),
start + window
)?);
Ok(())
}
#[test]
fn sweep_interval_is_quarter_window_clamped_to_one_second_and_window() {
// The default 30s window sweeps every 7.5s (quarter-window).
assert_eq!(
sweep_interval(Duration::from_secs(30)),
Duration::from_millis(7_500)
);
// A short window's quarter (500ms) is floored at 1s.
assert_eq!(
sweep_interval(Duration::from_secs(2)),
Duration::from_secs(1)
);
// A very long window's quarter stays within the [1s, window] band.
assert_eq!(
sweep_interval(Duration::from_secs(3_600)),
Duration::from_secs(900)
);
// A sub-second (test) window sweeps once per window, never spinning
// sub-window nor waiting longer than the window itself.
assert_eq!(
sweep_interval(Duration::from_millis(200)),
Duration::from_millis(200)
);
// A zero window is floored at the minimum positive period rather than
// producing the zero interval `tokio::time::interval` rejects.
assert_eq!(sweep_interval(Duration::ZERO), Duration::from_millis(1));
}
}