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
|
/* vi: set sw=4 ts=4: */
/* resolv.c: DNS Resolver
*
* Copyright (C) 1998 Kenneth Albanowski <kjahds@kjahds.com>,
* The Silver Hammer Group, Ltd.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*/
/*
* Portions Copyright (c) 1985, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies, and that
* the name of Digital Equipment Corporation not be used in advertising or
* publicity pertaining to distribution of the document or software without
* specific, written prior permission.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
/*
* Portions Copyright (c) 1996-1999 by Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
/*
* 5-Oct-2000 W. Greathouse wgreathouse@smva.com
* Fix memory leak and memory corruption.
* -- Every name resolution resulted in
* a new parse of resolv.conf and new
* copy of nameservers allocated by
* strdup.
* -- Every name resolution resulted in
* a new read of resolv.conf without
* resetting index from prior read...
* resulting in exceeding array bounds.
*
* Limit nameservers read from resolv.conf.
* Add "search" domains from resolv.conf.
* Some systems will return a security
* signature along with query answer for
* dynamic DNS entries -- skip/ignore this answer.
* Include arpa/nameser.h for defines.
* General cleanup.
*
* 20-Jun-2001 Michal Moskal <malekith@pld.org.pl>
* partial IPv6 support (i.e. gethostbyname2() and resolve_address2()
* functions added), IPv6 nameservers are also supported.
*
* 6-Oct-2001 Jari Korva <jari.korva@iki.fi>
* more IPv6 support (IPv6 support for gethostbyaddr();
* address family parameter and improved IPv6 support for get_hosts_byname
* and read_etc_hosts; getnameinfo() port from glibc; defined
* defined ip6addr_any and in6addr_loopback)
*
* 2-Feb-2002 Erik Andersen <andersen@codepoet.org>
* Added gethostent(), sethostent(), and endhostent()
*
* 17-Aug-2002 Manuel Novoa III <mjn3@codepoet.org>
* Fixed __read_etc_hosts_r to return alias list, and modified buffer
* allocation accordingly. See MAX_ALIASES and ALIAS_DIM below.
* This fixes the segfault in the Python 2.2.1 socket test.
*
* 04-Jan-2003 Jay Kulpinski <jskulpin@berkshire.rr.com>
* Fixed __decode_dotted to count the terminating null character
* in a host name.
*
* 02-Oct-2003 Tony J. White <tjw@tjw.org>
* Lifted dn_expand() and dependent ns_name_uncompress(), ns_name_unpack(),
* and ns_name_ntop() from glibc 2.3.2 for compatibility with ipsec-tools
* and openldap.
*
* 7-Sep-2004 Erik Andersen <andersen@codepoet.org>
* Added gethostent_r()
*
* 2008, 2009 Denys Vlasenko <vda.linux@googlemail.com>
* Cleanups, fixes, readability, more cleanups and more fixes.
*
* March 2010 Bernhard Reutner-Fischer
* Switch to common config parser
*/
/* Nota bene:
* The whole resolver code has several (severe) problems:
* - it doesn't even build without IPv4, i.e. !UCLIBC_HAS_IPV4 but only IPv6
* - it is way too big
*
* Both points above are considered bugs, patches/reimplementations welcome.
*/
/* RFC 1035
...
Whenever an octet represents a numeric quantity, the left most bit
in the diagram is the high order or most significant bit.
That is, the bit labeled 0 is the most significant bit.
...
4.1.1. Header section format
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| ID |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
|QR| OPCODE |AA|TC|RD|RA| 0 0 0| RCODE |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| QDCOUNT |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| ANCOUNT |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| NSCOUNT |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| ARCOUNT |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
ID 16 bit random identifier assigned by querying peer.
Used to match query/response.
QR message is a query (0), or a response (1).
OPCODE 0 standard query (QUERY)
1 inverse query (IQUERY)
2 server status request (STATUS)
AA Authoritative Answer - this bit is valid in responses.
Responding name server is an authority for the domain name
in question section. Answer section may have multiple owner names
because of aliases. The AA bit corresponds to the name which matches
the query name, or the first owner name in the answer section.
TC TrunCation - this message was truncated.
RD Recursion Desired - this bit may be set in a query and
is copied into the response. If RD is set, it directs
the name server to pursue the query recursively.
Recursive query support is optional.
RA Recursion Available - this be is set or cleared in a
response, and denotes whether recursive query support is
available in the name server.
RCODE Response code.
0 No error condition
1 Format error
2 Server failure - server was unable to process the query
due to a problem with the name server.
3 Name Error - meaningful only for responses from
an authoritative name server. The referenced domain name
does not exist.
4 Not Implemented.
5 Refused.
QDCOUNT number of entries in the question section.
ANCOUNT number of records in the answer section.
NSCOUNT number of records in the authority records section.
ARCOUNT number of records in the additional records section.
4.1.2. Question section format
The section contains QDCOUNT (usually 1) entries, each of this format:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
/ QNAME /
/ /
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| QTYPE |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| QCLASS |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
QNAME a domain name represented as a sequence of labels, where
each label consists of a length octet followed by that
number of octets. The domain name terminates with the
zero length octet for the null label of the root. Note
that this field may be an odd number of octets; no
padding is used.
QTYPE a two octet type of the query.
1 a host address [REQ_A const]
2 an authoritative name server
3 a mail destination (Obsolete - use MX)
4 a mail forwarder (Obsolete - use MX)
5 the canonical name for an alias
6 marks the start of a zone of authority
7 a mailbox domain name (EXPERIMENTAL)
8 a mail group member (EXPERIMENTAL)
9 a mail rename domain name (EXPERIMENTAL)
10 a null RR (EXPERIMENTAL)
11 a well known service description
12 a domain name pointer [REQ_PTR const]
13 host information
14 mailbox or mail list information
15 mail exchange
16 text strings
0x1c IPv6?
252 a request for a transfer of an entire zone
253 a request for mailbox-related records (MB, MG or MR)
254 a request for mail agent RRs (Obsolete - see MX)
255 a request for all records
QCLASS a two octet code that specifies the class of the query.
1 the Internet
(others are historic only)
255 any class
4.1.3. Resource record format
The answer, authority, and additional sections all share the same format:
a variable number of resource records, where the number of records
is specified in the corresponding count field in the header.
Each resource record has this format:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
/ /
/ NAME /
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| TYPE |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| CLASS |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| TTL |
| |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| RDLENGTH |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--|
/ RDATA /
/ /
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
NAME a domain name to which this resource record pertains.
TYPE two octets containing one of the RR type codes. This
field specifies the meaning of the data in the RDATA field.
CLASS two octets which specify the class of the data in the RDATA field.
TTL a 32 bit unsigned integer that specifies the time interval
(in seconds) that the record may be cached.
RDLENGTH a 16 bit integer, length in octets of the RDATA field.
RDATA a variable length string of octets that describes the resource.
The format of this information varies according to the TYPE
and CLASS of the resource record.
If the TYPE is A and the CLASS is IN, it's a 4 octet IP address.
4.1.4. Message compression
In order to reduce the size of messages, domain names can be compressed.
An entire domain name or a list of labels at the end of a domain name
is replaced with a pointer to a prior occurance of the same name.
The pointer takes the form of a two octet sequence:
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
| 1 1| OFFSET |
+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+
The first two bits are ones. This allows a pointer to be distinguished
from a label, since the label must begin with two zero bits because
labels are restricted to 63 octets or less. The OFFSET field specifies
an offset from the start of the message (i.e., the first octet
of the ID field in the domain header).
A zero offset specifies the first byte of the ID field, etc.
Domain name in a message can be represented as either:
- a sequence of labels ending in a zero octet
- a pointer
- a sequence of labels ending with a pointer
*/
#include <string.h>
#include <stdio.h>
#include <stdio_ext.h>
#include <signal.h>
#include <malloc.h>
#include <errno.h>
#include <sys/poll.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <sys/time.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <unistd.h>
#include <resolv.h>
#include <netdb.h>
#include <ctype.h>
#include <stdbool.h>
#include <time.h>
#include <arpa/nameser.h>
#include <sys/utsname.h>
#include <sys/un.h>
#include <sys/stat.h>
#include <sys/param.h>
#include <bits/uClibc_mutex.h>
#include "internal/parse_config.h"
/* poll() is not supported in kernel <= 2.0, therefore if __NR_poll is
* not available, we assume an old Linux kernel is in use and we will
* use select() instead. */
#include <sys/syscall.h>
#ifndef __NR_poll
# define USE_SELECT
#endif
#if defined __UCLIBC_HAS_IPV4__ && defined __UCLIBC_HAS_IPV6__
#define IF_HAS_BOTH(...) __VA_ARGS__
#else
#define IF_HAS_BOTH(...)
#endif
#define MAX_RECURSE 5
#define MAXALIASES (4)
/* 1:ip + 1:full + MAX_ALIASES:aliases + 1:NULL */
#define ALIAS_DIM (2 + MAXALIASES + 1)
#define BUFSZ (80) /* one line */
#define NS_TYPE_ELT 0x40 /*%< EDNS0 extended label type */
#define DNS_LABELTYPE_BITSTRING 0x41
#undef DEBUG
/* #define DEBUG */
#ifdef DEBUG
#define DPRINTF(X,args...) fprintf(stderr, X, ##args)
#else
#define DPRINTF(X,args...)
#endif
/* Make sure the incoming char * buffer is aligned enough to handle our random
* structures. This define is the same as we use for malloc alignment (which
* has same requirements). The offset is the number of bytes we need to adjust
* in order to attain desired alignment.
*/
#define ALIGN_ATTR __alignof__(double __attribute_aligned__ (sizeof(size_t)))
#define ALIGN_BUFFER_OFFSET(buf) ((ALIGN_ATTR - ((size_t)buf % ALIGN_ATTR)) % ALIGN_ATTR)
/* Structs */
struct resolv_header {
int id;
int qr, opcode, aa, tc, rd, ra, rcode;
int qdcount;
int ancount;
int nscount;
int arcount;
};
struct resolv_question {
char *dotted;
int qtype;
int qclass;
};
struct resolv_answer {
char *dotted;
int atype;
int aclass;
int ttl;
int rdlength;
const unsigned char *rdata;
int rdoffset;
char* buf;
size_t buflen;
size_t add_count;
};
enum etc_hosts_action {
GET_HOSTS_BYNAME = 0,
GETHOSTENT,
GET_HOSTS_BYADDR,
};
typedef union sockaddr46_t {
struct sockaddr sa;
#ifdef __UCLIBC_HAS_IPV4__
struct sockaddr_in sa4;
#endif
#ifdef __UCLIBC_HAS_IPV6__
struct sockaddr_in6 sa6;
#endif
} sockaddr46_t;
__UCLIBC_MUTEX_EXTERN(__resolv_lock) attribute_hidden;
/* Protected by __resolv_lock */
extern void (*__res_sync)(void) attribute_hidden;
/*extern uint32_t __resolv_opts attribute_hidden; */
extern uint8_t __resolv_timeout attribute_hidden;
extern uint8_t __resolv_attempts attribute_hidden;
extern unsigned __nameservers attribute_hidden;
extern unsigned __searchdomains attribute_hidden;
extern sockaddr46_t *__nameserver attribute_hidden;
extern char **__searchdomain attribute_hidden;
#ifdef __UCLIBC_HAS_IPV4__
extern const struct sockaddr_in __local_nameserver attribute_hidden;
#else
extern const struct sockaddr_in6 __local_nameserver attribute_hidden;
#endif
/* Arbitrary */
#define MAXLEN_searchdomain 128
/* prototypes for internal functions */
extern void endhostent_unlocked(void) attribute_hidden;
extern int __get_hosts_byname_r(const char *name,
int type,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop) attribute_hidden;
extern int __get_hosts_byaddr_r(const char *addr,
int len,
int type,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop) attribute_hidden;
extern parser_t *__open_etc_hosts(void) attribute_hidden;
extern int __read_etc_hosts_r(parser_t *parser,
const char *name,
int type,
enum etc_hosts_action action,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop) attribute_hidden;
extern int __dns_lookup(const char *name,
int type,
unsigned char **outpacket,
struct resolv_answer *a) attribute_hidden;
extern int __encode_dotted(const char *dotted,
unsigned char *dest,
int maxlen) attribute_hidden;
extern int __decode_dotted(const unsigned char *packet,
int offset,
int packet_len,
char *dest,
int dest_len) attribute_hidden;
extern int __encode_header(struct resolv_header *h,
unsigned char *dest,
int maxlen) attribute_hidden;
extern void __decode_header(unsigned char *data,
struct resolv_header *h) attribute_hidden;
extern int __encode_question(const struct resolv_question *q,
unsigned char *dest,
int maxlen) attribute_hidden;
extern int __encode_answer(struct resolv_answer *a,
unsigned char *dest,
int maxlen) attribute_hidden;
extern void __open_nameservers(void) attribute_hidden;
extern void __close_nameservers(void) attribute_hidden;
/*
* Theory of operation.
*
* gethostbyname, getaddrinfo and friends end up here, and they sometimes
* need to talk to DNS servers. In order to do this, we need to read /etc/resolv.conf
* and determine servers' addresses and the like. resolv.conf format:
*
* nameserver <IP[v6]>
* Address of DNS server. Cumulative.
* If not specified, assumed to be on localhost.
* search <domain1>[ <domain2>]...
* Append these domains to unqualified names.
* See ndots:n option.
* $LOCALDOMAIN (space-separated list) overrides this.
* domain <domain>
* Effectively same as "search" with one domain.
* If no "domain" line is present, the domain is determined
* from the local host name returned by gethostname();
* the domain part is taken to be everything after the first dot.
* If there are no dots, there will be no "domain".
* The domain and search keywords are mutually exclusive.
* If more than one instance of these keywords is present,
* the last instance wins.
* sortlist 130.155.160.0[/255.255.240.0] 130.155.0.0
* Allows addresses returned by gethostbyname to be sorted.
* Not supported.
* options option[ option]...
* (so far we support timeout:n and attempts:n)
* $RES_OPTIONS (space-separated list) is to be added to "options"
* debug sets RES_DEBUG in _res.options
* ndots:n how many dots there should be so that name will be tried
* first as an absolute name before any search list elements
* are appended to it. Default 1
* timeout:n how long to wait for response. Default 5
* (sun seems to have retrans:n synonym)
* attempts:n number of rounds to do before giving up and returning
* an error. Default 2
* (sun seems to have retry:n synonym)
* rotate sets RES_ROTATE in _res.options, round robin
* selection of nameservers. Otherwise try
* the first listed server first every time
* no-check-names
* sets RES_NOCHECKNAME in _res.options, which disables
* checking of incoming host names for invalid characters
* such as underscore (_), non-ASCII, or control characters
* inet6 sets RES_USE_INET6 in _res.options. Try a AAAA query
* before an A query inside the gethostbyname(), and map
* IPv4 responses in IPv6 "tunnelled form" if no AAAA records
* are found but an A record set exists
* no_tld_query (FreeBSDism?)
* do not attempt to resolve names without dots
*
* We will read and analyze /etc/resolv.conf as needed before
* we do a DNS request. This happens in __dns_lookup.
* It is reread if its mtime is changed.
*
* BSD has res_init routine which is used to initialize resolver state
* which is held in global structure _res.
* Generally, programs call res_init, then fiddle with _res.XXX
* (_res.options and _res.nscount, _res.nsaddr_list[N]
* are popular targets of fiddling) and expect subsequent calls
* to gethostbyname, getaddrinfo, etc to use modified information.
*
* However, historical _res structure is quite awkward.
* Using it for storing /etc/resolv.conf info is not desirable,
* and __dns_lookup does not use it.
*
* We would like to avoid using it unless absolutely necessary.
* If user doesn't use res_init, we should arrange it so that
* _res structure doesn't even *get linked in* into user's application
* (imagine static uclibc build here).
*
* The solution is a __res_sync function pointer, which is normally NULL.
* But if res_init is called, it gets set and any subsequent gethostbyname
* et al "syncronizes" our internal structures with potentially
* modified _res.XXX stuff by calling __res_sync.
* The trick here is that if res_init is not used and not linked in,
* gethostbyname itself won't reference _res and _res won't be linked in
* either. Other possible methods like
* if (__res_sync_just_an_int_flag)
* __sync_me_with_res()
* would pull in __sync_me_with_res, which pulls in _res. Bad.
*/
#ifdef L_encodeh
int __encode_header(struct resolv_header *h, unsigned char *dest, int maxlen)
{
if (maxlen < HFIXEDSZ)
return -1;
dest[0] = (h->id & 0xff00) >> 8;
dest[1] = (h->id & 0x00ff) >> 0;
dest[2] = (h->qr ? 0x80 : 0) |
((h->opcode & 0x0f) << 3) |
(h->aa ? 0x04 : 0) |
(h->tc ? 0x02 : 0) |
(h->rd ? 0x01 : 0);
dest[3] = (h->ra ? 0x80 : 0) | (h->rcode & 0x0f);
dest[4] = (h->qdcount & 0xff00) >> 8;
dest[5] = (h->qdcount & 0x00ff) >> 0;
dest[6] = (h->ancount & 0xff00) >> 8;
dest[7] = (h->ancount & 0x00ff) >> 0;
dest[8] = (h->nscount & 0xff00) >> 8;
dest[9] = (h->nscount & 0x00ff) >> 0;
dest[10] = (h->arcount & 0xff00) >> 8;
dest[11] = (h->arcount & 0x00ff) >> 0;
return HFIXEDSZ;
}
#endif /* L_encodeh */
#ifdef L_decodeh
void __decode_header(unsigned char *data,
struct resolv_header *h)
{
h->id = (data[0] << 8) | data[1];
h->qr = (data[2] & 0x80) ? 1 : 0;
h->opcode = (data[2] >> 3) & 0x0f;
h->aa = (data[2] & 0x04) ? 1 : 0;
h->tc = (data[2] & 0x02) ? 1 : 0;
h->rd = (data[2] & 0x01) ? 1 : 0;
h->ra = (data[3] & 0x80) ? 1 : 0;
h->rcode = data[3] & 0x0f;
h->qdcount = (data[4] << 8) | data[5];
h->ancount = (data[6] << 8) | data[7];
h->nscount = (data[8] << 8) | data[9];
h->arcount = (data[10] << 8) | data[11];
}
#endif /* L_decodeh */
#ifdef L_encoded
/* Encode a dotted string into nameserver transport-level encoding.
This routine is fairly dumb, and doesn't attempt to compress
the data */
int __encode_dotted(const char *dotted, unsigned char *dest, int maxlen)
{
unsigned used = 0;
while (dotted && *dotted) {
char *c = strchr(dotted, '.');
int l = c ? c - dotted : strlen(dotted);
/* two consecutive dots are not valid */
if (l == 0)
return -1;
if (l >= (maxlen - used - 1))
return -1;
dest[used++] = l;
memcpy(dest + used, dotted, l);
used += l;
if (!c)
break;
dotted = c + 1;
}
if (maxlen < 1)
return -1;
dest[used++] = 0;
return used;
}
#endif /* L_encoded */
#ifdef L_decoded
/* Decode a dotted string from nameserver transport-level encoding.
This routine understands compressed data. */
int __decode_dotted(const unsigned char *packet,
int offset,
int packet_len,
char *dest,
int dest_len)
{
unsigned b;
bool measure = 1;
unsigned total = 0;
unsigned used = 0;
unsigned maxiter = 256;
if (!packet)
return -1;
dest[0] = '\0';
while (--maxiter) {
if (offset >= packet_len)
return -1;
b = packet[offset++];
if (b == 0)
break;
if (measure)
total++;
if ((b & 0xc0) == 0xc0) {
if (offset >= packet_len)
return -1;
if (measure)
total++;
/* compressed item, redirect */
offset = ((b & 0x3f) << 8) | packet[offset];
measure = 0;
continue;
}
if (used + b + 1 >= dest_len)
return -1;
if (offset + b >= packet_len)
return -1;
memcpy(dest + used, packet + offset, b);
offset += b;
used += b;
if (measure)
total += b;
if (packet[offset] != 0)
dest[used++] = '.';
else
dest[used++] = '\0';
}
if (!maxiter)
return -1;
/* The null byte must be counted too */
if (measure)
total++;
DPRINTF("Total decode len = %d\n", total);
return total;
}
#endif /* L_decoded */
#ifdef L_encodeq
int __encode_question(const struct resolv_question *q,
unsigned char *dest,
int maxlen)
{
int i;
i = __encode_dotted(q->dotted, dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
if (maxlen < 4)
return -1;
dest[0] = (q->qtype & 0xff00) >> 8;
dest[1] = (q->qtype & 0x00ff) >> 0;
dest[2] = (q->qclass & 0xff00) >> 8;
dest[3] = (q->qclass & 0x00ff) >> 0;
return i + 4;
}
#endif /* L_encodeq */
#ifdef L_encodea
int __encode_answer(struct resolv_answer *a, unsigned char *dest, int maxlen)
{
int i;
i = __encode_dotted(a->dotted, dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
if (maxlen < (RRFIXEDSZ + a->rdlength))
return -1;
*dest++ = (a->atype & 0xff00) >> 8;
*dest++ = (a->atype & 0x00ff) >> 0;
*dest++ = (a->aclass & 0xff00) >> 8;
*dest++ = (a->aclass & 0x00ff) >> 0;
*dest++ = (a->ttl & 0xff000000) >> 24;
*dest++ = (a->ttl & 0x00ff0000) >> 16;
*dest++ = (a->ttl & 0x0000ff00) >> 8;
*dest++ = (a->ttl & 0x000000ff) >> 0;
*dest++ = (a->rdlength & 0xff00) >> 8;
*dest++ = (a->rdlength & 0x00ff) >> 0;
memcpy(dest, a->rdata, a->rdlength);
return i + RRFIXEDSZ + a->rdlength;
}
#endif /* L_encodea */
#ifdef CURRENTLY_UNUSED
#ifdef L_encodep
int __encode_packet(struct resolv_header *h,
struct resolv_question **q,
struct resolv_answer **an,
struct resolv_answer **ns,
struct resolv_answer **ar,
unsigned char *dest, int maxlen) attribute_hidden;
int __encode_packet(struct resolv_header *h,
struct resolv_question **q,
struct resolv_answer **an,
struct resolv_answer **ns,
struct resolv_answer **ar,
unsigned char *dest, int maxlen)
{
int i, total = 0;
unsigned j;
i = __encode_header(h, dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
total += i;
for (j = 0; j < h->qdcount; j++) {
i = __encode_question(q[j], dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
total += i;
}
for (j = 0; j < h->ancount; j++) {
i = __encode_answer(an[j], dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
total += i;
}
for (j = 0; j < h->nscount; j++) {
i = __encode_answer(ns[j], dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
total += i;
}
for (j = 0; j < h->arcount; j++) {
i = __encode_answer(ar[j], dest, maxlen);
if (i < 0)
return i;
dest += i;
maxlen -= i;
total += i;
}
return total;
}
#endif /* L_encodep */
#ifdef L_decodep
int __decode_packet(unsigned char *data, struct resolv_header *h) attribute_hidden;
int __decode_packet(unsigned char *data, struct resolv_header *h)
{
__decode_header(data, h);
return HFIXEDSZ;
}
#endif /* L_decodep */
#ifdef L_formquery
int __form_query(int id,
const char *name,
int type,
unsigned char *packet,
int maxlen) attribute_hidden;
int __form_query(int id,
const char *name,
int type,
unsigned char *packet,
int maxlen)
{
struct resolv_header h;
struct resolv_question q;
int i, j;
memset(&h, 0, sizeof(h));
h.id = id;
h.qdcount = 1;
q.dotted = (char *) name;
q.qtype = type;
q.qclass = C_IN; /* CLASS_IN */
i = __encode_header(&h, packet, maxlen);
if (i < 0)
return i;
j = __encode_question(&q, packet + i, maxlen - i);
if (j < 0)
return j;
return i + j;
}
#endif /* L_formquery */
#endif /* CURRENTLY_UNUSED */
#ifdef L_opennameservers
# if __BYTE_ORDER == __LITTLE_ENDIAN
#define NAMESERVER_PORT_N (__bswap_constant_16(NAMESERVER_PORT))
#else
#define NAMESERVER_PORT_N NAMESERVER_PORT
#endif
__UCLIBC_MUTEX_INIT(__resolv_lock, PTHREAD_MUTEX_INITIALIZER);
/* Protected by __resolv_lock */
void (*__res_sync)(void);
/*uint32_t __resolv_opts; */
uint8_t __resolv_timeout = RES_TIMEOUT;
uint8_t __resolv_attempts = RES_DFLRETRY;
unsigned __nameservers;
unsigned __searchdomains;
sockaddr46_t *__nameserver;
char **__searchdomain;
#ifdef __UCLIBC_HAS_IPV4__
const struct sockaddr_in __local_nameserver = {
.sin_family = AF_INET,
.sin_port = NAMESERVER_PORT_N,
};
#else
const struct sockaddr_in6 __local_nameserver = {
.sin6_family = AF_INET6,
.sin6_port = NAMESERVER_PORT_N,
};
#endif
/* Helpers. Both stop on EOL, if it's '\n', it is converted to NUL first */
static char *skip_nospace(char *p)
{
while (*p != '\0' && !isspace(*p)) {
if (*p == '\n') {
*p = '\0';
break;
}
p++;
}
return p;
}
static char *skip_and_NUL_space(char *p)
{
/* NB: '\n' is not isspace! */
while (1) {
char c = *p;
if (c == '\0' || !isspace(c))
break;
*p = '\0';
if (c == '\n' || c == '#')
break;
p++;
}
return p;
}
/* Must be called under __resolv_lock. */
void __open_nameservers(void)
{
static uint32_t resolv_conf_mtime;
char szBuffer[MAXLEN_searchdomain];
FILE *fp;
int i;
sockaddr46_t sa;
if (!__res_sync) {
/* Reread /etc/resolv.conf if it was modified. */
struct stat sb;
if (stat(_PATH_RESCONF, &sb) != 0)
sb.st_mtime = 0;
if (resolv_conf_mtime != (uint32_t)sb.st_mtime) {
resolv_conf_mtime = sb.st_mtime;
__close_nameservers(); /* force config reread */
}
}
if (__nameservers)
goto sync;
__resolv_timeout = RES_TIMEOUT;
__resolv_attempts = RES_DFLRETRY;
fp = fopen(_PATH_RESCONF, "r");
#ifdef FALLBACK_TO_CONFIG_RESOLVCONF
if (!fp) {
/* If we do not have a pre-populated /etc/resolv.conf then
try to use the one from /etc/config which exists on numerous
systems ranging from some uClinux to IRIX installations and
may be the only /etc dir that was mounted rw. */
fp = fopen("/etc/config/resolv.conf", "r");
}
#endif
if (fp) {
while (fgets(szBuffer, sizeof(szBuffer), fp) != NULL) {
void *ptr;
char *keyword, *p;
keyword = p = skip_and_NUL_space(szBuffer);
/* skip keyword */
p = skip_nospace(p);
/* find next word */
p = skip_and_NUL_space(p);
if (strcmp(keyword, "nameserver") == 0) {
/* terminate IP addr */
*skip_nospace(p) = '\0';
memset(&sa, 0, sizeof(sa));
if (0) /* nothing */;
#ifdef __UCLIBC_HAS_IPV6__
else if (inet_pton(AF_INET6, p, &sa.sa6.sin6_addr) > 0) {
sa.sa6.sin6_family = AF_INET6;
sa.sa6.sin6_port = htons(NAMESERVER_PORT);
}
#endif
#ifdef __UCLIBC_HAS_IPV4__
else if (inet_pton(AF_INET, p, &sa.sa4.sin_addr) > 0) {
sa.sa4.sin_family = AF_INET;
sa.sa4.sin_port = htons(NAMESERVER_PORT);
}
#endif
else
continue; /* garbage on this line */
ptr = realloc(__nameserver, (__nameservers + 1) * sizeof(__nameserver[0]));
if (!ptr)
continue;
__nameserver = ptr;
__nameserver[__nameservers++] = sa; /* struct copy */
continue;
}
if (strcmp(keyword, "domain") == 0 || strcmp(keyword, "search") == 0) {
char *p1;
/* free old domains ("last 'domain' or 'search' wins" rule) */
while (__searchdomains)
free(__searchdomain[--__searchdomains]);
/*free(__searchdomain);*/
/*__searchdomain = NULL; - not necessary */
next_word:
/* terminate current word */
p1 = skip_nospace(p);
/* find next word (maybe) */
p1 = skip_and_NUL_space(p1);
/* add it */
ptr = realloc(__searchdomain, (__searchdomains + 1) * sizeof(__searchdomain[0]));
if (!ptr)
continue;
__searchdomain = ptr;
/* NB: strlen(p) <= MAXLEN_searchdomain) because szBuffer[] is smaller */
ptr = strdup(p);
if (!ptr)
continue;
DPRINTF("adding search %s\n", (char*)ptr);
__searchdomain[__searchdomains++] = (char*)ptr;
p = p1;
if (*p)
goto next_word;
continue;
}
/* if (strcmp(keyword, "sortlist") == 0)... */
if (strcmp(keyword, "options") == 0) {
char *p1;
uint8_t *what;
if (p == NULL || (p1 = strchr(p, ':')) == NULL)
continue;
*p1++ = '\0';
if (strcmp(p, "timeout") == 0)
what = &__resolv_timeout;
else if (strcmp(p, "attempts") == 0)
what = &__resolv_attempts;
else
continue;
*what = atoi(p1);
DPRINTF("option %s:%d\n", p, *what);
}
}
fclose(fp);
}
if (__nameservers == 0) {
/* Have to handle malloc failure! What a mess...
* And it's not only here, we need to be careful
* to never write into __nameserver[0] if it points
* to constant __local_nameserver, or free it. */
__nameserver = malloc(sizeof(__nameserver[0]));
if (__nameserver)
memcpy(__nameserver, &__local_nameserver, sizeof(__local_nameserver));
else
__nameserver = (void*) &__local_nameserver;
__nameservers++;
}
if (__searchdomains == 0) {
char buf[256];
char *p;
i = gethostname(buf, sizeof(buf) - 1);
buf[sizeof(buf) - 1] = '\0';
if (i == 0 && (p = strchr(buf, '.')) != NULL && p[1]) {
p = strdup(p + 1);
if (!p)
goto err;
__searchdomain = malloc(sizeof(__searchdomain[0]));
if (!__searchdomain) {
free(p);
goto err;
}
__searchdomain[0] = p;
__searchdomains++;
err: ;
}
}
DPRINTF("nameservers = %d\n", __nameservers);
sync:
if (__res_sync)
__res_sync();
}
#endif /* L_opennameservers */
#ifdef L_closenameservers
/* Must be called under __resolv_lock. */
void __close_nameservers(void)
{
if (__nameserver != (void*) &__local_nameserver)
free(__nameserver);
__nameserver = NULL;
__nameservers = 0;
while (__searchdomains)
free(__searchdomain[--__searchdomains]);
free(__searchdomain);
__searchdomain = NULL;
/*__searchdomains = 0; - already is */
}
#endif /* L_closenameservers */
#ifdef L_dnslookup
/* Helpers */
static int __length_question(const unsigned char *data, int maxlen)
{
const unsigned char *start;
unsigned b;
if (!data)
return -1;
start = data;
while (1) {
if (maxlen <= 0)
return -1;
b = *data++;
if (b == 0)
break;
if ((b & 0xc0) == 0xc0) {
/* It's a "compressed" name. */
data++; /* skip lsb of redirected offset */
maxlen -= 2;
break;
}
data += b;
maxlen -= (b + 1); /* account for data++ above */
}
/* Up to here we were skipping encoded name */
/* Account for QTYPE and QCLASS fields */
if (maxlen < 4)
return -1;
return data - start + 2 + 2;
}
static int __decode_answer(const unsigned char *message, /* packet */
int offset,
int len, /* total packet len */
struct resolv_answer *a)
{
char temp[256];
int i;
DPRINTF("decode_answer(start): off %d, len %d\n", offset, len);
i = __decode_dotted(message, offset, len, temp, sizeof(temp));
if (i < 0)
return i;
message += offset + i;
len -= i + RRFIXEDSZ + offset;
if (len < 0) {
DPRINTF("decode_answer: off %d, len %d, i %d\n", offset, len, i);
return len;
}
/* TODO: what if strdup fails? */
a->dotted = strdup(temp);
a->atype = (message[0] << 8) | message[1];
message += 2;
a->aclass = (message[0] << 8) | message[1];
message += 2;
a->ttl = (message[0] << 24) |
(message[1] << 16) | (message[2] << 8) | (message[3] << 0);
message += 4;
a->rdlength = (message[0] << 8) | message[1];
message += 2;
a->rdata = message;
a->rdoffset = offset + i + RRFIXEDSZ;
DPRINTF("i=%d,rdlength=%d\n", i, a->rdlength);
if (len < a->rdlength)
return -1;
return i + RRFIXEDSZ + a->rdlength;
}
/* On entry:
* a.buf(len) = auxiliary buffer for IP addresses after first one
* a.add_count = how many additional addresses are there already
* outpacket = where to save ptr to raw packet? can be NULL
* On exit:
* ret < 0: error, all other data is not valid
* ret >= 0: length of reply packet
* a.add_count & a.buf: updated
* a.rdlength: length of addresses (4 bytes for IPv4)
* *outpacket: updated (packet is malloced, you need to free it)
* a.rdata: points into *outpacket to 1st IP addr
* NB: don't pass outpacket == NULL if you need to use a.rdata!
* a.atype: type of query?
* a.dotted: which name we _actually_ used. May contain search domains
* appended. (why the filed is called "dotted" I have no idea)
* This is a malloced string. May be NULL because strdup failed.
*/
int __dns_lookup(const char *name,
int type,
unsigned char **outpacket,
struct resolv_answer *a)
{
/* Protected by __resolv_lock: */
static int last_ns_num = 0;
static uint16_t last_id = 1;
int i, j, fd, rc;
int packet_len;
int name_len;
#ifdef USE_SELECT
struct timeval tv;
fd_set fds;
#else
struct pollfd fds;
#endif
struct resolv_header h;
struct resolv_question q;
struct resolv_answer ma;
bool first_answer = 1;
int retries_left;
unsigned char *packet = malloc(PACKETSZ);
char *lookup;
int variant = -1; /* search domain to append, -1: none */
int local_ns_num = -1; /* Nth server to use */
int local_id = local_id; /* for compiler */
int sdomains = 0;
bool ends_with_dot;
sockaddr46_t sa;
fd = -1;
lookup = NULL;
name_len = strlen(name);
if ((unsigned)name_len >= MAXDNAME - MAXLEN_searchdomain - 2)
goto fail; /* paranoia */
lookup = malloc(name_len + 1/*for '.'*/ + MAXLEN_searchdomain + 1);
if (!packet || !lookup || !name[0])
goto fail;
ends_with_dot = (name[name_len - 1] == '.');
/* no strcpy! paranoia, user might change name[] under us */
memcpy(lookup, name, name_len);
DPRINTF("Looking up type %d answer for '%s'\n", type, name);
retries_left = 0; /* for compiler */
do {
int pos;
unsigned reply_timeout;
if (fd != -1) {
close(fd);
fd = -1;
}
/* Mess with globals while under lock */
/* NB: even data *pointed to* by globals may vanish
* outside the locks. We should assume any and all
* globals can completely change between locked
* code regions. OTOH, this is rare, so we don't need
* to handle it "nicely" (do not skip servers,
* search domains, etc), we only need to ensure
* we do not SEGV, use freed+overwritten data
* or do other Really Bad Things. */
__UCLIBC_MUTEX_LOCK(__resolv_lock);
__open_nameservers();
if (type != T_PTR) {
sdomains = __searchdomains;
}
lookup[name_len] = '\0';
if ((unsigned)variant < sdomains) {
/* lookup is name_len + 1 + MAXLEN_searchdomain + 1 long */
/* __searchdomain[] is not bigger than MAXLEN_searchdomain */
lookup[name_len] = '.';
strcpy(&lookup[name_len + 1], __searchdomain[variant]);
}
/* first time? pick starting server etc */
if (local_ns_num < 0) {
local_id = last_id;
/*TODO: implement /etc/resolv.conf's "options rotate"
(a.k.a. RES_ROTATE bit in _res.options)
local_ns_num = 0;
if (_res.options & RES_ROTATE) */
local_ns_num = last_ns_num;
retries_left = __nameservers * __resolv_attempts;
}
if (local_ns_num >= __nameservers)
local_ns_num = 0;
local_id++;
local_id &= 0xffff;
/* write new values back while still under lock */
last_id = local_id;
last_ns_num = local_ns_num;
/* struct copy */
/* can't just take a pointer, __nameserver[x]
* is not safe to use outside of locks */
sa = __nameserver[local_ns_num];
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
memset(packet, 0, PACKETSZ);
memset(&h, 0, sizeof(h));
/* encode header */
h.id = local_id;
h.qdcount = 1;
h.rd = 1;
DPRINTF("encoding header\n", h.rd);
i = __encode_header(&h, packet, PACKETSZ);
if (i < 0)
goto fail;
/* encode question */
DPRINTF("lookup name: %s\n", lookup);
q.dotted = lookup;
q.qtype = type;
q.qclass = C_IN; /* CLASS_IN */
j = __encode_question(&q, packet+i, PACKETSZ-i);
if (j < 0)
goto fail;
packet_len = i + j;
/* send packet */
#ifdef DEBUG
{
const socklen_t plen = sa.sa.sa_family == AF_INET ? INET_ADDRSTRLEN : INET6_ADDRSTRLEN;
char *pbuf = malloc(plen);
if (pbuf == NULL) ;/* nothing */
#ifdef __UCLIBC_HAS_IPV6__
else if (sa.sa.sa_family == AF_INET6)
pbuf = (char*)inet_ntop(AF_INET6, &sa.sa6.sin6_addr, pbuf, plen);
#endif
#ifdef __UCLIBC_HAS_IPV4__
else if (sa.sa.sa_family == AF_INET)
pbuf = (char*)inet_ntop(AF_INET, &sa.sa4.sin_addr, pbuf, plen);
#endif
DPRINTF("On try %d, sending query to %s, port %d\n",
retries_left, pbuf, NAMESERVER_PORT);
free(pbuf);
}
#endif
fd = socket(sa.sa.sa_family, SOCK_DGRAM, IPPROTO_UDP);
if (fd < 0) /* paranoia */
goto try_next_server;
rc = connect(fd, &sa.sa, sizeof(sa));
if (rc < 0) {
/*if (errno == ENETUNREACH) { */
/* routing error, presume not transient */
goto try_next_server;
/*} */
/*For example, what transient error this can be? Can't think of any */
/* retry */
/*continue; */
}
DPRINTF("Xmit packet len:%d id:%d qr:%d\n", packet_len, h.id, h.qr);
/* no error check - if it fails, we time out on recv */
send(fd, packet, packet_len, 0);
#ifdef USE_SELECT
reply_timeout = __resolv_timeout;
wait_again:
FD_ZERO(&fds);
FD_SET(fd, &fds);
tv.tv_sec = reply_timeout;
tv.tv_usec = 0;
if (select(fd + 1, &fds, NULL, NULL, &tv) <= 0) {
DPRINTF("Timeout\n");
/* timed out, so retry send and receive
* to next nameserver */
goto try_next_server;
}
reply_timeout--;
#else /* !USE_SELECT */
reply_timeout = __resolv_timeout * 1000;
wait_again:
fds.fd = fd;
fds.events = POLLIN;
if (poll(&fds, 1, reply_timeout) <= 0) {
DPRINTF("Timeout\n");
/* timed out, so retry send and receive
* to next nameserver */
goto try_next_server;
}
if (fds.revents & (POLLERR | POLLHUP | POLLNVAL)) {
DPRINTF("Bad event\n");
goto try_next_server;
}
/*TODO: better timeout accounting?*/
reply_timeout -= 1000;
#endif /* USE_SELECT */
/* vda: a bogus response seen in real world (caused SEGV in uclibc):
* "ping www.google.com" sending AAAA query and getting
* response with one answer... with answer part missing!
* Fixed by thorough checks for not going past the packet's end.
*/
#ifdef DEBUG
{
static const char test_query[32] = "\0\2\1\0\0\1\0\0\0\0\0\0\3www\6google\3com\0\0\34\0\1";
static const char test_respn[32] = "\0\2\201\200\0\1\0\1\0\0\0\0\3www\6google\3com\0\0\34\0\1";
pos = memcmp(packet + 2, test_query + 2, 30);
packet_len = recv(fd, packet, PACKETSZ, MSG_DONTWAIT);
if (pos == 0) {
packet_len = 32;
memcpy(packet + 2, test_respn + 2, 30);
}
}
#else
packet_len = recv(fd, packet, PACKETSZ, MSG_DONTWAIT);
#endif
if (packet_len < HFIXEDSZ) {
/* too short!
* If the peer did shutdown then retry later,
* try next peer on error.
* it's just a bogus packet from somewhere */
bogus_packet:
if (packet_len >= 0 && reply_timeout)
goto wait_again;
goto try_next_server;
}
__decode_header(packet, &h);
DPRINTF("len:%d id:%d qr:%d\n", packet_len, h.id, h.qr);
if (h.id != local_id || !h.qr) {
/* unsolicited */
goto bogus_packet;
}
DPRINTF("Got response (i think)!\n");
DPRINTF("qrcount=%d,ancount=%d,nscount=%d,arcount=%d\n",
h.qdcount, h.ancount, h.nscount, h.arcount);
DPRINTF("opcode=%d,aa=%d,tc=%d,rd=%d,ra=%d,rcode=%d\n",
h.opcode, h.aa, h.tc, h.rd, h.ra, h.rcode);
/* bug 660 says we treat negative response as an error
* and retry, which is, eh, an error. :)
* We were incurring long delays because of this. */
if (h.rcode == NXDOMAIN || h.rcode == SERVFAIL) {
/* if possible, try next search domain */
if (!ends_with_dot) {
DPRINTF("variant:%d sdomains:%d\n", variant, sdomains);
if (variant < sdomains - 1) {
/* next search domain */
variant++;
continue;
}
/* no more search domains to try */
}
if (h.rcode != SERVFAIL) {
/* dont loop, this is "no such host" situation */
h_errno = HOST_NOT_FOUND;
goto fail1;
}
}
/* Insert other non-fatal errors here, which do not warrant
* switching to next nameserver */
/* Strange error, assuming this nameserver is feeling bad */
if (h.rcode != 0)
goto try_next_server;
/* Code below won't work correctly with h.ancount == 0, so... */
if (h.ancount <= 0) {
h_errno = NO_DATA; /* [is this correct code to check for?] */
goto fail1;
}
pos = HFIXEDSZ;
for (j = 0; j < h.qdcount; j++) {
DPRINTF("Skipping question %d at %d\n", j, pos);
i = __length_question(packet + pos, packet_len - pos);
if (i < 0) {
DPRINTF("Packet'question section "
"is truncated, trying next server\n");
goto try_next_server;
}
pos += i;
DPRINTF("Length of question %d is %d\n", j, i);
}
DPRINTF("Decoding answer at pos %d\n", pos);
first_answer = 1;
a->dotted = NULL;
for (j = 0; j < h.ancount; j++) {
i = __decode_answer(packet, pos, packet_len, &ma);
if (i < 0) {
DPRINTF("failed decode %d\n", i);
/* If the message was truncated but we have
* decoded some answers, pretend it's OK */
if (j && h.tc)
break;
goto try_next_server;
}
pos += i;
if (first_answer) {
ma.buf = a->buf;
ma.buflen = a->buflen;
ma.add_count = a->add_count;
free(a->dotted);
memcpy(a, &ma, sizeof(ma));
if (a->atype != T_SIG && (NULL == a->buf || (type != T_A && type != T_AAAA)))
break;
if (a->atype != type)
continue;
a->add_count = h.ancount - j - 1;
if ((a->rdlength + sizeof(struct in_addr*)) * a->add_count > a->buflen)
break;
a->add_count = 0;
first_answer = 0;
} else {
free(ma.dotted);
if (ma.atype != type)
continue;
if (a->rdlength != ma.rdlength) {
free(a->dotted);
DPRINTF("Answer address len(%u) differs from original(%u)\n",
ma.rdlength, a->rdlength);
goto try_next_server;
}
memcpy(a->buf + (a->add_count * ma.rdlength), ma.rdata, ma.rdlength);
++a->add_count;
}
}
/* Success! */
DPRINTF("Answer name = |%s|\n", a->dotted);
DPRINTF("Answer type = |%d|\n", a->atype);
if (fd != -1)
close(fd);
if (outpacket)
*outpacket = packet;
else
free(packet);
free(lookup);
return packet_len;
try_next_server:
/* Try next nameserver */
retries_left--;
local_ns_num++;
variant = -1;
} while (retries_left > 0);
fail:
h_errno = NETDB_INTERNAL;
fail1:
if (fd != -1)
close(fd);
free(lookup);
free(packet);
return -1;
}
#endif /* L_dnslookup */
#ifdef L_read_etc_hosts_r
parser_t * __open_etc_hosts(void)
{
parser_t *parser;
parser = config_open("/etc/hosts");
#ifdef FALLBACK_TO_CONFIG_RESOLVCONF
if (parser == NULL)
parser = config_open("/etc/config/hosts");
#endif
return parser;
}
#define MINTOKENS 2 /* ip address + canonical name */
#define MAXTOKENS (MINTOKENS + MAXALIASES)
#define HALISTOFF (sizeof(char*) * (MAXTOKENS + 1)) /* reserve space for list terminator */
#define INADDROFF (HALISTOFF + 2 * sizeof(char*))
int __read_etc_hosts_r(
parser_t * parser,
const char *name,
int type,
enum etc_hosts_action action,
struct hostent *result_buf,
char *buf, size_t buflen,
struct hostent **result,
int *h_errnop)
{
char **tok = NULL;
struct in_addr *h_addr0 = NULL;
const size_t aliaslen = INADDROFF +
#ifdef __UCLIBC_HAS_IPV6__
sizeof(struct in6_addr)
#else
sizeof(struct in_addr)
#endif
;
int ret = HOST_NOT_FOUND;
/* make sure pointer is aligned */
int i = ALIGN_BUFFER_OFFSET(buf);
buf += i;
buflen -= i;
*h_errnop = NETDB_INTERNAL;
if (/* (ssize_t)buflen < 0 || */ buflen < aliaslen
|| (buflen - aliaslen) < BUFSZ + 1)
return ERANGE;
if (parser == NULL)
parser = __open_etc_hosts();
if (parser == NULL) {
*result = NULL;
return errno;
}
/* Layout in buf:
* char *alias[MAXTOKENS] = {address, name, aliases...}
* char **h_addr_list[1] = {*in[6]_addr, NULL}
* struct in[6]_addr
* char line_buffer[BUFSZ+];
*/
parser->data = buf;
parser->data_len = aliaslen;
parser->line_len = buflen - aliaslen;
*h_errnop = HOST_NOT_FOUND;
/* <ip>[[:space:]][<aliases>] */
while (config_read(parser, &tok, MAXTOKENS, MINTOKENS, "# \t", PARSE_NORMAL)) {
result_buf->h_aliases = tok+1;
if (action == GETHOSTENT) {
/* Return whatever the next entry happens to be. */
;
} else if (action == GET_HOSTS_BYADDR) {
if (strcmp(name, *tok) != 0)
continue;
} else { /* GET_HOSTS_BYNAME */
int aliases = 0;
char **alias = tok + 1;
while (aliases < MAXALIASES) {
char *tmp = *(alias+aliases++);
if (tmp && strcasecmp(name, tmp) == 0)
goto found;
}
continue;
}
found:
result_buf->h_name = *(result_buf->h_aliases++);
result_buf->h_addr_list = (char**)(buf + HALISTOFF);
*(result_buf->h_addr_list + 1) = '\0';
h_addr0 = (struct in_addr*)(buf + INADDROFF);
result_buf->h_addr = (char*)h_addr0;
if (0) /* nothing */;
#ifdef __UCLIBC_HAS_IPV4__
else if (type == AF_INET
&& inet_pton(AF_INET, *tok, h_addr0) > 0) {
DPRINTF("Found INET\n");
result_buf->h_addrtype = AF_INET;
result_buf->h_length = sizeof(struct in_addr);
*result = result_buf;
ret = NETDB_SUCCESS;
}
#endif
#ifdef __UCLIBC_HAS_IPV6__
#define in6 ((struct in6_addr *)buf)
else if (type == AF_INET6
&& inet_pton(AF_INET6, *tok, h_addr0) > 0) {
DPRINTF("Found INET6\n");
result_buf->h_addrtype = AF_INET6;
result_buf->h_length = sizeof(struct in6_addr);
*result = result_buf;
ret = NETDB_SUCCESS;
}
#endif
else {
/* continue parsing in the hope the user has multiple
* host types listed in the database like so:
* <ipv4 addr> host
* <ipv6 addr> host
* If looking for an IPv6 addr, don't bail when we got the IPv4
*/
DPRINTF("Error: Found host but different address family\n");
/* NB: gethostbyname2_r depends on this feature
* to avoid looking for IPv6 addr of "localhost" etc */
ret = TRY_AGAIN;
continue;
}
break;
}
if (action != GETHOSTENT)
config_close(parser);
return ret;
#undef in6
}
#endif /* L_read_etc_hosts_r */
#ifdef L_get_hosts_byname_r
int __get_hosts_byname_r(const char *name,
int type,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop)
{
return __read_etc_hosts_r(NULL, name, type, GET_HOSTS_BYNAME,
result_buf, buf, buflen, result, h_errnop);
}
#endif /* L_get_hosts_byname_r */
#ifdef L_get_hosts_byaddr_r
int __get_hosts_byaddr_r(const char *addr,
int len,
int type,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop)
{
#ifndef __UCLIBC_HAS_IPV6__
char ipaddr[INET_ADDRSTRLEN];
#else
char ipaddr[INET6_ADDRSTRLEN];
#endif
switch (type) {
#ifdef __UCLIBC_HAS_IPV4__
case AF_INET:
if (len != sizeof(struct in_addr))
return 0;
break;
#endif
#ifdef __UCLIBC_HAS_IPV6__
case AF_INET6:
if (len != sizeof(struct in6_addr))
return 0;
break;
#endif
default:
return 0;
}
inet_ntop(type, addr, ipaddr, sizeof(ipaddr));
return __read_etc_hosts_r(NULL, ipaddr, type, GET_HOSTS_BYADDR,
result_buf, buf, buflen, result, h_errnop);
}
#endif /* L_get_hosts_byaddr_r */
#ifdef L_getnameinfo
int getnameinfo(const struct sockaddr *sa,
socklen_t addrlen,
char *host,
socklen_t hostlen,
char *serv,
socklen_t servlen,
unsigned flags)
{
int serrno = errno;
bool ok = 0;
struct hostent *hoste = NULL;
char domain[256];
if (flags & ~(NI_NUMERICHOST|NI_NUMERICSERV|NI_NOFQDN|NI_NAMEREQD|NI_DGRAM))
return EAI_BADFLAGS;
if (sa == NULL || addrlen < sizeof(sa_family_t))
return EAI_FAMILY;
if (sa->sa_family == AF_LOCAL) /* valid */;
#ifdef __UCLIBC_HAS_IPV4__
else if (sa->sa_family == AF_INET) {
if (addrlen < sizeof(struct sockaddr_in))
return EAI_FAMILY;
}
#endif
#ifdef __UCLIBC_HAS_IPV6__
else if (sa->sa_family == AF_INET6) {
if (addrlen < sizeof(struct sockaddr_in6))
return EAI_FAMILY;
}
#endif
else
return EAI_FAMILY;
if (host != NULL && hostlen > 0)
switch (sa->sa_family) {
case AF_INET:
#ifdef __UCLIBC_HAS_IPV6__
case AF_INET6:
#endif
if (!(flags & NI_NUMERICHOST)) {
if (0) /* nothing */;
#ifdef __UCLIBC_HAS_IPV6__
else if (sa->sa_family == AF_INET6)
hoste = gethostbyaddr((const void *)
&(((const struct sockaddr_in6 *) sa)->sin6_addr),
sizeof(struct in6_addr), AF_INET6);
#endif
#ifdef __UCLIBC_HAS_IPV4__
else
hoste = gethostbyaddr((const void *)
&(((const struct sockaddr_in *)sa)->sin_addr),
sizeof(struct in_addr), AF_INET);
#endif
if (hoste) {
char *c;
if ((flags & NI_NOFQDN)
&& (getdomainname(domain, sizeof(domain)) == 0)
&& (c = strstr(hoste->h_name, domain)) != NULL
&& (c != hoste->h_name) && (*(--c) == '.')
) {
strncpy(host, hoste->h_name,
MIN(hostlen, (size_t) (c - hoste->h_name)));
host[MIN(hostlen - 1, (size_t) (c - hoste->h_name))] = '\0';
} else {
strncpy(host, hoste->h_name, hostlen);
}
ok = 1;
}
}
if (!ok) {
const char *c = NULL;
if (flags & NI_NAMEREQD) {
errno = serrno;
return EAI_NONAME;
}
if (0) /* nothing */;
#ifdef __UCLIBC_HAS_IPV6__
else if (sa->sa_family == AF_INET6) {
const struct sockaddr_in6 *sin6p;
sin6p = (const struct sockaddr_in6 *) sa;
c = inet_ntop(AF_INET6,
(const void *) &sin6p->sin6_addr,
host, hostlen);
#if 0
/* Does scope id need to be supported? */
uint32_t scopeid;
scopeid = sin6p->sin6_scope_id;
if (scopeid != 0) {
/* Buffer is >= IFNAMSIZ+1. */
char scopebuf[IFNAMSIZ + 1];
char *scopeptr;
int ni_numericscope = 0;
size_t real_hostlen = strnlen(host, hostlen);
size_t scopelen = 0;
scopebuf[0] = SCOPE_DELIMITER;
scopebuf[1] = '\0';
scopeptr = &scopebuf[1];
if (IN6_IS_ADDR_LINKLOCAL(&sin6p->sin6_addr)
|| IN6_IS_ADDR_MC_LINKLOCAL(&sin6p->sin6_addr)) {
if (if_indextoname(scopeid, scopeptr) == NULL)
++ni_numericscope;
else
scopelen = strlen(scopebuf);
} else {
++ni_numericscope;
}
if (ni_numericscope)
scopelen = 1 + snprintf(scopeptr,
(scopebuf
+ sizeof scopebuf
- scopeptr),
"%u", scopeid);
if (real_hostlen + scopelen + 1 > hostlen)
return EAI_SYSTEM;
memcpy(host + real_hostlen, scopebuf, scopelen + 1);
}
#endif
}
#endif /* __UCLIBC_HAS_IPV6__ */
#if defined __UCLIBC_HAS_IPV4__
else {
c = inet_ntop(AF_INET, (const void *)
&(((const struct sockaddr_in *) sa)->sin_addr),
host, hostlen);
}
#endif
if (c == NULL) {
errno = serrno;
return EAI_SYSTEM;
}
ok = 1;
}
break;
case AF_LOCAL:
if (!(flags & NI_NUMERICHOST)) {
struct utsname utsname;
if (!uname(&utsname)) {
strncpy(host, utsname.nodename, hostlen);
break;
};
};
if (flags & NI_NAMEREQD) {
errno = serrno;
return EAI_NONAME;
}
strncpy(host, "localhost", hostlen);
break;
/* Already checked above
default:
return EAI_FAMILY;
*/
}
if (serv && (servlen > 0)) {
if (sa->sa_family == AF_LOCAL) {
strncpy(serv, ((const struct sockaddr_un *) sa)->sun_path, servlen);
} else { /* AF_INET || AF_INET6 */
if (!(flags & NI_NUMERICSERV)) {
struct servent *s;
s = getservbyport(((const struct sockaddr_in *) sa)->sin_port,
((flags & NI_DGRAM) ? "udp" : "tcp"));
if (s) {
strncpy(serv, s->s_name, servlen);
goto DONE;
}
}
snprintf(serv, servlen, "%d",
ntohs(((const struct sockaddr_in *) sa)->sin_port));
}
}
DONE:
if (host && (hostlen > 0))
host[hostlen-1] = 0;
if (serv && (servlen > 0))
serv[servlen-1] = 0;
errno = serrno;
return 0;
}
libc_hidden_def(getnameinfo)
#endif /* L_getnameinfo */
#ifdef L_gethostbyname_r
/* Bug 671 says:
* "uClibc resolver's gethostbyname does not return the requested name
* as an alias, but instead returns the canonical name. glibc's
* gethostbyname has a similar bug where it returns the requested name
* with the search domain name appended (to make a FQDN) as an alias,
* but not the original name itself. Both contradict POSIX, which says
* that the name argument passed to gethostbyname must be in the alias list"
* This is fixed now, and we differ from glibc:
*
* $ ./gethostbyname_uclibc wer.google.com
* h_name:'c13-ss-2-lb.cnet.com'
* h_length:4
* h_addrtype:2 AF_INET
* alias:'wer.google.com' <===
* addr: 0x4174efd8 '216.239.116.65'
*
* $ ./gethostbyname_glibc wer.google.com
* h_name:'c13-ss-2-lb.cnet.com'
* h_length:4
* h_addrtype:2 AF_INET
* alias:'wer.google.com.com' <===
* addr:'216.239.116.65'
*
* When examples were run, /etc/resolv.conf contained "search com" line.
*/
int gethostbyname_r(const char *name,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop)
{
struct in_addr **addr_list;
char **alias;
char *alias0;
unsigned char *packet;
struct resolv_answer a;
int i;
int packet_len;
int wrong_af = 0;
*result = NULL;
if (!name)
return EINVAL;
/* do /etc/hosts first */
{
int old_errno = errno; /* save the old errno and reset errno */
__set_errno(0); /* to check for missing /etc/hosts. */
i = __get_hosts_byname_r(name, AF_INET, result_buf,
buf, buflen, result, h_errnop);
if (i == NETDB_SUCCESS) {
__set_errno(old_errno);
return i;
}
switch (*h_errnop) {
case HOST_NOT_FOUND:
wrong_af = (i == TRY_AGAIN);
case NO_ADDRESS:
break;
case NETDB_INTERNAL:
if (errno == ENOENT) {
break;
}
/* else fall through */
default:
return i;
}
__set_errno(old_errno);
}
DPRINTF("Nothing found in /etc/hosts\n");
*h_errnop = NETDB_INTERNAL;
/* prepare future h_aliases[0] */
i = strlen(name) + 1;
if ((ssize_t)buflen <= i)
return ERANGE;
memcpy(buf, name, i); /* paranoia: name might change */
alias0 = buf;
buf += i;
buflen -= i;
/* make sure pointer is aligned */
i = ALIGN_BUFFER_OFFSET(buf);
buf += i;
buflen -= i;
/* Layout in buf:
* char *alias[2];
* struct in_addr* addr_list[NN+1];
* struct in_addr* in[NN];
*/
alias = (char **)buf;
buf += sizeof(alias[0]) * 2;
buflen -= sizeof(alias[0]) * 2;
addr_list = (struct in_addr **)buf;
/* buflen may be < 0, must do signed compare */
if ((ssize_t)buflen < 256)
return ERANGE;
/* we store only one "alias" - the name itself */
alias[0] = alias0;
alias[1] = NULL;
/* maybe it is already an address? */
{
struct in_addr *in = (struct in_addr *)(buf + sizeof(addr_list[0]) * 2);
if (inet_aton(name, in)) {
addr_list[0] = in;
addr_list[1] = NULL;
result_buf->h_name = alias0;
result_buf->h_aliases = alias;
result_buf->h_addrtype = AF_INET;
result_buf->h_length = sizeof(struct in_addr);
result_buf->h_addr_list = (char **) addr_list;
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
return NETDB_SUCCESS;
}
}
/* what if /etc/hosts has it but it's not IPv4?
* F.e. "::1 localhost6". We don't do DNS query for such hosts -
* "ping localhost6" should be fast even if DNS server is down! */
if (wrong_af) {
*h_errnop = HOST_NOT_FOUND;
return TRY_AGAIN;
}
/* talk to DNS servers */
a.buf = buf;
/* take into account that at least one address will be there,
* we'll need space for one in_addr + two addr_list[] elems */
a.buflen = buflen - ((sizeof(addr_list[0]) * 2 + sizeof(struct in_addr)));
a.add_count = 0;
packet_len = __dns_lookup(name, T_A, &packet, &a);
if (packet_len < 0) {
*h_errnop = HOST_NOT_FOUND;
DPRINTF("__dns_lookup returned < 0\n");
return TRY_AGAIN;
}
if (a.atype == T_A) { /* ADDRESS */
/* we need space for addr_list[] and one IPv4 address */
/* + 1 accounting for 1st addr (it's in a.rdata),
* another + 1 for NULL in last addr_list[]: */
int need_bytes = sizeof(addr_list[0]) * (a.add_count + 1 + 1)
/* for 1st addr (it's in a.rdata): */
+ sizeof(struct in_addr);
/* how many bytes will 2nd and following addresses take? */
int ips_len = a.add_count * a.rdlength;
buflen -= (need_bytes + ips_len);
if ((ssize_t)buflen < 0) {
DPRINTF("buffer too small for all addresses\n");
/* *h_errnop = NETDB_INTERNAL; - already is */
i = ERANGE;
goto free_and_ret;
}
/* if there are additional addresses in buf,
* move them forward so that they are not destroyed */
DPRINTF("a.add_count:%d a.rdlength:%d a.rdata:%p\n", a.add_count, a.rdlength, a.rdata);
memmove(buf + need_bytes, buf, ips_len);
/* 1st address is in a.rdata, insert it */
buf += need_bytes - sizeof(struct in_addr);
memcpy(buf, a.rdata, sizeof(struct in_addr));
/* fill addr_list[] */
for (i = 0; i <= a.add_count; i++) {
addr_list[i] = (struct in_addr*)buf;
buf += sizeof(struct in_addr);
}
addr_list[i] = NULL;
/* if we have enough space, we can report "better" name
* (it may contain search domains attached by __dns_lookup,
* or CNAME of the host if it is different from the name
* we used to find it) */
if (a.dotted && buflen > strlen(a.dotted)) {
strcpy(buf, a.dotted);
alias0 = buf;
}
result_buf->h_name = alias0;
result_buf->h_aliases = alias;
result_buf->h_addrtype = AF_INET;
result_buf->h_length = sizeof(struct in_addr);
result_buf->h_addr_list = (char **) addr_list;
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
i = NETDB_SUCCESS;
goto free_and_ret;
}
*h_errnop = HOST_NOT_FOUND;
__set_h_errno(HOST_NOT_FOUND);
i = TRY_AGAIN;
free_and_ret:
free(a.dotted);
free(packet);
return i;
}
libc_hidden_def(gethostbyname_r)
#endif /* L_gethostbyname_r */
#ifdef L_gethostbyname2_r
int gethostbyname2_r(const char *name,
int family,
struct hostent *result_buf,
char *buf,
size_t buflen,
struct hostent **result,
int *h_errnop)
{
#ifndef __UCLIBC_HAS_IPV6__
return family == (AF_INET)
? gethostbyname_r(name, result_buf, buf, buflen, result, h_errnop)
: HOST_NOT_FOUND;
#else
struct in6_addr **addr_list;
char **alias;
char *alias0;
unsigned char *packet;
struct resolv_answer a;
int i;
int packet_len;
int wrong_af = 0;
if (family == AF_INET)
return gethostbyname_r(name, result_buf, buf, buflen, result, h_errnop);
*result = NULL;
if (family != AF_INET6)
return EINVAL;
if (!name)
return EINVAL;
/* do /etc/hosts first */
{
int old_errno = errno; /* save the old errno and reset errno */
__set_errno(0); /* to check for missing /etc/hosts. */
i = __get_hosts_byname_r(name, AF_INET6 /*family*/, result_buf,
buf, buflen, result, h_errnop);
if (i == NETDB_SUCCESS) {
__set_errno(old_errno);
return i;
}
switch (*h_errnop) {
case HOST_NOT_FOUND:
wrong_af = (i == TRY_AGAIN);
case NO_ADDRESS:
break;
case NETDB_INTERNAL:
if (errno == ENOENT) {
break;
}
/* else fall through */
default:
return i;
}
__set_errno(old_errno);
}
DPRINTF("Nothing found in /etc/hosts\n");
*h_errnop = NETDB_INTERNAL;
/* prepare future h_aliases[0] */
i = strlen(name) + 1;
if ((ssize_t)buflen <= i)
return ERANGE;
memcpy(buf, name, i); /* paranoia: name might change */
alias0 = buf;
buf += i;
buflen -= i;
/* make sure pointer is aligned */
i = ALIGN_BUFFER_OFFSET(buf);
buf += i;
buflen -= i;
/* Layout in buf:
* char *alias[2];
* struct in6_addr* addr_list[NN+1];
* struct in6_addr* in[NN];
*/
alias = (char **)buf;
buf += sizeof(alias[0]) * 2;
buflen -= sizeof(alias[0]) * 2;
addr_list = (struct in6_addr **)buf;
/* buflen may be < 0, must do signed compare */
if ((ssize_t)buflen < 256)
return ERANGE;
/* we store only one "alias" - the name itself */
alias[0] = alias0;
alias[1] = NULL;
/* maybe it is already an address? */
{
struct in6_addr *in = (struct in6_addr *)(buf + sizeof(addr_list[0]) * 2);
if (inet_pton(AF_INET6, name, in)) {
addr_list[0] = in;
addr_list[1] = NULL;
result_buf->h_name = alias0;
result_buf->h_aliases = alias;
result_buf->h_addrtype = AF_INET6;
result_buf->h_length = sizeof(struct in6_addr);
result_buf->h_addr_list = (char **) addr_list;
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
return NETDB_SUCCESS;
}
}
/* what if /etc/hosts has it but it's not IPv6?
* F.e. "127.0.0.1 localhost". We don't do DNS query for such hosts -
* "ping localhost" should be fast even if DNS server is down! */
if (wrong_af) {
*h_errnop = HOST_NOT_FOUND;
return TRY_AGAIN;
}
/* talk to DNS servers */
a.buf = buf;
/* take into account that at least one address will be there,
* we'll need space of one in6_addr + two addr_list[] elems */
a.buflen = buflen - ((sizeof(addr_list[0]) * 2 + sizeof(struct in6_addr)));
a.add_count = 0;
packet_len = __dns_lookup(name, T_AAAA, &packet, &a);
if (packet_len < 0) {
*h_errnop = HOST_NOT_FOUND;
DPRINTF("__dns_lookup returned < 0\n");
return TRY_AGAIN;
}
if (a.atype == T_AAAA) { /* ADDRESS */
/* we need space for addr_list[] and one IPv6 address */
/* + 1 accounting for 1st addr (it's in a.rdata),
* another + 1 for NULL in last addr_list[]: */
int need_bytes = sizeof(addr_list[0]) * (a.add_count + 1 + 1)
/* for 1st addr (it's in a.rdata): */
+ sizeof(struct in6_addr);
/* how many bytes will 2nd and following addresses take? */
int ips_len = a.add_count * a.rdlength;
buflen -= (need_bytes + ips_len);
if ((ssize_t)buflen < 0) {
DPRINTF("buffer too small for all addresses\n");
/* *h_errnop = NETDB_INTERNAL; - already is */
i = ERANGE;
goto free_and_ret;
}
/* if there are additional addresses in buf,
* move them forward so that they are not destroyed */
DPRINTF("a.add_count:%d a.rdlength:%d a.rdata:%p\n", a.add_count, a.rdlength, a.rdata);
memmove(buf + need_bytes, buf, ips_len);
/* 1st address is in a.rdata, insert it */
buf += need_bytes - sizeof(struct in6_addr);
memcpy(buf, a.rdata, sizeof(struct in6_addr));
/* fill addr_list[] */
for (i = 0; i <= a.add_count; i++) {
addr_list[i] = (struct in6_addr*)buf;
buf += sizeof(struct in6_addr);
}
addr_list[i] = NULL;
/* if we have enough space, we can report "better" name
* (it may contain search domains attached by __dns_lookup,
* or CNAME of the host if it is different from the name
* we used to find it) */
if (a.dotted && buflen > strlen(a.dotted)) {
strcpy(buf, a.dotted);
alias0 = buf;
}
result_buf->h_name = alias0;
result_buf->h_aliases = alias;
result_buf->h_addrtype = AF_INET6;
result_buf->h_length = sizeof(struct in6_addr);
result_buf->h_addr_list = (char **) addr_list;
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
i = NETDB_SUCCESS;
goto free_and_ret;
}
*h_errnop = HOST_NOT_FOUND;
__set_h_errno(HOST_NOT_FOUND);
i = TRY_AGAIN;
free_and_ret:
free(a.dotted);
free(packet);
return i;
#endif /* __UCLIBC_HAS_IPV6__ */
}
libc_hidden_def(gethostbyname2_r)
#endif /* L_gethostbyname2_r */
#ifdef L_gethostbyaddr_r
int gethostbyaddr_r(const void *addr, socklen_t addrlen,
int type,
struct hostent *result_buf,
char *buf, size_t buflen,
struct hostent **result,
int *h_errnop)
{
struct in_addr *in;
struct in_addr **addr_list;
char **alias;
unsigned char *packet;
struct resolv_answer a;
int i;
int packet_len;
int nest = 0;
*result = NULL;
if (!addr)
return EINVAL;
switch (type) {
#ifdef __UCLIBC_HAS_IPV4__
case AF_INET:
if (addrlen != sizeof(struct in_addr))
return EINVAL;
break;
#endif
#ifdef __UCLIBC_HAS_IPV6__
case AF_INET6:
if (addrlen != sizeof(struct in6_addr))
return EINVAL;
break;
#endif
default:
return EINVAL;
}
/* do /etc/hosts first */
i = __get_hosts_byaddr_r(addr, addrlen, type, result_buf,
buf, buflen, result, h_errnop);
if (i == 0)
return i;
switch (*h_errnop) {
case HOST_NOT_FOUND:
case NO_ADDRESS:
break;
default:
return i;
}
*h_errnop = NETDB_INTERNAL;
/* make sure pointer is aligned */
i = ALIGN_BUFFER_OFFSET(buf);
buf += i;
buflen -= i;
/* Layout in buf:
* char *alias[ALIAS_DIM];
* struct in[6]_addr* addr_list[2];
* struct in[6]_addr in;
* char scratch_buffer[256+];
*/
#define in6 ((struct in6_addr *)in)
alias = (char **)buf;
addr_list = (struct in_addr**)buf;
buf += sizeof(*addr_list) * 2;
buflen -= sizeof(*addr_list) * 2;
in = (struct in_addr*)buf;
#ifndef __UCLIBC_HAS_IPV6__
buf += sizeof(*in);
buflen -= sizeof(*in);
if (addrlen > sizeof(*in))
return ERANGE;
#else
buf += sizeof(*in6);
buflen -= sizeof(*in6);
if (addrlen > sizeof(*in6))
return ERANGE;
#endif
if ((ssize_t)buflen < 256)
return ERANGE;
alias[0] = buf;
alias[1] = NULL;
addr_list[0] = in;
addr_list[1] = NULL;
memcpy(in, addr, addrlen);
if (0) /* nothing */;
#ifdef __UCLIBC_HAS_IPV4__
else IF_HAS_BOTH(if (type == AF_INET)) {
unsigned char *tp = (unsigned char *)addr;
sprintf(buf, "%u.%u.%u.%u.in-addr.arpa",
tp[3], tp[2], tp[1], tp[0]);
}
#endif
#ifdef __UCLIBC_HAS_IPV6__
else {
char *dst = buf;
unsigned char *tp = (unsigned char *)addr + addrlen - 1;
do {
dst += sprintf(dst, "%x.%x.", tp[0] & 0xf, tp[0] >> 4);
tp--;
} while (tp >= (unsigned char *)addr);
strcpy(dst, "ip6.arpa");
}
#endif
memset(&a, '\0', sizeof(a));
for (;;) {
/* Hmm why we memset(a) to zeros only once? */
packet_len = __dns_lookup(buf, T_PTR, &packet, &a);
if (packet_len < 0) {
*h_errnop = HOST_NOT_FOUND;
return TRY_AGAIN;
}
strncpy(buf, a.dotted, buflen);
free(a.dotted);
if (a.atype != T_CNAME)
break;
DPRINTF("Got a CNAME in gethostbyaddr()\n");
if (++nest > MAX_RECURSE) {
*h_errnop = NO_RECOVERY;
return -1;
}
/* Decode CNAME into buf, feed it to __dns_lookup() again */
i = __decode_dotted(packet, a.rdoffset, packet_len, buf, buflen);
free(packet);
if (i < 0) {
*h_errnop = NO_RECOVERY;
return -1;
}
}
if (a.atype == T_PTR) { /* ADDRESS */
i = __decode_dotted(packet, a.rdoffset, packet_len, buf, buflen);
free(packet);
result_buf->h_name = buf;
result_buf->h_addrtype = type;
result_buf->h_length = addrlen;
result_buf->h_addr_list = (char **) addr_list;
result_buf->h_aliases = alias;
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
return NETDB_SUCCESS;
}
free(packet);
*h_errnop = NO_ADDRESS;
return TRY_AGAIN;
#undef in6
}
libc_hidden_def(gethostbyaddr_r)
#endif /* L_gethostbyaddr_r */
#ifdef L_gethostent_r
__UCLIBC_MUTEX_STATIC(mylock, PTHREAD_MUTEX_INITIALIZER);
static parser_t *hostp = NULL;
static smallint host_stayopen;
void endhostent_unlocked(void)
{
if (hostp) {
config_close(hostp);
hostp = NULL;
}
host_stayopen = 0;
}
void endhostent(void)
{
__UCLIBC_MUTEX_LOCK(mylock);
endhostent_unlocked();
__UCLIBC_MUTEX_UNLOCK(mylock);
}
void sethostent(int stay_open)
{
__UCLIBC_MUTEX_LOCK(mylock);
if (stay_open)
host_stayopen = 1;
__UCLIBC_MUTEX_UNLOCK(mylock);
}
int gethostent_r(struct hostent *result_buf, char *buf, size_t buflen,
struct hostent **result, int *h_errnop)
{
int ret;
__UCLIBC_MUTEX_LOCK(mylock);
if (hostp == NULL) {
hostp = __open_etc_hosts();
if (hostp == NULL) {
*result = NULL;
ret = TRY_AGAIN;
goto DONE;
}
}
ret = __read_etc_hosts_r(hostp, NULL, AF_INET, GETHOSTENT,
result_buf, buf, buflen, result, h_errnop);
if (!host_stayopen)
endhostent_unlocked();
DONE:
__UCLIBC_MUTEX_UNLOCK(mylock);
return ret;
}
libc_hidden_def(gethostent_r)
#endif /* L_gethostent_r */
#ifndef __UCLIBC_HAS_IPV6__
#define GETXX_BUFSZ (sizeof(struct in_addr) + sizeof(struct in_addr *) * 2 + \
/*sizeof(char *)*ALIAS_DIM */+ 384/*namebuffer*/ + 32/* margin */)
#else
#define GETXX_BUFSZ (sizeof(struct in6_addr) + sizeof(struct in6_addr *) * 2 + \
/*sizeof(char *)*ALIAS_DIM */+ 384/*namebuffer*/ + 32/* margin */)
#endif /* __UCLIBC_HAS_IPV6__ */
#define __INIT_GETXX_BUF(sz) \
if (buf == NULL) \
buf = (char *)__uc_malloc((sz));
#ifdef L_gethostent
struct hostent *gethostent(void)
{
static struct hostent hoste;
static char *buf = NULL;
struct hostent *host = NULL;
#ifndef __UCLIBC_HAS_IPV6__
#define HOSTENT_BUFSZ (sizeof(struct in_addr) + sizeof(struct in_addr *) * 2 + \
sizeof(char *)*ALIAS_DIM + BUFSZ /*namebuffer*/ + 2 /* margin */)
#else
#define HOSTENT_BUFSZ (sizeof(struct in6_addr) + sizeof(struct in6_addr *) * 2 + \
sizeof(char *)*ALIAS_DIM + BUFSZ /*namebuffer*/ + 2 /* margin */)
#endif /* __UCLIBC_HAS_IPV6__ */
__INIT_GETXX_BUF(HOSTENT_BUFSZ);
gethostent_r(&hoste, buf, HOSTENT_BUFSZ, &host, &h_errno);
return host;
}
#undef HOSTENT_BUFSZ
#endif /* L_gethostent */
#ifdef L_gethostbyname2
struct hostent *gethostbyname2(const char *name, int family)
{
static struct hostent hoste;
static char *buf = NULL;
struct hostent *hp;
__INIT_GETXX_BUF(GETXX_BUFSZ);
#ifndef __UCLIBC_HAS_IPV6__
if (family != AF_INET)
return (struct hostent*)NULL;
gethostbyname_r(name, &hoste, buf, GETXX_BUFSZ, &hp, &h_errno);
#else
gethostbyname2_r(name, family, &hoste, buf, GETXX_BUFSZ, &hp, &h_errno);
#endif /* __UCLIBC_HAS_IPV6__ */
return hp;
}
libc_hidden_def(gethostbyname2)
#endif /* L_gethostbyname2 */
#ifdef L_gethostbyname
struct hostent *gethostbyname(const char *name)
{
return gethostbyname2(name, AF_INET);
}
libc_hidden_def(gethostbyname)
#endif /* L_gethostbyname */
#ifdef L_gethostbyaddr
struct hostent *gethostbyaddr(const void *addr, socklen_t len, int type)
{
static struct hostent hoste;
static char *buf = NULL;
struct hostent *hp;
__INIT_GETXX_BUF(GETXX_BUFSZ);
gethostbyaddr_r(addr, len, type, &hoste, buf, GETXX_BUFSZ, &hp, &h_errno);
return hp;
}
libc_hidden_def(gethostbyaddr)
#endif /* L_gethostbyaddr */
#ifdef L_res_comp
/*
* Expand compressed domain name 'comp_dn' to full domain name.
* 'msg' is a pointer to the begining of the message,
* 'eomorig' points to the first location after the message,
* 'exp_dn' is a pointer to a buffer of size 'length' for the result.
* Return size of compressed name or -1 if there was an error.
*/
int dn_expand(const u_char *msg, const u_char *eom, const u_char *src,
char *dst, int dstsiz)
{
int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz);
if (n > 0 && dst[0] == '.')
dst[0] = '\0';
return n;
}
libc_hidden_def(dn_expand)
/*
* Pack domain name 'exp_dn' in presentation form into 'comp_dn'.
* Return the size of the compressed name or -1.
* 'length' is the size of the array pointed to by 'comp_dn'.
*/
int
dn_comp(const char *src, u_char *dst, int dstsiz,
u_char **dnptrs, u_char **lastdnptr)
{
return ns_name_compress(src, dst, (size_t) dstsiz,
(const u_char **) dnptrs,
(const u_char **) lastdnptr);
}
libc_hidden_def(dn_comp)
#endif /* L_res_comp */
#ifdef L_ns_name
/* Thinking in noninternationalized USASCII (per the DNS spec),
* is this character visible and not a space when printed ?
*/
static int printable(int ch)
{
return (ch > 0x20 && ch < 0x7f);
}
/* Thinking in noninternationalized USASCII (per the DNS spec),
* is this characted special ("in need of quoting") ?
*/
static int special(int ch)
{
switch (ch) {
case 0x22: /* '"' */
case 0x2E: /* '.' */
case 0x3B: /* ';' */
case 0x5C: /* '\\' */
/* Special modifiers in zone files. */
case 0x40: /* '@' */
case 0x24: /* '$' */
return 1;
default:
return 0;
}
}
/*
* ns_name_uncompress(msg, eom, src, dst, dstsiz)
* Expand compressed domain name to presentation format.
* return:
* Number of bytes read out of `src', or -1 (with errno set).
* note:
* Root domain returns as "." not "".
*/
int ns_name_uncompress(const u_char *msg, const u_char *eom,
const u_char *src, char *dst, size_t dstsiz)
{
u_char tmp[NS_MAXCDNAME];
int n;
n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp);
if (n == -1)
return -1;
if (ns_name_ntop(tmp, dst, dstsiz) == -1)
return -1;
return n;
}
libc_hidden_def(ns_name_uncompress)
/*
* ns_name_ntop(src, dst, dstsiz)
* Convert an encoded domain name to printable ascii as per RFC1035.
* return:
* Number of bytes written to buffer, or -1 (with errno set)
* notes:
* The root is returned as "."
* All other domains are returned in non absolute form
*/
int ns_name_ntop(const u_char *src, char *dst, size_t dstsiz)
{
const u_char *cp;
char *dn, *eom;
u_char c;
u_int n;
cp = src;
dn = dst;
eom = dst + dstsiz;
while ((n = *cp++) != 0) {
if ((n & NS_CMPRSFLGS) != 0) {
/* Some kind of compression pointer. */
__set_errno(EMSGSIZE);
return -1;
}
if (dn != dst) {
if (dn >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
*dn++ = '.';
}
if (dn + n >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
for (; n > 0; n--) {
c = *cp++;
if (special(c)) {
if (dn + 1 >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
*dn++ = '\\';
*dn++ = (char)c;
} else if (!printable(c)) {
if (dn + 3 >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
*dn++ = '\\';
*dn++ = "0123456789"[c / 100];
c = c % 100;
*dn++ = "0123456789"[c / 10];
*dn++ = "0123456789"[c % 10];
} else {
if (dn >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
*dn++ = (char)c;
}
}
}
if (dn == dst) {
if (dn >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
*dn++ = '.';
}
if (dn >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
*dn++ = '\0';
return (dn - dst);
}
libc_hidden_def(ns_name_ntop)
static int encode_bitstring(const char **bp, const char *end,
unsigned char **labelp,
unsigned char ** dst,
unsigned const char *eom)
{
int afterslash = 0;
const char *cp = *bp;
unsigned char *tp;
const char *beg_blen;
int value = 0, count = 0, tbcount = 0, blen = 0;
beg_blen = NULL;
/* a bitstring must contain at least 2 characters */
if (end - cp < 2)
return EINVAL;
/* XXX: currently, only hex strings are supported */
if (*cp++ != 'x')
return EINVAL;
if (!isxdigit((unsigned char) *cp)) /*%< reject '\[x/BLEN]' */
return EINVAL;
for (tp = *dst + 1; cp < end && tp < eom; cp++) {
unsigned char c = *cp;
switch (c) {
case ']': /*%< end of the bitstring */
if (afterslash) {
char *end_blen;
if (beg_blen == NULL)
return EINVAL;
blen = (int)strtol(beg_blen, &end_blen, 10);
if (*end_blen != ']')
return EINVAL;
}
if (count)
*tp++ = ((value << 4) & 0xff);
cp++; /*%< skip ']' */
goto done;
case '/':
afterslash = 1;
break;
default:
if (afterslash) {
if (!__isdigit_char(c))
return EINVAL;
if (beg_blen == NULL) {
if (c == '0') {
/* blen never begings with 0 */
return EINVAL;
}
beg_blen = cp;
}
} else {
if (!__isdigit_char(c)) {
c = c | 0x20; /* lowercase */
c = c - 'a';
if (c > 5) /* not a-f? */
return EINVAL;
c += 10 + '0';
}
value <<= 4;
value += (c - '0');
count += 4;
tbcount += 4;
if (tbcount > 256)
return EINVAL;
if (count == 8) {
*tp++ = value;
count = 0;
}
}
break;
}
}
done:
if (cp >= end || tp >= eom)
return EMSGSIZE;
/*
* bit length validation:
* If a <length> is present, the number of digits in the <bit-data>
* MUST be just sufficient to contain the number of bits specified
* by the <length>. If there are insignificant bits in a final
* hexadecimal or octal digit, they MUST be zero.
* RFC2673, Section 3.2.
*/
if (blen > 0) {
int traillen;
if (((blen + 3) & ~3) != tbcount)
return EINVAL;
traillen = tbcount - blen; /*%< between 0 and 3 */
if (((value << (8 - traillen)) & 0xff) != 0)
return EINVAL;
}
else
blen = tbcount;
if (blen == 256)
blen = 0;
/* encode the type and the significant bit fields */
**labelp = DNS_LABELTYPE_BITSTRING;
**dst = blen;
*bp = cp;
*dst = tp;
return 0;
}
int ns_name_pton(const char *src, u_char *dst, size_t dstsiz)
{
static const char digits[] = "0123456789";
u_char *label, *bp, *eom;
int c, n, escaped, e = 0;
char *cp;
escaped = 0;
bp = dst;
eom = dst + dstsiz;
label = bp++;
while ((c = *src++) != 0) {
if (escaped) {
if (c == '[') { /*%< start a bit string label */
cp = strchr(src, ']');
if (cp == NULL) {
errno = EINVAL; /*%< ??? */
return -1;
}
e = encode_bitstring(&src, cp + 2,
&label, &bp, eom);
if (e != 0) {
errno = e;
return -1;
}
escaped = 0;
label = bp++;
c = *src++;
if (c == '\0')
goto done;
if (c != '.') {
errno = EINVAL;
return -1;
}
continue;
}
cp = strchr(digits, c);
if (cp != NULL) {
n = (cp - digits) * 100;
c = *src++;
if (c == '\0')
goto ret_EMSGSIZE;
cp = strchr(digits, c);
if (cp == NULL)
goto ret_EMSGSIZE;
n += (cp - digits) * 10;
c = *src++;
if (c == '\0')
goto ret_EMSGSIZE;
cp = strchr(digits, c);
if (cp == NULL)
goto ret_EMSGSIZE;
n += (cp - digits);
if (n > 255)
goto ret_EMSGSIZE;
c = n;
}
escaped = 0;
} else if (c == '\\') {
escaped = 1;
continue;
} else if (c == '.') {
c = (bp - label - 1);
if ((c & NS_CMPRSFLGS) != 0) { /*%< Label too big. */
goto ret_EMSGSIZE;
}
if (label >= eom) {
goto ret_EMSGSIZE;
}
*label = c;
/* Fully qualified ? */
if (*src == '\0') {
if (c != 0) {
if (bp >= eom) {
goto ret_EMSGSIZE;
}
*bp++ = '\0';
}
if ((bp - dst) > MAXCDNAME) {
goto ret_EMSGSIZE;
}
return 1;
}
if (c == 0 || *src == '.') {
goto ret_EMSGSIZE;
}
label = bp++;
continue;
}
if (bp >= eom) {
goto ret_EMSGSIZE;
}
*bp++ = (u_char)c;
}
c = (bp - label - 1);
if ((c & NS_CMPRSFLGS) != 0) { /*%< Label too big. */
goto ret_EMSGSIZE;
}
done:
if (label >= eom) {
goto ret_EMSGSIZE;
}
*label = c;
if (c != 0) {
if (bp >= eom) {
goto ret_EMSGSIZE;
}
*bp++ = 0;
}
if ((bp - dst) > MAXCDNAME) { /*%< src too big */
goto ret_EMSGSIZE;
}
return 0;
ret_EMSGSIZE:
errno = EMSGSIZE;
return -1;
}
libc_hidden_def(ns_name_pton)
/*
* ns_name_unpack(msg, eom, src, dst, dstsiz)
* Unpack a domain name from a message, source may be compressed.
* return:
* -1 if it fails, or consumed octets if it succeeds.
*/
int ns_name_unpack(const u_char *msg, const u_char *eom, const u_char *src,
u_char *dst, size_t dstsiz)
{
const u_char *srcp, *dstlim;
u_char *dstp;
int n, len, checked;
len = -1;
checked = 0;
dstp = dst;
srcp = src;
dstlim = dst + dstsiz;
if (srcp < msg || srcp >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
/* Fetch next label in domain name. */
while ((n = *srcp++) != 0) {
/* Check for indirection. */
switch (n & NS_CMPRSFLGS) {
case 0:
/* Limit checks. */
if (dstp + n + 1 >= dstlim || srcp + n >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
checked += n + 1;
*dstp++ = n;
memcpy(dstp, srcp, n);
dstp += n;
srcp += n;
break;
case NS_CMPRSFLGS:
if (srcp >= eom) {
__set_errno(EMSGSIZE);
return -1;
}
if (len < 0)
len = srcp - src + 1;
srcp = msg + (((n & 0x3f) << 8) | (*srcp & 0xff));
if (srcp < msg || srcp >= eom) { /* Out of range. */
__set_errno(EMSGSIZE);
return -1;
}
checked += 2;
/*
* Check for loops in the compressed name;
* if we've looked at the whole message,
* there must be a loop.
*/
if (checked >= eom - msg) {
__set_errno(EMSGSIZE);
return -1;
}
break;
default:
__set_errno(EMSGSIZE);
return -1; /* flag error */
}
}
*dstp = '\0';
if (len < 0)
len = srcp - src;
return len;
}
libc_hidden_def(ns_name_unpack)
static int labellen(const unsigned char *lp)
{
unsigned bitlen;
unsigned char l = *lp;
if ((l & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
/* should be avoided by the caller */
return -1;
}
if ((l & NS_CMPRSFLGS) == NS_TYPE_ELT) {
if (l == DNS_LABELTYPE_BITSTRING) {
bitlen = lp[1];
if (bitlen == 0)
bitlen = 256;
return ((bitlen + 7 ) / 8 + 1);
}
return -1; /*%< unknwon ELT */
}
return l;
}
static int mklower(int ch)
{
if (ch >= 0x41 && ch <= 0x5A)
return (ch + 0x20);
return ch;
}
static int dn_find(const unsigned char *domain,
const unsigned char *msg,
const unsigned char * const *dnptrs,
const unsigned char * const *lastdnptr)
{
const unsigned char *dn, *cp, *sp;
const unsigned char * const *cpp;
u_int n;
for (cpp = dnptrs; cpp < lastdnptr; cpp++) {
sp = *cpp;
/*
* terminate search on:
* root label
* compression pointer
* unusable offset
*/
while (*sp != 0 && (*sp & NS_CMPRSFLGS) == 0 &&
(sp - msg) < 0x4000) {
dn = domain;
cp = sp;
while ((n = *cp++) != 0) {
/*
* check for indirection
*/
switch (n & NS_CMPRSFLGS) {
case 0: /*%< normal case, n == len */
n = labellen(cp - 1); /*%< XXX */
if (n != *dn++)
goto next;
for (; n > 0; n--)
if (mklower(*dn++) !=
mklower(*cp++))
goto next;
/* Is next root for both ? */
if (*dn == '\0' && *cp == '\0')
return (sp - msg);
if (*dn)
continue;
goto next;
case NS_CMPRSFLGS: /*%< indirection */
cp = msg + (((n & 0x3f) << 8) | *cp);
break;
default: /*%< illegal type */
errno = EMSGSIZE;
return -1;
}
}
next:
sp += *sp + 1;
}
}
errno = ENOENT;
return -1;
}
int ns_name_pack(const unsigned char *src,
unsigned char *dst, int dstsiz,
const unsigned char **dnptrs,
const unsigned char **lastdnptr)
{
unsigned char *dstp;
const unsigned char **cpp, **lpp, *eob, *msg;
const unsigned char *srcp;
int n, l, first = 1;
srcp = src;
dstp = dst;
eob = dstp + dstsiz;
lpp = cpp = NULL;
if (dnptrs != NULL) {
msg = *dnptrs++;
if (msg != NULL) {
for (cpp = dnptrs; *cpp != NULL; cpp++)
continue;
lpp = cpp; /*%< end of list to search */
}
} else {
msg = NULL;
}
/* make sure the domain we are about to add is legal */
l = 0;
do {
int l0;
n = *srcp;
if ((n & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
errno = EMSGSIZE;
return -1;
}
l0 = labellen(srcp);
if (l0 < 0) {
errno = EINVAL;
return -1;
}
l += l0 + 1;
if (l > MAXCDNAME) {
errno = EMSGSIZE;
return -1;
}
srcp += l0 + 1;
} while (n != 0);
/* from here on we need to reset compression pointer array on error */
srcp = src;
do {
/* Look to see if we can use pointers. */
n = *srcp;
if (n != 0 && msg != NULL) {
l = dn_find(srcp, msg, (const unsigned char * const *) dnptrs,
(const unsigned char * const *) lpp);
if (l >= 0) {
if (dstp + 1 >= eob) {
goto cleanup;
}
*dstp++ = ((u_int32_t)l >> 8) | NS_CMPRSFLGS;
*dstp++ = l % 256;
return (dstp - dst);
}
/* Not found, save it. */
if (lastdnptr != NULL && cpp < lastdnptr - 1 &&
(dstp - msg) < 0x4000 && first) {
*cpp++ = dstp;
*cpp = NULL;
first = 0;
}
}
/* copy label to buffer */
if ((n & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
/* Should not happen. */
goto cleanup;
}
n = labellen(srcp);
if (dstp + 1 + n >= eob) {
goto cleanup;
}
memcpy(dstp, srcp, (size_t)(n + 1));
srcp += n + 1;
dstp += n + 1;
} while (n != 0);
if (dstp > eob) {
cleanup:
if (msg != NULL)
*lpp = NULL;
errno = EMSGSIZE;
return -1;
}
return dstp - dst;
}
libc_hidden_def(ns_name_pack)
int ns_name_compress(const char *src,
unsigned char *dst, size_t dstsiz,
const unsigned char **dnptrs,
const unsigned char **lastdnptr)
{
unsigned char tmp[NS_MAXCDNAME];
if (ns_name_pton(src, tmp, sizeof(tmp)) == -1)
return -1;
return ns_name_pack(tmp, dst, dstsiz, dnptrs, lastdnptr);
}
libc_hidden_def(ns_name_compress)
int ns_name_skip(const unsigned char **ptrptr,
const unsigned char *eom)
{
const unsigned char *cp;
u_int n;
int l;
cp = *ptrptr;
while (cp < eom && (n = *cp++) != 0) {
/* Check for indirection. */
switch (n & NS_CMPRSFLGS) {
case 0: /*%< normal case, n == len */
cp += n;
continue;
case NS_TYPE_ELT: /*%< EDNS0 extended label */
l = labellen(cp - 1);
if (l < 0) {
errno = EMSGSIZE; /*%< XXX */
return -1;
}
cp += l;
continue;
case NS_CMPRSFLGS: /*%< indirection */
cp++;
break;
default: /*%< illegal type */
errno = EMSGSIZE;
return -1;
}
break;
}
if (cp > eom) {
errno = EMSGSIZE;
return -1;
}
*ptrptr = cp;
return 0;
}
libc_hidden_def(ns_name_skip)
int dn_skipname(const unsigned char *ptr, const unsigned char *eom)
{
const unsigned char *saveptr = ptr;
if (ns_name_skip(&ptr, eom) == -1)
return -1;
return ptr - saveptr;
}
libc_hidden_def(dn_skipname)
#endif /* L_ns_name */
#ifdef L_res_init
/* Will be called under __resolv_lock. */
static void res_sync_func(void)
{
struct __res_state *rp = &(_res);
int n;
/* If we didn't get malloc failure earlier... */
if (__nameserver != (void*) &__local_nameserver) {
/* TODO:
* if (__nameservers < rp->nscount) - try to grow __nameserver[]?
*/
#ifdef __UCLIBC_HAS_IPV6__
if (__nameservers > rp->_u._ext.nscount)
__nameservers = rp->_u._ext.nscount;
n = __nameservers;
while (--n >= 0)
__nameserver[n].sa6 = *rp->_u._ext.nsaddrs[n]; /* struct copy */
#else /* IPv4 only */
if (__nameservers > rp->nscount)
__nameservers = rp->nscount;
n = __nameservers;
while (--n >= 0)
__nameserver[n].sa4 = rp->nsaddr_list[n]; /* struct copy */
#endif
}
__resolv_timeout = rp->retrans ? : RES_TIMEOUT;
__resolv_attempts = rp->retry ? : RES_DFLRETRY;
/* Extend and comment what program is known
* to use which _res.XXX member(s).
__resolv_opts = rp->options;
...
*/
}
/* has to be called under __resolv_lock */
static int
__res_vinit(res_state rp, int preinit)
{
int i, n, options, retrans, retry, ndots;
#ifdef __UCLIBC_HAS_IPV6__
int m = 0;
#endif
__close_nameservers();
__open_nameservers();
if (preinit) {
options = rp->options;
retrans = rp->retrans;
retry = rp->retry;
ndots = rp->ndots;
}
memset(rp, 0, sizeof(*rp));
if (!preinit) {
rp->options = RES_DEFAULT;
rp->retrans = RES_TIMEOUT;
rp->retry = RES_DFLRETRY;
rp->ndots = 1;
} else {
rp->options = options;
rp->retrans = retrans;
rp->retry = retry;
rp->ndots = ndots;
}
#ifdef __UCLIBC_HAS_COMPAT_RES_STATE__
/* Was: "rp->id = random();" but:
* - random() pulls in largish static buffers
* - isn't actually random unless, say, srandom(time(NULL)) was called
* - is not used by uclibc anyway :)
*/
/* rp->id = 0; - memset did it */
#endif
#ifdef __UCLIBC_HAS_EXTRA_COMPAT_RES_STATE__
rp->_vcsock = -1;
#endif
n = __searchdomains;
if (n > ARRAY_SIZE(rp->dnsrch))
n = ARRAY_SIZE(rp->dnsrch);
for (i = 0; i < n; i++)
rp->dnsrch[i] = __searchdomain[i];
/* copy nameservers' addresses */
i = 0;
#ifdef __UCLIBC_HAS_IPV4__
n = 0;
while (n < ARRAY_SIZE(rp->nsaddr_list) && i < __nameservers) {
if (__nameserver[i].sa.sa_family == AF_INET) {
rp->nsaddr_list[n] = __nameserver[i].sa4; /* struct copy */
#ifdef __UCLIBC_HAS_IPV6__
if (m < ARRAY_SIZE(rp->_u._ext.nsaddrs)) {
rp->_u._ext.nsaddrs[m] = (void*) &rp->nsaddr_list[n];
m++;
}
#endif
n++;
}
#ifdef __UCLIBC_HAS_IPV6__
if (__nameserver[i].sa.sa_family == AF_INET6
&& m < ARRAY_SIZE(rp->_u._ext.nsaddrs)
) {
struct sockaddr_in6 *sa6 = malloc(sizeof(*sa6));
if (sa6) {
*sa6 = __nameserver[i].sa6; /* struct copy */
rp->_u._ext.nsaddrs[m] = sa6;
m++;
}
}
#endif
i++;
}
rp->nscount = n;
#ifdef __UCLIBC_HAS_IPV6__
rp->_u._ext.nscount = m;
#endif
#else /* IPv6 only */
while (m < ARRAY_SIZE(rp->_u._ext.nsaddrs) && i < __nameservers) {
struct sockaddr_in6 *sa6 = malloc(sizeof(*sa6));
if (sa6) {
*sa6 = __nameserver[i].sa6; /* struct copy */
rp->_u._ext.nsaddrs[m] = sa6;
m++;
}
i++;
}
rp->_u._ext.nscount = m;
#endif
rp->options |= RES_INIT;
return 0;
}
static unsigned int
res_randomid(void)
{
return 0xffff & getpid();
}
/* Our res_init never fails (always returns 0) */
int
res_init(void)
{
/*
* These three fields used to be statically initialized. This made
* it hard to use this code in a shared library. It is necessary,
* now that we're doing dynamic initialization here, that we preserve
* the old semantics: if an application modifies one of these three
* fields of _res before res_init() is called, res_init() will not
* alter them. Of course, if an application is setting them to
* _zero_ before calling res_init(), hoping to override what used
* to be the static default, we can't detect it and unexpected results
* will follow. Zero for any of these fields would make no sense,
* so one can safely assume that the applications were already getting
* unexpected results.
*
* _res.options is tricky since some apps were known to diddle the bits
* before res_init() was first called. We can't replicate that semantic
* with dynamic initialization (they may have turned bits off that are
* set in RES_DEFAULT). Our solution is to declare such applications
* "broken". They could fool us by setting RES_INIT but none do (yet).
*/
__UCLIBC_MUTEX_LOCK(__resolv_lock);
if (!_res.retrans)
_res.retrans = RES_TIMEOUT;
if (!_res.retry)
_res.retry = 4;
if (!(_res.options & RES_INIT))
_res.options = RES_DEFAULT;
/*
* This one used to initialize implicitly to zero, so unless the app
* has set it to something in particular, we can randomize it now.
*/
if (!_res.id)
_res.id = res_randomid();
__res_sync = NULL;
__res_vinit(&_res, 1);
__res_sync = res_sync_func;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
return 0;
}
libc_hidden_def(res_init)
static void
__res_iclose(res_state statp)
{
struct __res_state * rp = statp;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
if (rp == NULL)
rp = __res_state();
__close_nameservers();
__res_sync = NULL;
#ifdef __UCLIBC_HAS_IPV6__
{
char *p1 = (char*) &(rp->nsaddr_list[0]);
unsigned int m = 0;
/* free nsaddrs[m] if they do not point to nsaddr_list[x] */
while (m < ARRAY_SIZE(rp->_u._ext.nsaddrs)) {
char *p2 = (char*)(rp->_u._ext.nsaddrs[m++]);
if (p2 < p1 || (p2 - p1) > (signed)sizeof(rp->nsaddr_list))
free(p2);
}
}
#endif
memset(rp, 0, sizeof(struct __res_state));
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
}
/*
* This routine is for closing the socket if a virtual circuit is used and
* the program wants to close it. This provides support for endhostent()
* which expects to close the socket.
*
* This routine is not expected to be user visible.
*/
void
res_nclose(res_state statp)
{
__res_iclose(statp);
}
#ifdef __UCLIBC_HAS_BSD_RES_CLOSE__
void res_close(void)
{
__res_iclose(NULL);
}
#endif
/* This needs to be after the use of _res in res_init, above. */
#undef _res
#ifndef __UCLIBC_HAS_THREADS__
/* The resolver state for use by single-threaded programs.
This differs from plain `struct __res_state _res;' in that it doesn't
create a common definition, but a plain symbol that resides in .bss,
which can have an alias. */
struct __res_state _res __attribute__((section (".bss")));
struct __res_state *__resp = &_res;
#else /* __UCLIBC_HAS_THREADS__ */
struct __res_state _res __attribute__((section (".bss"))) attribute_hidden;
# if defined __UCLIBC_HAS_TLS__
# undef __resp
__thread struct __res_state *__resp = &_res;
extern __thread struct __res_state *__libc_resp
__attribute__ ((alias ("__resp"))) attribute_hidden attribute_tls_model_ie;
# else
# undef __resp
struct __res_state *__resp = &_res;
# endif
#endif /* !__UCLIBC_HAS_THREADS__ */
/*
* Set up default settings. If the configuration file exist, the values
* there will have precedence. Otherwise, the server address is set to
* INADDR_ANY and the default domain name comes from the gethostname().
*
* An interrim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1
* rather than INADDR_ANY ("0.0.0.0") as the default name server address
* since it was noted that INADDR_ANY actually meant ``the first interface
* you "ifconfig"'d at boot time'' and if this was a SLIP or PPP interface,
* it had to be "up" in order for you to reach your own name server. It
* was later decided that since the recommended practice is to always
* install local static routes through 127.0.0.1 for all your network
* interfaces, that we could solve this problem without a code change.
*
* The configuration file should always be used, since it is the only way
* to specify a default domain. If you are running a server on your local
* machine, you should say "nameserver 0.0.0.0" or "nameserver 127.0.0.1"
* in the configuration file.
*
* Return 0 if completes successfully, -1 on error
*/
int
res_ninit(res_state statp)
{
int ret;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
ret = __res_vinit(statp, 0);
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
return ret;
}
#endif /* L_res_init */
#ifdef L_res_state
# if defined __UCLIBC_HAS_TLS__
struct __res_state *
__res_state (void)
{
return __resp;
}
# else
# undef _res
extern struct __res_state _res;
/* When threaded, _res may be a per-thread variable. */
struct __res_state *
weak_const_function
__res_state (void)
{
return &_res;
}
# endif
#endif /* L_res_state */
#ifdef L_res_query
int res_query(const char *dname, int class, int type,
unsigned char *answer, int anslen)
{
int i;
unsigned char *packet = NULL;
struct resolv_answer a;
if (!dname || class != 1 /* CLASS_IN */) {
h_errno = NO_RECOVERY;
return -1;
}
memset(&a, '\0', sizeof(a));
i = __dns_lookup(dname, type, &packet, &a);
if (i < 0) {
if (!h_errno) /* TODO: can this ever happen? */
h_errno = TRY_AGAIN;
return -1;
}
free(a.dotted);
if (i > anslen)
i = anslen;
memcpy(answer, packet, i);
free(packet);
return i;
}
libc_hidden_def(res_query)
/*
* Formulate a normal query, send, and retrieve answer in supplied buffer.
* Return the size of the response on success, -1 on error.
* If enabled, implement search rules until answer or unrecoverable failure
* is detected. Error code, if any, is left in h_errno.
*/
#define __TRAILING_DOT (1<<0)
#define __GOT_NODATA (1<<1)
#define __GOT_SERVFAIL (1<<2)
#define __TRIED_AS_IS (1<<3)
int res_search(const char *name, int class, int type, u_char *answer,
int anslen)
{
const char *cp;
char **domain;
HEADER *hp = (HEADER *)(void *)answer;
unsigned dots;
unsigned state;
int ret, saved_herrno;
uint32_t _res_options;
unsigned _res_ndots;
char **_res_dnsrch;
if (!name || !answer) {
h_errno = NETDB_INTERNAL;
return -1;
}
again:
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
_res_ndots = _res.ndots;
_res_dnsrch = _res.dnsrch;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if (!(_res_options & RES_INIT)) {
res_init(); /* our res_init never fails */
goto again;
}
state = 0;
errno = 0;
h_errno = HOST_NOT_FOUND; /* default, if we never query */
dots = 0;
for (cp = name; *cp; cp++)
dots += (*cp == '.');
if (cp > name && *--cp == '.')
state |= __TRAILING_DOT;
/*
* If there are dots in the name already, let's just give it a try
* 'as is'. The threshold can be set with the "ndots" option.
*/
saved_herrno = -1;
if (dots >= _res_ndots) {
ret = res_querydomain(name, NULL, class, type, answer, anslen);
if (ret > 0)
return ret;
saved_herrno = h_errno;
state |= __TRIED_AS_IS;
}
/*
* We do at least one level of search if
* - there is no dot and RES_DEFNAME is set, or
* - there is at least one dot, there is no trailing dot,
* and RES_DNSRCH is set.
*/
if ((!dots && (_res_options & RES_DEFNAMES))
|| (dots && !(state & __TRAILING_DOT) && (_res_options & RES_DNSRCH))
) {
bool done = 0;
for (domain = _res_dnsrch; *domain && !done; domain++) {
ret = res_querydomain(name, *domain, class, type,
answer, anslen);
if (ret > 0)
return ret;
/*
* If no server present, give up.
* If name isn't found in this domain,
* keep trying higher domains in the search list
* (if that's enabled).
* On a NO_DATA error, keep trying, otherwise
* a wildcard entry of another type could keep us
* from finding this entry higher in the domain.
* If we get some other error (negative answer or
* server failure), then stop searching up,
* but try the input name below in case it's
* fully-qualified.
*/
if (errno == ECONNREFUSED) {
h_errno = TRY_AGAIN;
return -1;
}
switch (h_errno) {
case NO_DATA:
state |= __GOT_NODATA;
/* FALLTHROUGH */
case HOST_NOT_FOUND:
/* keep trying */
break;
case TRY_AGAIN:
if (hp->rcode == SERVFAIL) {
/* try next search element, if any */
state |= __GOT_SERVFAIL;
break;
}
/* FALLTHROUGH */
default:
/* anything else implies that we're done */
done = 1;
}
/*
* if we got here for some reason other than DNSRCH,
* we only wanted one iteration of the loop, so stop.
*/
if (!(_res_options & RES_DNSRCH))
done = 1;
}
}
/*
* if we have not already tried the name "as is", do that now.
* note that we do this regardless of how many dots were in the
* name or whether it ends with a dot.
*/
if (!(state & __TRIED_AS_IS)) {
ret = res_querydomain(name, NULL, class, type, answer, anslen);
if (ret > 0)
return ret;
}
/*
* if we got here, we didn't satisfy the search.
* if we did an initial full query, return that query's h_errno
* (note that we wouldn't be here if that query had succeeded).
* else if we ever got a nodata, send that back as the reason.
* else send back meaningless h_errno, that being the one from
* the last DNSRCH we did.
*/
if (saved_herrno != -1)
h_errno = saved_herrno;
else if (state & __GOT_NODATA)
h_errno = NO_DATA;
else if (state & __GOT_SERVFAIL)
h_errno = TRY_AGAIN;
return -1;
}
#undef __TRAILING_DOT
#undef __GOT_NODATA
#undef __GOT_SERVFAIL
#undef __TRIED_AS_IS
/*
* Perform a call on res_query on the concatenation of name and domain,
* removing a trailing dot from name if domain is NULL.
*/
int res_querydomain(const char *name, const char *domain, int class, int type,
u_char *answer, int anslen)
{
char nbuf[MAXDNAME];
const char *longname = nbuf;
size_t n, d;
#ifdef DEBUG
uint32_t _res_options;
#endif
if (!name || !answer) {
h_errno = NETDB_INTERNAL;
return -1;
}
#ifdef DEBUG
again:
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if (!(_res_options & RES_INIT)) {
res_init(); /* our res_init never fails */
goto again;
}
if (_res_options & RES_DEBUG)
printf(";; res_querydomain(%s, %s, %d, %d)\n",
name, (domain ? domain : "<Nil>"), class, type);
#endif
if (domain == NULL) {
/*
* Check for trailing '.';
* copy without '.' if present.
*/
n = strlen(name);
if (n + 1 > sizeof(nbuf)) {
h_errno = NO_RECOVERY;
return -1;
}
if (n > 0 && name[--n] == '.') {
strncpy(nbuf, name, n);
nbuf[n] = '\0';
} else
longname = name;
} else {
n = strlen(name);
d = strlen(domain);
if (n + 1 + d + 1 > sizeof(nbuf)) {
h_errno = NO_RECOVERY;
return -1;
}
snprintf(nbuf, sizeof(nbuf), "%s.%s", name, domain);
}
return res_query(longname, class, type, answer, anslen);
}
libc_hidden_def(res_querydomain)
#endif /* L_res_query */
#ifdef L_ns_netint
unsigned int ns_get16(const unsigned char *src)
{
unsigned int dst;
NS_GET16(dst, src);
return dst;
}
unsigned long ns_get32(const unsigned char *src)
{
unsigned long dst;
NS_GET32(dst, src);
return dst;
}
void ns_put16(unsigned int src, unsigned char *dst)
{
NS_PUT16(src, dst);
}
void ns_put32(unsigned long src, unsigned char *dst)
{
NS_PUT32(src, dst);
}
#endif /* L_ns_netint */
#ifdef L_ns_parse
/* These need to be in the same order as the nres.h:ns_flag enum. */
struct _ns_flagdata { unsigned short mask, shift; };
static const struct _ns_flagdata _ns_flagdata[16] = {
{ 0x8000, 15 }, /*%< qr. */
{ 0x7800, 11 }, /*%< opcode. */
{ 0x0400, 10 }, /*%< aa. */
{ 0x0200, 9 }, /*%< tc. */
{ 0x0100, 8 }, /*%< rd. */
{ 0x0080, 7 }, /*%< ra. */
{ 0x0040, 6 }, /*%< z. */
{ 0x0020, 5 }, /*%< ad. */
{ 0x0010, 4 }, /*%< cd. */
{ 0x000f, 0 }, /*%< rcode. */
{ 0x0000, 0 }, /*%< expansion (1/6). */
{ 0x0000, 0 }, /*%< expansion (2/6). */
{ 0x0000, 0 }, /*%< expansion (3/6). */
{ 0x0000, 0 }, /*%< expansion (4/6). */
{ 0x0000, 0 }, /*%< expansion (5/6). */
{ 0x0000, 0 }, /*%< expansion (6/6). */
};
static void setsection(ns_msg *msg, ns_sect sect)
{
msg->_sect = sect;
if (sect == ns_s_max) {
msg->_rrnum = -1;
msg->_ptr = NULL;
} else {
msg->_rrnum = 0;
msg->_ptr = msg->_sections[(int)sect];
}
}
int ns_skiprr(const unsigned char *ptr,
const unsigned char *eom,
ns_sect section, int count)
{
const u_char *optr = ptr;
for (; count > 0; count--) {
int b, rdlength;
b = dn_skipname(ptr, eom);
if (b < 0) {
errno = EMSGSIZE;
return -1;
}
ptr += b/*Name*/ + NS_INT16SZ/*Type*/ + NS_INT16SZ/*Class*/;
if (section != ns_s_qd) {
if (ptr + NS_INT32SZ + NS_INT16SZ > eom) {
errno = EMSGSIZE;
return -1;
}
ptr += NS_INT32SZ/*TTL*/;
NS_GET16(rdlength, ptr);
ptr += rdlength/*RData*/;
}
}
if (ptr > eom) {
errno = EMSGSIZE;
return -1;
}
return ptr - optr;
}
libc_hidden_def(ns_skiprr)
int
ns_initparse(const unsigned char *msg, int msglen, ns_msg *handle)
{
const u_char *eom = msg + msglen;
int i;
handle->_msg = msg;
handle->_eom = eom;
if (msg + NS_INT16SZ > eom) {
errno = EMSGSIZE;
return -1;
}
NS_GET16(handle->_id, msg);
if (msg + NS_INT16SZ > eom) {
errno = EMSGSIZE;
return -1;
}
NS_GET16(handle->_flags, msg);
for (i = 0; i < ns_s_max; i++) {
if (msg + NS_INT16SZ > eom) {
errno = EMSGSIZE;
return -1;
}
NS_GET16(handle->_counts[i], msg);
}
for (i = 0; i < ns_s_max; i++)
if (handle->_counts[i] == 0)
handle->_sections[i] = NULL;
else {
int b = ns_skiprr(msg, eom, (ns_sect)i,
handle->_counts[i]);
if (b < 0)
return -1;
handle->_sections[i] = msg;
msg += b;
}
if (msg != eom) {
errno = EMSGSIZE;
return -1;
}
setsection(handle, ns_s_max);
return 0;
}
int
ns_parserr(ns_msg *handle, ns_sect section, int rrnum, ns_rr *rr)
{
int b;
int tmp;
/* Make section right. */
tmp = section;
if (tmp < 0 || section >= ns_s_max) {
errno = ENODEV;
return -1;
}
if (section != handle->_sect)
setsection(handle, section);
/* Make rrnum right. */
if (rrnum == -1)
rrnum = handle->_rrnum;
if (rrnum < 0 || rrnum >= handle->_counts[(int)section]) {
errno = ENODEV;
return -1;
}
if (rrnum < handle->_rrnum)
setsection(handle, section);
if (rrnum > handle->_rrnum) {
b = ns_skiprr(handle->_ptr, handle->_eom, section,
rrnum - handle->_rrnum);
if (b < 0)
return -1;
handle->_ptr += b;
handle->_rrnum = rrnum;
}
/* Do the parse. */
b = dn_expand(handle->_msg, handle->_eom,
handle->_ptr, rr->name, NS_MAXDNAME);
if (b < 0)
return -1;
handle->_ptr += b;
if (handle->_ptr + NS_INT16SZ + NS_INT16SZ > handle->_eom) {
errno = EMSGSIZE;
return -1;
}
NS_GET16(rr->type, handle->_ptr);
NS_GET16(rr->rr_class, handle->_ptr);
if (section == ns_s_qd) {
rr->ttl = 0;
rr->rdlength = 0;
rr->rdata = NULL;
} else {
if (handle->_ptr + NS_INT32SZ + NS_INT16SZ > handle->_eom) {
errno = EMSGSIZE;
return -1;
}
NS_GET32(rr->ttl, handle->_ptr);
NS_GET16(rr->rdlength, handle->_ptr);
if (handle->_ptr + rr->rdlength > handle->_eom) {
errno = EMSGSIZE;
return -1;
}
rr->rdata = handle->_ptr;
handle->_ptr += rr->rdlength;
}
if (++handle->_rrnum > handle->_counts[(int)section])
setsection(handle, (ns_sect)((int)section + 1));
return 0;
}
int ns_msg_getflag(ns_msg handle, int flag)
{
return ((handle)._flags & _ns_flagdata[flag].mask) >> _ns_flagdata[flag].shift;
}
#endif /* L_ns_parse */
#ifdef L_res_data
int res_mkquery(int op, const char *dname, int class, int type,
const unsigned char *data, int datalen,
const unsigned char *newrr_in,
unsigned char *buf, int buflen)
{
HEADER *hp;
unsigned char *cp, *ep;
unsigned char *dnptrs[20], **dpp, **lastdnptr;
uint32_t _res_options;
int n;
if (!buf || buflen < HFIXEDSZ) {
h_errno = NETDB_INTERNAL;
return -1;
}
again:
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if (!(_res_options & RES_INIT)) {
res_init(); /* our res_init never fails */
goto again;
}
#ifdef DEBUG
if (_res_options & RES_DEBUG)
printf(";; res_mkquery(%d, %s, %d, %d)\n",
op, dname && *dname ? dname : "<null>", class, type);
#endif
memset(buf, 0, HFIXEDSZ);
hp = (HEADER *) buf;
hp->id = getpid() & 0xffff;
hp->opcode = op;
hp->rd = (_res_options & RES_RECURSE) != 0U;
hp->rcode = NOERROR;
cp = buf + HFIXEDSZ;
ep = buf + buflen;
dpp = dnptrs;
*dpp++ = buf;
*dpp++ = NULL;
lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
/*
* perform opcode specific processing
*/
switch (op) {
case QUERY:
case NS_NOTIFY_OP:
if (ep - cp < QFIXEDSZ)
return -1;
n = dn_comp(dname, cp, ep - cp - QFIXEDSZ, dnptrs, lastdnptr);
if (n < 0)
return -1;
cp += n;
NS_PUT16(type, cp);
NS_PUT16(class, cp);
hp->qdcount = htons(1);
if (op == QUERY || data == NULL)
break;
/*
* Make an additional record for completion domain.
*/
if ((ep - cp) < RRFIXEDSZ)
return -1;
n = dn_comp((const char *)data, cp, ep - cp - RRFIXEDSZ,
dnptrs, lastdnptr);
if (n < 0)
return -1;
cp += n;
NS_PUT16(T_NULL, cp);
NS_PUT16(class, cp);
NS_PUT32(0, cp);
NS_PUT16(0, cp);
hp->arcount = htons(1);
break;
case IQUERY:
/*
* Initialize answer section
*/
if (ep - cp < 1 + RRFIXEDSZ + datalen)
return -1;
*cp++ = '\0'; /*%< no domain name */
NS_PUT16(type, cp);
NS_PUT16(class, cp);
NS_PUT32(0, cp);
NS_PUT16(datalen, cp);
if (datalen) {
memcpy(cp, data, (size_t)datalen);
cp += datalen;
}
hp->ancount = htons(1);
break;
default:
return -1;
}
return cp - buf;
}
#endif /* L_res_data */
/* Unimplemented: */
/* res_send */
|