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
|
/* 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()
*
*/
#define __FORCE_GLIBC
#include <features.h>
#include <string.h>
#include <stdio.h>
#include <signal.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 <arpa/nameser.h>
#include <sys/utsname.h>
#include <sys/un.h>
#include <bits/uClibc_mutex.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
__UCLIBC_MUTEX_EXTERN(__resolv_lock);
/* Experimentally off - libc_hidden_proto(memcpy) */
/* Experimentally off - libc_hidden_proto(memset) */
/* Experimentally off - libc_hidden_proto(memmove) */
/* Experimentally off - libc_hidden_proto(strchr) */
/* Experimentally off - libc_hidden_proto(strcmp) */
/* Experimentally off - libc_hidden_proto(strcpy) */
/* Experimentally off - libc_hidden_proto(strdup) */
/* Experimentally off - libc_hidden_proto(strlen) */
/* Experimentally off - libc_hidden_proto(strncat) */
/* Experimentally off - libc_hidden_proto(strncpy) */
/* libc_hidden_proto(strnlen) */
/* Experimentally off - libc_hidden_proto(strstr) */
/* Experimentally off - libc_hidden_proto(strcasecmp) */
libc_hidden_proto(socket)
libc_hidden_proto(close)
libc_hidden_proto(fopen)
libc_hidden_proto(fclose)
libc_hidden_proto(random)
libc_hidden_proto(getservbyport)
libc_hidden_proto(uname)
libc_hidden_proto(inet_addr)
libc_hidden_proto(inet_aton)
libc_hidden_proto(inet_pton)
libc_hidden_proto(inet_ntop)
libc_hidden_proto(connect)
libc_hidden_proto(poll)
libc_hidden_proto(select)
libc_hidden_proto(recv)
libc_hidden_proto(send)
libc_hidden_proto(printf)
libc_hidden_proto(sprintf)
libc_hidden_proto(snprintf)
libc_hidden_proto(fgets)
libc_hidden_proto(gethostbyname)
libc_hidden_proto(gethostbyname_r)
libc_hidden_proto(gethostbyname2_r)
libc_hidden_proto(gethostbyaddr)
libc_hidden_proto(gethostbyaddr_r)
libc_hidden_proto(ns_name_uncompress)
libc_hidden_proto(ns_name_unpack)
libc_hidden_proto(ns_name_ntop)
libc_hidden_proto(res_init)
libc_hidden_proto(res_query)
libc_hidden_proto(res_querydomain)
libc_hidden_proto(gethostent_r)
libc_hidden_proto(fprintf)
libc_hidden_proto(__h_errno_location)
#ifdef __UCLIBC_HAS_XLOCALE__
libc_hidden_proto(__ctype_b_loc)
#elif defined __UCLIBC_HAS_CTYPE_TABLES__
libc_hidden_proto(__ctype_b)
#endif
int __libc_getdomainname(char *name, size_t len);
libc_hidden_proto(__libc_getdomainname)
#define MAX_RECURSE 5
#define REPLY_TIMEOUT 10
#define MAX_RETRIES 3
#define MAX_SERVERS 3
#define MAX_SEARCH 4
#define MAX_ALIASES 5
/* 1:ip + 1:full + MAX_ALIASES:aliases + 1:NULL */
#define ALIAS_DIM (2 + MAX_ALIASES + 1)
#undef DEBUG
/* #define DEBUG */
#ifdef DEBUG
#define DPRINTF(X,args...) fprintf(stderr, X, ##args)
#else
#define DPRINTF(X,args...)
#endif /* DEBUG */
/* 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)
/* Global stuff (stuff needing to be locked to be thread safe)... */
extern int __nameservers attribute_hidden;
extern char * __nameserver[MAX_SERVERS] attribute_hidden;
extern int __searchdomains attribute_hidden;
extern char * __searchdomain[MAX_SEARCH] attribute_hidden;
/* 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,
};
/* function prototypes */
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 FILE * __open_etc_hosts(void) attribute_hidden;
extern int __read_etc_hosts_r(FILE *fp, 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, int nscount,
char ** nsip, 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 * const message, int offset,
char * dest, int maxlen) attribute_hidden;
extern int __length_dotted(const unsigned char * const message, int offset) attribute_hidden;
extern int __encode_header(struct resolv_header * h, unsigned char * dest, int maxlen) attribute_hidden;
extern int __decode_header(unsigned char * data, struct resolv_header * h) attribute_hidden;
extern int __encode_question(const struct resolv_question * const q,
unsigned char * dest, int maxlen) attribute_hidden;
extern int __decode_question(const unsigned char * const message, int offset,
struct resolv_question * q) attribute_hidden;
extern int __encode_answer(struct resolv_answer * a,
unsigned char * dest, int maxlen) attribute_hidden;
extern int __decode_answer(const unsigned char * message, int offset,
int len, struct resolv_answer * a) attribute_hidden;
extern int __length_question(const unsigned char * const message, int offset) attribute_hidden;
extern void __open_nameservers(void) attribute_hidden;
extern void __close_nameservers(void) attribute_hidden;
extern int __dn_expand(const u_char *, const u_char *, const u_char *,
char *, int);
#ifdef L_encodeh
int attribute_hidden __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
#ifdef L_decodeh
int attribute_hidden __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];
return HFIXEDSZ;
}
#endif
#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 attribute_hidden __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)
dotted = c + 1;
else
break;
}
if (maxlen < 1)
return -1;
dest[used++] = 0;
return used;
}
#endif
#ifdef L_decoded
/* Decode a dotted string from nameserver transport-level encoding.
This routine understands compressed data. */
int attribute_hidden __decode_dotted(const unsigned char * const data, int offset,
char *dest, int maxlen)
{
int l;
bool measure = 1;
unsigned total = 0;
unsigned used = 0;
if (!data)
return -1;
while ((l = data[offset++])) {
if (measure)
total++;
if ((l & 0xc0) == (0xc0)) {
if (measure)
total++;
/* compressed item, redirect */
offset = ((l & 0x3f) << 8) | data[offset];
measure = 0;
continue;
}
if ((used + l + 1) >= maxlen)
return -1;
memcpy(dest + used, data + offset, l);
offset += l;
used += l;
if (measure)
total += l;
if (data[offset] != 0)
dest[used++] = '.';
else
dest[used++] = '\0';
}
/* The null byte must be counted too */
if (measure)
total++;
DPRINTF("Total decode len = %d\n", total);
return total;
}
#endif
#ifdef L_lengthd
/* Returns -1 only if data == NULL */
int attribute_hidden __length_dotted(const unsigned char * const data, int offset)
{
int orig_offset = offset;
int l;
if (!data)
return -1;
while ((l = data[offset++])) {
if ((l & 0xc0) == (0xc0)) {
offset++;
break;
}
offset += l;
}
return offset - orig_offset;
}
#endif
#ifdef L_encodeq
int attribute_hidden __encode_question(const struct resolv_question * const 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
#ifdef L_decodeq
int attribute_hidden __decode_question(const unsigned char * const message, int offset,
struct resolv_question *q)
{
char temp[256];
int i;
i = __decode_dotted(message, offset, temp, sizeof(temp));
if (i < 0)
return i;
offset += i;
//TODO: what if strdup fails?
q->dotted = strdup(temp);
q->qtype = (message[offset + 0] << 8) | message[offset + 1];
q->qclass = (message[offset + 2] << 8) | message[offset + 3];
return i + 4;
}
#endif
#ifdef L_lengthq
/* Returns -1 only if message == NULL */
int attribute_hidden __length_question(const unsigned char * const message, int offset)
{
int i;
/* returns -1 only if message == NULL */
i = __length_dotted(message, offset);
if (i < 0)
return i;
return i + 4;
}
#endif
#ifdef L_encodea
int attribute_hidden __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
#ifdef L_decodea
int attribute_hidden __decode_answer(const unsigned char *message, int offset,
int 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, 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;
}
#endif
#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
#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)
{
return __decode_header(data, h);
}
#endif
#ifdef L_formquery
int __form_query(int id, const char *name, int type, unsigned char *packet, int maxlen);
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
#ifdef L_dnslookup
__UCLIBC_MUTEX_STATIC(mylock, PTHREAD_MUTEX_INITIALIZER);
/* Just for the record, having to lock __dns_lookup() just for these two globals
* is pretty lame. I think these two variables can probably be de-global-ized,
* which should eliminate the need for doing locking here... Needs a closer
* look anyways. */
static int static_ns = 0;
/* uint16: minimizing rw data size, even if code grows a tiny bit.
* rw data costs more. */
static uint16_t static_id = 1;
/* 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
* 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 attribute_hidden __dns_lookup(const char *name, int type,
int nscount, char **nsip,
unsigned char **outpacket,
struct resolv_answer *a)
//FIXME: nscount/nsip are *always* taken from __nameservers and __nameserver[]
//globals. Locking is busted: __nameserver[] can be freed under us.
//Fix it by eliminating these params and accessing __nameserver(s)
//only under lock inside this routine.
{
int i, j, len, fd, pos, rc;
#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;
unsigned retries = 0;
unsigned char *packet = malloc(PACKETSZ);
char *dns, *lookup = malloc(MAXDNAME);
int variant = -1; /* search domain to append, -1 - none */
int local_ns = -1, local_id = -1;
bool ends_with_dot;
union {
struct sockaddr sa;
#ifdef __UCLIBC_HAS_IPV4__
struct sockaddr_in sa4;
#endif
#ifdef __UCLIBC_HAS_IPV6__
struct sockaddr_in6 sa6;
#endif
} sa;
fd = -1;
if (!packet || !lookup || !nscount || !name[0])
goto fail;
DPRINTF("Looking up type %d answer for '%s'\n", type, name);
ends_with_dot = (name[strlen(name) - 1] == '.');
/* Mess with globals while under lock */
__UCLIBC_MUTEX_LOCK(mylock);
local_ns = static_ns % nscount;
local_id = static_id;
__UCLIBC_MUTEX_UNLOCK(mylock);
while (retries < MAX_RETRIES) {
if (fd != -1)
close(fd);
memset(packet, 0, PACKETSZ);
memset(&h, 0, sizeof(h));
++local_id;
local_id &= 0xffff;
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;
strncpy(lookup, name, MAXDNAME);
__UCLIBC_MUTEX_LOCK(__resolv_lock);
/* nsip is really __nameserver[] which is a global that
needs to hold __resolv_lock before access!! */
dns = nsip[local_ns];
/* TODO: all future accesses to 'dns' were guarded by __resolv_lock too.
* Why? We already fetched nsip[local_ns] here,
* future changes to nsip[] by other threads cannot affect us.
* We can use 'dns' without locking. If I'm wrong,
* please explain in comments why locking is needed.
* One thing that worries me is - what if __close_nameservers() free()s
* dns under us? __resolv_lock'ing around accesses to dns won't help either,
* as free() might occur between accesses!
*/
if (variant >= 0) {
if (variant < __searchdomains) {
strncat(lookup, ".", MAXDNAME);
strncat(lookup, __searchdomain[variant], MAXDNAME);
}
}
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
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;
len = i + j;
DPRINTF("On try %d, sending query to port %d of machine %s\n",
retries+1, NAMESERVER_PORT, dns);
sa.sa.sa_family = AF_INET;
#ifdef __UCLIBC_HAS_IPV6__
//__UCLIBC_MUTEX_LOCK(__resolv_lock);
///* 'dns' is really __nameserver[] which is a global that
// needs to hold __resolv_lock before access!! */
if (inet_pton(AF_INET6, dns, &sa.sa6.sin6_addr) > 0)
sa.sa.sa_family = AF_INET6;
//__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
#endif
/* Connect to the UDP socket so that asyncronous errors are returned */
#ifdef __UCLIBC_HAS_IPV6__
if (sa.sa.sa_family == AF_INET6) {
sa.sa6.sin6_port = htons(NAMESERVER_PORT);
/* sa6.sin6_addr is already here */
} else
#endif
#ifdef __UCLIBC_HAS_IPV4__
{
sa.sa4.sin_port = htons(NAMESERVER_PORT);
//__UCLIBC_MUTEX_LOCK(__resolv_lock);
///* 'dns' is really __nameserver[] which is a global that
// needs to hold __resolv_lock before access!! */
sa.sa4.sin_addr.s_addr = inet_addr(dns);
//__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
}
#endif
fd = socket(sa.sa.sa_family, SOCK_DGRAM, IPPROTO_UDP);
if (fd < 0) {
retries++;
continue;
}
rc = connect(fd, &sa.sa, sizeof(sa));
if (rc < 0) {
if (errno == ENETUNREACH) {
/* routing error, presume not transient */
goto tryall;
}
/* retry */
retries++;
continue;
}
DPRINTF("Transmitting packet of length %d, id=%d, qr=%d\n",
len, h.id, h.qr);
send(fd, packet, len, 0);
#ifdef USE_SELECT
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 on queue */
goto tryall;
}
#else
fds.fd = fd;
fds.events = POLLIN;
if (poll(&fds, 1, REPLY_TIMEOUT * 1000) <= 0) {
DPRINTF("Timeout\n");
/* timed out, so retry send and receive,
* to next nameserver on queue */
goto tryall;
}
#endif
len = recv(fd, packet, PACKETSZ, 0);
if (len < HFIXEDSZ) {
/* too short! */
goto again;
}
__decode_header(packet, &h);
DPRINTF("id = %d, qr = %d\n", h.id, h.qr);
if ((h.id != local_id) || (!h.qr)) {
/* unsolicited */
goto again;
}
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);
if (h.rcode == NXDOMAIN) {
// 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 possible, try next search domain */
if (!ends_with_dot) {
int sdomains;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
sdomains = __searchdomains;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if (variant < sdomains - 1) {
/* next search */
variant++;
continue;
}
}
/* this is not an error - don't goto again! */
h_errno = HOST_NOT_FOUND;
goto fail1;
}
if (h.rcode != 0) /* error */
goto again;
/* code below won't work correctly with h.ancount == 0, so... */
if (h.ancount < 1) {
h_errno = NO_DATA; /* is this correct code? */
goto fail1;
}
pos = HFIXEDSZ;
for (j = 0; j < h.qdcount; j++) {
DPRINTF("Skipping question %d at %d\n", j, pos);
/* returns -1 only if packet == NULL (can't happen) */
i = __length_question(packet, pos);
//if (i < 0)
// goto again;
DPRINTF("Length of question %d is %d\n", j, i);
pos += i;
}
DPRINTF("Decoding answer at pos %d\n", pos);
first_answer = 1;
for (j = 0; j < h.ancount && pos < len; j++) {
i = __decode_answer(packet, pos, len, &ma);
if (i < 0) {
DPRINTF("failed decode %d\n", i);
/* if the message was truncated and we have
decoded some answers, pretend it's OK */
if (j && h.tc)
break;
goto again;
}
pos += i;
if (first_answer) {
ma.buf = a->buf;
ma.buflen = a->buflen;
ma.add_count = a->add_count;
memcpy(a, &ma, sizeof(ma));
if (a->atype != T_SIG && (NULL == a->buf || (type != T_A && type != T_AAAA)))
break;
if (a->atype != type) {
free(a->dotted);
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 again;
}
memcpy(a->buf + (a->add_count * ma.rdlength), ma.rdata, ma.rdlength);
++a->add_count;
}
}
DPRINTF("Answer name = |%s|\n", a->dotted);
DPRINTF("Answer type = |%d|\n", a->atype);
close(fd);
if (outpacket)
*outpacket = packet;
else
free(packet);
free(lookup);
/* Mess with globals while under lock */
__UCLIBC_MUTEX_LOCK(mylock);
static_ns = local_ns;
static_id = local_id;
__UCLIBC_MUTEX_UNLOCK(mylock);
return len; /* success! */
tryall:
/* if there are other nameservers, give them a go,
otherwise return with error */
variant = -1;
local_ns = (local_ns + 1) % nscount;
if (local_ns == 0)
retries++;
continue;
again:
/* if there are searchdomains, try them or fallback as passed */
if (!ends_with_dot) {
int sdomains;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
sdomains = __searchdomains;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if (variant < sdomains - 1) {
/* next search */
variant++;
continue;
}
}
/* next server, first search */
local_ns = (local_ns + 1) % nscount;
if (local_ns == 0)
retries++;
variant = -1;
}
fail:
h_errno = NETDB_INTERNAL;
fail1:
if (fd != -1)
close(fd);
free(lookup);
free(packet);
/* Mess with globals while under lock */
if (local_ns != -1) {
__UCLIBC_MUTEX_LOCK(mylock);
static_ns = local_ns;
static_id = local_id;
__UCLIBC_MUTEX_UNLOCK(mylock);
}
return -1;
}
#endif
#ifdef L_opennameservers
/* We use __resolv_lock to guard access to the
* '__nameservers' and __searchdomains globals */
int __nameservers;
char * __nameserver[MAX_SERVERS];
int __searchdomains;
char * __searchdomain[MAX_SEARCH];
__UCLIBC_MUTEX_INIT(__resolv_lock, PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP);
/*
* we currently read formats not quite the same as that on normal
* unix systems, we can have a list of nameservers after the keyword.
*/
void attribute_hidden __open_nameservers(void)
{
FILE *fp;
int i;
#define RESOLV_ARGS 5
char szBuffer[128], *p, *argv[RESOLV_ARGS];
int argc;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
if (__nameservers > 0)
goto DONE;
if ((fp = fopen("/etc/resolv.conf", "r")) ||
(fp = fopen("/etc/config/resolv.conf", "r")))
{
while (fgets(szBuffer, sizeof(szBuffer), fp) != NULL) {
for (p = szBuffer; *p && isspace(*p); p++)
/* skip white space */;
if (*p == '\0' || *p == '\n' || *p == '#') /* skip comments etc */
continue;
argc = 0;
while (*p && argc < RESOLV_ARGS) {
argv[argc++] = p;
while (*p && !isspace(*p) && *p != '\n')
p++;
while (*p && (isspace(*p) || *p == '\n')) /* remove spaces */
*p++ = '\0';
}
if (strcmp(argv[0], "nameserver") == 0) {
for (i = 1; i < argc && __nameservers < MAX_SERVERS; i++) {
// TODO: what if strdup fails?
__nameserver[__nameservers++] = strdup(argv[i]);
DPRINTF("adding nameserver %s\n", argv[i]);
}
}
/* domain and search are mutually exclusive, the last one wins */
if (strcmp(argv[0],"domain") == 0 || strcmp(argv[0],"search") == 0) {
while (__searchdomains > 0) {
free(__searchdomain[--__searchdomains]);
__searchdomain[__searchdomains] = NULL;
}
for (i = 1; i < argc && __searchdomains < MAX_SEARCH; i++) {
// TODO: what if strdup fails?
__searchdomain[__searchdomains++] = strdup(argv[i]);
DPRINTF("adding search %s\n", argv[i]);
}
}
}
fclose(fp);
DPRINTF("nameservers = %d\n", __nameservers);
goto DONE;
}
DPRINTF("failed to open %s\n", "resolv.conf");
h_errno = NO_RECOVERY;
/* rv = -1; */
DONE:
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
/* return rv; */
}
#endif
#ifdef L_closenameservers
void attribute_hidden __close_nameservers(void)
{
__UCLIBC_MUTEX_LOCK(__resolv_lock);
while (__nameservers > 0) {
free(__nameserver[--__nameservers]);
__nameserver[__nameservers] = NULL;
}
while (__searchdomains > 0) {
free(__searchdomain[--__searchdomains]);
__searchdomain[__searchdomains] = NULL;
}
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
}
#endif
#ifdef L_gethostbyname
struct hostent *gethostbyname(const char *name)
{
static struct hostent h;
static char buf[sizeof(struct in_addr) +
sizeof(struct in_addr *)*2 +
sizeof(char *)*ALIAS_DIM + 384/*namebuffer*/ + 32/* margin */];
struct hostent *hp;
gethostbyname_r(name, &h, buf, sizeof(buf), &hp, &h_errno);
return hp;
}
libc_hidden_def(gethostbyname)
#endif
#ifdef L_gethostbyname2
struct hostent *gethostbyname2(const char *name, int family)
{
#ifndef __UCLIBC_HAS_IPV6__
return family == AF_INET ? gethostbyname(name) : (struct hostent*)0;
#else /* __UCLIBC_HAS_IPV6__ */
static struct hostent h;
static char buf[sizeof(struct in6_addr) +
sizeof(struct in6_addr *)*2 +
sizeof(char *)*ALIAS_DIM + 384/*namebuffer*/ + 32/* margin */];
struct hostent *hp;
gethostbyname2_r(name, family, &h, buf, sizeof(buf), &hp, &h_errno);
return hp;
#endif /* __UCLIBC_HAS_IPV6__ */
}
#endif
#ifdef L_res_init
/* We use __resolv_lock to guard access to global '_res' */
struct __res_state _res;
int res_init(void)
{
struct __res_state *rp = &(_res);
__UCLIBC_MUTEX_LOCK(__resolv_lock); /* must be a recursive lock! */
__close_nameservers();
__open_nameservers();
rp->retrans = RES_TIMEOUT;
rp->retry = 4;
rp->options = RES_INIT;
rp->id = (u_int) random();
rp->nsaddr.sin_addr.s_addr = INADDR_ANY;
rp->nsaddr.sin_family = AF_INET;
rp->nsaddr.sin_port = htons(NAMESERVER_PORT);
rp->ndots = 1;
/** rp->pfcode = 0; **/
rp->_vcsock = -1;
/** rp->_flags = 0; **/
/** rp->qhook = NULL; **/
/** rp->rhook = NULL; **/
/** rp->_u._ext.nsinit = 0; **/
if (__searchdomains) {
int i;
for (i = 0; i < __searchdomains; i++)
rp->dnsrch[i] = __searchdomain[i];
}
if (__nameservers) {
int i;
struct in_addr a;
for (i = 0; i < __nameservers; i++) {
if (inet_aton(__nameserver[i], &a)) {
rp->nsaddr_list[i].sin_addr = a;
rp->nsaddr_list[i].sin_family = AF_INET;
rp->nsaddr_list[i].sin_port = htons(NAMESERVER_PORT);
}
}
}
rp->nscount = __nameservers;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
return 0;
}
libc_hidden_def(res_init)
#ifdef __UCLIBC_HAS_BSD_RES_CLOSE__
void res_close(void)
{
__close_nameservers();
memset(&_res, 0, sizeof(_res));
}
#endif
#endif
#ifdef L_res_query
#ifndef MIN
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#endif
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;
int __nameserversXX;
char ** __nameserverXX;
if (!dname || class != 1 /* CLASS_IN */) {
h_errno = NO_RECOVERY;
return -1;
}
memset(&a, '\0', sizeof(a));
__open_nameservers();
__UCLIBC_MUTEX_LOCK(__resolv_lock);
__nameserversXX = __nameservers;
__nameserverXX = __nameserver;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
i = __dns_lookup(dname, type, __nameserversXX, __nameserverXX, &packet, &a);
if (i < 0) {
h_errno = TRY_AGAIN;
return -1;
}
free(a.dotted);
if (a.atype == type) { /* CNAME */
i = MIN(anslen, i);
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, * const *domain;
HEADER *hp = (HEADER *)(void *)answer;
u_int dots;
unsigned _state = 0;
int ret, saved_herrno;
u_long _res_options;
unsigned _res_ndots;
char **_res_dnsrch;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if ((!name || !answer) || ((_res_options & RES_INIT) == 0 && res_init() == -1)) {
h_errno = NETDB_INTERNAL;
return -1;
}
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;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_ndots = _res.ndots;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
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.
*/
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
_res_dnsrch = _res.dnsrch;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if ((!dots && (_res_options & RES_DEFNAMES)) ||
(dots && !(_state & __TRAILING_DOT) && (_res_options & RES_DNSRCH))) {
bool done = 0;
for (domain = (const char * const *)_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.
*/
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
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;
u_long _res_options;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
if ((!name || !answer) || ((_res_options & RES_INIT) == 0 && res_init() == -1)) {
h_errno = NETDB_INTERNAL;
return -1;
}
#ifdef DEBUG
__UCLIBC_MUTEX_LOCK(__resolv_lock);
_res_options = _res.options;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
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)
/* res_mkquery */
/* res_send */
/* dn_comp */
/* dn_expand */
#endif
#ifdef L_gethostbyaddr
struct hostent *gethostbyaddr (const void *addr, socklen_t len, int type)
{
static struct hostent h;
static char buf[
#ifndef __UCLIBC_HAS_IPV6__
sizeof(struct in_addr) + sizeof(struct in_addr *)*2 +
#else
sizeof(struct in6_addr) + sizeof(struct in6_addr *)*2 +
#endif /* __UCLIBC_HAS_IPV6__ */
sizeof(char *)*ALIAS_DIM + 384 /*namebuffer*/ + 32 /* margin */];
struct hostent *hp;
gethostbyaddr_r(addr, len, type, &h, buf, sizeof(buf), &hp, &h_errno);
return hp;
}
libc_hidden_def(gethostbyaddr)
#endif
#ifdef L_read_etc_hosts_r
FILE * __open_etc_hosts(void)
{
FILE * fp;
if ((fp = fopen("/etc/hosts", "r")) == NULL) {
fp = fopen("/etc/config/hosts", "r");
}
return fp;
}
int attribute_hidden __read_etc_hosts_r(FILE * fp, 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)
{
struct in_addr *in = NULL;
struct in_addr **addr_list = NULL;
#ifdef __UCLIBC_HAS_IPV6__
struct in6_addr *in6 = NULL;
struct in6_addr **addr_list6 = NULL;
#endif /* __UCLIBC_HAS_IPV6__ */
char *cp, **alias;
int aliases, i, ret = HOST_NOT_FOUND;
/* make sure user char * is aligned */
i = ALIGN_BUFFER_OFFSET(buf);
if (unlikely(i)) {
if (buflen < i)
return ERANGE;
buf += i;
buflen -= i;
}
if (buflen < sizeof(char *)*ALIAS_DIM)
return ERANGE;
alias = (char **)buf;
buf += sizeof(char **)*ALIAS_DIM;
buflen -= sizeof(char **)*ALIAS_DIM;
if (action != GETHOSTENT) {
#ifdef __UCLIBC_HAS_IPV6__
char *p = buf;
size_t len = buflen;
#endif /* __UCLIBC_HAS_IPV6__ */
*h_errnop = NETDB_INTERNAL;
if (buflen < sizeof(*in))
return ERANGE;
in = (struct in_addr*)buf;
buf += sizeof(*in);
buflen -= sizeof(*in);
if (buflen < sizeof(*addr_list)*2)
return ERANGE;
addr_list = (struct in_addr **)buf;
buf += sizeof(*addr_list)*2;
buflen -= sizeof(*addr_list)*2;
#ifdef __UCLIBC_HAS_IPV6__
if (len < sizeof(*in6))
return ERANGE;
in6 = (struct in6_addr*)p;
p += sizeof(*in6);
len -= sizeof(*in6);
if (len < sizeof(*addr_list6)*2)
return ERANGE;
addr_list6 = (struct in6_addr**)p;
p += sizeof(*addr_list6)*2;
len -= sizeof(*addr_list6)*2;
if (len < buflen) {
buflen = len;
buf = p;
}
#endif /* __UCLIBC_HAS_IPV6__ */
if (buflen < 80)
return ERANGE;
fp = __open_etc_hosts();
if (fp == NULL) {
*result = NULL;
return errno;
}
}
*h_errnop = HOST_NOT_FOUND;
while (fgets(buf, buflen, fp)) {
cp = strchr(buf, '#');
if (cp)
*cp = '\0';
DPRINTF("Looking at: %s\n", buf);
aliases = 0;
cp = buf;
while (*cp) {
while (*cp && isspace(*cp))
*cp++ = '\0';
if (!*cp)
break;
if (aliases < (2+MAX_ALIASES))
alias[aliases++] = cp;
while (*cp && !isspace(*cp))
cp++;
}
alias[aliases] = 0;
if (aliases < 2)
continue; /* syntax error really */
if (action == GETHOSTENT) {
/* Return whatever the next entry happens to be. */
break;
}
if (action == GET_HOSTS_BYADDR) {
if (strcmp(name, alias[0]) != 0)
continue;
} else {
/* GET_HOSTS_BYNAME */
for (i = 1; i < aliases; i++)
if (strcasecmp(name, alias[i]) == 0)
break;
if (i >= aliases)
continue;
}
if (type == AF_INET && inet_pton(AF_INET, alias[0], in) > 0) {
DPRINTF("Found INET\n");
addr_list[0] = in;
addr_list[1] = 0;
result_buf->h_name = alias[1];
result_buf->h_addrtype = AF_INET;
result_buf->h_length = sizeof(*in);
result_buf->h_addr_list = (char**) addr_list;
result_buf->h_aliases = alias + 2;
*result = result_buf;
ret = NETDB_SUCCESS;
#ifdef __UCLIBC_HAS_IPV6__
} else if (type == AF_INET6 && inet_pton(AF_INET6, alias[0], in6) > 0) {
DPRINTF("Found INET6\n");
addr_list6[0] = in6;
addr_list6[1] = 0;
result_buf->h_name = alias[1];
result_buf->h_addrtype = AF_INET6;
result_buf->h_length = sizeof(*in6);
result_buf->h_addr_list = (char**) addr_list6;
result_buf->h_aliases = alias + 2;
*result = result_buf;
ret = NETDB_SUCCESS;
#endif /* __UCLIBC_HAS_IPV6__ */
} 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 diff network type\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)
fclose(fp);
return ret;
}
#endif
#ifdef L_gethostent
__UCLIBC_MUTEX_STATIC(mylock, PTHREAD_MUTEX_INITIALIZER);
static smallint __stay_open;
static FILE * __gethostent_fp;
void endhostent(void)
{
__UCLIBC_MUTEX_LOCK(mylock);
__stay_open = 0;
if (__gethostent_fp) {
fclose(__gethostent_fp);
__gethostent_fp = NULL;
}
__UCLIBC_MUTEX_UNLOCK(mylock);
}
void sethostent(int stay_open)
{
__UCLIBC_MUTEX_LOCK(mylock);
__stay_open = (stay_open != 0);
__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 (__gethostent_fp == NULL) {
__gethostent_fp = __open_etc_hosts();
if (__gethostent_fp == NULL) {
*result = NULL;
ret = TRY_AGAIN;
goto DONE;
}
}
ret = __read_etc_hosts_r(__gethostent_fp, NULL, AF_INET, GETHOSTENT,
result_buf, buf, buflen, result, h_errnop);
if (__stay_open == 0) {
fclose(__gethostent_fp);
__gethostent_fp = NULL;
}
DONE:
__UCLIBC_MUTEX_UNLOCK(mylock);
return ret;
}
libc_hidden_def(gethostent_r)
struct hostent *gethostent(void)
{
static struct hostent h;
static char buf[
#ifndef __UCLIBC_HAS_IPV6__
sizeof(struct in_addr) + sizeof(struct in_addr *)*2 +
#else
sizeof(struct in6_addr) + sizeof(struct in6_addr *)*2 +
#endif /* __UCLIBC_HAS_IPV6__ */
sizeof(char *)*ALIAS_DIM +
80 /*namebuffer*/ + 2 /* margin */];
struct hostent *host;
__UCLIBC_MUTEX_LOCK(mylock);
gethostent_r(&h, buf, sizeof(buf), &host, &h_errno);
__UCLIBC_MUTEX_UNLOCK(mylock);
return host;
}
#endif
#ifdef L_get_hosts_byname_r
int attribute_hidden __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
#ifdef L_get_hosts_byaddr_r
int attribute_hidden __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 /* __UCLIBC_HAS_IPV6__ */
switch (type) {
case AF_INET:
if (len != sizeof(struct in_addr))
return 0;
break;
#ifdef __UCLIBC_HAS_IPV6__
case AF_INET6:
if (len != sizeof(struct in6_addr))
return 0;
break;
#endif /* __UCLIBC_HAS_IPV6__ */
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
#ifdef L_getnameinfo
#ifndef min
# define min(x,y) (((x) > (y)) ? (y) : (x))
#endif /* min */
libc_hidden_proto(getnameinfo)
int getnameinfo(const struct sockaddr *sa, socklen_t addrlen, char *host,
socklen_t hostlen, char *serv, socklen_t servlen,
unsigned int flags)
{
int serrno = errno;
unsigned ok;
struct hostent *h = 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))
goto BAD_FAM;
ok = sa->sa_family;
if (ok == AF_LOCAL) /* valid */;
#ifdef __UCLIBC_HAS_IPV4__
else if (ok == AF_INET) {
if (addrlen < sizeof (struct sockaddr_in))
goto BAD_FAM;
}
#endif
#ifdef __UCLIBC_HAS_IPV6__
else if (ok == AF_INET6) {
if (addrlen < sizeof (struct sockaddr_in6))
goto BAD_FAM;
}
#endif /* __UCLIBC_HAS_IPV6__ */
else
BAD_FAM:
return EAI_FAMILY;
ok = 0;
if (host != NULL && hostlen > 0)
switch (sa->sa_family) {
case AF_INET:
#ifdef __UCLIBC_HAS_IPV6__
case AF_INET6:
#endif /* __UCLIBC_HAS_IPV6__ */
if (!(flags & NI_NUMERICHOST)) {
#ifdef __UCLIBC_HAS_IPV6__
if (sa->sa_family == AF_INET6)
h = gethostbyaddr ((const void *)
&(((const struct sockaddr_in6 *) sa)->sin6_addr),
sizeof(struct in6_addr), AF_INET6);
#endif /* __UCLIBC_HAS_IPV6__ */
#if defined __UCLIBC_HAS_IPV6__ && defined __UCLIBC_HAS_IPV4__
else
#endif
#ifdef __UCLIBC_HAS_IPV4__
h = gethostbyaddr ((const void *)
&(((const struct sockaddr_in *)sa)->sin_addr),
sizeof(struct in_addr), AF_INET);
#endif /* __UCLIBC_HAS_IPV4__ */
if (h) {
char *c;
if ((flags & NI_NOFQDN)
&& (__libc_getdomainname (domain, sizeof(domain)) == 0)
&& (c = strstr (h->h_name, domain))
&& (c != h->h_name) && (*(--c) == '.')) {
strncpy (host, h->h_name,
min(hostlen, (size_t) (c - h->h_name)));
host[min(hostlen - 1, (size_t) (c - h->h_name))] = '\0';
} else {
strncpy (host, h->h_name, hostlen);
}
ok = 1;
}
}
if (!ok) {
const char *c;
if (flags & NI_NAMEREQD) {
errno = serrno;
return EAI_NONAME;
}
#ifdef __UCLIBC_HAS_IPV6__
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_IPV6__ && defined __UCLIBC_HAS_IPV4__
else
#endif /* __UCLIBC_HAS_IPV6__ && defined __UCLIBC_HAS_IPV4__ */
#if defined __UCLIBC_HAS_IPV4__
c = inet_ntop (AF_INET, (const void *)
&(((const struct sockaddr_in *) sa)->sin_addr),
host, hostlen);
#endif /* __UCLIBC_HAS_IPV4__ */
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
#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;
*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 == 0)
return i;
switch (*h_errnop) {
case HOST_NOT_FOUND:
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;
strcpy(buf, name);
alias0 = buf;
buf += i;
buflen -= i;
/* make sure pointer is aligned */
i = ALIGN_BUFFER_OFFSET(buf);
buf += i;
buflen -= i;
alias = (char **)buf;
buf += sizeof(alias[0]) * 2;
buflen -= sizeof(alias[0]) * 2;
addr_list = (struct in_addr **)buf;
/* do not use *buf or buflen before this verification! */
/* buflen may be < 0, must do signed compare */
if ((ssize_t)buflen < 256)
return ERANGE;
/* we store only one "alias" - the name itself */
#ifdef __UCLIBC_MJN3_ONLY__
#warning TODO -- generate the full list
#endif
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;
}
}
/* talk to DNS servers */
__open_nameservers();
{
int __nameserversXX;
char ** __nameserverXX;
__UCLIBC_MUTEX_LOCK(__resolv_lock);
__nameserversXX = __nameservers;
__nameserverXX = __nameserver;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
a.buf = buf;
/* take into account that at least one address will be there,
* we'll need space of one in_addr + two addr_list[] elems */
a.buflen = buflen - ((sizeof(addr_list[0]) * 2 + sizeof(struct in_addr)));
a.add_count = 0;
i = __dns_lookup(name, T_A, __nameserversXX, __nameserverXX, &packet, &a);
if (i < 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;
i = TRY_AGAIN;
free_and_ret:
free(a.dotted);
free(packet);
return i;
}
libc_hidden_def(gethostbyname_r)
#endif
#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 /* __UCLIBC_HAS_IPV6__ */
struct in6_addr *in;
struct in6_addr **addr_list;
unsigned char *packet;
struct resolv_answer a;
int i;
int nest = 0;
int __nameserversXX;
char ** __nameserverXX;
int wrong_af = 0;
if (family == AF_INET)
return gethostbyname_r(name, result_buf, buf, buflen, result, h_errnop);
if (family != AF_INET6)
return EINVAL;
__open_nameservers();
*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, family, result_buf,
buf, buflen, result, h_errnop);
if (i == NETDB_SUCCESS) {
//FIXME: restore 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;
if (buflen < sizeof(*in))
return ERANGE;
in = (struct in6_addr*)buf;
buf += sizeof(*in);
buflen -= sizeof(*in);
if (buflen < sizeof(*addr_list)*2)
return ERANGE;
addr_list = (struct in6_addr**)buf;
buf += sizeof(*addr_list)*2;
buflen -= sizeof(*addr_list)*2;
addr_list[0] = in;
addr_list[1] = 0;
if (buflen < 256)
return ERANGE;
strncpy(buf, name, buflen);
/* First check if this is already an address */
if (inet_pton(AF_INET6, name, in)) {
result_buf->h_name = buf;
result_buf->h_addrtype = AF_INET6;
result_buf->h_length = sizeof(*in);
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;
}
memset(&a, '\0', sizeof(a));
for (;;) {
__UCLIBC_MUTEX_LOCK(__resolv_lock);
__nameserversXX = __nameservers;
__nameserverXX = __nameserver;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
i = __dns_lookup(buf, T_AAAA, __nameserversXX, __nameserverXX, &packet, &a);
if (i < 0) {
*h_errnop = HOST_NOT_FOUND;
return TRY_AGAIN;
}
strncpy(buf, a.dotted, buflen);
free(a.dotted);
if (a.atype == T_CNAME) { /* CNAME */
DPRINTF("Got a CNAME in gethostbyname()\n");
i = __decode_dotted(packet, a.rdoffset, buf, buflen);
free(packet);
if (i < 0) {
*h_errnop = NO_RECOVERY;
return -1;
}
if (++nest > MAX_RECURSE) {
*h_errnop = NO_RECOVERY;
return -1;
}
continue;
}
if (a.atype == T_AAAA) { /* ADDRESS */
memcpy(in, a.rdata, sizeof(*in));
result_buf->h_name = buf;
result_buf->h_addrtype = AF_INET6;
result_buf->h_length = sizeof(*in);
result_buf->h_addr_list = (char **) addr_list;
free(packet);
break;
}
free(packet);
*h_errnop = HOST_NOT_FOUND;
return TRY_AGAIN;
}
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
return NETDB_SUCCESS;
#endif /* __UCLIBC_HAS_IPV6__ */
}
libc_hidden_def(gethostbyname2_r)
#endif
#ifdef L_gethostbyaddr_r
int gethostbyaddr_r(const void *addr, socklen_t len, 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;
#ifdef __UCLIBC_HAS_IPV6__
char *qp;
size_t plen;
struct in6_addr *in6;
struct in6_addr **addr_list6;
#endif /* __UCLIBC_HAS_IPV6__ */
char **alias;
unsigned char *packet;
struct resolv_answer a;
int i;
int nest = 0;
int __nameserversXX;
char ** __nameserverXX;
*result = NULL;
if (!addr)
return EINVAL;
memset((char *) &a, '\0', sizeof(a));
switch (type) {
case AF_INET:
if (len != sizeof(struct in_addr))
return EINVAL;
break;
#ifdef __UCLIBC_HAS_IPV6__
case AF_INET6:
if (len != sizeof(struct in6_addr))
return EINVAL;
break;
#endif /* __UCLIBC_HAS_IPV6__ */
default:
return EINVAL;
}
/* do /etc/hosts first */
if ((i = __get_hosts_byaddr_r(addr, len, type, result_buf,
buf, buflen, result, h_errnop)) == 0)
return i;
switch (*h_errnop) {
case HOST_NOT_FOUND:
case NO_ADDRESS:
break;
default:
return i;
}
__open_nameservers();
#ifdef __UCLIBC_HAS_IPV6__
qp = buf;
plen = buflen;
#endif /* __UCLIBC_HAS_IPV6__ */
*h_errnop = NETDB_INTERNAL;
if (buflen < sizeof(*in))
return ERANGE;
in = (struct in_addr*)buf;
buf += sizeof(*in);
buflen -= sizeof(*in);
if (buflen < sizeof(*addr_list)*2)
return ERANGE;
addr_list = (struct in_addr**)buf;
buf += sizeof(*addr_list)*2;
buflen -= sizeof(*addr_list)*2;
if (buflen < sizeof(char *)*ALIAS_DIM)
return ERANGE;
alias = (char **)buf;
buf += sizeof(*alias)*ALIAS_DIM;
buflen -= sizeof(*alias)*ALIAS_DIM;
#ifdef __UCLIBC_HAS_IPV6__
if (plen < sizeof(*in6))
return ERANGE;
in6 = (struct in6_addr*)qp;
qp += sizeof(*in6);
plen -= sizeof(*in6);
if (plen < sizeof(*addr_list6)*2)
return ERANGE;
addr_list6 = (struct in6_addr**)qp;
qp += sizeof(*addr_list6)*2;
plen -= sizeof(*addr_list6)*2;
if (plen < buflen) {
buflen = plen;
buf = qp;
}
#endif /* __UCLIBC_HAS_IPV6__ */
if (buflen < 256)
return ERANGE;
if (type == AF_INET) {
unsigned char *tmp_addr = (unsigned char *)addr;
memcpy(&in->s_addr, addr, len);
addr_list[0] = in;
sprintf(buf, "%u.%u.%u.%u.in-addr.arpa",
tmp_addr[3], tmp_addr[2], tmp_addr[1], tmp_addr[0]);
#ifdef __UCLIBC_HAS_IPV6__
} else {
memcpy(in6->s6_addr, addr, len);
addr_list6[0] = in6;
qp = buf;
for (i = len - 1; i >= 0; i--) {
qp += sprintf(qp, "%x.%x.", in6->s6_addr[i] & 0xf,
(in6->s6_addr[i] >> 4) & 0xf);
}
strcpy(qp, "ip6.arpa");
#endif /* __UCLIBC_HAS_IPV6__ */
}
addr_list[1] = 0;
alias[0] = buf;
alias[1] = 0;
for (;;) {
__UCLIBC_MUTEX_LOCK(__resolv_lock);
__nameserversXX = __nameservers;
__nameserverXX = __nameserver;
__UCLIBC_MUTEX_UNLOCK(__resolv_lock);
i = __dns_lookup(buf, T_PTR, __nameserversXX, __nameserverXX, &packet, &a);
if (i < 0) {
*h_errnop = HOST_NOT_FOUND;
return TRY_AGAIN;
}
strncpy(buf, a.dotted, buflen);
free(a.dotted);
if (a.atype == T_CNAME) { /* CNAME */
DPRINTF("Got a CNAME in gethostbyaddr()\n");
i = __decode_dotted(packet, a.rdoffset, buf, buflen);
free(packet);
if (i < 0) {
*h_errnop = NO_RECOVERY;
return -1;
}
if (++nest > MAX_RECURSE) {
*h_errnop = NO_RECOVERY;
return -1;
}
continue;
}
if (a.atype == T_PTR) { /* ADDRESS */
i = __decode_dotted(packet, a.rdoffset, buf, buflen);
free(packet);
result_buf->h_name = buf;
result_buf->h_addrtype = type;
if (type == AF_INET) {
result_buf->h_length = sizeof(*in);
#ifdef __UCLIBC_HAS_IPV6__
} else {
result_buf->h_length = sizeof(*in6);
#endif /* __UCLIBC_HAS_IPV6__ */
}
result_buf->h_addr_list = (char **) addr_list;
result_buf->h_aliases = alias;
break;
}
free(packet);
*h_errnop = NO_ADDRESS;
return TRY_AGAIN;
}
*result = result_buf;
*h_errnop = NETDB_SUCCESS;
return NETDB_SUCCESS;
}
libc_hidden_def(gethostbyaddr_r)
#endif
#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;
}
#endif /* L_res_comp */
#ifdef L_ns_name
/*
* printable(ch)
* Thinking in noninternationalized USASCII (per the DNS spec),
* is this character visible and not a space when printed ?
* return:
* boolean.
*/
static int printable(int ch)
{
return (ch > 0x20 && ch < 0x7f);
}
/*
* special(ch)
* Thinking in noninternationalized USASCII (per the DNS spec),
* is this characted special ("in need of quoting") ?
* return:
* boolean.
*/
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;
if ((n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp)) == -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)
{
static const char digits[] = "0123456789";
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 ((void)NULL; 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++ = digits[c / 100];
*dn++ = digits[(c % 100) / 10];
*dn++ = digits[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)
/*
* 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)
#endif /* L_ns_name */
/* vi: set sw=4 ts=4: */
|