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
|
// $Id$
#define ACE_BUILD_DLL
#include "ace/ACE.h"
#include "ace/Handle_Set.h"
#include "ace/Auto_Ptr.h"
#include "ace/INET_Addr.h"
#include "ace/Object_Manager.h"
#include "ace/SString.h"
#include "ace/Version.h"
#if defined (ACE_LACKS_INLINE_FUNCTIONS)
#include "ace/ACE.i"
#endif /* ACE_LACKS_INLINE_FUNCTIONS */
ACE_RCSID(ace, ACE, "$Id$")
// Static data members.
u_int ACE::init_fini_count_ = 0;
// Keeps track of whether we're in some global debug mode.
char ACE::debug_ = 0;
// Hex characters.
const char ACE::hex_chars_[] = "0123456789abcdef";
// Size of a VM page.
size_t ACE::pagesize_ = 0;
// Size of allocation granularity.
size_t ACE::allocation_granularity_ = 0;
int
ACE::out_of_handles (int error)
{
// EMFILE is common to all platforms.
if (error == EMFILE ||
#if defined (ACE_WIN32)
// On Win32, we need to check for ENOBUFS also.
error == ENOBUFS ||
#elif defined (HPUX)
// On HPUX, we need to check for EADDRNOTAVAIL also.
error == EADDRNOTAVAIL ||
#elif defined (linux)
// On linux, we need to check for ENOENT also.
error == ENOENT ||
#elif defined (sun)
// On sun, we need to check for ENOSR also.
error == ENOSR ||
#endif /* ACE_WIN32 */
error == ENFILE)
return 1;
else
return 0;
}
int
ACE::init (void)
{
// Don't use ACE_TRACE, because Object_Manager might not have been
// instantiated yet.
// ACE_TRACE ("ACE::init");
++init_fini_count_;
return ACE_Object_Manager::instance ()->init ();
}
int
ACE::fini (void)
{
ACE_TRACE ("ACE::fini");
if (init_fini_count_ > 0)
{
if (--init_fini_count_ == 0)
return ACE_Object_Manager::instance ()->fini ();
else
// Wait for remaining fini () calls.
return 1;
}
else
// More ACE::fini () calls than ACE::init () calls. Bad
// application!
return -1;
}
u_int
ACE::major_version (void)
{
return ACE_MAJOR_VERSION;
}
u_int
ACE::minor_version (void)
{
return ACE_MINOR_VERSION;
}
u_int
ACE::beta_version (void)
{
return ACE_BETA_VERSION;
}
const char*
ACE::compiler_name (void)
{
#ifdef ACE_CC_NAME
return ACE_CC_NAME;
#else
return "";
#endif
}
u_int
ACE::compiler_major_version (void)
{
#ifdef ACE_CC_MAJOR_VERSION
return ACE_CC_MAJOR_VERSION;
#else
return 0;
#endif
}
u_int
ACE::compiler_minor_version (void)
{
#ifdef ACE_CC_MINOR_VERSION
return ACE_CC_MINOR_VERSION;
#else
return 0;
#endif
}
u_int
ACE::compiler_beta_version (void)
{
#ifdef ACE_CC_BETA_VERSION
return ACE_CC_BETA_VERSION;
#else
return 0;
#endif
}
int
ACE::terminate_process (pid_t pid)
{
#if defined (ACE_HAS_PHARLAP)
ACE_UNUSED_ARG (pid);
ACE_NOTSUP_RETURN (-1);
#elif defined (ACE_WIN32)
// Create a handle for the given process id.
ACE_HANDLE process_handle =
::OpenProcess (PROCESS_TERMINATE,
FALSE, // New handle is not inheritable.
pid);
if (process_handle == ACE_INVALID_HANDLE
|| process_handle == 0)
return -1;
else
{
// Kill the process associated with process_handle.
BOOL terminate_result =
::TerminateProcess (process_handle, 0);
// Free up the kernel resources.
ACE_OS::close (process_handle);
return terminate_result;
}
#elif defined (CHORUS)
KnCap cap_;
// Use the pid to find out the actor's capability, then kill it.
if (::acap (AM_MYSITE, pid, &cap_) == 0)
return ::akill (&cap_);
else
return -1;
#else
return ACE_OS::kill (pid, 9);
#endif /* ACE_WIN32 */
}
int
ACE::process_active (pid_t pid)
{
#if !defined(ACE_WIN32)
int retval = ACE_OS::kill (pid, 0);
if (retval == 0)
return 1;
else if (errno == ESRCH)
return 0;
else
return -1;
#else
// Create a handle for the given process id.
ACE_HANDLE process_handle =
::OpenProcess (PROCESS_QUERY_INFORMATION, FALSE, pid);
if (process_handle == ACE_INVALID_HANDLE
|| process_handle == 0)
return 0;
else
{
DWORD status;
if (::GetExitCodeProcess (process_handle,
&status) == 0
|| status != STILL_ACTIVE)
return 0;
else
return 1;
}
#endif /* ACE_WIN32 */
}
// Split a string up into 'token'-delimited pieces, ala Perl's
// "split".
char *
ACE::strsplit_r (char *str,
const char *token,
char *&next_start)
{
char *result = 0;
if (str != 0)
next_start = str;
if (next_start != 0)
{
char *tok_loc = ACE_OS::strstr (next_start, token);
if (tok_loc != 0)
{
// Return the beginning of the string.
result = next_start;
// Insure it's terminated.
*tok_loc = '\0';
next_start = tok_loc + ACE_OS::strlen (token);
}
else
{
result = next_start;
next_start = (char *) 0;
}
}
return result;
}
const char *
ACE::execname (const char *old_name)
{
#if defined (ACE_WIN32)
if (ACE_OS::strstr (old_name, ".exe") == 0)
{
char *new_name;
size_t size =
ACE_OS::strlen (old_name)
+ ACE_OS::strlen (".exe")
+ 1;
ACE_NEW_RETURN (new_name,
char[size],
-1);
char *end = new_name;
end = ACE_OS::strecpy (new_name, old_name);
// Concatenate the .exe suffix onto the end of the executable.
ACE_OS::strcpy (end, ".exe");
return new_name;
}
#endif /* ACE_WIN32 */
return old_name;
}
#if defined (ACE_HAS_UNICODE)
size_t
ACE::strrepl (wchar_t *s, wchar_t search, wchar_t replace)
{
ACE_TRACE ("ACE::strrepl");
size_t replaced = 0;
for (size_t i = 0; s[i] != '\0'; i++)
if (s[i] == search)
{
s[i] = replace;
replaced++;
}
return replaced;
}
wchar_t *
ACE::strsplit_r (wchar_t *str,
const wchar_t *token,
wchar_t *&next_start)
{
wchar_t *result = 0;
if (str != 0)
next_start = str;
if (next_start != 0)
{
wchar_t *tok_loc = ACE_OS::strstr (next_start, token);
if (tok_loc != 0)
{
// Return the beginning of the string.
result = next_start;
// Insure it's terminated.
*tok_loc = '\0';
next_start = tok_loc + ACE_OS::strlen (token);
}
else
{
result = next_start;
next_start = (wchar_t *) 0;
}
}
return result;
}
const wchar_t *
ACE::execname (const wchar_t *old_name)
{
#if defined (ACE_WIN32)
if (ACE_OS::strstr (old_name, L".exe") == 0)
{
wchar_t *new_name;
size_t size =
ACE_OS::strlen (old_name)
+ ACE_OS::strlen (L".exe")
+ 1;
ACE_NEW_RETURN (new_name,
wchar_t[size],
-1);
wchar_t *end = new_name;
end = ACE_OS::strecpy (new_name, old_name);
// Concatenate the .exe suffix onto the end of the executable.
ACE_OS::strcpy (end, L".exe");
return new_name;
}
#endif /* ACE_WIN32 */
return old_name;
}
#endif /* ACE_HAS_UNICODE */
u_long
ACE::hash_pjw (const char *str, size_t len)
{
u_long hash = 0;
for (size_t i = 0; i < len; i++)
{
const char temp = str[i];
hash = (hash << 4) + (temp * 13);
u_long g = hash & 0xf0000000;
if (g)
{
hash ^= (g >> 24);
hash ^= g;
}
}
return hash;
}
u_long
ACE::hash_pjw (const char *str)
{
return ACE::hash_pjw (str, ACE_OS::strlen (str));
}
#if !defined (ACE_HAS_WCHAR_TYPEDEFS_CHAR)
u_long
ACE::hash_pjw (const wchar_t *str, size_t len)
{
u_long hash = 0;
for (size_t i = 0; i < len; i++)
{
const wchar_t temp = str[i];
hash = (hash << 4) + (temp * 13);
u_long g = hash & 0xf0000000;
if (g)
{
hash ^= (g >> 24);
hash ^= g;
}
}
return hash;
}
u_long
ACE::hash_pjw (const wchar_t *str)
{
return ACE::hash_pjw (str, ACE_OS::strlen (str));
}
#endif /* ACE_HAS_WCHAR_TYPEDEFS_CHAR */
#if !defined (ACE_HAS_WCHAR_TYPEDEFS_USHORT)
u_long
ACE::hash_pjw (const ACE_USHORT16 *str, size_t len)
{
u_long hash = 0;
for (size_t i = 0; i < len; i++)
{
const ACE_USHORT16 temp = str[i];
hash = (hash << 4) + (temp * 13);
u_long g = hash & 0xf0000000;
if (g)
{
hash ^= (g >> 24);
hash ^= g;
}
}
return hash;
}
u_long
ACE::hash_pjw (const ACE_USHORT16 *str)
{
return ACE::hash_pjw (str, ACE_OS::strlen (str));
}
#endif /* ! ACE_HAS_WCHAR_TYPEDEFS_USHORT */
// The CRC routine was taken from the FreeBSD implementation of cksum,
// that falls under the following license:
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* James W. Williams of NASA Goddard Space Flight Center.
*
* 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 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.
*/
u_long ACE::crc_table_[] =
{
0x0,
0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b,
0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6,
0x2b4bcb61, 0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd,
0x4c11db70, 0x48d0c6c7, 0x4593e01e, 0x4152fda9, 0x5f15adac,
0x5bd4b01b, 0x569796c2, 0x52568b75, 0x6a1936c8, 0x6ed82b7f,
0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3, 0x709f7b7a,
0x745e66cd, 0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039,
0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5, 0xbe2b5b58,
0xbaea46ef, 0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033,
0xa4ad16ea, 0xa06c0b5d, 0xd4326d90, 0xd0f37027, 0xddb056fe,
0xd9714b49, 0xc7361b4c, 0xc3f706fb, 0xceb42022, 0xca753d95,
0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1, 0xe13ef6f4,
0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d, 0x34867077, 0x30476dc0,
0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5,
0x2ac12072, 0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16,
0x018aeb13, 0x054bf6a4, 0x0808d07d, 0x0cc9cdca, 0x7897ab07,
0x7c56b6b0, 0x71159069, 0x75d48dde, 0x6b93dddb, 0x6f52c06c,
0x6211e6b5, 0x66d0fb02, 0x5e9f46bf, 0x5a5e5b08, 0x571d7dd1,
0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b,
0xbb60adfc, 0xb6238b25, 0xb2e29692, 0x8aad2b2f, 0x8e6c3698,
0x832f1041, 0x87ee0df6, 0x99a95df3, 0x9d684044, 0x902b669d,
0x94ea7b2a, 0xe0b41de7, 0xe4750050, 0xe9362689, 0xedf73b3e,
0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2, 0xc6bcf05f,
0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34,
0xdc3abded, 0xd8fba05a, 0x690ce0ee, 0x6dcdfd59, 0x608edb80,
0x644fc637, 0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb,
0x4f040d56, 0x4bc510e1, 0x46863638, 0x42472b8f, 0x5c007b8a,
0x58c1663d, 0x558240e4, 0x51435d53, 0x251d3b9e, 0x21dc2629,
0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5, 0x3f9b762c,
0x3b5a6b9b, 0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff,
0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623, 0xf12f560e,
0xf5ee4bb9, 0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65,
0xeba91bbc, 0xef68060b, 0xd727bbb6, 0xd3e6a601, 0xdea580d8,
0xda649d6f, 0xc423cd6a, 0xc0e2d0dd, 0xcda1f604, 0xc960ebb3,
0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7, 0xae3afba2,
0xaafbe615, 0xa7b8c0cc, 0xa379dd7b, 0x9b3660c6, 0x9ff77d71,
0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74,
0x857130c3, 0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640,
0x4e8ee645, 0x4a4ffbf2, 0x470cdd2b, 0x43cdc09c, 0x7b827d21,
0x7f436096, 0x7200464f, 0x76c15bf8, 0x68860bfd, 0x6c47164a,
0x61043093, 0x65c52d24, 0x119b4be9, 0x155a565e, 0x18197087,
0x1cd86d30, 0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec,
0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d,
0x2056cd3a, 0x2d15ebe3, 0x29d4f654, 0xc5a92679, 0xc1683bce,
0xcc2b1d17, 0xc8ea00a0, 0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb,
0xdbee767c, 0xe3a1cbc1, 0xe760d676, 0xea23f0af, 0xeee2ed18,
0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4, 0x89b8fd09,
0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662,
0x933eb0bb, 0x97ffad0c, 0xafb010b1, 0xab710d06, 0xa6322bdf,
0xa2f33668, 0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4
};
// Compute a POSIX 1003.2 checksum. The routine takes an string and
// computes the CRC for it (it stops on the first '\0' character).
// UNICOS UINT32's are 64-bit on the Cray PVP architecture
#if !defined(_UNICOS)
# define COMPUTE(var, ch) (var) = ((var) << 8) ^ ACE::crc_table_[((var) >> 24) ^ (ch)]
#else /* ! _UNICOS */
# define COMPUTE(var, ch) (var) = ( 0x00000000ffffffff & ((var) << 8)) ^ ACE::crc_table_[((var) >> 24) ^ (ch)]
#endif /* ! _UNICOS */
u_long
ACE::crc32 (const char *string)
{
register ACE_UINT32 crc = 0;
u_long len = 0;
for (const char *p = string;
*p != 0;
++p)
{
COMPUTE (crc, *p);
++len;
}
// Include the length of the string.
for (; len != 0; len >>= 8)
COMPUTE (crc, len & 0xff);
return ~crc;
}
u_long
ACE::crc32 (const char *buffer, ACE_UINT32 len)
{
register ACE_UINT32 crc = 0;
for (const char *p = buffer;
p != buffer + len;
++p)
{
COMPUTE (crc, *p);
}
// Include the length of the string.
for (; len != 0; len >>= 8)
COMPUTE (crc, len & 0xff);
return ~crc;
}
#undef COMPUTE
size_t
ACE::strrepl (char *s, char search, char replace)
{
ACE_TRACE ("ACE::strrepl");
size_t replaced = 0;
for (size_t i = 0; s[i] != '\0'; i++)
if (s[i] == search)
{
s[i] = replace;
replaced++;
}
return replaced;
}
#if !defined (ACE_HAS_WINCE)
ASYS_TCHAR *
ACE::strenvdup (const ASYS_TCHAR *str)
{
ACE_TRACE ("ACE::strenvdup");
return ACE_OS::strenvdup (str);
}
#endif /* ACE_HAS_WINCE */
/*
Examples:
Source NT UNIX
==================================================================
netsvc netsvc.dll libnetsvc.so
(PATH will be (LD_LIBRARY_PATH
evaluated) evaluated)
libnetsvc.dll libnetsvc.dll libnetsvc.dll + warning
netsvc.so netsvc.so + warning libnetsvc.so
..\../libs/netsvc ..\..\libs\netsvc.dll ../../libs/netsvc.so
(absolute path used) (absolute path used)
*/
#if ! defined (ACE_PSOS_DIAB_MIPS)
int
ACE::ldfind (const ASYS_TCHAR filename[],
ASYS_TCHAR pathname[],
size_t maxpathnamelen)
{
ACE_TRACE ("ACE::ldfind");
#if defined (ACE_WIN32) && !defined (ACE_HAS_WINCE) && \
!defined (ACE_HAS_PHARLAP)
ASYS_TCHAR expanded_filename[MAXPATHLEN];
#if !defined (ACE_HAS_MOSTLY_UNICODE_APIS)
if (::ExpandEnvironmentStringsA (filename,
expanded_filename,
sizeof expanded_filename))
#else
if (::ExpandEnvironmentStringsW (filename,
expanded_filename,
sizeof expanded_filename))
#endif /* ACE_HAS_MOSTLY_UNICODE_APIS */
filename = expanded_filename;
#endif /* ACE_WIN32 && !ACE_HAS_WINCE && !ACE_HAS_PHARLAP */
ASYS_TCHAR tempcopy[MAXPATHLEN + 1];
ASYS_TCHAR searchpathname[MAXPATHLEN + 1];
ASYS_TCHAR searchfilename[MAXPATHLEN + 2];
// Create a copy of filename to work with.
if (ACE_OS::strlen (filename) + 1
> (sizeof tempcopy / sizeof (ASYS_TCHAR)))
{
errno = ENOMEM;
return -1;
}
else
ACE_OS::strcpy (tempcopy, filename);
// Insert canonical directory separators.
ASYS_TCHAR *separator_ptr;
#if (ACE_DIRECTORY_SEPARATOR_CHAR != '/')
// Make all the directory separators ``canonical'' to simplify
// subsequent code.
ACE::strrepl (tempcopy, ACE_DIRECTORY_SEPARATOR_CHAR, '/');
#endif /* ACE_DIRECTORY_SEPARATOR_CHAR */
// Separate filename from pathname.
separator_ptr = ACE_OS::strrchr (tempcopy, '/');
// This is a relative path.
if (separator_ptr == 0)
{
searchpathname[0] = '\0';
ACE_OS::strcpy (searchfilename, tempcopy);
}
else // This is an absolute path.
{
ACE_OS::strcpy (searchfilename, separator_ptr + 1);
separator_ptr[1] = '\0';
ACE_OS::strcpy (searchpathname, tempcopy);
}
int got_suffix = 0;
// Check to see if this has an appropriate DLL suffix for the OS
// platform.
ASYS_TCHAR *s = ACE_OS::strrchr (searchfilename, '.');
const ASYS_TCHAR *dll_suffix =
ASYS_TEXT (ACE_DLL_SUFFIX);
if (s != 0)
{
// If we have a dot, we have a suffix
got_suffix = 1;
// Check whether this matches the appropriate platform-specific
// suffix.
if (ACE_OS::strcmp (s, dll_suffix) != 0)
{
ACE_ERROR ((LM_WARNING,
ASYS_TEXT ("Warning: improper suffix for a ")
ASYS_TEXT ("shared library on this platform: %s\n"),
s));
}
}
// Make sure we've got enough space in searchfilename.
if (ACE_OS::strlen (searchfilename)
+ ACE_OS::strlen (ACE_DLL_PREFIX)
+ got_suffix ? 0 : ACE_OS::strlen (dll_suffix) >= (sizeof searchfilename /
sizeof (ASYS_TCHAR)))
{
errno = ENOMEM;
return -1;
}
#if defined (ACE_WIN32) && defined (_DEBUG) && !defined (ACE_DISABLE_DEBUG_DLL_CHECK)
size_t len_searchfilename = ACE_OS::strlen (searchfilename);
if (! got_suffix)
{
searchfilename [len_searchfilename] = 'd';
searchfilename [len_searchfilename+1] = 0;
}
for (int tag = 1; tag >= 0; tag --)
{
if (tag == 0)
searchfilename [len_searchfilename] = 0;
#endif /* ACE_WIN32 && _DEBUG && !ACE_DISABLE_DEBUG_DLL_CHECK */
// Use absolute pathname if there is one.
if (ACE_OS::strlen (searchpathname) > 0)
{
if (ACE_OS::strlen (searchfilename)
+ ACE_OS::strlen (searchpathname) >= maxpathnamelen)
{
errno = ENOMEM;
return -1;
}
else
{
#if (ACE_DIRECTORY_SEPARATOR_CHAR != '/')
// Revert to native path name separators.
ACE::strrepl (searchpathname,
'/',
ACE_DIRECTORY_SEPARATOR_CHAR);
#endif /* ACE_DIRECTORY_SEPARATOR_CHAR */
// First, try matching the filename *without* adding a
// prefix.
#if defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS)
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%s%s"),
searchpathname,
searchfilename,
got_suffix ? ACE_static_cast (char *,
ASYS_TEXT (""))
: ACE_static_cast (char *,
dll_suffix));
#else /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%s%s"),
searchpathname,
searchfilename,
got_suffix ? ASYS_TEXT ("") : dll_suffix);
#endif /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
if (ACE_OS::access (pathname, F_OK) == 0)
return 0;
// Second, try matching the filename *with* adding a prefix.
#if defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS)
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%s%s%s"),
searchpathname,
ACE_DLL_PREFIX,
searchfilename,
got_suffix ? ACE_static_cast (char *,
ASYS_TEXT (""))
: ACE_static_cast (char *,
dll_suffix));
#else /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%s%s%s"),
searchpathname,
ACE_DLL_PREFIX,
searchfilename,
got_suffix ? ASYS_TEXT ("") : dll_suffix);
#endif /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
if (ACE_OS::access (pathname, F_OK) == 0)
return 0;
}
}
// Use relative filenames via LD_LIBRARY_PATH or PATH (depending on
// OS platform).
else
{
char *ld_path = ACE_OS::getenv (ACE_LD_SEARCH_PATH);
#if defined (ACE_WIN32)
char *ld_path_temp = 0;
if (ld_path != 0)
{
ld_path_temp = (char *) ACE_OS::malloc (ACE_OS::strlen (ld_path) + 2);
if (ld_path_temp != 0)
{
ACE_OS::strcpy (ld_path_temp, ACE_LD_SEARCH_PATH_SEPARATOR_STR);
ACE_OS::strcat (ld_path_temp, ld_path);
ld_path = ld_path_temp;
}
else
{
ACE_OS::free ((void *) ld_path_temp);
ld_path = ld_path_temp = 0;
}
}
#endif /* ACE_WIN32 */
if (ld_path != 0
&& (ld_path = ACE_OS::strdup (ld_path)) != 0)
{
// strtok has the strange behavior of not separating the
// string ":/foo:/bar" into THREE tokens. One would expect
// that the first iteration the token would be an empty
// string, the second iteration would be "/foo", and the
// third iteration would be "/bar". However, this is not
// the case; one only gets two iterations: "/foo" followed
// by "/bar".
// This is especially a problem in parsing Unix paths
// because it is permissible to specify 'the current
// directory' as an empty entry. So, we introduce the
// following special code to cope with this:
// Look at each dynamic lib directory in the search path.
char *nextholder = 0;
const char *path_entry =
ACE::strsplit_r (ld_path,
ACE_LD_SEARCH_PATH_SEPARATOR_STR,
nextholder);
int result = 0;
for (;;)
{
// Check if at end of search path.
if (path_entry == 0)
{
errno = ENOENT;
result = -1;
break;
}
else if (ACE_OS::strlen (path_entry)
+ 1
+ ACE_OS::strlen (searchfilename)
>= maxpathnamelen)
{
errno = ENOMEM;
result = -1;
break;
}
// This works around the issue where a path might have
// an empty component indicating 'current directory'.
// We need to do it here rather than anywhere else so
// that the loop condition will still work.
else if (path_entry[0] == '\0')
path_entry = ".";
// First, try matching the filename *without* adding a
// prefix.
#if defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS)
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%c%s%s"),
path_entry,
ACE_DIRECTORY_SEPARATOR_CHAR,
searchfilename,
got_suffix ? ACE_static_cast (char *,
ASYS_TEXT (""))
: ACE_static_cast (char *,
dll_suffix));
#else /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%c%s%s"),
path_entry,
ACE_DIRECTORY_SEPARATOR_CHAR,
searchfilename,
got_suffix ? ASYS_TEXT ("") : dll_suffix);
#endif /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
if (ACE_OS::access (pathname, F_OK) == 0)
break;
// Second, try matching the filename *with* adding a
// prefix.
#if defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS)
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%c%s%s%s"),
path_entry,
ACE_DIRECTORY_SEPARATOR_CHAR,
ACE_DLL_PREFIX,
searchfilename,
got_suffix ? ACE_static_cast (char *,
ASYS_TEXT (""))
: ACE_static_cast (char *,
dll_suffix));
#else /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
ACE_OS::sprintf (pathname,
ASYS_TEXT ("%s%c%s%s%s"),
path_entry,
ACE_DIRECTORY_SEPARATOR_CHAR,
ACE_DLL_PREFIX,
searchfilename,
got_suffix ? ASYS_TEXT ("") : dll_suffix);
#endif /* ! defined (ACE_HAS_BROKEN_CONDITIONAL_STRING_CASTS) */
if (ACE_OS::access (pathname, F_OK) == 0)
break;
// Fetch the next item in the path
path_entry = ACE::strsplit_r (0,
ACE_LD_SEARCH_PATH_SEPARATOR_STR,
nextholder);
}
#if defined (ACE_WIN32)
if (ld_path_temp != 0)
ACE_OS::free (ld_path_temp);
#endif /* ACE_WIN32 */
ACE_OS::free ((void *) ld_path);
#if defined (ACE_WIN32) && defined (_DEBUG) && !defined (ACE_DISABLE_DEBUG_DLL_CHECK)
if (result == 0 || tag == 0)
#endif /* ACE_WIN32 && _DEBUG && !ACE_DISABLE_DEBUG_DLL_CHECK */
return result;
}
}
#if defined (ACE_WIN32) && defined (_DEBUG) && !defined (ACE_DISABLE_DEBUG_DLL_CHECK)
}
#endif /* ACE_WIN32 && _DEBUG && !ACE_DISABLE_DEBUG_DLL_CHECK */
errno = ENOENT;
return -1;
}
FILE *
ACE::ldopen (const ASYS_TCHAR *filename,
const ASYS_TCHAR *type)
{
ACE_TRACE ("ACE::ldopen");
ASYS_TCHAR buf[MAXPATHLEN + 1];
if (ACE::ldfind (filename,
buf,
sizeof (buf) /sizeof (ASYS_TCHAR)) == -1)
return 0;
else
return ACE_OS::fopen (buf, type);
}
ACE_HANDLE
ACE::open_temp_file (const char *name, int mode, int perm)
{
#if defined (ACE_WIN32)
return ACE_OS::open (name,
mode | _O_TEMPORARY);
#else
// Open it.
ACE_HANDLE handle = ACE_OS::open (name, mode, perm);
if (handle == ACE_INVALID_HANDLE)
return ACE_INVALID_HANDLE;
// Unlink it so that the file will be removed automatically when the
// process goes away.
if (ACE_OS::unlink (name) == -1)
return -1;
else
// Return the handle.
return handle;
#endif /* ACE_WIN32 */
}
#endif /* ! ACE_PSOS_DIAB_MIPS */
const char *
ACE::basename (const char *pathname, char delim)
{
ACE_TRACE ("ACE::basename");
const char *temp = ACE_OS::strrchr (pathname, delim);
if (temp == 0)
return pathname;
else
return temp + 1;
}
const char *
ACE::dirname (const char *pathname, char delim)
{
ACE_TRACE ("ACE::basename");
static char return_dirname[MAXPATHLEN + 1];
const char *temp = ACE_OS::strrchr (pathname, delim);
if (temp == 0)
{
if (ACE_OS::strcmp (pathname, ".") == 0
|| ACE_OS::strcmp (pathname, "..") == 0)
return_dirname[0] = '.';
else
return_dirname[0] = delim;
return return_dirname;
}
else
{
ACE_OS::strncpy (return_dirname,
pathname,
MAXPATHLEN);
return_dirname[temp - pathname] = '\0';
return return_dirname;
}
}
#if defined (ACE_HAS_UNICODE)
const wchar_t *
ACE::basename (const wchar_t *pathname, wchar_t delim)
{
ACE_TRACE ("ACE::basename");
const wchar_t *temp = ACE_OS::strrchr (pathname, delim);
if (temp == 0)
return pathname;
else
return temp + 1;
}
#endif /* ACE_HAS_UNICODE */
// Send N char *ptrs and int lengths. Note that the char *'s precede
// the ints (basically, an varargs version of writev). The count N is
// the *total* number of trailing arguments, *not* a couple of the
// number of tuple pairs!
ssize_t
ACE::send (ACE_HANDLE handle, size_t n, ...)
{
ACE_TRACE ("ACE_SOCK_IO::send");
va_list argp;
size_t total_tuples = n / 2;
iovec *iovp;
#if defined (ACE_HAS_ALLOCA)
iovp = (iovec *) alloca (total_tuples * sizeof (iovec));
#else
ACE_NEW_RETURN (iovp,
iovec[total_tuples],
-1);
#endif /* !defined (ACE_HAS_ALLOCA) */
va_start (argp, n);
for (size_t i = 0; i < total_tuples; i++)
{
iovp[i].iov_base = va_arg (argp, char *);
iovp[i].iov_len = va_arg (argp, ssize_t);
}
ssize_t result = ACE_OS::sendv (handle, iovp, total_tuples);
#if !defined (ACE_HAS_ALLOCA)
delete [] iovp;
#endif /* !defined (ACE_HAS_ALLOCA) */
va_end (argp);
return result;
}
// This is basically an interface to ACE_OS::readv, that doesn't use
// the struct iovec explicitly. The ... can be passed as an arbitrary
// number of (char *ptr, int len) tuples. However, the count N is the
// *total* number of trailing arguments, *not* a couple of the number
// of tuple pairs!
ssize_t
ACE::recv (ACE_HANDLE handle, size_t n, ...)
{
ACE_TRACE ("ACE_SOCK_IO::recv");
va_list argp;
size_t total_tuples = n / 2;
iovec *iovp;
#if defined (ACE_HAS_ALLOCA)
iovp = (iovec *) alloca (total_tuples * sizeof (iovec));
#else
ACE_NEW_RETURN (iovp,
iovec[total_tuples],
-1);
#endif /* !defined (ACE_HAS_ALLOCA) */
va_start (argp, n);
for (size_t i = 0; i < total_tuples; i++)
{
iovp[i].iov_base = va_arg (argp, char *);
iovp[i].iov_len = va_arg (argp, ssize_t);
}
ssize_t result = ACE_OS::recvv (handle, iovp, total_tuples);
#if !defined (ACE_HAS_ALLOCA)
delete [] iovp;
#endif /* !defined (ACE_HAS_ALLOCA) */
va_end (argp);
return result;
}
// Miscellaneous static methods used throughout ACE.
ssize_t
ACE::send_n (ACE_HANDLE handle,
const void *buf,
size_t len,
int flags)
{
ACE_TRACE ("ACE::send_n");
size_t bytes_written;
ssize_t n;
for (bytes_written = 0; bytes_written < len; bytes_written += n)
{
n = ACE_OS::send (handle,
(const char *) buf + bytes_written,
len - bytes_written,
flags);
if (n == -1)
{
if (errno == EWOULDBLOCK)
n = 0; // Keep trying to send.
else
return -1;
}
}
return bytes_written;
}
ssize_t
ACE::recv_n (ACE_HANDLE handle, void *buf, size_t len)
{
ACE_TRACE ("ACE::recv_n");
size_t bytes_read;
ssize_t n;
for (bytes_read = 0; bytes_read < len; bytes_read += n)
{
n = ACE::recv (handle,
(char *) buf + bytes_read,
len - bytes_read);
if (n == -1)
{
if (errno == EWOULDBLOCK)
n = 0; // Keep trying to read.
else
return -1;
}
else if (n == 0)
break;
}
return bytes_read;
}
ssize_t
ACE::recv_n (ACE_HANDLE handle, void *buf, size_t len, int flags)
{
ACE_TRACE ("ACE::recv_n");
size_t bytes_read;
ssize_t n;
for (bytes_read = 0; bytes_read < len; bytes_read += n)
{
n = ACE::recv (handle,
(char *) buf + bytes_read,
len - bytes_read,
flags);
if (n == -1)
{
if (errno == EWOULDBLOCK)
n = 0; // Keep trying to read.
else
return -1;
}
else if (n == 0)
break;
}
return bytes_read;
}
int
ACE::enter_recv_timedwait (ACE_HANDLE handle,
const ACE_Time_Value *timeout,
int &val)
{
// Give value a default value to keep Purify happy!
val = 0;
if (timeout == 0)
return 0;
#if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
struct pollfd fds;
fds.fd = handle;
fds.events = POLLIN;
fds.revents = 0;
int a = ACE_OS::poll (&fds, 1, *timeout);
#else
ACE_Handle_Set handle_set;
handle_set.set_bit (handle);
// Wait for input to arrive or for the timeout to elapse.
int a = ACE_OS::select (int (handle) + 1,
(fd_set *) handle_set, // read_fds.
(fd_set *) 0, // write_fds.
(fd_set *) 0, // exception_fds.
timeout);
#endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
switch ( a )
{
case 0: // Timer expired. return -1
errno = ETIME;
/* FALLTHRU */
case -1: // we got here directly - select() returned -1.
return -1;
case 1: // OK to read now.
/* FALLTHRU */
default: // default is case a > 0; return a
// really should assert if a != 1
//assert( a == 1 );
// We need to record whether we are already *in* nonblocking
// mode, so that we can correctly reset the state when we're
// done.
val = ACE::get_flags (handle);
if (ACE_BIT_DISABLED (val, ACE_NONBLOCK))
// Set the handle into non-blocking mode if it's not
// already in it.
ACE::set_flags (handle, ACE_NONBLOCK);
return a;
}
}
void
ACE::leave_recv_timedwait (ACE_HANDLE handle,
const ACE_Time_Value *timeout,
int val)
{
if (timeout != 0
&& ACE_BIT_DISABLED (val,
ACE_NONBLOCK))
{
// Save/restore errno.
ACE_Errno_Guard error (errno);
// Only disable ACE_NONBLOCK if we weren't in non-blocking mode
// originally.
ACE::clr_flags (handle, ACE_NONBLOCK);
}
}
int
ACE::enter_send_timedwait (ACE_HANDLE handle,
const ACE_Time_Value* timeout,
int &val)
{
// Give value a default value to keep Purify happy!
val = 0;
if (timeout==0)
return 0;
#if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
struct pollfd fds;
fds.fd = handle;
fds.events = POLLOUT;
fds.revents = 0;
int a = ACE_OS::poll (&fds, 1, *timeout);
#else
ACE_Handle_Set handle_set;
handle_set.set_bit (handle);
// On timed writes we always go into select(); only if the
// handle is available for writing within the specified amount
// of time do we put it in non-blocking mode
int a = ACE_OS::select (int (handle) + 1,
(fd_set *) 0,
(fd_set *) handle_set,
(fd_set *) 0,
timeout);
#endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
switch ( a )
{
case 0: // Timer expired.
errno = ETIME;
/* FALLTHRU */
case -1: // we got here directly - select() returned -1.
return -1;
case 1: // Ok to write now.
/* FALLTHRU */
default: // default is case a > 0; return a
// really should assert if a != 1
//assert( a == 1 );
// We need to record whether we are already *in* nonblocking
// mode, so that we can correctly reset the state when we're
// done.
val = ACE::get_flags (handle);
if (ACE_BIT_DISABLED (val, ACE_NONBLOCK))
// Set the handle into non-blocking mode if it's not
// already in it.
ACE::set_flags (handle, ACE_NONBLOCK);
return a;
}
}
void
ACE::leave_send_timedwait (ACE_HANDLE handle,
const ACE_Time_Value *timeout,
int val)
{
if (timeout != 0
&& ACE_BIT_DISABLED (val, ACE_NONBLOCK))
{
// Save/restore errno.
ACE_Errno_Guard error (errno);
// Only disable ACE_NONBLOCK if we weren't in non-blocking mode
// originally.
ACE::clr_flags (handle, ACE_NONBLOCK);
}
}
ssize_t
ACE::sendto (ACE_HANDLE handle,
const char *buf,
int len,
int flags,
const struct sockaddr *addr,
int addrlen,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::sendto");
#if defined (ACE_HAS_SENDTO_TIMEDWAIT)
if (timeout == 0)
return ACE_OS::sendto (handle, buf, len, flags, addr, addrlen);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::sendto_timedwait (handle,
buf,
len,
flags,
addr,
addrlen,
&ts);
}
#else
int val;
if (ACE::enter_send_timedwait (handle, timeout, val) == -1)
return -1;
else
{
int bytes_written = ACE_OS::sendto (handle,
buf,
len,
flags,
addr,
addrlen);
ACE::leave_send_timedwait (handle, timeout, val);
return bytes_written;
}
#endif /* ACE_HAS_SENDTO_TIMEDWAIT */
}
ssize_t
ACE::sendmsg (ACE_HANDLE handle,
const struct msghdr *msg,
int flags,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::sendmsg");
#if defined (ACE_HAS_SENDMSG_TIMEDWAIT)
if (timeout == 0)
return ACE_OS::sendmsg (handle, msg, flags);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::sendmsg_timedwait (handle, msg, flags, &ts);
}
#else
int val;
if (ACE::enter_send_timedwait (handle, timeout, val) == -1)
return -1;
else
{
int bytes_written = ACE_OS::sendmsg (handle, msg, flags);
ACE::leave_send_timedwait (handle, timeout, val);
return bytes_written;
}
#endif /* ACE_HAS_SENDMSG_TIMEDWAIT */
}
ssize_t
ACE::readv (ACE_HANDLE handle,
iovec *iov,
int iovcnt,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::readv");
#if defined (ACE_HAS_READV_TIMEDWAIT)
if (timeout == 0)
return ACE_OS::readv (handle, iov, iovcnt);
else {
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::readv_timedwait (handle, iov, iovcnt, &ts);
}
#else
int val;
if (ACE::enter_recv_timedwait (handle, timeout, val) == -1)
return -1;
else
{
ssize_t bytes_read = ACE_OS::readv (handle, iov, iovcnt);
ACE::leave_recv_timedwait (handle, timeout, val);
return bytes_read;
}
#endif /* ACE_HAS_READV_TIMEDWAIT */
}
ssize_t
ACE::writev (ACE_HANDLE handle,
const iovec *iov,
int iovcnt,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::writev");
#if defined (ACE_HAS_WRITEV_TIMEDWAIT)
if (timeout == 0)
return ACE_OS::writev (handle, iov, iovcnt);
else {
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::writev_timedwait (handle, iov, iovcnt, &ts);
}
#else
int val;
if (ACE::enter_send_timedwait (handle, timeout, val) == -1)
return -1;
else
{
ssize_t bytes_written = ACE_OS::writev (handle, iov, iovcnt);
ACE::leave_send_timedwait (handle, timeout, val);
return bytes_written;
}
#endif /* ACE_HAS_WRITEV_TIMEDWAIT */
}
ssize_t
ACE::writev_n (ACE_HANDLE h,
const iovec *i,
int iovcnt)
{
ssize_t writelen = 0;
iovec *iov = ACE_const_cast (iovec *, i);
for (int s = 0;
s < iovcnt;
)
{
ssize_t n = ACE_OS::writev (h,
iov + s,
iovcnt - s);
if (n == -1)
return n;
else
{
for (writelen += n;
s < iovcnt
&& n >= ACE_static_cast (ssize_t,
iov[s].iov_len);
s++)
n -= iov[s].iov_len;
if (n != 0)
{
char *base = ACE_reinterpret_cast (char *,
iov[s].iov_base);
iov[s].iov_base = base + n;
iov[s].iov_len = iov[s].iov_len - n;
}
}
}
return writelen;
}
ssize_t
ACE::sendv_n (ACE_HANDLE h,
const iovec *i,
int iovcnt)
{
ssize_t writelen = 0;
iovec *iov = ACE_const_cast (iovec *, i);
for (int s = 0;
s < iovcnt;
)
{
ssize_t n = ACE_OS::sendv (h,
iov + s,
iovcnt - s);
if (n == -1)
return n;
else
{
for (writelen += n;
s < iovcnt
&& n >= ACE_static_cast (ssize_t,
iov[s].iov_len);
s++)
n -= iov[s].iov_len;
if (n != 0)
{
char *base = ACE_reinterpret_cast (char *,
iov[s].iov_base);
iov[s].iov_base = base + n;
iov[s].iov_len = iov[s].iov_len - n;
}
}
}
return writelen;
}
// Format buffer into printable format. This is useful for debugging.
// Portions taken from mdump by J.P. Knight (J.P.Knight@lut.ac.uk)
// Modifications by Todd Montgomery.
int
ACE::format_hexdump (const char *buffer, int size,
ASYS_TCHAR *obuf, int obuf_sz)
{
ACE_TRACE ("ACE::format_hexdump");
u_char c;
ASYS_TCHAR textver[16 + 1];
int maxlen = (obuf_sz / 68) * 16;
if (size > maxlen)
size = maxlen;
int i;
for (i = 0; i < (size >> 4); i++)
{
int j;
for (j = 0 ; j < 16; j++)
{
c = (u_char) buffer[(i << 4) + j];
ACE_OS::sprintf (obuf, ASYS_TEXT ("%02x "), c);
obuf += 3;
if (j == 7)
{
ACE_OS::sprintf (obuf, ASYS_TEXT (" "));
obuf++;
}
textver[j] = (c < 0x20 || c > 0x7e) ? '.' : c;
}
textver[j] = 0;
ACE_OS::sprintf (obuf, ASYS_TEXT (" %s\n"), textver);
while (*obuf != '\0')
obuf++;
}
if (size % 16)
{
for (i = 0 ; i < size % 16; i++)
{
c = (u_char) buffer[size - size % 16 + i];
ACE_OS::sprintf (obuf, ASYS_TEXT ("%02x "),c);
obuf += 3;
if (i == 7)
{
ACE_OS::sprintf (obuf, ASYS_TEXT (" "));
obuf++;
}
textver[i] = (c < 0x20 || c > 0x7e) ? '.' : c;
}
for (i = size % 16; i < 16; i++)
{
ACE_OS::sprintf (obuf, ASYS_TEXT (" "));
obuf += 3;
textver[i] = ' ';
}
textver[i] = 0;
ACE_OS::sprintf (obuf, ASYS_TEXT (" %s\n"), textver);
}
return size;
}
// Returns the current timestamp in the form
// "hour:minute:second:microsecond." The month, day, and year are
// also stored in the beginning of the date_and_time array. Returns 0
// if unsuccessful, else returns pointer to beginning of the "time"
// portion of <day_and_time>.
ASYS_TCHAR *
ACE::timestamp (ASYS_TCHAR date_and_time[], int date_and_timelen)
{
//ACE_TRACE ("ACE::timestamp");
if (date_and_timelen < 35)
{
errno = EINVAL;
return 0;
}
#if defined (WIN32)
// @@ Jesper, I think Win32 supports all the UNIX versions below.
// Therefore, we can probably remove this WIN32 ifdef altogether.
SYSTEMTIME local;
::GetLocalTime (&local);
ACE_OS::sprintf (date_and_time,
ASYS_TEXT ("%02d/%02d/%04d %02d.%02d.%02d.%06d"),
(int) local.wMonth, // new, also the %02d in sprintf
(int) local.wDay, // new, also the %02d in sprintf
(int) local.wYear, // new, also the %02d in sprintf
(int) local.wHour,
(int) local.wMinute,
(int) local.wSecond,
(int) local.wMilliseconds * 1000);
#else /* UNIX */
char timebuf[26]; // This magic number is based on the ctime(3c) man page.
ACE_Time_Value cur_time = ACE_OS::gettimeofday ();
time_t secs = cur_time.sec ();
ACE_OS::ctime_r (&secs,
timebuf,
sizeof timebuf);
ACE_OS::strncpy (date_and_time,
timebuf,
date_and_timelen);
ACE_OS::sprintf (&date_and_time[19],
".%06ld",
cur_time.usec ());
#endif /* WIN32 */
date_and_time[26] = '\0';
return &date_and_time[11];
}
// This function rounds the request to a multiple of the page size.
size_t
ACE::round_to_pagesize (off_t len)
{
ACE_TRACE ("ACE::round_to_pagesize");
if (ACE::pagesize_ == 0)
ACE::pagesize_ = ACE_OS::getpagesize ();
return (len + (ACE::pagesize_ - 1)) & ~(ACE::pagesize_ - 1);
}
size_t
ACE::round_to_allocation_granularity (off_t len)
{
ACE_TRACE ("ACE::round_to_allocation_granularity");
if (ACE::allocation_granularity_ == 0)
ACE::allocation_granularity_ = ACE_OS::allocation_granularity ();
return (len + (ACE::allocation_granularity_ - 1)) & ~(ACE::allocation_granularity_ - 1);
}
ACE_HANDLE
ACE::handle_timed_complete (ACE_HANDLE h,
ACE_Time_Value *timeout,
int is_tli)
{
ACE_TRACE ("ACE::handle_timed_complete");
#if !defined (ACE_WIN32) && defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
struct pollfd fds;
fds.fd = h;
fds.events = POLLIN | POLLOUT;
fds.revents = 0;
#else
ACE_Handle_Set rd_handles;
ACE_Handle_Set wr_handles;
rd_handles.set_bit (h);
wr_handles.set_bit (h);
#endif /* !ACE_WIN32 && ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
#if defined (ACE_WIN32)
ACE_Handle_Set ex_handles;
ex_handles.set_bit (h);
#endif /* ACE_WIN32 */
int need_to_check;
#if defined (ACE_WIN32)
int n = ACE_OS::select (int (h) + 1,
rd_handles,
wr_handles,
ex_handles,
timeout);
#else
# if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
int n = ACE_OS::poll (&fds, 1, timeout);
# else
int n = ACE_OS::select (int (h) + 1,
rd_handles,
wr_handles,
0,
timeout);
# endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
#endif /* ACE_WIN32 */
// If we failed to connect within the time period allocated by the
// caller, then we fail (e.g., the remote host might have been too
// busy to accept our call).
if (n <= 0)
{
if (n == 0 && timeout != 0)
errno = ETIMEDOUT;
return ACE_INVALID_HANDLE;
}
// Check if the handle is ready for reading and the handle is *not*
// ready for writing, which may indicate a problem. But we need to
// make sure...
#if defined (ACE_WIN32)
need_to_check = rd_handles.is_set (h) || ex_handles.is_set (h);
#elif defined (VXWORKS)
ACE_UNUSED_ARG (is_tli);
// Force the check on VxWorks. The read handle for "h" is not set,
// so "need_to_check" is false at this point. The write handle is
// set, for what it's worth.
need_to_check = 1;
#else
if (is_tli)
# if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
need_to_check = (fds.revents & POLLIN) && !(fds.revents & POLLOUT);
# else
need_to_check = rd_handles.is_set (h) && !wr_handles.is_set (h);
# endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
else
#if defined(AIX)
// AIX is broken... both success and failed connect will set the
// write handle only, so always check.
need_to_check = 1;
#else
# if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
need_to_check = (fds.revents & POLLIN);
# else
need_to_check = rd_handles.is_set (h);
# endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
#endif /* AIX */
#endif /* ACE_WIN32 */
if (need_to_check)
{
char dummy;
// The following recv() won't block provided that the
// ACE_NONBLOCK flag has not been turned off .
n = ACE::recv (h, &dummy, 1, MSG_PEEK);
// If no data was read/peeked at, check to see if it's because
// of a non-connected socket (and therefore an error) or there's
// just no data yet.
if (n <= 0)
{
if (n == 0)
{
errno = ECONNREFUSED;
h = ACE_INVALID_HANDLE;
}
else if (errno != EWOULDBLOCK && errno != EAGAIN)
h = ACE_INVALID_HANDLE;
}
}
// 1. The HANDLE is ready for writing and doesn't need to be checked or
// 2. recv() returned an indication of the state of the socket - if there is
// either data present, or a recv is legit but there's no data yet,
// the connection was successfully established.
return h;
}
ACE_HANDLE
ACE::handle_timed_open (ACE_Time_Value *timeout,
LPCTSTR name,
int flags,
int perms)
{
ACE_TRACE ("ACE::handle_timed_open");
if (timeout != 0)
{
// Open the named pipe or file using non-blocking mode...
ACE_HANDLE handle = ACE_OS::open (name,
flags | ACE_NONBLOCK,
perms);
if (handle == ACE_INVALID_HANDLE
&& (errno == EWOULDBLOCK
&& (timeout->sec () > 0 || timeout->usec () > 0)))
// This expression checks if we were polling.
errno = ETIMEDOUT;
return handle;
}
else
return ACE_OS::open (name, flags, perms);
}
// Wait up to <timeout> amount of time to accept a connection.
int
ACE::handle_timed_accept (ACE_HANDLE listener,
ACE_Time_Value *timeout,
int restart)
{
ACE_TRACE ("ACE::handle_timed_accept");
// Make sure we don't bomb out on erroneous values.
if (listener == ACE_INVALID_HANDLE)
return -1;
#if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
struct pollfd fds;
fds.fd = listener;
fds.events = POLLIN;
fds.revents = 0;
#else
// Use the select() implementation rather than poll().
ACE_Handle_Set rd_handle;
rd_handle.set_bit (listener);
#endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
// We need a loop here if <restart> is enabled.
for (;;)
{
#if defined (ACE_HAS_POLL) && defined (ACE_HAS_LIMITED_SELECT)
int n = ACE_OS::poll (&fds, 1, timeout);
#else
int n = ACE_OS::select (int (listener) + 1,
rd_handle, 0, 0,
timeout);
#endif /* ACE_HAS_POLL && ACE_HAS_LIMITED_SELECT */
switch (n)
{
case -1:
if (errno == EINTR && restart)
continue;
else
return -1;
/* NOTREACHED */
case 0:
if (timeout != 0
&& timeout->sec () == 0
&& timeout->usec () == 0)
errno = EWOULDBLOCK;
else
errno = ETIMEDOUT;
return -1;
/* NOTREACHED */
case 1:
return 0;
/* NOTREACHED */
default:
errno = EINVAL;
return -1;
/* NOTREACHED */
}
}
ACE_NOTREACHED (return 0);
}
// Bind socket to an unused port.
int
ACE::bind_port (ACE_HANDLE handle,
ACE_UINT32 ip_addr)
{
ACE_TRACE ("ACE::bind_port");
sockaddr_in sock_addr;
ACE_OS::memset ((void *) &sock_addr, 0, sizeof sock_addr);
sock_addr.sin_family = AF_INET;
#if defined (ACE_HAS_SIN_LEN)
sock_addr.sin_len = sizeof sock_addr;
#endif /* ACE_HAS_SIN_LEN */
sock_addr.sin_addr.s_addr = ip_addr;
#if !defined (ACE_LACKS_WILDCARD_BIND)
// The OS kernel should select a free port for us.
sock_addr.sin_port = 0;
return ACE_OS::bind (handle,
ACE_reinterpret_cast(sockaddr *, &sock_addr),
sizeof sock_addr);
#else
static u_short upper_limit = ACE_MAX_DEFAULT_PORT;
int round_trip = upper_limit;
int lower_limit = IPPORT_RESERVED;
// We have to select the port explicitly.
for (;;)
{
sock_addr.sin_port = htons (upper_limit);
if (ACE_OS::bind (handle,
ACE_reinterpret_cast(sockaddr *, &sock_addr),
sizeof sock_addr) >= 0)
{
#if defined (ACE_WIN32)
upper_limit--;
#endif /* ACE_WIN32 */
return 0;
}
else if (errno != EADDRINUSE)
return -1;
else
{
upper_limit--;
// Wrap back around when we reach the bottom.
if (upper_limit <= lower_limit)
upper_limit = ACE_MAX_DEFAULT_PORT;
// See if we have already gone around once!
if (upper_limit == round_trip)
{
errno = EAGAIN;
return -1;
}
}
}
#endif /* ACE_HAS_WILDCARD_BIND */
}
// Make the current process a UNIX daemon. This is based on Stevens
// code from APUE.
int
ACE::daemonize (const char pathname[],
int close_all_handles,
const char program_name[])
{
ACE_TRACE ("ACE::daemonize");
#if !defined (ACE_LACKS_FORK)
pid_t pid = ACE_OS::fork ();
if (pid == -1)
return -1;
else if (pid != 0)
ACE_OS::exit (0); // Parent exits.
// 1st child continues.
ACE_OS::setsid (); // Become session leader.
ACE_OS::signal (SIGHUP, SIG_IGN);
pid = ACE_OS::fork (program_name);
if (pid != 0)
ACE_OS::exit (0); // First child terminates.
// Second child continues.
if (pathname != 0)
// change working directory.
ACE_OS::chdir (pathname);
ACE_OS::umask (0); // clear our file mode creation mask.
// Close down the files.
if (close_all_handles)
for (int i = ACE::max_handles () - 1; i >= 0; i--)
ACE_OS::close (i);
return 0;
#else
ACE_UNUSED_ARG (pathname);
ACE_UNUSED_ARG (close_all_handles);
ACE_UNUSED_ARG (program_name);
ACE_NOTSUP_RETURN (-1);
#endif /* ACE_LACKS_FORK */
}
pid_t
ACE::fork (const char *program_name,
int avoid_zombies)
{
if (avoid_zombies == 0)
return ACE_OS::fork (program_name);
else
{
// This algorithm is adapted from an example in the Stevens book
// "Advanced Programming in the Unix Environment" and an item in
// Andrew Gierth's Unix Programming FAQ. It creates an orphan
// process that's inherited by the init process; init cleans up
// when the orphan process terminates.
//
// Another way to avoid zombies is to ignore or catch the
// SIGCHLD signal; we don't use that approach here.
pid_t pid = ACE_OS::fork ();
if (pid == 0)
{
// The child process forks again to create a grandchild.
switch (ACE_OS::fork (program_name))
{
case 0: // grandchild returns 0.
return 0;
case -1: // assumes all errnos are < 256
ACE_OS::_exit (errno);
default: // child terminates, orphaning grandchild
ACE_OS::_exit (0);
}
}
// Parent process waits for child to terminate.
#if defined (ACE_HAS_UNION_WAIT)
union wait status;
if (pid < 0 || ACE_OS::waitpid (pid, &(status.w_status), 0) < 0)
#else
int status;
if (pid < 0 || ACE_OS::waitpid (pid, &status, 0) < 0)
#endif /* ACE_HAS_UNION_WAIT */
return -1;
// child terminated by calling exit()?
if (WIFEXITED ((status)))
{
// child terminated normally?
if (WEXITSTATUS ((status)) == 0)
return 1;
else
errno = WEXITSTATUS ((status));
}
else
// child didn't call exit(); perhaps it received a signal?
errno = EINTR;
return -1;
}
}
int
ACE::max_handles (void)
{
ACE_TRACE ("ACE::max_handles");
#if defined (RLIMIT_NOFILE) && !defined (ACE_LACKS_RLIMIT)
rlimit rl;
ACE_OS::getrlimit (RLIMIT_NOFILE, &rl);
# if defined (RLIM_INFINITY)
if (rl.rlim_cur != RLIM_INFINITY)
return rl.rlim_cur;
#else
return rl.rlim_cur;
# endif /* RLIM_INFINITY */
# if defined (_SC_OPEN_MAX)
return ACE_OS::sysconf (_SC_OPEN_MAX);
# elif defined (FD_SETSIZE)
return FD_SETSIZE;
# else
ACE_NOTSUP_RETURN (-1);
# endif /* _SC_OPEN_MAX */
#else
ACE_NOTSUP_RETURN (-1);
#endif /* defined (RLIMIT_NOFILE) && !defined (ACE_LACKS_RLIMIT) */
}
// Set the number of currently open handles in the process.
//
// If NEW_LIMIT == -1 set the limit to the maximum allowable.
// Otherwise, set it to be the value of NEW_LIMIT.
int
ACE::set_handle_limit (int new_limit)
{
ACE_TRACE ("ACE::set_handle_limit");
int cur_limit = ACE::max_handles ();
int max_limit = cur_limit;
if (cur_limit == -1)
return -1;
#if !defined (ACE_LACKS_RLIMIT) && defined (RLIMIT_NOFILE)
struct rlimit rl;
ACE_OS::memset ((void *) &rl, 0, sizeof rl);
ACE_OS::getrlimit (RLIMIT_NOFILE, &rl);
max_limit = rl.rlim_max;
#endif /* ACE_LACKS_RLIMIT */
if (new_limit == -1)
new_limit = max_limit;
if (new_limit < 0)
{
errno = EINVAL;
return -1;
}
else if (new_limit > cur_limit)
{
#if !defined (ACE_LACKS_RLIMIT) && defined (RLIMIT_NOFILE)
rl.rlim_cur = new_limit;
return ACE_OS::setrlimit (RLIMIT_NOFILE, &rl);
#else
// Must return EINVAL errno.
ACE_NOTSUP_RETURN (-1);
#endif /* ACE_LACKS_RLIMIT */
}
else
{
#if !defined (ACE_LACKS_RLIMIT) && defined (RLIMIT_NOFILE)
rl.rlim_cur = new_limit;
return ACE_OS::setrlimit (RLIMIT_NOFILE, &rl);
#else
// We give a chance to platforms without RLIMIT to work.
// Instead of ACE_NOTSUP_RETURN (0), just return 0 because
// new_limit is <= cur_limit, so it's a no-op.
return 0;
#endif /* ACE_LACKS_RLIMIT */
}
// Irix complains without this return statement. DEC cxx
// (correctly) says that it's not reachable. ACE_NOTREACHED won't
// work here, because it handles both platforms the same.
// IRIX does not complain anymore [7.2]
ACE_NOTREACHED (return 0);
}
// Flags are file status flags to turn on.
int
ACE::set_flags (ACE_HANDLE handle, int flags)
{
ACE_TRACE ("ACE::set_flags");
#if defined (ACE_WIN32) || defined (VXWORKS) || defined (ACE_LACKS_FCNTL)
switch (flags)
{
case ACE_NONBLOCK:
// nonblocking argument (1)
// blocking: (0)
{
u_long nonblock = 1;
return ACE_OS::ioctl (handle, FIONBIO, &nonblock);
}
default:
ACE_NOTSUP_RETURN (-1);
}
#else
int val = ACE_OS::fcntl (handle, F_GETFL, 0);
if (val == -1)
return -1;
// Turn on flags.
ACE_SET_BITS (val, flags);
if (ACE_OS::fcntl (handle, F_SETFL, val) == -1)
return -1;
else
return 0;
#endif /* ACE_WIN32 || ACE_LACKS_FCNTL */
}
// Flags are the file status flags to turn off.
int
ACE::clr_flags (ACE_HANDLE handle, int flags)
{
ACE_TRACE ("ACE::clr_flags");
#if defined (ACE_WIN32) || defined (VXWORKS) || defined (ACE_LACKS_FCNTL)
switch (flags)
{
case ACE_NONBLOCK:
// nonblocking argument (1)
// blocking: (0)
{
u_long nonblock = 0;
return ACE_OS::ioctl (handle, FIONBIO, &nonblock);
}
default:
ACE_NOTSUP_RETURN (-1);
}
#else
int val = ACE_OS::fcntl (handle, F_GETFL, 0);
if (val == -1)
return -1;
// Turn flags off.
ACE_CLR_BITS (val, flags);
if (ACE_OS::fcntl (handle, F_SETFL, val) == -1)
return -1;
else
return 0;
#endif /* ACE_WIN32 || ACE_LACKS_FCNTL */
}
int
ACE::map_errno (int error)
{
switch (error)
{
#if defined (ACE_WIN32)
case WSAEWOULDBLOCK:
return EAGAIN; // Same as UNIX errno EWOULDBLOCK.
#endif /* ACE_WIN32 */
}
return error;
}
ssize_t
ACE::send (ACE_HANDLE handle,
const void *buf,
size_t n,
int flags,
const ACE_Time_Value *timeout)
{
#if defined (ACE_HAS_SEND_TIMEDWAIT)
if (timeout == 0)
return ACE::send (handle, buf, n, flags);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday();
timespec_t ts = copy;
return ::send_timedwait (handle, buf, n, flags, &ts);
}
#else
int val;
if (ACE::enter_send_timedwait (handle, timeout, val) == -1)
return -1;
else
{
ssize_t bytes_written = ACE::send (handle, buf, n, flags);
ACE::leave_send_timedwait (handle, timeout, val);
return bytes_written;
}
#endif /* ACE_HAS_SEND_TIMEDWAIT */
}
ssize_t
ACE::send (ACE_HANDLE handle,
const void *buf,
size_t n,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE_OS::write");
#if defined (ACE_HAS_WRITE_TIMEDWAIT)
if (timeout == 0)
return ACE::send (handle, buf, n);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::write_timedwait (handle, buf, n, &ts);
}
#else
int val;
if (ACE::enter_send_timedwait (handle, timeout, val) == -1)
return -1;
else
{
ssize_t bytes_written = ACE::send (handle, buf, n);
ACE::leave_send_timedwait (handle, timeout, val);
return bytes_written;
}
#endif /* ACE_HAS_WRITE_TIMEDWAIT */
}
ssize_t
ACE::send_n (ACE_HANDLE handle,
const void *buf,
size_t len,
int flags,
const ACE_Time_Value *timeout)
{
// Total number of bytes written.
size_t bytes_written;
// Actual number of bytes written in each <send> attempt.
ssize_t n;
for (bytes_written = 0;
bytes_written < len;
bytes_written += n)
{
n = ACE::send (handle,
(char *) buf + bytes_written,
len - bytes_written,
flags,
timeout);
if (n == -1)
if (errno == EWOULDBLOCK)
n = 0; // Keep trying to send.
else
return -1;
}
return bytes_written;
}
ssize_t
ACE::send_n (ACE_HANDLE handle,
const void *buf,
size_t len,
const ACE_Time_Value *timeout)
{
// Total number of bytes written.
size_t bytes_written;
// Actual number of bytes written in each <send> attempt.
ssize_t n;
for (bytes_written = 0;
bytes_written < len;
bytes_written += n)
{
n = ACE::send (handle, (char *) buf + bytes_written,
len - bytes_written, timeout);
if (n == -1)
if (errno == EWOULDBLOCK)
n = 0; // Keep trying to send.
else
return -1;
}
return bytes_written;
}
ssize_t
ACE::recvfrom (ACE_HANDLE handle,
char *buf,
int len,
int flags,
struct sockaddr *addr,
int *addrlen,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::recvfrom");
#if defined (ACE_HAS_RECVFROM_TIMEDWAIT)
if (timeout == 0)
return ACE_OS::recvfrom (handle,
buf,
len,
flags,
addr,
addrlen);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::recvfrom_timedwait (handle,
buf,
len,
flags,
addr,
addrlen,
&ts)a
;
}
#else
int val;
if (ACE::enter_recv_timedwait (handle,
timeout,
val) == -1)
return -1;
else
{
int bytes_read = ACE_OS::recvfrom (handle,
buf,
len,
flags,
addr,
addrlen);
ACE::leave_recv_timedwait (handle,
timeout,
val);
return bytes_read;
}
#endif /* ACE_HAS_RECVFROM_TIMEDWAIT */
}
ssize_t
ACE::recvmsg (ACE_HANDLE handle,
struct msghdr *msg,
int flags,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::recvmsg");
#if defined (ACE_HAS_RECVMSG_TIMEDWAIT)
if (timeout == 0)
return ACE_OS::recvmsg (handle, msg, flags);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::recvmsg_timedwait (handle, msg, flags, &ts);
}
#else
int val;
if (ACE::enter_recv_timedwait (handle, timeout, val) == -1)
return -1;
else
{
int bytes_read = ACE_OS::recvmsg (handle, msg, flags);
ACE::leave_recv_timedwait (handle, timeout, val);
return bytes_read;
}
#endif /* ACE_HAS_RECVMSG_TIMEDWAIT */
}
ssize_t
ACE::recv (ACE_HANDLE handle,
void *buf,
size_t n,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::read");
#if defined (ACE_HAS_READ_TIMEDWAIT)
if (timeout == 0)
return ACE::recv (handle, buf, n);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::read_timedwait (handle, buf, n, &ts);
}
#else
int val;
if (ACE::enter_recv_timedwait (handle, timeout, val) == -1)
return -1;
else
{
ssize_t bytes_read = ACE::recv (handle, buf, n);
ACE::leave_recv_timedwait (handle, timeout, val);
return bytes_read;
}
#endif /* ACE_HAS_READ_TIMEDWAIT */
}
ssize_t
ACE::recv (ACE_HANDLE handle,
void *buf,
size_t len,
int flags,
const ACE_Time_Value *timeout)
{
// ACE_TRACE ("ACE::recv");
#if defined (ACE_HAS_RECV_TIMEDWAIT)
if (timeout == 0)
return ACE::recv (handle, buf, len, flags);
else
{
ACE_Time_Value copy = *timeout;
copy += ACE_OS::gettimeofday ();
timespec_t ts = copy;
return ::recv_timedwait (handle, buf, len, flags, &ts);
}
#else
int val;
if (ACE::enter_recv_timedwait (handle, timeout, val)==-1)
return -1;
else
{
ssize_t bytes_recv = ACE::recv (handle, buf, len, flags);
ACE::leave_recv_timedwait (handle, timeout, val);
return bytes_recv;
}
#endif /* ACE_HAS_RECV_TIMEDWAIT */
}
ssize_t
ACE::recv_n (ACE_HANDLE handle,
void *buf,
size_t len,
int flags,
const ACE_Time_Value *timeout)
{
size_t bytes_received;
// Actual number of bytes read in each attempt.
ssize_t n;
for (bytes_received = 0;
bytes_received < len;
bytes_received += n)
{
n = ACE::recv (handle,
(char *) buf + bytes_received,
len - bytes_received,
flags,
timeout);
if (n == -1 || n == 0)
break;
}
return bytes_received;
}
ssize_t
ACE::recv_n (ACE_HANDLE handle,
void *buf,
size_t len,
const ACE_Time_Value *timeout)
{
size_t bytes_received;
// Actual number of bytes read in each attempt.
ssize_t n;
for (bytes_received = 0;
bytes_received < len;
bytes_received += n)
{
n = ACE::recv (handle,
(char *) buf + bytes_received,
len - bytes_received,
timeout);
if (n == -1 || n == 0)
break;
}
return bytes_received;
}
// Euclid's greatest common divisor algorithm.
u_long
ACE::gcd (u_long x, u_long y)
{
if (y == 0)
{
return x;
}
else
{
return ACE::gcd (y, x % y);
}
}
// Calculates the minimum enclosing frame size for the given values.
u_long
ACE::minimum_frame_size (u_long period1, u_long period2)
{
// if one of the periods is zero, treat it as though it as
// uninitialized and return the other period as the frame size
if (0 == period1)
{
return period2;
}
if (0 == period2)
{
return period1;
}
// if neither is zero, find the greatest common divisor of the two periods
u_long greatest_common_divisor = ACE::gcd (period1, period2);
// explicitly consider cases to reduce risk of possible overflow errors
if (greatest_common_divisor == 1)
{
// periods are relative primes: just multiply them together
return period1 * period2;
}
else if (greatest_common_divisor == period1)
{
// the first period divides the second: return the second
return period2;
}
else if (greatest_common_divisor == period2)
{
// the second period divides the first: return the first
return period1;
}
else
{
// the current frame size and the entry's effective period
// have a non-trivial greatest common divisor: return the
// product of factors divided by those in their gcd.
return (period1 * period2) / greatest_common_divisor;
}
}
u_long
ACE::is_prime (const u_long n,
const u_long min_factor,
const u_long max_factor)
{
if (n > 3)
for (u_long factor = min_factor;
factor <= max_factor;
++factor)
if (n / factor * factor == n)
return factor;
return 0;
}
const ASYS_TCHAR *
ACE::sock_error (int error)
{
#if defined (ACE_WIN32)
static ASYS_TCHAR unknown_msg[64];
switch (error)
{
case WSAVERNOTSUPPORTED:
return ASYS_TEXT ("version of WinSock not supported");
/* NOTREACHED */
case WSASYSNOTREADY:
return ASYS_TEXT ("WinSock not present or not responding");
/* NOTREACHED */
case WSAEINVAL:
return ASYS_TEXT ("app version not supported by DLL");
/* NOTREACHED */
case WSAHOST_NOT_FOUND:
return ASYS_TEXT ("Authoritive: Host not found");
/* NOTREACHED */
case WSATRY_AGAIN:
return ASYS_TEXT ("Non-authoritive: host not found or server failure");
/* NOTREACHED */
case WSANO_RECOVERY:
return ASYS_TEXT ("Non-recoverable: refused or not implemented");
/* NOTREACHED */
case WSANO_DATA:
return ASYS_TEXT ("Valid name, no data record for type");
/* NOTREACHED */
/*
case WSANO_ADDRESS:
return "Valid name, no MX record";
*/
case WSANOTINITIALISED:
return ASYS_TEXT ("WSA Startup not initialized");
/* NOTREACHED */
case WSAENETDOWN:
return ASYS_TEXT ("Network subsystem failed");
/* NOTREACHED */
case WSAEINPROGRESS:
return ASYS_TEXT ("Blocking operation in progress");
/* NOTREACHED */
case WSAEINTR:
return ASYS_TEXT ("Blocking call cancelled");
/* NOTREACHED */
case WSAEAFNOSUPPORT:
return ASYS_TEXT ("address family not supported");
/* NOTREACHED */
case WSAEMFILE:
return ASYS_TEXT ("no file handles available");
/* NOTREACHED */
case WSAENOBUFS:
return ASYS_TEXT ("no buffer space available");
/* NOTREACHED */
case WSAEPROTONOSUPPORT:
return ASYS_TEXT ("specified protocol not supported");
/* NOTREACHED */
case WSAEPROTOTYPE:
return ASYS_TEXT ("protocol wrong type for this socket");
/* NOTREACHED */
case WSAESOCKTNOSUPPORT:
return ASYS_TEXT ("socket type not supported for address family");
/* NOTREACHED */
case WSAENOTSOCK:
return ASYS_TEXT ("handle is not a socket");
/* NOTREACHED */
case WSAEWOULDBLOCK:
return ASYS_TEXT ("socket marked as non-blocking and SO_LINGER set not 0");
/* NOTREACHED */
case WSAEADDRINUSE:
return ASYS_TEXT ("address already in use");
/* NOTREACHED */
case WSAECONNABORTED:
return ASYS_TEXT ("connection aborted");
/* NOTREACHED */
case WSAECONNRESET:
return ASYS_TEXT ("connection reset");
/* NOTREACHED */
case WSAENOTCONN:
return ASYS_TEXT ("not connected");
/* NOTREACHED */
case WSAETIMEDOUT:
return ASYS_TEXT ("connection timed out");
/* NOTREACHED */
case WSAECONNREFUSED:
return ASYS_TEXT ("connection refused");
/* NOTREACHED */
case WSAEHOSTDOWN:
return ASYS_TEXT ("host down");
/* NOTREACHED */
case WSAEHOSTUNREACH:
return ASYS_TEXT ("host unreachable");
/* NOTREACHED */
case WSAEADDRNOTAVAIL:
return ASYS_TEXT ("address not available");
/* NOTREACHED */
default:
ACE_OS::sprintf (unknown_msg, ASYS_TEXT ("unknown error: %d"), error);
return unknown_msg;
/* NOTREACHED */
}
#else
ACE_UNUSED_ARG (error);
ACE_NOTSUP_RETURN (0);
#endif /* ACE_WIN32 */
}
int
ACE::get_bcast_addr (ACE_UINT32 &bcast_addr,
const char *host_name,
ACE_UINT32 host_addr,
ACE_HANDLE handle)
{
ACE_TRACE ("ACE::get_bcast_addr");
#if !defined(ACE_WIN32)
ACE_HANDLE s = handle;
if (s == ACE_INVALID_HANDLE)
s = ACE_OS::socket (AF_INET, SOCK_STREAM, 0);
if (s == ACE_INVALID_HANDLE)
ACE_ERROR_RETURN ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE_OS::socket")),
-1);
struct ifconf ifc;
char buf[BUFSIZ];
ifc.ifc_len = sizeof buf;
ifc.ifc_buf = buf;
// Get interface structure and initialize the addresses using UNIX
// techniques
#if defined (AIX)
int cmd = CSIOCGIFCONF;
#else
int cmd = SIOCGIFCONF;
#endif /* AIX */
if (ACE_OS::ioctl (s, cmd, (char *) &ifc) == -1)
ACE_ERROR_RETURN ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_bcast_addr:")
ASYS_TEXT ("ioctl (get interface configuration)")),
-1);
struct ifreq *ifr = ifc.ifc_req;
struct sockaddr_in ip_addr;
// Get host ip address if necessary.
if (host_name)
{
hostent *hp = ACE_OS::gethostbyname (host_name);
if (hp == 0)
return -1;
else
#if !defined(_UNICOS)
ACE_OS::memcpy ((char *) &ip_addr.sin_addr.s_addr,
(char *) hp->h_addr,
hp->h_length);
#else /* _UNICOS */
{
ACE_UINT64 haddr; // a place to put the address
char * haddrp = (char *) &haddr; // convert to char pointer
ACE_OS::memcpy(haddrp,(char *) hp->h_addr,hp->h_length);
ip_addr.sin_addr.s_addr = haddr;
}
#endif /* ! _UNICOS */
}
else
{
ACE_OS::memset ((void *) &ip_addr, 0, sizeof ip_addr);
#if !defined(_UNICOS)
ACE_OS::memcpy ((void *) &ip_addr.sin_addr,
(void*) &host_addr,
sizeof ip_addr.sin_addr);
#else /* _UNICOS */
ip_addr.sin_addr.s_addr = host_addr; // just copy to the bitfield
#endif /* ! _UNICOS */
}
for (int n = ifc.ifc_len / sizeof (struct ifreq);
n > 0;
n--, ifr++)
{
struct sockaddr_in if_addr;
// Compare host ip address with interface ip address.
ACE_OS::memcpy (&if_addr,
&ifr->ifr_addr,
sizeof if_addr);
if (ip_addr.sin_addr.s_addr != if_addr.sin_addr.s_addr)
continue;
if (ifr->ifr_addr.sa_family != AF_INET)
{
ACE_ERROR ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_bcast_addr:")
ASYS_TEXT ("Not AF_INET")));
continue;
}
struct ifreq flags = *ifr;
struct ifreq if_req = *ifr;
if (ACE_OS::ioctl (s, SIOCGIFFLAGS, (char *) &flags) == -1)
{
ACE_ERROR ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_bcast_addr:")
ASYS_TEXT (" ioctl (get interface flags)")));
continue;
}
if (ACE_BIT_DISABLED (flags.ifr_flags, IFF_UP))
{
ACE_ERROR ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_bcast_addr:")
ASYS_TEXT ("Network interface is not up")));
continue;
}
if (ACE_BIT_ENABLED (flags.ifr_flags, IFF_LOOPBACK))
continue;
if (ACE_BIT_ENABLED (flags.ifr_flags, IFF_BROADCAST))
{
if (ACE_OS::ioctl (s,
SIOCGIFBRDADDR,
(char *) &if_req) == -1)
ACE_ERROR ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_bcast_addr:")
ASYS_TEXT ("ioctl (get broadaddr)")));
else
{
ACE_OS::memcpy (ACE_reinterpret_cast(sockaddr_in *, &ip_addr),
ACE_reinterpret_cast(sockaddr_in *, &if_req.ifr_broadaddr),
sizeof if_req.ifr_broadaddr);
ACE_OS::memcpy ((void *) &host_addr,
(void *) &ip_addr.sin_addr,
sizeof host_addr);
if (handle == ACE_INVALID_HANDLE)
ACE_OS::close (s);
bcast_addr = host_addr;
return 0;
}
}
else
ACE_ERROR ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_bcast_addr:")
ASYS_TEXT ("Broadcast is not enable for this interface.")));
if (handle == ACE_INVALID_HANDLE)
ACE_OS::close (s);
bcast_addr = host_addr;
return 0;
}
return 0;
#else
ACE_UNUSED_ARG (handle);
ACE_UNUSED_ARG (host_addr);
ACE_UNUSED_ARG (host_name);
bcast_addr = (ACE_UINT32 (INADDR_BROADCAST));
return 0;
#endif /* !ACE_WIN32 */
}
// Helper routine for get_ip_interfaces, differs by UNIX platform so
// put into own subroutine. perform some ioctls to retrieve ifconf
// list of ifreq structs.
int
ACE::count_interfaces (ACE_HANDLE handle,
size_t &how_many)
{
#if defined (sparc) && defined (SIOCGIFNUM)
if (ACE_OS::ioctl (handle,
SIOCGIFNUM,
(caddr_t) &how_many) == -1)
ACE_ERROR_RETURN ((LM_ERROR,
ASYS_TEXT ("ACE::get_ip_interfaces:")
ASYS_TEXT ("ioctl - SIOCGIFNUM failed")),
-1);
return 0;
#elif defined (__unix) || defined (__Lynx__) || defined (_AIX)
// Note: DEC CXX doesn't define "unix". BSD compatible OS: HP UX,
// AIX, SunOS 4.x perform some ioctls to retrieve ifconf list of
// ifreq structs no SIOCGIFNUM on SunOS 4.x, so use guess and scan
// algorithm
// Probably hard to put this many ifs in a unix box..
const int MAX_IF = 50;
// HACK - set to an unreasonable number
int num_ifs = MAX_IF;
struct ifconf ifcfg;
size_t ifreq_size = num_ifs * sizeof (struct ifreq);
struct ifreq *p_ifs =
(struct ifreq *) ACE_OS::malloc (ifreq_size);
if (!p_ifs)
{
errno = ENOMEM;
return -1;
}
ACE_OS::memset (p_ifs, 0, ifreq_size);
ACE_OS::memset (&ifcfg, 0, sizeof (struct ifconf));
ifcfg.ifc_req = p_ifs;
ifcfg.ifc_len = ifreq_size;
#if defined (AIX)
int cmd = CSIOCGIFCONF;
#else
int cmd = SIOCGIFCONF;
#endif /* AIX */
if (ACE_OS::ioctl (handle,
cmd,
(caddr_t) &ifcfg) == -1)
{
ACE_OS::free (ifcfg.ifc_req);
ACE_ERROR_RETURN ((LM_ERROR,
ASYS_TEXT ("count_interfaces:ioctl:")
ASYS_TEXT ("SIOCGIFCONF failed")),
-1);
}
int if_count = 0, i;
// get if address out of ifreq buffers. ioctl puts a blank-named
// interface to mark the end of the returned interfaces.
for (i = 0;
i < num_ifs;
i++)
{
if (p_ifs->ifr_name[0] == '\0')
break;
if_count++;
p_ifs++;
}
ACE_OS::free (ifcfg.ifc_req);
how_many = if_count;
return 0;
#else
ACE_UNUSED_ARG (handle);
ACE_UNUSED_ARG (how_many);
ACE_NOTSUP_RETURN (-1);; // no implmentation
#endif /* sparc && SIOCGIFNUM */
}
// Routine to return a handle from which ioctl() requests can be made.
ACE_HANDLE
ACE::get_handle (void)
{
// Solaris 2.x
ACE_HANDLE handle = ACE_INVALID_HANDLE;
#if defined (sparc)
handle = ACE_OS::open ("/dev/udp", O_RDONLY);
#elif defined (__unix) || defined (__Lynx__) || defined (_AIX)
// Note: DEC CXX doesn't define "unix" BSD compatible OS: HP UX,
// AIX, SunOS 4.x
handle = ACE_OS::socket (PF_INET, SOCK_DGRAM, 0);
#endif /* sparc */
return handle;
}
#if defined (ACE_WIN32)
// Return value in buffer for a key/name pair from the Windows
// Registry up to buf_len size.
static int
get_reg_value (const TCHAR *key,
const TCHAR *name,
TCHAR *buffer,
DWORD &buf_len)
{
HKEY hk;
DWORD buf_type;
LONG rc = ::RegOpenKeyEx (HKEY_LOCAL_MACHINE,
key,
0,
KEY_READ,
&hk);
// 1. open key that defines the interfaces used for TCP/IP?
if (rc != ERROR_SUCCESS)
// print_error_string(TEXT("RegOpenKeyEx"), rc);
return -1;
rc = ::RegQueryValueEx (hk,
name,
0,
&buf_type,
(u_char *) buffer,
&buf_len);
if (rc != ERROR_SUCCESS)
{
// print_error_string(TEXT("RegEnumKeyEx"), rc);
RegCloseKey (hk);
return -2;
}
::RegCloseKey (hk);
return 0;
}
#endif /* ACE_WIN32 */
// return an array of all configured IP interfaces on this host, count
// rc = 0 on success (count == number of interfaces else -1 caller is
// responsible for calling delete [] on parray
int
ACE::get_ip_interfaces (size_t &count,
ACE_INET_Addr *&addrs)
{
ACE_TRACE ("ACE::get_ip_interfaces");
count = 0;
addrs = 0;
#if defined (ACE_WIN32)
// Win32 can do this by a simple API call if MSVC 5 or later is the compiler.
// Not sure if Borland supplies the needed header/lib, but it might.
# if defined (ACE_HAS_WINSOCK2) && (ACE_HAS_WINSOCK2 != 0)
#if 0
// If this also needs to be predicated on MSVC 5 or later, add the
// following condition to the #if above. It tests ok at Riverace w/ 4.2,
// but this isn't a virgin install of 4.2 so there's a minimal risk that
// it may need work later.
defined (_MSC_VER) && (_MSC_VER >= 1100)
#endif /* 0 */
int i, n_interfaces, status;
INTERFACE_INFO info[64];
LPINTERFACE_INFO lpii;
SOCKET sock;
// Get an (overlapped) DGRAM socket to test with
sock = socket (AF_INET, SOCK_DGRAM, 0);
if (sock == INVALID_SOCKET)
return -1;
DWORD bytes;
status = WSAIoctl(sock,
SIO_GET_INTERFACE_LIST,
0, 0,
info, sizeof(info),
&bytes,
0,
0);
closesocket (sock);
if (status == SOCKET_ERROR)
return -1;
n_interfaces = bytes / sizeof(INTERFACE_INFO);
if (n_interfaces == 0)
return 0;
ACE_NEW_RETURN (addrs,
ACE_INET_Addr[n_interfaces],
-1);
// Now go through the list and transfer the good ones to the list of
// because they're down or don't have an IP address.
for (count = 0, i = 0; i < n_interfaces; i++)
{
struct sockaddr_in *addrp;
lpii = &info[i];
if (!(lpii->iiFlags & IFF_UP))
continue;
// We assume IPv4 addresses here
addrp = ACE_reinterpret_cast(struct sockaddr_in *, &(lpii->iiAddress));
if (addrp->sin_addr.s_addr == INADDR_ANY)
continue;
// Set the address for the caller.
addrs[count].set(addrp, sizeof(lpii->iiAddress));
++count;
}
if (count == 0)
{
delete [] addrs;
addrs = 0;
}
return 0;
#else /* Winsock 2 && MSVC 5 or later */
// PharLap ETS has kernel routines to rummage through the device
// configs and extract the interface info. Sort of a pain in the
// butt, but better than trying to figure out where it moved to in
// the registry... :-|
# if defined (ACE_HAS_PHARLAP)
# if !defined (ACE_HAS_PHARLAP_RT)
ACE_NOTSUP_RETURN (-1);
# endif /* ACE_HAS_PHARLAP_RT */
// Locate all of the IP devices in the system, saving a DEVHANDLE
// for each. Then allocate the ACE_INET_Addrs needed and fetch all
// the IP addresses. To locate the devices, try the available
// device name roots and increment the device number until the
// kernel says there are no more of that type.
const size_t ACE_MAX_ETS_DEVICES = 64; // Arbitrary, but should be enough.
DEVHANDLE ip_dev[ACE_MAX_ETS_DEVICES];
EK_TCPIPCFG *devp;
size_t i, j;
char dev_name[16];
count = 0;
for (i = 0; count < ACE_MAX_ETS_DEVICES; i++, ++count)
{
// Ethernet.
ACE_OS::sprintf (dev_name,
"ether%d",
i);
ip_dev[count] = EtsTCPGetDeviceHandle (dev_name);
if (ip_dev[count] == 0)
break;
}
for (i = 0; count < ACE_MAX_ETS_DEVICES; i++, ++count)
{
// SLIP.
ACE_OS::sprintf (dev_name,
"sl%d",
i);
ip_dev[count] = EtsTCPGetDeviceHandle (dev_name);
if (ip_dev[count] == 0)
break;
}
for (i = 0; count < ACE_MAX_ETS_DEVICES; i++, ++count)
{
// PPP.
ACE_OS::sprintf (dev_name,
"ppp%d",
i);
ip_dev[count] = EtsTCPGetDeviceHandle (dev_name);
if (ip_dev[count] == 0)
break;
}
if (count > 0)
ACE_NEW_RETURN (addrs,
ACE_INET_Addr[count],
-1);
else
addrs = 0;
for (i = 0, j = 0; i < count; i++)
{
devp = EtsTCPGetDeviceCfg (ip_dev[i]);
if (devp != 0)
{
addrs[j].set (0,
devp->nwIPAddress,
0); // Already in net order.
j++;
}
// There's no call to close the DEVHANDLE.
}
count = j;
if (count == 0 && addrs != 0)
{
delete [] addrs;
addrs = 0;
}
return 0;
# else /* ACE_HAS_PHARLAP */
const TCHAR *SVCS_KEY1 =
ACE_TEXT ("SYSTEM\\CurrentControlSet\\Services\\");
const TCHAR *LINKAGE_KEY1 =
ACE_TEXT ("SYSTEM\\CurrentControlSet\\Services\\Tcpip\\Linkage");
const TCHAR *TCP_PARAM_SUBKEY = ACE_TEXT ("\\Parameters\\Tcpip");
const TCHAR *BIND_NAME_ID = ACE_TEXT ("Bind");
const TCHAR *IPADDR_NAME_ID = ACE_TEXT ("IPAddress");
const TCHAR *INVALID_TCPIP_DEVICE_ADDR = ACE_TEXT ("0.0.0.0");
TCHAR raw_buffer[ACE_MAX_FULLY_QUALIFIED_NAME_LEN + 1];
DWORD raw_buflen = ACE_MAX_FULLY_QUALIFIED_NAME_LEN + 1;
TCHAR buffer[ACE_MAX_FULLY_QUALIFIED_NAME_LEN + 1];
DWORD buf_len = ACE_MAX_FULLY_QUALIFIED_NAME_LEN + 1;
if (::get_reg_value (LINKAGE_KEY1,
BIND_NAME_ID,
raw_buffer,
raw_buflen))
return -1;
// return buffer contains 0 delimited strings
ACE_Tokenizer dev_names (raw_buffer);
dev_names.delimiter (ACE_TEXT('\0'));
int n_interfaces = 0;
// Count the number of interfaces
while (dev_names.next () != 0)
n_interfaces ++;
// case 1. no interfaces present, empty string? OS version change?
if (n_interfaces == 0)
return 0;
ACE_NEW_RETURN (addrs,
ACE_INET_Addr[n_interfaces],
-2);
count = 0;
for (int i = 0; i < n_interfaces; i++)
{
// a. construct name to access IPAddress for this interface
ACE_TEXT_STRING ifdevkey (SVCS_KEY1);
ACE_TEXT_STRING the_dev = dev_names.next ();
// chop off the "\Device" and keep last name.
if (the_dev.length() < 8)
return -3; // Something's wrong
else
{
// rest of string from offset 8
the_dev = the_dev.substring (8);
ifdevkey += the_dev;
ifdevkey += TCP_PARAM_SUBKEY;
// b. extract value
// Gets overwritten on each call
buf_len = sizeof(buffer);
if (get_reg_value (ifdevkey.fast_rep (),
IPADDR_NAME_ID,
buffer,
buf_len))
return -4;
if (ACE_OS::strcmp (buffer,
INVALID_TCPIP_DEVICE_ADDR) == 0)
continue; // Don't count this device
// c. store in hostinfo object array and up the counter
addrs[count++] =
ACE_INET_Addr ((u_short) 0,
ASYS_MULTIBYTE_STRING (buffer));
}
}
return 0;
# endif /* ACE_HAS_PHARLAP */
# endif /* Winsock 2 && MSVC 5 or later */
#elif defined (__unix) || defined (__Lynx__) || defined (_AIX)
// COMMON (SVR4 and BSD) UNIX CODE
size_t num_ifs;
// Call specific routine as necessary.
ACE_HANDLE handle = get_handle();
if (handle == ACE_INVALID_HANDLE)
ACE_ERROR_RETURN ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("ACE::get_ip_interfaces:open")),
-1);
if (ACE::count_interfaces (handle, num_ifs))
{
ACE_OS::close (handle);
return -1;
}
// ioctl likes to have an extra ifreq structure to mark the end of
// what it returned, so increase the num_ifs by one.
++num_ifs;
struct ifreq *ifs = 0;
ACE_NEW_RETURN (ifs,
struct ifreq[num_ifs],
-1);
ACE_OS::memset (ifs, 0, num_ifs * sizeof (struct ifreq));
ACE_Auto_Array_Ptr<struct ifreq> p_ifs (ifs);
if (p_ifs.get() == 0)
{
ACE_OS::close (handle);
errno = ENOMEM;
return -1;
}
struct ifconf ifcfg;
ACE_OS::memset (&ifcfg, 0, sizeof (struct ifconf));
ifcfg.ifc_req = p_ifs.get ();
ifcfg.ifc_len = num_ifs * sizeof (struct ifreq);
#if defined (AIX)
int cmd = CSIOCGIFCONF;
#else
int cmd = SIOCGIFCONF;
#endif /* AIX */
if (ACE_OS::ioctl (handle,
cmd,
(caddr_t) &ifcfg) == -1)
{
ACE_OS::close (handle);
ACE_ERROR_RETURN ((LM_ERROR,
ASYS_TEXT ("%p\n"),
ASYS_TEXT ("is_address_local:")
ASYS_TEXT ("ioctl - SIOCGIFCONF failed")),
-1);
}
ACE_OS::close (handle);
// Now create and initialize output array.
ACE_NEW_RETURN (addrs,
ACE_INET_Addr[num_ifs],
-1); // caller must free
struct ifreq *pcur = p_ifs.get ();
// Pull the address out of each INET interface. Not every interface
// is for IP, so be careful to count properly. When setting the
// INET_Addr, note that the 3rd arg (0) says to leave the byte order
// (already in net byte order from the interface structure) as is.
count = 0;
for (size_t i = 0;
i < num_ifs;
i++)
{
if (pcur->ifr_addr.sa_family == AF_INET)
{
#if !defined(_UNICOS)
struct sockaddr_in *addr =
ACE_reinterpret_cast(sockaddr_in *, &pcur->ifr_addr);
// Sometimes the kernel returns 0.0.0.0 as the interface
// address, skip those...
if (addr->sin_addr.s_addr != 0)
{
addrs[count].set ((u_short) 0,
addr->sin_addr.s_addr,
0);
count++;
}
#else /* ! _UNICOS */
// need to explicitly copy on the Cray, since the bitfields kinda
// screw things up here
struct sockaddr_in inAddr;
inAddr.sin_len = pcur->ifr_addr.sa_len;
inAddr.sin_family = pcur->ifr_addr.sa_family;
memcpy((void *)&(inAddr.sin_addr),
(const void *)&(pcur->ifr_addr.sa_data[8]),
sizeof(struct in_addr));
if (inAddr.sin_addr.s_addr != 0)
{
addrs[count].set(&inAddr, sizeof(struct sockaddr_in));
count++;
}
#endif /* ! _UNICOS */
}
pcur++;
}
return 0;
#else
ACE_UNUSED_ARG (count);
ACE_UNUSED_ARG (addrs);
ACE_NOTSUP_RETURN (-1);; // no implementation
#endif /* ACE_WIN32 */
}
char *
ACE::strndup (const char *str, size_t n)
{
const char *t = str;
size_t len;
// Figure out how long this string is (remember, it might not be
// NUL-terminated).
for (len = 0;
len < n && *t++ != '\0';
len++)
continue;
char *s;
ACE_ALLOCATOR_RETURN (s,
(char *) ACE_OS::malloc (len + 1),
0);
s[len] = '\0';
return ACE_OS::strncpy (s, str, len);
}
char *
ACE::strnnew (const char *str, size_t n)
{
const char *t = str;
size_t len;
// Figure out how long this string is (remember, it might not be
// NUL-terminated).
for (len = 0;
len < n && *t++ != '\0';
len++)
continue;
char *s;
ACE_NEW_RETURN (s,
char[len + 1],
0);
s[len] = '\0';
return ACE_OS::strncpy (s, str, len);
}
const char *
ACE::strend (const char *s)
{
while (*s++ != '\0')
continue;
return s;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION) && (defined (__unix) || defined (__Lynx__) || defined (_AIX))
template class ACE_Auto_Array_Ptr<struct ifreq>;
template class ACE_Auto_Basic_Array_Ptr<struct ifreq>;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#pragma instantiate ACE_Auto_Array_Ptr<struct ifreq>
#pragma instantiate ACE_Auto_Basic_Array_Ptr<struct ifreq>
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION && (__unix || __Lynx_) */
|