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
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
// Copyright 2024 Saorsa Labs Ltd.
//
// This Saorsa Network Software is licensed under the General Public License (GPL), version 3.
// Please see the file LICENSE-GPL, or visit <http://www.gnu.org/licenses/> for the full text.
//
// Full details available at https://saorsalabs.com/licenses
#![allow(missing_docs)]
//! High-level NAT Traversal API for Autonomi P2P Networks
//!
//! This module provides a simple, high-level interface for establishing
//! QUIC connections through NATs using sophisticated hole punching and
//! coordination protocols.
#[allow(unused_imports)]
use crate::coordinator_control::{
CoordinatorControlEnvelope, CoordinatorControlMessage, InboundOffer, LiveRequest,
PendingRequest, RejectionReason, clear_live_request, decode_coordinator_control,
encode_coordinator_control, get_pending_request, inbound_offer, live_request, next_request_id,
note_rate_limit_and_check, now_unix_ms, record_rejection, remember_inbound_offer,
remember_live_request, remember_pending_request, remove_inbound_offer, remove_pending_request,
take_live_rejection,
};
use std::{fmt, net::SocketAddr, sync::Arc, time::Duration};
use crate::constrained::{ConstrainedEngine, EngineConfig, EngineEvent};
use crate::transport::TransportRegistry;
use crate::SHUTDOWN_DRAIN_TIMEOUT;
/// Creates a bind address that allows the OS to select a random available port
///
/// This provides protocol obfuscation by preventing port fingerprinting, which improves
/// security by making it harder for attackers to identify and target QUIC endpoints.
///
/// # Security Benefits
/// - **Port Randomization**: Each endpoint gets a different random port, preventing easy detection
/// - **Fingerprinting Resistance**: Makes protocol identification more difficult for attackers
/// - **Attack Surface Reduction**: Reduces predictable network patterns that could be exploited
///
/// # Implementation Details
/// - Binds to `0.0.0.0:0` to let the OS choose an available port
/// - Used automatically when `bind_addr` is `None` in endpoint configuration
/// - Provides better security than static or predictable port assignments
///
/// # Added in Version 0.6.1
/// This function was introduced as part of security improvements in commit 6e633cd9
/// to enhance protocol obfuscation capabilities.
fn create_random_port_bind_addr() -> SocketAddr {
// SAFETY: This is a compile-time constant string that is always valid.
// Using a const assertion to ensure this at compile time.
const BIND_ADDR: &str = "0.0.0.0:0";
// This parse will never fail for a valid constant, but we handle it gracefully
// by falling back to a known-good default constructed directly.
BIND_ADDR.parse().unwrap_or_else(|_| {
SocketAddr::new(std::net::IpAddr::V4(std::net::Ipv4Addr::UNSPECIFIED), 0)
})
}
/// Extract ML-DSA-65 public key from SubjectPublicKeyInfo DER structure.
///
/// v0.2: Pure PQC - Uses ML-DSA-65 for all authentication.
/// RFC 7250 Raw Public Keys use SubjectPublicKeyInfo format.
///
/// Returns the extracted ML-DSA-65 public key if valid SPKI, None otherwise.
fn extract_ml_dsa_from_spki(spki: &[u8]) -> Option<crate::crypto::pqc::types::MlDsaPublicKey> {
crate::crypto::raw_public_keys::pqc::extract_public_key_from_spki(spki).ok()
}
// Import shared normalize_socket_addr utility
use crate::shared::normalize_socket_addr;
/// Broadcast an ADD_ADDRESS frame to all connected peers.
///
/// This helper consolidates the duplicate broadcast logic throughout the codebase.
/// It iterates over all connections and sends the NAT address advertisement frame
/// to each peer, logging success or failure.
fn broadcast_address_to_peers(
connections: &dashmap::DashMap<PeerId, InnerConnection>,
address: SocketAddr,
priority: u32,
) {
// Snapshot keys to avoid holding iter_mut() write guards on all DashMap shards
let peer_ids: Vec<PeerId> = connections.iter().map(|e| *e.key()).collect();
for peer_id in peer_ids {
if let Some(mut entry) = connections.get_mut(&peer_id) {
let conn = entry.value_mut();
match conn.send_nat_address_advertisement(address, priority) {
Ok(seq) => {
info!(
"Sent ADD_ADDRESS to peer {:?}: addr={}, seq={}",
peer_id, address, seq
);
}
Err(e) => {
debug!("Failed to send ADD_ADDRESS to peer {:?}: {:?}", peer_id, e);
}
}
}
}
}
/// Multi-transport candidate advertisement
///
/// Stores information about an advertised transport address with optional capability flags.
/// This extends the basic UDP address model to support BLE, LoRa, and other transports.
#[derive(Debug, Clone)]
pub struct TransportCandidate {
/// The transport address being advertised
pub address: TransportAddr,
/// Priority for candidate selection (higher = better)
pub priority: u32,
/// How this candidate was discovered
pub source: CandidateSource,
/// Current validation state
pub state: CandidateState,
/// Optional capability flags summarizing transport characteristics
pub capabilities: Option<CapabilityFlags>,
}
impl TransportCandidate {
/// Create a new transport candidate for a UDP address
pub fn udp(address: SocketAddr, priority: u32, source: CandidateSource) -> Self {
Self {
address: TransportAddr::Udp(address),
priority,
source,
state: CandidateState::New,
capabilities: Some(CapabilityFlags::broadband()),
}
}
/// Create a new transport candidate for any transport address
pub fn new(address: TransportAddr, priority: u32, source: CandidateSource) -> Self {
Self {
address,
priority,
source,
state: CandidateState::New,
capabilities: None,
}
}
/// Create a new transport candidate with capability information
pub fn with_capabilities(
address: TransportAddr,
priority: u32,
source: CandidateSource,
capabilities: &TransportCapabilities,
) -> Self {
Self {
address,
priority,
source,
state: CandidateState::New,
capabilities: Some(CapabilityFlags::from_capabilities(capabilities)),
}
}
/// Get the socket address if this is a UDP transport
pub fn socket_addr(&self) -> Option<SocketAddr> {
self.address.as_socket_addr()
}
/// Get the transport type
pub fn transport_type(&self) -> TransportType {
self.address.transport_type()
}
/// Check if this transport supports full QUIC (if capability info is available)
pub fn supports_full_quic(&self) -> Option<bool> {
self.capabilities.map(|c| c.supports_full_quic())
}
}
use tracing::{debug, error, info, trace, warn};
use std::sync::atomic::{AtomicBool, Ordering};
// Use parking_lot for faster, non-poisoning locks that work better with async code
use parking_lot::{Mutex as ParkingMutex, RwLock as ParkingRwLock};
use tokio::{
net::UdpSocket,
sync::{Mutex as TokioMutex, mpsc},
time::{sleep, timeout},
};
use crate::high_level::default_runtime;
use crate::{
VarInt,
candidate_discovery::{CandidateDiscoveryManager, DiscoveryConfig, DiscoveryEvent},
// v0.13.0: NatTraversalRole removed - all nodes are symmetric P2P nodes
connection::nat_traversal::{CandidateSource, CandidateState},
masque::connect::{ConnectUdpRequest, ConnectUdpResponse},
masque::integration::{RelayManager, RelayManagerConfig},
// Symmetric P2P: Every node provides relay services
masque::relay_server::{MasqueRelayConfig, MasqueRelayServer},
// Multi-transport support
nat_traversal::CapabilityFlags,
transport::{TransportAddr, TransportCapabilities, TransportType},
};
use crate::{
ClientConfig, EndpointConfig, ServerConfig, Side, TransportConfig,
high_level::{Connection as InnerConnection, Endpoint as InnerEndpoint},
};
use crate::{crypto::rustls::QuicClientConfig, crypto::rustls::QuicServerConfig};
use crate::config::validation::{ConfigValidator, ValidationResult};
use crate::crypto::{pqc::PqcConfig, raw_public_keys::RawPublicKeyConfigBuilder};
/// An active relay session for MASQUE CONNECT-UDP
///
/// Stores the QUIC connection to a relay server and the public address
/// allocated for receiving inbound connections.
#[derive(Debug)]
pub struct RelaySession {
/// QUIC connection to the relay server
pub connection: InnerConnection,
/// Public address allocated by the relay for inbound traffic
pub public_address: Option<SocketAddr>,
/// When the session was established
pub established_at: std::time::Instant,
/// Relay server address
pub relay_addr: SocketAddr,
}
impl RelaySession {
/// Check if the session is still active
pub fn is_active(&self) -> bool {
// Connection is active if there's no close reason
self.connection.close_reason().is_none()
}
/// Get the allocated public address if available
pub fn public_addr(&self) -> Option<SocketAddr> {
self.public_address
}
}
/// Event from the constrained engine with transport address context
///
/// This wrapper adds the transport address to engine events so that P2pEndpoint
/// can properly route and track data from constrained transports (BLE/LoRa).
#[derive(Debug, Clone)]
pub struct ConstrainedEventWithAddr {
/// The engine event (DataReceived, ConnectionAccepted, etc.)
pub event: EngineEvent,
/// The transport address of the remote peer
pub remote_addr: crate::transport::TransportAddr,
}
/// High-level NAT traversal endpoint for Autonomi P2P networks
pub struct NatTraversalEndpoint {
/// Underlying QUIC endpoint
inner_endpoint: Option<InnerEndpoint>,
/// Fallback internal endpoint for non-production builds
/// NAT traversal configuration
config: NatTraversalConfig,
/// Known bootstrap/coordinator nodes
/// Uses parking_lot::RwLock for faster, non-poisoning reads
bootstrap_nodes: Arc<ParkingRwLock<Vec<BootstrapNode>>>,
/// Active NAT traversal sessions
/// Uses DashMap for fine-grained concurrent access without blocking workers
active_sessions: Arc<dashmap::DashMap<PeerId, NatTraversalSession>>,
/// Candidate discovery manager
/// Uses parking_lot::Mutex for faster, non-poisoning access
discovery_manager: Arc<ParkingMutex<CandidateDiscoveryManager>>,
/// Event callback for coordination (simplified without async channels)
/// Wrapped in Arc so it can be shared with background tasks
event_callback: Option<Arc<dyn Fn(NatTraversalEvent) + Send + Sync>>,
/// Shutdown flag for async operations
shutdown: Arc<AtomicBool>,
/// Channel for internal communication
event_tx: Option<mpsc::UnboundedSender<NatTraversalEvent>>,
/// Receiver for internal event notifications
/// Uses parking_lot::Mutex for faster, non-poisoning access
event_rx: ParkingMutex<mpsc::UnboundedReceiver<NatTraversalEvent>>,
/// Notify waiters when a new ConnectionEstablished event is available.
/// Eliminates the 10ms polling loop in accept_connection().
incoming_notify: Arc<tokio::sync::Notify>,
/// Notify waiters when the endpoint is shutting down.
/// Eliminates polling loops that check the AtomicBool in transport listeners.
shutdown_notify: Arc<tokio::sync::Notify>,
/// Active connections by peer ID
/// Uses DashMap for fine-grained concurrent access without blocking workers
connections: Arc<dashmap::DashMap<PeerId, InnerConnection>>,
/// Local peer ID
local_peer_id: PeerId,
/// Timeout configuration
timeout_config: crate::config::nat_timeouts::TimeoutConfig,
/// Track peers for which ConnectionEstablished has already been emitted
/// This prevents duplicate events from being sent multiple times for the same connection
/// Uses DashSet for fine-grained concurrent access without blocking workers
emitted_established_events: Arc<dashmap::DashSet<PeerId>>,
/// MASQUE relay manager for fallback connections
relay_manager: Option<Arc<RelayManager>>,
/// Active relay sessions by relay server address
/// Uses DashMap for fine-grained concurrent access without blocking workers
relay_sessions: Arc<dashmap::DashMap<SocketAddr, RelaySession>>,
/// MASQUE relay server - every node provides relay services (symmetric P2P)
/// Per ADR-004: All nodes are equal and participate in relaying with resource budgets
relay_server: Option<Arc<MasqueRelayServer>>,
/// Successful candidate pairs discovered via hole punching
/// Maps peer ID to the remote address that successfully responded
/// Uses DashMap for fine-grained concurrent access without blocking workers
successful_candidates: Arc<dashmap::DashMap<PeerId, SocketAddr>>,
/// Transport candidates received from peers (multi-transport support)
/// Maps peer ID to all known transport candidates for that peer
/// Enables routing decisions based on transport type and capabilities
transport_candidates: Arc<dashmap::DashMap<PeerId, Vec<TransportCandidate>>>,
/// Transport registry for multi-transport support
/// When present, allows using transport-provided sockets instead of creating new ones
transport_registry: Option<Arc<TransportRegistry>>,
/// Channel for receiving peer address updates (ADD_ADDRESS → DHT bridge)
#[allow(dead_code)] // Used when full symmetric NAT relay is wired
pub(crate) peer_address_update_rx:
TokioMutex<mpsc::UnboundedReceiver<(SocketAddr, SocketAddr)>>,
/// Whether symmetric NAT relay setup has been attempted (one-shot)
relay_setup_attempted: Arc<std::sync::atomic::AtomicBool>,
/// Relay address to re-advertise to new peers (set after proactive relay setup)
relay_public_addr: Arc<std::sync::Mutex<Option<SocketAddr>>>,
/// Peers already advertised the relay address to
relay_advertised_peers: Arc<std::sync::Mutex<std::collections::HashSet<SocketAddr>>>,
/// Server config for creating secondary endpoints (e.g., relay accept endpoint)
#[allow(dead_code)] // Used when full symmetric NAT relay is wired
server_config: Option<crate::ServerConfig>,
/// Task handles for transport listener tasks
/// Used for cleanup on shutdown
transport_listener_handles: Arc<ParkingMutex<Vec<tokio::task::JoinHandle<()>>>>,
/// Constrained protocol engine for BLE/LoRa/Serial transports
/// Handles the constrained protocol for non-UDP transports
constrained_engine: Arc<ParkingMutex<ConstrainedEngine>>,
/// Channel for forwarding constrained engine events to P2pEndpoint
/// Events like DataReceived from BLE/LoRa transports are sent through this channel
constrained_event_tx: mpsc::UnboundedSender<ConstrainedEventWithAddr>,
/// Receiver for constrained engine events
/// P2pEndpoint polls this to receive data from constrained transports
/// Uses TokioMutex (not ParkingMutex) because MutexGuard is held across .await
constrained_event_rx: TokioMutex<mpsc::UnboundedReceiver<ConstrainedEventWithAddr>>,
}
/// Configuration for NAT traversal behavior
///
/// This configuration controls various aspects of NAT traversal including security,
/// performance, and reliability settings. Recent improvements in version 0.6.1 include
/// enhanced security through protocol obfuscation and robust error handling.
///
/// # Pure P2P Design (v0.13.0+)
/// All nodes are now symmetric - they can both connect and accept connections.
/// The `role` field is deprecated and ignored. Every node automatically:
/// - Accepts incoming connections
/// - Initiates outgoing connections
/// - Coordinates NAT traversal for connected peers
/// - Discovers its external address from any connected peer
///
/// # Security Features (Added in v0.6.1)
/// - **Protocol Obfuscation**: Random port binding prevents fingerprinting attacks
/// - **Robust Error Handling**: Panic-free operation with graceful error recovery
/// - **Input Validation**: Enhanced validation of configuration parameters
///
/// # Example
/// ```rust
/// use ant_quic::nat_traversal_api::NatTraversalConfig;
/// use std::time::Duration;
/// use std::net::SocketAddr;
///
/// // Recommended secure configuration
/// let config = NatTraversalConfig {
/// known_peers: vec!["127.0.0.1:9000".parse::<SocketAddr>().unwrap()],
/// max_candidates: 10,
/// coordination_timeout: Duration::from_secs(10),
/// enable_symmetric_nat: true,
/// enable_relay_fallback: true,
/// max_concurrent_attempts: 5,
/// bind_addr: None, // Auto-select for security
/// prefer_rfc_nat_traversal: true,
/// timeouts: Default::default(),
/// ..Default::default()
/// };
/// ```
#[derive(Debug, Clone, serde::Serialize, serde::Deserialize)]
pub struct NatTraversalConfig {
/// Known peer addresses for initial discovery
/// These peers are used to discover external addresses and coordinate NAT traversal.
/// In v0.13.0+ all nodes are symmetric - any connected peer can help with discovery.
pub known_peers: Vec<SocketAddr>,
/// Maximum number of address candidates to maintain
pub max_candidates: usize,
/// Timeout for coordination rounds
pub coordination_timeout: Duration,
/// Enable symmetric NAT prediction algorithms (always true; legacy flag ignored)
pub enable_symmetric_nat: bool,
/// Enable automatic relay fallback (always true; legacy flag ignored)
pub enable_relay_fallback: bool,
/// Enable relay service for other peers (always true; legacy flag ignored)
/// When true, this node will accept and forward CONNECT-UDP Bind requests from peers.
/// Per ADR-004: All nodes are equal and participate in relaying with resource budgets.
/// Default: true (every node provides relay services)
pub enable_relay_service: bool,
/// Known relay nodes for MASQUE CONNECT-UDP Bind fallback
/// When direct NAT traversal fails, connections can be relayed through these nodes
/// NOTE: In symmetric P2P, connected peers are used as relays automatically.
/// This is only for bootstrapping when no peers are connected yet.
pub relay_nodes: Vec<SocketAddr>,
/// Maximum concurrent NAT traversal attempts
pub max_concurrent_attempts: usize,
/// Bind address for the endpoint
///
/// - `Some(addr)`: Bind to the specified address
/// - `None`: Auto-select random port for enhanced security (recommended)
///
/// When `None`, the system uses an internal method to automatically
/// select a random available port, providing protocol obfuscation and improved
/// security through port randomization.
///
/// # Security Benefits of None (Auto-Select)
/// - **Protocol Obfuscation**: Makes endpoint detection harder for attackers
/// - **Port Randomization**: Each instance gets a different port
/// - **Fingerprinting Resistance**: Reduces predictable network patterns
///
/// # Added in Version 0.6.1
/// Enhanced security through automatic random port selection
pub bind_addr: Option<SocketAddr>,
/// Additional bound addresses for dual-stack nodes.
///
/// When using separate IPv4/IPv6 sockets, the primary `bind_addr` is typically
/// the IPv6 address, and this field holds the IPv4 address (or vice versa).
/// These are added as local NAT traversal candidates so peers can reach us
/// via either address family.
pub additional_bind_addrs: Vec<SocketAddr>,
/// Prefer RFC-compliant NAT traversal frame format
/// When true, will send RFC-compliant frames if the peer supports it
pub prefer_rfc_nat_traversal: bool,
/// Post-Quantum Cryptography configuration
pub pqc: Option<PqcConfig>,
/// Timeout configuration for NAT traversal operations
pub timeouts: crate::config::nat_timeouts::TimeoutConfig,
/// Identity keypair for TLS authentication (ML-DSA-65)
///
/// v0.2: Pure PQC - Uses ML-DSA-65 for all authentication.
/// v0.13.0+: This keypair is used for RFC 7250 Raw Public Key TLS authentication.
/// If provided, peers will derive the same PeerId from this key via TLS handshake.
/// If None, a random keypair is generated (not recommended for production as it
/// won't match the application-layer PeerId).
#[serde(skip)]
pub identity_key: Option<(
crate::crypto::pqc::types::MlDsaPublicKey,
crate::crypto::pqc::types::MlDsaSecretKey,
)>,
/// Allow IPv4-mapped IPv6 addresses (::ffff:x.x.x.x) as valid candidates
///
/// When true, IPv4-mapped addresses are accepted. These addresses represent
/// IPv4 connections on dual-stack sockets (sockets with IPV6_V6ONLY=0).
/// When a dual-stack socket accepts an IPv4 connection, the remote address
/// appears as an IPv4-mapped IPv6 address.
///
/// Default: true (required for dual-stack socket support)
pub allow_ipv4_mapped: bool,
/// Transport registry containing available transport providers.
///
/// When provided, NatTraversalEndpoint uses registered transports
/// for socket binding instead of hardcoded UDP. This enables
/// multi-transport support (UDP, BLE, etc.).
///
/// Default: None (uses traditional UdpSocket::bind directly)
#[serde(skip)]
pub transport_registry: Option<Arc<TransportRegistry>>,
/// Maximum message size in bytes (read-side guard).
///
/// Caps the bytes `read_to_end()` will accept per stream. QUIC flow-control
/// windows are **not** derived from this value — they use transport-layer
/// defaults based on bandwidth-delay products.
///
/// Default: [`P2pConfig::DEFAULT_MAX_MESSAGE_SIZE`] (4 MiB).
#[serde(default = "default_max_message_size")]
pub max_message_size: usize,
/// Maximum concurrent unidirectional QUIC streams per connection.
///
/// Each `send()` opens a new uni stream. Applications with high message
/// throughput should increase this. Default: 100.
#[serde(default = "default_max_concurrent_uni_streams")]
pub max_concurrent_uni_streams: u32,
}
fn default_max_message_size() -> usize {
crate::unified_config::P2pConfig::DEFAULT_MAX_MESSAGE_SIZE
}
fn default_max_concurrent_uni_streams() -> u32 {
100
}
// varint_from_max_message_size removed — QUIC flow-control windows now use
// transport-layer defaults (bandwidth-delay product) instead of being derived
// from the application-level max_message_size.
// v0.13.0: EndpointRole enum has been removed.
// All nodes are now symmetric P2P nodes - they can connect, accept connections,
// and coordinate NAT traversal. No role configuration is needed.
/// Unique identifier for a peer in the network
#[derive(
Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord, serde::Serialize, serde::Deserialize,
)]
pub struct PeerId(pub [u8; 32]);
/// Information about a bootstrap/coordinator node
#[derive(Debug, Clone)]
pub struct BootstrapNode {
/// Network address of the bootstrap node
pub address: SocketAddr,
/// Last successful contact time
pub last_seen: std::time::Instant,
/// Whether this node can coordinate NAT traversal
pub can_coordinate: bool,
/// RTT to this bootstrap node
pub rtt: Option<Duration>,
/// Number of successful coordinations via this node
pub coordination_count: u32,
}
impl BootstrapNode {
/// Create a new bootstrap node
pub fn new(address: SocketAddr) -> Self {
Self {
address,
last_seen: std::time::Instant::now(),
can_coordinate: true,
rtt: None,
coordination_count: 0,
}
}
}
/// A candidate pair for hole punching (ICE-like)
#[derive(Debug, Clone)]
pub struct CandidatePair {
/// Local candidate address
pub local_candidate: CandidateAddress,
/// Remote candidate address
pub remote_candidate: CandidateAddress,
/// Combined priority for this pair
pub priority: u64,
/// Current state of this candidate pair
pub state: CandidatePairState,
}
/// State of a candidate pair during hole punching
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum CandidatePairState {
/// Waiting to be checked
Waiting,
/// Currently being checked
InProgress,
/// Check succeeded
Succeeded,
/// Check failed
Failed,
/// Cancelled due to higher priority success
Cancelled,
}
/// Active NAT traversal session state
#[derive(Debug)]
struct NatTraversalSession {
/// Target peer we're trying to connect to
peer_id: PeerId,
/// Coordinator being used for this session
#[allow(dead_code)]
coordinator: SocketAddr,
/// Current attempt number
attempt: u32,
/// Session start time
started_at: std::time::Instant,
/// Current phase of traversal
phase: TraversalPhase,
/// Discovered candidate addresses
candidates: Vec<CandidateAddress>,
/// Session state machine
session_state: SessionState,
}
/// Session state machine for tracking connection lifecycle
#[derive(Debug, Clone)]
pub struct SessionState {
/// Current connection state
pub state: ConnectionState,
/// Last state transition time
pub last_transition: std::time::Instant,
/// Connection handle if established
pub connection: Option<InnerConnection>,
/// Active connection attempts
pub active_attempts: Vec<(SocketAddr, std::time::Instant)>,
/// Connection quality metrics
pub metrics: ConnectionMetrics,
}
/// Connection state in the session lifecycle
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum ConnectionState {
/// Not connected, no active attempts
Idle,
/// Actively attempting to connect
Connecting,
/// Connection established and active
Connected,
/// Connection is migrating to new path
Migrating,
/// Connection closed or failed
Closed,
}
/// Connection quality metrics
#[derive(Debug, Clone, Default)]
pub struct ConnectionMetrics {
/// Round-trip time estimate
pub rtt: Option<Duration>,
/// Packet loss rate (0.0 - 1.0)
pub loss_rate: f64,
/// Bytes sent
pub bytes_sent: u64,
/// Bytes received
pub bytes_received: u64,
/// Last activity timestamp
pub last_activity: Option<std::time::Instant>,
}
/// Session state update notification
#[derive(Debug, Clone)]
pub struct SessionStateUpdate {
/// Peer ID for this session
pub peer_id: PeerId,
/// Previous connection state
pub old_state: ConnectionState,
/// New connection state
pub new_state: ConnectionState,
/// Reason for state change
pub reason: StateChangeReason,
}
/// Reason for connection state change
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum StateChangeReason {
/// Connection attempt timed out
Timeout,
/// Connection successfully established
ConnectionEstablished,
/// Connection was closed
ConnectionClosed,
/// Connection migration completed
MigrationComplete,
/// Connection migration failed
MigrationFailed,
/// Connection lost due to network error
NetworkError,
/// Explicit close requested
UserClosed,
}
/// Phases of NAT traversal process
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum TraversalPhase {
/// Discovering local candidates
Discovery,
/// Requesting coordination from bootstrap
Coordination,
/// Waiting for peer coordination
Synchronization,
/// Active hole punching
Punching,
/// Validating established paths
Validation,
/// Successfully connected
Connected,
/// Failed, may retry or fallback
Failed,
}
/// Session state update types for polling
#[derive(Debug, Clone, Copy)]
enum SessionUpdate {
/// Connection attempt timed out
Timeout,
/// Connection was disconnected
Disconnected,
/// Update connection metrics
UpdateMetrics,
/// Session is in an invalid state
InvalidState,
/// Should retry the connection
Retry,
/// Migration timeout occurred
MigrationTimeout,
/// Remove the session entirely
Remove,
}
/// Address candidate discovered during NAT traversal
#[derive(Debug, Clone)]
pub struct CandidateAddress {
/// The candidate address
pub address: SocketAddr,
/// Priority for ICE-like selection
pub priority: u32,
/// How this candidate was discovered
pub source: CandidateSource,
/// Current validation state
pub state: CandidateState,
}
impl CandidateAddress {
/// Create a new candidate address with validation
pub fn new(
address: SocketAddr,
priority: u32,
source: CandidateSource,
) -> Result<Self, CandidateValidationError> {
Self::validate_address(&address)?;
Ok(Self {
address,
priority,
source,
state: CandidateState::New,
})
}
/// Create a new candidate address with custom validation options
///
/// Use this constructor when working with dual-stack sockets that may
/// produce IPv4-mapped IPv6 addresses.
pub fn new_with_options(
address: SocketAddr,
priority: u32,
source: CandidateSource,
allow_ipv4_mapped: bool,
) -> Result<Self, CandidateValidationError> {
Self::validate_address_with_options(&address, allow_ipv4_mapped)?;
Ok(Self {
address,
priority,
source,
state: CandidateState::New,
})
}
/// Validate a candidate address for security and correctness
///
/// This is the strict version that rejects IPv4-mapped addresses.
/// For dual-stack socket support, use `validate_address_with_options`.
pub fn validate_address(addr: &SocketAddr) -> Result<(), CandidateValidationError> {
Self::validate_address_with_options(addr, false)
}
/// Validate a candidate address with configurable options
///
/// # Arguments
/// * `addr` - The address to validate
/// * `allow_ipv4_mapped` - If true, accept IPv4-mapped IPv6 addresses (::ffff:x.x.x.x)
/// These addresses are produced by dual-stack sockets (IPV6_V6ONLY=0) when accepting
/// IPv4 connections.
pub fn validate_address_with_options(
addr: &SocketAddr,
allow_ipv4_mapped: bool,
) -> Result<(), CandidateValidationError> {
// Port validation
if addr.port() == 0 {
return Err(CandidateValidationError::InvalidPort(0));
}
// Well-known port validation (allow for testing)
#[cfg(not(test))]
if addr.port() < 1024 {
return Err(CandidateValidationError::PrivilegedPort(addr.port()));
}
match addr.ip() {
std::net::IpAddr::V4(ipv4) => {
// IPv4 validation
if ipv4.is_unspecified() {
return Err(CandidateValidationError::UnspecifiedAddress);
}
if ipv4.is_broadcast() {
return Err(CandidateValidationError::BroadcastAddress);
}
if ipv4.is_multicast() {
return Err(CandidateValidationError::MulticastAddress);
}
// 0.0.0.0/8 - Current network
if ipv4.octets()[0] == 0 {
return Err(CandidateValidationError::ReservedAddress);
}
// 224.0.0.0/3 - Reserved for future use
if ipv4.octets()[0] >= 240 {
return Err(CandidateValidationError::ReservedAddress);
}
}
std::net::IpAddr::V6(ipv6) => {
// IPv6 validation
if ipv6.is_unspecified() {
return Err(CandidateValidationError::UnspecifiedAddress);
}
if ipv6.is_multicast() {
return Err(CandidateValidationError::MulticastAddress);
}
// Documentation prefix (2001:db8::/32)
let segments = ipv6.segments();
if segments[0] == 0x2001 && segments[1] == 0x0db8 {
return Err(CandidateValidationError::DocumentationAddress);
}
// IPv4-mapped IPv6 addresses (::ffff:0:0/96)
// These are valid when using dual-stack sockets (IPV6_V6ONLY=0)
if ipv6.to_ipv4_mapped().is_some() && !allow_ipv4_mapped {
return Err(CandidateValidationError::IPv4MappedAddress);
}
}
}
Ok(())
}
/// Check if this candidate is suitable for NAT traversal
pub fn is_suitable_for_nat_traversal(&self) -> bool {
let allow_loopback = allow_loopback_from_env();
match self.address.ip() {
std::net::IpAddr::V4(ipv4) => {
// For NAT traversal, we want:
// - Not loopback (unless testing)
// - Not link-local (169.254.0.0/16)
// - Not multicast/broadcast
#[cfg(test)]
if ipv4.is_loopback() {
return true;
}
if ipv4.is_loopback() {
return allow_loopback;
}
!ipv4.is_loopback()
&& !ipv4.is_link_local()
&& !ipv4.is_multicast()
&& !ipv4.is_broadcast()
}
std::net::IpAddr::V6(ipv6) => {
// For IPv6:
// - Not loopback (unless testing)
// - Not link-local (fe80::/10)
// - Not unique local (fc00::/7) for external traversal
// - Not multicast
#[cfg(test)]
if ipv6.is_loopback() {
return true;
}
if ipv6.is_loopback() {
return allow_loopback;
}
let segments = ipv6.segments();
let is_link_local = (segments[0] & 0xffc0) == 0xfe80;
let is_unique_local = (segments[0] & 0xfe00) == 0xfc00;
!ipv6.is_loopback() && !is_link_local && !is_unique_local && !ipv6.is_multicast()
}
}
}
/// Get the priority adjusted for the current state
pub fn effective_priority(&self) -> u32 {
match self.state {
CandidateState::Valid => self.priority,
CandidateState::New => self.priority.saturating_sub(10),
CandidateState::Validating => self.priority.saturating_sub(5),
CandidateState::Failed => 0,
CandidateState::Removed => 0,
}
}
}
fn allow_loopback_from_env() -> bool {
matches!(
std::env::var("ANT_QUIC_ALLOW_LOOPBACK")
.unwrap_or_default()
.trim()
.to_ascii_lowercase()
.as_str(),
"1" | "true" | "yes"
)
}
/// Errors that can occur during candidate address validation
#[derive(Debug, Clone, PartialEq, Eq, thiserror::Error)]
pub enum CandidateValidationError {
/// Port number is invalid
#[error("invalid port number: {0}")]
InvalidPort(u16),
/// Port is in privileged range (< 1024)
#[error("privileged port not allowed: {0}")]
PrivilegedPort(u16),
/// Address is unspecified (0.0.0.0 or ::)
#[error("unspecified address not allowed")]
UnspecifiedAddress,
/// Address is broadcast (IPv4 only)
#[error("broadcast address not allowed")]
BroadcastAddress,
/// Address is multicast
#[error("multicast address not allowed")]
MulticastAddress,
/// Address is reserved
#[error("reserved address not allowed")]
ReservedAddress,
/// Address is documentation prefix
#[error("documentation address not allowed")]
DocumentationAddress,
/// IPv4-mapped IPv6 address
#[error("IPv4-mapped IPv6 address not allowed")]
IPv4MappedAddress,
}
/// Events generated during NAT traversal process
#[derive(Debug, Clone)]
pub enum NatTraversalEvent {
/// New candidate address discovered
CandidateDiscovered {
/// The peer this event relates to
peer_id: PeerId,
/// The discovered candidate address
candidate: CandidateAddress,
},
/// Coordination request sent to bootstrap
CoordinationRequested {
/// The peer this event relates to
peer_id: PeerId,
/// Coordinator address used for synchronization
coordinator: SocketAddr,
},
/// Peer coordination synchronized
CoordinationSynchronized {
/// The peer this event relates to
peer_id: PeerId,
/// The synchronized round identifier
round_id: VarInt,
},
/// Hole punching started
HolePunchingStarted {
/// The peer this event relates to
peer_id: PeerId,
/// Target addresses to punch
targets: Vec<SocketAddr>,
},
/// Path validated successfully
PathValidated {
/// The peer this event relates to
peer_id: PeerId,
/// Validated remote address
address: SocketAddr,
/// Measured round-trip time
rtt: Duration,
},
/// Candidate validated successfully
CandidateValidated {
/// The peer this event relates to
peer_id: PeerId,
/// Validated candidate address
candidate_address: SocketAddr,
},
/// NAT traversal completed successfully
TraversalSucceeded {
/// The peer this event relates to
peer_id: PeerId,
/// Final established address
final_address: SocketAddr,
/// Total traversal time
total_time: Duration,
},
/// Connection established after NAT traversal
ConnectionEstablished {
peer_id: PeerId,
/// The socket address where the connection was established
remote_address: SocketAddr,
/// Who initiated the connection (Client = we connected, Server = they connected)
side: Side,
},
/// NAT traversal failed
TraversalFailed {
/// The peer ID that failed to connect
peer_id: PeerId,
/// The NAT traversal error that occurred
error: NatTraversalError,
/// Whether fallback mechanisms are available
fallback_available: bool,
},
/// Connection lost
ConnectionLost {
/// The peer this event relates to
peer_id: PeerId,
/// Reason for the connection loss
reason: String,
},
/// Phase transition in NAT traversal state machine
PhaseTransition {
/// The peer this event relates to
peer_id: PeerId,
/// Old traversal phase
from_phase: TraversalPhase,
/// New traversal phase
to_phase: TraversalPhase,
},
/// Session state changed
SessionStateChanged {
/// The peer this event relates to
peer_id: PeerId,
/// New connection state
new_state: ConnectionState,
},
/// External address discovered via QUIC extension
ExternalAddressDiscovered {
/// The address that reported our address
reported_by: SocketAddr,
/// Our observed external address
address: SocketAddr,
},
/// A connected peer advertised a new reachable address (ADD_ADDRESS frame).
///
/// The upper layer should update its routing table so that future lookups
/// for this peer return the advertised address.
PeerAddressUpdated {
/// The connected peer that sent the advertisement
peer_addr: SocketAddr,
/// The address the peer is advertising as reachable
advertised_addr: SocketAddr,
},
}
/// Errors that can occur during NAT traversal
#[derive(Debug, Clone)]
pub enum NatTraversalError {
/// No bootstrap nodes available
NoBootstrapNodes,
/// Failed to discover any candidates
NoCandidatesFound,
/// Candidate discovery failed
CandidateDiscoveryFailed(String),
/// Coordination with bootstrap failed
CoordinationFailed(String),
/// All hole punching attempts failed
HolePunchingFailed,
/// Hole punching failed with specific reason
PunchingFailed(String),
/// Path validation failed
ValidationFailed(String),
/// Connection validation timed out
ValidationTimeout,
/// Network error during traversal
NetworkError(String),
/// Configuration error
ConfigError(String),
/// Internal protocol error
ProtocolError(String),
/// NAT traversal timed out
Timeout,
/// Connection failed after successful traversal
ConnectionFailed(String),
/// General traversal failure
TraversalFailed(String),
/// Peer not connected
PeerNotConnected,
}
impl Default for NatTraversalConfig {
fn default() -> Self {
Self {
known_peers: Vec::new(),
max_candidates: 8,
coordination_timeout: Duration::from_secs(10),
enable_symmetric_nat: true,
enable_relay_fallback: true,
enable_relay_service: true, // Symmetric P2P: every node provides relay services
relay_nodes: Vec::new(),
max_concurrent_attempts: 3,
bind_addr: None,
additional_bind_addrs: Vec::new(),
prefer_rfc_nat_traversal: true, // Default to RFC format for standards compliance
// v0.13.0+: PQC is ALWAYS enabled - default to PqcConfig::default()
// This ensures non-PQC handshakes cannot happen
pqc: Some(crate::crypto::pqc::PqcConfig::default()),
timeouts: crate::config::nat_timeouts::TimeoutConfig::default(),
identity_key: None, // Generate random key if not provided
allow_ipv4_mapped: true, // Required for dual-stack socket support
transport_registry: None, // Use direct UDP binding by default
max_message_size: crate::unified_config::P2pConfig::DEFAULT_MAX_MESSAGE_SIZE,
max_concurrent_uni_streams: 100,
}
}
}
impl ConfigValidator for NatTraversalConfig {
fn validate(&self) -> ValidationResult<()> {
use crate::config::validation::*;
// v0.13.0+: All nodes are symmetric P2P nodes
// Role-based validation is removed - any node can connect/accept/coordinate
// Validate known peers if provided
if !self.known_peers.is_empty() {
validate_bootstrap_nodes(&self.known_peers)?;
}
// Validate candidate limits
validate_range(self.max_candidates, 1, 256, "max_candidates")?;
// Validate coordination timeout
validate_duration(
self.coordination_timeout,
Duration::from_millis(100),
Duration::from_secs(300),
"coordination_timeout",
)?;
// Validate concurrent attempts
validate_range(
self.max_concurrent_attempts,
1,
16,
"max_concurrent_attempts",
)?;
// Validate max_message_size
if self.max_message_size == 0 {
return Err(ConfigValidationError::IncompatibleConfiguration(
"max_message_size must be at least 1".to_string(),
));
}
// Validate configuration compatibility
if self.max_concurrent_attempts > self.max_candidates {
return Err(ConfigValidationError::IncompatibleConfiguration(
"max_concurrent_attempts cannot exceed max_candidates".to_string(),
));
}
Ok(())
}
}
impl NatTraversalEndpoint {
fn normalize_config(mut config: NatTraversalConfig) -> NatTraversalConfig {
// v0.13.0+: symmetric P2P is mandatory. No opt-out for NAT traversal,
// relay fallback, or relay service.
config.enable_symmetric_nat = true;
config.enable_relay_fallback = true;
config.enable_relay_service = true;
config.prefer_rfc_nat_traversal = true;
// Ensure PQC is always enabled, even if callers attempted to disable it.
if config.pqc.is_none() {
config.pqc = Some(crate::crypto::pqc::PqcConfig::default());
}
config
}
/// Create a new NAT traversal endpoint with proper UDP socket sharing
///
/// This is the recommended constructor for most use cases. It:
/// 1. Binds a UDP socket at the specified address
/// 2. Creates a transport registry with the UDP transport (delegated to Quinn)
/// 3. Passes the same socket to Quinn's QUIC endpoint
///
/// This ensures that the transport registry and Quinn share the same UDP socket,
/// enabling proper multi-transport routing.
///
/// # Arguments
///
/// * `bind_addr` - Address to bind the UDP socket (use `0.0.0.0:0` for random port)
/// * `config` - NAT traversal configuration (transport_registry field is ignored)
/// * `event_callback` - Optional callback for NAT traversal events
/// * `token_store` - Optional token store for connection resumption
///
/// # Example
///
/// ```rust,ignore
/// let config = NatTraversalConfig::default();
/// let endpoint = NatTraversalEndpoint::new_with_shared_socket(
/// "0.0.0.0:9000".parse().unwrap(),
/// config,
/// None,
/// None,
/// ).await?;
/// ```
pub async fn new_with_shared_socket(
bind_addr: std::net::SocketAddr,
mut config: NatTraversalConfig,
event_callback: Option<Box<dyn Fn(NatTraversalEvent) + Send + Sync>>,
token_store: Option<Arc<dyn crate::TokenStore>>,
) -> Result<Self, NatTraversalError> {
use crate::transport::UdpTransport;
// Bind UDP socket for both transport registry and Quinn
let (udp_transport, quinn_socket) =
UdpTransport::bind_for_quinn(bind_addr).await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to bind UDP socket: {e}"))
})?;
let local_addr = quinn_socket.local_addr().map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to get local address: {e}"))
})?;
info!("Bound shared UDP socket at {}", local_addr);
// Create transport registry with the UDP transport
let mut registry = TransportRegistry::new();
registry.register(Arc::new(udp_transport));
// Override config with our registry and bind address
config.transport_registry = Some(Arc::new(registry));
config.bind_addr = Some(local_addr);
// Use new_with_socket to create the endpoint with the shared socket
Self::new_with_socket(config, event_callback, token_store, Some(quinn_socket)).await
}
/// Create a new NAT traversal endpoint with optional event callback and token store
///
/// **Note:** For proper multi-transport socket sharing, consider using
/// [`new_with_shared_socket`](Self::new_with_shared_socket) instead.
///
/// This constructor creates a separate UDP socket for Quinn if the transport_registry
/// in config already has a UDP provider. Use `new_with_socket` if you need to provide
/// a pre-bound socket for socket sharing.
pub async fn new(
config: NatTraversalConfig,
event_callback: Option<Box<dyn Fn(NatTraversalEvent) + Send + Sync>>,
token_store: Option<Arc<dyn crate::TokenStore>>,
) -> Result<Self, NatTraversalError> {
// Wrap the callback in Arc so it can be shared with background tasks
let event_callback: Option<Arc<dyn Fn(NatTraversalEvent) + Send + Sync>> =
event_callback.map(|cb| Arc::from(cb) as Arc<dyn Fn(NatTraversalEvent) + Send + Sync>);
let config = Self::normalize_config(config);
// Validate configuration
config
.validate()
.map_err(|e| NatTraversalError::ConfigError(e.to_string()))?;
// Initialize known peers for discovery and coordination
// Uses parking_lot::RwLock for faster, non-poisoning access
let bootstrap_nodes = Arc::new(ParkingRwLock::new(
config
.known_peers
.iter()
.map(|&address| BootstrapNode {
address,
last_seen: std::time::Instant::now(),
can_coordinate: true, // All nodes can coordinate in v0.13.0+
rtt: None,
coordination_count: 0,
})
.collect(),
));
// Create candidate discovery manager
let discovery_config = DiscoveryConfig {
total_timeout: config.coordination_timeout,
max_candidates: config.max_candidates,
enable_symmetric_prediction: true,
bound_address: config.bind_addr, // Will be updated with actual address after binding
..DiscoveryConfig::default()
};
// v0.13.0+: All nodes are symmetric P2P nodes - no role parameter needed
// Uses parking_lot::Mutex for faster, non-poisoning access
let discovery_manager = Arc::new(ParkingMutex::new(CandidateDiscoveryManager::new(
discovery_config,
)));
// Create QUIC endpoint with NAT traversal enabled
// If transport_registry is provided in config, use it; otherwise create empty registry
let empty_registry = crate::transport::TransportRegistry::new();
let registry_ref = config
.transport_registry
.as_ref()
.map(|arc| arc.as_ref())
.unwrap_or(&empty_registry);
let (inner_endpoint, event_tx, event_rx, local_addr, relay_server_config) =
Self::create_inner_endpoint(&config, token_store, registry_ref, None).await?;
// Update discovery manager with the actual bound address and any additional addresses
{
let mut discovery = discovery_manager.lock();
discovery.set_bound_address(local_addr);
for &extra_addr in &config.additional_bind_addrs {
discovery.add_additional_bound_address(extra_addr);
info!(
"Added dual-stack address {} to discovery candidates",
extra_addr
);
}
info!(
"Updated discovery manager with bound address: {} (+{} additional)",
local_addr,
config.additional_bind_addrs.len()
);
}
let emitted_established_events = Arc::new(dashmap::DashSet::new());
// Create MASQUE relay manager if relay fallback is enabled
let relay_manager = if !config.relay_nodes.is_empty() {
let relay_config = RelayManagerConfig {
max_relays: config.relay_nodes.len().min(5), // Cap at 5 relays
connect_timeout: config.coordination_timeout,
..RelayManagerConfig::default()
};
let manager = RelayManager::new(relay_config);
// Add configured relay nodes
for relay_addr in &config.relay_nodes {
manager.add_relay_node(*relay_addr).await;
}
Some(Arc::new(manager))
} else {
None
};
// Symmetric P2P: Create MASQUE relay server so this node can provide relay services
// Per ADR-004: All nodes are equal and participate in relaying with resource budgets
let relay_server = {
let relay_config = MasqueRelayConfig {
max_sessions: 100, // Reasonable limit for resource budget
require_authentication: true,
..MasqueRelayConfig::default()
};
// Use the local address as the public address (will be updated when external address is discovered)
let server = MasqueRelayServer::new(relay_config, local_addr);
info!(
"Created MASQUE relay server on {} (symmetric P2P node)",
local_addr
);
Some(Arc::new(server))
};
// Clone the callback for background tasks before moving into endpoint
let event_callback_for_poll = event_callback.clone();
// Store transport registry from config for multi-transport support
let transport_registry = config.transport_registry.clone();
// Create constrained protocol engine for BLE/LoRa/Serial transports
let constrained_engine = Arc::new(ParkingMutex::new(ConstrainedEngine::new(
EngineConfig::default(),
)));
// Create channel for forwarding constrained engine events to P2pEndpoint
let (constrained_event_tx, constrained_event_rx) = mpsc::unbounded_channel();
// Channel for peer address updates (ADD_ADDRESS → DHT bridge)
let (peer_addr_tx, peer_addr_rx) = mpsc::unbounded_channel();
inner_endpoint.set_peer_address_update_tx(peer_addr_tx);
let endpoint = Self {
inner_endpoint: Some(inner_endpoint.clone()),
config: config.clone(),
bootstrap_nodes,
active_sessions: Arc::new(dashmap::DashMap::new()),
discovery_manager,
event_callback,
shutdown: Arc::new(AtomicBool::new(false)),
event_tx: Some(event_tx.clone()),
event_rx: ParkingMutex::new(event_rx),
incoming_notify: Arc::new(tokio::sync::Notify::new()),
shutdown_notify: Arc::new(tokio::sync::Notify::new()),
connections: Arc::new(dashmap::DashMap::new()),
local_peer_id: Self::generate_local_peer_id(),
timeout_config: config.timeouts.clone(),
emitted_established_events: emitted_established_events.clone(),
relay_manager,
relay_sessions: Arc::new(dashmap::DashMap::new()),
relay_server,
successful_candidates: Arc::new(dashmap::DashMap::new()),
transport_candidates: Arc::new(dashmap::DashMap::new()),
transport_registry,
peer_address_update_rx: TokioMutex::new(peer_addr_rx),
relay_setup_attempted: Arc::new(std::sync::atomic::AtomicBool::new(false)),
relay_public_addr: Arc::new(std::sync::Mutex::new(None)),
relay_advertised_peers: Arc::new(std::sync::Mutex::new(
std::collections::HashSet::new(),
)),
server_config: relay_server_config,
transport_listener_handles: Arc::new(ParkingMutex::new(Vec::new())),
constrained_engine,
constrained_event_tx: constrained_event_tx.clone(),
constrained_event_rx: TokioMutex::new(constrained_event_rx),
};
// Multi-transport listening: Spawn receive tasks for all online transports
// Phase 1.2: Listen on all transports, log for now (full routing in Phase 2.3)
if let Some(registry) = &endpoint.transport_registry {
let online_providers: Vec<_> = registry.online_providers().collect();
let transport_count = online_providers.len();
if transport_count > 0 {
let transport_names: Vec<_> = online_providers
.iter()
.map(|p| format!("{}({})", p.name(), p.transport_type()))
.collect();
debug!(
"Listening on {} transports: {}",
transport_count,
transport_names.join(", ")
);
let mut handles = Vec::new();
for provider in online_providers {
let transport_type = provider.transport_type();
let transport_name = provider.name().to_string();
// Skip UDP transports since they're already handled by the QUIC endpoint
if transport_type == crate::transport::TransportType::Udp {
debug!(
"Skipping UDP transport '{}' (already handled by QUIC endpoint)",
transport_name
);
continue;
}
// Spawn task to receive from this transport's inbound channel
let mut inbound_rx = provider.inbound();
let shutdown_notify_clone = endpoint.shutdown_notify.clone();
let shutdown_flag_clone = endpoint.shutdown.clone();
let engine_clone = endpoint.constrained_engine.clone();
let registry_clone = endpoint.transport_registry.clone();
let event_tx_clone = endpoint.constrained_event_tx.clone();
let handle = tokio::spawn(async move {
debug!("Started listening on transport '{}'", transport_name);
loop {
// Fallback shutdown check: notify_waiters() can be missed
// if no task is awaiting .notified() at the moment shutdown()
// fires, so we check the AtomicBool on each iteration.
if shutdown_flag_clone.load(std::sync::atomic::Ordering::Relaxed) {
debug!("Shutting down transport listener for '{}'", transport_name);
break;
}
tokio::select! {
// Instant shutdown via Notify
_ = shutdown_notify_clone.notified() => {
debug!("Shutting down transport listener for '{}'", transport_name);
break;
}
// Receive inbound datagrams
datagram = inbound_rx.recv() => {
match datagram {
Some(datagram) => {
debug!(
"Received {} bytes from {} on transport '{}' ({})",
datagram.data.len(),
datagram.source,
transport_name,
transport_type
);
// Convert TransportAddr to SocketAddr for constrained engine
// The constrained engine uses SocketAddr internally for connection tracking
let remote_addr = datagram.source.to_synthetic_socket_addr();
// Route to constrained engine for processing
let responses = {
let mut engine = engine_clone.lock();
match engine.process_incoming(remote_addr, &datagram.data) {
Ok(responses) => responses,
Err(e) => {
debug!(
"Constrained engine error processing packet from {}: {:?}",
datagram.source, e
);
Vec::new()
}
}
};
// Send any response packets back through the transport
if !responses.is_empty() {
if let Some(registry) = ®istry_clone {
for (_dest_addr, response_data) in responses {
// Send response back to the source transport address
if let Err(e) = registry.send(&response_data, &datagram.source).await {
debug!(
"Failed to send constrained response to {}: {:?}",
datagram.source, e
);
}
}
}
}
// Process events from the constrained engine and forward to P2pEndpoint
// Save the source address before processing events
let source_addr = datagram.source.clone();
{
let mut engine = engine_clone.lock();
while let Some(event) = engine.next_event() {
debug!("Constrained engine event: {:?}", event);
// Forward event to P2pEndpoint via channel
let event_with_addr = ConstrainedEventWithAddr {
event,
remote_addr: source_addr.clone(),
};
if let Err(e) = event_tx_clone.send(event_with_addr) {
debug!("Failed to forward constrained event: {}", e);
}
}
}
}
None => {
debug!("Transport '{}' inbound channel closed", transport_name);
break;
}
}
}
}
}
debug!("Transport listener for '{}' terminated", transport_name);
});
handles.push(handle);
}
// Store handles for cleanup on shutdown
if !handles.is_empty() {
let mut listener_handles = endpoint.transport_listener_handles.lock();
listener_handles.extend(handles);
info!(
"Started {} transport listener tasks (excluding UDP)",
listener_handles.len()
);
}
} else {
debug!("No online transports found in registry");
}
}
// v0.13.0+: All nodes are symmetric P2P nodes - always start accepting connections
{
let endpoint_clone = inner_endpoint.clone();
let shutdown_clone = endpoint.shutdown.clone();
let event_tx_clone = event_tx.clone();
let connections_clone = endpoint.connections.clone();
let emitted_events_clone = emitted_established_events.clone();
let relay_server_clone = endpoint.relay_server.clone();
let incoming_notify_clone = endpoint.incoming_notify.clone();
tokio::spawn(async move {
Self::accept_connections(
endpoint_clone,
shutdown_clone,
event_tx_clone,
connections_clone,
emitted_events_clone,
relay_server_clone,
incoming_notify_clone,
)
.await;
});
info!("Started accepting connections (symmetric P2P node)");
}
// Start background discovery polling task
let discovery_manager_clone = endpoint.discovery_manager.clone();
let shutdown_clone = endpoint.shutdown.clone();
let event_tx_clone = event_tx;
let connections_clone = endpoint.connections.clone();
let local_peer_id_for_poll = endpoint.local_peer_id;
let relay_setup_attempted_clone = endpoint.relay_setup_attempted.clone();
tokio::spawn(async move {
Self::poll_discovery(
discovery_manager_clone,
shutdown_clone,
event_tx_clone,
connections_clone,
event_callback_for_poll,
local_peer_id_for_poll,
relay_setup_attempted_clone,
)
.await;
});
info!("Started discovery polling task");
// Start local candidate discovery for our own address
{
// parking_lot locks don't poison - no need for map_err
let mut discovery = endpoint.discovery_manager.lock();
// Start discovery for our own peer ID to discover local candidates
let local_peer_id = endpoint.local_peer_id;
let bootstrap_nodes = endpoint.bootstrap_nodes.read().clone();
discovery
.start_discovery(local_peer_id, bootstrap_nodes)
.map_err(|e| NatTraversalError::CandidateDiscoveryFailed(e.to_string()))?;
info!(
"Started local candidate discovery for peer {:?}",
local_peer_id
);
}
Ok(endpoint)
}
/// Create a new NAT traversal endpoint with a pre-bound socket for Quinn sharing
///
/// This variant allows passing a pre-bound `std::net::UdpSocket` that will be
/// shared between the transport registry and Quinn's QUIC endpoint. Use this
/// with `UdpTransport::bind_for_quinn()` for proper socket sharing.
///
/// # Arguments
///
/// * `config` - NAT traversal configuration
/// * `event_callback` - Optional callback for NAT traversal events
/// * `token_store` - Optional token store for authentication
/// * `quinn_socket` - Pre-bound socket from `UdpTransport::bind_for_quinn()`
///
/// # Example
///
/// ```ignore
/// use ant_quic::transport::udp::UdpTransport;
///
/// // Bind transport and get socket for Quinn
/// let (udp_transport, quinn_socket) = UdpTransport::bind_for_quinn(addr).await?;
///
/// // Register transport
/// registry.register(Arc::new(udp_transport))?;
///
/// // Create endpoint with shared socket
/// let endpoint = NatTraversalEndpoint::new_with_socket(
/// config,
/// None,
/// None,
/// Some(quinn_socket),
/// ).await?;
/// ```
/// Create a NatTraversalEndpoint with a pre-built abstract socket.
///
/// Accepts an `Arc<dyn AsyncUdpSocket>` (e.g. `DualStackSocket`) instead of a raw
/// std socket. This allows custom socket implementations like dual-stack wrappers.
pub async fn new_with_abstract_socket(
config: NatTraversalConfig,
event_callback: Option<Box<dyn Fn(NatTraversalEvent) + Send + Sync>>,
token_store: Option<Arc<dyn crate::TokenStore>>,
abstract_socket: Arc<dyn crate::high_level::runtime::AsyncUdpSocket>,
) -> Result<Self, NatTraversalError> {
Self::new_with_socket_inner(
config,
event_callback,
token_store,
None,
Some(abstract_socket),
)
.await
}
pub async fn new_with_socket(
config: NatTraversalConfig,
event_callback: Option<Box<dyn Fn(NatTraversalEvent) + Send + Sync>>,
token_store: Option<Arc<dyn crate::TokenStore>>,
quinn_socket: Option<std::net::UdpSocket>,
) -> Result<Self, NatTraversalError> {
Self::new_with_socket_inner(config, event_callback, token_store, quinn_socket, None).await
}
async fn new_with_socket_inner(
config: NatTraversalConfig,
event_callback: Option<Box<dyn Fn(NatTraversalEvent) + Send + Sync>>,
token_store: Option<Arc<dyn crate::TokenStore>>,
quinn_socket: Option<std::net::UdpSocket>,
abstract_socket: Option<Arc<dyn crate::high_level::runtime::AsyncUdpSocket>>,
) -> Result<Self, NatTraversalError> {
// Wrap the callback in Arc so it can be shared with background tasks
let event_callback: Option<Arc<dyn Fn(NatTraversalEvent) + Send + Sync>> =
event_callback.map(|cb| Arc::from(cb) as Arc<dyn Fn(NatTraversalEvent) + Send + Sync>);
let config = Self::normalize_config(config);
// Validate configuration
config
.validate()
.map_err(|e| NatTraversalError::ConfigError(e.to_string()))?;
// Initialize known peers for discovery and coordination
// Uses parking_lot::RwLock for faster, non-poisoning access
let bootstrap_nodes = Arc::new(ParkingRwLock::new(
config
.known_peers
.iter()
.map(|&address| BootstrapNode {
address,
last_seen: std::time::Instant::now(),
can_coordinate: true, // All nodes can coordinate in v0.13.0+
rtt: None,
coordination_count: 0,
})
.collect(),
));
// Create candidate discovery manager
let discovery_config = DiscoveryConfig {
total_timeout: config.coordination_timeout,
max_candidates: config.max_candidates,
enable_symmetric_prediction: true,
bound_address: config.bind_addr, // Will be updated with actual address after binding
..DiscoveryConfig::default()
};
// v0.13.0+: All nodes are symmetric P2P nodes - no role parameter needed
// Uses parking_lot::Mutex for faster, non-poisoning access
let discovery_manager = Arc::new(ParkingMutex::new(CandidateDiscoveryManager::new(
discovery_config,
)));
// Create QUIC endpoint with NAT traversal enabled
// If transport_registry is provided in config, use it; otherwise create empty registry
let empty_registry = crate::transport::TransportRegistry::new();
let registry_ref = config
.transport_registry
.as_ref()
.map(|arc| arc.as_ref())
.unwrap_or(&empty_registry);
let (inner_endpoint, event_tx, event_rx, local_addr, relay_server_config) =
if let Some(abs_socket) = abstract_socket {
let (ep, tx, rx, addr) = Self::create_inner_endpoint_with_abstract_socket(
&config,
token_store.clone(),
abs_socket,
)
.await?;
(ep, tx, rx, addr, None)
} else {
Self::create_inner_endpoint(
&config,
token_store.clone(),
registry_ref,
quinn_socket,
)
.await?
};
// Update discovery manager with the actual bound address and any additional addresses
{
let mut discovery = discovery_manager.lock();
discovery.set_bound_address(local_addr);
for &extra_addr in &config.additional_bind_addrs {
discovery.add_additional_bound_address(extra_addr);
info!(
"Added dual-stack address {} to discovery candidates",
extra_addr
);
}
info!(
"Updated discovery manager with bound address: {} (+{} additional)",
local_addr,
config.additional_bind_addrs.len()
);
}
let emitted_established_events = Arc::new(dashmap::DashSet::new());
// Create MASQUE relay manager if relay fallback is enabled
let relay_manager = if !config.relay_nodes.is_empty() {
let relay_config = RelayManagerConfig {
max_relays: config.relay_nodes.len().min(5), // Cap at 5 relays
connect_timeout: config.coordination_timeout,
..RelayManagerConfig::default()
};
let manager = RelayManager::new(relay_config);
// Add configured relay nodes
for relay_addr in &config.relay_nodes {
manager.add_relay_node(*relay_addr).await;
}
Some(Arc::new(manager))
} else {
None
};
// Symmetric P2P: Create MASQUE relay server so this node can provide relay services
// Per ADR-004: All nodes are equal and participate in relaying with resource budgets
let relay_server = {
let relay_config = MasqueRelayConfig {
max_sessions: 100, // Reasonable limit for resource budget
require_authentication: true,
..MasqueRelayConfig::default()
};
// Use the local address as the public address (will be updated when external address is discovered)
let server = MasqueRelayServer::new(relay_config, local_addr);
info!(
"Created MASQUE relay server on {} (symmetric P2P node)",
local_addr
);
Some(Arc::new(server))
};
// Clone the callback for background tasks before moving into endpoint
let event_callback_for_poll = event_callback.clone();
// Store transport registry from config for multi-transport support
let transport_registry = config.transport_registry.clone();
// Create constrained protocol engine for BLE/LoRa/Serial transports
let constrained_engine = Arc::new(ParkingMutex::new(ConstrainedEngine::new(
EngineConfig::default(),
)));
// Create channel for forwarding constrained engine events to P2pEndpoint
let (constrained_event_tx, constrained_event_rx) = mpsc::unbounded_channel();
// Channel for peer address updates (ADD_ADDRESS → DHT bridge)
let (peer_addr_tx, peer_addr_rx) = mpsc::unbounded_channel();
inner_endpoint.set_peer_address_update_tx(peer_addr_tx);
let endpoint = Self {
inner_endpoint: Some(inner_endpoint.clone()),
config: config.clone(),
bootstrap_nodes,
active_sessions: Arc::new(dashmap::DashMap::new()),
discovery_manager,
event_callback,
shutdown: Arc::new(AtomicBool::new(false)),
event_tx: Some(event_tx.clone()),
event_rx: ParkingMutex::new(event_rx),
incoming_notify: Arc::new(tokio::sync::Notify::new()),
shutdown_notify: Arc::new(tokio::sync::Notify::new()),
connections: Arc::new(dashmap::DashMap::new()),
local_peer_id: Self::generate_local_peer_id(),
timeout_config: config.timeouts.clone(),
emitted_established_events: emitted_established_events.clone(),
relay_manager,
relay_sessions: Arc::new(dashmap::DashMap::new()),
relay_server,
successful_candidates: Arc::new(dashmap::DashMap::new()),
transport_candidates: Arc::new(dashmap::DashMap::new()),
transport_registry,
peer_address_update_rx: TokioMutex::new(peer_addr_rx),
relay_setup_attempted: Arc::new(std::sync::atomic::AtomicBool::new(false)),
relay_public_addr: Arc::new(std::sync::Mutex::new(None)),
relay_advertised_peers: Arc::new(std::sync::Mutex::new(
std::collections::HashSet::new(),
)),
server_config: relay_server_config,
transport_listener_handles: Arc::new(ParkingMutex::new(Vec::new())),
constrained_engine,
constrained_event_tx: constrained_event_tx.clone(),
constrained_event_rx: TokioMutex::new(constrained_event_rx),
};
// Multi-transport listening: Spawn receive tasks for all online transports
// Phase 1.2: Listen on all transports, log for now (full routing in Phase 2.3)
if let Some(registry) = &endpoint.transport_registry {
let online_providers: Vec<_> = registry.online_providers().collect();
let transport_count = online_providers.len();
if transport_count > 0 {
let transport_names: Vec<_> = online_providers
.iter()
.map(|p| format!("{}({})", p.name(), p.transport_type()))
.collect();
debug!(
"Listening on {} transports: {}",
transport_count,
transport_names.join(", ")
);
let mut handles = Vec::new();
for provider in online_providers {
let transport_type = provider.transport_type();
let transport_name = provider.name().to_string();
// Skip UDP transports since they're already handled by the QUIC endpoint
if transport_type == crate::transport::TransportType::Udp {
debug!(
"Skipping UDP transport '{}' (already handled by QUIC endpoint)",
transport_name
);
continue;
}
// Spawn task to receive from this transport's inbound channel
let mut inbound_rx = provider.inbound();
let shutdown_notify_clone = endpoint.shutdown_notify.clone();
let shutdown_flag_clone = endpoint.shutdown.clone();
let engine_clone = endpoint.constrained_engine.clone();
let registry_clone = endpoint.transport_registry.clone();
let event_tx_clone = endpoint.constrained_event_tx.clone();
let handle = tokio::spawn(async move {
debug!("Started listening on transport '{}'", transport_name);
loop {
// Fallback shutdown check: notify_waiters() can be missed
// if no task is awaiting .notified() at the moment shutdown()
// fires, so we check the AtomicBool on each iteration.
if shutdown_flag_clone.load(std::sync::atomic::Ordering::Relaxed) {
debug!("Shutting down transport listener for '{}'", transport_name);
break;
}
tokio::select! {
// Instant shutdown via Notify
_ = shutdown_notify_clone.notified() => {
debug!("Shutting down transport listener for '{}'", transport_name);
break;
}
// Receive inbound datagrams
datagram = inbound_rx.recv() => {
match datagram {
Some(datagram) => {
debug!(
"Received {} bytes from {} on transport '{}' ({})",
datagram.data.len(),
datagram.source,
transport_name,
transport_type
);
// Convert TransportAddr to SocketAddr for constrained engine
// The constrained engine uses SocketAddr internally for connection tracking
let remote_addr = datagram.source.to_synthetic_socket_addr();
// Route to constrained engine for processing
let responses = {
let mut engine = engine_clone.lock();
match engine.process_incoming(remote_addr, &datagram.data) {
Ok(responses) => responses,
Err(e) => {
debug!(
"Constrained engine error processing packet from {}: {:?}",
datagram.source, e
);
Vec::new()
}
}
};
// Send any response packets back through the transport
if !responses.is_empty() {
if let Some(registry) = ®istry_clone {
for (_dest_addr, response_data) in responses {
// Send response back to the source transport address
if let Err(e) = registry.send(&response_data, &datagram.source).await {
debug!(
"Failed to send constrained response to {}: {:?}",
datagram.source, e
);
}
}
}
}
// Process events from the constrained engine and forward to P2pEndpoint
// Save the source address before processing events
let source_addr = datagram.source.clone();
{
let mut engine = engine_clone.lock();
while let Some(event) = engine.next_event() {
debug!("Constrained engine event: {:?}", event);
// Forward event to P2pEndpoint via channel
let event_with_addr = ConstrainedEventWithAddr {
event,
remote_addr: source_addr.clone(),
};
if let Err(e) = event_tx_clone.send(event_with_addr) {
debug!("Failed to forward constrained event: {}", e);
}
}
}
}
None => {
debug!("Transport '{}' inbound channel closed", transport_name);
break;
}
}
}
}
}
debug!("Transport listener for '{}' terminated", transport_name);
});
handles.push(handle);
}
// Store handles for cleanup on shutdown
if !handles.is_empty() {
let mut listener_handles = endpoint.transport_listener_handles.lock();
listener_handles.extend(handles);
info!(
"Started {} transport listener tasks (excluding UDP)",
listener_handles.len()
);
}
} else {
debug!("No online transports found in registry");
}
}
// v0.13.0+: All nodes are symmetric P2P nodes - always start accepting connections
{
let endpoint_clone = inner_endpoint.clone();
let shutdown_clone = endpoint.shutdown.clone();
let event_tx_clone = event_tx.clone();
let connections_clone = endpoint.connections.clone();
let emitted_events_clone = emitted_established_events.clone();
let relay_server_clone = endpoint.relay_server.clone();
let incoming_notify_clone = endpoint.incoming_notify.clone();
tokio::spawn(async move {
Self::accept_connections(
endpoint_clone,
shutdown_clone,
event_tx_clone,
connections_clone,
emitted_events_clone,
relay_server_clone,
incoming_notify_clone,
)
.await;
});
info!("Started accepting connections (symmetric P2P node)");
}
// Start background discovery polling task
let discovery_manager_clone = endpoint.discovery_manager.clone();
let shutdown_clone = endpoint.shutdown.clone();
let event_tx_clone = event_tx;
let connections_clone = endpoint.connections.clone();
let local_peer_id_for_poll = endpoint.local_peer_id;
let relay_setup_attempted_clone = endpoint.relay_setup_attempted.clone();
tokio::spawn(async move {
Self::poll_discovery(
discovery_manager_clone,
shutdown_clone,
event_tx_clone,
connections_clone,
event_callback_for_poll,
local_peer_id_for_poll,
relay_setup_attempted_clone,
)
.await;
});
info!("Started discovery polling task");
// Start local candidate discovery for our own address
{
// parking_lot locks don't poison - no need for map_err
let mut discovery = endpoint.discovery_manager.lock();
// Start discovery for our own peer ID to discover local candidates
let local_peer_id = endpoint.local_peer_id;
let bootstrap_nodes = endpoint.bootstrap_nodes.read().clone();
discovery
.start_discovery(local_peer_id, bootstrap_nodes)
.map_err(|e| NatTraversalError::CandidateDiscoveryFailed(e.to_string()))?;
info!(
"Started local candidate discovery for peer {:?}",
local_peer_id
);
}
Ok(endpoint)
}
/// Get the underlying QUIC endpoint
pub fn get_endpoint(&self) -> Option<&crate::high_level::Endpoint> {
self.inner_endpoint.as_ref()
}
/// Register a peer ID at the low-level endpoint for PUNCH_ME_NOW routing.
pub fn register_connection_peer_id(&self, addr: SocketAddr, peer_id: PeerId) {
if let Some(ep) = &self.inner_endpoint {
ep.register_connection_peer_id(addr, peer_id);
}
}
/// Check if a peer with the given ID has an active connection,
/// returning its actual socket address if found. This is essential
/// for symmetric NAT where the peer's address in the DHT differs
/// from the connection's actual address.
#[allow(dead_code)] // Used by try_hole_punch peer ID fallback path
pub(crate) fn find_connection_by_peer_id(&self, peer_id: &[u8; 32]) -> Option<SocketAddr> {
if let Some(ep) = &self.inner_endpoint {
return ep.peer_connection_addr_by_id(peer_id);
}
None
}
/// Detect symmetric NAT by checking port diversity across peer connections.
///
/// Returns `true` if at least 2 different external ports are observed from
/// different peers, indicating that the NAT assigns a different port per
/// destination (symmetric NAT behaviour).
pub(crate) fn is_symmetric_nat(&self) -> bool {
let mut observed_ports = std::collections::HashSet::new();
for entry in self.connections.iter() {
if let Some(addr) = entry.value().observed_address() {
observed_ports.insert(addr.port());
}
}
let is_symmetric = observed_ports.len() >= 2;
if is_symmetric {
info!(
"Symmetric NAT detected: {} different external ports observed ({:?})",
observed_ports.len(),
observed_ports
);
}
is_symmetric
}
/// Set up proactive relay for a node behind symmetric NAT.
///
/// Establishes a MASQUE relay session with the bootstrap node, creates a
/// secondary Quinn endpoint on the `MasqueRelaySocket` to accept incoming
/// connections via the relay, and only then advertises the relay address
/// to all connected peers.
pub(crate) async fn setup_proactive_relay(
&self,
bootstrap_addr: SocketAddr,
) -> Result<SocketAddr, NatTraversalError> {
info!(
"Setting up proactive relay via bootstrap {} for symmetric NAT",
bootstrap_addr
);
// Step 1: Establish relay session with bootstrap
let (public_addr, relay_socket) = self.establish_relay_session(bootstrap_addr).await?;
let relay_public_addr = public_addr.ok_or_else(|| {
NatTraversalError::ConnectionFailed("Relay did not provide public address".to_string())
})?;
let relay_socket = relay_socket.ok_or_else(|| {
NatTraversalError::ConnectionFailed("Relay did not provide socket".to_string())
})?;
info!(
"Relay session established, public address: {}",
relay_public_addr
);
// Step 2: Create a secondary Quinn endpoint on the MasqueRelaySocket.
// This endpoint accepts QUIC connections arriving via the relay's
// forwarding loop. We cannot rebind the main endpoint — the relay
// connection itself would loop.
let runtime = crate::high_level::default_runtime().ok_or_else(|| {
NatTraversalError::ConfigError("No async runtime for relay endpoint".to_string())
})?;
let relay_endpoint = crate::high_level::Endpoint::new_with_abstract_socket(
crate::EndpointConfig::default(),
self.server_config.clone(),
relay_socket,
runtime,
)
.map_err(|e| {
NatTraversalError::ConnectionFailed(format!(
"Failed to create relay accept endpoint: {}",
e
))
})?;
info!(
"Secondary relay endpoint created for accepting connections at {}",
relay_public_addr
);
// Step 3: Spawn accept loop — forward accepted connections into the
// shared connections map and emit ConnectionEstablished so the normal
// accept_connection() → P2pEndpoint::accept() path picks them up
// (spawning reader tasks, registering PeerConnection, etc.).
let connections = self.connections.clone();
let incoming_notify = self.incoming_notify.clone();
let relay_event_tx = self.event_tx.clone();
tokio::spawn(async move {
loop {
match relay_endpoint.accept().await {
Some(incoming) => match incoming.await {
Ok(conn) => {
let remote = conn.remote_address();
// Derive a temporary PeerId from the remote address.
// The real identity exchange will update this later
// via extract_peer_id_from_connection in accept().
let peer_id = {
use std::hash::{Hash, Hasher};
let mut hasher = std::collections::hash_map::DefaultHasher::new();
remote.hash(&mut hasher);
let hash = hasher.finish();
let mut id = [0u8; 32];
id[..8].copy_from_slice(&hash.to_le_bytes());
id[8..16].copy_from_slice(&hash.to_be_bytes());
PeerId(id)
};
info!(
"Accepted relayed connection from {} (peer {}) — registering",
remote,
hex::encode(&peer_id.0[..8])
);
connections.insert(peer_id, conn);
// Emit ConnectionEstablished so accept_connection()
// returns this to P2pEndpoint::accept(), which spawns
// the reader task and stores the PeerConnection.
if let Some(ref tx) = relay_event_tx {
let _ = tx.send(NatTraversalEvent::ConnectionEstablished {
peer_id,
remote_address: remote,
side: Side::Server,
});
}
incoming_notify.notify_waiters();
}
Err(e) => {
debug!("Relayed connection handshake failed: {}", e);
}
},
None => {
info!("Relay accept endpoint closed");
break;
}
}
}
});
// Step 4: Store relay public address for re-advertisement to future peers
if let Ok(mut addr) = self.relay_public_addr.lock() {
*addr = Some(relay_public_addr);
}
// Step 5: Now that the endpoint is accepting, advertise to all peers
let mut advertised = 0;
for entry in self.connections.iter() {
let conn = entry.value().clone();
match conn.send_nat_address_advertisement(relay_public_addr, 100) {
Ok(_) => {
advertised += 1;
if let Ok(mut peers) = self.relay_advertised_peers.lock() {
peers.insert(conn.remote_address());
}
}
Err(e) => {
debug!(
"Failed to advertise relay address to {}: {}",
entry.key(),
e
);
}
}
}
info!(
"Proactive relay active at {} — advertised to {} peers",
relay_public_addr, advertised
);
Ok(relay_public_addr)
}
/// Get the event callback
pub fn get_event_callback(&self) -> Option<&Arc<dyn Fn(NatTraversalEvent) + Send + Sync>> {
self.event_callback.as_ref()
}
/// Get the transport registry if configured
///
/// Returns the transport registry that was provided at construction time,
/// enabling multi-transport support and shared socket management.
pub fn transport_registry(&self) -> Option<&Arc<TransportRegistry>> {
self.transport_registry.as_ref()
}
/// Get a reference to the constrained protocol engine
///
/// The constrained engine handles connections over non-QUIC transports
/// (BLE, LoRa, Serial, etc.). Use this for:
/// - Initiating constrained connections
/// - Sending/receiving data on constrained connections
/// - Processing constrained connection events
///
/// # Thread Safety
///
/// The returned `Arc<ParkingMutex<ConstrainedEngine>>` is thread-safe and can
/// be shared across async tasks.
pub fn constrained_engine(&self) -> &Arc<ParkingMutex<ConstrainedEngine>> {
&self.constrained_engine
}
/// Try to receive a constrained engine event without blocking
///
/// Returns the next event from constrained transports (BLE/LoRa) if available.
/// This allows P2pEndpoint to poll for data received on non-UDP transports.
///
/// # Returns
///
/// - `Some(event)` - An event with the data and source transport address
/// - `None` - No events currently available
pub fn try_recv_constrained_event(&self) -> Option<ConstrainedEventWithAddr> {
// Use try_lock() since this is a synchronous function
self.constrained_event_rx.try_lock().ok()?.try_recv().ok()
}
/// Receive a constrained engine event asynchronously
///
/// Waits for the next event from constrained transports (BLE/LoRa) without polling.
/// This eliminates the need for polling loops with sleep intervals.
///
/// # Returns
///
/// - `Some(event)` - An event with the data and source transport address
/// - `None` - The channel has been closed
pub async fn recv_constrained_event(&self) -> Option<ConstrainedEventWithAddr> {
self.constrained_event_rx.lock().await.recv().await
}
/// Get a reference to the constrained event sender for testing
///
/// This is primarily used for testing to inject events.
pub fn constrained_event_tx(&self) -> &mpsc::UnboundedSender<ConstrainedEventWithAddr> {
&self.constrained_event_tx
}
/// Emit an event to both the events vector and the callback (if present)
///
/// This helper method eliminates the repeated pattern of:
/// ```ignore
/// if let Some(ref callback) = self.event_callback {
/// callback(event.clone());
/// }
/// events.push(event);
/// ```
#[inline]
fn emit_event(&self, events: &mut Vec<NatTraversalEvent>, event: NatTraversalEvent) {
if let Some(ref callback) = self.event_callback {
callback(event.clone());
}
events.push(event);
}
/// Initiate NAT traversal to a peer (returns immediately, progress via events)
pub fn initiate_nat_traversal(
&self,
peer_id: PeerId,
coordinator: SocketAddr,
) -> Result<(), NatTraversalError> {
// CRITICAL: Check for existing connection FIRST - no NAT traversal needed if already connected.
// This prevents wasting resources on hole punching when we already have a direct connection.
if self.has_existing_connection(&peer_id) {
debug!(
"Direct connection already exists for peer {:?}, skipping NAT traversal",
peer_id
);
return Ok(()); // Already connected, not an error
}
// CRITICAL: Check for existing active session FIRST to prevent race conditions.
// Multiple concurrent calls for the same peer would otherwise:
// 1. Each create a new session
// 2. Each insert into DashMap (replacing previous)
// 3. Then fail in start_discovery() with "already in progress"
// This race condition can cause resource leaks and potential deadlocks.
if self.active_sessions.contains_key(&peer_id) {
debug!(
"NAT traversal already in progress for peer {:?}, skipping duplicate request",
peer_id
);
return Ok(()); // Already handling this peer, not an error
}
info!(
"Starting NAT traversal to peer {:?} via coordinator {}",
peer_id, coordinator
);
// Create new session
let session = NatTraversalSession {
peer_id,
coordinator,
attempt: 1,
started_at: std::time::Instant::now(),
phase: TraversalPhase::Discovery,
candidates: Vec::new(),
session_state: SessionState {
state: ConnectionState::Connecting,
last_transition: std::time::Instant::now(),
connection: None,
active_attempts: Vec::new(),
metrics: ConnectionMetrics::default(),
},
};
// Store session
// DashMap provides lock-free .insert()
self.active_sessions.insert(peer_id, session);
// Start candidate discovery - parking_lot::RwLock doesn't poison
let bootstrap_nodes_vec = self.bootstrap_nodes.read().clone();
{
// parking_lot::Mutex doesn't poison
let mut discovery = self.discovery_manager.lock();
discovery
.start_discovery(peer_id, bootstrap_nodes_vec)
.map_err(|e| NatTraversalError::CandidateDiscoveryFailed(e.to_string()))?;
}
// Emit event
if let Some(ref callback) = self.event_callback {
callback(NatTraversalEvent::CoordinationRequested {
peer_id,
coordinator,
});
}
if self.send_coordination_request(peer_id, coordinator).is_ok() {
if let Some(mut entry) = self.active_sessions.get_mut(&peer_id) {
let session = entry.value_mut();
session.phase = TraversalPhase::Synchronization;
}
self.incoming_notify.notify_waiters();
}
// NAT traversal will proceed via poll() calls and state machine updates
Ok(())
}
/// Poll all active sessions and update their states
pub fn poll_sessions(&self) -> Result<Vec<SessionStateUpdate>, NatTraversalError> {
let mut updates = Vec::new();
let now = std::time::Instant::now();
// Snapshot keys to avoid holding iter_mut() write guards on all shards
// while accessing self.connections (another DashMap)
let session_keys: Vec<PeerId> = self.active_sessions.iter().map(|e| *e.key()).collect();
for peer_id in session_keys {
let Some(mut entry) = self.active_sessions.get_mut(&peer_id) else {
continue;
};
let session = entry.value_mut();
let mut state_changed = false;
match session.session_state.state {
ConnectionState::Connecting => {
// Check connection timeout
let elapsed = now.duration_since(session.session_state.last_transition);
if elapsed
> self
.timeout_config
.nat_traversal
.connection_establishment_timeout
{
session.session_state.state = ConnectionState::Closed;
session.session_state.last_transition = now;
state_changed = true;
updates.push(SessionStateUpdate {
peer_id,
old_state: ConnectionState::Connecting,
new_state: ConnectionState::Closed,
reason: StateChangeReason::Timeout,
});
}
// Check if any connection attempts succeeded
// First, check the connections DashMap to see if a connection was established
let has_connection = self.connections.contains_key(&peer_id);
if has_connection || session.session_state.connection.is_some() {
// Update session_state.connection from the connections DashMap
if session.session_state.connection.is_none() {
if let Some(conn_ref) = self.connections.get(&peer_id) {
session.session_state.connection = Some(conn_ref.clone());
}
}
session.session_state.state = ConnectionState::Connected;
session.session_state.last_transition = now;
state_changed = true;
updates.push(SessionStateUpdate {
peer_id,
old_state: ConnectionState::Connecting,
new_state: ConnectionState::Connected,
reason: StateChangeReason::ConnectionEstablished,
});
}
}
ConnectionState::Connected => {
// Check connection health
{
// TODO: Implement proper connection health check
// For now, just update metrics
}
// Update metrics
session.session_state.metrics.last_activity = Some(now);
}
ConnectionState::Migrating => {
// Check migration timeout
let elapsed = now.duration_since(session.session_state.last_transition);
if elapsed > Duration::from_secs(10) {
// Migration timed out, return to connected or close
if session.session_state.connection.is_some() {
session.session_state.state = ConnectionState::Connected;
state_changed = true;
updates.push(SessionStateUpdate {
peer_id,
old_state: ConnectionState::Migrating,
new_state: ConnectionState::Connected,
reason: StateChangeReason::MigrationComplete,
});
} else {
session.session_state.state = ConnectionState::Closed;
state_changed = true;
updates.push(SessionStateUpdate {
peer_id,
old_state: ConnectionState::Migrating,
new_state: ConnectionState::Closed,
reason: StateChangeReason::MigrationFailed,
});
}
session.session_state.last_transition = now;
}
}
_ => {}
}
// Emit events for state changes
if state_changed {
if let Some(ref callback) = self.event_callback {
callback(NatTraversalEvent::SessionStateChanged {
peer_id,
new_state: session.session_state.state,
});
}
}
}
Ok(updates)
}
/// Start periodic session polling task
pub fn start_session_polling(&self, interval: Duration) -> tokio::task::JoinHandle<()> {
let sessions = self.active_sessions.clone();
let shutdown = self.shutdown.clone();
let timeout_config = self.timeout_config.clone();
tokio::spawn(async move {
let mut ticker = tokio::time::interval(interval);
loop {
ticker.tick().await;
if shutdown.load(Ordering::Relaxed) {
break;
}
// Poll sessions and handle updates
// DashMap provides lock-free .iter() that yields Ref entries
let sessions_to_update: Vec<_> = sessions
.iter()
.filter_map(|entry| {
let peer_id = *entry.key();
let session = entry.value();
let now = std::time::Instant::now();
let elapsed = now.duration_since(session.session_state.last_transition);
match session.session_state.state {
ConnectionState::Connecting => {
// Check for connection timeout
if elapsed
> timeout_config
.nat_traversal
.connection_establishment_timeout
{
Some((peer_id, SessionUpdate::Timeout))
} else {
None
}
}
ConnectionState::Connected => {
// Check if connection is still alive
if let Some(ref conn) = session.session_state.connection {
if conn.close_reason().is_some() {
Some((peer_id, SessionUpdate::Disconnected))
} else {
// Update metrics
Some((peer_id, SessionUpdate::UpdateMetrics))
}
} else {
Some((peer_id, SessionUpdate::InvalidState))
}
}
ConnectionState::Idle => {
// Check if we should retry
if elapsed > timeout_config.discovery.server_reflexive_cache_ttl {
Some((peer_id, SessionUpdate::Retry))
} else {
None
}
}
ConnectionState::Migrating => {
// Check migration timeout
if elapsed > timeout_config.nat_traversal.probe_timeout {
Some((peer_id, SessionUpdate::MigrationTimeout))
} else {
None
}
}
ConnectionState::Closed => {
// Clean up old closed sessions
if elapsed > timeout_config.discovery.interface_cache_ttl {
Some((peer_id, SessionUpdate::Remove))
} else {
None
}
}
}
})
.collect();
// Apply updates using DashMap's lock-free .get_mut() and .remove()
for (peer_id, update) in sessions_to_update {
match update {
SessionUpdate::Timeout => {
if let Some(mut session) = sessions.get_mut(&peer_id) {
session.session_state.state = ConnectionState::Closed;
session.session_state.last_transition = std::time::Instant::now();
tracing::warn!("Connection to {:?} timed out", peer_id);
}
}
SessionUpdate::Disconnected => {
if let Some(mut session) = sessions.get_mut(&peer_id) {
session.session_state.state = ConnectionState::Closed;
session.session_state.last_transition = std::time::Instant::now();
session.session_state.connection = None;
tracing::info!("Connection to {:?} closed", peer_id);
}
}
SessionUpdate::UpdateMetrics => {
if let Some(mut session) = sessions.get_mut(&peer_id) {
if let Some(ref conn) = session.session_state.connection {
// Update RTT and other metrics
let stats = conn.stats();
session.session_state.metrics.rtt = Some(stats.path.rtt);
session.session_state.metrics.loss_rate =
stats.path.lost_packets as f64
/ stats.path.sent_packets.max(1) as f64;
}
}
}
SessionUpdate::InvalidState => {
if let Some(mut session) = sessions.get_mut(&peer_id) {
session.session_state.state = ConnectionState::Closed;
session.session_state.last_transition = std::time::Instant::now();
tracing::error!("Session {:?} in invalid state", peer_id);
}
}
SessionUpdate::Retry => {
if let Some(mut session) = sessions.get_mut(&peer_id) {
session.session_state.state = ConnectionState::Connecting;
session.session_state.last_transition = std::time::Instant::now();
session.attempt += 1;
tracing::info!(
"Retrying connection to {:?} (attempt {})",
peer_id,
session.attempt
);
}
}
SessionUpdate::MigrationTimeout => {
if let Some(mut session) = sessions.get_mut(&peer_id) {
session.session_state.state = ConnectionState::Closed;
session.session_state.last_transition = std::time::Instant::now();
tracing::warn!("Migration timeout for {:?}", peer_id);
}
}
SessionUpdate::Remove => {
sessions.remove(&peer_id);
tracing::debug!("Removed old session for {:?}", peer_id);
}
}
}
}
})
}
// OBSERVED_ADDRESS frames are now handled at the connection layer; manual injection removed
/// Get current NAT traversal statistics
pub fn set_local_peer_id(&mut self, peer_id: PeerId) {
self.local_peer_id = peer_id;
}
pub fn bootstrap_addresses(&self) -> Vec<SocketAddr> {
self.bootstrap_nodes
.read()
.iter()
.map(|n| n.address)
.collect()
}
pub fn bootstrap_address_for_peer(&self, peer_id: PeerId) -> Option<SocketAddr> {
self.successful_candidates
.get(&peer_id)
.map(|v| *v.value())
.or_else(|| self.connections.get(&peer_id).map(|c| c.remote_address()))
}
pub fn preferred_coordinator(&self) -> Option<SocketAddr> {
self.select_coordinator()
.or_else(|| self.bootstrap_addresses().into_iter().next())
}
pub fn record_bootstrap_direct_connection(
&self,
peer_id: PeerId,
addr: &SocketAddr,
_rtt: Option<Duration>,
) {
self.successful_candidates.insert(peer_id, *addr);
let _ = self.add_bootstrap_node(*addr);
}
pub fn add_local_external_candidate(
&self,
addr: SocketAddr,
) -> Result<bool, NatTraversalError> {
self.discovery_manager
.lock()
.accept_quic_discovered_address(self.local_peer_id, addr)
.map_err(|error| NatTraversalError::CandidateDiscoveryFailed(error.to_string()))
}
pub fn remove_local_external_candidate(&self, addr: SocketAddr) -> bool {
self.discovery_manager
.lock()
.remove_external_address(self.local_peer_id, addr)
}
pub async fn handle_coordinator_control_message(
&self,
from_peer_id: PeerId,
_connection: InnerConnection,
bytes: &[u8],
) -> Result<bool, NatTraversalError> {
let Some(envelope) = decode_coordinator_control(bytes).map_err(|e| {
NatTraversalError::ProtocolError(format!("coordinator control decode failed: {e}"))
})?
else {
return Ok(false);
};
match &envelope.message {
CoordinatorControlMessage::CoordinationRequest {
initiator,
target,
round,
initiator_addrs,
} => {
info!(
"coordinator control request request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
if *initiator != from_peer_id {
debug!(
"coordinator control request initiator_mismatch request_id={} from_peer={:?} initiator={:?}",
envelope.request_id, from_peer_id, initiator
);
return Ok(true);
}
let reject = |reason| CoordinatorControlEnvelope {
request_id: envelope.request_id,
expires_at_unix_ms: envelope.expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationRejected {
initiator: *initiator,
target: *target,
round: *round,
reason,
},
};
if *initiator == *target {
let _ = self
.send_coordinator_control_on_connection(
_connection.clone(),
reject(RejectionReason::SelfTarget),
)
.await;
return Ok(true);
}
if envelope.expires_at_unix_ms < now_unix_ms() {
let _ = self
.send_coordinator_control_on_connection(
_connection.clone(),
reject(RejectionReason::Expired),
)
.await;
return Ok(true);
}
if !note_rate_limit_and_check(self.local_peer_id(), from_peer_id) {
let _ = self
.send_coordinator_control_on_connection(
_connection.clone(),
reject(RejectionReason::RateLimited),
)
.await;
return Ok(true);
}
if initiator_addrs.is_empty() {
let _ = self
.send_coordinator_control_on_connection(
_connection.clone(),
reject(RejectionReason::InternalError),
)
.await;
return Ok(true);
}
let target_conn = match self.get_connection(target)? {
Some(c) => c,
None => {
let _ = self
.send_coordinator_control_on_connection(
_connection.clone(),
reject(RejectionReason::UnknownTarget),
)
.await;
return Ok(true);
}
};
let initiator_conn = _connection.clone();
let mut normalized_initiator_addrs = initiator_addrs
.iter()
.copied()
.map(normalize_socket_addr)
.collect::<Vec<_>>();
normalized_initiator_addrs.sort_unstable();
normalized_initiator_addrs.dedup();
let mut normalized_target_addrs =
vec![normalize_socket_addr(target_conn.remote_address())];
normalized_target_addrs.sort_unstable();
normalized_target_addrs.dedup();
if !normalized_initiator_addrs.is_empty() && !normalized_target_addrs.is_empty() {
for addr in normalized_target_addrs.iter().copied() {
if let Ok(sequence) = initiator_conn.send_nat_address_advertisement(addr, 0)
{
let _ =
initiator_conn.send_nat_punch_coordination(sequence, addr, *round);
}
}
for addr in normalized_initiator_addrs.iter().copied() {
if let Ok(sequence) = target_conn.send_nat_address_advertisement(addr, 0) {
let _ = target_conn.send_nat_punch_coordination(sequence, addr, *round);
}
}
let accepted = CoordinatorControlEnvelope {
request_id: envelope.request_id,
expires_at_unix_ms: envelope.expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationAccepted {
initiator: *initiator,
target: *target,
round: *round,
target_addrs: normalized_target_addrs.clone(),
},
};
if self
.send_coordinator_control_on_connection(
initiator_conn.clone(),
accepted.clone(),
)
.await
.is_ok()
{
let _ = self
.send_coordinator_control_on_connection(target_conn.clone(), accepted)
.await;
info!(
"coordinator control request fast-path handled request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
return Ok(true);
}
}
remember_pending_request(
envelope.request_id,
PendingRequest {
initiator: *initiator,
target: *target,
round: *round,
initiator_addrs: initiator_addrs.clone(),
expires_at_unix_ms: envelope.expires_at_unix_ms,
},
);
let offer = CoordinatorControlEnvelope {
request_id: envelope.request_id,
expires_at_unix_ms: envelope.expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationOffer {
initiator: *initiator,
target: *target,
round: *round,
initiator_addrs: initiator_addrs.clone(),
},
};
self.send_coordinator_control_on_connection(target_conn, offer)
.await?;
info!(
"coordinator control request handled request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
Ok(true)
}
CoordinatorControlMessage::CoordinationOffer {
initiator,
target,
round,
initiator_addrs,
} => {
info!(
"coordinator control offer request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
if *target != self.local_peer_id() {
debug!(
"coordinator control offer ignored wrong_target request_id={} local={:?} target={:?}",
envelope.request_id,
self.local_peer_id(),
target
);
return Ok(true);
}
if *initiator == *target {
debug!(
"coordinator control offer ignored self_target request_id={} initiator={:?} target={:?}",
envelope.request_id, initiator, target
);
return Ok(true);
}
if envelope.expires_at_unix_ms < now_unix_ms() {
debug!(
"coordinator control offer ignored expired request_id={} expires_at_unix_ms={}",
envelope.request_id, envelope.expires_at_unix_ms
);
return Ok(true);
}
if from_peer_id == *initiator {
debug!(
"coordinator control offer ignored coordinator_is_initiator request_id={} from_peer={:?} initiator={:?}",
envelope.request_id, from_peer_id, initiator
);
return Ok(true);
}
if initiator_addrs.is_empty() {
debug!(
"coordinator control offer ignored empty_initiator_addrs request_id={}",
envelope.request_id
);
return Ok(true);
}
remember_inbound_offer(
self.local_peer_id(),
envelope.request_id,
InboundOffer {
coordinator: from_peer_id,
initiator: *initiator,
target: *target,
request_id: envelope.request_id,
round: *round,
expires_at_unix_ms: envelope.expires_at_unix_ms,
},
);
let mut target_addrs = self
.get_all_observed_external_addresses()?
.into_iter()
.map(normalize_socket_addr)
.collect::<Vec<_>>();
if target_addrs.is_empty()
&& let Some(addr) = self.get_observed_external_address()?
{
target_addrs.push(normalize_socket_addr(addr));
}
if target_addrs.is_empty()
&& let Some(endpoint) = &self.inner_endpoint
{
if let Ok(addr) = endpoint.local_addr() {
target_addrs.push(normalize_socket_addr(addr));
}
}
target_addrs.sort_unstable();
target_addrs.dedup();
if target_addrs.is_empty() {
return Ok(true);
}
let ready = CoordinatorControlEnvelope {
request_id: envelope.request_id,
expires_at_unix_ms: envelope.expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationReady {
initiator: *initiator,
target: *target,
round: *round,
target_addrs,
},
};
self.send_coordinator_control_on_connection(_connection.clone(), ready)
.await?;
info!(
"coordinator control offer handled request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
Ok(true)
}
CoordinatorControlMessage::CoordinationReady {
initiator,
target,
round,
target_addrs,
} => {
info!(
"coordinator control ready request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
let pending = match get_pending_request(envelope.request_id) {
Some(p) => p,
None => return Ok(true),
};
if from_peer_id != pending.target {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
if *initiator != pending.initiator {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
if *target != pending.target {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
if *round != pending.round {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
if pending.expires_at_unix_ms < now_unix_ms() {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
if pending.initiator_addrs.is_empty() {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
if target_addrs.is_empty() {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
let mut normalized_initiator_addrs = pending.initiator_addrs.clone();
normalized_initiator_addrs = normalized_initiator_addrs
.into_iter()
.map(normalize_socket_addr)
.collect();
normalized_initiator_addrs.sort_unstable();
normalized_initiator_addrs.dedup();
let mut normalized_target_addrs = target_addrs.clone();
normalized_target_addrs = normalized_target_addrs
.into_iter()
.map(normalize_socket_addr)
.collect();
normalized_target_addrs.sort_unstable();
normalized_target_addrs.dedup();
if normalized_initiator_addrs.is_empty() || normalized_target_addrs.is_empty() {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
let initiator_conn = match self.get_connection(initiator)? {
Some(c) => c,
None => {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
};
let target_conn = match self.get_connection(target)? {
Some(c) => c,
None => {
let _ = remove_pending_request(envelope.request_id);
return Ok(true);
}
};
let _ = remove_pending_request(envelope.request_id);
for addr in normalized_target_addrs.iter().copied() {
if let Ok(sequence) = initiator_conn.send_nat_address_advertisement(addr, 0) {
let _ = initiator_conn.send_nat_punch_coordination(sequence, addr, *round);
}
}
for addr in normalized_initiator_addrs.iter().copied() {
if let Ok(sequence) = target_conn.send_nat_address_advertisement(addr, 0) {
let _ = target_conn.send_nat_punch_coordination(sequence, addr, *round);
}
}
let accepted = CoordinatorControlEnvelope {
request_id: envelope.request_id,
expires_at_unix_ms: envelope.expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationAccepted {
initiator: *initiator,
target: *target,
round: *round,
target_addrs: normalized_target_addrs,
},
};
self.send_coordinator_control_on_connection(
initiator_conn.clone(),
accepted.clone(),
)
.await?;
let _ = self
.send_coordinator_control_on_connection(target_conn.clone(), accepted)
.await;
info!(
"coordinator control ready handled request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
Ok(true)
}
CoordinatorControlMessage::CoordinationAccepted {
initiator,
target,
round,
target_addrs,
} => {
info!(
"coordinator control accepted request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
if *initiator == self.local_peer_id() {
let Some(live) = live_request(self.local_peer_id(), *target) else {
return Ok(true);
};
if live.request_id != envelope.request_id {
return Ok(true);
}
if live.round != *round {
return Ok(true);
}
if live.expires_at_unix_ms < now_unix_ms() {
return Ok(true);
}
if let Some(expected) = live.expected_coordinator
&& expected != from_peer_id
{
return Ok(true);
}
let mut normalized_target_addrs = target_addrs.clone();
normalized_target_addrs = normalized_target_addrs
.into_iter()
.map(normalize_socket_addr)
.collect();
normalized_target_addrs.sort_unstable();
normalized_target_addrs.dedup();
if let Some(mut entry) = self.active_sessions.get_mut(target) {
let session = entry.value_mut();
session.candidates.clear();
for addr in normalized_target_addrs.iter().copied() {
if let Ok(candidate) =
CandidateAddress::new(addr, 0, CandidateSource::Peer)
{
session.candidates.push(candidate);
}
}
if (session.phase as u8) < (TraversalPhase::Synchronization as u8) {
session.phase = TraversalPhase::Synchronization;
}
session.started_at = std::time::Instant::now();
session.session_state.last_transition = std::time::Instant::now();
}
self.incoming_notify.notify_waiters();
for addr in normalized_target_addrs.iter().copied() {
if self
.establish_connection_to_validated_candidate(*target, addr)
.await
.is_ok()
{
break;
}
}
info!(
"coordinator control accepted handled request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
return Ok(true);
} else if *target == self.local_peer_id() {
let Some(offer) = inbound_offer(self.local_peer_id(), envelope.request_id)
else {
return Ok(true);
};
if offer.initiator != *initiator {
return Ok(true);
}
if offer.target != *target {
return Ok(true);
}
if offer.round != *round {
return Ok(true);
}
if offer.expires_at_unix_ms < now_unix_ms() {
return Ok(true);
}
if offer.coordinator != from_peer_id {
return Ok(true);
}
let _ = remove_inbound_offer(self.local_peer_id(), envelope.request_id);
info!(
"coordinator control accepted handled inbound request_id={} from_peer={:?} initiator={:?} target={:?} round={}",
envelope.request_id, from_peer_id, initiator, target, round
);
}
Ok(true)
}
CoordinatorControlMessage::CoordinationRejected {
initiator,
target,
round,
reason,
} => {
info!(
"coordinator control rejected request_id={} from_peer={:?} initiator={:?} target={:?} round={} reason={:?}",
envelope.request_id, from_peer_id, initiator, target, round, reason
);
if *initiator == self.local_peer_id() {
let Some(live) = live_request(self.local_peer_id(), *target) else {
return Ok(true);
};
if live.request_id != envelope.request_id {
return Ok(true);
}
if live.round != *round {
return Ok(true);
}
if live.expires_at_unix_ms < now_unix_ms() {
return Ok(true);
}
if let Some(expected) = live.expected_coordinator
&& expected != from_peer_id
{
return Ok(true);
}
record_rejection(
self.local_peer_id(),
*target,
envelope.request_id,
*round,
Some(from_peer_id),
*reason,
);
self.incoming_notify.notify_waiters();
info!(
"coordinator control rejected handled request_id={} from_peer={:?} initiator={:?} target={:?} round={} reason={:?}",
envelope.request_id, from_peer_id, initiator, target, round, reason
);
return Ok(true);
} else if *target == self.local_peer_id() {
let Some(offer) = inbound_offer(self.local_peer_id(), envelope.request_id)
else {
return Ok(true);
};
if offer.initiator != *initiator {
return Ok(true);
}
if offer.target != *target {
return Ok(true);
}
if offer.round != *round {
return Ok(true);
}
if offer.expires_at_unix_ms < now_unix_ms() {
return Ok(true);
}
if offer.coordinator != from_peer_id {
return Ok(true);
}
let _ = remove_inbound_offer(self.local_peer_id(), envelope.request_id);
}
Ok(true)
}
}
}
#[allow(dead_code)]
async fn send_coordinator_control_on_connection(
&self,
connection: InnerConnection,
envelope: CoordinatorControlEnvelope,
) -> Result<(), NatTraversalError> {
let bytes = encode_coordinator_control(&envelope).map_err(|e| {
NatTraversalError::ProtocolError(format!("coordinator control encode failed: {e}"))
})?;
let mut stream = connection
.open_uni()
.await
.map_err(|e| NatTraversalError::CoordinationFailed(format!("{e}")))?;
stream
.write_all(&bytes)
.await
.map_err(|e| NatTraversalError::CoordinationFailed(format!("{e}")))?;
stream
.finish()
.map_err(|e| NatTraversalError::CoordinationFailed(format!("{e}")))?;
Ok(())
}
fn materialize_authenticated_connection(
connections: &dashmap::DashMap<PeerId, InnerConnection>,
connection: InnerConnection,
) -> Result<(PeerId, InnerConnection), NatTraversalError> {
let peer_id = Self::derive_peer_id_from_connection(&connection).ok_or_else(|| {
NatTraversalError::ProtocolError(
"authenticated QUIC connection did not expose a peer identity".to_string(),
)
})?;
if let Some(entry) = connections.get(&peer_id) {
if entry.is_alive() {
let existing = entry.value().clone();
drop(entry);
connection.close(0u32.into(), b"duplicate authenticated connection");
return Ok((peer_id, existing));
}
drop(entry);
let _ = connections.remove(&peer_id);
}
connections.insert(peer_id, connection.clone());
Ok((peer_id, connection))
}
fn send_coordination_request_v2(
&self,
peer_id: PeerId,
coordinator: SocketAddr,
) -> Result<(), NatTraversalError> {
let mut initiator_addrs = self
.get_all_observed_external_addresses()?
.into_iter()
.map(normalize_socket_addr)
.collect::<Vec<_>>();
if initiator_addrs.is_empty()
&& let Some(addr) = self.get_observed_external_address()?
{
initiator_addrs.push(normalize_socket_addr(addr));
}
if initiator_addrs.is_empty()
&& let Some(endpoint) = &self.inner_endpoint
{
if let Ok(addr) = endpoint.local_addr() {
initiator_addrs.push(normalize_socket_addr(addr));
}
}
initiator_addrs.sort_unstable();
initiator_addrs.dedup();
if initiator_addrs.is_empty() {
return Err(NatTraversalError::ConfigError(
"No initiator address available for coordination".to_string(),
));
}
let request_id = next_request_id();
let round = 1u32;
let expires_at_unix_ms = now_unix_ms().saturating_add(10_000);
let local_peer_id = self.local_peer_id();
let envelope = CoordinatorControlEnvelope {
request_id,
expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationRequest {
initiator: local_peer_id,
target: peer_id,
round,
initiator_addrs: initiator_addrs.clone(),
},
};
let normalized_coordinator = normalize_socket_addr(coordinator);
for entry in self.connections.iter() {
let coordinator_peer_id = *entry.key();
let conn = entry.value();
let normalized_remote = normalize_socket_addr(conn.remote_address());
if normalized_remote == normalized_coordinator {
remember_live_request(
local_peer_id,
peer_id,
LiveRequest {
request_id,
round,
expires_at_unix_ms,
expected_coordinator: Some(coordinator_peer_id),
},
);
let connection = conn.clone();
let envelope = envelope.clone();
tokio::spawn(async move {
let send_result: Result<(), ()> = async {
let bytes = encode_coordinator_control(&envelope).map_err(|_| ())?;
let mut stream = connection.open_uni().await.map_err(|_| ())?;
stream.write_all(&bytes).await.map_err(|_| ())?;
stream.finish().map_err(|_| ())?;
Ok(())
}
.await;
if send_result.is_err() {
record_rejection(
local_peer_id,
peer_id,
request_id,
round,
Some(coordinator_peer_id),
RejectionReason::InternalError,
);
}
});
return Ok(());
}
}
if let Some(endpoint) = &self.inner_endpoint {
let server_name = "localhost".to_string();
match endpoint.connect(coordinator, &server_name) {
Ok(connecting) => {
remember_live_request(
local_peer_id,
peer_id,
LiveRequest {
request_id,
round,
expires_at_unix_ms,
expected_coordinator: None,
},
);
let connections = self.connections.clone();
let low_level_endpoint = endpoint.clone();
let envelope = envelope.clone();
tokio::spawn(async move {
let connect_timeout = Duration::from_secs(10);
match timeout(connect_timeout, connecting).await {
Ok(Ok(connection)) => {
let (coordinator_peer_id, coordinator_connection) =
match Self::materialize_authenticated_connection(
connections.as_ref(),
connection,
) {
Ok(result) => result,
Err(error) => {
warn!(
"Failed to register coordinator {} with authenticated identity: {}",
coordinator, error
);
record_rejection(
local_peer_id,
peer_id,
request_id,
round,
None,
RejectionReason::InternalError,
);
return;
}
};
low_level_endpoint
.register_connection_peer_id(coordinator, coordinator_peer_id);
remember_live_request(
local_peer_id,
peer_id,
LiveRequest {
request_id,
round,
expires_at_unix_ms,
expected_coordinator: Some(coordinator_peer_id),
},
);
let send_result: Result<(), ()> = async {
let bytes =
encode_coordinator_control(&envelope).map_err(|_| ())?;
let mut stream =
coordinator_connection.open_uni().await.map_err(|_| ())?;
stream.write_all(&bytes).await.map_err(|_| ())?;
stream.finish().map_err(|_| ())?;
Ok(())
}
.await;
if send_result.is_err() {
record_rejection(
local_peer_id,
peer_id,
request_id,
round,
Some(coordinator_peer_id),
RejectionReason::InternalError,
);
}
}
Ok(Err(e)) => {
warn!("Failed to connect to coordinator {}: {:?}", coordinator, e);
record_rejection(
local_peer_id,
peer_id,
request_id,
round,
None,
RejectionReason::InternalError,
);
}
Err(_) => {
warn!("Timeout connecting to coordinator {}", coordinator);
record_rejection(
local_peer_id,
peer_id,
request_id,
round,
None,
RejectionReason::InternalError,
);
}
}
});
Ok(())
}
Err(e) => Err(NatTraversalError::CoordinationFailed(format!(
"Failed to initiate connection to coordinator: {:?}",
e
))),
}
} else {
Err(NatTraversalError::ConfigError(
"No endpoint available to connect to coordinator".to_string(),
))
}
}
pub async fn get_connection_by_authenticated_peer(
&self,
peer_id: PeerId,
) -> Option<InnerConnection> {
if let Some(conn) = self.get_connection(&peer_id).ok().flatten() {
return Some(conn);
}
let connections: Vec<_> = self
.connections
.iter()
.map(|entry| entry.value().clone())
.collect();
for conn in connections {
if self.extract_peer_id_from_connection(&conn).await == Some(peer_id) {
return Some(conn);
}
}
None
}
pub fn session_connection(&self, peer_id: PeerId) -> Option<InnerConnection> {
self.active_sessions
.get(&peer_id)
.and_then(|entry| entry.value().session_state.connection.clone())
}
pub fn get_statistics(&self) -> Result<NatTraversalStatistics, NatTraversalError> {
// DashMap provides lock-free .len() for session count
let session_count = self.active_sessions.len();
// parking_lot::RwLock doesn't poison
let bootstrap_nodes = self.bootstrap_nodes.read();
// Calculate average coordination time based on bootstrap node RTTs
let avg_coordination_time = {
let rtts: Vec<Duration> = bootstrap_nodes.iter().filter_map(|b| b.rtt).collect();
if rtts.is_empty() {
Duration::from_millis(500) // Default if no RTT data available
} else {
let total_millis: u64 = rtts.iter().map(|d| d.as_millis() as u64).sum();
Duration::from_millis(total_millis / rtts.len() as u64 * 2) // Multiply by 2 for round-trip coordination
}
};
Ok(NatTraversalStatistics {
active_sessions: session_count,
total_bootstrap_nodes: bootstrap_nodes.len(),
successful_coordinations: bootstrap_nodes.iter().map(|b| b.coordination_count).sum(),
average_coordination_time: avg_coordination_time,
total_attempts: 0,
successful_connections: 0,
direct_connections: 0,
relayed_connections: 0,
})
}
/// Add a new bootstrap node
pub fn add_bootstrap_node(&self, address: SocketAddr) -> Result<(), NatTraversalError> {
// parking_lot::RwLock doesn't poison
let mut bootstrap_nodes = self.bootstrap_nodes.write();
// Check if already exists
if !bootstrap_nodes
.iter()
.any(|b| normalize_socket_addr(b.address) == normalize_socket_addr(address))
{
bootstrap_nodes.push(BootstrapNode {
address,
last_seen: std::time::Instant::now(),
can_coordinate: true,
rtt: None,
coordination_count: 0,
});
info!("Added bootstrap node: {}", address);
}
Ok(())
}
/// Remove a bootstrap node
pub fn remove_bootstrap_node(&self, address: SocketAddr) -> Result<(), NatTraversalError> {
// parking_lot::RwLock doesn't poison
let mut bootstrap_nodes = self.bootstrap_nodes.write();
bootstrap_nodes.retain(|b| b.address != address);
info!("Removed bootstrap node: {}", address);
Ok(())
}
// Private implementation methods
/// Create a QUIC endpoint with NAT traversal configured (async version)
///
/// v0.13.0: role parameter removed - all nodes are symmetric P2P nodes.
async fn create_inner_endpoint(
config: &NatTraversalConfig,
token_store: Option<Arc<dyn crate::TokenStore>>,
transport_registry: &crate::transport::TransportRegistry,
quinn_socket: Option<std::net::UdpSocket>,
) -> Result<
(
InnerEndpoint,
mpsc::UnboundedSender<NatTraversalEvent>,
mpsc::UnboundedReceiver<NatTraversalEvent>,
SocketAddr,
Option<crate::ServerConfig>,
),
NatTraversalError,
> {
use std::sync::Arc;
// v0.13.0+: All nodes are symmetric P2P nodes - always create server config
let server_config = {
info!("Creating server config using Raw Public Keys (RFC 7250) for symmetric P2P node");
// Use provided identity key or generate a new one
// v0.13.0+: For consistent identity between TLS and application layers,
// P2pEndpoint should pass its auth keypair here via config.identity_key
let (server_pub_key, server_sec_key) = match config.identity_key.clone() {
Some(key) => {
debug!("Using provided identity key for TLS authentication");
key
}
None => {
debug!(
"No identity key provided - generating new keypair (identity mismatch warning)"
);
crate::crypto::raw_public_keys::key_utils::generate_ml_dsa_keypair().map_err(
|e| {
NatTraversalError::ConfigError(format!(
"ML-DSA-65 keygen failed: {e:?}"
))
},
)?
}
};
// Build RFC 7250 server config with Raw Public Keys (ML-DSA-65)
let mut rpk_builder = RawPublicKeyConfigBuilder::new()
.with_server_key(server_pub_key, server_sec_key)
.allow_any_key(); // P2P network - accept any valid ML-DSA-65 key
if let Some(ref pqc) = config.pqc {
rpk_builder = rpk_builder.with_pqc(pqc.clone());
}
let rpk_config = rpk_builder.build_rfc7250_server_config().map_err(|e| {
NatTraversalError::ConfigError(format!("RPK server config failed: {e}"))
})?;
let server_crypto = QuicServerConfig::try_from(rpk_config.inner().as_ref().clone())
.map_err(|e| NatTraversalError::ConfigError(e.to_string()))?;
let mut server_config = ServerConfig::with_crypto(Arc::new(server_crypto));
// Configure transport parameters for NAT traversal
let mut transport_config = TransportConfig::default();
transport_config.enable_address_discovery(true);
transport_config
.keep_alive_interval(Some(config.timeouts.nat_traversal.retry_interval));
transport_config.max_idle_timeout(Some(crate::VarInt::from_u32(30000).into()));
transport_config.max_concurrent_uni_streams(
crate::VarInt::from_u32(config.max_concurrent_uni_streams).into(),
);
// QUIC flow-control windows (stream_receive_window, send_window) use
// TransportConfig defaults — calculated from bandwidth-delay products.
// max_message_size is a read-side guard only, not a flow-control knob.
// v0.13.0+: All nodes use ServerSupport for full P2P capabilities
// Per draft-seemann-quic-nat-traversal-02, all nodes can coordinate
let nat_config = crate::transport_parameters::NatTraversalConfig::ServerSupport {
concurrency_limit: VarInt::from_u32(config.max_concurrent_attempts as u32),
};
transport_config.nat_traversal_config(Some(nat_config));
server_config.transport_config(Arc::new(transport_config));
Some(server_config)
};
// Create client config for outgoing connections
let client_config = {
info!("Creating client config using Raw Public Keys (RFC 7250)");
// v0.13.0+: For symmetric P2P identity, client MUST also present its key
// This allows servers to derive our peer ID from TLS, not from address
let (client_pub_key, client_sec_key) = match config.identity_key.clone() {
Some(key) => {
debug!("Using provided identity key for client TLS authentication");
key
}
None => {
debug!("No identity key provided for client - generating new keypair");
crate::crypto::raw_public_keys::key_utils::generate_ml_dsa_keypair().map_err(
|e| {
NatTraversalError::ConfigError(format!(
"ML-DSA-65 keygen failed: {e:?}"
))
},
)?
}
};
// Build RFC 7250 client config with Raw Public Keys (ML-DSA-65)
// v0.13.0+: Client presents its own key for mutual authentication
let mut rpk_builder = RawPublicKeyConfigBuilder::new()
.with_client_key(client_pub_key, client_sec_key) // Present our identity to servers
.allow_any_key(); // P2P network - accept any valid ML-DSA-65 key
if let Some(ref pqc) = config.pqc {
rpk_builder = rpk_builder.with_pqc(pqc.clone());
}
let rpk_config = rpk_builder.build_rfc7250_client_config().map_err(|e| {
NatTraversalError::ConfigError(format!("RPK client config failed: {e}"))
})?;
let client_crypto = QuicClientConfig::try_from(rpk_config.inner().as_ref().clone())
.map_err(|e| NatTraversalError::ConfigError(e.to_string()))?;
let mut client_config = ClientConfig::new(Arc::new(client_crypto));
// Set token store if provided
if let Some(store) = token_store {
client_config.token_store(store);
}
// Configure transport parameters for NAT traversal
let mut transport_config = TransportConfig::default();
transport_config.enable_address_discovery(true);
transport_config.keep_alive_interval(Some(Duration::from_secs(5)));
transport_config.max_idle_timeout(Some(crate::VarInt::from_u32(30000).into()));
transport_config.max_concurrent_uni_streams(
crate::VarInt::from_u32(config.max_concurrent_uni_streams).into(),
);
// QUIC flow-control windows (stream_receive_window, send_window) use
// TransportConfig defaults — calculated from bandwidth-delay products.
// max_message_size is a read-side guard only, not a flow-control knob.
// v0.13.0+: All nodes use ServerSupport for full P2P capabilities
// Per draft-seemann-quic-nat-traversal-02, all nodes can coordinate
let nat_config = crate::transport_parameters::NatTraversalConfig::ServerSupport {
concurrency_limit: VarInt::from_u32(config.max_concurrent_attempts as u32),
};
transport_config.nat_traversal_config(Some(nat_config));
client_config.transport_config(Arc::new(transport_config));
client_config
};
// Get UDP socket for Quinn endpoint
// Priority: 1) quinn_socket parameter, 2) transport registry address, 3) create new
let std_socket = if let Some(socket) = quinn_socket {
// Use pre-bound socket (preferred for socket sharing with transport registry)
let socket_addr = socket
.local_addr()
.map(|addr| addr.to_string())
.unwrap_or_else(|_| "unknown".to_string());
info!("Using pre-bound UDP socket at {}", socket_addr);
socket
} else if let Some(registry_addr) = transport_registry.get_udp_local_addr() {
// Transport registry has UDP - bind new socket on same interface
// Note: We can't share the registry's socket directly because:
// 1. It's wrapped in Arc<UdpSocket> which we can't unwrap
// 2. Both Quinn and transport would try to recv, causing races
// Instead, bind to same IP with random port for consistency
info!(
"Transport registry has UDP at {}, creating Quinn socket on same interface",
registry_addr
);
let new_addr = std::net::SocketAddr::new(registry_addr.ip(), 0);
let socket = UdpSocket::bind(new_addr).await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to bind UDP socket: {e}"))
})?;
socket.into_std().map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to convert socket: {e}"))
})?
} else {
// No transport registry UDP - create new socket
// Use config.bind_addr if provided, otherwise random port
let bind_addr = config
.bind_addr
.unwrap_or_else(create_random_port_bind_addr);
info!(
"No UDP transport in registry, binding new endpoint to {}",
bind_addr
);
let socket = UdpSocket::bind(bind_addr).await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to bind UDP socket: {e}"))
})?;
socket.into_std().map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to convert socket: {e}"))
})?
};
// Create QUIC endpoint
let runtime = default_runtime().ok_or_else(|| {
NatTraversalError::ConfigError("No compatible async runtime found".to_string())
})?;
// Clone server config for potential secondary endpoint (relay accept)
let server_config_for_relay = server_config.clone();
let mut endpoint = InnerEndpoint::new(
EndpointConfig::default(),
server_config,
std_socket,
runtime,
)
.map_err(|e| {
NatTraversalError::ConfigError(format!("Failed to create QUIC endpoint: {e}"))
})?;
// Set default client config
endpoint.set_default_client_config(client_config);
// Get the actual bound address
let local_addr = endpoint.local_addr().map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to get local address: {e}"))
})?;
info!("Endpoint bound to actual address: {}", local_addr);
// Create event channel
let (event_tx, event_rx) = mpsc::unbounded_channel();
Ok((
endpoint,
event_tx,
event_rx,
local_addr,
server_config_for_relay,
))
}
/// Create the inner QUIC endpoint using a pre-built abstract socket.
///
/// This variant accepts an `Arc<dyn AsyncUdpSocket>` (e.g. a `DualStackSocket`)
/// instead of a raw std socket, allowing custom socket implementations.
async fn create_inner_endpoint_with_abstract_socket(
config: &NatTraversalConfig,
token_store: Option<Arc<dyn crate::TokenStore>>,
abstract_socket: Arc<dyn crate::high_level::runtime::AsyncUdpSocket>,
) -> Result<
(
InnerEndpoint,
mpsc::UnboundedSender<NatTraversalEvent>,
mpsc::UnboundedReceiver<NatTraversalEvent>,
SocketAddr,
),
NatTraversalError,
> {
use std::sync::Arc;
// Build crypto configs (identical to create_inner_endpoint)
let server_config = {
let (server_pub_key, server_sec_key) = match config.identity_key.clone() {
Some(key) => key,
None => crate::crypto::raw_public_keys::key_utils::generate_ml_dsa_keypair()
.map_err(|e| {
NatTraversalError::ConfigError(format!("ML-DSA-65 keygen failed: {e:?}"))
})?,
};
let mut rpk_builder = RawPublicKeyConfigBuilder::new()
.with_server_key(server_pub_key, server_sec_key)
.allow_any_key();
if let Some(ref pqc) = config.pqc {
rpk_builder = rpk_builder.with_pqc(pqc.clone());
}
let rpk_config = rpk_builder.build_rfc7250_server_config().map_err(|e| {
NatTraversalError::ConfigError(format!("RPK server config failed: {e}"))
})?;
let server_crypto = QuicServerConfig::try_from(rpk_config.inner().as_ref().clone())
.map_err(|e| NatTraversalError::ConfigError(e.to_string()))?;
let mut server_config = ServerConfig::with_crypto(Arc::new(server_crypto));
let mut transport_config = TransportConfig::default();
transport_config.enable_address_discovery(true);
transport_config
.keep_alive_interval(Some(config.timeouts.nat_traversal.retry_interval));
transport_config.max_idle_timeout(Some(crate::VarInt::from_u32(30000).into()));
transport_config.max_concurrent_uni_streams(
crate::VarInt::from_u32(config.max_concurrent_uni_streams).into(),
);
let nat_config = crate::transport_parameters::NatTraversalConfig::ServerSupport {
concurrency_limit: VarInt::from_u32(config.max_concurrent_attempts as u32),
};
transport_config.nat_traversal_config(Some(nat_config));
server_config.transport_config(Arc::new(transport_config));
Some(server_config)
};
let client_config = {
let (client_pub_key, client_sec_key) = match config.identity_key.clone() {
Some(key) => key,
None => crate::crypto::raw_public_keys::key_utils::generate_ml_dsa_keypair()
.map_err(|e| {
NatTraversalError::ConfigError(format!("ML-DSA-65 keygen failed: {e:?}"))
})?,
};
let mut rpk_builder = RawPublicKeyConfigBuilder::new()
.with_client_key(client_pub_key, client_sec_key)
.allow_any_key();
if let Some(ref pqc) = config.pqc {
rpk_builder = rpk_builder.with_pqc(pqc.clone());
}
let rpk_config = rpk_builder.build_rfc7250_client_config().map_err(|e| {
NatTraversalError::ConfigError(format!("RPK client config failed: {e}"))
})?;
let client_crypto = QuicClientConfig::try_from(rpk_config.inner().as_ref().clone())
.map_err(|e| NatTraversalError::ConfigError(e.to_string()))?;
let mut client_config = ClientConfig::new(Arc::new(client_crypto));
if let Some(store) = token_store {
client_config.token_store(store);
}
let mut transport_config = TransportConfig::default();
transport_config.enable_address_discovery(true);
transport_config.keep_alive_interval(Some(Duration::from_secs(5)));
transport_config.max_idle_timeout(Some(crate::VarInt::from_u32(30000).into()));
transport_config.max_concurrent_uni_streams(
crate::VarInt::from_u32(config.max_concurrent_uni_streams).into(),
);
let nat_config = crate::transport_parameters::NatTraversalConfig::ServerSupport {
concurrency_limit: VarInt::from_u32(config.max_concurrent_attempts as u32),
};
transport_config.nat_traversal_config(Some(nat_config));
client_config.transport_config(Arc::new(transport_config));
client_config
};
// Create QUIC endpoint with abstract socket
let runtime = default_runtime().ok_or_else(|| {
NatTraversalError::ConfigError("No compatible async runtime found".to_string())
})?;
let mut endpoint = InnerEndpoint::new_with_abstract_socket(
EndpointConfig::default(),
server_config,
abstract_socket,
runtime,
)
.map_err(|e| {
NatTraversalError::ConfigError(format!("Failed to create QUIC endpoint: {e}"))
})?;
endpoint.set_default_client_config(client_config);
let local_addr = endpoint.local_addr().map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to get local address: {e}"))
})?;
info!("Endpoint bound to actual address: {}", local_addr);
let (event_tx, event_rx) = mpsc::unbounded_channel();
Ok((endpoint, event_tx, event_rx, local_addr))
}
/// Start listening for incoming connections (async version)
#[allow(clippy::panic)]
pub async fn start_listening(&self, bind_addr: SocketAddr) -> Result<(), NatTraversalError> {
let endpoint = self.inner_endpoint.as_ref().ok_or_else(|| {
NatTraversalError::ConfigError("QUIC endpoint not initialized".to_string())
})?;
// Rebind the endpoint to the specified address
let _socket = UdpSocket::bind(bind_addr).await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to bind to {bind_addr}: {e}"))
})?;
info!("Started listening on {}", bind_addr);
// Start accepting connections in a background task
let endpoint_clone = endpoint.clone();
let shutdown_clone = self.shutdown.clone();
let event_tx = match self.event_tx.as_ref() {
Some(tx) => tx.clone(),
None => {
return Err(NatTraversalError::ProtocolError(
"Event transmitter not initialized - endpoint may not have been properly constructed".to_string(),
));
}
};
let connections_clone = self.connections.clone();
let emitted_events_clone = self.emitted_established_events.clone();
let relay_server_clone = self.relay_server.clone();
let incoming_notify_clone = self.incoming_notify.clone();
tokio::spawn(async move {
Self::accept_connections(
endpoint_clone,
shutdown_clone,
event_tx,
connections_clone,
emitted_events_clone,
relay_server_clone,
incoming_notify_clone,
)
.await;
});
Ok(())
}
/// Accept incoming connections
async fn accept_connections(
endpoint: InnerEndpoint,
shutdown: Arc<AtomicBool>,
event_tx: mpsc::UnboundedSender<NatTraversalEvent>,
connections: Arc<dashmap::DashMap<PeerId, InnerConnection>>,
emitted_events: Arc<dashmap::DashSet<PeerId>>,
relay_server: Option<Arc<MasqueRelayServer>>,
incoming_notify: Arc<tokio::sync::Notify>,
) {
while !shutdown.load(Ordering::Relaxed) {
match endpoint.accept().await {
Some(connecting) => {
let event_tx = event_tx.clone();
let connections = connections.clone();
let emitted_events = emitted_events.clone();
let relay_server = relay_server.clone();
let incoming_notify = incoming_notify.clone();
tokio::spawn(async move {
match connecting.await {
Ok(connection) => {
info!("Accepted connection from {}", connection.remote_address());
// Prefer peer ID from the authenticated public key when available.
let peer_id = Self::derive_peer_id_from_connection(&connection)
.unwrap_or_else(|| {
Self::generate_peer_id_from_address(
connection.remote_address(),
)
});
// Store the connection
// DashMap provides fine-grained locking internally - no blocking
connections.insert(peer_id, connection.clone());
// Only emit ConnectionEstablished if we haven't already for this peer
// DashSet::insert returns true if the value was newly inserted
let should_emit = emitted_events.insert(peer_id);
if should_emit {
// Background accept = they connected to us = Server side
let _ =
event_tx.send(NatTraversalEvent::ConnectionEstablished {
peer_id,
remote_address: connection.remote_address(),
side: Side::Server,
});
incoming_notify.notify_one();
}
// Symmetric P2P: Spawn relay request handler for this connection
// This allows any connected peer to use us as a relay
if let Some(ref server) = relay_server {
let conn_clone = connection.clone();
let server_clone = Arc::clone(server);
tokio::spawn(async move {
Self::handle_relay_requests(conn_clone, server_clone).await;
});
}
// Handle connection streams
Self::handle_connection(peer_id, connection, event_tx).await;
}
Err(e) => {
debug!("Connection failed: {}", e);
}
}
});
}
None => {
// Endpoint closed
break;
}
}
}
}
/// Handle relay requests from a connected peer (symmetric P2P)
///
/// This listens for bidirectional streams and processes CONNECT-UDP Bind requests.
/// Per ADR-004: All nodes are equal and participate in relaying with resource budgets.
async fn handle_relay_requests(
connection: InnerConnection,
relay_server: Arc<MasqueRelayServer>,
) {
let client_addr = connection.remote_address();
debug!("Started relay request handler for peer at {}", client_addr);
loop {
// Accept bidirectional streams for relay requests
match connection.accept_bi().await {
Ok((mut send_stream, mut recv_stream)) => {
let server = Arc::clone(&relay_server);
let addr = client_addr;
let _conn_for_relay = connection.clone();
tokio::spawn(async move {
// Read length-prefixed request
let mut req_len_buf = [0u8; 4];
if let Err(e) = recv_stream.read_exact(&mut req_len_buf).await {
debug!("Failed to read relay request length from {}: {}", addr, e);
return;
}
let req_len = u32::from_be_bytes(req_len_buf) as usize;
if req_len > 1024 {
debug!("Relay request too large from {}: {} bytes", addr, req_len);
return;
}
let mut request_bytes = vec![0u8; req_len];
if let Err(e) = recv_stream.read_exact(&mut request_bytes).await {
debug!("Failed to read relay request from {}: {}", addr, e);
return;
}
{
{
// Try to parse as CONNECT-UDP request
match ConnectUdpRequest::decode(&mut bytes::Bytes::from(
request_bytes,
)) {
Ok(request) => {
debug!(
"Received CONNECT-UDP request from {}: {:?}",
addr, request
);
// Handle the request via relay server
match server.handle_connect_request(&request, addr).await {
Ok(response) => {
let is_success = response.is_success();
debug!(
"Sending CONNECT-UDP response to {}: {:?}",
addr, response
);
// Send response with length prefix (stream stays open for data)
let response_bytes = response.encode();
let len = response_bytes.len() as u32;
if let Err(e) =
send_stream.write_all(&len.to_be_bytes()).await
{
warn!(
"Failed to send relay response length to {}: {}",
addr, e
);
return;
}
if let Err(e) =
send_stream.write_all(&response_bytes).await
{
warn!(
"Failed to send relay response to {}: {}",
addr, e
);
return;
}
// Do NOT call finish() — stream stays open for forwarding
// Start stream-based forwarding loop
if is_success {
if let Some(session_info) =
server.get_session_for_client(addr).await
{
info!(
"Starting stream-based relay forwarding for session {} (client: {})",
session_info.session_id, addr
);
server
.run_stream_forwarding_loop(
session_info.session_id,
send_stream,
recv_stream,
)
.await;
}
}
}
Err(e) => {
warn!(
"Failed to handle relay request from {}: {}",
addr, e
);
// Send error response
let response = ConnectUdpResponse::error(
500,
format!("Internal error: {}", e),
);
let _ =
send_stream.write_all(&response.encode()).await;
let _ = send_stream.finish();
}
}
}
Err(e) => {
// Not a CONNECT-UDP request, ignore
debug!(
"Stream from {} is not a CONNECT-UDP request: {}",
addr, e
);
}
}
}
}
});
}
Err(e) => {
// Connection closed or error
debug!(
"Relay handler stopping for {} - accept_bi error: {}",
client_addr, e
);
break;
}
}
}
}
/// Poll discovery manager in background
async fn poll_discovery(
discovery_manager: Arc<ParkingMutex<CandidateDiscoveryManager>>,
shutdown: Arc<AtomicBool>,
event_tx: mpsc::UnboundedSender<NatTraversalEvent>,
connections: Arc<dashmap::DashMap<PeerId, InnerConnection>>,
event_callback: Option<Arc<dyn Fn(NatTraversalEvent) + Send + Sync>>,
local_peer_id: PeerId,
relay_setup_attempted: Arc<std::sync::atomic::AtomicBool>,
) {
use tokio::time::{Duration, interval};
let mut poll_interval = interval(Duration::from_secs(1));
let mut emitted_discovery = std::collections::HashSet::new();
// Track addresses we've already advertised to avoid spamming
let mut advertised_addresses = std::collections::HashSet::new();
while !shutdown.load(Ordering::Relaxed) {
poll_interval.tick().await;
// Collect newly discovered addresses (need to do in two passes due to borrow rules)
let mut new_addresses = Vec::new();
// 1. Check active connections for observed addresses and feed them to discovery
// DashMap allows concurrent iteration without blocking
tracing::trace!(
"poll_discovery_task: checking {} connections for observed addresses",
connections.len()
);
for entry in connections.iter() {
let peer_id = entry.key();
let conn = entry.value();
let observed = conn.observed_address();
tracing::trace!(
"poll_discovery_task: peer {:?} at {} observed_address={:?}",
peer_id,
conn.remote_address(),
observed
);
if let Some(observed_addr) = observed {
// Emit event if this is the first time this peer reported this address
if emitted_discovery.insert((*peer_id, observed_addr)) {
info!(
"poll_discovery_task: FOUND external address {} from peer {:?}",
observed_addr, peer_id
);
let event = NatTraversalEvent::ExternalAddressDiscovered {
reported_by: conn.remote_address(),
address: observed_addr,
};
// Send via channel (for poll() to drain)
let _ = event_tx.send(event.clone());
// Also invoke callback directly (critical for P2pEndpoint bridge)
if let Some(ref callback) = event_callback {
info!(
"poll_discovery_task: invoking event_callback for ExternalAddressDiscovered"
);
callback(event);
}
// Track this address for ADD_ADDRESS advertisement
if advertised_addresses.insert(observed_addr) {
new_addresses.push(observed_addr);
}
}
// Feed the observed address to discovery manager for OUR local peer
// (OBSERVED_ADDRESS tells us our external address as seen by the remote peer)
// parking_lot::Mutex doesn't poison - always succeeds
let mut discovery = discovery_manager.lock();
let _ = discovery.accept_quic_discovered_address(local_peer_id, observed_addr);
}
}
// 2. Send ADD_ADDRESS to all peers for newly discovered addresses
// (Critical for CGNAT - peers need to know our external address to hole-punch back)
// Skip if relay is active — only the relay address should be advertised.
if !relay_setup_attempted.load(std::sync::atomic::Ordering::Relaxed) {
for addr in &new_addresses {
broadcast_address_to_peers(&connections, *addr, 100);
}
}
// 3. Poll the discovery manager
// parking_lot::Mutex doesn't poison - always succeeds
let events = discovery_manager.lock().poll(std::time::Instant::now());
// Process discovery events
// Events that only need logging use the Display implementation.
// Events requiring action are handled explicitly.
for event in events {
match &event {
DiscoveryEvent::ServerReflexiveCandidateDiscovered {
candidate,
bootstrap_node,
} => {
debug!("{}", event);
// Notify that our external address was discovered
let _ = event_tx.send(NatTraversalEvent::ExternalAddressDiscovered {
reported_by: *bootstrap_node,
address: candidate.address,
});
// Send ADD_ADDRESS frame to all connected peers so they know
// how to reach us (critical for CGNAT hole punching)
broadcast_address_to_peers(
&connections,
candidate.address,
candidate.priority,
);
}
DiscoveryEvent::DiscoveryCompleted { .. } => {
// Use info! level for successful completion
info!("{}", event);
}
DiscoveryEvent::DiscoveryFailed { .. } => {
// Use warn! level for failures
// Note: We don't send a TraversalFailed event here because:
// 1. This is general discovery, not for a specific peer
// 2. We might have partial results that are still usable
// 3. The actual NAT traversal attempt will handle failure if needed
warn!("{}", event);
}
// All other events only need logging at debug level
_ => {
debug!("{}", event);
}
}
}
}
info!("Discovery polling task shutting down");
}
/// Handle an established connection
async fn handle_connection(
peer_id: PeerId,
connection: InnerConnection,
event_tx: mpsc::UnboundedSender<NatTraversalEvent>,
) {
let remote_address = connection.remote_address();
let closed = connection.closed();
tokio::pin!(closed);
debug!(
"Handling connection from peer {:?} at {}",
peer_id, remote_address
);
// Monitor for connection closure only
// Application data streams are handled by the application layer (QuicP2PNode)
// not by this background task to avoid race conditions
closed.await;
let reason = connection
.close_reason()
.map(|reason| format!("Connection closed: {reason}"))
.unwrap_or_else(|| "Connection closed".to_string());
let _ = event_tx.send(NatTraversalEvent::ConnectionLost { peer_id, reason });
}
/// Connect to a peer using NAT traversal
pub async fn connect_to_peer(
&self,
peer_id: PeerId,
server_name: &str,
remote_addr: SocketAddr,
) -> Result<InnerConnection, NatTraversalError> {
let endpoint = self.inner_endpoint.as_ref().ok_or_else(|| {
NatTraversalError::ConfigError("QUIC endpoint not initialized".to_string())
})?;
info!("Connecting to peer {:?} at {}", peer_id, remote_addr);
// Attempt connection with timeout
let connecting = endpoint.connect(remote_addr, server_name).map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Failed to initiate connection: {e}"))
})?;
let connection = timeout(
self.timeout_config
.nat_traversal
.connection_establishment_timeout,
connecting,
)
.await
.map_err(|_| NatTraversalError::Timeout)?
.map_err(|e| NatTraversalError::ConnectionFailed(format!("Connection failed: {e}")))?;
info!(
"Successfully connected to peer {:?} at {}",
peer_id, remote_addr
);
// Send event notification (we initiated = Client side)
if let Some(ref event_tx) = self.event_tx {
let _ = event_tx.send(NatTraversalEvent::ConnectionEstablished {
peer_id,
remote_address: remote_addr,
side: Side::Client,
});
self.incoming_notify.notify_one();
}
Ok(connection)
}
/// Attempt connection with automatic fallback strategies
///
/// Connection attempts follow this priority order:
/// 1. **Direct connection** - simple QUIC connect to the target address
/// 2. **Hole punching** - coordinated NAT traversal with candidate discovery
/// 3. **Relay** - last resort via MASQUE through connected peers (symmetric P2P)
///
/// # Symmetric P2P Relay Strategy
/// When relay is needed:
/// - First try connected peers as relays (any peer can relay)
/// - Fall back to configured relay_nodes (for bootstrap scenarios only)
pub async fn connect_with_fallback(
&self,
peer_id: PeerId,
server_name: &str,
remote_addr: SocketAddr,
) -> Result<InnerConnection, NatTraversalError> {
// Step 1: Try direct connection first
info!(
"Attempting direct connection to {:?} at {}",
peer_id, remote_addr
);
match self
.connect_to_peer(peer_id, server_name, remote_addr)
.await
{
Ok(conn) => {
info!("Direct connection to {:?} succeeded", peer_id);
return Ok(conn);
}
Err(e) => {
info!(
"Direct connection to {:?} failed ({:?}), trying hole punching",
peer_id, e
);
}
}
// Step 2: Try hole punching (coordinated NAT traversal)
info!("Attempting hole punching for {:?}", peer_id);
match self.attempt_hole_punching(peer_id) {
Ok(()) => {
// Hole punching succeeded - NAT mappings are established
// Now try to connect again using the discovered path
info!(
"Hole punching succeeded for {:?}, retrying connection",
peer_id
);
// Get the successful candidate pair address if available
let connect_addr = self
.get_successful_candidate_address(peer_id)
.unwrap_or(remote_addr);
match self
.connect_to_peer(peer_id, server_name, connect_addr)
.await
{
Ok(conn) => {
info!("Connection via hole punching to {:?} succeeded", peer_id);
return Ok(conn);
}
Err(e) => {
info!(
"Connection after hole punching failed ({:?}), trying relay",
e
);
}
}
}
Err(e) => {
info!(
"Hole punching for {:?} failed ({:?}), trying relay",
peer_id, e
);
}
}
// Step 3: Relay is the last resort
info!("Attempting relay connection to {:?} (last resort)", peer_id);
// Symmetric P2P: Collect connected peers to use as potential relays
// Any connected peer can provide relay services
// DashMap provides lock-free concurrent access
let connected_peers: Vec<SocketAddr> = self
.connections
.iter()
.filter(|entry| entry.value().close_reason().is_none()) // Only active connections
.map(|entry| entry.value().remote_address())
.filter(|addr| *addr != remote_addr) // Don't try to relay through the target
.collect();
info!(
"Found {} connected peers to try as relays",
connected_peers.len()
);
// Also add configured relay nodes as fallback (for bootstrapping)
let mut relay_candidates: Vec<SocketAddr> = connected_peers;
if let Some(ref manager) = self.relay_manager {
let configured_relays = manager.available_relays().await;
for relay in configured_relays {
if !relay_candidates.contains(&relay) {
relay_candidates.push(relay);
}
}
}
if relay_candidates.is_empty() {
return Err(NatTraversalError::ConnectionFailed(
"No connected peers or relay nodes available".to_string(),
));
}
// Try each relay in order
let mut last_error = None;
for relay_addr in relay_candidates {
info!("Attempting connection via relay: {}", relay_addr);
// Establish relay session (CONNECT-UDP Bind)
match self.establish_relay_session(relay_addr).await {
Ok(public_addr) => {
info!(
"Relay session established via {} with public address {:?}",
relay_addr, public_addr
);
// Now attempt the connection through the relay
// The relay session is stored and the connection can use datagram forwarding
// For now, we attempt a direct connection to the peer using our relay public address
// The peer should be able to reach us through the relay
// Try connecting to the peer - the relay will forward our traffic
match self
.connect_to_peer(peer_id, server_name, remote_addr)
.await
{
Ok(conn) => {
info!(
"Connected to peer {:?} via relay {} (public addr: {:?})",
peer_id, relay_addr, public_addr
);
return Ok(conn);
}
Err(e) => {
warn!(
"Connection via relay {} failed: {:?}, trying next relay",
relay_addr, e
);
last_error = Some(e);
}
}
}
Err(e) => {
warn!(
"Failed to establish relay session with {}: {:?}",
relay_addr, e
);
last_error = Some(e);
}
}
}
Err(last_error.unwrap_or_else(|| {
NatTraversalError::ConnectionFailed("All relay attempts failed".to_string())
}))
}
/// Get the relay manager for advanced relay operations
///
/// Returns None if no relay nodes are configured (connected peers are still
/// eligible for relay fallback).
pub fn relay_manager(&self) -> Option<Arc<RelayManager>> {
self.relay_manager.clone()
}
/// Get the relay public address, if a proactive relay has been established.
pub fn relay_public_addr(&self) -> Option<SocketAddr> {
self.relay_public_addr.lock().ok().and_then(|g| *g)
}
/// Check if the proactive relay session is still alive. Returns true if
/// no relay was established (nothing to monitor) or the relay is healthy.
/// Returns false if a relay was established but the underlying QUIC
/// connection has closed.
pub fn is_relay_healthy(&self) -> bool {
let relay_addr = match self.relay_public_addr.lock().ok().and_then(|g| *g) {
Some(addr) => addr,
None => return true, // No relay — nothing to monitor
};
// Check if any relay session is still active
for entry in self.relay_sessions.iter() {
if entry.value().is_active() {
return true;
}
}
// All relay sessions are dead
warn!(
"Relay session for {} is dead — resetting for re-establishment",
relay_addr
);
false
}
/// Reset relay state so the next poll cycle can re-establish. Called when
/// the relay session is detected as dead.
pub fn reset_relay_state(&self) {
self.relay_setup_attempted
.store(false, std::sync::atomic::Ordering::Relaxed);
if let Ok(mut addr) = self.relay_public_addr.lock() {
*addr = None;
}
if let Ok(mut peers) = self.relay_advertised_peers.lock() {
peers.clear();
}
// Remove dead sessions
self.relay_sessions.retain(|_, session| session.is_active());
info!("Relay state reset — will re-establish on next poll cycle");
}
/// Check if relay fallback is available
pub async fn has_relay_fallback(&self) -> bool {
match &self.relay_manager {
Some(manager) => manager.has_available_relay().await,
None => false,
}
}
/// Establish a relay session with a MASQUE relay server
///
/// This connects to the relay server, sends a CONNECT-UDP Bind request,
/// and stores the session for use in relayed connections.
///
/// # Arguments
/// * `relay_addr` - Address of the MASQUE relay server
///
/// # Returns
/// The public address allocated by the relay, or an error
pub async fn establish_relay_session(
&self,
relay_addr: SocketAddr,
) -> Result<
(
Option<SocketAddr>,
Option<Arc<crate::masque::MasqueRelaySocket>>,
),
NatTraversalError,
> {
// Normalize to prevent IPv4 vs IPv4-mapped-IPv6 key mismatches
let relay_addr = crate::shared::normalize_socket_addr(relay_addr);
// Check if we already have an active session to this relay
// DashMap provides lock-free .get() that returns Option<Ref<K, V>>
if let Some(session) = self.relay_sessions.get(&relay_addr) {
if session.is_active() {
debug!("Reusing existing relay session to {}", relay_addr);
return Ok((session.public_address, None));
}
}
info!("Establishing relay session to {}", relay_addr);
// Prefer reusing an existing peer connection to the relay.
// The relay server's handle_relay_requests is spawned for each ACCEPTED
// connection, so using the existing connection ensures a handler is
// already listening for bidi streams.
let existing_conn = self.connections.iter().find_map(|entry| {
let conn = entry.value();
if conn.remote_address() == relay_addr && conn.close_reason().is_none() {
Some(conn.clone())
} else {
None
}
});
let connection = if let Some(existing) = existing_conn {
info!("Reusing existing peer connection to relay {}", relay_addr);
existing
} else {
// No existing connection — create one
self.connect_new_to_relay(relay_addr).await?
};
// Open a bidirectional stream for the CONNECT-UDP handshake
let (mut send_stream, mut recv_stream) = connection.open_bi().await.map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Failed to open relay stream: {}", e))
})?;
// Send CONNECT-UDP Bind request with length prefix (stream stays open for data)
let request = ConnectUdpRequest::bind_any();
let request_bytes = request.encode();
debug!("Sending CONNECT-UDP Bind request to relay: {:?}", request);
// Length-prefixed framing: [4-byte BE length][payload]
let req_len = request_bytes.len() as u32;
send_stream
.write_all(&req_len.to_be_bytes())
.await
.map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Failed to send request length: {}", e))
})?;
send_stream.write_all(&request_bytes).await.map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Failed to send relay request: {}", e))
})?;
// Do NOT call finish() — stream stays open for data forwarding
// Read length-prefixed response
let mut resp_len_buf = [0u8; 4];
recv_stream
.read_exact(&mut resp_len_buf)
.await
.map_err(|e| {
NatTraversalError::ConnectionFailed(format!(
"Failed to read relay response length: {}",
e
))
})?;
let resp_len = u32::from_be_bytes(resp_len_buf) as usize;
let mut response_bytes = vec![0u8; resp_len];
recv_stream
.read_exact(&mut response_bytes)
.await
.map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Failed to read relay response: {}", e))
})?;
let response = ConnectUdpResponse::decode(&mut bytes::Bytes::from(response_bytes))
.map_err(|e| {
NatTraversalError::ProtocolError(format!("Invalid relay response: {}", e))
})?;
if !response.is_success() {
let reason = response.reason.unwrap_or_else(|| "unknown".to_string());
return Err(NatTraversalError::ConnectionFailed(format!(
"Relay rejected request: {} (status {})",
reason, response.status
)));
}
let public_address = response.proxy_public_address;
info!(
"Relay session established with public address: {:?}",
public_address
);
// Create the MasqueRelaySocket from the open streams
let relay_socket = public_address
.map(|addr| crate::masque::MasqueRelaySocket::new(send_stream, recv_stream, addr));
// Store the session
let session = RelaySession {
connection,
public_address,
established_at: std::time::Instant::now(),
relay_addr,
};
// DashMap provides lock-free .insert()
self.relay_sessions.insert(relay_addr, session);
// Notify the relay manager
if let Some(ref manager) = self.relay_manager {
if let Ok(resp) =
ConnectUdpResponse::decode(&mut bytes::Bytes::from(response.encode().to_vec()))
{
let _ = manager.handle_connect_response(relay_addr, resp).await;
}
}
Ok((public_address, relay_socket))
}
/// Create a fresh QUIC connection to a relay server.
///
/// Used as a fallback when no existing peer connection is available.
async fn connect_new_to_relay(
&self,
relay_addr: SocketAddr,
) -> Result<InnerConnection, NatTraversalError> {
let endpoint = self.inner_endpoint.as_ref().ok_or_else(|| {
NatTraversalError::ConfigError("QUIC endpoint not initialized".to_string())
})?;
let server_name = relay_addr.ip().to_string();
let connecting = endpoint.connect(relay_addr, &server_name).map_err(|e| {
NatTraversalError::ConnectionFailed(format!(
"Failed to initiate relay connection: {}",
e
))
})?;
let connection = timeout(self.config.coordination_timeout, connecting)
.await
.map_err(|_| NatTraversalError::Timeout)?
.map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Relay connection failed: {}", e))
})?;
info!("Connected to relay server {}", relay_addr);
Ok(connection)
}
/// Get active relay sessions
pub fn relay_sessions(&self) -> Arc<dashmap::DashMap<SocketAddr, RelaySession>> {
self.relay_sessions.clone()
}
/// Accept incoming connections on the endpoint
pub async fn accept_connection(&self) -> Result<(PeerId, InnerConnection), NatTraversalError> {
debug!("Waiting for incoming connection via event channel...");
loop {
// Check shutdown
if self.shutdown.load(Ordering::Relaxed) {
return Err(NatTraversalError::NetworkError(
"Endpoint shutting down".to_string(),
));
}
// Drain all pending events (non-blocking, under ParkingMutex)
{
let mut event_rx = self.event_rx.lock();
loop {
match event_rx.try_recv() {
Ok(NatTraversalEvent::ConnectionEstablished {
peer_id,
remote_address,
side,
}) => {
info!(
"Received ConnectionEstablished event for peer {:?} at {} (side: {:?})",
peer_id, remote_address, side
);
let connection = self
.connections
.get(&peer_id)
.map(|entry| entry.value().clone())
.ok_or_else(|| {
NatTraversalError::ConnectionFailed(format!(
"Connection for peer {:?} not found in storage",
peer_id
))
})?;
info!(
"Retrieved accepted connection from peer {:?} at {}",
peer_id, remote_address
);
return Ok((peer_id, connection));
}
Ok(event) => {
debug!(
"Ignoring non-connection event while waiting for accept: {:?}",
event
);
}
Err(mpsc::error::TryRecvError::Empty) => break,
Err(mpsc::error::TryRecvError::Disconnected) => {
return Err(NatTraversalError::NetworkError(
"Event channel closed".to_string(),
));
}
}
}
}
// Suspend until the background accept task signals a new event.
// notify_one() stores a permit if called between try_recv() and here,
// so no events are lost.
self.incoming_notify.notified().await;
}
}
/// Get the local peer ID
pub fn local_peer_id(&self) -> PeerId {
self.local_peer_id
}
/// Returns a reference to the connection notification handle.
///
/// This `Notify` is triggered whenever a `ConnectionEstablished` event
/// is produced, allowing callers to await connection events without
/// polling in a sleep loop.
pub fn connection_notify(&self) -> &tokio::sync::Notify {
&self.incoming_notify
}
/// Check if we have a live connection to the given peer.
///
/// If the connection exists but is dead (closed/draining), removes it
/// from the connection table and returns `false`. This enables automatic
/// cleanup of phantom connections during deduplication checks.
pub fn is_peer_connected(&self, peer_id: &PeerId) -> bool {
if let Some(conn) = self.connections.get(peer_id) {
if conn.is_alive() {
return true;
}
// Connection is dead — drop the DashMap ref before removing
drop(conn);
// Clean up dead connection
let _ = self.remove_connection(peer_id);
}
false
}
/// Get an active connection by peer ID
pub fn get_connection(
&self,
peer_id: &PeerId,
) -> Result<Option<InnerConnection>, NatTraversalError> {
// DashMap provides lock-free .get()
Ok(self
.connections
.get(peer_id)
.map(|entry| entry.value().clone()))
}
/// Add or update a connection for a peer
pub fn add_connection(
&self,
peer_id: PeerId,
connection: InnerConnection,
) -> Result<(), NatTraversalError> {
let remote_addr = connection.remote_address();
let observed = connection.observed_address();
info!(
"add_connection: peer {:?} at {} observed_address={:?}",
peer_id, remote_addr, observed
);
// DashMap provides lock-free .insert()
self.connections.insert(peer_id, connection);
info!(
"add_connection: now have {} connections",
self.connections.len()
);
Ok(())
}
/// Spawn the NAT traversal handler loop for an existing connection referenced by the endpoint.
///
/// # Arguments
/// * `peer_id` - The peer ID of the remote endpoint
/// * `connection` - The established QUIC connection
/// * `side` - Who initiated the connection (Client = we connected, Server = they connected)
pub fn spawn_connection_handler(
&self,
peer_id: PeerId,
connection: InnerConnection,
side: Side,
) -> Result<(), NatTraversalError> {
let event_tx = self.event_tx.as_ref().cloned().ok_or_else(|| {
NatTraversalError::ConfigError("NAT traversal event channel not configured".to_string())
})?;
let remote_address = connection.remote_address();
// Only emit ConnectionEstablished if we haven't already for this peer
// DashSet::insert returns true if this is a new peer (not already present)
let should_emit = self.emitted_established_events.insert(peer_id);
if should_emit {
let _ = event_tx.send(NatTraversalEvent::ConnectionEstablished {
peer_id,
remote_address,
side,
});
self.incoming_notify.notify_one();
}
// Spawn connection monitoring task
tokio::spawn(async move {
Self::handle_connection(peer_id, connection, event_tx).await;
});
Ok(())
}
/// Remove a connection by peer ID
pub fn remove_connection(
&self,
peer_id: &PeerId,
) -> Result<Option<InnerConnection>, NatTraversalError> {
// Clear emitted event tracking so reconnections can generate new events
// DashSet provides lock-free .remove()
self.emitted_established_events.remove(peer_id);
// DashMap provides lock-free .remove() that returns Option<(K, V)>
Ok(self.connections.remove(peer_id).map(|(_, v)| v))
}
/// List all active connections
pub fn list_connections(&self) -> Result<Vec<(PeerId, SocketAddr)>, NatTraversalError> {
// DashMap provides lock-free iteration
let result: Vec<_> = self
.connections
.iter()
.map(|entry| (*entry.key(), entry.value().remote_address()))
.collect();
Ok(result)
}
/// Get the external/reflexive address as observed by remote peers
///
/// This returns the public address of this endpoint as seen by other peers,
/// discovered via OBSERVED_ADDRESS frames during QUIC connections.
///
/// Returns the first observed address found from any active connection,
/// preferring connections to bootstrap nodes.
///
/// Returns `None` if:
/// - No connections are active
/// - No OBSERVED_ADDRESS frame has been received from any peer
pub fn get_observed_external_address(&self) -> Result<Option<SocketAddr>, NatTraversalError> {
// Check all connections for an observed address
// First try to find one from a known peer (more reliable)
let known_peer_addrs: std::collections::HashSet<_> =
self.config.known_peers.iter().copied().collect();
// Check known peer connections first (DashMap lock-free iteration)
for entry in self.connections.iter() {
let connection = entry.value();
if known_peer_addrs.contains(&connection.remote_address()) {
if let Some(addr) = connection.observed_address() {
debug!(
"Found observed external address {} from known peer connection",
addr
);
return Ok(Some(addr));
}
}
}
// Fall back to any connection with an observed address
for entry in self.connections.iter() {
if let Some(addr) = entry.value().observed_address() {
debug!(
"Found observed external address {} from peer connection",
addr
);
return Ok(Some(addr));
}
}
debug!("No observed external address available from any connection");
Ok(None)
}
/// Returns ALL observed external addresses from all connected peers and paths.
///
/// Unlike `get_observed_external_address()` which returns only the first match,
/// this collects unique addresses across all connections and QUIC path IDs.
/// This is critical for dual-stack nodes where IPv4 and IPv6 addresses are
/// discovered from different peers or paths.
pub fn get_all_observed_external_addresses(
&self,
) -> Result<Vec<SocketAddr>, NatTraversalError> {
let mut addrs = Vec::new();
for entry in self.connections.iter() {
let connection = entry.value();
for addr in connection.all_observed_addresses() {
if !addrs.contains(&addr) {
addrs.push(addr);
}
}
}
if !addrs.is_empty() {
debug!(
"Collected {} observed external addresses: {:?}",
addrs.len(),
addrs
);
}
Ok(addrs)
}
// ============ Multi-Transport Address Advertising ============
/// Advertise a transport address to all connected peers
///
/// This method broadcasts the transport address to all active connections
/// using ADD_ADDRESS frames. For UDP transports, this falls back to the
/// standard socket address advertising. For other transports (BLE, LoRa, etc.),
/// the transport type and optional capability flags are included in the advertisement.
///
/// # Arguments
/// * `address` - The transport address to advertise
/// * `priority` - ICE-style priority (higher = better)
/// * `capabilities` - Optional capability flags for the transport
///
/// # Example
/// ```ignore
/// use ant_quic::transport::TransportAddr;
/// use ant_quic::nat_traversal::CapabilityFlags;
///
/// // Advertise a UDP address
/// endpoint.advertise_transport_address(
/// TransportAddr::Udp("192.168.1.100:9000".parse().unwrap()),
/// 100,
/// Some(CapabilityFlags::broadband()),
/// );
///
/// // Advertise a BLE address
/// endpoint.advertise_transport_address(
/// TransportAddr::Ble {
/// device_id: [0x12, 0x34, 0x56, 0x78, 0x9A, 0xBC],
/// service_uuid: None,
/// },
/// 50,
/// Some(CapabilityFlags::ble()),
/// );
/// ```
pub fn advertise_transport_address(
&self,
address: TransportAddr,
priority: u32,
capabilities: Option<CapabilityFlags>,
) -> Result<(), NatTraversalError> {
// For UDP addresses, use the existing broadcast mechanism
if let Some(socket_addr) = address.as_socket_addr() {
broadcast_address_to_peers(&self.connections, socket_addr, priority);
info!(
"Advertised UDP transport address {} with priority {} to {} peers",
socket_addr,
priority,
self.connections.len()
);
return Ok(());
}
// For non-UDP transports, we need to store the transport candidate
// and advertise it via the extended ADD_ADDRESS frames
let candidate = TransportCandidate {
address: address.clone(),
priority,
source: CandidateSource::Local,
state: CandidateState::New,
capabilities,
};
info!(
"Advertising {:?} transport address with priority {} (capabilities: {:?})",
candidate.transport_type(),
priority,
capabilities
);
// For now, log the advertisement - full frame transmission for non-UDP
// transports will be implemented when we have multi-transport connections
debug!(
"Transport candidate registered: {:?}, capabilities: {:?}",
address, capabilities
);
Ok(())
}
/// Advertise a transport address with full capability information
///
/// This is a convenience method that creates capability flags from the
/// full TransportCapabilities struct.
pub fn advertise_transport_with_capabilities(
&self,
address: TransportAddr,
priority: u32,
capabilities: &TransportCapabilities,
) -> Result<(), NatTraversalError> {
let flags = CapabilityFlags::from_capabilities(capabilities);
self.advertise_transport_address(address, priority, Some(flags))
}
/// Get the transport type filter for candidate selection
///
/// Returns the set of transport types that should be considered
/// when selecting candidates for connection.
pub fn get_transport_filter(&self) -> Vec<TransportType> {
// Default: prefer UDP, but accept other transports
vec![
TransportType::Udp,
TransportType::Ble,
TransportType::LoRa,
TransportType::Serial,
]
}
/// Check if a transport type is supported by this endpoint
pub fn supports_transport(&self, transport_type: TransportType) -> bool {
match transport_type {
// UDP is always supported
TransportType::Udp => true,
// Other transports depend on registered providers
_ => {
if let Some(registry) = &self.transport_registry {
!registry.providers_by_type(transport_type).is_empty()
} else {
false
}
}
}
}
// ============ Transport-Aware Candidate Selection ============
/// Select the best candidate from a list of transport candidates
///
/// This method filters candidates by transport type support and selects
/// the best one based on priority and capability matching.
///
/// # Selection Criteria
/// 1. Filter out unsupported transport types
/// 2. Prefer transports that support full QUIC (if available)
/// 3. Within QUIC-capable transports, prefer higher priority
/// 4. Fall back to constrained transports if no QUIC-capable available
pub fn select_best_transport_candidate<'a>(
&self,
candidates: &'a [TransportCandidate],
) -> Option<&'a TransportCandidate> {
if candidates.is_empty() {
return None;
}
// Filter to supported transports
let supported: Vec<_> = candidates
.iter()
.filter(|c| self.supports_transport(c.transport_type()))
.collect();
if supported.is_empty() {
debug!("No supported transport candidates available");
return None;
}
// Separate into QUIC-capable and constrained candidates
let (quic_capable, constrained): (Vec<_>, Vec<_>) = supported
.into_iter()
.partition(|c| c.supports_full_quic().unwrap_or(false));
// Prefer QUIC-capable transports, sorted by priority
if !quic_capable.is_empty() {
return quic_capable.into_iter().max_by_key(|c| c.priority);
}
// Fall back to constrained transports, sorted by priority
constrained.into_iter().max_by_key(|c| c.priority)
}
/// Filter candidates by transport type
///
/// Returns candidates that match the specified transport type.
pub fn filter_candidates_by_transport<'a>(
&self,
candidates: &'a [TransportCandidate],
transport_type: TransportType,
) -> Vec<&'a TransportCandidate> {
candidates
.iter()
.filter(|c| c.transport_type() == transport_type)
.collect()
}
/// Filter candidates to only QUIC-capable transports
///
/// Returns candidates whose transports support the full QUIC protocol
/// (bandwidth >= 10kbps, MTU >= 1200, RTT < 2s).
pub fn filter_quic_capable_candidates<'a>(
&self,
candidates: &'a [TransportCandidate],
) -> Vec<&'a TransportCandidate> {
candidates
.iter()
.filter(|c| {
c.supports_full_quic().unwrap_or(false)
&& self.supports_transport(c.transport_type())
})
.collect()
}
/// Calculate a transport score for candidate comparison
///
/// Higher scores are better. The score considers:
/// - Transport type preference (UDP > BLE > LoRa > Serial)
/// - QUIC capability (bonus for full QUIC support)
/// - Latency tier (lower latency = higher score)
/// - User-specified priority
pub fn calculate_transport_score(&self, candidate: &TransportCandidate) -> u32 {
let mut score: u32 = 0;
// Base score from priority (0-65535 range)
score += candidate.priority;
// Transport type bonus (0-10000)
let transport_bonus = match candidate.transport_type() {
TransportType::Udp => 10000,
TransportType::Yggdrasil => 9000,
TransportType::I2p => 8000,
TransportType::Ble => 7000,
TransportType::Serial => 5000,
TransportType::LoRa => 3000,
TransportType::Ax25 => 2000,
};
score += transport_bonus;
// QUIC capability bonus (0-50000)
if candidate.supports_full_quic().unwrap_or(false) {
score += 50000;
}
// Latency tier bonus (0-30000)
if let Some(caps) = candidate.capabilities {
let latency_bonus = match caps.latency_tier() {
3 => 30000, // <100ms
2 => 20000, // 100-500ms
1 => 10000, // 500ms-2s
0 => 0, // >2s
_ => 0,
};
score += latency_bonus;
// Bandwidth tier bonus (0-20000)
let bandwidth_bonus = match caps.bandwidth_tier() {
3 => 20000, // High
2 => 15000, // Medium
1 => 10000, // Low
0 => 5000, // VeryLow
_ => 0,
};
score += bandwidth_bonus;
}
score
}
/// Sort candidates by transport score (best first)
pub fn sort_candidates_by_score(&self, candidates: &mut [TransportCandidate]) {
candidates.sort_by(|a, b| {
let score_a = self.calculate_transport_score(a);
let score_b = self.calculate_transport_score(b);
score_b.cmp(&score_a) // Descending order (highest first)
});
}
// ============ Transport Candidate Storage ============
/// Store a transport candidate for a peer
///
/// This adds a new transport candidate to the peer's candidate list.
/// Duplicate addresses are updated with the new priority and capabilities.
pub fn store_transport_candidate(&self, peer_id: PeerId, candidate: TransportCandidate) {
let mut entry = self
.transport_candidates
.entry(peer_id)
.or_insert_with(Vec::new);
// Check if we already have this address
if let Some(existing) = entry.iter_mut().find(|c| c.address == candidate.address) {
// Update existing candidate
existing.priority = candidate.priority;
existing.capabilities = candidate.capabilities;
existing.state = candidate.state;
debug!(
"Updated transport candidate for peer {:?}: {:?}",
peer_id, candidate.address
);
} else {
// Add new candidate
entry.push(candidate.clone());
debug!(
"Stored new transport candidate for peer {:?}: {:?}",
peer_id, candidate.address
);
}
}
/// Get all transport candidates for a peer
///
/// Returns an empty Vec if no candidates are known for the peer.
pub fn get_transport_candidates(&self, peer_id: PeerId) -> Vec<TransportCandidate> {
self.transport_candidates
.get(&peer_id)
.map(|entry| entry.value().clone())
.unwrap_or_default()
}
/// Get transport candidates filtered by transport type
pub fn get_candidates_by_type(
&self,
peer_id: PeerId,
transport_type: TransportType,
) -> Vec<TransportCandidate> {
self.transport_candidates
.get(&peer_id)
.map(|entry| {
entry
.value()
.iter()
.filter(|c| c.transport_type() == transport_type)
.cloned()
.collect()
})
.unwrap_or_default()
}
/// Get the best transport candidate for a peer
///
/// This considers transport support and capability matching.
pub fn get_best_candidate(&self, peer_id: PeerId) -> Option<TransportCandidate> {
let candidates = self.get_transport_candidates(peer_id);
self.select_best_transport_candidate(&candidates).cloned()
}
/// Remove all transport candidates for a peer
pub fn remove_transport_candidates(&self, peer_id: PeerId) {
self.transport_candidates.remove(&peer_id);
debug!("Removed all transport candidates for peer {:?}", peer_id);
}
/// Remove a specific transport candidate for a peer
pub fn remove_transport_candidate(&self, peer_id: PeerId, address: &TransportAddr) {
if let Some(mut entry) = self.transport_candidates.get_mut(&peer_id) {
entry.retain(|c| &c.address != address);
debug!(
"Removed transport candidate {:?} for peer {:?}",
address, peer_id
);
}
}
/// Get count of transport candidates for a peer
pub fn transport_candidate_count(&self, peer_id: PeerId) -> usize {
self.transport_candidates
.get(&peer_id)
.map(|entry| entry.len())
.unwrap_or(0)
}
/// Get total count of all stored transport candidates
pub fn total_transport_candidates(&self) -> usize {
self.transport_candidates
.iter()
.map(|entry| entry.value().len())
.sum()
}
/// Generate a local peer ID
fn generate_local_peer_id() -> PeerId {
use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};
use std::time::SystemTime;
let mut hasher = DefaultHasher::new();
SystemTime::now().hash(&mut hasher);
std::process::id().hash(&mut hasher);
let hash = hasher.finish();
let mut peer_id = [0u8; 32];
peer_id[0..8].copy_from_slice(&hash.to_be_bytes());
// Add some randomness
for i in 8..32 {
peer_id[i] = rand::random();
}
PeerId(peer_id)
}
/// Generate a deterministic temporary peer ID from a socket address.
///
/// This is a fallback only for legacy/error paths where the authenticated
/// peer identity is unavailable. It is stable for a given address but must
/// not be treated as durable identity.
fn generate_peer_id_from_address(addr: SocketAddr) -> PeerId {
use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};
let mut hasher = DefaultHasher::new();
addr.hash(&mut hasher);
let hash = hasher.finish();
let mut peer_id = [0u8; 32];
peer_id[0..8].copy_from_slice(&hash.to_be_bytes());
warn!(
"Generated temporary address-derived peer ID for {}. This ID is not durable identity.",
addr
);
PeerId(peer_id)
}
/// Derive a peer ID from the authenticated raw public key if available.
///
/// For rustls, `peer_identity()` returns `Vec<CertificateDer>`. For RFC 7250 Raw Public Keys,
/// this contains SubjectPublicKeyInfo for ML-DSA-65. We extract the
/// ML-DSA-65 public key from the SPKI structure and derive the PeerId.
fn derive_peer_id_from_connection(connection: &InnerConnection) -> Option<PeerId> {
if let Some(identity) = connection.peer_identity() {
// rustls returns Vec<CertificateDer> - downcast to that type
if let Some(certs) =
identity.downcast_ref::<Vec<rustls::pki_types::CertificateDer<'static>>>()
{
if let Some(cert) = certs.first() {
// v0.2: For RFC 7250 Raw Public Keys with ML-DSA-65
let spki = cert.as_ref();
if let Some(public_key) = extract_ml_dsa_from_spki(spki) {
let peer_id =
crate::crypto::raw_public_keys::pqc::derive_peer_id_from_public_key(
&public_key,
);
debug!("Derived peer ID from ML-DSA-65 public key in SPKI");
return Some(peer_id);
} else {
debug!(
"Certificate is not ML-DSA-65 SPKI format (len={})",
spki.len()
);
}
}
}
}
None
}
/// Extract peer ID from connection by deriving it from the peer's public key
///
/// v0.2: Pure PQC - Uses ML-DSA-65 for all authentication.
/// For rustls, `peer_identity()` returns `Vec<CertificateDer>`. For RFC 7250 Raw Public Keys,
/// this contains SubjectPublicKeyInfo for ML-DSA-65. We extract the
/// ML-DSA-65 public key from the SPKI structure and derive the PeerId.
pub async fn extract_peer_id_from_connection(
&self,
connection: &InnerConnection,
) -> Option<PeerId> {
// Delegate to the static method which handles both CertificateDer and raw [u8; 32]
Self::derive_peer_id_from_connection(connection)
}
/// Shutdown the endpoint
pub async fn shutdown(&self) -> Result<(), NatTraversalError> {
// Set shutdown flag and wake any task parked in accept_connection()
// or transport listener loops
self.shutdown.store(true, Ordering::Relaxed);
self.incoming_notify.notify_waiters();
self.shutdown_notify.notify_waiters();
// Close all active connections
// DashMap: collect peer_ids then remove them one by one
let peer_ids: Vec<PeerId> = self.connections.iter().map(|e| *e.key()).collect();
for peer_id in peer_ids {
if let Some((_, connection)) = self.connections.remove(&peer_id) {
info!("Closing connection to peer {:?}", peer_id);
connection.close(crate::VarInt::from_u32(0), b"Shutdown");
}
}
// Bounded drain: in simultaneous-shutdown scenarios both sides may
// close at once, so wait_idle can stall until the idle timeout.
if let Some(ref endpoint) = self.inner_endpoint {
if tokio::time::timeout(SHUTDOWN_DRAIN_TIMEOUT, endpoint.wait_idle())
.await
.is_err()
{
info!("wait_idle timed out during shutdown, proceeding");
}
}
// Wait for transport listener tasks to complete
let handles = {
let mut listener_handles = self.transport_listener_handles.lock();
std::mem::take(&mut *listener_handles)
};
if !handles.is_empty() {
debug!(
"Waiting for {} transport listener tasks to complete",
handles.len()
);
match tokio::time::timeout(SHUTDOWN_DRAIN_TIMEOUT, async {
for handle in handles {
if let Err(e) = handle.await {
warn!("Transport listener task failed during shutdown: {e}");
}
}
})
.await
{
Ok(()) => debug!("All transport listener tasks completed"),
Err(_) => warn!("Transport listener tasks timed out during shutdown, proceeding"),
}
}
info!("NAT traversal endpoint shutdown completed");
Ok(())
}
/// Discover address candidates for a peer
pub async fn discover_candidates(
&self,
peer_id: PeerId,
) -> Result<Vec<CandidateAddress>, NatTraversalError> {
debug!("Discovering address candidates for peer {:?}", peer_id);
let mut candidates = Vec::new();
// Get bootstrap nodes - parking_lot::RwLock doesn't poison
let bootstrap_nodes = self.bootstrap_nodes.read().clone();
// Start discovery process - parking_lot::Mutex doesn't poison
{
let mut discovery = self.discovery_manager.lock();
discovery
.start_discovery(peer_id, bootstrap_nodes)
.map_err(|e| NatTraversalError::CandidateDiscoveryFailed(e.to_string()))?;
}
// Poll for discovery results with timeout
let timeout_duration = self.config.coordination_timeout;
let start_time = std::time::Instant::now();
while start_time.elapsed() < timeout_duration {
let discovery_events = {
let mut discovery = self.discovery_manager.lock();
discovery.poll(std::time::Instant::now())
};
for event in discovery_events {
match event {
DiscoveryEvent::LocalCandidateDiscovered { candidate } => {
candidates.push(candidate.clone());
// Send ADD_ADDRESS frame to advertise this candidate to the peer
self.send_candidate_advertisement(peer_id, &candidate)
.await
.unwrap_or_else(|e| {
debug!("Failed to send candidate advertisement: {}", e)
});
}
DiscoveryEvent::ServerReflexiveCandidateDiscovered { candidate, .. } => {
candidates.push(candidate.clone());
// Send ADD_ADDRESS frame to advertise this candidate to the peer
self.send_candidate_advertisement(peer_id, &candidate)
.await
.unwrap_or_else(|e| {
debug!("Failed to send candidate advertisement: {}", e)
});
}
// Prediction events removed in minimal flow
DiscoveryEvent::DiscoveryCompleted { .. } => {
// Discovery complete, return candidates
return Ok(candidates);
}
DiscoveryEvent::DiscoveryFailed {
error,
partial_results,
} => {
// Use partial results if available
candidates.extend(partial_results);
if candidates.is_empty() {
return Err(NatTraversalError::CandidateDiscoveryFailed(
error.to_string(),
));
}
return Ok(candidates);
}
_ => {}
}
}
// Wait briefly for more events, but respect the overall timeout.
// The discovery manager uses a synchronous poll() model, so we still
// need a brief interval. This avoids overshooting the deadline.
let remaining = timeout_duration
.checked_sub(start_time.elapsed())
.unwrap_or_default();
if remaining.is_zero() {
break;
}
sleep(remaining.min(Duration::from_millis(10))).await;
}
if candidates.is_empty() {
Err(NatTraversalError::NoCandidatesFound)
} else {
Ok(candidates)
}
}
/// Create PUNCH_ME_NOW extension frame for NAT traversal coordination
#[allow(dead_code)]
fn create_punch_me_now_frame(&self, peer_id: PeerId) -> Result<Vec<u8>, NatTraversalError> {
// PUNCH_ME_NOW frame format (IETF QUIC NAT Traversal draft):
// Frame Type: 0x41 (PUNCH_ME_NOW)
// Length: Variable
// Peer ID: 32 bytes
// Timestamp: 8 bytes
// Coordination Token: 16 bytes
let mut frame = Vec::new();
// Frame type
frame.push(0x41);
// Peer ID (32 bytes)
frame.extend_from_slice(&peer_id.0);
// Timestamp (8 bytes, current time as milliseconds since epoch)
let timestamp = std::time::SystemTime::now()
.duration_since(std::time::UNIX_EPOCH)
.unwrap_or_default()
.as_millis() as u64;
frame.extend_from_slice(×tamp.to_be_bytes());
// Coordination token (16 random bytes for this session)
let mut token = [0u8; 16];
for byte in &mut token {
*byte = rand::random();
}
frame.extend_from_slice(&token);
Ok(frame)
}
#[allow(dead_code)]
fn attempt_hole_punching(&self, peer_id: PeerId) -> Result<(), NatTraversalError> {
debug!("Attempting hole punching for peer {:?}", peer_id);
// Get candidate pairs for this peer
let candidate_pairs = self.get_candidate_pairs_for_peer(peer_id)?;
if candidate_pairs.is_empty() {
return Err(NatTraversalError::NoCandidatesFound);
}
info!(
"Generated {} candidate pairs for hole punching with peer {:?}",
candidate_pairs.len(),
peer_id
);
// Attempt hole punching with each candidate pair
self.attempt_quic_hole_punching(peer_id, candidate_pairs)
}
/// Generate candidate pairs for hole punching based on ICE-like algorithm
#[allow(dead_code)]
fn get_candidate_pairs_for_peer(
&self,
peer_id: PeerId,
) -> Result<Vec<CandidatePair>, NatTraversalError> {
// Get discovered candidates from the discovery manager
// parking_lot::Mutex doesn't poison
let discovery_candidates = {
let discovery = self.discovery_manager.lock();
discovery.get_candidates_for_peer(peer_id)
};
if discovery_candidates.is_empty() {
return Err(NatTraversalError::NoCandidatesFound);
}
// Create candidate pairs with priorities (ICE-like pairing)
let mut candidate_pairs = Vec::new();
let local_candidates = discovery_candidates
.iter()
.filter(|c| matches!(c.source, CandidateSource::Local))
.collect::<Vec<_>>();
let remote_candidates = discovery_candidates
.iter()
.filter(|c| !matches!(c.source, CandidateSource::Local))
.collect::<Vec<_>>();
// Pair each local candidate with each remote candidate
// Skip cross-family pairs (IPv4 ↔ IPv6) as they cannot connect at the socket level
for local in &local_candidates {
for remote in &remote_candidates {
// Cross-family pairs will always fail - skip them
let local_is_v4 = local.address.ip().is_ipv4();
let remote_is_v4 = remote.address.ip().is_ipv4();
if local_is_v4 != remote_is_v4 {
trace!(
"Skipping cross-family candidate pair: {} ↔ {}",
local.address, remote.address
);
continue;
}
let pair_priority = self.calculate_candidate_pair_priority(local, remote);
candidate_pairs.push(CandidatePair {
local_candidate: (*local).clone(),
remote_candidate: (*remote).clone(),
priority: pair_priority,
state: CandidatePairState::Waiting,
});
}
}
// Sort by priority (highest first)
candidate_pairs.sort_by(|a, b| b.priority.cmp(&a.priority));
// Limit to reasonable number for initial attempts
candidate_pairs.truncate(8);
Ok(candidate_pairs)
}
/// Calculate candidate pair priority using ICE algorithm
#[allow(dead_code)]
fn calculate_candidate_pair_priority(
&self,
local: &CandidateAddress,
remote: &CandidateAddress,
) -> u64 {
// ICE candidate pair priority formula: min(G,D) * 2^32 + max(G,D) * 2 + (G>D ? 1 : 0)
// Where G is controlling agent priority, D is controlled agent priority
let local_type_preference = match local.source {
CandidateSource::Local => 126,
CandidateSource::Observed { .. } => 100,
CandidateSource::Predicted => 75,
CandidateSource::Peer => 50,
};
let remote_type_preference = match remote.source {
CandidateSource::Local => 126,
CandidateSource::Observed { .. } => 100,
CandidateSource::Predicted => 75,
CandidateSource::Peer => 50,
};
// Simplified priority calculation
let local_priority = (local_type_preference as u64) << 8 | local.priority as u64;
let remote_priority = (remote_type_preference as u64) << 8 | remote.priority as u64;
let min_priority = local_priority.min(remote_priority);
let max_priority = local_priority.max(remote_priority);
(min_priority << 32)
| (max_priority << 1)
| if local_priority > remote_priority {
1
} else {
0
}
}
/// Real QUIC-based hole punching implementation
#[allow(dead_code)]
fn attempt_quic_hole_punching(
&self,
peer_id: PeerId,
candidate_pairs: Vec<CandidatePair>,
) -> Result<(), NatTraversalError> {
let _endpoint = self.inner_endpoint.as_ref().ok_or_else(|| {
NatTraversalError::ConfigError("QUIC endpoint not initialized".to_string())
})?;
for pair in candidate_pairs {
debug!(
"Attempting hole punch with candidate pair: {} -> {}",
pair.local_candidate.address, pair.remote_candidate.address
);
// Create PATH_CHALLENGE frame data (8 random bytes)
let mut challenge_data = [0u8; 8];
for byte in &mut challenge_data {
*byte = rand::random();
}
// Create a raw UDP socket bound to the local candidate address
let local_socket =
std::net::UdpSocket::bind(pair.local_candidate.address).map_err(|e| {
NatTraversalError::NetworkError(format!(
"Failed to bind to local candidate: {e}"
))
})?;
// Craft a minimal QUIC packet with PATH_CHALLENGE frame
let path_challenge_packet = self.create_path_challenge_packet(challenge_data)?;
// Send the packet to the remote candidate address
match local_socket.send_to(&path_challenge_packet, pair.remote_candidate.address) {
Ok(bytes_sent) => {
debug!(
"Sent {} bytes for hole punch from {} to {}",
bytes_sent, pair.local_candidate.address, pair.remote_candidate.address
);
// Set a short timeout for response
local_socket
.set_read_timeout(Some(Duration::from_millis(100)))
.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to set timeout: {e}"))
})?;
// Try to receive a response
let mut response_buffer = [0u8; 1024];
match local_socket.recv_from(&mut response_buffer) {
Ok((_bytes_received, response_addr)) => {
if response_addr == pair.remote_candidate.address {
info!(
"Hole punch succeeded for peer {:?}: {} <-> {}",
peer_id,
pair.local_candidate.address,
pair.remote_candidate.address
);
// Store successful candidate pair for connection establishment
self.store_successful_candidate_pair(peer_id, pair)?;
return Ok(());
} else {
debug!(
"Received response from unexpected address: {}",
response_addr
);
}
}
Err(e)
if e.kind() == std::io::ErrorKind::WouldBlock
|| e.kind() == std::io::ErrorKind::TimedOut =>
{
debug!("No response received for hole punch attempt");
}
Err(e) => {
debug!("Error receiving hole punch response: {}", e);
}
}
}
Err(e) => {
debug!("Failed to send hole punch packet: {}", e);
}
}
}
// If we get here, all hole punch attempts failed
Err(NatTraversalError::HolePunchingFailed)
}
/// Create a minimal QUIC packet with PATH_CHALLENGE frame for hole punching
fn create_path_challenge_packet(
&self,
challenge_data: [u8; 8],
) -> Result<Vec<u8>, NatTraversalError> {
// Create a minimal QUIC packet structure
// This is a simplified implementation - in production, you'd use proper QUIC packet construction
let mut packet = Vec::new();
// QUIC packet header (simplified)
packet.push(0x40); // Short header, fixed bit set
packet.extend_from_slice(&[0, 0, 0, 1]); // Connection ID (simplified)
// PATH_CHALLENGE frame
packet.push(0x1a); // PATH_CHALLENGE frame type
packet.extend_from_slice(&challenge_data); // 8-byte challenge data
Ok(packet)
}
/// Store successful candidate pair for later connection establishment
fn store_successful_candidate_pair(
&self,
peer_id: PeerId,
pair: CandidatePair,
) -> Result<(), NatTraversalError> {
debug!(
"Storing successful candidate pair for peer {:?}: {} <-> {}",
peer_id, pair.local_candidate.address, pair.remote_candidate.address
);
// Store the successful remote address for use in connection establishment
// DashMap provides lock-free .insert()
self.successful_candidates
.insert(peer_id, pair.remote_candidate.address);
info!(
"Stored successful candidate for peer {:?}: {}",
peer_id, pair.remote_candidate.address
);
// Emit events to notify the application
if let Some(ref callback) = self.event_callback {
callback(NatTraversalEvent::PathValidated {
peer_id,
address: pair.remote_candidate.address,
rtt: Duration::from_millis(50), // Estimated RTT
});
callback(NatTraversalEvent::TraversalSucceeded {
peer_id,
final_address: pair.remote_candidate.address,
total_time: Duration::from_secs(1), // Estimated total time
});
}
Ok(())
}
/// Get the successful candidate address for a peer (discovered via hole punching)
///
/// Returns the remote address that successfully responded during hole punching.
/// This address should be used for establishing the actual QUIC connection.
fn get_successful_candidate_address(&self, peer_id: PeerId) -> Option<SocketAddr> {
// DashMap provides lock-free .get() that returns Option<Ref<K, V>>
self.successful_candidates.get(&peer_id).map(|r| *r.value())
}
/// Attempt connection to a specific candidate address
fn attempt_connection_to_candidate(
&self,
peer_id: PeerId,
candidate: &CandidateAddress,
) -> Result<(), NatTraversalError> {
// Check if connection already exists - another candidate may have succeeded
if self.has_existing_connection(&peer_id) {
debug!(
"Connection already exists for peer {:?}, skipping candidate {}",
peer_id, candidate.address
);
return Ok(());
}
{
let endpoint = self.inner_endpoint.as_ref().ok_or_else(|| {
NatTraversalError::ConfigError("QUIC endpoint not initialized".to_string())
})?;
// Create server name for the connection
let server_name = format!("peer-{:x}", peer_id.0[0] as u32);
debug!(
"Attempting QUIC connection to candidate {} for peer {:?}",
candidate.address, peer_id
);
// Use the sync connect method from QUIC endpoint
match endpoint.connect(candidate.address, &server_name) {
Ok(connecting) => {
info!(
"Connection attempt initiated to {} for peer {:?}",
candidate.address, peer_id
);
// Spawn a task to handle the connection completion
if let Some(event_tx) = &self.event_tx {
let event_tx = event_tx.clone();
let connections = self.connections.clone();
let incoming_notify = self.incoming_notify.clone();
let peer_id_clone = peer_id;
let address = candidate.address;
tokio::spawn(async move {
match connecting.await {
Ok(connection) => {
// Check if another task already inserted a connection for this peer
// This prevents race conditions when multiple candidates succeed
if connections.contains_key(&peer_id_clone) {
debug!(
"Connection already exists for peer {:?}, discarding duplicate from {}",
peer_id_clone, address
);
// Close the duplicate connection to free resources
connection.close(0u32.into(), b"duplicate connection");
return;
}
info!(
"Successfully connected to {} for peer {:?}",
address, peer_id_clone
);
// Store the connection
// DashMap provides lock-free .insert()
connections.insert(peer_id_clone, connection.clone());
// Send connection established event (we initiated hole punch = Client side)
let _ =
event_tx.send(NatTraversalEvent::ConnectionEstablished {
peer_id: peer_id_clone,
remote_address: address,
side: Side::Client,
});
incoming_notify.notify_one();
// Handle the connection
Self::handle_connection(peer_id_clone, connection, event_tx)
.await;
}
Err(e) => {
warn!("Connection to {} failed: {}", address, e);
}
}
});
}
Ok(())
}
Err(e) => {
warn!(
"Failed to initiate connection to {}: {}",
candidate.address, e
);
Err(NatTraversalError::ConnectionFailed(format!(
"Failed to connect to {}: {}",
candidate.address, e
)))
}
}
}
}
/// Drain any pending events from async tasks
#[inline]
fn drain_pending_events(&self, events: &mut Vec<NatTraversalEvent>) {
let mut event_rx = self.event_rx.lock();
while let Ok(event) = event_rx.try_recv() {
self.emit_event(events, event);
}
}
/// Detect closed connections and emit ConnectionLost events
fn poll_closed_connections(&self, events: &mut Vec<NatTraversalEvent>) {
let closed_connections: Vec<_> = self
.connections
.iter()
.filter_map(|entry| {
entry
.value()
.close_reason()
.map(|reason| (*entry.key(), reason.clone()))
})
.collect();
for (peer_id, reason) in closed_connections {
self.connections.remove(&peer_id);
self.emit_event(
events,
NatTraversalEvent::ConnectionLost {
peer_id,
reason: reason.to_string(),
},
);
}
}
/// Poll candidate discovery manager and convert events
fn poll_discovery_manager(&self, now: std::time::Instant, events: &mut Vec<NatTraversalEvent>) {
let mut discovery = self.discovery_manager.lock();
let discovery_events = discovery.poll(now);
for discovery_event in discovery_events {
if let Some(nat_event) = self.convert_discovery_event(discovery_event) {
self.emit_event(events, nat_event);
}
}
}
/// Poll for NAT traversal progress and state machine updates
pub fn poll(
&self,
now: std::time::Instant,
) -> Result<Vec<NatTraversalEvent>, NatTraversalError> {
let mut events = Vec::new();
// Drain pending events from async tasks
self.drain_pending_events(&mut events);
// Handle closed connections
self.poll_closed_connections(&mut events);
// Check connections for observed addresses
self.check_connections_for_observed_addresses(&mut events)?;
// Poll candidate discovery
self.poll_discovery_manager(now, &mut events);
// CRITICAL: Two-phase approach to prevent deadlocks
// Phase 1: Collect work to be done (hold DashMap entries briefly)
// Phase 2: Execute work (no DashMap entries held)
let mut coordination_requests: Vec<(PeerId, SocketAddr)> = Vec::new();
let mut hole_punch_requests: Vec<(PeerId, Vec<CandidateAddress>)> = Vec::new();
let mut validation_requests: Vec<(PeerId, SocketAddr)> = Vec::new();
// Collect Discovery-phase peers for deferred discovery_manager access
// to avoid locking discovery_manager while iter_mut() holds all shard guards
let mut early_discovery_peers: Vec<(PeerId, Duration)> = Vec::new();
let mut timeout_discovery_peers: Vec<PeerId> = Vec::new();
// Phase 1: Collect work and update session states (brief DashMap access)
for mut entry in self.active_sessions.iter_mut() {
let session = entry.value_mut();
let elapsed = now.duration_since(session.started_at);
// Get timeout for current phase
let timeout = self.get_phase_timeout(session.phase);
// Record Discovery-phase sessions for deferred processing
// (discovery_manager.lock() cannot be called while iter_mut() holds all shard guards)
if session.phase == TraversalPhase::Discovery && elapsed <= timeout {
early_discovery_peers.push((session.peer_id, timeout - elapsed));
}
// Check if we've exceeded the timeout
if elapsed > timeout {
match session.phase {
TraversalPhase::Discovery => {
// Defer discovery_manager access to after iter_mut loop
timeout_discovery_peers.push(session.peer_id);
}
TraversalPhase::Coordination => {
// DEFER: coordination request (accesses connections DashMap)
if let Some(coordinator) = self.select_coordinator() {
// Update phase now, execute request later
session.phase = TraversalPhase::Synchronization;
coordination_requests.push((session.peer_id, coordinator));
} else {
self.handle_phase_failure(
session,
now,
&mut events,
NatTraversalError::NoBootstrapNodes,
);
}
}
TraversalPhase::Synchronization => {
// Avoid re-locking active_sessions while iter_mut() holds shard guards.
if Self::session_is_synchronized(session) {
session.phase = TraversalPhase::Punching;
self.emit_event(
&mut events,
NatTraversalEvent::HolePunchingStarted {
peer_id: session.peer_id,
targets: session.candidates.iter().map(|c| c.address).collect(),
},
);
// DEFER: hole punching (may access connections)
hole_punch_requests.push((session.peer_id, session.candidates.clone()));
} else {
self.handle_phase_failure(
session,
now,
&mut events,
NatTraversalError::ProtocolError(
"Synchronization timeout".to_string(),
),
);
}
}
TraversalPhase::Punching => {
// Avoid re-locking active_sessions while iter_mut() holds shard guards.
if let Some(successful_path) = self.check_punch_results_for_session(session)
{
session.phase = TraversalPhase::Validation;
self.emit_event(
&mut events,
NatTraversalEvent::PathValidated {
peer_id: session.peer_id,
address: successful_path,
rtt: Duration::from_millis(50), // TODO: Get actual RTT
},
);
// DEFER: path validation (may access connections)
validation_requests.push((session.peer_id, successful_path));
} else {
self.handle_phase_failure(
session,
now,
&mut events,
NatTraversalError::PunchingFailed(
"No successful punch".to_string(),
),
);
}
}
TraversalPhase::Validation => {
// Check if path is validated
if self.is_path_validated(&session.peer_id) {
session.phase = TraversalPhase::Connected;
self.emit_event(
&mut events,
NatTraversalEvent::TraversalSucceeded {
peer_id: session.peer_id,
final_address: session
.candidates
.first()
.map(|c| c.address)
.unwrap_or_else(create_random_port_bind_addr),
total_time: elapsed,
},
);
info!(
"NAT traversal succeeded for peer {:?} in {:?}",
session.peer_id, elapsed
);
} else {
self.handle_phase_failure(
session,
now,
&mut events,
NatTraversalError::ValidationFailed(
"Path validation timeout".to_string(),
),
);
}
}
TraversalPhase::Connected => {
// Monitor connection health
if !self.is_connection_healthy(&session.peer_id) {
warn!(
"Connection to peer {:?} is no longer healthy",
session.peer_id
);
// Could trigger reconnection logic here
}
}
TraversalPhase::Failed => {
// Session has already failed, no action needed
}
}
}
}
// Phase 1 complete - all DashMap entries are now released
// Phase 1b: Process deferred discovery_manager checks
// Each get_mut() locks only one shard, safe to lock discovery_manager
for (peer_id, time_remaining) in early_discovery_peers {
let discovered_candidates = self
.discovery_manager
.lock()
.get_candidates_for_peer(peer_id);
if !discovered_candidates.is_empty() {
if let Some(mut entry) = self.active_sessions.get_mut(&peer_id) {
let session = entry.value_mut();
session.candidates = discovered_candidates;
session.phase = TraversalPhase::Coordination;
session.started_at = now;
}
self.emit_event(
&mut events,
NatTraversalEvent::PhaseTransition {
peer_id,
from_phase: TraversalPhase::Discovery,
to_phase: TraversalPhase::Coordination,
},
);
info!(
"Peer {:?} early-advanced from Discovery to Coordination ({:.1}s before timeout)",
peer_id,
time_remaining.as_secs_f64()
);
}
}
for peer_id in timeout_discovery_peers {
let discovered_candidates = self
.discovery_manager
.lock()
.get_candidates_for_peer(peer_id);
if !discovered_candidates.is_empty() {
if let Some(mut entry) = self.active_sessions.get_mut(&peer_id) {
let session = entry.value_mut();
session.candidates = discovered_candidates;
session.phase = TraversalPhase::Coordination;
session.started_at = now;
self.emit_event(
&mut events,
NatTraversalEvent::PhaseTransition {
peer_id: session.peer_id,
from_phase: TraversalPhase::Discovery,
to_phase: TraversalPhase::Coordination,
},
);
info!(
"Peer {:?} advanced from Discovery to Coordination at timeout",
session.peer_id,
);
}
} else if let Some(mut entry) = self.active_sessions.get_mut(&peer_id) {
let session = entry.value_mut();
if session.attempt < self.config.max_concurrent_attempts as u32 {
session.attempt += 1;
session.started_at = now;
let backoff_duration = self.calculate_backoff(session.attempt);
warn!(
"Discovery timeout for peer {:?}, retrying (attempt {}), backoff: {:?}",
peer_id, session.attempt, backoff_duration
);
} else {
session.phase = TraversalPhase::Failed;
self.emit_event(
&mut events,
NatTraversalEvent::TraversalFailed {
peer_id,
error: NatTraversalError::NoCandidatesFound,
fallback_available: true,
},
);
error!(
"NAT traversal failed for peer {:?}: no candidates found after {} attempts",
peer_id, session.attempt
);
}
}
}
// Phase 2: Execute deferred work (no DashMap entries held)
// Execute coordination requests
for (peer_id, coordinator) in coordination_requests {
// Re-check for existing connection before executing deferred coordination
// A connection may have been established during the gap between phase collection and execution
if self.has_existing_connection(&peer_id) {
debug!(
"Connection established for peer {:?} before coordination execution, skipping",
peer_id
);
continue;
}
match self.send_coordination_request(peer_id, coordinator) {
Ok(_) => {
self.emit_event(
&mut events,
NatTraversalEvent::CoordinationRequested {
peer_id,
coordinator,
},
);
info!(
"Coordination requested for peer {:?} via {}",
peer_id, coordinator
);
}
Err(e) => {
if let Some(mut session) = self.active_sessions.get_mut(&peer_id) {
self.handle_phase_failure(&mut session, now, &mut events, e);
}
}
}
}
// Execute hole punch requests
for (peer_id, candidates) in hole_punch_requests {
// Re-check for existing connection before executing deferred hole punch
// A connection may have been established during the gap between phase collection and execution
if self.has_existing_connection(&peer_id) {
debug!(
"Connection established for peer {:?} before hole punch execution, skipping",
peer_id
);
continue;
}
if let Err(e) = self.initiate_hole_punching(peer_id, &candidates) {
if let Some(mut session) = self.active_sessions.get_mut(&peer_id) {
self.handle_phase_failure(&mut session, now, &mut events, e);
}
}
}
// Execute validation requests
for (peer_id, address) in validation_requests {
if let Err(e) = self.validate_path(peer_id, address) {
if let Some(mut session) = self.active_sessions.get_mut(&peer_id) {
self.handle_phase_failure(&mut session, now, &mut events, e);
}
}
}
Ok(events)
}
/// Get timeout duration for a specific traversal phase
fn get_phase_timeout(&self, phase: TraversalPhase) -> Duration {
match phase {
// Reduced from 10s to 3s — with early advancement, this is only
// the fallback timeout. Candidates typically arrive within 1-2s.
TraversalPhase::Discovery => Duration::from_secs(3),
TraversalPhase::Coordination => self.config.coordination_timeout,
TraversalPhase::Synchronization => Duration::from_secs(3),
TraversalPhase::Punching => Duration::from_secs(5),
TraversalPhase::Validation => Duration::from_secs(5),
TraversalPhase::Connected => Duration::from_secs(30), // Keepalive check
TraversalPhase::Failed => Duration::ZERO,
}
}
/// Calculate exponential backoff duration for retries
fn calculate_backoff(&self, attempt: u32) -> Duration {
let base = Duration::from_millis(1000);
let max = Duration::from_secs(30);
let backoff = base * 2u32.pow(attempt.saturating_sub(1));
let jitter = std::time::Duration::from_millis((rand::random::<u64>() % 200) as u64);
backoff.min(max) + jitter
}
/// Check connections for observed addresses and feed them to discovery
fn check_connections_for_observed_addresses(
&self,
_events: &mut Vec<NatTraversalEvent>,
) -> Result<(), NatTraversalError> {
// Look for bootstrap connections - they should send us OBSERVED_ADDRESS frames
// In the current implementation, we need to wait for the low-level connection
// to receive OBSERVED_ADDRESS frames and propagate them up
// For now, simulate the discovery for testing
// In production, this would be triggered by actual OBSERVED_ADDRESS frames
// v0.13.0+: All nodes can discover their external address from any connected peer
// DashMap provides lock-free iteration
if !self.connections.is_empty() {
// Check if we have any bootstrap connections
for entry in self.connections.iter() {
let remote_addr = entry.value().remote_address();
// Check if this is a bootstrap node connection
// parking_lot::RwLock doesn't poison
let is_bootstrap = self.bootstrap_nodes.read().iter().any(|node| {
normalize_socket_addr(node.address) == normalize_socket_addr(remote_addr)
});
if is_bootstrap {
// In a real implementation, we would check the connection for observed addresses
// For now, emit a debug message
debug!(
"Bootstrap connection to {} should provide our external address via OBSERVED_ADDRESS frames",
remote_addr
);
// The actual observed address would come from the OBSERVED_ADDRESS frame
// received on this connection
}
}
}
Ok(())
}
/// Handle phase failure with retry logic
fn handle_phase_failure(
&self,
session: &mut NatTraversalSession,
now: std::time::Instant,
events: &mut Vec<NatTraversalEvent>,
error: NatTraversalError,
) {
if session.attempt < self.config.max_concurrent_attempts as u32 {
// Retry with backoff
session.attempt += 1;
session.started_at = now;
let backoff = self.calculate_backoff(session.attempt);
warn!(
"Phase {:?} failed for peer {:?}: {:?}, retrying (attempt {}) after {:?}",
session.phase, session.peer_id, error, session.attempt, backoff
);
} else {
// Max attempts reached
session.phase = TraversalPhase::Failed;
self.emit_event(
events,
NatTraversalEvent::TraversalFailed {
peer_id: session.peer_id,
error,
fallback_available: true,
},
);
error!(
"NAT traversal failed for peer {:?} after {} attempts",
session.peer_id, session.attempt
);
}
}
/// Select a coordinator from available bootstrap nodes
fn select_coordinator(&self) -> Option<SocketAddr> {
// parking_lot::RwLock doesn't poison - always succeeds
let nodes = self.bootstrap_nodes.read();
// Simple round-robin or random selection
if !nodes.is_empty() {
let idx = rand::random::<usize>() % nodes.len();
return Some(nodes[idx].address);
}
None
}
/// Send coordination request to bootstrap node
///
/// This sends a PUNCH_ME_NOW frame with `target_peer_id` set to the coordinator,
/// asking it to relay the coordination request to the target peer.
fn send_coordination_request(
&self,
peer_id: PeerId,
coordinator: SocketAddr,
) -> Result<(), NatTraversalError> {
if self.event_tx.is_some() {
return self.send_coordination_request_v2(peer_id, coordinator);
}
info!(
"Sending authenticated coordination request for peer {} to coordinator {}",
hex::encode(&peer_id.0[..8]),
coordinator
);
let mut initiator_addrs = self
.get_all_observed_external_addresses()?
.into_iter()
.map(normalize_socket_addr)
.collect::<Vec<_>>();
if initiator_addrs.is_empty()
&& let Some(addr) = self.get_observed_external_address()?
{
initiator_addrs.push(normalize_socket_addr(addr));
}
if initiator_addrs.is_empty()
&& let Some(endpoint) = &self.inner_endpoint
{
if let Ok(addr) = endpoint.local_addr() {
initiator_addrs.push(normalize_socket_addr(addr));
}
}
initiator_addrs.sort_unstable();
initiator_addrs.dedup();
if initiator_addrs.is_empty() {
return Err(NatTraversalError::ConfigError(
"No initiator address available for coordination".to_string(),
));
}
let request_id = next_request_id();
let round = 1u32;
let expires_at_unix_ms = now_unix_ms().saturating_add(10_000);
let local_peer_id = self.local_peer_id();
let _envelope = CoordinatorControlEnvelope {
request_id,
expires_at_unix_ms,
message: CoordinatorControlMessage::CoordinationRequest {
initiator: local_peer_id,
target: peer_id,
round,
initiator_addrs: initiator_addrs.clone(),
},
};
info!(
"Using authenticated coordination envelope for target peer {} via normalized coordinator {}",
hex::encode(&peer_id.0[..8]),
normalize_socket_addr(coordinator)
);
let our_external_address = initiator_addrs[0];
// Find the connection to the coordinator
// DashMap provides lock-free mutable iteration
// Normalize addresses to handle IPv4-mapped IPv6 (e.g., [::ffff:1.2.3.4]:9000 == 1.2.3.4:9000)
let normalized_coordinator = normalize_socket_addr(coordinator);
for mut entry in self.connections.iter_mut() {
let conn = entry.value_mut();
let normalized_remote = normalize_socket_addr(conn.remote_address());
if normalized_remote == normalized_coordinator {
// Found connection to coordinator - send PUNCH_ME_NOW with target_peer_id
info!(
"Sending PUNCH_ME_NOW via coordinator {} (normalized: {}) to target peer {}",
coordinator,
normalized_coordinator,
hex::encode(&peer_id.0[..8])
);
// Use round 1 for initial coordination
match conn.send_nat_punch_via_relay(peer_id.0, our_external_address, 1) {
Ok(()) => {
info!(
"Successfully queued PUNCH_ME_NOW for relay to peer {}",
hex::encode(&peer_id.0[..8])
);
return Ok(());
}
Err(e) => {
warn!("Failed to queue PUNCH_ME_NOW frame: {:?}", e);
return Err(NatTraversalError::CoordinationFailed(format!(
"Failed to send PUNCH_ME_NOW: {:?}",
e
)));
}
}
}
}
// If no existing connection, try to establish one
info!(
"No existing connection to coordinator {}, establishing...",
coordinator
);
if let Some(endpoint) = &self.inner_endpoint {
// Use "localhost" as server name - actual authentication is via PQC raw public keys
let server_name = "localhost".to_string();
match endpoint.connect(coordinator, &server_name) {
Ok(connecting) => {
// For sync context, we spawn async task to complete connection and send
info!("Initiated connection to coordinator {}", coordinator);
// Spawn task to handle connection and send coordination
let connections = self.connections.clone();
let low_level_endpoint = endpoint.clone();
let target_peer_id = peer_id;
let external_addr = our_external_address;
tokio::spawn(async move {
// Use 10-second timeout to prevent indefinite waiting if coordinator is frozen
let connect_timeout = Duration::from_secs(10);
match timeout(connect_timeout, connecting).await {
Ok(Ok(connection)) => {
info!("Connected to coordinator {}", coordinator);
let (coordinator_peer_id, coordinator_connection) =
match Self::materialize_authenticated_connection(
connections.as_ref(),
connection,
) {
Ok(result) => result,
Err(error) => {
warn!(
"Failed to register coordinator {} with authenticated identity: {}",
coordinator, error
);
return;
}
};
low_level_endpoint
.register_connection_peer_id(coordinator, coordinator_peer_id);
// Now send the PUNCH_ME_NOW via this new connection
match coordinator_connection.send_nat_punch_via_relay(
target_peer_id.0,
external_addr,
1,
) {
Ok(()) => {
info!(
"Sent PUNCH_ME_NOW to coordinator {} for peer {}",
coordinator,
hex::encode(&target_peer_id.0[..8])
);
}
Err(e) => {
warn!(
"Failed to send PUNCH_ME_NOW after connecting: {:?}",
e
);
}
}
}
Ok(Err(e)) => {
warn!("Failed to connect to coordinator {}: {}", coordinator, e);
}
Err(_) => {
warn!(
"Connection to coordinator {} timed out after {:?}",
coordinator, connect_timeout
);
}
}
});
// Return success to allow traversal to continue
// The actual coordination will happen once connected
Ok(())
}
Err(e) => Err(NatTraversalError::CoordinationFailed(format!(
"Failed to connect to coordinator {coordinator}: {e}"
))),
}
} else {
Err(NatTraversalError::ConfigError(
"QUIC endpoint not initialized".to_string(),
))
}
}
/// Check if the current session has enough state to proceed to hole punching.
fn session_is_synchronized(session: &NatTraversalSession) -> bool {
let has_candidates = !session.candidates.is_empty();
let past_discovery = session.phase as u8 > TraversalPhase::Discovery as u8;
debug!(
"Checking sync for peer {:?}: phase={:?}, candidates={}, past_discovery={}",
session.peer_id,
session.phase,
session.candidates.len(),
past_discovery
);
if has_candidates && past_discovery {
info!(
"Peer {:?} is synchronized with {} candidates",
session.peer_id,
session.candidates.len()
);
return true;
}
if session.phase == TraversalPhase::Synchronization && has_candidates {
info!(
"Peer {:?} in synchronization phase with {} candidates, considering synchronized",
session.peer_id,
session.candidates.len()
);
return true;
}
if session.phase as u8 >= TraversalPhase::Synchronization as u8 {
info!(
"Test mode: Considering peer {:?} synchronized in phase {:?}",
session.peer_id, session.phase
);
return true;
}
warn!("Peer {:?} is not synchronized", session.peer_id);
false
}
/// Initiate hole punching to candidate addresses
fn initiate_hole_punching(
&self,
peer_id: PeerId,
candidates: &[CandidateAddress],
) -> Result<(), NatTraversalError> {
if candidates.is_empty() {
return Err(NatTraversalError::NoCandidatesFound);
}
// Check if connection already exists - no hole punching needed
if self.has_existing_connection(&peer_id) {
info!(
"Connection already exists for peer {:?}, skipping hole punching",
peer_id
);
return Ok(());
}
info!(
"Initiating hole punching for peer {:?} to {} candidates",
peer_id,
candidates.len()
);
{
// Attempt to connect to each candidate address
for candidate in candidates {
debug!(
"Attempting QUIC connection to candidate: {}",
candidate.address
);
// Use the attempt_connection_to_candidate method which handles the actual connection
match self.attempt_connection_to_candidate(peer_id, candidate) {
Ok(_) => {
info!(
"Successfully initiated connection attempt to {}",
candidate.address
);
}
Err(e) => {
warn!(
"Failed to initiate connection to {}: {:?}",
candidate.address, e
);
}
}
}
Ok(())
}
}
/// Check if any hole punch succeeded
fn check_punch_results_for_session(&self, session: &NatTraversalSession) -> Option<SocketAddr> {
let peer_id = session.peer_id;
// Check if we have an established connection to this peer.
if let Some(entry) = self.connections.get(&peer_id) {
// We have a connection! Return its address
let addr = entry.value().remote_address();
info!(
"Found successful connection to peer {:?} at {}",
peer_id, addr
);
return Some(addr);
}
// No connection found, check if we have any validated candidates.
for candidate in &session.candidates {
if matches!(candidate.state, CandidateState::Valid) {
info!(
"Found validated candidate for peer {:?} at {}",
peer_id, candidate.address
);
return Some(candidate.address);
}
}
// For testing: if we're in punching phase and have candidates, simulate success with the first one.
if session.phase == TraversalPhase::Punching && !session.candidates.is_empty() {
let addr = session.candidates[0].address;
info!(
"Simulating successful punch for testing: peer {:?} at {}",
peer_id, addr
);
return Some(addr);
}
// No validated candidates, return first candidate as fallback.
if let Some(first) = session.candidates.first() {
debug!(
"No validated candidates, using first candidate {} for peer {:?}",
first.address, peer_id
);
return Some(first.address);
}
warn!("No successful punch results for peer {:?}", peer_id);
None
}
/// Validate a punched path
fn validate_path(&self, peer_id: PeerId, address: SocketAddr) -> Result<(), NatTraversalError> {
debug!("Validating path to peer {:?} at {}", peer_id, address);
// Check if we have a connection to validate
// DashMap provides lock-free .get()
if let Some(entry) = self.connections.get(&peer_id) {
let conn = entry.value();
// Connection exists, check if it's to the expected address
if normalize_socket_addr(conn.remote_address()) == normalize_socket_addr(address) {
info!(
"Path validation successful for peer {:?} at {}",
peer_id, address
);
// Update candidate state to valid
// DashMap provides lock-free .get_mut() that returns Option<RefMut<K, V>>
if let Some(mut session) = self.active_sessions.get_mut(&peer_id) {
for candidate in &mut session.candidates {
if normalize_socket_addr(candidate.address)
== normalize_socket_addr(address)
{
candidate.state = CandidateState::Valid;
break;
}
}
}
return Ok(());
} else {
warn!(
"Connection address mismatch: expected {}, got {}",
address,
conn.remote_address()
);
}
}
// No connection found, validation failed
Err(NatTraversalError::ValidationFailed(format!(
"No connection found for peer {peer_id:?} at {address}"
)))
}
/// Check if a connection already exists for the given peer.
///
/// This is used to skip unnecessary NAT traversal when a direct connection
/// has already been established. Checking this at multiple points prevents
/// wasted resources on hole punching attempts.
#[inline]
fn has_existing_connection(&self, peer_id: &PeerId) -> bool {
self.connections.contains_key(peer_id)
}
/// Check if path validation succeeded
fn is_path_validated(&self, peer_id: &PeerId) -> bool {
debug!("Checking path validation for peer {:?}", peer_id);
// Check if we have an active connection
if self.has_existing_connection(peer_id) {
info!("Path validated: connection exists for peer {:?}", peer_id);
return true;
}
// Check if we have any validated candidates
// DashMap provides lock-free .get() that returns Option<Ref<K, V>>
if let Some(session) = self.active_sessions.get(peer_id) {
let validated = session
.candidates
.iter()
.any(|c| matches!(c.state, CandidateState::Valid));
if validated {
info!(
"Path validated: found validated candidate for peer {:?}",
peer_id
);
return true;
}
}
warn!("Path not validated for peer {:?}", peer_id);
false
}
/// Check if connection is healthy
fn is_connection_healthy(&self, peer_id: &PeerId) -> bool {
// In real implementation, check QUIC connection status
// DashMap provides lock-free .get()
if self.connections.get(peer_id).is_some() {
// Check if connection is still active
// Note: Connection doesn't have is_closed/is_drained methods
// We use the closed() future to check if still active
return true; // Assume healthy if connection exists in map
}
true
}
/// Convert discovery events to NAT traversal events with proper peer ID resolution
fn convert_discovery_event(
&self,
discovery_event: DiscoveryEvent,
) -> Option<NatTraversalEvent> {
// Get the current active peer ID from sessions
let current_peer_id = self.get_current_discovery_peer_id();
match discovery_event {
DiscoveryEvent::LocalCandidateDiscovered { candidate } => {
Some(NatTraversalEvent::CandidateDiscovered {
peer_id: current_peer_id,
candidate,
})
}
DiscoveryEvent::ServerReflexiveCandidateDiscovered {
candidate,
bootstrap_node: _,
} => Some(NatTraversalEvent::CandidateDiscovered {
peer_id: current_peer_id,
candidate,
}),
// Prediction events removed in minimal flow
DiscoveryEvent::DiscoveryCompleted {
candidate_count: _,
total_duration: _,
success_rate: _,
} => {
// This could trigger the coordination phase
None // For now, don't emit specific event
}
DiscoveryEvent::DiscoveryFailed {
error,
partial_results,
} => Some(NatTraversalEvent::TraversalFailed {
peer_id: current_peer_id,
error: NatTraversalError::CandidateDiscoveryFailed(error.to_string()),
fallback_available: !partial_results.is_empty(),
}),
_ => None, // Other events don't need to be converted
}
}
/// Get the peer ID for the current discovery session
fn get_current_discovery_peer_id(&self) -> PeerId {
// Try to get the peer ID from the most recent active session
// DashMap provides lock-free iteration with .iter()
if let Some(entry) = self
.active_sessions
.iter()
.find(|entry| matches!(entry.value().phase, TraversalPhase::Discovery))
{
return *entry.key();
}
// If no discovery phase session, get any active session
if let Some(entry) = self.active_sessions.iter().next() {
return *entry.key();
}
// Fallback: generate a deterministic peer ID based on local endpoint
self.local_peer_id
}
/// Handle endpoint events from connection-level NAT traversal state machine
#[allow(dead_code)]
pub(crate) async fn handle_endpoint_event(
&self,
event: crate::shared::EndpointEventInner,
) -> Result<(), NatTraversalError> {
match event {
crate::shared::EndpointEventInner::NatCandidateValidated { address, challenge } => {
info!(
"NAT candidate validation succeeded for {} with challenge {:016x}",
address, challenge
);
// Find and update the active session with validated candidate
// Use read-only scan + targeted get_mut to avoid iter_mut() + callback re-entrancy
let matching_peer_id = self
.active_sessions
.iter()
.find(|entry| {
entry.value().candidates.iter().any(|c| {
normalize_socket_addr(c.address) == normalize_socket_addr(address)
})
})
.map(|entry| *entry.key());
if let Some(peer_id) = matching_peer_id {
if let Some(mut entry) = self.active_sessions.get_mut(&peer_id) {
entry.value_mut().phase = TraversalPhase::Connected;
}
// Callback outside DashMap guard to prevent re-entrancy deadlock
if let Some(ref callback) = self.event_callback {
callback(NatTraversalEvent::CandidateValidated {
peer_id,
candidate_address: address,
});
}
}
// Attempt to establish connection using this validated candidate (after releasing DashMap ref)
if let Some(peer_id) = matching_peer_id {
return self
.establish_connection_to_validated_candidate(peer_id, address)
.await;
}
debug!(
"Validated candidate {} not found in active sessions",
address
);
Ok(())
}
crate::shared::EndpointEventInner::RelayPunchMeNow(target_peer_id, punch_frame) => {
// RFC-compliant address-based relay: find peer by address, not synthetic peer ID
let target_address = punch_frame.address;
let normalized_target = normalize_socket_addr(target_address);
info!(
"Relaying PUNCH_ME_NOW to address {} (normalized: {}) or peer {:?}",
target_address,
normalized_target,
hex::encode(&target_peer_id[..8])
);
// DashMap provides lock-free access
// First try peer ID lookup (if we have actual peer ID)
let target_peer = PeerId(target_peer_id);
let connection_found = if let Some(entry) = self.connections.get(&target_peer) {
Some((target_peer, entry.value().clone()))
} else {
// RFC approach: find connection by address match
// Check both remote_address and observed_address for the target
self.connections.iter().find_map(|entry| {
let peer_id = *entry.key();
let conn = entry.value();
let remote_normalized = normalize_socket_addr(conn.remote_address());
let observed_normalized = conn.observed_address().map(normalize_socket_addr);
// Match on IP (port may differ due to NAT)
let remote_ip_match = remote_normalized.ip() == normalized_target.ip();
let observed_ip_match = observed_normalized
.map(|obs| obs.ip() == normalized_target.ip())
.unwrap_or(false);
if remote_ip_match || observed_ip_match {
debug!(
"Found peer {} by address match: remote={}, observed={:?}, target={}",
hex::encode(&peer_id.0[..8]),
remote_normalized,
observed_normalized,
normalized_target
);
Some((peer_id, conn.clone()))
} else {
None
}
})
};
if let Some((_peer_id, connection)) = connection_found {
// Send the PUNCH_ME_NOW frame via a unidirectional stream
let mut send_stream = connection.open_uni().await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to open stream: {e}"))
})?;
// Encode the frame data
let mut frame_data = Vec::new();
punch_frame.encode(&mut frame_data);
send_stream.write_all(&frame_data).await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to send frame: {e}"))
})?;
let _ = send_stream.finish();
info!(
"Successfully relayed PUNCH_ME_NOW frame to address {}",
normalized_target
);
Ok(())
} else {
warn!(
"No connection found for target address {} (checked {} connections)",
normalized_target,
self.connections.len()
);
Err(NatTraversalError::PeerNotConnected)
}
}
crate::shared::EndpointEventInner::SendAddressFrame(add_address_frame) => {
info!(
"Sending AddAddress frame for address {}",
add_address_frame.address
);
// Find all active connections and send the AddAddress frame
// DashMap: collect connections to avoid holding ref during async operations
let connections_snapshot: Vec<_> = self
.connections
.iter()
.map(|entry| (*entry.key(), entry.value().clone()))
.collect();
for (peer_id, connection) in connections_snapshot {
// Send AddAddress frame via unidirectional stream
let mut send_stream = connection.open_uni().await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to open stream: {e}"))
})?;
// Encode the frame data
let mut frame_data = Vec::new();
add_address_frame.encode(&mut frame_data);
send_stream.write_all(&frame_data).await.map_err(|e| {
NatTraversalError::NetworkError(format!("Failed to send frame: {e}"))
})?;
let _ = send_stream.finish();
debug!("Sent AddAddress frame to peer {:?}", peer_id);
}
Ok(())
}
_ => {
// Other endpoint events not related to NAT traversal
debug!("Ignoring non-NAT traversal endpoint event: {:?}", event);
Ok(())
}
}
}
/// Establish connection to a validated candidate address
#[allow(dead_code)]
async fn establish_connection_to_validated_candidate(
&self,
peer_id: PeerId,
candidate_address: SocketAddr,
) -> Result<(), NatTraversalError> {
info!(
"Establishing connection to validated candidate {} for peer {:?}",
candidate_address, peer_id
);
let endpoint = self.inner_endpoint.as_ref().ok_or_else(|| {
NatTraversalError::ConfigError("QUIC endpoint not initialized".to_string())
})?;
// Attempt connection to the validated address
let connecting = endpoint
.connect(candidate_address, "nat-traversal-peer")
.map_err(|e| {
NatTraversalError::ConnectionFailed(format!("Failed to initiate connection: {e}"))
})?;
let connection = timeout(
self.timeout_config
.nat_traversal
.connection_establishment_timeout,
connecting,
)
.await
.map_err(|_| NatTraversalError::Timeout)?
.map_err(|e| NatTraversalError::ConnectionFailed(format!("Connection failed: {e}")))?;
// CRITICAL: Lock ordering fix for deadlock prevention
// Always access active_sessions BEFORE connections to prevent A-B vs B-A deadlock.
// Pattern in poll(): active_sessions.iter_mut() -> connections access
// Pattern here must match: active_sessions access -> connections.insert()
//
// Step 1: Update session state first (acquires active_sessions lock)
if let Some(mut session) = self.active_sessions.get_mut(&peer_id) {
session.phase = TraversalPhase::Connected;
}
// Step 2: Drop the active_sessions ref before accessing connections
// (ref is dropped when session goes out of scope at end of if block)
// Step 3: Now safe to insert into connections
self.connections.insert(peer_id, connection.clone());
if let Some(mut entry) = self.active_sessions.get_mut(&peer_id) {
entry.value_mut().session_state.connection = Some(connection.clone());
}
let _ = self.spawn_connection_handler(peer_id, connection.clone(), Side::Client);
// Trigger success callback (we initiated connection attempt = Client side)
let event = NatTraversalEvent::ConnectionEstablished {
peer_id,
remote_address: candidate_address,
side: Side::Client,
};
if let Some(ref tx) = self.event_tx {
let _ = tx.send(event.clone());
}
if let Some(ref callback) = self.event_callback {
callback(event);
}
self.incoming_notify.notify_waiters();
info!(
"Successfully established connection to peer {:?} at {}",
peer_id, candidate_address
);
Ok(())
}
/// Send ADD_ADDRESS frame to advertise a candidate to a peer
///
/// This is the bridge between candidate discovery and actual frame transmission.
/// It finds the connection to the peer and sends an ADD_ADDRESS frame using
/// the QUIC extension frame API.
async fn send_candidate_advertisement(
&self,
peer_id: PeerId,
candidate: &CandidateAddress,
) -> Result<(), NatTraversalError> {
debug!(
"Sending candidate advertisement to peer {:?}: {}",
peer_id, candidate.address
);
// DashMap provides lock-free .get_mut()
if let Some(mut entry) = self.connections.get_mut(&peer_id) {
let conn = entry.value_mut();
// Use the connection's API to enqueue a proper NAT traversal frame
match conn.send_nat_address_advertisement(candidate.address, candidate.priority) {
Ok(seq) => {
info!(
"Queued ADD_ADDRESS via connection API: peer={:?}, addr={}, priority={}, seq={}",
peer_id, candidate.address, candidate.priority, seq
);
Ok(())
}
Err(e) => Err(NatTraversalError::ProtocolError(format!(
"Failed to queue ADD_ADDRESS: {e:?}"
))),
}
} else {
debug!("No active connection for peer {:?}", peer_id);
Ok(())
}
}
/// Send PUNCH_ME_NOW frame to coordinate hole punching
///
/// This method sends hole punching coordination frames using the real
/// QUIC extension frame API instead of application-level streams.
#[allow(dead_code)]
async fn send_punch_coordination(
&self,
peer_id: PeerId,
paired_with_sequence_number: u64,
address: SocketAddr,
round: u32,
) -> Result<(), NatTraversalError> {
debug!(
"Sending punch coordination to peer {:?}: seq={}, addr={}, round={}",
peer_id, paired_with_sequence_number, address, round
);
// DashMap provides lock-free .get_mut()
if let Some(mut entry) = self.connections.get_mut(&peer_id) {
entry
.value_mut()
.send_nat_punch_coordination(paired_with_sequence_number, address, round)
.map_err(|e| {
NatTraversalError::ProtocolError(format!("Failed to queue PUNCH_ME_NOW: {e:?}"))
})
} else {
Err(NatTraversalError::PeerNotConnected)
}
}
/// Get NAT traversal statistics
#[allow(clippy::panic)]
pub fn get_nat_stats(
&self,
) -> Result<NatTraversalStatistics, Box<dyn std::error::Error + Send + Sync>> {
// Return default statistics for now
// In a real implementation, this would collect actual stats from the endpoint
Ok(NatTraversalStatistics {
active_sessions: self.active_sessions.len(),
// parking_lot::RwLock doesn't poison - always succeeds
total_bootstrap_nodes: self.bootstrap_nodes.read().len(),
successful_coordinations: 7,
average_coordination_time: self.timeout_config.nat_traversal.retry_interval,
total_attempts: 10,
successful_connections: 7,
direct_connections: 5,
relayed_connections: 2,
})
}
}
impl fmt::Debug for NatTraversalEndpoint {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_struct("NatTraversalEndpoint")
.field("config", &self.config)
.field("bootstrap_nodes", &"<RwLock>")
.field("active_sessions", &"<DashMap>")
.field("event_callback", &self.event_callback.is_some())
.finish()
}
}
/// Statistics about NAT traversal performance
#[derive(Debug, Clone, Default)]
pub struct NatTraversalStatistics {
/// Number of active NAT traversal sessions
pub active_sessions: usize,
/// Total number of known bootstrap nodes
pub total_bootstrap_nodes: usize,
/// Total successful coordinations
pub successful_coordinations: u32,
/// Average time for coordination
pub average_coordination_time: Duration,
/// Total NAT traversal attempts
pub total_attempts: u32,
/// Successful connections established
pub successful_connections: u32,
/// Direct connections established (no relay)
pub direct_connections: u32,
/// Relayed connections
pub relayed_connections: u32,
}
impl fmt::Display for NatTraversalError {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Self::NoBootstrapNodes => write!(f, "no bootstrap nodes available"),
Self::NoCandidatesFound => write!(f, "no address candidates found"),
Self::CandidateDiscoveryFailed(msg) => write!(f, "candidate discovery failed: {msg}"),
Self::CoordinationFailed(msg) => write!(f, "coordination failed: {msg}"),
Self::HolePunchingFailed => write!(f, "hole punching failed"),
Self::PunchingFailed(msg) => write!(f, "punching failed: {msg}"),
Self::ValidationFailed(msg) => write!(f, "validation failed: {msg}"),
Self::ValidationTimeout => write!(f, "validation timeout"),
Self::NetworkError(msg) => write!(f, "network error: {msg}"),
Self::ConfigError(msg) => write!(f, "configuration error: {msg}"),
Self::ProtocolError(msg) => write!(f, "protocol error: {msg}"),
Self::Timeout => write!(f, "operation timed out"),
Self::ConnectionFailed(msg) => write!(f, "connection failed: {msg}"),
Self::TraversalFailed(msg) => write!(f, "traversal failed: {msg}"),
Self::PeerNotConnected => write!(f, "peer not connected"),
}
}
}
impl std::error::Error for NatTraversalError {}
impl fmt::Display for PeerId {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
// Display first 8 bytes as hex (16 characters)
for byte in &self.0[..8] {
write!(f, "{byte:02x}")?;
}
Ok(())
}
}
impl From<[u8; 32]> for PeerId {
fn from(bytes: [u8; 32]) -> Self {
Self(bytes)
}
}
impl PeerId {
/// Convert the peer ID to a hexadecimal string
pub fn to_hex(&self) -> String {
hex::encode(self.0)
}
}
/// Dummy certificate verifier that accepts any certificate
/// WARNING: This is only for testing/demo purposes - use proper verification in production!
#[derive(Debug)]
#[allow(dead_code)]
struct SkipServerVerification;
impl SkipServerVerification {
#[allow(dead_code)]
fn new() -> Arc<Self> {
Arc::new(Self)
}
}
impl rustls::client::danger::ServerCertVerifier for SkipServerVerification {
fn verify_server_cert(
&self,
_end_entity: &rustls::pki_types::CertificateDer<'_>,
_intermediates: &[rustls::pki_types::CertificateDer<'_>],
_server_name: &rustls::pki_types::ServerName<'_>,
_ocsp_response: &[u8],
_now: rustls::pki_types::UnixTime,
) -> Result<rustls::client::danger::ServerCertVerified, rustls::Error> {
Ok(rustls::client::danger::ServerCertVerified::assertion())
}
fn verify_tls12_signature(
&self,
_message: &[u8],
_cert: &rustls::pki_types::CertificateDer<'_>,
_dss: &rustls::DigitallySignedStruct,
) -> Result<rustls::client::danger::HandshakeSignatureValid, rustls::Error> {
Ok(rustls::client::danger::HandshakeSignatureValid::assertion())
}
fn verify_tls13_signature(
&self,
_message: &[u8],
_cert: &rustls::pki_types::CertificateDer<'_>,
_dss: &rustls::DigitallySignedStruct,
) -> Result<rustls::client::danger::HandshakeSignatureValid, rustls::Error> {
Ok(rustls::client::danger::HandshakeSignatureValid::assertion())
}
fn supported_verify_schemes(&self) -> Vec<rustls::SignatureScheme> {
// v0.2: Pure PQC - only ML-DSA-65 (IANA 0x0905)
vec![rustls::SignatureScheme::ML_DSA_65]
}
}
/// Default token store that accepts all tokens (for demo purposes)
#[allow(dead_code)]
struct DefaultTokenStore;
impl crate::TokenStore for DefaultTokenStore {
fn insert(&self, _server_name: &str, _token: bytes::Bytes) {
// Ignore token storage for demo
}
fn take(&self, _server_name: &str) -> Option<bytes::Bytes> {
None
}
}
#[cfg(test)]
#[allow(clippy::unwrap_used, clippy::expect_used)]
mod tests {
use super::*;
#[test]
fn test_nat_traversal_config_default() {
let config = NatTraversalConfig::default();
// v0.13.0+: No role field - all nodes are symmetric P2P nodes
assert!(config.known_peers.is_empty());
assert_eq!(config.max_candidates, 8);
assert!(config.enable_symmetric_nat);
assert!(config.enable_relay_fallback);
}
#[test]
fn test_nat_config_default_has_no_transport_registry() {
let config = NatTraversalConfig::default();
assert!(
config.transport_registry.is_none(),
"Default NatTraversalConfig should have no transport_registry"
);
}
#[test]
fn test_nat_config_can_set_transport_registry() {
use crate::transport::TransportRegistry;
let registry = Arc::new(TransportRegistry::new());
let config = NatTraversalConfig {
transport_registry: Some(Arc::clone(®istry)),
..Default::default()
};
assert!(config.transport_registry.is_some());
let config_registry = config.transport_registry.unwrap();
assert!(Arc::ptr_eq(&config_registry, ®istry));
}
/// Test that TransportRegistry::get_udp_local_addr() returns None when empty
#[test]
fn test_registry_get_udp_local_addr_empty() {
use crate::transport::TransportRegistry;
let registry = TransportRegistry::new();
assert!(
registry.get_udp_local_addr().is_none(),
"Empty registry should return None for UDP address"
);
}
/// Test that TransportRegistry::get_udp_socket() returns None when empty
#[test]
fn test_registry_get_udp_socket_empty() {
use crate::transport::TransportRegistry;
let registry = TransportRegistry::new();
assert!(
registry.get_udp_socket().is_none(),
"Empty registry should return None for UDP socket"
);
}
/// Test that NatTraversalEndpoint stores and exposes transport_registry
#[tokio::test]
async fn test_endpoint_stores_transport_registry() {
use crate::transport::TransportRegistry;
// Create a registry
let registry = Arc::new(TransportRegistry::new());
// Create config with registry
let config = NatTraversalConfig {
transport_registry: Some(Arc::clone(®istry)),
bind_addr: Some("127.0.0.1:0".parse().unwrap()),
..Default::default()
};
// Create endpoint
let endpoint = NatTraversalEndpoint::new(config, None, None)
.await
.expect("Endpoint creation should succeed");
// Verify registry is accessible
let stored_registry = endpoint.transport_registry();
assert!(
stored_registry.is_some(),
"Endpoint should have transport_registry"
);
assert!(
Arc::ptr_eq(stored_registry.unwrap(), ®istry),
"Stored registry should be the same Arc as provided"
);
}
/// Test endpoint creation without registry (backward compatibility)
#[tokio::test]
async fn test_endpoint_without_transport_registry() {
let config = NatTraversalConfig {
transport_registry: None,
bind_addr: Some("127.0.0.1:0".parse().unwrap()),
..Default::default()
};
// Create endpoint - should succeed without registry
let endpoint = NatTraversalEndpoint::new(config, None, None)
.await
.expect("Endpoint creation without registry should succeed");
// Verify registry is None
assert!(
endpoint.transport_registry().is_none(),
"Endpoint without registry config should have None"
);
}
#[test]
fn test_peer_id_display() {
let peer_id = PeerId([
0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0x00, 0x11, 0x22, 0x33, 0x44, 0x55,
0x66, 0x77, 0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff, 0x00, 0x11, 0x22, 0x33,
0x44, 0x55, 0x66, 0x77,
]);
assert_eq!(format!("{peer_id}"), "0123456789abcdef");
}
#[test]
fn test_bootstrap_node_management() {
let _config = NatTraversalConfig::default();
// Note: This will fail due to ServerConfig requirement in new() - for illustration only
// let endpoint = NatTraversalEndpoint::new(config, None).unwrap();
}
#[test]
fn test_candidate_address_validation() {
use std::net::{IpAddr, Ipv4Addr, Ipv6Addr};
// Valid addresses
assert!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(192, 168, 1, 1)),
8080
))
.is_ok()
);
assert!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(8, 8, 8, 8)),
53
))
.is_ok()
);
assert!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V6(Ipv6Addr::new(0x2001, 0x4860, 0x4860, 0, 0, 0, 0, 0x8888)),
443
))
.is_ok()
);
// Invalid port 0
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(192, 168, 1, 1)),
0
)),
Err(CandidateValidationError::InvalidPort(0))
));
// Privileged port (non-test mode would fail)
#[cfg(not(test))]
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(192, 168, 1, 1)),
80
)),
Err(CandidateValidationError::PrivilegedPort(80))
));
// Unspecified addresses
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::UNSPECIFIED),
8080
)),
Err(CandidateValidationError::UnspecifiedAddress)
));
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V6(Ipv6Addr::UNSPECIFIED),
8080
)),
Err(CandidateValidationError::UnspecifiedAddress)
));
// Broadcast address
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::BROADCAST),
8080
)),
Err(CandidateValidationError::BroadcastAddress)
));
// Multicast addresses
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(224, 0, 0, 1)),
8080
)),
Err(CandidateValidationError::MulticastAddress)
));
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V6(Ipv6Addr::new(0xff02, 0, 0, 0, 0, 0, 0, 1)),
8080
)),
Err(CandidateValidationError::MulticastAddress)
));
// Reserved addresses
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(0, 0, 0, 1)),
8080
)),
Err(CandidateValidationError::ReservedAddress)
));
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V4(Ipv4Addr::new(240, 0, 0, 1)),
8080
)),
Err(CandidateValidationError::ReservedAddress)
));
// Documentation address
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V6(Ipv6Addr::new(0x2001, 0x0db8, 0, 0, 0, 0, 0, 1)),
8080
)),
Err(CandidateValidationError::DocumentationAddress)
));
// IPv4-mapped IPv6
assert!(matches!(
CandidateAddress::validate_address(&SocketAddr::new(
IpAddr::V6(Ipv6Addr::new(0, 0, 0, 0, 0, 0xffff, 0xc0a8, 0x0001)),
8080
)),
Err(CandidateValidationError::IPv4MappedAddress)
));
}
#[test]
fn test_candidate_address_suitability_for_nat_traversal() {
use std::net::{IpAddr, Ipv4Addr, Ipv6Addr};
// Create valid candidates
let public_v4 = CandidateAddress::new(
SocketAddr::new(IpAddr::V4(Ipv4Addr::new(8, 8, 8, 8)), 8080),
100,
CandidateSource::Observed { by_node: None },
)
.unwrap();
assert!(public_v4.is_suitable_for_nat_traversal());
let private_v4 = CandidateAddress::new(
SocketAddr::new(IpAddr::V4(Ipv4Addr::new(192, 168, 1, 1)), 8080),
100,
CandidateSource::Local,
)
.unwrap();
assert!(private_v4.is_suitable_for_nat_traversal());
// Link-local should not be suitable
let link_local_v4 = CandidateAddress::new(
SocketAddr::new(IpAddr::V4(Ipv4Addr::new(169, 254, 1, 1)), 8080),
100,
CandidateSource::Local,
)
.unwrap();
assert!(!link_local_v4.is_suitable_for_nat_traversal());
// Global unicast IPv6 should be suitable
let global_v6 = CandidateAddress::new(
SocketAddr::new(
IpAddr::V6(Ipv6Addr::new(0x2001, 0x4860, 0x4860, 0, 0, 0, 0, 0x8888)),
8080,
),
100,
CandidateSource::Observed { by_node: None },
)
.unwrap();
assert!(global_v6.is_suitable_for_nat_traversal());
// Link-local IPv6 should not be suitable
let link_local_v6 = CandidateAddress::new(
SocketAddr::new(IpAddr::V6(Ipv6Addr::new(0xfe80, 0, 0, 0, 0, 0, 0, 1)), 8080),
100,
CandidateSource::Local,
)
.unwrap();
assert!(!link_local_v6.is_suitable_for_nat_traversal());
// Unique local IPv6 should not be suitable for external traversal
let unique_local_v6 = CandidateAddress::new(
SocketAddr::new(IpAddr::V6(Ipv6Addr::new(0xfc00, 0, 0, 0, 0, 0, 0, 1)), 8080),
100,
CandidateSource::Local,
)
.unwrap();
assert!(!unique_local_v6.is_suitable_for_nat_traversal());
// Loopback should be suitable only in test mode
#[cfg(test)]
{
let loopback_v4 = CandidateAddress::new(
SocketAddr::new(IpAddr::V4(Ipv4Addr::LOCALHOST), 8080),
100,
CandidateSource::Local,
)
.unwrap();
assert!(loopback_v4.is_suitable_for_nat_traversal());
let loopback_v6 = CandidateAddress::new(
SocketAddr::new(IpAddr::V6(Ipv6Addr::LOCALHOST), 8080),
100,
CandidateSource::Local,
)
.unwrap();
assert!(loopback_v6.is_suitable_for_nat_traversal());
}
}
#[test]
fn test_candidate_effective_priority() {
use std::net::{IpAddr, Ipv4Addr};
let mut candidate = CandidateAddress::new(
SocketAddr::new(IpAddr::V4(Ipv4Addr::new(192, 168, 1, 1)), 8080),
100,
CandidateSource::Local,
)
.unwrap();
// New state - slightly reduced priority
assert_eq!(candidate.effective_priority(), 90);
// Validating state - small reduction
candidate.state = CandidateState::Validating;
assert_eq!(candidate.effective_priority(), 95);
// Valid state - full priority
candidate.state = CandidateState::Valid;
assert_eq!(candidate.effective_priority(), 100);
// Failed state - zero priority
candidate.state = CandidateState::Failed;
assert_eq!(candidate.effective_priority(), 0);
// Removed state - zero priority
candidate.state = CandidateState::Removed;
assert_eq!(candidate.effective_priority(), 0);
}
/// Test that transport listener handles field is properly initialized
/// This verifies Phase 1.2 infrastructure: field exists and is empty by default
#[tokio::test]
async fn test_transport_listener_handles_initialized() {
// Create config without transport registry
let config = NatTraversalConfig {
transport_registry: None,
bind_addr: Some("127.0.0.1:0".parse().unwrap()),
..Default::default()
};
// Create endpoint without registry
let endpoint = NatTraversalEndpoint::new(config, None, None)
.await
.expect("Endpoint creation should succeed");
// Verify handles field exists and is empty when no registry provided
let handles = endpoint.transport_listener_handles.lock();
assert!(
handles.is_empty(),
"Should have no listener tasks when no transport registry provided"
);
drop(handles);
endpoint.shutdown().await.expect("Shutdown should succeed");
}
/// Test that shutdown properly handles empty transport listener handles
#[tokio::test]
async fn test_shutdown_with_no_transport_listeners() {
let config = NatTraversalConfig {
transport_registry: None,
bind_addr: Some("127.0.0.1:0".parse().unwrap()),
..Default::default()
};
let endpoint = NatTraversalEndpoint::new(config, None, None)
.await
.expect("Endpoint creation should succeed");
// Shutdown should succeed even with no transport listeners
endpoint
.shutdown()
.await
.expect("Shutdown should succeed with no listeners");
// Verify handles remain empty after shutdown
let handles = endpoint.transport_listener_handles.lock();
assert!(
handles.is_empty(),
"Handles should remain empty after shutdown"
);
}
}