Source file dns.ml
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
type proto = [ `Tcp | `Udp ]
let max_rdata_length =
64641
let andThen v f = match v with 0 -> f | x -> x
let opt_eq f a b = match a, b with
| Some a, Some b -> f a b
| None, None -> true
| _ -> false
let guard p err = if p then Ok () else Error err
let src = Logs.Src.create "dns" ~doc:"DNS core"
module Log = (val Logs.src_log src : Logs.LOG)
module Class = struct
type t =
| IN
| CHAOS
| HESIOD
| NONE
| ANY_CLASS
let to_int = function
| IN -> 1
| CHAOS -> 3
| HESIOD -> 4
| NONE -> 254
| ANY_CLASS -> 255
let _compare a b = Int.compare (to_int a) (to_int b)
let of_int ?(off = 0) = function
| 1 -> Ok IN
| 3 -> Ok CHAOS
| 4 -> Ok HESIOD
| 254 -> Ok NONE
| 255 -> Ok ANY_CLASS
| c -> Error (`Not_implemented (off, Fmt.str "class %X" c))
let to_string = function
| IN -> "IN"
| CHAOS -> "CHAOS"
| HESIOD -> "HESIOD"
| NONE -> "NONE"
| ANY_CLASS -> "ANY_CLASS"
let _pp ppf c = Fmt.string ppf (to_string c)
end
module Opcode = struct
type t =
| Query
| IQuery
| Status
| Notify
| Update
let to_int = function
| Query -> 0
| IQuery -> 1
| Status -> 2
| Notify -> 4
| Update -> 5
let compare a b = Int.compare (to_int a) (to_int b)
let of_int ?(off = 0) = function
| 0 -> Ok Query
| 1 -> Ok IQuery
| 2 -> Ok Status
| 4 -> Ok Notify
| 5 -> Ok Update
| x -> Error (`Not_implemented (off, Fmt.str "opcode 0x%X" x))
let to_string = function
| Query -> "Query"
| IQuery -> "IQuery"
| Status -> "Status"
| Notify -> "Notify"
| Update -> "Update"
let pp ppf t = Fmt.string ppf (to_string t)
end
module Rcode = struct
type t =
| NoError
| FormErr
| ServFail
| NXDomain
| NotImp
| Refused
| YXDomain
| YXRRSet
| NXRRSet
| NotAuth
| NotZone
| BadVersOrSig
| BadKey
| BadTime
| BadMode
| BadName
| BadAlg
| BadTrunc
| BadCookie
let to_int = function
| NoError -> 0 | FormErr -> 1 | ServFail -> 2 | NXDomain -> 3
| NotImp -> 4 | Refused -> 5 | YXDomain -> 6 | YXRRSet -> 7
| NXRRSet -> 8 | NotAuth -> 9 | NotZone -> 10 | BadVersOrSig -> 16
| BadKey -> 17 | BadTime -> 18 | BadMode -> 19 | BadName -> 20
| BadAlg -> 21 | BadTrunc -> 22 | BadCookie -> 23
let compare a b = Int.compare (to_int a) (to_int b)
let of_int ?(off = 0) = function
| 0 -> Ok NoError | 1 -> Ok FormErr | 2 -> Ok ServFail
| 3 -> Ok NXDomain | 4 -> Ok NotImp | 5 -> Ok Refused
| 6 -> Ok YXDomain | 7 -> Ok YXRRSet | 8 -> Ok NXRRSet
| 9 -> Ok NotAuth | 10 -> Ok NotZone | 16 -> Ok BadVersOrSig
| 17 -> Ok BadKey | 18 -> Ok BadTime | 19 -> Ok BadMode
| 20 -> Ok BadName | 21 -> Ok BadAlg | 22 -> Ok BadTrunc
| 23 -> Ok BadCookie
| x -> Error (`Not_implemented (off, Fmt.str "rcode 0x%04X" x))
let to_string = function
| NoError -> "no error" | FormErr -> "form error"
| ServFail -> "server failure" | NXDomain -> "no such domain"
| NotImp -> "not implemented" | Refused -> "refused"
| YXDomain -> "name exists when it should not"
| YXRRSet -> "resource record set exists when it should not"
| NXRRSet -> "resource record set that should exist does not"
| NotAuth -> "server not authoritative for zone or not authorized"
| NotZone -> "name not contained in zone"
| BadVersOrSig -> "bad version or signature"
| BadKey -> "bad TSIG key" | BadTime -> "signature time out of window"
| BadMode -> "bad TKEY mode" | BadName -> "duplicate key name"
| BadAlg -> "unsupported algorithm" | BadTrunc -> "bad truncation"
| BadCookie -> "bad cookie"
let pp ppf r = Fmt.string ppf (to_string r)
end
let ( let* ) = Result.bind
module Name = struct
module Int_map = Map.Make(struct
type t = int
let compare = Int.compare
end)
type name_offset_map = int Domain_name.Map.t
let ptr_tag = 0xC0
let decode names buf ~off =
let rec aux offsets off =
match Cstruct.get_uint8 buf off with
| 0 -> Ok ((`Z, off), offsets, succ off)
| i when i >= ptr_tag ->
let ptr = (i - ptr_tag) lsl 8 + Cstruct.get_uint8 buf (succ off) in
Ok ((`P ptr, off), offsets, off + 2)
| i when i >= 64 -> Error (`Malformed (off, Fmt.str "label tag 0x%x" i))
| i ->
let name = Cstruct.to_string (Cstruct.sub buf (succ off) i) in
aux ((name, off) :: offsets) (succ off + i)
in
let* l, offs, foff = (try aux [] off with Invalid_argument _ -> Error `Partial) in
let* off, name, size =
match l with
| `Z, off -> Ok (off, Domain_name.root, 1)
| `P p, off -> match Int_map.find p names with
| exception Not_found ->
Error (`Malformed (off, "bad label offset: " ^ string_of_int p))
| (exp, size) -> Ok (off, exp, size)
in
let names = Int_map.add off (name, size) names in
let t = Array.(append (Domain_name.to_array name) (make (List.length offs) "")) in
let names, _, size =
List.fold_left (fun (names, idx, size) (label, off) ->
let s = succ size + String.length label in
Array.set t idx label ;
let sub = Domain_name.of_array (Array.sub t 0 (succ idx)) in
Int_map.add off (sub, s) names, succ idx, s)
(names, Array.length (Domain_name.to_array name), size) offs
in
let t = Domain_name.of_array t in
if size > 255 then
Error (`Malformed (off, "name too long"))
else
Ok (t, names, foff)
let encode : ?compress:bool -> 'a Domain_name.t -> int Domain_name.Map.t ->
Cstruct.t -> int -> int Domain_name.Map.t * int =
fun ?(compress = true) name names buf off ->
let name = Domain_name.raw name in
let encode_lbl lbl off =
let l = String.length lbl in
Cstruct.set_uint8 buf off l ;
Cstruct.blit_from_string lbl 0 buf (succ off) l ;
off + succ l
and z off =
Cstruct.set_uint8 buf off 0 ;
succ off
in
let maybe_insert_label name off names =
if off < 1 lsl 14 then
Domain_name.Map.add name off names
else
names
and name_remainder arr l off =
let last = Array.get arr (pred l)
and rem = Array.sub arr 0 (pred l)
in
let l = encode_lbl last off in
l, Domain_name.of_array rem
in
let names, off =
if compress then
let rec one names off name =
let arr = Domain_name.to_array name in
let l = Array.length arr in
if l = 0 then
names, z off
else
match Domain_name.Map.find name names with
| None ->
let l, rem = name_remainder arr l off in
one (maybe_insert_label name off names) l rem
| Some ptr ->
let data = ptr_tag lsl 8 + ptr in
Cstruct.BE.set_uint16 buf off data ;
names, off + 2
in
one names off name
else
let rec one names off name =
let arr = Domain_name.to_array name in
let l = Array.length arr in
if l = 0 then
names, z off
else
let l, rem = name_remainder arr l off in
one (maybe_insert_label name off names) l rem
in
one names off name
in
names, off
let host off name =
Result.map_error (function `Msg m ->
`Malformed (off, Fmt.str "invalid hostname %a: %s" Domain_name.pp name m))
(Domain_name.host name)
end
module Soa = struct
type t = {
nameserver : [ `raw ] Domain_name.t ;
hostmaster : [ `raw ] Domain_name.t ;
serial : int32 ;
refresh : int32 ;
retry : int32 ;
expiry : int32 ;
minimum : int32 ;
}
let default_refresh = 86400l
let default_retry = 7200l
let default_expiry = 3600000l
let default_minimum = 3600l
let create ?(serial = 0l) ?(refresh = default_refresh) ?(retry = default_retry)
?(expiry = default_expiry) ?(minimum = default_minimum) ?hostmaster nameserver =
let nameserver = Domain_name.raw nameserver in
let hostmaster = match hostmaster with
| None -> Domain_name.(prepend_label_exn (drop_label_exn nameserver) "hostmaster")
| Some x -> Domain_name.raw x
in
{ nameserver ; hostmaster ; serial ; refresh ; retry ; expiry ; minimum }
let canonical t =
{ t with nameserver = Domain_name.canonical t.nameserver ;
hostmaster = Domain_name.canonical t.hostmaster }
let pp ppf soa =
Fmt.pf ppf "SOA %a %a %lu %lu %lu %lu %lu"
Domain_name.pp soa.nameserver Domain_name.pp soa.hostmaster
soa.serial soa.refresh soa.retry soa.expiry soa.minimum
let compare soa soa' =
andThen (Int32.compare soa.serial soa'.serial)
(andThen (Domain_name.compare soa.nameserver soa'.nameserver)
(andThen (Domain_name.compare soa.hostmaster soa'.hostmaster)
(andThen (Int32.compare soa.refresh soa'.refresh)
(andThen (Int32.compare soa.retry soa'.retry)
(andThen (Int32.compare soa.expiry soa'.expiry)
(Int32.compare soa.minimum soa'.minimum))))))
let newer ~old soa = Int32.sub soa.serial old.serial > 0l
let decode_exn names buf ~off ~len:_ =
let* nameserver, names, off = Name.decode names buf ~off in
let* hostmaster, names, off = Name.decode names buf ~off in
let serial = Cstruct.BE.get_uint32 buf off in
let refresh = Cstruct.BE.get_uint32 buf (off + 4) in
let retry = Cstruct.BE.get_uint32 buf (off + 8) in
let expiry = Cstruct.BE.get_uint32 buf (off + 12) in
let minimum = Cstruct.BE.get_uint32 buf (off + 16) in
let soa =
{ nameserver ; hostmaster ; serial ; refresh ; retry ; expiry ; minimum }
in
Ok (soa, names, off + 20)
let encode ?compress soa names buf off =
let names, off = Name.encode ?compress soa.nameserver names buf off in
let names, off = Name.encode ?compress soa.hostmaster names buf off in
Cstruct.BE.set_uint32 buf off soa.serial ;
Cstruct.BE.set_uint32 buf (off + 4) soa.refresh ;
Cstruct.BE.set_uint32 buf (off + 8) soa.retry ;
Cstruct.BE.set_uint32 buf (off + 12) soa.expiry ;
Cstruct.BE.set_uint32 buf (off + 16) soa.minimum ;
names, off + 20
end
module Ns = struct
type t = [ `host ] Domain_name.t
let canonical t = Domain_name.canonical t
let pp ppf ns = Fmt.pf ppf "NS %a" Domain_name.pp ns
let compare = Domain_name.compare
let decode names buf ~off ~len:_ =
let* name, names, off' = Name.decode names buf ~off in
let* host = Name.host off name in
Ok (host, names, off')
let encode = Name.encode
end
module Mx = struct
type t = {
preference : int ;
mail_exchange : [ `host ] Domain_name.t ;
}
let canonical t =
{ t with mail_exchange = Domain_name.canonical t.mail_exchange }
let pp ppf { preference ; mail_exchange } =
Fmt.pf ppf "MX %u %a" preference Domain_name.pp mail_exchange
let compare mx mx' =
andThen (Int.compare mx.preference mx'.preference)
(Domain_name.compare mx.mail_exchange mx'.mail_exchange)
let decode_exn names buf ~off ~len:_ =
let preference = Cstruct.BE.get_uint16 buf off in
let off = off + 2 in
let* mx, names, off' = Name.decode names buf ~off in
let* mail_exchange = Name.host off mx in
Ok ({ preference ; mail_exchange }, names, off')
let encode ?compress { preference ; mail_exchange } names buf off =
Cstruct.BE.set_uint16 buf off preference ;
Name.encode ?compress mail_exchange names buf (off + 2)
end
module Cname = struct
type t = [ `raw ] Domain_name.t
let canonical t = Domain_name.canonical t
let pp ppf alias = Fmt.pf ppf "CNAME %a" Domain_name.pp alias
let compare = Domain_name.compare
let decode names buf ~off ~len:_ = Name.decode names buf ~off
let encode = Name.encode
end
module A = struct
type t = Ipaddr.V4.t
let pp ppf address = Fmt.pf ppf "A %a" Ipaddr.V4.pp address
let compare = Ipaddr.V4.compare
let decode_exn names buf ~off ~len:_ =
let ip = Cstruct.BE.get_uint32 buf off in
Ok (Ipaddr.V4.of_int32 ip, names, off + 4)
let encode ip names buf off =
let ip = Ipaddr.V4.to_int32 ip in
Cstruct.BE.set_uint32 buf off ip ;
names, off + 4
end
module Aaaa = struct
type t = Ipaddr.V6.t
let pp ppf address = Fmt.pf ppf "AAAA %a" Ipaddr.V6.pp address
let compare = Ipaddr.V6.compare
let decode_exn names buf ~off ~len:_ =
let iph = Cstruct.BE.get_uint64 buf off
and ipl = Cstruct.BE.get_uint64 buf (off + 8)
in
Ok (Ipaddr.V6.of_int64 (iph, ipl), names, off + 16)
let encode ip names buf off =
let iph, ipl = Ipaddr.V6.to_int64 ip in
Cstruct.BE.set_uint64 buf off iph ;
Cstruct.BE.set_uint64 buf (off + 8) ipl ;
names, off + 16
end
module Ptr = struct
type t = [ `host ] Domain_name.t
let canonical t = Domain_name.canonical t
let pp ppf rev = Fmt.pf ppf "PTR %a" Domain_name.pp rev
let compare = Domain_name.compare
let decode names buf ~off ~len:_ =
let* rname, names, off' = Name.decode names buf ~off in
let* ptr = Name.host off rname in
Ok (ptr, names, off')
let encode = Name.encode
end
module Srv = struct
type t = {
priority : int ;
weight : int ;
port : int ;
target : [ `host ] Domain_name.t
}
let canonical t =
{ t with target = Domain_name.canonical t.target }
let pp ppf t =
Fmt.pf ppf
"SRV priority %d weight %d port %d target %a"
t.priority t.weight t.port Domain_name.pp t.target
let compare a b =
andThen (Int.compare a.priority b.priority)
(andThen (Int.compare a.weight b.weight)
(andThen (Int.compare a.port b.port)
(Domain_name.compare a.target b.target)))
let decode_exn names buf ~off ~len:_ =
let priority = Cstruct.BE.get_uint16 buf off
and weight = Cstruct.BE.get_uint16 buf (off + 2)
and port = Cstruct.BE.get_uint16 buf (off + 4)
in
let off = off + 6 in
let* target, names, off' = Name.decode names buf ~off in
let* target = Name.host off target in
Ok ({ priority ; weight ; port ; target }, names, off')
let encode t names buf off =
Cstruct.BE.set_uint16 buf off t.priority ;
Cstruct.BE.set_uint16 buf (off + 2) t.weight ;
Cstruct.BE.set_uint16 buf (off + 4) t.port ;
Name.encode ~compress:false t.target names buf (off + 6)
end
module Dnskey = struct
type algorithm =
| RSA_SHA1 | RSASHA1_NSEC3_SHA1 | RSA_SHA256 | RSA_SHA512
| P256_SHA256 | P384_SHA384 | ED25519
| MD5 | SHA1 | SHA224 | SHA256 | SHA384 | SHA512 | Unknown of int
let algorithm_to_int = function
| RSA_SHA1 -> 5
| RSASHA1_NSEC3_SHA1 -> 7
| RSA_SHA256 -> 8
| RSA_SHA512 -> 10
| P256_SHA256 -> 13
| P384_SHA384 -> 14
| ED25519 -> 15
| MD5 -> 157
| SHA1 -> 161
| SHA224 -> 162
| SHA256 -> 163
| SHA384 -> 164
| SHA512 -> 165
| Unknown x -> x
let int_to_algorithm = function
| 5 -> RSA_SHA1
| 7 -> RSASHA1_NSEC3_SHA1
| 8 -> RSA_SHA256
| 10 -> RSA_SHA512
| 13 -> P256_SHA256
| 14 -> P384_SHA384
| 15 -> ED25519
| 157 -> MD5
| 161 -> SHA1
| 162 -> SHA224
| 163 -> SHA256
| 164 -> SHA384
| 165 -> SHA512
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("invalid DNSKEY algorithm " ^ string_of_int x)
let algorithm_to_string = function
| RSA_SHA1 -> "RSASHA1"
| RSASHA1_NSEC3_SHA1 -> "RSASHA1NSEC3SHA1"
| RSA_SHA256 -> "RSASHA256"
| RSA_SHA512 -> "RSASHA512"
| P256_SHA256 -> "ECDSAP256SHA256"
| P384_SHA384 -> "ECDSAP384SHA384"
| ED25519 -> "ED25519"
| MD5 -> "MD5"
| SHA1 -> "SHA1"
| SHA224 -> "SHA224"
| SHA256 -> "SHA256"
| SHA384 -> "SHA384"
| SHA512 -> "SHA512"
| Unknown x -> string_of_int x
let string_to_algorithm = function
| "RSASHA1" -> Ok RSA_SHA1
| "RSASHA1NSEC3SHA1" -> Ok RSASHA1_NSEC3_SHA1
| "RSASHA256" -> Ok RSA_SHA256
| "RSASHA512" -> Ok RSA_SHA512
| "ECDSAP256SHA256" -> Ok P256_SHA256
| "ECDSAP384SHA384" -> Ok P384_SHA384
| "ED25519" -> Ok ED25519
| "MD5" -> Ok MD5
| "SHA1" -> Ok SHA1
| "SHA224" -> Ok SHA224
| "SHA256" -> Ok SHA256
| "SHA384" -> Ok SHA384
| "SHA512" -> Ok SHA512
| x -> try Ok (Unknown (int_of_string x)) with
Failure _ -> Error (`Msg ("DNSKEY algorithm not implemented " ^ x))
let pp_algorithm ppf k = Fmt.string ppf (algorithm_to_string k)
let compare_algorithm a b =
Int.compare (algorithm_to_int a) (algorithm_to_int b)
type flag = [ `Zone | `Revoke | `Secure_entry_point ]
let bit = function
| `Zone -> 7
| `Revoke -> 8
| `Secure_entry_point -> 15
let all = [ `Zone ; `Revoke ; `Secure_entry_point ]
let compare_flag a b = match a, b with
| `Zone, `Zone -> 0 | `Zone, _ -> 1 | _, `Zone -> -1
| `Revoke, `Revoke -> 0 | `Revoke, _ -> 1 | _, `Revoke -> -1
| `Secure_entry_point, `Secure_entry_point -> 0
module F = Set.Make(struct type t = flag let compare = compare_flag end)
let pp_flag ppf = function
| `Zone -> Fmt.string ppf "zone"
| `Revoke -> Fmt.string ppf "revoke"
| `Secure_entry_point -> Fmt.string ppf "secure entry point"
let number f = 1 lsl (15 - bit f)
let decode_flags i =
List.fold_left (fun flags f ->
if number f land i > 0 then F.add f flags else flags)
F.empty all
let encode_flags f =
F.fold (fun f acc -> acc + number f) f 0
type t = {
flags : F.t ;
algorithm : algorithm ;
key : Cstruct.t ;
}
let compare a b =
andThen (F.compare a.flags b.flags)
(andThen (compare_algorithm a.algorithm b.algorithm)
(Cstruct.compare a.key b.key))
let decode_exn names buf ~off ~len =
let flags = Cstruct.BE.get_uint16 buf off
and proto = Cstruct.get_uint8 buf (off + 2)
and algo = Cstruct.get_uint8 buf (off + 3)
in
let* () =
guard (proto = 3)
(`Not_implemented (off + 2, Fmt.str "dnskey protocol 0x%x" proto))
in
let algorithm = int_to_algorithm algo in
let key = Cstruct.sub buf (off + 4) (len - 4) in
let flags = decode_flags flags in
Ok ({ flags ; algorithm ; key }, names, off + len)
let encode t names buf off =
let flags = encode_flags t.flags in
Cstruct.BE.set_uint16 buf off flags ;
Cstruct.set_uint8 buf (off + 2) 3 ;
Cstruct.set_uint8 buf (off + 3) (algorithm_to_int t.algorithm) ;
let kl = Cstruct.length t.key in
Cstruct.blit t.key 0 buf (off + 4) kl ;
names, off + 4 + kl
let key_tag t =
let data = Cstruct.create (4 + Cstruct.length t.key) in
let _names, _off = encode t Domain_name.Map.empty data 0 in
let rec go idx ac =
if idx >= Cstruct.length data then
(ac + (ac lsr 16) land 0xFFFF) land 0xFFFF
else
let b = Cstruct.get_uint8 data idx in
let lowest_bit_set = idx land 1 <> 0 in
let ac = ac + if lowest_bit_set then b else b lsl 8 in
go (succ idx) ac
in
go 0 0
let pp ppf t =
Fmt.pf ppf "DNSKEY flags %a algo %a key_tag %d key %a"
Fmt.(list ~sep:(any ", ") pp_flag) (F.elements t.flags)
pp_algorithm t.algorithm
(key_tag t)
Cstruct.hexdump_pp t.key
let digest_prep owner t =
let kl = Cstruct.length t.key in
let buf = Cstruct.create (kl + 255 + 4) in
let names = Domain_name.Map.empty in
let _, off = Name.encode ~compress:false owner names buf 0 in
let _, off' = encode t names buf off in
Cstruct.sub buf 0 off'
let of_string key =
let parse algo key =
let key = Cstruct.of_string key in
let* algorithm = string_to_algorithm algo in
Ok { flags = F.empty ; algorithm ; key }
in
match String.split_on_char ':' key with
| [ algo ; key ] -> parse algo key
| _ -> Error (`Msg ("invalid DNSKEY string " ^ key))
let name_key_of_string str =
match String.split_on_char ':' str with
| name :: key ->
let* name = Domain_name.of_string name in
let* dnskey = of_string (String.concat ":" key) in
Ok (name, dnskey)
| [] -> Error (`Msg ("couldn't parse name:key in " ^ str))
let pp_name_key ppf (name, key) =
Fmt.pf ppf "%a %a" Domain_name.pp name pp key
end
(** RRSIG *)
module Rrsig = struct
type t = {
type_covered : int ;
algorithm : Dnskey.algorithm ;
label_count : int ;
original_ttl : int32 ;
signature_expiration : Ptime.t ;
signature_inception : Ptime.t ;
key_tag : int ;
signer_name : [ `raw ] Domain_name.t ;
signature : Cstruct.t
}
let canonical t =
{ t with signer_name = Domain_name.canonical t.signer_name }
let pp ppf t =
Fmt.pf ppf "RRSIG type covered %u algo %a labels %u original ttl %lu signature expiration %a signature inception %a key tag %u signer name %a signature %a"
t.type_covered
Dnskey.pp_algorithm t.algorithm
t.label_count t.original_ttl
(Ptime.pp_rfc3339 ()) t.signature_expiration
(Ptime.pp_rfc3339 ()) t.signature_inception
t.key_tag Domain_name.pp t.signer_name
Cstruct.hexdump_pp t.signature
let compare a b =
andThen (Int.compare a.type_covered b.type_covered)
(andThen (Dnskey.compare_algorithm a.algorithm b.algorithm)
(andThen (Int.compare a.label_count b.label_count)
(andThen (Int32.compare a.original_ttl b.original_ttl)
(andThen (Ptime.compare a.signature_expiration b.signature_expiration)
(andThen (Ptime.compare a.signature_inception b.signature_inception)
(andThen (Int.compare a.key_tag b.key_tag)
(andThen (Domain_name.compare a.signer_name b.signer_name)
(Cstruct.compare a.signature b.signature))))))))
let decode_exn names buf ~off ~len =
let type_covered = Cstruct.BE.get_uint16 buf off
and algo = Cstruct.get_uint8 buf (off + 2)
and label_count = Cstruct.get_uint8 buf (off + 3)
and original_ttl = Cstruct.BE.get_uint32 buf (off + 4)
and sig_exp = Cstruct.BE.get_uint32 buf (off + 8)
and sig_inc = Cstruct.BE.get_uint32 buf (off + 12)
and key_tag = Cstruct.BE.get_uint16 buf (off + 16)
in
let* signer_name, names, off' = Name.decode names buf ~off:(off + 18) in
let signature = Cstruct.sub buf off' (len - (off' - off)) in
let algorithm = Dnskey.int_to_algorithm algo in
let* signature_expiration =
Ptime_extra.of_int64 ~off:(off + 8) (Int64.of_int32 sig_exp)
in
let* signature_inception =
Ptime_extra.of_int64 ~off:(off + 12) (Int64.of_int32 sig_inc)
in
Ok ({ type_covered ; algorithm ; label_count ; original_ttl ;
signature_expiration ; signature_inception ; key_tag ; signer_name ;
signature },
names, off + len)
let encode t names buf off =
Cstruct.BE.set_uint16 buf off t.type_covered ;
Cstruct.set_uint8 buf (off + 2) (Dnskey.algorithm_to_int t.algorithm) ;
Cstruct.set_uint8 buf (off + 3) t.label_count ;
Cstruct.BE.set_uint32 buf (off + 4) t.original_ttl ;
let int_s ts =
match Ptime_extra.to_int64 ts with
| None -> 0l
| Some s ->
if Int64.(s > of_int32 Int32.min_int && s < of_int32 Int32.max_int) then
Int64.to_int32 s
else
0l
in
Cstruct.BE.set_uint32 buf (off + 8) (int_s t.signature_expiration) ;
Cstruct.BE.set_uint32 buf (off + 12) (int_s t.signature_inception) ;
Cstruct.BE.set_uint16 buf (off + 16) t.key_tag ;
let names, off = Name.encode ~compress:false t.signer_name names buf (off + 18) in
let slen = Cstruct.length t.signature in
Cstruct.blit t.signature 0 buf off slen ;
names, off + slen
let used_name rrsig name =
let rrsig_labels = rrsig.label_count
and fqdn_labels = Domain_name.count_labels name
in
if rrsig_labels = fqdn_labels then
Ok name
else if rrsig_labels < fqdn_labels then
let amount = fqdn_labels - rrsig_labels in
Ok Domain_name.(prepend_label_exn (drop_label_exn ~amount name) "*")
else
Error (`Msg "rrsig_labels is greater than fqdn_labels: name is too short")
let prep_rrsig rrsig =
let tbs = Cstruct.create 4096 in
let rrsig_raw = canonical { rrsig with signature = Cstruct.empty } in
let _, off = encode rrsig_raw Domain_name.Map.empty tbs 0 in
tbs, off
end
module Ds = struct
type digest_type =
| SHA1
| SHA256
| SHA384
| Unknown of int
let digest_type_to_int = function
| SHA1 -> 1
| SHA256 -> 2
| SHA384 -> 4
| Unknown i -> i
let int_to_digest_type = function
| 1 -> SHA1
| 2 -> SHA256
| 4 -> SHA384
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("invalid DS digest type " ^ string_of_int x)
let digest_type_to_string = function
| SHA1 -> "SHA1"
| SHA256 -> "SHA256"
| SHA384 -> "SHA384"
| Unknown i -> string_of_int i
let pp_digest_type ppf k = Fmt.string ppf (digest_type_to_string k)
let compare_digest_type a b =
Int.compare (digest_type_to_int a) (digest_type_to_int b)
type t = {
key_tag : int ;
algorithm : Dnskey.algorithm ;
digest_type : digest_type ;
digest : Cstruct.t
}
let pp ppf t =
Fmt.pf ppf "DS key_tag %u algo %a digest type %a digest %a"
t.key_tag
Dnskey.pp_algorithm t.algorithm
pp_digest_type t.digest_type
Cstruct.hexdump_pp t.digest
let compare a b =
andThen (Int.compare a.key_tag b.key_tag)
(andThen (Dnskey.compare_algorithm a.algorithm b.algorithm)
(andThen (compare_digest_type a.digest_type b.digest_type)
(Cstruct.compare a.digest b.digest)))
let decode_exn names buf ~off ~len =
let key_tag = Cstruct.BE.get_uint16 buf off
and algo = Cstruct.get_uint8 buf (off + 2)
and dt = Cstruct.get_uint8 buf (off + 3)
and digest = Cstruct.sub buf (off + 4) (len - 4)
in
let algorithm = Dnskey.int_to_algorithm algo
and digest_type = int_to_digest_type dt
in
Ok ({ key_tag ; algorithm ; digest_type ; digest }, names, off + len)
let encode t names buf off =
Cstruct.BE.set_uint16 buf off t.key_tag ;
Cstruct.set_uint8 buf (off + 2) (Dnskey.algorithm_to_int t.algorithm) ;
Cstruct.set_uint8 buf (off + 3) (digest_type_to_int t.digest_type) ;
Cstruct.blit t.digest 0 buf (off + 4) (Cstruct.length t.digest) ;
names, off + Cstruct.length t.digest + 4
end
module Bit_map = struct
include Set.Make
(struct type t = int let compare = Int.compare end)
let byte_to_bits byte =
let rec more v =
if v = 0 then
[]
else if v >= 0x80 then
0 :: more (v - 0x80)
else if v >= 0x40 then
1 :: more (v - 0x40)
else if v >= 0x20 then
2 :: more (v - 0x20)
else if v >= 0x10 then
3 :: more (v - 0x10)
else if v >= 0x08 then
4 :: more (v - 0x08)
else if v >= 0x04 then
5 :: more (v - 0x04)
else if v >= 0x02 then
6 :: more (v - 0x02)
else
7 :: more (v - 0x01)
in
List.sort Int.compare (more byte)
let decode_exn buf ~off ~len =
let rec decode_bit_map_field last_block idx acc =
if idx - off = len then
Ok acc
else
let block = Cstruct.get_uint8 buf idx in
if block <= last_block then
Error (`Malformed (off + idx, "block number not increasing"))
else
let length = Cstruct.get_uint8 buf (idx + 1) in
let s = idx + 2 in
let rec octet idx =
let b = Cstruct.get_uint8 buf (s + idx) in
let bits = byte_to_bits b in
let more = if idx = 0 then empty else octet (idx - 1) in
List.fold_left (fun acc b' -> add (idx * 8 + b') acc) more bits
in
let bits = octet (length - 1) in
decode_bit_map_field block (s + length)
(union (map (fun b -> b + block * 256) bits) acc)
in
decode_bit_map_field (-1) off empty
let bits_to_byte data =
let rec more b = function
| [] -> b
| 0 :: rt -> more (0x80 + b) rt
| 1 :: rt -> more (0x40 + b) rt
| 2 :: rt -> more (0x20 + b) rt
| 3 :: rt -> more (0x10 + b) rt
| 4 :: rt -> more (0x08 + b) rt
| 5 :: rt -> more (0x04 + b) rt
| 6 :: rt -> more (0x02 + b) rt
| 7 :: rt -> more (0x01 + b) rt
| _ -> assert false
in
more 0 data
let encode buf off data =
let encode_block off block data =
Cstruct.set_uint8 buf off block;
let bytes = (max_elt data + 1 + 7) / 8 in
Cstruct.set_uint8 buf (off + 1) bytes;
let rec enc_octet idx data =
if is_empty data then
()
else
let data, rest = partition (fun i -> i < (idx + 1) * 8) data in
let d = map (fun i -> i mod 8) data in
let byte = bits_to_byte (elements d) in
Cstruct.set_uint8 buf (idx + off + 2) byte;
enc_octet (idx + 1) rest
in
enc_octet 0 data;
off + 2 + bytes
in
let rec encode_types off i =
if is_empty i then
off
else
let next = min_elt i in
let block = next / 256 in
let block_end = block * 256 + 255 in
let this, rest = partition (fun i -> i <= block_end) i in
let to_enc = map (fun i -> i mod 256) this in
let off = encode_block off block to_enc in
encode_types off rest
in
encode_types off data
end
module Nsec = struct
type t = {
next_domain : [`raw] Domain_name.t;
types : Bit_map.t;
}
let pp ppf { next_domain ; types } =
Fmt.pf ppf "NSEC %a: %a" Domain_name.pp next_domain
Fmt.(list ~sep:(any " ") int) (Bit_map.elements types)
let compare a b =
andThen (Domain_name.compare a.next_domain b.next_domain)
(Bit_map.compare a.types b.types)
let decode_exn names buf ~off ~len =
let* next_domain, names, off' = Name.decode names buf ~off in
let len' = len - (off' - off) in
let* types = Bit_map.decode_exn buf ~off:off' ~len:len' in
Ok ({ next_domain ; types }, names, off + len)
let encode t names buf off =
let names, off = Name.encode ~compress:false t.next_domain names buf off in
names, Bit_map.encode buf off t.types
let canonical t =
{ t with next_domain = Domain_name.canonical t.next_domain }
end
module Nsec3 = struct
type f = [ `Opt_out | `Unknown of int ]
let compare_flags a b = match a, b with
| None, None | Some `Opt_out, Some `Opt_out -> 0
| _, Some `Opt_out -> -1
| Some `Opt_out, _ -> 1
| Some `Unknown a, Some `Unknown b -> Int.compare a b
| None, Some `Unknown _ -> -1
| Some `Unknown _, None -> 1
let flags_of_int b =
match b with
| 0x01 -> Some `Opt_out
| 0x00 -> None
| x ->
Log.warn (fun m -> m "NSEC3 record with unknown flag %02X" x);
Some (`Unknown x)
let flags_to_int = function
| Some `Opt_out -> 0x01
| Some `Unknown x -> x
| None -> 0x00
type t = {
flags : f option ;
iterations : int ;
salt : Cstruct.t ;
next_owner_hashed : Cstruct.t ;
types : Bit_map.t ;
}
let hash = 1
let pp ppf { flags ; iterations ; salt ; next_owner_hashed ; types } =
Fmt.pf ppf "NSEC3 %s%d iterations, salt: %a, next owner %a types %a"
(match flags with
| None -> ""
| Some `Opt_out -> "opt-out "
| Some `Unknown x -> "unknown " ^ string_of_int x ^ " ")
iterations Cstruct.hexdump_pp salt
Cstruct.hexdump_pp next_owner_hashed
Fmt.(list ~sep:(any " ") int) (Bit_map.elements types)
let compare a b =
andThen (compare_flags a.flags b.flags)
(andThen (Int.compare a.iterations b.iterations)
(andThen (Cstruct.compare a.salt b.salt)
(andThen (Cstruct.compare a.next_owner_hashed b.next_owner_hashed)
(Bit_map.compare a.types b.types))))
let decode_exn names buf ~off ~len =
let hash_algo = Cstruct.get_uint8 buf off in
let* () =
guard (hash_algo = hash)
(`Not_implemented (off, "NSEC3 hash only SHA-1 supported"))
in
let flags = flags_of_int (Cstruct.get_uint8 buf (off + 1)) in
let iterations = Cstruct.BE.get_uint16 buf (off + 2) in
let slen = Cstruct.get_uint8 buf (off + 4) in
let salt = Cstruct.sub buf (off + 5) slen in
let hlen = Cstruct.get_uint8 buf (off + 5 + slen) in
let next_owner_hashed = Cstruct.sub buf (off + 6 + slen) hlen in
let off' = off + 6 + slen + hlen in
let len' = len - (off' - off) in
let* types = Bit_map.decode_exn buf ~off:off' ~len:len' in
Ok ({ flags ; iterations ; salt ; next_owner_hashed ; types }, names, off + len)
let encode t names buf off =
Cstruct.set_uint8 buf off hash;
Cstruct.set_uint8 buf (off + 1) (flags_to_int t.flags);
Cstruct.BE.set_uint16 buf (off + 2) t.iterations;
let slen = Cstruct.length t.salt in
Cstruct.set_uint8 buf (off + 4) slen;
Cstruct.blit t.salt 0 buf (off + 5) slen;
let off' = off + 5 + slen in
let hlen = Cstruct.length t.next_owner_hashed in
Cstruct.set_uint8 buf off' hlen;
Cstruct.blit t.next_owner_hashed 0 buf (off' + 1) hlen;
let off' = off' + 1 + hlen in
let off = Bit_map.encode buf off' t.types in
names, off
end
module Loc = struct
type t = {
latitude : int32;
longitude : int32;
altitude : int32;
size : int;
horiz_pre : int;
vert_pre : int;
}
let lat_long_parse ((deg, min, sec), dir) =
let ( * ), (+) = Int32.mul, Int32.add in
let arcsecs = (Int32.shift_left 1l 31) + (
(((deg * 60l) + min) * 60l) * 1000l + sec
) in
match dir with
| `North | `East -> arcsecs
| `South | `West -> -1l * arcsecs
let alt_parse alt =
let (+) = Int64.add in
Int64.to_int32 (10000000L + alt)
let rec pow10 e =
if e = 0 then 1L else
let ( * ) = Int64.mul in
pow10 (e - 1) * 10L
let precision_parse (size, horiz_pre, vert_pre) =
let encode = fun p ->
let exponent =
let rec r = fun p e ->
if e >= 9 then 9 else
if p < (pow10 (e + 1)) then e else
r p (e + 1)
in
r p 0
in
let mantissa =
let ( / ) = Int64.div in
let m = p / (pow10 exponent) in
if m > 9L then 9 else Int64.to_int m
in
(Int.shift_left mantissa 4) lor exponent
in
(encode size, encode horiz_pre, encode vert_pre)
let parse ~latitude ~longitude ~altitude ~precision =
let latitude = lat_long_parse latitude in
let longitude = lat_long_parse longitude in
let altitude = alt_parse altitude in
let size, horiz_pre, vert_pre = precision_parse precision in
{ latitude ; longitude ; altitude ; size ; horiz_pre ; vert_pre}
let arcsecs_print lat_long =
let ( * ), (-), (/) = Int32.mul, Int32.sub, Int32.div in
let lat_long = (Int32.shift_left 1l 31) - lat_long in
let dir = lat_long <= 0l in
let lat_long = Int32.abs lat_long in
let sec =
let decimal = Int32.rem lat_long (60l * 1000l) in
let integer = decimal / 1000l in
let decimal = Int32.rem decimal 1000l in
(integer, decimal)
in
let min = Int32.rem (lat_long / (1000l * 60l)) 60l in
let deg = lat_long / (1000l * 60l * 60l) in
(deg, min, sec), dir
let lat_print lat =
let arcsecs, dir = arcsecs_print lat in
let dir = if dir then "N" else "S" in
(arcsecs, dir)
let long_print long =
let arcsecs, dir = arcsecs_print long in
let dir = if dir then "E" else "W" in
(arcsecs, dir)
let alt_print alt =
let (+), (-), (/) = Int64.add, Int64.sub, Int64.div in
let alt = if alt < 0l then
Int64.of_int32 alt + Int64.shift_left 1L 32
else Int64.of_int32 alt
in
let alt = alt - 10000000L in
(alt / 100L, Int64.rem alt 100L)
let precision_print prec =
let mantissa = ((Int.shift_right prec 4) land 0x0f) mod 10 in
let exponent = ((Int.shift_right prec 0) land 0x0f) mod 10 in
let (/), ( * ) = Int64.div, Int64.mul in
let p = Int64.of_int mantissa * pow10 exponent in
(p / 100L, Int64.rem p 100L)
let to_string loc =
let decimal_string (integer, decimal) decimal_digits =
let (/), ( * ) = Int64.div, Int64.mul in
let integer_string = Int64.to_string integer in
if decimal = 0L then
integer_string
else
let decimal_string =
let rec trim_trailing_zeros decimal num_trimmed =
if (decimal / 10L) * 10L = decimal then
trim_trailing_zeros (decimal / 10L) (num_trimmed + 1)
else
decimal, num_trimmed
in
let decimal, num_trimmed = trim_trailing_zeros decimal 0 in
let decimal = Int64.to_string decimal in
String.make (decimal_digits - String.length decimal - num_trimmed) '0' ^ decimal
in
integer_string ^ "." ^ decimal_string
in
let lat_long_to_string deg min sec dir =
let sec_string =
let integer, decimal = sec in
decimal_string (Int64.of_int32 integer, Int64.of_int32 decimal) 3
in
String.concat " " ((List.map (Int32.to_string) [deg; min]) @ [sec_string ; dir])
in
let lat_string =
let (lat_deg, lat_min, lat_sec), lat_dir = lat_print loc.latitude in
lat_long_to_string lat_deg lat_min lat_sec lat_dir
in
let long_string =
let (long_deg, long_min, long_sec), long_dir = long_print loc.longitude in
lat_long_to_string long_deg long_min long_sec long_dir
in
let meter_values =
List.map (fun m -> decimal_string m 2 ^ "m") (
[alt_print loc.altitude] @ (List.map precision_print [loc.size; loc.horiz_pre; loc.vert_pre])
)
in
String.concat " " ([lat_string; long_string;] @ meter_values)
let pp ppf loc = Fmt.pf ppf "LOC %s" (to_string loc)
let compare a b =
List.fold_right andThen [
Int32.compare a.latitude b.latitude ;
Int32.compare a.longitude b.longitude ;
Int32.compare a.altitude b.altitude ;
Int.compare a.size b.size ;
Int.compare a.horiz_pre b.horiz_pre ;
Int.compare a.vert_pre b.vert_pre ;
] 0
let decode_exn names buf ~off ~len =
let latitude = Cstruct.BE.get_uint32 buf (off + 4) in
let longitude = Cstruct.BE.get_uint32 buf (off + 8) in
let size = Cstruct.get_uint8 buf (off + 1) in
let horiz_pre = Cstruct.get_uint8 buf (off + 2) in
let vert_pre = Cstruct.get_uint8 buf (off + 3) in
let altitude = Cstruct.BE.get_uint32 buf (off + 12) in
Ok ({ latitude ; longitude ; altitude ; size ; horiz_pre; vert_pre }, names, off + len)
let encode loc names buf off =
Cstruct.set_uint8 buf off 0;
Cstruct.set_uint8 buf (off + 1) loc.size;
Cstruct.set_uint8 buf (off + 2) loc.horiz_pre;
Cstruct.set_uint8 buf (off + 3) loc.vert_pre;
Cstruct.BE.set_uint32 buf (off + 4) loc.latitude;
Cstruct.BE.set_uint32 buf (off + 8) loc.longitude;
Cstruct.BE.set_uint32 buf (off + 12) loc.altitude;
names, off + 16
end
module Null = struct
type t = Cstruct.t
let pp ppf null = Fmt.pf ppf "NULL %a" Cstruct.hexdump_pp null
let compare = Cstruct.compare
let decode names buf ~off ~len =
let sub = Cstruct.sub buf off len in
Ok (sub, names, off + len)
let encode null names buf off =
let max_len = 65535 in
let len = min max_len (Cstruct.length null) in
Cstruct.blit null 0 buf off len ;
names, off + len
end
module Caa = struct
type t = {
critical : bool ;
tag : string ;
value : string list ;
}
let pp ppf t =
Fmt.pf ppf "CAA critical %b tag %s value %a"
t.critical t.tag Fmt.(list ~sep:(any "; ") string) t.value
let compare a b =
andThen (Bool.compare a.critical b.critical)
(andThen (String.compare a.tag b.tag)
(List.fold_left2
(fun r a b -> match r with 0 -> String.compare a b | x -> x)
0 a.value b.value))
let decode_exn names buf ~off ~len =
let critical = Cstruct.get_uint8 buf off = 0x80
and tl = Cstruct.get_uint8 buf (succ off)
in
let* () =
guard (tl > 0 && tl < 16)
(`Not_implemented (succ off, Fmt.str "caa tag 0x%x" tl))
in
let tag = Cstruct.sub buf (off + 2) tl in
let tag = Cstruct.to_string tag in
let vs = 2 + tl in
let value = Cstruct.sub buf (off + vs) (len - vs) in
let value = String.split_on_char ';' (Cstruct.to_string value) in
Ok ({ critical ; tag ; value }, names, off + len)
let encode t names buf off =
Cstruct.set_uint8 buf off (if t.critical then 0x80 else 0x0) ;
let tl = String.length t.tag in
Cstruct.set_uint8 buf (succ off) tl ;
Cstruct.blit_from_string t.tag 0 buf (off + 2) tl ;
let value = String.concat ";" t.value in
let vl = String.length value in
Cstruct.blit_from_string value 0 buf (off + 2 + tl) vl ;
names, off + tl + 2 + vl
end
module Tlsa = struct
type cert_usage =
| CA_constraint
| Service_certificate_constraint
| Trust_anchor_assertion
| Domain_issued_certificate
| Unknown of int
let cert_usage_to_int = function
| CA_constraint -> 0
| Service_certificate_constraint -> 1
| Trust_anchor_assertion -> 2
| Domain_issued_certificate -> 3
| Unknown x -> x
let int_to_cert_usage = function
| 0 -> CA_constraint
| 1 -> Service_certificate_constraint
| 2 -> Trust_anchor_assertion
| 3 -> Domain_issued_certificate
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("Bad certificate usage " ^ string_of_int x)
let cert_usage_to_string = function
| CA_constraint -> "CA constraint"
| Service_certificate_constraint -> "service certificate constraint"
| Trust_anchor_assertion -> "trust anchor assertion"
| Domain_issued_certificate -> "domain issued certificate"
| Unknown x -> "unknown " ^ string_of_int x
let pp_cert_usage ppf k = Fmt.string ppf (cert_usage_to_string k)
let compare_cert_usage a b =
Int.compare (cert_usage_to_int a) (cert_usage_to_int b)
type selector =
| Full_certificate
| Subject_public_key_info
| Private
| Unknown of int
let selector_to_int = function
| Full_certificate -> 0
| Subject_public_key_info -> 1
| Private -> 255
| Unknown x -> x
let int_to_selector = function
| 0 -> Full_certificate
| 1 -> Subject_public_key_info
| 255 -> Private
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("Bad selector " ^ string_of_int x)
let selector_to_string = function
| Full_certificate -> "full certificate"
| Subject_public_key_info -> "subject public key info"
| Private -> "private"
| Unknown x -> "unknown " ^ string_of_int x
let pp_selector ppf k = Fmt.string ppf (selector_to_string k)
let compare_selector a b =
Int.compare (selector_to_int a) (selector_to_int b)
type matching_type =
| No_hash
| SHA256
| SHA512
| Unknown of int
let matching_type_to_int = function
| No_hash -> 0
| SHA256 -> 1
| SHA512 -> 2
| Unknown x -> x
let int_to_matching_type = function
| 0 -> No_hash
| 1 -> SHA256
| 2 -> SHA512
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("Bad matching type " ^ string_of_int x)
let matching_type_to_string = function
| No_hash -> "no hash"
| SHA256 -> "SHA256"
| SHA512 -> "SHA512"
| Unknown x -> "unknown " ^ string_of_int x
let pp_matching_type ppf k = Fmt.string ppf (matching_type_to_string k)
let compare_matching_type a b =
Int.compare (matching_type_to_int a) (matching_type_to_int b)
type t = {
cert_usage : cert_usage ;
selector : selector ;
matching_type : matching_type ;
data : Cstruct.t ;
}
let pp ppf tlsa =
Fmt.pf ppf "TLSA @[<v>%a %a %a@ %a@]"
pp_cert_usage tlsa.cert_usage
pp_selector tlsa.selector
pp_matching_type tlsa.matching_type
Cstruct.hexdump_pp tlsa.data
let compare t1 t2 =
andThen (compare_cert_usage t1.cert_usage t2.cert_usage)
(andThen (compare_selector t1.selector t2.selector)
(andThen (compare_matching_type t1.matching_type t2.matching_type)
(Cstruct.compare t1.data t2.data)))
let decode_exn names buf ~off ~len =
let usage, selector, matching_type =
Cstruct.get_uint8 buf off,
Cstruct.get_uint8 buf (off + 1),
Cstruct.get_uint8 buf (off + 2)
in
let data = Cstruct.sub buf (off + 3) (len - 3) in
let cert_usage = int_to_cert_usage usage in
let selector = int_to_selector selector in
let matching_type = int_to_matching_type matching_type in
let tlsa = { cert_usage ; selector ; matching_type ; data } in
Ok (tlsa, names, off + len)
let encode tlsa names buf off =
Cstruct.set_uint8 buf off (cert_usage_to_int tlsa.cert_usage) ;
Cstruct.set_uint8 buf (off + 1) (selector_to_int tlsa.selector) ;
Cstruct.set_uint8 buf (off + 2) (matching_type_to_int tlsa.matching_type) ;
let l = Cstruct.length tlsa.data in
Cstruct.blit tlsa.data 0 buf (off + 3) l ;
names, off + 3 + l
end
module Sshfp = struct
type algorithm =
| Rsa
| Dsa
| Ecdsa
| Ed25519
| Unknown of int
let algorithm_to_int = function
| Rsa -> 1
| Dsa -> 2
| Ecdsa -> 3
| Ed25519 -> 4
| Unknown x -> x
let int_to_algorithm = function
| 1 -> Rsa
| 2 -> Dsa
| 3 -> Ecdsa
| 4 -> Ed25519
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("Bad SSHFP algorithm " ^ string_of_int x)
let algorithm_to_string = function
| Rsa -> "RSA"
| Dsa -> "DSA"
| Ecdsa -> "ECDSA"
| Ed25519 -> "ED25519"
| Unknown x -> "unknown " ^ string_of_int x
let pp_algorithm ppf k = Fmt.string ppf (algorithm_to_string k)
let compare_algorithm a b =
Int.compare (algorithm_to_int a) (algorithm_to_int b)
type typ =
| SHA1
| SHA256
| Unknown of int
let typ_to_int = function
| SHA1 -> 1
| SHA256 -> 2
| Unknown x -> x
let int_to_typ = function
| 1 -> SHA1
| 2 -> SHA256
| x ->
if x >= 0 && x < 256 then
Unknown x
else
invalid_arg ("Bad SSHFP typ " ^ string_of_int x)
let typ_to_string = function
| SHA1 -> "SHA1"
| SHA256 -> "SHA256"
| Unknown x -> "unknown " ^ string_of_int x
let pp_typ ppf k = Fmt.string ppf (typ_to_string k)
let compare_typ a b =
Int.compare (typ_to_int a) (typ_to_int b)
type t = {
algorithm : algorithm ;
typ : typ ;
fingerprint : Cstruct.t ;
}
let pp ppf sshfp =
Fmt.pf ppf "SSHFP %a %a %a"
pp_algorithm sshfp.algorithm
pp_typ sshfp.typ
Cstruct.hexdump_pp sshfp.fingerprint
let compare s1 s2 =
andThen (compare_algorithm s1.algorithm s2.algorithm)
(andThen (compare_typ s1.typ s2.typ)
(Cstruct.compare s1.fingerprint s2.fingerprint))
let decode_exn names buf ~off ~len =
let algo, typ = Cstruct.get_uint8 buf off, Cstruct.get_uint8 buf (succ off) in
let fingerprint = Cstruct.sub buf (off + 2) (len - 2) in
let algorithm = int_to_algorithm algo in
let typ = int_to_typ typ in
let sshfp = { algorithm ; typ ; fingerprint } in
Ok (sshfp, names, off + len)
let encode sshfp names buf off =
Cstruct.set_uint8 buf off (algorithm_to_int sshfp.algorithm) ;
Cstruct.set_uint8 buf (succ off) (typ_to_int sshfp.typ) ;
let l = Cstruct.length sshfp.fingerprint in
Cstruct.blit sshfp.fingerprint 0 buf (off + 2) l ;
names, off + l + 2
end
module Txt = struct
type t = string
let pp ppf txt = Fmt.pf ppf "TXT %s" txt
let compare = String.compare
let decode_exn names buf ~off ~len =
let decode_character_str buf off =
let len = Cstruct.get_uint8 buf off in
let data = Cstruct.to_string (Cstruct.sub buf (succ off) len) in
(data, off + len + 1)
in
let sub = Cstruct.sub buf off len in
let rec more acc off =
if len = off then
List.rev acc
else
let d, off = decode_character_str sub off in
more (d::acc) off
in
let txts = more [] 0 in
Ok (String.concat "" txts, names, off + len)
let encode txt names buf off =
let max_len = 255 in
let rec more off txt =
if txt = "" then
off
else
let len = String.length txt in
let len, rest =
if len > max_len then
max_len, String.(sub txt max_len (len - max_len))
else
len, ""
in
Cstruct.set_uint8 buf off len ;
Cstruct.blit_from_string txt 0 buf (succ off) len ;
more (off + len + 1) rest
in
let off = more off txt in
names, off
end
module Tsig = struct
type algorithm =
| SHA1
| SHA224
| SHA256
| SHA384
| SHA512
type t = {
algorithm : algorithm ;
signed : Ptime.t ;
fudge : Ptime.Span.t ;
mac : Cstruct.t ;
original_id : int ;
error : Rcode.t ;
other : Ptime.t option
}
let rtyp = 250
let equal a b =
a.algorithm = b.algorithm &&
Ptime.equal a.signed b.signed &&
Ptime.Span.equal a.fudge b.fudge &&
Cstruct.equal a.mac b.mac &&
a.original_id = b.original_id &&
a.error = b.error &&
opt_eq Ptime.equal a.other b.other
let algorithm_to_name, algorithm_of_name =
let of_s s = Domain_name.(host_exn (of_string_exn s)) in
let map =
[
of_s "hmac-sha1", SHA1 ;
of_s "hmac-sha224", SHA224 ;
of_s "hmac-sha256", SHA256 ;
of_s "hmac-sha384", SHA384 ;
of_s "hmac-sha512", SHA512 ]
in
(fun a -> fst (List.find (fun (_, t) -> t = a) map)),
(fun ?(off = 0) (b : [ `host ] Domain_name.t) ->
try Ok (snd (List.find (fun (n, _) -> Domain_name.equal b n) map))
with Not_found ->
let m = Fmt.str "algorithm name %a" Domain_name.pp b in
Error (`Not_implemented (off, m)))
let pp_algorithm ppf a = Domain_name.pp ppf (algorithm_to_name a)
let valid_time now tsig =
let ts = tsig.signed
and fudge = tsig.fudge
in
match Ptime.add_span now fudge, Ptime.sub_span now fudge with
| None, _ -> false
| _, None -> false
| Some late, Some early ->
Ptime.is_earlier ts ~than:late && Ptime.is_later ts ~than:early
let ptime_to_bits ts =
match Ptime_extra.to_int64 ts with
| None -> None
| Some x ->
if Int64.logand 0xffff_0000_0000_0000L x = 0L then Some x else None
let tsig ~algorithm ~signed ?(fudge = Ptime.Span.of_int_s 300)
?(mac = Cstruct.create 0) ?(original_id = 0) ?(error = Rcode.NoError)
?other () =
match ptime_to_bits signed, Ptime_extra.span_to_int64 fudge with
| None, _ | _, None -> None
| Some _, Some fu ->
if Int64.logand 0xffff_ffff_ffff_0000L fu = 0L then
Some { algorithm ; signed ; fudge ; mac ; original_id ; error ; other }
else
None
let with_mac tsig mac = { tsig with mac }
let with_error tsig error = { tsig with error }
let with_signed tsig signed =
match ptime_to_bits signed with
| Some _ -> Some { tsig with signed }
| None -> None
let with_other tsig other =
match other with
| None -> Some { tsig with other }
| Some ts ->
match ptime_to_bits ts with
| Some _ -> Some { tsig with other }
| None -> None
let pp ppf t =
Fmt.pf ppf
"TSIG %a signed %a fudge %a mac %a original id %04X err %a other %a"
pp_algorithm t.algorithm
(Ptime.pp_rfc3339 ()) t.signed Ptime.Span.pp t.fudge
Cstruct.hexdump_pp t.mac t.original_id Rcode.pp t.error
Fmt.(option ~none:(any "none") (Ptime.pp_rfc3339 ())) t.other
let decode_48bit_time buf off =
let a = Cstruct.BE.get_uint16 buf off
and b = Cstruct.BE.get_uint16 buf (off + 2)
and c = Cstruct.BE.get_uint16 buf (off + 4)
in
Int64.(add
(add (shift_left (of_int a) 32) (shift_left (of_int b) 16))
(of_int c))
let decode_exn names buf ~off =
let ttl = Cstruct.BE.get_uint32 buf off in
let* () =
guard (ttl = 0l) (`Malformed (off, Fmt.str "tsig ttl is not zero %lu" ttl))
in
let len = Cstruct.BE.get_uint16 buf (off + 4) in
let rdata_start = off + 6 in
let* (algorithm, names, off') = Name.decode names buf ~off:rdata_start in
let* algorithm = Name.host rdata_start algorithm in
let signed = decode_48bit_time buf off'
and fudge = Cstruct.BE.get_uint16 buf (off' + 6)
and mac_len = Cstruct.BE.get_uint16 buf (off' + 8)
in
let mac = Cstruct.sub buf (off' + 10) mac_len
and original_id = Cstruct.BE.get_uint16 buf (off' + 10 + mac_len)
and error = Cstruct.BE.get_uint16 buf (off' + 12 + mac_len)
and other_len = Cstruct.BE.get_uint16 buf (off' + 14 + mac_len)
in
let rdata_end = off' + 10 + mac_len + 6 + other_len in
let* () =
guard (rdata_end - rdata_start = len)
(`Leftover (rdata_end, "more bytes in tsig"))
in
let* () = guard (Cstruct.length buf >= rdata_end) `Partial in
let* () =
guard (other_len = 0 || other_len = 6)
(`Malformed (off' + 14 + mac_len, "other timestamp should be 0 or 6 bytes!"))
in
let* algorithm = algorithm_of_name ~off:rdata_start algorithm in
let* signed = Ptime_extra.of_int64 ~off:off' signed in
let* error = Rcode.of_int ~off:(off' + 12 + mac_len) error in
let* other =
if other_len = 0 then
Ok None
else
let other = decode_48bit_time buf (off' + 16 + mac_len) in
let* x = Ptime_extra.of_int64 ~off:(off' + 14 + mac_len + 2) other in
Ok (Some x)
in
let fudge = Ptime.Span.of_int_s fudge in
Ok ({ algorithm ; signed ; fudge ; mac ; original_id ; error ; other },
names,
off' + 16 + mac_len + other_len)
let encode_48bit_time buf ?(off = 0) ts =
match ptime_to_bits ts with
| None ->
Log.warn (fun m -> m "couldn't convert (to_span %a) to int64" Ptime.pp ts)
| Some secs ->
let a, b, c =
let f s = Int64.(to_int (logand 0xffffL (shift_right secs s))) in
f 32, f 16, f 0
in
Cstruct.BE.set_uint16 buf off a ;
Cstruct.BE.set_uint16 buf (off + 2) b ;
Cstruct.BE.set_uint16 buf (off + 4) c
let encode_16bit_time buf ?(off = 0) ts =
match Ptime_extra.span_to_int64 ts with
| None ->
Log.warn (fun m -> m "couldn't convert span %a to int64" Ptime.Span.pp ts)
| Some secs ->
if Int64.logand secs 0xffff_ffff_ffff_0000L > 0L then
Log.warn (fun m -> m "secs %Lu > 16 bit" secs)
else
let a = Int64.(to_int (logand 0xffffL secs)) in
Cstruct.BE.set_uint16 buf off a
let _encode t names buf off =
let algo = algorithm_to_name t.algorithm in
let names, off = Name.encode ~compress:false algo names buf off in
encode_48bit_time buf ~off t.signed ;
encode_16bit_time buf ~off:(off + 6) t.fudge ;
let mac_len = Cstruct.length t.mac in
Cstruct.BE.set_uint16 buf (off + 8) mac_len ;
Cstruct.blit t.mac 0 buf (off + 10) mac_len ;
Cstruct.BE.set_uint16 buf (off + 10 + mac_len) t.original_id ;
Cstruct.BE.set_uint16 buf (off + 12 + mac_len) (Rcode.to_int t.error) ;
let other_len = match t.other with None -> 0 | Some _ -> 6 in
Cstruct.BE.set_uint16 buf (off + 14 + mac_len) other_len ;
(match t.other with
| None -> ()
| Some t -> encode_48bit_time buf ~off:(off + 16 + mac_len) t) ;
names, off + 16 + mac_len + other_len
let name_to_buf name =
let buf = Cstruct.create 255
and emp = Domain_name.Map.empty
in
let _, off = Name.encode ~compress:false name emp buf 0 in
Cstruct.sub buf 0 off
let encode_raw_tsig_base name t =
let name = name_to_buf (Domain_name.canonical name)
and aname = name_to_buf (algorithm_to_name t.algorithm)
in
let clttl = Cstruct.create 6 in
Cstruct.BE.set_uint16 clttl 0 Class.(to_int ANY_CLASS) ;
Cstruct.BE.set_uint32 clttl 2 0l ;
let time = Cstruct.create 8 in
encode_48bit_time time t.signed ;
encode_16bit_time time ~off:6 t.fudge ;
let other =
let buf = match t.other with
| None ->
let buf = Cstruct.create 4 in
Cstruct.BE.set_uint16 buf 2 0 ;
buf
| Some t ->
let buf = Cstruct.create 10 in
Cstruct.BE.set_uint16 buf 2 6 ;
encode_48bit_time buf ~off:4 t ;
buf
in
Cstruct.BE.set_uint16 buf 0 (Rcode.to_int t.error) ;
buf
in
name, clttl, [ aname ; time ], other
let encode_raw name t =
let name, clttl, mid, fin = encode_raw_tsig_base name t in
Cstruct.concat (name :: clttl :: mid @ [ fin ])
let encode_full name t =
let name, clttl, mid, fin = encode_raw_tsig_base name t in
let typ =
let typ = Cstruct.create 2 in
Cstruct.BE.set_uint16 typ 0 rtyp ;
typ
and mac =
let len = Cstruct.length t.mac in
let l = Cstruct.create 2 in
Cstruct.BE.set_uint16 l 0 len ;
let orig = Cstruct.create 2 in
Cstruct.BE.set_uint16 orig 0 t.original_id ;
[ l ; t.mac ; orig ]
in
let rdata = Cstruct.concat (mid @ mac @ [ fin ]) in
let len =
let buf = Cstruct.create 2 in
Cstruct.BE.set_uint16 buf 0 (Cstruct.length rdata) ;
buf
in
Cstruct.concat [ name ; typ ; clttl ; len ; rdata ]
let dnskey_to_tsig_algo key =
match key.Dnskey.algorithm with
| Dnskey.RSA_SHA1 | Dnskey.RSASHA1_NSEC3_SHA1 | Dnskey.RSA_SHA256 | Dnskey.RSA_SHA512 -> Error (`Msg "TSIG with RSA is not supported")
| Dnskey.P256_SHA256 | Dnskey.P384_SHA384 | Dnskey.ED25519 -> Error (`Msg "TSIG with EC is not supported")
| Dnskey.MD5 -> Error (`Msg "TSIG algorithm MD5 is not supported")
| Dnskey.SHA1 -> Ok SHA1
| Dnskey.SHA224 -> Ok SHA224
| Dnskey.SHA256 -> Ok SHA256
| Dnskey.SHA384 -> Ok SHA384
| Dnskey.SHA512 -> Ok SHA512
| Dnskey.Unknown x -> Error (`Msg ("Unknown DNSKEY algorithm " ^ string_of_int x))
end
module Edns = struct
type extension =
| Nsid of Cstruct.t
| Cookie of Cstruct.t
| Tcp_keepalive of int option
| Padding of int
| Extension of int * Cstruct.t
let pp_extension ppf = function
| Nsid cs -> Fmt.pf ppf "nsid %a" Cstruct.hexdump_pp cs
| Cookie cs -> Fmt.pf ppf "cookie %a" Cstruct.hexdump_pp cs
| Tcp_keepalive i -> Fmt.pf ppf "keepalive %a" Fmt.(option ~none:(any "none") int) i
| Padding i -> Fmt.pf ppf "padding %d" i
| Extension (t, v) -> Fmt.pf ppf "unknown option %d: %a" t Cstruct.hexdump_pp v
let compare_extension a b = match a, b with
| Nsid a, Nsid b -> Cstruct.compare a b
| Nsid _, _ -> 1 | _, Nsid _ -> -1
| Cookie a, Cookie b -> Cstruct.compare a b
| Cookie _, _ -> 1 | _, Cookie _ -> -1
| Tcp_keepalive a, Tcp_keepalive b ->
begin match a, b with
| None, None -> 0
| None, Some _ -> -1
| Some _, None -> 1
| Some a, Some b -> Int.compare a b
end
| Tcp_keepalive _, _ -> 1 | _, Tcp_keepalive _ -> -1
| Padding a, Padding b -> Int.compare a b
| Padding _, _ -> 1 | _, Padding _ -> -1
| Extension (t, v), Extension (t', v') ->
andThen (Int.compare t t') (Cstruct.compare v v')
let extension_to_int = function
| Nsid _ -> 3
| Cookie _ -> 10
| Tcp_keepalive _ -> 11
| Padding _ -> 12
| Extension (tag, _) -> tag
let int_to_extension = function
| 3 -> Some `nsid
| 10 -> Some `cookie
| 11 -> Some `tcp_keepalive
| 12 -> Some `padding
| _ -> None
let extension_payload = function
| Nsid cs -> cs
| Cookie cs -> cs
| Tcp_keepalive i -> (match i with None -> Cstruct.create 0 | Some i -> let buf = Cstruct.create 2 in Cstruct.BE.set_uint16 buf 0 i ; buf)
| Padding i -> Cstruct.create i
| Extension (_, v) -> v
let encode_extension t buf off =
let code = extension_to_int t in
let v = extension_payload t in
let l = Cstruct.length v in
Cstruct.BE.set_uint16 buf off code ;
Cstruct.BE.set_uint16 buf (off + 2) l ;
Cstruct.blit v 0 buf (off + 4) l ;
off + 4 + l
let decode_extension buf ~off =
let code = Cstruct.BE.get_uint16 buf off
and tl = Cstruct.BE.get_uint16 buf (off + 2)
in
let v = Cstruct.sub buf (off + 4) tl in
let len = tl + 4 in
match int_to_extension code with
| Some `nsid -> Ok (Nsid v, len)
| Some `cookie -> Ok (Cookie v, len)
| Some `tcp_keepalive ->
let* i =
match tl with
| 0 -> Ok None
| 2 -> Ok (Some (Cstruct.BE.get_uint16 v 0))
| _ -> Error (`Not_implemented (off, Fmt.str "edns keepalive 0x%x" tl))
in
Ok (Tcp_keepalive i, len)
| Some `padding -> Ok (Padding tl, len)
| None -> Ok (Extension (code, v), len)
type t = {
extended_rcode : int ;
version : int ;
dnssec_ok : bool ;
payload_size : int ;
extensions : extension list ;
}
let rtyp = 41
let min_payload_size = 512
let create ?(extended_rcode = 0) ?(version = 0) ?(dnssec_ok = false)
?(payload_size = min_payload_size) ?(extensions = []) () =
let payload_size =
if payload_size < min_payload_size then begin
Log.warn (fun m -> m "requested payload size %d is too small, using %d"
payload_size min_payload_size);
min_payload_size
end else
payload_size
in
{ extended_rcode ; version ; dnssec_ok ; payload_size ; extensions }
let reply = function
| None -> None, None
| Some opt ->
let payload_size = opt.payload_size in
Some payload_size, Some (create ~payload_size ())
let compare a b =
andThen (Int.compare a.extended_rcode b.extended_rcode)
(andThen (Int.compare a.version b.version)
(andThen (Bool.compare a.dnssec_ok b.dnssec_ok)
(andThen (Int.compare a.payload_size b.payload_size)
(List.fold_left2
(fun r a b -> if r = 0 then compare_extension a b else r)
(Int.compare (List.length a.extensions) (List.length b.extensions))
a.extensions b.extensions))))
let pp ppf opt =
Fmt.(pf ppf "EDNS rcode %u version %u dnssec_ok %b payload_size %u extensions %a"
opt.extended_rcode opt.version opt.dnssec_ok opt.payload_size
(list ~sep:(any ", ") pp_extension) opt.extensions)
let decode_extensions buf ~len =
let rec one acc pos =
if len = pos then
Ok (List.rev acc)
else
let* opt, len = decode_extension buf ~off:pos in
one (opt :: acc) (pos + len)
in
one [] 0
let decode_exn buf ~off =
let* () = guard (Cstruct.get_uint8 buf off = 0) (`Malformed (off, "bad edns (must be 0)")) in
let payload_size = Cstruct.BE.get_uint16 buf (off + 3)
and extended_rcode = Cstruct.get_uint8 buf (off + 5)
and version = Cstruct.get_uint8 buf (off + 6)
and flags = Cstruct.BE.get_uint16 buf (off + 7)
and len = Cstruct.BE.get_uint16 buf (off + 9)
in
let off = off + 11 in
let dnssec_ok = flags land 0x8000 = 0x8000 in
let* () = guard (version = 0) (`Bad_edns_version version) in
let payload_size =
if payload_size < min_payload_size then begin
Log.warn (fun m -> m "EDNS payload size is too small %d, using %d"
payload_size min_payload_size);
min_payload_size
end else
payload_size
in
let exts_buf = Cstruct.sub buf off len in
let* extensions = decode_extensions exts_buf ~len in
let opt = { extended_rcode ; version ; dnssec_ok ; payload_size ; extensions } in
Ok (opt, off + len)
let encode_extensions t buf off =
List.fold_left (fun off opt -> encode_extension opt buf off) off t
let encode t buf off =
Cstruct.set_uint8 buf off 0 ;
Cstruct.BE.set_uint16 buf (off + 1) rtyp ;
Cstruct.BE.set_uint16 buf (off + 3) t.payload_size ;
Cstruct.set_uint8 buf (off + 5) t.extended_rcode ;
Cstruct.set_uint8 buf (off + 6) t.version ;
Cstruct.BE.set_uint16 buf (off + 7) (if t.dnssec_ok then 0x8000 else 0) ;
let ext_start = off + 11 in
let ext_end = encode_extensions t.extensions buf ext_start in
Cstruct.BE.set_uint16 buf (off + 9) (ext_end - ext_start) ;
ext_end
let allocate_and_encode edns =
let buf = Cstruct.create 128 in
let off = encode edns buf 0 in
Cstruct.sub buf 0 off
end
module Rr_map = struct
module Mx_set = Set.Make(Mx)
module Txt_set = Set.Make(Txt)
module Srv_set = Set.Make(Srv)
module Dnskey_set = Set.Make(Dnskey)
module Caa_set = Set.Make(Caa)
module Tlsa_set = Set.Make(Tlsa)
module Sshfp_set = Set.Make(Sshfp)
module Ds_set = Set.Make(Ds)
module Rrsig_set = Set.Make(Rrsig)
module Loc_set = Set.Make(Loc)
module Null_set = Set.Make(Null)
module I : sig
type t
val of_int : ?off:int -> int -> (t, [> `Malformed of int * string ]) result
val to_int : t -> int
val compare : t -> t -> int
end = struct
type t = int
let of_int ?(off = 0) i = match i with
| 1 | 2 | 5 | 6 | 12 | 15 | 16 | 28 | 33 | 41 | 43 | 44 | 46 | 47 | 48 | 50 | 52 | 250 | 251 | 252 | 255 | 257 ->
Error (`Malformed (off, "reserved and supported RTYPE not Unknown"))
| x -> if x >= 0 && x < 1 lsl 16 then Ok x else Error (`Malformed (off, "RTYPE exceeds 16 bit"))
let to_int t = t
let compare = Int.compare
end
type 'a with_ttl = int32 * 'a
type _ rr =
| Soa : Soa.t rr
| Ns : Domain_name.Host_set.t with_ttl rr
| Mx : Mx_set.t with_ttl rr
| Cname : Cname.t with_ttl rr
| A : Ipaddr.V4.Set.t with_ttl rr
| Aaaa : Ipaddr.V6.Set.t with_ttl rr
| Ptr : Ptr.t with_ttl rr
| Srv : Srv_set.t with_ttl rr
| Dnskey : Dnskey_set.t with_ttl rr
| Caa : Caa_set.t with_ttl rr
| Tlsa : Tlsa_set.t with_ttl rr
| Sshfp : Sshfp_set.t with_ttl rr
| Txt : Txt_set.t with_ttl rr
| Ds : Ds_set.t with_ttl rr
| Rrsig : Rrsig_set.t with_ttl rr
| Nsec : Nsec.t with_ttl rr
| Nsec3 : Nsec3.t with_ttl rr
| Loc : Loc_set.t with_ttl rr
| Null : Null_set.t with_ttl rr
| Unknown : I.t -> Txt_set.t with_ttl rr
module K = struct
type 'a t = 'a rr
let compare : type a b. a t -> b t -> (a, b) Gmap.Order.t = fun t t' ->
let open Gmap.Order in
match t, t' with
| Soa, Soa -> Eq | Soa, _ -> Lt | _, Soa -> Gt
| Ns, Ns -> Eq | Ns, _ -> Lt | _, Ns -> Gt
| Mx, Mx -> Eq | Mx, _ -> Lt | _, Mx -> Gt
| Cname, Cname -> Eq | Cname, _ -> Lt | _, Cname -> Gt
| A, A -> Eq | A, _ -> Lt | _, A -> Gt
| Aaaa, Aaaa -> Eq | Aaaa, _ -> Lt | _, Aaaa -> Gt
| Ptr, Ptr -> Eq | Ptr, _ -> Lt | _, Ptr -> Gt
| Srv, Srv -> Eq | Srv, _ -> Lt | _, Srv -> Gt
| Dnskey, Dnskey -> Eq | Dnskey, _ -> Lt | _, Dnskey -> Gt
| Caa, Caa -> Eq | Caa, _ -> Lt | _, Caa -> Gt
| Tlsa, Tlsa -> Eq | Tlsa, _ -> Lt | _, Tlsa -> Gt
| Sshfp, Sshfp -> Eq | Sshfp, _ -> Lt | _, Sshfp -> Gt
| Txt, Txt -> Eq | Txt, _ -> Lt | _, Txt -> Gt
| Ds, Ds -> Eq | Ds, _ -> Lt | _, Ds -> Gt
| Rrsig, Rrsig -> Eq | Rrsig, _ -> Lt | _, Rrsig -> Gt
| Nsec, Nsec -> Eq | Nsec, _ -> Lt | _, Nsec -> Gt
| Nsec3, Nsec3 -> Eq | Nsec3, _ -> Lt | _, Nsec3 -> Gt
| Loc, Loc -> Eq | Loc, _ -> Lt | _, Loc -> Gt
| Null, Null -> Eq | Null, _ -> Lt | _, Null -> Gt
| Unknown a, Unknown b ->
let r = I.compare a b in
if r = 0 then Eq else if r < 0 then Lt else Gt
end
include Gmap.Make(K)
type k = K : 'a key -> k
let comparek (K k) (K k') = match K.compare k k' with
| Gmap.Order.Eq -> 0 | Gmap.Order.Gt -> 1 | Gmap.Order.Lt -> -1
let equal_rr : type a. a key -> a -> a -> bool = fun k v v' ->
match k, v, v' with
| Cname, (_, alias), (_, alias') -> Domain_name.equal alias alias'
| Mx, (_, mxs), (_, mxs') -> Mx_set.equal mxs mxs'
| Ns, (_, ns), (_, ns') -> Domain_name.Host_set.equal ns ns'
| Ptr, (_, name), (_, name') -> Domain_name.equal name name'
| Soa, soa, soa' -> Soa.compare soa soa' = 0
| Txt, (_, txts), (_, txts') -> Txt_set.equal txts txts'
| A, (_, aas), (_, aas') -> Ipaddr.V4.Set.equal aas aas'
| Aaaa, (_, aaaas), (_, aaaas') -> Ipaddr.V6.Set.equal aaaas aaaas'
| Srv, (_, srvs), (_, srvs') -> Srv_set.equal srvs srvs'
| Dnskey, (_, keys), (_, keys') -> Dnskey_set.equal keys keys'
| Caa, (_, caas), (_, caas') -> Caa_set.equal caas caas'
| Tlsa, (_, tlsas), (_, tlsas') -> Tlsa_set.equal tlsas tlsas'
| Sshfp, (_, sshfps), (_, sshfps') -> Sshfp_set.equal sshfps sshfps'
| Ds, (_, ds), (_, ds') -> Ds_set.equal ds ds'
| Rrsig, (_, rrs), (_, rrs') -> Rrsig_set.equal rrs rrs'
| Nsec, (_, ns), (_, ns') -> Nsec.compare ns ns' = 0
| Nsec3, (_, ns), (_, ns') -> Nsec3.compare ns ns' = 0
| Loc, (_, loc), (_, loc') -> Loc_set.equal loc loc'
| Null, (_, null), (_, null') -> Null_set.equal null null'
| Unknown _, (_, data), (_, data') -> Txt_set.equal data data'
let equalb (B (k, v)) (B (k', v')) = match K.compare k k' with
| Gmap.Order.Eq -> equal_rr k v v'
| _ -> false
let to_int : type a. a key -> int = function
| A -> 1 | Ns -> 2 | Cname -> 5 | Soa -> 6 | Null -> 10 | Ptr -> 12 | Mx -> 15
| Txt -> 16 | Aaaa -> 28 | Loc -> 29 | Srv -> 33 | Ds -> 43
| Sshfp -> 44 | Rrsig -> 46 | Nsec -> 47 | Dnskey -> 48 | Nsec3 -> 50
| Tlsa -> 52 | Caa -> 257
| Unknown x -> I.to_int x
let any_rtyp = 255 and axfr_rtyp = 252 and ixfr_rtyp = 251
let of_int ?(off = 0) = function
| 1 -> Ok (K A) | 2 -> Ok (K Ns) | 5 -> Ok (K Cname) | 6 -> Ok (K Soa) | 10 -> Ok (K Null)
| 12 -> Ok (K Ptr) | 15 -> Ok (K Mx) | 16 -> Ok (K Txt) | 28 -> Ok (K Aaaa)
| 29 -> Ok (K Loc) | 33 -> Ok (K Srv) | 43 -> Ok (K Ds) | 44 -> Ok (K Sshfp)
| 46 -> Ok (K Rrsig) | 47 -> Ok (K Nsec) | 48 -> Ok (K Dnskey)
| 50 -> Ok (K Nsec3) | 52 -> Ok (K Tlsa) | 257 -> Ok (K Caa)
| x ->
let* i = I.of_int ~off x in
Ok (K (Unknown i))
let ppk ppf (K k) = match k with
| Cname -> Fmt.string ppf "CNAME"
| Mx -> Fmt.string ppf "MX"
| Ns -> Fmt.string ppf "NS"
| Ptr -> Fmt.string ppf "PTR"
| Soa -> Fmt.string ppf "SOA"
| Txt -> Fmt.string ppf "TXT"
| A -> Fmt.string ppf "A"
| Aaaa -> Fmt.string ppf "AAAA"
| Srv -> Fmt.string ppf "SRV"
| Dnskey -> Fmt.string ppf "DNSKEY"
| Caa -> Fmt.string ppf "CAA"
| Tlsa -> Fmt.string ppf "TLSA"
| Sshfp -> Fmt.string ppf "SSHFP"
| Ds -> Fmt.string ppf "DS"
| Rrsig -> Fmt.string ppf "RRSIG"
| Nsec -> Fmt.string ppf "NSEC"
| Nsec3 -> Fmt.string ppf "NSEC3"
| Loc -> Fmt.string ppf "LOC"
| Null -> Fmt.string ppf "NULL"
| Unknown x -> Fmt.pf ppf "TYPE%d" (I.to_int x)
let of_string = function
| "CNAME" -> Ok (K Cname)
| "MX" -> Ok (K Mx)
| "NS" -> Ok (K Ns)
| "PTR" -> Ok (K Ptr)
| "SOA" -> Ok (K Soa)
| "TXT" -> Ok (K Txt)
| "A" -> Ok (K A)
| "AAAA" -> Ok (K Aaaa)
| "SRV" -> Ok (K Srv)
| "DNSKEY" -> Ok (K Dnskey)
| "CAA" -> Ok (K Caa)
| "TLSA" -> Ok (K Tlsa)
| "SSHFP" -> Ok (K Sshfp)
| "DS" -> Ok (K Ds)
| "RRSIG" -> Ok (K Rrsig)
| "NSEC" -> Ok (K Nsec)
| "NSEC3" -> Ok (K Nsec3)
| "LOC" -> Ok (K Loc)
| "NULL" -> Ok (K Null)
| x when String.length x > 4 && String.(equal "TYPE" (sub x 0 4)) ->
Result.map_error
(function `Malformed (_, m) -> `Msg m | `Msg m -> `Msg m)
(try
let i = int_of_string String.(sub x 4 (String.length x - 4)) in
of_int i
with
| Failure _ ->
Error (`Msg ("Bad RR type " ^ x ^ ": couldn't decode number")))
| x -> Error (`Msg ("Bad RR type: couldn't decode " ^ x))
type rrtyp = [ `Any | `Tsig | `Edns | `Ixfr | `Axfr | `K of k ]
let pp_rr ppf = function
| `Any -> Fmt.string ppf "ANY"
| `Tsig -> Fmt.string ppf "TSIG"
| `Edns -> Fmt.string ppf "EDNS"
| `Ixfr -> Fmt.string ppf "IXFR"
| `Axfr -> Fmt.string ppf "AXFR"
| `K k -> ppk ppf k
let rr_to_int : rrtyp -> int = function
| `Any -> any_rtyp
| `Tsig -> Tsig.rtyp
| `Edns -> Edns.rtyp
| `Ixfr -> ixfr_rtyp
| `Axfr -> axfr_rtyp
| `K (K k) -> to_int k
let encode_ntc ?compress names buf off (n, t, c) =
let names, off = Name.encode ?compress n names buf off in
Cstruct.BE.set_uint16 buf off (rr_to_int t) ;
Cstruct.BE.set_uint16 buf (off + 2) c ;
names, off + 4
let encode : type a. ?clas:Class.t -> [ `raw ] Domain_name.t -> a key -> a -> Name.name_offset_map -> Cstruct.t -> int ->
(Name.name_offset_map * int) * int = fun ?(clas = Class.IN) name k v names buf off ->
let clas = Class.to_int clas in
let rr names f off ttl =
let names, off' = encode_ntc names buf off (name, `K (K k), clas) in
let rdata_start = off' + 6 in
let names, rdata_end = f names buf rdata_start in
let rdata_len = rdata_end - rdata_start in
Cstruct.BE.set_uint32 buf off' ttl ;
Cstruct.BE.set_uint16 buf (off' + 4) rdata_len ;
names, rdata_end
in
match k, v with
| Soa, soa -> rr names (Soa.encode soa) off soa.minimum, 1
| Ns, (ttl, ns) ->
Domain_name.Host_set.fold (fun name ((names, off), count) ->
rr names (Ns.encode name) off ttl, succ count)
ns ((names, off), 0)
| Mx, (ttl, mx) ->
Mx_set.fold (fun mx ((names, off), count) ->
rr names (Mx.encode mx) off ttl, succ count)
mx ((names, off), 0)
| Cname, (ttl, alias) -> rr names (Cname.encode alias) off ttl, 1
| A, (ttl, addresses) ->
Ipaddr.V4.Set.fold (fun address ((names, off), count) ->
rr names (A.encode address) off ttl, succ count)
addresses ((names, off), 0)
| Aaaa, (ttl, aaaas) ->
Ipaddr.V6.Set.fold (fun address ((names, off), count) ->
rr names (Aaaa.encode address) off ttl, succ count)
aaaas ((names, off), 0)
| Ptr, (ttl, rev) -> rr names (Ptr.encode rev) off ttl, 1
| Srv, (ttl, srvs) ->
Srv_set.fold (fun srv ((names, off), count) ->
rr names (Srv.encode srv) off ttl, succ count)
srvs ((names, off), 0)
| Dnskey, (ttl, dnskeys) ->
Dnskey_set.fold (fun dnskey ((names, off), count) ->
rr names (Dnskey.encode dnskey) off ttl, succ count)
dnskeys ((names, off), 0)
| Caa, (ttl, caas) ->
Caa_set.fold (fun caa ((names, off), count) ->
rr names (Caa.encode caa) off ttl, succ count)
caas ((names, off), 0)
| Tlsa, (ttl, tlsas) ->
Tlsa_set.fold (fun tlsa ((names, off), count) ->
rr names (Tlsa.encode tlsa) off ttl, succ count)
tlsas ((names, off), 0)
| Sshfp, (ttl, sshfps) ->
Sshfp_set.fold (fun sshfp ((names, off), count) ->
rr names (Sshfp.encode sshfp) off ttl, succ count)
sshfps ((names, off), 0)
| Txt, (ttl, txts) ->
Txt_set.fold (fun txt ((names, off), count) ->
rr names (Txt.encode txt) off ttl, succ count)
txts ((names, off), 0)
| Ds, (ttl, ds) ->
Ds_set.fold (fun ds ((names, off), count) ->
rr names (Ds.encode ds) off ttl, succ count)
ds ((names, off), 0)
| Rrsig, (ttl, rrs) ->
Rrsig_set.fold (fun rrsig ((names, off), count) ->
rr names (Rrsig.encode rrsig) off ttl, succ count)
rrs ((names, off), 0)
| Nsec, (ttl, nsec) ->
rr names (Nsec.encode nsec) off ttl, 1
| Nsec3, (ttl, nsec) ->
rr names (Nsec3.encode nsec) off ttl, 1
| Loc, (ttl, locs) ->
Loc_set.fold (fun loc ((names, off), count) ->
rr names (Loc.encode loc) off ttl, succ count)
locs ((names, off), 0)
| Null, (ttl, nulls) ->
Null_set.fold (fun null ((names, off), count) ->
rr names (Null.encode null) off ttl, succ count)
nulls ((names, off), 0)
| Unknown _, (ttl, datas) ->
let encode data names buf off =
let l = String.length data in
Cstruct.blit_from_string data 0 buf off l;
names, off + l
in
Txt_set.fold (fun data ((names, off), count) ->
rr names (encode data) off ttl, succ count)
datas ((names, off), 0)
let encode_dnssec : type a. ttl:int32 -> ?clas:Class.t -> [ `raw ] Domain_name.t -> a key -> a ->
(int * Cstruct.t) list = fun ~ttl ?(clas = Class.IN) name k v ->
let clas = Class.to_int clas in
let compress = false in
let names = Domain_name.Map.empty in
let rr f =
let buf = Cstruct.create 4096 in
let _names, off' = encode_ntc ~compress names buf 0 (name, `K (K k), clas) in
let rdata_start = off' + 6 in
let _names, rdata_end = f names buf rdata_start in
let rdata_len = rdata_end - rdata_start in
Cstruct.BE.set_uint32 buf off' ttl ;
Cstruct.BE.set_uint16 buf (off' + 4) rdata_len ;
rdata_start, Cstruct.sub buf 0 rdata_end
in
match k, v with
| Soa, soa -> [ rr (Soa.encode ~compress soa) ]
| Ns, (_ttl, ns) ->
Domain_name.Host_set.fold (fun name acc ->
rr (Ns.encode ~compress name) :: acc)
ns []
| Mx, (_ttl, mx) ->
Mx_set.fold (fun mx acc ->
rr (Mx.encode ~compress mx) :: acc)
mx []
| Cname, (_ttl, alias) -> [ rr (Cname.encode ~compress alias) ]
| A, (_ttl, addresses) ->
Ipaddr.V4.Set.fold (fun address acc -> rr (A.encode address) :: acc)
addresses []
| Aaaa, (_ttl, aaaas) ->
Ipaddr.V6.Set.fold (fun address acc ->
rr (Aaaa.encode address) :: acc)
aaaas []
| Ptr, (_ttl, rev) -> [ rr (Ptr.encode ~compress rev) ]
| Srv, (_ttl, srvs) ->
Srv_set.fold (fun srv acc ->
rr (Srv.encode srv) :: acc)
srvs []
| Dnskey, (_ttl, dnskeys) ->
Dnskey_set.fold (fun dnskey acc ->
rr (Dnskey.encode dnskey) :: acc)
dnskeys []
| Caa, (_ttl, caas) ->
Caa_set.fold (fun caa acc ->
rr (Caa.encode caa) :: acc)
caas []
| Tlsa, (_ttl, tlsas) ->
Tlsa_set.fold (fun tlsa acc ->
rr (Tlsa.encode tlsa) :: acc)
tlsas []
| Sshfp, (_ttl, sshfps) ->
Sshfp_set.fold (fun sshfp acc ->
rr (Sshfp.encode sshfp) :: acc)
sshfps []
| Txt, (_ttl, txts) ->
Txt_set.fold (fun txt acc ->
rr (Txt.encode txt) :: acc)
txts []
| Ds, (_ttl, ds) ->
Ds_set.fold (fun ds acc ->
rr (Ds.encode ds) :: acc)
ds []
| Rrsig, (_ttl, rrs) ->
Rrsig_set.fold (fun rrsig acc ->
rr (Rrsig.encode rrsig) :: acc)
rrs []
| Nsec, (_ttl, ns) ->
[ rr (Nsec.encode ns) ]
| Nsec3, (_ttl, ns) ->
[ rr (Nsec3.encode ns) ]
| Loc, (_ttl, locs) ->
Loc_set.fold (fun loc acc ->
rr (Loc.encode loc) :: acc)
locs []
| Null, (_ttl, nulls) ->
Null_set.fold (fun null acc ->
rr (Null.encode null) :: acc)
nulls []
| Unknown _, (_ttl, datas) ->
let encode data names buf off =
let l = String.length data in
Cstruct.blit_from_string data 0 buf off l;
names, off + l
in
Txt_set.fold (fun data acc ->
rr (encode data) :: acc)
datas []
let canonical : type a. a key -> a -> a = fun k v ->
match k, v with
| Soa, s -> Soa.canonical s
| Ns, (ttl, ns) -> ttl, Domain_name.Host_set.map Ns.canonical ns
| Mx, (ttl, mx) -> ttl, Mx_set.map Mx.canonical mx
| Cname, (ttl, cn) -> ttl, Cname.canonical cn
| Ptr, (ttl, ptr) -> ttl, Ptr.canonical ptr
| Srv, (ttl, srv) -> ttl, Srv_set.map Srv.canonical srv
| Rrsig, (ttl, rrsig) -> ttl, Rrsig_set.map Rrsig.canonical rrsig
| Nsec, (ttl, nsec) -> ttl, Nsec.canonical nsec
| _, v -> v
let canonical_order cs cs' =
let cs_l = Cstruct.length cs and cs'_l = Cstruct.length cs' in
let rec c idx =
if cs_l = cs'_l && cs_l = idx then 0
else if cs_l = idx then 1
else if cs'_l = idx then -1
else
match Int.compare (Cstruct.get_uint8 cs idx) (Cstruct.get_uint8 cs' idx) with
| 0 -> c (succ idx)
| x -> x
in
c 0
let prep_for_sig : type a . [`raw] Domain_name.t -> Rrsig.t -> a key -> a ->
([`raw] Domain_name.t * Cstruct.t, [> `Msg of string ]) result =
fun name rrsig typ value ->
let buf, off = Rrsig.prep_rrsig rrsig in
let rrsig_cs = Cstruct.sub buf 0 off in
Log.debug (fun m -> m "using rrsig %a" Cstruct.hexdump_pp rrsig_cs);
let* name =
let* used_name = Rrsig.used_name rrsig name in
Ok (Domain_name.canonical used_name)
in
let* (K covered_typ) =
Result.map_error
(function `Malformed (_, txt) -> `Msg txt)
(of_int rrsig.Rrsig.type_covered)
in
let* () = guard (K covered_typ <> K Rrsig) (`Msg "RRSIG records are never signed") in
let* () = guard (K covered_typ = K typ) (`Msg "RRSIG type_covered does not match typ") in
let value = canonical typ value in
let ttl = rrsig.Rrsig.original_ttl in
let cs = encode_dnssec ~ttl name typ value in
let order (off, cs) (off', cs') =
let cs = Cstruct.shift cs off
and cs' = Cstruct.shift cs' off'
in
canonical_order cs cs'
in
let sorted_cs = List.map snd (List.sort order cs) in
Ok (name, Cstruct.concat (rrsig_cs :: sorted_cs))
let canonical_encoded_name name =
let buf = Cstruct.create 512 in
let _, s =
Name.encode ~compress:false (Domain_name.canonical name)
Domain_name.Map.empty buf 0
in
Cstruct.sub buf 0 s
let union_rr : type a. a key -> a -> a -> a = fun k l r ->
match k, l, r with
| Cname, _, cname -> cname
| Mx, (_, mxs), (ttl, mxs') -> (ttl, Mx_set.union mxs mxs')
| Ns, (_, ns), (ttl, ns') -> (ttl, Domain_name.Host_set.union ns ns')
| Ptr, _, ptr -> ptr
| Soa, _, soa -> soa
| Txt, (_, txts), (ttl, txts') -> (ttl, Txt_set.union txts txts')
| A, (_, ips), (ttl, ips') -> (ttl, Ipaddr.V4.Set.union ips ips')
| Aaaa, (_, ips), (ttl, ips') -> (ttl, Ipaddr.V6.Set.union ips ips')
| Srv, (_, srvs), (ttl, srvs') -> (ttl, Srv_set.union srvs srvs')
| Dnskey, (_, keys), (ttl, keys') -> (ttl, Dnskey_set.union keys keys')
| Caa, (_, caas), (ttl, caas') -> (ttl, Caa_set.union caas caas')
| Tlsa, (_, tlsas), (ttl, tlsas') -> (ttl, Tlsa_set.union tlsas tlsas')
| Sshfp, (_, sshfps), (ttl, sshfps') -> (ttl, Sshfp_set.union sshfps sshfps')
| Ds, (_, ds), (ttl, ds') -> (ttl, Ds_set.union ds ds')
| Rrsig, (_, rrs), (ttl, rrs') -> (ttl, Rrsig_set.union rrs rrs')
| Nsec, _, nsec -> nsec
| Nsec3, _, nsec -> nsec
| Loc, _, loc -> loc
| Null, _, null -> null
| Unknown _, (_, data), (ttl, data') -> (ttl, Txt_set.union data data')
let unionee : type a. a key -> a -> a -> a option =
fun k v v' -> Some (union_rr k v v')
let combine_opt : type a. a key -> a -> a option -> a option = fun k l r ->
match r with
| None -> Some l
| Some r -> Some (union_rr k l r)
let remove_rr : type a. a key -> a -> a -> a option = fun k v rem ->
match k, v, rem with
| Cname, _, _ -> None
| Mx, (ttl, mxs), (_, rm) ->
let s = Mx_set.diff mxs rm in
if Mx_set.is_empty s then None else Some (ttl, s)
| Ns, (ttl, ns), (_, rm) ->
let s = Domain_name.Host_set.diff ns rm in
if Domain_name.Host_set.is_empty s then None else Some (ttl, s)
| Ptr, _, _ -> None
| Soa, _, _ -> None
| Txt, (ttl, txts), (_, rm) ->
let s = Txt_set.diff txts rm in
if Txt_set.is_empty s then None else Some (ttl, s)
| A, (ttl, ips), (_, rm) ->
let s = Ipaddr.V4.Set.diff ips rm in
if Ipaddr.V4.Set.is_empty s then None else Some (ttl, s)
| Aaaa, (ttl, ips), (_, rm) ->
let s = Ipaddr.V6.Set.diff ips rm in
if Ipaddr.V6.Set.is_empty s then None else Some (ttl, s)
| Srv, (ttl, srvs), (_, rm) ->
let s = Srv_set.diff srvs rm in
if Srv_set.is_empty s then None else Some (ttl, s)
| Dnskey, (ttl, keys), (_, rm) ->
let s = Dnskey_set.diff keys rm in
if Dnskey_set.is_empty s then None else Some (ttl, s)
| Caa, (ttl, caas), (_, rm) ->
let s = Caa_set.diff caas rm in
if Caa_set.is_empty s then None else Some (ttl, s)
| Tlsa, (ttl, tlsas), (_, rm) ->
let s = Tlsa_set.diff tlsas rm in
if Tlsa_set.is_empty s then None else Some (ttl, s)
| Sshfp, (ttl, sshfps), (_, rm) ->
let s = Sshfp_set.diff sshfps rm in
if Sshfp_set.is_empty s then None else Some (ttl, s)
| Ds, (ttl, ds), (_, rm) ->
let s = Ds_set.diff ds rm in
if Ds_set.is_empty s then None else Some (ttl, s)
| Rrsig, (ttl, rrs), (_, rm) ->
let s = Rrsig_set.diff rrs rm in
if Rrsig_set.is_empty s then None else Some (ttl, s)
| Nsec, _, _ -> None
| Nsec3, _, _ -> None
| Loc, (ttl, locs), (_, rm) ->
let s = Loc_set.diff locs rm in
if Loc_set.is_empty s then None else Some (ttl, s)
| Null, (ttl, nulls), (_, rm) ->
let s = Null_set.diff nulls rm in
if Null_set.is_empty s then None else Some (ttl, s)
| Unknown _, (ttl, datas), (_, rm) ->
let data = Txt_set.diff datas rm in
if Txt_set.is_empty data then None else Some (ttl, data)
let diff ~old map =
let deleted, added = ref empty, ref empty in
let merger : type a . a key -> a option -> a option -> a option =
fun k a b ->
(match k, a, b with
| Soa, _, _ -> ()
| _, None, Some data -> added := add k data !added
| _, Some data, None -> deleted := add k data !deleted
| _, None, None -> ()
| _, Some old, Some n ->
(match remove_rr k old n with
| None -> ()
| Some tbr -> deleted := add k tbr !deleted);
match remove_rr k n old with
| None -> ()
| Some tba -> added := add k tba !added);
None
in
ignore (merge { f = merger } old map);
(if is_empty !deleted then None else Some !deleted),
(if is_empty !added then None else Some !added)
let text : type c. ?origin:'a Domain_name.t -> ?default_ttl:int32 ->
'b Domain_name.t -> c key -> c -> string = fun ?origin ?default_ttl n t v ->
let rec ws_after_56 s =
let pos = 56 in
let l = String.length s in
if l < pos then s
else String.sub s 0 pos ^ " " ^ ws_after_56 (String.sub s pos (l - pos))
in
let hex cs =
let buf = Bytes.create (Cstruct.length cs * 2) in
for i = 0 to pred (Cstruct.length cs) do
let byte = Cstruct.get_uint8 cs i in
let up, low = byte lsr 4, byte land 0x0F in
let to_hex_char v = char_of_int (if v < 10 then 0x30 + v else 0x37 + v) in
Bytes.set buf (i * 2) (to_hex_char up) ;
Bytes.set buf (i * 2 + 1) (to_hex_char low)
done;
Bytes.unsafe_to_string buf |> ws_after_56
and b64 cs =
Base64.encode_string (Cstruct.to_string cs) |> ws_after_56
in
let origin = match origin with
| None -> None
| Some n -> Some (n, Array.length (Domain_name.to_array n))
in
let name : type a . a Domain_name.t -> string = fun n ->
let n = Domain_name.raw n in
match origin with
| Some (domain, amount) when Domain_name.is_subdomain ~subdomain:n ~domain ->
let n' = Domain_name.drop_label_exn ~rev:true ~amount n in
if Domain_name.equal n' Domain_name.root then
"@"
else
Domain_name.to_string n'
| _ -> Domain_name.to_string ~trailing:true n
in
let ttl_opt ttl = match default_ttl with
| Some d when Int32.compare ttl d = 0 -> None
| _ -> Some ttl
in
let ttl_fmt = Fmt.(option (append uint32 (any "\t"))) in
let str_name = name n in
let strs =
match t, v with
| Cname, (ttl, alias) ->
[ Fmt.str "%s\t%aCNAME\t%s" str_name ttl_fmt (ttl_opt ttl) (name alias) ]
| Mx, (ttl, mxs) ->
Mx_set.fold (fun { preference ; mail_exchange } acc ->
Fmt.str "%s\t%aMX\t%u\t%s" str_name ttl_fmt (ttl_opt ttl) preference (name mail_exchange) :: acc)
mxs []
| Ns, (ttl, ns) ->
Domain_name.Host_set.fold (fun ns acc ->
Fmt.str "%s\t%aNS\t%s" str_name ttl_fmt (ttl_opt ttl) (name ns) :: acc)
ns []
| Ptr, (ttl, ptr) ->
[ Fmt.str "%s\t%aPTR\t%s" str_name ttl_fmt (ttl_opt ttl) (name ptr) ]
| Soa, soa ->
[ Fmt.str "%s\t%aSOA\t%s\t%s\t%lu\t%lu\t%lu\t%lu\t%lu" str_name
ttl_fmt (ttl_opt soa.minimum)
(name soa.nameserver)
(name soa.hostmaster)
soa.serial soa.refresh soa.retry
soa.expiry soa.minimum ]
| Txt, (ttl, txts) ->
Txt_set.fold (fun txt acc ->
Fmt.str "%s\t%aTXT\t\"%s\"" str_name ttl_fmt (ttl_opt ttl) txt :: acc)
txts []
| A, (ttl, a) ->
Ipaddr.V4.Set.fold (fun ip acc ->
Fmt.str "%s\t%aA\t%s" str_name ttl_fmt (ttl_opt ttl) (Ipaddr.V4.to_string ip) :: acc)
a []
| Aaaa, (ttl, aaaa) ->
Ipaddr.V6.Set.fold (fun ip acc ->
Fmt.str "%s\t%aAAAA\t%s" str_name ttl_fmt (ttl_opt ttl) (Ipaddr.V6.to_string ip) :: acc)
aaaa []
| Srv, (ttl, srvs) ->
Srv_set.fold (fun srv acc ->
Fmt.str "%s\t%aSRV\t%u\t%u\t%u\t%s"
str_name ttl_fmt (ttl_opt ttl)
srv.priority srv.weight srv.port
(name srv.target) :: acc)
srvs []
| Dnskey, (ttl, keys) ->
Dnskey_set.fold (fun key acc ->
Fmt.str "%s%a\tDNSKEY\t%u\t3\t%d\t%s"
str_name ttl_fmt (ttl_opt ttl)
(Dnskey.encode_flags key.flags)
(Dnskey.algorithm_to_int key.algorithm)
(b64 key.key) :: acc)
keys []
| Caa, (ttl, caas) ->
Caa_set.fold (fun caa acc ->
Fmt.str "%s\t%aCAA\t%s\t%s\t\"%s\""
str_name ttl_fmt (ttl_opt ttl)
(if caa.critical then "128" else "0")
caa.tag (String.concat ";" caa.value) :: acc)
caas []
| Tlsa, (ttl, tlsas) ->
Tlsa_set.fold (fun tlsa acc ->
Fmt.str "%s\t%aTLSA\t%u\t%u\t%u\t%s"
str_name ttl_fmt (ttl_opt ttl)
(Tlsa.cert_usage_to_int tlsa.cert_usage)
(Tlsa.selector_to_int tlsa.selector)
(Tlsa.matching_type_to_int tlsa.matching_type)
(hex tlsa.data) :: acc)
tlsas []
| Sshfp, (ttl, sshfps) ->
Sshfp_set.fold (fun sshfp acc ->
Fmt.str "%s\t%aSSHFP\t%u\t%u\t%s" str_name ttl_fmt (ttl_opt ttl)
(Sshfp.algorithm_to_int sshfp.algorithm)
(Sshfp.typ_to_int sshfp.typ)
(hex sshfp.fingerprint) :: acc)
sshfps []
| Ds, (ttl, ds) ->
Ds_set.fold (fun ds acc ->
Fmt.str "%s\t%aDS\t%u\t%u\t%u\t%s" str_name ttl_fmt (ttl_opt ttl)
ds.Ds.key_tag
(Dnskey.algorithm_to_int ds.algorithm)
(Ds.digest_type_to_int ds.digest_type)
(hex ds.digest) :: acc)
ds []
| Rrsig, (ttl, rrs) ->
Rrsig_set.fold (fun rrsig acc ->
let typ = match of_int rrsig.type_covered with
| Ok k -> Fmt.to_to_string ppk k
| Error _ -> "TYPE" ^ string_of_int rrsig.type_covered
in
let pp_ts ppf ts =
let (year, month, day), ((hour, minute, second), _) = Ptime.to_date_time ts in
Fmt.pf ppf "%04d%02d%02d%02d%02d%02d" year month day hour minute second
in
Fmt.str "%s\t%aRRSIG\t%s\t%u\t%u\t%lu\t%a\t%a\t%u\t%s\t%s" str_name ttl_fmt (ttl_opt ttl)
typ (Dnskey.algorithm_to_int rrsig.algorithm)
rrsig.label_count rrsig.original_ttl
pp_ts rrsig.signature_expiration pp_ts rrsig.signature_inception
rrsig.key_tag (name rrsig.signer_name)
(b64 rrsig.signature) :: acc)
rrs []
| Nsec, (ttl, ns) ->
let types =
Bit_map.fold (fun i acc ->
match of_int i with
| Ok k -> k :: acc
| Error _ -> assert false)
ns.Nsec.types [] |> List.rev
in
[ Fmt.str "%s\t%aNSEC\t%s\t(%a)" str_name ttl_fmt (ttl_opt ttl)
(name ns.Nsec.next_domain) Fmt.(list ~sep:(any " ") ppk) types ]
| Nsec3, (ttl, ns) ->
let types =
Bit_map.fold (fun i acc ->
match of_int i with
| Ok k -> k :: acc
| Error _ -> assert false)
ns.Nsec3.types [] |> List.rev
in
[ Fmt.str "%s\t%aNSEC3\t%d\t%d\t%d\t%s\t%s\t%a" str_name
ttl_fmt (ttl_opt ttl) Nsec3.hash (Nsec3.flags_to_int ns.Nsec3.flags)
ns.Nsec3.iterations
(if Cstruct.length ns.Nsec3.salt = 0 then "-" else hex ns.Nsec3.salt)
(hex ns.Nsec3.next_owner_hashed)
Fmt.(list ~sep:(any " ") ppk) types ]
| Loc, (ttl, locs) ->
Loc_set.fold (fun loc acc ->
Fmt.str "%s\t%aLOC\t%s" str_name ttl_fmt (ttl_opt ttl) (Loc.to_string loc) :: acc)
locs []
| Null, (ttl, nulls) ->
Null_set.fold (fun null acc ->
Fmt.str "%s\t%aNULL\t%a" str_name ttl_fmt (ttl_opt ttl) Cstruct.hexdump_pp null :: acc)
nulls []
| Unknown x, (ttl, datas) ->
Txt_set.fold (fun data acc ->
Fmt.str "%s\t%aTYPE%d\t\\# %d %s" str_name ttl_fmt (ttl_opt ttl)
(I.to_int x) (String.length data) (hex (Cstruct.of_string data)) :: acc)
datas []
in
String.concat "\n" strs
let ttl : type a. a key -> a -> int32 = fun k v ->
match k, v with
| Cname, (ttl, _) -> ttl
| Mx, (ttl, _) -> ttl
| Ns, (ttl, _) -> ttl
| Ptr, (ttl, _) -> ttl
| Soa, soa -> soa.minimum
| Txt, (ttl, _) -> ttl
| A, (ttl, _) -> ttl
| Aaaa, (ttl, _) -> ttl
| Srv, (ttl, _) -> ttl
| Dnskey, (ttl, _) -> ttl
| Caa, (ttl, _) -> ttl
| Tlsa, (ttl, _) -> ttl
| Sshfp, (ttl, _) -> ttl
| Ds, (ttl, _) -> ttl
| Rrsig, (ttl, _) -> ttl
| Nsec, (ttl, _) -> ttl
| Nsec3, (ttl, _) -> ttl
| Loc, (ttl, _) -> ttl
| Null, (ttl, _) -> ttl
| Unknown _, (ttl, _) -> ttl
let with_ttl : type a. a key -> a -> int32 -> a = fun k v ttl ->
match k, v with
| Cname, (_, cname) -> ttl, cname
| Mx, (_, mxs) -> ttl, mxs
| Ns, (_, ns) -> ttl, ns
| Ptr, (_, ptr) -> ttl, ptr
| Soa, soa -> soa
| Txt, (_, txts) -> ttl, txts
| A, (_, ips) -> ttl, ips
| Aaaa, (_, ips) -> ttl, ips
| Srv, (_, srvs) -> ttl, srvs
| Dnskey, keys -> keys
| Caa, (_, caas) -> ttl, caas
| Tlsa, (_, tlsas) -> ttl, tlsas
| Sshfp, (_, sshfps) -> ttl, sshfps
| Ds, (_, ds) -> ttl, ds
| Rrsig, (_, rrs) -> ttl, rrs
| Nsec, (_, ns) -> ttl, ns
| Nsec3, (_, ns) -> ttl, ns
| Loc, (_, loc) -> ttl, loc
| Null, (_, null) -> ttl, null
| Unknown _, (_, datas) -> ttl, datas
let split : type a. a key -> a -> a * a option = fun k v ->
match k, v with
| Cname, (ttl, cname) ->
(ttl, cname), None
| Mx, (ttl, mxs) ->
let one = Mx_set.choose mxs in
let rest = Mx_set.remove one mxs in
let rest' =
if Mx_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Mx_set.singleton one), rest'
| Ns, (ttl, ns) ->
let one = Domain_name.Host_set.choose ns in
let rest = Domain_name.Host_set.remove one ns in
let rest' =
if Domain_name.Host_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Domain_name.Host_set.singleton one), rest'
| Ptr, (ttl, ptr) -> (ttl, ptr), None
| Soa, soa -> soa, None
| Txt, (ttl, txts) ->
let one = Txt_set.choose txts in
let rest = Txt_set.remove one txts in
let rest' =
if Txt_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Txt_set.singleton one), rest'
| A, (ttl, ips) ->
let one = Ipaddr.V4.Set.choose ips in
let rest = Ipaddr.V4.Set.remove one ips in
let rest' =
if Ipaddr.V4.Set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Ipaddr.V4.Set.singleton one), rest'
| Aaaa, (ttl, ips) ->
let one = Ipaddr.V6.Set.choose ips in
let rest = Ipaddr.V6.Set.remove one ips in
let rest' =
if Ipaddr.V6.Set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Ipaddr.V6.Set.singleton one), rest'
| Srv, (ttl, srvs) ->
let one = Srv_set.choose srvs in
let rest = Srv_set.remove one srvs in
let rest' =
if Srv_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Srv_set.singleton one), rest'
| Dnskey, (ttl, keys) ->
let one = Dnskey_set.choose keys in
let rest = Dnskey_set.remove one keys in
let rest' =
if Dnskey_set.is_empty keys then None else Some (ttl, rest)
in
(ttl, Dnskey_set.singleton one), rest'
| Caa, (ttl, caas) ->
let one = Caa_set.choose caas in
let rest = Caa_set.remove one caas in
let rest' =
if Caa_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Caa_set.singleton one), rest'
| Tlsa, (ttl, tlsas) ->
let one = Tlsa_set.choose tlsas in
let rest = Tlsa_set.remove one tlsas in
let rest' =
if Tlsa_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Tlsa_set.singleton one), rest'
| Sshfp, (ttl, sshfps) ->
let one = Sshfp_set.choose sshfps in
let rest = Sshfp_set.remove one sshfps in
let rest' =
if Sshfp_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Sshfp_set.singleton one), rest'
| Ds, (ttl, ds) ->
let one = Ds_set.choose ds in
let rest = Ds_set.remove one ds in
let rest' =
if Ds_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Ds_set.singleton one), rest'
| Rrsig, (ttl, rrs) ->
let one = Rrsig_set.choose rrs in
let rest = Rrsig_set.remove one rrs in
let rest' =
if Rrsig_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Rrsig_set.singleton one), rest'
| Nsec, (ttl, rr) -> (ttl, rr), None
| Nsec3, (ttl, rr) -> (ttl, rr), None
| Loc, (ttl, locs) ->
let one = Loc_set.choose locs in
let rest = Loc_set.remove one locs in
let rest' =
if Loc_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Loc_set.singleton one), rest'
| Null, (ttl, nulls) ->
let one = Null_set.choose nulls in
let rest = Null_set.remove one nulls in
let rest' =
if Null_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Null_set.singleton one), rest'
| Unknown _, (ttl, datas) ->
let one = Txt_set.choose datas in
let rest = Txt_set.remove one datas in
let rest' =
if Txt_set.is_empty rest then None else Some (ttl, rest)
in
(ttl, Txt_set.singleton one), rest'
let pp_b ppf (B (k, v)) =
let txt = text Domain_name.root k v in
Fmt.string ppf txt
let names : type a. a key -> a -> Domain_name.Host_set.t = fun k v ->
match k, v with
| Cname, (_, alias) ->
begin match Domain_name.host alias with
| Error _ -> Domain_name.Host_set.empty
| Ok a -> Domain_name.Host_set.singleton a
end
| Mx, (_, mxs) ->
Mx_set.fold (fun { mail_exchange ; _} acc ->
Domain_name.Host_set.add mail_exchange acc)
mxs Domain_name.Host_set.empty
| Ns, (_, names) -> names
| Srv, (_, srvs) ->
Srv_set.fold (fun x acc -> Domain_name.Host_set.add x.target acc)
srvs Domain_name.Host_set.empty
| _ -> Domain_name.Host_set.empty
let decode names buf off (K typ) =
let* () = guard (Cstruct.length buf - off >= 6) `Partial in
let ttl = Cstruct.BE.get_uint32 buf off
and len = Cstruct.BE.get_uint16 buf (off + 4)
and rdata_start = off + 6
in
let* () =
guard (Int32.logand ttl 0x8000_0000l = 0l)
(`Malformed (off, Fmt.str "bad TTL (high bit set) %lu" ttl))
in
let* () = guard (Cstruct.length buf - rdata_start >= len) `Partial in
let* () =
guard (len <= max_rdata_length)
(`Malformed (off + 4, Fmt.str "length %d exceeds maximum rdata size" len))
in
let* b, names, rdata_end =
try
let buf = Cstruct.sub buf 0 (rdata_start + len)
and off = rdata_start
in
begin match typ with
| Soa ->
let* soa, names, off = Soa.decode_exn names buf ~off ~len in
Ok (B (Soa, soa), names, off)
| Ns ->
let* ns, names, off = Ns.decode names buf ~off ~len in
Ok (B (Ns, (ttl, Domain_name.Host_set.singleton ns)), names, off)
| Mx ->
let* mx, names, off = Mx.decode_exn names buf ~off ~len in
Ok (B (Mx, (ttl, Mx_set.singleton mx)), names, off)
| Cname ->
let* alias, names, off = Cname.decode names buf ~off ~len in
Ok (B (Cname, (ttl, alias)), names, off)
| A ->
let* address, names, off = A.decode_exn names buf ~off ~len in
Ok (B (A, (ttl, Ipaddr.V4.Set.singleton address)), names, off)
| Aaaa ->
let* address, names, off = Aaaa.decode_exn names buf ~off ~len in
Ok (B (Aaaa, (ttl, Ipaddr.V6.Set.singleton address)), names, off)
| Ptr ->
let* rev, names, off = Ptr.decode names buf ~off ~len in
Ok (B (Ptr, (ttl, rev)), names, off)
| Srv ->
let* srv, names, off = Srv.decode_exn names buf ~off ~len in
Ok (B (Srv, (ttl, Srv_set.singleton srv)), names, off)
| Dnskey ->
let* dnskey, names, off = Dnskey.decode_exn names buf ~off ~len in
Ok (B (Dnskey, (ttl, Dnskey_set.singleton dnskey)), names, off)
| Caa ->
let* caa, names, off = Caa.decode_exn names buf ~off ~len in
Ok (B (Caa, (ttl, Caa_set.singleton caa)), names, off)
| Tlsa ->
let* tlsa, names, off = Tlsa.decode_exn names buf ~off ~len in
Ok (B (Tlsa, (ttl, Tlsa_set.singleton tlsa)), names, off)
| Sshfp ->
let* sshfp, names, off = Sshfp.decode_exn names buf ~off ~len in
Ok (B (Sshfp, (ttl, Sshfp_set.singleton sshfp)), names, off)
| Txt ->
let* txt, names, off = Txt.decode_exn names buf ~off ~len in
Ok (B (Txt, (ttl, Txt_set.singleton txt)), names, off)
| Ds ->
let* ds, names, off = Ds.decode_exn names buf ~off ~len in
Ok (B (Ds, (ttl, Ds_set.singleton ds)), names, off)
| Rrsig ->
let* rrs, names, off = Rrsig.decode_exn names buf ~off ~len in
Ok (B (Rrsig, (ttl, Rrsig_set.singleton rrs)), names, off)
| Nsec ->
let* rr, names, off = Nsec.decode_exn names buf ~off ~len in
Ok (B (Nsec, (ttl, rr)), names, off)
| Nsec3 ->
let* rr, names, off = Nsec3.decode_exn names buf ~off ~len in
Ok (B (Nsec3, (ttl, rr)), names, off)
| Loc ->
let* loc, names, off = Loc.decode_exn names buf ~off ~len in
Ok (B (Loc, (ttl, Loc_set.singleton loc)), names, off)
| Null ->
let* null, names, off = Null.decode names buf ~off ~len in
Ok (B (Null, (ttl, Null_set.singleton null)), names, off)
| Unknown x ->
let data = Cstruct.sub buf off len in
Ok (B (Unknown x, (ttl, Txt_set.singleton (Cstruct.to_string data))), names, rdata_start + len)
end with
| Invalid_argument _ -> Error `Partial
in
let* () =
guard (len = rdata_end - rdata_start) (`Leftover (rdata_end, "rdata"))
in
Ok (b, names, rdata_end)
let text_b ?origin ?default_ttl name (B (key, v)) =
text ?origin ?default_ttl name key v
end
module Name_rr_map = struct
type t = Rr_map.t Domain_name.Map.t
let empty = Domain_name.Map.empty
let equal a b =
Domain_name.Map.equal (Rr_map.equal { f = Rr_map.equal_rr }) a b
let pp ppf map =
List.iter (fun (name, rr_map) ->
Fmt.(list ~sep:(any "@.") string) ppf
(List.map (Rr_map.text_b name) (Rr_map.bindings rr_map)))
(Domain_name.Map.bindings map)
let add name k v dmap =
let m = match Domain_name.Map.find name dmap with
| None -> Rr_map.empty
| Some map -> map
in
let m' = Rr_map.update k (Rr_map.combine_opt k v) m in
Domain_name.Map.add name m' dmap
let find : type a . [ `raw ] Domain_name.t -> a Rr_map.rr -> t -> a option =
fun name k dmap ->
match Domain_name.Map.find name dmap with
| None -> None
| Some rrmap -> Rr_map.find k rrmap
let remove_sub map sub =
Domain_name.Map.fold (fun name rrmap map ->
match Domain_name.Map.find name map with
| None -> map
| Some rrs ->
let rrs' = Rr_map.fold (fun (B (k, _)) map -> Rr_map.remove k map) rrmap rrs in
if Rr_map.is_empty rrs'
then Domain_name.Map.remove name map
else Domain_name.Map.add name rrs' map)
sub map
let singleton name k v =
Domain_name.Map.singleton name (Rr_map.singleton k v)
let union t t' =
Domain_name.Map.union (fun _ rr rr' ->
Some (Rr_map.union { f = Rr_map.unionee } rr rr'))
t t'
end
module Packet = struct
module Flag = struct
type t = [
| `Authoritative
| `Truncation
| `Recursion_desired
| `Recursion_available
| `Authentic_data
| `Checking_disabled
]
let all = [
`Authoritative ; `Truncation ; `Recursion_desired ;
`Recursion_available ; `Authentic_data ; `Checking_disabled
]
let compare a b = match a, b with
| `Authoritative, `Authoritative -> 0
| `Authoritative, _ -> 1 | _, `Authoritative -> -1
| `Truncation, `Truncation -> 0
| `Truncation, _ -> 1 | _, `Truncation -> -1
| `Recursion_desired, `Recursion_desired -> 0
| `Recursion_desired, _ -> 1 | _, `Recursion_desired -> -1
| `Recursion_available, `Recursion_available -> 0
| `Recursion_available, _ -> 1 | _, `Recursion_available -> -1
| `Authentic_data, `Authentic_data -> 0
| `Authentic_data, _ -> 1 | _, `Authentic_data -> -1
| `Checking_disabled, `Checking_disabled -> 0
let pp ppf = function
| `Authoritative -> Fmt.string ppf "authoritative"
| `Truncation -> Fmt.string ppf "truncation"
| `Recursion_desired -> Fmt.string ppf "recursion desired"
| `Recursion_available -> Fmt.string ppf "recursion available"
| `Authentic_data -> Fmt.string ppf "authentic data"
| `Checking_disabled -> Fmt.string ppf "checking disabled"
let pp_short ppf = function
| `Authoritative -> Fmt.string ppf "AA"
| `Truncation -> Fmt.string ppf "TC"
| `Recursion_desired -> Fmt.string ppf "RD"
| `Recursion_available -> Fmt.string ppf "RA"
| `Authentic_data -> Fmt.string ppf "AD"
| `Checking_disabled -> Fmt.string ppf "CD"
let bit = function
| `Authoritative -> 5
| `Truncation -> 6
| `Recursion_desired -> 7
| `Recursion_available -> 8
| `Authentic_data -> 10
| `Checking_disabled -> 11
let number f = 1 lsl (15 - bit f)
end
module Flags = Set.Make(Flag)
let decode_ntc names buf off =
let* name, names, off = Name.decode names buf ~off in
let* () = guard (Cstruct.length buf - off >= 4) `Partial in
let typ = Cstruct.BE.get_uint16 buf off
and cls = Cstruct.BE.get_uint16 buf (off + 2)
in
match typ with
| x when x = Edns.rtyp -> Ok ((name, `Edns, cls), names, off + 4)
| x when x = Tsig.rtyp -> Ok ((name, `Tsig, cls), names, off + 4)
| x when x = Rr_map.ixfr_rtyp -> Ok ((name, `Ixfr, cls), names, off + 4)
| x when x = Rr_map.axfr_rtyp -> Ok ((name, `Axfr, cls), names, off + 4)
| x when x = Rr_map.any_rtyp -> Ok ((name, `Any, cls), names, off + 4)
| x ->
let* k = Rr_map.of_int x in
Ok ((name, `K k, cls), names, off + 4)
module Question = struct
type qtype = [ `Any | `K of Rr_map.k ]
let pp_qtype = Rr_map.pp_rr
let compare_qtype a b = match a, b with
| `Any, `Any -> 0 | `Any, _ -> 1 | _, `Any -> -1
| `K k, `K k' -> Rr_map.comparek k k'
type t = [ `raw ] Domain_name.t * [ qtype | `Axfr | `Ixfr ]
let qtype (_, t) = match t with
| `K k -> Some (`K k)
| `Any -> Some `Any
| _ -> None
let create : type a b. b Domain_name.t -> a Rr_map.key -> t =
fun name k -> Domain_name.raw name, `K (K k)
let pp ppf (name, typ) =
Fmt.pf ppf "%a %a?" Domain_name.pp name Rr_map.pp_rr typ
let compare (name, typ) (name', typ') =
andThen (Domain_name.compare name name')
(match typ with
| #qtype as a ->
(match typ' with
| #qtype as b -> compare_qtype a b
| _ -> 1)
| (`Axfr | `Ixfr as x) ->
match typ' with
| #qtype -> -1
| (`Axfr | `Ixfr as y) -> match x, y with
| `Axfr, `Axfr -> 0 | `Axfr, _ -> 1 | _, `Axfr -> -1
| `Ixfr, `Ixfr -> 0 )
let decode ?(names = Name.Int_map.empty) ?(off = Header.len) buf =
let* (name, typ, c), names, off = decode_ntc names buf off in
let* clas = Class.of_int ~off c in
match typ with
| `Edns | `Tsig ->
let msg = Fmt.str "bad RRTYp in question %a" Rr_map.pp_rr typ in
Error (`Malformed (off, msg))
| (`Axfr | `Ixfr | `Any | `K _ as t) ->
if clas = Class.IN then
Ok ((name, t), names, off)
else
Error (`Not_implemented (off, Fmt.str "bad class in question 0x%x" c))
let encode names buf off (name, typ) =
Rr_map.encode_ntc names buf off
(name, (typ :> Rr_map.rrtyp), Class.to_int Class.IN)
end
let encode_data map names buf off =
Domain_name.Map.fold (fun name rrmap acc ->
Rr_map.fold (fun (Rr_map.B (k, v)) ((names, off), count) ->
let r, amount = Rr_map.encode name k v names buf off in
(r, amount + count))
rrmap acc)
map ((names, off), 0)
let decode_rr names buf off =
let* (name, typ, clas), names, off = decode_ntc names buf off in
let* () =
guard (clas = Class.(to_int IN))
(`Not_implemented (off, Fmt.str "rr class not IN 0x%x" clas))
in
match typ with
| `K k ->
let* b, names, off = Rr_map.decode names buf off k in
Ok (name, b, names, off)
| _ ->
Error (`Not_implemented (off, Fmt.str "unexpected RR typ %a"
Rr_map.pp_rr typ))
let rec decode_n_aux add f names buf off acc = function
| 0 -> acc, Ok (names, off)
| n -> match f names buf off with
| Ok (name, b, names, off') ->
let acc' = add name b acc in
decode_n_aux add f names buf off' acc' (pred n)
| Error e -> acc, Error e
let decode_n add f names buf off acc c =
let acc, r = decode_n_aux add f names buf off acc c in
match r with
| Ok (names, off) -> Ok (names, off, acc)
| Error e -> Error e
let decode_n_partial names buf off acc c =
let add name (Rr_map.B (k, v)) map = Name_rr_map.add name k v map in
let acc, r = decode_n_aux add decode_rr names buf off acc c in
match r with
| Ok (names, off) -> Ok (`Full (names, off, acc))
| Error `Partial -> Ok (`Partial acc)
| Error e -> Error e
let decode_one_additional map edns ~tsig names buf off =
let* (name, typ, clas), names, off' = decode_ntc names buf off in
match typ with
| `Edns when edns = None ->
begin try
let* edns, off' = Edns.decode_exn buf ~off in
Ok ((map, Some edns, None), names, off')
with Invalid_argument _ -> Error `Partial
end
| `Tsig when tsig ->
let* () =
guard (clas = Class.(to_int ANY_CLASS))
(`Malformed (off, Fmt.str "tsig class must be ANY 0x%x" clas))
in
begin try
let* tsig, names, off' = Tsig.decode_exn names buf ~off:off' in
Ok ((map, edns, Some (name, tsig, off)), names, off')
with Invalid_argument _ -> Error `Partial
end
| `K t ->
let* () =
guard (clas = Class.(to_int IN))
(`Malformed (off, Fmt.str "additional class must be IN 0x%x" clas))
in
let* B (k, v), names, off' = Rr_map.decode names buf off' t in
Ok ((Name_rr_map.add name k v map, edns, None), names, off')
| _ -> Error (`Malformed (off, Fmt.str "decode additional, unexpected rr %a"
Rr_map.pp_rr typ))
let rec decode_n_additional names buf off map edns tsig = function
| 0 -> Ok (`Full (off, map, edns, tsig))
| n -> match decode_one_additional map edns ~tsig:(n = 1) names buf off with
| Error `Partial -> Ok (`Partial (map, edns, tsig))
| Error e -> Error e
| Ok ((map, edns, tsig), names, off') ->
decode_n_additional names buf off' map edns tsig (pred n)
module Answer = struct
type t = Name_rr_map.t * Name_rr_map.t
let empty = Name_rr_map.empty, Name_rr_map.empty
let is_empty (a, b) =
Domain_name.Map.is_empty a && Domain_name.Map.is_empty b
let equal (answer, authority) (answer', authority') =
Name_rr_map.equal answer answer' &&
Name_rr_map.equal authority authority'
let pp ppf (answer, authority) =
Fmt.pf ppf "answer %a@ authority %a"
Name_rr_map.pp answer Name_rr_map.pp authority
let decode (_, flags) buf names off =
let truncated = Flags.mem `Truncation flags in
let ancount = Cstruct.BE.get_uint16 buf 6
and aucount = Cstruct.BE.get_uint16 buf 8
in
let empty = Domain_name.Map.empty in
let* r = decode_n_partial names buf off empty ancount in
match r with
| `Partial answer ->
let* () = guard truncated `Partial in
Ok ((answer, empty), names, off, false, truncated)
| `Full (names, off, answer) ->
let* r = decode_n_partial names buf off empty aucount in
match r with
| `Partial authority ->
let* () = guard truncated `Partial in
Ok ((answer, authority), names, off, false, truncated)
| `Full (names, off, authority) ->
Ok ((answer, authority), names, off, true, truncated)
let encode_answer (qname, qtyp) map names buf off =
Log.debug (fun m -> m "trying to encode the answer, following question %a %a"
Question.pp (qname, qtyp) Name_rr_map.pp map) ;
let rec encode_one names off count name =
match Domain_name.Map.find name map with
| None -> (names, off), count
| Some rrmap ->
let (names, off), count, alias =
Rr_map.fold (fun (Rr_map.B (k, v)) ((names, off), count, alias) ->
let alias' = match k, v with
| Cname, (_, alias) -> Some (Domain_name.raw alias)
| _ -> alias
in
let r, amount = Rr_map.encode name k v names buf off in
(r, amount + count, alias'))
rrmap ((names, off), count, None)
in
match alias with
| None -> (names, off), count
| Some n -> encode_one names off count n
in
encode_one names off 0 qname
let encode names buf off question (answer, authority) =
let (names, off), ancount = encode_answer question answer names buf off in
Cstruct.BE.set_uint16 buf 6 ancount ;
let (names, off), aucount = encode_data authority names buf off in
Cstruct.BE.set_uint16 buf 8 aucount ;
names, off
end
module Axfr = struct
type t = Soa.t * Name_rr_map.t
let equal (soa, entries) (soa', entries') =
Soa.compare soa soa' = 0 && Name_rr_map.equal entries entries'
let pp ppf (soa, entries) =
Fmt.pf ppf "AXFR soa %a data %a" Soa.pp soa Name_rr_map.pp entries
let decode (_, flags) buf names off ancount =
let* () = guard (not (Flags.mem `Truncation flags)) `Partial in
let empty = Domain_name.Map.empty in
let* () =
guard (ancount >= 1)
(`Malformed (6, Fmt.str "AXFR needs at least one RRs in answer %d" ancount))
in
let* name, B (k, v), names, off = decode_rr names buf off in
if ancount = 1 then
match k, v with
| Soa, soa -> Ok (`Axfr_partial_reply (`First (soa : Soa.t), Name_rr_map.empty), names, off)
| k, v -> Ok (`Axfr_partial_reply (`Mid, Name_rr_map.singleton name k v), names, off)
else
let add name (Rr_map.B (k, v)) map = Name_rr_map.add name k v map in
let* names, off, answer = decode_n add decode_rr names buf off empty (ancount - 2) in
let* name', B (k', v'), names, off = decode_rr names buf off in
match k, v, k', v' with
| Soa, soa, Soa, soa' ->
let* () =
guard (Domain_name.equal name name')
(`Malformed (off, "AXFR SOA RRs do not use the same name"))
in
let* () =
guard (Soa.compare soa soa' = 0)
(`Malformed (off, "AXFR SOA RRs are not equal"))
in
Ok ((`Axfr_reply ((soa, answer) : Soa.t * Name_rr_map.t)), names, off)
| Soa, soa, k', v' ->
Ok (`Axfr_partial_reply (`First (soa : Soa.t), add name' (B (k', v')) answer), names, off)
| k, v, Soa, soa ->
Ok (`Axfr_partial_reply (`Last (soa : Soa.t), add name (B (k, v)) answer), names, off)
| k, v, k', v' ->
Ok (`Axfr_partial_reply (`Mid, add name' (B (k', v')) (add name (B (k, v)) answer)), names, off)
let encode names buf off question (soa, entries) =
let (names, off), _ = Rr_map.encode (fst question) Soa soa names buf off in
let (names, off), count = encode_data entries names buf off in
let (names, off), _ = Rr_map.encode (fst question) Soa soa names buf off in
Cstruct.BE.set_uint16 buf 6 (count + 2) ;
names, off
let encode_partial names buf off question pos entries =
let (names, off), count = match pos with
| `First soa -> Rr_map.encode (fst question) Soa soa names buf off
| _ -> (names, off), 0
in
let (names, off), count' = encode_data entries names buf off in
let (names, off), count'' = match pos with
| `Last soa -> Rr_map.encode (fst question) Soa soa names buf off
| _ -> (names, off), 0
in
Cstruct.BE.set_uint16 buf 6 (count + count' + count'') ;
names, off
let encode_reply next_buffer max_size question (soa, entries) =
let finish buf count off =
Cstruct.BE.set_uint16 buf 6 count;
Cstruct.sub buf 0 off
in
let names, buf, off = next_buffer () in
let (names, off), count =
Rr_map.encode (fst question) Soa soa names buf off
in
let rec encode_or_allocate acc count (names, buf, off) name k v =
try
let (names, off'), count' = Rr_map.encode name k v names buf off in
if off' > max_size then
invalid_arg "foo"
else
acc, count + count', (names, buf, off')
with
| Invalid_argument _ ->
if count = 0 then
match Rr_map.split k v with
| _, None -> invalid_arg "unable to split resource record"
| v, Some v' ->
let acc, count, (_, buf, off) =
encode_or_allocate acc 0 (names, buf, off) name k v
in
let buf' = finish buf count off in
encode_or_allocate (buf' :: acc) 0 (next_buffer ()) name k v'
else
let buf' = finish buf count off in
encode_or_allocate (buf' :: acc) 0 (next_buffer ()) name k v
in
let r, count, (names, buf, off) =
Domain_name.Map.fold (fun name rrmap acc ->
Rr_map.fold (fun (Rr_map.B (k, v)) (bufs, count, r) ->
encode_or_allocate bufs count r name k v)
rrmap acc)
entries ([], count, (names, buf, off))
in
let r, count, (_names, buf, off) =
encode_or_allocate r count (names, buf, off) (fst question) Soa soa
in
let buf' = finish buf count off in
List.rev (buf' :: r)
end
module Ixfr = struct
type t = Soa.t *
[ `Empty
| `Full of Name_rr_map.t
| `Difference of Soa.t * Name_rr_map.t * Name_rr_map.t ]
let equal (soa, data) (soa', data') =
Soa.compare soa soa' = 0 && match data, data' with
| `Empty, `Empty -> true
| `Full rrs, `Full rrs' -> Name_rr_map.equal rrs rrs'
| `Difference (oldsoa, del, add), `Difference (oldsoa', del', add') ->
Soa.compare oldsoa oldsoa' = 0 && Name_rr_map.equal del del' && Name_rr_map.equal add add'
| _ -> false
let pp ppf (soa, data) =
match data with
| `Empty -> Fmt.pf ppf "IXFR %a empty" Soa.pp soa
| `Full data ->
Fmt.pf ppf "IXFR %a full@ %a" Soa.pp soa Name_rr_map.pp data
| `Difference (oldsoa, del, add) ->
Fmt.pf ppf "IXFR %a difference oldsoa %a@ delete %a@ add %a"
Soa.pp soa Soa.pp oldsoa Name_rr_map.pp del Name_rr_map.pp add
let ensure_soa : Rr_map.b -> (Soa.t, unit) result = fun (Rr_map.B (k, v)) ->
match k, v with
| Soa, soa -> Ok soa
| _ -> Error ()
let soa_ok f off name soa name' soa' =
let* () =
guard (Domain_name.equal name name')
(`Malformed (off, "IXFR SOA RRs do not use the same name"))
in
guard (f soa soa') (`Malformed (off, "IXFR SOA RRs are not equal"))
let rec rrs_and_soa buf names off count acc =
match count with
| 0 -> Ok (acc, None, 0, names, off)
| n ->
let* name, Rr_map.B (k, v), names, off = decode_rr names buf off in
match k, v with
| Rr_map.Soa, soa ->
Ok (acc, (Some (name, soa) : ([ `raw ] Domain_name.t * Soa.t) option), pred n, names, off)
| _ ->
let acc = Name_rr_map.add name k v acc in
rrs_and_soa buf names off (pred n) acc
let decode (_, flags) buf names off ancount =
let* () = guard (not (Flags.mem `Truncation flags)) `Partial in
let* () =
guard (ancount >= 1)
(`Malformed (6, Fmt.str "IXFR needs at least one RRs in answer %d" ancount))
in
let* name, b, names, off = decode_rr names buf off in
match ensure_soa b with
| Error () -> Error (`Malformed (off, "IXFR first RR not a SOA"))
| Ok soa ->
let* content, names, off =
if ancount = 1 then
Ok (`Empty, names, off)
else if ancount = 2 then
Ok (`Full Name_rr_map.empty, names, off)
else
let* name', b, names, off = decode_rr names buf off in
match ensure_soa b with
| Error () ->
let add name (Rr_map.B (k, v)) map = Name_rr_map.add name k v map in
let map = add name' b Name_rr_map.empty in
let* names, off, answer = decode_n add decode_rr names buf off map (ancount - 3) in
Ok (`Full answer, names, off)
| Ok oldsoa ->
let rec diff_list dele add names off count oldname oldsoa =
let* () = soa_ok (fun old soa -> Soa.newer ~old soa) off oldname oldsoa name soa in
let* dele', soa', count', names, off = rrs_and_soa buf names off count dele in
match soa' with
| None ->
let* () = guard (count' = 0) (`Malformed (off, "IXFR expected SOA, found end")) in
Ok (dele', add, names, off)
| Some (name', soa') ->
let* () = soa_ok (fun old soa -> Soa.newer ~old soa) off oldname oldsoa name' soa' in
let* add', soa'', count'', names, off = rrs_and_soa buf names off count' add in
match soa'' with
| None ->
let* () = guard (count'' = 0) (`Malformed (off, "IXFR expected SOA after adds, found end")) in
Ok (dele', add', names, off)
| Some (name'', soa'') ->
diff_list dele' add' names off count'' name'' soa''
in
let* dele, add, names, off = diff_list Name_rr_map.empty Name_rr_map.empty names off (ancount - 3) name' oldsoa in
Ok (`Difference (oldsoa, dele, add), names, off)
in
if ancount > 1 then
let* name', b, names, off = decode_rr names buf off in
match ensure_soa b with
| Ok soa' ->
let* () = soa_ok (fun s s' -> Soa.compare s s' = 0) off name soa name' soa' in
Ok ((soa, content), names, off)
| Error () ->
Error (`Malformed (off, "IXFR last RR not a SOA"))
else
Ok ((soa, content), names, off)
let encode names buf off question (soa, data) =
let (names, off), _ = Rr_map.encode (fst question) Soa soa names buf off in
let ((names, off), count), second = match data with
| `Empty -> ((names, off), 0), false
| `Full data -> encode_data data names buf off, true
| `Difference (oldsoa, del, add) ->
let (names, off), _ = Rr_map.encode (fst question) Soa oldsoa names buf off in
let (names, off), count = encode_data del names buf off in
let (names, off), _ = Rr_map.encode (fst question) Soa soa names buf off in
let (names, off), count' = encode_data add names buf off in
((names, off), count + count' + 2), true
in
let (names, off), count' =
if second then
Rr_map.encode (fst question) Soa soa names buf off
else
(names, off), 0
in
Cstruct.BE.set_uint16 buf 6 (count + count' + 1) ;
names, off
end
module Update = struct
type prereq =
| Exists of Rr_map.k
| Exists_data of Rr_map.b
| Not_exists of Rr_map.k
| Name_inuse
| Not_name_inuse
let equal_prereq a b = match a, b with
| Exists t, Exists t' -> Rr_map.comparek t t' = 0
| Exists_data b, Exists_data b' -> Rr_map.equalb b b'
| Not_exists t, Not_exists t' -> Rr_map.comparek t t' = 0
| Name_inuse, Name_inuse -> true
| Not_name_inuse, Not_name_inuse -> true
| _ -> false
let pp_prereq ppf = function
| Exists typ -> Fmt.pf ppf "exists? %a" Rr_map.ppk typ
| Exists_data rd -> Fmt.pf ppf "exists data? %a" Rr_map.pp_b rd
| Not_exists typ -> Fmt.pf ppf "doesn't exists? %a" Rr_map.ppk typ
| Name_inuse -> Fmt.string ppf "name inuse?"
| Not_name_inuse -> Fmt.string ppf "name not inuse?"
let decode_prereq names buf off =
let* (name, typ, cls), names, off = decode_ntc names buf off in
let off' = off + 6 in
let* () = guard (Cstruct.length buf >= off') `Partial in
let ttl = Cstruct.BE.get_uint32 buf off in
let* () = guard (ttl = 0l) (`Malformed (off, Fmt.str "prereq TTL not zero %lu" ttl)) in
let rlen = Cstruct.BE.get_uint16 buf (off + 4) in
let r0 = guard (rlen = 0) (`Malformed (off + 4, Fmt.str "prereq rdlength must be zero %d" rlen)) in
let* c = Class.of_int cls in
match c, typ with
| ANY_CLASS, `Any ->
let* () = r0 in
Ok (name, Name_inuse, names, off')
| NONE, `Any ->
let* () = r0 in
Ok (name, Not_name_inuse, names, off')
| ANY_CLASS, `K k ->
let* () = r0 in
Ok (name, Exists k, names, off')
| NONE, `K k ->
let* () = r0 in
Ok (name, Not_exists k, names, off')
| IN, `K k->
let* rdata, names, off'' = Rr_map.decode names buf off k in
Ok (name, Exists_data rdata, names, off'')
| _ -> Error (`Malformed (off, Fmt.str "prereq bad class 0x%x or typ %a"
cls Rr_map.pp_rr typ))
let encode_prereq names buf off count name = function
| Exists typ ->
let names, off =
Rr_map.encode_ntc names buf off (name, `K typ, Class.(to_int ANY_CLASS))
in
(names, off + 6), succ count
| Exists_data (B (k, v)) ->
let ret, count' = Rr_map.encode name k v names buf off in
ret, count' + count
| Not_exists typ ->
let names, off =
Rr_map.encode_ntc names buf off (name, `K typ, Class.(to_int NONE))
in
(names, off + 6), succ count
| Name_inuse ->
let names, off =
Rr_map.encode_ntc names buf off (name, `Any, Class.(to_int ANY_CLASS))
in
(names, off + 6), succ count
| Not_name_inuse ->
let names, off =
Rr_map.encode_ntc names buf off (name, `Any, Class.(to_int NONE))
in
(names, off + 6), succ count
type update =
| Remove of Rr_map.k
| Remove_all
| Remove_single of Rr_map.b
| Add of Rr_map.b
let equal_update a b = match a, b with
| Remove t, Remove t' -> Rr_map.comparek t t' = 0
| Remove_all, Remove_all -> true
| Remove_single b, Remove_single b' -> Rr_map.equalb b b'
| Add b, Add b' -> Rr_map.equalb b b'
| _ -> false
let pp_update ppf = function
| Remove typ -> Fmt.pf ppf "remove! %a" Rr_map.ppk typ
| Remove_all -> Fmt.string ppf "remove all!"
| Remove_single rd -> Fmt.pf ppf "remove single! %a" Rr_map.pp_b rd
| Add rr -> Fmt.pf ppf "add! %a" Rr_map.pp_b rr
let decode_update names buf off =
let* (name, typ, cls), names, off = decode_ntc names buf off in
let off' = off + 6 in
let* () = guard (Cstruct.length buf >= off') `Partial in
let ttl = Cstruct.BE.get_uint32 buf off in
let rlen = Cstruct.BE.get_uint16 buf (off + 4) in
let r0 = guard (rlen = 0) (`Malformed (off + 4, Fmt.str "update rdlength must be zero %d" rlen)) in
let ttl0 = guard (ttl = 0l) (`Malformed (off, Fmt.str "update ttl must be zero %lu" ttl)) in
let* c = Class.of_int cls in
match c, typ with
| ANY_CLASS, `Any ->
let* () = ttl0 in
let* () = r0 in
Ok (name, Remove_all, names, off')
| ANY_CLASS, `K k ->
let* () = ttl0 in
let* () = r0 in
Ok (name, Remove k, names, off')
| NONE, `K k ->
let* () = ttl0 in
let* rdata, names, off = Rr_map.decode names buf off k in
Ok (name, Remove_single rdata, names, off)
| IN, `K k ->
let* rdata, names, off = Rr_map.decode names buf off k in
Ok (name, Add rdata, names, off)
| _ -> Error (`Malformed (off, Fmt.str "bad update class 0x%x" cls))
let encode_update names buf off count name = function
| Remove typ ->
let names, off =
Rr_map.encode_ntc names buf off (name, `K typ, Class.(to_int ANY_CLASS))
in
(names, off + 6), succ count
| Remove_all ->
let names, off =
Rr_map.encode_ntc names buf off (name, `Any, Class.(to_int ANY_CLASS))
in
(names, off + 6), succ count
| Remove_single (B (k, v)) ->
let ret, count' = Rr_map.encode ~clas:NONE name k v names buf off in
ret, count + count'
| Add (B (k, v)) ->
let ret, count' = Rr_map.encode name k v names buf off in
ret, count + count'
type t = prereq list Domain_name.Map.t * update list Domain_name.Map.t
let empty = Domain_name.Map.empty, Domain_name.Map.empty
let equal (prereq, update) (prereq', update') =
let eq_list f a b =
List.length a = List.length b &&
List.fold_left2 (fun acc a b -> acc && f a b) true a b
in
Domain_name.Map.equal (eq_list equal_prereq) prereq prereq' &&
Domain_name.Map.equal (eq_list equal_update) update update'
let pp ppf (prereq, update) =
Fmt.pf ppf "%a@ %a"
Fmt.(list ~sep:(any ";@ ")
(pair ~sep:(any ":") Domain_name.pp
(list ~sep:(any ", ") pp_prereq)))
(Domain_name.Map.bindings prereq)
Fmt.(list ~sep:(any ";@ ")
(pair ~sep:(any ":") Domain_name.pp
(list ~sep:(any ", ") pp_update)))
(Domain_name.Map.bindings update)
let decode question buf names off =
let prcount = Cstruct.BE.get_uint16 buf 6
and upcount = Cstruct.BE.get_uint16 buf 8
in
let add_to_list name a map =
let base = match Domain_name.Map.find name map with None -> [] | Some x -> x in
Domain_name.Map.add name (base @ [a]) map
in
let* () =
guard (snd question = `K Rr_map.(K Soa))
(`Malformed (off, Fmt.str "update question not SOA %a" Rr_map.pp_rr (snd question)))
in
let* names, off, prereq =
decode_n add_to_list decode_prereq names buf off Domain_name.Map.empty prcount
in
let* names, off, update =
decode_n add_to_list decode_update names buf off Domain_name.Map.empty upcount
in
Ok ((prereq, update), names, off)
let encode_map map f names buf off =
Domain_name.Map.fold (fun name v ((names, off), count) ->
List.fold_left (fun ((names, off), count) p ->
f names buf off count name p) ((names, off), count) v)
map ((names, off), 0)
let encode names buf off _question (prereq, update) =
let (names, off), prereq_count = encode_map prereq encode_prereq names buf off in
Cstruct.BE.set_uint16 buf 6 prereq_count ;
let (names, off), update_count = encode_map update encode_update names buf off in
Cstruct.BE.set_uint16 buf 8 update_count ;
names, off
end
type request = [
| `Query
| `Notify of Soa.t option
| `Axfr_request
| `Ixfr_request of Soa.t
| `Update of Update.t
]
let equal_request a b = match a, b with
| `Query, `Query -> true
| `Notify soa, `Notify soa' -> opt_eq (fun a b -> Soa.compare a b = 0) soa soa'
| `Axfr_request, `Axfr_request -> true
| `Ixfr_request soa, `Ixfr_request soa' -> Soa.compare soa soa' = 0
| `Update u, `Update u' -> Update.equal u u'
| _ -> false
let pp_request ppf = function
| `Query -> Fmt.string ppf "query"
| `Notify soa -> Fmt.pf ppf "notify %a" Fmt.(option ~none:(any "no") Soa.pp) soa
| `Axfr_request -> Fmt.string ppf "axfr request"
| `Ixfr_request soa -> Fmt.pf ppf "ixfr request %a" Soa.pp soa
| `Update u -> Fmt.pf ppf "update %a" Update.pp u
type reply = [
| `Answer of Answer.t
| `Notify_ack
| `Axfr_reply of Axfr.t
| `Axfr_partial_reply of [ `First of Soa.t | `Mid | `Last of Soa.t ] * Name_rr_map.t
| `Ixfr_reply of Ixfr.t
| `Update_ack
| `Rcode_error of Rcode.t * Opcode.t * Answer.t option
]
let equal_reply a b = match a, b with
| `Answer q, `Answer q' -> Answer.equal q q'
| `Notify_ack, `Notify_ack -> true
| `Axfr_reply a, `Axfr_reply b -> Axfr.equal a b
| `Axfr_partial_reply (x, a), `Axfr_partial_reply (y, b) ->
(match x, y with
| `First soa, `First soa' -> Soa.compare soa soa' = 0
| `Mid, `Mid -> true
| `Last soa, `Last soa' -> Soa.compare soa soa' = 0
| _ -> false) &&
Name_rr_map.equal a b
| `Ixfr_reply a, `Ixfr_reply b -> Ixfr.equal a b
| `Update_ack, `Update_ack -> true
| `Rcode_error (rc, op, q), `Rcode_error (rc', op', q') ->
Rcode.compare rc rc' = 0 && Opcode.compare op op' = 0 && opt_eq Answer.equal q q'
| _ -> false
let pp_reply ppf = function
| `Answer a -> Answer.pp ppf a
| `Axfr_reply a -> Axfr.pp ppf a
| `Axfr_partial_reply (x, a) ->
let pp_pos ppf = function
| `First soa -> Fmt.pf ppf "first %a" Soa.pp soa
| `Mid -> Fmt.string ppf "middle"
| `Last soa -> Fmt.pf ppf "last %a" Soa.pp soa
in
Fmt.pf ppf "AXFR (partial %a) %a" pp_pos x Name_rr_map.pp a
| `Ixfr_reply a -> Ixfr.pp ppf a
| `Notify_ack -> Fmt.string ppf "notify ack"
| `Update_ack -> Fmt.string ppf "update ack"
| `Rcode_error (rc, op, q) ->
Fmt.pf ppf "rcode %a op %a q %a" Rcode.pp rc Opcode.pp op
Fmt.(option ~none:(any "no data") Answer.pp) q
type data = [ request | reply ]
let opcode_data = function
| `Query | `Answer _
| `Axfr_request | `Axfr_reply _ | `Axfr_partial_reply _
| `Ixfr_request _ | `Ixfr_reply _ -> Opcode.Query
| `Notify _ | `Notify_ack -> Notify
| `Update _ | `Update_ack -> Update
| `Rcode_error (_, op, _) -> op
let rcode_data = function
| `Rcode_error (rc, _, _) -> rc
| _ -> Rcode.NoError
let with_rcode data rcode = match rcode, data with
| Rcode.NoError, `Rcode_error (rc, _, _) -> Error (`Rcode_error_cant_noerror rc)
| Rcode.NoError, x -> Ok x
| _, `Rcode_error (_, op, data) -> Ok (`Rcode_error (rcode, op, data))
| _ -> Error (`Rcode_cant_change rcode)
let equal_data a b =
match a with
| #reply as replya ->
begin match b with
| #reply as replyb -> equal_reply replya replyb
| #request -> false
end
| #request as reqa ->
match b with
| #request as reqb -> equal_request reqa reqb
| #reply -> false
let pp_data ppf = function
| #request as r -> pp_request ppf r
| #reply as r -> pp_reply ppf r
type t = {
header : Header.t ;
question : Question.t ;
data : data ;
additional : Name_rr_map.t ;
edns : Edns.t option ;
tsig : ([ `raw ] Domain_name.t * Tsig.t * int) option ;
}
let pp_tsig ppf (name, tsig, off) =
Fmt.pf ppf "tsig %a %a %d" Domain_name.pp name Tsig.pp tsig off
let eq_tsig (name, tsig, off) (name', tsig', off') =
Domain_name.equal name name' && Tsig.equal tsig tsig' && off = off'
let create ?max_size:_ ?(additional = Name_rr_map.empty) ?edns ?tsig question data =
{ header ; question ; data ; additional ; edns ; tsig }
let with_edns t edns = { t with edns }
let ppf t =
let opcode = opcode_data t.data
and query = match t.data with #request -> true | #reply -> false
and rcode = rcode_data t.data
in
Header.pp ppf (t.header, query, opcode, rcode)
let pp ppf t =
Fmt.pf ppf "header %a@ question %a@ data %a@ additional %a@ EDNS %a TSIG %a"
pp_header t
Question.pp t.question
pp_data t.data
Name_rr_map.pp t.additional
Fmt.(option ~none:(any "no") Edns.pp) t.edns
Fmt.(option ~none:(any "no") pp_tsig) t.tsig
let equal a b =
Header.compare a.header b.header = 0 &&
Question.compare a.question b.question = 0 &&
Name_rr_map.equal a.additional b.additional &&
opt_eq (fun a b -> Edns.compare a b = 0) a.edns b.edns &&
opt_eq eq_tsig a.tsig b.tsig &&
equal_data a.data b.data
type err = [
| `Bad_edns_version of int
| `Leftover of int * string
| `Malformed of int * string
| `Not_implemented of int * string
| `Notify_ack_answer_count of int
| `Notify_ack_authority_count of int
| `Notify_answer_count of int
| `Notify_authority_count of int
| `Partial
| `Query_answer_count of int
| `Query_authority_count of int
| `Rcode_cant_change of Rcode.t
| `Rcode_error_cant_noerror of Rcode.t
| `Request_rcode of Rcode.t
| `Truncated_request
| `Update_ack_answer_count of int
| `Update_ack_authority_count of int
]
let pp_err ppf = function
| `Bad_edns_version version -> Fmt.pf ppf "bad edns version %d" version
| `Leftover (off, n) -> Fmt.pf ppf "leftover %s at %d" n off
| `Malformed (off, n) -> Fmt.pf ppf "malformed at %d: %s" off n
| `Not_implemented (off, msg) -> Fmt.pf ppf "not implemented at %d: %s" off msg
| `Notify_ack_answer_count an -> Fmt.pf ppf "notify ack answer count is %d" an
| `Notify_ack_authority_count au -> Fmt.pf ppf "notify ack authority count is %d" au
| `Notify_answer_count an -> Fmt.pf ppf "notify answer count is %d" an
| `Notify_authority_count au -> Fmt.pf ppf "notify authority count is %d" au
| `Partial -> Fmt.string ppf "partial"
| `Query_answer_count an -> Fmt.pf ppf "query answer count is %d" an
| `Query_authority_count au -> Fmt.pf ppf "query authority count is %d" au
| `Rcode_cant_change rc -> Fmt.pf ppf "edns tried to change rcode from noerror to %a" Rcode.pp rc
| `Rcode_error_cant_noerror rc -> Fmt.pf ppf "edns tried to change rcode from %a to noerror" Rcode.pp rc
| `Request_rcode rc -> Fmt.pf ppf "query with rcode %a (must be noerr)" Rcode.pp rc
| `Truncated_request -> Fmt.string ppf "truncated request"
| `Update_ack_answer_count an -> Fmt.pf ppf "update ack answer count is %d" an
| `Update_ack_authority_count au -> Fmt.pf ppf "update ack authority count is %d" au
let decode_additional names buf off allow_trunc adcount =
let* r = decode_n_additional names buf off Domain_name.Map.empty None None adcount in
match r with
| `Partial (additional, edns, tsig) ->
Log.warn (fun m -> m "truncated packet (allowed? %B)" allow_trunc) ;
let* () = guard allow_trunc `Partial in
Ok (additional, edns, tsig)
| `Full (off, additional, edns, tsig) ->
(if Cstruct.length buf > off then
let n = Cstruct.length buf - off in
Log.warn (fun m -> m "received %d extra bytes %a"
n Cstruct.hexdump_pp (Cstruct.sub buf off n))) ;
Ok (additional, edns, tsig)
let ext_rcode ?off rcode = function
| Some e when e.Edns.extended_rcode > 0 ->
begin
let rcode' =
Rcode.to_int rcode + e.extended_rcode lsl 4
in
Rcode.of_int ?off rcode'
end
| _ -> Ok rcode
let decode buf =
let* , query, operation, rcode = Header.decode buf in
let q_count = Cstruct.BE.get_uint16 buf 4
and an_count = Cstruct.BE.get_uint16 buf 6
and au_count = Cstruct.BE.get_uint16 buf 8
and ad_count = Cstruct.BE.get_uint16 buf 10
in
let* () = guard (q_count = 1) (`Malformed (4, "question count not one")) in
let* question, names, off = Question.decode buf in
let* data, names, off, cont, allow_trunc =
if query then begin
let* () = guard (rcode = Rcode.NoError) (`Request_rcode rcode) in
let* () = guard (not (Flags.mem `Truncation (snd header))) `Truncated_request in
let* request, names, off =
match operation with
| Opcode.Query ->
let* () = guard (an_count = 0) (`Query_answer_count an_count) in
begin match snd question with
| `Axfr ->
let* () = guard (au_count = 0) (`Query_authority_count au_count) in
Ok (`Axfr_request, names, off)
| `Ixfr ->
let* () = guard (au_count = 1) (`Query_authority_count au_count) in
let* (_, au), names, off, _, _ = Answer.decode header buf names off in
begin match Name_rr_map.find (fst question) Rr_map.Soa au with
| None -> Error (`Malformed (off, "ixfr request without soa"))
| Some soa -> Ok (`Ixfr_request soa, names, off)
end
| _ ->
let* () = guard (au_count = 0) (`Query_authority_count au_count) in
Ok (`Query, names, off)
end
| Opcode.Notify ->
let* () = guard (an_count = 0 || an_count = 1) (`Notify_answer_count an_count) in
let* () = guard (au_count = 0) (`Notify_authority_count au_count) in
let* (ans, _), names, off, _, _ = Answer.decode header buf names off in
let soa = Name_rr_map.find (fst question) Rr_map.Soa ans in
Ok (`Notify soa, names, off)
| Opcode.Update ->
let* update, names, off = Update.decode header question buf names off in
Ok (`Update update, names, off)
| x -> Error (`Not_implemented (2, Fmt.str "unsupported opcode %a" Opcode.pp x))
in
Ok (request, names, off, true, false)
end else
match rcode with
| Rcode.NoError -> begin match operation with
| Opcode.Query -> begin match snd question with
| `Axfr ->
let* () = guard (au_count = 0) (`Malformed (8, Fmt.str "AXFR with aucount %d > 0" au_count)) in
let* axfr, names, off = Axfr.decode header buf names off an_count in
Ok (axfr, names, off, true, false)
| `Ixfr ->
let* () = guard (au_count = 0) (`Malformed (8, Fmt.str "IXFR with aucount %d > 0" au_count)) in
let* ixfr, names, off = Ixfr.decode header buf names off an_count in
Ok (`Ixfr_reply ixfr, names, off, true, false)
| _ ->
let* answer, names, off, cont, allow_trunc = Answer.decode header buf names off in
Ok (`Answer answer, names, off, cont, allow_trunc)
end
| Opcode.Notify ->
let* () = guard (an_count = 0) (`Notify_ack_answer_count an_count) in
let* () = guard (au_count = 0) (`Notify_ack_authority_count au_count) in
Ok (`Notify_ack, names, off, true, false)
| Opcode.Update ->
let* () = guard (an_count = 0) (`Update_ack_answer_count an_count) in
let* () = guard (au_count = 0) (`Update_ack_authority_count au_count) in
Ok (`Update_ack, names, off, true, false)
| x -> Error (`Not_implemented (2, Fmt.str "unsupported opcode %a"
Opcode.pp x))
end
| x ->
let* query, names, off, cont, allow_trunc = Answer.decode header buf names off in
let query = if Answer.is_empty query then None else Some query in
Ok (`Rcode_error (x, operation, query), names, off, cont, allow_trunc)
in
let* additional, edns, tsig =
if cont then
decode_additional names buf off allow_trunc ad_count
else
Ok (Name_rr_map.empty, None, None)
in
let* data =
let* d = ext_rcode ~off:off rcode edns in
with_rcode data d
in
Ok { header ; question ; data ; additional ; edns ; tsig }
let opcode_match request reply =
let opa = opcode_data request
and opb = opcode_data reply
in
Opcode.compare opa opb = 0
type mismatch = [ `Not_a_reply of request
| `Id_mismatch of int * int
| `Operation_mismatch of request * reply
| `Question_mismatch of Question.t * Question.t
| `Expected_request ]
let pp_mismatch ppf = function
| `Not_a_reply req ->
Fmt.pf ppf "expected a reply, got a request %a" pp_request req
| `Id_mismatch (id, id') ->
Fmt.pf ppf "id mismatch, expected %04X got %04X" id id'
| `Operation_mismatch (req, reply) ->
Fmt.pf ppf "operation mismatch, request %a reply %a" pp_request req pp_reply reply
| `Question_mismatch (q, q') ->
Fmt.pf ppf "question mismatch, expected %a got %a" Question.pp q Question.pp q'
| `Expected_request -> Fmt.string ppf "expected request"
let reply_matches_request ~request reply =
match request.data with
| #reply -> Error `Expected_request
| #request as req -> match reply.data with
| #request as r -> Error (`Not_a_reply r)
| #reply as data ->
match
Header.compare_id request.header reply.header = 0,
opcode_match req data,
Question.compare request.question reply.question = 0
with
| true, true, true ->
if not (Domain_name.equal ~case_sensitive:true (fst request.question) (fst reply.question)) then
Log.warn (fun m -> m "question is not case sensitive equal %a = %a"
Domain_name.pp (fst request.question) Domain_name.pp (fst reply.question));
Ok data
| false, _ ,_ -> Error (`Id_mismatch (fst request.header, fst reply.header))
| _, false, _ -> Error (`Operation_mismatch (req, data))
| _, _, false -> Error (`Question_mismatch (request.question, reply.question))
let max_udp = 1484
let max_reply_udp = 400
let max_tcp = 1 lsl 16 - 1
let size_edns max_size edns protocol query =
let maximum, payload_size = match protocol, max_size, query with
| `Tcp, _, _ -> max_tcp, None
| `Udp, None, true -> max_udp, Some 4096
| `Udp, None, false -> max_reply_udp, Some 512
| `Udp, Some x, true -> x, Some x
| `Udp, Some x, false -> min x max_reply_udp, Some 512
in
let edns = match edns, payload_size with
| None, _ | _, None -> edns
| Some opts, Some s -> Some ({ opts with Edns.payload_size = s })
in
maximum, edns
let encode_t names buf off question = function
| `Query | `Axfr_request
| `Notify_ack | `Update_ack
| `Rcode_error (_, _, None) -> names, off
| `Notify soa ->
begin match soa with
| None -> names, off
| Some soa ->
let soa = Name_rr_map.singleton (fst question) Soa soa in
Answer.encode names buf off question (soa, Name_rr_map.empty)
end
| `Ixfr_request soa ->
let soa = Name_rr_map.singleton (fst question) Soa soa in
Answer.encode names buf off question (Name_rr_map.empty, soa)
| `Update u -> Update.encode names buf off question u
| `Answer q -> Answer.encode names buf off question q
| `Axfr_reply data -> Axfr.encode names buf off question data
| `Axfr_partial_reply (x, data) -> Axfr.encode_partial names buf off question x data
| `Ixfr_reply data -> Ixfr.encode names buf off question data
| `Rcode_error (_, _, Some q) -> Answer.encode names buf off question q
let encode_edns rcode edns buf off = match edns with
| None -> off
| Some edns ->
let extended_rcode = (Rcode.to_int rcode) lsr 4 in
let adcount = Cstruct.BE.get_uint16 buf 10 in
let off = Edns.encode { edns with Edns.extended_rcode } buf off in
Cstruct.BE.set_uint16 buf 10 (adcount + 1) ;
off
let encode ?max_size protocol t =
let query = match t.data with #request -> true | #reply -> false in
let max, edns = size_edns max_size t.edns protocol query in
let try_encoding buf =
let off, trunc =
try
let opcode = opcode_data t.data
and rcode = rcode_data t.data
in
Header.encode buf (t.header, query, opcode, rcode);
let names, off = Question.encode Domain_name.Map.empty buf Header.len t.question in
Cstruct.BE.set_uint16 buf 4 1 ;
let names, off = encode_t names buf off t.question t.data in
let (_names, off), adcount = encode_data t.additional names buf off in
Cstruct.BE.set_uint16 buf 10 adcount ;
encode_edns Rcode.NoError edns buf off, false
with Invalid_argument _ ->
Cstruct.set_uint8 buf 2 (0x02 lor (Cstruct.get_uint8 buf 2)) ;
Cstruct.length buf, true
in
Cstruct.sub buf 0 off, trunc
in
let rec doit s =
let cs = Cstruct.create s in
match try_encoding cs with
| (cs, false) -> (cs, max)
| (cs, true) ->
let next = min max (s * 2) in
if next = s then
(cs, max)
else
doit next
in
doit (min max 4000)
let encode_axfr_reply ?max_size needed_for_tsig protocol t data =
let query = false in
let max, _edns = size_edns max_size t.edns protocol query in
let max_size = max - needed_for_tsig in
assert (max_size > 0);
let opcode = opcode_data t.data
and rcode = rcode_data t.data
in
let new_buffer () =
let buf = Cstruct.create max in
Header.encode buf (t.header, query, opcode, rcode);
let names, off = Question.encode Domain_name.Map.empty buf Header.len t.question in
Cstruct.BE.set_uint16 buf 4 1 ;
names, buf, off
in
Axfr.encode_reply new_buffer max_size t.question data, max
let raw_error buf rcode =
if Cstruct.length buf < 12 then
None
else
let query = Cstruct.get_uint8 buf 2 lsr 7 = 0 in
if not query then
None
else
let hdr = Cstruct.create 12 in
Cstruct.BE.set_uint16 hdr 0 (Cstruct.BE.get_uint16 buf 0) ;
Cstruct.set_uint8 hdr 2 (0x80 lor ((Cstruct.get_uint8 buf 2) land 0x78)) ;
Cstruct.set_uint8 hdr 3 ((Rcode.to_int rcode) land 0xF) ;
let extended_rcode = Rcode.to_int rcode lsr 4 in
if extended_rcode = 0 then
Some hdr
else
let edns = Edns.create ~extended_rcode () in
let buf = Edns.allocate_and_encode edns in
Cstruct.BE.set_uint16 hdr 10 1 ;
Some (Cstruct.append hdr buf)
end
module Tsig_op = struct
type e = [
| `Bad_key of [ `raw ] Domain_name.t * Tsig.t
| `Bad_timestamp of [ `raw ] Domain_name.t * Tsig.t * Dnskey.t
| `Bad_truncation of [ `raw ] Domain_name.t * Tsig.t
| `Invalid_mac of [ `raw ] Domain_name.t * Tsig.t
]
let pp_e ppf = function
| `Bad_key (name, tsig) -> Fmt.pf ppf "bad key %a: %a" Domain_name.pp name Tsig.pp tsig
| `Bad_timestamp (name, tsig, key) -> Fmt.pf ppf "bad timestamp: %a %a %a" Domain_name.pp name Tsig.pp tsig Dnskey.pp key
| `Bad_truncation (name, tsig) -> Fmt.pf ppf "bad truncation %a %a" Domain_name.pp name Tsig.pp tsig
| `Invalid_mac (name, tsig) -> Fmt.pf ppf "invalid mac %a %a" Domain_name.pp name Tsig.pp tsig
type verify = ?mac:Cstruct.t -> Ptime.t -> Packet.t ->
[ `raw ] Domain_name.t -> ?key:Dnskey.t -> Tsig.t -> Cstruct.t ->
(Tsig.t * Cstruct.t * Dnskey.t, e * Cstruct.t option) result
let no_verify ?mac:_ _ _ _ ?key:_ tsig _ =
Error (`Bad_key (Domain_name.of_string_exn "no.verification", tsig), None)
type sign = ?mac:Cstruct.t -> ?max_size:int -> [ `raw ] Domain_name.t ->
Tsig.t -> key:Dnskey.t -> Packet.t -> Cstruct.t ->
(Cstruct.t * Cstruct.t) option
let no_sign ?mac:_ ?max_size:_ _ _ ~key:_ _ _ = None
end
let create ~f =
let data : (string, int) Hashtbl.t = Hashtbl.create 7 in
(fun x ->
let key = f x in
let cur = match Hashtbl.find_opt data key with None -> 0 | Some x -> x in
Hashtbl.replace data key (succ cur)),
(fun () ->
Hashtbl.fold (fun key value acc -> Metrics.uint key value :: acc) data [])
let counter_metrics ~f ?static name =
let open Metrics in
let doc = "Counter metrics" in
let incr, get = create ~f in
let static = Option.value ~default:(fun () -> []) static in
let data thing = incr thing; Data.v (static () @ get ()) in
Src.v ~doc ~tags:Metrics.Tags.[] ~data name